From b81382d359de81af87e4419f5c62ba1a280053ac Mon Sep 17 00:00:00 2001 From: AbigailDeng Date: Thu, 7 Dec 2023 10:38:58 +0800 Subject: [PATCH] feat: gitignore --- .gitignore | 2 + dist/aelf.cjs.js | 40092 ----------------------------------------- dist/aelf.cjs.js.map | 1 - dist/aelf.umd.js | 3 - dist/aelf.umd.js.map | 1 - 5 files changed, 2 insertions(+), 40097 deletions(-) delete mode 100644 dist/aelf.cjs.js delete mode 100644 dist/aelf.cjs.js.map delete mode 100644 dist/aelf.umd.js delete mode 100644 dist/aelf.umd.js.map diff --git a/.gitignore b/.gitignore index 8d90af7b..b66ba2e4 100644 --- a/.gitignore +++ b/.gitignore @@ -227,3 +227,5 @@ typings/ .vscode aelf.umd.js.LICENSE.txt + +dist \ No newline at end of file diff --git a/dist/aelf.cjs.js b/dist/aelf.cjs.js deleted file mode 100644 index 71b31215..00000000 --- a/dist/aelf.cjs.js +++ /dev/null @@ -1,40092 +0,0 @@ -/*! - * aelf-sdk.js v3.2.45-beta.1 - * (c) 2019-2023 AElf - * Released under MIT License - */ -/******/ (() => { // webpackBootstrap -/******/ var __webpack_modules__ = ([ -/* 0 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -/** - * Various utility functions. - * @namespace - */ -var util = module.exports = __webpack_require__(5); - -var roots = __webpack_require__(41); - -var Type, // cyclic - Enum; - -util.codegen = __webpack_require__(88); -util.fetch = __webpack_require__(89); -util.path = __webpack_require__(90); - -/** - * Node's fs module if available. - * @type {Object.} - */ -util.fs = util.inquire("fs"); - -/** - * Converts an object's values to an array. - * @param {Object.} object Object to convert - * @returns {Array.<*>} Converted array - */ -util.toArray = function toArray(object) { - if (object) { - var keys = Object.keys(object), - array = new Array(keys.length), - index = 0; - while (index < keys.length) - array[index] = object[keys[index++]]; - return array; - } - return []; -}; - -/** - * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values. - * @param {Array.<*>} array Array to convert - * @returns {Object.} Converted object - */ -util.toObject = function toObject(array) { - var object = {}, - index = 0; - while (index < array.length) { - var key = array[index++], - val = array[index++]; - if (val !== undefined) - object[key] = val; - } - return object; -}; - -var safePropBackslashRe = /\\/g, - safePropQuoteRe = /"/g; - -/** - * Tests whether the specified name is a reserved word in JS. - * @param {string} name Name to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -util.isReserved = function isReserved(name) { - return /^(?:do|if|in|for|let|new|try|var|case|else|enum|eval|false|null|this|true|void|with|break|catch|class|const|super|throw|while|yield|delete|export|import|public|return|static|switch|typeof|default|extends|finally|package|private|continue|debugger|function|arguments|interface|protected|implements|instanceof)$/.test(name); -}; - -/** - * Returns a safe property accessor for the specified property name. - * @param {string} prop Property name - * @returns {string} Safe accessor - */ -util.safeProp = function safeProp(prop) { - if (!/^[$\w_]+$/.test(prop) || util.isReserved(prop)) - return "[\"" + prop.replace(safePropBackslashRe, "\\\\").replace(safePropQuoteRe, "\\\"") + "\"]"; - return "." + prop; -}; - -/** - * Converts the first character of a string to upper case. - * @param {string} str String to convert - * @returns {string} Converted string - */ -util.ucFirst = function ucFirst(str) { - return str.charAt(0).toUpperCase() + str.substring(1); -}; - -var camelCaseRe = /_([a-z])/g; - -/** - * Converts a string to camel case. - * @param {string} str String to convert - * @returns {string} Converted string - */ -util.camelCase = function camelCase(str) { - return str.substring(0, 1) - + str.substring(1) - .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); }); -}; - -/** - * Compares reflected fields by id. - * @param {Field} a First field - * @param {Field} b Second field - * @returns {number} Comparison value - */ -util.compareFieldsById = function compareFieldsById(a, b) { - return a.id - b.id; -}; - -/** - * Decorator helper for types (TypeScript). - * @param {Constructor} ctor Constructor function - * @param {string} [typeName] Type name, defaults to the constructor's name - * @returns {Type} Reflected type - * @template T extends Message - * @property {Root} root Decorators root - */ -util.decorateType = function decorateType(ctor, typeName) { - - /* istanbul ignore if */ - if (ctor.$type) { - if (typeName && ctor.$type.name !== typeName) { - util.decorateRoot.remove(ctor.$type); - ctor.$type.name = typeName; - util.decorateRoot.add(ctor.$type); - } - return ctor.$type; - } - - /* istanbul ignore next */ - if (!Type) - Type = __webpack_require__(23); - - var type = new Type(typeName || ctor.name); - util.decorateRoot.add(type); - type.ctor = ctor; // sets up .encode, .decode etc. - Object.defineProperty(ctor, "$type", { value: type, enumerable: false }); - Object.defineProperty(ctor.prototype, "$type", { value: type, enumerable: false }); - return type; -}; - -var decorateEnumIndex = 0; - -/** - * Decorator helper for enums (TypeScript). - * @param {Object} object Enum object - * @returns {Enum} Reflected enum - */ -util.decorateEnum = function decorateEnum(object) { - - /* istanbul ignore if */ - if (object.$type) - return object.$type; - - /* istanbul ignore next */ - if (!Enum) - Enum = __webpack_require__(3); - - var enm = new Enum("Enum" + decorateEnumIndex++, object); - util.decorateRoot.add(enm); - Object.defineProperty(object, "$type", { value: enm, enumerable: false }); - return enm; -}; - -/** - * Decorator root (TypeScript). - * @name util.decorateRoot - * @type {Root} - * @readonly - */ -Object.defineProperty(util, "decorateRoot", { - get: function() { - return roots["decorated"] || (roots["decorated"] = new (__webpack_require__(28))()); - } -}); - - -/***/ }), -/* 1 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = exports; -var BN = __webpack_require__(2); -var minAssert = __webpack_require__(12); -var minUtils = __webpack_require__(49); - -utils.assert = minAssert; -utils.toArray = minUtils.toArray; -utils.zero2 = minUtils.zero2; -utils.toHex = minUtils.toHex; -utils.encode = minUtils.encode; - -// Represent num in a w-NAF form -function getNAF(num, w, bits) { - var naf = new Array(Math.max(num.bitLength(), bits) + 1); - naf.fill(0); - - var ws = 1 << (w + 1); - var k = num.clone(); - - for (var i = 0; i < naf.length; i++) { - var z; - var mod = k.andln(ws - 1); - if (k.isOdd()) { - if (mod > (ws >> 1) - 1) - z = (ws >> 1) - mod; - else - z = mod; - k.isubn(z); - } else { - z = 0; - } - - naf[i] = z; - k.iushrn(1); - } - - return naf; -} -utils.getNAF = getNAF; - -// Represent k1, k2 in a Joint Sparse Form -function getJSF(k1, k2) { - var jsf = [ - [], - [], - ]; - - k1 = k1.clone(); - k2 = k2.clone(); - var d1 = 0; - var d2 = 0; - var m8; - while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) { - // First phase - var m14 = (k1.andln(3) + d1) & 3; - var m24 = (k2.andln(3) + d2) & 3; - if (m14 === 3) - m14 = -1; - if (m24 === 3) - m24 = -1; - var u1; - if ((m14 & 1) === 0) { - u1 = 0; - } else { - m8 = (k1.andln(7) + d1) & 7; - if ((m8 === 3 || m8 === 5) && m24 === 2) - u1 = -m14; - else - u1 = m14; - } - jsf[0].push(u1); - - var u2; - if ((m24 & 1) === 0) { - u2 = 0; - } else { - m8 = (k2.andln(7) + d2) & 7; - if ((m8 === 3 || m8 === 5) && m14 === 2) - u2 = -m24; - else - u2 = m24; - } - jsf[1].push(u2); - - // Second phase - if (2 * d1 === u1 + 1) - d1 = 1 - d1; - if (2 * d2 === u2 + 1) - d2 = 1 - d2; - k1.iushrn(1); - k2.iushrn(1); - } - - return jsf; -} -utils.getJSF = getJSF; - -function cachedProperty(obj, name, computer) { - var key = '_' + name; - obj.prototype[name] = function cachedProperty() { - return this[key] !== undefined ? this[key] : - this[key] = computer.call(this); - }; -} -utils.cachedProperty = cachedProperty; - -function parseBytes(bytes) { - return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') : - bytes; -} -utils.parseBytes = parseBytes; - -function intFromLE(bytes) { - return new BN(bytes, 'hex', 'le'); -} -utils.intFromLE = intFromLE; - - - -/***/ }), -/* 2 */ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = (__webpack_require__(10).Buffer); - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - var zeros = [ - '', - '0', - '00', - '000', - '0000', - '00000', - '000000', - '0000000', - '00000000', - '000000000', - '0000000000', - '00000000000', - '000000000000', - '0000000000000', - '00000000000000', - '000000000000000', - '0000000000000000', - '00000000000000000', - '000000000000000000', - '0000000000000000000', - '00000000000000000000', - '000000000000000000000', - '0000000000000000000000', - '00000000000000000000000', - '000000000000000000000000', - '0000000000000000000000000' - ]; - - var groupSizes = [ - 0, 0, - 25, 16, 12, 11, 10, 9, 8, - 8, 7, 7, 7, 7, 6, 6, - 6, 6, 6, 6, 6, 5, 5, - 5, 5, 5, 5, 5, 5, 5, - 5, 5, 5, 5, 5, 5, 5 - ]; - - var groupBases = [ - 0, 0, - 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, - 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625, - 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632, - 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149, - 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - var qj = (a.words[b.length + j] | 0) * 0x4000000 + - (a.words[b.length + j - 1] | 0); - - // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), -/* 3 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Enum; - -// extends ReflectionObject -var ReflectionObject = __webpack_require__(13); -((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = "Enum"; - -var Namespace = __webpack_require__(16), - util = __webpack_require__(0); - -/** - * Constructs a new enum instance. - * @classdesc Reflected enum. - * @extends ReflectionObject - * @constructor - * @param {string} name Unique name within its namespace - * @param {Object.} [values] Enum values as an object, by name - * @param {Object.} [options] Declared options - * @param {string} [comment] The comment for this enum - * @param {Object.} [comments] The value comments for this enum - */ -function Enum(name, values, options, comment, comments) { - ReflectionObject.call(this, name, options); - - if (values && typeof values !== "object") - throw TypeError("values must be an object"); - - /** - * Enum values by id. - * @type {Object.} - */ - this.valuesById = {}; - - /** - * Enum values by name. - * @type {Object.} - */ - this.values = Object.create(this.valuesById); // toJSON, marker - - /** - * Enum comment text. - * @type {string|null} - */ - this.comment = comment; - - /** - * Value comment texts, if any. - * @type {Object.} - */ - this.comments = comments || {}; - - /** - * Reserved ranges, if any. - * @type {Array.} - */ - this.reserved = undefined; // toJSON - - // Note that values inherit valuesById on their prototype which makes them a TypeScript- - // compatible enum. This is used by pbts to write actual enum definitions that work for - // static and reflection code alike instead of emitting generic object definitions. - - if (values) - for (var keys = Object.keys(values), i = 0; i < keys.length; ++i) - if (typeof values[keys[i]] === "number") // use forward entries only - this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i]; -} - -/** - * Enum descriptor. - * @interface IEnum - * @property {Object.} values Enum values - * @property {Object.} [options] Enum options - */ - -/** - * Constructs an enum from an enum descriptor. - * @param {string} name Enum name - * @param {IEnum} json Enum descriptor - * @returns {Enum} Created enum - * @throws {TypeError} If arguments are invalid - */ -Enum.fromJSON = function fromJSON(name, json) { - var enm = new Enum(name, json.values, json.options, json.comment, json.comments); - enm.reserved = json.reserved; - return enm; -}; - -/** - * Converts this enum to an enum descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IEnum} Enum descriptor - */ -Enum.prototype.toJSON = function toJSON(toJSONOptions) { - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "options" , this.options, - "values" , this.values, - "reserved" , this.reserved && this.reserved.length ? this.reserved : undefined, - "comment" , keepComments ? this.comment : undefined, - "comments" , keepComments ? this.comments : undefined - ]); -}; - -/** - * Adds a value to this enum. - * @param {string} name Value name - * @param {number} id Value id - * @param {string} [comment] Comment, if any - * @returns {Enum} `this` - * @throws {TypeError} If arguments are invalid - * @throws {Error} If there is already a value with this name or id - */ -Enum.prototype.add = function add(name, id, comment) { - // utilized by the parser but not by .fromJSON - - if (!util.isString(name)) - throw TypeError("name must be a string"); - - if (!util.isInteger(id)) - throw TypeError("id must be an integer"); - - if (this.values[name] !== undefined) - throw Error("duplicate name '" + name + "' in " + this); - - if (this.isReservedId(id)) - throw Error("id " + id + " is reserved in " + this); - - if (this.isReservedName(name)) - throw Error("name '" + name + "' is reserved in " + this); - - if (this.valuesById[id] !== undefined) { - if (!(this.options && this.options.allow_alias)) - throw Error("duplicate id " + id + " in " + this); - this.values[name] = id; - } else - this.valuesById[this.values[name] = id] = name; - - this.comments[name] = comment || null; - return this; -}; - -/** - * Removes a value from this enum - * @param {string} name Value name - * @returns {Enum} `this` - * @throws {TypeError} If arguments are invalid - * @throws {Error} If `name` is not a name of this enum - */ -Enum.prototype.remove = function remove(name) { - - if (!util.isString(name)) - throw TypeError("name must be a string"); - - var val = this.values[name]; - if (val == null) - throw Error("name '" + name + "' does not exist in " + this); - - delete this.valuesById[val]; - delete this.values[name]; - delete this.comments[name]; - - return this; -}; - -/** - * Tests if the specified id is reserved. - * @param {number} id Id to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -Enum.prototype.isReservedId = function isReservedId(id) { - return Namespace.isReservedId(this.reserved, id); -}; - -/** - * Tests if the specified name is reserved. - * @param {string} name Name to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -Enum.prototype.isReservedName = function isReservedName(name) { - return Namespace.isReservedName(this.reserved, name); -}; - - -/***/ }), -/* 4 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("crypto"); - -/***/ }), -/* 5 */ -/***/ (function(__unused_webpack_module, exports, __webpack_require__) { - -"use strict"; - -var util = exports; - -// used to return a Promise where callback is omitted -util.asPromise = __webpack_require__(38); - -// converts to / from base64 encoded strings -util.base64 = __webpack_require__(79); - -// base class of rpc.Service -util.EventEmitter = __webpack_require__(80); - -// float handling accross browsers -util.float = __webpack_require__(81); - -// requires modules optionally and hides the call from bundlers -util.inquire = __webpack_require__(39); - -// converts to / from utf8 encoded strings -util.utf8 = __webpack_require__(82); - -// provides a node-like buffer pool in the browser -util.pool = __webpack_require__(83); - -// utility to work with the low and high bits of a 64 bit value -util.LongBits = __webpack_require__(84); - -// global object reference -util.global = typeof window !== "undefined" && window - || typeof global !== "undefined" && global - || typeof self !== "undefined" && self - || this; // eslint-disable-line no-invalid-this - -/** - * An immuable empty array. - * @memberof util - * @type {Array.<*>} - * @const - */ -util.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes - -/** - * An immutable empty object. - * @type {Object} - * @const - */ -util.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes - -/** - * Whether running within node or not. - * @memberof util - * @type {boolean} - * @const - */ -util.isNode = Boolean(util.global.process && util.global.process.versions && util.global.process.versions.node); - -/** - * Tests if the specified value is an integer. - * @function - * @param {*} value Value to test - * @returns {boolean} `true` if the value is an integer - */ -util.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) { - return typeof value === "number" && isFinite(value) && Math.floor(value) === value; -}; - -/** - * Tests if the specified value is a string. - * @param {*} value Value to test - * @returns {boolean} `true` if the value is a string - */ -util.isString = function isString(value) { - return typeof value === "string" || value instanceof String; -}; - -/** - * Tests if the specified value is a non-null object. - * @param {*} value Value to test - * @returns {boolean} `true` if the value is a non-null object - */ -util.isObject = function isObject(value) { - return value && typeof value === "object"; -}; - -/** - * Checks if a property on a message is considered to be present. - * This is an alias of {@link util.isSet}. - * @function - * @param {Object} obj Plain object or message instance - * @param {string} prop Property name - * @returns {boolean} `true` if considered to be present, otherwise `false` - */ -util.isset = - -/** - * Checks if a property on a message is considered to be present. - * @param {Object} obj Plain object or message instance - * @param {string} prop Property name - * @returns {boolean} `true` if considered to be present, otherwise `false` - */ -util.isSet = function isSet(obj, prop) { - var value = obj[prop]; - if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins - return typeof value !== "object" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0; - return false; -}; - -/** - * Any compatible Buffer instance. - * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings. - * @interface Buffer - * @extends Uint8Array - */ -// 纯粹为了解决问题做的 -util.BufferTemp = (__webpack_require__(10).Buffer); -/** - * Node's Buffer class if available. - * @type {Constructor} - */ -util.Buffer = (function() { - try { - var Buffer = util.inquire("buffer").Buffer; - // refuse to use non-node buffers if not explicitly assigned (perf reasons): - return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null; - } catch (e) { - /* istanbul ignore next */ - return null; - } -})(); - -// Internal alias of or polyfull for Buffer.from. -util._Buffer_from = null; - -// Internal alias of or polyfill for Buffer.allocUnsafe. -util._Buffer_allocUnsafe = null; - -/** - * Creates a new buffer of whatever type supported by the environment. - * @param {number|number[]} [sizeOrArray=0] Buffer size or number array - * @returns {Uint8Array|Buffer} Buffer - */ -util.newBuffer = function newBuffer(sizeOrArray) { - /* istanbul ignore next */ - return typeof sizeOrArray === "number" - ? util.Buffer - ? util._Buffer_allocUnsafe(sizeOrArray) - : new util.Array(sizeOrArray) - : util.Buffer - ? util._Buffer_from(sizeOrArray) - : typeof Uint8Array === "undefined" - ? sizeOrArray - : new Uint8Array(sizeOrArray); -}; - -/** - * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`. - * @type {Constructor} - */ -util.Array = typeof Uint8Array !== "undefined" ? Uint8Array /* istanbul ignore next */ : Array; - -/** - * Any compatible Long instance. - * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js. - * @interface Long - * @property {number} low Low bits - * @property {number} high High bits - * @property {boolean} unsigned Whether unsigned or not - */ - -/** - * Long.js's Long class if available. - * @type {Constructor} - */ -util.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long - || /* istanbul ignore next */ util.global.Long - || util.inquire("long"); - -/** - * Regular expression used to verify 2 bit (`bool`) map keys. - * @type {RegExp} - * @const - */ -util.key2Re = /^true|false|0|1$/; - -/** - * Regular expression used to verify 32 bit (`int32` etc.) map keys. - * @type {RegExp} - * @const - */ -util.key32Re = /^-?(?:0|[1-9][0-9]*)$/; - -/** - * Regular expression used to verify 64 bit (`int64` etc.) map keys. - * @type {RegExp} - * @const - */ -util.key64Re = /^(?:[\\x00-\\xff]{8}|-?(?:0|[1-9][0-9]*))$/; - -/** - * Converts a number or long to an 8 characters long hash string. - * @param {Long|number} value Value to convert - * @returns {string} Hash - */ -util.longToHash = function longToHash(value) { - return value - ? util.LongBits.from(value).toHash() - : util.LongBits.zeroHash; -}; - -/** - * Converts an 8 characters long hash string to a long or number. - * @param {string} hash Hash - * @param {boolean} [unsigned=false] Whether unsigned or not - * @returns {Long|number} Original value - */ -util.longFromHash = function longFromHash(hash, unsigned) { - var bits = util.LongBits.fromHash(hash); - if (util.Long) - return util.Long.fromBits(bits.lo, bits.hi, unsigned); - return bits.toNumber(Boolean(unsigned)); -}; - -/** - * Merges the properties of the source object into the destination object. - * @memberof util - * @param {Object.} dst Destination object - * @param {Object.} src Source object - * @param {boolean} [ifNotSet=false] Merges only if the key is not already set - * @returns {Object.} Destination object - */ -function merge(dst, src, ifNotSet) { // used by converters - for (var keys = Object.keys(src), i = 0; i < keys.length; ++i) - if (dst[keys[i]] === undefined || !ifNotSet) - dst[keys[i]] = src[keys[i]]; - return dst; -} - -util.merge = merge; - -/** - * Converts the first character of a string to lower case. - * @param {string} str String to convert - * @returns {string} Converted string - */ -util.lcFirst = function lcFirst(str) { - return str.charAt(0).toLowerCase() + str.substring(1); -}; - -/** - * Creates a custom error constructor. - * @memberof util - * @param {string} name Error name - * @returns {Constructor} Custom error constructor - */ -function newError(name) { - - function CustomError(message, properties) { - - if (!(this instanceof CustomError)) - return new CustomError(message, properties); - - // Error.call(this, message); - // ^ just returns a new error instance because the ctor can be called as a function - - Object.defineProperty(this, "message", { get: function() { return message; } }); - - /* istanbul ignore next */ - if (Error.captureStackTrace) // node - Error.captureStackTrace(this, CustomError); - else - Object.defineProperty(this, "stack", { value: (new Error()).stack || "" }); - - if (properties) - merge(this, properties); - } - - (CustomError.prototype = Object.create(Error.prototype)).constructor = CustomError; - - Object.defineProperty(CustomError.prototype, "name", { get: function() { return name; } }); - - CustomError.prototype.toString = function toString() { - return this.name + ": " + this.message; - }; - - return CustomError; -} - -util.newError = newError; - -/** - * Constructs a new protocol error. - * @classdesc Error subclass indicating a protocol specifc error. - * @memberof util - * @extends Error - * @template T extends Message - * @constructor - * @param {string} message Error message - * @param {Object.} [properties] Additional properties - * @example - * try { - * MyMessage.decode(someBuffer); // throws if required fields are missing - * } catch (e) { - * if (e instanceof ProtocolError && e.instance) - * console.log("decoded so far: " + JSON.stringify(e.instance)); - * } - */ -util.ProtocolError = newError("ProtocolError"); - -/** - * So far decoded message instance. - * @name util.ProtocolError#instance - * @type {Message} - */ - -/** - * A OneOf getter as returned by {@link util.oneOfGetter}. - * @typedef OneOfGetter - * @type {function} - * @returns {string|undefined} Set field name, if any - */ - -/** - * Builds a getter for a oneof's present field name. - * @param {string[]} fieldNames Field names - * @returns {OneOfGetter} Unbound getter - */ -util.oneOfGetter = function getOneOf(fieldNames) { - var fieldMap = {}; - for (var i = 0; i < fieldNames.length; ++i) - fieldMap[fieldNames[i]] = 1; - - /** - * @returns {string|undefined} Set field name, if any - * @this Object - * @ignore - */ - return function() { // eslint-disable-line consistent-return - for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i) - if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null) - return keys[i]; - }; -}; - -/** - * A OneOf setter as returned by {@link util.oneOfSetter}. - * @typedef OneOfSetter - * @type {function} - * @param {string|undefined} value Field name - * @returns {undefined} - */ - -/** - * Builds a setter for a oneof's present field name. - * @param {string[]} fieldNames Field names - * @returns {OneOfSetter} Unbound setter - */ -util.oneOfSetter = function setOneOf(fieldNames) { - - /** - * @param {string} name Field name - * @returns {undefined} - * @this Object - * @ignore - */ - return function(name) { - for (var i = 0; i < fieldNames.length; ++i) - if (fieldNames[i] !== name) - delete this[fieldNames[i]]; - }; -}; - -/** - * Default conversion options used for {@link Message#toJSON} implementations. - * - * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely: - * - * - Longs become strings - * - Enums become string keys - * - Bytes become base64 encoded strings - * - (Sub-)Messages become plain objects - * - Maps become plain objects with all string keys - * - Repeated fields become arrays - * - NaN and Infinity for float and double fields become strings - * - * @type {IConversionOptions} - * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json - */ -util.toJSONOptions = { - longs: String, - enums: String, - bytes: String, - json: true -}; - -// Sets up buffer utility according to the environment (called in index-minimal) -util._configure = function() { - var Buffer = util.Buffer; - /* istanbul ignore if */ - if (!Buffer) { - // util._Buffer_from = util._Buffer_allocUnsafe = null; - util._Buffer_from = null; - util._Buffer_allocUnsafe = function Buffer_allocUnsafe(size) { - return new util.BufferTemp(size); - }; - return; - } - // because node 4.x buffers are incompatible & immutable - // see: https://github.com/dcodeIO/protobuf.js/pull/665 - util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from || - /* istanbul ignore next */ - function Buffer_from(value, encoding) { - return new Buffer(value, encoding); - }; - util._Buffer_allocUnsafe = Buffer.allocUnsafe || - /* istanbul ignore next */ - function Buffer_allocUnsafe(size) { - return new Buffer(size); - }; -}; - - -/***/ }), -/* 6 */ -/***/ ((module, exports, __webpack_require__) => { - -/*! safe-buffer. MIT License. Feross Aboukhadijeh */ -/* eslint-disable node/no-deprecated-api */ -var buffer = __webpack_require__(10) -var Buffer = buffer.Buffer - -// alternative to using Object.keys for old browsers -function copyProps (src, dst) { - for (var key in src) { - dst[key] = src[key] - } -} -if (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) { - module.exports = buffer -} else { - // Copy properties from require('buffer') - copyProps(buffer, exports) - exports.Buffer = SafeBuffer -} - -function SafeBuffer (arg, encodingOrOffset, length) { - return Buffer(arg, encodingOrOffset, length) -} - -SafeBuffer.prototype = Object.create(Buffer.prototype) - -// Copy static methods from Buffer -copyProps(Buffer, SafeBuffer) - -SafeBuffer.from = function (arg, encodingOrOffset, length) { - if (typeof arg === 'number') { - throw new TypeError('Argument must not be a number') - } - return Buffer(arg, encodingOrOffset, length) -} - -SafeBuffer.alloc = function (size, fill, encoding) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - var buf = Buffer(size) - if (fill !== undefined) { - if (typeof encoding === 'string') { - buf.fill(fill, encoding) - } else { - buf.fill(fill) - } - } else { - buf.fill(0) - } - return buf -} - -SafeBuffer.allocUnsafe = function (size) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - return Buffer(size) -} - -SafeBuffer.allocUnsafeSlow = function (size) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - return buffer.SlowBuffer(size) -} - - -/***/ }), -/* 7 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -try { - var util = __webpack_require__(29); - /* istanbul ignore next */ - if (typeof util.inherits !== 'function') throw ''; - module.exports = util.inherits; -} catch (e) { - /* istanbul ignore next */ - module.exports = __webpack_require__(75); -} - - -/***/ }), -/* 8 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var assert = __webpack_require__(12); -var inherits = __webpack_require__(7); - -exports.inherits = inherits; - -function isSurrogatePair(msg, i) { - if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) { - return false; - } - if (i < 0 || i + 1 >= msg.length) { - return false; - } - return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00; -} - -function toArray(msg, enc) { - if (Array.isArray(msg)) - return msg.slice(); - if (!msg) - return []; - var res = []; - if (typeof msg === 'string') { - if (!enc) { - // Inspired by stringToUtf8ByteArray() in closure-library by Google - // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143 - // Apache License 2.0 - // https://github.com/google/closure-library/blob/master/LICENSE - var p = 0; - for (var i = 0; i < msg.length; i++) { - var c = msg.charCodeAt(i); - if (c < 128) { - res[p++] = c; - } else if (c < 2048) { - res[p++] = (c >> 6) | 192; - res[p++] = (c & 63) | 128; - } else if (isSurrogatePair(msg, i)) { - c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF); - res[p++] = (c >> 18) | 240; - res[p++] = ((c >> 12) & 63) | 128; - res[p++] = ((c >> 6) & 63) | 128; - res[p++] = (c & 63) | 128; - } else { - res[p++] = (c >> 12) | 224; - res[p++] = ((c >> 6) & 63) | 128; - res[p++] = (c & 63) | 128; - } - } - } else if (enc === 'hex') { - msg = msg.replace(/[^a-z0-9]+/ig, ''); - if (msg.length % 2 !== 0) - msg = '0' + msg; - for (i = 0; i < msg.length; i += 2) - res.push(parseInt(msg[i] + msg[i + 1], 16)); - } - } else { - for (i = 0; i < msg.length; i++) - res[i] = msg[i] | 0; - } - return res; -} -exports.toArray = toArray; - -function toHex(msg) { - var res = ''; - for (var i = 0; i < msg.length; i++) - res += zero2(msg[i].toString(16)); - return res; -} -exports.toHex = toHex; - -function htonl(w) { - var res = (w >>> 24) | - ((w >>> 8) & 0xff00) | - ((w << 8) & 0xff0000) | - ((w & 0xff) << 24); - return res >>> 0; -} -exports.htonl = htonl; - -function toHex32(msg, endian) { - var res = ''; - for (var i = 0; i < msg.length; i++) { - var w = msg[i]; - if (endian === 'little') - w = htonl(w); - res += zero8(w.toString(16)); - } - return res; -} -exports.toHex32 = toHex32; - -function zero2(word) { - if (word.length === 1) - return '0' + word; - else - return word; -} -exports.zero2 = zero2; - -function zero8(word) { - if (word.length === 7) - return '0' + word; - else if (word.length === 6) - return '00' + word; - else if (word.length === 5) - return '000' + word; - else if (word.length === 4) - return '0000' + word; - else if (word.length === 3) - return '00000' + word; - else if (word.length === 2) - return '000000' + word; - else if (word.length === 1) - return '0000000' + word; - else - return word; -} -exports.zero8 = zero8; - -function join32(msg, start, end, endian) { - var len = end - start; - assert(len % 4 === 0); - var res = new Array(len / 4); - for (var i = 0, k = start; i < res.length; i++, k += 4) { - var w; - if (endian === 'big') - w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3]; - else - w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]; - res[i] = w >>> 0; - } - return res; -} -exports.join32 = join32; - -function split32(msg, endian) { - var res = new Array(msg.length * 4); - for (var i = 0, k = 0; i < msg.length; i++, k += 4) { - var m = msg[i]; - if (endian === 'big') { - res[k] = m >>> 24; - res[k + 1] = (m >>> 16) & 0xff; - res[k + 2] = (m >>> 8) & 0xff; - res[k + 3] = m & 0xff; - } else { - res[k + 3] = m >>> 24; - res[k + 2] = (m >>> 16) & 0xff; - res[k + 1] = (m >>> 8) & 0xff; - res[k] = m & 0xff; - } - } - return res; -} -exports.split32 = split32; - -function rotr32(w, b) { - return (w >>> b) | (w << (32 - b)); -} -exports.rotr32 = rotr32; - -function rotl32(w, b) { - return (w << b) | (w >>> (32 - b)); -} -exports.rotl32 = rotl32; - -function sum32(a, b) { - return (a + b) >>> 0; -} -exports.sum32 = sum32; - -function sum32_3(a, b, c) { - return (a + b + c) >>> 0; -} -exports.sum32_3 = sum32_3; - -function sum32_4(a, b, c, d) { - return (a + b + c + d) >>> 0; -} -exports.sum32_4 = sum32_4; - -function sum32_5(a, b, c, d, e) { - return (a + b + c + d + e) >>> 0; -} -exports.sum32_5 = sum32_5; - -function sum64(buf, pos, ah, al) { - var bh = buf[pos]; - var bl = buf[pos + 1]; - - var lo = (al + bl) >>> 0; - var hi = (lo < al ? 1 : 0) + ah + bh; - buf[pos] = hi >>> 0; - buf[pos + 1] = lo; -} -exports.sum64 = sum64; - -function sum64_hi(ah, al, bh, bl) { - var lo = (al + bl) >>> 0; - var hi = (lo < al ? 1 : 0) + ah + bh; - return hi >>> 0; -} -exports.sum64_hi = sum64_hi; - -function sum64_lo(ah, al, bh, bl) { - var lo = al + bl; - return lo >>> 0; -} -exports.sum64_lo = sum64_lo; - -function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) { - var carry = 0; - var lo = al; - lo = (lo + bl) >>> 0; - carry += lo < al ? 1 : 0; - lo = (lo + cl) >>> 0; - carry += lo < cl ? 1 : 0; - lo = (lo + dl) >>> 0; - carry += lo < dl ? 1 : 0; - - var hi = ah + bh + ch + dh + carry; - return hi >>> 0; -} -exports.sum64_4_hi = sum64_4_hi; - -function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) { - var lo = al + bl + cl + dl; - return lo >>> 0; -} -exports.sum64_4_lo = sum64_4_lo; - -function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) { - var carry = 0; - var lo = al; - lo = (lo + bl) >>> 0; - carry += lo < al ? 1 : 0; - lo = (lo + cl) >>> 0; - carry += lo < cl ? 1 : 0; - lo = (lo + dl) >>> 0; - carry += lo < dl ? 1 : 0; - lo = (lo + el) >>> 0; - carry += lo < el ? 1 : 0; - - var hi = ah + bh + ch + dh + eh + carry; - return hi >>> 0; -} -exports.sum64_5_hi = sum64_5_hi; - -function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) { - var lo = al + bl + cl + dl + el; - - return lo >>> 0; -} -exports.sum64_5_lo = sum64_5_lo; - -function rotr64_hi(ah, al, num) { - var r = (al << (32 - num)) | (ah >>> num); - return r >>> 0; -} -exports.rotr64_hi = rotr64_hi; - -function rotr64_lo(ah, al, num) { - var r = (ah << (32 - num)) | (al >>> num); - return r >>> 0; -} -exports.rotr64_lo = rotr64_lo; - -function shr64_hi(ah, al, num) { - return ah >>> num; -} -exports.shr64_hi = shr64_hi; - -function shr64_lo(ah, al, num) { - var r = (ah << (32 - num)) | (al >>> num); - return r >>> 0; -} -exports.shr64_lo = shr64_lo; - - -/***/ }), -/* 9 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory) { - if (true) { - // CommonJS - module.exports = exports = factory(); - } - else {} -}(this, function () { - - /*globals window, global, require*/ - - /** - * CryptoJS core components. - */ - var CryptoJS = CryptoJS || (function (Math, undefined) { - - var crypto; - - // Native crypto from window (Browser) - if (typeof window !== 'undefined' && window.crypto) { - crypto = window.crypto; - } - - // Native crypto in web worker (Browser) - if (typeof self !== 'undefined' && self.crypto) { - crypto = self.crypto; - } - - // Native crypto from worker - if (typeof globalThis !== 'undefined' && globalThis.crypto) { - crypto = globalThis.crypto; - } - - // Native (experimental IE 11) crypto from window (Browser) - if (!crypto && typeof window !== 'undefined' && window.msCrypto) { - crypto = window.msCrypto; - } - - // Native crypto from global (NodeJS) - if (!crypto && typeof global !== 'undefined' && global.crypto) { - crypto = global.crypto; - } - - // Native crypto import via require (NodeJS) - if (!crypto && "function" === 'function') { - try { - crypto = __webpack_require__(4); - } catch (err) {} - } - - /* - * Cryptographically secure pseudorandom number generator - * - * As Math.random() is cryptographically not safe to use - */ - var cryptoSecureRandomInt = function () { - if (crypto) { - // Use getRandomValues method (Browser) - if (typeof crypto.getRandomValues === 'function') { - try { - return crypto.getRandomValues(new Uint32Array(1))[0]; - } catch (err) {} - } - - // Use randomBytes method (NodeJS) - if (typeof crypto.randomBytes === 'function') { - try { - return crypto.randomBytes(4).readInt32LE(); - } catch (err) {} - } - } - - throw new Error('Native crypto module could not be used to get secure random number.'); - }; - - /* - * Local polyfill of Object.create - - */ - var create = Object.create || (function () { - function F() {} - - return function (obj) { - var subtype; - - F.prototype = obj; - - subtype = new F(); - - F.prototype = null; - - return subtype; - }; - }()); - - /** - * CryptoJS namespace. - */ - var C = {}; - - /** - * Library namespace. - */ - var C_lib = C.lib = {}; - - /** - * Base object for prototypal inheritance. - */ - var Base = C_lib.Base = (function () { - - - return { - /** - * Creates a new object that inherits from this object. - * - * @param {Object} overrides Properties to copy into the new object. - * - * @return {Object} The new object. - * - * @static - * - * @example - * - * var MyType = CryptoJS.lib.Base.extend({ - * field: 'value', - * - * method: function () { - * } - * }); - */ - extend: function (overrides) { - // Spawn - var subtype = create(this); - - // Augment - if (overrides) { - subtype.mixIn(overrides); - } - - // Create default initializer - if (!subtype.hasOwnProperty('init') || this.init === subtype.init) { - subtype.init = function () { - subtype.$super.init.apply(this, arguments); - }; - } - - // Initializer's prototype is the subtype object - subtype.init.prototype = subtype; - - // Reference supertype - subtype.$super = this; - - return subtype; - }, - - /** - * Extends this object and runs the init method. - * Arguments to create() will be passed to init(). - * - * @return {Object} The new object. - * - * @static - * - * @example - * - * var instance = MyType.create(); - */ - create: function () { - var instance = this.extend(); - instance.init.apply(instance, arguments); - - return instance; - }, - - /** - * Initializes a newly created object. - * Override this method to add some logic when your objects are created. - * - * @example - * - * var MyType = CryptoJS.lib.Base.extend({ - * init: function () { - * // ... - * } - * }); - */ - init: function () { - }, - - /** - * Copies properties into this object. - * - * @param {Object} properties The properties to mix in. - * - * @example - * - * MyType.mixIn({ - * field: 'value' - * }); - */ - mixIn: function (properties) { - for (var propertyName in properties) { - if (properties.hasOwnProperty(propertyName)) { - this[propertyName] = properties[propertyName]; - } - } - - // IE won't copy toString using the loop above - if (properties.hasOwnProperty('toString')) { - this.toString = properties.toString; - } - }, - - /** - * Creates a copy of this object. - * - * @return {Object} The clone. - * - * @example - * - * var clone = instance.clone(); - */ - clone: function () { - return this.init.prototype.extend(this); - } - }; - }()); - - /** - * An array of 32-bit words. - * - * @property {Array} words The array of 32-bit words. - * @property {number} sigBytes The number of significant bytes in this word array. - */ - var WordArray = C_lib.WordArray = Base.extend({ - /** - * Initializes a newly created word array. - * - * @param {Array} words (Optional) An array of 32-bit words. - * @param {number} sigBytes (Optional) The number of significant bytes in the words. - * - * @example - * - * var wordArray = CryptoJS.lib.WordArray.create(); - * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]); - * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6); - */ - init: function (words, sigBytes) { - words = this.words = words || []; - - if (sigBytes != undefined) { - this.sigBytes = sigBytes; - } else { - this.sigBytes = words.length * 4; - } - }, - - /** - * Converts this word array to a string. - * - * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex - * - * @return {string} The stringified word array. - * - * @example - * - * var string = wordArray + ''; - * var string = wordArray.toString(); - * var string = wordArray.toString(CryptoJS.enc.Utf8); - */ - toString: function (encoder) { - return (encoder || Hex).stringify(this); - }, - - /** - * Concatenates a word array to this word array. - * - * @param {WordArray} wordArray The word array to append. - * - * @return {WordArray} This word array. - * - * @example - * - * wordArray1.concat(wordArray2); - */ - concat: function (wordArray) { - // Shortcuts - var thisWords = this.words; - var thatWords = wordArray.words; - var thisSigBytes = this.sigBytes; - var thatSigBytes = wordArray.sigBytes; - - // Clamp excess bits - this.clamp(); - - // Concat - if (thisSigBytes % 4) { - // Copy one byte at a time - for (var i = 0; i < thatSigBytes; i++) { - var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; - thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8); - } - } else { - // Copy one word at a time - for (var j = 0; j < thatSigBytes; j += 4) { - thisWords[(thisSigBytes + j) >>> 2] = thatWords[j >>> 2]; - } - } - this.sigBytes += thatSigBytes; - - // Chainable - return this; - }, - - /** - * Removes insignificant bits. - * - * @example - * - * wordArray.clamp(); - */ - clamp: function () { - // Shortcuts - var words = this.words; - var sigBytes = this.sigBytes; - - // Clamp - words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8); - words.length = Math.ceil(sigBytes / 4); - }, - - /** - * Creates a copy of this word array. - * - * @return {WordArray} The clone. - * - * @example - * - * var clone = wordArray.clone(); - */ - clone: function () { - var clone = Base.clone.call(this); - clone.words = this.words.slice(0); - - return clone; - }, - - /** - * Creates a word array filled with random bytes. - * - * @param {number} nBytes The number of random bytes to generate. - * - * @return {WordArray} The random word array. - * - * @static - * - * @example - * - * var wordArray = CryptoJS.lib.WordArray.random(16); - */ - random: function (nBytes) { - var words = []; - - for (var i = 0; i < nBytes; i += 4) { - words.push(cryptoSecureRandomInt()); - } - - return new WordArray.init(words, nBytes); - } - }); - - /** - * Encoder namespace. - */ - var C_enc = C.enc = {}; - - /** - * Hex encoding strategy. - */ - var Hex = C_enc.Hex = { - /** - * Converts a word array to a hex string. - * - * @param {WordArray} wordArray The word array. - * - * @return {string} The hex string. - * - * @static - * - * @example - * - * var hexString = CryptoJS.enc.Hex.stringify(wordArray); - */ - stringify: function (wordArray) { - // Shortcuts - var words = wordArray.words; - var sigBytes = wordArray.sigBytes; - - // Convert - var hexChars = []; - for (var i = 0; i < sigBytes; i++) { - var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; - hexChars.push((bite >>> 4).toString(16)); - hexChars.push((bite & 0x0f).toString(16)); - } - - return hexChars.join(''); - }, - - /** - * Converts a hex string to a word array. - * - * @param {string} hexStr The hex string. - * - * @return {WordArray} The word array. - * - * @static - * - * @example - * - * var wordArray = CryptoJS.enc.Hex.parse(hexString); - */ - parse: function (hexStr) { - // Shortcut - var hexStrLength = hexStr.length; - - // Convert - var words = []; - for (var i = 0; i < hexStrLength; i += 2) { - words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4); - } - - return new WordArray.init(words, hexStrLength / 2); - } - }; - - /** - * Latin1 encoding strategy. - */ - var Latin1 = C_enc.Latin1 = { - /** - * Converts a word array to a Latin1 string. - * - * @param {WordArray} wordArray The word array. - * - * @return {string} The Latin1 string. - * - * @static - * - * @example - * - * var latin1String = CryptoJS.enc.Latin1.stringify(wordArray); - */ - stringify: function (wordArray) { - // Shortcuts - var words = wordArray.words; - var sigBytes = wordArray.sigBytes; - - // Convert - var latin1Chars = []; - for (var i = 0; i < sigBytes; i++) { - var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; - latin1Chars.push(String.fromCharCode(bite)); - } - - return latin1Chars.join(''); - }, - - /** - * Converts a Latin1 string to a word array. - * - * @param {string} latin1Str The Latin1 string. - * - * @return {WordArray} The word array. - * - * @static - * - * @example - * - * var wordArray = CryptoJS.enc.Latin1.parse(latin1String); - */ - parse: function (latin1Str) { - // Shortcut - var latin1StrLength = latin1Str.length; - - // Convert - var words = []; - for (var i = 0; i < latin1StrLength; i++) { - words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8); - } - - return new WordArray.init(words, latin1StrLength); - } - }; - - /** - * UTF-8 encoding strategy. - */ - var Utf8 = C_enc.Utf8 = { - /** - * Converts a word array to a UTF-8 string. - * - * @param {WordArray} wordArray The word array. - * - * @return {string} The UTF-8 string. - * - * @static - * - * @example - * - * var utf8String = CryptoJS.enc.Utf8.stringify(wordArray); - */ - stringify: function (wordArray) { - try { - return decodeURIComponent(escape(Latin1.stringify(wordArray))); - } catch (e) { - throw new Error('Malformed UTF-8 data'); - } - }, - - /** - * Converts a UTF-8 string to a word array. - * - * @param {string} utf8Str The UTF-8 string. - * - * @return {WordArray} The word array. - * - * @static - * - * @example - * - * var wordArray = CryptoJS.enc.Utf8.parse(utf8String); - */ - parse: function (utf8Str) { - return Latin1.parse(unescape(encodeURIComponent(utf8Str))); - } - }; - - /** - * Abstract buffered block algorithm template. - * - * The property blockSize must be implemented in a concrete subtype. - * - * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0 - */ - var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({ - /** - * Resets this block algorithm's data buffer to its initial state. - * - * @example - * - * bufferedBlockAlgorithm.reset(); - */ - reset: function () { - // Initial values - this._data = new WordArray.init(); - this._nDataBytes = 0; - }, - - /** - * Adds new data to this block algorithm's buffer. - * - * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8. - * - * @example - * - * bufferedBlockAlgorithm._append('data'); - * bufferedBlockAlgorithm._append(wordArray); - */ - _append: function (data) { - // Convert string to WordArray, else assume WordArray already - if (typeof data == 'string') { - data = Utf8.parse(data); - } - - // Append - this._data.concat(data); - this._nDataBytes += data.sigBytes; - }, - - /** - * Processes available data blocks. - * - * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype. - * - * @param {boolean} doFlush Whether all blocks and partial blocks should be processed. - * - * @return {WordArray} The processed data. - * - * @example - * - * var processedData = bufferedBlockAlgorithm._process(); - * var processedData = bufferedBlockAlgorithm._process(!!'flush'); - */ - _process: function (doFlush) { - var processedWords; - - // Shortcuts - var data = this._data; - var dataWords = data.words; - var dataSigBytes = data.sigBytes; - var blockSize = this.blockSize; - var blockSizeBytes = blockSize * 4; - - // Count blocks ready - var nBlocksReady = dataSigBytes / blockSizeBytes; - if (doFlush) { - // Round up to include partial blocks - nBlocksReady = Math.ceil(nBlocksReady); - } else { - // Round down to include only full blocks, - // less the number of blocks that must remain in the buffer - nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0); - } - - // Count words ready - var nWordsReady = nBlocksReady * blockSize; - - // Count bytes ready - var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes); - - // Process blocks - if (nWordsReady) { - for (var offset = 0; offset < nWordsReady; offset += blockSize) { - // Perform concrete-algorithm logic - this._doProcessBlock(dataWords, offset); - } - - // Remove processed words - processedWords = dataWords.splice(0, nWordsReady); - data.sigBytes -= nBytesReady; - } - - // Return processed words - return new WordArray.init(processedWords, nBytesReady); - }, - - /** - * Creates a copy of this object. - * - * @return {Object} The clone. - * - * @example - * - * var clone = bufferedBlockAlgorithm.clone(); - */ - clone: function () { - var clone = Base.clone.call(this); - clone._data = this._data.clone(); - - return clone; - }, - - _minBufferSize: 0 - }); - - /** - * Abstract hasher template. - * - * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits) - */ - var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({ - /** - * Configuration options. - */ - cfg: Base.extend(), - - /** - * Initializes a newly created hasher. - * - * @param {Object} cfg (Optional) The configuration options to use for this hash computation. - * - * @example - * - * var hasher = CryptoJS.algo.SHA256.create(); - */ - init: function (cfg) { - // Apply config defaults - this.cfg = this.cfg.extend(cfg); - - // Set initial values - this.reset(); - }, - - /** - * Resets this hasher to its initial state. - * - * @example - * - * hasher.reset(); - */ - reset: function () { - // Reset data buffer - BufferedBlockAlgorithm.reset.call(this); - - // Perform concrete-hasher logic - this._doReset(); - }, - - /** - * Updates this hasher with a message. - * - * @param {WordArray|string} messageUpdate The message to append. - * - * @return {Hasher} This hasher. - * - * @example - * - * hasher.update('message'); - * hasher.update(wordArray); - */ - update: function (messageUpdate) { - // Append - this._append(messageUpdate); - - // Update the hash - this._process(); - - // Chainable - return this; - }, - - /** - * Finalizes the hash computation. - * Note that the finalize operation is effectively a destructive, read-once operation. - * - * @param {WordArray|string} messageUpdate (Optional) A final message update. - * - * @return {WordArray} The hash. - * - * @example - * - * var hash = hasher.finalize(); - * var hash = hasher.finalize('message'); - * var hash = hasher.finalize(wordArray); - */ - finalize: function (messageUpdate) { - // Final message update - if (messageUpdate) { - this._append(messageUpdate); - } - - // Perform concrete-hasher logic - var hash = this._doFinalize(); - - return hash; - }, - - blockSize: 512/32, - - /** - * Creates a shortcut function to a hasher's object interface. - * - * @param {Hasher} hasher The hasher to create a helper for. - * - * @return {Function} The shortcut function. - * - * @static - * - * @example - * - * var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256); - */ - _createHelper: function (hasher) { - return function (message, cfg) { - return new hasher.init(cfg).finalize(message); - }; - }, - - /** - * Creates a shortcut function to the HMAC's object interface. - * - * @param {Hasher} hasher The hasher to use in this HMAC helper. - * - * @return {Function} The shortcut function. - * - * @static - * - * @example - * - * var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256); - */ - _createHmacHelper: function (hasher) { - return function (message, key) { - return new C_algo.HMAC.init(hasher, key).finalize(message); - }; - } - }); - - /** - * Algorithm namespace. - */ - var C_algo = C.algo = {}; - - return C; - }(Math)); - - - return CryptoJS; - -})); - -/***/ }), -/* 10 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("buffer"); - -/***/ }), -/* 11 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Field; - -// extends ReflectionObject -var ReflectionObject = __webpack_require__(13); -((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = "Field"; - -var Enum = __webpack_require__(3), - types = __webpack_require__(14), - util = __webpack_require__(0); - -var Type; // cyclic - -var ruleRe = /^required|optional|repeated$/; - -/** - * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class. - * @name Field - * @classdesc Reflected message field. - * @extends FieldBase - * @constructor - * @param {string} name Unique name within its namespace - * @param {number} id Unique id within its namespace - * @param {string} type Value type - * @param {string|Object.} [rule="optional"] Field rule - * @param {string|Object.} [extend] Extended type if different from parent - * @param {Object.} [options] Declared options - */ - -/** - * Constructs a field from a field descriptor. - * @param {string} name Field name - * @param {IField} json Field descriptor - * @returns {Field} Created field - * @throws {TypeError} If arguments are invalid - */ -Field.fromJSON = function fromJSON(name, json) { - return new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment); -}; - -/** - * Not an actual constructor. Use {@link Field} instead. - * @classdesc Base class of all reflected message fields. This is not an actual class but here for the sake of having consistent type definitions. - * @exports FieldBase - * @extends ReflectionObject - * @constructor - * @param {string} name Unique name within its namespace - * @param {number} id Unique id within its namespace - * @param {string} type Value type - * @param {string|Object.} [rule="optional"] Field rule - * @param {string|Object.} [extend] Extended type if different from parent - * @param {Object.} [options] Declared options - * @param {string} [comment] Comment associated with this field - */ -function Field(name, id, type, rule, extend, options, comment) { - - if (util.isObject(rule)) { - comment = extend; - options = rule; - rule = extend = undefined; - } else if (util.isObject(extend)) { - comment = options; - options = extend; - extend = undefined; - } - - ReflectionObject.call(this, name, options); - - if (!util.isInteger(id) || id < 0) - throw TypeError("id must be a non-negative integer"); - - if (!util.isString(type)) - throw TypeError("type must be a string"); - - if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase())) - throw TypeError("rule must be a string rule"); - - if (extend !== undefined && !util.isString(extend)) - throw TypeError("extend must be a string"); - - /** - * Field rule, if any. - * @type {string|undefined} - */ - this.rule = rule && rule !== "optional" ? rule : undefined; // toJSON - - /** - * Field type. - * @type {string} - */ - this.type = type; // toJSON - - /** - * Unique field id. - * @type {number} - */ - this.id = id; // toJSON, marker - - /** - * Extended type if different from parent. - * @type {string|undefined} - */ - this.extend = extend || undefined; // toJSON - - /** - * Whether this field is required. - * @type {boolean} - */ - this.required = rule === "required"; - - /** - * Whether this field is optional. - * @type {boolean} - */ - this.optional = !this.required; - - /** - * Whether this field is repeated. - * @type {boolean} - */ - this.repeated = rule === "repeated"; - - /** - * Whether this field is a map or not. - * @type {boolean} - */ - this.map = false; - - /** - * Message this field belongs to. - * @type {Type|null} - */ - this.message = null; - - /** - * OneOf this field belongs to, if any, - * @type {OneOf|null} - */ - this.partOf = null; - - /** - * The field type's default value. - * @type {*} - */ - this.typeDefault = null; - - /** - * The field's default value on prototypes. - * @type {*} - */ - this.defaultValue = null; - - /** - * Whether this field's value should be treated as a long. - * @type {boolean} - */ - this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false; - - /** - * Whether this field's value is a buffer. - * @type {boolean} - */ - this.bytes = type === "bytes"; - - /** - * Resolved type if not a basic type. - * @type {Type|Enum|null} - */ - this.resolvedType = null; - - /** - * Sister-field within the extended type if a declaring extension field. - * @type {Field|null} - */ - this.extensionField = null; - - /** - * Sister-field within the declaring namespace if an extended field. - * @type {Field|null} - */ - this.declaringField = null; - - /** - * Internally remembers whether this field is packed. - * @type {boolean|null} - * @private - */ - this._packed = null; - - /** - * Comment for this field. - * @type {string|null} - */ - this.comment = comment; -} - -/** - * Determines whether this field is packed. Only relevant when repeated and working with proto2. - * @name Field#packed - * @type {boolean} - * @readonly - */ -Object.defineProperty(Field.prototype, "packed", { - get: function() { - // defaults to packed=true if not explicity set to false - if (this._packed === null) - this._packed = this.getOption("packed") !== false; - return this._packed; - } -}); - -/** - * @override - */ -Field.prototype.setOption = function setOption(name, value, ifNotSet) { - if (name === "packed") // clear cached before setting - this._packed = null; - return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet); -}; - -/** - * Field descriptor. - * @interface IField - * @property {string} [rule="optional"] Field rule - * @property {string} type Field type - * @property {number} id Field id - * @property {Object.} [options] Field options - */ - -/** - * Extension field descriptor. - * @interface IExtensionField - * @extends IField - * @property {string} extend Extended type - */ - -/** - * Converts this field to a field descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IField} Field descriptor - */ -Field.prototype.toJSON = function toJSON(toJSONOptions) { - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "rule" , this.rule !== "optional" && this.rule || undefined, - "type" , this.type, - "id" , this.id, - "extend" , this.extend, - "options" , this.options, - "comment" , keepComments ? this.comment : undefined - ]); -}; - -/** - * Resolves this field's type references. - * @returns {Field} `this` - * @throws {Error} If any reference cannot be resolved - */ -Field.prototype.resolve = function resolve() { - - if (this.resolved) - return this; - - if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it - this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type); - if (this.resolvedType instanceof Type) - this.typeDefault = null; - else // instanceof Enum - this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined - } - - // use explicitly set default value if present - if (this.options && this.options["default"] != null) { - this.typeDefault = this.options["default"]; - if (this.resolvedType instanceof Enum && typeof this.typeDefault === "string") - this.typeDefault = this.resolvedType.values[this.typeDefault]; - } - - // remove unnecessary options - if (this.options) { - if (this.options.packed === true || this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum)) - delete this.options.packed; - if (!Object.keys(this.options).length) - this.options = undefined; - } - - // convert to internal data type if necesssary - if (this.long) { - this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === "u"); - - /* istanbul ignore else */ - if (Object.freeze) - Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it) - - } else if (this.bytes && typeof this.typeDefault === "string") { - var buf; - if (util.base64.test(this.typeDefault)) - util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0); - else - util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0); - this.typeDefault = buf; - } - - // take special care of maps and repeated fields - if (this.map) - this.defaultValue = util.emptyObject; - else if (this.repeated) - this.defaultValue = util.emptyArray; - else - this.defaultValue = this.typeDefault; - - // ensure proper value on prototype - if (this.parent instanceof Type) - this.parent.ctor.prototype[this.name] = this.defaultValue; - - return ReflectionObject.prototype.resolve.call(this); -}; - -/** - * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript). - * @typedef FieldDecorator - * @type {function} - * @param {Object} prototype Target prototype - * @param {string} fieldName Field name - * @returns {undefined} - */ - -/** - * Field decorator (TypeScript). - * @name Field.d - * @function - * @param {number} fieldId Field id - * @param {"double"|"float"|"int32"|"uint32"|"sint32"|"fixed32"|"sfixed32"|"int64"|"uint64"|"sint64"|"fixed64"|"sfixed64"|"string"|"bool"|"bytes"|Object} fieldType Field type - * @param {"optional"|"required"|"repeated"} [fieldRule="optional"] Field rule - * @param {T} [defaultValue] Default value - * @returns {FieldDecorator} Decorator function - * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[] - */ -Field.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) { - - // submessage: decorate the submessage and use its name as the type - if (typeof fieldType === "function") - fieldType = util.decorateType(fieldType).name; - - // enum reference: create a reflected copy of the enum and keep reuseing it - else if (fieldType && typeof fieldType === "object") - fieldType = util.decorateEnum(fieldType).name; - - return function fieldDecorator(prototype, fieldName) { - util.decorateType(prototype.constructor) - .add(new Field(fieldName, fieldId, fieldType, fieldRule, { "default": defaultValue })); - }; -}; - -/** - * Field decorator (TypeScript). - * @name Field.d - * @function - * @param {number} fieldId Field id - * @param {Constructor|string} fieldType Field type - * @param {"optional"|"required"|"repeated"} [fieldRule="optional"] Field rule - * @returns {FieldDecorator} Decorator function - * @template T extends Message - * @variation 2 - */ -// like Field.d but without a default value - -// Sets up cyclic dependencies (called in index-light) -Field._configure = function configure(Type_) { - Type = Type_; -}; - - -/***/ }), -/* 12 */ -/***/ ((module) => { - -module.exports = assert; - -function assert(val, msg) { - if (!val) - throw new Error(msg || 'Assertion failed'); -} - -assert.equal = function assertEqual(l, r, msg) { - if (l != r) - throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r)); -}; - - -/***/ }), -/* 13 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = ReflectionObject; - -ReflectionObject.className = "ReflectionObject"; - -var util = __webpack_require__(0); - -var Root; // cyclic - -/** - * Constructs a new reflection object instance. - * @classdesc Base class of all reflection objects. - * @constructor - * @param {string} name Object name - * @param {Object.} [options] Declared options - * @abstract - */ -function ReflectionObject(name, options) { - - if (!util.isString(name)) - throw TypeError("name must be a string"); - - if (options && !util.isObject(options)) - throw TypeError("options must be an object"); - - /** - * Options. - * @type {Object.|undefined} - */ - this.options = options; // toJSON - - /** - * Unique name within its namespace. - * @type {string} - */ - this.name = name; - - /** - * Parent namespace. - * @type {Namespace|null} - */ - this.parent = null; - - /** - * Whether already resolved or not. - * @type {boolean} - */ - this.resolved = false; - - /** - * Comment text, if any. - * @type {string|null} - */ - this.comment = null; - - /** - * Defining file name. - * @type {string|null} - */ - this.filename = null; -} - -Object.defineProperties(ReflectionObject.prototype, { - - /** - * Reference to the root namespace. - * @name ReflectionObject#root - * @type {Root} - * @readonly - */ - root: { - get: function() { - var ptr = this; - while (ptr.parent !== null) - ptr = ptr.parent; - return ptr; - } - }, - - /** - * Full name including leading dot. - * @name ReflectionObject#fullName - * @type {string} - * @readonly - */ - fullName: { - get: function() { - var path = [ this.name ], - ptr = this.parent; - while (ptr) { - path.unshift(ptr.name); - ptr = ptr.parent; - } - return path.join("."); - } - } -}); - -/** - * Converts this reflection object to its descriptor representation. - * @returns {Object.} Descriptor - * @abstract - */ -ReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() { - throw Error(); // not implemented, shouldn't happen -}; - -/** - * Called when this object is added to a parent. - * @param {ReflectionObject} parent Parent added to - * @returns {undefined} - */ -ReflectionObject.prototype.onAdd = function onAdd(parent) { - if (this.parent && this.parent !== parent) - this.parent.remove(this); - this.parent = parent; - this.resolved = false; - var root = parent.root; - if (root instanceof Root) - root._handleAdd(this); -}; - -/** - * Called when this object is removed from a parent. - * @param {ReflectionObject} parent Parent removed from - * @returns {undefined} - */ -ReflectionObject.prototype.onRemove = function onRemove(parent) { - var root = parent.root; - if (root instanceof Root) - root._handleRemove(this); - this.parent = null; - this.resolved = false; -}; - -/** - * Resolves this objects type references. - * @returns {ReflectionObject} `this` - */ -ReflectionObject.prototype.resolve = function resolve() { - if (this.resolved) - return this; - if (this.root instanceof Root) - this.resolved = true; // only if part of a root - return this; -}; - -/** - * Gets an option value. - * @param {string} name Option name - * @returns {*} Option value or `undefined` if not set - */ -ReflectionObject.prototype.getOption = function getOption(name) { - if (this.options) - return this.options[name]; - return undefined; -}; - -/** - * Sets an option. - * @param {string} name Option name - * @param {*} value Option value - * @param {boolean} [ifNotSet] Sets the option only if it isn't currently set - * @returns {ReflectionObject} `this` - */ -ReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) { - if (!ifNotSet || !this.options || this.options[name] === undefined) - (this.options || (this.options = {}))[name] = value; - return this; -}; - -/** - * Sets multiple options. - * @param {Object.} options Options to set - * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set - * @returns {ReflectionObject} `this` - */ -ReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) { - if (options) - for (var keys = Object.keys(options), i = 0; i < keys.length; ++i) - this.setOption(keys[i], options[keys[i]], ifNotSet); - return this; -}; - -/** - * Converts this instance to its string representation. - * @returns {string} Class name[, space, full name] - */ -ReflectionObject.prototype.toString = function toString() { - var className = this.constructor.className, - fullName = this.fullName; - if (fullName.length) - return className + " " + fullName; - return className; -}; - -// Sets up cyclic dependencies (called in index-light) -ReflectionObject._configure = function(Root_) { - Root = Root_; -}; - - -/***/ }), -/* 14 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -/** - * Common type constants. - * @namespace - */ -var types = exports; - -var util = __webpack_require__(0); - -var s = [ - "double", // 0 - "float", // 1 - "int32", // 2 - "uint32", // 3 - "sint32", // 4 - "fixed32", // 5 - "sfixed32", // 6 - "int64", // 7 - "uint64", // 8 - "sint64", // 9 - "fixed64", // 10 - "sfixed64", // 11 - "bool", // 12 - "string", // 13 - "bytes" // 14 -]; - -function bake(values, offset) { - var i = 0, o = {}; - offset |= 0; - while (i < values.length) o[s[i + offset]] = values[i++]; - return o; -} - -/** - * Basic type wire types. - * @type {Object.} - * @const - * @property {number} double=1 Fixed64 wire type - * @property {number} float=5 Fixed32 wire type - * @property {number} int32=0 Varint wire type - * @property {number} uint32=0 Varint wire type - * @property {number} sint32=0 Varint wire type - * @property {number} fixed32=5 Fixed32 wire type - * @property {number} sfixed32=5 Fixed32 wire type - * @property {number} int64=0 Varint wire type - * @property {number} uint64=0 Varint wire type - * @property {number} sint64=0 Varint wire type - * @property {number} fixed64=1 Fixed64 wire type - * @property {number} sfixed64=1 Fixed64 wire type - * @property {number} bool=0 Varint wire type - * @property {number} string=2 Ldelim wire type - * @property {number} bytes=2 Ldelim wire type - */ -types.basic = bake([ - /* double */ 1, - /* float */ 5, - /* int32 */ 0, - /* uint32 */ 0, - /* sint32 */ 0, - /* fixed32 */ 5, - /* sfixed32 */ 5, - /* int64 */ 0, - /* uint64 */ 0, - /* sint64 */ 0, - /* fixed64 */ 1, - /* sfixed64 */ 1, - /* bool */ 0, - /* string */ 2, - /* bytes */ 2 -]); - -/** - * Basic type defaults. - * @type {Object.} - * @const - * @property {number} double=0 Double default - * @property {number} float=0 Float default - * @property {number} int32=0 Int32 default - * @property {number} uint32=0 Uint32 default - * @property {number} sint32=0 Sint32 default - * @property {number} fixed32=0 Fixed32 default - * @property {number} sfixed32=0 Sfixed32 default - * @property {number} int64=0 Int64 default - * @property {number} uint64=0 Uint64 default - * @property {number} sint64=0 Sint32 default - * @property {number} fixed64=0 Fixed64 default - * @property {number} sfixed64=0 Sfixed64 default - * @property {boolean} bool=false Bool default - * @property {string} string="" String default - * @property {Array.} bytes=Array(0) Bytes default - * @property {null} message=null Message default - */ -types.defaults = bake([ - /* double */ 0, - /* float */ 0, - /* int32 */ 0, - /* uint32 */ 0, - /* sint32 */ 0, - /* fixed32 */ 0, - /* sfixed32 */ 0, - /* int64 */ 0, - /* uint64 */ 0, - /* sint64 */ 0, - /* fixed64 */ 0, - /* sfixed64 */ 0, - /* bool */ false, - /* string */ "", - /* bytes */ util.emptyArray, - /* message */ null -]); - -/** - * Basic long type wire types. - * @type {Object.} - * @const - * @property {number} int64=0 Varint wire type - * @property {number} uint64=0 Varint wire type - * @property {number} sint64=0 Varint wire type - * @property {number} fixed64=1 Fixed64 wire type - * @property {number} sfixed64=1 Fixed64 wire type - */ -types.long = bake([ - /* int64 */ 0, - /* uint64 */ 0, - /* sint64 */ 0, - /* fixed64 */ 1, - /* sfixed64 */ 1 -], 7); - -/** - * Allowed types for map keys with their associated wire type. - * @type {Object.} - * @const - * @property {number} int32=0 Varint wire type - * @property {number} uint32=0 Varint wire type - * @property {number} sint32=0 Varint wire type - * @property {number} fixed32=5 Fixed32 wire type - * @property {number} sfixed32=5 Fixed32 wire type - * @property {number} int64=0 Varint wire type - * @property {number} uint64=0 Varint wire type - * @property {number} sint64=0 Varint wire type - * @property {number} fixed64=1 Fixed64 wire type - * @property {number} sfixed64=1 Fixed64 wire type - * @property {number} bool=0 Varint wire type - * @property {number} string=2 Ldelim wire type - */ -types.mapKey = bake([ - /* int32 */ 0, - /* uint32 */ 0, - /* sint32 */ 0, - /* fixed32 */ 5, - /* sfixed32 */ 5, - /* int64 */ 0, - /* uint64 */ 0, - /* sint64 */ 0, - /* fixed64 */ 1, - /* sfixed64 */ 1, - /* bool */ 0, - /* string */ 2 -], 2); - -/** - * Allowed types for packed repeated fields with their associated wire type. - * @type {Object.} - * @const - * @property {number} double=1 Fixed64 wire type - * @property {number} float=5 Fixed32 wire type - * @property {number} int32=0 Varint wire type - * @property {number} uint32=0 Varint wire type - * @property {number} sint32=0 Varint wire type - * @property {number} fixed32=5 Fixed32 wire type - * @property {number} sfixed32=5 Fixed32 wire type - * @property {number} int64=0 Varint wire type - * @property {number} uint64=0 Varint wire type - * @property {number} sint64=0 Varint wire type - * @property {number} fixed64=1 Fixed64 wire type - * @property {number} sfixed64=1 Fixed64 wire type - * @property {number} bool=0 Varint wire type - */ -types.packed = bake([ - /* double */ 1, - /* float */ 5, - /* int32 */ 0, - /* uint32 */ 0, - /* sint32 */ 0, - /* fixed32 */ 5, - /* sfixed32 */ 5, - /* int64 */ 0, - /* uint64 */ 0, - /* sint64 */ 0, - /* fixed64 */ 1, - /* sfixed64 */ 1, - /* bool */ 0 -]); - - -/***/ }), -/* 15 */ -/***/ ((module) => { - -"use strict"; - - -const codes = {}; - -function createErrorType(code, message, Base) { - if (!Base) { - Base = Error - } - - function getMessage (arg1, arg2, arg3) { - if (typeof message === 'string') { - return message - } else { - return message(arg1, arg2, arg3) - } - } - - class NodeError extends Base { - constructor (arg1, arg2, arg3) { - super(getMessage(arg1, arg2, arg3)); - } - } - - NodeError.prototype.name = Base.name; - NodeError.prototype.code = code; - - codes[code] = NodeError; -} - -// https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js -function oneOf(expected, thing) { - if (Array.isArray(expected)) { - const len = expected.length; - expected = expected.map((i) => String(i)); - if (len > 2) { - return `one of ${thing} ${expected.slice(0, len - 1).join(', ')}, or ` + - expected[len - 1]; - } else if (len === 2) { - return `one of ${thing} ${expected[0]} or ${expected[1]}`; - } else { - return `of ${thing} ${expected[0]}`; - } - } else { - return `of ${thing} ${String(expected)}`; - } -} - -// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith -function startsWith(str, search, pos) { - return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search; -} - -// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith -function endsWith(str, search, this_len) { - if (this_len === undefined || this_len > str.length) { - this_len = str.length; - } - return str.substring(this_len - search.length, this_len) === search; -} - -// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes -function includes(str, search, start) { - if (typeof start !== 'number') { - start = 0; - } - - if (start + search.length > str.length) { - return false; - } else { - return str.indexOf(search, start) !== -1; - } -} - -createErrorType('ERR_INVALID_OPT_VALUE', function (name, value) { - return 'The value "' + value + '" is invalid for option "' + name + '"' -}, TypeError); -createErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) { - // determiner: 'must be' or 'must not be' - let determiner; - if (typeof expected === 'string' && startsWith(expected, 'not ')) { - determiner = 'must not be'; - expected = expected.replace(/^not /, ''); - } else { - determiner = 'must be'; - } - - let msg; - if (endsWith(name, ' argument')) { - // For cases like 'first argument' - msg = `The ${name} ${determiner} ${oneOf(expected, 'type')}`; - } else { - const type = includes(name, '.') ? 'property' : 'argument'; - msg = `The "${name}" ${type} ${determiner} ${oneOf(expected, 'type')}`; - } - - msg += `. Received type ${typeof actual}`; - return msg; -}, TypeError); -createErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF'); -createErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) { - return 'The ' + name + ' method is not implemented' -}); -createErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close'); -createErrorType('ERR_STREAM_DESTROYED', function (name) { - return 'Cannot call ' + name + ' after a stream was destroyed'; -}); -createErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times'); -createErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable'); -createErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end'); -createErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError); -createErrorType('ERR_UNKNOWN_ENCODING', function (arg) { - return 'Unknown encoding: ' + arg -}, TypeError); -createErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event'); - -module.exports.q = codes; - - -/***/ }), -/* 16 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Namespace; - -// extends ReflectionObject -var ReflectionObject = __webpack_require__(13); -((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = "Namespace"; - -var Field = __webpack_require__(11), - util = __webpack_require__(0); - -var Type, // cyclic - Service, - Enum; - -/** - * Constructs a new namespace instance. - * @name Namespace - * @classdesc Reflected namespace. - * @extends NamespaceBase - * @constructor - * @param {string} name Namespace name - * @param {Object.} [options] Declared options - */ - -/** - * Constructs a namespace from JSON. - * @memberof Namespace - * @function - * @param {string} name Namespace name - * @param {Object.} json JSON object - * @returns {Namespace} Created namespace - * @throws {TypeError} If arguments are invalid - */ -Namespace.fromJSON = function fromJSON(name, json) { - return new Namespace(name, json.options).addJSON(json.nested); -}; - -/** - * Converts an array of reflection objects to JSON. - * @memberof Namespace - * @param {ReflectionObject[]} array Object array - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {Object.|undefined} JSON object or `undefined` when array is empty - */ -function arrayToJSON(array, toJSONOptions) { - if (!(array && array.length)) - return undefined; - var obj = {}; - for (var i = 0; i < array.length; ++i) - obj[array[i].name] = array[i].toJSON(toJSONOptions); - return obj; -} - -Namespace.arrayToJSON = arrayToJSON; - -/** - * Tests if the specified id is reserved. - * @param {Array.|undefined} reserved Array of reserved ranges and names - * @param {number} id Id to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -Namespace.isReservedId = function isReservedId(reserved, id) { - if (reserved) - for (var i = 0; i < reserved.length; ++i) - if (typeof reserved[i] !== "string" && reserved[i][0] <= id && reserved[i][1] >= id) - return true; - return false; -}; - -/** - * Tests if the specified name is reserved. - * @param {Array.|undefined} reserved Array of reserved ranges and names - * @param {string} name Name to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -Namespace.isReservedName = function isReservedName(reserved, name) { - if (reserved) - for (var i = 0; i < reserved.length; ++i) - if (reserved[i] === name) - return true; - return false; -}; - -/** - * Not an actual constructor. Use {@link Namespace} instead. - * @classdesc Base class of all reflection objects containing nested objects. This is not an actual class but here for the sake of having consistent type definitions. - * @exports NamespaceBase - * @extends ReflectionObject - * @abstract - * @constructor - * @param {string} name Namespace name - * @param {Object.} [options] Declared options - * @see {@link Namespace} - */ -function Namespace(name, options) { - ReflectionObject.call(this, name, options); - - /** - * Nested objects by name. - * @type {Object.|undefined} - */ - this.nested = undefined; // toJSON - - /** - * Cached nested objects as an array. - * @type {ReflectionObject[]|null} - * @private - */ - this._nestedArray = null; -} - -function clearCache(namespace) { - namespace._nestedArray = null; - return namespace; -} - -/** - * Nested objects of this namespace as an array for iteration. - * @name NamespaceBase#nestedArray - * @type {ReflectionObject[]} - * @readonly - */ -Object.defineProperty(Namespace.prototype, "nestedArray", { - get: function() { - return this._nestedArray || (this._nestedArray = util.toArray(this.nested)); - } -}); - -/** - * Namespace descriptor. - * @interface INamespace - * @property {Object.} [options] Namespace options - * @property {Object.} [nested] Nested object descriptors - */ - -/** - * Any extension field descriptor. - * @typedef AnyExtensionField - * @type {IExtensionField|IExtensionMapField} - */ - -/** - * Any nested object descriptor. - * @typedef AnyNestedObject - * @type {IEnum|IType|IService|AnyExtensionField|INamespace} - */ -// ^ BEWARE: VSCode hangs forever when using more than 5 types (that's why AnyExtensionField exists in the first place) - -/** - * Converts this namespace to a namespace descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {INamespace} Namespace descriptor - */ -Namespace.prototype.toJSON = function toJSON(toJSONOptions) { - return util.toObject([ - "options" , this.options, - "nested" , arrayToJSON(this.nestedArray, toJSONOptions) - ]); -}; - -/** - * Adds nested objects to this namespace from nested object descriptors. - * @param {Object.} nestedJson Any nested object descriptors - * @returns {Namespace} `this` - */ -Namespace.prototype.addJSON = function addJSON(nestedJson) { - var ns = this; - /* istanbul ignore else */ - if (nestedJson) { - for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) { - nested = nestedJson[names[i]]; - ns.add( // most to least likely - ( nested.fields !== undefined - ? Type.fromJSON - : nested.values !== undefined - ? Enum.fromJSON - : nested.methods !== undefined - ? Service.fromJSON - : nested.id !== undefined - ? Field.fromJSON - : Namespace.fromJSON )(names[i], nested) - ); - } - } - return this; -}; - -/** - * Gets the nested object of the specified name. - * @param {string} name Nested object name - * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist - */ -Namespace.prototype.get = function get(name) { - return this.nested && this.nested[name] - || null; -}; - -/** - * Gets the values of the nested {@link Enum|enum} of the specified name. - * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`. - * @param {string} name Nested enum name - * @returns {Object.} Enum values - * @throws {Error} If there is no such enum - */ -Namespace.prototype.getEnum = function getEnum(name) { - if (this.nested && this.nested[name] instanceof Enum) - return this.nested[name].values; - throw Error("no such enum: " + name); -}; - -/** - * Adds a nested object to this namespace. - * @param {ReflectionObject} object Nested object to add - * @returns {Namespace} `this` - * @throws {TypeError} If arguments are invalid - * @throws {Error} If there is already a nested object with this name - */ -Namespace.prototype.add = function add(object) { - - if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof Enum || object instanceof Service || object instanceof Namespace)) - throw TypeError("object must be a valid nested object"); - - if (!this.nested) - this.nested = {}; - else { - var prev = this.get(object.name); - if (prev) { - if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) { - // replace plain namespace but keep existing nested elements and options - var nested = prev.nestedArray; - for (var i = 0; i < nested.length; ++i) - object.add(nested[i]); - this.remove(prev); - if (!this.nested) - this.nested = {}; - object.setOptions(prev.options, true); - - } else - throw Error("duplicate name '" + object.name + "' in " + this); - } - } - this.nested[object.name] = object; - object.onAdd(this); - return clearCache(this); -}; - -/** - * Removes a nested object from this namespace. - * @param {ReflectionObject} object Nested object to remove - * @returns {Namespace} `this` - * @throws {TypeError} If arguments are invalid - * @throws {Error} If `object` is not a member of this namespace - */ -Namespace.prototype.remove = function remove(object) { - - if (!(object instanceof ReflectionObject)) - throw TypeError("object must be a ReflectionObject"); - if (object.parent !== this) - throw Error(object + " is not a member of " + this); - - delete this.nested[object.name]; - if (!Object.keys(this.nested).length) - this.nested = undefined; - - object.onRemove(this); - return clearCache(this); -}; - -/** - * Defines additial namespaces within this one if not yet existing. - * @param {string|string[]} path Path to create - * @param {*} [json] Nested types to create from JSON - * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty - */ -Namespace.prototype.define = function define(path, json) { - - if (util.isString(path)) - path = path.split("."); - else if (!Array.isArray(path)) - throw TypeError("illegal path"); - if (path && path.length && path[0] === "") - throw Error("path must be relative"); - - var ptr = this; - while (path.length > 0) { - var part = path.shift(); - if (ptr.nested && ptr.nested[part]) { - ptr = ptr.nested[part]; - if (!(ptr instanceof Namespace)) - throw Error("path conflicts with non-namespace objects"); - } else - ptr.add(ptr = new Namespace(part)); - } - if (json) - ptr.addJSON(json); - return ptr; -}; - -/** - * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost. - * @returns {Namespace} `this` - */ -Namespace.prototype.resolveAll = function resolveAll() { - var nested = this.nestedArray, i = 0; - while (i < nested.length) - if (nested[i] instanceof Namespace) - nested[i++].resolveAll(); - else - nested[i++].resolve(); - return this.resolve(); -}; - -/** - * Recursively looks up the reflection object matching the specified path in the scope of this namespace. - * @param {string|string[]} path Path to look up - * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc. - * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked - * @returns {ReflectionObject|null} Looked up object or `null` if none could be found - */ -Namespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) { - - /* istanbul ignore next */ - if (typeof filterTypes === "boolean") { - parentAlreadyChecked = filterTypes; - filterTypes = undefined; - } else if (filterTypes && !Array.isArray(filterTypes)) - filterTypes = [ filterTypes ]; - - if (util.isString(path) && path.length) { - if (path === ".") - return this.root; - path = path.split("."); - } else if (!path.length) - return this; - - // Start at root if path is absolute - if (path[0] === "") - return this.root.lookup(path.slice(1), filterTypes); - - // Test if the first part matches any nested object, and if so, traverse if path contains more - var found = this.get(path[0]); - if (found) { - if (path.length === 1) { - if (!filterTypes || filterTypes.indexOf(found.constructor) > -1) - return found; - } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true))) - return found; - - // Otherwise try each nested namespace - } else - for (var i = 0; i < this.nestedArray.length; ++i) - if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true))) - return found; - - // If there hasn't been a match, try again at the parent - if (this.parent === null || parentAlreadyChecked) - return null; - return this.parent.lookup(path, filterTypes); -}; - -/** - * Looks up the reflection object at the specified path, relative to this namespace. - * @name NamespaceBase#lookup - * @function - * @param {string|string[]} path Path to look up - * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked - * @returns {ReflectionObject|null} Looked up object or `null` if none could be found - * @variation 2 - */ -// lookup(path: string, [parentAlreadyChecked: boolean]) - -/** - * Looks up the {@link Type|type} at the specified path, relative to this namespace. - * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`. - * @param {string|string[]} path Path to look up - * @returns {Type} Looked up type - * @throws {Error} If `path` does not point to a type - */ -Namespace.prototype.lookupType = function lookupType(path) { - var found = this.lookup(path, [ Type ]); - if (!found) - throw Error("no such type: " + path); - return found; -}; - -/** - * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace. - * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`. - * @param {string|string[]} path Path to look up - * @returns {Enum} Looked up enum - * @throws {Error} If `path` does not point to an enum - */ -Namespace.prototype.lookupEnum = function lookupEnum(path) { - var found = this.lookup(path, [ Enum ]); - if (!found) - throw Error("no such Enum '" + path + "' in " + this); - return found; -}; - -/** - * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace. - * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`. - * @param {string|string[]} path Path to look up - * @returns {Type} Looked up type or enum - * @throws {Error} If `path` does not point to a type or enum - */ -Namespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) { - var found = this.lookup(path, [ Type, Enum ]); - if (!found) - throw Error("no such Type or Enum '" + path + "' in " + this); - return found; -}; - -/** - * Looks up the {@link Service|service} at the specified path, relative to this namespace. - * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`. - * @param {string|string[]} path Path to look up - * @returns {Service} Looked up service - * @throws {Error} If `path` does not point to a service - */ -Namespace.prototype.lookupService = function lookupService(path) { - var found = this.lookup(path, [ Service ]); - if (!found) - throw Error("no such Service '" + path + "' in " + this); - return found; -}; - -// Sets up cyclic dependencies (called in index-light) -Namespace._configure = function(Type_, Service_, Enum_) { - Type = Type_; - Service = Service_; - Enum = Enum_; -}; - - -/***/ }), -/* 17 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - -// a duplex stream is just a stream that is both readable and writable. -// Since JS doesn't have multiple prototypal inheritance, this class -// prototypally inherits from Readable, and then parasitically from -// Writable. - - - -/**/ -var objectKeys = Object.keys || function (obj) { - var keys = []; - for (var key in obj) keys.push(key); - return keys; -}; -/**/ - -module.exports = Duplex; -var Readable = __webpack_require__(60); -var Writable = __webpack_require__(63); -__webpack_require__(7)(Duplex, Readable); -{ - // Allow the keys array to be GC'ed. - var keys = objectKeys(Writable.prototype); - for (var v = 0; v < keys.length; v++) { - var method = keys[v]; - if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method]; - } -} -function Duplex(options) { - if (!(this instanceof Duplex)) return new Duplex(options); - Readable.call(this, options); - Writable.call(this, options); - this.allowHalfOpen = true; - if (options) { - if (options.readable === false) this.readable = false; - if (options.writable === false) this.writable = false; - if (options.allowHalfOpen === false) { - this.allowHalfOpen = false; - this.once('end', onend); - } - } -} -Object.defineProperty(Duplex.prototype, 'writableHighWaterMark', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.highWaterMark; - } -}); -Object.defineProperty(Duplex.prototype, 'writableBuffer', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState && this._writableState.getBuffer(); - } -}); -Object.defineProperty(Duplex.prototype, 'writableLength', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.length; - } -}); - -// the no-half-open enforcer -function onend() { - // If the writable side ended, then we're ok. - if (this._writableState.ended) return; - - // no more data can be written. - // But allow more writes to happen in this tick. - process.nextTick(onEndNT, this); -} -function onEndNT(self) { - self.end(); -} -Object.defineProperty(Duplex.prototype, 'destroyed', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - if (this._readableState === undefined || this._writableState === undefined) { - return false; - } - return this._readableState.destroyed && this._writableState.destroyed; - }, - set: function set(value) { - // we ignore the value if the stream - // has not been initialized yet - if (this._readableState === undefined || this._writableState === undefined) { - return; - } - - // backward compatibility, the user is explicitly - // managing destroyed - this._readableState.destroyed = value; - this._writableState.destroyed = value; - } -}); - -/***/ }), -/* 18 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = OneOf; - -// extends ReflectionObject -var ReflectionObject = __webpack_require__(13); -((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = "OneOf"; - -var Field = __webpack_require__(11), - util = __webpack_require__(0); - -/** - * Constructs a new oneof instance. - * @classdesc Reflected oneof. - * @extends ReflectionObject - * @constructor - * @param {string} name Oneof name - * @param {string[]|Object.} [fieldNames] Field names - * @param {Object.} [options] Declared options - * @param {string} [comment] Comment associated with this field - */ -function OneOf(name, fieldNames, options, comment) { - if (!Array.isArray(fieldNames)) { - options = fieldNames; - fieldNames = undefined; - } - ReflectionObject.call(this, name, options); - - /* istanbul ignore if */ - if (!(fieldNames === undefined || Array.isArray(fieldNames))) - throw TypeError("fieldNames must be an Array"); - - /** - * Field names that belong to this oneof. - * @type {string[]} - */ - this.oneof = fieldNames || []; // toJSON, marker - - /** - * Fields that belong to this oneof as an array for iteration. - * @type {Field[]} - * @readonly - */ - this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent - - /** - * Comment for this field. - * @type {string|null} - */ - this.comment = comment; -} - -/** - * Oneof descriptor. - * @interface IOneOf - * @property {Array.} oneof Oneof field names - * @property {Object.} [options] Oneof options - */ - -/** - * Constructs a oneof from a oneof descriptor. - * @param {string} name Oneof name - * @param {IOneOf} json Oneof descriptor - * @returns {OneOf} Created oneof - * @throws {TypeError} If arguments are invalid - */ -OneOf.fromJSON = function fromJSON(name, json) { - return new OneOf(name, json.oneof, json.options, json.comment); -}; - -/** - * Converts this oneof to a oneof descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IOneOf} Oneof descriptor - */ -OneOf.prototype.toJSON = function toJSON(toJSONOptions) { - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "options" , this.options, - "oneof" , this.oneof, - "comment" , keepComments ? this.comment : undefined - ]); -}; - -/** - * Adds the fields of the specified oneof to the parent if not already done so. - * @param {OneOf} oneof The oneof - * @returns {undefined} - * @inner - * @ignore - */ -function addFieldsToParent(oneof) { - if (oneof.parent) - for (var i = 0; i < oneof.fieldsArray.length; ++i) - if (!oneof.fieldsArray[i].parent) - oneof.parent.add(oneof.fieldsArray[i]); -} - -/** - * Adds a field to this oneof and removes it from its current parent, if any. - * @param {Field} field Field to add - * @returns {OneOf} `this` - */ -OneOf.prototype.add = function add(field) { - - /* istanbul ignore if */ - if (!(field instanceof Field)) - throw TypeError("field must be a Field"); - - if (field.parent && field.parent !== this.parent) - field.parent.remove(field); - this.oneof.push(field.name); - this.fieldsArray.push(field); - field.partOf = this; // field.parent remains null - addFieldsToParent(this); - return this; -}; - -/** - * Removes a field from this oneof and puts it back to the oneof's parent. - * @param {Field} field Field to remove - * @returns {OneOf} `this` - */ -OneOf.prototype.remove = function remove(field) { - - /* istanbul ignore if */ - if (!(field instanceof Field)) - throw TypeError("field must be a Field"); - - var index = this.fieldsArray.indexOf(field); - - /* istanbul ignore if */ - if (index < 0) - throw Error(field + " is not a member of " + this); - - this.fieldsArray.splice(index, 1); - index = this.oneof.indexOf(field.name); - - /* istanbul ignore else */ - if (index > -1) // theoretical - this.oneof.splice(index, 1); - - field.partOf = null; - return this; -}; - -/** - * @override - */ -OneOf.prototype.onAdd = function onAdd(parent) { - ReflectionObject.prototype.onAdd.call(this, parent); - var self = this; - // Collect present fields - for (var i = 0; i < this.oneof.length; ++i) { - var field = parent.get(this.oneof[i]); - if (field && !field.partOf) { - field.partOf = self; - self.fieldsArray.push(field); - } - } - // Add not yet present fields - addFieldsToParent(this); -}; - -/** - * @override - */ -OneOf.prototype.onRemove = function onRemove(parent) { - for (var i = 0, field; i < this.fieldsArray.length; ++i) - if ((field = this.fieldsArray[i]).parent) - field.parent.remove(field); - ReflectionObject.prototype.onRemove.call(this, parent); -}; - -/** - * Decorator function as returned by {@link OneOf.d} (TypeScript). - * @typedef OneOfDecorator - * @type {function} - * @param {Object} prototype Target prototype - * @param {string} oneofName OneOf name - * @returns {undefined} - */ - -/** - * OneOf decorator (TypeScript). - * @function - * @param {...string} fieldNames Field names - * @returns {OneOfDecorator} Decorator function - * @template T extends string - */ -OneOf.d = function decorateOneOf() { - var fieldNames = new Array(arguments.length), - index = 0; - while (index < arguments.length) - fieldNames[index] = arguments[index++]; - return function oneOfDecorator(prototype, oneofName) { - util.decorateType(prototype.constructor) - .add(new OneOf(oneofName, fieldNames)); - Object.defineProperty(prototype, oneofName, { - get: util.oneOfGetter(fieldNames), - set: util.oneOfSetter(fieldNames) - }); - }; -}; - - -/***/ }), -/* 19 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(2); -var utils = __webpack_require__(1); -var getNAF = utils.getNAF; -var getJSF = utils.getJSF; -var assert = utils.assert; - -function BaseCurve(type, conf) { - this.type = type; - this.p = new BN(conf.p, 16); - - // Use Montgomery, when there is no fast reduction for the prime - this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p); - - // Useful for many curves - this.zero = new BN(0).toRed(this.red); - this.one = new BN(1).toRed(this.red); - this.two = new BN(2).toRed(this.red); - - // Curve configuration, optional - this.n = conf.n && new BN(conf.n, 16); - this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed); - - // Temporary arrays - this._wnafT1 = new Array(4); - this._wnafT2 = new Array(4); - this._wnafT3 = new Array(4); - this._wnafT4 = new Array(4); - - this._bitLength = this.n ? this.n.bitLength() : 0; - - // Generalized Greg Maxwell's trick - var adjustCount = this.n && this.p.div(this.n); - if (!adjustCount || adjustCount.cmpn(100) > 0) { - this.redN = null; - } else { - this._maxwellTrick = true; - this.redN = this.n.toRed(this.red); - } -} -module.exports = BaseCurve; - -BaseCurve.prototype.point = function point() { - throw new Error('Not implemented'); -}; - -BaseCurve.prototype.validate = function validate() { - throw new Error('Not implemented'); -}; - -BaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) { - assert(p.precomputed); - var doubles = p._getDoubles(); - - var naf = getNAF(k, 1, this._bitLength); - var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1); - I /= 3; - - // Translate into more windowed form - var repr = []; - var j; - var nafW; - for (j = 0; j < naf.length; j += doubles.step) { - nafW = 0; - for (var l = j + doubles.step - 1; l >= j; l--) - nafW = (nafW << 1) + naf[l]; - repr.push(nafW); - } - - var a = this.jpoint(null, null, null); - var b = this.jpoint(null, null, null); - for (var i = I; i > 0; i--) { - for (j = 0; j < repr.length; j++) { - nafW = repr[j]; - if (nafW === i) - b = b.mixedAdd(doubles.points[j]); - else if (nafW === -i) - b = b.mixedAdd(doubles.points[j].neg()); - } - a = a.add(b); - } - return a.toP(); -}; - -BaseCurve.prototype._wnafMul = function _wnafMul(p, k) { - var w = 4; - - // Precompute window - var nafPoints = p._getNAFPoints(w); - w = nafPoints.wnd; - var wnd = nafPoints.points; - - // Get NAF form - var naf = getNAF(k, w, this._bitLength); - - // Add `this`*(N+1) for every w-NAF index - var acc = this.jpoint(null, null, null); - for (var i = naf.length - 1; i >= 0; i--) { - // Count zeroes - for (var l = 0; i >= 0 && naf[i] === 0; i--) - l++; - if (i >= 0) - l++; - acc = acc.dblp(l); - - if (i < 0) - break; - var z = naf[i]; - assert(z !== 0); - if (p.type === 'affine') { - // J +- P - if (z > 0) - acc = acc.mixedAdd(wnd[(z - 1) >> 1]); - else - acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()); - } else { - // J +- J - if (z > 0) - acc = acc.add(wnd[(z - 1) >> 1]); - else - acc = acc.add(wnd[(-z - 1) >> 1].neg()); - } - } - return p.type === 'affine' ? acc.toP() : acc; -}; - -BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW, - points, - coeffs, - len, - jacobianResult) { - var wndWidth = this._wnafT1; - var wnd = this._wnafT2; - var naf = this._wnafT3; - - // Fill all arrays - var max = 0; - var i; - var j; - var p; - for (i = 0; i < len; i++) { - p = points[i]; - var nafPoints = p._getNAFPoints(defW); - wndWidth[i] = nafPoints.wnd; - wnd[i] = nafPoints.points; - } - - // Comb small window NAFs - for (i = len - 1; i >= 1; i -= 2) { - var a = i - 1; - var b = i; - if (wndWidth[a] !== 1 || wndWidth[b] !== 1) { - naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength); - naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength); - max = Math.max(naf[a].length, max); - max = Math.max(naf[b].length, max); - continue; - } - - var comb = [ - points[a], /* 1 */ - null, /* 3 */ - null, /* 5 */ - points[b], /* 7 */ - ]; - - // Try to avoid Projective points, if possible - if (points[a].y.cmp(points[b].y) === 0) { - comb[1] = points[a].add(points[b]); - comb[2] = points[a].toJ().mixedAdd(points[b].neg()); - } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) { - comb[1] = points[a].toJ().mixedAdd(points[b]); - comb[2] = points[a].add(points[b].neg()); - } else { - comb[1] = points[a].toJ().mixedAdd(points[b]); - comb[2] = points[a].toJ().mixedAdd(points[b].neg()); - } - - var index = [ - -3, /* -1 -1 */ - -1, /* -1 0 */ - -5, /* -1 1 */ - -7, /* 0 -1 */ - 0, /* 0 0 */ - 7, /* 0 1 */ - 5, /* 1 -1 */ - 1, /* 1 0 */ - 3, /* 1 1 */ - ]; - - var jsf = getJSF(coeffs[a], coeffs[b]); - max = Math.max(jsf[0].length, max); - naf[a] = new Array(max); - naf[b] = new Array(max); - for (j = 0; j < max; j++) { - var ja = jsf[0][j] | 0; - var jb = jsf[1][j] | 0; - - naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]; - naf[b][j] = 0; - wnd[a] = comb; - } - } - - var acc = this.jpoint(null, null, null); - var tmp = this._wnafT4; - for (i = max; i >= 0; i--) { - var k = 0; - - while (i >= 0) { - var zero = true; - for (j = 0; j < len; j++) { - tmp[j] = naf[j][i] | 0; - if (tmp[j] !== 0) - zero = false; - } - if (!zero) - break; - k++; - i--; - } - if (i >= 0) - k++; - acc = acc.dblp(k); - if (i < 0) - break; - - for (j = 0; j < len; j++) { - var z = tmp[j]; - p; - if (z === 0) - continue; - else if (z > 0) - p = wnd[j][(z - 1) >> 1]; - else if (z < 0) - p = wnd[j][(-z - 1) >> 1].neg(); - - if (p.type === 'affine') - acc = acc.mixedAdd(p); - else - acc = acc.add(p); - } - } - // Zeroify references - for (i = 0; i < len; i++) - wnd[i] = null; - - if (jacobianResult) - return acc; - else - return acc.toP(); -}; - -function BasePoint(curve, type) { - this.curve = curve; - this.type = type; - this.precomputed = null; -} -BaseCurve.BasePoint = BasePoint; - -BasePoint.prototype.eq = function eq(/*other*/) { - throw new Error('Not implemented'); -}; - -BasePoint.prototype.validate = function validate() { - return this.curve.validate(this); -}; - -BaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) { - bytes = utils.toArray(bytes, enc); - - var len = this.p.byteLength(); - - // uncompressed, hybrid-odd, hybrid-even - if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) && - bytes.length - 1 === 2 * len) { - if (bytes[0] === 0x06) - assert(bytes[bytes.length - 1] % 2 === 0); - else if (bytes[0] === 0x07) - assert(bytes[bytes.length - 1] % 2 === 1); - - var res = this.point(bytes.slice(1, 1 + len), - bytes.slice(1 + len, 1 + 2 * len)); - - return res; - } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) && - bytes.length - 1 === len) { - return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03); - } - throw new Error('Unknown point format'); -}; - -BasePoint.prototype.encodeCompressed = function encodeCompressed(enc) { - return this.encode(enc, true); -}; - -BasePoint.prototype._encode = function _encode(compact) { - var len = this.curve.p.byteLength(); - var x = this.getX().toArray('be', len); - - if (compact) - return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x); - - return [ 0x04 ].concat(x, this.getY().toArray('be', len)); -}; - -BasePoint.prototype.encode = function encode(enc, compact) { - return utils.encode(this._encode(compact), enc); -}; - -BasePoint.prototype.precompute = function precompute(power) { - if (this.precomputed) - return this; - - var precomputed = { - doubles: null, - naf: null, - beta: null, - }; - precomputed.naf = this._getNAFPoints(8); - precomputed.doubles = this._getDoubles(4, power); - precomputed.beta = this._getBeta(); - this.precomputed = precomputed; - - return this; -}; - -BasePoint.prototype._hasDoubles = function _hasDoubles(k) { - if (!this.precomputed) - return false; - - var doubles = this.precomputed.doubles; - if (!doubles) - return false; - - return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step); -}; - -BasePoint.prototype._getDoubles = function _getDoubles(step, power) { - if (this.precomputed && this.precomputed.doubles) - return this.precomputed.doubles; - - var doubles = [ this ]; - var acc = this; - for (var i = 0; i < power; i += step) { - for (var j = 0; j < step; j++) - acc = acc.dbl(); - doubles.push(acc); - } - return { - step: step, - points: doubles, - }; -}; - -BasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) { - if (this.precomputed && this.precomputed.naf) - return this.precomputed.naf; - - var res = [ this ]; - var max = (1 << wnd) - 1; - var dbl = max === 1 ? null : this.dbl(); - for (var i = 1; i < max; i++) - res[i] = res[i - 1].add(dbl); - return { - wnd: wnd, - points: res, - }; -}; - -BasePoint.prototype._getBeta = function _getBeta() { - return null; -}; - -BasePoint.prototype.dblp = function dblp(k) { - var r = this; - for (var i = 0; i < k; i++) - r = r.dbl(); - return r; -}; - - -/***/ }), -/* 20 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var assert = __webpack_require__(12); - -function BlockHash() { - this.pending = null; - this.pendingTotal = 0; - this.blockSize = this.constructor.blockSize; - this.outSize = this.constructor.outSize; - this.hmacStrength = this.constructor.hmacStrength; - this.padLength = this.constructor.padLength / 8; - this.endian = 'big'; - - this._delta8 = this.blockSize / 8; - this._delta32 = this.blockSize / 32; -} -exports.BlockHash = BlockHash; - -BlockHash.prototype.update = function update(msg, enc) { - // Convert message to array, pad it, and join into 32bit blocks - msg = utils.toArray(msg, enc); - if (!this.pending) - this.pending = msg; - else - this.pending = this.pending.concat(msg); - this.pendingTotal += msg.length; - - // Enough data, try updating - if (this.pending.length >= this._delta8) { - msg = this.pending; - - // Process pending data in blocks - var r = msg.length % this._delta8; - this.pending = msg.slice(msg.length - r, msg.length); - if (this.pending.length === 0) - this.pending = null; - - msg = utils.join32(msg, 0, msg.length - r, this.endian); - for (var i = 0; i < msg.length; i += this._delta32) - this._update(msg, i, i + this._delta32); - } - - return this; -}; - -BlockHash.prototype.digest = function digest(enc) { - this.update(this._pad()); - assert(this.pending === null); - - return this._digest(enc); -}; - -BlockHash.prototype._pad = function pad() { - var len = this.pendingTotal; - var bytes = this._delta8; - var k = bytes - ((len + this.padLength) % bytes); - var res = new Array(k + this.padLength); - res[0] = 0x80; - for (var i = 1; i < k; i++) - res[i] = 0; - - // Append length - len <<= 3; - if (this.endian === 'big') { - for (var t = 8; t < this.padLength; t++) - res[i++] = 0; - - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - res[i++] = (len >>> 24) & 0xff; - res[i++] = (len >>> 16) & 0xff; - res[i++] = (len >>> 8) & 0xff; - res[i++] = len & 0xff; - } else { - res[i++] = len & 0xff; - res[i++] = (len >>> 8) & 0xff; - res[i++] = (len >>> 16) & 0xff; - res[i++] = (len >>> 24) & 0xff; - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - - for (t = 8; t < this.padLength; t++) - res[i++] = 0; - } - - return res; -}; - - -/***/ }), -/* 21 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Writer; - -var util = __webpack_require__(5); - -var BufferWriter; // cyclic - -var LongBits = util.LongBits, - base64 = util.base64, - utf8 = util.utf8; - -/** - * Constructs a new writer operation instance. - * @classdesc Scheduled writer operation. - * @constructor - * @param {function(*, Uint8Array, number)} fn Function to call - * @param {number} len Value byte length - * @param {*} val Value to write - * @ignore - */ -function Op(fn, len, val) { - - /** - * Function to call. - * @type {function(Uint8Array, number, *)} - */ - this.fn = fn; - - /** - * Value byte length. - * @type {number} - */ - this.len = len; - - /** - * Next operation. - * @type {Writer.Op|undefined} - */ - this.next = undefined; - - /** - * Value to write. - * @type {*} - */ - this.val = val; // type varies -} - -/* istanbul ignore next */ -function noop() {} // eslint-disable-line no-empty-function - -/** - * Constructs a new writer state instance. - * @classdesc Copied writer state. - * @memberof Writer - * @constructor - * @param {Writer} writer Writer to copy state from - * @ignore - */ -function State(writer) { - - /** - * Current head. - * @type {Writer.Op} - */ - this.head = writer.head; - - /** - * Current tail. - * @type {Writer.Op} - */ - this.tail = writer.tail; - - /** - * Current buffer length. - * @type {number} - */ - this.len = writer.len; - - /** - * Next state. - * @type {State|null} - */ - this.next = writer.states; -} - -/** - * Constructs a new writer instance. - * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`. - * @constructor - */ -function Writer() { - - /** - * Current length. - * @type {number} - */ - this.len = 0; - - /** - * Operations head. - * @type {Object} - */ - this.head = new Op(noop, 0, 0); - - /** - * Operations tail - * @type {Object} - */ - this.tail = this.head; - - /** - * Linked forked states. - * @type {Object|null} - */ - this.states = null; - - // When a value is written, the writer calculates its byte length and puts it into a linked - // list of operations to perform when finish() is called. This both allows us to allocate - // buffers of the exact required size and reduces the amount of work we have to do compared - // to first calculating over objects and then encoding over objects. In our case, the encoding - // part is just a linked list walk calling operations with already prepared values. -} - -/** - * Creates a new writer. - * @function - * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer} - */ -Writer.create = util.Buffer - ? function create_buffer_setup() { - return (Writer.create = function create_buffer() { - return new BufferWriter(); - })(); - } - /* istanbul ignore next */ - : function create_array() { - return new Writer(); - }; - -/** - * Allocates a buffer of the specified size. - * @param {number} size Buffer size - * @returns {Uint8Array} Buffer - */ -Writer.alloc = function alloc(size) { - return new util.Array(size); -}; - -// Use Uint8Array buffer pool in the browser, just like node does with buffers -/* istanbul ignore else */ -if (util.Array !== Array) - Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray); - -/** - * Pushes a new operation to the queue. - * @param {function(Uint8Array, number, *)} fn Function to call - * @param {number} len Value byte length - * @param {number} val Value to write - * @returns {Writer} `this` - * @private - */ -Writer.prototype._push = function push(fn, len, val) { - this.tail = this.tail.next = new Op(fn, len, val); - this.len += len; - return this; -}; - -function writeByte(val, buf, pos) { - buf[pos] = val & 255; -} - -function writeVarint32(val, buf, pos) { - while (val > 127) { - buf[pos++] = val & 127 | 128; - val >>>= 7; - } - buf[pos] = val; -} - -/** - * Constructs a new varint writer operation instance. - * @classdesc Scheduled varint writer operation. - * @extends Op - * @constructor - * @param {number} len Value byte length - * @param {number} val Value to write - * @ignore - */ -function VarintOp(len, val) { - this.len = len; - this.next = undefined; - this.val = val; -} - -VarintOp.prototype = Object.create(Op.prototype); -VarintOp.prototype.fn = writeVarint32; - -/** - * Writes an unsigned 32 bit value as a varint. - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.uint32 = function write_uint32(value) { - // here, the call to this.push has been inlined and a varint specific Op subclass is used. - // uint32 is by far the most frequently used operation and benefits significantly from this. - this.len += (this.tail = this.tail.next = new VarintOp( - (value = value >>> 0) - < 128 ? 1 - : value < 16384 ? 2 - : value < 2097152 ? 3 - : value < 268435456 ? 4 - : 5, - value)).len; - return this; -}; - -/** - * Writes a signed 32 bit value as a varint. - * @function - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.int32 = function write_int32(value) { - return value < 0 - ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec - : this.uint32(value); -}; - -/** - * Writes a 32 bit value as a varint, zig-zag encoded. - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.sint32 = function write_sint32(value) { - return this.uint32((value << 1 ^ value >> 31) >>> 0); -}; - -function writeVarint64(val, buf, pos) { - while (val.hi) { - buf[pos++] = val.lo & 127 | 128; - val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0; - val.hi >>>= 7; - } - while (val.lo > 127) { - buf[pos++] = val.lo & 127 | 128; - val.lo = val.lo >>> 7; - } - buf[pos++] = val.lo; -} - -/** - * Writes an unsigned 64 bit value as a varint. - * @param {Long|number|string} value Value to write - * @returns {Writer} `this` - * @throws {TypeError} If `value` is a string and no long library is present. - */ -Writer.prototype.uint64 = function write_uint64(value) { - var bits = LongBits.from(value); - return this._push(writeVarint64, bits.length(), bits); -}; - -/** - * Writes a signed 64 bit value as a varint. - * @function - * @param {Long|number|string} value Value to write - * @returns {Writer} `this` - * @throws {TypeError} If `value` is a string and no long library is present. - */ -Writer.prototype.int64 = Writer.prototype.uint64; - -/** - * Writes a signed 64 bit value as a varint, zig-zag encoded. - * @param {Long|number|string} value Value to write - * @returns {Writer} `this` - * @throws {TypeError} If `value` is a string and no long library is present. - */ -Writer.prototype.sint64 = function write_sint64(value) { - var bits = LongBits.from(value).zzEncode(); - return this._push(writeVarint64, bits.length(), bits); -}; - -/** - * Writes a boolish value as a varint. - * @param {boolean} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.bool = function write_bool(value) { - return this._push(writeByte, 1, value ? 1 : 0); -}; - -function writeFixed32(val, buf, pos) { - buf[pos ] = val & 255; - buf[pos + 1] = val >>> 8 & 255; - buf[pos + 2] = val >>> 16 & 255; - buf[pos + 3] = val >>> 24; -} - -/** - * Writes an unsigned 32 bit value as fixed 32 bits. - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.fixed32 = function write_fixed32(value) { - return this._push(writeFixed32, 4, value >>> 0); -}; - -/** - * Writes a signed 32 bit value as fixed 32 bits. - * @function - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.sfixed32 = Writer.prototype.fixed32; - -/** - * Writes an unsigned 64 bit value as fixed 64 bits. - * @param {Long|number|string} value Value to write - * @returns {Writer} `this` - * @throws {TypeError} If `value` is a string and no long library is present. - */ -Writer.prototype.fixed64 = function write_fixed64(value) { - var bits = LongBits.from(value); - return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi); -}; - -/** - * Writes a signed 64 bit value as fixed 64 bits. - * @function - * @param {Long|number|string} value Value to write - * @returns {Writer} `this` - * @throws {TypeError} If `value` is a string and no long library is present. - */ -Writer.prototype.sfixed64 = Writer.prototype.fixed64; - -/** - * Writes a float (32 bit). - * @function - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.float = function write_float(value) { - return this._push(util.float.writeFloatLE, 4, value); -}; - -/** - * Writes a double (64 bit float). - * @function - * @param {number} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.double = function write_double(value) { - return this._push(util.float.writeDoubleLE, 8, value); -}; - -var writeBytes = util.Array.prototype.set - ? function writeBytes_set(val, buf, pos) { - buf.set(val, pos); // also works for plain array values - } - /* istanbul ignore next */ - : function writeBytes_for(val, buf, pos) { - for (var i = 0; i < val.length; ++i) - buf[pos + i] = val[i]; - }; - -/** - * Writes a sequence of bytes. - * @param {Uint8Array|string} value Buffer or base64 encoded string to write - * @returns {Writer} `this` - */ -Writer.prototype.bytes = function write_bytes(value) { - var len = value.length >>> 0; - if (!len) - return this._push(writeByte, 1, 0); - if (util.isString(value)) { - var buf = Writer.alloc(len = base64.length(value)); - base64.decode(value, buf, 0); - value = buf; - } - return this.uint32(len)._push(writeBytes, len, value); -}; - -/** - * Writes a string. - * @param {string} value Value to write - * @returns {Writer} `this` - */ -Writer.prototype.string = function write_string(value) { - var len = utf8.length(value); - return len - ? this.uint32(len)._push(utf8.write, len, value) - : this._push(writeByte, 1, 0); -}; - -/** - * Forks this writer's state by pushing it to a stack. - * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state. - * @returns {Writer} `this` - */ -Writer.prototype.fork = function fork() { - this.states = new State(this); - this.head = this.tail = new Op(noop, 0, 0); - this.len = 0; - return this; -}; - -/** - * Resets this instance to the last state. - * @returns {Writer} `this` - */ -Writer.prototype.reset = function reset() { - if (this.states) { - this.head = this.states.head; - this.tail = this.states.tail; - this.len = this.states.len; - this.states = this.states.next; - } else { - this.head = this.tail = new Op(noop, 0, 0); - this.len = 0; - } - return this; -}; - -/** - * Resets to the last state and appends the fork state's current write length as a varint followed by its operations. - * @returns {Writer} `this` - */ -Writer.prototype.ldelim = function ldelim() { - var head = this.head, - tail = this.tail, - len = this.len; - this.reset().uint32(len); - if (len) { - this.tail.next = head.next; // skip noop - this.tail = tail; - this.len += len; - } - return this; -}; - -/** - * Finishes the write operation. - * @returns {Uint8Array} Finished buffer - */ -Writer.prototype.finish = function finish() { - var head = this.head.next, // skip noop - buf = this.constructor.alloc(this.len), - pos = 0; - while (head) { - head.fn(head.val, buf, pos); - pos += head.len; - head = head.next; - } - // this.head = this.tail = null; - return buf; -}; - -Writer._configure = function(BufferWriter_) { - BufferWriter = BufferWriter_; -}; - - -/***/ }), -/* 22 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Reader; - -var util = __webpack_require__(5); - -var BufferReader; // cyclic - -var LongBits = util.LongBits, - utf8 = util.utf8; - -/* istanbul ignore next */ -function indexOutOfRange(reader, writeLength) { - return RangeError("index out of range: " + reader.pos + " + " + (writeLength || 1) + " > " + reader.len); -} - -/** - * Constructs a new reader instance using the specified buffer. - * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`. - * @constructor - * @param {Uint8Array} buffer Buffer to read from - */ -function Reader(buffer) { - - /** - * Read buffer. - * @type {Uint8Array} - */ - this.buf = buffer; - - /** - * Read buffer position. - * @type {number} - */ - this.pos = 0; - - /** - * Read buffer length. - * @type {number} - */ - this.len = buffer.length; -} - -var create_array = typeof Uint8Array !== "undefined" - ? function create_typed_array(buffer) { - if (buffer instanceof Uint8Array || Array.isArray(buffer)) - return new Reader(buffer); - throw Error("illegal buffer"); - } - /* istanbul ignore next */ - : function create_array(buffer) { - if (Array.isArray(buffer)) - return new Reader(buffer); - throw Error("illegal buffer"); - }; - -/** - * Creates a new reader using the specified buffer. - * @function - * @param {Uint8Array|Buffer} buffer Buffer to read from - * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader} - * @throws {Error} If `buffer` is not a valid buffer - */ -Reader.create = util.Buffer - ? function create_buffer_setup(buffer) { - return (Reader.create = function create_buffer(buffer) { - return util.Buffer.isBuffer(buffer) - ? new BufferReader(buffer) - /* istanbul ignore next */ - : create_array(buffer); - })(buffer); - } - /* istanbul ignore next */ - : create_array; - -Reader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice; - -/** - * Reads a varint as an unsigned 32 bit value. - * @function - * @returns {number} Value read - */ -Reader.prototype.uint32 = (function read_uint32_setup() { - var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!) - return function read_uint32() { - value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value; - value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value; - value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value; - value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value; - value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value; - - /* istanbul ignore if */ - if ((this.pos += 5) > this.len) { - this.pos = this.len; - throw indexOutOfRange(this, 10); - } - return value; - }; -})(); - -/** - * Reads a varint as a signed 32 bit value. - * @returns {number} Value read - */ -Reader.prototype.int32 = function read_int32() { - return this.uint32() | 0; -}; - -/** - * Reads a zig-zag encoded varint as a signed 32 bit value. - * @returns {number} Value read - */ -Reader.prototype.sint32 = function read_sint32() { - var value = this.uint32(); - return value >>> 1 ^ -(value & 1) | 0; -}; - -/* eslint-disable no-invalid-this */ - -function readLongVarint() { - // tends to deopt with local vars for octet etc. - var bits = new LongBits(0, 0); - var i = 0; - if (this.len - this.pos > 4) { // fast route (lo) - for (; i < 4; ++i) { - // 1st..4th - bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0; - if (this.buf[this.pos++] < 128) - return bits; - } - // 5th - bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0; - bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0; - if (this.buf[this.pos++] < 128) - return bits; - i = 0; - } else { - for (; i < 3; ++i) { - /* istanbul ignore if */ - if (this.pos >= this.len) - throw indexOutOfRange(this); - // 1st..3th - bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0; - if (this.buf[this.pos++] < 128) - return bits; - } - // 4th - bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0; - return bits; - } - if (this.len - this.pos > 4) { // fast route (hi) - for (; i < 5; ++i) { - // 6th..10th - bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0; - if (this.buf[this.pos++] < 128) - return bits; - } - } else { - for (; i < 5; ++i) { - /* istanbul ignore if */ - if (this.pos >= this.len) - throw indexOutOfRange(this); - // 6th..10th - bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0; - if (this.buf[this.pos++] < 128) - return bits; - } - } - /* istanbul ignore next */ - throw Error("invalid varint encoding"); -} - -/* eslint-enable no-invalid-this */ - -/** - * Reads a varint as a signed 64 bit value. - * @name Reader#int64 - * @function - * @returns {Long} Value read - */ - -/** - * Reads a varint as an unsigned 64 bit value. - * @name Reader#uint64 - * @function - * @returns {Long} Value read - */ - -/** - * Reads a zig-zag encoded varint as a signed 64 bit value. - * @name Reader#sint64 - * @function - * @returns {Long} Value read - */ - -/** - * Reads a varint as a boolean. - * @returns {boolean} Value read - */ -Reader.prototype.bool = function read_bool() { - return this.uint32() !== 0; -}; - -function readFixed32_end(buf, end) { // note that this uses `end`, not `pos` - return (buf[end - 4] - | buf[end - 3] << 8 - | buf[end - 2] << 16 - | buf[end - 1] << 24) >>> 0; -} - -/** - * Reads fixed 32 bits as an unsigned 32 bit integer. - * @returns {number} Value read - */ -Reader.prototype.fixed32 = function read_fixed32() { - - /* istanbul ignore if */ - if (this.pos + 4 > this.len) - throw indexOutOfRange(this, 4); - - return readFixed32_end(this.buf, this.pos += 4); -}; - -/** - * Reads fixed 32 bits as a signed 32 bit integer. - * @returns {number} Value read - */ -Reader.prototype.sfixed32 = function read_sfixed32() { - - /* istanbul ignore if */ - if (this.pos + 4 > this.len) - throw indexOutOfRange(this, 4); - - return readFixed32_end(this.buf, this.pos += 4) | 0; -}; - -/* eslint-disable no-invalid-this */ - -function readFixed64(/* this: Reader */) { - - /* istanbul ignore if */ - if (this.pos + 8 > this.len) - throw indexOutOfRange(this, 8); - - return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4)); -} - -/* eslint-enable no-invalid-this */ - -/** - * Reads fixed 64 bits. - * @name Reader#fixed64 - * @function - * @returns {Long} Value read - */ - -/** - * Reads zig-zag encoded fixed 64 bits. - * @name Reader#sfixed64 - * @function - * @returns {Long} Value read - */ - -/** - * Reads a float (32 bit) as a number. - * @function - * @returns {number} Value read - */ -Reader.prototype.float = function read_float() { - - /* istanbul ignore if */ - if (this.pos + 4 > this.len) - throw indexOutOfRange(this, 4); - - var value = util.float.readFloatLE(this.buf, this.pos); - this.pos += 4; - return value; -}; - -/** - * Reads a double (64 bit float) as a number. - * @function - * @returns {number} Value read - */ -Reader.prototype.double = function read_double() { - - /* istanbul ignore if */ - if (this.pos + 8 > this.len) - throw indexOutOfRange(this, 4); - - var value = util.float.readDoubleLE(this.buf, this.pos); - this.pos += 8; - return value; -}; - -/** - * Reads a sequence of bytes preceeded by its length as a varint. - * @returns {Uint8Array} Value read - */ -Reader.prototype.bytes = function read_bytes() { - var length = this.uint32(), - start = this.pos, - end = this.pos + length; - - /* istanbul ignore if */ - if (end > this.len) - throw indexOutOfRange(this, length); - - this.pos += length; - if (Array.isArray(this.buf)) // plain array - return this.buf.slice(start, end); - return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1 - ? new this.buf.constructor(0) - : this._slice.call(this.buf, start, end); -}; - -/** - * Reads a string preceeded by its byte length as a varint. - * @returns {string} Value read - */ -Reader.prototype.string = function read_string() { - var bytes = this.bytes(); - return utf8.read(bytes, 0, bytes.length); -}; - -/** - * Skips the specified number of bytes if specified, otherwise skips a varint. - * @param {number} [length] Length if known, otherwise a varint is assumed - * @returns {Reader} `this` - */ -Reader.prototype.skip = function skip(length) { - if (typeof length === "number") { - /* istanbul ignore if */ - if (this.pos + length > this.len) - throw indexOutOfRange(this, length); - this.pos += length; - } else { - do { - /* istanbul ignore if */ - if (this.pos >= this.len) - throw indexOutOfRange(this); - } while (this.buf[this.pos++] & 128); - } - return this; -}; - -/** - * Skips the next element of the specified wire type. - * @param {number} wireType Wire type received - * @returns {Reader} `this` - */ -Reader.prototype.skipType = function(wireType) { - switch (wireType) { - case 0: - this.skip(); - break; - case 1: - this.skip(8); - break; - case 2: - this.skip(this.uint32()); - break; - case 3: - while ((wireType = this.uint32() & 7) !== 4) { - this.skipType(wireType); - } - break; - case 5: - this.skip(4); - break; - - /* istanbul ignore next */ - default: - throw Error("invalid wire type " + wireType + " at offset " + this.pos); - } - return this; -}; - -Reader._configure = function(BufferReader_) { - BufferReader = BufferReader_; - - var fn = util.Long ? "toLong" : /* istanbul ignore next */ "toNumber"; - util.merge(Reader.prototype, { - - int64: function read_int64() { - return readLongVarint.call(this)[fn](false); - }, - - uint64: function read_uint64() { - return readLongVarint.call(this)[fn](true); - }, - - sint64: function read_sint64() { - return readLongVarint.call(this).zzDecode()[fn](false); - }, - - fixed64: function read_fixed64() { - return readFixed64.call(this)[fn](true); - }, - - sfixed64: function read_sfixed64() { - return readFixed64.call(this)[fn](false); - } - - }); -}; - - -/***/ }), -/* 23 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Type; - -// extends Namespace -var Namespace = __webpack_require__(16); -((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = "Type"; - -var Enum = __webpack_require__(3), - OneOf = __webpack_require__(18), - Field = __webpack_require__(11), - MapField = __webpack_require__(24), - Service = __webpack_require__(25), - Message = __webpack_require__(27), - Reader = __webpack_require__(22), - Writer = __webpack_require__(21), - util = __webpack_require__(0), - encoder = __webpack_require__(42), - decoder = __webpack_require__(43), - verifier = __webpack_require__(44), - converter = __webpack_require__(45), - wrappers = __webpack_require__(46); - -/** - * Constructs a new reflected message type instance. - * @classdesc Reflected message type. - * @extends NamespaceBase - * @constructor - * @param {string} name Message name - * @param {Object.} [options] Declared options - */ -function Type(name, options) { - Namespace.call(this, name, options); - - /** - * Message fields. - * @type {Object.} - */ - this.fields = {}; // toJSON, marker - - /** - * Oneofs declared within this namespace, if any. - * @type {Object.} - */ - this.oneofs = undefined; // toJSON - - /** - * Extension ranges, if any. - * @type {number[][]} - */ - this.extensions = undefined; // toJSON - - /** - * Reserved ranges, if any. - * @type {Array.} - */ - this.reserved = undefined; // toJSON - - /*? - * Whether this type is a legacy group. - * @type {boolean|undefined} - */ - this.group = undefined; // toJSON - - /** - * Cached fields by id. - * @type {Object.|null} - * @private - */ - this._fieldsById = null; - - /** - * Cached fields as an array. - * @type {Field[]|null} - * @private - */ - this._fieldsArray = null; - - /** - * Cached oneofs as an array. - * @type {OneOf[]|null} - * @private - */ - this._oneofsArray = null; - - /** - * Cached constructor. - * @type {Constructor<{}>} - * @private - */ - this._ctor = null; -} - -Object.defineProperties(Type.prototype, { - - /** - * Message fields by id. - * @name Type#fieldsById - * @type {Object.} - * @readonly - */ - fieldsById: { - get: function() { - - /* istanbul ignore if */ - if (this._fieldsById) - return this._fieldsById; - - this._fieldsById = {}; - for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) { - var field = this.fields[names[i]], - id = field.id; - - /* istanbul ignore if */ - if (this._fieldsById[id]) - throw Error("duplicate id " + id + " in " + this); - - this._fieldsById[id] = field; - } - return this._fieldsById; - } - }, - - /** - * Fields of this message as an array for iteration. - * @name Type#fieldsArray - * @type {Field[]} - * @readonly - */ - fieldsArray: { - get: function() { - return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields)); - } - }, - - /** - * Oneofs of this message as an array for iteration. - * @name Type#oneofsArray - * @type {OneOf[]} - * @readonly - */ - oneofsArray: { - get: function() { - return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs)); - } - }, - - /** - * The registered constructor, if any registered, otherwise a generic constructor. - * Assigning a function replaces the internal constructor. If the function does not extend {@link Message} yet, its prototype will be setup accordingly and static methods will be populated. If it already extends {@link Message}, it will just replace the internal constructor. - * @name Type#ctor - * @type {Constructor<{}>} - */ - ctor: { - get: function() { - return this._ctor || (this.ctor = Type.generateConstructor(this)()); - }, - set: function(ctor) { - - // Ensure proper prototype - var prototype = ctor.prototype; - if (!(prototype instanceof Message)) { - (ctor.prototype = new Message()).constructor = ctor; - util.merge(ctor.prototype, prototype); - } - - // Classes and messages reference their reflected type - ctor.$type = ctor.prototype.$type = this; - - // Mix in static methods - util.merge(ctor, Message, true); - - this._ctor = ctor; - - // Messages have non-enumerable default values on their prototype - var i = 0; - for (; i < /* initializes */ this.fieldsArray.length; ++i) - this._fieldsArray[i].resolve(); // ensures a proper value - - // Messages have non-enumerable getters and setters for each virtual oneof field - var ctorProperties = {}; - for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i) - ctorProperties[this._oneofsArray[i].resolve().name] = { - get: util.oneOfGetter(this._oneofsArray[i].oneof), - set: util.oneOfSetter(this._oneofsArray[i].oneof) - }; - if (i) - Object.defineProperties(ctor.prototype, ctorProperties); - } - } -}); - -/** - * Generates a constructor function for the specified type. - * @param {Type} mtype Message type - * @returns {Codegen} Codegen instance - */ -Type.generateConstructor = function generateConstructor(mtype) { - /* eslint-disable no-unexpected-multiline */ - var gen = util.codegen(["p"], mtype.name); - // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype - for (var i = 0, field; i < mtype.fieldsArray.length; ++i) - if ((field = mtype._fieldsArray[i]).map) gen - ("this%s={}", util.safeProp(field.name)); - else if (field.repeated) gen - ("this%s=[]", util.safeProp(field.name)); - return gen - ("if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors - * @property {Object.} fields Field descriptors - * @property {number[][]} [extensions] Extension ranges - * @property {number[][]} [reserved] Reserved ranges - * @property {boolean} [group=false] Whether a legacy group or not - */ - -/** - * Creates a message type from a message type descriptor. - * @param {string} name Message name - * @param {IType} json Message type descriptor - * @returns {Type} Created message type - */ -Type.fromJSON = function fromJSON(name, json) { - var type = new Type(name, json.options); - type.extensions = json.extensions; - type.reserved = json.reserved; - var names = Object.keys(json.fields), - i = 0; - for (; i < names.length; ++i) - type.add( - ( typeof json.fields[names[i]].keyType !== "undefined" - ? MapField.fromJSON - : Field.fromJSON )(names[i], json.fields[names[i]]) - ); - if (json.oneofs) - for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i) - type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]])); - if (json.nested) - for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) { - var nested = json.nested[names[i]]; - type.add( // most to least likely - ( nested.id !== undefined - ? Field.fromJSON - : nested.fields !== undefined - ? Type.fromJSON - : nested.values !== undefined - ? Enum.fromJSON - : nested.methods !== undefined - ? Service.fromJSON - : Namespace.fromJSON )(names[i], nested) - ); - } - if (json.extensions && json.extensions.length) - type.extensions = json.extensions; - if (json.reserved && json.reserved.length) - type.reserved = json.reserved; - if (json.group) - type.group = true; - if (json.comment) - type.comment = json.comment; - return type; -}; - -/** - * Converts this message type to a message type descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IType} Message type descriptor - */ -Type.prototype.toJSON = function toJSON(toJSONOptions) { - var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions); - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "options" , inherited && inherited.options || undefined, - "oneofs" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions), - "fields" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {}, - "extensions" , this.extensions && this.extensions.length ? this.extensions : undefined, - "reserved" , this.reserved && this.reserved.length ? this.reserved : undefined, - "group" , this.group || undefined, - "nested" , inherited && inherited.nested || undefined, - "comment" , keepComments ? this.comment : undefined - ]); -}; - -/** - * @override - */ -Type.prototype.resolveAll = function resolveAll() { - var fields = this.fieldsArray, i = 0; - while (i < fields.length) - fields[i++].resolve(); - var oneofs = this.oneofsArray; i = 0; - while (i < oneofs.length) - oneofs[i++].resolve(); - return Namespace.prototype.resolveAll.call(this); -}; - -/** - * @override - */ -Type.prototype.get = function get(name) { - return this.fields[name] - || this.oneofs && this.oneofs[name] - || this.nested && this.nested[name] - || null; -}; - -/** - * Adds a nested object to this type. - * @param {ReflectionObject} object Nested object to add - * @returns {Type} `this` - * @throws {TypeError} If arguments are invalid - * @throws {Error} If there is already a nested object with this name or, if a field, when there is already a field with this id - */ -Type.prototype.add = function add(object) { - - if (this.get(object.name)) - throw Error("duplicate name '" + object.name + "' in " + this); - - if (object instanceof Field && object.extend === undefined) { - // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects. - // The root object takes care of adding distinct sister-fields to the respective extended - // type instead. - - // avoids calling the getter if not absolutely necessary because it's called quite frequently - if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id]) - throw Error("duplicate id " + object.id + " in " + this); - if (this.isReservedId(object.id)) - throw Error("id " + object.id + " is reserved in " + this); - if (this.isReservedName(object.name)) - throw Error("name '" + object.name + "' is reserved in " + this); - - if (object.parent) - object.parent.remove(object); - this.fields[object.name] = object; - object.message = this; - object.onAdd(this); - return clearCache(this); - } - if (object instanceof OneOf) { - if (!this.oneofs) - this.oneofs = {}; - this.oneofs[object.name] = object; - object.onAdd(this); - return clearCache(this); - } - return Namespace.prototype.add.call(this, object); -}; - -/** - * Removes a nested object from this type. - * @param {ReflectionObject} object Nested object to remove - * @returns {Type} `this` - * @throws {TypeError} If arguments are invalid - * @throws {Error} If `object` is not a member of this type - */ -Type.prototype.remove = function remove(object) { - if (object instanceof Field && object.extend === undefined) { - // See Type#add for the reason why extension fields are excluded here. - - /* istanbul ignore if */ - if (!this.fields || this.fields[object.name] !== object) - throw Error(object + " is not a member of " + this); - - delete this.fields[object.name]; - object.parent = null; - object.onRemove(this); - return clearCache(this); - } - if (object instanceof OneOf) { - - /* istanbul ignore if */ - if (!this.oneofs || this.oneofs[object.name] !== object) - throw Error(object + " is not a member of " + this); - - delete this.oneofs[object.name]; - object.parent = null; - object.onRemove(this); - return clearCache(this); - } - return Namespace.prototype.remove.call(this, object); -}; - -/** - * Tests if the specified id is reserved. - * @param {number} id Id to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -Type.prototype.isReservedId = function isReservedId(id) { - return Namespace.isReservedId(this.reserved, id); -}; - -/** - * Tests if the specified name is reserved. - * @param {string} name Name to test - * @returns {boolean} `true` if reserved, otherwise `false` - */ -Type.prototype.isReservedName = function isReservedName(name) { - return Namespace.isReservedName(this.reserved, name); -}; - -/** - * Creates a new message of this type using the specified properties. - * @param {Object.} [properties] Properties to set - * @returns {Message<{}>} Message instance - */ -Type.prototype.create = function create(properties) { - return new this.ctor(properties); -}; - -/** - * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}. - * @returns {Type} `this` - */ -Type.prototype.setup = function setup() { - // Sets up everything at once so that the prototype chain does not have to be re-evaluated - // multiple times (V8, soft-deopt prototype-check). - - var fullName = this.fullName, - types = []; - for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i) - types.push(this._fieldsArray[i].resolve().resolvedType); - - // Replace setup methods with type-specific generated functions - this.encode = encoder(this)({ - Writer : Writer, - types : types, - util : util - }); - this.decode = decoder(this)({ - Reader : Reader, - types : types, - util : util - }); - this.verify = verifier(this)({ - types : types, - util : util - }); - this.fromObject = converter.fromObject(this)({ - types : types, - util : util - }); - this.toObject = converter.toObject(this)({ - types : types, - util : util - }); - - // Inject custom wrappers for common types - var wrapper = wrappers[fullName]; - if (wrapper) { - var originalThis = Object.create(this); - // if (wrapper.fromObject) { - originalThis.fromObject = this.fromObject; - this.fromObject = wrapper.fromObject.bind(originalThis); - // } - // if (wrapper.toObject) { - originalThis.toObject = this.toObject; - this.toObject = wrapper.toObject.bind(originalThis); - // } - } - - return this; -}; - -/** - * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages. - * @param {Message<{}>|Object.} message Message instance or plain object - * @param {Writer} [writer] Writer to encode to - * @returns {Writer} writer - */ -Type.prototype.encode = function encode_setup(message, writer) { - return this.setup().encode(message, writer); // overrides this method -}; - -/** - * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages. - * @param {Message<{}>|Object.} message Message instance or plain object - * @param {Writer} [writer] Writer to encode to - * @returns {Writer} writer - */ -Type.prototype.encodeDelimited = function encodeDelimited(message, writer) { - return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim(); -}; - -/** - * Decodes a message of this type. - * @param {Reader|Uint8Array} reader Reader or buffer to decode from - * @param {number} [length] Length of the message, if known beforehand - * @returns {Message<{}>} Decoded message - * @throws {Error} If the payload is not a reader or valid buffer - * @throws {util.ProtocolError<{}>} If required fields are missing - */ -Type.prototype.decode = function decode_setup(reader, length) { - return this.setup().decode(reader, length); // overrides this method -}; - -/** - * Decodes a message of this type preceeded by its byte length as a varint. - * @param {Reader|Uint8Array} reader Reader or buffer to decode from - * @returns {Message<{}>} Decoded message - * @throws {Error} If the payload is not a reader or valid buffer - * @throws {util.ProtocolError} If required fields are missing - */ -Type.prototype.decodeDelimited = function decodeDelimited(reader) { - if (!(reader instanceof Reader)) - reader = Reader.create(reader); - return this.decode(reader, reader.uint32()); -}; - -/** - * Verifies that field values are valid and that required fields are present. - * @param {Object.} message Plain object to verify - * @returns {null|string} `null` if valid, otherwise the reason why it is not - */ -Type.prototype.verify = function verify_setup(message) { - return this.setup().verify(message); // overrides this method -}; - -/** - * Creates a new message of this type from a plain object. Also converts values to their respective internal types. - * @param {Object.} object Plain object to convert - * @returns {Message<{}>} Message instance - */ -Type.prototype.fromObject = function fromObject(object) { - return this.setup().fromObject(object); -}; - -/** - * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}. - * @interface IConversionOptions - * @property {Function} [longs] Long conversion type. - * Valid values are `String` and `Number` (the global types). - * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library. - * @property {Function} [enums] Enum value conversion type. - * Only valid value is `String` (the global type). - * Defaults to copy the present value, which is the numeric id. - * @property {Function} [bytes] Bytes value conversion type. - * Valid values are `Array` and (a base64 encoded) `String` (the global types). - * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser. - * @property {boolean} [defaults=false] Also sets default values on the resulting object - * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false` - * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false` - * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any - * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings - */ - -/** - * Creates a plain object from a message of this type. Also converts values to other types if specified. - * @param {Message<{}>} message Message instance - * @param {IConversionOptions} [options] Conversion options - * @returns {Object.} Plain object - */ -Type.prototype.toObject = function toObject(message, options) { - return this.setup().toObject(message, options); -}; - -/** - * Decorator function as returned by {@link Type.d} (TypeScript). - * @typedef TypeDecorator - * @type {function} - * @param {Constructor} target Target constructor - * @returns {undefined} - * @template T extends Message - */ - -/** - * Type decorator (TypeScript). - * @param {string} [typeName] Type name, defaults to the constructor's name - * @returns {TypeDecorator} Decorator function - * @template T extends Message - */ -Type.d = function decorateType(typeName) { - return function typeDecorator(target) { - util.decorateType(target, typeName); - }; -}; - - -/***/ }), -/* 24 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = MapField; - -// extends Field -var Field = __webpack_require__(11); -((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = "MapField"; - -var types = __webpack_require__(14), - util = __webpack_require__(0); - -/** - * Constructs a new map field instance. - * @classdesc Reflected map field. - * @extends FieldBase - * @constructor - * @param {string} name Unique name within its namespace - * @param {number} id Unique id within its namespace - * @param {string} keyType Key type - * @param {string} type Value type - * @param {Object.} [options] Declared options - * @param {string} [comment] Comment associated with this field - */ -function MapField(name, id, keyType, type, options, comment) { - Field.call(this, name, id, type, undefined, undefined, options, comment); - - /* istanbul ignore if */ - if (!util.isString(keyType)) - throw TypeError("keyType must be a string"); - - /** - * Key type. - * @type {string} - */ - this.keyType = keyType; // toJSON, marker - - /** - * Resolved key type if not a basic type. - * @type {ReflectionObject|null} - */ - this.resolvedKeyType = null; - - // Overrides Field#map - this.map = true; -} - -/** - * Map field descriptor. - * @interface IMapField - * @extends {IField} - * @property {string} keyType Key type - */ - -/** - * Extension map field descriptor. - * @interface IExtensionMapField - * @extends IMapField - * @property {string} extend Extended type - */ - -/** - * Constructs a map field from a map field descriptor. - * @param {string} name Field name - * @param {IMapField} json Map field descriptor - * @returns {MapField} Created map field - * @throws {TypeError} If arguments are invalid - */ -MapField.fromJSON = function fromJSON(name, json) { - return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment); -}; - -/** - * Converts this map field to a map field descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IMapField} Map field descriptor - */ -MapField.prototype.toJSON = function toJSON(toJSONOptions) { - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "keyType" , this.keyType, - "type" , this.type, - "id" , this.id, - "extend" , this.extend, - "options" , this.options, - "comment" , keepComments ? this.comment : undefined - ]); -}; - -/** - * @override - */ -MapField.prototype.resolve = function resolve() { - if (this.resolved) - return this; - - // Besides a value type, map fields have a key type that may be "any scalar type except for floating point types and bytes" - if (types.mapKey[this.keyType] === undefined) - throw Error("invalid key type: " + this.keyType); - - return Field.prototype.resolve.call(this); -}; - -/** - * Map field decorator (TypeScript). - * @name MapField.d - * @function - * @param {number} fieldId Field id - * @param {"int32"|"uint32"|"sint32"|"fixed32"|"sfixed32"|"int64"|"uint64"|"sint64"|"fixed64"|"sfixed64"|"bool"|"string"} fieldKeyType Field key type - * @param {"double"|"float"|"int32"|"uint32"|"sint32"|"fixed32"|"sfixed32"|"int64"|"uint64"|"sint64"|"fixed64"|"sfixed64"|"bool"|"string"|"bytes"|Object|Constructor<{}>} fieldValueType Field value type - * @returns {FieldDecorator} Decorator function - * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> } - */ -MapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) { - - // submessage value: decorate the submessage and use its name as the type - if (typeof fieldValueType === "function") - fieldValueType = util.decorateType(fieldValueType).name; - - // enum reference value: create a reflected copy of the enum and keep reuseing it - else if (fieldValueType && typeof fieldValueType === "object") - fieldValueType = util.decorateEnum(fieldValueType).name; - - return function mapFieldDecorator(prototype, fieldName) { - util.decorateType(prototype.constructor) - .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType)); - }; -}; - - -/***/ }), -/* 25 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Service; - -// extends Namespace -var Namespace = __webpack_require__(16); -((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = "Service"; - -var Method = __webpack_require__(26), - util = __webpack_require__(0), - rpc = __webpack_require__(40); - -/** - * Constructs a new service instance. - * @classdesc Reflected service. - * @extends NamespaceBase - * @constructor - * @param {string} name Service name - * @param {Object.} [options] Service options - * @throws {TypeError} If arguments are invalid - */ -function Service(name, options) { - Namespace.call(this, name, options); - - /** - * Service methods. - * @type {Object.} - */ - this.methods = {}; // toJSON, marker - - /** - * Cached methods as an array. - * @type {Method[]|null} - * @private - */ - this._methodsArray = null; -} - -/** - * Service descriptor. - * @interface IService - * @extends INamespace - * @property {Object.} methods Method descriptors - */ - -/** - * Constructs a service from a service descriptor. - * @param {string} name Service name - * @param {IService} json Service descriptor - * @returns {Service} Created service - * @throws {TypeError} If arguments are invalid - */ -Service.fromJSON = function fromJSON(name, json) { - var service = new Service(name, json.options); - /* istanbul ignore else */ - if (json.methods) - for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i) - service.add(Method.fromJSON(names[i], json.methods[names[i]])); - if (json.nested) - service.addJSON(json.nested); - service.comment = json.comment; - return service; -}; - -/** - * Converts this service to a service descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IService} Service descriptor - */ -Service.prototype.toJSON = function toJSON(toJSONOptions) { - var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions); - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "options" , inherited && inherited.options || undefined, - "methods" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {}, - "nested" , inherited && inherited.nested || undefined, - "comment" , keepComments ? this.comment : undefined - ]); -}; - -/** - * Methods of this service as an array for iteration. - * @name Service#methodsArray - * @type {Method[]} - * @readonly - */ -Object.defineProperty(Service.prototype, "methodsArray", { - get: function() { - return this._methodsArray || (this._methodsArray = util.toArray(this.methods)); - } -}); - -function clearCache(service) { - service._methodsArray = null; - return service; -} - -/** - * @override - */ -Service.prototype.get = function get(name) { - return this.methods[name] - || Namespace.prototype.get.call(this, name); -}; - -/** - * @override - */ -Service.prototype.resolveAll = function resolveAll() { - var methods = this.methodsArray; - for (var i = 0; i < methods.length; ++i) - methods[i].resolve(); - return Namespace.prototype.resolve.call(this); -}; - -/** - * @override - */ -Service.prototype.add = function add(object) { - - /* istanbul ignore if */ - if (this.get(object.name)) - throw Error("duplicate name '" + object.name + "' in " + this); - - if (object instanceof Method) { - this.methods[object.name] = object; - object.parent = this; - return clearCache(this); - } - return Namespace.prototype.add.call(this, object); -}; - -/** - * @override - */ -Service.prototype.remove = function remove(object) { - if (object instanceof Method) { - - /* istanbul ignore if */ - if (this.methods[object.name] !== object) - throw Error(object + " is not a member of " + this); - - delete this.methods[object.name]; - object.parent = null; - return clearCache(this); - } - return Namespace.prototype.remove.call(this, object); -}; - -/** - * Creates a runtime service using the specified rpc implementation. - * @param {RPCImpl} rpcImpl RPC implementation - * @param {boolean} [requestDelimited=false] Whether requests are length-delimited - * @param {boolean} [responseDelimited=false] Whether responses are length-delimited - * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed. - */ -Service.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) { - var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited); - for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) { - var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\w_]/g, ""); - rpcService[methodName] = util.codegen(["r","c"], util.isReserved(methodName) ? methodName + "_" : methodName)("return this.rpcCall(m,q,s,r,c)")({ - m: method, - q: method.resolvedRequestType.ctor, - s: method.resolvedResponseType.ctor - }); - } - return rpcService; -}; - - -/***/ }), -/* 26 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Method; - -// extends ReflectionObject -var ReflectionObject = __webpack_require__(13); -((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = "Method"; - -var util = __webpack_require__(0); - -/** - * Constructs a new service method instance. - * @classdesc Reflected service method. - * @extends ReflectionObject - * @constructor - * @param {string} name Method name - * @param {string|undefined} type Method type, usually `"rpc"` - * @param {string} requestType Request message type - * @param {string} responseType Response message type - * @param {boolean|Object.} [requestStream] Whether the request is streamed - * @param {boolean|Object.} [responseStream] Whether the response is streamed - * @param {Object.} [options] Declared options - * @param {string} [comment] The comment for this method - */ -function Method(name, type, requestType, responseType, requestStream, responseStream, options, comment) { - - /* istanbul ignore next */ - if (util.isObject(requestStream)) { - options = requestStream; - requestStream = responseStream = undefined; - } else if (util.isObject(responseStream)) { - options = responseStream; - responseStream = undefined; - } - - /* istanbul ignore if */ - if (!(type === undefined || util.isString(type))) - throw TypeError("type must be a string"); - - /* istanbul ignore if */ - if (!util.isString(requestType)) - throw TypeError("requestType must be a string"); - - /* istanbul ignore if */ - if (!util.isString(responseType)) - throw TypeError("responseType must be a string"); - - ReflectionObject.call(this, name, options); - - /** - * Method type. - * @type {string} - */ - this.type = type || "rpc"; // toJSON - - /** - * Request type. - * @type {string} - */ - this.requestType = requestType; // toJSON, marker - - /** - * Whether requests are streamed or not. - * @type {boolean|undefined} - */ - this.requestStream = requestStream ? true : undefined; // toJSON - - /** - * Response type. - * @type {string} - */ - this.responseType = responseType; // toJSON - - /** - * Whether responses are streamed or not. - * @type {boolean|undefined} - */ - this.responseStream = responseStream ? true : undefined; // toJSON - - /** - * Resolved request type. - * @type {Type|null} - */ - this.resolvedRequestType = null; - - /** - * Resolved response type. - * @type {Type|null} - */ - this.resolvedResponseType = null; - - /** - * Comment for this method - * @type {string|null} - */ - this.comment = comment; -} - -/** - * Method descriptor. - * @interface IMethod - * @property {string} [type="rpc"] Method type - * @property {string} requestType Request type - * @property {string} responseType Response type - * @property {boolean} [requestStream=false] Whether requests are streamed - * @property {boolean} [responseStream=false] Whether responses are streamed - * @property {Object.} [options] Method options - */ - -/** - * Constructs a method from a method descriptor. - * @param {string} name Method name - * @param {IMethod} json Method descriptor - * @returns {Method} Created method - * @throws {TypeError} If arguments are invalid - */ -Method.fromJSON = function fromJSON(name, json) { - return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment); -}; - -/** - * Converts this method to a method descriptor. - * @param {IToJSONOptions} [toJSONOptions] JSON conversion options - * @returns {IMethod} Method descriptor - */ -Method.prototype.toJSON = function toJSON(toJSONOptions) { - var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false; - return util.toObject([ - "type" , this.type !== "rpc" && /* istanbul ignore next */ this.type || undefined, - "requestType" , this.requestType, - "requestStream" , this.requestStream, - "responseType" , this.responseType, - "responseStream" , this.responseStream, - "options" , this.options, - "comment" , keepComments ? this.comment : undefined - ]); -}; - -/** - * @override - */ -Method.prototype.resolve = function resolve() { - - /* istanbul ignore if */ - if (this.resolved) - return this; - - this.resolvedRequestType = this.parent.lookupType(this.requestType); - this.resolvedResponseType = this.parent.lookupType(this.responseType); - - return ReflectionObject.prototype.resolve.call(this); -}; - - -/***/ }), -/* 27 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Message; - -var util = __webpack_require__(5); - -/** - * Constructs a new message instance. - * @classdesc Abstract runtime message. - * @constructor - * @param {Properties} [properties] Properties to set - * @template T extends object = object - */ -function Message(properties) { - // not used internally - if (properties) - for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i) - this[keys[i]] = properties[keys[i]]; -} - -/** - * Reference to the reflected type. - * @name Message.$type - * @type {Type} - * @readonly - */ - -/** - * Reference to the reflected type. - * @name Message#$type - * @type {Type} - * @readonly - */ - -/*eslint-disable valid-jsdoc*/ - -/** - * Creates a new message of this type using the specified properties. - * @param {Object.} [properties] Properties to set - * @returns {Message} Message instance - * @template T extends Message - * @this Constructor - */ -Message.create = function create(properties) { - return this.$type.create(properties); -}; - -/** - * Encodes a message of this type. - * @param {T|Object.} message Message to encode - * @param {Writer} [writer] Writer to use - * @returns {Writer} Writer - * @template T extends Message - * @this Constructor - */ -Message.encode = function encode(message, writer) { - return this.$type.encode(message, writer); -}; - -/** - * Encodes a message of this type preceeded by its length as a varint. - * @param {T|Object.} message Message to encode - * @param {Writer} [writer] Writer to use - * @returns {Writer} Writer - * @template T extends Message - * @this Constructor - */ -Message.encodeDelimited = function encodeDelimited(message, writer) { - return this.$type.encodeDelimited(message, writer); -}; - -/** - * Decodes a message of this type. - * @name Message.decode - * @function - * @param {Reader|Uint8Array} reader Reader or buffer to decode - * @returns {T} Decoded message - * @template T extends Message - * @this Constructor - */ -Message.decode = function decode(reader) { - return this.$type.decode(reader); -}; - -/** - * Decodes a message of this type preceeded by its length as a varint. - * @name Message.decodeDelimited - * @function - * @param {Reader|Uint8Array} reader Reader or buffer to decode - * @returns {T} Decoded message - * @template T extends Message - * @this Constructor - */ -Message.decodeDelimited = function decodeDelimited(reader) { - return this.$type.decodeDelimited(reader); -}; - -/** - * Verifies a message of this type. - * @name Message.verify - * @function - * @param {Object.} message Plain object to verify - * @returns {string|null} `null` if valid, otherwise the reason why it is not - */ -Message.verify = function verify(message) { - return this.$type.verify(message); -}; - -/** - * Creates a new message of this type from a plain object. Also converts values to their respective internal types. - * @param {Object.} object Plain object - * @returns {T} Message instance - * @template T extends Message - * @this Constructor - */ -Message.fromObject = function fromObject(object) { - return this.$type.fromObject(object); -}; - -/** - * Creates a plain object from a message of this type. Also converts values to other types if specified. - * @param {T} message Message instance - * @param {IConversionOptions} [options] Conversion options - * @returns {Object.} Plain object - * @template T extends Message - * @this Constructor - */ -Message.toObject = function toObject(message, options) { - return this.$type.toObject(message, options); -}; - -/** - * Converts this message to JSON. - * @returns {Object.} JSON object - */ -Message.prototype.toJSON = function toJSON() { - return this.$type.toObject(this, util.toJSONOptions); -}; - -/*eslint-enable valid-jsdoc*/ - -/***/ }), -/* 28 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Root; - -// extends Namespace -var Namespace = __webpack_require__(16); -((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = "Root"; - -var Field = __webpack_require__(11), - Enum = __webpack_require__(3), - OneOf = __webpack_require__(18), - util = __webpack_require__(0); - -var Type, // cyclic - parse, // might be excluded - common; // " - -/** - * Constructs a new root namespace instance. - * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together. - * @extends NamespaceBase - * @constructor - * @param {Object.} [options] Top level options - */ -function Root(options) { - Namespace.call(this, "", options); - - /** - * Deferred extension fields. - * @type {Field[]} - */ - this.deferred = []; - - /** - * Resolved file names of loaded files. - * @type {string[]} - */ - this.files = []; -} - -/** - * Loads a namespace descriptor into a root namespace. - * @param {INamespace} json Nameespace descriptor - * @param {Root} [root] Root namespace, defaults to create a new one if omitted - * @returns {Root} Root namespace - */ -Root.fromJSON = function fromJSON(json, root) { - if (!root) - root = new Root(); - if (json.options) - root.setOptions(json.options); - return root.addJSON(json.nested); -}; - -/** - * Resolves the path of an imported file, relative to the importing origin. - * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories. - * @function - * @param {string} origin The file name of the importing file - * @param {string} target The file name being imported - * @returns {string|null} Resolved path to `target` or `null` to skip the file - */ -Root.prototype.resolvePath = util.path.resolve; - -// A symbol-like function to safely signal synchronous loading -/* istanbul ignore next */ -function SYNC() {} // eslint-disable-line no-empty-function - -/** - * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback. - * @param {string|string[]} filename Names of one or multiple files to load - * @param {IParseOptions} options Parse options - * @param {LoadCallback} callback Callback function - * @returns {undefined} - */ -Root.prototype.load = function load(filename, options, callback) { - if (typeof options === "function") { - callback = options; - options = undefined; - } - var self = this; - if (!callback) - return util.asPromise(load, self, filename, options); - - var sync = callback === SYNC; // undocumented - - // Finishes loading by calling the callback (exactly once) - function finish(err, root) { - /* istanbul ignore if */ - if (!callback) - return; - var cb = callback; - callback = null; - if (sync) - throw err; - cb(err, root); - } - - // Processes a single file - function process(filename, source) { - try { - if (util.isString(source) && source.charAt(0) === "{") - source = JSON.parse(source); - if (!util.isString(source)) - self.setOptions(source.options).addJSON(source.nested); - else { - parse.filename = filename; - var parsed = parse(source, self, options), - resolved, - i = 0; - if (parsed.imports) - for (; i < parsed.imports.length; ++i) - if (resolved = self.resolvePath(filename, parsed.imports[i])) - fetch(resolved); - if (parsed.weakImports) - for (i = 0; i < parsed.weakImports.length; ++i) - if (resolved = self.resolvePath(filename, parsed.weakImports[i])) - fetch(resolved, true); - } - } catch (err) { - finish(err); - } - if (!sync && !queued) - finish(null, self); // only once anyway - } - - // Fetches a single file - function fetch(filename, weak) { - - // Strip path if this file references a bundled definition - var idx = filename.lastIndexOf("google/protobuf/"); - if (idx > -1) { - var altname = filename.substring(idx); - if (altname in common) - filename = altname; - } - - // Skip if already loaded / attempted - if (self.files.indexOf(filename) > -1) - return; - self.files.push(filename); - - // Shortcut bundled definitions - if (filename in common) { - if (sync) - process(filename, common[filename]); - else { - ++queued; - setTimeout(function() { - --queued; - process(filename, common[filename]); - }); - } - return; - } - - // Otherwise fetch from disk or network - if (sync) { - var source; - try { - source = util.fs.readFileSync(filename).toString("utf8"); - } catch (err) { - if (!weak) - finish(err); - return; - } - process(filename, source); - } else { - ++queued; - util.fetch(filename, function(err, source) { - --queued; - /* istanbul ignore if */ - if (!callback) - return; // terminated meanwhile - if (err) { - /* istanbul ignore else */ - if (!weak) - finish(err); - else if (!queued) // can't be covered reliably - finish(null, self); - return; - } - process(filename, source); - }); - } - } - var queued = 0; - - // Assembling the root namespace doesn't require working type - // references anymore, so we can load everything in parallel - if (util.isString(filename)) - filename = [ filename ]; - for (var i = 0, resolved; i < filename.length; ++i) - if (resolved = self.resolvePath("", filename[i])) - fetch(resolved); - - if (sync) - return self; - if (!queued) - finish(null, self); - return undefined; -}; -// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined - -/** - * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback. - * @function Root#load - * @param {string|string[]} filename Names of one or multiple files to load - * @param {LoadCallback} callback Callback function - * @returns {undefined} - * @variation 2 - */ -// function load(filename:string, callback:LoadCallback):undefined - -/** - * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise. - * @function Root#load - * @param {string|string[]} filename Names of one or multiple files to load - * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted. - * @returns {Promise} Promise - * @variation 3 - */ -// function load(filename:string, [options:IParseOptions]):Promise - -/** - * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only). - * @function Root#loadSync - * @param {string|string[]} filename Names of one or multiple files to load - * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted. - * @returns {Root} Root namespace - * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid - */ -Root.prototype.loadSync = function loadSync(filename, options) { - if (!util.isNode) - throw Error("not supported"); - return this.load(filename, options, SYNC); -}; - -/** - * @override - */ -Root.prototype.resolveAll = function resolveAll() { - if (this.deferred.length) - throw Error("unresolvable extensions: " + this.deferred.map(function(field) { - return "'extend " + field.extend + "' in " + field.parent.fullName; - }).join(", ")); - return Namespace.prototype.resolveAll.call(this); -}; - -// only uppercased (and thus conflict-free) children are exposed, see below -var exposeRe = /^[A-Z]/; - -/** - * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type. - * @param {Root} root Root instance - * @param {Field} field Declaring extension field witin the declaring type - * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise - * @inner - * @ignore - */ -function tryHandleExtension(root, field) { - var extendedType = field.parent.lookup(field.extend); - if (extendedType) { - var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options); - sisterField.declaringField = field; - field.extensionField = sisterField; - extendedType.add(sisterField); - return true; - } - return false; -} - -/** - * Called when any object is added to this root or its sub-namespaces. - * @param {ReflectionObject} object Object added - * @returns {undefined} - * @private - */ -Root.prototype._handleAdd = function _handleAdd(object) { - if (object instanceof Field) { - - if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField) - if (!tryHandleExtension(this, object)) - this.deferred.push(object); - - } else if (object instanceof Enum) { - - if (exposeRe.test(object.name)) - object.parent[object.name] = object.values; // expose enum values as property of its parent - - } else if (!(object instanceof OneOf)) /* everything else is a namespace */ { - - if (object instanceof Type) // Try to handle any deferred extensions - for (var i = 0; i < this.deferred.length;) - if (tryHandleExtension(this, this.deferred[i])) - this.deferred.splice(i, 1); - else - ++i; - for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace - this._handleAdd(object._nestedArray[j]); - if (exposeRe.test(object.name)) - object.parent[object.name] = object; // expose namespace as property of its parent - } - - // The above also adds uppercased (and thus conflict-free) nested types, services and enums as - // properties of namespaces just like static code does. This allows using a .d.ts generated for - // a static module with reflection-based solutions where the condition is met. -}; - -/** - * Called when any object is removed from this root or its sub-namespaces. - * @param {ReflectionObject} object Object removed - * @returns {undefined} - * @private - */ -Root.prototype._handleRemove = function _handleRemove(object) { - if (object instanceof Field) { - - if (/* an extension field */ object.extend !== undefined) { - if (/* already handled */ object.extensionField) { // remove its sister field - object.extensionField.parent.remove(object.extensionField); - object.extensionField = null; - } else { // cancel the extension - var index = this.deferred.indexOf(object); - /* istanbul ignore else */ - if (index > -1) - this.deferred.splice(index, 1); - } - } - - } else if (object instanceof Enum) { - - if (exposeRe.test(object.name)) - delete object.parent[object.name]; // unexpose enum values - - } else if (object instanceof Namespace) { - - for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace - this._handleRemove(object._nestedArray[i]); - - if (exposeRe.test(object.name)) - delete object.parent[object.name]; // unexpose namespaces - - } -}; - -// Sets up cyclic dependencies (called in index-light) -Root._configure = function(Type_, parse_, common_) { - Type = Type_; - parse = parse_; - common = common_; -}; - - -/***/ }), -/* 29 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("util"); - -/***/ }), -/* 30 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var curves = exports; - -var hash = __webpack_require__(31); -var curve = __webpack_require__(51); -var utils = __webpack_require__(1); - -var assert = utils.assert; - -function PresetCurve(options) { - if (options.type === 'short') - this.curve = new curve.short(options); - else if (options.type === 'edwards') - this.curve = new curve.edwards(options); - else - this.curve = new curve.mont(options); - this.g = this.curve.g; - this.n = this.curve.n; - this.hash = options.hash; - - assert(this.g.validate(), 'Invalid curve'); - assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O'); -} -curves.PresetCurve = PresetCurve; - -function defineCurve(name, options) { - Object.defineProperty(curves, name, { - configurable: true, - enumerable: true, - get: function() { - var curve = new PresetCurve(options); - Object.defineProperty(curves, name, { - configurable: true, - enumerable: true, - value: curve, - }); - return curve; - }, - }); -} - -defineCurve('p192', { - type: 'short', - prime: 'p192', - p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff', - a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc', - b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1', - n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831', - hash: hash.sha256, - gRed: false, - g: [ - '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012', - '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811', - ], -}); - -defineCurve('p224', { - type: 'short', - prime: 'p224', - p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001', - a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe', - b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4', - n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d', - hash: hash.sha256, - gRed: false, - g: [ - 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21', - 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34', - ], -}); - -defineCurve('p256', { - type: 'short', - prime: null, - p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff', - a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc', - b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b', - n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551', - hash: hash.sha256, - gRed: false, - g: [ - '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296', - '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5', - ], -}); - -defineCurve('p384', { - type: 'short', - prime: null, - p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'fffffffe ffffffff 00000000 00000000 ffffffff', - a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'fffffffe ffffffff 00000000 00000000 fffffffc', - b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' + - '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef', - n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' + - 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973', - hash: hash.sha384, - gRed: false, - g: [ - 'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' + - '5502f25d bf55296c 3a545e38 72760ab7', - '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' + - '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f', - ], -}); - -defineCurve('p521', { - type: 'short', - prime: null, - p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff ffffffff', - a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff fffffffc', - b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' + - '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' + - '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00', - n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' + - 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409', - hash: hash.sha512, - gRed: false, - g: [ - '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' + - '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' + - 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66', - '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' + - '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' + - '3fad0761 353c7086 a272c240 88be9476 9fd16650', - ], -}); - -defineCurve('curve25519', { - type: 'mont', - prime: 'p25519', - p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed', - a: '76d06', - b: '1', - n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed', - hash: hash.sha256, - gRed: false, - g: [ - '9', - ], -}); - -defineCurve('ed25519', { - type: 'edwards', - prime: 'p25519', - p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed', - a: '-1', - c: '1', - // -121665 * (121666^(-1)) (mod P) - d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3', - n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed', - hash: hash.sha256, - gRed: false, - g: [ - '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a', - - // 4/5 - '6666666666666666666666666666666666666666666666666666666666666658', - ], -}); - -var pre; -try { - pre = __webpack_require__(103); -} catch (e) { - pre = undefined; -} - -defineCurve('secp256k1', { - type: 'short', - prime: 'k256', - p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f', - a: '0', - b: '7', - n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141', - h: '1', - hash: hash.sha256, - - // Precomputed endomorphism - beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee', - lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72', - basis: [ - { - a: '3086d221a7d46bcde86c90e49284eb15', - b: '-e4437ed6010e88286f547fa90abfe4c3', - }, - { - a: '114ca50f7a8e2f3f657c1108d9d44cfd8', - b: '3086d221a7d46bcde86c90e49284eb15', - }, - ], - - gRed: false, - g: [ - '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798', - '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8', - pre, - ], -}); - - -/***/ }), -/* 31 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var hash = exports; - -hash.utils = __webpack_require__(8); -hash.common = __webpack_require__(20); -hash.sha = __webpack_require__(154); -hash.ripemd = __webpack_require__(155); -hash.hmac = __webpack_require__(102); - -// Proxy hash functions to the main object -hash.sha1 = hash.sha.sha1; -hash.sha256 = hash.sha.sha256; -hash.sha224 = hash.sha.sha224; -hash.sha384 = hash.sha.sha384; -hash.sha512 = hash.sha.sha512; -hash.ripemd160 = hash.ripemd.ripemd160; - - -/***/ }), -/* 32 */ -/***/ ((module) => { - -var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs - -module.exports = function (iterations, keylen) { - if (typeof iterations !== 'number') { - throw new TypeError('Iterations not a number') - } - - if (iterations < 0) { - throw new TypeError('Bad iterations') - } - - if (typeof keylen !== 'number') { - throw new TypeError('Key length not a number') - } - - if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */ - throw new TypeError('Bad key length') - } -} - - -/***/ }), -/* 33 */ -/***/ ((module) => { - -var defaultEncoding -/* istanbul ignore next */ -if (global.process && global.process.browser) { - defaultEncoding = 'utf-8' -} else if (global.process && global.process.version) { - var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10) - - defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary' -} else { - defaultEncoding = 'utf-8' -} -module.exports = defaultEncoding - - -/***/ }), -/* 34 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = (__webpack_require__(6).Buffer) - -module.exports = function (thing, encoding, name) { - if (Buffer.isBuffer(thing)) { - return thing - } else if (typeof thing === 'string') { - return Buffer.from(thing, encoding) - } else if (ArrayBuffer.isView(thing)) { - return Buffer.from(thing.buffer) - } else { - throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView') - } -} - - -/***/ }), -/* 35 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Ported from https://github.com/mafintosh/end-of-stream with -// permission from the author, Mathias Buus (@mafintosh). - - - -var ERR_STREAM_PREMATURE_CLOSE = (__webpack_require__(15)/* .codes.ERR_STREAM_PREMATURE_CLOSE */ .q.ERR_STREAM_PREMATURE_CLOSE); -function once(callback) { - var called = false; - return function () { - if (called) return; - called = true; - for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { - args[_key] = arguments[_key]; - } - callback.apply(this, args); - }; -} -function noop() {} -function isRequest(stream) { - return stream.setHeader && typeof stream.abort === 'function'; -} -function eos(stream, opts, callback) { - if (typeof opts === 'function') return eos(stream, null, opts); - if (!opts) opts = {}; - callback = once(callback || noop); - var readable = opts.readable || opts.readable !== false && stream.readable; - var writable = opts.writable || opts.writable !== false && stream.writable; - var onlegacyfinish = function onlegacyfinish() { - if (!stream.writable) onfinish(); - }; - var writableEnded = stream._writableState && stream._writableState.finished; - var onfinish = function onfinish() { - writable = false; - writableEnded = true; - if (!readable) callback.call(stream); - }; - var readableEnded = stream._readableState && stream._readableState.endEmitted; - var onend = function onend() { - readable = false; - readableEnded = true; - if (!writable) callback.call(stream); - }; - var onerror = function onerror(err) { - callback.call(stream, err); - }; - var onclose = function onclose() { - var err; - if (readable && !readableEnded) { - if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE(); - return callback.call(stream, err); - } - if (writable && !writableEnded) { - if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE(); - return callback.call(stream, err); - } - }; - var onrequest = function onrequest() { - stream.req.on('finish', onfinish); - }; - if (isRequest(stream)) { - stream.on('complete', onfinish); - stream.on('abort', onclose); - if (stream.req) onrequest();else stream.on('request', onrequest); - } else if (writable && !stream._writableState) { - // legacy streams - stream.on('end', onlegacyfinish); - stream.on('close', onlegacyfinish); - } - stream.on('end', onend); - stream.on('finish', onfinish); - if (opts.error !== false) stream.on('error', onerror); - stream.on('close', onclose); - return function () { - stream.removeListener('complete', onfinish); - stream.removeListener('abort', onclose); - stream.removeListener('request', onrequest); - if (stream.req) stream.req.removeListener('finish', onfinish); - stream.removeListener('end', onlegacyfinish); - stream.removeListener('close', onlegacyfinish); - stream.removeListener('finish', onfinish); - stream.removeListener('end', onend); - stream.removeListener('error', onerror); - stream.removeListener('close', onclose); - }; -} -module.exports = eos; - -/***/ }), -/* 36 */ -/***/ ((module, exports, __webpack_require__) => { - -var Stream = __webpack_require__(130); -if (process.env.READABLE_STREAM === 'disable' && Stream) { - module.exports = Stream.Readable; - Object.assign(module.exports, Stream); - module.exports.Stream = Stream; -} else { - exports = module.exports = __webpack_require__(60); - exports.Stream = Stream || exports; - exports.Readable = exports; - exports.Writable = __webpack_require__(63); - exports.Duplex = __webpack_require__(17); - exports.Transform = __webpack_require__(64); - exports.PassThrough = __webpack_require__(135); - exports.finished = __webpack_require__(35); - exports.pipeline = __webpack_require__(136); -} - - -/***/ }), -/* 37 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory, undef) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9), __webpack_require__(71), __webpack_require__(72)); - } - else {} -}(this, function (CryptoJS) { - - (function () { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var Base = C_lib.Base; - var WordArray = C_lib.WordArray; - var C_algo = C.algo; - var MD5 = C_algo.MD5; - - /** - * This key derivation function is meant to conform with EVP_BytesToKey. - * www.openssl.org/docs/crypto/EVP_BytesToKey.html - */ - var EvpKDF = C_algo.EvpKDF = Base.extend({ - /** - * Configuration options. - * - * @property {number} keySize The key size in words to generate. Default: 4 (128 bits) - * @property {Hasher} hasher The hash algorithm to use. Default: MD5 - * @property {number} iterations The number of iterations to perform. Default: 1 - */ - cfg: Base.extend({ - keySize: 128/32, - hasher: MD5, - iterations: 1 - }), - - /** - * Initializes a newly created key derivation function. - * - * @param {Object} cfg (Optional) The configuration options to use for the derivation. - * - * @example - * - * var kdf = CryptoJS.algo.EvpKDF.create(); - * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 }); - * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 }); - */ - init: function (cfg) { - this.cfg = this.cfg.extend(cfg); - }, - - /** - * Derives a key from a password. - * - * @param {WordArray|string} password The password. - * @param {WordArray|string} salt A salt. - * - * @return {WordArray} The derived key. - * - * @example - * - * var key = kdf.compute(password, salt); - */ - compute: function (password, salt) { - var block; - - // Shortcut - var cfg = this.cfg; - - // Init hasher - var hasher = cfg.hasher.create(); - - // Initial values - var derivedKey = WordArray.create(); - - // Shortcuts - var derivedKeyWords = derivedKey.words; - var keySize = cfg.keySize; - var iterations = cfg.iterations; - - // Generate key - while (derivedKeyWords.length < keySize) { - if (block) { - hasher.update(block); - } - block = hasher.update(password).finalize(salt); - hasher.reset(); - - // Iterations - for (var i = 1; i < iterations; i++) { - block = hasher.finalize(block); - hasher.reset(); - } - - derivedKey.concat(block); - } - derivedKey.sigBytes = keySize * 4; - - return derivedKey; - } - }); - - /** - * Derives a key from a password. - * - * @param {WordArray|string} password The password. - * @param {WordArray|string} salt A salt. - * @param {Object} cfg (Optional) The configuration options to use for this computation. - * - * @return {WordArray} The derived key. - * - * @static - * - * @example - * - * var key = CryptoJS.EvpKDF(password, salt); - * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8 }); - * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8, iterations: 1000 }); - */ - C.EvpKDF = function (password, salt, cfg) { - return EvpKDF.create(cfg).compute(password, salt); - }; - }()); - - - return CryptoJS.EvpKDF; - -})); - -/***/ }), -/* 38 */ -/***/ ((module) => { - -"use strict"; - -module.exports = asPromise; - -/** - * Callback as used by {@link util.asPromise}. - * @typedef asPromiseCallback - * @type {function} - * @param {Error|null} error Error, if any - * @param {...*} params Additional arguments - * @returns {undefined} - */ - -/** - * Returns a promise from a node-style callback function. - * @memberof util - * @param {asPromiseCallback} fn Function to call - * @param {*} ctx Function context - * @param {...*} params Function arguments - * @returns {Promise<*>} Promisified function - */ -function asPromise(fn, ctx/*, varargs */) { - var params = new Array(arguments.length - 1), - offset = 0, - index = 2, - pending = true; - while (index < arguments.length) - params[offset++] = arguments[index++]; - return new Promise(function executor(resolve, reject) { - params[offset] = function callback(err/*, varargs */) { - if (pending) { - pending = false; - if (err) - reject(err); - else { - var params = new Array(arguments.length - 1), - offset = 0; - while (offset < params.length) - params[offset++] = arguments[offset]; - resolve.apply(null, params); - } - } - }; - try { - fn.apply(ctx || null, params); - } catch (err) { - if (pending) { - pending = false; - reject(err); - } - } - }); -} - - -/***/ }), -/* 39 */ -/***/ ((module) => { - -"use strict"; - -module.exports = inquire; - -/** - * Requires a module only if available. - * @memberof util - * @param {string} moduleName Module to require - * @returns {?Object} Required module if available and not empty, otherwise `null` - */ -function inquire(moduleName) { - try { - var mod = eval("quire".replace(/^/,"re"))(moduleName); // eslint-disable-line no-eval - if (mod && (mod.length || Object.keys(mod).length)) - return mod; - } catch (e) {} // eslint-disable-line no-empty - return null; -} - - -/***/ }), -/* 40 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -/** - * Streaming RPC helpers. - * @namespace - */ -var rpc = exports; - -/** - * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets. - * @typedef RPCImpl - * @type {function} - * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called - * @param {Uint8Array} requestData Request data - * @param {RPCImplCallback} callback Callback function - * @returns {undefined} - * @example - * function rpcImpl(method, requestData, callback) { - * if (protobuf.util.lcFirst(method.name) !== "myMethod") // compatible with static code - * throw Error("no such method"); - * asynchronouslyObtainAResponse(requestData, function(err, responseData) { - * callback(err, responseData); - * }); - * } - */ - -/** - * Node-style callback as used by {@link RPCImpl}. - * @typedef RPCImplCallback - * @type {function} - * @param {Error|null} error Error, if any, otherwise `null` - * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error - * @returns {undefined} - */ - -rpc.Service = __webpack_require__(87); - - -/***/ }), -/* 41 */ -/***/ ((module) => { - -"use strict"; - -module.exports = {}; - -/** - * Named roots. - * This is where pbjs stores generated structures (the option `-r, --root` specifies a name). - * Can also be used manually to make roots available accross modules. - * @name roots - * @type {Object.} - * @example - * // pbjs -r myroot -o compiled.js ... - * - * // in another module: - * require("./compiled.js"); - * - * // in any subsequent module: - * var root = protobuf.roots["myroot"]; - */ - - -/***/ }), -/* 42 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = encoder; - -var Enum = __webpack_require__(3), - types = __webpack_require__(14), - util = __webpack_require__(0); - -/** - * Generates a partial message type encoder. - * @param {Codegen} gen Codegen instance - * @param {Field} field Reflected field - * @param {number} fieldIndex Field index - * @param {string} ref Variable reference - * @returns {Codegen} Codegen instance - * @ignore - */ -function genTypePartial(gen, field, fieldIndex, ref) { - return field.resolvedType.group - ? gen("types[%i].encode(%s,w.uint32(%i)).uint32(%i)", fieldIndex, ref, (field.id << 3 | 3) >>> 0, (field.id << 3 | 4) >>> 0) - : gen("types[%i].encode(%s,w.uint32(%i).fork()).ldelim()", fieldIndex, ref, (field.id << 3 | 2) >>> 0); -} - -/** - * Generates an encoder specific to the specified message type. - * @param {Type} mtype Message type - * @returns {Codegen} Codegen instance - */ -function encoder(mtype) { - /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */ - var gen = util.codegen(["m", "w"], mtype.name + "$encode") - ("if(!w)") - ("w=Writer.create()"); - - var i, ref; - - // "when a message is serialized its known fields should be written sequentially by field number" - var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById); - - for (var i = 0; i < fields.length; ++i) { - var field = fields[i].resolve(), - index = mtype._fieldsArray.indexOf(field), - type = field.resolvedType instanceof Enum ? "int32" : field.type, - wireType = types.basic[type]; - ref = "m" + util.safeProp(field.name); - - // Map fields - if (field.map) { - gen - ("if(%s!=null&&m.hasOwnProperty(%j)){", ref, field.name) // !== undefined && !== null - ("for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType); - if (wireType === undefined) gen - ("types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()", index, ref); // can't be groups - else gen - (".uint32(%i).%s(%s[ks[i]]).ldelim()", 16 | wireType, type, ref); - gen - ("}") - ("}"); - - // Repeated fields - } else if (field.repeated) { gen - ("if(%s!=null&&%s.length){", ref, ref); // !== undefined && !== null - - // Packed repeated - if (field.packed && types.packed[type] !== undefined) { gen - - ("w.uint32(%i).fork()", (field.id << 3 | 2) >>> 0) - ("for(var i=0;i<%s.length;++i)", ref) - ("w.%s(%s[i])", type, ref) - ("w.ldelim()"); - - // Non-packed - } else { gen - - ("for(var i=0;i<%s.length;++i)", ref); - if (wireType === undefined) - genTypePartial(gen, field, index, ref + "[i]"); - else gen - ("w.uint32(%i).%s(%s[i])", (field.id << 3 | wireType) >>> 0, type, ref); - - } gen - ("}"); - - // Non-repeated - } else { - if (field.optional) gen - ("if(%s!=null&&m.hasOwnProperty(%j))", ref, field.name); // !== undefined && !== null - - if (wireType === undefined) - genTypePartial(gen, field, index, ref); - else gen - ("w.uint32(%i).%s(%s)", (field.id << 3 | wireType) >>> 0, type, ref); - - } - } - - return gen - ("return w"); - /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */ -} - -/***/ }), -/* 43 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = decoder; - -var Enum = __webpack_require__(3), - types = __webpack_require__(14), - util = __webpack_require__(0); - -function missing(field) { - return "missing required '" + field.name + "'"; -} - -/** - * Generates a decoder specific to the specified message type. - * @param {Type} mtype Message type - * @returns {Codegen} Codegen instance - */ -function decoder(mtype) { - /* eslint-disable no-unexpected-multiline */ - var gen = util.codegen(["r", "l"], mtype.name + "$decode") - ("if(!(r instanceof Reader))") - ("r=Reader.create(r)") - ("var c=l===undefined?r.len:r.pos+l,m=new this.ctor" + (mtype.fieldsArray.filter(function(field) { return field.map; }).length ? ",k" : "")) - ("while(r.pos>>3){"); - - var i = 0; - for (; i < /* initializes */ mtype.fieldsArray.length; ++i) { - var field = mtype._fieldsArray[i].resolve(), - type = field.resolvedType instanceof Enum ? "int32" : field.type, - ref = "m" + util.safeProp(field.name); gen - ("case %i:", field.id); - - // Map fields - if (field.map) { gen - ("r.skip().pos++") // assumes id 1 + key wireType - ("if(%s===util.emptyObject)", ref) - ("%s={}", ref) - ("k=r.%s()", field.keyType) - ("r.pos++"); // assumes id 2 + value wireType - if (types.long[field.keyType] !== undefined) { - if (types.basic[type] === undefined) gen - ("%s[typeof k===\"object\"?util.longToHash(k):k]=types[%i].decode(r,r.uint32())", ref, i); // can't be groups - else gen - ("%s[typeof k===\"object\"?util.longToHash(k):k]=r.%s()", ref, type); - } else { - if (types.basic[type] === undefined) gen - ("%s[k]=types[%i].decode(r,r.uint32())", ref, i); // can't be groups - else gen - ("%s[k]=r.%s()", ref, type); - } - - // Repeated fields - } else if (field.repeated) { gen - - ("if(!(%s&&%s.length))", ref, ref) - ("%s=[]", ref); - - // Packable (always check for forward and backward compatiblity) - if (types.packed[type] !== undefined) gen - ("if((t&7)===2){") - ("var c2=r.uint32()+r.pos") - ("while(r.pos { - -"use strict"; - -module.exports = verifier; - -var Enum = __webpack_require__(3), - util = __webpack_require__(0); - -function invalid(field, expected) { - return field.name + ": " + expected + (field.repeated && expected !== "array" ? "[]" : field.map && expected !== "object" ? "{k:"+field.keyType+"}" : "") + " expected"; -} - -/** - * Generates a partial value verifier. - * @param {Codegen} gen Codegen instance - * @param {Field} field Reflected field - * @param {number} fieldIndex Field index - * @param {string} ref Variable reference - * @returns {Codegen} Codegen instance - * @ignore - */ -function genVerifyValue(gen, field, fieldIndex, ref) { - /* eslint-disable no-unexpected-multiline */ - if (field.resolvedType) { - if (field.resolvedType instanceof Enum) { gen - ("switch(%s){", ref) - ("default:") - ("return%j", invalid(field, "enum value")); - for (var keys = Object.keys(field.resolvedType.values), j = 0; j < keys.length; ++j) gen - ("case %i:", field.resolvedType.values[keys[j]]); - gen - ("break") - ("}"); - } else { - gen - ("{") - ("var e=types[%i].verify(%s);", fieldIndex, ref) - ("if(e)") - ("return%j+e", field.name + ".") - ("}"); - } - } else { - switch (field.type) { - case "int32": - case "uint32": - case "sint32": - case "fixed32": - case "sfixed32": gen - ("if(!util.isInteger(%s))", ref) - ("return%j", invalid(field, "integer")); - break; - case "int64": - case "uint64": - case "sint64": - case "fixed64": - case "sfixed64": gen - ("if(!util.isInteger(%s)&&!(%s&&util.isInteger(%s.low)&&util.isInteger(%s.high)))", ref, ref, ref, ref) - ("return%j", invalid(field, "integer|Long")); - break; - case "float": - case "double": gen - ("if(typeof %s!==\"number\")", ref) - ("return%j", invalid(field, "number")); - break; - case "bool": gen - ("if(typeof %s!==\"boolean\")", ref) - ("return%j", invalid(field, "boolean")); - break; - case "string": gen - ("if(!util.isString(%s))", ref) - ("return%j", invalid(field, "string")); - break; - case "bytes": gen - ("if(!(%s&&typeof %s.length===\"number\"||util.isString(%s)))", ref, ref, ref) - ("return%j", invalid(field, "buffer")); - break; - } - } - return gen; - /* eslint-enable no-unexpected-multiline */ -} - -/** - * Generates a partial key verifier. - * @param {Codegen} gen Codegen instance - * @param {Field} field Reflected field - * @param {string} ref Variable reference - * @returns {Codegen} Codegen instance - * @ignore - */ -function genVerifyKey(gen, field, ref) { - /* eslint-disable no-unexpected-multiline */ - switch (field.keyType) { - case "int32": - case "uint32": - case "sint32": - case "fixed32": - case "sfixed32": gen - ("if(!util.key32Re.test(%s))", ref) - ("return%j", invalid(field, "integer key")); - break; - case "int64": - case "uint64": - case "sint64": - case "fixed64": - case "sfixed64": gen - ("if(!util.key64Re.test(%s))", ref) // see comment above: x is ok, d is not - ("return%j", invalid(field, "integer|Long key")); - break; - case "bool": gen - ("if(!util.key2Re.test(%s))", ref) - ("return%j", invalid(field, "boolean key")); - break; - } - return gen; - /* eslint-enable no-unexpected-multiline */ -} - -/** - * Generates a verifier specific to the specified message type. - * @param {Type} mtype Message type - * @returns {Codegen} Codegen instance - */ -function verifier(mtype) { - /* eslint-disable no-unexpected-multiline */ - - var gen = util.codegen(["m"], mtype.name + "$verify") - ("if(typeof m!==\"object\"||m===null)") - ("return%j", "object expected"); - var oneofs = mtype.oneofsArray, - seenFirstField = {}; - if (oneofs.length) gen - ("var p={}"); - - for (var i = 0; i < /* initializes */ mtype.fieldsArray.length; ++i) { - var field = mtype._fieldsArray[i].resolve(), - ref = "m" + util.safeProp(field.name); - - if (field.optional) gen - ("if(%s!=null&&m.hasOwnProperty(%j)){", ref, field.name); // !== undefined && !== null - - // map fields - if (field.map) { gen - ("if(!util.isObject(%s))", ref) - ("return%j", invalid(field, "object")) - ("var k=Object.keys(%s)", ref) - ("for(var i=0;i { - -"use strict"; - -/** - * Runtime message from/to plain object converters. - * @namespace - */ -var converter = exports; - -var Enum = __webpack_require__(3), - util = __webpack_require__(0); - -/** - * Generates a partial value fromObject conveter. - * @param {Codegen} gen Codegen instance - * @param {Field} field Reflected field - * @param {number} fieldIndex Field index - * @param {string} prop Property reference - * @returns {Codegen} Codegen instance - * @ignore - */ -function genValuePartial_fromObject(gen, field, fieldIndex, prop) { - /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */ - if (field.resolvedType) { - if (field.resolvedType instanceof Enum) { gen - ("switch(d%s){", prop); - for (var values = field.resolvedType.values, keys = Object.keys(values), i = 0; i < keys.length; ++i) { - if (field.repeated && values[keys[i]] === field.typeDefault) gen - ("default:"); - gen - ("case%j:", keys[i]) - ("case %i:", values[keys[i]]) - ("m%s=%j", prop, values[keys[i]]) - ("break"); - } gen - ("}"); - } else gen - ("if(typeof d%s!==\"object\")", prop) - ("throw TypeError(%j)", field.fullName + ": object expected") - ("m%s=types[%i].fromObject(d%s)", prop, fieldIndex, prop); - } else { - var isUnsigned = false; - switch (field.type) { - case "double": - case "float": gen - ("m%s=Number(d%s)", prop, prop); // also catches "NaN", "Infinity" - break; - case "uint32": - case "fixed32": gen - ("m%s=d%s>>>0", prop, prop); - break; - case "int32": - case "sint32": - case "sfixed32": gen - ("m%s=d%s|0", prop, prop); - break; - case "uint64": - isUnsigned = true; - // eslint-disable-line no-fallthrough - case "int64": - case "sint64": - case "fixed64": - case "sfixed64": gen - ("if(util.Long)") - ("(m%s=util.Long.fromValue(d%s)).unsigned=%j", prop, prop, isUnsigned) - ("else if(typeof d%s===\"string\")", prop) - ("m%s=parseInt(d%s,10)", prop, prop) - ("else if(typeof d%s===\"number\")", prop) - ("m%s=d%s", prop, prop) - ("else if(typeof d%s===\"object\")", prop) - ("m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)", prop, prop, prop, isUnsigned ? "true" : ""); - break; - case "bytes": gen - ("if(typeof d%s===\"string\")", prop) - ("util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)", prop, prop, prop) - ("else if(d%s.length)", prop) - ("m%s=d%s", prop, prop); - break; - case "string": gen - ("m%s=String(d%s)", prop, prop); - break; - case "bool": gen - ("m%s=Boolean(d%s)", prop, prop); - break; - /* default: gen - ("m%s=d%s", prop, prop); - break; */ - } - } - return gen; - /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */ -} - -/** - * Generates a plain object to runtime message converter specific to the specified message type. - * @param {Type} mtype Message type - * @returns {Codegen} Codegen instance - */ -converter.fromObject = function fromObject(mtype) { - /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */ - var fields = mtype.fieldsArray; - var gen = util.codegen(["d"], mtype.name + "$fromObject") - ("if(d instanceof this.ctor)") - ("return d"); - if (!fields.length) return gen - ("return new this.ctor"); - gen - ("var m=new this.ctor"); - for (var i = 0; i < fields.length; ++i) { - var field = fields[i].resolve(), - prop = util.safeProp(field.name); - - // Map fields - if (field.map) { gen - ("if(d%s){", prop) - ("if(typeof d%s!==\"object\")", prop) - ("throw TypeError(%j)", field.fullName + ": object expected") - ("m%s={}", prop) - ("for(var ks=Object.keys(d%s),i=0;i>>0,m%s.high>>>0).toNumber(%s):m%s", prop, prop, prop, prop, isUnsigned ? "true": "", prop); - break; - case "bytes": gen - ("d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s", prop, prop, prop, prop, prop); - break; - default: gen - ("d%s=m%s", prop, prop); - break; - } - } - return gen; - /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */ -} - -/** - * Generates a runtime message to plain object converter specific to the specified message type. - * @param {Type} mtype Message type - * @returns {Codegen} Codegen instance - */ -converter.toObject = function toObject(mtype) { - /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */ - var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById); - if (!fields.length) - return util.codegen()("return {}"); - var gen = util.codegen(["m", "o"], mtype.name + "$toObject") - ("if(!o)") - ("o={}") - ("var d={}"); - - var repeatedFields = [], - mapFields = [], - normalFields = [], - i = 0; - for (; i < fields.length; ++i) - if (!fields[i].partOf) - ( fields[i].resolve().repeated ? repeatedFields - : fields[i].map ? mapFields - : normalFields).push(fields[i]); - - if (repeatedFields.length) { gen - ("if(o.arrays||o.defaults){"); - for (i = 0; i < repeatedFields.length; ++i) gen - ("d%s=[]", util.safeProp(repeatedFields[i].name)); - gen - ("}"); - } - - if (mapFields.length) { gen - ("if(o.objects||o.defaults){"); - for (i = 0; i < mapFields.length; ++i) gen - ("d%s={}", util.safeProp(mapFields[i].name)); - gen - ("}"); - } - - if (normalFields.length) { gen - ("if(o.defaults){"); - for (i = 0; i < normalFields.length; ++i) { - var field = normalFields[i], - prop = util.safeProp(field.name); - if (field.resolvedType instanceof Enum) gen - ("d%s=o.enums===String?%j:%j", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault); - else if (field.long) gen - ("if(util.Long){") - ("var n=new util.Long(%i,%i,%j)", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned) - ("d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n", prop) - ("}else") - ("d%s=o.longs===String?%j:%i", prop, field.typeDefault.toString(), field.typeDefault.toNumber()); - else if (field.bytes) { - var arrayDefault = "[" + Array.prototype.slice.call(field.typeDefault).join(",") + "]"; - gen - ("if(o.bytes===String)d%s=%j", prop, String.fromCharCode.apply(String, field.typeDefault)) - ("else{") - ("d%s=%s", prop, arrayDefault) - ("if(o.bytes!==Array)d%s=util.newBuffer(d%s)", prop, prop) - ("}"); - } else gen - ("d%s=%j", prop, field.typeDefault); // also messages (=null) - } gen - ("}"); - } - var hasKs2 = false; - for (i = 0; i < fields.length; ++i) { - var field = fields[i], - index = mtype._fieldsArray.indexOf(field), - prop = util.safeProp(field.name); - if (field.map) { - if (!hasKs2) { hasKs2 = true; gen - ("var ks2"); - } gen - ("if(m%s&&(ks2=Object.keys(m%s)).length){", prop, prop) - ("d%s={}", prop) - ("for(var j=0;j { - -"use strict"; - - -/** - * Wrappers for common types. - * @type {Object.} - * @const - */ -var wrappers = exports; - -var Message = __webpack_require__(27); - -/** - * From object converter part of an {@link IWrapper}. - * @typedef WrapperFromObjectConverter - * @type {function} - * @param {Object.} object Plain object - * @returns {Message<{}>} Message instance - * @this Type - */ - -/** - * To object converter part of an {@link IWrapper}. - * @typedef WrapperToObjectConverter - * @type {function} - * @param {Message<{}>} message Message instance - * @param {IConversionOptions} [options] Conversion options - * @returns {Object.} Plain object - * @this Type - */ - -/** - * Common type wrapper part of {@link wrappers}. - * @interface IWrapper - * @property {WrapperFromObjectConverter} [fromObject] From object converter - * @property {WrapperToObjectConverter} [toObject] To object converter - */ - -// Custom wrapper for Any -wrappers[".google.protobuf.Any"] = { - - fromObject: function(object) { - - // unwrap value type if mapped - if (object && object["@type"]) { - var type = this.lookup(object["@type"]); - /* istanbul ignore else */ - if (type) { - // type_url does not accept leading "." - var type_url = object["@type"].charAt(0) === "." ? - object["@type"].substr(1) : object["@type"]; - // type_url prefix is optional, but path seperator is required - return this.create({ - type_url: "/" + type_url, - value: type.encode(type.fromObject(object)).finish() - }); - } - } - - return this.fromObject(object); - }, - - toObject: function(message, options) { - - // decode value if requested and unmapped - if (options && options.json && message.type_url && message.value) { - // Only use fully qualified type name after the last '/' - var name = message.type_url.substring(message.type_url.lastIndexOf("/") + 1); - var type = this.lookup(name); - /* istanbul ignore else */ - if (type) - message = type.decode(message.value); - } - - // wrap value if unmapped - if (!(message instanceof this.ctor) && message instanceof Message) { - var object = message.$type.toObject(message, options); - object["@type"] = message.$type.fullName; - return object; - } - - return this.toObject(message, options); - } -}; - - -/***/ }), -/* 47 */ -/***/ ((module) => { - -"use strict"; - -module.exports = tokenize; - -var delimRe = /[\s{}=;:[\],'"()<>]/g, - stringDoubleRe = /(?:"([^"\\]*(?:\\.[^"\\]*)*)")/g, - stringSingleRe = /(?:'([^'\\]*(?:\\.[^'\\]*)*)')/g; - -var setCommentRe = /^ *[*/]+ */, - setCommentAltRe = /^\s*\*?\/*/, - setCommentSplitRe = /\n/g, - whitespaceRe = /\s/, - unescapeRe = /\\(.?)/g; - -var unescapeMap = { - "0": "\0", - "r": "\r", - "n": "\n", - "t": "\t" -}; - -/** - * Unescapes a string. - * @param {string} str String to unescape - * @returns {string} Unescaped string - * @property {Object.} map Special characters map - * @memberof tokenize - */ -function unescape(str) { - return str.replace(unescapeRe, function($0, $1) { - switch ($1) { - case "\\": - case "": - return $1; - default: - return unescapeMap[$1] || ""; - } - }); -} - -tokenize.unescape = unescape; - -/** - * Gets the next token and advances. - * @typedef TokenizerHandleNext - * @type {function} - * @returns {string|null} Next token or `null` on eof - */ - -/** - * Peeks for the next token. - * @typedef TokenizerHandlePeek - * @type {function} - * @returns {string|null} Next token or `null` on eof - */ - -/** - * Pushes a token back to the stack. - * @typedef TokenizerHandlePush - * @type {function} - * @param {string} token Token - * @returns {undefined} - */ - -/** - * Skips the next token. - * @typedef TokenizerHandleSkip - * @type {function} - * @param {string} expected Expected token - * @param {boolean} [optional=false] If optional - * @returns {boolean} Whether the token matched - * @throws {Error} If the token didn't match and is not optional - */ - -/** - * Gets the comment on the previous line or, alternatively, the line comment on the specified line. - * @typedef TokenizerHandleCmnt - * @type {function} - * @param {number} [line] Line number - * @returns {string|null} Comment text or `null` if none - */ - -/** - * Handle object returned from {@link tokenize}. - * @interface ITokenizerHandle - * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof) - * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof) - * @property {TokenizerHandlePush} push Pushes a token back to the stack - * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws - * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any - * @property {number} line Current line number - */ - -/** - * Tokenizes the given .proto source and returns an object with useful utility functions. - * @param {string} source Source contents - * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode. - * @returns {ITokenizerHandle} Tokenizer handle - */ -function tokenize(source, alternateCommentMode) { - /* eslint-disable callback-return */ - source = source.toString(); - - var offset = 0, - length = source.length, - line = 1, - commentType = null, - commentText = null, - commentLine = 0, - commentLineEmpty = false; - - var stack = []; - - var stringDelim = null; - - /* istanbul ignore next */ - /** - * Creates an error for illegal syntax. - * @param {string} subject Subject - * @returns {Error} Error created - * @inner - */ - function illegal(subject) { - return Error("illegal " + subject + " (line " + line + ")"); - } - - /** - * Reads a string till its end. - * @returns {string} String read - * @inner - */ - function readString() { - var re = stringDelim === "'" ? stringSingleRe : stringDoubleRe; - re.lastIndex = offset - 1; - var match = re.exec(source); - if (!match) - throw illegal("string"); - offset = re.lastIndex; - push(stringDelim); - stringDelim = null; - return unescape(match[1]); - } - - /** - * Gets the character at `pos` within the source. - * @param {number} pos Position - * @returns {string} Character - * @inner - */ - function charAt(pos) { - return source.charAt(pos); - } - - /** - * Sets the current comment text. - * @param {number} start Start offset - * @param {number} end End offset - * @returns {undefined} - * @inner - */ - function setComment(start, end) { - commentType = source.charAt(start++); - commentLine = line; - commentLineEmpty = false; - var lookback; - if (alternateCommentMode) { - lookback = 2; // alternate comment parsing: "//" or "/*" - } else { - lookback = 3; // "///" or "/**" - } - var commentOffset = start - lookback, - c; - do { - if (--commentOffset < 0 || - (c = source.charAt(commentOffset)) === "\n") { - commentLineEmpty = true; - break; - } - } while (c === " " || c === "\t"); - var lines = source - .substring(start, end) - .split(setCommentSplitRe); - for (var i = 0; i < lines.length; ++i) - lines[i] = lines[i] - .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, "") - .trim(); - commentText = lines - .join("\n") - .trim(); - } - - function isDoubleSlashCommentLine(startOffset) { - var endOffset = findEndOfLine(startOffset); - - // see if remaining line matches comment pattern - var lineText = source.substring(startOffset, endOffset); - // look for 1 or 2 slashes since startOffset would already point past - // the first slash that started the comment. - var isComment = /^\s*\/{1,2}/.test(lineText); - return isComment; - } - - function findEndOfLine(cursor) { - // find end of cursor's line - var endOffset = cursor; - while (endOffset < length && charAt(endOffset) !== "\n") { - endOffset++; - } - return endOffset; - } - - /** - * Obtains the next token. - * @returns {string|null} Next token or `null` on eof - * @inner - */ - function next() { - if (stack.length > 0) - return stack.shift(); - if (stringDelim) - return readString(); - var repeat, - prev, - curr, - start, - isDoc; - do { - if (offset === length) - return null; - repeat = false; - while (whitespaceRe.test(curr = charAt(offset))) { - if (curr === "\n") - ++line; - if (++offset === length) - return null; - } - - if (charAt(offset) === "/") { - if (++offset === length) { - throw illegal("comment"); - } - if (charAt(offset) === "/") { // Line - if (!alternateCommentMode) { - // check for triple-slash comment - isDoc = charAt(start = offset + 1) === "/"; - - while (charAt(++offset) !== "\n") { - if (offset === length) { - return null; - } - } - ++offset; - if (isDoc) { - setComment(start, offset - 1); - } - ++line; - repeat = true; - } else { - // check for double-slash comments, consolidating consecutive lines - start = offset; - isDoc = false; - if (isDoubleSlashCommentLine(offset)) { - isDoc = true; - do { - offset = findEndOfLine(offset); - if (offset === length) { - break; - } - offset++; - } while (isDoubleSlashCommentLine(offset)); - } else { - offset = Math.min(length, findEndOfLine(offset) + 1); - } - if (isDoc) { - setComment(start, offset); - } - line++; - repeat = true; - } - } else if ((curr = charAt(offset)) === "*") { /* Block */ - // check for /** (regular comment mode) or /* (alternate comment mode) - start = offset + 1; - isDoc = alternateCommentMode || charAt(start) === "*"; - do { - if (curr === "\n") { - ++line; - } - if (++offset === length) { - throw illegal("comment"); - } - prev = curr; - curr = charAt(offset); - } while (prev !== "*" || curr !== "/"); - ++offset; - if (isDoc) { - setComment(start, offset - 2); - } - repeat = true; - } else { - return "/"; - } - } - } while (repeat); - - // offset !== length if we got here - - var end = offset; - delimRe.lastIndex = 0; - var delim = delimRe.test(charAt(end++)); - if (!delim) - while (end < length && !delimRe.test(charAt(end))) - ++end; - var token = source.substring(offset, offset = end); - if (token === "\"" || token === "'") - stringDelim = token; - return token; - } - - /** - * Pushes a token back to the stack. - * @param {string} token Token - * @returns {undefined} - * @inner - */ - function push(token) { - stack.push(token); - } - - /** - * Peeks for the next token. - * @returns {string|null} Token or `null` on eof - * @inner - */ - function peek() { - if (!stack.length) { - var token = next(); - if (token === null) - return null; - push(token); - } - return stack[0]; - } - - /** - * Skips a token. - * @param {string} expected Expected token - * @param {boolean} [optional=false] Whether the token is optional - * @returns {boolean} `true` when skipped, `false` if not - * @throws {Error} When a required token is not present - * @inner - */ - function skip(expected, optional) { - var actual = peek(), - equals = actual === expected; - if (equals) { - next(); - return true; - } - if (!optional) - throw illegal("token '" + actual + "', '" + expected + "' expected"); - return false; - } - - /** - * Gets a comment. - * @param {number} [trailingLine] Line number if looking for a trailing comment - * @returns {string|null} Comment text - * @inner - */ - function cmnt(trailingLine) { - var ret = null; - if (trailingLine === undefined) { - if (commentLine === line - 1 && (alternateCommentMode || commentType === "*" || commentLineEmpty)) { - ret = commentText; - } - } else { - /* istanbul ignore else */ - if (commentLine < trailingLine) { - peek(); - } - if (commentLine === trailingLine && !commentLineEmpty && (alternateCommentMode || commentType === "/")) { - ret = commentText; - } - } - return ret; - } - - return Object.defineProperty({ - next: next, - peek: peek, - push: push, - skip: skip, - cmnt: cmnt - }, "line", { - get: function() { return line; } - }); - /* eslint-enable callback-return */ -} - - -/***/ }), -/* 48 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var elliptic = exports; - -elliptic.version = (__webpack_require__(153)/* .version */ .i8); -elliptic.utils = __webpack_require__(1); -elliptic.rand = __webpack_require__(50); -elliptic.curve = __webpack_require__(51); -elliptic.curves = __webpack_require__(30); - -// Protocols -elliptic.ec = __webpack_require__(104); -elliptic.eddsa = __webpack_require__(108); - - -/***/ }), -/* 49 */ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -var utils = exports; - -function toArray(msg, enc) { - if (Array.isArray(msg)) - return msg.slice(); - if (!msg) - return []; - var res = []; - if (typeof msg !== 'string') { - for (var i = 0; i < msg.length; i++) - res[i] = msg[i] | 0; - return res; - } - if (enc === 'hex') { - msg = msg.replace(/[^a-z0-9]+/ig, ''); - if (msg.length % 2 !== 0) - msg = '0' + msg; - for (var i = 0; i < msg.length; i += 2) - res.push(parseInt(msg[i] + msg[i + 1], 16)); - } else { - for (var i = 0; i < msg.length; i++) { - var c = msg.charCodeAt(i); - var hi = c >> 8; - var lo = c & 0xff; - if (hi) - res.push(hi, lo); - else - res.push(lo); - } - } - return res; -} -utils.toArray = toArray; - -function zero2(word) { - if (word.length === 1) - return '0' + word; - else - return word; -} -utils.zero2 = zero2; - -function toHex(msg) { - var res = ''; - for (var i = 0; i < msg.length; i++) - res += zero2(msg[i].toString(16)); - return res; -} -utils.toHex = toHex; - -utils.encode = function encode(arr, enc) { - if (enc === 'hex') - return toHex(arr); - else - return arr; -}; - - -/***/ }), -/* 50 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var r; - -module.exports = function rand(len) { - if (!r) - r = new Rand(null); - - return r.generate(len); -}; - -function Rand(rand) { - this.rand = rand; -} -module.exports.Rand = Rand; - -Rand.prototype.generate = function generate(len) { - return this._rand(len); -}; - -// Emulate crypto API using randy -Rand.prototype._rand = function _rand(n) { - if (this.rand.getBytes) - return this.rand.getBytes(n); - - var res = new Uint8Array(n); - for (var i = 0; i < res.length; i++) - res[i] = this.rand.getByte(); - return res; -}; - -if (typeof self === 'object') { - if (self.crypto && self.crypto.getRandomValues) { - // Modern browsers - Rand.prototype._rand = function _rand(n) { - var arr = new Uint8Array(n); - self.crypto.getRandomValues(arr); - return arr; - }; - } else if (self.msCrypto && self.msCrypto.getRandomValues) { - // IE - Rand.prototype._rand = function _rand(n) { - var arr = new Uint8Array(n); - self.msCrypto.getRandomValues(arr); - return arr; - }; - - // Safari's WebWorkers do not have `crypto` - } else if (typeof window === 'object') { - // Old junk - Rand.prototype._rand = function() { - throw new Error('Not implemented yet'); - }; - } -} else { - // Node.js or Web worker with no crypto support - try { - var crypto = __webpack_require__(4); - if (typeof crypto.randomBytes !== 'function') - throw new Error('Not supported'); - - Rand.prototype._rand = function _rand(n) { - return crypto.randomBytes(n); - }; - } catch (e) { - } -} - - -/***/ }), -/* 51 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var curve = exports; - -curve.base = __webpack_require__(19); -curve.short = __webpack_require__(95); -curve.mont = __webpack_require__(96); -curve.edwards = __webpack_require__(97); - - -/***/ }), -/* 52 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var common = __webpack_require__(20); -var shaCommon = __webpack_require__(99); -var assert = __webpack_require__(12); - -var sum32 = utils.sum32; -var sum32_4 = utils.sum32_4; -var sum32_5 = utils.sum32_5; -var ch32 = shaCommon.ch32; -var maj32 = shaCommon.maj32; -var s0_256 = shaCommon.s0_256; -var s1_256 = shaCommon.s1_256; -var g0_256 = shaCommon.g0_256; -var g1_256 = shaCommon.g1_256; - -var BlockHash = common.BlockHash; - -var sha256_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 -]; - -function SHA256() { - if (!(this instanceof SHA256)) - return new SHA256(); - - BlockHash.call(this); - this.h = [ - 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, - 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 - ]; - this.k = sha256_K; - this.W = new Array(64); -} -utils.inherits(SHA256, BlockHash); -module.exports = SHA256; - -SHA256.blockSize = 512; -SHA256.outSize = 256; -SHA256.hmacStrength = 192; -SHA256.padLength = 64; - -SHA256.prototype._update = function _update(msg, start) { - var W = this.W; - - for (var i = 0; i < 16; i++) - W[i] = msg[start + i]; - for (; i < W.length; i++) - W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]); - - var a = this.h[0]; - var b = this.h[1]; - var c = this.h[2]; - var d = this.h[3]; - var e = this.h[4]; - var f = this.h[5]; - var g = this.h[6]; - var h = this.h[7]; - - assert(this.k.length === W.length); - for (i = 0; i < W.length; i++) { - var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]); - var T2 = sum32(s0_256(a), maj32(a, b, c)); - h = g; - g = f; - f = e; - e = sum32(d, T1); - d = c; - c = b; - b = a; - a = sum32(T1, T2); - } - - this.h[0] = sum32(this.h[0], a); - this.h[1] = sum32(this.h[1], b); - this.h[2] = sum32(this.h[2], c); - this.h[3] = sum32(this.h[3], d); - this.h[4] = sum32(this.h[4], e); - this.h[5] = sum32(this.h[5], f); - this.h[6] = sum32(this.h[6], g); - this.h[7] = sum32(this.h[7], h); -}; - -SHA256.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'big'); - else - return utils.split32(this.h, 'big'); -}; - - -/***/ }), -/* 53 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var common = __webpack_require__(20); -var assert = __webpack_require__(12); - -var rotr64_hi = utils.rotr64_hi; -var rotr64_lo = utils.rotr64_lo; -var shr64_hi = utils.shr64_hi; -var shr64_lo = utils.shr64_lo; -var sum64 = utils.sum64; -var sum64_hi = utils.sum64_hi; -var sum64_lo = utils.sum64_lo; -var sum64_4_hi = utils.sum64_4_hi; -var sum64_4_lo = utils.sum64_4_lo; -var sum64_5_hi = utils.sum64_5_hi; -var sum64_5_lo = utils.sum64_5_lo; - -var BlockHash = common.BlockHash; - -var sha512_K = [ - 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, - 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, - 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, - 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, - 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, - 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, - 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, - 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, - 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, - 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, - 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, - 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, - 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, - 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, - 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, - 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, - 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, - 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, - 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, - 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, - 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, - 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, - 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, - 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, - 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, - 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, - 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, - 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, - 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, - 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, - 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, - 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, - 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, - 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, - 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, - 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, - 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, - 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, - 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, - 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817 -]; - -function SHA512() { - if (!(this instanceof SHA512)) - return new SHA512(); - - BlockHash.call(this); - this.h = [ - 0x6a09e667, 0xf3bcc908, - 0xbb67ae85, 0x84caa73b, - 0x3c6ef372, 0xfe94f82b, - 0xa54ff53a, 0x5f1d36f1, - 0x510e527f, 0xade682d1, - 0x9b05688c, 0x2b3e6c1f, - 0x1f83d9ab, 0xfb41bd6b, - 0x5be0cd19, 0x137e2179 ]; - this.k = sha512_K; - this.W = new Array(160); -} -utils.inherits(SHA512, BlockHash); -module.exports = SHA512; - -SHA512.blockSize = 1024; -SHA512.outSize = 512; -SHA512.hmacStrength = 192; -SHA512.padLength = 128; - -SHA512.prototype._prepareBlock = function _prepareBlock(msg, start) { - var W = this.W; - - // 32 x 32bit words - for (var i = 0; i < 32; i++) - W[i] = msg[start + i]; - for (; i < W.length; i += 2) { - var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2 - var c0_lo = g1_512_lo(W[i - 4], W[i - 3]); - var c1_hi = W[i - 14]; // i - 7 - var c1_lo = W[i - 13]; - var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15 - var c2_lo = g0_512_lo(W[i - 30], W[i - 29]); - var c3_hi = W[i - 32]; // i - 16 - var c3_lo = W[i - 31]; - - W[i] = sum64_4_hi( - c0_hi, c0_lo, - c1_hi, c1_lo, - c2_hi, c2_lo, - c3_hi, c3_lo); - W[i + 1] = sum64_4_lo( - c0_hi, c0_lo, - c1_hi, c1_lo, - c2_hi, c2_lo, - c3_hi, c3_lo); - } -}; - -SHA512.prototype._update = function _update(msg, start) { - this._prepareBlock(msg, start); - - var W = this.W; - - var ah = this.h[0]; - var al = this.h[1]; - var bh = this.h[2]; - var bl = this.h[3]; - var ch = this.h[4]; - var cl = this.h[5]; - var dh = this.h[6]; - var dl = this.h[7]; - var eh = this.h[8]; - var el = this.h[9]; - var fh = this.h[10]; - var fl = this.h[11]; - var gh = this.h[12]; - var gl = this.h[13]; - var hh = this.h[14]; - var hl = this.h[15]; - - assert(this.k.length === W.length); - for (var i = 0; i < W.length; i += 2) { - var c0_hi = hh; - var c0_lo = hl; - var c1_hi = s1_512_hi(eh, el); - var c1_lo = s1_512_lo(eh, el); - var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl); - var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl); - var c3_hi = this.k[i]; - var c3_lo = this.k[i + 1]; - var c4_hi = W[i]; - var c4_lo = W[i + 1]; - - var T1_hi = sum64_5_hi( - c0_hi, c0_lo, - c1_hi, c1_lo, - c2_hi, c2_lo, - c3_hi, c3_lo, - c4_hi, c4_lo); - var T1_lo = sum64_5_lo( - c0_hi, c0_lo, - c1_hi, c1_lo, - c2_hi, c2_lo, - c3_hi, c3_lo, - c4_hi, c4_lo); - - c0_hi = s0_512_hi(ah, al); - c0_lo = s0_512_lo(ah, al); - c1_hi = maj64_hi(ah, al, bh, bl, ch, cl); - c1_lo = maj64_lo(ah, al, bh, bl, ch, cl); - - var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo); - var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo); - - hh = gh; - hl = gl; - - gh = fh; - gl = fl; - - fh = eh; - fl = el; - - eh = sum64_hi(dh, dl, T1_hi, T1_lo); - el = sum64_lo(dl, dl, T1_hi, T1_lo); - - dh = ch; - dl = cl; - - ch = bh; - cl = bl; - - bh = ah; - bl = al; - - ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo); - al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo); - } - - sum64(this.h, 0, ah, al); - sum64(this.h, 2, bh, bl); - sum64(this.h, 4, ch, cl); - sum64(this.h, 6, dh, dl); - sum64(this.h, 8, eh, el); - sum64(this.h, 10, fh, fl); - sum64(this.h, 12, gh, gl); - sum64(this.h, 14, hh, hl); -}; - -SHA512.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'big'); - else - return utils.split32(this.h, 'big'); -}; - -function ch64_hi(xh, xl, yh, yl, zh) { - var r = (xh & yh) ^ ((~xh) & zh); - if (r < 0) - r += 0x100000000; - return r; -} - -function ch64_lo(xh, xl, yh, yl, zh, zl) { - var r = (xl & yl) ^ ((~xl) & zl); - if (r < 0) - r += 0x100000000; - return r; -} - -function maj64_hi(xh, xl, yh, yl, zh) { - var r = (xh & yh) ^ (xh & zh) ^ (yh & zh); - if (r < 0) - r += 0x100000000; - return r; -} - -function maj64_lo(xh, xl, yh, yl, zh, zl) { - var r = (xl & yl) ^ (xl & zl) ^ (yl & zl); - if (r < 0) - r += 0x100000000; - return r; -} - -function s0_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 28); - var c1_hi = rotr64_hi(xl, xh, 2); // 34 - var c2_hi = rotr64_hi(xl, xh, 7); // 39 - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function s0_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 28); - var c1_lo = rotr64_lo(xl, xh, 2); // 34 - var c2_lo = rotr64_lo(xl, xh, 7); // 39 - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - -function s1_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 14); - var c1_hi = rotr64_hi(xh, xl, 18); - var c2_hi = rotr64_hi(xl, xh, 9); // 41 - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function s1_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 14); - var c1_lo = rotr64_lo(xh, xl, 18); - var c2_lo = rotr64_lo(xl, xh, 9); // 41 - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - -function g0_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 1); - var c1_hi = rotr64_hi(xh, xl, 8); - var c2_hi = shr64_hi(xh, xl, 7); - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function g0_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 1); - var c1_lo = rotr64_lo(xh, xl, 8); - var c2_lo = shr64_lo(xh, xl, 7); - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - -function g1_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 19); - var c1_hi = rotr64_hi(xl, xh, 29); // 61 - var c2_hi = shr64_hi(xh, xl, 6); - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function g1_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 19); - var c1_lo = rotr64_lo(xl, xh, 29); // 61 - var c2_lo = shr64_lo(xh, xl, 6); - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - - -/***/ }), -/* 54 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(4).createHash - - -/***/ }), -/* 55 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var sizes = { - md5: 16, - sha1: 20, - sha224: 28, - sha256: 32, - sha384: 48, - sha512: 64, - rmd160: 20, - ripemd160: 20 -} - -var createHmac = __webpack_require__(158) -var Buffer = (__webpack_require__(6).Buffer) - -var checkParameters = __webpack_require__(32) -var defaultEncoding = __webpack_require__(33) -var toBuffer = __webpack_require__(34) - -function pbkdf2 (password, salt, iterations, keylen, digest) { - checkParameters(iterations, keylen) - password = toBuffer(password, defaultEncoding, 'Password') - salt = toBuffer(salt, defaultEncoding, 'Salt') - - digest = digest || 'sha1' - - var DK = Buffer.allocUnsafe(keylen) - var block1 = Buffer.allocUnsafe(salt.length + 4) - salt.copy(block1, 0, 0, salt.length) - - var destPos = 0 - var hLen = sizes[digest] - var l = Math.ceil(keylen / hLen) - - for (var i = 1; i <= l; i++) { - block1.writeUInt32BE(i, salt.length) - - var T = createHmac(digest, password).update(block1).digest() - var U = T - - for (var j = 1; j < iterations; j++) { - U = createHmac(digest, password).update(U).digest() - for (var k = 0; k < hLen; k++) T[k] ^= U[k] - } - - T.copy(DK, destPos) - destPos += hLen - } - - return DK -} - -module.exports = pbkdf2 - - -/***/ }), -/* 56 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("fs"); - -/***/ }), -/* 57 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("path"); - -/***/ }), -/* 58 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const crypto = __webpack_require__(4) -const MAX_VALUE = 0x7fffffff -const DEFAULT_PROMISE_INTERVAL = 5000 -/* eslint-disable camelcase */ - -function checkAndInit (key, salt, N, r, p, dkLen, progressCallback) { - if (N === 0 || (N & (N - 1)) !== 0) throw Error('N must be > 0 and a power of 2') - - if (N > MAX_VALUE / 128 / r) throw Error('Parameter N is too large') - if (r > MAX_VALUE / 128 / p) throw Error('Parameter r is too large') - - let XY = Buffer.alloc(256 * r) - let V = Buffer.alloc(128 * r * N) - - // pseudo global - let B32 = new Int32Array(16) // salsa20_8 - let x = new Int32Array(16) // salsa20_8 - let _X = Buffer.alloc(64) // blockmix_salsa8 - - // pseudo global - let B = crypto.pbkdf2Sync(key, salt, 1, p * 128 * r, 'sha256') - - let tickCallback - if (progressCallback) { - let totalOps = p * N * 2 - let currentOp = 0 - - tickCallback = function () { - ++currentOp - - // send progress notifications once every 1,000 ops - if (currentOp % 1000 === 0) { - progressCallback({ - current: currentOp, - total: totalOps, - percent: (currentOp / totalOps) * 100.0 - }) - } - } - } - return { - XY, - V, - B32, - x, - _X, - B, - tickCallback - } -} - -async function smix (B, Bi, r, N, V, XY, _X, B32, x, tickCallback, promiseInterval) { - promiseInterval = promiseInterval || DEFAULT_PROMISE_INTERVAL - let Xi = 0 - let Yi = 128 * r - let i - - B.copy(XY, Xi, Bi, Bi + Yi) - - for (i = 0; i < N; i++) { - XY.copy(V, i * Yi, Xi, Xi + Yi) - if (i % promiseInterval === 0) { - await new Promise(resolve => setImmediate(resolve)) - } - blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x) - - if (tickCallback) tickCallback() - } - - for (i = 0; i < N; i++) { - let offset = Xi + (2 * r - 1) * 64 - let j = XY.readUInt32LE(offset) & (N - 1) - blockxor(V, j * Yi, XY, Xi, Yi) - if (i % promiseInterval === 0) { - await new Promise(resolve => setImmediate(resolve)) - } - blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x) - - if (tickCallback) tickCallback() - } - - XY.copy(B, Bi, Xi, Xi + Yi) -} - -function smixSync (B, Bi, r, N, V, XY, _X, B32, x, tickCallback) { - let Xi = 0 - let Yi = 128 * r - let i - - B.copy(XY, Xi, Bi, Bi + Yi) - - for (i = 0; i < N; i++) { - XY.copy(V, i * Yi, Xi, Xi + Yi) - blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x) - - if (tickCallback) tickCallback() - } - - for (i = 0; i < N; i++) { - let offset = Xi + (2 * r - 1) * 64 - let j = XY.readUInt32LE(offset) & (N - 1) - blockxor(V, j * Yi, XY, Xi, Yi) - blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x) - - if (tickCallback) tickCallback() - } - - XY.copy(B, Bi, Xi, Xi + Yi) -} - -function blockmix_salsa8 (BY, Bi, Yi, r, _X, B32, x) { - let i - - arraycopy(BY, Bi + (2 * r - 1) * 64, _X, 0, 64) - - for (i = 0; i < 2 * r; i++) { - blockxor(BY, i * 64, _X, 0, 64) - salsa20_8(_X, B32, x) - arraycopy(_X, 0, BY, Yi + (i * 64), 64) - } - - for (i = 0; i < r; i++) { - arraycopy(BY, Yi + (i * 2) * 64, BY, Bi + (i * 64), 64) - } - - for (i = 0; i < r; i++) { - arraycopy(BY, Yi + (i * 2 + 1) * 64, BY, Bi + (i + r) * 64, 64) - } -} - -function R (a, b) { - return (a << b) | (a >>> (32 - b)) -} - -function salsa20_8 (B, B32, x) { - let i - - for (i = 0; i < 16; i++) { - B32[i] = (B[i * 4 + 0] & 0xff) << 0 - B32[i] |= (B[i * 4 + 1] & 0xff) << 8 - B32[i] |= (B[i * 4 + 2] & 0xff) << 16 - B32[i] |= (B[i * 4 + 3] & 0xff) << 24 - // B32[i] = B.readUInt32LE(i*4) <--- this is signficantly slower even in Node.js - } - - arraycopy(B32, 0, x, 0, 16) - - for (i = 8; i > 0; i -= 2) { - x[4] ^= R(x[0] + x[12], 7) - x[8] ^= R(x[4] + x[0], 9) - x[12] ^= R(x[8] + x[4], 13) - x[0] ^= R(x[12] + x[8], 18) - x[9] ^= R(x[5] + x[1], 7) - x[13] ^= R(x[9] + x[5], 9) - x[1] ^= R(x[13] + x[9], 13) - x[5] ^= R(x[1] + x[13], 18) - x[14] ^= R(x[10] + x[6], 7) - x[2] ^= R(x[14] + x[10], 9) - x[6] ^= R(x[2] + x[14], 13) - x[10] ^= R(x[6] + x[2], 18) - x[3] ^= R(x[15] + x[11], 7) - x[7] ^= R(x[3] + x[15], 9) - x[11] ^= R(x[7] + x[3], 13) - x[15] ^= R(x[11] + x[7], 18) - x[1] ^= R(x[0] + x[3], 7) - x[2] ^= R(x[1] + x[0], 9) - x[3] ^= R(x[2] + x[1], 13) - x[0] ^= R(x[3] + x[2], 18) - x[6] ^= R(x[5] + x[4], 7) - x[7] ^= R(x[6] + x[5], 9) - x[4] ^= R(x[7] + x[6], 13) - x[5] ^= R(x[4] + x[7], 18) - x[11] ^= R(x[10] + x[9], 7) - x[8] ^= R(x[11] + x[10], 9) - x[9] ^= R(x[8] + x[11], 13) - x[10] ^= R(x[9] + x[8], 18) - x[12] ^= R(x[15] + x[14], 7) - x[13] ^= R(x[12] + x[15], 9) - x[14] ^= R(x[13] + x[12], 13) - x[15] ^= R(x[14] + x[13], 18) - } - - for (i = 0; i < 16; ++i) B32[i] = x[i] + B32[i] - - for (i = 0; i < 16; i++) { - let bi = i * 4 - B[bi + 0] = (B32[i] >> 0 & 0xff) - B[bi + 1] = (B32[i] >> 8 & 0xff) - B[bi + 2] = (B32[i] >> 16 & 0xff) - B[bi + 3] = (B32[i] >> 24 & 0xff) - // B.writeInt32LE(B32[i], i*4) //<--- this is signficantly slower even in Node.js - } -} - -// naive approach... going back to loop unrolling may yield additional performance -function blockxor (S, Si, D, Di, len) { - for (let i = 0; i < len; i++) { - D[Di + i] ^= S[Si + i] - } -} - -function arraycopy (src, srcPos, dest, destPos, length) { - if (Buffer.isBuffer(src) && Buffer.isBuffer(dest)) { - src.copy(dest, destPos, srcPos, srcPos + length) - } else { - while (length--) { - dest[destPos++] = src[srcPos++] - } - } -} - -module.exports = { - checkAndInit, - smix, - smixSync -} - - -/***/ }), -/* 59 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const createKeccak = __webpack_require__(129) -const createShake = __webpack_require__(137) - -module.exports = function (KeccakState) { - const Keccak = createKeccak(KeccakState) - const Shake = createShake(KeccakState) - - return function (algorithm, options) { - const hash = typeof algorithm === 'string' ? algorithm.toLowerCase() : algorithm - switch (hash) { - case 'keccak224': return new Keccak(1152, 448, null, 224, options) - case 'keccak256': return new Keccak(1088, 512, null, 256, options) - case 'keccak384': return new Keccak(832, 768, null, 384, options) - case 'keccak512': return new Keccak(576, 1024, null, 512, options) - - case 'sha3-224': return new Keccak(1152, 448, 0x06, 224, options) - case 'sha3-256': return new Keccak(1088, 512, 0x06, 256, options) - case 'sha3-384': return new Keccak(832, 768, 0x06, 384, options) - case 'sha3-512': return new Keccak(576, 1024, 0x06, 512, options) - - case 'shake128': return new Shake(1344, 256, 0x1f, options) - case 'shake256': return new Shake(1088, 512, 0x1f, options) - - default: throw new Error('Invald algorithm: ' + algorithm) - } - } -} - - -/***/ }), -/* 60 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -module.exports = Readable; - -/**/ -var Duplex; -/**/ - -Readable.ReadableState = ReadableState; - -/**/ -var EE = (__webpack_require__(166).EventEmitter); -var EElistenerCount = function EElistenerCount(emitter, type) { - return emitter.listeners(type).length; -}; -/**/ - -/**/ -var Stream = __webpack_require__(131); -/**/ - -var Buffer = (__webpack_require__(10).Buffer); -var OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {}; -function _uint8ArrayToBuffer(chunk) { - return Buffer.from(chunk); -} -function _isUint8Array(obj) { - return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; -} - -/**/ -var debugUtil = __webpack_require__(29); -var debug; -if (debugUtil && debugUtil.debuglog) { - debug = debugUtil.debuglog('stream'); -} else { - debug = function debug() {}; -} -/**/ - -var BufferList = __webpack_require__(132); -var destroyImpl = __webpack_require__(61); -var _require = __webpack_require__(62), - getHighWaterMark = _require.getHighWaterMark; -var _require$codes = (__webpack_require__(15)/* .codes */ .q), - ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, - ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF, - ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, - ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; - -// Lazy loaded to improve the startup performance. -var StringDecoder; -var createReadableStreamAsyncIterator; -var from; -__webpack_require__(7)(Readable, Stream); -var errorOrDestroy = destroyImpl.errorOrDestroy; -var kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume']; -function prependListener(emitter, event, fn) { - // Sadly this is not cacheable as some libraries bundle their own - // event emitter implementation with them. - if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn); - - // This is a hack to make sure that our error handler is attached before any - // userland ones. NEVER DO THIS. This is here only because this code needs - // to continue to work with older versions of Node.js that do not include - // the prependListener() method. The goal is to eventually remove this hack. - if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]]; -} -function ReadableState(options, stream, isDuplex) { - Duplex = Duplex || __webpack_require__(17); - options = options || {}; - - // Duplex streams are both readable and writable, but share - // the same options object. - // However, some cases require setting options to different - // values for the readable and the writable sides of the duplex stream. - // These options can be provided separately as readableXXX and writableXXX. - if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; - - // object stream flag. Used to make read(n) ignore n and to - // make all the buffer merging and length checks go away - this.objectMode = !!options.objectMode; - if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; - - // the point at which it stops calling _read() to fill the buffer - // Note: 0 is a valid value, means "don't call _read preemptively ever" - this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); - - // A linked list is used to store data chunks instead of an array because the - // linked list can remove elements from the beginning faster than - // array.shift() - this.buffer = new BufferList(); - this.length = 0; - this.pipes = null; - this.pipesCount = 0; - this.flowing = null; - this.ended = false; - this.endEmitted = false; - this.reading = false; - - // a flag to be able to tell if the event 'readable'/'data' is emitted - // immediately, or on a later tick. We set this to true at first, because - // any actions that shouldn't happen until "later" should generally also - // not happen before the first read call. - this.sync = true; - - // whenever we return null, then we set a flag to say - // that we're awaiting a 'readable' event emission. - this.needReadable = false; - this.emittedReadable = false; - this.readableListening = false; - this.resumeScheduled = false; - this.paused = true; - - // Should close be emitted on destroy. Defaults to true. - this.emitClose = options.emitClose !== false; - - // Should .destroy() be called after 'end' (and potentially 'finish') - this.autoDestroy = !!options.autoDestroy; - - // has it been destroyed - this.destroyed = false; - - // Crypto is kind of old and crusty. Historically, its default string - // encoding is 'binary' so we have to make this configurable. - // Everything else in the universe uses 'utf8', though. - this.defaultEncoding = options.defaultEncoding || 'utf8'; - - // the number of writers that are awaiting a drain event in .pipe()s - this.awaitDrain = 0; - - // if true, a maybeReadMore has been scheduled - this.readingMore = false; - this.decoder = null; - this.encoding = null; - if (options.encoding) { - if (!StringDecoder) StringDecoder = (__webpack_require__(148)/* .StringDecoder */ .s); - this.decoder = new StringDecoder(options.encoding); - this.encoding = options.encoding; - } -} -function Readable(options) { - Duplex = Duplex || __webpack_require__(17); - if (!(this instanceof Readable)) return new Readable(options); - - // Checking for a Stream.Duplex instance is faster here instead of inside - // the ReadableState constructor, at least with V8 6.5 - var isDuplex = this instanceof Duplex; - this._readableState = new ReadableState(options, this, isDuplex); - - // legacy - this.readable = true; - if (options) { - if (typeof options.read === 'function') this._read = options.read; - if (typeof options.destroy === 'function') this._destroy = options.destroy; - } - Stream.call(this); -} -Object.defineProperty(Readable.prototype, 'destroyed', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - if (this._readableState === undefined) { - return false; - } - return this._readableState.destroyed; - }, - set: function set(value) { - // we ignore the value if the stream - // has not been initialized yet - if (!this._readableState) { - return; - } - - // backward compatibility, the user is explicitly - // managing destroyed - this._readableState.destroyed = value; - } -}); -Readable.prototype.destroy = destroyImpl.destroy; -Readable.prototype._undestroy = destroyImpl.undestroy; -Readable.prototype._destroy = function (err, cb) { - cb(err); -}; - -// Manually shove something into the read() buffer. -// This returns true if the highWaterMark has not been hit yet, -// similar to how Writable.write() returns true if you should -// write() some more. -Readable.prototype.push = function (chunk, encoding) { - var state = this._readableState; - var skipChunkCheck; - if (!state.objectMode) { - if (typeof chunk === 'string') { - encoding = encoding || state.defaultEncoding; - if (encoding !== state.encoding) { - chunk = Buffer.from(chunk, encoding); - encoding = ''; - } - skipChunkCheck = true; - } - } else { - skipChunkCheck = true; - } - return readableAddChunk(this, chunk, encoding, false, skipChunkCheck); -}; - -// Unshift should *always* be something directly out of read() -Readable.prototype.unshift = function (chunk) { - return readableAddChunk(this, chunk, null, true, false); -}; -function readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) { - debug('readableAddChunk', chunk); - var state = stream._readableState; - if (chunk === null) { - state.reading = false; - onEofChunk(stream, state); - } else { - var er; - if (!skipChunkCheck) er = chunkInvalid(state, chunk); - if (er) { - errorOrDestroy(stream, er); - } else if (state.objectMode || chunk && chunk.length > 0) { - if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) { - chunk = _uint8ArrayToBuffer(chunk); - } - if (addToFront) { - if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true); - } else if (state.ended) { - errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF()); - } else if (state.destroyed) { - return false; - } else { - state.reading = false; - if (state.decoder && !encoding) { - chunk = state.decoder.write(chunk); - if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state); - } else { - addChunk(stream, state, chunk, false); - } - } - } else if (!addToFront) { - state.reading = false; - maybeReadMore(stream, state); - } - } - - // We can push more data if we are below the highWaterMark. - // Also, if we have no data yet, we can stand some more bytes. - // This is to work around cases where hwm=0, such as the repl. - return !state.ended && (state.length < state.highWaterMark || state.length === 0); -} -function addChunk(stream, state, chunk, addToFront) { - if (state.flowing && state.length === 0 && !state.sync) { - state.awaitDrain = 0; - stream.emit('data', chunk); - } else { - // update the buffer info. - state.length += state.objectMode ? 1 : chunk.length; - if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk); - if (state.needReadable) emitReadable(stream); - } - maybeReadMore(stream, state); -} -function chunkInvalid(state, chunk) { - var er; - if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) { - er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk); - } - return er; -} -Readable.prototype.isPaused = function () { - return this._readableState.flowing === false; -}; - -// backwards compatibility. -Readable.prototype.setEncoding = function (enc) { - if (!StringDecoder) StringDecoder = (__webpack_require__(148)/* .StringDecoder */ .s); - var decoder = new StringDecoder(enc); - this._readableState.decoder = decoder; - // If setEncoding(null), decoder.encoding equals utf8 - this._readableState.encoding = this._readableState.decoder.encoding; - - // Iterate over current buffer to convert already stored Buffers: - var p = this._readableState.buffer.head; - var content = ''; - while (p !== null) { - content += decoder.write(p.data); - p = p.next; - } - this._readableState.buffer.clear(); - if (content !== '') this._readableState.buffer.push(content); - this._readableState.length = content.length; - return this; -}; - -// Don't raise the hwm > 1GB -var MAX_HWM = 0x40000000; -function computeNewHighWaterMark(n) { - if (n >= MAX_HWM) { - // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE. - n = MAX_HWM; - } else { - // Get the next highest power of 2 to prevent increasing hwm excessively in - // tiny amounts - n--; - n |= n >>> 1; - n |= n >>> 2; - n |= n >>> 4; - n |= n >>> 8; - n |= n >>> 16; - n++; - } - return n; -} - -// This function is designed to be inlinable, so please take care when making -// changes to the function body. -function howMuchToRead(n, state) { - if (n <= 0 || state.length === 0 && state.ended) return 0; - if (state.objectMode) return 1; - if (n !== n) { - // Only flow one buffer at a time - if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length; - } - // If we're asking for more than the current hwm, then raise the hwm. - if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n); - if (n <= state.length) return n; - // Don't have enough - if (!state.ended) { - state.needReadable = true; - return 0; - } - return state.length; -} - -// you can override either this method, or the async _read(n) below. -Readable.prototype.read = function (n) { - debug('read', n); - n = parseInt(n, 10); - var state = this._readableState; - var nOrig = n; - if (n !== 0) state.emittedReadable = false; - - // if we're doing read(0) to trigger a readable event, but we - // already have a bunch of data in the buffer, then just trigger - // the 'readable' event and move on. - if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) { - debug('read: emitReadable', state.length, state.ended); - if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this); - return null; - } - n = howMuchToRead(n, state); - - // if we've ended, and we're now clear, then finish it up. - if (n === 0 && state.ended) { - if (state.length === 0) endReadable(this); - return null; - } - - // All the actual chunk generation logic needs to be - // *below* the call to _read. The reason is that in certain - // synthetic stream cases, such as passthrough streams, _read - // may be a completely synchronous operation which may change - // the state of the read buffer, providing enough data when - // before there was *not* enough. - // - // So, the steps are: - // 1. Figure out what the state of things will be after we do - // a read from the buffer. - // - // 2. If that resulting state will trigger a _read, then call _read. - // Note that this may be asynchronous, or synchronous. Yes, it is - // deeply ugly to write APIs this way, but that still doesn't mean - // that the Readable class should behave improperly, as streams are - // designed to be sync/async agnostic. - // Take note if the _read call is sync or async (ie, if the read call - // has returned yet), so that we know whether or not it's safe to emit - // 'readable' etc. - // - // 3. Actually pull the requested chunks out of the buffer and return. - - // if we need a readable event, then we need to do some reading. - var doRead = state.needReadable; - debug('need readable', doRead); - - // if we currently have less than the highWaterMark, then also read some - if (state.length === 0 || state.length - n < state.highWaterMark) { - doRead = true; - debug('length less than watermark', doRead); - } - - // however, if we've ended, then there's no point, and if we're already - // reading, then it's unnecessary. - if (state.ended || state.reading) { - doRead = false; - debug('reading or ended', doRead); - } else if (doRead) { - debug('do read'); - state.reading = true; - state.sync = true; - // if the length is currently zero, then we *need* a readable event. - if (state.length === 0) state.needReadable = true; - // call internal read method - this._read(state.highWaterMark); - state.sync = false; - // If _read pushed data synchronously, then `reading` will be false, - // and we need to re-evaluate how much data we can return to the user. - if (!state.reading) n = howMuchToRead(nOrig, state); - } - var ret; - if (n > 0) ret = fromList(n, state);else ret = null; - if (ret === null) { - state.needReadable = state.length <= state.highWaterMark; - n = 0; - } else { - state.length -= n; - state.awaitDrain = 0; - } - if (state.length === 0) { - // If we have nothing in the buffer, then we want to know - // as soon as we *do* get something into the buffer. - if (!state.ended) state.needReadable = true; - - // If we tried to read() past the EOF, then emit end on the next tick. - if (nOrig !== n && state.ended) endReadable(this); - } - if (ret !== null) this.emit('data', ret); - return ret; -}; -function onEofChunk(stream, state) { - debug('onEofChunk'); - if (state.ended) return; - if (state.decoder) { - var chunk = state.decoder.end(); - if (chunk && chunk.length) { - state.buffer.push(chunk); - state.length += state.objectMode ? 1 : chunk.length; - } - } - state.ended = true; - if (state.sync) { - // if we are sync, wait until next tick to emit the data. - // Otherwise we risk emitting data in the flow() - // the readable code triggers during a read() call - emitReadable(stream); - } else { - // emit 'readable' now to make sure it gets picked up. - state.needReadable = false; - if (!state.emittedReadable) { - state.emittedReadable = true; - emitReadable_(stream); - } - } -} - -// Don't emit readable right away in sync mode, because this can trigger -// another read() call => stack overflow. This way, it might trigger -// a nextTick recursion warning, but that's not so bad. -function emitReadable(stream) { - var state = stream._readableState; - debug('emitReadable', state.needReadable, state.emittedReadable); - state.needReadable = false; - if (!state.emittedReadable) { - debug('emitReadable', state.flowing); - state.emittedReadable = true; - process.nextTick(emitReadable_, stream); - } -} -function emitReadable_(stream) { - var state = stream._readableState; - debug('emitReadable_', state.destroyed, state.length, state.ended); - if (!state.destroyed && (state.length || state.ended)) { - stream.emit('readable'); - state.emittedReadable = false; - } - - // The stream needs another readable event if - // 1. It is not flowing, as the flow mechanism will take - // care of it. - // 2. It is not ended. - // 3. It is below the highWaterMark, so we can schedule - // another readable later. - state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark; - flow(stream); -} - -// at this point, the user has presumably seen the 'readable' event, -// and called read() to consume some data. that may have triggered -// in turn another _read(n) call, in which case reading = true if -// it's in progress. -// However, if we're not ended, or reading, and the length < hwm, -// then go ahead and try to read some more preemptively. -function maybeReadMore(stream, state) { - if (!state.readingMore) { - state.readingMore = true; - process.nextTick(maybeReadMore_, stream, state); - } -} -function maybeReadMore_(stream, state) { - // Attempt to read more data if we should. - // - // The conditions for reading more data are (one of): - // - Not enough data buffered (state.length < state.highWaterMark). The loop - // is responsible for filling the buffer with enough data if such data - // is available. If highWaterMark is 0 and we are not in the flowing mode - // we should _not_ attempt to buffer any extra data. We'll get more data - // when the stream consumer calls read() instead. - // - No data in the buffer, and the stream is in flowing mode. In this mode - // the loop below is responsible for ensuring read() is called. Failing to - // call read here would abort the flow and there's no other mechanism for - // continuing the flow if the stream consumer has just subscribed to the - // 'data' event. - // - // In addition to the above conditions to keep reading data, the following - // conditions prevent the data from being read: - // - The stream has ended (state.ended). - // - There is already a pending 'read' operation (state.reading). This is a - // case where the the stream has called the implementation defined _read() - // method, but they are processing the call asynchronously and have _not_ - // called push() with new data. In this case we skip performing more - // read()s. The execution ends in this method again after the _read() ends - // up calling push() with more data. - while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) { - var len = state.length; - debug('maybeReadMore read 0'); - stream.read(0); - if (len === state.length) - // didn't get any data, stop spinning. - break; - } - state.readingMore = false; -} - -// abstract method. to be overridden in specific implementation classes. -// call cb(er, data) where data is <= n in length. -// for virtual (non-string, non-buffer) streams, "length" is somewhat -// arbitrary, and perhaps not very meaningful. -Readable.prototype._read = function (n) { - errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()')); -}; -Readable.prototype.pipe = function (dest, pipeOpts) { - var src = this; - var state = this._readableState; - switch (state.pipesCount) { - case 0: - state.pipes = dest; - break; - case 1: - state.pipes = [state.pipes, dest]; - break; - default: - state.pipes.push(dest); - break; - } - state.pipesCount += 1; - debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); - var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr; - var endFn = doEnd ? onend : unpipe; - if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn); - dest.on('unpipe', onunpipe); - function onunpipe(readable, unpipeInfo) { - debug('onunpipe'); - if (readable === src) { - if (unpipeInfo && unpipeInfo.hasUnpiped === false) { - unpipeInfo.hasUnpiped = true; - cleanup(); - } - } - } - function onend() { - debug('onend'); - dest.end(); - } - - // when the dest drains, it reduces the awaitDrain counter - // on the source. This would be more elegant with a .once() - // handler in flow(), but adding and removing repeatedly is - // too slow. - var ondrain = pipeOnDrain(src); - dest.on('drain', ondrain); - var cleanedUp = false; - function cleanup() { - debug('cleanup'); - // cleanup event handlers once the pipe is broken - dest.removeListener('close', onclose); - dest.removeListener('finish', onfinish); - dest.removeListener('drain', ondrain); - dest.removeListener('error', onerror); - dest.removeListener('unpipe', onunpipe); - src.removeListener('end', onend); - src.removeListener('end', unpipe); - src.removeListener('data', ondata); - cleanedUp = true; - - // if the reader is waiting for a drain event from this - // specific writer, then it would cause it to never start - // flowing again. - // So, if this is awaiting a drain, then we just call it now. - // If we don't know, then assume that we are waiting for one. - if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain(); - } - src.on('data', ondata); - function ondata(chunk) { - debug('ondata'); - var ret = dest.write(chunk); - debug('dest.write', ret); - if (ret === false) { - // If the user unpiped during `dest.write()`, it is possible - // to get stuck in a permanently paused state if that write - // also returned false. - // => Check whether `dest` is still a piping destination. - if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) { - debug('false write response, pause', state.awaitDrain); - state.awaitDrain++; - } - src.pause(); - } - } - - // if the dest has an error, then stop piping into it. - // however, don't suppress the throwing behavior for this. - function onerror(er) { - debug('onerror', er); - unpipe(); - dest.removeListener('error', onerror); - if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er); - } - - // Make sure our error handler is attached before userland ones. - prependListener(dest, 'error', onerror); - - // Both close and finish should trigger unpipe, but only once. - function onclose() { - dest.removeListener('finish', onfinish); - unpipe(); - } - dest.once('close', onclose); - function onfinish() { - debug('onfinish'); - dest.removeListener('close', onclose); - unpipe(); - } - dest.once('finish', onfinish); - function unpipe() { - debug('unpipe'); - src.unpipe(dest); - } - - // tell the dest that it's being piped to - dest.emit('pipe', src); - - // start the flow if it hasn't been started already. - if (!state.flowing) { - debug('pipe resume'); - src.resume(); - } - return dest; -}; -function pipeOnDrain(src) { - return function pipeOnDrainFunctionResult() { - var state = src._readableState; - debug('pipeOnDrain', state.awaitDrain); - if (state.awaitDrain) state.awaitDrain--; - if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) { - state.flowing = true; - flow(src); - } - }; -} -Readable.prototype.unpipe = function (dest) { - var state = this._readableState; - var unpipeInfo = { - hasUnpiped: false - }; - - // if we're not piping anywhere, then do nothing. - if (state.pipesCount === 0) return this; - - // just one destination. most common case. - if (state.pipesCount === 1) { - // passed in one, but it's not the right one. - if (dest && dest !== state.pipes) return this; - if (!dest) dest = state.pipes; - - // got a match. - state.pipes = null; - state.pipesCount = 0; - state.flowing = false; - if (dest) dest.emit('unpipe', this, unpipeInfo); - return this; - } - - // slow case. multiple pipe destinations. - - if (!dest) { - // remove all. - var dests = state.pipes; - var len = state.pipesCount; - state.pipes = null; - state.pipesCount = 0; - state.flowing = false; - for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, { - hasUnpiped: false - }); - return this; - } - - // try to find the right one. - var index = indexOf(state.pipes, dest); - if (index === -1) return this; - state.pipes.splice(index, 1); - state.pipesCount -= 1; - if (state.pipesCount === 1) state.pipes = state.pipes[0]; - dest.emit('unpipe', this, unpipeInfo); - return this; -}; - -// set up data events if they are asked for -// Ensure readable listeners eventually get something -Readable.prototype.on = function (ev, fn) { - var res = Stream.prototype.on.call(this, ev, fn); - var state = this._readableState; - if (ev === 'data') { - // update readableListening so that resume() may be a no-op - // a few lines down. This is needed to support once('readable'). - state.readableListening = this.listenerCount('readable') > 0; - - // Try start flowing on next tick if stream isn't explicitly paused - if (state.flowing !== false) this.resume(); - } else if (ev === 'readable') { - if (!state.endEmitted && !state.readableListening) { - state.readableListening = state.needReadable = true; - state.flowing = false; - state.emittedReadable = false; - debug('on readable', state.length, state.reading); - if (state.length) { - emitReadable(this); - } else if (!state.reading) { - process.nextTick(nReadingNextTick, this); - } - } - } - return res; -}; -Readable.prototype.addListener = Readable.prototype.on; -Readable.prototype.removeListener = function (ev, fn) { - var res = Stream.prototype.removeListener.call(this, ev, fn); - if (ev === 'readable') { - // We need to check if there is someone still listening to - // readable and reset the state. However this needs to happen - // after readable has been emitted but before I/O (nextTick) to - // support once('readable', fn) cycles. This means that calling - // resume within the same tick will have no - // effect. - process.nextTick(updateReadableListening, this); - } - return res; -}; -Readable.prototype.removeAllListeners = function (ev) { - var res = Stream.prototype.removeAllListeners.apply(this, arguments); - if (ev === 'readable' || ev === undefined) { - // We need to check if there is someone still listening to - // readable and reset the state. However this needs to happen - // after readable has been emitted but before I/O (nextTick) to - // support once('readable', fn) cycles. This means that calling - // resume within the same tick will have no - // effect. - process.nextTick(updateReadableListening, this); - } - return res; -}; -function updateReadableListening(self) { - var state = self._readableState; - state.readableListening = self.listenerCount('readable') > 0; - if (state.resumeScheduled && !state.paused) { - // flowing needs to be set to true now, otherwise - // the upcoming resume will not flow. - state.flowing = true; - - // crude way to check if we should resume - } else if (self.listenerCount('data') > 0) { - self.resume(); - } -} -function nReadingNextTick(self) { - debug('readable nexttick read 0'); - self.read(0); -} - -// pause() and resume() are remnants of the legacy readable stream API -// If the user uses them, then switch into old mode. -Readable.prototype.resume = function () { - var state = this._readableState; - if (!state.flowing) { - debug('resume'); - // we flow only if there is no one listening - // for readable, but we still have to call - // resume() - state.flowing = !state.readableListening; - resume(this, state); - } - state.paused = false; - return this; -}; -function resume(stream, state) { - if (!state.resumeScheduled) { - state.resumeScheduled = true; - process.nextTick(resume_, stream, state); - } -} -function resume_(stream, state) { - debug('resume', state.reading); - if (!state.reading) { - stream.read(0); - } - state.resumeScheduled = false; - stream.emit('resume'); - flow(stream); - if (state.flowing && !state.reading) stream.read(0); -} -Readable.prototype.pause = function () { - debug('call pause flowing=%j', this._readableState.flowing); - if (this._readableState.flowing !== false) { - debug('pause'); - this._readableState.flowing = false; - this.emit('pause'); - } - this._readableState.paused = true; - return this; -}; -function flow(stream) { - var state = stream._readableState; - debug('flow', state.flowing); - while (state.flowing && stream.read() !== null); -} - -// wrap an old-style stream as the async data source. -// This is *not* part of the readable stream interface. -// It is an ugly unfortunate mess of history. -Readable.prototype.wrap = function (stream) { - var _this = this; - var state = this._readableState; - var paused = false; - stream.on('end', function () { - debug('wrapped end'); - if (state.decoder && !state.ended) { - var chunk = state.decoder.end(); - if (chunk && chunk.length) _this.push(chunk); - } - _this.push(null); - }); - stream.on('data', function (chunk) { - debug('wrapped data'); - if (state.decoder) chunk = state.decoder.write(chunk); - - // don't skip over falsy values in objectMode - if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return; - var ret = _this.push(chunk); - if (!ret) { - paused = true; - stream.pause(); - } - }); - - // proxy all the other methods. - // important when wrapping filters and duplexes. - for (var i in stream) { - if (this[i] === undefined && typeof stream[i] === 'function') { - this[i] = function methodWrap(method) { - return function methodWrapReturnFunction() { - return stream[method].apply(stream, arguments); - }; - }(i); - } - } - - // proxy certain important events. - for (var n = 0; n < kProxyEvents.length; n++) { - stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n])); - } - - // when we try to consume some more bytes, simply unpause the - // underlying stream. - this._read = function (n) { - debug('wrapped _read', n); - if (paused) { - paused = false; - stream.resume(); - } - }; - return this; -}; -if (typeof Symbol === 'function') { - Readable.prototype[Symbol.asyncIterator] = function () { - if (createReadableStreamAsyncIterator === undefined) { - createReadableStreamAsyncIterator = __webpack_require__(133); - } - return createReadableStreamAsyncIterator(this); - }; -} -Object.defineProperty(Readable.prototype, 'readableHighWaterMark', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState.highWaterMark; - } -}); -Object.defineProperty(Readable.prototype, 'readableBuffer', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState && this._readableState.buffer; - } -}); -Object.defineProperty(Readable.prototype, 'readableFlowing', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState.flowing; - }, - set: function set(state) { - if (this._readableState) { - this._readableState.flowing = state; - } - } -}); - -// exposed for testing purposes only. -Readable._fromList = fromList; -Object.defineProperty(Readable.prototype, 'readableLength', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState.length; - } -}); - -// Pluck off n bytes from an array of buffers. -// Length is the combined lengths of all the buffers in the list. -// This function is designed to be inlinable, so please take care when making -// changes to the function body. -function fromList(n, state) { - // nothing buffered - if (state.length === 0) return null; - var ret; - if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) { - // read it all, truncate the list - if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length); - state.buffer.clear(); - } else { - // read part of list - ret = state.buffer.consume(n, state.decoder); - } - return ret; -} -function endReadable(stream) { - var state = stream._readableState; - debug('endReadable', state.endEmitted); - if (!state.endEmitted) { - state.ended = true; - process.nextTick(endReadableNT, state, stream); - } -} -function endReadableNT(state, stream) { - debug('endReadableNT', state.endEmitted, state.length); - - // Check that we didn't get one last unshift. - if (!state.endEmitted && state.length === 0) { - state.endEmitted = true; - stream.readable = false; - stream.emit('end'); - if (state.autoDestroy) { - // In case of duplex streams we need a way to detect - // if the writable side is ready for autoDestroy as well - var wState = stream._writableState; - if (!wState || wState.autoDestroy && wState.finished) { - stream.destroy(); - } - } - } -} -if (typeof Symbol === 'function') { - Readable.from = function (iterable, opts) { - if (from === undefined) { - from = __webpack_require__(134); - } - return from(Readable, iterable, opts); - }; -} -function indexOf(xs, x) { - for (var i = 0, l = xs.length; i < l; i++) { - if (xs[i] === x) return i; - } - return -1; -} - -/***/ }), -/* 61 */ -/***/ ((module) => { - -"use strict"; - - -// undocumented cb() API, needed for core, not for public API -function destroy(err, cb) { - var _this = this; - var readableDestroyed = this._readableState && this._readableState.destroyed; - var writableDestroyed = this._writableState && this._writableState.destroyed; - if (readableDestroyed || writableDestroyed) { - if (cb) { - cb(err); - } else if (err) { - if (!this._writableState) { - process.nextTick(emitErrorNT, this, err); - } else if (!this._writableState.errorEmitted) { - this._writableState.errorEmitted = true; - process.nextTick(emitErrorNT, this, err); - } - } - return this; - } - - // we set destroyed to true before firing error callbacks in order - // to make it re-entrance safe in case destroy() is called within callbacks - - if (this._readableState) { - this._readableState.destroyed = true; - } - - // if this is a duplex stream mark the writable part as destroyed as well - if (this._writableState) { - this._writableState.destroyed = true; - } - this._destroy(err || null, function (err) { - if (!cb && err) { - if (!_this._writableState) { - process.nextTick(emitErrorAndCloseNT, _this, err); - } else if (!_this._writableState.errorEmitted) { - _this._writableState.errorEmitted = true; - process.nextTick(emitErrorAndCloseNT, _this, err); - } else { - process.nextTick(emitCloseNT, _this); - } - } else if (cb) { - process.nextTick(emitCloseNT, _this); - cb(err); - } else { - process.nextTick(emitCloseNT, _this); - } - }); - return this; -} -function emitErrorAndCloseNT(self, err) { - emitErrorNT(self, err); - emitCloseNT(self); -} -function emitCloseNT(self) { - if (self._writableState && !self._writableState.emitClose) return; - if (self._readableState && !self._readableState.emitClose) return; - self.emit('close'); -} -function undestroy() { - if (this._readableState) { - this._readableState.destroyed = false; - this._readableState.reading = false; - this._readableState.ended = false; - this._readableState.endEmitted = false; - } - if (this._writableState) { - this._writableState.destroyed = false; - this._writableState.ended = false; - this._writableState.ending = false; - this._writableState.finalCalled = false; - this._writableState.prefinished = false; - this._writableState.finished = false; - this._writableState.errorEmitted = false; - } -} -function emitErrorNT(self, err) { - self.emit('error', err); -} -function errorOrDestroy(stream, err) { - // We have tests that rely on errors being emitted - // in the same tick, so changing this is semver major. - // For now when you opt-in to autoDestroy we allow - // the error to be emitted nextTick. In a future - // semver major update we should change the default to this. - - var rState = stream._readableState; - var wState = stream._writableState; - if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err); -} -module.exports = { - destroy: destroy, - undestroy: undestroy, - errorOrDestroy: errorOrDestroy -}; - -/***/ }), -/* 62 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var ERR_INVALID_OPT_VALUE = (__webpack_require__(15)/* .codes.ERR_INVALID_OPT_VALUE */ .q.ERR_INVALID_OPT_VALUE); -function highWaterMarkFrom(options, isDuplex, duplexKey) { - return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null; -} -function getHighWaterMark(state, options, duplexKey, isDuplex) { - var hwm = highWaterMarkFrom(options, isDuplex, duplexKey); - if (hwm != null) { - if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) { - var name = isDuplex ? duplexKey : 'highWaterMark'; - throw new ERR_INVALID_OPT_VALUE(name, hwm); - } - return Math.floor(hwm); - } - - // Default value - return state.objectMode ? 16 : 16 * 1024; -} -module.exports = { - getHighWaterMark: getHighWaterMark -}; - -/***/ }), -/* 63 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - -// A bit simpler than readable streams. -// Implement an async ._write(chunk, encoding, cb), and it'll handle all -// the drain event emission and buffering. - - - -module.exports = Writable; - -/* */ -function WriteReq(chunk, encoding, cb) { - this.chunk = chunk; - this.encoding = encoding; - this.callback = cb; - this.next = null; -} - -// It seems a linked list but it is not -// there will be only 2 of these for each stream -function CorkedRequest(state) { - var _this = this; - this.next = null; - this.entry = null; - this.finish = function () { - onCorkedFinish(_this, state); - }; -} -/* */ - -/**/ -var Duplex; -/**/ - -Writable.WritableState = WritableState; - -/**/ -var internalUtil = { - deprecate: __webpack_require__(167) -}; -/**/ - -/**/ -var Stream = __webpack_require__(131); -/**/ - -var Buffer = (__webpack_require__(10).Buffer); -var OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {}; -function _uint8ArrayToBuffer(chunk) { - return Buffer.from(chunk); -} -function _isUint8Array(obj) { - return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; -} -var destroyImpl = __webpack_require__(61); -var _require = __webpack_require__(62), - getHighWaterMark = _require.getHighWaterMark; -var _require$codes = (__webpack_require__(15)/* .codes */ .q), - ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, - ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, - ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK, - ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE, - ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED, - ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES, - ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END, - ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING; -var errorOrDestroy = destroyImpl.errorOrDestroy; -__webpack_require__(7)(Writable, Stream); -function nop() {} -function WritableState(options, stream, isDuplex) { - Duplex = Duplex || __webpack_require__(17); - options = options || {}; - - // Duplex streams are both readable and writable, but share - // the same options object. - // However, some cases require setting options to different - // values for the readable and the writable sides of the duplex stream, - // e.g. options.readableObjectMode vs. options.writableObjectMode, etc. - if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; - - // object stream flag to indicate whether or not this stream - // contains buffers or objects. - this.objectMode = !!options.objectMode; - if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; - - // the point at which write() starts returning false - // Note: 0 is a valid value, means that we always return false if - // the entire buffer is not flushed immediately on write() - this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); - - // if _final has been called - this.finalCalled = false; - - // drain event flag. - this.needDrain = false; - // at the start of calling end() - this.ending = false; - // when end() has been called, and returned - this.ended = false; - // when 'finish' is emitted - this.finished = false; - - // has it been destroyed - this.destroyed = false; - - // should we decode strings into buffers before passing to _write? - // this is here so that some node-core streams can optimize string - // handling at a lower level. - var noDecode = options.decodeStrings === false; - this.decodeStrings = !noDecode; - - // Crypto is kind of old and crusty. Historically, its default string - // encoding is 'binary' so we have to make this configurable. - // Everything else in the universe uses 'utf8', though. - this.defaultEncoding = options.defaultEncoding || 'utf8'; - - // not an actual buffer we keep track of, but a measurement - // of how much we're waiting to get pushed to some underlying - // socket or file. - this.length = 0; - - // a flag to see when we're in the middle of a write. - this.writing = false; - - // when true all writes will be buffered until .uncork() call - this.corked = 0; - - // a flag to be able to tell if the onwrite cb is called immediately, - // or on a later tick. We set this to true at first, because any - // actions that shouldn't happen until "later" should generally also - // not happen before the first write call. - this.sync = true; - - // a flag to know if we're processing previously buffered items, which - // may call the _write() callback in the same tick, so that we don't - // end up in an overlapped onwrite situation. - this.bufferProcessing = false; - - // the callback that's passed to _write(chunk,cb) - this.onwrite = function (er) { - onwrite(stream, er); - }; - - // the callback that the user supplies to write(chunk,encoding,cb) - this.writecb = null; - - // the amount that is being written when _write is called. - this.writelen = 0; - this.bufferedRequest = null; - this.lastBufferedRequest = null; - - // number of pending user-supplied write callbacks - // this must be 0 before 'finish' can be emitted - this.pendingcb = 0; - - // emit prefinish if the only thing we're waiting for is _write cbs - // This is relevant for synchronous Transform streams - this.prefinished = false; - - // True if the error was already emitted and should not be thrown again - this.errorEmitted = false; - - // Should close be emitted on destroy. Defaults to true. - this.emitClose = options.emitClose !== false; - - // Should .destroy() be called after 'finish' (and potentially 'end') - this.autoDestroy = !!options.autoDestroy; - - // count buffered requests - this.bufferedRequestCount = 0; - - // allocate the first CorkedRequest, there is always - // one allocated and free to use, and we maintain at most two - this.corkedRequestsFree = new CorkedRequest(this); -} -WritableState.prototype.getBuffer = function getBuffer() { - var current = this.bufferedRequest; - var out = []; - while (current) { - out.push(current); - current = current.next; - } - return out; -}; -(function () { - try { - Object.defineProperty(WritableState.prototype, 'buffer', { - get: internalUtil.deprecate(function writableStateBufferGetter() { - return this.getBuffer(); - }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003') - }); - } catch (_) {} -})(); - -// Test _writableState for inheritance to account for Duplex streams, -// whose prototype chain only points to Readable. -var realHasInstance; -if (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') { - realHasInstance = Function.prototype[Symbol.hasInstance]; - Object.defineProperty(Writable, Symbol.hasInstance, { - value: function value(object) { - if (realHasInstance.call(this, object)) return true; - if (this !== Writable) return false; - return object && object._writableState instanceof WritableState; - } - }); -} else { - realHasInstance = function realHasInstance(object) { - return object instanceof this; - }; -} -function Writable(options) { - Duplex = Duplex || __webpack_require__(17); - - // Writable ctor is applied to Duplexes, too. - // `realHasInstance` is necessary because using plain `instanceof` - // would return false, as no `_writableState` property is attached. - - // Trying to use the custom `instanceof` for Writable here will also break the - // Node.js LazyTransform implementation, which has a non-trivial getter for - // `_writableState` that would lead to infinite recursion. - - // Checking for a Stream.Duplex instance is faster here instead of inside - // the WritableState constructor, at least with V8 6.5 - var isDuplex = this instanceof Duplex; - if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options); - this._writableState = new WritableState(options, this, isDuplex); - - // legacy. - this.writable = true; - if (options) { - if (typeof options.write === 'function') this._write = options.write; - if (typeof options.writev === 'function') this._writev = options.writev; - if (typeof options.destroy === 'function') this._destroy = options.destroy; - if (typeof options.final === 'function') this._final = options.final; - } - Stream.call(this); -} - -// Otherwise people can pipe Writable streams, which is just wrong. -Writable.prototype.pipe = function () { - errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE()); -}; -function writeAfterEnd(stream, cb) { - var er = new ERR_STREAM_WRITE_AFTER_END(); - // TODO: defer error events consistently everywhere, not just the cb - errorOrDestroy(stream, er); - process.nextTick(cb, er); -} - -// Checks that a user-supplied chunk is valid, especially for the particular -// mode the stream is in. Currently this means that `null` is never accepted -// and undefined/non-string values are only allowed in object mode. -function validChunk(stream, state, chunk, cb) { - var er; - if (chunk === null) { - er = new ERR_STREAM_NULL_VALUES(); - } else if (typeof chunk !== 'string' && !state.objectMode) { - er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk); - } - if (er) { - errorOrDestroy(stream, er); - process.nextTick(cb, er); - return false; - } - return true; -} -Writable.prototype.write = function (chunk, encoding, cb) { - var state = this._writableState; - var ret = false; - var isBuf = !state.objectMode && _isUint8Array(chunk); - if (isBuf && !Buffer.isBuffer(chunk)) { - chunk = _uint8ArrayToBuffer(chunk); - } - if (typeof encoding === 'function') { - cb = encoding; - encoding = null; - } - if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding; - if (typeof cb !== 'function') cb = nop; - if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) { - state.pendingcb++; - ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb); - } - return ret; -}; -Writable.prototype.cork = function () { - this._writableState.corked++; -}; -Writable.prototype.uncork = function () { - var state = this._writableState; - if (state.corked) { - state.corked--; - if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state); - } -}; -Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) { - // node::ParseEncoding() requires lower case. - if (typeof encoding === 'string') encoding = encoding.toLowerCase(); - if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding); - this._writableState.defaultEncoding = encoding; - return this; -}; -Object.defineProperty(Writable.prototype, 'writableBuffer', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState && this._writableState.getBuffer(); - } -}); -function decodeChunk(state, chunk, encoding) { - if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') { - chunk = Buffer.from(chunk, encoding); - } - return chunk; -} -Object.defineProperty(Writable.prototype, 'writableHighWaterMark', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.highWaterMark; - } -}); - -// if we're already writing something, then just put this -// in the queue, and wait our turn. Otherwise, call _write -// If we return false, then we need a drain event, so set that flag. -function writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) { - if (!isBuf) { - var newChunk = decodeChunk(state, chunk, encoding); - if (chunk !== newChunk) { - isBuf = true; - encoding = 'buffer'; - chunk = newChunk; - } - } - var len = state.objectMode ? 1 : chunk.length; - state.length += len; - var ret = state.length < state.highWaterMark; - // we must ensure that previous needDrain will not be reset to false. - if (!ret) state.needDrain = true; - if (state.writing || state.corked) { - var last = state.lastBufferedRequest; - state.lastBufferedRequest = { - chunk: chunk, - encoding: encoding, - isBuf: isBuf, - callback: cb, - next: null - }; - if (last) { - last.next = state.lastBufferedRequest; - } else { - state.bufferedRequest = state.lastBufferedRequest; - } - state.bufferedRequestCount += 1; - } else { - doWrite(stream, state, false, len, chunk, encoding, cb); - } - return ret; -} -function doWrite(stream, state, writev, len, chunk, encoding, cb) { - state.writelen = len; - state.writecb = cb; - state.writing = true; - state.sync = true; - if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite); - state.sync = false; -} -function onwriteError(stream, state, sync, er, cb) { - --state.pendingcb; - if (sync) { - // defer the callback if we are being called synchronously - // to avoid piling up things on the stack - process.nextTick(cb, er); - // this can emit finish, and it will always happen - // after error - process.nextTick(finishMaybe, stream, state); - stream._writableState.errorEmitted = true; - errorOrDestroy(stream, er); - } else { - // the caller expect this to happen before if - // it is async - cb(er); - stream._writableState.errorEmitted = true; - errorOrDestroy(stream, er); - // this can emit finish, but finish must - // always follow error - finishMaybe(stream, state); - } -} -function onwriteStateUpdate(state) { - state.writing = false; - state.writecb = null; - state.length -= state.writelen; - state.writelen = 0; -} -function onwrite(stream, er) { - var state = stream._writableState; - var sync = state.sync; - var cb = state.writecb; - if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK(); - onwriteStateUpdate(state); - if (er) onwriteError(stream, state, sync, er, cb);else { - // Check if we're actually ready to finish, but don't emit yet - var finished = needFinish(state) || stream.destroyed; - if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) { - clearBuffer(stream, state); - } - if (sync) { - process.nextTick(afterWrite, stream, state, finished, cb); - } else { - afterWrite(stream, state, finished, cb); - } - } -} -function afterWrite(stream, state, finished, cb) { - if (!finished) onwriteDrain(stream, state); - state.pendingcb--; - cb(); - finishMaybe(stream, state); -} - -// Must force callback to be called on nextTick, so that we don't -// emit 'drain' before the write() consumer gets the 'false' return -// value, and has a chance to attach a 'drain' listener. -function onwriteDrain(stream, state) { - if (state.length === 0 && state.needDrain) { - state.needDrain = false; - stream.emit('drain'); - } -} - -// if there's something in the buffer waiting, then process it -function clearBuffer(stream, state) { - state.bufferProcessing = true; - var entry = state.bufferedRequest; - if (stream._writev && entry && entry.next) { - // Fast case, write everything using _writev() - var l = state.bufferedRequestCount; - var buffer = new Array(l); - var holder = state.corkedRequestsFree; - holder.entry = entry; - var count = 0; - var allBuffers = true; - while (entry) { - buffer[count] = entry; - if (!entry.isBuf) allBuffers = false; - entry = entry.next; - count += 1; - } - buffer.allBuffers = allBuffers; - doWrite(stream, state, true, state.length, buffer, '', holder.finish); - - // doWrite is almost always async, defer these to save a bit of time - // as the hot path ends with doWrite - state.pendingcb++; - state.lastBufferedRequest = null; - if (holder.next) { - state.corkedRequestsFree = holder.next; - holder.next = null; - } else { - state.corkedRequestsFree = new CorkedRequest(state); - } - state.bufferedRequestCount = 0; - } else { - // Slow case, write chunks one-by-one - while (entry) { - var chunk = entry.chunk; - var encoding = entry.encoding; - var cb = entry.callback; - var len = state.objectMode ? 1 : chunk.length; - doWrite(stream, state, false, len, chunk, encoding, cb); - entry = entry.next; - state.bufferedRequestCount--; - // if we didn't call the onwrite immediately, then - // it means that we need to wait until it does. - // also, that means that the chunk and cb are currently - // being processed, so move the buffer counter past them. - if (state.writing) { - break; - } - } - if (entry === null) state.lastBufferedRequest = null; - } - state.bufferedRequest = entry; - state.bufferProcessing = false; -} -Writable.prototype._write = function (chunk, encoding, cb) { - cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()')); -}; -Writable.prototype._writev = null; -Writable.prototype.end = function (chunk, encoding, cb) { - var state = this._writableState; - if (typeof chunk === 'function') { - cb = chunk; - chunk = null; - encoding = null; - } else if (typeof encoding === 'function') { - cb = encoding; - encoding = null; - } - if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); - - // .end() fully uncorks - if (state.corked) { - state.corked = 1; - this.uncork(); - } - - // ignore unnecessary end() calls. - if (!state.ending) endWritable(this, state, cb); - return this; -}; -Object.defineProperty(Writable.prototype, 'writableLength', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.length; - } -}); -function needFinish(state) { - return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing; -} -function callFinal(stream, state) { - stream._final(function (err) { - state.pendingcb--; - if (err) { - errorOrDestroy(stream, err); - } - state.prefinished = true; - stream.emit('prefinish'); - finishMaybe(stream, state); - }); -} -function prefinish(stream, state) { - if (!state.prefinished && !state.finalCalled) { - if (typeof stream._final === 'function' && !state.destroyed) { - state.pendingcb++; - state.finalCalled = true; - process.nextTick(callFinal, stream, state); - } else { - state.prefinished = true; - stream.emit('prefinish'); - } - } -} -function finishMaybe(stream, state) { - var need = needFinish(state); - if (need) { - prefinish(stream, state); - if (state.pendingcb === 0) { - state.finished = true; - stream.emit('finish'); - if (state.autoDestroy) { - // In case of duplex streams we need a way to detect - // if the readable side is ready for autoDestroy as well - var rState = stream._readableState; - if (!rState || rState.autoDestroy && rState.endEmitted) { - stream.destroy(); - } - } - } - } - return need; -} -function endWritable(stream, state, cb) { - state.ending = true; - finishMaybe(stream, state); - if (cb) { - if (state.finished) process.nextTick(cb);else stream.once('finish', cb); - } - state.ended = true; - stream.writable = false; -} -function onCorkedFinish(corkReq, state, err) { - var entry = corkReq.entry; - corkReq.entry = null; - while (entry) { - var cb = entry.callback; - state.pendingcb--; - cb(err); - entry = entry.next; - } - - // reuse the free corkReq. - state.corkedRequestsFree.next = corkReq; -} -Object.defineProperty(Writable.prototype, 'destroyed', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - if (this._writableState === undefined) { - return false; - } - return this._writableState.destroyed; - }, - set: function set(value) { - // we ignore the value if the stream - // has not been initialized yet - if (!this._writableState) { - return; - } - - // backward compatibility, the user is explicitly - // managing destroyed - this._writableState.destroyed = value; - } -}); -Writable.prototype.destroy = destroyImpl.destroy; -Writable.prototype._undestroy = destroyImpl.undestroy; -Writable.prototype._destroy = function (err, cb) { - cb(err); -}; - -/***/ }), -/* 64 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - -// a transform stream is a readable/writable stream where you do -// something with the data. Sometimes it's called a "filter", -// but that's not a great name for it, since that implies a thing where -// some bits pass through, and others are simply ignored. (That would -// be a valid example of a transform, of course.) -// -// While the output is causally related to the input, it's not a -// necessarily symmetric or synchronous transformation. For example, -// a zlib stream might take multiple plain-text writes(), and then -// emit a single compressed chunk some time in the future. -// -// Here's how this works: -// -// The Transform stream has all the aspects of the readable and writable -// stream classes. When you write(chunk), that calls _write(chunk,cb) -// internally, and returns false if there's a lot of pending writes -// buffered up. When you call read(), that calls _read(n) until -// there's enough pending readable data buffered up. -// -// In a transform stream, the written data is placed in a buffer. When -// _read(n) is called, it transforms the queued up data, calling the -// buffered _write cb's as it consumes chunks. If consuming a single -// written chunk would result in multiple output chunks, then the first -// outputted bit calls the readcb, and subsequent chunks just go into -// the read buffer, and will cause it to emit 'readable' if necessary. -// -// This way, back-pressure is actually determined by the reading side, -// since _read has to be called to start processing a new chunk. However, -// a pathological inflate type of transform can cause excessive buffering -// here. For example, imagine a stream where every byte of input is -// interpreted as an integer from 0-255, and then results in that many -// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in -// 1kb of data being output. In this case, you could write a very small -// amount of input, and end up with a very large amount of output. In -// such a pathological inflating mechanism, there'd be no way to tell -// the system to stop doing the transform. A single 4MB write could -// cause the system to run out of memory. -// -// However, even in such a pathological case, only a single written chunk -// would be consumed, and then the rest would wait (un-transformed) until -// the results of the previous transformed chunk were consumed. - - - -module.exports = Transform; -var _require$codes = (__webpack_require__(15)/* .codes */ .q), - ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, - ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK, - ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING, - ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0; -var Duplex = __webpack_require__(17); -__webpack_require__(7)(Transform, Duplex); -function afterTransform(er, data) { - var ts = this._transformState; - ts.transforming = false; - var cb = ts.writecb; - if (cb === null) { - return this.emit('error', new ERR_MULTIPLE_CALLBACK()); - } - ts.writechunk = null; - ts.writecb = null; - if (data != null) - // single equals check for both `null` and `undefined` - this.push(data); - cb(er); - var rs = this._readableState; - rs.reading = false; - if (rs.needReadable || rs.length < rs.highWaterMark) { - this._read(rs.highWaterMark); - } -} -function Transform(options) { - if (!(this instanceof Transform)) return new Transform(options); - Duplex.call(this, options); - this._transformState = { - afterTransform: afterTransform.bind(this), - needTransform: false, - transforming: false, - writecb: null, - writechunk: null, - writeencoding: null - }; - - // start out asking for a readable event once data is transformed. - this._readableState.needReadable = true; - - // we have implemented the _read method, and done the other things - // that Readable wants before the first _read call, so unset the - // sync guard flag. - this._readableState.sync = false; - if (options) { - if (typeof options.transform === 'function') this._transform = options.transform; - if (typeof options.flush === 'function') this._flush = options.flush; - } - - // When the writable side finishes, then flush out anything remaining. - this.on('prefinish', prefinish); -} -function prefinish() { - var _this = this; - if (typeof this._flush === 'function' && !this._readableState.destroyed) { - this._flush(function (er, data) { - done(_this, er, data); - }); - } else { - done(this, null, null); - } -} -Transform.prototype.push = function (chunk, encoding) { - this._transformState.needTransform = false; - return Duplex.prototype.push.call(this, chunk, encoding); -}; - -// This is the part where you do stuff! -// override this function in implementation classes. -// 'chunk' is an input chunk. -// -// Call `push(newChunk)` to pass along transformed output -// to the readable side. You may call 'push' zero or more times. -// -// Call `cb(err)` when you are done with this chunk. If you pass -// an error, then that'll put the hurt on the whole operation. If you -// never call cb(), then you'll never get another chunk. -Transform.prototype._transform = function (chunk, encoding, cb) { - cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()')); -}; -Transform.prototype._write = function (chunk, encoding, cb) { - var ts = this._transformState; - ts.writecb = cb; - ts.writechunk = chunk; - ts.writeencoding = encoding; - if (!ts.transforming) { - var rs = this._readableState; - if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark); - } -}; - -// Doesn't matter what the args are here. -// _transform does all the work. -// That we got here means that the readable side wants more data. -Transform.prototype._read = function (n) { - var ts = this._transformState; - if (ts.writechunk !== null && !ts.transforming) { - ts.transforming = true; - this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform); - } else { - // mark that we need a transform, so that any data that comes in - // will get processed, now that we've asked for it. - ts.needTransform = true; - } -}; -Transform.prototype._destroy = function (err, cb) { - Duplex.prototype._destroy.call(this, err, function (err2) { - cb(err2); - }); -}; -function done(stream, er, data) { - if (er) return stream.emit('error', er); - if (data != null) - // single equals check for both `null` and `undefined` - stream.push(data); - - // TODO(BridgeAR): Write a test for these two error cases - // if there's nothing in the write buffer, then that means - // that nothing more will ever be provided - if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0(); - if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING(); - return stream.push(null); -} - -/***/ }), -/* 65 */ -/***/ ((module, exports, __webpack_require__) => { - -"use strict"; - -var $protobuf = __webpack_require__(150); -module.exports = exports = $protobuf.descriptor = $protobuf.Root.fromJSON(__webpack_require__(152)).lookup(".google.protobuf"); - -var Namespace = $protobuf.Namespace, - Root = $protobuf.Root, - Enum = $protobuf.Enum, - Type = $protobuf.Type, - Field = $protobuf.Field, - MapField = $protobuf.MapField, - OneOf = $protobuf.OneOf, - Service = $protobuf.Service, - Method = $protobuf.Method; - -// --- Root --- - -/** - * Properties of a FileDescriptorSet message. - * @interface IFileDescriptorSet - * @property {IFileDescriptorProto[]} file Files - */ - -/** - * Properties of a FileDescriptorProto message. - * @interface IFileDescriptorProto - * @property {string} [name] File name - * @property {string} [package] Package - * @property {*} [dependency] Not supported - * @property {*} [publicDependency] Not supported - * @property {*} [weakDependency] Not supported - * @property {IDescriptorProto[]} [messageType] Nested message types - * @property {IEnumDescriptorProto[]} [enumType] Nested enums - * @property {IServiceDescriptorProto[]} [service] Nested services - * @property {IFieldDescriptorProto[]} [extension] Nested extension fields - * @property {IFileOptions} [options] Options - * @property {*} [sourceCodeInfo] Not supported - * @property {string} [syntax="proto2"] Syntax - */ - -/** - * Properties of a FileOptions message. - * @interface IFileOptions - * @property {string} [javaPackage] - * @property {string} [javaOuterClassname] - * @property {boolean} [javaMultipleFiles] - * @property {boolean} [javaGenerateEqualsAndHash] - * @property {boolean} [javaStringCheckUtf8] - * @property {IFileOptionsOptimizeMode} [optimizeFor=1] - * @property {string} [goPackage] - * @property {boolean} [ccGenericServices] - * @property {boolean} [javaGenericServices] - * @property {boolean} [pyGenericServices] - * @property {boolean} [deprecated] - * @property {boolean} [ccEnableArenas] - * @property {string} [objcClassPrefix] - * @property {string} [csharpNamespace] - */ - -/** - * Values of he FileOptions.OptimizeMode enum. - * @typedef IFileOptionsOptimizeMode - * @type {number} - * @property {number} SPEED=1 - * @property {number} CODE_SIZE=2 - * @property {number} LITE_RUNTIME=3 - */ - -/** - * Creates a root from a descriptor set. - * @param {IFileDescriptorSet|Reader|Uint8Array} descriptor Descriptor - * @returns {Root} Root instance - */ -Root.fromDescriptor = function fromDescriptor(descriptor) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.FileDescriptorSet.decode(descriptor); - - var root = new Root(); - - if (descriptor.file) { - var fileDescriptor, - filePackage; - for (var j = 0, i; j < descriptor.file.length; ++j) { - filePackage = root; - if ((fileDescriptor = descriptor.file[j])["package"] && fileDescriptor["package"].length) - filePackage = root.define(fileDescriptor["package"]); - if (fileDescriptor.name && fileDescriptor.name.length) - root.files.push(filePackage.filename = fileDescriptor.name); - if (fileDescriptor.messageType) - for (i = 0; i < fileDescriptor.messageType.length; ++i) - filePackage.add(Type.fromDescriptor(fileDescriptor.messageType[i], fileDescriptor.syntax)); - if (fileDescriptor.enumType) - for (i = 0; i < fileDescriptor.enumType.length; ++i) - filePackage.add(Enum.fromDescriptor(fileDescriptor.enumType[i])); - if (fileDescriptor.extension) - for (i = 0; i < fileDescriptor.extension.length; ++i) - filePackage.add(Field.fromDescriptor(fileDescriptor.extension[i])); - if (fileDescriptor.service) - for (i = 0; i < fileDescriptor.service.length; ++i) - filePackage.add(Service.fromDescriptor(fileDescriptor.service[i])); - var opts = fromDescriptorOptions(fileDescriptor.options, exports.FileOptions); - if (opts) { - var ks = Object.keys(opts); - for (i = 0; i < ks.length; ++i) - filePackage.setOption(ks[i], opts[ks[i]]); - } - } - } - - return root; -}; - -/** - * Converts a root to a descriptor set. - * @returns {Message} Descriptor - * @param {string} [syntax="proto2"] Syntax - */ -Root.prototype.toDescriptor = function toDescriptor(syntax) { - var set = exports.FileDescriptorSet.create(); - Root_toDescriptorRecursive(this, set.file, syntax); - return set; -}; - -// Traverses a namespace and assembles the descriptor set -function Root_toDescriptorRecursive(ns, files, syntax) { - - // Create a new file - var file = exports.FileDescriptorProto.create({ name: ns.filename || (ns.fullName.substring(1).replace(/\./g, "_") || "root") + ".proto" }); - if (syntax) - file.syntax = syntax; - if (!(ns instanceof Root)) - file["package"] = ns.fullName.substring(1); - - // Add nested types - for (var i = 0, nested; i < ns.nestedArray.length; ++i) - if ((nested = ns._nestedArray[i]) instanceof Type) - file.messageType.push(nested.toDescriptor(syntax)); - else if (nested instanceof Enum) - file.enumType.push(nested.toDescriptor()); - else if (nested instanceof Field) - file.extension.push(nested.toDescriptor(syntax)); - else if (nested instanceof Service) - file.service.push(nested.toDescriptor()); - else if (nested instanceof /* plain */ Namespace) - Root_toDescriptorRecursive(nested, files, syntax); // requires new file - - // Keep package-level options - file.options = toDescriptorOptions(ns.options, exports.FileOptions); - - // And keep the file only if there is at least one nested object - if (file.messageType.length + file.enumType.length + file.extension.length + file.service.length) - files.push(file); -} - -// --- Type --- - -/** - * Properties of a DescriptorProto message. - * @interface IDescriptorProto - * @property {string} [name] Message type name - * @property {IFieldDescriptorProto[]} [field] Fields - * @property {IFieldDescriptorProto[]} [extension] Extension fields - * @property {IDescriptorProto[]} [nestedType] Nested message types - * @property {IEnumDescriptorProto[]} [enumType] Nested enums - * @property {IDescriptorProtoExtensionRange[]} [extensionRange] Extension ranges - * @property {IOneofDescriptorProto[]} [oneofDecl] Oneofs - * @property {IMessageOptions} [options] Not supported - * @property {IDescriptorProtoReservedRange[]} [reservedRange] Reserved ranges - * @property {string[]} [reservedName] Reserved names - */ - -/** - * Properties of a MessageOptions message. - * @interface IMessageOptions - * @property {boolean} [mapEntry=false] Whether this message is a map entry - */ - -/** - * Properties of an ExtensionRange message. - * @interface IDescriptorProtoExtensionRange - * @property {number} [start] Start field id - * @property {number} [end] End field id - */ - -/** - * Properties of a ReservedRange message. - * @interface IDescriptorProtoReservedRange - * @property {number} [start] Start field id - * @property {number} [end] End field id - */ - -var unnamedMessageIndex = 0; - -/** - * Creates a type from a descriptor. - * @param {IDescriptorProto|Reader|Uint8Array} descriptor Descriptor - * @param {string} [syntax="proto2"] Syntax - * @returns {Type} Type instance - */ -Type.fromDescriptor = function fromDescriptor(descriptor, syntax) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.DescriptorProto.decode(descriptor); - - // Create the message type - var type = new Type(descriptor.name.length ? descriptor.name : "Type" + unnamedMessageIndex++, fromDescriptorOptions(descriptor.options, exports.MessageOptions)), - i; - - /* Oneofs */ if (descriptor.oneofDecl) - for (i = 0; i < descriptor.oneofDecl.length; ++i) - type.add(OneOf.fromDescriptor(descriptor.oneofDecl[i])); - /* Fields */ if (descriptor.field) - for (i = 0; i < descriptor.field.length; ++i) { - var field = Field.fromDescriptor(descriptor.field[i], syntax); - type.add(field); - if (descriptor.field[i].hasOwnProperty("oneofIndex")) // eslint-disable-line no-prototype-builtins - type.oneofsArray[descriptor.field[i].oneofIndex].add(field); - } - /* Extension fields */ if (descriptor.extension) - for (i = 0; i < descriptor.extension.length; ++i) - type.add(Field.fromDescriptor(descriptor.extension[i], syntax)); - /* Nested types */ if (descriptor.nestedType) - for (i = 0; i < descriptor.nestedType.length; ++i) { - type.add(Type.fromDescriptor(descriptor.nestedType[i], syntax)); - if (descriptor.nestedType[i].options && descriptor.nestedType[i].options.mapEntry) - type.setOption("map_entry", true); - } - /* Nested enums */ if (descriptor.enumType) - for (i = 0; i < descriptor.enumType.length; ++i) - type.add(Enum.fromDescriptor(descriptor.enumType[i])); - /* Extension ranges */ if (descriptor.extensionRange && descriptor.extensionRange.length) { - type.extensions = []; - for (i = 0; i < descriptor.extensionRange.length; ++i) - type.extensions.push([ descriptor.extensionRange[i].start, descriptor.extensionRange[i].end ]); - } - /* Reserved... */ if (descriptor.reservedRange && descriptor.reservedRange.length || descriptor.reservedName && descriptor.reservedName.length) { - type.reserved = []; - /* Ranges */ if (descriptor.reservedRange) - for (i = 0; i < descriptor.reservedRange.length; ++i) - type.reserved.push([ descriptor.reservedRange[i].start, descriptor.reservedRange[i].end ]); - /* Names */ if (descriptor.reservedName) - for (i = 0; i < descriptor.reservedName.length; ++i) - type.reserved.push(descriptor.reservedName[i]); - } - - return type; -}; - -/** - * Converts a type to a descriptor. - * @returns {Message} Descriptor - * @param {string} [syntax="proto2"] Syntax - */ -Type.prototype.toDescriptor = function toDescriptor(syntax) { - var descriptor = exports.DescriptorProto.create({ name: this.name }), - i; - - /* Fields */ for (i = 0; i < this.fieldsArray.length; ++i) { - var fieldDescriptor; - descriptor.field.push(fieldDescriptor = this._fieldsArray[i].toDescriptor(syntax)); - if (this._fieldsArray[i] instanceof MapField) { // map fields are repeated FieldNameEntry - var keyType = toDescriptorType(this._fieldsArray[i].keyType, this._fieldsArray[i].resolvedKeyType), - valueType = toDescriptorType(this._fieldsArray[i].type, this._fieldsArray[i].resolvedType), - valueTypeName = valueType === /* type */ 11 || valueType === /* enum */ 14 - ? this._fieldsArray[i].resolvedType && shortname(this.parent, this._fieldsArray[i].resolvedType) || this._fieldsArray[i].type - : undefined; - descriptor.nestedType.push(exports.DescriptorProto.create({ - name: fieldDescriptor.typeName, - field: [ - exports.FieldDescriptorProto.create({ name: "key", number: 1, label: 1, type: keyType }), // can't reference a type or enum - exports.FieldDescriptorProto.create({ name: "value", number: 2, label: 1, type: valueType, typeName: valueTypeName }) - ], - options: exports.MessageOptions.create({ mapEntry: true }) - })); - } - } - /* Oneofs */ for (i = 0; i < this.oneofsArray.length; ++i) - descriptor.oneofDecl.push(this._oneofsArray[i].toDescriptor()); - /* Nested... */ for (i = 0; i < this.nestedArray.length; ++i) { - /* Extension fields */ if (this._nestedArray[i] instanceof Field) - descriptor.field.push(this._nestedArray[i].toDescriptor(syntax)); - /* Types */ else if (this._nestedArray[i] instanceof Type) - descriptor.nestedType.push(this._nestedArray[i].toDescriptor(syntax)); - /* Enums */ else if (this._nestedArray[i] instanceof Enum) - descriptor.enumType.push(this._nestedArray[i].toDescriptor()); - // plain nested namespaces become packages instead in Root#toDescriptor - } - /* Extension ranges */ if (this.extensions) - for (i = 0; i < this.extensions.length; ++i) - descriptor.extensionRange.push(exports.DescriptorProto.ExtensionRange.create({ start: this.extensions[i][0], end: this.extensions[i][1] })); - /* Reserved... */ if (this.reserved) - for (i = 0; i < this.reserved.length; ++i) - /* Names */ if (typeof this.reserved[i] === "string") - descriptor.reservedName.push(this.reserved[i]); - /* Ranges */ else - descriptor.reservedRange.push(exports.DescriptorProto.ReservedRange.create({ start: this.reserved[i][0], end: this.reserved[i][1] })); - - descriptor.options = toDescriptorOptions(this.options, exports.MessageOptions); - - return descriptor; -}; - -// --- Field --- - -/** - * Properties of a FieldDescriptorProto message. - * @interface IFieldDescriptorProto - * @property {string} [name] Field name - * @property {number} [number] Field id - * @property {IFieldDescriptorProtoLabel} [label] Field rule - * @property {IFieldDescriptorProtoType} [type] Field basic type - * @property {string} [typeName] Field type name - * @property {string} [extendee] Extended type name - * @property {string} [defaultValue] Literal default value - * @property {number} [oneofIndex] Oneof index if part of a oneof - * @property {*} [jsonName] Not supported - * @property {IFieldOptions} [options] Field options - */ - -/** - * Values of the FieldDescriptorProto.Label enum. - * @typedef IFieldDescriptorProtoLabel - * @type {number} - * @property {number} LABEL_OPTIONAL=1 - * @property {number} LABEL_REQUIRED=2 - * @property {number} LABEL_REPEATED=3 - */ - -/** - * Values of the FieldDescriptorProto.Type enum. - * @typedef IFieldDescriptorProtoType - * @type {number} - * @property {number} TYPE_DOUBLE=1 - * @property {number} TYPE_FLOAT=2 - * @property {number} TYPE_INT64=3 - * @property {number} TYPE_UINT64=4 - * @property {number} TYPE_INT32=5 - * @property {number} TYPE_FIXED64=6 - * @property {number} TYPE_FIXED32=7 - * @property {number} TYPE_BOOL=8 - * @property {number} TYPE_STRING=9 - * @property {number} TYPE_GROUP=10 - * @property {number} TYPE_MESSAGE=11 - * @property {number} TYPE_BYTES=12 - * @property {number} TYPE_UINT32=13 - * @property {number} TYPE_ENUM=14 - * @property {number} TYPE_SFIXED32=15 - * @property {number} TYPE_SFIXED64=16 - * @property {number} TYPE_SINT32=17 - * @property {number} TYPE_SINT64=18 - */ - -/** - * Properties of a FieldOptions message. - * @interface IFieldOptions - * @property {boolean} [packed] Whether packed or not (defaults to `false` for proto2 and `true` for proto3) - * @property {IFieldOptionsJSType} [jstype] JavaScript value type (not used by protobuf.js) - */ - -/** - * Values of the FieldOptions.JSType enum. - * @typedef IFieldOptionsJSType - * @type {number} - * @property {number} JS_NORMAL=0 - * @property {number} JS_STRING=1 - * @property {number} JS_NUMBER=2 - */ - -// copied here from parse.js -var numberRe = /^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/; - -/** - * Creates a field from a descriptor. - * @param {IFieldDescriptorProto|Reader|Uint8Array} descriptor Descriptor - * @param {string} [syntax="proto2"] Syntax - * @returns {Field} Field instance - */ -Field.fromDescriptor = function fromDescriptor(descriptor, syntax) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.DescriptorProto.decode(descriptor); - - if (typeof descriptor.number !== "number") - throw Error("missing field id"); - - // Rewire field type - var fieldType; - if (descriptor.typeName && descriptor.typeName.length) - fieldType = descriptor.typeName; - else - fieldType = fromDescriptorType(descriptor.type); - - // Rewire field rule - var fieldRule; - switch (descriptor.label) { - // 0 is reserved for errors - case 1: fieldRule = undefined; break; - case 2: fieldRule = "required"; break; - case 3: fieldRule = "repeated"; break; - default: throw Error("illegal label: " + descriptor.label); - } - - var extendee = descriptor.extendee; - if (descriptor.extendee !== undefined) { - extendee = extendee.length ? extendee : undefined; - } - var field = new Field( - $protobuf.util.camelCase(descriptor.name.length ? descriptor.name : "field" + descriptor.number), - descriptor.number, - fieldType, - fieldRule, - extendee - ); - - field.options = fromDescriptorOptions(descriptor.options, exports.FieldOptions); - - if (descriptor.defaultValue && descriptor.defaultValue.length) { - var defaultValue = descriptor.defaultValue; - switch (defaultValue) { - case "true": case "TRUE": - defaultValue = true; - break; - case "false": case "FALSE": - defaultValue = false; - break; - default: - var match = numberRe.exec(defaultValue); - if (match) - defaultValue = parseInt(defaultValue); // eslint-disable-line radix - break; - } - field.setOption("default", defaultValue); - } - - if (packableDescriptorType(descriptor.type)) { - if (syntax === "proto3") { // defaults to packed=true (internal preset is packed=true) - if (descriptor.options && !descriptor.options.packed) - field.setOption("packed", false); - } else if (!(descriptor.options && descriptor.options.packed)) // defaults to packed=false - field.setOption("packed", false); - } - - return field; -}; - -/** - * Converts a field to a descriptor. - * @returns {Message} Descriptor - * @param {string} [syntax="proto2"] Syntax - */ -Field.prototype.toDescriptor = function toDescriptor(syntax) { - var descriptor = exports.FieldDescriptorProto.create({ name: this.name, number: this.id }); - - if (this.map) { - - descriptor.type = 11; // message - descriptor.typeName = $protobuf.util.ucFirst(this.name); // fieldName -> FieldNameEntry (built in Type#toDescriptor) - descriptor.label = 3; // repeated - - } else { - - // Rewire field type - switch (descriptor.type = toDescriptorType(this.type, this.resolve().resolvedType)) { - case 10: // group - case 11: // type - case 14: // enum - descriptor.typeName = this.resolvedType ? shortname(this.parent, this.resolvedType) : this.type; - break; - } - - // Rewire field rule - switch (this.rule) { - case "repeated": descriptor.label = 3; break; - case "required": descriptor.label = 2; break; - default: descriptor.label = 1; break; - } - - } - - // Handle extension field - descriptor.extendee = this.extensionField ? this.extensionField.parent.fullName : this.extend; - - // Handle part of oneof - if (this.partOf) - if ((descriptor.oneofIndex = this.parent.oneofsArray.indexOf(this.partOf)) < 0) - throw Error("missing oneof"); - - if (this.options) { - descriptor.options = toDescriptorOptions(this.options, exports.FieldOptions); - if (this.options["default"] != null) - descriptor.defaultValue = String(this.options["default"]); - } - - if (syntax === "proto3") { // defaults to packed=true - if (!this.packed) - (descriptor.options || (descriptor.options = exports.FieldOptions.create())).packed = false; - } else if (this.packed) // defaults to packed=false - (descriptor.options || (descriptor.options = exports.FieldOptions.create())).packed = true; - - return descriptor; -}; - -// --- Enum --- - -/** - * Properties of an EnumDescriptorProto message. - * @interface IEnumDescriptorProto - * @property {string} [name] Enum name - * @property {IEnumValueDescriptorProto[]} [value] Enum values - * @property {IEnumOptions} [options] Enum options - */ - -/** - * Properties of an EnumValueDescriptorProto message. - * @interface IEnumValueDescriptorProto - * @property {string} [name] Name - * @property {number} [number] Value - * @property {*} [options] Not supported - */ - -/** - * Properties of an EnumOptions message. - * @interface IEnumOptions - * @property {boolean} [allowAlias] Whether aliases are allowed - * @property {boolean} [deprecated] - */ - -var unnamedEnumIndex = 0; - -/** - * Creates an enum from a descriptor. - * @param {IEnumDescriptorProto|Reader|Uint8Array} descriptor Descriptor - * @returns {Enum} Enum instance - */ -Enum.fromDescriptor = function fromDescriptor(descriptor) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.EnumDescriptorProto.decode(descriptor); - - // Construct values object - var values = {}; - if (descriptor.value) - for (var i = 0; i < descriptor.value.length; ++i) { - var name = descriptor.value[i].name, - value = descriptor.value[i].number || 0; - values[name && name.length ? name : "NAME" + value] = value; - } - - return new Enum( - descriptor.name && descriptor.name.length ? descriptor.name : "Enum" + unnamedEnumIndex++, - values, - fromDescriptorOptions(descriptor.options, exports.EnumOptions) - ); -}; - -/** - * Converts an enum to a descriptor. - * @returns {Message} Descriptor - */ -Enum.prototype.toDescriptor = function toDescriptor() { - - // Values - var values = []; - for (var i = 0, ks = Object.keys(this.values); i < ks.length; ++i) - values.push(exports.EnumValueDescriptorProto.create({ name: ks[i], number: this.values[ks[i]] })); - - return exports.EnumDescriptorProto.create({ - name: this.name, - value: values, - options: toDescriptorOptions(this.options, exports.EnumOptions) - }); -}; - -// --- OneOf --- - -/** - * Properties of a OneofDescriptorProto message. - * @interface IOneofDescriptorProto - * @property {string} [name] Oneof name - * @property {*} [options] Not supported - */ - -var unnamedOneofIndex = 0; - -/** - * Creates a oneof from a descriptor. - * @param {IOneofDescriptorProto|Reader|Uint8Array} descriptor Descriptor - * @returns {OneOf} OneOf instance - */ -OneOf.fromDescriptor = function fromDescriptor(descriptor) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.OneofDescriptorProto.decode(descriptor); - - return new OneOf( - // unnamedOneOfIndex is global, not per type, because we have no ref to a type here - descriptor.name && descriptor.name.length ? descriptor.name : "oneof" + unnamedOneofIndex++ - // fromDescriptorOptions(descriptor.options, exports.OneofOptions) - only uninterpreted_option - ); -}; - -/** - * Converts a oneof to a descriptor. - * @returns {Message} Descriptor - */ -OneOf.prototype.toDescriptor = function toDescriptor() { - return exports.OneofDescriptorProto.create({ - name: this.name - // options: toDescriptorOptions(this.options, exports.OneofOptions) - only uninterpreted_option - }); -}; - -// --- Service --- - -/** - * Properties of a ServiceDescriptorProto message. - * @interface IServiceDescriptorProto - * @property {string} [name] Service name - * @property {IMethodDescriptorProto[]} [method] Methods - * @property {IServiceOptions} [options] Options - */ - -/** - * Properties of a ServiceOptions message. - * @interface IServiceOptions - * @property {boolean} [deprecated] - */ - -var unnamedServiceIndex = 0; - -/** - * Creates a service from a descriptor. - * @param {IServiceDescriptorProto|Reader|Uint8Array} descriptor Descriptor - * @returns {Service} Service instance - */ -Service.fromDescriptor = function fromDescriptor(descriptor) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.ServiceDescriptorProto.decode(descriptor); - - var service = new Service(descriptor.name && descriptor.name.length ? descriptor.name : "Service" + unnamedServiceIndex++, fromDescriptorOptions(descriptor.options, exports.ServiceOptions)); - if (descriptor.method) - for (var i = 0; i < descriptor.method.length; ++i) - service.add(Method.fromDescriptor(descriptor.method[i])); - - return service; -}; - -/** - * Converts a service to a descriptor. - * @returns {Message} Descriptor - */ -Service.prototype.toDescriptor = function toDescriptor() { - - // Methods - var methods = []; - for (var i = 0; i < this.methodsArray; ++i) - methods.push(this._methodsArray[i].toDescriptor()); - - return exports.ServiceDescriptorProto.create({ - name: this.name, - methods: methods, - options: toDescriptorOptions(this.options, exports.ServiceOptions) - }); -}; - -// --- Method --- - -/** - * Properties of a MethodDescriptorProto message. - * @interface IMethodDescriptorProto - * @property {string} [name] Method name - * @property {string} [inputType] Request type name - * @property {string} [outputType] Response type name - * @property {IMethodOptions} [options] Not supported - * @property {boolean} [clientStreaming=false] Whether requests are streamed - * @property {boolean} [serverStreaming=false] Whether responses are streamed - */ - -/** - * Properties of a MethodOptions message. - * @interface IMethodOptions - * @property {boolean} [deprecated] - */ - -var unnamedMethodIndex = 0; - -/** - * Creates a method from a descriptor. - * @param {IMethodDescriptorProto|Reader|Uint8Array} descriptor Descriptor - * @returns {Method} Reflected method instance - */ -Method.fromDescriptor = function fromDescriptor(descriptor) { - - // Decode the descriptor message if specified as a buffer: - if (typeof descriptor.length === "number") - descriptor = exports.MethodDescriptorProto.decode(descriptor); - - return new Method( - // unnamedMethodIndex is global, not per service, because we have no ref to a service here - descriptor.name && descriptor.name.length ? descriptor.name : "Method" + unnamedMethodIndex++, - "rpc", - descriptor.inputType, - descriptor.outputType, - Boolean(descriptor.clientStreaming), - Boolean(descriptor.serverStreaming), - fromDescriptorOptions(descriptor.options, exports.MethodOptions) - ); -}; - -/** - * Converts a method to a descriptor. - * @returns {Message} Descriptor - */ -Method.prototype.toDescriptor = function toDescriptor() { - return exports.MethodDescriptorProto.create({ - name: this.name, - inputType: this.resolvedRequestType ? this.resolvedRequestType.fullName : this.requestType, - outputType: this.resolvedResponseType ? this.resolvedResponseType.fullName : this.responseType, - clientStreaming: this.requestStream, - serverStreaming: this.responseStream, - options: toDescriptorOptions(this.options, exports.MethodOptions) - }); -}; - -// --- utility --- - -// Converts a descriptor type to a protobuf.js basic type -function fromDescriptorType(type) { - switch (type) { - // 0 is reserved for errors - case 1: return "double"; - case 2: return "float"; - case 3: return "int64"; - case 4: return "uint64"; - case 5: return "int32"; - case 6: return "fixed64"; - case 7: return "fixed32"; - case 8: return "bool"; - case 9: return "string"; - case 12: return "bytes"; - case 13: return "uint32"; - case 15: return "sfixed32"; - case 16: return "sfixed64"; - case 17: return "sint32"; - case 18: return "sint64"; - } - throw Error("illegal type: " + type); -} - -// Tests if a descriptor type is packable -function packableDescriptorType(type) { - switch (type) { - case 1: // double - case 2: // float - case 3: // int64 - case 4: // uint64 - case 5: // int32 - case 6: // fixed64 - case 7: // fixed32 - case 8: // bool - case 13: // uint32 - case 14: // enum (!) - case 15: // sfixed32 - case 16: // sfixed64 - case 17: // sint32 - case 18: // sint64 - return true; - } - return false; -} - -// Converts a protobuf.js basic type to a descriptor type -function toDescriptorType(type, resolvedType) { - switch (type) { - // 0 is reserved for errors - case "double": return 1; - case "float": return 2; - case "int64": return 3; - case "uint64": return 4; - case "int32": return 5; - case "fixed64": return 6; - case "fixed32": return 7; - case "bool": return 8; - case "string": return 9; - case "bytes": return 12; - case "uint32": return 13; - case "sfixed32": return 15; - case "sfixed64": return 16; - case "sint32": return 17; - case "sint64": return 18; - } - if (resolvedType instanceof Enum) - return 14; - if (resolvedType instanceof Type) - return resolvedType.group ? 10 : 11; - throw Error("illegal type: " + type); -} - -// Converts descriptor options to an options object -function fromDescriptorOptions(options, type) { - if (!options) - return undefined; - var out = []; - for (var i = 0, field, key, val; i < type.fieldsArray.length; ++i) - if ((key = (field = type._fieldsArray[i]).name) !== "uninterpretedOption") - if (options.hasOwnProperty(key)) { // eslint-disable-line no-prototype-builtins - val = options[key]; - if (field.resolvedType instanceof Enum && typeof val === "number" && field.resolvedType.valuesById[val] !== undefined) - val = field.resolvedType.valuesById[val]; - out.push(underScore(key), val); - } - return out.length ? $protobuf.util.toObject(out) : undefined; -} - -// Converts an options object to descriptor options -function toDescriptorOptions(options, type) { - if (!options) - return undefined; - var out = []; - for (var i = 0, ks = Object.keys(options), key, val; i < ks.length; ++i) { - val = options[key = ks[i]]; - if (key === "default") - continue; - var field = type.fields[key]; - if (!field && !(field = type.fields[key = $protobuf.util.camelCase(key)])) - continue; - out.push(key, val); - } - return out.length ? type.fromObject($protobuf.util.toObject(out)) : undefined; -} - -// Calculates the shortest relative path from `from` to `to`. -function shortname(from, to) { - var fromPath = from.fullName.split("."), - toPath = to.fullName.split("."), - i = 0, - j = 0, - k = toPath.length - 1; - if (!(from instanceof Root) && to instanceof Namespace) - while (i < fromPath.length && j < k && fromPath[i] === toPath[j]) { - var other = to.lookup(fromPath[i++], true); - if (other !== null && other !== to) - break; - ++j; - } - else - for (; i < fromPath.length && j < k && fromPath[i] === toPath[j]; ++i, ++j); - return toPath.slice(j).join("."); -} - -// copied here from cli/targets/proto.js -function underScore(str) { - return str.substring(0,1) - + str.substring(1) - .replace(/([A-Z])(?=[a-z]|$)/g, function($0, $1) { return "_" + $1.toLowerCase(); }); -} - -// --- exports --- - -/** - * Reflected file descriptor set. - * @name FileDescriptorSet - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected file descriptor proto. - * @name FileDescriptorProto - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected descriptor proto. - * @name DescriptorProto - * @type {Type} - * @property {Type} ExtensionRange - * @property {Type} ReservedRange - * @const - * @tstype $protobuf.Type & { - * ExtensionRange: $protobuf.Type, - * ReservedRange: $protobuf.Type - * } - */ - -/** - * Reflected field descriptor proto. - * @name FieldDescriptorProto - * @type {Type} - * @property {Enum} Label - * @property {Enum} Type - * @const - * @tstype $protobuf.Type & { - * Label: $protobuf.Enum, - * Type: $protobuf.Enum - * } - */ - -/** - * Reflected oneof descriptor proto. - * @name OneofDescriptorProto - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected enum descriptor proto. - * @name EnumDescriptorProto - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected service descriptor proto. - * @name ServiceDescriptorProto - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected enum value descriptor proto. - * @name EnumValueDescriptorProto - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected method descriptor proto. - * @name MethodDescriptorProto - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected file options. - * @name FileOptions - * @type {Type} - * @property {Enum} OptimizeMode - * @const - * @tstype $protobuf.Type & { - * OptimizeMode: $protobuf.Enum - * } - */ - -/** - * Reflected message options. - * @name MessageOptions - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected field options. - * @name FieldOptions - * @type {Type} - * @property {Enum} CType - * @property {Enum} JSType - * @const - * @tstype $protobuf.Type & { - * CType: $protobuf.Enum, - * JSType: $protobuf.Enum - * } - */ - -/** - * Reflected oneof options. - * @name OneofOptions - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected enum options. - * @name EnumOptions - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected enum value options. - * @name EnumValueOptions - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected service options. - * @name ServiceOptions - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected method options. - * @name MethodOptions - * @type {Type} - * @const - * @tstype $protobuf.Type - */ - -/** - * Reflected uninterpretet option. - * @name UninterpretedOption - * @type {Type} - * @property {Type} NamePart - * @const - * @tstype $protobuf.Type & { - * NamePart: $protobuf.Type - * } - */ - -/** - * Reflected source code info. - * @name SourceCodeInfo - * @type {Type} - * @property {Type} Location - * @const - * @tstype $protobuf.Type & { - * Location: $protobuf.Type - * } - */ - -/** - * Reflected generated code info. - * @name GeneratedCodeInfo - * @type {Type} - * @property {Type} Annotation - * @const - * @tstype $protobuf.Type & { - * Annotation: $protobuf.Type - * } - */ - - -/***/ }), -/* 66 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -const strictUriEncode = __webpack_require__(142); -const decodeComponent = __webpack_require__(143); -const splitOnFirst = __webpack_require__(144); -const filterObject = __webpack_require__(145); - -const isNullOrUndefined = value => value === null || value === undefined; - -const encodeFragmentIdentifier = Symbol('encodeFragmentIdentifier'); - -function encoderForArrayFormat(options) { - switch (options.arrayFormat) { - case 'index': - return key => (result, value) => { - const index = result.length; - - if ( - value === undefined || - (options.skipNull && value === null) || - (options.skipEmptyString && value === '') - ) { - return result; - } - - if (value === null) { - return [...result, [encode(key, options), '[', index, ']'].join('')]; - } - - return [ - ...result, - [encode(key, options), '[', encode(index, options), ']=', encode(value, options)].join('') - ]; - }; - - case 'bracket': - return key => (result, value) => { - if ( - value === undefined || - (options.skipNull && value === null) || - (options.skipEmptyString && value === '') - ) { - return result; - } - - if (value === null) { - return [...result, [encode(key, options), '[]'].join('')]; - } - - return [...result, [encode(key, options), '[]=', encode(value, options)].join('')]; - }; - - case 'colon-list-separator': - return key => (result, value) => { - if ( - value === undefined || - (options.skipNull && value === null) || - (options.skipEmptyString && value === '') - ) { - return result; - } - - if (value === null) { - return [...result, [encode(key, options), ':list='].join('')]; - } - - return [...result, [encode(key, options), ':list=', encode(value, options)].join('')]; - }; - - case 'comma': - case 'separator': - case 'bracket-separator': { - const keyValueSep = options.arrayFormat === 'bracket-separator' ? - '[]=' : - '='; - - return key => (result, value) => { - if ( - value === undefined || - (options.skipNull && value === null) || - (options.skipEmptyString && value === '') - ) { - return result; - } - - // Translate null to an empty string so that it doesn't serialize as 'null' - value = value === null ? '' : value; - - if (result.length === 0) { - return [[encode(key, options), keyValueSep, encode(value, options)].join('')]; - } - - return [[result, encode(value, options)].join(options.arrayFormatSeparator)]; - }; - } - - default: - return key => (result, value) => { - if ( - value === undefined || - (options.skipNull && value === null) || - (options.skipEmptyString && value === '') - ) { - return result; - } - - if (value === null) { - return [...result, encode(key, options)]; - } - - return [...result, [encode(key, options), '=', encode(value, options)].join('')]; - }; - } -} - -function parserForArrayFormat(options) { - let result; - - switch (options.arrayFormat) { - case 'index': - return (key, value, accumulator) => { - result = /\[(\d*)\]$/.exec(key); - - key = key.replace(/\[\d*\]$/, ''); - - if (!result) { - accumulator[key] = value; - return; - } - - if (accumulator[key] === undefined) { - accumulator[key] = {}; - } - - accumulator[key][result[1]] = value; - }; - - case 'bracket': - return (key, value, accumulator) => { - result = /(\[\])$/.exec(key); - key = key.replace(/\[\]$/, ''); - - if (!result) { - accumulator[key] = value; - return; - } - - if (accumulator[key] === undefined) { - accumulator[key] = [value]; - return; - } - - accumulator[key] = [].concat(accumulator[key], value); - }; - - case 'colon-list-separator': - return (key, value, accumulator) => { - result = /(:list)$/.exec(key); - key = key.replace(/:list$/, ''); - - if (!result) { - accumulator[key] = value; - return; - } - - if (accumulator[key] === undefined) { - accumulator[key] = [value]; - return; - } - - accumulator[key] = [].concat(accumulator[key], value); - }; - - case 'comma': - case 'separator': - return (key, value, accumulator) => { - const isArray = typeof value === 'string' && value.includes(options.arrayFormatSeparator); - const isEncodedArray = (typeof value === 'string' && !isArray && decode(value, options).includes(options.arrayFormatSeparator)); - value = isEncodedArray ? decode(value, options) : value; - const newValue = isArray || isEncodedArray ? value.split(options.arrayFormatSeparator).map(item => decode(item, options)) : value === null ? value : decode(value, options); - accumulator[key] = newValue; - }; - - case 'bracket-separator': - return (key, value, accumulator) => { - const isArray = /(\[\])$/.test(key); - key = key.replace(/\[\]$/, ''); - - if (!isArray) { - accumulator[key] = value ? decode(value, options) : value; - return; - } - - const arrayValue = value === null ? - [] : - value.split(options.arrayFormatSeparator).map(item => decode(item, options)); - - if (accumulator[key] === undefined) { - accumulator[key] = arrayValue; - return; - } - - accumulator[key] = [].concat(accumulator[key], arrayValue); - }; - - default: - return (key, value, accumulator) => { - if (accumulator[key] === undefined) { - accumulator[key] = value; - return; - } - - accumulator[key] = [].concat(accumulator[key], value); - }; - } -} - -function validateArrayFormatSeparator(value) { - if (typeof value !== 'string' || value.length !== 1) { - throw new TypeError('arrayFormatSeparator must be single character string'); - } -} - -function encode(value, options) { - if (options.encode) { - return options.strict ? strictUriEncode(value) : encodeURIComponent(value); - } - - return value; -} - -function decode(value, options) { - if (options.decode) { - return decodeComponent(value); - } - - return value; -} - -function keysSorter(input) { - if (Array.isArray(input)) { - return input.sort(); - } - - if (typeof input === 'object') { - return keysSorter(Object.keys(input)) - .sort((a, b) => Number(a) - Number(b)) - .map(key => input[key]); - } - - return input; -} - -function removeHash(input) { - const hashStart = input.indexOf('#'); - if (hashStart !== -1) { - input = input.slice(0, hashStart); - } - - return input; -} - -function getHash(url) { - let hash = ''; - const hashStart = url.indexOf('#'); - if (hashStart !== -1) { - hash = url.slice(hashStart); - } - - return hash; -} - -function extract(input) { - input = removeHash(input); - const queryStart = input.indexOf('?'); - if (queryStart === -1) { - return ''; - } - - return input.slice(queryStart + 1); -} - -function parseValue(value, options) { - if (options.parseNumbers && !Number.isNaN(Number(value)) && (typeof value === 'string' && value.trim() !== '')) { - value = Number(value); - } else if (options.parseBooleans && value !== null && (value.toLowerCase() === 'true' || value.toLowerCase() === 'false')) { - value = value.toLowerCase() === 'true'; - } - - return value; -} - -function parse(query, options) { - options = Object.assign({ - decode: true, - sort: true, - arrayFormat: 'none', - arrayFormatSeparator: ',', - parseNumbers: false, - parseBooleans: false - }, options); - - validateArrayFormatSeparator(options.arrayFormatSeparator); - - const formatter = parserForArrayFormat(options); - - // Create an object with no prototype - const ret = Object.create(null); - - if (typeof query !== 'string') { - return ret; - } - - query = query.trim().replace(/^[?#&]/, ''); - - if (!query) { - return ret; - } - - for (const param of query.split('&')) { - if (param === '') { - continue; - } - - let [key, value] = splitOnFirst(options.decode ? param.replace(/\+/g, ' ') : param, '='); - - // Missing `=` should be `null`: - // http://w3.org/TR/2012/WD-url-20120524/#collect-url-parameters - value = value === undefined ? null : ['comma', 'separator', 'bracket-separator'].includes(options.arrayFormat) ? value : decode(value, options); - formatter(decode(key, options), value, ret); - } - - for (const key of Object.keys(ret)) { - const value = ret[key]; - if (typeof value === 'object' && value !== null) { - for (const k of Object.keys(value)) { - value[k] = parseValue(value[k], options); - } - } else { - ret[key] = parseValue(value, options); - } - } - - if (options.sort === false) { - return ret; - } - - return (options.sort === true ? Object.keys(ret).sort() : Object.keys(ret).sort(options.sort)).reduce((result, key) => { - const value = ret[key]; - if (Boolean(value) && typeof value === 'object' && !Array.isArray(value)) { - // Sort object keys, not values - result[key] = keysSorter(value); - } else { - result[key] = value; - } - - return result; - }, Object.create(null)); -} - -exports.extract = extract; -exports.parse = parse; - -exports.stringify = (object, options) => { - if (!object) { - return ''; - } - - options = Object.assign({ - encode: true, - strict: true, - arrayFormat: 'none', - arrayFormatSeparator: ',' - }, options); - - validateArrayFormatSeparator(options.arrayFormatSeparator); - - const shouldFilter = key => ( - (options.skipNull && isNullOrUndefined(object[key])) || - (options.skipEmptyString && object[key] === '') - ); - - const formatter = encoderForArrayFormat(options); - - const objectCopy = {}; - - for (const key of Object.keys(object)) { - if (!shouldFilter(key)) { - objectCopy[key] = object[key]; - } - } - - const keys = Object.keys(objectCopy); - - if (options.sort !== false) { - keys.sort(options.sort); - } - - return keys.map(key => { - const value = object[key]; - - if (value === undefined) { - return ''; - } - - if (value === null) { - return encode(key, options); - } - - if (Array.isArray(value)) { - if (value.length === 0 && options.arrayFormat === 'bracket-separator') { - return encode(key, options) + '[]'; - } - - return value - .reduce(formatter(key), []) - .join('&'); - } - - return encode(key, options) + '=' + encode(value, options); - }).filter(x => x.length > 0).join('&'); -}; - -exports.parseUrl = (url, options) => { - options = Object.assign({ - decode: true - }, options); - - const [url_, hash] = splitOnFirst(url, '#'); - - return Object.assign( - { - url: url_.split('?')[0] || '', - query: parse(extract(url), options) - }, - options && options.parseFragmentIdentifier && hash ? {fragmentIdentifier: decode(hash, options)} : {} - ); -}; - -exports.stringifyUrl = (object, options) => { - options = Object.assign({ - encode: true, - strict: true, - [encodeFragmentIdentifier]: true - }, options); - - const url = removeHash(object.url).split('?')[0] || ''; - const queryFromUrl = exports.extract(object.url); - const parsedQueryFromUrl = exports.parse(queryFromUrl, {sort: false}); - - const query = Object.assign(parsedQueryFromUrl, object.query); - let queryString = exports.stringify(query, options); - if (queryString) { - queryString = `?${queryString}`; - } - - let hash = getHash(object.url); - if (object.fragmentIdentifier) { - hash = `#${options[encodeFragmentIdentifier] ? encode(object.fragmentIdentifier, options) : object.fragmentIdentifier}`; - } - - return `${url}${queryString}${hash}`; -}; - -exports.pick = (input, filter, options) => { - options = Object.assign({ - parseFragmentIdentifier: true, - [encodeFragmentIdentifier]: false - }, options); - - const {url, query, fragmentIdentifier} = exports.parseUrl(input, options); - return exports.stringifyUrl({ - url, - query: filterObject(query, filter), - fragmentIdentifier - }, options); -}; - -exports.exclude = (input, filter, options) => { - const exclusionFilter = Array.isArray(filter) ? key => !filter.includes(key) : (key, value) => !filter(key, value); - - return exports.pick(input, exclusionFilter, options); -}; - - -/***/ }), -/* 67 */ -/***/ ((module, exports, __webpack_require__) => { - -/** - * Module dependencies. - */ - -var fs = __webpack_require__(56), - path = __webpack_require__(57), - fileURLToPath = __webpack_require__(119), - join = path.join, - dirname = path.dirname, - exists = - (fs.accessSync && - function(path) { - try { - fs.accessSync(path); - } catch (e) { - return false; - } - return true; - }) || - fs.existsSync || - path.existsSync, - defaults = { - arrow: process.env.NODE_BINDINGS_ARROW || ' → ', - compiled: process.env.NODE_BINDINGS_COMPILED_DIR || 'compiled', - platform: process.platform, - arch: process.arch, - nodePreGyp: - 'node-v' + - process.versions.modules + - '-' + - process.platform + - '-' + - process.arch, - version: process.versions.node, - bindings: 'bindings.node', - try: [ - // node-gyp's linked version in the "build" dir - ['module_root', 'build', 'bindings'], - // node-waf and gyp_addon (a.k.a node-gyp) - ['module_root', 'build', 'Debug', 'bindings'], - ['module_root', 'build', 'Release', 'bindings'], - // Debug files, for development (legacy behavior, remove for node v0.9) - ['module_root', 'out', 'Debug', 'bindings'], - ['module_root', 'Debug', 'bindings'], - // Release files, but manually compiled (legacy behavior, remove for node v0.9) - ['module_root', 'out', 'Release', 'bindings'], - ['module_root', 'Release', 'bindings'], - // Legacy from node-waf, node <= 0.4.x - ['module_root', 'build', 'default', 'bindings'], - // Production "Release" buildtype binary (meh...) - ['module_root', 'compiled', 'version', 'platform', 'arch', 'bindings'], - // node-qbs builds - ['module_root', 'addon-build', 'release', 'install-root', 'bindings'], - ['module_root', 'addon-build', 'debug', 'install-root', 'bindings'], - ['module_root', 'addon-build', 'default', 'install-root', 'bindings'], - // node-pre-gyp path ./lib/binding/{node_abi}-{platform}-{arch} - ['module_root', 'lib', 'binding', 'nodePreGyp', 'bindings'] - ] - }; - -/** - * The main `bindings()` function loads the compiled bindings for a given module. - * It uses V8's Error API to determine the parent filename that this function is - * being invoked from, which is then used to find the root directory. - */ - -function bindings(opts) { - // Argument surgery - if (typeof opts == 'string') { - opts = { bindings: opts }; - } else if (!opts) { - opts = {}; - } - - // maps `defaults` onto `opts` object - Object.keys(defaults).map(function(i) { - if (!(i in opts)) opts[i] = defaults[i]; - }); - - // Get the module root - if (!opts.module_root) { - opts.module_root = exports.getRoot(exports.getFileName()); - } - - // Ensure the given bindings name ends with .node - if (path.extname(opts.bindings) != '.node') { - opts.bindings += '.node'; - } - - // https://github.com/webpack/webpack/issues/4175#issuecomment-342931035 - var requireFunc = - true - ? require - : 0; - - var tries = [], - i = 0, - l = opts.try.length, - n, - b, - err; - - for (; i < l; i++) { - n = join.apply( - null, - opts.try[i].map(function(p) { - return opts[p] || p; - }) - ); - tries.push(n); - try { - b = opts.path ? requireFunc.resolve(n) : requireFunc(n); - if (!opts.path) { - b.path = n; - } - return b; - } catch (e) { - if (e.code !== 'MODULE_NOT_FOUND' && - e.code !== 'QUALIFIED_PATH_RESOLUTION_FAILED' && - !/not find/i.test(e.message)) { - throw e; - } - } - } - - err = new Error( - 'Could not locate the bindings file. Tried:\n' + - tries - .map(function(a) { - return opts.arrow + a; - }) - .join('\n') - ); - err.tries = tries; - throw err; -} -module.exports = exports = bindings; - -/** - * Gets the filename of the JavaScript file that invokes this function. - * Used to help find the root directory of a module. - * Optionally accepts an filename argument to skip when searching for the invoking filename - */ - -exports.getFileName = function getFileName(calling_file) { - var origPST = Error.prepareStackTrace, - origSTL = Error.stackTraceLimit, - dummy = {}, - fileName; - - Error.stackTraceLimit = 10; - - Error.prepareStackTrace = function(e, st) { - for (var i = 0, l = st.length; i < l; i++) { - fileName = st[i].getFileName(); - if (fileName !== __filename) { - if (calling_file) { - if (fileName !== calling_file) { - return; - } - } else { - return; - } - } - } - }; - - // run the 'prepareStackTrace' function above - Error.captureStackTrace(dummy); - dummy.stack; - - // cleanup - Error.prepareStackTrace = origPST; - Error.stackTraceLimit = origSTL; - - // handle filename that starts with "file://" - var fileSchema = 'file://'; - if (fileName.indexOf(fileSchema) === 0) { - fileName = fileURLToPath(fileName); - } - - return fileName; -}; - -/** - * Gets the root directory of a module, given an arbitrary filename - * somewhere in the module tree. The "root directory" is the directory - * containing the `package.json` file. - * - * In: /home/nate/node-native-module/lib/index.js - * Out: /home/nate/node-native-module - */ - -exports.getRoot = function getRoot(file) { - var dir = dirname(file), - prev; - while (true) { - if (dir === '.') { - // Avoids an infinite loop in rare cases, like the REPL - dir = process.cwd(); - } - if ( - exists(join(dir, 'package.json')) || - exists(join(dir, 'node_modules')) - ) { - // Found the 'package.json' file or 'node_modules' dir; we're done - return dir; - } - if (prev === dir) { - // Got to the top - throw new Error( - 'Could not find module root given file: "' + - file + - '". Do you have a `package.json` file? ' - ); - } - // Try the parent dir next - prev = dir; - dir = join(dir, '..'); - } -}; - - -/***/ }), -/* 68 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory, undef) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9), __webpack_require__(69), __webpack_require__(70), __webpack_require__(37), __webpack_require__(73)); - } - else {} -}(this, function (CryptoJS) { - - (function () { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var BlockCipher = C_lib.BlockCipher; - var C_algo = C.algo; - - // Lookup tables - var SBOX = []; - var INV_SBOX = []; - var SUB_MIX_0 = []; - var SUB_MIX_1 = []; - var SUB_MIX_2 = []; - var SUB_MIX_3 = []; - var INV_SUB_MIX_0 = []; - var INV_SUB_MIX_1 = []; - var INV_SUB_MIX_2 = []; - var INV_SUB_MIX_3 = []; - - // Compute lookup tables - (function () { - // Compute double table - var d = []; - for (var i = 0; i < 256; i++) { - if (i < 128) { - d[i] = i << 1; - } else { - d[i] = (i << 1) ^ 0x11b; - } - } - - // Walk GF(2^8) - var x = 0; - var xi = 0; - for (var i = 0; i < 256; i++) { - // Compute sbox - var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4); - sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63; - SBOX[x] = sx; - INV_SBOX[sx] = x; - - // Compute multiplication - var x2 = d[x]; - var x4 = d[x2]; - var x8 = d[x4]; - - // Compute sub bytes, mix columns tables - var t = (d[sx] * 0x101) ^ (sx * 0x1010100); - SUB_MIX_0[x] = (t << 24) | (t >>> 8); - SUB_MIX_1[x] = (t << 16) | (t >>> 16); - SUB_MIX_2[x] = (t << 8) | (t >>> 24); - SUB_MIX_3[x] = t; - - // Compute inv sub bytes, inv mix columns tables - var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100); - INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8); - INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16); - INV_SUB_MIX_2[sx] = (t << 8) | (t >>> 24); - INV_SUB_MIX_3[sx] = t; - - // Compute next counter - if (!x) { - x = xi = 1; - } else { - x = x2 ^ d[d[d[x8 ^ x2]]]; - xi ^= d[d[xi]]; - } - } - }()); - - // Precomputed Rcon lookup - var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]; - - /** - * AES block cipher algorithm. - */ - var AES = C_algo.AES = BlockCipher.extend({ - _doReset: function () { - var t; - - // Skip reset of nRounds has been set before and key did not change - if (this._nRounds && this._keyPriorReset === this._key) { - return; - } - - // Shortcuts - var key = this._keyPriorReset = this._key; - var keyWords = key.words; - var keySize = key.sigBytes / 4; - - // Compute number of rounds - var nRounds = this._nRounds = keySize + 6; - - // Compute number of key schedule rows - var ksRows = (nRounds + 1) * 4; - - // Compute key schedule - var keySchedule = this._keySchedule = []; - for (var ksRow = 0; ksRow < ksRows; ksRow++) { - if (ksRow < keySize) { - keySchedule[ksRow] = keyWords[ksRow]; - } else { - t = keySchedule[ksRow - 1]; - - if (!(ksRow % keySize)) { - // Rot word - t = (t << 8) | (t >>> 24); - - // Sub word - t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff]; - - // Mix Rcon - t ^= RCON[(ksRow / keySize) | 0] << 24; - } else if (keySize > 6 && ksRow % keySize == 4) { - // Sub word - t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff]; - } - - keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t; - } - } - - // Compute inv key schedule - var invKeySchedule = this._invKeySchedule = []; - for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) { - var ksRow = ksRows - invKsRow; - - if (invKsRow % 4) { - var t = keySchedule[ksRow]; - } else { - var t = keySchedule[ksRow - 4]; - } - - if (invKsRow < 4 || ksRow <= 4) { - invKeySchedule[invKsRow] = t; - } else { - invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^ - INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]]; - } - } - }, - - encryptBlock: function (M, offset) { - this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX); - }, - - decryptBlock: function (M, offset) { - // Swap 2nd and 4th rows - var t = M[offset + 1]; - M[offset + 1] = M[offset + 3]; - M[offset + 3] = t; - - this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX); - - // Inv swap 2nd and 4th rows - var t = M[offset + 1]; - M[offset + 1] = M[offset + 3]; - M[offset + 3] = t; - }, - - _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) { - // Shortcut - var nRounds = this._nRounds; - - // Get input, add round key - var s0 = M[offset] ^ keySchedule[0]; - var s1 = M[offset + 1] ^ keySchedule[1]; - var s2 = M[offset + 2] ^ keySchedule[2]; - var s3 = M[offset + 3] ^ keySchedule[3]; - - // Key schedule row counter - var ksRow = 4; - - // Rounds - for (var round = 1; round < nRounds; round++) { - // Shift rows, sub bytes, mix columns, add round key - var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++]; - var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++]; - var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++]; - var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++]; - - // Update state - s0 = t0; - s1 = t1; - s2 = t2; - s3 = t3; - } - - // Shift rows, sub bytes, add round key - var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]; - var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]; - var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]; - var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]; - - // Set output - M[offset] = t0; - M[offset + 1] = t1; - M[offset + 2] = t2; - M[offset + 3] = t3; - }, - - keySize: 256/32 - }); - - /** - * Shortcut functions to the cipher's object interface. - * - * @example - * - * var ciphertext = CryptoJS.AES.encrypt(message, key, cfg); - * var plaintext = CryptoJS.AES.decrypt(ciphertext, key, cfg); - */ - C.AES = BlockCipher._createHelper(AES); - }()); - - - return CryptoJS.AES; - -})); - -/***/ }), -/* 69 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9)); - } - else {} -}(this, function (CryptoJS) { - - (function () { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var WordArray = C_lib.WordArray; - var C_enc = C.enc; - - /** - * Base64 encoding strategy. - */ - var Base64 = C_enc.Base64 = { - /** - * Converts a word array to a Base64 string. - * - * @param {WordArray} wordArray The word array. - * - * @return {string} The Base64 string. - * - * @static - * - * @example - * - * var base64String = CryptoJS.enc.Base64.stringify(wordArray); - */ - stringify: function (wordArray) { - // Shortcuts - var words = wordArray.words; - var sigBytes = wordArray.sigBytes; - var map = this._map; - - // Clamp excess bits - wordArray.clamp(); - - // Convert - var base64Chars = []; - for (var i = 0; i < sigBytes; i += 3) { - var byte1 = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; - var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff; - var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff; - - var triplet = (byte1 << 16) | (byte2 << 8) | byte3; - - for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) { - base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f)); - } - } - - // Add padding - var paddingChar = map.charAt(64); - if (paddingChar) { - while (base64Chars.length % 4) { - base64Chars.push(paddingChar); - } - } - - return base64Chars.join(''); - }, - - /** - * Converts a Base64 string to a word array. - * - * @param {string} base64Str The Base64 string. - * - * @return {WordArray} The word array. - * - * @static - * - * @example - * - * var wordArray = CryptoJS.enc.Base64.parse(base64String); - */ - parse: function (base64Str) { - // Shortcuts - var base64StrLength = base64Str.length; - var map = this._map; - var reverseMap = this._reverseMap; - - if (!reverseMap) { - reverseMap = this._reverseMap = []; - for (var j = 0; j < map.length; j++) { - reverseMap[map.charCodeAt(j)] = j; - } - } - - // Ignore padding - var paddingChar = map.charAt(64); - if (paddingChar) { - var paddingIndex = base64Str.indexOf(paddingChar); - if (paddingIndex !== -1) { - base64StrLength = paddingIndex; - } - } - - // Convert - return parseLoop(base64Str, base64StrLength, reverseMap); - - }, - - _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=' - }; - - function parseLoop(base64Str, base64StrLength, reverseMap) { - var words = []; - var nBytes = 0; - for (var i = 0; i < base64StrLength; i++) { - if (i % 4) { - var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << ((i % 4) * 2); - var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> (6 - (i % 4) * 2); - var bitsCombined = bits1 | bits2; - words[nBytes >>> 2] |= bitsCombined << (24 - (nBytes % 4) * 8); - nBytes++; - } - } - return WordArray.create(words, nBytes); - } - }()); - - - return CryptoJS.enc.Base64; - -})); - -/***/ }), -/* 70 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9)); - } - else {} -}(this, function (CryptoJS) { - - (function (Math) { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var WordArray = C_lib.WordArray; - var Hasher = C_lib.Hasher; - var C_algo = C.algo; - - // Constants table - var T = []; - - // Compute constants - (function () { - for (var i = 0; i < 64; i++) { - T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0; - } - }()); - - /** - * MD5 hash algorithm. - */ - var MD5 = C_algo.MD5 = Hasher.extend({ - _doReset: function () { - this._hash = new WordArray.init([ - 0x67452301, 0xefcdab89, - 0x98badcfe, 0x10325476 - ]); - }, - - _doProcessBlock: function (M, offset) { - // Swap endian - for (var i = 0; i < 16; i++) { - // Shortcuts - var offset_i = offset + i; - var M_offset_i = M[offset_i]; - - M[offset_i] = ( - (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) | - (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00) - ); - } - - // Shortcuts - var H = this._hash.words; - - var M_offset_0 = M[offset + 0]; - var M_offset_1 = M[offset + 1]; - var M_offset_2 = M[offset + 2]; - var M_offset_3 = M[offset + 3]; - var M_offset_4 = M[offset + 4]; - var M_offset_5 = M[offset + 5]; - var M_offset_6 = M[offset + 6]; - var M_offset_7 = M[offset + 7]; - var M_offset_8 = M[offset + 8]; - var M_offset_9 = M[offset + 9]; - var M_offset_10 = M[offset + 10]; - var M_offset_11 = M[offset + 11]; - var M_offset_12 = M[offset + 12]; - var M_offset_13 = M[offset + 13]; - var M_offset_14 = M[offset + 14]; - var M_offset_15 = M[offset + 15]; - - // Working varialbes - var a = H[0]; - var b = H[1]; - var c = H[2]; - var d = H[3]; - - // Computation - a = FF(a, b, c, d, M_offset_0, 7, T[0]); - d = FF(d, a, b, c, M_offset_1, 12, T[1]); - c = FF(c, d, a, b, M_offset_2, 17, T[2]); - b = FF(b, c, d, a, M_offset_3, 22, T[3]); - a = FF(a, b, c, d, M_offset_4, 7, T[4]); - d = FF(d, a, b, c, M_offset_5, 12, T[5]); - c = FF(c, d, a, b, M_offset_6, 17, T[6]); - b = FF(b, c, d, a, M_offset_7, 22, T[7]); - a = FF(a, b, c, d, M_offset_8, 7, T[8]); - d = FF(d, a, b, c, M_offset_9, 12, T[9]); - c = FF(c, d, a, b, M_offset_10, 17, T[10]); - b = FF(b, c, d, a, M_offset_11, 22, T[11]); - a = FF(a, b, c, d, M_offset_12, 7, T[12]); - d = FF(d, a, b, c, M_offset_13, 12, T[13]); - c = FF(c, d, a, b, M_offset_14, 17, T[14]); - b = FF(b, c, d, a, M_offset_15, 22, T[15]); - - a = GG(a, b, c, d, M_offset_1, 5, T[16]); - d = GG(d, a, b, c, M_offset_6, 9, T[17]); - c = GG(c, d, a, b, M_offset_11, 14, T[18]); - b = GG(b, c, d, a, M_offset_0, 20, T[19]); - a = GG(a, b, c, d, M_offset_5, 5, T[20]); - d = GG(d, a, b, c, M_offset_10, 9, T[21]); - c = GG(c, d, a, b, M_offset_15, 14, T[22]); - b = GG(b, c, d, a, M_offset_4, 20, T[23]); - a = GG(a, b, c, d, M_offset_9, 5, T[24]); - d = GG(d, a, b, c, M_offset_14, 9, T[25]); - c = GG(c, d, a, b, M_offset_3, 14, T[26]); - b = GG(b, c, d, a, M_offset_8, 20, T[27]); - a = GG(a, b, c, d, M_offset_13, 5, T[28]); - d = GG(d, a, b, c, M_offset_2, 9, T[29]); - c = GG(c, d, a, b, M_offset_7, 14, T[30]); - b = GG(b, c, d, a, M_offset_12, 20, T[31]); - - a = HH(a, b, c, d, M_offset_5, 4, T[32]); - d = HH(d, a, b, c, M_offset_8, 11, T[33]); - c = HH(c, d, a, b, M_offset_11, 16, T[34]); - b = HH(b, c, d, a, M_offset_14, 23, T[35]); - a = HH(a, b, c, d, M_offset_1, 4, T[36]); - d = HH(d, a, b, c, M_offset_4, 11, T[37]); - c = HH(c, d, a, b, M_offset_7, 16, T[38]); - b = HH(b, c, d, a, M_offset_10, 23, T[39]); - a = HH(a, b, c, d, M_offset_13, 4, T[40]); - d = HH(d, a, b, c, M_offset_0, 11, T[41]); - c = HH(c, d, a, b, M_offset_3, 16, T[42]); - b = HH(b, c, d, a, M_offset_6, 23, T[43]); - a = HH(a, b, c, d, M_offset_9, 4, T[44]); - d = HH(d, a, b, c, M_offset_12, 11, T[45]); - c = HH(c, d, a, b, M_offset_15, 16, T[46]); - b = HH(b, c, d, a, M_offset_2, 23, T[47]); - - a = II(a, b, c, d, M_offset_0, 6, T[48]); - d = II(d, a, b, c, M_offset_7, 10, T[49]); - c = II(c, d, a, b, M_offset_14, 15, T[50]); - b = II(b, c, d, a, M_offset_5, 21, T[51]); - a = II(a, b, c, d, M_offset_12, 6, T[52]); - d = II(d, a, b, c, M_offset_3, 10, T[53]); - c = II(c, d, a, b, M_offset_10, 15, T[54]); - b = II(b, c, d, a, M_offset_1, 21, T[55]); - a = II(a, b, c, d, M_offset_8, 6, T[56]); - d = II(d, a, b, c, M_offset_15, 10, T[57]); - c = II(c, d, a, b, M_offset_6, 15, T[58]); - b = II(b, c, d, a, M_offset_13, 21, T[59]); - a = II(a, b, c, d, M_offset_4, 6, T[60]); - d = II(d, a, b, c, M_offset_11, 10, T[61]); - c = II(c, d, a, b, M_offset_2, 15, T[62]); - b = II(b, c, d, a, M_offset_9, 21, T[63]); - - // Intermediate hash value - H[0] = (H[0] + a) | 0; - H[1] = (H[1] + b) | 0; - H[2] = (H[2] + c) | 0; - H[3] = (H[3] + d) | 0; - }, - - _doFinalize: function () { - // Shortcuts - var data = this._data; - var dataWords = data.words; - - var nBitsTotal = this._nDataBytes * 8; - var nBitsLeft = data.sigBytes * 8; - - // Add padding - dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); - - var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000); - var nBitsTotalL = nBitsTotal; - dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = ( - (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) | - (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00) - ); - dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = ( - (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) | - (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00) - ); - - data.sigBytes = (dataWords.length + 1) * 4; - - // Hash final blocks - this._process(); - - // Shortcuts - var hash = this._hash; - var H = hash.words; - - // Swap endian - for (var i = 0; i < 4; i++) { - // Shortcut - var H_i = H[i]; - - H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) | - (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00); - } - - // Return final computed hash - return hash; - }, - - clone: function () { - var clone = Hasher.clone.call(this); - clone._hash = this._hash.clone(); - - return clone; - } - }); - - function FF(a, b, c, d, x, s, t) { - var n = a + ((b & c) | (~b & d)) + x + t; - return ((n << s) | (n >>> (32 - s))) + b; - } - - function GG(a, b, c, d, x, s, t) { - var n = a + ((b & d) | (c & ~d)) + x + t; - return ((n << s) | (n >>> (32 - s))) + b; - } - - function HH(a, b, c, d, x, s, t) { - var n = a + (b ^ c ^ d) + x + t; - return ((n << s) | (n >>> (32 - s))) + b; - } - - function II(a, b, c, d, x, s, t) { - var n = a + (c ^ (b | ~d)) + x + t; - return ((n << s) | (n >>> (32 - s))) + b; - } - - /** - * Shortcut function to the hasher's object interface. - * - * @param {WordArray|string} message The message to hash. - * - * @return {WordArray} The hash. - * - * @static - * - * @example - * - * var hash = CryptoJS.MD5('message'); - * var hash = CryptoJS.MD5(wordArray); - */ - C.MD5 = Hasher._createHelper(MD5); - - /** - * Shortcut function to the HMAC's object interface. - * - * @param {WordArray|string} message The message to hash. - * @param {WordArray|string} key The secret key. - * - * @return {WordArray} The HMAC. - * - * @static - * - * @example - * - * var hmac = CryptoJS.HmacMD5(message, key); - */ - C.HmacMD5 = Hasher._createHmacHelper(MD5); - }(Math)); - - - return CryptoJS.MD5; - -})); - -/***/ }), -/* 71 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9)); - } - else {} -}(this, function (CryptoJS) { - - (function () { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var WordArray = C_lib.WordArray; - var Hasher = C_lib.Hasher; - var C_algo = C.algo; - - // Reusable object - var W = []; - - /** - * SHA-1 hash algorithm. - */ - var SHA1 = C_algo.SHA1 = Hasher.extend({ - _doReset: function () { - this._hash = new WordArray.init([ - 0x67452301, 0xefcdab89, - 0x98badcfe, 0x10325476, - 0xc3d2e1f0 - ]); - }, - - _doProcessBlock: function (M, offset) { - // Shortcut - var H = this._hash.words; - - // Working variables - var a = H[0]; - var b = H[1]; - var c = H[2]; - var d = H[3]; - var e = H[4]; - - // Computation - for (var i = 0; i < 80; i++) { - if (i < 16) { - W[i] = M[offset + i] | 0; - } else { - var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]; - W[i] = (n << 1) | (n >>> 31); - } - - var t = ((a << 5) | (a >>> 27)) + e + W[i]; - if (i < 20) { - t += ((b & c) | (~b & d)) + 0x5a827999; - } else if (i < 40) { - t += (b ^ c ^ d) + 0x6ed9eba1; - } else if (i < 60) { - t += ((b & c) | (b & d) | (c & d)) - 0x70e44324; - } else /* if (i < 80) */ { - t += (b ^ c ^ d) - 0x359d3e2a; - } - - e = d; - d = c; - c = (b << 30) | (b >>> 2); - b = a; - a = t; - } - - // Intermediate hash value - H[0] = (H[0] + a) | 0; - H[1] = (H[1] + b) | 0; - H[2] = (H[2] + c) | 0; - H[3] = (H[3] + d) | 0; - H[4] = (H[4] + e) | 0; - }, - - _doFinalize: function () { - // Shortcuts - var data = this._data; - var dataWords = data.words; - - var nBitsTotal = this._nDataBytes * 8; - var nBitsLeft = data.sigBytes * 8; - - // Add padding - dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); - dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000); - dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal; - data.sigBytes = dataWords.length * 4; - - // Hash final blocks - this._process(); - - // Return final computed hash - return this._hash; - }, - - clone: function () { - var clone = Hasher.clone.call(this); - clone._hash = this._hash.clone(); - - return clone; - } - }); - - /** - * Shortcut function to the hasher's object interface. - * - * @param {WordArray|string} message The message to hash. - * - * @return {WordArray} The hash. - * - * @static - * - * @example - * - * var hash = CryptoJS.SHA1('message'); - * var hash = CryptoJS.SHA1(wordArray); - */ - C.SHA1 = Hasher._createHelper(SHA1); - - /** - * Shortcut function to the HMAC's object interface. - * - * @param {WordArray|string} message The message to hash. - * @param {WordArray|string} key The secret key. - * - * @return {WordArray} The HMAC. - * - * @static - * - * @example - * - * var hmac = CryptoJS.HmacSHA1(message, key); - */ - C.HmacSHA1 = Hasher._createHmacHelper(SHA1); - }()); - - - return CryptoJS.SHA1; - -})); - -/***/ }), -/* 72 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9)); - } - else {} -}(this, function (CryptoJS) { - - (function () { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var Base = C_lib.Base; - var C_enc = C.enc; - var Utf8 = C_enc.Utf8; - var C_algo = C.algo; - - /** - * HMAC algorithm. - */ - var HMAC = C_algo.HMAC = Base.extend({ - /** - * Initializes a newly created HMAC. - * - * @param {Hasher} hasher The hash algorithm to use. - * @param {WordArray|string} key The secret key. - * - * @example - * - * var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key); - */ - init: function (hasher, key) { - // Init hasher - hasher = this._hasher = new hasher.init(); - - // Convert string to WordArray, else assume WordArray already - if (typeof key == 'string') { - key = Utf8.parse(key); - } - - // Shortcuts - var hasherBlockSize = hasher.blockSize; - var hasherBlockSizeBytes = hasherBlockSize * 4; - - // Allow arbitrary length keys - if (key.sigBytes > hasherBlockSizeBytes) { - key = hasher.finalize(key); - } - - // Clamp excess bits - key.clamp(); - - // Clone key for inner and outer pads - var oKey = this._oKey = key.clone(); - var iKey = this._iKey = key.clone(); - - // Shortcuts - var oKeyWords = oKey.words; - var iKeyWords = iKey.words; - - // XOR keys with pad constants - for (var i = 0; i < hasherBlockSize; i++) { - oKeyWords[i] ^= 0x5c5c5c5c; - iKeyWords[i] ^= 0x36363636; - } - oKey.sigBytes = iKey.sigBytes = hasherBlockSizeBytes; - - // Set initial values - this.reset(); - }, - - /** - * Resets this HMAC to its initial state. - * - * @example - * - * hmacHasher.reset(); - */ - reset: function () { - // Shortcut - var hasher = this._hasher; - - // Reset - hasher.reset(); - hasher.update(this._iKey); - }, - - /** - * Updates this HMAC with a message. - * - * @param {WordArray|string} messageUpdate The message to append. - * - * @return {HMAC} This HMAC instance. - * - * @example - * - * hmacHasher.update('message'); - * hmacHasher.update(wordArray); - */ - update: function (messageUpdate) { - this._hasher.update(messageUpdate); - - // Chainable - return this; - }, - - /** - * Finalizes the HMAC computation. - * Note that the finalize operation is effectively a destructive, read-once operation. - * - * @param {WordArray|string} messageUpdate (Optional) A final message update. - * - * @return {WordArray} The HMAC. - * - * @example - * - * var hmac = hmacHasher.finalize(); - * var hmac = hmacHasher.finalize('message'); - * var hmac = hmacHasher.finalize(wordArray); - */ - finalize: function (messageUpdate) { - // Shortcut - var hasher = this._hasher; - - // Compute HMAC - var innerHash = hasher.finalize(messageUpdate); - hasher.reset(); - var hmac = hasher.finalize(this._oKey.clone().concat(innerHash)); - - return hmac; - } - }); - }()); - - -})); - -/***/ }), -/* 73 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory, undef) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9), __webpack_require__(37)); - } - else {} -}(this, function (CryptoJS) { - - /** - * Cipher core components. - */ - CryptoJS.lib.Cipher || (function (undefined) { - // Shortcuts - var C = CryptoJS; - var C_lib = C.lib; - var Base = C_lib.Base; - var WordArray = C_lib.WordArray; - var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm; - var C_enc = C.enc; - var Utf8 = C_enc.Utf8; - var Base64 = C_enc.Base64; - var C_algo = C.algo; - var EvpKDF = C_algo.EvpKDF; - - /** - * Abstract base cipher template. - * - * @property {number} keySize This cipher's key size. Default: 4 (128 bits) - * @property {number} ivSize This cipher's IV size. Default: 4 (128 bits) - * @property {number} _ENC_XFORM_MODE A constant representing encryption mode. - * @property {number} _DEC_XFORM_MODE A constant representing decryption mode. - */ - var Cipher = C_lib.Cipher = BufferedBlockAlgorithm.extend({ - /** - * Configuration options. - * - * @property {WordArray} iv The IV to use for this operation. - */ - cfg: Base.extend(), - - /** - * Creates this cipher in encryption mode. - * - * @param {WordArray} key The key. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @return {Cipher} A cipher instance. - * - * @static - * - * @example - * - * var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray }); - */ - createEncryptor: function (key, cfg) { - return this.create(this._ENC_XFORM_MODE, key, cfg); - }, - - /** - * Creates this cipher in decryption mode. - * - * @param {WordArray} key The key. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @return {Cipher} A cipher instance. - * - * @static - * - * @example - * - * var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray }); - */ - createDecryptor: function (key, cfg) { - return this.create(this._DEC_XFORM_MODE, key, cfg); - }, - - /** - * Initializes a newly created cipher. - * - * @param {number} xformMode Either the encryption or decryption transormation mode constant. - * @param {WordArray} key The key. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @example - * - * var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray }); - */ - init: function (xformMode, key, cfg) { - // Apply config defaults - this.cfg = this.cfg.extend(cfg); - - // Store transform mode and key - this._xformMode = xformMode; - this._key = key; - - // Set initial values - this.reset(); - }, - - /** - * Resets this cipher to its initial state. - * - * @example - * - * cipher.reset(); - */ - reset: function () { - // Reset data buffer - BufferedBlockAlgorithm.reset.call(this); - - // Perform concrete-cipher logic - this._doReset(); - }, - - /** - * Adds data to be encrypted or decrypted. - * - * @param {WordArray|string} dataUpdate The data to encrypt or decrypt. - * - * @return {WordArray} The data after processing. - * - * @example - * - * var encrypted = cipher.process('data'); - * var encrypted = cipher.process(wordArray); - */ - process: function (dataUpdate) { - // Append - this._append(dataUpdate); - - // Process available blocks - return this._process(); - }, - - /** - * Finalizes the encryption or decryption process. - * Note that the finalize operation is effectively a destructive, read-once operation. - * - * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt. - * - * @return {WordArray} The data after final processing. - * - * @example - * - * var encrypted = cipher.finalize(); - * var encrypted = cipher.finalize('data'); - * var encrypted = cipher.finalize(wordArray); - */ - finalize: function (dataUpdate) { - // Final data update - if (dataUpdate) { - this._append(dataUpdate); - } - - // Perform concrete-cipher logic - var finalProcessedData = this._doFinalize(); - - return finalProcessedData; - }, - - keySize: 128/32, - - ivSize: 128/32, - - _ENC_XFORM_MODE: 1, - - _DEC_XFORM_MODE: 2, - - /** - * Creates shortcut functions to a cipher's object interface. - * - * @param {Cipher} cipher The cipher to create a helper for. - * - * @return {Object} An object with encrypt and decrypt shortcut functions. - * - * @static - * - * @example - * - * var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES); - */ - _createHelper: (function () { - function selectCipherStrategy(key) { - if (typeof key == 'string') { - return PasswordBasedCipher; - } else { - return SerializableCipher; - } - } - - return function (cipher) { - return { - encrypt: function (message, key, cfg) { - return selectCipherStrategy(key).encrypt(cipher, message, key, cfg); - }, - - decrypt: function (ciphertext, key, cfg) { - return selectCipherStrategy(key).decrypt(cipher, ciphertext, key, cfg); - } - }; - }; - }()) - }); - - /** - * Abstract base stream cipher template. - * - * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 1 (32 bits) - */ - var StreamCipher = C_lib.StreamCipher = Cipher.extend({ - _doFinalize: function () { - // Process partial blocks - var finalProcessedBlocks = this._process(!!'flush'); - - return finalProcessedBlocks; - }, - - blockSize: 1 - }); - - /** - * Mode namespace. - */ - var C_mode = C.mode = {}; - - /** - * Abstract base block cipher mode template. - */ - var BlockCipherMode = C_lib.BlockCipherMode = Base.extend({ - /** - * Creates this mode for encryption. - * - * @param {Cipher} cipher A block cipher instance. - * @param {Array} iv The IV words. - * - * @static - * - * @example - * - * var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words); - */ - createEncryptor: function (cipher, iv) { - return this.Encryptor.create(cipher, iv); - }, - - /** - * Creates this mode for decryption. - * - * @param {Cipher} cipher A block cipher instance. - * @param {Array} iv The IV words. - * - * @static - * - * @example - * - * var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words); - */ - createDecryptor: function (cipher, iv) { - return this.Decryptor.create(cipher, iv); - }, - - /** - * Initializes a newly created mode. - * - * @param {Cipher} cipher A block cipher instance. - * @param {Array} iv The IV words. - * - * @example - * - * var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words); - */ - init: function (cipher, iv) { - this._cipher = cipher; - this._iv = iv; - } - }); - - /** - * Cipher Block Chaining mode. - */ - var CBC = C_mode.CBC = (function () { - /** - * Abstract base CBC mode. - */ - var CBC = BlockCipherMode.extend(); - - /** - * CBC encryptor. - */ - CBC.Encryptor = CBC.extend({ - /** - * Processes the data block at offset. - * - * @param {Array} words The data words to operate on. - * @param {number} offset The offset where the block starts. - * - * @example - * - * mode.processBlock(data.words, offset); - */ - processBlock: function (words, offset) { - // Shortcuts - var cipher = this._cipher; - var blockSize = cipher.blockSize; - - // XOR and encrypt - xorBlock.call(this, words, offset, blockSize); - cipher.encryptBlock(words, offset); - - // Remember this block to use with next block - this._prevBlock = words.slice(offset, offset + blockSize); - } - }); - - /** - * CBC decryptor. - */ - CBC.Decryptor = CBC.extend({ - /** - * Processes the data block at offset. - * - * @param {Array} words The data words to operate on. - * @param {number} offset The offset where the block starts. - * - * @example - * - * mode.processBlock(data.words, offset); - */ - processBlock: function (words, offset) { - // Shortcuts - var cipher = this._cipher; - var blockSize = cipher.blockSize; - - // Remember this block to use with next block - var thisBlock = words.slice(offset, offset + blockSize); - - // Decrypt and XOR - cipher.decryptBlock(words, offset); - xorBlock.call(this, words, offset, blockSize); - - // This block becomes the previous block - this._prevBlock = thisBlock; - } - }); - - function xorBlock(words, offset, blockSize) { - var block; - - // Shortcut - var iv = this._iv; - - // Choose mixing block - if (iv) { - block = iv; - - // Remove IV for subsequent blocks - this._iv = undefined; - } else { - block = this._prevBlock; - } - - // XOR blocks - for (var i = 0; i < blockSize; i++) { - words[offset + i] ^= block[i]; - } - } - - return CBC; - }()); - - /** - * Padding namespace. - */ - var C_pad = C.pad = {}; - - /** - * PKCS #5/7 padding strategy. - */ - var Pkcs7 = C_pad.Pkcs7 = { - /** - * Pads data using the algorithm defined in PKCS #5/7. - * - * @param {WordArray} data The data to pad. - * @param {number} blockSize The multiple that the data should be padded to. - * - * @static - * - * @example - * - * CryptoJS.pad.Pkcs7.pad(wordArray, 4); - */ - pad: function (data, blockSize) { - // Shortcut - var blockSizeBytes = blockSize * 4; - - // Count padding bytes - var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes; - - // Create padding word - var paddingWord = (nPaddingBytes << 24) | (nPaddingBytes << 16) | (nPaddingBytes << 8) | nPaddingBytes; - - // Create padding - var paddingWords = []; - for (var i = 0; i < nPaddingBytes; i += 4) { - paddingWords.push(paddingWord); - } - var padding = WordArray.create(paddingWords, nPaddingBytes); - - // Add padding - data.concat(padding); - }, - - /** - * Unpads data that had been padded using the algorithm defined in PKCS #5/7. - * - * @param {WordArray} data The data to unpad. - * - * @static - * - * @example - * - * CryptoJS.pad.Pkcs7.unpad(wordArray); - */ - unpad: function (data) { - // Get number of padding bytes from last byte - var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff; - - // Remove padding - data.sigBytes -= nPaddingBytes; - } - }; - - /** - * Abstract base block cipher template. - * - * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 4 (128 bits) - */ - var BlockCipher = C_lib.BlockCipher = Cipher.extend({ - /** - * Configuration options. - * - * @property {Mode} mode The block mode to use. Default: CBC - * @property {Padding} padding The padding strategy to use. Default: Pkcs7 - */ - cfg: Cipher.cfg.extend({ - mode: CBC, - padding: Pkcs7 - }), - - reset: function () { - var modeCreator; - - // Reset cipher - Cipher.reset.call(this); - - // Shortcuts - var cfg = this.cfg; - var iv = cfg.iv; - var mode = cfg.mode; - - // Reset block mode - if (this._xformMode == this._ENC_XFORM_MODE) { - modeCreator = mode.createEncryptor; - } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ { - modeCreator = mode.createDecryptor; - // Keep at least one block in the buffer for unpadding - this._minBufferSize = 1; - } - - if (this._mode && this._mode.__creator == modeCreator) { - this._mode.init(this, iv && iv.words); - } else { - this._mode = modeCreator.call(mode, this, iv && iv.words); - this._mode.__creator = modeCreator; - } - }, - - _doProcessBlock: function (words, offset) { - this._mode.processBlock(words, offset); - }, - - _doFinalize: function () { - var finalProcessedBlocks; - - // Shortcut - var padding = this.cfg.padding; - - // Finalize - if (this._xformMode == this._ENC_XFORM_MODE) { - // Pad data - padding.pad(this._data, this.blockSize); - - // Process final blocks - finalProcessedBlocks = this._process(!!'flush'); - } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ { - // Process final blocks - finalProcessedBlocks = this._process(!!'flush'); - - // Unpad data - padding.unpad(finalProcessedBlocks); - } - - return finalProcessedBlocks; - }, - - blockSize: 128/32 - }); - - /** - * A collection of cipher parameters. - * - * @property {WordArray} ciphertext The raw ciphertext. - * @property {WordArray} key The key to this ciphertext. - * @property {WordArray} iv The IV used in the ciphering operation. - * @property {WordArray} salt The salt used with a key derivation function. - * @property {Cipher} algorithm The cipher algorithm. - * @property {Mode} mode The block mode used in the ciphering operation. - * @property {Padding} padding The padding scheme used in the ciphering operation. - * @property {number} blockSize The block size of the cipher. - * @property {Format} formatter The default formatting strategy to convert this cipher params object to a string. - */ - var CipherParams = C_lib.CipherParams = Base.extend({ - /** - * Initializes a newly created cipher params object. - * - * @param {Object} cipherParams An object with any of the possible cipher parameters. - * - * @example - * - * var cipherParams = CryptoJS.lib.CipherParams.create({ - * ciphertext: ciphertextWordArray, - * key: keyWordArray, - * iv: ivWordArray, - * salt: saltWordArray, - * algorithm: CryptoJS.algo.AES, - * mode: CryptoJS.mode.CBC, - * padding: CryptoJS.pad.PKCS7, - * blockSize: 4, - * formatter: CryptoJS.format.OpenSSL - * }); - */ - init: function (cipherParams) { - this.mixIn(cipherParams); - }, - - /** - * Converts this cipher params object to a string. - * - * @param {Format} formatter (Optional) The formatting strategy to use. - * - * @return {string} The stringified cipher params. - * - * @throws Error If neither the formatter nor the default formatter is set. - * - * @example - * - * var string = cipherParams + ''; - * var string = cipherParams.toString(); - * var string = cipherParams.toString(CryptoJS.format.OpenSSL); - */ - toString: function (formatter) { - return (formatter || this.formatter).stringify(this); - } - }); - - /** - * Format namespace. - */ - var C_format = C.format = {}; - - /** - * OpenSSL formatting strategy. - */ - var OpenSSLFormatter = C_format.OpenSSL = { - /** - * Converts a cipher params object to an OpenSSL-compatible string. - * - * @param {CipherParams} cipherParams The cipher params object. - * - * @return {string} The OpenSSL-compatible string. - * - * @static - * - * @example - * - * var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams); - */ - stringify: function (cipherParams) { - var wordArray; - - // Shortcuts - var ciphertext = cipherParams.ciphertext; - var salt = cipherParams.salt; - - // Format - if (salt) { - wordArray = WordArray.create([0x53616c74, 0x65645f5f]).concat(salt).concat(ciphertext); - } else { - wordArray = ciphertext; - } - - return wordArray.toString(Base64); - }, - - /** - * Converts an OpenSSL-compatible string to a cipher params object. - * - * @param {string} openSSLStr The OpenSSL-compatible string. - * - * @return {CipherParams} The cipher params object. - * - * @static - * - * @example - * - * var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString); - */ - parse: function (openSSLStr) { - var salt; - - // Parse base64 - var ciphertext = Base64.parse(openSSLStr); - - // Shortcut - var ciphertextWords = ciphertext.words; - - // Test for salt - if (ciphertextWords[0] == 0x53616c74 && ciphertextWords[1] == 0x65645f5f) { - // Extract salt - salt = WordArray.create(ciphertextWords.slice(2, 4)); - - // Remove salt from ciphertext - ciphertextWords.splice(0, 4); - ciphertext.sigBytes -= 16; - } - - return CipherParams.create({ ciphertext: ciphertext, salt: salt }); - } - }; - - /** - * A cipher wrapper that returns ciphertext as a serializable cipher params object. - */ - var SerializableCipher = C_lib.SerializableCipher = Base.extend({ - /** - * Configuration options. - * - * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL - */ - cfg: Base.extend({ - format: OpenSSLFormatter - }), - - /** - * Encrypts a message. - * - * @param {Cipher} cipher The cipher algorithm to use. - * @param {WordArray|string} message The message to encrypt. - * @param {WordArray} key The key. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @return {CipherParams} A cipher params object. - * - * @static - * - * @example - * - * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key); - * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv }); - * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL }); - */ - encrypt: function (cipher, message, key, cfg) { - // Apply config defaults - cfg = this.cfg.extend(cfg); - - // Encrypt - var encryptor = cipher.createEncryptor(key, cfg); - var ciphertext = encryptor.finalize(message); - - // Shortcut - var cipherCfg = encryptor.cfg; - - // Create and return serializable cipher params - return CipherParams.create({ - ciphertext: ciphertext, - key: key, - iv: cipherCfg.iv, - algorithm: cipher, - mode: cipherCfg.mode, - padding: cipherCfg.padding, - blockSize: cipher.blockSize, - formatter: cfg.format - }); - }, - - /** - * Decrypts serialized ciphertext. - * - * @param {Cipher} cipher The cipher algorithm to use. - * @param {CipherParams|string} ciphertext The ciphertext to decrypt. - * @param {WordArray} key The key. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @return {WordArray} The plaintext. - * - * @static - * - * @example - * - * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL }); - * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL }); - */ - decrypt: function (cipher, ciphertext, key, cfg) { - // Apply config defaults - cfg = this.cfg.extend(cfg); - - // Convert string to CipherParams - ciphertext = this._parse(ciphertext, cfg.format); - - // Decrypt - var plaintext = cipher.createDecryptor(key, cfg).finalize(ciphertext.ciphertext); - - return plaintext; - }, - - /** - * Converts serialized ciphertext to CipherParams, - * else assumed CipherParams already and returns ciphertext unchanged. - * - * @param {CipherParams|string} ciphertext The ciphertext. - * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext. - * - * @return {CipherParams} The unserialized ciphertext. - * - * @static - * - * @example - * - * var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format); - */ - _parse: function (ciphertext, format) { - if (typeof ciphertext == 'string') { - return format.parse(ciphertext, this); - } else { - return ciphertext; - } - } - }); - - /** - * Key derivation function namespace. - */ - var C_kdf = C.kdf = {}; - - /** - * OpenSSL key derivation function. - */ - var OpenSSLKdf = C_kdf.OpenSSL = { - /** - * Derives a key and IV from a password. - * - * @param {string} password The password to derive from. - * @param {number} keySize The size in words of the key to generate. - * @param {number} ivSize The size in words of the IV to generate. - * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly. - * - * @return {CipherParams} A cipher params object with the key, IV, and salt. - * - * @static - * - * @example - * - * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32); - * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt'); - */ - execute: function (password, keySize, ivSize, salt) { - // Generate random salt - if (!salt) { - salt = WordArray.random(64/8); - } - - // Derive key and IV - var key = EvpKDF.create({ keySize: keySize + ivSize }).compute(password, salt); - - // Separate key and IV - var iv = WordArray.create(key.words.slice(keySize), ivSize * 4); - key.sigBytes = keySize * 4; - - // Return params - return CipherParams.create({ key: key, iv: iv, salt: salt }); - } - }; - - /** - * A serializable cipher wrapper that derives the key from a password, - * and returns ciphertext as a serializable cipher params object. - */ - var PasswordBasedCipher = C_lib.PasswordBasedCipher = SerializableCipher.extend({ - /** - * Configuration options. - * - * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL - */ - cfg: SerializableCipher.cfg.extend({ - kdf: OpenSSLKdf - }), - - /** - * Encrypts a message using a password. - * - * @param {Cipher} cipher The cipher algorithm to use. - * @param {WordArray|string} message The message to encrypt. - * @param {string} password The password. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @return {CipherParams} A cipher params object. - * - * @static - * - * @example - * - * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password'); - * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL }); - */ - encrypt: function (cipher, message, password, cfg) { - // Apply config defaults - cfg = this.cfg.extend(cfg); - - // Derive key and other params - var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize); - - // Add IV to config - cfg.iv = derivedParams.iv; - - // Encrypt - var ciphertext = SerializableCipher.encrypt.call(this, cipher, message, derivedParams.key, cfg); - - // Mix in derived params - ciphertext.mixIn(derivedParams); - - return ciphertext; - }, - - /** - * Decrypts serialized ciphertext using a password. - * - * @param {Cipher} cipher The cipher algorithm to use. - * @param {CipherParams|string} ciphertext The ciphertext to decrypt. - * @param {string} password The password. - * @param {Object} cfg (Optional) The configuration options to use for this operation. - * - * @return {WordArray} The plaintext. - * - * @static - * - * @example - * - * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL }); - * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL }); - */ - decrypt: function (cipher, ciphertext, password, cfg) { - // Apply config defaults - cfg = this.cfg.extend(cfg); - - // Convert string to CipherParams - ciphertext = this._parse(ciphertext, cfg.format); - - // Derive key and other params - var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize, ciphertext.salt); - - // Add IV to config - cfg.iv = derivedParams.iv; - - // Decrypt - var plaintext = SerializableCipher.decrypt.call(this, cipher, ciphertext, derivedParams.key, cfg); - - return plaintext; - } - }); - }()); - - -})); - -/***/ }), -/* 74 */ -/***/ (function(module, exports, __webpack_require__) { - -;(function (root, factory) { - if (true) { - // CommonJS - module.exports = exports = factory(__webpack_require__(9)); - } - else {} -}(this, function (CryptoJS) { - - return CryptoJS.enc.Utf8; - -})); - -/***/ }), -/* 75 */ -/***/ ((module) => { - -if (typeof Object.create === 'function') { - // implementation from standard node.js 'util' module - module.exports = function inherits(ctor, superCtor) { - if (superCtor) { - ctor.super_ = superCtor - ctor.prototype = Object.create(superCtor.prototype, { - constructor: { - value: ctor, - enumerable: false, - writable: true, - configurable: true - } - }) - } - }; -} else { - // old school shim for old browsers - module.exports = function inherits(ctor, superCtor) { - if (superCtor) { - ctor.super_ = superCtor - var TempCtor = function () {} - TempCtor.prototype = superCtor.prototype - ctor.prototype = new TempCtor() - ctor.prototype.constructor = ctor - } - } -} - - -/***/ }), -/* 76 */ -/***/ ((module, exports, __webpack_require__) => { - -/* eslint-disable node/no-deprecated-api */ -var buffer = __webpack_require__(10) -var Buffer = buffer.Buffer - -// alternative to using Object.keys for old browsers -function copyProps (src, dst) { - for (var key in src) { - dst[key] = src[key] - } -} -if (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) { - module.exports = buffer -} else { - // Copy properties from require('buffer') - copyProps(buffer, exports) - exports.Buffer = SafeBuffer -} - -function SafeBuffer (arg, encodingOrOffset, length) { - return Buffer(arg, encodingOrOffset, length) -} - -SafeBuffer.prototype = Object.create(Buffer.prototype) - -// Copy static methods from Buffer -copyProps(Buffer, SafeBuffer) - -SafeBuffer.from = function (arg, encodingOrOffset, length) { - if (typeof arg === 'number') { - throw new TypeError('Argument must not be a number') - } - return Buffer(arg, encodingOrOffset, length) -} - -SafeBuffer.alloc = function (size, fill, encoding) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - var buf = Buffer(size) - if (fill !== undefined) { - if (typeof encoding === 'string') { - buf.fill(fill, encoding) - } else { - buf.fill(fill) - } - } else { - buf.fill(0) - } - return buf -} - -SafeBuffer.allocUnsafe = function (size) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - return Buffer(size) -} - -SafeBuffer.allocUnsafeSlow = function (size) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - return buffer.SlowBuffer(size) -} - - -/***/ }), -/* 77 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var protobuf = module.exports = __webpack_require__(78); - -protobuf.build = "light"; - -/** - * A node-style callback as used by {@link load} and {@link Root#load}. - * @typedef LoadCallback - * @type {function} - * @param {Error|null} error Error, if any, otherwise `null` - * @param {Root} [root] Root, if there hasn't been an error - * @returns {undefined} - */ - -/** - * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback. - * @param {string|string[]} filename One or multiple files to load - * @param {Root} root Root namespace, defaults to create a new one if omitted. - * @param {LoadCallback} callback Callback function - * @returns {undefined} - * @see {@link Root#load} - */ -function load(filename, root, callback) { - if (typeof root === "function") { - callback = root; - root = new protobuf.Root(); - } else if (!root) - root = new protobuf.Root(); - return root.load(filename, callback); -} - -/** - * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback. - * @name load - * @function - * @param {string|string[]} filename One or multiple files to load - * @param {LoadCallback} callback Callback function - * @returns {undefined} - * @see {@link Root#load} - * @variation 2 - */ -// function load(filename:string, callback:LoadCallback):undefined - -/** - * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise. - * @name load - * @function - * @param {string|string[]} filename One or multiple files to load - * @param {Root} [root] Root namespace, defaults to create a new one if omitted. - * @returns {Promise} Promise - * @see {@link Root#load} - * @variation 3 - */ -// function load(filename:string, [root:Root]):Promise - -protobuf.load = load; - -/** - * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only). - * @param {string|string[]} filename One or multiple files to load - * @param {Root} [root] Root namespace, defaults to create a new one if omitted. - * @returns {Root} Root namespace - * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid - * @see {@link Root#loadSync} - */ -function loadSync(filename, root) { - if (!root) - root = new protobuf.Root(); - return root.loadSync(filename); -} - -protobuf.loadSync = loadSync; - -// Serialization -protobuf.encoder = __webpack_require__(42); -protobuf.decoder = __webpack_require__(43); -protobuf.verifier = __webpack_require__(44); -protobuf.converter = __webpack_require__(45); - -// Reflection -protobuf.ReflectionObject = __webpack_require__(13); -protobuf.Namespace = __webpack_require__(16); -protobuf.Root = __webpack_require__(28); -protobuf.Enum = __webpack_require__(3); -protobuf.Type = __webpack_require__(23); -protobuf.Field = __webpack_require__(11); -protobuf.OneOf = __webpack_require__(18); -protobuf.MapField = __webpack_require__(24); -protobuf.Service = __webpack_require__(25); -protobuf.Method = __webpack_require__(26); - -// Runtime -protobuf.Message = __webpack_require__(27); -protobuf.wrappers = __webpack_require__(46); - -// Utility -protobuf.types = __webpack_require__(14); -protobuf.util = __webpack_require__(0); - -// Set up possibly cyclic reflection dependencies -protobuf.ReflectionObject._configure(protobuf.Root); -protobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum); -protobuf.Root._configure(protobuf.Type); -protobuf.Field._configure(protobuf.Type); - - -/***/ }), -/* 78 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -var protobuf = exports; - -/** - * Build type, one of `"full"`, `"light"` or `"minimal"`. - * @name build - * @type {string} - * @const - */ -protobuf.build = "minimal"; - -// Serialization -protobuf.Writer = __webpack_require__(21); -protobuf.BufferWriter = __webpack_require__(85); -protobuf.Reader = __webpack_require__(22); -protobuf.BufferReader = __webpack_require__(86); - -// Utility -protobuf.util = __webpack_require__(5); -protobuf.rpc = __webpack_require__(40); -protobuf.roots = __webpack_require__(41); -protobuf.configure = configure; - -/* istanbul ignore next */ -/** - * Reconfigures the library according to the environment. - * @returns {undefined} - */ -function configure() { - protobuf.Reader._configure(protobuf.BufferReader); - protobuf.util._configure(); -} - -// Set up buffer utility according to the environment -protobuf.Writer._configure(protobuf.BufferWriter); -configure(); - - -/***/ }), -/* 79 */ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -/** - * A minimal base64 implementation for number arrays. - * @memberof util - * @namespace - */ -var base64 = exports; - -/** - * Calculates the byte length of a base64 encoded string. - * @param {string} string Base64 encoded string - * @returns {number} Byte length - */ -base64.length = function length(string) { - var p = string.length; - if (!p) - return 0; - var n = 0; - while (--p % 4 > 1 && string.charAt(p) === "=") - ++n; - return Math.ceil(string.length * 3) / 4 - n; -}; - -// Base64 encoding table -var b64 = new Array(64); - -// Base64 decoding table -var s64 = new Array(123); - -// 65..90, 97..122, 48..57, 43, 47 -for (var i = 0; i < 64;) - s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++; - -/** - * Encodes a buffer to a base64 encoded string. - * @param {Uint8Array} buffer Source buffer - * @param {number} start Source start - * @param {number} end Source end - * @returns {string} Base64 encoded string - */ -base64.encode = function encode(buffer, start, end) { - var parts = null, - chunk = []; - var i = 0, // output index - j = 0, // goto index - t; // temporary - while (start < end) { - var b = buffer[start++]; - switch (j) { - case 0: - chunk[i++] = b64[b >> 2]; - t = (b & 3) << 4; - j = 1; - break; - case 1: - chunk[i++] = b64[t | b >> 4]; - t = (b & 15) << 2; - j = 2; - break; - case 2: - chunk[i++] = b64[t | b >> 6]; - chunk[i++] = b64[b & 63]; - j = 0; - break; - } - if (i > 8191) { - (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk)); - i = 0; - } - } - if (j) { - chunk[i++] = b64[t]; - chunk[i++] = 61; - if (j === 1) - chunk[i++] = 61; - } - if (parts) { - if (i) - parts.push(String.fromCharCode.apply(String, chunk.slice(0, i))); - return parts.join(""); - } - return String.fromCharCode.apply(String, chunk.slice(0, i)); -}; - -var invalidEncoding = "invalid encoding"; - -/** - * Decodes a base64 encoded string to a buffer. - * @param {string} string Source string - * @param {Uint8Array} buffer Destination buffer - * @param {number} offset Destination offset - * @returns {number} Number of bytes written - * @throws {Error} If encoding is invalid - */ -base64.decode = function decode(string, buffer, offset) { - var start = offset; - var j = 0, // goto index - t; // temporary - for (var i = 0; i < string.length;) { - var c = string.charCodeAt(i++); - if (c === 61 && j > 1) - break; - if ((c = s64[c]) === undefined) - throw Error(invalidEncoding); - switch (j) { - case 0: - t = c; - j = 1; - break; - case 1: - buffer[offset++] = t << 2 | (c & 48) >> 4; - t = c; - j = 2; - break; - case 2: - buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2; - t = c; - j = 3; - break; - case 3: - buffer[offset++] = (t & 3) << 6 | c; - j = 0; - break; - } - } - if (j === 1) - throw Error(invalidEncoding); - return offset - start; -}; - -/** - * Tests if the specified string appears to be base64 encoded. - * @param {string} string String to test - * @returns {boolean} `true` if probably base64 encoded, otherwise false - */ -base64.test = function test(string) { - return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string); -}; - - -/***/ }), -/* 80 */ -/***/ ((module) => { - -"use strict"; - -module.exports = EventEmitter; - -/** - * Constructs a new event emitter instance. - * @classdesc A minimal event emitter. - * @memberof util - * @constructor - */ -function EventEmitter() { - - /** - * Registered listeners. - * @type {Object.} - * @private - */ - this._listeners = {}; -} - -/** - * Registers an event listener. - * @param {string} evt Event name - * @param {function} fn Listener - * @param {*} [ctx] Listener context - * @returns {util.EventEmitter} `this` - */ -EventEmitter.prototype.on = function on(evt, fn, ctx) { - (this._listeners[evt] || (this._listeners[evt] = [])).push({ - fn : fn, - ctx : ctx || this - }); - return this; -}; - -/** - * Removes an event listener or any matching listeners if arguments are omitted. - * @param {string} [evt] Event name. Removes all listeners if omitted. - * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted. - * @returns {util.EventEmitter} `this` - */ -EventEmitter.prototype.off = function off(evt, fn) { - if (evt === undefined) - this._listeners = {}; - else { - if (fn === undefined) - this._listeners[evt] = []; - else { - var listeners = this._listeners[evt]; - for (var i = 0; i < listeners.length;) - if (listeners[i].fn === fn) - listeners.splice(i, 1); - else - ++i; - } - } - return this; -}; - -/** - * Emits an event by calling its listeners with the specified arguments. - * @param {string} evt Event name - * @param {...*} args Arguments - * @returns {util.EventEmitter} `this` - */ -EventEmitter.prototype.emit = function emit(evt) { - var listeners = this._listeners[evt]; - if (listeners) { - var args = [], - i = 1; - for (; i < arguments.length;) - args.push(arguments[i++]); - for (i = 0; i < listeners.length;) - listeners[i].fn.apply(listeners[i++].ctx, args); - } - return this; -}; - - -/***/ }), -/* 81 */ -/***/ ((module) => { - -"use strict"; - - -module.exports = factory(factory); - -/** - * Reads / writes floats / doubles from / to buffers. - * @name util.float - * @namespace - */ - -/** - * Writes a 32 bit float to a buffer using little endian byte order. - * @name util.float.writeFloatLE - * @function - * @param {number} val Value to write - * @param {Uint8Array} buf Target buffer - * @param {number} pos Target buffer offset - * @returns {undefined} - */ - -/** - * Writes a 32 bit float to a buffer using big endian byte order. - * @name util.float.writeFloatBE - * @function - * @param {number} val Value to write - * @param {Uint8Array} buf Target buffer - * @param {number} pos Target buffer offset - * @returns {undefined} - */ - -/** - * Reads a 32 bit float from a buffer using little endian byte order. - * @name util.float.readFloatLE - * @function - * @param {Uint8Array} buf Source buffer - * @param {number} pos Source buffer offset - * @returns {number} Value read - */ - -/** - * Reads a 32 bit float from a buffer using big endian byte order. - * @name util.float.readFloatBE - * @function - * @param {Uint8Array} buf Source buffer - * @param {number} pos Source buffer offset - * @returns {number} Value read - */ - -/** - * Writes a 64 bit double to a buffer using little endian byte order. - * @name util.float.writeDoubleLE - * @function - * @param {number} val Value to write - * @param {Uint8Array} buf Target buffer - * @param {number} pos Target buffer offset - * @returns {undefined} - */ - -/** - * Writes a 64 bit double to a buffer using big endian byte order. - * @name util.float.writeDoubleBE - * @function - * @param {number} val Value to write - * @param {Uint8Array} buf Target buffer - * @param {number} pos Target buffer offset - * @returns {undefined} - */ - -/** - * Reads a 64 bit double from a buffer using little endian byte order. - * @name util.float.readDoubleLE - * @function - * @param {Uint8Array} buf Source buffer - * @param {number} pos Source buffer offset - * @returns {number} Value read - */ - -/** - * Reads a 64 bit double from a buffer using big endian byte order. - * @name util.float.readDoubleBE - * @function - * @param {Uint8Array} buf Source buffer - * @param {number} pos Source buffer offset - * @returns {number} Value read - */ - -// Factory function for the purpose of node-based testing in modified global environments -function factory(exports) { - - // float: typed array - if (typeof Float32Array !== "undefined") (function() { - - var f32 = new Float32Array([ -0 ]), - f8b = new Uint8Array(f32.buffer), - le = f8b[3] === 128; - - function writeFloat_f32_cpy(val, buf, pos) { - f32[0] = val; - buf[pos ] = f8b[0]; - buf[pos + 1] = f8b[1]; - buf[pos + 2] = f8b[2]; - buf[pos + 3] = f8b[3]; - } - - function writeFloat_f32_rev(val, buf, pos) { - f32[0] = val; - buf[pos ] = f8b[3]; - buf[pos + 1] = f8b[2]; - buf[pos + 2] = f8b[1]; - buf[pos + 3] = f8b[0]; - } - - /* istanbul ignore next */ - exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev; - /* istanbul ignore next */ - exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy; - - function readFloat_f32_cpy(buf, pos) { - f8b[0] = buf[pos ]; - f8b[1] = buf[pos + 1]; - f8b[2] = buf[pos + 2]; - f8b[3] = buf[pos + 3]; - return f32[0]; - } - - function readFloat_f32_rev(buf, pos) { - f8b[3] = buf[pos ]; - f8b[2] = buf[pos + 1]; - f8b[1] = buf[pos + 2]; - f8b[0] = buf[pos + 3]; - return f32[0]; - } - - /* istanbul ignore next */ - exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev; - /* istanbul ignore next */ - exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy; - - // float: ieee754 - })(); else (function() { - - function writeFloat_ieee754(writeUint, val, buf, pos) { - var sign = val < 0 ? 1 : 0; - if (sign) - val = -val; - if (val === 0) - writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos); - else if (isNaN(val)) - writeUint(2143289344, buf, pos); - else if (val > 3.4028234663852886e+38) // +-Infinity - writeUint((sign << 31 | 2139095040) >>> 0, buf, pos); - else if (val < 1.1754943508222875e-38) // denormal - writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos); - else { - var exponent = Math.floor(Math.log(val) / Math.LN2), - mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607; - writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos); - } - } - - exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE); - exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE); - - function readFloat_ieee754(readUint, buf, pos) { - var uint = readUint(buf, pos), - sign = (uint >> 31) * 2 + 1, - exponent = uint >>> 23 & 255, - mantissa = uint & 8388607; - return exponent === 255 - ? mantissa - ? NaN - : sign * Infinity - : exponent === 0 // denormal - ? sign * 1.401298464324817e-45 * mantissa - : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608); - } - - exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE); - exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE); - - })(); - - // double: typed array - if (typeof Float64Array !== "undefined") (function() { - - var f64 = new Float64Array([-0]), - f8b = new Uint8Array(f64.buffer), - le = f8b[7] === 128; - - function writeDouble_f64_cpy(val, buf, pos) { - f64[0] = val; - buf[pos ] = f8b[0]; - buf[pos + 1] = f8b[1]; - buf[pos + 2] = f8b[2]; - buf[pos + 3] = f8b[3]; - buf[pos + 4] = f8b[4]; - buf[pos + 5] = f8b[5]; - buf[pos + 6] = f8b[6]; - buf[pos + 7] = f8b[7]; - } - - function writeDouble_f64_rev(val, buf, pos) { - f64[0] = val; - buf[pos ] = f8b[7]; - buf[pos + 1] = f8b[6]; - buf[pos + 2] = f8b[5]; - buf[pos + 3] = f8b[4]; - buf[pos + 4] = f8b[3]; - buf[pos + 5] = f8b[2]; - buf[pos + 6] = f8b[1]; - buf[pos + 7] = f8b[0]; - } - - /* istanbul ignore next */ - exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev; - /* istanbul ignore next */ - exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy; - - function readDouble_f64_cpy(buf, pos) { - f8b[0] = buf[pos ]; - f8b[1] = buf[pos + 1]; - f8b[2] = buf[pos + 2]; - f8b[3] = buf[pos + 3]; - f8b[4] = buf[pos + 4]; - f8b[5] = buf[pos + 5]; - f8b[6] = buf[pos + 6]; - f8b[7] = buf[pos + 7]; - return f64[0]; - } - - function readDouble_f64_rev(buf, pos) { - f8b[7] = buf[pos ]; - f8b[6] = buf[pos + 1]; - f8b[5] = buf[pos + 2]; - f8b[4] = buf[pos + 3]; - f8b[3] = buf[pos + 4]; - f8b[2] = buf[pos + 5]; - f8b[1] = buf[pos + 6]; - f8b[0] = buf[pos + 7]; - return f64[0]; - } - - /* istanbul ignore next */ - exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev; - /* istanbul ignore next */ - exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy; - - // double: ieee754 - })(); else (function() { - - function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) { - var sign = val < 0 ? 1 : 0; - if (sign) - val = -val; - if (val === 0) { - writeUint(0, buf, pos + off0); - writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1); - } else if (isNaN(val)) { - writeUint(0, buf, pos + off0); - writeUint(2146959360, buf, pos + off1); - } else if (val > 1.7976931348623157e+308) { // +-Infinity - writeUint(0, buf, pos + off0); - writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1); - } else { - var mantissa; - if (val < 2.2250738585072014e-308) { // denormal - mantissa = val / 5e-324; - writeUint(mantissa >>> 0, buf, pos + off0); - writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1); - } else { - var exponent = Math.floor(Math.log(val) / Math.LN2); - if (exponent === 1024) - exponent = 1023; - mantissa = val * Math.pow(2, -exponent); - writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0); - writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1); - } - } - } - - exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4); - exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0); - - function readDouble_ieee754(readUint, off0, off1, buf, pos) { - var lo = readUint(buf, pos + off0), - hi = readUint(buf, pos + off1); - var sign = (hi >> 31) * 2 + 1, - exponent = hi >>> 20 & 2047, - mantissa = 4294967296 * (hi & 1048575) + lo; - return exponent === 2047 - ? mantissa - ? NaN - : sign * Infinity - : exponent === 0 // denormal - ? sign * 5e-324 * mantissa - : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496); - } - - exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4); - exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0); - - })(); - - return exports; -} - -// uint helpers - -function writeUintLE(val, buf, pos) { - buf[pos ] = val & 255; - buf[pos + 1] = val >>> 8 & 255; - buf[pos + 2] = val >>> 16 & 255; - buf[pos + 3] = val >>> 24; -} - -function writeUintBE(val, buf, pos) { - buf[pos ] = val >>> 24; - buf[pos + 1] = val >>> 16 & 255; - buf[pos + 2] = val >>> 8 & 255; - buf[pos + 3] = val & 255; -} - -function readUintLE(buf, pos) { - return (buf[pos ] - | buf[pos + 1] << 8 - | buf[pos + 2] << 16 - | buf[pos + 3] << 24) >>> 0; -} - -function readUintBE(buf, pos) { - return (buf[pos ] << 24 - | buf[pos + 1] << 16 - | buf[pos + 2] << 8 - | buf[pos + 3]) >>> 0; -} - - -/***/ }), -/* 82 */ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -/** - * A minimal UTF8 implementation for number arrays. - * @memberof util - * @namespace - */ -var utf8 = exports; - -/** - * Calculates the UTF8 byte length of a string. - * @param {string} string String - * @returns {number} Byte length - */ -utf8.length = function utf8_length(string) { - var len = 0, - c = 0; - for (var i = 0; i < string.length; ++i) { - c = string.charCodeAt(i); - if (c < 128) - len += 1; - else if (c < 2048) - len += 2; - else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) { - ++i; - len += 4; - } else - len += 3; - } - return len; -}; - -/** - * Reads UTF8 bytes as a string. - * @param {Uint8Array} buffer Source buffer - * @param {number} start Source start - * @param {number} end Source end - * @returns {string} String read - */ -utf8.read = function utf8_read(buffer, start, end) { - var len = end - start; - if (len < 1) - return ""; - var parts = null, - chunk = [], - i = 0, // char offset - t; // temporary - while (start < end) { - t = buffer[start++]; - if (t < 128) - chunk[i++] = t; - else if (t > 191 && t < 224) - chunk[i++] = (t & 31) << 6 | buffer[start++] & 63; - else if (t > 239 && t < 365) { - t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000; - chunk[i++] = 0xD800 + (t >> 10); - chunk[i++] = 0xDC00 + (t & 1023); - } else - chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63; - if (i > 8191) { - (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk)); - i = 0; - } - } - if (parts) { - if (i) - parts.push(String.fromCharCode.apply(String, chunk.slice(0, i))); - return parts.join(""); - } - return String.fromCharCode.apply(String, chunk.slice(0, i)); -}; - -/** - * Writes a string as UTF8 bytes. - * @param {string} string Source string - * @param {Uint8Array} buffer Destination buffer - * @param {number} offset Destination offset - * @returns {number} Bytes written - */ -utf8.write = function utf8_write(string, buffer, offset) { - var start = offset, - c1, // character 1 - c2; // character 2 - for (var i = 0; i < string.length; ++i) { - c1 = string.charCodeAt(i); - if (c1 < 128) { - buffer[offset++] = c1; - } else if (c1 < 2048) { - buffer[offset++] = c1 >> 6 | 192; - buffer[offset++] = c1 & 63 | 128; - } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) { - c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF); - ++i; - buffer[offset++] = c1 >> 18 | 240; - buffer[offset++] = c1 >> 12 & 63 | 128; - buffer[offset++] = c1 >> 6 & 63 | 128; - buffer[offset++] = c1 & 63 | 128; - } else { - buffer[offset++] = c1 >> 12 | 224; - buffer[offset++] = c1 >> 6 & 63 | 128; - buffer[offset++] = c1 & 63 | 128; - } - } - return offset - start; -}; - - -/***/ }), -/* 83 */ -/***/ ((module) => { - -"use strict"; - -module.exports = pool; - -/** - * An allocator as used by {@link util.pool}. - * @typedef PoolAllocator - * @type {function} - * @param {number} size Buffer size - * @returns {Uint8Array} Buffer - */ - -/** - * A slicer as used by {@link util.pool}. - * @typedef PoolSlicer - * @type {function} - * @param {number} start Start offset - * @param {number} end End offset - * @returns {Uint8Array} Buffer slice - * @this {Uint8Array} - */ - -/** - * A general purpose buffer pool. - * @memberof util - * @function - * @param {PoolAllocator} alloc Allocator - * @param {PoolSlicer} slice Slicer - * @param {number} [size=8192] Slab size - * @returns {PoolAllocator} Pooled allocator - */ -function pool(alloc, slice, size) { - var SIZE = size || 8192; - var MAX = SIZE >>> 1; - var slab = null; - var offset = SIZE; - return function pool_alloc(size) { - if (size < 1 || size > MAX) - return alloc(size); - if (offset + size > SIZE) { - slab = alloc(SIZE); - offset = 0; - } - var buf = slice.call(slab, offset, offset += size); - if (offset & 7) // align to 32 bit - offset = (offset | 7) + 1; - return buf; - }; -} - - -/***/ }), -/* 84 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = LongBits; - -var util = __webpack_require__(5); - -/** - * Constructs new long bits. - * @classdesc Helper class for working with the low and high bits of a 64 bit value. - * @memberof util - * @constructor - * @param {number} lo Low 32 bits, unsigned - * @param {number} hi High 32 bits, unsigned - */ -function LongBits(lo, hi) { - - // note that the casts below are theoretically unnecessary as of today, but older statically - // generated converter code might still call the ctor with signed 32bits. kept for compat. - - /** - * Low bits. - * @type {number} - */ - this.lo = lo >>> 0; - - /** - * High bits. - * @type {number} - */ - this.hi = hi >>> 0; -} - -/** - * Zero bits. - * @memberof util.LongBits - * @type {util.LongBits} - */ -var zero = LongBits.zero = new LongBits(0, 0); - -zero.toNumber = function() { return 0; }; -zero.zzEncode = zero.zzDecode = function() { return this; }; -zero.length = function() { return 1; }; - -/** - * Zero hash. - * @memberof util.LongBits - * @type {string} - */ -var zeroHash = LongBits.zeroHash = "\0\0\0\0\0\0\0\0"; - -/** - * Constructs new long bits from the specified number. - * @param {number} value Value - * @returns {util.LongBits} Instance - */ -LongBits.fromNumber = function fromNumber(value) { - if (value === 0) - return zero; - var sign = value < 0; - if (sign) - value = -value; - var lo = value >>> 0, - hi = (value - lo) / 4294967296 >>> 0; - if (sign) { - hi = ~hi >>> 0; - lo = ~lo >>> 0; - if (++lo > 4294967295) { - lo = 0; - if (++hi > 4294967295) - hi = 0; - } - } - return new LongBits(lo, hi); -}; - -/** - * Constructs new long bits from a number, long or string. - * @param {Long|number|string} value Value - * @returns {util.LongBits} Instance - */ -LongBits.from = function from(value) { - if (typeof value === "number") - return LongBits.fromNumber(value); - if (util.isString(value)) { - /* istanbul ignore else */ - if (util.Long) - value = util.Long.fromString(value); - else - return LongBits.fromNumber(parseInt(value, 10)); - } - return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero; -}; - -/** - * Converts this long bits to a possibly unsafe JavaScript number. - * @param {boolean} [unsigned=false] Whether unsigned or not - * @returns {number} Possibly unsafe number - */ -LongBits.prototype.toNumber = function toNumber(unsigned) { - if (!unsigned && this.hi >>> 31) { - var lo = ~this.lo + 1 >>> 0, - hi = ~this.hi >>> 0; - if (!lo) - hi = hi + 1 >>> 0; - return -(lo + hi * 4294967296); - } - return this.lo + this.hi * 4294967296; -}; - -/** - * Converts this long bits to a long. - * @param {boolean} [unsigned=false] Whether unsigned or not - * @returns {Long} Long - */ -LongBits.prototype.toLong = function toLong(unsigned) { - return util.Long - ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned)) - /* istanbul ignore next */ - : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) }; -}; - -var charCodeAt = String.prototype.charCodeAt; - -/** - * Constructs new long bits from the specified 8 characters long hash. - * @param {string} hash Hash - * @returns {util.LongBits} Bits - */ -LongBits.fromHash = function fromHash(hash) { - if (hash === zeroHash) - return zero; - return new LongBits( - ( charCodeAt.call(hash, 0) - | charCodeAt.call(hash, 1) << 8 - | charCodeAt.call(hash, 2) << 16 - | charCodeAt.call(hash, 3) << 24) >>> 0 - , - ( charCodeAt.call(hash, 4) - | charCodeAt.call(hash, 5) << 8 - | charCodeAt.call(hash, 6) << 16 - | charCodeAt.call(hash, 7) << 24) >>> 0 - ); -}; - -/** - * Converts this long bits to a 8 characters long hash. - * @returns {string} Hash - */ -LongBits.prototype.toHash = function toHash() { - return String.fromCharCode( - this.lo & 255, - this.lo >>> 8 & 255, - this.lo >>> 16 & 255, - this.lo >>> 24 , - this.hi & 255, - this.hi >>> 8 & 255, - this.hi >>> 16 & 255, - this.hi >>> 24 - ); -}; - -/** - * Zig-zag encodes this long bits. - * @returns {util.LongBits} `this` - */ -LongBits.prototype.zzEncode = function zzEncode() { - var mask = this.hi >> 31; - this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0; - this.lo = ( this.lo << 1 ^ mask) >>> 0; - return this; -}; - -/** - * Zig-zag decodes this long bits. - * @returns {util.LongBits} `this` - */ -LongBits.prototype.zzDecode = function zzDecode() { - var mask = -(this.lo & 1); - this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0; - this.hi = ( this.hi >>> 1 ^ mask) >>> 0; - return this; -}; - -/** - * Calculates the length of this longbits when encoded as a varint. - * @returns {number} Length - */ -LongBits.prototype.length = function length() { - var part0 = this.lo, - part1 = (this.lo >>> 28 | this.hi << 4) >>> 0, - part2 = this.hi >>> 24; - return part2 === 0 - ? part1 === 0 - ? part0 < 16384 - ? part0 < 128 ? 1 : 2 - : part0 < 2097152 ? 3 : 4 - : part1 < 16384 - ? part1 < 128 ? 5 : 6 - : part1 < 2097152 ? 7 : 8 - : part2 < 128 ? 9 : 10; -}; - - -/***/ }), -/* 85 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = BufferWriter; - -// extends Writer -var Writer = __webpack_require__(21); -(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter; - -var util = __webpack_require__(5); - -var Buffer = util.Buffer; - -/** - * Constructs a new buffer writer instance. - * @classdesc Wire format writer using node buffers. - * @extends Writer - * @constructor - */ -function BufferWriter() { - Writer.call(this); -} - -/** - * Allocates a buffer of the specified size. - * @param {number} size Buffer size - * @returns {Buffer} Buffer - */ -BufferWriter.alloc = function alloc_buffer(size) { - return (BufferWriter.alloc = util._Buffer_allocUnsafe)(size); -}; - -var writeBytesBuffer = Buffer && Buffer.prototype instanceof Uint8Array && Buffer.prototype.set.name === "set" - ? function writeBytesBuffer_set(val, buf, pos) { - buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited) - // also works for plain array values - } - /* istanbul ignore next */ - : function writeBytesBuffer_copy(val, buf, pos) { - if (val.copy) // Buffer values - val.copy(buf, pos, 0, val.length); - else for (var i = 0; i < val.length;) // plain array values - buf[pos++] = val[i++]; - }; - -/** - * @override - */ -BufferWriter.prototype.bytes = function write_bytes_buffer(value) { - if (util.isString(value)) - value = util._Buffer_from(value, "base64"); - var len = value.length >>> 0; - this.uint32(len); - if (len) - this._push(writeBytesBuffer, len, value); - return this; -}; - -function writeStringBuffer(val, buf, pos) { - if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions) - util.utf8.write(val, buf, pos); - else - buf.utf8Write(val, pos); -} - -/** - * @override - */ -BufferWriter.prototype.string = function write_string_buffer(value) { - var len = Buffer.byteLength(value); - this.uint32(len); - if (len) - this._push(writeStringBuffer, len, value); - return this; -}; - - -/** - * Finishes the write operation. - * @name BufferWriter#finish - * @function - * @returns {Buffer} Finished buffer - */ - - -/***/ }), -/* 86 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = BufferReader; - -// extends Reader -var Reader = __webpack_require__(22); -(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader; - -var util = __webpack_require__(5); - -/** - * Constructs a new buffer reader instance. - * @classdesc Wire format reader using node buffers. - * @extends Reader - * @constructor - * @param {Buffer} buffer Buffer to read from - */ -function BufferReader(buffer) { - Reader.call(this, buffer); - - /** - * Read buffer. - * @name BufferReader#buf - * @type {Buffer} - */ -} - -/* istanbul ignore else */ -if (util.Buffer) - BufferReader.prototype._slice = util.Buffer.prototype.slice; - -/** - * @override - */ -BufferReader.prototype.string = function read_string_buffer() { - var len = this.uint32(); // modifies pos - return this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len)); -}; - -/** - * Reads a sequence of bytes preceeded by its length as a varint. - * @name BufferReader#bytes - * @function - * @returns {Buffer} Value read - */ - - -/***/ }), -/* 87 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = Service; - -var util = __webpack_require__(5); - -// Extends EventEmitter -(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service; - -/** - * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}. - * - * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`. - * @typedef rpc.ServiceMethodCallback - * @template TRes extends Message - * @type {function} - * @param {Error|null} error Error, if any - * @param {TRes} [response] Response message - * @returns {undefined} - */ - -/** - * A service method part of a {@link rpc.Service} as created by {@link Service.create}. - * @typedef rpc.ServiceMethod - * @template TReq extends Message - * @template TRes extends Message - * @type {function} - * @param {TReq|Properties} request Request message or plain object - * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message - * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined` - */ - -/** - * Constructs a new RPC service instance. - * @classdesc An RPC service as returned by {@link Service#create}. - * @exports rpc.Service - * @extends util.EventEmitter - * @constructor - * @param {RPCImpl} rpcImpl RPC implementation - * @param {boolean} [requestDelimited=false] Whether requests are length-delimited - * @param {boolean} [responseDelimited=false] Whether responses are length-delimited - */ -function Service(rpcImpl, requestDelimited, responseDelimited) { - - if (typeof rpcImpl !== "function") - throw TypeError("rpcImpl must be a function"); - - util.EventEmitter.call(this); - - /** - * RPC implementation. Becomes `null` once the service is ended. - * @type {RPCImpl|null} - */ - this.rpcImpl = rpcImpl; - - /** - * Whether requests are length-delimited. - * @type {boolean} - */ - this.requestDelimited = Boolean(requestDelimited); - - /** - * Whether responses are length-delimited. - * @type {boolean} - */ - this.responseDelimited = Boolean(responseDelimited); -} - -/** - * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}. - * @param {Method|rpc.ServiceMethod} method Reflected or static method - * @param {Constructor} requestCtor Request constructor - * @param {Constructor} responseCtor Response constructor - * @param {TReq|Properties} request Request message or plain object - * @param {rpc.ServiceMethodCallback} callback Service callback - * @returns {undefined} - * @template TReq extends Message - * @template TRes extends Message - */ -Service.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) { - - if (!request) - throw TypeError("request must be specified"); - - var self = this; - if (!callback) - return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request); - - if (!self.rpcImpl) { - setTimeout(function() { callback(Error("already ended")); }, 0); - return undefined; - } - - try { - return self.rpcImpl( - method, - requestCtor[self.requestDelimited ? "encodeDelimited" : "encode"](request).finish(), - function rpcCallback(err, response) { - - if (err) { - self.emit("error", err, method); - return callback(err); - } - - if (response === null) { - self.end(/* endedByRPC */ true); - return undefined; - } - - if (!(response instanceof responseCtor)) { - try { - response = responseCtor[self.responseDelimited ? "decodeDelimited" : "decode"](response); - } catch (err) { - self.emit("error", err, method); - return callback(err); - } - } - - self.emit("data", response, method); - return callback(null, response); - } - ); - } catch (err) { - self.emit("error", err, method); - setTimeout(function() { callback(err); }, 0); - return undefined; - } -}; - -/** - * Ends this service and emits the `end` event. - * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation. - * @returns {rpc.Service} `this` - */ -Service.prototype.end = function end(endedByRPC) { - if (this.rpcImpl) { - if (!endedByRPC) // signal end to rpcImpl - this.rpcImpl(null, null, null); - this.rpcImpl = null; - this.emit("end").off(); - } - return this; -}; - - -/***/ }), -/* 88 */ -/***/ ((module) => { - -"use strict"; - -module.exports = codegen; - -/** - * Begins generating a function. - * @memberof util - * @param {string[]} functionParams Function parameter names - * @param {string} [functionName] Function name if not anonymous - * @returns {Codegen} Appender that appends code to the function's body - */ -function codegen(functionParams, functionName) { - - /* istanbul ignore if */ - if (typeof functionParams === "string") { - functionName = functionParams; - functionParams = undefined; - } - - var body = []; - - /** - * Appends code to the function's body or finishes generation. - * @typedef Codegen - * @type {function} - * @param {string|Object.} [formatStringOrScope] Format string or, to finish the function, an object of additional scope variables, if any - * @param {...*} [formatParams] Format parameters - * @returns {Codegen|Function} Itself or the generated function if finished - * @throws {Error} If format parameter counts do not match - */ - - function Codegen(formatStringOrScope) { - // note that explicit array handling below makes this ~50% faster - - // finish the function - if (typeof formatStringOrScope !== "string") { - var source = toString(); - if (codegen.verbose) - console.log("codegen: " + source); // eslint-disable-line no-console - source = "return " + source; - if (formatStringOrScope) { - var scopeKeys = Object.keys(formatStringOrScope), - scopeParams = new Array(scopeKeys.length + 1), - scopeValues = new Array(scopeKeys.length), - scopeOffset = 0; - while (scopeOffset < scopeKeys.length) { - scopeParams[scopeOffset] = scopeKeys[scopeOffset]; - scopeValues[scopeOffset] = formatStringOrScope[scopeKeys[scopeOffset++]]; - } - scopeParams[scopeOffset] = source; - return Function.apply(null, scopeParams).apply(null, scopeValues); // eslint-disable-line no-new-func - } - return Function(source)(); // eslint-disable-line no-new-func - } - - // otherwise append to body - var formatParams = new Array(arguments.length - 1), - formatOffset = 0; - while (formatOffset < formatParams.length) - formatParams[formatOffset] = arguments[++formatOffset]; - formatOffset = 0; - formatStringOrScope = formatStringOrScope.replace(/%([%dfijs])/g, function replace($0, $1) { - var value = formatParams[formatOffset++]; - switch ($1) { - case "d": case "f": return String(Number(value)); - case "i": return String(Math.floor(value)); - case "j": return JSON.stringify(value); - case "s": return String(value); - } - return "%"; - }); - if (formatOffset !== formatParams.length) - throw Error("parameter count mismatch"); - body.push(formatStringOrScope); - return Codegen; - } - - function toString(functionNameOverride) { - return "function " + (functionNameOverride || functionName || "") + "(" + (functionParams && functionParams.join(",") || "") + "){\n " + body.join("\n ") + "\n}"; - } - - Codegen.toString = toString; - return Codegen; -} - -/** - * Begins generating a function. - * @memberof util - * @function codegen - * @param {string} [functionName] Function name if not anonymous - * @returns {Codegen} Appender that appends code to the function's body - * @variation 2 - */ - -/** - * When set to `true`, codegen will log generated code to console. Useful for debugging. - * @name util.codegen.verbose - * @type {boolean} - */ -codegen.verbose = false; - - -/***/ }), -/* 89 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = fetch; - -var asPromise = __webpack_require__(38), - inquire = __webpack_require__(39); - -var fs = inquire("fs"); - -/** - * Node-style callback as used by {@link util.fetch}. - * @typedef FetchCallback - * @type {function} - * @param {?Error} error Error, if any, otherwise `null` - * @param {string} [contents] File contents, if there hasn't been an error - * @returns {undefined} - */ - -/** - * Options as used by {@link util.fetch}. - * @typedef FetchOptions - * @type {Object} - * @property {boolean} [binary=false] Whether expecting a binary response - * @property {boolean} [xhr=false] If `true`, forces the use of XMLHttpRequest - */ - -/** - * Fetches the contents of a file. - * @memberof util - * @param {string} filename File path or url - * @param {FetchOptions} options Fetch options - * @param {FetchCallback} callback Callback function - * @returns {undefined} - */ -function fetch(filename, options, callback) { - if (typeof options === "function") { - callback = options; - options = {}; - } else if (!options) - options = {}; - - if (!callback) - return asPromise(fetch, this, filename, options); // eslint-disable-line no-invalid-this - - // if a node-like filesystem is present, try it first but fall back to XHR if nothing is found. - if (!options.xhr && fs && fs.readFile) - return fs.readFile(filename, function fetchReadFileCallback(err, contents) { - return err && typeof XMLHttpRequest !== "undefined" - ? fetch.xhr(filename, options, callback) - : err - ? callback(err) - : callback(null, options.binary ? contents : contents.toString("utf8")); - }); - - // use the XHR version otherwise. - return fetch.xhr(filename, options, callback); -} - -/** - * Fetches the contents of a file. - * @name util.fetch - * @function - * @param {string} path File path or url - * @param {FetchCallback} callback Callback function - * @returns {undefined} - * @variation 2 - */ - -/** - * Fetches the contents of a file. - * @name util.fetch - * @function - * @param {string} path File path or url - * @param {FetchOptions} [options] Fetch options - * @returns {Promise} Promise - * @variation 3 - */ - -/**/ -fetch.xhr = function fetch_xhr(filename, options, callback) { - var xhr = new XMLHttpRequest(); - xhr.onreadystatechange /* works everywhere */ = function fetchOnReadyStateChange() { - - if (xhr.readyState !== 4) - return undefined; - - // local cors security errors return status 0 / empty string, too. afaik this cannot be - // reliably distinguished from an actually empty file for security reasons. feel free - // to send a pull request if you are aware of a solution. - if (xhr.status !== 0 && xhr.status !== 200) - return callback(Error("status " + xhr.status)); - - // if binary data is expected, make sure that some sort of array is returned, even if - // ArrayBuffers are not supported. the binary string fallback, however, is unsafe. - if (options.binary) { - var buffer = xhr.response; - if (!buffer) { - buffer = []; - for (var i = 0; i < xhr.responseText.length; ++i) - buffer.push(xhr.responseText.charCodeAt(i) & 255); - } - return callback(null, typeof Uint8Array !== "undefined" ? new Uint8Array(buffer) : buffer); - } - return callback(null, xhr.responseText); - }; - - if (options.binary) { - // ref: https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Sending_and_Receiving_Binary_Data#Receiving_binary_data_in_older_browsers - if ("overrideMimeType" in xhr) - xhr.overrideMimeType("text/plain; charset=x-user-defined"); - xhr.responseType = "arraybuffer"; - } - - xhr.open("GET", filename); - xhr.send(); -}; - - -/***/ }), -/* 90 */ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -/** - * A minimal path module to resolve Unix, Windows and URL paths alike. - * @memberof util - * @namespace - */ -var path = exports; - -var isAbsolute = -/** - * Tests if the specified path is absolute. - * @param {string} path Path to test - * @returns {boolean} `true` if path is absolute - */ -path.isAbsolute = function isAbsolute(path) { - return /^(?:\/|\w+:)/.test(path); -}; - -var normalize = -/** - * Normalizes the specified path. - * @param {string} path Path to normalize - * @returns {string} Normalized path - */ -path.normalize = function normalize(path) { - path = path.replace(/\\/g, "/") - .replace(/\/{2,}/g, "/"); - var parts = path.split("/"), - absolute = isAbsolute(path), - prefix = ""; - if (absolute) - prefix = parts.shift() + "/"; - for (var i = 0; i < parts.length;) { - if (parts[i] === "..") { - if (i > 0 && parts[i - 1] !== "..") - parts.splice(--i, 2); - else if (absolute) - parts.splice(i, 1); - else - ++i; - } else if (parts[i] === ".") - parts.splice(i, 1); - else - ++i; - } - return prefix + parts.join("/"); -}; - -/** - * Resolves the specified include path against the specified origin path. - * @param {string} originPath Path to the origin file - * @param {string} includePath Include path relative to origin path - * @param {boolean} [alreadyNormalized=false] `true` if both paths are already known to be normalized - * @returns {string} Path to the include file - */ -path.resolve = function resolve(originPath, includePath, alreadyNormalized) { - if (!alreadyNormalized) - includePath = normalize(includePath); - if (isAbsolute(includePath)) - return includePath; - if (!alreadyNormalized) - originPath = normalize(originPath); - return (originPath = originPath.replace(/(?:\/|^)[^/]+$/, "")).length ? normalize(originPath + "/" + includePath) : includePath; -}; - - -/***/ }), -/* 91 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const basex = __webpack_require__(92) -const ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' - -module.exports = basex(ALPHABET) - - -/***/ }), -/* 92 */ -/***/ ((module) => { - -"use strict"; - -// base-x encoding / decoding -// Copyright (c) 2018 base-x contributors -// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp) -// Distributed under the MIT software license, see the accompanying -// file LICENSE or http://www.opensource.org/licenses/mit-license.php. -function base (ALPHABET) { - if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') } - var BASE_MAP = new Uint8Array(256) - for (var j = 0; j < BASE_MAP.length; j++) { - BASE_MAP[j] = 255 - } - for (var i = 0; i < ALPHABET.length; i++) { - var x = ALPHABET.charAt(i) - var xc = x.charCodeAt(0) - if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') } - BASE_MAP[xc] = i - } - var BASE = ALPHABET.length - var LEADER = ALPHABET.charAt(0) - var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up - var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up - function encode (source) { - if (source instanceof Uint8Array) { - } else if (ArrayBuffer.isView(source)) { - source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength) - } else if (Array.isArray(source)) { - source = Uint8Array.from(source) - } - if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') } - if (source.length === 0) { return '' } - // Skip & count leading zeroes. - var zeroes = 0 - var length = 0 - var pbegin = 0 - var pend = source.length - while (pbegin !== pend && source[pbegin] === 0) { - pbegin++ - zeroes++ - } - // Allocate enough space in big-endian base58 representation. - var size = ((pend - pbegin) * iFACTOR + 1) >>> 0 - var b58 = new Uint8Array(size) - // Process the bytes. - while (pbegin !== pend) { - var carry = source[pbegin] - // Apply "b58 = b58 * 256 + ch". - var i = 0 - for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) { - carry += (256 * b58[it1]) >>> 0 - b58[it1] = (carry % BASE) >>> 0 - carry = (carry / BASE) >>> 0 - } - if (carry !== 0) { throw new Error('Non-zero carry') } - length = i - pbegin++ - } - // Skip leading zeroes in base58 result. - var it2 = size - length - while (it2 !== size && b58[it2] === 0) { - it2++ - } - // Translate the result into a string. - var str = LEADER.repeat(zeroes) - for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) } - return str - } - function decodeUnsafe (source) { - if (typeof source !== 'string') { throw new TypeError('Expected String') } - if (source.length === 0) { return new Uint8Array() } - var psz = 0 - // Skip and count leading '1's. - var zeroes = 0 - var length = 0 - while (source[psz] === LEADER) { - zeroes++ - psz++ - } - // Allocate enough space in big-endian base256 representation. - var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up. - var b256 = new Uint8Array(size) - // Process the characters. - while (source[psz]) { - // Decode character - var carry = BASE_MAP[source.charCodeAt(psz)] - // Invalid character - if (carry === 255) { return } - var i = 0 - for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) { - carry += (BASE * b256[it3]) >>> 0 - b256[it3] = (carry % 256) >>> 0 - carry = (carry / 256) >>> 0 - } - if (carry !== 0) { throw new Error('Non-zero carry') } - length = i - psz++ - } - // Skip leading zeroes in b256. - var it4 = size - length - while (it4 !== size && b256[it4] === 0) { - it4++ - } - var vch = new Uint8Array(zeroes + (size - it4)) - var j = zeroes - while (it4 !== size) { - vch[j++] = b256[it4++] - } - return vch - } - function decode (string) { - var buffer = decodeUnsafe(string) - if (buffer) { return buffer } - throw new Error('Non-base' + BASE + ' character') - } - return { - encode: encode, - decodeUnsafe: decodeUnsafe, - decode: decode - } -} -module.exports = base - - -/***/ }), -/* 93 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = parse; - -parse.filename = null; -parse.defaults = { keepCase: false }; - -var tokenize = __webpack_require__(47), - Root = __webpack_require__(28), - Type = __webpack_require__(23), - Field = __webpack_require__(11), - MapField = __webpack_require__(24), - OneOf = __webpack_require__(18), - Enum = __webpack_require__(3), - Service = __webpack_require__(25), - Method = __webpack_require__(26), - types = __webpack_require__(14), - util = __webpack_require__(0); - -var base10Re = /^[1-9][0-9]*$/, - base10NegRe = /^-?[1-9][0-9]*$/, - base16Re = /^0[x][0-9a-fA-F]+$/, - base16NegRe = /^-?0[x][0-9a-fA-F]+$/, - base8Re = /^0[0-7]+$/, - base8NegRe = /^-?0[0-7]+$/, - numberRe = /^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/, - nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/, - typeRefRe = /^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/, - fqTypeRefRe = /^(?:\.[a-zA-Z_][a-zA-Z_0-9]*)+$/; - -/** - * Result object returned from {@link parse}. - * @interface IParserResult - * @property {string|undefined} package Package name, if declared - * @property {string[]|undefined} imports Imports, if any - * @property {string[]|undefined} weakImports Weak imports, if any - * @property {string|undefined} syntax Syntax, if specified (either `"proto2"` or `"proto3"`) - * @property {Root} root Populated root instance - */ - -/** - * Options modifying the behavior of {@link parse}. - * @interface IParseOptions - * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case - * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments. - */ - -/** - * Options modifying the behavior of JSON serialization. - * @interface IToJSONOptions - * @property {boolean} [keepComments=false] Serializes comments. - */ - -/** - * Parses the given .proto source and returns an object with the parsed contents. - * @param {string} source Source contents - * @param {Root} root Root to populate - * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted. - * @returns {IParserResult} Parser result - * @property {string} filename=null Currently processing file name for error reporting, if known - * @property {IParseOptions} defaults Default {@link IParseOptions} - */ -function parse(source, root, options) { - /* eslint-disable callback-return */ - if (!(root instanceof Root)) { - options = root; - root = new Root(); - } - if (!options) - options = parse.defaults; - - var tn = tokenize(source, options.alternateCommentMode || false), - next = tn.next, - push = tn.push, - peek = tn.peek, - skip = tn.skip, - cmnt = tn.cmnt; - - var head = true, - pkg, - imports, - weakImports, - syntax, - isProto3 = false; - - var ptr = root; - - var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase; - - /* istanbul ignore next */ - function illegal(token, name, insideTryCatch) { - var filename = parse.filename; - if (!insideTryCatch) - parse.filename = null; - return Error("illegal " + (name || "token") + " '" + token + "' (" + (filename ? filename + ", " : "") + "line " + tn.line + ")"); - } - - function readString() { - var values = [], - token; - do { - /* istanbul ignore if */ - if ((token = next()) !== "\"" && token !== "'") - throw illegal(token); - - values.push(next()); - skip(token); - token = peek(); - } while (token === "\"" || token === "'"); - return values.join(""); - } - - function readValue(acceptTypeRef) { - var token = next(); - switch (token) { - case "'": - case "\"": - push(token); - return readString(); - case "true": case "TRUE": - return true; - case "false": case "FALSE": - return false; - } - try { - return parseNumber(token, /* insideTryCatch */ true); - } catch (e) { - - /* istanbul ignore else */ - if (acceptTypeRef && typeRefRe.test(token)) - return token; - - /* istanbul ignore next */ - throw illegal(token, "value"); - } - } - - function readRanges(target, acceptStrings) { - var token, start; - do { - if (acceptStrings && ((token = peek()) === "\"" || token === "'")) - target.push(readString()); - else - target.push([ start = parseId(next()), skip("to", true) ? parseId(next()) : start ]); - } while (skip(",", true)); - skip(";"); - } - - function parseNumber(token, insideTryCatch) { - var sign = 1; - if (token.charAt(0) === "-") { - sign = -1; - token = token.substring(1); - } - switch (token) { - case "inf": case "INF": case "Inf": - return sign * Infinity; - case "nan": case "NAN": case "Nan": case "NaN": - return NaN; - case "0": - return 0; - } - if (base10Re.test(token)) - return sign * parseInt(token, 10); - if (base16Re.test(token)) - return sign * parseInt(token, 16); - if (base8Re.test(token)) - return sign * parseInt(token, 8); - - /* istanbul ignore else */ - if (numberRe.test(token)) - return sign * parseFloat(token); - - /* istanbul ignore next */ - throw illegal(token, "number", insideTryCatch); - } - - function parseId(token, acceptNegative) { - switch (token) { - case "max": case "MAX": case "Max": - return 536870911; - case "0": - return 0; - } - - /* istanbul ignore if */ - if (!acceptNegative && token.charAt(0) === "-") - throw illegal(token, "id"); - - if (base10NegRe.test(token)) - return parseInt(token, 10); - if (base16NegRe.test(token)) - return parseInt(token, 16); - - /* istanbul ignore else */ - if (base8NegRe.test(token)) - return parseInt(token, 8); - - /* istanbul ignore next */ - throw illegal(token, "id"); - } - - function parsePackage() { - - /* istanbul ignore if */ - if (pkg !== undefined) - throw illegal("package"); - - pkg = next(); - - /* istanbul ignore if */ - if (!typeRefRe.test(pkg)) - throw illegal(pkg, "name"); - - ptr = ptr.define(pkg); - skip(";"); - } - - function parseImport() { - var token = peek(); - var whichImports; - switch (token) { - case "weak": - whichImports = weakImports || (weakImports = []); - next(); - break; - case "public": - next(); - // eslint-disable-line no-fallthrough - default: - whichImports = imports || (imports = []); - break; - } - token = readString(); - skip(";"); - whichImports.push(token); - } - - function parseSyntax() { - skip("="); - syntax = readString(); - isProto3 = syntax === "proto3"; - - /* istanbul ignore if */ - if (!isProto3 && syntax !== "proto2") - throw illegal(syntax, "syntax"); - - skip(";"); - } - - function parseCommon(parent, token) { - switch (token) { - - case "option": - parseOption(parent, token); - skip(";"); - return true; - - case "message": - parseType(parent, token); - return true; - - case "enum": - parseEnum(parent, token); - return true; - - case "service": - parseService(parent, token); - return true; - - case "extend": - parseExtension(parent, token); - return true; - } - return false; - } - - function ifBlock(obj, fnIf, fnElse) { - var trailingLine = tn.line; - if (obj) { - obj.comment = cmnt(); // try block-type comment - obj.filename = parse.filename; - } - if (skip("{", true)) { - var token; - while ((token = next()) !== "}") - fnIf(token); - skip(";", true); - } else { - if (fnElse) - fnElse(); - skip(";"); - if (obj && typeof obj.comment !== "string") - obj.comment = cmnt(trailingLine); // try line-type comment if no block - } - } - - function parseType(parent, token) { - - /* istanbul ignore if */ - if (!nameRe.test(token = next())) - throw illegal(token, "type name"); - - var type = new Type(token); - ifBlock(type, function parseType_block(token) { - if (parseCommon(type, token)) - return; - - switch (token) { - - case "map": - parseMapField(type, token); - break; - - case "required": - case "optional": - case "repeated": - parseField(type, token); - break; - - case "oneof": - parseOneOf(type, token); - break; - - case "extensions": - readRanges(type.extensions || (type.extensions = [])); - break; - - case "reserved": - readRanges(type.reserved || (type.reserved = []), true); - break; - - default: - /* istanbul ignore if */ - if (!isProto3 || !typeRefRe.test(token)) - throw illegal(token); - - push(token); - parseField(type, "optional"); - break; - } - }); - parent.add(type); - } - - function parseField(parent, rule, extend) { - var type = next(); - if (type === "group") { - parseGroup(parent, rule); - return; - } - - /* istanbul ignore if */ - if (!typeRefRe.test(type)) - throw illegal(type, "type"); - - var name = next(); - - /* istanbul ignore if */ - if (!nameRe.test(name)) - throw illegal(name, "name"); - - name = applyCase(name); - skip("="); - - var field = new Field(name, parseId(next()), type, rule, extend); - ifBlock(field, function parseField_block(token) { - - /* istanbul ignore else */ - if (token === "option") { - parseOption(field, token); - skip(";"); - } else - throw illegal(token); - - }, function parseField_line() { - parseInlineOptions(field); - }); - parent.add(field); - - // JSON defaults to packed=true if not set so we have to set packed=false explicity when - // parsing proto2 descriptors without the option, where applicable. This must be done for - // all known packable types and anything that could be an enum (= is not a basic type). - if (!isProto3 && field.repeated && (types.packed[type] !== undefined || types.basic[type] === undefined)) - field.setOption("packed", false, /* ifNotSet */ true); - } - - function parseGroup(parent, rule) { - var name = next(); - - /* istanbul ignore if */ - if (!nameRe.test(name)) - throw illegal(name, "name"); - - var fieldName = util.lcFirst(name); - if (name === fieldName) - name = util.ucFirst(name); - skip("="); - var id = parseId(next()); - var type = new Type(name); - type.group = true; - var field = new Field(fieldName, id, name, rule); - field.filename = parse.filename; - ifBlock(type, function parseGroup_block(token) { - switch (token) { - - case "option": - parseOption(type, token); - skip(";"); - break; - - case "required": - case "optional": - case "repeated": - parseField(type, token); - break; - - /* istanbul ignore next */ - default: - throw illegal(token); // there are no groups with proto3 semantics - } - }); - parent.add(type) - .add(field); - } - - function parseMapField(parent) { - skip("<"); - var keyType = next(); - - /* istanbul ignore if */ - if (types.mapKey[keyType] === undefined) - throw illegal(keyType, "type"); - - skip(","); - var valueType = next(); - - /* istanbul ignore if */ - if (!typeRefRe.test(valueType)) - throw illegal(valueType, "type"); - - skip(">"); - var name = next(); - - /* istanbul ignore if */ - if (!nameRe.test(name)) - throw illegal(name, "name"); - - skip("="); - var field = new MapField(applyCase(name), parseId(next()), keyType, valueType); - ifBlock(field, function parseMapField_block(token) { - - /* istanbul ignore else */ - if (token === "option") { - parseOption(field, token); - skip(";"); - } else - throw illegal(token); - - }, function parseMapField_line() { - parseInlineOptions(field); - }); - parent.add(field); - } - - function parseOneOf(parent, token) { - - /* istanbul ignore if */ - if (!nameRe.test(token = next())) - throw illegal(token, "name"); - - var oneof = new OneOf(applyCase(token)); - ifBlock(oneof, function parseOneOf_block(token) { - if (token === "option") { - parseOption(oneof, token); - skip(";"); - } else { - push(token); - parseField(oneof, "optional"); - } - }); - parent.add(oneof); - } - - function parseEnum(parent, token) { - - /* istanbul ignore if */ - if (!nameRe.test(token = next())) - throw illegal(token, "name"); - - var enm = new Enum(token); - ifBlock(enm, function parseEnum_block(token) { - switch(token) { - case "option": - parseOption(enm, token); - skip(";"); - break; - - case "reserved": - readRanges(enm.reserved || (enm.reserved = []), true); - break; - - default: - parseEnumValue(enm, token); - } - }); - parent.add(enm); - } - - function parseEnumValue(parent, token) { - - /* istanbul ignore if */ - if (!nameRe.test(token)) - throw illegal(token, "name"); - - skip("="); - var value = parseId(next(), true), - dummy = {}; - ifBlock(dummy, function parseEnumValue_block(token) { - - /* istanbul ignore else */ - if (token === "option") { - parseOption(dummy, token); // skip - skip(";"); - } else - throw illegal(token); - - }, function parseEnumValue_line() { - parseInlineOptions(dummy); // skip - }); - parent.add(token, value, dummy.comment); - } - - function parseOption(parent, token) { - var isCustom = skip("(", true); - - /* istanbul ignore if */ - if (!typeRefRe.test(token = next())) - throw illegal(token, "name"); - - var name = token; - if (isCustom) { - skip(")"); - name = "(" + name + ")"; - token = peek(); - if (fqTypeRefRe.test(token)) { - name += token; - next(); - } - } - skip("="); - parseOptionValue(parent, name); - } - - function parseOptionValue(parent, name) { - if (skip("{", true)) { // { a: "foo" b { c: "bar" } } - do { - /* istanbul ignore if */ - if (!nameRe.test(token = next())) - throw illegal(token, "name"); - - if (peek() === "{") - parseOptionValue(parent, name + "." + token); - else { - skip(":"); - if (peek() === "{") - parseOptionValue(parent, name + "." + token); - else - setOption(parent, name + "." + token, readValue(true)); - } - skip(",", true); - } while (!skip("}", true)); - } else - setOption(parent, name, readValue(true)); - // Does not enforce a delimiter to be universal - } - - function setOption(parent, name, value) { - if (parent.setOption) - parent.setOption(name, value); - } - - function parseInlineOptions(parent) { - if (skip("[", true)) { - do { - parseOption(parent, "option"); - } while (skip(",", true)); - skip("]"); - } - return parent; - } - - function parseService(parent, token) { - - /* istanbul ignore if */ - if (!nameRe.test(token = next())) - throw illegal(token, "service name"); - - var service = new Service(token); - ifBlock(service, function parseService_block(token) { - if (parseCommon(service, token)) - return; - - /* istanbul ignore else */ - if (token === "rpc") - parseMethod(service, token); - else - throw illegal(token); - }); - parent.add(service); - } - - function parseMethod(parent, token) { - var type = token; - - /* istanbul ignore if */ - if (!nameRe.test(token = next())) - throw illegal(token, "name"); - - var name = token, - requestType, requestStream, - responseType, responseStream; - - skip("("); - if (skip("stream", true)) - requestStream = true; - - /* istanbul ignore if */ - if (!typeRefRe.test(token = next())) - throw illegal(token); - - requestType = token; - skip(")"); skip("returns"); skip("("); - if (skip("stream", true)) - responseStream = true; - - /* istanbul ignore if */ - if (!typeRefRe.test(token = next())) - throw illegal(token); - - responseType = token; - skip(")"); - - var method = new Method(name, type, requestType, responseType, requestStream, responseStream); - ifBlock(method, function parseMethod_block(token) { - - /* istanbul ignore else */ - if (token === "option") { - parseOption(method, token); - skip(";"); - } else - throw illegal(token); - - }); - parent.add(method); - } - - function parseExtension(parent, token) { - - /* istanbul ignore if */ - if (!typeRefRe.test(token = next())) - throw illegal(token, "reference"); - - var reference = token; - ifBlock(null, function parseExtension_block(token) { - switch (token) { - - case "required": - case "repeated": - case "optional": - parseField(parent, token, reference); - break; - - default: - /* istanbul ignore if */ - if (!isProto3 || !typeRefRe.test(token)) - throw illegal(token); - push(token); - parseField(parent, "optional", reference); - break; - } - }); - } - - var token; - while ((token = next()) !== null) { - switch (token) { - - case "package": - - /* istanbul ignore if */ - if (!head) - throw illegal(token); - - parsePackage(); - break; - - case "import": - - /* istanbul ignore if */ - if (!head) - throw illegal(token); - - parseImport(); - break; - - case "syntax": - - /* istanbul ignore if */ - if (!head) - throw illegal(token); - - parseSyntax(); - break; - - case "option": - - /* istanbul ignore if */ - if (!head) - throw illegal(token); - - parseOption(ptr, token); - skip(";"); - break; - - default: - - /* istanbul ignore else */ - if (parseCommon(ptr, token)) { - head = false; - continue; - } - - /* istanbul ignore next */ - throw illegal(token); - } - } - - parse.filename = null; - return { - "package" : pkg, - "imports" : imports, - weakImports : weakImports, - syntax : syntax, - root : root - }; -} - -/** - * Parses the given .proto source and returns an object with the parsed contents. - * @name parse - * @function - * @param {string} source Source contents - * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted. - * @returns {IParserResult} Parser result - * @property {string} filename=null Currently processing file name for error reporting, if known - * @property {IParseOptions} defaults Default {@link IParseOptions} - * @variation 2 - */ - - -/***/ }), -/* 94 */ -/***/ ((module) => { - -"use strict"; - -module.exports = common; - -var commonRe = /\/|\./; - -/** - * Provides common type definitions. - * Can also be used to provide additional google types or your own custom types. - * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name - * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition - * @returns {undefined} - * @property {INamespace} google/protobuf/any.proto Any - * @property {INamespace} google/protobuf/duration.proto Duration - * @property {INamespace} google/protobuf/empty.proto Empty - * @property {INamespace} google/protobuf/field_mask.proto FieldMask - * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue - * @property {INamespace} google/protobuf/timestamp.proto Timestamp - * @property {INamespace} google/protobuf/wrappers.proto Wrappers - * @example - * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension) - * protobuf.common("descriptor", descriptorJson); - * - * // manually provides a custom definition (uses my.foo namespace) - * protobuf.common("my/foo/bar.proto", myFooBarJson); - */ -function common(name, json) { - if (!commonRe.test(name)) { - name = "google/protobuf/" + name + ".proto"; - json = { nested: { google: { nested: { protobuf: { nested: json } } } } }; - } - common[name] = json; -} - -// Not provided because of limited use (feel free to discuss or to provide yourself): -// -// google/protobuf/descriptor.proto -// google/protobuf/source_context.proto -// google/protobuf/type.proto -// -// Stripped and pre-parsed versions of these non-bundled files are instead available as part of -// the repository or package within the google/protobuf directory. - -common("any", { - - /** - * Properties of a google.protobuf.Any message. - * @interface IAny - * @type {Object} - * @property {string} [typeUrl] - * @property {Uint8Array} [bytes] - * @memberof common - */ - Any: { - fields: { - type_url: { - type: "string", - id: 1 - }, - value: { - type: "bytes", - id: 2 - } - } - } -}); - -var timeType; - -common("duration", { - - /** - * Properties of a google.protobuf.Duration message. - * @interface IDuration - * @type {Object} - * @property {number|Long} [seconds] - * @property {number} [nanos] - * @memberof common - */ - Duration: timeType = { - fields: { - seconds: { - type: "int64", - id: 1 - }, - nanos: { - type: "int32", - id: 2 - } - } - } -}); - -common("timestamp", { - - /** - * Properties of a google.protobuf.Timestamp message. - * @interface ITimestamp - * @type {Object} - * @property {number|Long} [seconds] - * @property {number} [nanos] - * @memberof common - */ - Timestamp: timeType -}); - -common("empty", { - - /** - * Properties of a google.protobuf.Empty message. - * @interface IEmpty - * @memberof common - */ - Empty: { - fields: {} - } -}); - -common("struct", { - - /** - * Properties of a google.protobuf.Struct message. - * @interface IStruct - * @type {Object} - * @property {Object.} [fields] - * @memberof common - */ - Struct: { - fields: { - fields: { - keyType: "string", - type: "Value", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.Value message. - * @interface IValue - * @type {Object} - * @property {string} [kind] - * @property {0} [nullValue] - * @property {number} [numberValue] - * @property {string} [stringValue] - * @property {boolean} [boolValue] - * @property {IStruct} [structValue] - * @property {IListValue} [listValue] - * @memberof common - */ - Value: { - oneofs: { - kind: { - oneof: [ - "nullValue", - "numberValue", - "stringValue", - "boolValue", - "structValue", - "listValue" - ] - } - }, - fields: { - nullValue: { - type: "NullValue", - id: 1 - }, - numberValue: { - type: "double", - id: 2 - }, - stringValue: { - type: "string", - id: 3 - }, - boolValue: { - type: "bool", - id: 4 - }, - structValue: { - type: "Struct", - id: 5 - }, - listValue: { - type: "ListValue", - id: 6 - } - } - }, - - NullValue: { - values: { - NULL_VALUE: 0 - } - }, - - /** - * Properties of a google.protobuf.ListValue message. - * @interface IListValue - * @type {Object} - * @property {Array.} [values] - * @memberof common - */ - ListValue: { - fields: { - values: { - rule: "repeated", - type: "Value", - id: 1 - } - } - } -}); - -common("wrappers", { - - /** - * Properties of a google.protobuf.DoubleValue message. - * @interface IDoubleValue - * @type {Object} - * @property {number} [value] - * @memberof common - */ - DoubleValue: { - fields: { - value: { - type: "double", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.FloatValue message. - * @interface IFloatValue - * @type {Object} - * @property {number} [value] - * @memberof common - */ - FloatValue: { - fields: { - value: { - type: "float", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.Int64Value message. - * @interface IInt64Value - * @type {Object} - * @property {number|Long} [value] - * @memberof common - */ - Int64Value: { - fields: { - value: { - type: "int64", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.UInt64Value message. - * @interface IUInt64Value - * @type {Object} - * @property {number|Long} [value] - * @memberof common - */ - UInt64Value: { - fields: { - value: { - type: "uint64", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.Int32Value message. - * @interface IInt32Value - * @type {Object} - * @property {number} [value] - * @memberof common - */ - Int32Value: { - fields: { - value: { - type: "int32", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.UInt32Value message. - * @interface IUInt32Value - * @type {Object} - * @property {number} [value] - * @memberof common - */ - UInt32Value: { - fields: { - value: { - type: "uint32", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.BoolValue message. - * @interface IBoolValue - * @type {Object} - * @property {boolean} [value] - * @memberof common - */ - BoolValue: { - fields: { - value: { - type: "bool", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.StringValue message. - * @interface IStringValue - * @type {Object} - * @property {string} [value] - * @memberof common - */ - StringValue: { - fields: { - value: { - type: "string", - id: 1 - } - } - }, - - /** - * Properties of a google.protobuf.BytesValue message. - * @interface IBytesValue - * @type {Object} - * @property {Uint8Array} [value] - * @memberof common - */ - BytesValue: { - fields: { - value: { - type: "bytes", - id: 1 - } - } - } -}); - -common("field_mask", { - - /** - * Properties of a google.protobuf.FieldMask message. - * @interface IDoubleValue - * @type {Object} - * @property {number} [value] - * @memberof common - */ - FieldMask: { - fields: { - paths: { - rule: "repeated", - type: "string", - id: 1 - } - } - } -}); - -/** - * Gets the root definition of the specified common proto file. - * - * Bundled definitions are: - * - google/protobuf/any.proto - * - google/protobuf/duration.proto - * - google/protobuf/empty.proto - * - google/protobuf/field_mask.proto - * - google/protobuf/struct.proto - * - google/protobuf/timestamp.proto - * - google/protobuf/wrappers.proto - * - * @param {string} file Proto file name - * @returns {INamespace|null} Root definition or `null` if not defined - */ -common.get = function get(file) { - return common[file] || null; -}; - - -/***/ }), -/* 95 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(1); -var BN = __webpack_require__(2); -var inherits = __webpack_require__(7); -var Base = __webpack_require__(19); - -var assert = utils.assert; - -function ShortCurve(conf) { - Base.call(this, 'short', conf); - - this.a = new BN(conf.a, 16).toRed(this.red); - this.b = new BN(conf.b, 16).toRed(this.red); - this.tinv = this.two.redInvm(); - - this.zeroA = this.a.fromRed().cmpn(0) === 0; - this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0; - - // If the curve is endomorphic, precalculate beta and lambda - this.endo = this._getEndomorphism(conf); - this._endoWnafT1 = new Array(4); - this._endoWnafT2 = new Array(4); -} -inherits(ShortCurve, Base); -module.exports = ShortCurve; - -ShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) { - // No efficient endomorphism - if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1) - return; - - // Compute beta and lambda, that lambda * P = (beta * Px; Py) - var beta; - var lambda; - if (conf.beta) { - beta = new BN(conf.beta, 16).toRed(this.red); - } else { - var betas = this._getEndoRoots(this.p); - // Choose the smallest beta - beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]; - beta = beta.toRed(this.red); - } - if (conf.lambda) { - lambda = new BN(conf.lambda, 16); - } else { - // Choose the lambda that is matching selected beta - var lambdas = this._getEndoRoots(this.n); - if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) { - lambda = lambdas[0]; - } else { - lambda = lambdas[1]; - assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0); - } - } - - // Get basis vectors, used for balanced length-two representation - var basis; - if (conf.basis) { - basis = conf.basis.map(function(vec) { - return { - a: new BN(vec.a, 16), - b: new BN(vec.b, 16), - }; - }); - } else { - basis = this._getEndoBasis(lambda); - } - - return { - beta: beta, - lambda: lambda, - basis: basis, - }; -}; - -ShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) { - // Find roots of for x^2 + x + 1 in F - // Root = (-1 +- Sqrt(-3)) / 2 - // - var red = num === this.p ? this.red : BN.mont(num); - var tinv = new BN(2).toRed(red).redInvm(); - var ntinv = tinv.redNeg(); - - var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv); - - var l1 = ntinv.redAdd(s).fromRed(); - var l2 = ntinv.redSub(s).fromRed(); - return [ l1, l2 ]; -}; - -ShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) { - // aprxSqrt >= sqrt(this.n) - var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)); - - // 3.74 - // Run EGCD, until r(L + 1) < aprxSqrt - var u = lambda; - var v = this.n.clone(); - var x1 = new BN(1); - var y1 = new BN(0); - var x2 = new BN(0); - var y2 = new BN(1); - - // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n) - var a0; - var b0; - // First vector - var a1; - var b1; - // Second vector - var a2; - var b2; - - var prevR; - var i = 0; - var r; - var x; - while (u.cmpn(0) !== 0) { - var q = v.div(u); - r = v.sub(q.mul(u)); - x = x2.sub(q.mul(x1)); - var y = y2.sub(q.mul(y1)); - - if (!a1 && r.cmp(aprxSqrt) < 0) { - a0 = prevR.neg(); - b0 = x1; - a1 = r.neg(); - b1 = x; - } else if (a1 && ++i === 2) { - break; - } - prevR = r; - - v = u; - u = r; - x2 = x1; - x1 = x; - y2 = y1; - y1 = y; - } - a2 = r.neg(); - b2 = x; - - var len1 = a1.sqr().add(b1.sqr()); - var len2 = a2.sqr().add(b2.sqr()); - if (len2.cmp(len1) >= 0) { - a2 = a0; - b2 = b0; - } - - // Normalize signs - if (a1.negative) { - a1 = a1.neg(); - b1 = b1.neg(); - } - if (a2.negative) { - a2 = a2.neg(); - b2 = b2.neg(); - } - - return [ - { a: a1, b: b1 }, - { a: a2, b: b2 }, - ]; -}; - -ShortCurve.prototype._endoSplit = function _endoSplit(k) { - var basis = this.endo.basis; - var v1 = basis[0]; - var v2 = basis[1]; - - var c1 = v2.b.mul(k).divRound(this.n); - var c2 = v1.b.neg().mul(k).divRound(this.n); - - var p1 = c1.mul(v1.a); - var p2 = c2.mul(v2.a); - var q1 = c1.mul(v1.b); - var q2 = c2.mul(v2.b); - - // Calculate answer - var k1 = k.sub(p1).sub(p2); - var k2 = q1.add(q2).neg(); - return { k1: k1, k2: k2 }; -}; - -ShortCurve.prototype.pointFromX = function pointFromX(x, odd) { - x = new BN(x, 16); - if (!x.red) - x = x.toRed(this.red); - - var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b); - var y = y2.redSqrt(); - if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) - throw new Error('invalid point'); - - // XXX Is there any way to tell if the number is odd without converting it - // to non-red form? - var isOdd = y.fromRed().isOdd(); - if (odd && !isOdd || !odd && isOdd) - y = y.redNeg(); - - return this.point(x, y); -}; - -ShortCurve.prototype.validate = function validate(point) { - if (point.inf) - return true; - - var x = point.x; - var y = point.y; - - var ax = this.a.redMul(x); - var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b); - return y.redSqr().redISub(rhs).cmpn(0) === 0; -}; - -ShortCurve.prototype._endoWnafMulAdd = - function _endoWnafMulAdd(points, coeffs, jacobianResult) { - var npoints = this._endoWnafT1; - var ncoeffs = this._endoWnafT2; - for (var i = 0; i < points.length; i++) { - var split = this._endoSplit(coeffs[i]); - var p = points[i]; - var beta = p._getBeta(); - - if (split.k1.negative) { - split.k1.ineg(); - p = p.neg(true); - } - if (split.k2.negative) { - split.k2.ineg(); - beta = beta.neg(true); - } - - npoints[i * 2] = p; - npoints[i * 2 + 1] = beta; - ncoeffs[i * 2] = split.k1; - ncoeffs[i * 2 + 1] = split.k2; - } - var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult); - - // Clean-up references to points and coefficients - for (var j = 0; j < i * 2; j++) { - npoints[j] = null; - ncoeffs[j] = null; - } - return res; - }; - -function Point(curve, x, y, isRed) { - Base.BasePoint.call(this, curve, 'affine'); - if (x === null && y === null) { - this.x = null; - this.y = null; - this.inf = true; - } else { - this.x = new BN(x, 16); - this.y = new BN(y, 16); - // Force redgomery representation when loading from JSON - if (isRed) { - this.x.forceRed(this.curve.red); - this.y.forceRed(this.curve.red); - } - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.y.red) - this.y = this.y.toRed(this.curve.red); - this.inf = false; - } -} -inherits(Point, Base.BasePoint); - -ShortCurve.prototype.point = function point(x, y, isRed) { - return new Point(this, x, y, isRed); -}; - -ShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) { - return Point.fromJSON(this, obj, red); -}; - -Point.prototype._getBeta = function _getBeta() { - if (!this.curve.endo) - return; - - var pre = this.precomputed; - if (pre && pre.beta) - return pre.beta; - - var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y); - if (pre) { - var curve = this.curve; - var endoMul = function(p) { - return curve.point(p.x.redMul(curve.endo.beta), p.y); - }; - pre.beta = beta; - beta.precomputed = { - beta: null, - naf: pre.naf && { - wnd: pre.naf.wnd, - points: pre.naf.points.map(endoMul), - }, - doubles: pre.doubles && { - step: pre.doubles.step, - points: pre.doubles.points.map(endoMul), - }, - }; - } - return beta; -}; - -Point.prototype.toJSON = function toJSON() { - if (!this.precomputed) - return [ this.x, this.y ]; - - return [ this.x, this.y, this.precomputed && { - doubles: this.precomputed.doubles && { - step: this.precomputed.doubles.step, - points: this.precomputed.doubles.points.slice(1), - }, - naf: this.precomputed.naf && { - wnd: this.precomputed.naf.wnd, - points: this.precomputed.naf.points.slice(1), - }, - } ]; -}; - -Point.fromJSON = function fromJSON(curve, obj, red) { - if (typeof obj === 'string') - obj = JSON.parse(obj); - var res = curve.point(obj[0], obj[1], red); - if (!obj[2]) - return res; - - function obj2point(obj) { - return curve.point(obj[0], obj[1], red); - } - - var pre = obj[2]; - res.precomputed = { - beta: null, - doubles: pre.doubles && { - step: pre.doubles.step, - points: [ res ].concat(pre.doubles.points.map(obj2point)), - }, - naf: pre.naf && { - wnd: pre.naf.wnd, - points: [ res ].concat(pre.naf.points.map(obj2point)), - }, - }; - return res; -}; - -Point.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -Point.prototype.isInfinity = function isInfinity() { - return this.inf; -}; - -Point.prototype.add = function add(p) { - // O + P = P - if (this.inf) - return p; - - // P + O = P - if (p.inf) - return this; - - // P + P = 2P - if (this.eq(p)) - return this.dbl(); - - // P + (-P) = O - if (this.neg().eq(p)) - return this.curve.point(null, null); - - // P + Q = O - if (this.x.cmp(p.x) === 0) - return this.curve.point(null, null); - - var c = this.y.redSub(p.y); - if (c.cmpn(0) !== 0) - c = c.redMul(this.x.redSub(p.x).redInvm()); - var nx = c.redSqr().redISub(this.x).redISub(p.x); - var ny = c.redMul(this.x.redSub(nx)).redISub(this.y); - return this.curve.point(nx, ny); -}; - -Point.prototype.dbl = function dbl() { - if (this.inf) - return this; - - // 2P = O - var ys1 = this.y.redAdd(this.y); - if (ys1.cmpn(0) === 0) - return this.curve.point(null, null); - - var a = this.curve.a; - - var x2 = this.x.redSqr(); - var dyinv = ys1.redInvm(); - var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv); - - var nx = c.redSqr().redISub(this.x.redAdd(this.x)); - var ny = c.redMul(this.x.redSub(nx)).redISub(this.y); - return this.curve.point(nx, ny); -}; - -Point.prototype.getX = function getX() { - return this.x.fromRed(); -}; - -Point.prototype.getY = function getY() { - return this.y.fromRed(); -}; - -Point.prototype.mul = function mul(k) { - k = new BN(k, 16); - if (this.isInfinity()) - return this; - else if (this._hasDoubles(k)) - return this.curve._fixedNafMul(this, k); - else if (this.curve.endo) - return this.curve._endoWnafMulAdd([ this ], [ k ]); - else - return this.curve._wnafMul(this, k); -}; - -Point.prototype.mulAdd = function mulAdd(k1, p2, k2) { - var points = [ this, p2 ]; - var coeffs = [ k1, k2 ]; - if (this.curve.endo) - return this.curve._endoWnafMulAdd(points, coeffs); - else - return this.curve._wnafMulAdd(1, points, coeffs, 2); -}; - -Point.prototype.jmulAdd = function jmulAdd(k1, p2, k2) { - var points = [ this, p2 ]; - var coeffs = [ k1, k2 ]; - if (this.curve.endo) - return this.curve._endoWnafMulAdd(points, coeffs, true); - else - return this.curve._wnafMulAdd(1, points, coeffs, 2, true); -}; - -Point.prototype.eq = function eq(p) { - return this === p || - this.inf === p.inf && - (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0); -}; - -Point.prototype.neg = function neg(_precompute) { - if (this.inf) - return this; - - var res = this.curve.point(this.x, this.y.redNeg()); - if (_precompute && this.precomputed) { - var pre = this.precomputed; - var negate = function(p) { - return p.neg(); - }; - res.precomputed = { - naf: pre.naf && { - wnd: pre.naf.wnd, - points: pre.naf.points.map(negate), - }, - doubles: pre.doubles && { - step: pre.doubles.step, - points: pre.doubles.points.map(negate), - }, - }; - } - return res; -}; - -Point.prototype.toJ = function toJ() { - if (this.inf) - return this.curve.jpoint(null, null, null); - - var res = this.curve.jpoint(this.x, this.y, this.curve.one); - return res; -}; - -function JPoint(curve, x, y, z) { - Base.BasePoint.call(this, curve, 'jacobian'); - if (x === null && y === null && z === null) { - this.x = this.curve.one; - this.y = this.curve.one; - this.z = new BN(0); - } else { - this.x = new BN(x, 16); - this.y = new BN(y, 16); - this.z = new BN(z, 16); - } - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.y.red) - this.y = this.y.toRed(this.curve.red); - if (!this.z.red) - this.z = this.z.toRed(this.curve.red); - - this.zOne = this.z === this.curve.one; -} -inherits(JPoint, Base.BasePoint); - -ShortCurve.prototype.jpoint = function jpoint(x, y, z) { - return new JPoint(this, x, y, z); -}; - -JPoint.prototype.toP = function toP() { - if (this.isInfinity()) - return this.curve.point(null, null); - - var zinv = this.z.redInvm(); - var zinv2 = zinv.redSqr(); - var ax = this.x.redMul(zinv2); - var ay = this.y.redMul(zinv2).redMul(zinv); - - return this.curve.point(ax, ay); -}; - -JPoint.prototype.neg = function neg() { - return this.curve.jpoint(this.x, this.y.redNeg(), this.z); -}; - -JPoint.prototype.add = function add(p) { - // O + P = P - if (this.isInfinity()) - return p; - - // P + O = P - if (p.isInfinity()) - return this; - - // 12M + 4S + 7A - var pz2 = p.z.redSqr(); - var z2 = this.z.redSqr(); - var u1 = this.x.redMul(pz2); - var u2 = p.x.redMul(z2); - var s1 = this.y.redMul(pz2.redMul(p.z)); - var s2 = p.y.redMul(z2.redMul(this.z)); - - var h = u1.redSub(u2); - var r = s1.redSub(s2); - if (h.cmpn(0) === 0) { - if (r.cmpn(0) !== 0) - return this.curve.jpoint(null, null, null); - else - return this.dbl(); - } - - var h2 = h.redSqr(); - var h3 = h2.redMul(h); - var v = u1.redMul(h2); - - var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); - var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); - var nz = this.z.redMul(p.z).redMul(h); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.mixedAdd = function mixedAdd(p) { - // O + P = P - if (this.isInfinity()) - return p.toJ(); - - // P + O = P - if (p.isInfinity()) - return this; - - // 8M + 3S + 7A - var z2 = this.z.redSqr(); - var u1 = this.x; - var u2 = p.x.redMul(z2); - var s1 = this.y; - var s2 = p.y.redMul(z2).redMul(this.z); - - var h = u1.redSub(u2); - var r = s1.redSub(s2); - if (h.cmpn(0) === 0) { - if (r.cmpn(0) !== 0) - return this.curve.jpoint(null, null, null); - else - return this.dbl(); - } - - var h2 = h.redSqr(); - var h3 = h2.redMul(h); - var v = u1.redMul(h2); - - var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); - var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); - var nz = this.z.redMul(h); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.dblp = function dblp(pow) { - if (pow === 0) - return this; - if (this.isInfinity()) - return this; - if (!pow) - return this.dbl(); - - var i; - if (this.curve.zeroA || this.curve.threeA) { - var r = this; - for (i = 0; i < pow; i++) - r = r.dbl(); - return r; - } - - // 1M + 2S + 1A + N * (4S + 5M + 8A) - // N = 1 => 6M + 6S + 9A - var a = this.curve.a; - var tinv = this.curve.tinv; - - var jx = this.x; - var jy = this.y; - var jz = this.z; - var jz4 = jz.redSqr().redSqr(); - - // Reuse results - var jyd = jy.redAdd(jy); - for (i = 0; i < pow; i++) { - var jx2 = jx.redSqr(); - var jyd2 = jyd.redSqr(); - var jyd4 = jyd2.redSqr(); - var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)); - - var t1 = jx.redMul(jyd2); - var nx = c.redSqr().redISub(t1.redAdd(t1)); - var t2 = t1.redISub(nx); - var dny = c.redMul(t2); - dny = dny.redIAdd(dny).redISub(jyd4); - var nz = jyd.redMul(jz); - if (i + 1 < pow) - jz4 = jz4.redMul(jyd4); - - jx = nx; - jz = nz; - jyd = dny; - } - - return this.curve.jpoint(jx, jyd.redMul(tinv), jz); -}; - -JPoint.prototype.dbl = function dbl() { - if (this.isInfinity()) - return this; - - if (this.curve.zeroA) - return this._zeroDbl(); - else if (this.curve.threeA) - return this._threeDbl(); - else - return this._dbl(); -}; - -JPoint.prototype._zeroDbl = function _zeroDbl() { - var nx; - var ny; - var nz; - // Z = 1 - if (this.zOne) { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html - // #doubling-mdbl-2007-bl - // 1M + 5S + 14A - - // XX = X1^2 - var xx = this.x.redSqr(); - // YY = Y1^2 - var yy = this.y.redSqr(); - // YYYY = YY^2 - var yyyy = yy.redSqr(); - // S = 2 * ((X1 + YY)^2 - XX - YYYY) - var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); - s = s.redIAdd(s); - // M = 3 * XX + a; a = 0 - var m = xx.redAdd(xx).redIAdd(xx); - // T = M ^ 2 - 2*S - var t = m.redSqr().redISub(s).redISub(s); - - // 8 * YYYY - var yyyy8 = yyyy.redIAdd(yyyy); - yyyy8 = yyyy8.redIAdd(yyyy8); - yyyy8 = yyyy8.redIAdd(yyyy8); - - // X3 = T - nx = t; - // Y3 = M * (S - T) - 8 * YYYY - ny = m.redMul(s.redISub(t)).redISub(yyyy8); - // Z3 = 2*Y1 - nz = this.y.redAdd(this.y); - } else { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html - // #doubling-dbl-2009-l - // 2M + 5S + 13A - - // A = X1^2 - var a = this.x.redSqr(); - // B = Y1^2 - var b = this.y.redSqr(); - // C = B^2 - var c = b.redSqr(); - // D = 2 * ((X1 + B)^2 - A - C) - var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c); - d = d.redIAdd(d); - // E = 3 * A - var e = a.redAdd(a).redIAdd(a); - // F = E^2 - var f = e.redSqr(); - - // 8 * C - var c8 = c.redIAdd(c); - c8 = c8.redIAdd(c8); - c8 = c8.redIAdd(c8); - - // X3 = F - 2 * D - nx = f.redISub(d).redISub(d); - // Y3 = E * (D - X3) - 8 * C - ny = e.redMul(d.redISub(nx)).redISub(c8); - // Z3 = 2 * Y1 * Z1 - nz = this.y.redMul(this.z); - nz = nz.redIAdd(nz); - } - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype._threeDbl = function _threeDbl() { - var nx; - var ny; - var nz; - // Z = 1 - if (this.zOne) { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html - // #doubling-mdbl-2007-bl - // 1M + 5S + 15A - - // XX = X1^2 - var xx = this.x.redSqr(); - // YY = Y1^2 - var yy = this.y.redSqr(); - // YYYY = YY^2 - var yyyy = yy.redSqr(); - // S = 2 * ((X1 + YY)^2 - XX - YYYY) - var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); - s = s.redIAdd(s); - // M = 3 * XX + a - var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a); - // T = M^2 - 2 * S - var t = m.redSqr().redISub(s).redISub(s); - // X3 = T - nx = t; - // Y3 = M * (S - T) - 8 * YYYY - var yyyy8 = yyyy.redIAdd(yyyy); - yyyy8 = yyyy8.redIAdd(yyyy8); - yyyy8 = yyyy8.redIAdd(yyyy8); - ny = m.redMul(s.redISub(t)).redISub(yyyy8); - // Z3 = 2 * Y1 - nz = this.y.redAdd(this.y); - } else { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b - // 3M + 5S - - // delta = Z1^2 - var delta = this.z.redSqr(); - // gamma = Y1^2 - var gamma = this.y.redSqr(); - // beta = X1 * gamma - var beta = this.x.redMul(gamma); - // alpha = 3 * (X1 - delta) * (X1 + delta) - var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta)); - alpha = alpha.redAdd(alpha).redIAdd(alpha); - // X3 = alpha^2 - 8 * beta - var beta4 = beta.redIAdd(beta); - beta4 = beta4.redIAdd(beta4); - var beta8 = beta4.redAdd(beta4); - nx = alpha.redSqr().redISub(beta8); - // Z3 = (Y1 + Z1)^2 - gamma - delta - nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta); - // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2 - var ggamma8 = gamma.redSqr(); - ggamma8 = ggamma8.redIAdd(ggamma8); - ggamma8 = ggamma8.redIAdd(ggamma8); - ggamma8 = ggamma8.redIAdd(ggamma8); - ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8); - } - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype._dbl = function _dbl() { - var a = this.curve.a; - - // 4M + 6S + 10A - var jx = this.x; - var jy = this.y; - var jz = this.z; - var jz4 = jz.redSqr().redSqr(); - - var jx2 = jx.redSqr(); - var jy2 = jy.redSqr(); - - var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)); - - var jxd4 = jx.redAdd(jx); - jxd4 = jxd4.redIAdd(jxd4); - var t1 = jxd4.redMul(jy2); - var nx = c.redSqr().redISub(t1.redAdd(t1)); - var t2 = t1.redISub(nx); - - var jyd8 = jy2.redSqr(); - jyd8 = jyd8.redIAdd(jyd8); - jyd8 = jyd8.redIAdd(jyd8); - jyd8 = jyd8.redIAdd(jyd8); - var ny = c.redMul(t2).redISub(jyd8); - var nz = jy.redAdd(jy).redMul(jz); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.trpl = function trpl() { - if (!this.curve.zeroA) - return this.dbl().add(this); - - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl - // 5M + 10S + ... - - // XX = X1^2 - var xx = this.x.redSqr(); - // YY = Y1^2 - var yy = this.y.redSqr(); - // ZZ = Z1^2 - var zz = this.z.redSqr(); - // YYYY = YY^2 - var yyyy = yy.redSqr(); - // M = 3 * XX + a * ZZ2; a = 0 - var m = xx.redAdd(xx).redIAdd(xx); - // MM = M^2 - var mm = m.redSqr(); - // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM - var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); - e = e.redIAdd(e); - e = e.redAdd(e).redIAdd(e); - e = e.redISub(mm); - // EE = E^2 - var ee = e.redSqr(); - // T = 16*YYYY - var t = yyyy.redIAdd(yyyy); - t = t.redIAdd(t); - t = t.redIAdd(t); - t = t.redIAdd(t); - // U = (M + E)^2 - MM - EE - T - var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t); - // X3 = 4 * (X1 * EE - 4 * YY * U) - var yyu4 = yy.redMul(u); - yyu4 = yyu4.redIAdd(yyu4); - yyu4 = yyu4.redIAdd(yyu4); - var nx = this.x.redMul(ee).redISub(yyu4); - nx = nx.redIAdd(nx); - nx = nx.redIAdd(nx); - // Y3 = 8 * Y1 * (U * (T - U) - E * EE) - var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee))); - ny = ny.redIAdd(ny); - ny = ny.redIAdd(ny); - ny = ny.redIAdd(ny); - // Z3 = (Z1 + E)^2 - ZZ - EE - var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.mul = function mul(k, kbase) { - k = new BN(k, kbase); - - return this.curve._wnafMul(this, k); -}; - -JPoint.prototype.eq = function eq(p) { - if (p.type === 'affine') - return this.eq(p.toJ()); - - if (this === p) - return true; - - // x1 * z2^2 == x2 * z1^2 - var z2 = this.z.redSqr(); - var pz2 = p.z.redSqr(); - if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) - return false; - - // y1 * z2^3 == y2 * z1^3 - var z3 = z2.redMul(this.z); - var pz3 = pz2.redMul(p.z); - return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0; -}; - -JPoint.prototype.eqXToP = function eqXToP(x) { - var zs = this.z.redSqr(); - var rx = x.toRed(this.curve.red).redMul(zs); - if (this.x.cmp(rx) === 0) - return true; - - var xc = x.clone(); - var t = this.curve.redN.redMul(zs); - for (;;) { - xc.iadd(this.curve.n); - if (xc.cmp(this.curve.p) >= 0) - return false; - - rx.redIAdd(t); - if (this.x.cmp(rx) === 0) - return true; - } -}; - -JPoint.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -JPoint.prototype.isInfinity = function isInfinity() { - // XXX This code assumes that zero is always zero in red - return this.z.cmpn(0) === 0; -}; - - -/***/ }), -/* 96 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(2); -var inherits = __webpack_require__(7); -var Base = __webpack_require__(19); - -var utils = __webpack_require__(1); - -function MontCurve(conf) { - Base.call(this, 'mont', conf); - - this.a = new BN(conf.a, 16).toRed(this.red); - this.b = new BN(conf.b, 16).toRed(this.red); - this.i4 = new BN(4).toRed(this.red).redInvm(); - this.two = new BN(2).toRed(this.red); - this.a24 = this.i4.redMul(this.a.redAdd(this.two)); -} -inherits(MontCurve, Base); -module.exports = MontCurve; - -MontCurve.prototype.validate = function validate(point) { - var x = point.normalize().x; - var x2 = x.redSqr(); - var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x); - var y = rhs.redSqrt(); - - return y.redSqr().cmp(rhs) === 0; -}; - -function Point(curve, x, z) { - Base.BasePoint.call(this, curve, 'projective'); - if (x === null && z === null) { - this.x = this.curve.one; - this.z = this.curve.zero; - } else { - this.x = new BN(x, 16); - this.z = new BN(z, 16); - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.z.red) - this.z = this.z.toRed(this.curve.red); - } -} -inherits(Point, Base.BasePoint); - -MontCurve.prototype.decodePoint = function decodePoint(bytes, enc) { - return this.point(utils.toArray(bytes, enc), 1); -}; - -MontCurve.prototype.point = function point(x, z) { - return new Point(this, x, z); -}; - -MontCurve.prototype.pointFromJSON = function pointFromJSON(obj) { - return Point.fromJSON(this, obj); -}; - -Point.prototype.precompute = function precompute() { - // No-op -}; - -Point.prototype._encode = function _encode() { - return this.getX().toArray('be', this.curve.p.byteLength()); -}; - -Point.fromJSON = function fromJSON(curve, obj) { - return new Point(curve, obj[0], obj[1] || curve.one); -}; - -Point.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -Point.prototype.isInfinity = function isInfinity() { - // XXX This code assumes that zero is always zero in red - return this.z.cmpn(0) === 0; -}; - -Point.prototype.dbl = function dbl() { - // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3 - // 2M + 2S + 4A - - // A = X1 + Z1 - var a = this.x.redAdd(this.z); - // AA = A^2 - var aa = a.redSqr(); - // B = X1 - Z1 - var b = this.x.redSub(this.z); - // BB = B^2 - var bb = b.redSqr(); - // C = AA - BB - var c = aa.redSub(bb); - // X3 = AA * BB - var nx = aa.redMul(bb); - // Z3 = C * (BB + A24 * C) - var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c))); - return this.curve.point(nx, nz); -}; - -Point.prototype.add = function add() { - throw new Error('Not supported on Montgomery curve'); -}; - -Point.prototype.diffAdd = function diffAdd(p, diff) { - // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3 - // 4M + 2S + 6A - - // A = X2 + Z2 - var a = this.x.redAdd(this.z); - // B = X2 - Z2 - var b = this.x.redSub(this.z); - // C = X3 + Z3 - var c = p.x.redAdd(p.z); - // D = X3 - Z3 - var d = p.x.redSub(p.z); - // DA = D * A - var da = d.redMul(a); - // CB = C * B - var cb = c.redMul(b); - // X5 = Z1 * (DA + CB)^2 - var nx = diff.z.redMul(da.redAdd(cb).redSqr()); - // Z5 = X1 * (DA - CB)^2 - var nz = diff.x.redMul(da.redISub(cb).redSqr()); - return this.curve.point(nx, nz); -}; - -Point.prototype.mul = function mul(k) { - var t = k.clone(); - var a = this; // (N / 2) * Q + Q - var b = this.curve.point(null, null); // (N / 2) * Q - var c = this; // Q - - for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1)) - bits.push(t.andln(1)); - - for (var i = bits.length - 1; i >= 0; i--) { - if (bits[i] === 0) { - // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q - a = a.diffAdd(b, c); - // N * Q = 2 * ((N / 2) * Q + Q)) - b = b.dbl(); - } else { - // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q) - b = a.diffAdd(b, c); - // N * Q + Q = 2 * ((N / 2) * Q + Q) - a = a.dbl(); - } - } - return b; -}; - -Point.prototype.mulAdd = function mulAdd() { - throw new Error('Not supported on Montgomery curve'); -}; - -Point.prototype.jumlAdd = function jumlAdd() { - throw new Error('Not supported on Montgomery curve'); -}; - -Point.prototype.eq = function eq(other) { - return this.getX().cmp(other.getX()) === 0; -}; - -Point.prototype.normalize = function normalize() { - this.x = this.x.redMul(this.z.redInvm()); - this.z = this.curve.one; - return this; -}; - -Point.prototype.getX = function getX() { - // Normalize coordinates - this.normalize(); - - return this.x.fromRed(); -}; - - -/***/ }), -/* 97 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(1); -var BN = __webpack_require__(2); -var inherits = __webpack_require__(7); -var Base = __webpack_require__(19); - -var assert = utils.assert; - -function EdwardsCurve(conf) { - // NOTE: Important as we are creating point in Base.call() - this.twisted = (conf.a | 0) !== 1; - this.mOneA = this.twisted && (conf.a | 0) === -1; - this.extended = this.mOneA; - - Base.call(this, 'edwards', conf); - - this.a = new BN(conf.a, 16).umod(this.red.m); - this.a = this.a.toRed(this.red); - this.c = new BN(conf.c, 16).toRed(this.red); - this.c2 = this.c.redSqr(); - this.d = new BN(conf.d, 16).toRed(this.red); - this.dd = this.d.redAdd(this.d); - - assert(!this.twisted || this.c.fromRed().cmpn(1) === 0); - this.oneC = (conf.c | 0) === 1; -} -inherits(EdwardsCurve, Base); -module.exports = EdwardsCurve; - -EdwardsCurve.prototype._mulA = function _mulA(num) { - if (this.mOneA) - return num.redNeg(); - else - return this.a.redMul(num); -}; - -EdwardsCurve.prototype._mulC = function _mulC(num) { - if (this.oneC) - return num; - else - return this.c.redMul(num); -}; - -// Just for compatibility with Short curve -EdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) { - return this.point(x, y, z, t); -}; - -EdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) { - x = new BN(x, 16); - if (!x.red) - x = x.toRed(this.red); - - var x2 = x.redSqr(); - var rhs = this.c2.redSub(this.a.redMul(x2)); - var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)); - - var y2 = rhs.redMul(lhs.redInvm()); - var y = y2.redSqrt(); - if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) - throw new Error('invalid point'); - - var isOdd = y.fromRed().isOdd(); - if (odd && !isOdd || !odd && isOdd) - y = y.redNeg(); - - return this.point(x, y); -}; - -EdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) { - y = new BN(y, 16); - if (!y.red) - y = y.toRed(this.red); - - // x^2 = (y^2 - c^2) / (c^2 d y^2 - a) - var y2 = y.redSqr(); - var lhs = y2.redSub(this.c2); - var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a); - var x2 = lhs.redMul(rhs.redInvm()); - - if (x2.cmp(this.zero) === 0) { - if (odd) - throw new Error('invalid point'); - else - return this.point(this.zero, y); - } - - var x = x2.redSqrt(); - if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) - throw new Error('invalid point'); - - if (x.fromRed().isOdd() !== odd) - x = x.redNeg(); - - return this.point(x, y); -}; - -EdwardsCurve.prototype.validate = function validate(point) { - if (point.isInfinity()) - return true; - - // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2) - point.normalize(); - - var x2 = point.x.redSqr(); - var y2 = point.y.redSqr(); - var lhs = x2.redMul(this.a).redAdd(y2); - var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2))); - - return lhs.cmp(rhs) === 0; -}; - -function Point(curve, x, y, z, t) { - Base.BasePoint.call(this, curve, 'projective'); - if (x === null && y === null && z === null) { - this.x = this.curve.zero; - this.y = this.curve.one; - this.z = this.curve.one; - this.t = this.curve.zero; - this.zOne = true; - } else { - this.x = new BN(x, 16); - this.y = new BN(y, 16); - this.z = z ? new BN(z, 16) : this.curve.one; - this.t = t && new BN(t, 16); - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.y.red) - this.y = this.y.toRed(this.curve.red); - if (!this.z.red) - this.z = this.z.toRed(this.curve.red); - if (this.t && !this.t.red) - this.t = this.t.toRed(this.curve.red); - this.zOne = this.z === this.curve.one; - - // Use extended coordinates - if (this.curve.extended && !this.t) { - this.t = this.x.redMul(this.y); - if (!this.zOne) - this.t = this.t.redMul(this.z.redInvm()); - } - } -} -inherits(Point, Base.BasePoint); - -EdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) { - return Point.fromJSON(this, obj); -}; - -EdwardsCurve.prototype.point = function point(x, y, z, t) { - return new Point(this, x, y, z, t); -}; - -Point.fromJSON = function fromJSON(curve, obj) { - return new Point(curve, obj[0], obj[1], obj[2]); -}; - -Point.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -Point.prototype.isInfinity = function isInfinity() { - // XXX This code assumes that zero is always zero in red - return this.x.cmpn(0) === 0 && - (this.y.cmp(this.z) === 0 || - (this.zOne && this.y.cmp(this.curve.c) === 0)); -}; - -Point.prototype._extDbl = function _extDbl() { - // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html - // #doubling-dbl-2008-hwcd - // 4M + 4S - - // A = X1^2 - var a = this.x.redSqr(); - // B = Y1^2 - var b = this.y.redSqr(); - // C = 2 * Z1^2 - var c = this.z.redSqr(); - c = c.redIAdd(c); - // D = a * A - var d = this.curve._mulA(a); - // E = (X1 + Y1)^2 - A - B - var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b); - // G = D + B - var g = d.redAdd(b); - // F = G - C - var f = g.redSub(c); - // H = D - B - var h = d.redSub(b); - // X3 = E * F - var nx = e.redMul(f); - // Y3 = G * H - var ny = g.redMul(h); - // T3 = E * H - var nt = e.redMul(h); - // Z3 = F * G - var nz = f.redMul(g); - return this.curve.point(nx, ny, nz, nt); -}; - -Point.prototype._projDbl = function _projDbl() { - // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html - // #doubling-dbl-2008-bbjlp - // #doubling-dbl-2007-bl - // and others - // Generally 3M + 4S or 2M + 4S - - // B = (X1 + Y1)^2 - var b = this.x.redAdd(this.y).redSqr(); - // C = X1^2 - var c = this.x.redSqr(); - // D = Y1^2 - var d = this.y.redSqr(); - - var nx; - var ny; - var nz; - var e; - var h; - var j; - if (this.curve.twisted) { - // E = a * C - e = this.curve._mulA(c); - // F = E + D - var f = e.redAdd(d); - if (this.zOne) { - // X3 = (B - C - D) * (F - 2) - nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two)); - // Y3 = F * (E - D) - ny = f.redMul(e.redSub(d)); - // Z3 = F^2 - 2 * F - nz = f.redSqr().redSub(f).redSub(f); - } else { - // H = Z1^2 - h = this.z.redSqr(); - // J = F - 2 * H - j = f.redSub(h).redISub(h); - // X3 = (B-C-D)*J - nx = b.redSub(c).redISub(d).redMul(j); - // Y3 = F * (E - D) - ny = f.redMul(e.redSub(d)); - // Z3 = F * J - nz = f.redMul(j); - } - } else { - // E = C + D - e = c.redAdd(d); - // H = (c * Z1)^2 - h = this.curve._mulC(this.z).redSqr(); - // J = E - 2 * H - j = e.redSub(h).redSub(h); - // X3 = c * (B - E) * J - nx = this.curve._mulC(b.redISub(e)).redMul(j); - // Y3 = c * E * (C - D) - ny = this.curve._mulC(e).redMul(c.redISub(d)); - // Z3 = E * J - nz = e.redMul(j); - } - return this.curve.point(nx, ny, nz); -}; - -Point.prototype.dbl = function dbl() { - if (this.isInfinity()) - return this; - - // Double in extended coordinates - if (this.curve.extended) - return this._extDbl(); - else - return this._projDbl(); -}; - -Point.prototype._extAdd = function _extAdd(p) { - // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html - // #addition-add-2008-hwcd-3 - // 8M - - // A = (Y1 - X1) * (Y2 - X2) - var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)); - // B = (Y1 + X1) * (Y2 + X2) - var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)); - // C = T1 * k * T2 - var c = this.t.redMul(this.curve.dd).redMul(p.t); - // D = Z1 * 2 * Z2 - var d = this.z.redMul(p.z.redAdd(p.z)); - // E = B - A - var e = b.redSub(a); - // F = D - C - var f = d.redSub(c); - // G = D + C - var g = d.redAdd(c); - // H = B + A - var h = b.redAdd(a); - // X3 = E * F - var nx = e.redMul(f); - // Y3 = G * H - var ny = g.redMul(h); - // T3 = E * H - var nt = e.redMul(h); - // Z3 = F * G - var nz = f.redMul(g); - return this.curve.point(nx, ny, nz, nt); -}; - -Point.prototype._projAdd = function _projAdd(p) { - // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html - // #addition-add-2008-bbjlp - // #addition-add-2007-bl - // 10M + 1S - - // A = Z1 * Z2 - var a = this.z.redMul(p.z); - // B = A^2 - var b = a.redSqr(); - // C = X1 * X2 - var c = this.x.redMul(p.x); - // D = Y1 * Y2 - var d = this.y.redMul(p.y); - // E = d * C * D - var e = this.curve.d.redMul(c).redMul(d); - // F = B - E - var f = b.redSub(e); - // G = B + E - var g = b.redAdd(e); - // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D) - var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d); - var nx = a.redMul(f).redMul(tmp); - var ny; - var nz; - if (this.curve.twisted) { - // Y3 = A * G * (D - a * C) - ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c))); - // Z3 = F * G - nz = f.redMul(g); - } else { - // Y3 = A * G * (D - C) - ny = a.redMul(g).redMul(d.redSub(c)); - // Z3 = c * F * G - nz = this.curve._mulC(f).redMul(g); - } - return this.curve.point(nx, ny, nz); -}; - -Point.prototype.add = function add(p) { - if (this.isInfinity()) - return p; - if (p.isInfinity()) - return this; - - if (this.curve.extended) - return this._extAdd(p); - else - return this._projAdd(p); -}; - -Point.prototype.mul = function mul(k) { - if (this._hasDoubles(k)) - return this.curve._fixedNafMul(this, k); - else - return this.curve._wnafMul(this, k); -}; - -Point.prototype.mulAdd = function mulAdd(k1, p, k2) { - return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false); -}; - -Point.prototype.jmulAdd = function jmulAdd(k1, p, k2) { - return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true); -}; - -Point.prototype.normalize = function normalize() { - if (this.zOne) - return this; - - // Normalize coordinates - var zi = this.z.redInvm(); - this.x = this.x.redMul(zi); - this.y = this.y.redMul(zi); - if (this.t) - this.t = this.t.redMul(zi); - this.z = this.curve.one; - this.zOne = true; - return this; -}; - -Point.prototype.neg = function neg() { - return this.curve.point(this.x.redNeg(), - this.y, - this.z, - this.t && this.t.redNeg()); -}; - -Point.prototype.getX = function getX() { - this.normalize(); - return this.x.fromRed(); -}; - -Point.prototype.getY = function getY() { - this.normalize(); - return this.y.fromRed(); -}; - -Point.prototype.eq = function eq(other) { - return this === other || - this.getX().cmp(other.getX()) === 0 && - this.getY().cmp(other.getY()) === 0; -}; - -Point.prototype.eqXToP = function eqXToP(x) { - var rx = x.toRed(this.curve.red).redMul(this.z); - if (this.x.cmp(rx) === 0) - return true; - - var xc = x.clone(); - var t = this.curve.redN.redMul(this.z); - for (;;) { - xc.iadd(this.curve.n); - if (xc.cmp(this.curve.p) >= 0) - return false; - - rx.redIAdd(t); - if (this.x.cmp(rx) === 0) - return true; - } -}; - -// Compatibility with BaseCurve -Point.prototype.toP = Point.prototype.normalize; -Point.prototype.mixedAdd = Point.prototype.add; - - -/***/ }), -/* 98 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var common = __webpack_require__(20); -var shaCommon = __webpack_require__(99); - -var rotl32 = utils.rotl32; -var sum32 = utils.sum32; -var sum32_5 = utils.sum32_5; -var ft_1 = shaCommon.ft_1; -var BlockHash = common.BlockHash; - -var sha1_K = [ - 0x5A827999, 0x6ED9EBA1, - 0x8F1BBCDC, 0xCA62C1D6 -]; - -function SHA1() { - if (!(this instanceof SHA1)) - return new SHA1(); - - BlockHash.call(this); - this.h = [ - 0x67452301, 0xefcdab89, 0x98badcfe, - 0x10325476, 0xc3d2e1f0 ]; - this.W = new Array(80); -} - -utils.inherits(SHA1, BlockHash); -module.exports = SHA1; - -SHA1.blockSize = 512; -SHA1.outSize = 160; -SHA1.hmacStrength = 80; -SHA1.padLength = 64; - -SHA1.prototype._update = function _update(msg, start) { - var W = this.W; - - for (var i = 0; i < 16; i++) - W[i] = msg[start + i]; - - for(; i < W.length; i++) - W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1); - - var a = this.h[0]; - var b = this.h[1]; - var c = this.h[2]; - var d = this.h[3]; - var e = this.h[4]; - - for (i = 0; i < W.length; i++) { - var s = ~~(i / 20); - var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]); - e = d; - d = c; - c = rotl32(b, 30); - b = a; - a = t; - } - - this.h[0] = sum32(this.h[0], a); - this.h[1] = sum32(this.h[1], b); - this.h[2] = sum32(this.h[2], c); - this.h[3] = sum32(this.h[3], d); - this.h[4] = sum32(this.h[4], e); -}; - -SHA1.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'big'); - else - return utils.split32(this.h, 'big'); -}; - - -/***/ }), -/* 99 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var rotr32 = utils.rotr32; - -function ft_1(s, x, y, z) { - if (s === 0) - return ch32(x, y, z); - if (s === 1 || s === 3) - return p32(x, y, z); - if (s === 2) - return maj32(x, y, z); -} -exports.ft_1 = ft_1; - -function ch32(x, y, z) { - return (x & y) ^ ((~x) & z); -} -exports.ch32 = ch32; - -function maj32(x, y, z) { - return (x & y) ^ (x & z) ^ (y & z); -} -exports.maj32 = maj32; - -function p32(x, y, z) { - return x ^ y ^ z; -} -exports.p32 = p32; - -function s0_256(x) { - return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22); -} -exports.s0_256 = s0_256; - -function s1_256(x) { - return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25); -} -exports.s1_256 = s1_256; - -function g0_256(x) { - return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3); -} -exports.g0_256 = g0_256; - -function g1_256(x) { - return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10); -} -exports.g1_256 = g1_256; - - -/***/ }), -/* 100 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var SHA256 = __webpack_require__(52); - -function SHA224() { - if (!(this instanceof SHA224)) - return new SHA224(); - - SHA256.call(this); - this.h = [ - 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, - 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ]; -} -utils.inherits(SHA224, SHA256); -module.exports = SHA224; - -SHA224.blockSize = 512; -SHA224.outSize = 224; -SHA224.hmacStrength = 192; -SHA224.padLength = 64; - -SHA224.prototype._digest = function digest(enc) { - // Just truncate output - if (enc === 'hex') - return utils.toHex32(this.h.slice(0, 7), 'big'); - else - return utils.split32(this.h.slice(0, 7), 'big'); -}; - - - -/***/ }), -/* 101 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); - -var SHA512 = __webpack_require__(53); - -function SHA384() { - if (!(this instanceof SHA384)) - return new SHA384(); - - SHA512.call(this); - this.h = [ - 0xcbbb9d5d, 0xc1059ed8, - 0x629a292a, 0x367cd507, - 0x9159015a, 0x3070dd17, - 0x152fecd8, 0xf70e5939, - 0x67332667, 0xffc00b31, - 0x8eb44a87, 0x68581511, - 0xdb0c2e0d, 0x64f98fa7, - 0x47b5481d, 0xbefa4fa4 ]; -} -utils.inherits(SHA384, SHA512); -module.exports = SHA384; - -SHA384.blockSize = 1024; -SHA384.outSize = 384; -SHA384.hmacStrength = 192; -SHA384.padLength = 128; - -SHA384.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h.slice(0, 12), 'big'); - else - return utils.split32(this.h.slice(0, 12), 'big'); -}; - - -/***/ }), -/* 102 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var assert = __webpack_require__(12); - -function Hmac(hash, key, enc) { - if (!(this instanceof Hmac)) - return new Hmac(hash, key, enc); - this.Hash = hash; - this.blockSize = hash.blockSize / 8; - this.outSize = hash.outSize / 8; - this.inner = null; - this.outer = null; - - this._init(utils.toArray(key, enc)); -} -module.exports = Hmac; - -Hmac.prototype._init = function init(key) { - // Shorten key, if needed - if (key.length > this.blockSize) - key = new this.Hash().update(key).digest(); - assert(key.length <= this.blockSize); - - // Add padding to key - for (var i = key.length; i < this.blockSize; i++) - key.push(0); - - for (i = 0; i < key.length; i++) - key[i] ^= 0x36; - this.inner = new this.Hash().update(key); - - // 0x36 ^ 0x5c = 0x6a - for (i = 0; i < key.length; i++) - key[i] ^= 0x6a; - this.outer = new this.Hash().update(key); -}; - -Hmac.prototype.update = function update(msg, enc) { - this.inner.update(msg, enc); - return this; -}; - -Hmac.prototype.digest = function digest(enc) { - this.outer.update(this.inner.digest()); - return this.outer.digest(enc); -}; - - -/***/ }), -/* 103 */ -/***/ ((module) => { - -module.exports = { - doubles: { - step: 4, - points: [ - [ - 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a', - 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821', - ], - [ - '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508', - '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf', - ], - [ - '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739', - 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695', - ], - [ - '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640', - '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9', - ], - [ - '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c', - '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36', - ], - [ - '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda', - '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f', - ], - [ - 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa', - '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999', - ], - [ - '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0', - 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09', - ], - [ - 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d', - '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d', - ], - [ - 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d', - 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088', - ], - [ - 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1', - '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d', - ], - [ - '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0', - '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8', - ], - [ - '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047', - '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a', - ], - [ - '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862', - '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453', - ], - [ - '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7', - '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160', - ], - [ - '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd', - '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0', - ], - [ - '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83', - '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6', - ], - [ - '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a', - '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589', - ], - [ - '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8', - 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17', - ], - [ - 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d', - '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda', - ], - [ - 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725', - '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd', - ], - [ - '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754', - '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2', - ], - [ - '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c', - '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6', - ], - [ - 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6', - '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f', - ], - [ - '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39', - 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01', - ], - [ - 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891', - '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3', - ], - [ - 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b', - 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f', - ], - [ - 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03', - '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7', - ], - [ - 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d', - 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78', - ], - [ - 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070', - '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1', - ], - [ - '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4', - 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150', - ], - [ - '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da', - '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82', - ], - [ - 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11', - '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc', - ], - [ - '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e', - 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b', - ], - [ - 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41', - '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51', - ], - [ - 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef', - '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45', - ], - [ - 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8', - 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120', - ], - [ - '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d', - '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84', - ], - [ - '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96', - '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d', - ], - [ - '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd', - 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d', - ], - [ - '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5', - '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8', - ], - [ - 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266', - '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8', - ], - [ - '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71', - '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac', - ], - [ - '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac', - 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f', - ], - [ - '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751', - '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962', - ], - [ - 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e', - '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907', - ], - [ - '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241', - 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec', - ], - [ - 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3', - 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d', - ], - [ - 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f', - '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414', - ], - [ - '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19', - 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd', - ], - [ - '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be', - 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0', - ], - [ - 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9', - '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811', - ], - [ - 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2', - '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1', - ], - [ - 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13', - '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c', - ], - [ - '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c', - 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73', - ], - [ - '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba', - '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd', - ], - [ - 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151', - 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405', - ], - [ - '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073', - 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589', - ], - [ - '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458', - '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e', - ], - [ - '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b', - '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27', - ], - [ - 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366', - 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1', - ], - [ - '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa', - '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482', - ], - [ - '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0', - '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945', - ], - [ - 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787', - '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573', - ], - [ - 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e', - 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82', - ], - ], - }, - naf: { - wnd: 7, - points: [ - [ - 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9', - '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672', - ], - [ - '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4', - 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6', - ], - [ - '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc', - '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da', - ], - [ - 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe', - 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37', - ], - [ - '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb', - 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b', - ], - [ - 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8', - 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81', - ], - [ - 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e', - '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58', - ], - [ - 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34', - '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77', - ], - [ - '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c', - '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a', - ], - [ - '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5', - '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c', - ], - [ - '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f', - '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67', - ], - [ - '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714', - '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402', - ], - [ - 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729', - 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55', - ], - [ - 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db', - '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482', - ], - [ - '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4', - 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82', - ], - [ - '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5', - 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396', - ], - [ - '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479', - '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49', - ], - [ - '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d', - '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf', - ], - [ - '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f', - '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a', - ], - [ - '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb', - 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7', - ], - [ - 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9', - 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933', - ], - [ - '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963', - '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a', - ], - [ - '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74', - '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6', - ], - [ - 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530', - 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37', - ], - [ - '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b', - '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e', - ], - [ - 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247', - 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6', - ], - [ - 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1', - 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476', - ], - [ - '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120', - '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40', - ], - [ - '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435', - '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61', - ], - [ - '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18', - '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683', - ], - [ - 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8', - '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5', - ], - [ - '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb', - '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b', - ], - [ - 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f', - '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417', - ], - [ - '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143', - 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868', - ], - [ - '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba', - 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a', - ], - [ - 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45', - 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6', - ], - [ - '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a', - '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996', - ], - [ - '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e', - 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e', - ], - [ - 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8', - 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d', - ], - [ - '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c', - '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2', - ], - [ - '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519', - 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e', - ], - [ - '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab', - '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437', - ], - [ - '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca', - 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311', - ], - [ - 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf', - '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4', - ], - [ - '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610', - '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575', - ], - [ - '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4', - 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d', - ], - [ - '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c', - 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d', - ], - [ - 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940', - 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629', - ], - [ - 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980', - 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06', - ], - [ - '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3', - '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374', - ], - [ - '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf', - '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee', - ], - [ - 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63', - '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1', - ], - [ - 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448', - 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b', - ], - [ - '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf', - '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661', - ], - [ - '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5', - '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6', - ], - [ - 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6', - '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e', - ], - [ - '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5', - '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d', - ], - [ - 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99', - 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc', - ], - [ - '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51', - 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4', - ], - [ - '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5', - '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c', - ], - [ - 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5', - '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b', - ], - [ - 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997', - '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913', - ], - [ - '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881', - '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154', - ], - [ - '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5', - '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865', - ], - [ - '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66', - 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc', - ], - [ - '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726', - 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224', - ], - [ - '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede', - '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e', - ], - [ - '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94', - '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6', - ], - [ - '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31', - '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511', - ], - [ - '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51', - 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b', - ], - [ - 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252', - 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2', - ], - [ - '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5', - 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c', - ], - [ - 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b', - '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3', - ], - [ - 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4', - '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d', - ], - [ - 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f', - '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700', - ], - [ - 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889', - '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4', - ], - [ - '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246', - 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196', - ], - [ - '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984', - '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4', - ], - [ - '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a', - 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257', - ], - [ - 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030', - 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13', - ], - [ - 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197', - '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096', - ], - [ - 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593', - 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38', - ], - [ - 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef', - '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f', - ], - [ - '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38', - '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448', - ], - [ - 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a', - '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a', - ], - [ - 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111', - '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4', - ], - [ - '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502', - '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437', - ], - [ - '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea', - 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7', - ], - [ - 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26', - '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d', - ], - [ - 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986', - '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a', - ], - [ - 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e', - '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54', - ], - [ - '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4', - '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77', - ], - [ - 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda', - 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517', - ], - [ - '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859', - 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10', - ], - [ - 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f', - 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125', - ], - [ - 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c', - '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e', - ], - [ - '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942', - 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1', - ], - [ - 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a', - '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2', - ], - [ - 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80', - '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423', - ], - [ - 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d', - '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8', - ], - [ - '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1', - 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758', - ], - [ - '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63', - 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375', - ], - [ - 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352', - '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d', - ], - [ - '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193', - 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec', - ], - [ - '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00', - '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0', - ], - [ - '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58', - 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c', - ], - [ - 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7', - 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4', - ], - [ - '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8', - 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f', - ], - [ - '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e', - '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649', - ], - [ - '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d', - 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826', - ], - [ - '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b', - '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5', - ], - [ - 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f', - 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87', - ], - [ - '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6', - '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b', - ], - [ - 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297', - '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc', - ], - [ - '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a', - '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c', - ], - [ - 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c', - 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f', - ], - [ - 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52', - '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a', - ], - [ - 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb', - 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46', - ], - [ - '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065', - 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f', - ], - [ - '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917', - '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03', - ], - [ - '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9', - 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08', - ], - [ - '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3', - '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8', - ], - [ - '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57', - '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373', - ], - [ - '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66', - 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3', - ], - [ - '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8', - '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8', - ], - [ - '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721', - '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1', - ], - [ - '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180', - '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9', - ], - ], - }, -}; - - -/***/ }), -/* 104 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(2); -var HmacDRBG = __webpack_require__(105); -var utils = __webpack_require__(1); -var curves = __webpack_require__(30); -var rand = __webpack_require__(50); -var assert = utils.assert; - -var KeyPair = __webpack_require__(106); -var Signature = __webpack_require__(107); - -function EC(options) { - if (!(this instanceof EC)) - return new EC(options); - - // Shortcut `elliptic.ec(curve-name)` - if (typeof options === 'string') { - assert(Object.prototype.hasOwnProperty.call(curves, options), - 'Unknown curve ' + options); - - options = curves[options]; - } - - // Shortcut for `elliptic.ec(elliptic.curves.curveName)` - if (options instanceof curves.PresetCurve) - options = { curve: options }; - - this.curve = options.curve.curve; - this.n = this.curve.n; - this.nh = this.n.ushrn(1); - this.g = this.curve.g; - - // Point on curve - this.g = options.curve.g; - this.g.precompute(options.curve.n.bitLength() + 1); - - // Hash for function for DRBG - this.hash = options.hash || options.curve.hash; -} -module.exports = EC; - -EC.prototype.keyPair = function keyPair(options) { - return new KeyPair(this, options); -}; - -EC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) { - return KeyPair.fromPrivate(this, priv, enc); -}; - -EC.prototype.keyFromPublic = function keyFromPublic(pub, enc) { - return KeyPair.fromPublic(this, pub, enc); -}; - -EC.prototype.genKeyPair = function genKeyPair(options) { - if (!options) - options = {}; - - // Instantiate Hmac_DRBG - var drbg = new HmacDRBG({ - hash: this.hash, - pers: options.pers, - persEnc: options.persEnc || 'utf8', - entropy: options.entropy || rand(this.hash.hmacStrength), - entropyEnc: options.entropy && options.entropyEnc || 'utf8', - nonce: this.n.toArray(), - }); - - var bytes = this.n.byteLength(); - var ns2 = this.n.sub(new BN(2)); - for (;;) { - var priv = new BN(drbg.generate(bytes)); - if (priv.cmp(ns2) > 0) - continue; - - priv.iaddn(1); - return this.keyFromPrivate(priv); - } -}; - -EC.prototype._truncateToN = function _truncateToN(msg, truncOnly) { - var delta = msg.byteLength() * 8 - this.n.bitLength(); - if (delta > 0) - msg = msg.ushrn(delta); - if (!truncOnly && msg.cmp(this.n) >= 0) - return msg.sub(this.n); - else - return msg; -}; - -EC.prototype.sign = function sign(msg, key, enc, options) { - if (typeof enc === 'object') { - options = enc; - enc = null; - } - if (!options) - options = {}; - - key = this.keyFromPrivate(key, enc); - msg = this._truncateToN(new BN(msg, 16)); - - // Zero-extend key to provide enough entropy - var bytes = this.n.byteLength(); - var bkey = key.getPrivate().toArray('be', bytes); - - // Zero-extend nonce to have the same byte size as N - var nonce = msg.toArray('be', bytes); - - // Instantiate Hmac_DRBG - var drbg = new HmacDRBG({ - hash: this.hash, - entropy: bkey, - nonce: nonce, - pers: options.pers, - persEnc: options.persEnc || 'utf8', - }); - - // Number of bytes to generate - var ns1 = this.n.sub(new BN(1)); - - for (var iter = 0; ; iter++) { - var k = options.k ? - options.k(iter) : - new BN(drbg.generate(this.n.byteLength())); - k = this._truncateToN(k, true); - if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0) - continue; - - var kp = this.g.mul(k); - if (kp.isInfinity()) - continue; - - var kpX = kp.getX(); - var r = kpX.umod(this.n); - if (r.cmpn(0) === 0) - continue; - - var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg)); - s = s.umod(this.n); - if (s.cmpn(0) === 0) - continue; - - var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | - (kpX.cmp(r) !== 0 ? 2 : 0); - - // Use complement of `s`, if it is > `n / 2` - if (options.canonical && s.cmp(this.nh) > 0) { - s = this.n.sub(s); - recoveryParam ^= 1; - } - - return new Signature({ r: r, s: s, recoveryParam: recoveryParam }); - } -}; - -EC.prototype.verify = function verify(msg, signature, key, enc) { - msg = this._truncateToN(new BN(msg, 16)); - key = this.keyFromPublic(key, enc); - signature = new Signature(signature, 'hex'); - - // Perform primitive values validation - var r = signature.r; - var s = signature.s; - if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0) - return false; - if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0) - return false; - - // Validate signature - var sinv = s.invm(this.n); - var u1 = sinv.mul(msg).umod(this.n); - var u2 = sinv.mul(r).umod(this.n); - var p; - - if (!this.curve._maxwellTrick) { - p = this.g.mulAdd(u1, key.getPublic(), u2); - if (p.isInfinity()) - return false; - - return p.getX().umod(this.n).cmp(r) === 0; - } - - // NOTE: Greg Maxwell's trick, inspired by: - // https://git.io/vad3K - - p = this.g.jmulAdd(u1, key.getPublic(), u2); - if (p.isInfinity()) - return false; - - // Compare `p.x` of Jacobian point with `r`, - // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the - // inverse of `p.z^2` - return p.eqXToP(r); -}; - -EC.prototype.recoverPubKey = function(msg, signature, j, enc) { - assert((3 & j) === j, 'The recovery param is more than two bits'); - signature = new Signature(signature, enc); - - var n = this.n; - var e = new BN(msg); - var r = signature.r; - var s = signature.s; - - // A set LSB signifies that the y-coordinate is odd - var isYOdd = j & 1; - var isSecondKey = j >> 1; - if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey) - throw new Error('Unable to find sencond key candinate'); - - // 1.1. Let x = r + jn. - if (isSecondKey) - r = this.curve.pointFromX(r.add(this.curve.n), isYOdd); - else - r = this.curve.pointFromX(r, isYOdd); - - var rInv = signature.r.invm(n); - var s1 = n.sub(e).mul(rInv).umod(n); - var s2 = s.mul(rInv).umod(n); - - // 1.6.1 Compute Q = r^-1 (sR - eG) - // Q = r^-1 (sR + -eG) - return this.g.mulAdd(s1, r, s2); -}; - -EC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) { - signature = new Signature(signature, enc); - if (signature.recoveryParam !== null) - return signature.recoveryParam; - - for (var i = 0; i < 4; i++) { - var Qprime; - try { - Qprime = this.recoverPubKey(e, signature, i); - } catch (e) { - continue; - } - - if (Qprime.eq(Q)) - return i; - } - throw new Error('Unable to find valid recovery factor'); -}; - - -/***/ }), -/* 105 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var hash = __webpack_require__(31); -var utils = __webpack_require__(49); -var assert = __webpack_require__(12); - -function HmacDRBG(options) { - if (!(this instanceof HmacDRBG)) - return new HmacDRBG(options); - this.hash = options.hash; - this.predResist = !!options.predResist; - - this.outLen = this.hash.outSize; - this.minEntropy = options.minEntropy || this.hash.hmacStrength; - - this._reseed = null; - this.reseedInterval = null; - this.K = null; - this.V = null; - - var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex'); - var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex'); - var pers = utils.toArray(options.pers, options.persEnc || 'hex'); - assert(entropy.length >= (this.minEntropy / 8), - 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits'); - this._init(entropy, nonce, pers); -} -module.exports = HmacDRBG; - -HmacDRBG.prototype._init = function init(entropy, nonce, pers) { - var seed = entropy.concat(nonce).concat(pers); - - this.K = new Array(this.outLen / 8); - this.V = new Array(this.outLen / 8); - for (var i = 0; i < this.V.length; i++) { - this.K[i] = 0x00; - this.V[i] = 0x01; - } - - this._update(seed); - this._reseed = 1; - this.reseedInterval = 0x1000000000000; // 2^48 -}; - -HmacDRBG.prototype._hmac = function hmac() { - return new hash.hmac(this.hash, this.K); -}; - -HmacDRBG.prototype._update = function update(seed) { - var kmac = this._hmac() - .update(this.V) - .update([ 0x00 ]); - if (seed) - kmac = kmac.update(seed); - this.K = kmac.digest(); - this.V = this._hmac().update(this.V).digest(); - if (!seed) - return; - - this.K = this._hmac() - .update(this.V) - .update([ 0x01 ]) - .update(seed) - .digest(); - this.V = this._hmac().update(this.V).digest(); -}; - -HmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) { - // Optional entropy enc - if (typeof entropyEnc !== 'string') { - addEnc = add; - add = entropyEnc; - entropyEnc = null; - } - - entropy = utils.toArray(entropy, entropyEnc); - add = utils.toArray(add, addEnc); - - assert(entropy.length >= (this.minEntropy / 8), - 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits'); - - this._update(entropy.concat(add || [])); - this._reseed = 1; -}; - -HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) { - if (this._reseed > this.reseedInterval) - throw new Error('Reseed is required'); - - // Optional encoding - if (typeof enc !== 'string') { - addEnc = add; - add = enc; - enc = null; - } - - // Optional additional data - if (add) { - add = utils.toArray(add, addEnc || 'hex'); - this._update(add); - } - - var temp = []; - while (temp.length < len) { - this.V = this._hmac().update(this.V).digest(); - temp = temp.concat(this.V); - } - - var res = temp.slice(0, len); - this._update(add); - this._reseed++; - return utils.encode(res, enc); -}; - - -/***/ }), -/* 106 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(2); -var utils = __webpack_require__(1); -var assert = utils.assert; - -function KeyPair(ec, options) { - this.ec = ec; - this.priv = null; - this.pub = null; - - // KeyPair(ec, { priv: ..., pub: ... }) - if (options.priv) - this._importPrivate(options.priv, options.privEnc); - if (options.pub) - this._importPublic(options.pub, options.pubEnc); -} -module.exports = KeyPair; - -KeyPair.fromPublic = function fromPublic(ec, pub, enc) { - if (pub instanceof KeyPair) - return pub; - - return new KeyPair(ec, { - pub: pub, - pubEnc: enc, - }); -}; - -KeyPair.fromPrivate = function fromPrivate(ec, priv, enc) { - if (priv instanceof KeyPair) - return priv; - - return new KeyPair(ec, { - priv: priv, - privEnc: enc, - }); -}; - -KeyPair.prototype.validate = function validate() { - var pub = this.getPublic(); - - if (pub.isInfinity()) - return { result: false, reason: 'Invalid public key' }; - if (!pub.validate()) - return { result: false, reason: 'Public key is not a point' }; - if (!pub.mul(this.ec.curve.n).isInfinity()) - return { result: false, reason: 'Public key * N != O' }; - - return { result: true, reason: null }; -}; - -KeyPair.prototype.getPublic = function getPublic(compact, enc) { - // compact is optional argument - if (typeof compact === 'string') { - enc = compact; - compact = null; - } - - if (!this.pub) - this.pub = this.ec.g.mul(this.priv); - - if (!enc) - return this.pub; - - return this.pub.encode(enc, compact); -}; - -KeyPair.prototype.getPrivate = function getPrivate(enc) { - if (enc === 'hex') - return this.priv.toString(16, 2); - else - return this.priv; -}; - -KeyPair.prototype._importPrivate = function _importPrivate(key, enc) { - this.priv = new BN(key, enc || 16); - - // Ensure that the priv won't be bigger than n, otherwise we may fail - // in fixed multiplication method - this.priv = this.priv.umod(this.ec.curve.n); -}; - -KeyPair.prototype._importPublic = function _importPublic(key, enc) { - if (key.x || key.y) { - // Montgomery points only have an `x` coordinate. - // Weierstrass/Edwards points on the other hand have both `x` and - // `y` coordinates. - if (this.ec.curve.type === 'mont') { - assert(key.x, 'Need x coordinate'); - } else if (this.ec.curve.type === 'short' || - this.ec.curve.type === 'edwards') { - assert(key.x && key.y, 'Need both x and y coordinate'); - } - this.pub = this.ec.curve.point(key.x, key.y); - return; - } - this.pub = this.ec.curve.decodePoint(key, enc); -}; - -// ECDH -KeyPair.prototype.derive = function derive(pub) { - if(!pub.validate()) { - assert(pub.validate(), 'public point not validated'); - } - return pub.mul(this.priv).getX(); -}; - -// ECDSA -KeyPair.prototype.sign = function sign(msg, enc, options) { - return this.ec.sign(msg, this, enc, options); -}; - -KeyPair.prototype.verify = function verify(msg, signature) { - return this.ec.verify(msg, signature, this); -}; - -KeyPair.prototype.inspect = function inspect() { - return ''; -}; - - -/***/ }), -/* 107 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(2); - -var utils = __webpack_require__(1); -var assert = utils.assert; - -function Signature(options, enc) { - if (options instanceof Signature) - return options; - - if (this._importDER(options, enc)) - return; - - assert(options.r && options.s, 'Signature without r or s'); - this.r = new BN(options.r, 16); - this.s = new BN(options.s, 16); - if (options.recoveryParam === undefined) - this.recoveryParam = null; - else - this.recoveryParam = options.recoveryParam; -} -module.exports = Signature; - -function Position() { - this.place = 0; -} - -function getLength(buf, p) { - var initial = buf[p.place++]; - if (!(initial & 0x80)) { - return initial; - } - var octetLen = initial & 0xf; - - // Indefinite length or overflow - if (octetLen === 0 || octetLen > 4) { - return false; - } - - var val = 0; - for (var i = 0, off = p.place; i < octetLen; i++, off++) { - val <<= 8; - val |= buf[off]; - val >>>= 0; - } - - // Leading zeroes - if (val <= 0x7f) { - return false; - } - - p.place = off; - return val; -} - -function rmPadding(buf) { - var i = 0; - var len = buf.length - 1; - while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) { - i++; - } - if (i === 0) { - return buf; - } - return buf.slice(i); -} - -Signature.prototype._importDER = function _importDER(data, enc) { - data = utils.toArray(data, enc); - var p = new Position(); - if (data[p.place++] !== 0x30) { - return false; - } - var len = getLength(data, p); - if (len === false) { - return false; - } - if ((len + p.place) !== data.length) { - return false; - } - if (data[p.place++] !== 0x02) { - return false; - } - var rlen = getLength(data, p); - if (rlen === false) { - return false; - } - var r = data.slice(p.place, rlen + p.place); - p.place += rlen; - if (data[p.place++] !== 0x02) { - return false; - } - var slen = getLength(data, p); - if (slen === false) { - return false; - } - if (data.length !== slen + p.place) { - return false; - } - var s = data.slice(p.place, slen + p.place); - if (r[0] === 0) { - if (r[1] & 0x80) { - r = r.slice(1); - } else { - // Leading zeroes - return false; - } - } - if (s[0] === 0) { - if (s[1] & 0x80) { - s = s.slice(1); - } else { - // Leading zeroes - return false; - } - } - - this.r = new BN(r); - this.s = new BN(s); - this.recoveryParam = null; - - return true; -}; - -function constructLength(arr, len) { - if (len < 0x80) { - arr.push(len); - return; - } - var octets = 1 + (Math.log(len) / Math.LN2 >>> 3); - arr.push(octets | 0x80); - while (--octets) { - arr.push((len >>> (octets << 3)) & 0xff); - } - arr.push(len); -} - -Signature.prototype.toDER = function toDER(enc) { - var r = this.r.toArray(); - var s = this.s.toArray(); - - // Pad values - if (r[0] & 0x80) - r = [ 0 ].concat(r); - // Pad values - if (s[0] & 0x80) - s = [ 0 ].concat(s); - - r = rmPadding(r); - s = rmPadding(s); - - while (!s[0] && !(s[1] & 0x80)) { - s = s.slice(1); - } - var arr = [ 0x02 ]; - constructLength(arr, r.length); - arr = arr.concat(r); - arr.push(0x02); - constructLength(arr, s.length); - var backHalf = arr.concat(s); - var res = [ 0x30 ]; - constructLength(res, backHalf.length); - res = res.concat(backHalf); - return utils.encode(res, enc); -}; - - -/***/ }), -/* 108 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var hash = __webpack_require__(31); -var curves = __webpack_require__(30); -var utils = __webpack_require__(1); -var assert = utils.assert; -var parseBytes = utils.parseBytes; -var KeyPair = __webpack_require__(109); -var Signature = __webpack_require__(110); - -function EDDSA(curve) { - assert(curve === 'ed25519', 'only tested with ed25519 so far'); - - if (!(this instanceof EDDSA)) - return new EDDSA(curve); - - curve = curves[curve].curve; - this.curve = curve; - this.g = curve.g; - this.g.precompute(curve.n.bitLength() + 1); - - this.pointClass = curve.point().constructor; - this.encodingLength = Math.ceil(curve.n.bitLength() / 8); - this.hash = hash.sha512; -} - -module.exports = EDDSA; - -/** -* @param {Array|String} message - message bytes -* @param {Array|String|KeyPair} secret - secret bytes or a keypair -* @returns {Signature} - signature -*/ -EDDSA.prototype.sign = function sign(message, secret) { - message = parseBytes(message); - var key = this.keyFromSecret(secret); - var r = this.hashInt(key.messagePrefix(), message); - var R = this.g.mul(r); - var Rencoded = this.encodePoint(R); - var s_ = this.hashInt(Rencoded, key.pubBytes(), message) - .mul(key.priv()); - var S = r.add(s_).umod(this.curve.n); - return this.makeSignature({ R: R, S: S, Rencoded: Rencoded }); -}; - -/** -* @param {Array} message - message bytes -* @param {Array|String|Signature} sig - sig bytes -* @param {Array|String|Point|KeyPair} pub - public key -* @returns {Boolean} - true if public key matches sig of message -*/ -EDDSA.prototype.verify = function verify(message, sig, pub) { - message = parseBytes(message); - sig = this.makeSignature(sig); - var key = this.keyFromPublic(pub); - var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message); - var SG = this.g.mul(sig.S()); - var RplusAh = sig.R().add(key.pub().mul(h)); - return RplusAh.eq(SG); -}; - -EDDSA.prototype.hashInt = function hashInt() { - var hash = this.hash(); - for (var i = 0; i < arguments.length; i++) - hash.update(arguments[i]); - return utils.intFromLE(hash.digest()).umod(this.curve.n); -}; - -EDDSA.prototype.keyFromPublic = function keyFromPublic(pub) { - return KeyPair.fromPublic(this, pub); -}; - -EDDSA.prototype.keyFromSecret = function keyFromSecret(secret) { - return KeyPair.fromSecret(this, secret); -}; - -EDDSA.prototype.makeSignature = function makeSignature(sig) { - if (sig instanceof Signature) - return sig; - return new Signature(this, sig); -}; - -/** -* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2 -* -* EDDSA defines methods for encoding and decoding points and integers. These are -* helper convenience methods, that pass along to utility functions implied -* parameters. -* -*/ -EDDSA.prototype.encodePoint = function encodePoint(point) { - var enc = point.getY().toArray('le', this.encodingLength); - enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0; - return enc; -}; - -EDDSA.prototype.decodePoint = function decodePoint(bytes) { - bytes = utils.parseBytes(bytes); - - var lastIx = bytes.length - 1; - var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80); - var xIsOdd = (bytes[lastIx] & 0x80) !== 0; - - var y = utils.intFromLE(normed); - return this.curve.pointFromY(y, xIsOdd); -}; - -EDDSA.prototype.encodeInt = function encodeInt(num) { - return num.toArray('le', this.encodingLength); -}; - -EDDSA.prototype.decodeInt = function decodeInt(bytes) { - return utils.intFromLE(bytes); -}; - -EDDSA.prototype.isPoint = function isPoint(val) { - return val instanceof this.pointClass; -}; - - -/***/ }), -/* 109 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(1); -var assert = utils.assert; -var parseBytes = utils.parseBytes; -var cachedProperty = utils.cachedProperty; - -/** -* @param {EDDSA} eddsa - instance -* @param {Object} params - public/private key parameters -* -* @param {Array} [params.secret] - secret seed bytes -* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms) -* @param {Array} [params.pub] - public key point encoded as bytes -* -*/ -function KeyPair(eddsa, params) { - this.eddsa = eddsa; - this._secret = parseBytes(params.secret); - if (eddsa.isPoint(params.pub)) - this._pub = params.pub; - else - this._pubBytes = parseBytes(params.pub); -} - -KeyPair.fromPublic = function fromPublic(eddsa, pub) { - if (pub instanceof KeyPair) - return pub; - return new KeyPair(eddsa, { pub: pub }); -}; - -KeyPair.fromSecret = function fromSecret(eddsa, secret) { - if (secret instanceof KeyPair) - return secret; - return new KeyPair(eddsa, { secret: secret }); -}; - -KeyPair.prototype.secret = function secret() { - return this._secret; -}; - -cachedProperty(KeyPair, 'pubBytes', function pubBytes() { - return this.eddsa.encodePoint(this.pub()); -}); - -cachedProperty(KeyPair, 'pub', function pub() { - if (this._pubBytes) - return this.eddsa.decodePoint(this._pubBytes); - return this.eddsa.g.mul(this.priv()); -}); - -cachedProperty(KeyPair, 'privBytes', function privBytes() { - var eddsa = this.eddsa; - var hash = this.hash(); - var lastIx = eddsa.encodingLength - 1; - - var a = hash.slice(0, eddsa.encodingLength); - a[0] &= 248; - a[lastIx] &= 127; - a[lastIx] |= 64; - - return a; -}); - -cachedProperty(KeyPair, 'priv', function priv() { - return this.eddsa.decodeInt(this.privBytes()); -}); - -cachedProperty(KeyPair, 'hash', function hash() { - return this.eddsa.hash().update(this.secret()).digest(); -}); - -cachedProperty(KeyPair, 'messagePrefix', function messagePrefix() { - return this.hash().slice(this.eddsa.encodingLength); -}); - -KeyPair.prototype.sign = function sign(message) { - assert(this._secret, 'KeyPair can only verify'); - return this.eddsa.sign(message, this); -}; - -KeyPair.prototype.verify = function verify(message, sig) { - return this.eddsa.verify(message, sig, this); -}; - -KeyPair.prototype.getSecret = function getSecret(enc) { - assert(this._secret, 'KeyPair is public only'); - return utils.encode(this.secret(), enc); -}; - -KeyPair.prototype.getPublic = function getPublic(enc) { - return utils.encode(this.pubBytes(), enc); -}; - -module.exports = KeyPair; - - -/***/ }), -/* 110 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(2); -var utils = __webpack_require__(1); -var assert = utils.assert; -var cachedProperty = utils.cachedProperty; -var parseBytes = utils.parseBytes; - -/** -* @param {EDDSA} eddsa - eddsa instance -* @param {Array|Object} sig - -* @param {Array|Point} [sig.R] - R point as Point or bytes -* @param {Array|bn} [sig.S] - S scalar as bn or bytes -* @param {Array} [sig.Rencoded] - R point encoded -* @param {Array} [sig.Sencoded] - S scalar encoded -*/ -function Signature(eddsa, sig) { - this.eddsa = eddsa; - - if (typeof sig !== 'object') - sig = parseBytes(sig); - - if (Array.isArray(sig)) { - sig = { - R: sig.slice(0, eddsa.encodingLength), - S: sig.slice(eddsa.encodingLength), - }; - } - - assert(sig.R && sig.S, 'Signature without R or S'); - - if (eddsa.isPoint(sig.R)) - this._R = sig.R; - if (sig.S instanceof BN) - this._S = sig.S; - - this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded; - this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded; -} - -cachedProperty(Signature, 'S', function S() { - return this.eddsa.decodeInt(this.Sencoded()); -}); - -cachedProperty(Signature, 'R', function R() { - return this.eddsa.decodePoint(this.Rencoded()); -}); - -cachedProperty(Signature, 'Rencoded', function Rencoded() { - return this.eddsa.encodePoint(this.R()); -}); - -cachedProperty(Signature, 'Sencoded', function Sencoded() { - return this.eddsa.encodeInt(this.S()); -}); - -Signature.prototype.toBytes = function toBytes() { - return this.Rencoded().concat(this.Sencoded()); -}; - -Signature.prototype.toHex = function toHex() { - return utils.encode(this.toBytes(), 'hex').toUpperCase(); -}; - -module.exports = Signature; - - -/***/ }), -/* 111 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = (__webpack_require__(6).Buffer) - -var checkParameters = __webpack_require__(32) -var defaultEncoding = __webpack_require__(33) -var sync = __webpack_require__(55) -var toBuffer = __webpack_require__(34) - -var ZERO_BUF -var subtle = global.crypto && global.crypto.subtle -var toBrowser = { - sha: 'SHA-1', - 'sha-1': 'SHA-1', - sha1: 'SHA-1', - sha256: 'SHA-256', - 'sha-256': 'SHA-256', - sha384: 'SHA-384', - 'sha-384': 'SHA-384', - 'sha-512': 'SHA-512', - sha512: 'SHA-512' -} -var checks = [] -function checkNative (algo) { - if (global.process && !global.process.browser) { - return Promise.resolve(false) - } - if (!subtle || !subtle.importKey || !subtle.deriveBits) { - return Promise.resolve(false) - } - if (checks[algo] !== undefined) { - return checks[algo] - } - ZERO_BUF = ZERO_BUF || Buffer.alloc(8) - var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo) - .then(function () { - return true - }).catch(function () { - return false - }) - checks[algo] = prom - return prom -} -var nextTick -function getNextTick () { - if (nextTick) { - return nextTick - } - if (global.process && global.process.nextTick) { - nextTick = global.process.nextTick - } else if (global.queueMicrotask) { - nextTick = global.queueMicrotask - } else if (global.setImmediate) { - nextTick = global.setImmediate - } else { - nextTick = global.setTimeout - } - return nextTick -} -function browserPbkdf2 (password, salt, iterations, length, algo) { - return subtle.importKey( - 'raw', password, { name: 'PBKDF2' }, false, ['deriveBits'] - ).then(function (key) { - return subtle.deriveBits({ - name: 'PBKDF2', - salt: salt, - iterations: iterations, - hash: { - name: algo - } - }, key, length << 3) - }).then(function (res) { - return Buffer.from(res) - }) -} - -function resolvePromise (promise, callback) { - promise.then(function (out) { - getNextTick()(function () { - callback(null, out) - }) - }, function (e) { - getNextTick()(function () { - callback(e) - }) - }) -} -module.exports = function (password, salt, iterations, keylen, digest, callback) { - if (typeof digest === 'function') { - callback = digest - digest = undefined - } - - digest = digest || 'sha1' - var algo = toBrowser[digest.toLowerCase()] - - if (!algo || typeof global.Promise !== 'function') { - getNextTick()(function () { - var out - try { - out = sync(password, salt, iterations, keylen, digest) - } catch (e) { - return callback(e) - } - callback(null, out) - }) - return - } - - checkParameters(iterations, keylen) - password = toBuffer(password, defaultEncoding, 'Password') - salt = toBuffer(salt, defaultEncoding, 'Salt') - if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2') - - resolvePromise(checkNative(algo).then(function (resp) { - if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo) - - return sync(password, salt, iterations, keylen, digest) - }), callback) -} - - -/***/ }), -/* 112 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(4).randomBytes - - -/***/ }), -/* 113 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var assert = __webpack_require__(160) -var Buffer = (__webpack_require__(76).Buffer) -var crypto = __webpack_require__(4) -var bs58check = __webpack_require__(114) -var secp256k1 = __webpack_require__(161) - -var MASTER_SECRET = Buffer.from('Bitcoin seed', 'utf8') -var HARDENED_OFFSET = 0x80000000 -var LEN = 78 - -// Bitcoin hardcoded by default, can use package `coininfo` for others -var BITCOIN_VERSIONS = {private: 0x0488ADE4, public: 0x0488B21E} - -function HDKey (versions) { - this.versions = versions || BITCOIN_VERSIONS - this.depth = 0 - this.index = 0 - this._privateKey = null - this._publicKey = null - this.chainCode = null - this._fingerprint = 0 - this.parentFingerprint = 0 -} - -Object.defineProperty(HDKey.prototype, 'fingerprint', { get: function () { return this._fingerprint } }) -Object.defineProperty(HDKey.prototype, 'identifier', { get: function () { return this._identifier } }) -Object.defineProperty(HDKey.prototype, 'pubKeyHash', { get: function () { return this.identifier } }) - -Object.defineProperty(HDKey.prototype, 'privateKey', { - get: function () { - return this._privateKey - }, - set: function (value) { - assert.equal(value.length, 32, 'Private key must be 32 bytes.') - assert(secp256k1.privateKeyVerify(value) === true, 'Invalid private key') - - this._privateKey = value - this._publicKey = secp256k1.publicKeyCreate(value, true) - this._identifier = hash160(this.publicKey) - this._fingerprint = this._identifier.slice(0, 4).readUInt32BE(0) - } -}) - -Object.defineProperty(HDKey.prototype, 'publicKey', { - get: function () { - return this._publicKey - }, - set: function (value) { - assert(value.length === 33 || value.length === 65, 'Public key must be 33 or 65 bytes.') - assert(secp256k1.publicKeyVerify(value) === true, 'Invalid public key') - - this._publicKey = secp256k1.publicKeyConvert(value, true) // force compressed point - this._identifier = hash160(this.publicKey) - this._fingerprint = this._identifier.slice(0, 4).readUInt32BE(0) - this._privateKey = null - } -}) - -Object.defineProperty(HDKey.prototype, 'privateExtendedKey', { - get: function () { - if (this._privateKey) return bs58check.encode(serialize(this, this.versions.private, Buffer.concat([Buffer.alloc(1, 0), this.privateKey]))) - else return null - } -}) - -Object.defineProperty(HDKey.prototype, 'publicExtendedKey', { - get: function () { - return bs58check.encode(serialize(this, this.versions.public, this.publicKey)) - } -}) - -HDKey.prototype.derive = function (path) { - if (path === 'm' || path === 'M' || path === "m'" || path === "M'") { - return this - } - - var entries = path.split('/') - var hdkey = this - entries.forEach(function (c, i) { - if (i === 0) { - assert(/^[mM]{1}/.test(c), 'Path must start with "m" or "M"') - return - } - - var hardened = (c.length > 1) && (c[c.length - 1] === "'") - var childIndex = parseInt(c, 10) // & (HARDENED_OFFSET - 1) - assert(childIndex < HARDENED_OFFSET, 'Invalid index') - if (hardened) childIndex += HARDENED_OFFSET - - hdkey = hdkey.deriveChild(childIndex) - }) - - return hdkey -} - -HDKey.prototype.deriveChild = function (index) { - var isHardened = index >= HARDENED_OFFSET - var indexBuffer = Buffer.allocUnsafe(4) - indexBuffer.writeUInt32BE(index, 0) - - var data - - if (isHardened) { // Hardened child - assert(this.privateKey, 'Could not derive hardened child key') - - var pk = this.privateKey - var zb = Buffer.alloc(1, 0) - pk = Buffer.concat([zb, pk]) - - // data = 0x00 || ser256(kpar) || ser32(index) - data = Buffer.concat([pk, indexBuffer]) - } else { // Normal child - // data = serP(point(kpar)) || ser32(index) - // = serP(Kpar) || ser32(index) - data = Buffer.concat([this.publicKey, indexBuffer]) - } - - var I = crypto.createHmac('sha512', this.chainCode).update(data).digest() - var IL = I.slice(0, 32) - var IR = I.slice(32) - - var hd = new HDKey(this.versions) - - // Private parent key -> private child key - if (this.privateKey) { - // ki = parse256(IL) + kpar (mod n) - try { - hd.privateKey = secp256k1.privateKeyTweakAdd(this.privateKey, IL) - // throw if IL >= n || (privateKey + IL) === 0 - } catch (err) { - // In case parse256(IL) >= n or ki == 0, one should proceed with the next value for i - return this.deriveChild(index + 1) - } - // Public parent key -> public child key - } else { - // Ki = point(parse256(IL)) + Kpar - // = G*IL + Kpar - try { - hd.publicKey = secp256k1.publicKeyTweakAdd(this.publicKey, IL, true) - // throw if IL >= n || (g**IL + publicKey) is infinity - } catch (err) { - // In case parse256(IL) >= n or Ki is the point at infinity, one should proceed with the next value for i - return this.deriveChild(index + 1) - } - } - - hd.chainCode = IR - hd.depth = this.depth + 1 - hd.parentFingerprint = this.fingerprint// .readUInt32BE(0) - hd.index = index - - return hd -} - -HDKey.prototype.sign = function (hash) { - return secp256k1.sign(hash, this.privateKey).signature -} - -HDKey.prototype.verify = function (hash, signature) { - return secp256k1.verify(hash, signature, this.publicKey) -} - -HDKey.prototype.wipePrivateData = function () { - if (this._privateKey) crypto.randomBytes(this._privateKey.length).copy(this._privateKey) - this._privateKey = null - return this -} - -HDKey.prototype.toJSON = function () { - return { - xpriv: this.privateExtendedKey, - xpub: this.publicExtendedKey - } -} - -HDKey.fromMasterSeed = function (seedBuffer, versions) { - var I = crypto.createHmac('sha512', MASTER_SECRET).update(seedBuffer).digest() - var IL = I.slice(0, 32) - var IR = I.slice(32) - - var hdkey = new HDKey(versions) - hdkey.chainCode = IR - hdkey.privateKey = IL - - return hdkey -} - -HDKey.fromExtendedKey = function (base58key, versions) { - // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33) - versions = versions || BITCOIN_VERSIONS - var hdkey = new HDKey(versions) - - var keyBuffer = bs58check.decode(base58key) - - var version = keyBuffer.readUInt32BE(0) - assert(version === versions.private || version === versions.public, 'Version mismatch: does not match private or public') - - hdkey.depth = keyBuffer.readUInt8(4) - hdkey.parentFingerprint = keyBuffer.readUInt32BE(5) - hdkey.index = keyBuffer.readUInt32BE(9) - hdkey.chainCode = keyBuffer.slice(13, 45) - - var key = keyBuffer.slice(45) - if (key.readUInt8(0) === 0) { // private - assert(version === versions.private, 'Version mismatch: version does not match private') - hdkey.privateKey = key.slice(1) // cut off first 0x0 byte - } else { - assert(version === versions.public, 'Version mismatch: version does not match public') - hdkey.publicKey = key - } - - return hdkey -} - -HDKey.fromJSON = function (obj) { - return HDKey.fromExtendedKey(obj.xpriv) -} - -function serialize (hdkey, version, key) { - // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33) - var buffer = Buffer.allocUnsafe(LEN) - - buffer.writeUInt32BE(version, 0) - buffer.writeUInt8(hdkey.depth, 4) - - var fingerprint = hdkey.depth ? hdkey.parentFingerprint : 0x00000000 - buffer.writeUInt32BE(fingerprint, 5) - buffer.writeUInt32BE(hdkey.index, 9) - - hdkey.chainCode.copy(buffer, 13) - key.copy(buffer, 45) - - return buffer -} - -function hash160 (buf) { - var sha = crypto.createHash('sha256').update(buf).digest() - return crypto.createHash('ripemd160').update(sha).digest() -} - -HDKey.HARDENED_OFFSET = HARDENED_OFFSET -module.exports = HDKey - - -/***/ }), -/* 114 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var createHash = __webpack_require__(54) -var bs58checkBase = __webpack_require__(115) - -// SHA256(SHA256(buffer)) -function sha256x2 (buffer) { - var tmp = createHash('sha256').update(buffer).digest() - return createHash('sha256').update(tmp).digest() -} - -module.exports = bs58checkBase(sha256x2) - - -/***/ }), -/* 115 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var base58 = __webpack_require__(116) -var Buffer = (__webpack_require__(6).Buffer) - -module.exports = function (checksumFn) { - // Encode a buffer as a base58-check encoded string - function encode (payload) { - var checksum = checksumFn(payload) - - return base58.encode(Buffer.concat([ - payload, - checksum - ], payload.length + 4)) - } - - function decodeRaw (buffer) { - var payload = buffer.slice(0, -4) - var checksum = buffer.slice(-4) - var newChecksum = checksumFn(payload) - - if (checksum[0] ^ newChecksum[0] | - checksum[1] ^ newChecksum[1] | - checksum[2] ^ newChecksum[2] | - checksum[3] ^ newChecksum[3]) return - - return payload - } - - // Decode a base58-check encoded string to a buffer, no result if checksum is wrong - function decodeUnsafe (string) { - var buffer = base58.decodeUnsafe(string) - if (!buffer) return - - return decodeRaw(buffer) - } - - function decode (string) { - var buffer = base58.decode(string) - var payload = decodeRaw(buffer, checksumFn) - if (!payload) throw new Error('Invalid checksum') - return payload - } - - return { - encode: encode, - decode: decode, - decodeUnsafe: decodeUnsafe - } -} - - -/***/ }), -/* 116 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var basex = __webpack_require__(117) -var ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' - -module.exports = basex(ALPHABET) - - -/***/ }), -/* 117 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -// base-x encoding / decoding -// Copyright (c) 2018 base-x contributors -// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp) -// Distributed under the MIT software license, see the accompanying -// file LICENSE or http://www.opensource.org/licenses/mit-license.php. -// @ts-ignore -var _Buffer = (__webpack_require__(6).Buffer) -function base (ALPHABET) { - if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') } - var BASE_MAP = new Uint8Array(256) - for (var j = 0; j < BASE_MAP.length; j++) { - BASE_MAP[j] = 255 - } - for (var i = 0; i < ALPHABET.length; i++) { - var x = ALPHABET.charAt(i) - var xc = x.charCodeAt(0) - if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') } - BASE_MAP[xc] = i - } - var BASE = ALPHABET.length - var LEADER = ALPHABET.charAt(0) - var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up - var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up - function encode (source) { - if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) } - if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') } - if (source.length === 0) { return '' } - // Skip & count leading zeroes. - var zeroes = 0 - var length = 0 - var pbegin = 0 - var pend = source.length - while (pbegin !== pend && source[pbegin] === 0) { - pbegin++ - zeroes++ - } - // Allocate enough space in big-endian base58 representation. - var size = ((pend - pbegin) * iFACTOR + 1) >>> 0 - var b58 = new Uint8Array(size) - // Process the bytes. - while (pbegin !== pend) { - var carry = source[pbegin] - // Apply "b58 = b58 * 256 + ch". - var i = 0 - for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) { - carry += (256 * b58[it1]) >>> 0 - b58[it1] = (carry % BASE) >>> 0 - carry = (carry / BASE) >>> 0 - } - if (carry !== 0) { throw new Error('Non-zero carry') } - length = i - pbegin++ - } - // Skip leading zeroes in base58 result. - var it2 = size - length - while (it2 !== size && b58[it2] === 0) { - it2++ - } - // Translate the result into a string. - var str = LEADER.repeat(zeroes) - for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) } - return str - } - function decodeUnsafe (source) { - if (typeof source !== 'string') { throw new TypeError('Expected String') } - if (source.length === 0) { return _Buffer.alloc(0) } - var psz = 0 - // Skip and count leading '1's. - var zeroes = 0 - var length = 0 - while (source[psz] === LEADER) { - zeroes++ - psz++ - } - // Allocate enough space in big-endian base256 representation. - var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up. - var b256 = new Uint8Array(size) - // Process the characters. - while (source[psz]) { - // Decode character - var carry = BASE_MAP[source.charCodeAt(psz)] - // Invalid character - if (carry === 255) { return } - var i = 0 - for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) { - carry += (BASE * b256[it3]) >>> 0 - b256[it3] = (carry % 256) >>> 0 - carry = (carry / 256) >>> 0 - } - if (carry !== 0) { throw new Error('Non-zero carry') } - length = i - psz++ - } - // Skip leading zeroes in b256. - var it4 = size - length - while (it4 !== size && b256[it4] === 0) { - it4++ - } - var vch = _Buffer.allocUnsafe(zeroes + (size - it4)) - vch.fill(0x00, 0, zeroes) - var j = zeroes - while (it4 !== size) { - vch[j++] = b256[it4++] - } - return vch - } - function decode (string) { - var buffer = decodeUnsafe(string) - if (buffer) { return buffer } - throw new Error('Non-base' + BASE + ' character') - } - return { - encode: encode, - decodeUnsafe: decodeUnsafe, - decode: decode - } -} -module.exports = base - - -/***/ }), -/* 118 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = __webpack_require__(67)('secp256k1') - - -/***/ }), -/* 119 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - - -/** - * Module dependencies. - */ - -var sep = (__webpack_require__(57).sep) || '/'; - -/** - * Module exports. - */ - -module.exports = fileUriToPath; - -/** - * File URI to Path function. - * - * @param {String} uri - * @return {String} path - * @api public - */ - -function fileUriToPath (uri) { - if ('string' != typeof uri || - uri.length <= 7 || - 'file://' != uri.substring(0, 7)) { - throw new TypeError('must pass in a file:// URI to convert to a file path'); - } - - var rest = decodeURI(uri.substring(7)); - var firstSlash = rest.indexOf('/'); - var host = rest.substring(0, firstSlash); - var path = rest.substring(firstSlash + 1); - - // 2. Scheme Definition - // As a special case, can be the string "localhost" or the empty - // string; this is interpreted as "the machine from which the URL is - // being interpreted". - if ('localhost' == host) host = ''; - - if (host) { - host = sep + sep + host; - } - - // 3.2 Drives, drive letters, mount points, file system root - // Drive letters are mapped into the top of a file URI in various ways, - // depending on the implementation; some applications substitute - // vertical bar ("|") for the colon after the drive letter, yielding - // "file:///c|/tmp/test.txt". In some cases, the colon is left - // unchanged, as in "file:///c:/tmp/test.txt". In other cases, the - // colon is simply omitted, as in "file:///c/tmp/test.txt". - path = path.replace(/^(.+)\|/, '$1:'); - - // for Windows, we need to invert the path separators from what a URI uses - if (sep == '\\') { - path = path.replace(/\//g, '\\'); - } - - if (/^.+\:/.test(path)) { - // has Windows drive at beginning of path - } else { - // unix path… - path = sep + path; - } - - return host + path; -} - - -/***/ }), -/* 120 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -module.exports = __webpack_require__(121)(__webpack_require__(124)) - - -/***/ }), -/* 121 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var assert = __webpack_require__(162) -var der = __webpack_require__(163) -var messages = __webpack_require__(123) - -function initCompressedValue (value, defaultValue) { - if (value === undefined) return defaultValue - - assert.isBoolean(value, messages.COMPRESSED_TYPE_INVALID) - return value -} - -module.exports = function (secp256k1) { - return { - privateKeyVerify: function (privateKey) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - return privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey) - }, - - privateKeyExport: function (privateKey, compressed) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - compressed = initCompressedValue(compressed, true) - var publicKey = secp256k1.privateKeyExport(privateKey, compressed) - - return der.privateKeyExport(privateKey, publicKey, compressed) - }, - - privateKeyImport: function (privateKey) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - - privateKey = der.privateKeyImport(privateKey) - if (privateKey && privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)) return privateKey - - throw new Error(messages.EC_PRIVATE_KEY_IMPORT_DER_FAIL) - }, - - privateKeyNegate: function (privateKey) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - return secp256k1.privateKeyNegate(privateKey) - }, - - privateKeyModInverse: function (privateKey) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - return secp256k1.privateKeyModInverse(privateKey) - }, - - privateKeyTweakAdd: function (privateKey, tweak) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID) - assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID) - - return secp256k1.privateKeyTweakAdd(privateKey, tweak) - }, - - privateKeyTweakMul: function (privateKey, tweak) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID) - assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID) - - return secp256k1.privateKeyTweakMul(privateKey, tweak) - }, - - publicKeyCreate: function (privateKey, compressed) { - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - compressed = initCompressedValue(compressed, true) - - return secp256k1.publicKeyCreate(privateKey, compressed) - }, - - publicKeyConvert: function (publicKey, compressed) { - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - - compressed = initCompressedValue(compressed, true) - - return secp256k1.publicKeyConvert(publicKey, compressed) - }, - - publicKeyVerify: function (publicKey) { - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - return secp256k1.publicKeyVerify(publicKey) - }, - - publicKeyTweakAdd: function (publicKey, tweak, compressed) { - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - - assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID) - assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID) - - compressed = initCompressedValue(compressed, true) - - return secp256k1.publicKeyTweakAdd(publicKey, tweak, compressed) - }, - - publicKeyTweakMul: function (publicKey, tweak, compressed) { - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - - assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID) - assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID) - - compressed = initCompressedValue(compressed, true) - - return secp256k1.publicKeyTweakMul(publicKey, tweak, compressed) - }, - - publicKeyCombine: function (publicKeys, compressed) { - assert.isArray(publicKeys, messages.EC_PUBLIC_KEYS_TYPE_INVALID) - assert.isLengthGTZero(publicKeys, messages.EC_PUBLIC_KEYS_LENGTH_INVALID) - for (var i = 0; i < publicKeys.length; ++i) { - assert.isBuffer(publicKeys[i], messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKeys[i], 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - } - - compressed = initCompressedValue(compressed, true) - - return secp256k1.publicKeyCombine(publicKeys, compressed) - }, - - signatureNormalize: function (signature) { - assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID) - assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID) - - return secp256k1.signatureNormalize(signature) - }, - - signatureExport: function (signature) { - assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID) - assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID) - - var sigObj = secp256k1.signatureExport(signature) - return der.signatureExport(sigObj) - }, - - signatureImport: function (sig) { - assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID) - assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID) - - var sigObj = der.signatureImport(sig) - if (sigObj) return secp256k1.signatureImport(sigObj) - - throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL) - }, - - signatureImportLax: function (sig) { - assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID) - assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID) - - var sigObj = der.signatureImportLax(sig) - if (sigObj) return secp256k1.signatureImport(sigObj) - - throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL) - }, - - sign: function (message, privateKey, options) { - assert.isBuffer(message, messages.MSG32_TYPE_INVALID) - assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID) - - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - var data = null - var noncefn = null - if (options !== undefined) { - assert.isObject(options, messages.OPTIONS_TYPE_INVALID) - - if (options.data !== undefined) { - assert.isBuffer(options.data, messages.OPTIONS_DATA_TYPE_INVALID) - assert.isBufferLength(options.data, 32, messages.OPTIONS_DATA_LENGTH_INVALID) - data = options.data - } - - if (options.noncefn !== undefined) { - assert.isFunction(options.noncefn, messages.OPTIONS_NONCEFN_TYPE_INVALID) - noncefn = options.noncefn - } - } - - return secp256k1.sign(message, privateKey, noncefn, data) - }, - - verify: function (message, signature, publicKey) { - assert.isBuffer(message, messages.MSG32_TYPE_INVALID) - assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID) - - assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID) - assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID) - - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - - return secp256k1.verify(message, signature, publicKey) - }, - - recover: function (message, signature, recovery, compressed) { - assert.isBuffer(message, messages.MSG32_TYPE_INVALID) - assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID) - - assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID) - assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID) - - assert.isNumber(recovery, messages.RECOVERY_ID_TYPE_INVALID) - assert.isNumberInInterval(recovery, -1, 4, messages.RECOVERY_ID_VALUE_INVALID) - - compressed = initCompressedValue(compressed, true) - - return secp256k1.recover(message, signature, recovery, compressed) - }, - - ecdh: function (publicKey, privateKey) { - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - return secp256k1.ecdh(publicKey, privateKey) - }, - - ecdhUnsafe: function (publicKey, privateKey, compressed) { - assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID) - assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID) - - assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID) - assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID) - - compressed = initCompressedValue(compressed, true) - - return secp256k1.ecdhUnsafe(publicKey, privateKey, compressed) - } - } -} - - -/***/ }), -/* 122 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -// Reference https://github.com/bitcoin/bips/blob/master/bip-0066.mediawiki -// Format: 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S] -// NOTE: SIGHASH byte ignored AND restricted, truncate before use - -var Buffer = (__webpack_require__(6).Buffer) - -function check (buffer) { - if (buffer.length < 8) return false - if (buffer.length > 72) return false - if (buffer[0] !== 0x30) return false - if (buffer[1] !== buffer.length - 2) return false - if (buffer[2] !== 0x02) return false - - var lenR = buffer[3] - if (lenR === 0) return false - if (5 + lenR >= buffer.length) return false - if (buffer[4 + lenR] !== 0x02) return false - - var lenS = buffer[5 + lenR] - if (lenS === 0) return false - if ((6 + lenR + lenS) !== buffer.length) return false - - if (buffer[4] & 0x80) return false - if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) return false - - if (buffer[lenR + 6] & 0x80) return false - if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) return false - return true -} - -function decode (buffer) { - if (buffer.length < 8) throw new Error('DER sequence length is too short') - if (buffer.length > 72) throw new Error('DER sequence length is too long') - if (buffer[0] !== 0x30) throw new Error('Expected DER sequence') - if (buffer[1] !== buffer.length - 2) throw new Error('DER sequence length is invalid') - if (buffer[2] !== 0x02) throw new Error('Expected DER integer') - - var lenR = buffer[3] - if (lenR === 0) throw new Error('R length is zero') - if (5 + lenR >= buffer.length) throw new Error('R length is too long') - if (buffer[4 + lenR] !== 0x02) throw new Error('Expected DER integer (2)') - - var lenS = buffer[5 + lenR] - if (lenS === 0) throw new Error('S length is zero') - if ((6 + lenR + lenS) !== buffer.length) throw new Error('S length is invalid') - - if (buffer[4] & 0x80) throw new Error('R value is negative') - if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) throw new Error('R value excessively padded') - - if (buffer[lenR + 6] & 0x80) throw new Error('S value is negative') - if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) throw new Error('S value excessively padded') - - // non-BIP66 - extract R, S values - return { - r: buffer.slice(4, 4 + lenR), - s: buffer.slice(6 + lenR) - } -} - -/* - * Expects r and s to be positive DER integers. - * - * The DER format uses the most significant bit as a sign bit (& 0x80). - * If the significant bit is set AND the integer is positive, a 0x00 is prepended. - * - * Examples: - * - * 0 => 0x00 - * 1 => 0x01 - * -1 => 0xff - * 127 => 0x7f - * -127 => 0x81 - * 128 => 0x0080 - * -128 => 0x80 - * 255 => 0x00ff - * -255 => 0xff01 - * 16300 => 0x3fac - * -16300 => 0xc054 - * 62300 => 0x00f35c - * -62300 => 0xff0ca4 -*/ -function encode (r, s) { - var lenR = r.length - var lenS = s.length - if (lenR === 0) throw new Error('R length is zero') - if (lenS === 0) throw new Error('S length is zero') - if (lenR > 33) throw new Error('R length is too long') - if (lenS > 33) throw new Error('S length is too long') - if (r[0] & 0x80) throw new Error('R value is negative') - if (s[0] & 0x80) throw new Error('S value is negative') - if (lenR > 1 && (r[0] === 0x00) && !(r[1] & 0x80)) throw new Error('R value excessively padded') - if (lenS > 1 && (s[0] === 0x00) && !(s[1] & 0x80)) throw new Error('S value excessively padded') - - var signature = Buffer.allocUnsafe(6 + lenR + lenS) - - // 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S] - signature[0] = 0x30 - signature[1] = signature.length - 2 - signature[2] = 0x02 - signature[3] = r.length - r.copy(signature, 4) - signature[4 + lenR] = 0x02 - signature[5 + lenR] = s.length - s.copy(signature, 6 + lenR) - - return signature -} - -module.exports = { - check: check, - decode: decode, - encode: encode -} - - -/***/ }), -/* 123 */ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"COMPRESSED_TYPE_INVALID":"compressed should be a boolean","EC_PRIVATE_KEY_TYPE_INVALID":"private key should be a Buffer","EC_PRIVATE_KEY_LENGTH_INVALID":"private key length is invalid","EC_PRIVATE_KEY_RANGE_INVALID":"private key range is invalid","EC_PRIVATE_KEY_TWEAK_ADD_FAIL":"tweak out of range or resulting private key is invalid","EC_PRIVATE_KEY_TWEAK_MUL_FAIL":"tweak out of range","EC_PRIVATE_KEY_EXPORT_DER_FAIL":"couldn\'t export to DER format","EC_PRIVATE_KEY_IMPORT_DER_FAIL":"couldn\'t import from DER format","EC_PUBLIC_KEYS_TYPE_INVALID":"public keys should be an Array","EC_PUBLIC_KEYS_LENGTH_INVALID":"public keys Array should have at least 1 element","EC_PUBLIC_KEY_TYPE_INVALID":"public key should be a Buffer","EC_PUBLIC_KEY_LENGTH_INVALID":"public key length is invalid","EC_PUBLIC_KEY_PARSE_FAIL":"the public key could not be parsed or is invalid","EC_PUBLIC_KEY_CREATE_FAIL":"private was invalid, try again","EC_PUBLIC_KEY_TWEAK_ADD_FAIL":"tweak out of range or resulting public key is invalid","EC_PUBLIC_KEY_TWEAK_MUL_FAIL":"tweak out of range","EC_PUBLIC_KEY_COMBINE_FAIL":"the sum of the public keys is not valid","ECDH_FAIL":"scalar was invalid (zero or overflow)","ECDSA_SIGNATURE_TYPE_INVALID":"signature should be a Buffer","ECDSA_SIGNATURE_LENGTH_INVALID":"signature length is invalid","ECDSA_SIGNATURE_PARSE_FAIL":"couldn\'t parse signature","ECDSA_SIGNATURE_PARSE_DER_FAIL":"couldn\'t parse DER signature","ECDSA_SIGNATURE_SERIALIZE_DER_FAIL":"couldn\'t serialize signature to DER format","ECDSA_SIGN_FAIL":"nonce generation function failed or private key is invalid","ECDSA_RECOVER_FAIL":"couldn\'t recover public key from signature","MSG32_TYPE_INVALID":"message should be a Buffer","MSG32_LENGTH_INVALID":"message length is invalid","OPTIONS_TYPE_INVALID":"options should be an Object","OPTIONS_DATA_TYPE_INVALID":"options.data should be a Buffer","OPTIONS_DATA_LENGTH_INVALID":"options.data length is invalid","OPTIONS_NONCEFN_TYPE_INVALID":"options.noncefn should be a Function","RECOVERY_ID_TYPE_INVALID":"recovery should be a Number","RECOVERY_ID_VALUE_INVALID":"recovery should have value between -1 and 4","TWEAK_TYPE_INVALID":"tweak should be a Buffer","TWEAK_LENGTH_INVALID":"tweak length is invalid"}'); - -/***/ }), -/* 124 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -var Buffer = (__webpack_require__(6).Buffer) -var createHash = __webpack_require__(54) -var BN = __webpack_require__(2) -var EC = (__webpack_require__(48).ec) - -var messages = __webpack_require__(123) - -var ec = new EC('secp256k1') -var ecparams = ec.curve - -function loadCompressedPublicKey (first, xBuffer) { - var x = new BN(xBuffer) - - // overflow - if (x.cmp(ecparams.p) >= 0) return null - x = x.toRed(ecparams.red) - - // compute corresponding Y - var y = x.redSqr().redIMul(x).redIAdd(ecparams.b).redSqrt() - if ((first === 0x03) !== y.isOdd()) y = y.redNeg() - - return ec.keyPair({ pub: { x: x, y: y } }) -} - -function loadUncompressedPublicKey (first, xBuffer, yBuffer) { - var x = new BN(xBuffer) - var y = new BN(yBuffer) - - // overflow - if (x.cmp(ecparams.p) >= 0 || y.cmp(ecparams.p) >= 0) return null - - x = x.toRed(ecparams.red) - y = y.toRed(ecparams.red) - - // is odd flag - if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null - - // x*x*x + b = y*y - var x3 = x.redSqr().redIMul(x) - if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null - - return ec.keyPair({ pub: { x: x, y: y } }) -} - -function loadPublicKey (publicKey) { - var first = publicKey[0] - switch (first) { - case 0x02: - case 0x03: - if (publicKey.length !== 33) return null - return loadCompressedPublicKey(first, publicKey.slice(1, 33)) - case 0x04: - case 0x06: - case 0x07: - if (publicKey.length !== 65) return null - return loadUncompressedPublicKey(first, publicKey.slice(1, 33), publicKey.slice(33, 65)) - default: - return null - } -} - -exports.privateKeyVerify = function (privateKey) { - var bn = new BN(privateKey) - return bn.cmp(ecparams.n) < 0 && !bn.isZero() -} - -exports.privateKeyExport = function (privateKey, compressed) { - var d = new BN(privateKey) - if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PRIVATE_KEY_EXPORT_DER_FAIL) - - return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true)) -} - -exports.privateKeyNegate = function (privateKey) { - var bn = new BN(privateKey) - return bn.isZero() ? Buffer.alloc(32) : ecparams.n.sub(bn).umod(ecparams.n).toArrayLike(Buffer, 'be', 32) -} - -exports.privateKeyModInverse = function (privateKey) { - var bn = new BN(privateKey) - if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_RANGE_INVALID) - - return bn.invm(ecparams.n).toArrayLike(Buffer, 'be', 32) -} - -exports.privateKeyTweakAdd = function (privateKey, tweak) { - var bn = new BN(tweak) - if (bn.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL) - - bn.iadd(new BN(privateKey)) - if (bn.cmp(ecparams.n) >= 0) bn.isub(ecparams.n) - if (bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL) - - return bn.toArrayLike(Buffer, 'be', 32) -} - -exports.privateKeyTweakMul = function (privateKey, tweak) { - var bn = new BN(tweak) - if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_MUL_FAIL) - - bn.imul(new BN(privateKey)) - if (bn.cmp(ecparams.n)) bn = bn.umod(ecparams.n) - - return bn.toArrayLike(Buffer, 'be', 32) -} - -exports.publicKeyCreate = function (privateKey, compressed) { - var d = new BN(privateKey) - if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PUBLIC_KEY_CREATE_FAIL) - - return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true)) -} - -exports.publicKeyConvert = function (publicKey, compressed) { - var pair = loadPublicKey(publicKey) - if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL) - - return Buffer.from(pair.getPublic(compressed, true)) -} - -exports.publicKeyVerify = function (publicKey) { - return loadPublicKey(publicKey) !== null -} - -exports.publicKeyTweakAdd = function (publicKey, tweak, compressed) { - var pair = loadPublicKey(publicKey) - if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL) - - tweak = new BN(tweak) - if (tweak.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL) - - var point = ecparams.g.mul(tweak).add(pair.pub) - if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL) - - return Buffer.from(point.encode(true, compressed)) -} - -exports.publicKeyTweakMul = function (publicKey, tweak, compressed) { - var pair = loadPublicKey(publicKey) - if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL) - - tweak = new BN(tweak) - if (tweak.cmp(ecparams.n) >= 0 || tweak.isZero()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_MUL_FAIL) - - return Buffer.from(pair.pub.mul(tweak).encode(true, compressed)) -} - -exports.publicKeyCombine = function (publicKeys, compressed) { - var pairs = new Array(publicKeys.length) - for (var i = 0; i < publicKeys.length; ++i) { - pairs[i] = loadPublicKey(publicKeys[i]) - if (pairs[i] === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL) - } - - var point = pairs[0].pub - for (var j = 1; j < pairs.length; ++j) point = point.add(pairs[j].pub) - if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_COMBINE_FAIL) - - return Buffer.from(point.encode(true, compressed)) -} - -exports.signatureNormalize = function (signature) { - var r = new BN(signature.slice(0, 32)) - var s = new BN(signature.slice(32, 64)) - if (r.cmp(ecparams.n) >= 0 || s.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL) - - var result = Buffer.from(signature) - if (s.cmp(ec.nh) === 1) ecparams.n.sub(s).toArrayLike(Buffer, 'be', 32).copy(result, 32) - - return result -} - -exports.signatureExport = function (signature) { - var r = signature.slice(0, 32) - var s = signature.slice(32, 64) - if (new BN(r).cmp(ecparams.n) >= 0 || new BN(s).cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL) - - return { r: r, s: s } -} - -exports.signatureImport = function (sigObj) { - var r = new BN(sigObj.r) - if (r.cmp(ecparams.n) >= 0) r = new BN(0) - - var s = new BN(sigObj.s) - if (s.cmp(ecparams.n) >= 0) s = new BN(0) - - return Buffer.concat([ - r.toArrayLike(Buffer, 'be', 32), - s.toArrayLike(Buffer, 'be', 32) - ]) -} - -exports.sign = function (message, privateKey, noncefn, data) { - if (typeof noncefn === 'function') { - var getNonce = noncefn - noncefn = function (counter) { - var nonce = getNonce(message, privateKey, null, data, counter) - if (!Buffer.isBuffer(nonce) || nonce.length !== 32) throw new Error(messages.ECDSA_SIGN_FAIL) - - return new BN(nonce) - } - } - - var d = new BN(privateKey) - if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.ECDSA_SIGN_FAIL) - - var result = ec.sign(message, privateKey, { canonical: true, k: noncefn, pers: data }) - return { - signature: Buffer.concat([ - result.r.toArrayLike(Buffer, 'be', 32), - result.s.toArrayLike(Buffer, 'be', 32) - ]), - recovery: result.recoveryParam - } -} - -exports.verify = function (message, signature, publicKey) { - var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) } - - var sigr = new BN(sigObj.r) - var sigs = new BN(sigObj.s) - if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL) - if (sigs.cmp(ec.nh) === 1 || sigr.isZero() || sigs.isZero()) return false - - var pair = loadPublicKey(publicKey) - if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL) - - return ec.verify(message, sigObj, { x: pair.pub.x, y: pair.pub.y }) -} - -exports.recover = function (message, signature, recovery, compressed) { - var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) } - - var sigr = new BN(sigObj.r) - var sigs = new BN(sigObj.s) - if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL) - - try { - if (sigr.isZero() || sigs.isZero()) throw new Error() - - var point = ec.recoverPubKey(message, sigObj, recovery) - return Buffer.from(point.encode(true, compressed)) - } catch (err) { - throw new Error(messages.ECDSA_RECOVER_FAIL) - } -} - -exports.ecdh = function (publicKey, privateKey) { - var shared = exports.ecdhUnsafe(publicKey, privateKey, true) - return createHash('sha256').update(shared).digest() -} - -exports.ecdhUnsafe = function (publicKey, privateKey, compressed) { - var pair = loadPublicKey(publicKey) - if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL) - - var scalar = new BN(privateKey) - if (scalar.cmp(ecparams.n) >= 0 || scalar.isZero()) throw new Error(messages.ECDH_FAIL) - - return Buffer.from(pair.pub.mul(scalar).encode(true, compressed)) -} - - -/***/ }), -/* 125 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const scrypt = __webpack_require__(126) -scrypt.async = __webpack_require__(127) -module.exports = scrypt - - -/***/ }), -/* 126 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const crypto = __webpack_require__(4) -const { - checkAndInit, - smixSync -} = __webpack_require__(58) - -// N = Cpu cost, r = Memory cost, p = parallelization cost -function scrypt (key, salt, N, r, p, dkLen, progressCallback) { - const { - XY, - V, - B32, - x, - _X, - B, - tickCallback - } = checkAndInit(key, salt, N, r, p, dkLen, progressCallback) - - for (var i = 0; i < p; i++) { - smixSync(B, i * 128 * r, r, N, V, XY, _X, B32, x, tickCallback) - } - - return crypto.pbkdf2Sync(key, B, 1, dkLen, 'sha256') -} - -module.exports = scrypt - - -/***/ }), -/* 127 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const crypto = __webpack_require__(4) -const { - checkAndInit, - smix -} = __webpack_require__(58) - -// N = Cpu cost, r = Memory cost, p = parallelization cost -async function scrypt (key, salt, N, r, p, dkLen, progressCallback, promiseInterval) { - const { - XY, - V, - B32, - x, - _X, - B, - tickCallback - } = checkAndInit(key, salt, N, r, p, dkLen, progressCallback) - - for (var i = 0; i < p; i++) { - await smix(B, i * 128 * r, r, N, V, XY, _X, B32, x, tickCallback, promiseInterval) - } - - return crypto.pbkdf2Sync(key, B, 1, dkLen, 'sha256') -} - -module.exports = scrypt - - -/***/ }), -/* 128 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(59)(__webpack_require__(138)(__dirname)) - - -/***/ }), -/* 129 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const { Transform } = __webpack_require__(36) - -module.exports = (KeccakState) => class Keccak extends Transform { - constructor (rate, capacity, delimitedSuffix, hashBitLength, options) { - super(options) - - this._rate = rate - this._capacity = capacity - this._delimitedSuffix = delimitedSuffix - this._hashBitLength = hashBitLength - this._options = options - - this._state = new KeccakState() - this._state.initialize(rate, capacity) - this._finalized = false - } - - _transform (chunk, encoding, callback) { - let error = null - try { - this.update(chunk, encoding) - } catch (err) { - error = err - } - - callback(error) - } - - _flush (callback) { - let error = null - try { - this.push(this.digest()) - } catch (err) { - error = err - } - - callback(error) - } - - update (data, encoding) { - if (!Buffer.isBuffer(data) && typeof data !== 'string') throw new TypeError('Data must be a string or a buffer') - if (this._finalized) throw new Error('Digest already called') - if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding) - - this._state.absorb(data) - - return this - } - - digest (encoding) { - if (this._finalized) throw new Error('Digest already called') - this._finalized = true - - if (this._delimitedSuffix) this._state.absorbLastFewBits(this._delimitedSuffix) - let digest = this._state.squeeze(this._hashBitLength / 8) - if (encoding !== undefined) digest = digest.toString(encoding) - - this._resetState() - - return digest - } - - // remove result from memory - _resetState () { - this._state.initialize(this._rate, this._capacity) - return this - } - - // because sometimes we need hash right now and little later - _clone () { - const clone = new Keccak(this._rate, this._capacity, this._delimitedSuffix, this._hashBitLength, this._options) - this._state.copy(clone._state) - clone._finalized = this._finalized - - return clone - } -} - - -/***/ }), -/* 130 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("stream"); - -/***/ }), -/* 131 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(130); - - -/***/ }), -/* 132 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; } -function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; } -function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } -function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } } -function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; } -function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return typeof key === "symbol" ? key : String(key); } -function _toPrimitive(input, hint) { if (typeof input !== "object" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || "default"); if (typeof res !== "object") return res; throw new TypeError("@@toPrimitive must return a primitive value."); } return (hint === "string" ? String : Number)(input); } -var _require = __webpack_require__(10), - Buffer = _require.Buffer; -var _require2 = __webpack_require__(29), - inspect = _require2.inspect; -var custom = inspect && inspect.custom || 'inspect'; -function copyBuffer(src, target, offset) { - Buffer.prototype.copy.call(src, target, offset); -} -module.exports = /*#__PURE__*/function () { - function BufferList() { - _classCallCheck(this, BufferList); - this.head = null; - this.tail = null; - this.length = 0; - } - _createClass(BufferList, [{ - key: "push", - value: function push(v) { - var entry = { - data: v, - next: null - }; - if (this.length > 0) this.tail.next = entry;else this.head = entry; - this.tail = entry; - ++this.length; - } - }, { - key: "unshift", - value: function unshift(v) { - var entry = { - data: v, - next: this.head - }; - if (this.length === 0) this.tail = entry; - this.head = entry; - ++this.length; - } - }, { - key: "shift", - value: function shift() { - if (this.length === 0) return; - var ret = this.head.data; - if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next; - --this.length; - return ret; - } - }, { - key: "clear", - value: function clear() { - this.head = this.tail = null; - this.length = 0; - } - }, { - key: "join", - value: function join(s) { - if (this.length === 0) return ''; - var p = this.head; - var ret = '' + p.data; - while (p = p.next) ret += s + p.data; - return ret; - } - }, { - key: "concat", - value: function concat(n) { - if (this.length === 0) return Buffer.alloc(0); - var ret = Buffer.allocUnsafe(n >>> 0); - var p = this.head; - var i = 0; - while (p) { - copyBuffer(p.data, ret, i); - i += p.data.length; - p = p.next; - } - return ret; - } - - // Consumes a specified amount of bytes or characters from the buffered data. - }, { - key: "consume", - value: function consume(n, hasStrings) { - var ret; - if (n < this.head.data.length) { - // `slice` is the same for buffers and strings. - ret = this.head.data.slice(0, n); - this.head.data = this.head.data.slice(n); - } else if (n === this.head.data.length) { - // First chunk is a perfect match. - ret = this.shift(); - } else { - // Result spans more than one buffer. - ret = hasStrings ? this._getString(n) : this._getBuffer(n); - } - return ret; - } - }, { - key: "first", - value: function first() { - return this.head.data; - } - - // Consumes a specified amount of characters from the buffered data. - }, { - key: "_getString", - value: function _getString(n) { - var p = this.head; - var c = 1; - var ret = p.data; - n -= ret.length; - while (p = p.next) { - var str = p.data; - var nb = n > str.length ? str.length : n; - if (nb === str.length) ret += str;else ret += str.slice(0, n); - n -= nb; - if (n === 0) { - if (nb === str.length) { - ++c; - if (p.next) this.head = p.next;else this.head = this.tail = null; - } else { - this.head = p; - p.data = str.slice(nb); - } - break; - } - ++c; - } - this.length -= c; - return ret; - } - - // Consumes a specified amount of bytes from the buffered data. - }, { - key: "_getBuffer", - value: function _getBuffer(n) { - var ret = Buffer.allocUnsafe(n); - var p = this.head; - var c = 1; - p.data.copy(ret); - n -= p.data.length; - while (p = p.next) { - var buf = p.data; - var nb = n > buf.length ? buf.length : n; - buf.copy(ret, ret.length - n, 0, nb); - n -= nb; - if (n === 0) { - if (nb === buf.length) { - ++c; - if (p.next) this.head = p.next;else this.head = this.tail = null; - } else { - this.head = p; - p.data = buf.slice(nb); - } - break; - } - ++c; - } - this.length -= c; - return ret; - } - - // Make sure the linked list only shows the minimal necessary information. - }, { - key: custom, - value: function value(_, options) { - return inspect(this, _objectSpread(_objectSpread({}, options), {}, { - // Only inspect one level. - depth: 0, - // It should not recurse. - customInspect: false - })); - } - }]); - return BufferList; -}(); - -/***/ }), -/* 133 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var _Object$setPrototypeO; -function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } -function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return typeof key === "symbol" ? key : String(key); } -function _toPrimitive(input, hint) { if (typeof input !== "object" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || "default"); if (typeof res !== "object") return res; throw new TypeError("@@toPrimitive must return a primitive value."); } return (hint === "string" ? String : Number)(input); } -var finished = __webpack_require__(35); -var kLastResolve = Symbol('lastResolve'); -var kLastReject = Symbol('lastReject'); -var kError = Symbol('error'); -var kEnded = Symbol('ended'); -var kLastPromise = Symbol('lastPromise'); -var kHandlePromise = Symbol('handlePromise'); -var kStream = Symbol('stream'); -function createIterResult(value, done) { - return { - value: value, - done: done - }; -} -function readAndResolve(iter) { - var resolve = iter[kLastResolve]; - if (resolve !== null) { - var data = iter[kStream].read(); - // we defer if data is null - // we can be expecting either 'end' or - // 'error' - if (data !== null) { - iter[kLastPromise] = null; - iter[kLastResolve] = null; - iter[kLastReject] = null; - resolve(createIterResult(data, false)); - } - } -} -function onReadable(iter) { - // we wait for the next tick, because it might - // emit an error with process.nextTick - process.nextTick(readAndResolve, iter); -} -function wrapForNext(lastPromise, iter) { - return function (resolve, reject) { - lastPromise.then(function () { - if (iter[kEnded]) { - resolve(createIterResult(undefined, true)); - return; - } - iter[kHandlePromise](resolve, reject); - }, reject); - }; -} -var AsyncIteratorPrototype = Object.getPrototypeOf(function () {}); -var ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = { - get stream() { - return this[kStream]; - }, - next: function next() { - var _this = this; - // if we have detected an error in the meanwhile - // reject straight away - var error = this[kError]; - if (error !== null) { - return Promise.reject(error); - } - if (this[kEnded]) { - return Promise.resolve(createIterResult(undefined, true)); - } - if (this[kStream].destroyed) { - // We need to defer via nextTick because if .destroy(err) is - // called, the error will be emitted via nextTick, and - // we cannot guarantee that there is no error lingering around - // waiting to be emitted. - return new Promise(function (resolve, reject) { - process.nextTick(function () { - if (_this[kError]) { - reject(_this[kError]); - } else { - resolve(createIterResult(undefined, true)); - } - }); - }); - } - - // if we have multiple next() calls - // we will wait for the previous Promise to finish - // this logic is optimized to support for await loops, - // where next() is only called once at a time - var lastPromise = this[kLastPromise]; - var promise; - if (lastPromise) { - promise = new Promise(wrapForNext(lastPromise, this)); - } else { - // fast path needed to support multiple this.push() - // without triggering the next() queue - var data = this[kStream].read(); - if (data !== null) { - return Promise.resolve(createIterResult(data, false)); - } - promise = new Promise(this[kHandlePromise]); - } - this[kLastPromise] = promise; - return promise; - } -}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () { - return this; -}), _defineProperty(_Object$setPrototypeO, "return", function _return() { - var _this2 = this; - // destroy(err, cb) is a private API - // we can guarantee we have that here, because we control the - // Readable class this is attached to - return new Promise(function (resolve, reject) { - _this2[kStream].destroy(null, function (err) { - if (err) { - reject(err); - return; - } - resolve(createIterResult(undefined, true)); - }); - }); -}), _Object$setPrototypeO), AsyncIteratorPrototype); -var createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) { - var _Object$create; - var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, { - value: stream, - writable: true - }), _defineProperty(_Object$create, kLastResolve, { - value: null, - writable: true - }), _defineProperty(_Object$create, kLastReject, { - value: null, - writable: true - }), _defineProperty(_Object$create, kError, { - value: null, - writable: true - }), _defineProperty(_Object$create, kEnded, { - value: stream._readableState.endEmitted, - writable: true - }), _defineProperty(_Object$create, kHandlePromise, { - value: function value(resolve, reject) { - var data = iterator[kStream].read(); - if (data) { - iterator[kLastPromise] = null; - iterator[kLastResolve] = null; - iterator[kLastReject] = null; - resolve(createIterResult(data, false)); - } else { - iterator[kLastResolve] = resolve; - iterator[kLastReject] = reject; - } - }, - writable: true - }), _Object$create)); - iterator[kLastPromise] = null; - finished(stream, function (err) { - if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') { - var reject = iterator[kLastReject]; - // reject if we are waiting for data in the Promise - // returned by next() and store the error - if (reject !== null) { - iterator[kLastPromise] = null; - iterator[kLastResolve] = null; - iterator[kLastReject] = null; - reject(err); - } - iterator[kError] = err; - return; - } - var resolve = iterator[kLastResolve]; - if (resolve !== null) { - iterator[kLastPromise] = null; - iterator[kLastResolve] = null; - iterator[kLastReject] = null; - resolve(createIterResult(undefined, true)); - } - iterator[kEnded] = true; - }); - stream.on('readable', onReadable.bind(null, iterator)); - return iterator; -}; -module.exports = createReadableStreamAsyncIterator; - -/***/ }), -/* 134 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } } -function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; } -function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; } -function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; } -function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } -function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return typeof key === "symbol" ? key : String(key); } -function _toPrimitive(input, hint) { if (typeof input !== "object" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || "default"); if (typeof res !== "object") return res; throw new TypeError("@@toPrimitive must return a primitive value."); } return (hint === "string" ? String : Number)(input); } -var ERR_INVALID_ARG_TYPE = (__webpack_require__(15)/* .codes.ERR_INVALID_ARG_TYPE */ .q.ERR_INVALID_ARG_TYPE); -function from(Readable, iterable, opts) { - var iterator; - if (iterable && typeof iterable.next === 'function') { - iterator = iterable; - } else if (iterable && iterable[Symbol.asyncIterator]) iterator = iterable[Symbol.asyncIterator]();else if (iterable && iterable[Symbol.iterator]) iterator = iterable[Symbol.iterator]();else throw new ERR_INVALID_ARG_TYPE('iterable', ['Iterable'], iterable); - var readable = new Readable(_objectSpread({ - objectMode: true - }, opts)); - // Reading boolean to protect against _read - // being called before last iteration completion. - var reading = false; - readable._read = function () { - if (!reading) { - reading = true; - next(); - } - }; - function next() { - return _next2.apply(this, arguments); - } - function _next2() { - _next2 = _asyncToGenerator(function* () { - try { - var _yield$iterator$next = yield iterator.next(), - value = _yield$iterator$next.value, - done = _yield$iterator$next.done; - if (done) { - readable.push(null); - } else if (readable.push(yield value)) { - next(); - } else { - reading = false; - } - } catch (err) { - readable.destroy(err); - } - }); - return _next2.apply(this, arguments); - } - return readable; -} -module.exports = from; - - -/***/ }), -/* 135 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - -// a passthrough stream. -// basically just the most minimal sort of Transform stream. -// Every written chunk gets output as-is. - - - -module.exports = PassThrough; -var Transform = __webpack_require__(64); -__webpack_require__(7)(PassThrough, Transform); -function PassThrough(options) { - if (!(this instanceof PassThrough)) return new PassThrough(options); - Transform.call(this, options); -} -PassThrough.prototype._transform = function (chunk, encoding, cb) { - cb(null, chunk); -}; - -/***/ }), -/* 136 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Ported from https://github.com/mafintosh/pump with -// permission from the author, Mathias Buus (@mafintosh). - - - -var eos; -function once(callback) { - var called = false; - return function () { - if (called) return; - called = true; - callback.apply(void 0, arguments); - }; -} -var _require$codes = (__webpack_require__(15)/* .codes */ .q), - ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS, - ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED; -function noop(err) { - // Rethrow the error if it exists to avoid swallowing it - if (err) throw err; -} -function isRequest(stream) { - return stream.setHeader && typeof stream.abort === 'function'; -} -function destroyer(stream, reading, writing, callback) { - callback = once(callback); - var closed = false; - stream.on('close', function () { - closed = true; - }); - if (eos === undefined) eos = __webpack_require__(35); - eos(stream, { - readable: reading, - writable: writing - }, function (err) { - if (err) return callback(err); - closed = true; - callback(); - }); - var destroyed = false; - return function (err) { - if (closed) return; - if (destroyed) return; - destroyed = true; - - // request.destroy just do .end - .abort is what we want - if (isRequest(stream)) return stream.abort(); - if (typeof stream.destroy === 'function') return stream.destroy(); - callback(err || new ERR_STREAM_DESTROYED('pipe')); - }; -} -function call(fn) { - fn(); -} -function pipe(from, to) { - return from.pipe(to); -} -function popCallback(streams) { - if (!streams.length) return noop; - if (typeof streams[streams.length - 1] !== 'function') return noop; - return streams.pop(); -} -function pipeline() { - for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) { - streams[_key] = arguments[_key]; - } - var callback = popCallback(streams); - if (Array.isArray(streams[0])) streams = streams[0]; - if (streams.length < 2) { - throw new ERR_MISSING_ARGS('streams'); - } - var error; - var destroys = streams.map(function (stream, i) { - var reading = i < streams.length - 1; - var writing = i > 0; - return destroyer(stream, reading, writing, function (err) { - if (!error) error = err; - if (err) destroys.forEach(call); - if (reading) return; - destroys.forEach(call); - callback(error); - }); - }); - return streams.reduce(pipe); -} -module.exports = pipeline; - -/***/ }), -/* 137 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const { Transform } = __webpack_require__(36) - -module.exports = (KeccakState) => class Shake extends Transform { - constructor (rate, capacity, delimitedSuffix, options) { - super(options) - - this._rate = rate - this._capacity = capacity - this._delimitedSuffix = delimitedSuffix - this._options = options - - this._state = new KeccakState() - this._state.initialize(rate, capacity) - this._finalized = false - } - - _transform (chunk, encoding, callback) { - let error = null - try { - this.update(chunk, encoding) - } catch (err) { - error = err - } - - callback(error) - } - - _flush () {} - - _read (size) { - this.push(this.squeeze(size)) - } - - update (data, encoding) { - if (!Buffer.isBuffer(data) && typeof data !== 'string') throw new TypeError('Data must be a string or a buffer') - if (this._finalized) throw new Error('Squeeze already called') - if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding) - - this._state.absorb(data) - - return this - } - - squeeze (dataByteLength, encoding) { - if (!this._finalized) { - this._finalized = true - this._state.absorbLastFewBits(this._delimitedSuffix) - } - - let data = this._state.squeeze(dataByteLength) - if (encoding !== undefined) data = data.toString(encoding) - - return data - } - - _resetState () { - this._state.initialize(this._rate, this._capacity) - return this - } - - _clone () { - const clone = new Shake(this._rate, this._capacity, this._delimitedSuffix, this._options) - this._state.copy(clone._state) - clone._finalized = this._finalized - - return clone - } -} - - -/***/ }), -/* 138 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -if (typeof process.addon === 'function') { // if the platform supports native resolving prefer that - module.exports = process.addon.bind(process) -} else { // else use the runtime version here - module.exports = __webpack_require__(139) -} - - -/***/ }), -/* 139 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var fs = __webpack_require__(56) -var path = __webpack_require__(57) -var os = __webpack_require__(168) - -// Workaround to fix webpack's build warnings: 'the request of a dependency is an expression' -var runtimeRequire = true ? require : 0 // eslint-disable-line - -var vars = (process.config && process.config.variables) || {} -var prebuildsOnly = !!process.env.PREBUILDS_ONLY -var abi = process.versions.modules // TODO: support old node where this is undef -var runtime = isElectron() ? 'electron' : (isNwjs() ? 'node-webkit' : 'node') - -var arch = process.env.npm_config_arch || os.arch() -var platform = process.env.npm_config_platform || os.platform() -var libc = process.env.LIBC || (isAlpine(platform) ? 'musl' : 'glibc') -var armv = process.env.ARM_VERSION || (arch === 'arm64' ? '8' : vars.arm_version) || '' -var uv = (process.versions.uv || '').split('.')[0] - -module.exports = load - -function load (dir) { - return runtimeRequire(load.resolve(dir)) -} - -load.resolve = load.path = function (dir) { - dir = path.resolve(dir || '.') - - try { - var name = runtimeRequire(path.join(dir, 'package.json')).name.toUpperCase().replace(/-/g, '_') - if (process.env[name + '_PREBUILD']) dir = process.env[name + '_PREBUILD'] - } catch (err) {} - - if (!prebuildsOnly) { - var release = getFirst(path.join(dir, 'build/Release'), matchBuild) - if (release) return release - - var debug = getFirst(path.join(dir, 'build/Debug'), matchBuild) - if (debug) return debug - } - - var prebuild = resolve(dir) - if (prebuild) return prebuild - - var nearby = resolve(path.dirname(process.execPath)) - if (nearby) return nearby - - var target = [ - 'platform=' + platform, - 'arch=' + arch, - 'runtime=' + runtime, - 'abi=' + abi, - 'uv=' + uv, - armv ? 'armv=' + armv : '', - 'libc=' + libc, - 'node=' + process.versions.node, - process.versions.electron ? 'electron=' + process.versions.electron : '', - true ? 'webpack=true' : 0 // eslint-disable-line - ].filter(Boolean).join(' ') - - throw new Error('No native build was found for ' + target + '\n loaded from: ' + dir + '\n') - - function resolve (dir) { - // Find matching "prebuilds/-" directory - var tuples = readdirSync(path.join(dir, 'prebuilds')).map(parseTuple) - var tuple = tuples.filter(matchTuple(platform, arch)).sort(compareTuples)[0] - if (!tuple) return - - // Find most specific flavor first - var prebuilds = path.join(dir, 'prebuilds', tuple.name) - var parsed = readdirSync(prebuilds).map(parseTags) - var candidates = parsed.filter(matchTags(runtime, abi)) - var winner = candidates.sort(compareTags(runtime))[0] - if (winner) return path.join(prebuilds, winner.file) - } -} - -function readdirSync (dir) { - try { - return fs.readdirSync(dir) - } catch (err) { - return [] - } -} - -function getFirst (dir, filter) { - var files = readdirSync(dir).filter(filter) - return files[0] && path.join(dir, files[0]) -} - -function matchBuild (name) { - return /\.node$/.test(name) -} - -function parseTuple (name) { - // Example: darwin-x64+arm64 - var arr = name.split('-') - if (arr.length !== 2) return - - var platform = arr[0] - var architectures = arr[1].split('+') - - if (!platform) return - if (!architectures.length) return - if (!architectures.every(Boolean)) return - - return { name, platform, architectures } -} - -function matchTuple (platform, arch) { - return function (tuple) { - if (tuple == null) return false - if (tuple.platform !== platform) return false - return tuple.architectures.includes(arch) - } -} - -function compareTuples (a, b) { - // Prefer single-arch prebuilds over multi-arch - return a.architectures.length - b.architectures.length -} - -function parseTags (file) { - var arr = file.split('.') - var extension = arr.pop() - var tags = { file: file, specificity: 0 } - - if (extension !== 'node') return - - for (var i = 0; i < arr.length; i++) { - var tag = arr[i] - - if (tag === 'node' || tag === 'electron' || tag === 'node-webkit') { - tags.runtime = tag - } else if (tag === 'napi') { - tags.napi = true - } else if (tag.slice(0, 3) === 'abi') { - tags.abi = tag.slice(3) - } else if (tag.slice(0, 2) === 'uv') { - tags.uv = tag.slice(2) - } else if (tag.slice(0, 4) === 'armv') { - tags.armv = tag.slice(4) - } else if (tag === 'glibc' || tag === 'musl') { - tags.libc = tag - } else { - continue - } - - tags.specificity++ - } - - return tags -} - -function matchTags (runtime, abi) { - return function (tags) { - if (tags == null) return false - if (tags.runtime !== runtime && !runtimeAgnostic(tags)) return false - if (tags.abi !== abi && !tags.napi) return false - if (tags.uv && tags.uv !== uv) return false - if (tags.armv && tags.armv !== armv) return false - if (tags.libc && tags.libc !== libc) return false - - return true - } -} - -function runtimeAgnostic (tags) { - return tags.runtime === 'node' && tags.napi -} - -function compareTags (runtime) { - // Precedence: non-agnostic runtime, abi over napi, then by specificity. - return function (a, b) { - if (a.runtime !== b.runtime) { - return a.runtime === runtime ? -1 : 1 - } else if (a.abi !== b.abi) { - return a.abi ? -1 : 1 - } else if (a.specificity !== b.specificity) { - return a.specificity > b.specificity ? -1 : 1 - } else { - return 0 - } - } -} - -function isNwjs () { - return !!(process.versions && process.versions.nw) -} - -function isElectron () { - if (process.versions && process.versions.electron) return true - if (process.env.ELECTRON_RUN_AS_NODE) return true - return typeof window !== 'undefined' && window.process && window.process.type === 'renderer' -} - -function isAlpine (platform) { - return platform === 'linux' && fs.existsSync('/etc/alpine-release') -} - -// Exposed for unit tests -// TODO: move to lib -load.parseTags = parseTags -load.matchTags = matchTags -load.compareTags = compareTags -load.parseTuple = parseTuple -load.matchTuple = matchTuple -load.compareTuples = compareTuples - - -/***/ }), -/* 140 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(59)(__webpack_require__(141)) - - -/***/ }), -/* 141 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const keccakState = __webpack_require__(169) - -function Keccak () { - // much faster than `new Array(50)` - this.state = [ - 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0 - ] - - this.blockSize = null - this.count = 0 - this.squeezing = false -} - -Keccak.prototype.initialize = function (rate, capacity) { - for (let i = 0; i < 50; ++i) this.state[i] = 0 - this.blockSize = rate / 8 - this.count = 0 - this.squeezing = false -} - -Keccak.prototype.absorb = function (data) { - for (let i = 0; i < data.length; ++i) { - this.state[~~(this.count / 4)] ^= data[i] << (8 * (this.count % 4)) - this.count += 1 - if (this.count === this.blockSize) { - keccakState.p1600(this.state) - this.count = 0 - } - } -} - -Keccak.prototype.absorbLastFewBits = function (bits) { - this.state[~~(this.count / 4)] ^= bits << (8 * (this.count % 4)) - if ((bits & 0x80) !== 0 && this.count === (this.blockSize - 1)) keccakState.p1600(this.state) - this.state[~~((this.blockSize - 1) / 4)] ^= 0x80 << (8 * ((this.blockSize - 1) % 4)) - keccakState.p1600(this.state) - this.count = 0 - this.squeezing = true -} - -Keccak.prototype.squeeze = function (length) { - if (!this.squeezing) this.absorbLastFewBits(0x01) - - const output = Buffer.alloc(length) - for (let i = 0; i < length; ++i) { - output[i] = (this.state[~~(this.count / 4)] >>> (8 * (this.count % 4))) & 0xff - this.count += 1 - if (this.count === this.blockSize) { - keccakState.p1600(this.state) - this.count = 0 - } - } - - return output -} - -Keccak.prototype.copy = function (dest) { - for (let i = 0; i < 50; ++i) dest.state[i] = this.state[i] - dest.blockSize = this.blockSize - dest.count = this.count - dest.squeezing = this.squeezing -} - -module.exports = Keccak - - -/***/ }), -/* 142 */ -/***/ ((module) => { - -"use strict"; - -module.exports = str => encodeURIComponent(str).replace(/[!'()*]/g, x => `%${x.charCodeAt(0).toString(16).toUpperCase()}`); - - -/***/ }), -/* 143 */ -/***/ ((module) => { - -"use strict"; - -var token = '%[a-f0-9]{2}'; -var singleMatcher = new RegExp('(' + token + ')|([^%]+?)', 'gi'); -var multiMatcher = new RegExp('(' + token + ')+', 'gi'); - -function decodeComponents(components, split) { - try { - // Try to decode the entire string first - return [decodeURIComponent(components.join(''))]; - } catch (err) { - // Do nothing - } - - if (components.length === 1) { - return components; - } - - split = split || 1; - - // Split the array in 2 parts - var left = components.slice(0, split); - var right = components.slice(split); - - return Array.prototype.concat.call([], decodeComponents(left), decodeComponents(right)); -} - -function decode(input) { - try { - return decodeURIComponent(input); - } catch (err) { - var tokens = input.match(singleMatcher) || []; - - for (var i = 1; i < tokens.length; i++) { - input = decodeComponents(tokens, i).join(''); - - tokens = input.match(singleMatcher) || []; - } - - return input; - } -} - -function customDecodeURIComponent(input) { - // Keep track of all the replacements and prefill the map with the `BOM` - var replaceMap = { - '%FE%FF': '\uFFFD\uFFFD', - '%FF%FE': '\uFFFD\uFFFD' - }; - - var match = multiMatcher.exec(input); - while (match) { - try { - // Decode as big chunks as possible - replaceMap[match[0]] = decodeURIComponent(match[0]); - } catch (err) { - var result = decode(match[0]); - - if (result !== match[0]) { - replaceMap[match[0]] = result; - } - } - - match = multiMatcher.exec(input); - } - - // Add `%C2` at the end of the map to make sure it does not replace the combinator before everything else - replaceMap['%C2'] = '\uFFFD'; - - var entries = Object.keys(replaceMap); - - for (var i = 0; i < entries.length; i++) { - // Replace all decoded components - var key = entries[i]; - input = input.replace(new RegExp(key, 'g'), replaceMap[key]); - } - - return input; -} - -module.exports = function (encodedURI) { - if (typeof encodedURI !== 'string') { - throw new TypeError('Expected `encodedURI` to be of type `string`, got `' + typeof encodedURI + '`'); - } - - try { - encodedURI = encodedURI.replace(/\+/g, ' '); - - // Try the built in decoder first - return decodeURIComponent(encodedURI); - } catch (err) { - // Fallback to a more advanced decoder - return customDecodeURIComponent(encodedURI); - } -}; - - -/***/ }), -/* 144 */ -/***/ ((module) => { - -"use strict"; - - -module.exports = (string, separator) => { - if (!(typeof string === 'string' && typeof separator === 'string')) { - throw new TypeError('Expected the arguments to be of type `string`'); - } - - if (separator === '') { - return [string]; - } - - const separatorIndex = string.indexOf(separator); - - if (separatorIndex === -1) { - return [string]; - } - - return [ - string.slice(0, separatorIndex), - string.slice(separatorIndex + separator.length) - ]; -}; - - -/***/ }), -/* 145 */ -/***/ ((module) => { - -"use strict"; - -module.exports = function (obj, predicate) { - var ret = {}; - var keys = Object.keys(obj); - var isArr = Array.isArray(predicate); - - for (var i = 0; i < keys.length; i++) { - var key = keys[i]; - var val = obj[key]; - - if (isArr ? predicate.indexOf(key) !== -1 : predicate(key, val, obj)) { - ret[key] = val; - } - } - - return ret; -}; - - -/***/ }), -/* 146 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// light library entry point. - - -module.exports = __webpack_require__(77); - -/***/ }), -/* 147 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -// browserify by default only pulls in files that are hard coded in requires -// In order of last to first in this file, the default wordlist will be chosen -// based on what is present. (Bundles may remove wordlists they don't need) -const wordlists = {}; -exports.wordlists = wordlists; -let _default; -exports._default = _default; -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/czech.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.czech = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/chinese_simplified.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.chinese_simplified = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/chinese_traditional.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.chinese_traditional = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/korean.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.korean = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/french.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.french = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/italian.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.italian = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/spanish.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.spanish = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/japanese.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.japanese = _default; - wordlists.JA = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(Object(function webpackMissingModule() { var e = new Error("Cannot find module './wordlists/portuguese.json'"); e.code = 'MODULE_NOT_FOUND'; throw e; }())); - wordlists.portuguese = _default; -} -catch (err) { } -try { - exports._default = _default = __webpack_require__(159); - wordlists.english = _default; - wordlists.EN = _default; -} -catch (err) { } - - -/***/ }), -/* 148 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -/**/ - -var Buffer = (__webpack_require__(6).Buffer); -/**/ - -var isEncoding = Buffer.isEncoding || function (encoding) { - encoding = '' + encoding; - switch (encoding && encoding.toLowerCase()) { - case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw': - return true; - default: - return false; - } -}; - -function _normalizeEncoding(enc) { - if (!enc) return 'utf8'; - var retried; - while (true) { - switch (enc) { - case 'utf8': - case 'utf-8': - return 'utf8'; - case 'ucs2': - case 'ucs-2': - case 'utf16le': - case 'utf-16le': - return 'utf16le'; - case 'latin1': - case 'binary': - return 'latin1'; - case 'base64': - case 'ascii': - case 'hex': - return enc; - default: - if (retried) return; // undefined - enc = ('' + enc).toLowerCase(); - retried = true; - } - } -}; - -// Do not cache `Buffer.isEncoding` when checking encoding names as some -// modules monkey-patch it to support additional encodings -function normalizeEncoding(enc) { - var nenc = _normalizeEncoding(enc); - if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc); - return nenc || enc; -} - -// StringDecoder provides an interface for efficiently splitting a series of -// buffers into a series of JS strings without breaking apart multi-byte -// characters. -exports.s = StringDecoder; -function StringDecoder(encoding) { - this.encoding = normalizeEncoding(encoding); - var nb; - switch (this.encoding) { - case 'utf16le': - this.text = utf16Text; - this.end = utf16End; - nb = 4; - break; - case 'utf8': - this.fillLast = utf8FillLast; - nb = 4; - break; - case 'base64': - this.text = base64Text; - this.end = base64End; - nb = 3; - break; - default: - this.write = simpleWrite; - this.end = simpleEnd; - return; - } - this.lastNeed = 0; - this.lastTotal = 0; - this.lastChar = Buffer.allocUnsafe(nb); -} - -StringDecoder.prototype.write = function (buf) { - if (buf.length === 0) return ''; - var r; - var i; - if (this.lastNeed) { - r = this.fillLast(buf); - if (r === undefined) return ''; - i = this.lastNeed; - this.lastNeed = 0; - } else { - i = 0; - } - if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i); - return r || ''; -}; - -StringDecoder.prototype.end = utf8End; - -// Returns only complete characters in a Buffer -StringDecoder.prototype.text = utf8Text; - -// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer -StringDecoder.prototype.fillLast = function (buf) { - if (this.lastNeed <= buf.length) { - buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed); - return this.lastChar.toString(this.encoding, 0, this.lastTotal); - } - buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length); - this.lastNeed -= buf.length; -}; - -// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a -// continuation byte. If an invalid byte is detected, -2 is returned. -function utf8CheckByte(byte) { - if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4; - return byte >> 6 === 0x02 ? -1 : -2; -} - -// Checks at most 3 bytes at the end of a Buffer in order to detect an -// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4) -// needed to complete the UTF-8 character (if applicable) are returned. -function utf8CheckIncomplete(self, buf, i) { - var j = buf.length - 1; - if (j < i) return 0; - var nb = utf8CheckByte(buf[j]); - if (nb >= 0) { - if (nb > 0) self.lastNeed = nb - 1; - return nb; - } - if (--j < i || nb === -2) return 0; - nb = utf8CheckByte(buf[j]); - if (nb >= 0) { - if (nb > 0) self.lastNeed = nb - 2; - return nb; - } - if (--j < i || nb === -2) return 0; - nb = utf8CheckByte(buf[j]); - if (nb >= 0) { - if (nb > 0) { - if (nb === 2) nb = 0;else self.lastNeed = nb - 3; - } - return nb; - } - return 0; -} - -// Validates as many continuation bytes for a multi-byte UTF-8 character as -// needed or are available. If we see a non-continuation byte where we expect -// one, we "replace" the validated continuation bytes we've seen so far with -// a single UTF-8 replacement character ('\ufffd'), to match v8's UTF-8 decoding -// behavior. The continuation byte check is included three times in the case -// where all of the continuation bytes for a character exist in the same buffer. -// It is also done this way as a slight performance increase instead of using a -// loop. -function utf8CheckExtraBytes(self, buf, p) { - if ((buf[0] & 0xC0) !== 0x80) { - self.lastNeed = 0; - return '\ufffd'; - } - if (self.lastNeed > 1 && buf.length > 1) { - if ((buf[1] & 0xC0) !== 0x80) { - self.lastNeed = 1; - return '\ufffd'; - } - if (self.lastNeed > 2 && buf.length > 2) { - if ((buf[2] & 0xC0) !== 0x80) { - self.lastNeed = 2; - return '\ufffd'; - } - } - } -} - -// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer. -function utf8FillLast(buf) { - var p = this.lastTotal - this.lastNeed; - var r = utf8CheckExtraBytes(this, buf, p); - if (r !== undefined) return r; - if (this.lastNeed <= buf.length) { - buf.copy(this.lastChar, p, 0, this.lastNeed); - return this.lastChar.toString(this.encoding, 0, this.lastTotal); - } - buf.copy(this.lastChar, p, 0, buf.length); - this.lastNeed -= buf.length; -} - -// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a -// partial character, the character's bytes are buffered until the required -// number of bytes are available. -function utf8Text(buf, i) { - var total = utf8CheckIncomplete(this, buf, i); - if (!this.lastNeed) return buf.toString('utf8', i); - this.lastTotal = total; - var end = buf.length - (total - this.lastNeed); - buf.copy(this.lastChar, 0, end); - return buf.toString('utf8', i, end); -} - -// For UTF-8, a replacement character is added when ending on a partial -// character. -function utf8End(buf) { - var r = buf && buf.length ? this.write(buf) : ''; - if (this.lastNeed) return r + '\ufffd'; - return r; -} - -// UTF-16LE typically needs two bytes per character, but even if we have an even -// number of bytes available, we need to check if we end on a leading/high -// surrogate. In that case, we need to wait for the next two bytes in order to -// decode the last character properly. -function utf16Text(buf, i) { - if ((buf.length - i) % 2 === 0) { - var r = buf.toString('utf16le', i); - if (r) { - var c = r.charCodeAt(r.length - 1); - if (c >= 0xD800 && c <= 0xDBFF) { - this.lastNeed = 2; - this.lastTotal = 4; - this.lastChar[0] = buf[buf.length - 2]; - this.lastChar[1] = buf[buf.length - 1]; - return r.slice(0, -1); - } - } - return r; - } - this.lastNeed = 1; - this.lastTotal = 2; - this.lastChar[0] = buf[buf.length - 1]; - return buf.toString('utf16le', i, buf.length - 1); -} - -// For UTF-16LE we do not explicitly append special replacement characters if we -// end on a partial character, we simply let v8 handle that. -function utf16End(buf) { - var r = buf && buf.length ? this.write(buf) : ''; - if (this.lastNeed) { - var end = this.lastTotal - this.lastNeed; - return r + this.lastChar.toString('utf16le', 0, end); - } - return r; -} - -function base64Text(buf, i) { - var n = (buf.length - i) % 3; - if (n === 0) return buf.toString('base64', i); - this.lastNeed = 3 - n; - this.lastTotal = 3; - if (n === 1) { - this.lastChar[0] = buf[buf.length - 1]; - } else { - this.lastChar[0] = buf[buf.length - 2]; - this.lastChar[1] = buf[buf.length - 1]; - } - return buf.toString('base64', i, buf.length - n); -} - -function base64End(buf) { - var r = buf && buf.length ? this.write(buf) : ''; - if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed); - return r; -} - -// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex) -function simpleWrite(buf) { - return buf.toString(this.encoding); -} - -function simpleEnd(buf) { - return buf && buf.length ? this.write(buf) : ''; -} - -/***/ }), -/* 149 */, -/* 150 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// full library entry point. - - -module.exports = __webpack_require__(151); - - -/***/ }), -/* 151 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var protobuf = module.exports = __webpack_require__(77); - -protobuf.build = "full"; - -// Parser -protobuf.tokenize = __webpack_require__(47); -protobuf.parse = __webpack_require__(93); -protobuf.common = __webpack_require__(94); - -// Configure parser -protobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common); - - -/***/ }), -/* 152 */ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"nested":{"google":{"nested":{"protobuf":{"nested":{"FileDescriptorSet":{"fields":{"file":{"rule":"repeated","type":"FileDescriptorProto","id":1}}},"FileDescriptorProto":{"fields":{"name":{"type":"string","id":1},"package":{"type":"string","id":2},"dependency":{"rule":"repeated","type":"string","id":3},"publicDependency":{"rule":"repeated","type":"int32","id":10,"options":{"packed":false}},"weakDependency":{"rule":"repeated","type":"int32","id":11,"options":{"packed":false}},"messageType":{"rule":"repeated","type":"DescriptorProto","id":4},"enumType":{"rule":"repeated","type":"EnumDescriptorProto","id":5},"service":{"rule":"repeated","type":"ServiceDescriptorProto","id":6},"extension":{"rule":"repeated","type":"FieldDescriptorProto","id":7},"options":{"type":"FileOptions","id":8},"sourceCodeInfo":{"type":"SourceCodeInfo","id":9},"syntax":{"type":"string","id":12}}},"DescriptorProto":{"fields":{"name":{"type":"string","id":1},"field":{"rule":"repeated","type":"FieldDescriptorProto","id":2},"extension":{"rule":"repeated","type":"FieldDescriptorProto","id":6},"nestedType":{"rule":"repeated","type":"DescriptorProto","id":3},"enumType":{"rule":"repeated","type":"EnumDescriptorProto","id":4},"extensionRange":{"rule":"repeated","type":"ExtensionRange","id":5},"oneofDecl":{"rule":"repeated","type":"OneofDescriptorProto","id":8},"options":{"type":"MessageOptions","id":7},"reservedRange":{"rule":"repeated","type":"ReservedRange","id":9},"reservedName":{"rule":"repeated","type":"string","id":10}},"nested":{"ExtensionRange":{"fields":{"start":{"type":"int32","id":1},"end":{"type":"int32","id":2}}},"ReservedRange":{"fields":{"start":{"type":"int32","id":1},"end":{"type":"int32","id":2}}}}},"FieldDescriptorProto":{"fields":{"name":{"type":"string","id":1},"number":{"type":"int32","id":3},"label":{"type":"Label","id":4},"type":{"type":"Type","id":5},"typeName":{"type":"string","id":6},"extendee":{"type":"string","id":2},"defaultValue":{"type":"string","id":7},"oneofIndex":{"type":"int32","id":9},"jsonName":{"type":"string","id":10},"options":{"type":"FieldOptions","id":8}},"nested":{"Type":{"values":{"TYPE_DOUBLE":1,"TYPE_FLOAT":2,"TYPE_INT64":3,"TYPE_UINT64":4,"TYPE_INT32":5,"TYPE_FIXED64":6,"TYPE_FIXED32":7,"TYPE_BOOL":8,"TYPE_STRING":9,"TYPE_GROUP":10,"TYPE_MESSAGE":11,"TYPE_BYTES":12,"TYPE_UINT32":13,"TYPE_ENUM":14,"TYPE_SFIXED32":15,"TYPE_SFIXED64":16,"TYPE_SINT32":17,"TYPE_SINT64":18}},"Label":{"values":{"LABEL_OPTIONAL":1,"LABEL_REQUIRED":2,"LABEL_REPEATED":3}}}},"OneofDescriptorProto":{"fields":{"name":{"type":"string","id":1},"options":{"type":"OneofOptions","id":2}}},"EnumDescriptorProto":{"fields":{"name":{"type":"string","id":1},"value":{"rule":"repeated","type":"EnumValueDescriptorProto","id":2},"options":{"type":"EnumOptions","id":3}}},"EnumValueDescriptorProto":{"fields":{"name":{"type":"string","id":1},"number":{"type":"int32","id":2},"options":{"type":"EnumValueOptions","id":3}}},"ServiceDescriptorProto":{"fields":{"name":{"type":"string","id":1},"method":{"rule":"repeated","type":"MethodDescriptorProto","id":2},"options":{"type":"ServiceOptions","id":3}}},"MethodDescriptorProto":{"fields":{"name":{"type":"string","id":1},"inputType":{"type":"string","id":2},"outputType":{"type":"string","id":3},"options":{"type":"MethodOptions","id":4},"clientStreaming":{"type":"bool","id":5},"serverStreaming":{"type":"bool","id":6}}},"FileOptions":{"fields":{"javaPackage":{"type":"string","id":1},"javaOuterClassname":{"type":"string","id":8},"javaMultipleFiles":{"type":"bool","id":10},"javaGenerateEqualsAndHash":{"type":"bool","id":20,"options":{"deprecated":true}},"javaStringCheckUtf8":{"type":"bool","id":27},"optimizeFor":{"type":"OptimizeMode","id":9,"options":{"default":"SPEED"}},"goPackage":{"type":"string","id":11},"ccGenericServices":{"type":"bool","id":16},"javaGenericServices":{"type":"bool","id":17},"pyGenericServices":{"type":"bool","id":18},"deprecated":{"type":"bool","id":23},"ccEnableArenas":{"type":"bool","id":31},"objcClassPrefix":{"type":"string","id":36},"csharpNamespace":{"type":"string","id":37},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]],"reserved":[[38,38]],"nested":{"OptimizeMode":{"values":{"SPEED":1,"CODE_SIZE":2,"LITE_RUNTIME":3}}}},"MessageOptions":{"fields":{"messageSetWireFormat":{"type":"bool","id":1},"noStandardDescriptorAccessor":{"type":"bool","id":2},"deprecated":{"type":"bool","id":3},"mapEntry":{"type":"bool","id":7},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]],"reserved":[[8,8]]},"FieldOptions":{"fields":{"ctype":{"type":"CType","id":1,"options":{"default":"STRING"}},"packed":{"type":"bool","id":2},"jstype":{"type":"JSType","id":6,"options":{"default":"JS_NORMAL"}},"lazy":{"type":"bool","id":5},"deprecated":{"type":"bool","id":3},"weak":{"type":"bool","id":10},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]],"reserved":[[4,4]],"nested":{"CType":{"values":{"STRING":0,"CORD":1,"STRING_PIECE":2}},"JSType":{"values":{"JS_NORMAL":0,"JS_STRING":1,"JS_NUMBER":2}}}},"OneofOptions":{"fields":{"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"EnumOptions":{"fields":{"allowAlias":{"type":"bool","id":2},"deprecated":{"type":"bool","id":3},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"EnumValueOptions":{"fields":{"deprecated":{"type":"bool","id":1},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"ServiceOptions":{"fields":{"deprecated":{"type":"bool","id":33},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"MethodOptions":{"fields":{"deprecated":{"type":"bool","id":33},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"UninterpretedOption":{"fields":{"name":{"rule":"repeated","type":"NamePart","id":2},"identifierValue":{"type":"string","id":3},"positiveIntValue":{"type":"uint64","id":4},"negativeIntValue":{"type":"int64","id":5},"doubleValue":{"type":"double","id":6},"stringValue":{"type":"bytes","id":7},"aggregateValue":{"type":"string","id":8}},"nested":{"NamePart":{"fields":{"namePart":{"rule":"required","type":"string","id":1},"isExtension":{"rule":"required","type":"bool","id":2}}}}},"SourceCodeInfo":{"fields":{"location":{"rule":"repeated","type":"Location","id":1}},"nested":{"Location":{"fields":{"path":{"rule":"repeated","type":"int32","id":1},"span":{"rule":"repeated","type":"int32","id":2},"leadingComments":{"type":"string","id":3},"trailingComments":{"type":"string","id":4},"leadingDetachedComments":{"rule":"repeated","type":"string","id":6}}}}},"GeneratedCodeInfo":{"fields":{"annotation":{"rule":"repeated","type":"Annotation","id":1}},"nested":{"Annotation":{"fields":{"path":{"rule":"repeated","type":"int32","id":1},"sourceFile":{"type":"string","id":2},"begin":{"type":"int32","id":3},"end":{"type":"int32","id":4}}}}}}}}}}}'); - -/***/ }), -/* 153 */ -/***/ ((module) => { - -"use strict"; -module.exports = {"i8":"6.5.4"}; - -/***/ }), -/* 154 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -exports.sha1 = __webpack_require__(98); -exports.sha224 = __webpack_require__(100); -exports.sha256 = __webpack_require__(52); -exports.sha384 = __webpack_require__(101); -exports.sha512 = __webpack_require__(53); - - -/***/ }), -/* 155 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(8); -var common = __webpack_require__(20); - -var rotl32 = utils.rotl32; -var sum32 = utils.sum32; -var sum32_3 = utils.sum32_3; -var sum32_4 = utils.sum32_4; -var BlockHash = common.BlockHash; - -function RIPEMD160() { - if (!(this instanceof RIPEMD160)) - return new RIPEMD160(); - - BlockHash.call(this); - - this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ]; - this.endian = 'little'; -} -utils.inherits(RIPEMD160, BlockHash); -exports.ripemd160 = RIPEMD160; - -RIPEMD160.blockSize = 512; -RIPEMD160.outSize = 160; -RIPEMD160.hmacStrength = 192; -RIPEMD160.padLength = 64; - -RIPEMD160.prototype._update = function update(msg, start) { - var A = this.h[0]; - var B = this.h[1]; - var C = this.h[2]; - var D = this.h[3]; - var E = this.h[4]; - var Ah = A; - var Bh = B; - var Ch = C; - var Dh = D; - var Eh = E; - for (var j = 0; j < 80; j++) { - var T = sum32( - rotl32( - sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), - s[j]), - E); - A = E; - E = D; - D = rotl32(C, 10); - C = B; - B = T; - T = sum32( - rotl32( - sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), - sh[j]), - Eh); - Ah = Eh; - Eh = Dh; - Dh = rotl32(Ch, 10); - Ch = Bh; - Bh = T; - } - T = sum32_3(this.h[1], C, Dh); - this.h[1] = sum32_3(this.h[2], D, Eh); - this.h[2] = sum32_3(this.h[3], E, Ah); - this.h[3] = sum32_3(this.h[4], A, Bh); - this.h[4] = sum32_3(this.h[0], B, Ch); - this.h[0] = T; -}; - -RIPEMD160.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'little'); - else - return utils.split32(this.h, 'little'); -}; - -function f(j, x, y, z) { - if (j <= 15) - return x ^ y ^ z; - else if (j <= 31) - return (x & y) | ((~x) & z); - else if (j <= 47) - return (x | (~y)) ^ z; - else if (j <= 63) - return (x & z) | (y & (~z)); - else - return x ^ (y | (~z)); -} - -function K(j) { - if (j <= 15) - return 0x00000000; - else if (j <= 31) - return 0x5a827999; - else if (j <= 47) - return 0x6ed9eba1; - else if (j <= 63) - return 0x8f1bbcdc; - else - return 0xa953fd4e; -} - -function Kh(j) { - if (j <= 15) - return 0x50a28be6; - else if (j <= 31) - return 0x5c4dd124; - else if (j <= 47) - return 0x6d703ef3; - else if (j <= 63) - return 0x7a6d76e9; - else - return 0x00000000; -} - -var r = [ - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, - 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, - 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, - 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, - 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13 -]; - -var rh = [ - 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, - 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, - 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, - 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, - 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11 -]; - -var s = [ - 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, - 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, - 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, - 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, - 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 -]; - -var sh = [ - 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, - 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, - 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, - 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, - 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 -]; - - -/***/ }), -/* 156 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const createHash = __webpack_require__(54); -const pbkdf2_1 = __webpack_require__(157); -const randomBytes = __webpack_require__(112); -const _wordlists_1 = __webpack_require__(147); -let DEFAULT_WORDLIST = _wordlists_1._default; -const INVALID_MNEMONIC = 'Invalid mnemonic'; -const INVALID_ENTROPY = 'Invalid entropy'; -const INVALID_CHECKSUM = 'Invalid mnemonic checksum'; -const WORDLIST_REQUIRED = 'A wordlist is required but a default could not be found.\n' + - 'Please pass a 2048 word array explicitly.'; -function pbkdf2Promise(password, saltMixin, iterations, keylen, digest) { - return Promise.resolve().then(() => new Promise((resolve, reject) => { - const callback = (err, derivedKey) => { - if (err) { - return reject(err); - } - else { - return resolve(derivedKey); - } - }; - pbkdf2_1.pbkdf2(password, saltMixin, iterations, keylen, digest, callback); - })); -} -function normalize(str) { - return (str || '').normalize('NFKD'); -} -function lpad(str, padString, length) { - while (str.length < length) { - str = padString + str; - } - return str; -} -function binaryToByte(bin) { - return parseInt(bin, 2); -} -function bytesToBinary(bytes) { - return bytes.map((x) => lpad(x.toString(2), '0', 8)).join(''); -} -function deriveChecksumBits(entropyBuffer) { - const ENT = entropyBuffer.length * 8; - const CS = ENT / 32; - const hash = createHash('sha256') - .update(entropyBuffer) - .digest(); - return bytesToBinary(Array.from(hash)).slice(0, CS); -} -function salt(password) { - return 'mnemonic' + (password || ''); -} -function mnemonicToSeedSync(mnemonic, password) { - const mnemonicBuffer = Buffer.from(normalize(mnemonic), 'utf8'); - const saltBuffer = Buffer.from(salt(normalize(password)), 'utf8'); - return pbkdf2_1.pbkdf2Sync(mnemonicBuffer, saltBuffer, 2048, 64, 'sha512'); -} -exports.mnemonicToSeedSync = mnemonicToSeedSync; -function mnemonicToSeed(mnemonic, password) { - return Promise.resolve().then(() => { - const mnemonicBuffer = Buffer.from(normalize(mnemonic), 'utf8'); - const saltBuffer = Buffer.from(salt(normalize(password)), 'utf8'); - return pbkdf2Promise(mnemonicBuffer, saltBuffer, 2048, 64, 'sha512'); - }); -} -exports.mnemonicToSeed = mnemonicToSeed; -function mnemonicToEntropy(mnemonic, wordlist) { - wordlist = wordlist || DEFAULT_WORDLIST; - if (!wordlist) { - throw new Error(WORDLIST_REQUIRED); - } - const words = normalize(mnemonic).split(' '); - if (words.length % 3 !== 0) { - throw new Error(INVALID_MNEMONIC); - } - // convert word indices to 11 bit binary strings - const bits = words - .map((word) => { - const index = wordlist.indexOf(word); - if (index === -1) { - throw new Error(INVALID_MNEMONIC); - } - return lpad(index.toString(2), '0', 11); - }) - .join(''); - // split the binary string into ENT/CS - const dividerIndex = Math.floor(bits.length / 33) * 32; - const entropyBits = bits.slice(0, dividerIndex); - const checksumBits = bits.slice(dividerIndex); - // calculate the checksum and compare - const entropyBytes = entropyBits.match(/(.{1,8})/g).map(binaryToByte); - if (entropyBytes.length < 16) { - throw new Error(INVALID_ENTROPY); - } - if (entropyBytes.length > 32) { - throw new Error(INVALID_ENTROPY); - } - if (entropyBytes.length % 4 !== 0) { - throw new Error(INVALID_ENTROPY); - } - const entropy = Buffer.from(entropyBytes); - const newChecksum = deriveChecksumBits(entropy); - if (newChecksum !== checksumBits) { - throw new Error(INVALID_CHECKSUM); - } - return entropy.toString('hex'); -} -exports.mnemonicToEntropy = mnemonicToEntropy; -function entropyToMnemonic(entropy, wordlist) { - if (!Buffer.isBuffer(entropy)) { - entropy = Buffer.from(entropy, 'hex'); - } - wordlist = wordlist || DEFAULT_WORDLIST; - if (!wordlist) { - throw new Error(WORDLIST_REQUIRED); - } - // 128 <= ENT <= 256 - if (entropy.length < 16) { - throw new TypeError(INVALID_ENTROPY); - } - if (entropy.length > 32) { - throw new TypeError(INVALID_ENTROPY); - } - if (entropy.length % 4 !== 0) { - throw new TypeError(INVALID_ENTROPY); - } - const entropyBits = bytesToBinary(Array.from(entropy)); - const checksumBits = deriveChecksumBits(entropy); - const bits = entropyBits + checksumBits; - const chunks = bits.match(/(.{1,11})/g); - const words = chunks.map((binary) => { - const index = binaryToByte(binary); - return wordlist[index]; - }); - return wordlist[0] === '\u3042\u3044\u3053\u304f\u3057\u3093' // Japanese wordlist - ? words.join('\u3000') - : words.join(' '); -} -exports.entropyToMnemonic = entropyToMnemonic; -function generateMnemonic(strength, rng, wordlist) { - strength = strength || 128; - if (strength % 32 !== 0) { - throw new TypeError(INVALID_ENTROPY); - } - rng = rng || randomBytes; - return entropyToMnemonic(rng(strength / 8), wordlist); -} -exports.generateMnemonic = generateMnemonic; -function validateMnemonic(mnemonic, wordlist) { - try { - mnemonicToEntropy(mnemonic, wordlist); - } - catch (e) { - return false; - } - return true; -} -exports.validateMnemonic = validateMnemonic; -function setDefaultWordlist(language) { - const result = _wordlists_1.wordlists[language]; - if (result) { - DEFAULT_WORDLIST = result; - } - else { - throw new Error('Could not find wordlist for language "' + language + '"'); - } -} -exports.setDefaultWordlist = setDefaultWordlist; -function getDefaultWordlist() { - if (!DEFAULT_WORDLIST) { - throw new Error('No Default Wordlist set'); - } - return Object.keys(_wordlists_1.wordlists).filter((lang) => { - if (lang === 'JA' || lang === 'EN') { - return false; - } - return _wordlists_1.wordlists[lang].every((word, index) => word === DEFAULT_WORDLIST[index]); - })[0]; -} -exports.getDefaultWordlist = getDefaultWordlist; -var _wordlists_2 = __webpack_require__(147); -exports.wordlists = _wordlists_2.wordlists; - - -/***/ }), -/* 157 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var native = __webpack_require__(4) - -var checkParameters = __webpack_require__(32) -var defaultEncoding = __webpack_require__(33) -var toBuffer = __webpack_require__(34) - -function nativePBKDF2 (password, salt, iterations, keylen, digest, callback) { - checkParameters(iterations, keylen) - password = toBuffer(password, defaultEncoding, 'Password') - salt = toBuffer(salt, defaultEncoding, 'Salt') - - if (typeof digest === 'function') { - callback = digest - digest = 'sha1' - } - if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2') - - return native.pbkdf2(password, salt, iterations, keylen, digest, callback) -} - -function nativePBKDF2Sync (password, salt, iterations, keylen, digest) { - checkParameters(iterations, keylen) - password = toBuffer(password, defaultEncoding, 'Password') - salt = toBuffer(salt, defaultEncoding, 'Salt') - digest = digest || 'sha1' - return native.pbkdf2Sync(password, salt, iterations, keylen, digest) -} - -/* istanbul ignore next */ -if (!native.pbkdf2Sync || native.pbkdf2Sync.toString().indexOf('keylen, digest') === -1) { - exports.pbkdf2Sync = __webpack_require__(55) - exports.pbkdf2 = __webpack_require__(111) - -// native -} else { - exports.pbkdf2Sync = nativePBKDF2Sync - exports.pbkdf2 = nativePBKDF2 -} - - -/***/ }), -/* 158 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(4).createHmac - - -/***/ }), -/* 159 */ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('["abandon","ability","able","about","above","absent","absorb","abstract","absurd","abuse","access","accident","account","accuse","achieve","acid","acoustic","acquire","across","act","action","actor","actress","actual","adapt","add","addict","address","adjust","admit","adult","advance","advice","aerobic","affair","afford","afraid","again","age","agent","agree","ahead","aim","air","airport","aisle","alarm","album","alcohol","alert","alien","all","alley","allow","almost","alone","alpha","already","also","alter","always","amateur","amazing","among","amount","amused","analyst","anchor","ancient","anger","angle","angry","animal","ankle","announce","annual","another","answer","antenna","antique","anxiety","any","apart","apology","appear","apple","approve","april","arch","arctic","area","arena","argue","arm","armed","armor","army","around","arrange","arrest","arrive","arrow","art","artefact","artist","artwork","ask","aspect","assault","asset","assist","assume","asthma","athlete","atom","attack","attend","attitude","attract","auction","audit","august","aunt","author","auto","autumn","average","avocado","avoid","awake","aware","away","awesome","awful","awkward","axis","baby","bachelor","bacon","badge","bag","balance","balcony","ball","bamboo","banana","banner","bar","barely","bargain","barrel","base","basic","basket","battle","beach","bean","beauty","because","become","beef","before","begin","behave","behind","believe","below","belt","bench","benefit","best","betray","better","between","beyond","bicycle","bid","bike","bind","biology","bird","birth","bitter","black","blade","blame","blanket","blast","bleak","bless","blind","blood","blossom","blouse","blue","blur","blush","board","boat","body","boil","bomb","bone","bonus","book","boost","border","boring","borrow","boss","bottom","bounce","box","boy","bracket","brain","brand","brass","brave","bread","breeze","brick","bridge","brief","bright","bring","brisk","broccoli","broken","bronze","broom","brother","brown","brush","bubble","buddy","budget","buffalo","build","bulb","bulk","bullet","bundle","bunker","burden","burger","burst","bus","business","busy","butter","buyer","buzz","cabbage","cabin","cable","cactus","cage","cake","call","calm","camera","camp","can","canal","cancel","candy","cannon","canoe","canvas","canyon","capable","capital","captain","car","carbon","card","cargo","carpet","carry","cart","case","cash","casino","castle","casual","cat","catalog","catch","category","cattle","caught","cause","caution","cave","ceiling","celery","cement","census","century","cereal","certain","chair","chalk","champion","change","chaos","chapter","charge","chase","chat","cheap","check","cheese","chef","cherry","chest","chicken","chief","child","chimney","choice","choose","chronic","chuckle","chunk","churn","cigar","cinnamon","circle","citizen","city","civil","claim","clap","clarify","claw","clay","clean","clerk","clever","click","client","cliff","climb","clinic","clip","clock","clog","close","cloth","cloud","clown","club","clump","cluster","clutch","coach","coast","coconut","code","coffee","coil","coin","collect","color","column","combine","come","comfort","comic","common","company","concert","conduct","confirm","congress","connect","consider","control","convince","cook","cool","copper","copy","coral","core","corn","correct","cost","cotton","couch","country","couple","course","cousin","cover","coyote","crack","cradle","craft","cram","crane","crash","crater","crawl","crazy","cream","credit","creek","crew","cricket","crime","crisp","critic","crop","cross","crouch","crowd","crucial","cruel","cruise","crumble","crunch","crush","cry","crystal","cube","culture","cup","cupboard","curious","current","curtain","curve","cushion","custom","cute","cycle","dad","damage","damp","dance","danger","daring","dash","daughter","dawn","day","deal","debate","debris","decade","december","decide","decline","decorate","decrease","deer","defense","define","defy","degree","delay","deliver","demand","demise","denial","dentist","deny","depart","depend","deposit","depth","deputy","derive","describe","desert","design","desk","despair","destroy","detail","detect","develop","device","devote","diagram","dial","diamond","diary","dice","diesel","diet","differ","digital","dignity","dilemma","dinner","dinosaur","direct","dirt","disagree","discover","disease","dish","dismiss","disorder","display","distance","divert","divide","divorce","dizzy","doctor","document","dog","doll","dolphin","domain","donate","donkey","donor","door","dose","double","dove","draft","dragon","drama","drastic","draw","dream","dress","drift","drill","drink","drip","drive","drop","drum","dry","duck","dumb","dune","during","dust","dutch","duty","dwarf","dynamic","eager","eagle","early","earn","earth","easily","east","easy","echo","ecology","economy","edge","edit","educate","effort","egg","eight","either","elbow","elder","electric","elegant","element","elephant","elevator","elite","else","embark","embody","embrace","emerge","emotion","employ","empower","empty","enable","enact","end","endless","endorse","enemy","energy","enforce","engage","engine","enhance","enjoy","enlist","enough","enrich","enroll","ensure","enter","entire","entry","envelope","episode","equal","equip","era","erase","erode","erosion","error","erupt","escape","essay","essence","estate","eternal","ethics","evidence","evil","evoke","evolve","exact","example","excess","exchange","excite","exclude","excuse","execute","exercise","exhaust","exhibit","exile","exist","exit","exotic","expand","expect","expire","explain","expose","express","extend","extra","eye","eyebrow","fabric","face","faculty","fade","faint","faith","fall","false","fame","family","famous","fan","fancy","fantasy","farm","fashion","fat","fatal","father","fatigue","fault","favorite","feature","february","federal","fee","feed","feel","female","fence","festival","fetch","fever","few","fiber","fiction","field","figure","file","film","filter","final","find","fine","finger","finish","fire","firm","first","fiscal","fish","fit","fitness","fix","flag","flame","flash","flat","flavor","flee","flight","flip","float","flock","floor","flower","fluid","flush","fly","foam","focus","fog","foil","fold","follow","food","foot","force","forest","forget","fork","fortune","forum","forward","fossil","foster","found","fox","fragile","frame","frequent","fresh","friend","fringe","frog","front","frost","frown","frozen","fruit","fuel","fun","funny","furnace","fury","future","gadget","gain","galaxy","gallery","game","gap","garage","garbage","garden","garlic","garment","gas","gasp","gate","gather","gauge","gaze","general","genius","genre","gentle","genuine","gesture","ghost","giant","gift","giggle","ginger","giraffe","girl","give","glad","glance","glare","glass","glide","glimpse","globe","gloom","glory","glove","glow","glue","goat","goddess","gold","good","goose","gorilla","gospel","gossip","govern","gown","grab","grace","grain","grant","grape","grass","gravity","great","green","grid","grief","grit","grocery","group","grow","grunt","guard","guess","guide","guilt","guitar","gun","gym","habit","hair","half","hammer","hamster","hand","happy","harbor","hard","harsh","harvest","hat","have","hawk","hazard","head","health","heart","heavy","hedgehog","height","hello","helmet","help","hen","hero","hidden","high","hill","hint","hip","hire","history","hobby","hockey","hold","hole","holiday","hollow","home","honey","hood","hope","horn","horror","horse","hospital","host","hotel","hour","hover","hub","huge","human","humble","humor","hundred","hungry","hunt","hurdle","hurry","hurt","husband","hybrid","ice","icon","idea","identify","idle","ignore","ill","illegal","illness","image","imitate","immense","immune","impact","impose","improve","impulse","inch","include","income","increase","index","indicate","indoor","industry","infant","inflict","inform","inhale","inherit","initial","inject","injury","inmate","inner","innocent","input","inquiry","insane","insect","inside","inspire","install","intact","interest","into","invest","invite","involve","iron","island","isolate","issue","item","ivory","jacket","jaguar","jar","jazz","jealous","jeans","jelly","jewel","job","join","joke","journey","joy","judge","juice","jump","jungle","junior","junk","just","kangaroo","keen","keep","ketchup","key","kick","kid","kidney","kind","kingdom","kiss","kit","kitchen","kite","kitten","kiwi","knee","knife","knock","know","lab","label","labor","ladder","lady","lake","lamp","language","laptop","large","later","latin","laugh","laundry","lava","law","lawn","lawsuit","layer","lazy","leader","leaf","learn","leave","lecture","left","leg","legal","legend","leisure","lemon","lend","length","lens","leopard","lesson","letter","level","liar","liberty","library","license","life","lift","light","like","limb","limit","link","lion","liquid","list","little","live","lizard","load","loan","lobster","local","lock","logic","lonely","long","loop","lottery","loud","lounge","love","loyal","lucky","luggage","lumber","lunar","lunch","luxury","lyrics","machine","mad","magic","magnet","maid","mail","main","major","make","mammal","man","manage","mandate","mango","mansion","manual","maple","marble","march","margin","marine","market","marriage","mask","mass","master","match","material","math","matrix","matter","maximum","maze","meadow","mean","measure","meat","mechanic","medal","media","melody","melt","member","memory","mention","menu","mercy","merge","merit","merry","mesh","message","metal","method","middle","midnight","milk","million","mimic","mind","minimum","minor","minute","miracle","mirror","misery","miss","mistake","mix","mixed","mixture","mobile","model","modify","mom","moment","monitor","monkey","monster","month","moon","moral","more","morning","mosquito","mother","motion","motor","mountain","mouse","move","movie","much","muffin","mule","multiply","muscle","museum","mushroom","music","must","mutual","myself","mystery","myth","naive","name","napkin","narrow","nasty","nation","nature","near","neck","need","negative","neglect","neither","nephew","nerve","nest","net","network","neutral","never","news","next","nice","night","noble","noise","nominee","noodle","normal","north","nose","notable","note","nothing","notice","novel","now","nuclear","number","nurse","nut","oak","obey","object","oblige","obscure","observe","obtain","obvious","occur","ocean","october","odor","off","offer","office","often","oil","okay","old","olive","olympic","omit","once","one","onion","online","only","open","opera","opinion","oppose","option","orange","orbit","orchard","order","ordinary","organ","orient","original","orphan","ostrich","other","outdoor","outer","output","outside","oval","oven","over","own","owner","oxygen","oyster","ozone","pact","paddle","page","pair","palace","palm","panda","panel","panic","panther","paper","parade","parent","park","parrot","party","pass","patch","path","patient","patrol","pattern","pause","pave","payment","peace","peanut","pear","peasant","pelican","pen","penalty","pencil","people","pepper","perfect","permit","person","pet","phone","photo","phrase","physical","piano","picnic","picture","piece","pig","pigeon","pill","pilot","pink","pioneer","pipe","pistol","pitch","pizza","place","planet","plastic","plate","play","please","pledge","pluck","plug","plunge","poem","poet","point","polar","pole","police","pond","pony","pool","popular","portion","position","possible","post","potato","pottery","poverty","powder","power","practice","praise","predict","prefer","prepare","present","pretty","prevent","price","pride","primary","print","priority","prison","private","prize","problem","process","produce","profit","program","project","promote","proof","property","prosper","protect","proud","provide","public","pudding","pull","pulp","pulse","pumpkin","punch","pupil","puppy","purchase","purity","purpose","purse","push","put","puzzle","pyramid","quality","quantum","quarter","question","quick","quit","quiz","quote","rabbit","raccoon","race","rack","radar","radio","rail","rain","raise","rally","ramp","ranch","random","range","rapid","rare","rate","rather","raven","raw","razor","ready","real","reason","rebel","rebuild","recall","receive","recipe","record","recycle","reduce","reflect","reform","refuse","region","regret","regular","reject","relax","release","relief","rely","remain","remember","remind","remove","render","renew","rent","reopen","repair","repeat","replace","report","require","rescue","resemble","resist","resource","response","result","retire","retreat","return","reunion","reveal","review","reward","rhythm","rib","ribbon","rice","rich","ride","ridge","rifle","right","rigid","ring","riot","ripple","risk","ritual","rival","river","road","roast","robot","robust","rocket","romance","roof","rookie","room","rose","rotate","rough","round","route","royal","rubber","rude","rug","rule","run","runway","rural","sad","saddle","sadness","safe","sail","salad","salmon","salon","salt","salute","same","sample","sand","satisfy","satoshi","sauce","sausage","save","say","scale","scan","scare","scatter","scene","scheme","school","science","scissors","scorpion","scout","scrap","screen","script","scrub","sea","search","season","seat","second","secret","section","security","seed","seek","segment","select","sell","seminar","senior","sense","sentence","series","service","session","settle","setup","seven","shadow","shaft","shallow","share","shed","shell","sheriff","shield","shift","shine","ship","shiver","shock","shoe","shoot","shop","short","shoulder","shove","shrimp","shrug","shuffle","shy","sibling","sick","side","siege","sight","sign","silent","silk","silly","silver","similar","simple","since","sing","siren","sister","situate","six","size","skate","sketch","ski","skill","skin","skirt","skull","slab","slam","sleep","slender","slice","slide","slight","slim","slogan","slot","slow","slush","small","smart","smile","smoke","smooth","snack","snake","snap","sniff","snow","soap","soccer","social","sock","soda","soft","solar","soldier","solid","solution","solve","someone","song","soon","sorry","sort","soul","sound","soup","source","south","space","spare","spatial","spawn","speak","special","speed","spell","spend","sphere","spice","spider","spike","spin","spirit","split","spoil","sponsor","spoon","sport","spot","spray","spread","spring","spy","square","squeeze","squirrel","stable","stadium","staff","stage","stairs","stamp","stand","start","state","stay","steak","steel","stem","step","stereo","stick","still","sting","stock","stomach","stone","stool","story","stove","strategy","street","strike","strong","struggle","student","stuff","stumble","style","subject","submit","subway","success","such","sudden","suffer","sugar","suggest","suit","summer","sun","sunny","sunset","super","supply","supreme","sure","surface","surge","surprise","surround","survey","suspect","sustain","swallow","swamp","swap","swarm","swear","sweet","swift","swim","swing","switch","sword","symbol","symptom","syrup","system","table","tackle","tag","tail","talent","talk","tank","tape","target","task","taste","tattoo","taxi","teach","team","tell","ten","tenant","tennis","tent","term","test","text","thank","that","theme","then","theory","there","they","thing","this","thought","three","thrive","throw","thumb","thunder","ticket","tide","tiger","tilt","timber","time","tiny","tip","tired","tissue","title","toast","tobacco","today","toddler","toe","together","toilet","token","tomato","tomorrow","tone","tongue","tonight","tool","tooth","top","topic","topple","torch","tornado","tortoise","toss","total","tourist","toward","tower","town","toy","track","trade","traffic","tragic","train","transfer","trap","trash","travel","tray","treat","tree","trend","trial","tribe","trick","trigger","trim","trip","trophy","trouble","truck","true","truly","trumpet","trust","truth","try","tube","tuition","tumble","tuna","tunnel","turkey","turn","turtle","twelve","twenty","twice","twin","twist","two","type","typical","ugly","umbrella","unable","unaware","uncle","uncover","under","undo","unfair","unfold","unhappy","uniform","unique","unit","universe","unknown","unlock","until","unusual","unveil","update","upgrade","uphold","upon","upper","upset","urban","urge","usage","use","used","useful","useless","usual","utility","vacant","vacuum","vague","valid","valley","valve","van","vanish","vapor","various","vast","vault","vehicle","velvet","vendor","venture","venue","verb","verify","version","very","vessel","veteran","viable","vibrant","vicious","victory","video","view","village","vintage","violin","virtual","virus","visa","visit","visual","vital","vivid","vocal","voice","void","volcano","volume","vote","voyage","wage","wagon","wait","walk","wall","walnut","want","warfare","warm","warrior","wash","wasp","waste","water","wave","way","wealth","weapon","wear","weasel","weather","web","wedding","weekend","weird","welcome","west","wet","whale","what","wheat","wheel","when","where","whip","whisper","wide","width","wife","wild","will","win","window","wine","wing","wink","winner","winter","wire","wisdom","wise","wish","witness","wolf","woman","wonder","wood","wool","word","work","world","worry","worth","wrap","wreck","wrestle","wrist","write","wrong","yard","year","yellow","you","young","youth","zebra","zero","zone","zoo"]'); - -/***/ }), -/* 160 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("assert"); - -/***/ }), -/* 161 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -try { - module.exports = __webpack_require__(118) -} catch (err) { - if (process.env.DEBUG) { - console.error('Secp256k1 bindings are not compiled. Pure JS implementation will be used.') - } - - module.exports = __webpack_require__(120) -} - - -/***/ }), -/* 162 */ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - -var toString = Object.prototype.toString - -// TypeError -exports.isArray = function (value, message) { - if (!Array.isArray(value)) throw TypeError(message) -} - -exports.isBoolean = function (value, message) { - if (toString.call(value) !== '[object Boolean]') throw TypeError(message) -} - -exports.isBuffer = function (value, message) { - if (!Buffer.isBuffer(value)) throw TypeError(message) -} - -exports.isFunction = function (value, message) { - if (toString.call(value) !== '[object Function]') throw TypeError(message) -} - -exports.isNumber = function (value, message) { - if (toString.call(value) !== '[object Number]') throw TypeError(message) -} - -exports.isObject = function (value, message) { - if (toString.call(value) !== '[object Object]') throw TypeError(message) -} - -// RangeError -exports.isBufferLength = function (buffer, length, message) { - if (buffer.length !== length) throw RangeError(message) -} - -exports.isBufferLength2 = function (buffer, length1, length2, message) { - if (buffer.length !== length1 && buffer.length !== length2) throw RangeError(message) -} - -exports.isLengthGTZero = function (value, message) { - if (value.length === 0) throw RangeError(message) -} - -exports.isNumberInInterval = function (number, x, y, message) { - if (number <= x || number >= y) throw RangeError(message) -} - - -/***/ }), -/* 163 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -var Buffer = (__webpack_require__(6).Buffer) -var bip66 = __webpack_require__(122) - -var EC_PRIVKEY_EXPORT_DER_COMPRESSED = Buffer.from([ - // begin - 0x30, 0x81, 0xd3, 0x02, 0x01, 0x01, 0x04, 0x20, - // private key - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - // middle - 0xa0, 0x81, 0x85, 0x30, 0x81, 0x82, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48, - 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04, - 0x21, 0x02, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87, - 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8, - 0x17, 0x98, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E, - 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x24, 0x03, 0x22, 0x00, - // public key - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00 -]) - -var EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED = Buffer.from([ - // begin - 0x30, 0x82, 0x01, 0x13, 0x02, 0x01, 0x01, 0x04, 0x20, - // private key - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - // middle - 0xa0, 0x81, 0xa5, 0x30, 0x81, 0xa2, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48, - 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04, - 0x41, 0x04, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87, - 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8, - 0x17, 0x98, 0x48, 0x3a, 0xda, 0x77, 0x26, 0xa3, 0xc4, 0x65, 0x5d, 0xa4, 0xfb, 0xfc, 0x0E, 0x11, - 0x08, 0xa8, 0xfd, 0x17, 0xb4, 0x48, 0xa6, 0x85, 0x54, 0x19, 0x9c, 0x47, 0xd0, 0x8f, 0xfb, 0x10, - 0xd4, 0xb8, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E, - 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x44, 0x03, 0x42, 0x00, - // public key - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00 -]) - -exports.privateKeyExport = function (privateKey, publicKey, compressed) { - var result = Buffer.from(compressed ? EC_PRIVKEY_EXPORT_DER_COMPRESSED : EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED) - privateKey.copy(result, compressed ? 8 : 9) - publicKey.copy(result, compressed ? 181 : 214) - return result -} - -exports.privateKeyImport = function (privateKey) { - var length = privateKey.length - - // sequence header - var index = 0 - if (length < index + 1 || privateKey[index] !== 0x30) return - index += 1 - - // sequence length constructor - if (length < index + 1 || !(privateKey[index] & 0x80)) return - - var lenb = privateKey[index] & 0x7f - index += 1 - if (lenb < 1 || lenb > 2) return - if (length < index + lenb) return - - // sequence length - var len = privateKey[index + lenb - 1] | (lenb > 1 ? privateKey[index + lenb - 2] << 8 : 0) - index += lenb - if (length < index + len) return - - // sequence element 0: version number (=1) - if (length < index + 3 || - privateKey[index] !== 0x02 || - privateKey[index + 1] !== 0x01 || - privateKey[index + 2] !== 0x01) { - return - } - index += 3 - - // sequence element 1: octet string, up to 32 bytes - if (length < index + 2 || - privateKey[index] !== 0x04 || - privateKey[index + 1] > 0x20 || - length < index + 2 + privateKey[index + 1]) { - return - } - - return privateKey.slice(index + 2, index + 2 + privateKey[index + 1]) -} - -exports.signatureExport = function (sigObj) { - var r = Buffer.concat([Buffer.from([0]), sigObj.r]) - for (var lenR = 33, posR = 0; lenR > 1 && r[posR] === 0x00 && !(r[posR + 1] & 0x80); --lenR, ++posR); - - var s = Buffer.concat([Buffer.from([0]), sigObj.s]) - for (var lenS = 33, posS = 0; lenS > 1 && s[posS] === 0x00 && !(s[posS + 1] & 0x80); --lenS, ++posS); - - return bip66.encode(r.slice(posR), s.slice(posS)) -} - -exports.signatureImport = function (sig) { - var r = Buffer.alloc(32, 0) - var s = Buffer.alloc(32, 0) - - try { - var sigObj = bip66.decode(sig) - if (sigObj.r.length === 33 && sigObj.r[0] === 0x00) sigObj.r = sigObj.r.slice(1) - if (sigObj.r.length > 32) throw new Error('R length is too long') - if (sigObj.s.length === 33 && sigObj.s[0] === 0x00) sigObj.s = sigObj.s.slice(1) - if (sigObj.s.length > 32) throw new Error('S length is too long') - } catch (err) { - return - } - - sigObj.r.copy(r, 32 - sigObj.r.length) - sigObj.s.copy(s, 32 - sigObj.s.length) - - return { r: r, s: s } -} - -exports.signatureImportLax = function (sig) { - var r = Buffer.alloc(32, 0) - var s = Buffer.alloc(32, 0) - - var length = sig.length - var index = 0 - - // sequence tag byte - if (sig[index++] !== 0x30) return - - // sequence length byte - var lenbyte = sig[index++] - if (lenbyte & 0x80) { - index += lenbyte - 0x80 - if (index > length) return - } - - // sequence tag byte for r - if (sig[index++] !== 0x02) return - - // length for r - var rlen = sig[index++] - if (rlen & 0x80) { - lenbyte = rlen - 0x80 - if (index + lenbyte > length) return - for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1); - for (rlen = 0; lenbyte > 0; index += 1, lenbyte -= 1) rlen = (rlen << 8) + sig[index] - } - if (rlen > length - index) return - var rindex = index - index += rlen - - // sequence tag byte for s - if (sig[index++] !== 0x02) return - - // length for s - var slen = sig[index++] - if (slen & 0x80) { - lenbyte = slen - 0x80 - if (index + lenbyte > length) return - for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1); - for (slen = 0; lenbyte > 0; index += 1, lenbyte -= 1) slen = (slen << 8) + sig[index] - } - if (slen > length - index) return - var sindex = index - index += slen - - // ignore leading zeros in r - for (; rlen > 0 && sig[rindex] === 0x00; rlen -= 1, rindex += 1); - // copy r value - if (rlen > 32) return - var rvalue = sig.slice(rindex, rindex + rlen) - rvalue.copy(r, 32 - rvalue.length) - - // ignore leading zeros in s - for (; slen > 0 && sig[sindex] === 0x00; slen -= 1, sindex += 1); - // copy s value - if (slen > 32) return - var svalue = sig.slice(sindex, sindex + slen) - svalue.copy(s, 32 - svalue.length) - - return { r: r, s: s } -} - - -/***/ }), -/* 164 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var __webpack_unused_export__; -var crypto = __webpack_require__(4) - -__webpack_unused_export__ = __webpack_unused_export__ = crypto.createCipher -exports.CW = __webpack_unused_export__ = crypto.createCipheriv -__webpack_unused_export__ = __webpack_unused_export__ = crypto.createDecipher -exports.G_ = __webpack_unused_export__ = crypto.createDecipheriv -__webpack_unused_export__ = __webpack_unused_export__ = crypto.getCiphers - - -/***/ }), -/* 165 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -try { - module.exports = __webpack_require__(128) -} catch (err) { - module.exports = __webpack_require__(140) -} - - -/***/ }), -/* 166 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("events"); - -/***/ }), -/* 167 */ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - - -/** - * For Node.js, simply re-export the core `util.deprecate` function. - */ - -module.exports = __webpack_require__(29).deprecate; - - -/***/ }), -/* 168 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("os"); - -/***/ }), -/* 169 */ -/***/ ((__unused_webpack_module, exports) => { - -const P1600_ROUND_CONSTANTS = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649, 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0, 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771, 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648, 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648] - -exports.p1600 = function (s) { - for (let round = 0; round < 24; ++round) { - // theta - const lo0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40] - const hi0 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41] - const lo1 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42] - const hi1 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43] - const lo2 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44] - const hi2 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45] - const lo3 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46] - const hi3 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47] - const lo4 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48] - const hi4 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49] - - let lo = lo4 ^ (lo1 << 1 | hi1 >>> 31) - let hi = hi4 ^ (hi1 << 1 | lo1 >>> 31) - const t1slo0 = s[0] ^ lo - const t1shi0 = s[1] ^ hi - const t1slo5 = s[10] ^ lo - const t1shi5 = s[11] ^ hi - const t1slo10 = s[20] ^ lo - const t1shi10 = s[21] ^ hi - const t1slo15 = s[30] ^ lo - const t1shi15 = s[31] ^ hi - const t1slo20 = s[40] ^ lo - const t1shi20 = s[41] ^ hi - lo = lo0 ^ (lo2 << 1 | hi2 >>> 31) - hi = hi0 ^ (hi2 << 1 | lo2 >>> 31) - const t1slo1 = s[2] ^ lo - const t1shi1 = s[3] ^ hi - const t1slo6 = s[12] ^ lo - const t1shi6 = s[13] ^ hi - const t1slo11 = s[22] ^ lo - const t1shi11 = s[23] ^ hi - const t1slo16 = s[32] ^ lo - const t1shi16 = s[33] ^ hi - const t1slo21 = s[42] ^ lo - const t1shi21 = s[43] ^ hi - lo = lo1 ^ (lo3 << 1 | hi3 >>> 31) - hi = hi1 ^ (hi3 << 1 | lo3 >>> 31) - const t1slo2 = s[4] ^ lo - const t1shi2 = s[5] ^ hi - const t1slo7 = s[14] ^ lo - const t1shi7 = s[15] ^ hi - const t1slo12 = s[24] ^ lo - const t1shi12 = s[25] ^ hi - const t1slo17 = s[34] ^ lo - const t1shi17 = s[35] ^ hi - const t1slo22 = s[44] ^ lo - const t1shi22 = s[45] ^ hi - lo = lo2 ^ (lo4 << 1 | hi4 >>> 31) - hi = hi2 ^ (hi4 << 1 | lo4 >>> 31) - const t1slo3 = s[6] ^ lo - const t1shi3 = s[7] ^ hi - const t1slo8 = s[16] ^ lo - const t1shi8 = s[17] ^ hi - const t1slo13 = s[26] ^ lo - const t1shi13 = s[27] ^ hi - const t1slo18 = s[36] ^ lo - const t1shi18 = s[37] ^ hi - const t1slo23 = s[46] ^ lo - const t1shi23 = s[47] ^ hi - lo = lo3 ^ (lo0 << 1 | hi0 >>> 31) - hi = hi3 ^ (hi0 << 1 | lo0 >>> 31) - const t1slo4 = s[8] ^ lo - const t1shi4 = s[9] ^ hi - const t1slo9 = s[18] ^ lo - const t1shi9 = s[19] ^ hi - const t1slo14 = s[28] ^ lo - const t1shi14 = s[29] ^ hi - const t1slo19 = s[38] ^ lo - const t1shi19 = s[39] ^ hi - const t1slo24 = s[48] ^ lo - const t1shi24 = s[49] ^ hi - - // rho & pi - const t2slo0 = t1slo0 - const t2shi0 = t1shi0 - const t2slo16 = (t1shi5 << 4 | t1slo5 >>> 28) - const t2shi16 = (t1slo5 << 4 | t1shi5 >>> 28) - const t2slo7 = (t1slo10 << 3 | t1shi10 >>> 29) - const t2shi7 = (t1shi10 << 3 | t1slo10 >>> 29) - const t2slo23 = (t1shi15 << 9 | t1slo15 >>> 23) - const t2shi23 = (t1slo15 << 9 | t1shi15 >>> 23) - const t2slo14 = (t1slo20 << 18 | t1shi20 >>> 14) - const t2shi14 = (t1shi20 << 18 | t1slo20 >>> 14) - const t2slo10 = (t1slo1 << 1 | t1shi1 >>> 31) - const t2shi10 = (t1shi1 << 1 | t1slo1 >>> 31) - const t2slo1 = (t1shi6 << 12 | t1slo6 >>> 20) - const t2shi1 = (t1slo6 << 12 | t1shi6 >>> 20) - const t2slo17 = (t1slo11 << 10 | t1shi11 >>> 22) - const t2shi17 = (t1shi11 << 10 | t1slo11 >>> 22) - const t2slo8 = (t1shi16 << 13 | t1slo16 >>> 19) - const t2shi8 = (t1slo16 << 13 | t1shi16 >>> 19) - const t2slo24 = (t1slo21 << 2 | t1shi21 >>> 30) - const t2shi24 = (t1shi21 << 2 | t1slo21 >>> 30) - const t2slo20 = (t1shi2 << 30 | t1slo2 >>> 2) - const t2shi20 = (t1slo2 << 30 | t1shi2 >>> 2) - const t2slo11 = (t1slo7 << 6 | t1shi7 >>> 26) - const t2shi11 = (t1shi7 << 6 | t1slo7 >>> 26) - const t2slo2 = (t1shi12 << 11 | t1slo12 >>> 21) - const t2shi2 = (t1slo12 << 11 | t1shi12 >>> 21) - const t2slo18 = (t1slo17 << 15 | t1shi17 >>> 17) - const t2shi18 = (t1shi17 << 15 | t1slo17 >>> 17) - const t2slo9 = (t1shi22 << 29 | t1slo22 >>> 3) - const t2shi9 = (t1slo22 << 29 | t1shi22 >>> 3) - const t2slo5 = (t1slo3 << 28 | t1shi3 >>> 4) - const t2shi5 = (t1shi3 << 28 | t1slo3 >>> 4) - const t2slo21 = (t1shi8 << 23 | t1slo8 >>> 9) - const t2shi21 = (t1slo8 << 23 | t1shi8 >>> 9) - const t2slo12 = (t1slo13 << 25 | t1shi13 >>> 7) - const t2shi12 = (t1shi13 << 25 | t1slo13 >>> 7) - const t2slo3 = (t1slo18 << 21 | t1shi18 >>> 11) - const t2shi3 = (t1shi18 << 21 | t1slo18 >>> 11) - const t2slo19 = (t1shi23 << 24 | t1slo23 >>> 8) - const t2shi19 = (t1slo23 << 24 | t1shi23 >>> 8) - const t2slo15 = (t1slo4 << 27 | t1shi4 >>> 5) - const t2shi15 = (t1shi4 << 27 | t1slo4 >>> 5) - const t2slo6 = (t1slo9 << 20 | t1shi9 >>> 12) - const t2shi6 = (t1shi9 << 20 | t1slo9 >>> 12) - const t2slo22 = (t1shi14 << 7 | t1slo14 >>> 25) - const t2shi22 = (t1slo14 << 7 | t1shi14 >>> 25) - const t2slo13 = (t1slo19 << 8 | t1shi19 >>> 24) - const t2shi13 = (t1shi19 << 8 | t1slo19 >>> 24) - const t2slo4 = (t1slo24 << 14 | t1shi24 >>> 18) - const t2shi4 = (t1shi24 << 14 | t1slo24 >>> 18) - - // chi - s[0] = t2slo0 ^ (~t2slo1 & t2slo2) - s[1] = t2shi0 ^ (~t2shi1 & t2shi2) - s[10] = t2slo5 ^ (~t2slo6 & t2slo7) - s[11] = t2shi5 ^ (~t2shi6 & t2shi7) - s[20] = t2slo10 ^ (~t2slo11 & t2slo12) - s[21] = t2shi10 ^ (~t2shi11 & t2shi12) - s[30] = t2slo15 ^ (~t2slo16 & t2slo17) - s[31] = t2shi15 ^ (~t2shi16 & t2shi17) - s[40] = t2slo20 ^ (~t2slo21 & t2slo22) - s[41] = t2shi20 ^ (~t2shi21 & t2shi22) - s[2] = t2slo1 ^ (~t2slo2 & t2slo3) - s[3] = t2shi1 ^ (~t2shi2 & t2shi3) - s[12] = t2slo6 ^ (~t2slo7 & t2slo8) - s[13] = t2shi6 ^ (~t2shi7 & t2shi8) - s[22] = t2slo11 ^ (~t2slo12 & t2slo13) - s[23] = t2shi11 ^ (~t2shi12 & t2shi13) - s[32] = t2slo16 ^ (~t2slo17 & t2slo18) - s[33] = t2shi16 ^ (~t2shi17 & t2shi18) - s[42] = t2slo21 ^ (~t2slo22 & t2slo23) - s[43] = t2shi21 ^ (~t2shi22 & t2shi23) - s[4] = t2slo2 ^ (~t2slo3 & t2slo4) - s[5] = t2shi2 ^ (~t2shi3 & t2shi4) - s[14] = t2slo7 ^ (~t2slo8 & t2slo9) - s[15] = t2shi7 ^ (~t2shi8 & t2shi9) - s[24] = t2slo12 ^ (~t2slo13 & t2slo14) - s[25] = t2shi12 ^ (~t2shi13 & t2shi14) - s[34] = t2slo17 ^ (~t2slo18 & t2slo19) - s[35] = t2shi17 ^ (~t2shi18 & t2shi19) - s[44] = t2slo22 ^ (~t2slo23 & t2slo24) - s[45] = t2shi22 ^ (~t2shi23 & t2shi24) - s[6] = t2slo3 ^ (~t2slo4 & t2slo0) - s[7] = t2shi3 ^ (~t2shi4 & t2shi0) - s[16] = t2slo8 ^ (~t2slo9 & t2slo5) - s[17] = t2shi8 ^ (~t2shi9 & t2shi5) - s[26] = t2slo13 ^ (~t2slo14 & t2slo10) - s[27] = t2shi13 ^ (~t2shi14 & t2shi10) - s[36] = t2slo18 ^ (~t2slo19 & t2slo15) - s[37] = t2shi18 ^ (~t2shi19 & t2shi15) - s[46] = t2slo23 ^ (~t2slo24 & t2slo20) - s[47] = t2shi23 ^ (~t2shi24 & t2shi20) - s[8] = t2slo4 ^ (~t2slo0 & t2slo1) - s[9] = t2shi4 ^ (~t2shi0 & t2shi1) - s[18] = t2slo9 ^ (~t2slo5 & t2slo6) - s[19] = t2shi9 ^ (~t2shi5 & t2shi6) - s[28] = t2slo14 ^ (~t2slo10 & t2slo11) - s[29] = t2shi14 ^ (~t2shi10 & t2shi11) - s[38] = t2slo19 ^ (~t2slo15 & t2slo16) - s[39] = t2shi19 ^ (~t2shi15 & t2shi16) - s[48] = t2slo24 ^ (~t2slo20 & t2slo21) - s[49] = t2shi24 ^ (~t2shi20 & t2shi21) - - // iota - s[0] ^= P1600_ROUND_CONSTANTS[round * 2] - s[1] ^= P1600_ROUND_CONSTANTS[round * 2 + 1] - } -} - - -/***/ }), -/* 170 */ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/** - * Wrapper for built-in http.js to emulate the browser XMLHttpRequest object. - * - * This can be used with JS designed for browsers to improve reuse of code and - * allow the use of existing libraries. - * - * Usage: include("XMLHttpRequest.js") and use XMLHttpRequest per W3C specs. - * - * @author Dan DeFelippi - * @contributor David Ellis - * @license MIT - */ - -var Url = __webpack_require__(171); -var spawn = (__webpack_require__(172).spawn); -var fs = __webpack_require__(56); - -exports.h = function() { - "use strict"; - - /** - * Private variables - */ - var self = this; - var http = __webpack_require__(173); - var https = __webpack_require__(174); - - // Holds http.js objects - var request; - var response; - - // Request settings - var settings = {}; - - // Disable header blacklist. - // Not part of XHR specs. - var disableHeaderCheck = false; - - // Set some default headers - var defaultHeaders = { - "User-Agent": "node-XMLHttpRequest", - "Accept": "*/*", - }; - - var headers = {}; - var headersCase = {}; - - // These headers are not user setable. - // The following are allowed but banned in the spec: - // * user-agent - var forbiddenRequestHeaders = [ - "accept-charset", - "accept-encoding", - "access-control-request-headers", - "access-control-request-method", - "connection", - "content-length", - "content-transfer-encoding", - "cookie", - "cookie2", - "date", - "expect", - "host", - "keep-alive", - "origin", - "referer", - "te", - "trailer", - "transfer-encoding", - "upgrade", - "via" - ]; - - // These request methods are not allowed - var forbiddenRequestMethods = [ - "TRACE", - "TRACK", - "CONNECT" - ]; - - // Send flag - var sendFlag = false; - // Error flag, used when errors occur or abort is called - var errorFlag = false; - - // Event listeners - var listeners = {}; - - /** - * Constants - */ - - this.UNSENT = 0; - this.OPENED = 1; - this.HEADERS_RECEIVED = 2; - this.LOADING = 3; - this.DONE = 4; - - /** - * Public vars - */ - - // Current state - this.readyState = this.UNSENT; - - // default ready state change handler in case one is not set or is set late - this.onreadystatechange = null; - - // Result & response - this.responseText = ""; - this.responseXML = ""; - this.status = null; - this.statusText = null; - - // Whether cross-site Access-Control requests should be made using - // credentials such as cookies or authorization headers - this.withCredentials = false; - - /** - * Private methods - */ - - /** - * Check if the specified header is allowed. - * - * @param string header Header to validate - * @return boolean False if not allowed, otherwise true - */ - var isAllowedHttpHeader = function(header) { - return disableHeaderCheck || (header && forbiddenRequestHeaders.indexOf(header.toLowerCase()) === -1); - }; - - /** - * Check if the specified method is allowed. - * - * @param string method Request method to validate - * @return boolean False if not allowed, otherwise true - */ - var isAllowedHttpMethod = function(method) { - return (method && forbiddenRequestMethods.indexOf(method) === -1); - }; - - /** - * Public methods - */ - - /** - * Open the connection. Currently supports local server requests. - * - * @param string method Connection method (eg GET, POST) - * @param string url URL for the connection. - * @param boolean async Asynchronous connection. Default is true. - * @param string user Username for basic authentication (optional) - * @param string password Password for basic authentication (optional) - */ - this.open = function(method, url, async, user, password) { - this.abort(); - errorFlag = false; - - // Check for valid request method - if (!isAllowedHttpMethod(method)) { - throw new Error("SecurityError: Request method not allowed"); - } - - settings = { - "method": method, - "url": url.toString(), - "async": (typeof async !== "boolean" ? true : async), - "user": user || null, - "password": password || null - }; - - setState(this.OPENED); - }; - - /** - * Disables or enables isAllowedHttpHeader() check the request. Enabled by default. - * This does not conform to the W3C spec. - * - * @param boolean state Enable or disable header checking. - */ - this.setDisableHeaderCheck = function(state) { - disableHeaderCheck = state; - }; - - /** - * Sets a header for the request or appends the value if one is already set. - * - * @param string header Header name - * @param string value Header value - */ - this.setRequestHeader = function(header, value) { - if (this.readyState !== this.OPENED) { - throw new Error("INVALID_STATE_ERR: setRequestHeader can only be called when state is OPEN"); - } - if (!isAllowedHttpHeader(header)) { - console.warn("Refused to set unsafe header \"" + header + "\""); - return; - } - if (sendFlag) { - throw new Error("INVALID_STATE_ERR: send flag is true"); - } - header = headersCase[header.toLowerCase()] || header; - headersCase[header.toLowerCase()] = header; - headers[header] = headers[header] ? headers[header] + ', ' + value : value; - }; - - /** - * Gets a header from the server response. - * - * @param string header Name of header to get. - * @return string Text of the header or null if it doesn't exist. - */ - this.getResponseHeader = function(header) { - if (typeof header === "string" - && this.readyState > this.OPENED - && response - && response.headers - && response.headers[header.toLowerCase()] - && !errorFlag - ) { - return response.headers[header.toLowerCase()]; - } - - return null; - }; - - /** - * Gets all the response headers. - * - * @return string A string with all response headers separated by CR+LF - */ - this.getAllResponseHeaders = function() { - if (this.readyState < this.HEADERS_RECEIVED || errorFlag) { - return ""; - } - var result = ""; - - for (var i in response.headers) { - // Cookie headers are excluded - if (i !== "set-cookie" && i !== "set-cookie2") { - result += i + ": " + response.headers[i] + "\r\n"; - } - } - return result.substr(0, result.length - 2); - }; - - /** - * Gets a request header - * - * @param string name Name of header to get - * @return string Returns the request header or empty string if not set - */ - this.getRequestHeader = function(name) { - if (typeof name === "string" && headersCase[name.toLowerCase()]) { - return headers[headersCase[name.toLowerCase()]]; - } - - return ""; - }; - - /** - * Sends the request to the server. - * - * @param string data Optional data to send as request body. - */ - this.send = function(data) { - if (this.readyState !== this.OPENED) { - throw new Error("INVALID_STATE_ERR: connection must be opened before send() is called"); - } - - if (sendFlag) { - throw new Error("INVALID_STATE_ERR: send has already been called"); - } - - var ssl = false, local = false; - var url = Url.parse(settings.url); - var host; - // Determine the server - switch (url.protocol) { - case "https:": - ssl = true; - // SSL & non-SSL both need host, no break here. - case "http:": - host = url.hostname; - break; - - case "file:": - local = true; - break; - - case undefined: - case null: - case "": - host = "localhost"; - break; - - default: - throw new Error("Protocol not supported."); - } - - // Load files off the local filesystem (file://) - if (local) { - if (settings.method !== "GET") { - throw new Error("XMLHttpRequest: Only GET method is supported"); - } - - if (settings.async) { - fs.readFile(url.pathname, "utf8", function(error, data) { - if (error) { - self.handleError(error); - } else { - self.status = 200; - self.responseText = data; - setState(self.DONE); - } - }); - } else { - try { - this.responseText = fs.readFileSync(url.pathname, "utf8"); - this.status = 200; - setState(self.DONE); - } catch(e) { - this.handleError(e); - } - } - - return; - } - - // Default to port 80. If accessing localhost on another port be sure - // to use http://localhost:port/path - var port = url.port || (ssl ? 443 : 80); - // Add query string if one is used - var uri = url.pathname + (url.search ? url.search : ""); - - // Set the defaults if they haven't been set - for (var name in defaultHeaders) { - if (!headersCase[name.toLowerCase()]) { - headers[name] = defaultHeaders[name]; - } - } - - // Set the Host header or the server may reject the request - headers.Host = host; - if (!((ssl && port === 443) || port === 80)) { - headers.Host += ":" + url.port; - } - - // Set Basic Auth if necessary - if (settings.user) { - if (typeof settings.password === "undefined") { - settings.password = ""; - } - var authBuf = new Buffer(settings.user + ":" + settings.password); - headers.Authorization = "Basic " + authBuf.toString("base64"); - } - - // Set content length header - if (settings.method === "GET" || settings.method === "HEAD") { - data = null; - } else if (data) { - headers["Content-Length"] = Buffer.isBuffer(data) ? data.length : Buffer.byteLength(data); - - if (!headers["Content-Type"]) { - headers["Content-Type"] = "text/plain;charset=UTF-8"; - } - } else if (settings.method === "POST") { - // For a post with no data set Content-Length: 0. - // This is required by buggy servers that don't meet the specs. - headers["Content-Length"] = 0; - } - - var options = { - host: host, - port: port, - path: uri, - method: settings.method, - headers: headers, - agent: false, - withCredentials: self.withCredentials - }; - - // Reset error flag - errorFlag = false; - - // Handle async requests - if (settings.async) { - // Use the proper protocol - var doRequest = ssl ? https.request : http.request; - - // Request is being sent, set send flag - sendFlag = true; - - // As per spec, this is called here for historical reasons. - self.dispatchEvent("readystatechange"); - - // Handler for the response - var responseHandler = function responseHandler(resp) { - // Set response var to the response we got back - // This is so it remains accessable outside this scope - response = resp; - // Check for redirect - // @TODO Prevent looped redirects - if (response.statusCode === 301 || response.statusCode === 302 || response.statusCode === 303 || response.statusCode === 307) { - // Change URL to the redirect location - settings.url = response.headers.location; - var url = Url.parse(settings.url); - // Set host var in case it's used later - host = url.hostname; - // Options for the new request - var newOptions = { - hostname: url.hostname, - port: url.port, - path: url.path, - method: response.statusCode === 303 ? "GET" : settings.method, - headers: headers, - withCredentials: self.withCredentials - }; - - // Issue the new request - request = doRequest(newOptions, responseHandler).on("error", errorHandler); - request.end(); - // @TODO Check if an XHR event needs to be fired here - return; - } - - response.setEncoding("utf8"); - - setState(self.HEADERS_RECEIVED); - self.status = response.statusCode; - - response.on("data", function(chunk) { - // Make sure there's some data - if (chunk) { - self.responseText += chunk; - } - // Don't emit state changes if the connection has been aborted. - if (sendFlag) { - setState(self.LOADING); - } - }); - - response.on("end", function() { - if (sendFlag) { - // Discard the end event if the connection has been aborted - setState(self.DONE); - sendFlag = false; - } - }); - - response.on("error", function(error) { - self.handleError(error); - }); - }; - - // Error handler for the request - var errorHandler = function errorHandler(error) { - self.handleError(error); - }; - - // Create the request - request = doRequest(options, responseHandler).on("error", errorHandler); - - // Node 0.4 and later won't accept empty data. Make sure it's needed. - if (data) { - request.write(data); - } - - request.end(); - - self.dispatchEvent("loadstart"); - } else { // Synchronous - // Create a temporary file for communication with the other Node process - var contentFile = ".node-xmlhttprequest-content-" + process.pid; - var syncFile = ".node-xmlhttprequest-sync-" + process.pid; - fs.writeFileSync(syncFile, "", "utf8"); - // The async request the other Node process executes - var execString = "var http = require('http'), https = require('https'), fs = require('fs');" - + "var doRequest = http" + (ssl ? "s" : "") + ".request;" - + "var options = " + JSON.stringify(options) + ";" - + "var responseText = '';" - + "var req = doRequest(options, function(response) {" - + "response.setEncoding('utf8');" - + "response.on('data', function(chunk) {" - + " responseText += chunk;" - + "});" - + "response.on('end', function() {" - + "fs.writeFileSync('" + contentFile + "', JSON.stringify({err: null, data: {statusCode: response.statusCode, headers: response.headers, text: responseText}}), 'utf8');" - + "fs.unlinkSync('" + syncFile + "');" - + "});" - + "response.on('error', function(error) {" - + "fs.writeFileSync('" + contentFile + "', JSON.stringify({err: error}), 'utf8');" - + "fs.unlinkSync('" + syncFile + "');" - + "});" - + "}).on('error', function(error) {" - + "fs.writeFileSync('" + contentFile + "', JSON.stringify({err: error}), 'utf8');" - + "fs.unlinkSync('" + syncFile + "');" - + "});" - + (data ? "req.write('" + JSON.stringify(data).slice(1,-1).replace(/'/g, "\\'") + "');":"") - + "req.end();"; - // Start the other Node Process, executing this string - var syncProc = spawn(process.argv[0], ["-e", execString]); - while(fs.existsSync(syncFile)) { - // Wait while the sync file is empty - } - var resp = JSON.parse(fs.readFileSync(contentFile, 'utf8')); - // Kill the child process once the file has data - syncProc.stdin.end(); - // Remove the temporary file - fs.unlinkSync(contentFile); - - if (resp.err) { - self.handleError(resp.err); - } else { - response = resp.data; - self.status = resp.data.statusCode; - self.responseText = resp.data.text; - setState(self.DONE); - } - } - }; - - /** - * Called when an error is encountered to deal with it. - */ - this.handleError = function(error) { - this.status = 0; - this.statusText = error; - this.responseText = error.stack; - errorFlag = true; - setState(this.DONE); - this.dispatchEvent('error'); - }; - - /** - * Aborts a request. - */ - this.abort = function() { - if (request) { - request.abort(); - request = null; - } - - headers = defaultHeaders; - this.status = 0; - this.responseText = ""; - this.responseXML = ""; - - errorFlag = true; - - if (this.readyState !== this.UNSENT - && (this.readyState !== this.OPENED || sendFlag) - && this.readyState !== this.DONE) { - sendFlag = false; - setState(this.DONE); - } - this.readyState = this.UNSENT; - this.dispatchEvent('abort'); - }; - - /** - * Adds an event listener. Preferred method of binding to events. - */ - this.addEventListener = function(event, callback) { - if (!(event in listeners)) { - listeners[event] = []; - } - // Currently allows duplicate callbacks. Should it? - listeners[event].push(callback); - }; - - /** - * Remove an event callback that has already been bound. - * Only works on the matching funciton, cannot be a copy. - */ - this.removeEventListener = function(event, callback) { - if (event in listeners) { - // Filter will return a new array with the callback removed - listeners[event] = listeners[event].filter(function(ev) { - return ev !== callback; - }); - } - }; - - /** - * Dispatch any events, including both "on" methods and events attached using addEventListener. - */ - this.dispatchEvent = function(event) { - if (typeof self["on" + event] === "function") { - self["on" + event](); - } - if (event in listeners) { - for (var i = 0, len = listeners[event].length; i < len; i++) { - listeners[event][i].call(self); - } - } - }; - - /** - * Changes readyState and calls onreadystatechange. - * - * @param int state New state - */ - var setState = function(state) { - if (state == self.LOADING || self.readyState !== state) { - self.readyState = state; - - if (settings.async || self.readyState < self.OPENED || self.readyState === self.DONE) { - self.dispatchEvent("readystatechange"); - } - - if (self.readyState === self.DONE && !errorFlag) { - self.dispatchEvent("load"); - // @TODO figure out InspectorInstrumentation::didLoadXHR(cookie) - self.dispatchEvent("loadend"); - } - } - }; -}; - - -/***/ }), -/* 171 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("url"); - -/***/ }), -/* 172 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("child_process"); - -/***/ }), -/* 173 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("http"); - -/***/ }), -/* 174 */ -/***/ ((module) => { - -"use strict"; -module.exports = require("https"); - -/***/ }) -/******/ ]); -/************************************************************************/ -/******/ // The module cache -/******/ var __webpack_module_cache__ = {}; -/******/ -/******/ // The require function -/******/ function __webpack_require__(moduleId) { -/******/ // Check if module is in cache -/******/ var cachedModule = __webpack_module_cache__[moduleId]; -/******/ if (cachedModule !== undefined) { -/******/ return cachedModule.exports; -/******/ } -/******/ // Create a new module (and put it into the cache) -/******/ var module = __webpack_module_cache__[moduleId] = { -/******/ id: moduleId, -/******/ loaded: false, -/******/ exports: {} -/******/ }; -/******/ -/******/ // Execute the module function -/******/ __webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__); -/******/ -/******/ // Flag the module as loaded -/******/ module.loaded = true; -/******/ -/******/ // Return the exports of the module -/******/ return module.exports; -/******/ } -/******/ -/************************************************************************/ -/******/ /* webpack/runtime/compat get default export */ -/******/ (() => { -/******/ // getDefaultExport function for compatibility with non-harmony modules -/******/ __webpack_require__.n = (module) => { -/******/ var getter = module && module.__esModule ? -/******/ () => (module['default']) : -/******/ () => (module); -/******/ __webpack_require__.d(getter, { a: getter }); -/******/ return getter; -/******/ }; -/******/ })(); -/******/ -/******/ /* webpack/runtime/define property getters */ -/******/ (() => { -/******/ // define getter functions for harmony exports -/******/ __webpack_require__.d = (exports, definition) => { -/******/ for(var key in definition) { -/******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) { -/******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] }); -/******/ } -/******/ } -/******/ }; -/******/ })(); -/******/ -/******/ /* webpack/runtime/hasOwnProperty shorthand */ -/******/ (() => { -/******/ __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop)) -/******/ })(); -/******/ -/******/ /* webpack/runtime/make namespace object */ -/******/ (() => { -/******/ // define __esModule on exports -/******/ __webpack_require__.r = (exports) => { -/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) { -/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' }); -/******/ } -/******/ Object.defineProperty(exports, '__esModule', { value: true }); -/******/ }; -/******/ })(); -/******/ -/******/ /* webpack/runtime/node module decorator */ -/******/ (() => { -/******/ __webpack_require__.nmd = (module) => { -/******/ module.paths = []; -/******/ if (!module.children) module.children = []; -/******/ return module; -/******/ }; -/******/ })(); -/******/ -/************************************************************************/ -var __webpack_exports__ = {}; -// This entry need to be wrapped in an IIFE because it need to be in strict mode. -(() => { -"use strict"; - -// EXPORTS -__webpack_require__.d(__webpack_exports__, { - "default": () => (/* binding */ AElf) -}); - -// UNUSED EXPORTS: __GetDependency__, __ResetDependency__, __RewireAPI__, __Rewire__, __get__, __set__ - -// NAMESPACE OBJECT: ./src/util/transform.js -var transform_namespaceObject = {}; -__webpack_require__.r(transform_namespaceObject); -__webpack_require__.d(transform_namespaceObject, { - "INPUT_TRANSFORMERS": () => (INPUT_TRANSFORMERS), - "OUTPUT_TRANSFORMERS": () => (OUTPUT_TRANSFORMERS), - "__GetDependency__": () => (transform_get_), - "__ResetDependency__": () => (transform_reset_), - "__RewireAPI__": () => (transform_RewireAPI_), - "__Rewire__": () => (transform_set_), - "__get__": () => (transform_get_), - "__set__": () => (transform_set_), - "default": () => (util_transform), - "encodeAddress": () => (encodeAddress), - "transform": () => (transform), - "transformArrayToMap": () => (transformArrayToMap), - "transformMapToArray": () => (transformMapToArray) -}); - -// NAMESPACE OBJECT: ./src/util/utils.js -var utils_namespaceObject = {}; -__webpack_require__.r(utils_namespaceObject); -__webpack_require__.d(utils_namespaceObject, { - "__GetDependency__": () => (utils_get_), - "__ResetDependency__": () => (utils_reset_), - "__RewireAPI__": () => (utils_RewireAPI_), - "__Rewire__": () => (utils_set_), - "__get__": () => (utils_get_), - "__set__": () => (utils_set_), - "arrayToHex": () => (arrayToHex), - "base58": () => (base58), - "chainIdConvertor": () => (chainIdConvertor), - "decodeAddressRep": () => (decodeAddressRep), - "default": () => (utils), - "deserializeTransaction": () => (deserializeTransaction), - "encodeAddressRep": () => (encodeAddressRep), - "fromWei": () => (fromWei), - "getAuthorization": () => (getAuthorization), - "getValueOfUnit": () => (getValueOfUnit), - "isBigNumber": () => (isBigNumber), - "isBoolean": () => (isBoolean), - "isFunction": () => (isFunction), - "isJson": () => (isJson), - "isObject": () => (isObject), - "isString": () => (isString), - "noop": () => (noop), - "padLeft": () => (padLeft), - "padRight": () => (padRight), - "setPath": () => (setPath), - "toBigNumber": () => (toBigNumber), - "toTwosComplement": () => (toTwosComplement), - "toWei": () => (toWei), - "uint8ArrayToHex": () => (uint8ArrayToHex), - "unpackSpecifiedTypeData": () => (unpackSpecifiedTypeData) -}); - -// NAMESPACE OBJECT: ./src/util/proto.js -var proto_namespaceObject = {}; -__webpack_require__.r(proto_namespaceObject); -__webpack_require__.d(proto_namespaceObject, { - "Address": () => (Address), - "Hash": () => (Hash), - "ResourceTokenCharged": () => (ResourceTokenCharged), - "Transaction": () => (Transaction), - "TransactionFeeCharged": () => (TransactionFeeCharged), - "__GetDependency__": () => (proto_get_), - "__ResetDependency__": () => (proto_reset_), - "__RewireAPI__": () => (proto_RewireAPI_), - "__Rewire__": () => (proto_set_), - "__get__": () => (proto_get_), - "__set__": () => (proto_set_), - "arrayBufferToHex": () => (proto_arrayBufferToHex), - "coreRootProto": () => (coreRootProto), - "default": () => (proto), - "encodeTransaction": () => (encodeTransaction), - "getAddressFromRep": () => (getAddressFromRep), - "getAddressObjectFromRep": () => (getAddressObjectFromRep), - "getFee": () => (getFee), - "getHashFromHex": () => (getHashFromHex), - "getHashObjectFromHex": () => (getHashObjectFromHex), - "getRepForAddress": () => (getRepForAddress), - "getRepForHash": () => (getRepForHash), - "getResourceFee": () => (getResourceFee), - "getSerializedDataFromLog": () => (getSerializedDataFromLog), - "getTransaction": () => (getTransaction), - "getTransactionFee": () => (getTransactionFee) -}); - -// NAMESPACE OBJECT: ./src/util/bloom.js -var bloom_namespaceObject = {}; -__webpack_require__.r(bloom_namespaceObject); -__webpack_require__.d(bloom_namespaceObject, { - "__GetDependency__": () => (bloom_get_), - "__ResetDependency__": () => (bloom_reset_), - "__RewireAPI__": () => (bloom_RewireAPI_), - "__Rewire__": () => (bloom_set_), - "__get__": () => (bloom_get_), - "__set__": () => (bloom_set_), - "default": () => (bloom), - "isAddressInBloom": () => (isAddressInBloom), - "isEventInBloom": () => (isEventInBloom), - "isInBloom": () => (isInBloom), - "isIndexedInBloom": () => (isIndexedInBloom) -}); - -// NAMESPACE OBJECT: ./src/util/merkleTree.js -var merkleTree_namespaceObject = {}; -__webpack_require__.r(merkleTree_namespaceObject); -__webpack_require__.d(merkleTree_namespaceObject, { - "__GetDependency__": () => (merkleTree_get_), - "__ResetDependency__": () => (merkleTree_reset_), - "__RewireAPI__": () => (merkleTree_RewireAPI_), - "__Rewire__": () => (merkleTree_set_), - "__get__": () => (merkleTree_get_), - "__set__": () => (merkleTree_set_), - "computeRoot": () => (computeRoot), - "default": () => (merkleTree), - "getMerklePath": () => (getMerklePath), - "node": () => (node) -}); - -// NAMESPACE OBJECT: ./src/util/keyStore.js -var keyStore_namespaceObject = {}; -__webpack_require__.r(keyStore_namespaceObject); -__webpack_require__.d(keyStore_namespaceObject, { - "__GetDependency__": () => (keyStore_get_), - "__ResetDependency__": () => (keyStore_reset_), - "__RewireAPI__": () => (keyStore_RewireAPI_), - "__Rewire__": () => (keyStore_set_), - "__get__": () => (keyStore_get_), - "__set__": () => (keyStore_set_), - "checkPassword": () => (checkPassword), - "default": () => (keyStore), - "getKeystore": () => (getKeystore), - "unlockKeystore": () => (unlockKeystore) -}); - -// EXTERNAL MODULE: ./node_modules/@aelfqueen/protobufjs/light.js -var light = __webpack_require__(146); -;// CONCATENATED MODULE: ./node_modules/tslib/tslib.es6.mjs -/****************************************************************************** -Copyright (c) Microsoft Corporation. - -Permission to use, copy, modify, and/or distribute this software for any -purpose with or without fee is hereby granted. - -THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH -REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY -AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, -INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM -LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR -OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR -PERFORMANCE OF THIS SOFTWARE. -***************************************************************************** */ -/* global Reflect, Promise, SuppressedError, Symbol */ - -var extendStatics = function(d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; }; - return extendStatics(d, b); -}; - -function __extends(d, b) { - if (typeof b !== "function" && b !== null) - throw new TypeError("Class extends value " + String(b) + " is not a constructor or null"); - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); -} - -var __assign = function() { - __assign = Object.assign || function __assign(t) { - for (var s, i = 1, n = arguments.length; i < n; i++) { - s = arguments[i]; - for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p]; - } - return t; - } - return __assign.apply(this, arguments); -} - -function __rest(s, e) { - var t = {}; - for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) - t[p] = s[p]; - if (s != null && typeof Object.getOwnPropertySymbols === "function") - for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) { - if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i])) - t[p[i]] = s[p[i]]; - } - return t; -} - -function __decorate(decorators, target, key, desc) { - var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d; - if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc); - else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r; - return c > 3 && r && Object.defineProperty(target, key, r), r; -} - -function __param(paramIndex, decorator) { - return function (target, key) { decorator(target, key, paramIndex); } -} - -function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) { - function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; } - var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value"; - var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null; - var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {}); - var _, done = false; - for (var i = decorators.length - 1; i >= 0; i--) { - var context = {}; - for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p]; - for (var p in contextIn.access) context.access[p] = contextIn.access[p]; - context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); }; - var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context); - if (kind === "accessor") { - if (result === void 0) continue; - if (result === null || typeof result !== "object") throw new TypeError("Object expected"); - if (_ = accept(result.get)) descriptor.get = _; - if (_ = accept(result.set)) descriptor.set = _; - if (_ = accept(result.init)) initializers.unshift(_); - } - else if (_ = accept(result)) { - if (kind === "field") initializers.unshift(_); - else descriptor[key] = _; - } - } - if (target) Object.defineProperty(target, contextIn.name, descriptor); - done = true; -}; - -function __runInitializers(thisArg, initializers, value) { - var useValue = arguments.length > 2; - for (var i = 0; i < initializers.length; i++) { - value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg); - } - return useValue ? value : void 0; -}; - -function __propKey(x) { - return typeof x === "symbol" ? x : "".concat(x); -}; - -function __setFunctionName(f, name, prefix) { - if (typeof name === "symbol") name = name.description ? "[".concat(name.description, "]") : ""; - return Object.defineProperty(f, "name", { configurable: true, value: prefix ? "".concat(prefix, " ", name) : name }); -}; - -function __metadata(metadataKey, metadataValue) { - if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(metadataKey, metadataValue); -} - -function __awaiter(thisArg, _arguments, P, generator) { - function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); } - return new (P || (P = Promise))(function (resolve, reject) { - function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } } - function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } } - function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } - step((generator = generator.apply(thisArg, _arguments || [])).next()); - }); -} - -function __generator(thisArg, body) { - var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g; - return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; - function verb(n) { return function (v) { return step([n, v]); }; } - function step(op) { - if (f) throw new TypeError("Generator is already executing."); - while (g && (g = 0, op[0] && (_ = 0)), _) try { - if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; - if (y = 0, t) op = [op[0] & 2, t.value]; - switch (op[0]) { - case 0: case 1: t = op; break; - case 4: _.label++; return { value: op[1], done: false }; - case 5: _.label++; y = op[1]; op = [0]; continue; - case 7: op = _.ops.pop(); _.trys.pop(); continue; - default: - if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; } - if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; } - if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; } - if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; } - if (t[2]) _.ops.pop(); - _.trys.pop(); continue; - } - op = body.call(thisArg, _); - } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; } - if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true }; - } -} - -var __createBinding = Object.create ? (function(o, m, k, k2) { - if (k2 === undefined) k2 = k; - var desc = Object.getOwnPropertyDescriptor(m, k); - if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) { - desc = { enumerable: true, get: function() { return m[k]; } }; - } - Object.defineProperty(o, k2, desc); -}) : (function(o, m, k, k2) { - if (k2 === undefined) k2 = k; - o[k2] = m[k]; -}); - -function __exportStar(m, o) { - for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p); -} - -function __values(o) { - var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0; - if (m) return m.call(o); - if (o && typeof o.length === "number") return { - next: function () { - if (o && i >= o.length) o = void 0; - return { value: o && o[i++], done: !o }; - } - }; - throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined."); -} - -function __read(o, n) { - var m = typeof Symbol === "function" && o[Symbol.iterator]; - if (!m) return o; - var i = m.call(o), r, ar = [], e; - try { - while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value); - } - catch (error) { e = { error: error }; } - finally { - try { - if (r && !r.done && (m = i["return"])) m.call(i); - } - finally { if (e) throw e.error; } - } - return ar; -} - -/** @deprecated */ -function __spread() { - for (var ar = [], i = 0; i < arguments.length; i++) - ar = ar.concat(__read(arguments[i])); - return ar; -} - -/** @deprecated */ -function __spreadArrays() { - for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length; - for (var r = Array(s), k = 0, i = 0; i < il; i++) - for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++) - r[k] = a[j]; - return r; -} - -function __spreadArray(to, from, pack) { - if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) { - if (ar || !(i in from)) { - if (!ar) ar = Array.prototype.slice.call(from, 0, i); - ar[i] = from[i]; - } - } - return to.concat(ar || Array.prototype.slice.call(from)); -} - -function __await(v) { - return this instanceof __await ? (this.v = v, this) : new __await(v); -} - -function __asyncGenerator(thisArg, _arguments, generator) { - if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined."); - var g = generator.apply(thisArg, _arguments || []), i, q = []; - return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i; - function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; } - function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } } - function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); } - function fulfill(value) { resume("next", value); } - function reject(value) { resume("throw", value); } - function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); } -} - -function __asyncDelegator(o) { - var i, p; - return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i; - function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; } -} - -function __asyncValues(o) { - if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined."); - var m = o[Symbol.asyncIterator], i; - return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i); - function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; } - function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); } -} - -function __makeTemplateObject(cooked, raw) { - if (Object.defineProperty) { Object.defineProperty(cooked, "raw", { value: raw }); } else { cooked.raw = raw; } - return cooked; -}; - -var __setModuleDefault = Object.create ? (function(o, v) { - Object.defineProperty(o, "default", { enumerable: true, value: v }); -}) : function(o, v) { - o["default"] = v; -}; - -function __importStar(mod) { - if (mod && mod.__esModule) return mod; - var result = {}; - if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k); - __setModuleDefault(result, mod); - return result; -} - -function __importDefault(mod) { - return (mod && mod.__esModule) ? mod : { default: mod }; -} - -function __classPrivateFieldGet(receiver, state, kind, f) { - if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter"); - if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it"); - return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver); -} - -function __classPrivateFieldSet(receiver, state, value, kind, f) { - if (kind === "m") throw new TypeError("Private method is not writable"); - if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter"); - if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it"); - return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value; -} - -function __classPrivateFieldIn(state, receiver) { - if (receiver === null || (typeof receiver !== "object" && typeof receiver !== "function")) throw new TypeError("Cannot use 'in' operator on non-object"); - return typeof state === "function" ? receiver === state : state.has(receiver); -} - -function __addDisposableResource(env, value, async) { - if (value !== null && value !== void 0) { - if (typeof value !== "object" && typeof value !== "function") throw new TypeError("Object expected."); - var dispose; - if (async) { - if (!Symbol.asyncDispose) throw new TypeError("Symbol.asyncDispose is not defined."); - dispose = value[Symbol.asyncDispose]; - } - if (dispose === void 0) { - if (!Symbol.dispose) throw new TypeError("Symbol.dispose is not defined."); - dispose = value[Symbol.dispose]; - } - if (typeof dispose !== "function") throw new TypeError("Object not disposable."); - env.stack.push({ value: value, dispose: dispose, async: async }); - } - else if (async) { - env.stack.push({ async: true }); - } - return value; -} - -var _SuppressedError = typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) { - var e = new Error(message); - return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e; -}; - -function __disposeResources(env) { - function fail(e) { - env.error = env.hasError ? new _SuppressedError(e, env.error, "An error was suppressed during disposal.") : e; - env.hasError = true; - } - function next() { - while (env.stack.length) { - var rec = env.stack.pop(); - try { - var result = rec.dispose && rec.dispose.call(rec.value); - if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); }); - } - catch (e) { - fail(e); - } - } - if (env.hasError) throw env.error; - } - return next(); -} - -/* harmony default export */ const tslib_es6 = ({ - __extends, - __assign, - __rest, - __decorate, - __param, - __metadata, - __awaiter, - __generator, - __createBinding, - __exportStar, - __values, - __read, - __spread, - __spreadArrays, - __spreadArray, - __await, - __asyncGenerator, - __asyncDelegator, - __asyncValues, - __makeTemplateObject, - __importStar, - __importDefault, - __classPrivateFieldGet, - __classPrivateFieldSet, - __classPrivateFieldIn, - __addDisposableResource, - __disposeResources, -}); - -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/sha256-js/build/module/constants.js -/** - * @internal - */ -var BLOCK_SIZE = 64; -/** - * @internal - */ -var DIGEST_LENGTH = 32; -/** - * @internal - */ -var KEY = new Uint32Array([ - 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 -]); -/** - * @internal - */ -var INIT = [ - 0x6a09e667, - 0xbb67ae85, - 0x3c6ef372, - 0xa54ff53a, - 0x510e527f, - 0x9b05688c, - 0x1f83d9ab, - 0x5be0cd19 -]; -/** - * @internal - */ -var MAX_HASHABLE_LENGTH = Math.pow(2, 53) - 1; -//# sourceMappingURL=constants.js.map -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/sha256-js/build/module/RawSha256.js - -/** - * @internal - */ -var RawSha256 = /** @class */ (function () { - function RawSha256() { - this.state = Int32Array.from(INIT); - this.temp = new Int32Array(64); - this.buffer = new Uint8Array(64); - this.bufferLength = 0; - this.bytesHashed = 0; - /** - * @internal - */ - this.finished = false; - } - RawSha256.prototype.update = function (data) { - if (this.finished) { - throw new Error("Attempted to update an already finished hash."); - } - var position = 0; - var byteLength = data.byteLength; - this.bytesHashed += byteLength; - if (this.bytesHashed * 8 > MAX_HASHABLE_LENGTH) { - throw new Error("Cannot hash more than 2^53 - 1 bits"); - } - while (byteLength > 0) { - this.buffer[this.bufferLength++] = data[position++]; - byteLength--; - if (this.bufferLength === BLOCK_SIZE) { - this.hashBuffer(); - this.bufferLength = 0; - } - } - }; - RawSha256.prototype.digest = function () { - if (!this.finished) { - var bitsHashed = this.bytesHashed * 8; - var bufferView = new DataView(this.buffer.buffer, this.buffer.byteOffset, this.buffer.byteLength); - var undecoratedLength = this.bufferLength; - bufferView.setUint8(this.bufferLength++, 0x80); - // Ensure the final block has enough room for the hashed length - if (undecoratedLength % BLOCK_SIZE >= BLOCK_SIZE - 8) { - for (var i = this.bufferLength; i < BLOCK_SIZE; i++) { - bufferView.setUint8(i, 0); - } - this.hashBuffer(); - this.bufferLength = 0; - } - for (var i = this.bufferLength; i < BLOCK_SIZE - 8; i++) { - bufferView.setUint8(i, 0); - } - bufferView.setUint32(BLOCK_SIZE - 8, Math.floor(bitsHashed / 0x100000000), true); - bufferView.setUint32(BLOCK_SIZE - 4, bitsHashed); - this.hashBuffer(); - this.finished = true; - } - // The value in state is little-endian rather than big-endian, so flip - // each word into a new Uint8Array - var out = new Uint8Array(DIGEST_LENGTH); - for (var i = 0; i < 8; i++) { - out[i * 4] = (this.state[i] >>> 24) & 0xff; - out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff; - out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff; - out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff; - } - return out; - }; - RawSha256.prototype.hashBuffer = function () { - var _a = this, buffer = _a.buffer, state = _a.state; - var state0 = state[0], state1 = state[1], state2 = state[2], state3 = state[3], state4 = state[4], state5 = state[5], state6 = state[6], state7 = state[7]; - for (var i = 0; i < BLOCK_SIZE; i++) { - if (i < 16) { - this.temp[i] = - ((buffer[i * 4] & 0xff) << 24) | - ((buffer[i * 4 + 1] & 0xff) << 16) | - ((buffer[i * 4 + 2] & 0xff) << 8) | - (buffer[i * 4 + 3] & 0xff); - } - else { - var u = this.temp[i - 2]; - var t1_1 = ((u >>> 17) | (u << 15)) ^ ((u >>> 19) | (u << 13)) ^ (u >>> 10); - u = this.temp[i - 15]; - var t2_1 = ((u >>> 7) | (u << 25)) ^ ((u >>> 18) | (u << 14)) ^ (u >>> 3); - this.temp[i] = - ((t1_1 + this.temp[i - 7]) | 0) + ((t2_1 + this.temp[i - 16]) | 0); - } - var t1 = ((((((state4 >>> 6) | (state4 << 26)) ^ - ((state4 >>> 11) | (state4 << 21)) ^ - ((state4 >>> 25) | (state4 << 7))) + - ((state4 & state5) ^ (~state4 & state6))) | - 0) + - ((state7 + ((KEY[i] + this.temp[i]) | 0)) | 0)) | - 0; - var t2 = ((((state0 >>> 2) | (state0 << 30)) ^ - ((state0 >>> 13) | (state0 << 19)) ^ - ((state0 >>> 22) | (state0 << 10))) + - ((state0 & state1) ^ (state0 & state2) ^ (state1 & state2))) | - 0; - state7 = state6; - state6 = state5; - state5 = state4; - state4 = (state3 + t1) | 0; - state3 = state2; - state2 = state1; - state1 = state0; - state0 = (t1 + t2) | 0; - } - state[0] += state0; - state[1] += state1; - state[2] += state2; - state[3] += state3; - state[4] += state4; - state[5] += state5; - state[6] += state6; - state[7] += state7; - }; - return RawSha256; -}()); - -//# sourceMappingURL=RawSha256.js.map -// EXTERNAL MODULE: external "buffer" -var external_buffer_ = __webpack_require__(10); -;// CONCATENATED MODULE: ./node_modules/@smithy/util-buffer-from/dist-es/index.js - - -const dist_es_fromArrayBuffer = (input, offset = 0, length = input.byteLength - offset) => { - if (!isArrayBuffer(input)) { - throw new TypeError(`The "input" argument must be ArrayBuffer. Received type ${typeof input} (${input})`); - } - return Buffer.from(input, offset, length); -}; -const fromString = (input, encoding) => { - if (typeof input !== "string") { - throw new TypeError(`The "input" argument must be of type string. Received type ${typeof input} (${input})`); - } - return encoding ? external_buffer_.Buffer.from(input, encoding) : external_buffer_.Buffer.from(input); -}; - -;// CONCATENATED MODULE: ./node_modules/@smithy/util-utf8/dist-es/fromUtf8.js - -const fromUtf8_fromUtf8 = (input) => { - const buf = fromString(input, "utf8"); - return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength / Uint8Array.BYTES_PER_ELEMENT); -}; - -;// CONCATENATED MODULE: ./node_modules/@smithy/util-utf8/dist-es/toUint8Array.js - -const toUint8Array = (data) => { - if (typeof data === "string") { - return fromUtf8(data); - } - if (ArrayBuffer.isView(data)) { - return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT); - } - return new Uint8Array(data); -}; - -;// CONCATENATED MODULE: ./node_modules/@smithy/util-utf8/dist-es/toUtf8.js - -const toUtf8 = (input) => fromArrayBuffer(input.buffer, input.byteOffset, input.byteLength).toString("utf8"); - -;// CONCATENATED MODULE: ./node_modules/@smithy/util-utf8/dist-es/index.js - - - - -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/util/build/module/convertToBuffer.js -// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved. -// SPDX-License-Identifier: Apache-2.0 - -// Quick polyfill -var convertToBuffer_fromUtf8 = typeof Buffer !== "undefined" && Buffer.from - ? function (input) { return Buffer.from(input, "utf8"); } - : fromUtf8_fromUtf8; -function convertToBuffer(data) { - // Already a Uint8, do nothing - if (data instanceof Uint8Array) - return data; - if (typeof data === "string") { - return convertToBuffer_fromUtf8(data); - } - if (ArrayBuffer.isView(data)) { - return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT); - } - return new Uint8Array(data); -} -//# sourceMappingURL=convertToBuffer.js.map -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/util/build/module/isEmptyData.js -// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved. -// SPDX-License-Identifier: Apache-2.0 -function isEmptyData(data) { - if (typeof data === "string") { - return data.length === 0; - } - return data.byteLength === 0; -} -//# sourceMappingURL=isEmptyData.js.map -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/util/build/module/index.js -// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved. -// SPDX-License-Identifier: Apache-2.0 - - - - -//# sourceMappingURL=index.js.map -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/sha256-js/build/module/jsSha256.js - - - - -var Sha256 = /** @class */ (function () { - function Sha256(secret) { - this.secret = secret; - this.hash = new RawSha256(); - this.reset(); - } - Sha256.prototype.update = function (toHash) { - if (isEmptyData(toHash) || this.error) { - return; - } - try { - this.hash.update(convertToBuffer(toHash)); - } - catch (e) { - this.error = e; - } - }; - /* This synchronous method keeps compatibility - * with the v2 aws-sdk. - */ - Sha256.prototype.digestSync = function () { - if (this.error) { - throw this.error; - } - if (this.outer) { - if (!this.outer.finished) { - this.outer.update(this.hash.digest()); - } - return this.outer.digest(); - } - return this.hash.digest(); - }; - /* The underlying digest method here is synchronous. - * To keep the same interface with the other hash functions - * the default is to expose this as an async method. - * However, it can sometimes be useful to have a sync method. - */ - Sha256.prototype.digest = function () { - return __awaiter(this, void 0, void 0, function () { - return __generator(this, function (_a) { - return [2 /*return*/, this.digestSync()]; - }); - }); - }; - Sha256.prototype.reset = function () { - this.hash = new RawSha256(); - if (this.secret) { - this.outer = new RawSha256(); - var inner = bufferFromSecret(this.secret); - var outer = new Uint8Array(BLOCK_SIZE); - outer.set(inner); - for (var i = 0; i < BLOCK_SIZE; i++) { - inner[i] ^= 0x36; - outer[i] ^= 0x5c; - } - this.hash.update(inner); - this.outer.update(outer); - // overwrite the copied key in memory - for (var i = 0; i < inner.byteLength; i++) { - inner[i] = 0; - } - } - }; - return Sha256; -}()); - -function bufferFromSecret(secret) { - var input = convertToBuffer(secret); - if (input.byteLength > BLOCK_SIZE) { - var bufferHash = new RawSha256(); - bufferHash.update(input); - input = bufferHash.digest(); - } - var buffer = new Uint8Array(BLOCK_SIZE); - buffer.set(input); - return buffer; -} -//# sourceMappingURL=jsSha256.js.map -;// CONCATENATED MODULE: ./node_modules/@aws-crypto/sha256-js/build/module/index.js - -//# sourceMappingURL=index.js.map -;// CONCATENATED MODULE: ./src/util/sha256.js - -const sha256 = value => { - const hexStr = value; - const hash = new (_get__("Sha256"))(); - hash.update(hexStr); - const hashUint8Array = hash.digestSync(); - return Buffer.from(hashUint8Array).toString('hex'); -}; -/* harmony default export */ const util_sha256 = (_get__("sha256")); -function _getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var _RewireModuleId__ = null; -function _getRewireModuleId__() { - if (_RewireModuleId__ === null) { - let globalVariable = _getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - _RewireModuleId__ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return _RewireModuleId__; -} -function _getRewireRegistry__() { - let theGlobalVariable = _getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function _getRewiredData__() { - let moduleId = _getRewireModuleId__(); - let registry = _getRewireRegistry__(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = _getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let _RewireAPI__ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(_RewireAPI__, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', _get__); - addPropertyToAPIObject('__GetDependency__', _get__); - addPropertyToAPIObject('__Rewire__', _set__); - addPropertyToAPIObject('__set__', _set__); - addPropertyToAPIObject('__reset__', _reset__); - addPropertyToAPIObject('__ResetDependency__', _reset__); - addPropertyToAPIObject('__with__', _with__); -})(); -function _get__(variableName) { - let rewireData = _getRewiredData__(); - if (rewireData[variableName] === undefined) { - return _get_original__(variableName); - } else { - var value = rewireData[variableName]; - if (value === INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function _get_original__(variableName) { - switch (variableName) { - case "Sha256": - return Sha256; - case "sha256": - return sha256; - } - return undefined; -} -function _assign__(variableName, value) { - let rewireData = _getRewiredData__(); - if (rewireData[variableName] === undefined) { - return _set_original__(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function _set_original__(variableName, _value) { - switch (variableName) {} - return undefined; -} -function _update_operation__(operation, variableName, prefix) { - var oldValue = _get__(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - _assign__(variableName, newValue); - return prefix ? newValue : oldValue; -} -function _set__(variableName, value) { - let rewireData = _getRewiredData__(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - _reset__(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - _reset__(variableName); - }; - } -} -function _reset__(variableName) { - let rewireData = _getRewiredData__(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete _getRewireRegistry__()[_getRewireModuleId__]; - } - ; -} -function _with__(object) { - let rewireData = _getRewiredData__(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let _typeOfOriginalExport = typeof sha256; -function addNonEnumerableProperty(name, value) { - Object.defineProperty(sha256, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((_typeOfOriginalExport === 'object' || _typeOfOriginalExport === 'function') && Object.isExtensible(sha256)) { - addNonEnumerableProperty('__get__', _get__); - addNonEnumerableProperty('__GetDependency__', _get__); - addNonEnumerableProperty('__Rewire__', _set__); - addNonEnumerableProperty('__set__', _set__); - addNonEnumerableProperty('__reset__', _reset__); - addNonEnumerableProperty('__ResetDependency__', _reset__); - addNonEnumerableProperty('__with__', _with__); - addNonEnumerableProperty('__RewireAPI__', _RewireAPI__); -} - -;// CONCATENATED MODULE: ./proto/core.proto.json -const core_proto_namespaceObject = JSON.parse('{"nested":{"Transaction":{"fields":{"from":{"type":"Address","id":1},"to":{"type":"Address","id":2},"refBlockNumber":{"type":"int64","id":3},"refBlockPrefix":{"type":"bytes","id":4},"methodName":{"type":"string","id":5},"params":{"type":"bytes","id":6},"signature":{"type":"bytes","id":10000}}},"Address":{"fields":{"value":{"type":"bytes","id":1}}},"Hash":{"fields":{"value":{"type":"bytes","id":1}}},"MerklePath":{"fields":{"merklePathNodes":{"rule":"repeated","type":"MerklePathNode","id":1}}},"MerklePathNode":{"fields":{"hash":{"type":"Hash","id":1},"isLeftChildNode":{"type":"bool","id":2}}},"BinaryMerkleTree":{"fields":{"nodes":{"rule":"repeated","type":"Hash","id":1},"root":{"type":"Hash","id":2},"leafCount":{"type":"int32","id":3}}},"TransactionFeeCharged":{"fields":{"symbol":{"type":"string","id":1},"amount":{"type":"int64","id":2}}},"ResourceTokenCharged":{"fields":{"symbol":{"type":"string","id":1},"amount":{"type":"int64","id":2},"contractAddress":{"type":"Address","id":3}}},"ResourceTokenOwned":{"fields":{"symbol":{"type":"string","id":1},"amount":{"type":"int64","id":2}}},"google":{"nested":{"protobuf":{"nested":{"Timestamp":{"fields":{"seconds":{"type":"int64","id":1},"nanos":{"type":"int32","id":2}}}}}}}}}'); -;// CONCATENATED MODULE: ./node_modules/bignumber.js/bignumber.mjs -/* - * bignumber.js v9.1.1 - * A JavaScript library for arbitrary-precision arithmetic. - * https://github.com/MikeMcl/bignumber.js - * Copyright (c) 2022 Michael Mclaughlin - * MIT Licensed. - * - * BigNumber.prototype methods | BigNumber methods - * | - * absoluteValue abs | clone - * comparedTo | config set - * decimalPlaces dp | DECIMAL_PLACES - * dividedBy div | ROUNDING_MODE - * dividedToIntegerBy idiv | EXPONENTIAL_AT - * exponentiatedBy pow | RANGE - * integerValue | CRYPTO - * isEqualTo eq | MODULO_MODE - * isFinite | POW_PRECISION - * isGreaterThan gt | FORMAT - * isGreaterThanOrEqualTo gte | ALPHABET - * isInteger | isBigNumber - * isLessThan lt | maximum max - * isLessThanOrEqualTo lte | minimum min - * isNaN | random - * isNegative | sum - * isPositive | - * isZero | - * minus | - * modulo mod | - * multipliedBy times | - * negated | - * plus | - * precision sd | - * shiftedBy | - * squareRoot sqrt | - * toExponential | - * toFixed | - * toFormat | - * toFraction | - * toJSON | - * toNumber | - * toPrecision | - * toString | - * valueOf | - * - */ - - -var - isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, - mathceil = Math.ceil, - mathfloor = Math.floor, - - bignumberError = '[BigNumber Error] ', - tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ', - - BASE = 1e14, - LOG_BASE = 14, - MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1 - // MAX_INT32 = 0x7fffffff, // 2^31 - 1 - POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], - SQRT_BASE = 1e7, - - // EDITABLE - // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and - // the arguments to toExponential, toFixed, toFormat, and toPrecision. - MAX = 1E9; // 0 to MAX_INT32 - - -/* - * Create and return a BigNumber constructor. - */ -function clone(configObject) { - var div, convertBase, parseNumeric, - P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null }, - ONE = new BigNumber(1), - - - //----------------------------- EDITABLE CONFIG DEFAULTS ------------------------------- - - - // The default values below must be integers within the inclusive ranges stated. - // The values can also be changed at run-time using BigNumber.set. - - // The maximum number of decimal places for operations involving division. - DECIMAL_PLACES = 20, // 0 to MAX - - // The rounding mode used when rounding to the above decimal places, and when using - // toExponential, toFixed, toFormat and toPrecision, and round (default value). - // UP 0 Away from zero. - // DOWN 1 Towards zero. - // CEIL 2 Towards +Infinity. - // FLOOR 3 Towards -Infinity. - // HALF_UP 4 Towards nearest neighbour. If equidistant, up. - // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down. - // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour. - // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity. - // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity. - ROUNDING_MODE = 4, // 0 to 8 - - // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS] - - // The exponent value at and beneath which toString returns exponential notation. - // Number type: -7 - TO_EXP_NEG = -7, // 0 to -MAX - - // The exponent value at and above which toString returns exponential notation. - // Number type: 21 - TO_EXP_POS = 21, // 0 to MAX - - // RANGE : [MIN_EXP, MAX_EXP] - - // The minimum exponent value, beneath which underflow to zero occurs. - // Number type: -324 (5e-324) - MIN_EXP = -1e7, // -1 to -MAX - - // The maximum exponent value, above which overflow to Infinity occurs. - // Number type: 308 (1.7976931348623157e+308) - // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow. - MAX_EXP = 1e7, // 1 to MAX - - // Whether to use cryptographically-secure random number generation, if available. - CRYPTO = false, // true or false - - // The modulo mode used when calculating the modulus: a mod n. - // The quotient (q = a / n) is calculated according to the corresponding rounding mode. - // The remainder (r) is calculated as: r = a - n * q. - // - // UP 0 The remainder is positive if the dividend is negative, else is negative. - // DOWN 1 The remainder has the same sign as the dividend. - // This modulo mode is commonly known as 'truncated division' and is - // equivalent to (a % n) in JavaScript. - // FLOOR 3 The remainder has the same sign as the divisor (Python %). - // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function. - // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). - // The remainder is always positive. - // - // The truncated division, floored division, Euclidian division and IEEE 754 remainder - // modes are commonly used for the modulus operation. - // Although the other rounding modes can also be used, they may not give useful results. - MODULO_MODE = 1, // 0 to 9 - - // The maximum number of significant digits of the result of the exponentiatedBy operation. - // If POW_PRECISION is 0, there will be unlimited significant digits. - POW_PRECISION = 0, // 0 to MAX - - // The format specification used by the BigNumber.prototype.toFormat method. - FORMAT = { - prefix: '', - groupSize: 3, - secondaryGroupSize: 0, - groupSeparator: ',', - decimalSeparator: '.', - fractionGroupSize: 0, - fractionGroupSeparator: '\xA0', // non-breaking space - suffix: '' - }, - - // The alphabet used for base conversion. It must be at least 2 characters long, with no '+', - // '-', '.', whitespace, or repeated character. - // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_' - ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz', - alphabetHasNormalDecimalDigits = true; - - - //------------------------------------------------------------------------------------------ - - - // CONSTRUCTOR - - - /* - * The BigNumber constructor and exported function. - * Create and return a new instance of a BigNumber object. - * - * v {number|string|BigNumber} A numeric value. - * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive. - */ - function BigNumber(v, b) { - var alphabet, c, caseChanged, e, i, isNum, len, str, - x = this; - - // Enable constructor call without `new`. - if (!(x instanceof BigNumber)) return new BigNumber(v, b); - - if (b == null) { - - if (v && v._isBigNumber === true) { - x.s = v.s; - - if (!v.c || v.e > MAX_EXP) { - x.c = x.e = null; - } else if (v.e < MIN_EXP) { - x.c = [x.e = 0]; - } else { - x.e = v.e; - x.c = v.c.slice(); - } - - return; - } - - if ((isNum = typeof v == 'number') && v * 0 == 0) { - - // Use `1 / n` to handle minus zero also. - x.s = 1 / v < 0 ? (v = -v, -1) : 1; - - // Fast path for integers, where n < 2147483648 (2**31). - if (v === ~~v) { - for (e = 0, i = v; i >= 10; i /= 10, e++); - - if (e > MAX_EXP) { - x.c = x.e = null; - } else { - x.e = e; - x.c = [v]; - } - - return; - } - - str = String(v); - } else { - - if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum); - - x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1; - } - - // Decimal point? - if ((e = str.indexOf('.')) > -1) str = str.replace('.', ''); - - // Exponential form? - if ((i = str.search(/e/i)) > 0) { - - // Determine exponent. - if (e < 0) e = i; - e += +str.slice(i + 1); - str = str.substring(0, i); - } else if (e < 0) { - - // Integer. - e = str.length; - } - - } else { - - // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}' - intCheck(b, 2, ALPHABET.length, 'Base'); - - // Allow exponential notation to be used with base 10 argument, while - // also rounding to DECIMAL_PLACES as with other bases. - if (b == 10 && alphabetHasNormalDecimalDigits) { - x = new BigNumber(v); - return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE); - } - - str = String(v); - - if (isNum = typeof v == 'number') { - - // Avoid potential interpretation of Infinity and NaN as base 44+ values. - if (v * 0 != 0) return parseNumeric(x, str, isNum, b); - - x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1; - - // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}' - if (BigNumber.DEBUG && str.replace(/^0\.0*|\./, '').length > 15) { - throw Error - (tooManyDigits + v); - } - } else { - x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1; - } - - alphabet = ALPHABET.slice(0, b); - e = i = 0; - - // Check that str is a valid base b number. - // Don't use RegExp, so alphabet can contain special characters. - for (len = str.length; i < len; i++) { - if (alphabet.indexOf(c = str.charAt(i)) < 0) { - if (c == '.') { - - // If '.' is not the first character and it has not be found before. - if (i > e) { - e = len; - continue; - } - } else if (!caseChanged) { - - // Allow e.g. hexadecimal 'FF' as well as 'ff'. - if (str == str.toUpperCase() && (str = str.toLowerCase()) || - str == str.toLowerCase() && (str = str.toUpperCase())) { - caseChanged = true; - i = -1; - e = 0; - continue; - } - } - - return parseNumeric(x, String(v), isNum, b); - } - } - - // Prevent later check for length on converted number. - isNum = false; - str = convertBase(str, b, 10, x.s); - - // Decimal point? - if ((e = str.indexOf('.')) > -1) str = str.replace('.', ''); - else e = str.length; - } - - // Determine leading zeros. - for (i = 0; str.charCodeAt(i) === 48; i++); - - // Determine trailing zeros. - for (len = str.length; str.charCodeAt(--len) === 48;); - - if (str = str.slice(i, ++len)) { - len -= i; - - // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}' - if (isNum && BigNumber.DEBUG && - len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) { - throw Error - (tooManyDigits + (x.s * v)); - } - - // Overflow? - if ((e = e - i - 1) > MAX_EXP) { - - // Infinity. - x.c = x.e = null; - - // Underflow? - } else if (e < MIN_EXP) { - - // Zero. - x.c = [x.e = 0]; - } else { - x.e = e; - x.c = []; - - // Transform base - - // e is the base 10 exponent. - // i is where to slice str to get the first element of the coefficient array. - i = (e + 1) % LOG_BASE; - if (e < 0) i += LOG_BASE; // i < 1 - - if (i < len) { - if (i) x.c.push(+str.slice(0, i)); - - for (len -= LOG_BASE; i < len;) { - x.c.push(+str.slice(i, i += LOG_BASE)); - } - - i = LOG_BASE - (str = str.slice(i)).length; - } else { - i -= len; - } - - for (; i--; str += '0'); - x.c.push(+str); - } - } else { - - // Zero. - x.c = [x.e = 0]; - } - } - - - // CONSTRUCTOR PROPERTIES - - - BigNumber.clone = clone; - - BigNumber.ROUND_UP = 0; - BigNumber.ROUND_DOWN = 1; - BigNumber.ROUND_CEIL = 2; - BigNumber.ROUND_FLOOR = 3; - BigNumber.ROUND_HALF_UP = 4; - BigNumber.ROUND_HALF_DOWN = 5; - BigNumber.ROUND_HALF_EVEN = 6; - BigNumber.ROUND_HALF_CEIL = 7; - BigNumber.ROUND_HALF_FLOOR = 8; - BigNumber.EUCLID = 9; - - - /* - * Configure infrequently-changing library-wide settings. - * - * Accept an object with the following optional properties (if the value of a property is - * a number, it must be an integer within the inclusive range stated): - * - * DECIMAL_PLACES {number} 0 to MAX - * ROUNDING_MODE {number} 0 to 8 - * EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX] - * RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX] - * CRYPTO {boolean} true or false - * MODULO_MODE {number} 0 to 9 - * POW_PRECISION {number} 0 to MAX - * ALPHABET {string} A string of two or more unique characters which does - * not contain '.'. - * FORMAT {object} An object with some of the following properties: - * prefix {string} - * groupSize {number} - * secondaryGroupSize {number} - * groupSeparator {string} - * decimalSeparator {string} - * fractionGroupSize {number} - * fractionGroupSeparator {string} - * suffix {string} - * - * (The values assigned to the above FORMAT object properties are not checked for validity.) - * - * E.g. - * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 }) - * - * Ignore properties/parameters set to null or undefined, except for ALPHABET. - * - * Return an object with the properties current values. - */ - BigNumber.config = BigNumber.set = function (obj) { - var p, v; - - if (obj != null) { - - if (typeof obj == 'object') { - - // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive. - // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}' - if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) { - v = obj[p]; - intCheck(v, 0, MAX, p); - DECIMAL_PLACES = v; - } - - // ROUNDING_MODE {number} Integer, 0 to 8 inclusive. - // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}' - if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) { - v = obj[p]; - intCheck(v, 0, 8, p); - ROUNDING_MODE = v; - } - - // EXPONENTIAL_AT {number|number[]} - // Integer, -MAX to MAX inclusive or - // [integer -MAX to 0 inclusive, 0 to MAX inclusive]. - // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}' - if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) { - v = obj[p]; - if (v && v.pop) { - intCheck(v[0], -MAX, 0, p); - intCheck(v[1], 0, MAX, p); - TO_EXP_NEG = v[0]; - TO_EXP_POS = v[1]; - } else { - intCheck(v, -MAX, MAX, p); - TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v); - } - } - - // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or - // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive]. - // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}' - if (obj.hasOwnProperty(p = 'RANGE')) { - v = obj[p]; - if (v && v.pop) { - intCheck(v[0], -MAX, -1, p); - intCheck(v[1], 1, MAX, p); - MIN_EXP = v[0]; - MAX_EXP = v[1]; - } else { - intCheck(v, -MAX, MAX, p); - if (v) { - MIN_EXP = -(MAX_EXP = v < 0 ? -v : v); - } else { - throw Error - (bignumberError + p + ' cannot be zero: ' + v); - } - } - } - - // CRYPTO {boolean} true or false. - // '[BigNumber Error] CRYPTO not true or false: {v}' - // '[BigNumber Error] crypto unavailable' - if (obj.hasOwnProperty(p = 'CRYPTO')) { - v = obj[p]; - if (v === !!v) { - if (v) { - if (typeof crypto != 'undefined' && crypto && - (crypto.getRandomValues || crypto.randomBytes)) { - CRYPTO = v; - } else { - CRYPTO = !v; - throw Error - (bignumberError + 'crypto unavailable'); - } - } else { - CRYPTO = v; - } - } else { - throw Error - (bignumberError + p + ' not true or false: ' + v); - } - } - - // MODULO_MODE {number} Integer, 0 to 9 inclusive. - // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}' - if (obj.hasOwnProperty(p = 'MODULO_MODE')) { - v = obj[p]; - intCheck(v, 0, 9, p); - MODULO_MODE = v; - } - - // POW_PRECISION {number} Integer, 0 to MAX inclusive. - // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}' - if (obj.hasOwnProperty(p = 'POW_PRECISION')) { - v = obj[p]; - intCheck(v, 0, MAX, p); - POW_PRECISION = v; - } - - // FORMAT {object} - // '[BigNumber Error] FORMAT not an object: {v}' - if (obj.hasOwnProperty(p = 'FORMAT')) { - v = obj[p]; - if (typeof v == 'object') FORMAT = v; - else throw Error - (bignumberError + p + ' not an object: ' + v); - } - - // ALPHABET {string} - // '[BigNumber Error] ALPHABET invalid: {v}' - if (obj.hasOwnProperty(p = 'ALPHABET')) { - v = obj[p]; - - // Disallow if less than two characters, - // or if it contains '+', '-', '.', whitespace, or a repeated character. - if (typeof v == 'string' && !/^.?$|[+\-.\s]|(.).*\1/.test(v)) { - alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789'; - ALPHABET = v; - } else { - throw Error - (bignumberError + p + ' invalid: ' + v); - } - } - - } else { - - // '[BigNumber Error] Object expected: {v}' - throw Error - (bignumberError + 'Object expected: ' + obj); - } - } - - return { - DECIMAL_PLACES: DECIMAL_PLACES, - ROUNDING_MODE: ROUNDING_MODE, - EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS], - RANGE: [MIN_EXP, MAX_EXP], - CRYPTO: CRYPTO, - MODULO_MODE: MODULO_MODE, - POW_PRECISION: POW_PRECISION, - FORMAT: FORMAT, - ALPHABET: ALPHABET - }; - }; - - - /* - * Return true if v is a BigNumber instance, otherwise return false. - * - * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed. - * - * v {any} - * - * '[BigNumber Error] Invalid BigNumber: {v}' - */ - BigNumber.isBigNumber = function (v) { - if (!v || v._isBigNumber !== true) return false; - if (!BigNumber.DEBUG) return true; - - var i, n, - c = v.c, - e = v.e, - s = v.s; - - out: if ({}.toString.call(c) == '[object Array]') { - - if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) { - - // If the first element is zero, the BigNumber value must be zero. - if (c[0] === 0) { - if (e === 0 && c.length === 1) return true; - break out; - } - - // Calculate number of digits that c[0] should have, based on the exponent. - i = (e + 1) % LOG_BASE; - if (i < 1) i += LOG_BASE; - - // Calculate number of digits of c[0]. - //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) { - if (String(c[0]).length == i) { - - for (i = 0; i < c.length; i++) { - n = c[i]; - if (n < 0 || n >= BASE || n !== mathfloor(n)) break out; - } - - // Last element cannot be zero, unless it is the only element. - if (n !== 0) return true; - } - } - - // Infinity/NaN - } else if (c === null && e === null && (s === null || s === 1 || s === -1)) { - return true; - } - - throw Error - (bignumberError + 'Invalid BigNumber: ' + v); - }; - - - /* - * Return a new BigNumber whose value is the maximum of the arguments. - * - * arguments {number|string|BigNumber} - */ - BigNumber.maximum = BigNumber.max = function () { - return maxOrMin(arguments, P.lt); - }; - - - /* - * Return a new BigNumber whose value is the minimum of the arguments. - * - * arguments {number|string|BigNumber} - */ - BigNumber.minimum = BigNumber.min = function () { - return maxOrMin(arguments, P.gt); - }; - - - /* - * Return a new BigNumber with a random value equal to or greater than 0 and less than 1, - * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing - * zeros are produced). - * - * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}' - * '[BigNumber Error] crypto unavailable' - */ - BigNumber.random = (function () { - var pow2_53 = 0x20000000000000; - - // Return a 53 bit integer n, where 0 <= n < 9007199254740992. - // Check if Math.random() produces more than 32 bits of randomness. - // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits. - // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1. - var random53bitInt = (Math.random() * pow2_53) & 0x1fffff - ? function () { return mathfloor(Math.random() * pow2_53); } - : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) + - (Math.random() * 0x800000 | 0); }; - - return function (dp) { - var a, b, e, k, v, - i = 0, - c = [], - rand = new BigNumber(ONE); - - if (dp == null) dp = DECIMAL_PLACES; - else intCheck(dp, 0, MAX); - - k = mathceil(dp / LOG_BASE); - - if (CRYPTO) { - - // Browsers supporting crypto.getRandomValues. - if (crypto.getRandomValues) { - - a = crypto.getRandomValues(new Uint32Array(k *= 2)); - - for (; i < k;) { - - // 53 bits: - // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2) - // 11111 11111111 11111111 11111111 11100000 00000000 00000000 - // ((Math.pow(2, 32) - 1) >>> 11).toString(2) - // 11111 11111111 11111111 - // 0x20000 is 2^21. - v = a[i] * 0x20000 + (a[i + 1] >>> 11); - - // Rejection sampling: - // 0 <= v < 9007199254740992 - // Probability that v >= 9e15, is - // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251 - if (v >= 9e15) { - b = crypto.getRandomValues(new Uint32Array(2)); - a[i] = b[0]; - a[i + 1] = b[1]; - } else { - - // 0 <= v <= 8999999999999999 - // 0 <= (v % 1e14) <= 99999999999999 - c.push(v % 1e14); - i += 2; - } - } - i = k / 2; - - // Node.js supporting crypto.randomBytes. - } else if (crypto.randomBytes) { - - // buffer - a = crypto.randomBytes(k *= 7); - - for (; i < k;) { - - // 0x1000000000000 is 2^48, 0x10000000000 is 2^40 - // 0x100000000 is 2^32, 0x1000000 is 2^24 - // 11111 11111111 11111111 11111111 11111111 11111111 11111111 - // 0 <= v < 9007199254740992 - v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) + - (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) + - (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6]; - - if (v >= 9e15) { - crypto.randomBytes(7).copy(a, i); - } else { - - // 0 <= (v % 1e14) <= 99999999999999 - c.push(v % 1e14); - i += 7; - } - } - i = k / 7; - } else { - CRYPTO = false; - throw Error - (bignumberError + 'crypto unavailable'); - } - } - - // Use Math.random. - if (!CRYPTO) { - - for (; i < k;) { - v = random53bitInt(); - if (v < 9e15) c[i++] = v % 1e14; - } - } - - k = c[--i]; - dp %= LOG_BASE; - - // Convert trailing digits to zeros according to dp. - if (k && dp) { - v = POWS_TEN[LOG_BASE - dp]; - c[i] = mathfloor(k / v) * v; - } - - // Remove trailing elements which are zero. - for (; c[i] === 0; c.pop(), i--); - - // Zero? - if (i < 0) { - c = [e = 0]; - } else { - - // Remove leading elements which are zero and adjust exponent accordingly. - for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE); - - // Count the digits of the first element of c to determine leading zeros, and... - for (i = 1, v = c[0]; v >= 10; v /= 10, i++); - - // adjust the exponent accordingly. - if (i < LOG_BASE) e -= LOG_BASE - i; - } - - rand.e = e; - rand.c = c; - return rand; - }; - })(); - - - /* - * Return a BigNumber whose value is the sum of the arguments. - * - * arguments {number|string|BigNumber} - */ - BigNumber.sum = function () { - var i = 1, - args = arguments, - sum = new BigNumber(args[0]); - for (; i < args.length;) sum = sum.plus(args[i++]); - return sum; - }; - - - // PRIVATE FUNCTIONS - - - // Called by BigNumber and BigNumber.prototype.toString. - convertBase = (function () { - var decimal = '0123456789'; - - /* - * Convert string of baseIn to an array of numbers of baseOut. - * Eg. toBaseOut('255', 10, 16) returns [15, 15]. - * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5]. - */ - function toBaseOut(str, baseIn, baseOut, alphabet) { - var j, - arr = [0], - arrL, - i = 0, - len = str.length; - - for (; i < len;) { - for (arrL = arr.length; arrL--; arr[arrL] *= baseIn); - - arr[0] += alphabet.indexOf(str.charAt(i++)); - - for (j = 0; j < arr.length; j++) { - - if (arr[j] > baseOut - 1) { - if (arr[j + 1] == null) arr[j + 1] = 0; - arr[j + 1] += arr[j] / baseOut | 0; - arr[j] %= baseOut; - } - } - } - - return arr.reverse(); - } - - // Convert a numeric string of baseIn to a numeric string of baseOut. - // If the caller is toString, we are converting from base 10 to baseOut. - // If the caller is BigNumber, we are converting from baseIn to base 10. - return function (str, baseIn, baseOut, sign, callerIsToString) { - var alphabet, d, e, k, r, x, xc, y, - i = str.indexOf('.'), - dp = DECIMAL_PLACES, - rm = ROUNDING_MODE; - - // Non-integer. - if (i >= 0) { - k = POW_PRECISION; - - // Unlimited precision. - POW_PRECISION = 0; - str = str.replace('.', ''); - y = new BigNumber(baseIn); - x = y.pow(str.length - i); - POW_PRECISION = k; - - // Convert str as if an integer, then restore the fraction part by dividing the - // result by its base raised to a power. - - y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'), - 10, baseOut, decimal); - y.e = y.c.length; - } - - // Convert the number as integer. - - xc = toBaseOut(str, baseIn, baseOut, callerIsToString - ? (alphabet = ALPHABET, decimal) - : (alphabet = decimal, ALPHABET)); - - // xc now represents str as an integer and converted to baseOut. e is the exponent. - e = k = xc.length; - - // Remove trailing zeros. - for (; xc[--k] == 0; xc.pop()); - - // Zero? - if (!xc[0]) return alphabet.charAt(0); - - // Does str represent an integer? If so, no need for the division. - if (i < 0) { - --e; - } else { - x.c = xc; - x.e = e; - - // The sign is needed for correct rounding. - x.s = sign; - x = div(x, y, dp, rm, baseOut); - xc = x.c; - r = x.r; - e = x.e; - } - - // xc now represents str converted to baseOut. - - // THe index of the rounding digit. - d = e + dp + 1; - - // The rounding digit: the digit to the right of the digit that may be rounded up. - i = xc[d]; - - // Look at the rounding digits and mode to determine whether to round up. - - k = baseOut / 2; - r = r || d < 0 || xc[d + 1] != null; - - r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) - : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 || - rm == (x.s < 0 ? 8 : 7)); - - // If the index of the rounding digit is not greater than zero, or xc represents - // zero, then the result of the base conversion is zero or, if rounding up, a value - // such as 0.00001. - if (d < 1 || !xc[0]) { - - // 1^-dp or 0 - str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0); - } else { - - // Truncate xc to the required number of decimal places. - xc.length = d; - - // Round up? - if (r) { - - // Rounding up may mean the previous digit has to be rounded up and so on. - for (--baseOut; ++xc[--d] > baseOut;) { - xc[d] = 0; - - if (!d) { - ++e; - xc = [1].concat(xc); - } - } - } - - // Determine trailing zeros. - for (k = xc.length; !xc[--k];); - - // E.g. [4, 11, 15] becomes 4bf. - for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++])); - - // Add leading zeros, decimal point and trailing zeros as required. - str = toFixedPoint(str, e, alphabet.charAt(0)); - } - - // The caller will add the sign. - return str; - }; - })(); - - - // Perform division in the specified base. Called by div and convertBase. - div = (function () { - - // Assume non-zero x and k. - function multiply(x, k, base) { - var m, temp, xlo, xhi, - carry = 0, - i = x.length, - klo = k % SQRT_BASE, - khi = k / SQRT_BASE | 0; - - for (x = x.slice(); i--;) { - xlo = x[i] % SQRT_BASE; - xhi = x[i] / SQRT_BASE | 0; - m = khi * xlo + xhi * klo; - temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry; - carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi; - x[i] = temp % base; - } - - if (carry) x = [carry].concat(x); - - return x; - } - - function compare(a, b, aL, bL) { - var i, cmp; - - if (aL != bL) { - cmp = aL > bL ? 1 : -1; - } else { - - for (i = cmp = 0; i < aL; i++) { - - if (a[i] != b[i]) { - cmp = a[i] > b[i] ? 1 : -1; - break; - } - } - } - - return cmp; - } - - function subtract(a, b, aL, base) { - var i = 0; - - // Subtract b from a. - for (; aL--;) { - a[aL] -= i; - i = a[aL] < b[aL] ? 1 : 0; - a[aL] = i * base + a[aL] - b[aL]; - } - - // Remove leading zeros. - for (; !a[0] && a.length > 1; a.splice(0, 1)); - } - - // x: dividend, y: divisor. - return function (x, y, dp, rm, base) { - var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0, - yL, yz, - s = x.s == y.s ? 1 : -1, - xc = x.c, - yc = y.c; - - // Either NaN, Infinity or 0? - if (!xc || !xc[0] || !yc || !yc[0]) { - - return new BigNumber( - - // Return NaN if either NaN, or both Infinity or 0. - !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN : - - // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0. - xc && xc[0] == 0 || !yc ? s * 0 : s / 0 - ); - } - - q = new BigNumber(s); - qc = q.c = []; - e = x.e - y.e; - s = dp + e + 1; - - if (!base) { - base = BASE; - e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE); - s = s / LOG_BASE | 0; - } - - // Result exponent may be one less then the current value of e. - // The coefficients of the BigNumbers from convertBase may have trailing zeros. - for (i = 0; yc[i] == (xc[i] || 0); i++); - - if (yc[i] > (xc[i] || 0)) e--; - - if (s < 0) { - qc.push(1); - more = true; - } else { - xL = xc.length; - yL = yc.length; - i = 0; - s += 2; - - // Normalise xc and yc so highest order digit of yc is >= base / 2. - - n = mathfloor(base / (yc[0] + 1)); - - // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1. - // if (n > 1 || n++ == 1 && yc[0] < base / 2) { - if (n > 1) { - yc = multiply(yc, n, base); - xc = multiply(xc, n, base); - yL = yc.length; - xL = xc.length; - } - - xi = yL; - rem = xc.slice(0, yL); - remL = rem.length; - - // Add zeros to make remainder as long as divisor. - for (; remL < yL; rem[remL++] = 0); - yz = yc.slice(); - yz = [0].concat(yz); - yc0 = yc[0]; - if (yc[1] >= base / 2) yc0++; - // Not necessary, but to prevent trial digit n > base, when using base 3. - // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15; - - do { - n = 0; - - // Compare divisor and remainder. - cmp = compare(yc, rem, yL, remL); - - // If divisor < remainder. - if (cmp < 0) { - - // Calculate trial digit, n. - - rem0 = rem[0]; - if (yL != remL) rem0 = rem0 * base + (rem[1] || 0); - - // n is how many times the divisor goes into the current remainder. - n = mathfloor(rem0 / yc0); - - // Algorithm: - // product = divisor multiplied by trial digit (n). - // Compare product and remainder. - // If product is greater than remainder: - // Subtract divisor from product, decrement trial digit. - // Subtract product from remainder. - // If product was less than remainder at the last compare: - // Compare new remainder and divisor. - // If remainder is greater than divisor: - // Subtract divisor from remainder, increment trial digit. - - if (n > 1) { - - // n may be > base only when base is 3. - if (n >= base) n = base - 1; - - // product = divisor * trial digit. - prod = multiply(yc, n, base); - prodL = prod.length; - remL = rem.length; - - // Compare product and remainder. - // If product > remainder then trial digit n too high. - // n is 1 too high about 5% of the time, and is not known to have - // ever been more than 1 too high. - while (compare(prod, rem, prodL, remL) == 1) { - n--; - - // Subtract divisor from product. - subtract(prod, yL < prodL ? yz : yc, prodL, base); - prodL = prod.length; - cmp = 1; - } - } else { - - // n is 0 or 1, cmp is -1. - // If n is 0, there is no need to compare yc and rem again below, - // so change cmp to 1 to avoid it. - // If n is 1, leave cmp as -1, so yc and rem are compared again. - if (n == 0) { - - // divisor < remainder, so n must be at least 1. - cmp = n = 1; - } - - // product = divisor - prod = yc.slice(); - prodL = prod.length; - } - - if (prodL < remL) prod = [0].concat(prod); - - // Subtract product from remainder. - subtract(rem, prod, remL, base); - remL = rem.length; - - // If product was < remainder. - if (cmp == -1) { - - // Compare divisor and new remainder. - // If divisor < new remainder, subtract divisor from remainder. - // Trial digit n too low. - // n is 1 too low about 5% of the time, and very rarely 2 too low. - while (compare(yc, rem, yL, remL) < 1) { - n++; - - // Subtract divisor from remainder. - subtract(rem, yL < remL ? yz : yc, remL, base); - remL = rem.length; - } - } - } else if (cmp === 0) { - n++; - rem = [0]; - } // else cmp === 1 and n will be 0 - - // Add the next digit, n, to the result array. - qc[i++] = n; - - // Update the remainder. - if (rem[0]) { - rem[remL++] = xc[xi] || 0; - } else { - rem = [xc[xi]]; - remL = 1; - } - } while ((xi++ < xL || rem[0] != null) && s--); - - more = rem[0] != null; - - // Leading zero? - if (!qc[0]) qc.splice(0, 1); - } - - if (base == BASE) { - - // To calculate q.e, first get the number of digits of qc[0]. - for (i = 1, s = qc[0]; s >= 10; s /= 10, i++); - - round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more); - - // Caller is convertBase. - } else { - q.e = e; - q.r = +more; - } - - return q; - }; - })(); - - - /* - * Return a string representing the value of BigNumber n in fixed-point or exponential - * notation rounded to the specified decimal places or significant digits. - * - * n: a BigNumber. - * i: the index of the last digit required (i.e. the digit that may be rounded up). - * rm: the rounding mode. - * id: 1 (toExponential) or 2 (toPrecision). - */ - function format(n, i, rm, id) { - var c0, e, ne, len, str; - - if (rm == null) rm = ROUNDING_MODE; - else intCheck(rm, 0, 8); - - if (!n.c) return n.toString(); - - c0 = n.c[0]; - ne = n.e; - - if (i == null) { - str = coeffToString(n.c); - str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS) - ? toExponential(str, ne) - : toFixedPoint(str, ne, '0'); - } else { - n = round(new BigNumber(n), i, rm); - - // n.e may have changed if the value was rounded up. - e = n.e; - - str = coeffToString(n.c); - len = str.length; - - // toPrecision returns exponential notation if the number of significant digits - // specified is less than the number of digits necessary to represent the integer - // part of the value in fixed-point notation. - - // Exponential notation. - if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) { - - // Append zeros? - for (; len < i; str += '0', len++); - str = toExponential(str, e); - - // Fixed-point notation. - } else { - i -= ne; - str = toFixedPoint(str, e, '0'); - - // Append zeros? - if (e + 1 > len) { - if (--i > 0) for (str += '.'; i--; str += '0'); - } else { - i += e - len; - if (i > 0) { - if (e + 1 == len) str += '.'; - for (; i--; str += '0'); - } - } - } - } - - return n.s < 0 && c0 ? '-' + str : str; - } - - - // Handle BigNumber.max and BigNumber.min. - function maxOrMin(args, method) { - var n, - i = 1, - m = new BigNumber(args[0]); - - for (; i < args.length; i++) { - n = new BigNumber(args[i]); - - // If any number is NaN, return NaN. - if (!n.s) { - m = n; - break; - } else if (method.call(m, n)) { - m = n; - } - } - - return m; - } - - - /* - * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP. - * Called by minus, plus and times. - */ - function normalise(n, c, e) { - var i = 1, - j = c.length; - - // Remove trailing zeros. - for (; !c[--j]; c.pop()); - - // Calculate the base 10 exponent. First get the number of digits of c[0]. - for (j = c[0]; j >= 10; j /= 10, i++); - - // Overflow? - if ((e = i + e * LOG_BASE - 1) > MAX_EXP) { - - // Infinity. - n.c = n.e = null; - - // Underflow? - } else if (e < MIN_EXP) { - - // Zero. - n.c = [n.e = 0]; - } else { - n.e = e; - n.c = c; - } - - return n; - } - - - // Handle values that fail the validity test in BigNumber. - parseNumeric = (function () { - var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i, - dotAfter = /^([^.]+)\.$/, - dotBefore = /^\.([^.]+)$/, - isInfinityOrNaN = /^-?(Infinity|NaN)$/, - whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g; - - return function (x, str, isNum, b) { - var base, - s = isNum ? str : str.replace(whitespaceOrPlus, ''); - - // No exception on ±Infinity or NaN. - if (isInfinityOrNaN.test(s)) { - x.s = isNaN(s) ? null : s < 0 ? -1 : 1; - } else { - if (!isNum) { - - // basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i - s = s.replace(basePrefix, function (m, p1, p2) { - base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8; - return !b || b == base ? p1 : m; - }); - - if (b) { - base = b; - - // E.g. '1.' to '1', '.1' to '0.1' - s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1'); - } - - if (str != s) return new BigNumber(s, base); - } - - // '[BigNumber Error] Not a number: {n}' - // '[BigNumber Error] Not a base {b} number: {n}' - if (BigNumber.DEBUG) { - throw Error - (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str); - } - - // NaN - x.s = null; - } - - x.c = x.e = null; - } - })(); - - - /* - * Round x to sd significant digits using rounding mode rm. Check for over/under-flow. - * If r is truthy, it is known that there are more digits after the rounding digit. - */ - function round(x, sd, rm, r) { - var d, i, j, k, n, ni, rd, - xc = x.c, - pows10 = POWS_TEN; - - // if x is not Infinity or NaN... - if (xc) { - - // rd is the rounding digit, i.e. the digit after the digit that may be rounded up. - // n is a base 1e14 number, the value of the element of array x.c containing rd. - // ni is the index of n within x.c. - // d is the number of digits of n. - // i is the index of rd within n including leading zeros. - // j is the actual index of rd within n (if < 0, rd is a leading zero). - out: { - - // Get the number of digits of the first element of xc. - for (d = 1, k = xc[0]; k >= 10; k /= 10, d++); - i = sd - d; - - // If the rounding digit is in the first element of xc... - if (i < 0) { - i += LOG_BASE; - j = sd; - n = xc[ni = 0]; - - // Get the rounding digit at index j of n. - rd = n / pows10[d - j - 1] % 10 | 0; - } else { - ni = mathceil((i + 1) / LOG_BASE); - - if (ni >= xc.length) { - - if (r) { - - // Needed by sqrt. - for (; xc.length <= ni; xc.push(0)); - n = rd = 0; - d = 1; - i %= LOG_BASE; - j = i - LOG_BASE + 1; - } else { - break out; - } - } else { - n = k = xc[ni]; - - // Get the number of digits of n. - for (d = 1; k >= 10; k /= 10, d++); - - // Get the index of rd within n. - i %= LOG_BASE; - - // Get the index of rd within n, adjusted for leading zeros. - // The number of leading zeros of n is given by LOG_BASE - d. - j = i - LOG_BASE + d; - - // Get the rounding digit at index j of n. - rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0; - } - } - - r = r || sd < 0 || - - // Are there any non-zero digits after the rounding digit? - // The expression n % pows10[d - j - 1] returns all digits of n to the right - // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714. - xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]); - - r = rm < 4 - ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) - : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 && - - // Check whether the digit to the left of the rounding digit is odd. - ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 || - rm == (x.s < 0 ? 8 : 7)); - - if (sd < 1 || !xc[0]) { - xc.length = 0; - - if (r) { - - // Convert sd to decimal places. - sd -= x.e + 1; - - // 1, 0.1, 0.01, 0.001, 0.0001 etc. - xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE]; - x.e = -sd || 0; - } else { - - // Zero. - xc[0] = x.e = 0; - } - - return x; - } - - // Remove excess digits. - if (i == 0) { - xc.length = ni; - k = 1; - ni--; - } else { - xc.length = ni + 1; - k = pows10[LOG_BASE - i]; - - // E.g. 56700 becomes 56000 if 7 is the rounding digit. - // j > 0 means i > number of leading zeros of n. - xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0; - } - - // Round up? - if (r) { - - for (; ;) { - - // If the digit to be rounded up is in the first element of xc... - if (ni == 0) { - - // i will be the length of xc[0] before k is added. - for (i = 1, j = xc[0]; j >= 10; j /= 10, i++); - j = xc[0] += k; - for (k = 1; j >= 10; j /= 10, k++); - - // if i != k the length has increased. - if (i != k) { - x.e++; - if (xc[0] == BASE) xc[0] = 1; - } - - break; - } else { - xc[ni] += k; - if (xc[ni] != BASE) break; - xc[ni--] = 0; - k = 1; - } - } - } - - // Remove trailing zeros. - for (i = xc.length; xc[--i] === 0; xc.pop()); - } - - // Overflow? Infinity. - if (x.e > MAX_EXP) { - x.c = x.e = null; - - // Underflow? Zero. - } else if (x.e < MIN_EXP) { - x.c = [x.e = 0]; - } - } - - return x; - } - - - function valueOf(n) { - var str, - e = n.e; - - if (e === null) return n.toString(); - - str = coeffToString(n.c); - - str = e <= TO_EXP_NEG || e >= TO_EXP_POS - ? toExponential(str, e) - : toFixedPoint(str, e, '0'); - - return n.s < 0 ? '-' + str : str; - } - - - // PROTOTYPE/INSTANCE METHODS - - - /* - * Return a new BigNumber whose value is the absolute value of this BigNumber. - */ - P.absoluteValue = P.abs = function () { - var x = new BigNumber(this); - if (x.s < 0) x.s = 1; - return x; - }; - - - /* - * Return - * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b), - * -1 if the value of this BigNumber is less than the value of BigNumber(y, b), - * 0 if they have the same value, - * or null if the value of either is NaN. - */ - P.comparedTo = function (y, b) { - return compare(this, new BigNumber(y, b)); - }; - - - /* - * If dp is undefined or null or true or false, return the number of decimal places of the - * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN. - * - * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this - * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or - * ROUNDING_MODE if rm is omitted. - * - * [dp] {number} Decimal places: integer, 0 to MAX inclusive. - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' - */ - P.decimalPlaces = P.dp = function (dp, rm) { - var c, n, v, - x = this; - - if (dp != null) { - intCheck(dp, 0, MAX); - if (rm == null) rm = ROUNDING_MODE; - else intCheck(rm, 0, 8); - - return round(new BigNumber(x), dp + x.e + 1, rm); - } - - if (!(c = x.c)) return null; - n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE; - - // Subtract the number of trailing zeros of the last number. - if (v = c[v]) for (; v % 10 == 0; v /= 10, n--); - if (n < 0) n = 0; - - return n; - }; - - - /* - * n / 0 = I - * n / N = N - * n / I = 0 - * 0 / n = 0 - * 0 / 0 = N - * 0 / N = N - * 0 / I = 0 - * N / n = N - * N / 0 = N - * N / N = N - * N / I = N - * I / n = I - * I / 0 = I - * I / N = N - * I / I = N - * - * Return a new BigNumber whose value is the value of this BigNumber divided by the value of - * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE. - */ - P.dividedBy = P.div = function (y, b) { - return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE); - }; - - - /* - * Return a new BigNumber whose value is the integer part of dividing the value of this - * BigNumber by the value of BigNumber(y, b). - */ - P.dividedToIntegerBy = P.idiv = function (y, b) { - return div(this, new BigNumber(y, b), 0, 1); - }; - - - /* - * Return a BigNumber whose value is the value of this BigNumber exponentiated by n. - * - * If m is present, return the result modulo m. - * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE. - * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE. - * - * The modular power operation works efficiently when x, n, and m are integers, otherwise it - * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0. - * - * n {number|string|BigNumber} The exponent. An integer. - * [m] {number|string|BigNumber} The modulus. - * - * '[BigNumber Error] Exponent not an integer: {n}' - */ - P.exponentiatedBy = P.pow = function (n, m) { - var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y, - x = this; - - n = new BigNumber(n); - - // Allow NaN and ±Infinity, but not other non-integers. - if (n.c && !n.isInteger()) { - throw Error - (bignumberError + 'Exponent not an integer: ' + valueOf(n)); - } - - if (m != null) m = new BigNumber(m); - - // Exponent of MAX_SAFE_INTEGER is 15. - nIsBig = n.e > 14; - - // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0. - if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) { - - // The sign of the result of pow when x is negative depends on the evenness of n. - // If +n overflows to ±Infinity, the evenness of n would be not be known. - y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n))); - return m ? y.mod(m) : y; - } - - nIsNeg = n.s < 0; - - if (m) { - - // x % m returns NaN if abs(m) is zero, or m is NaN. - if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN); - - isModExp = !nIsNeg && x.isInteger() && m.isInteger(); - - if (isModExp) x = x.mod(m); - - // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15. - // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15. - } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0 - // [1, 240000000] - ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7 - // [80000000000000] [99999750000000] - : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) { - - // If x is negative and n is odd, k = -0, else k = 0. - k = x.s < 0 && isOdd(n) ? -0 : 0; - - // If x >= 1, k = ±Infinity. - if (x.e > -1) k = 1 / k; - - // If n is negative return ±0, else return ±Infinity. - return new BigNumber(nIsNeg ? 1 / k : k); - - } else if (POW_PRECISION) { - - // Truncating each coefficient array to a length of k after each multiplication - // equates to truncating significant digits to POW_PRECISION + [28, 41], - // i.e. there will be a minimum of 28 guard digits retained. - k = mathceil(POW_PRECISION / LOG_BASE + 2); - } - - if (nIsBig) { - half = new BigNumber(0.5); - if (nIsNeg) n.s = 1; - nIsOdd = isOdd(n); - } else { - i = Math.abs(+valueOf(n)); - nIsOdd = i % 2; - } - - y = new BigNumber(ONE); - - // Performs 54 loop iterations for n of 9007199254740991. - for (; ;) { - - if (nIsOdd) { - y = y.times(x); - if (!y.c) break; - - if (k) { - if (y.c.length > k) y.c.length = k; - } else if (isModExp) { - y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m)); - } - } - - if (i) { - i = mathfloor(i / 2); - if (i === 0) break; - nIsOdd = i % 2; - } else { - n = n.times(half); - round(n, n.e + 1, 1); - - if (n.e > 14) { - nIsOdd = isOdd(n); - } else { - i = +valueOf(n); - if (i === 0) break; - nIsOdd = i % 2; - } - } - - x = x.times(x); - - if (k) { - if (x.c && x.c.length > k) x.c.length = k; - } else if (isModExp) { - x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m)); - } - } - - if (isModExp) return y; - if (nIsNeg) y = ONE.div(y); - - return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y; - }; - - - /* - * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer - * using rounding mode rm, or ROUNDING_MODE if rm is omitted. - * - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}' - */ - P.integerValue = function (rm) { - var n = new BigNumber(this); - if (rm == null) rm = ROUNDING_MODE; - else intCheck(rm, 0, 8); - return round(n, n.e + 1, rm); - }; - - - /* - * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b), - * otherwise return false. - */ - P.isEqualTo = P.eq = function (y, b) { - return compare(this, new BigNumber(y, b)) === 0; - }; - - - /* - * Return true if the value of this BigNumber is a finite number, otherwise return false. - */ - P.isFinite = function () { - return !!this.c; - }; - - - /* - * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b), - * otherwise return false. - */ - P.isGreaterThan = P.gt = function (y, b) { - return compare(this, new BigNumber(y, b)) > 0; - }; - - - /* - * Return true if the value of this BigNumber is greater than or equal to the value of - * BigNumber(y, b), otherwise return false. - */ - P.isGreaterThanOrEqualTo = P.gte = function (y, b) { - return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0; - - }; - - - /* - * Return true if the value of this BigNumber is an integer, otherwise return false. - */ - P.isInteger = function () { - return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2; - }; - - - /* - * Return true if the value of this BigNumber is less than the value of BigNumber(y, b), - * otherwise return false. - */ - P.isLessThan = P.lt = function (y, b) { - return compare(this, new BigNumber(y, b)) < 0; - }; - - - /* - * Return true if the value of this BigNumber is less than or equal to the value of - * BigNumber(y, b), otherwise return false. - */ - P.isLessThanOrEqualTo = P.lte = function (y, b) { - return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0; - }; - - - /* - * Return true if the value of this BigNumber is NaN, otherwise return false. - */ - P.isNaN = function () { - return !this.s; - }; - - - /* - * Return true if the value of this BigNumber is negative, otherwise return false. - */ - P.isNegative = function () { - return this.s < 0; - }; - - - /* - * Return true if the value of this BigNumber is positive, otherwise return false. - */ - P.isPositive = function () { - return this.s > 0; - }; - - - /* - * Return true if the value of this BigNumber is 0 or -0, otherwise return false. - */ - P.isZero = function () { - return !!this.c && this.c[0] == 0; - }; - - - /* - * n - 0 = n - * n - N = N - * n - I = -I - * 0 - n = -n - * 0 - 0 = 0 - * 0 - N = N - * 0 - I = -I - * N - n = N - * N - 0 = N - * N - N = N - * N - I = N - * I - n = I - * I - 0 = I - * I - N = N - * I - I = N - * - * Return a new BigNumber whose value is the value of this BigNumber minus the value of - * BigNumber(y, b). - */ - P.minus = function (y, b) { - var i, j, t, xLTy, - x = this, - a = x.s; - - y = new BigNumber(y, b); - b = y.s; - - // Either NaN? - if (!a || !b) return new BigNumber(NaN); - - // Signs differ? - if (a != b) { - y.s = -b; - return x.plus(y); - } - - var xe = x.e / LOG_BASE, - ye = y.e / LOG_BASE, - xc = x.c, - yc = y.c; - - if (!xe || !ye) { - - // Either Infinity? - if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN); - - // Either zero? - if (!xc[0] || !yc[0]) { - - // Return y if y is non-zero, x if x is non-zero, or zero if both are zero. - return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x : - - // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity - ROUNDING_MODE == 3 ? -0 : 0); - } - } - - xe = bitFloor(xe); - ye = bitFloor(ye); - xc = xc.slice(); - - // Determine which is the bigger number. - if (a = xe - ye) { - - if (xLTy = a < 0) { - a = -a; - t = xc; - } else { - ye = xe; - t = yc; - } - - t.reverse(); - - // Prepend zeros to equalise exponents. - for (b = a; b--; t.push(0)); - t.reverse(); - } else { - - // Exponents equal. Check digit by digit. - j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b; - - for (a = b = 0; b < j; b++) { - - if (xc[b] != yc[b]) { - xLTy = xc[b] < yc[b]; - break; - } - } - } - - // x < y? Point xc to the array of the bigger number. - if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s; - - b = (j = yc.length) - (i = xc.length); - - // Append zeros to xc if shorter. - // No need to add zeros to yc if shorter as subtract only needs to start at yc.length. - if (b > 0) for (; b--; xc[i++] = 0); - b = BASE - 1; - - // Subtract yc from xc. - for (; j > a;) { - - if (xc[--j] < yc[j]) { - for (i = j; i && !xc[--i]; xc[i] = b); - --xc[i]; - xc[j] += BASE; - } - - xc[j] -= yc[j]; - } - - // Remove leading zeros and adjust exponent accordingly. - for (; xc[0] == 0; xc.splice(0, 1), --ye); - - // Zero? - if (!xc[0]) { - - // Following IEEE 754 (2008) 6.3, - // n - n = +0 but n - n = -0 when rounding towards -Infinity. - y.s = ROUNDING_MODE == 3 ? -1 : 1; - y.c = [y.e = 0]; - return y; - } - - // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity - // for finite x and y. - return normalise(y, xc, ye); - }; - - - /* - * n % 0 = N - * n % N = N - * n % I = n - * 0 % n = 0 - * -0 % n = -0 - * 0 % 0 = N - * 0 % N = N - * 0 % I = 0 - * N % n = N - * N % 0 = N - * N % N = N - * N % I = N - * I % n = N - * I % 0 = N - * I % N = N - * I % I = N - * - * Return a new BigNumber whose value is the value of this BigNumber modulo the value of - * BigNumber(y, b). The result depends on the value of MODULO_MODE. - */ - P.modulo = P.mod = function (y, b) { - var q, s, - x = this; - - y = new BigNumber(y, b); - - // Return NaN if x is Infinity or NaN, or y is NaN or zero. - if (!x.c || !y.s || y.c && !y.c[0]) { - return new BigNumber(NaN); - - // Return x if y is Infinity or x is zero. - } else if (!y.c || x.c && !x.c[0]) { - return new BigNumber(x); - } - - if (MODULO_MODE == 9) { - - // Euclidian division: q = sign(y) * floor(x / abs(y)) - // r = x - qy where 0 <= r < abs(y) - s = y.s; - y.s = 1; - q = div(x, y, 0, 3); - y.s = s; - q.s *= s; - } else { - q = div(x, y, 0, MODULO_MODE); - } - - y = x.minus(q.times(y)); - - // To match JavaScript %, ensure sign of zero is sign of dividend. - if (!y.c[0] && MODULO_MODE == 1) y.s = x.s; - - return y; - }; - - - /* - * n * 0 = 0 - * n * N = N - * n * I = I - * 0 * n = 0 - * 0 * 0 = 0 - * 0 * N = N - * 0 * I = N - * N * n = N - * N * 0 = N - * N * N = N - * N * I = N - * I * n = I - * I * 0 = N - * I * N = N - * I * I = I - * - * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value - * of BigNumber(y, b). - */ - P.multipliedBy = P.times = function (y, b) { - var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc, - base, sqrtBase, - x = this, - xc = x.c, - yc = (y = new BigNumber(y, b)).c; - - // Either NaN, ±Infinity or ±0? - if (!xc || !yc || !xc[0] || !yc[0]) { - - // Return NaN if either is NaN, or one is 0 and the other is Infinity. - if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) { - y.c = y.e = y.s = null; - } else { - y.s *= x.s; - - // Return ±Infinity if either is ±Infinity. - if (!xc || !yc) { - y.c = y.e = null; - - // Return ±0 if either is ±0. - } else { - y.c = [0]; - y.e = 0; - } - } - - return y; - } - - e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE); - y.s *= x.s; - xcL = xc.length; - ycL = yc.length; - - // Ensure xc points to longer array and xcL to its length. - if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i; - - // Initialise the result array with zeros. - for (i = xcL + ycL, zc = []; i--; zc.push(0)); - - base = BASE; - sqrtBase = SQRT_BASE; - - for (i = ycL; --i >= 0;) { - c = 0; - ylo = yc[i] % sqrtBase; - yhi = yc[i] / sqrtBase | 0; - - for (k = xcL, j = i + k; j > i;) { - xlo = xc[--k] % sqrtBase; - xhi = xc[k] / sqrtBase | 0; - m = yhi * xlo + xhi * ylo; - xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c; - c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi; - zc[j--] = xlo % base; - } - - zc[j] = c; - } - - if (c) { - ++e; - } else { - zc.splice(0, 1); - } - - return normalise(y, zc, e); - }; - - - /* - * Return a new BigNumber whose value is the value of this BigNumber negated, - * i.e. multiplied by -1. - */ - P.negated = function () { - var x = new BigNumber(this); - x.s = -x.s || null; - return x; - }; - - - /* - * n + 0 = n - * n + N = N - * n + I = I - * 0 + n = n - * 0 + 0 = 0 - * 0 + N = N - * 0 + I = I - * N + n = N - * N + 0 = N - * N + N = N - * N + I = N - * I + n = I - * I + 0 = I - * I + N = N - * I + I = I - * - * Return a new BigNumber whose value is the value of this BigNumber plus the value of - * BigNumber(y, b). - */ - P.plus = function (y, b) { - var t, - x = this, - a = x.s; - - y = new BigNumber(y, b); - b = y.s; - - // Either NaN? - if (!a || !b) return new BigNumber(NaN); - - // Signs differ? - if (a != b) { - y.s = -b; - return x.minus(y); - } - - var xe = x.e / LOG_BASE, - ye = y.e / LOG_BASE, - xc = x.c, - yc = y.c; - - if (!xe || !ye) { - - // Return ±Infinity if either ±Infinity. - if (!xc || !yc) return new BigNumber(a / 0); - - // Either zero? - // Return y if y is non-zero, x if x is non-zero, or zero if both are zero. - if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0); - } - - xe = bitFloor(xe); - ye = bitFloor(ye); - xc = xc.slice(); - - // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts. - if (a = xe - ye) { - if (a > 0) { - ye = xe; - t = yc; - } else { - a = -a; - t = xc; - } - - t.reverse(); - for (; a--; t.push(0)); - t.reverse(); - } - - a = xc.length; - b = yc.length; - - // Point xc to the longer array, and b to the shorter length. - if (a - b < 0) t = yc, yc = xc, xc = t, b = a; - - // Only start adding at yc.length - 1 as the further digits of xc can be ignored. - for (a = 0; b;) { - a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0; - xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE; - } - - if (a) { - xc = [a].concat(xc); - ++ye; - } - - // No need to check for zero, as +x + +y != 0 && -x + -y != 0 - // ye = MAX_EXP + 1 possible - return normalise(y, xc, ye); - }; - - - /* - * If sd is undefined or null or true or false, return the number of significant digits of - * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN. - * If sd is true include integer-part trailing zeros in the count. - * - * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this - * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or - * ROUNDING_MODE if rm is omitted. - * - * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive. - * boolean: whether to count integer-part trailing zeros: true or false. - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}' - */ - P.precision = P.sd = function (sd, rm) { - var c, n, v, - x = this; - - if (sd != null && sd !== !!sd) { - intCheck(sd, 1, MAX); - if (rm == null) rm = ROUNDING_MODE; - else intCheck(rm, 0, 8); - - return round(new BigNumber(x), sd, rm); - } - - if (!(c = x.c)) return null; - v = c.length - 1; - n = v * LOG_BASE + 1; - - if (v = c[v]) { - - // Subtract the number of trailing zeros of the last element. - for (; v % 10 == 0; v /= 10, n--); - - // Add the number of digits of the first element. - for (v = c[0]; v >= 10; v /= 10, n++); - } - - if (sd && x.e + 1 > n) n = x.e + 1; - - return n; - }; - - - /* - * Return a new BigNumber whose value is the value of this BigNumber shifted by k places - * (powers of 10). Shift to the right if n > 0, and to the left if n < 0. - * - * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}' - */ - P.shiftedBy = function (k) { - intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER); - return this.times('1e' + k); - }; - - - /* - * sqrt(-n) = N - * sqrt(N) = N - * sqrt(-I) = N - * sqrt(I) = I - * sqrt(0) = 0 - * sqrt(-0) = -0 - * - * Return a new BigNumber whose value is the square root of the value of this BigNumber, - * rounded according to DECIMAL_PLACES and ROUNDING_MODE. - */ - P.squareRoot = P.sqrt = function () { - var m, n, r, rep, t, - x = this, - c = x.c, - s = x.s, - e = x.e, - dp = DECIMAL_PLACES + 4, - half = new BigNumber('0.5'); - - // Negative/NaN/Infinity/zero? - if (s !== 1 || !c || !c[0]) { - return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0); - } - - // Initial estimate. - s = Math.sqrt(+valueOf(x)); - - // Math.sqrt underflow/overflow? - // Pass x to Math.sqrt as integer, then adjust the exponent of the result. - if (s == 0 || s == 1 / 0) { - n = coeffToString(c); - if ((n.length + e) % 2 == 0) n += '0'; - s = Math.sqrt(+n); - e = bitFloor((e + 1) / 2) - (e < 0 || e % 2); - - if (s == 1 / 0) { - n = '5e' + e; - } else { - n = s.toExponential(); - n = n.slice(0, n.indexOf('e') + 1) + e; - } - - r = new BigNumber(n); - } else { - r = new BigNumber(s + ''); - } - - // Check for zero. - // r could be zero if MIN_EXP is changed after the this value was created. - // This would cause a division by zero (x/t) and hence Infinity below, which would cause - // coeffToString to throw. - if (r.c[0]) { - e = r.e; - s = e + dp; - if (s < 3) s = 0; - - // Newton-Raphson iteration. - for (; ;) { - t = r; - r = half.times(t.plus(div(x, t, dp, 1))); - - if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) { - - // The exponent of r may here be one less than the final result exponent, - // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits - // are indexed correctly. - if (r.e < e) --s; - n = n.slice(s - 3, s + 1); - - // The 4th rounding digit may be in error by -1 so if the 4 rounding digits - // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the - // iteration. - if (n == '9999' || !rep && n == '4999') { - - // On the first iteration only, check to see if rounding up gives the - // exact result as the nines may infinitely repeat. - if (!rep) { - round(t, t.e + DECIMAL_PLACES + 2, 0); - - if (t.times(t).eq(x)) { - r = t; - break; - } - } - - dp += 4; - s += 4; - rep = 1; - } else { - - // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact - // result. If not, then there are further digits and m will be truthy. - if (!+n || !+n.slice(1) && n.charAt(0) == '5') { - - // Truncate to the first rounding digit. - round(r, r.e + DECIMAL_PLACES + 2, 1); - m = !r.times(r).eq(x); - } - - break; - } - } - } - } - - return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m); - }; - - - /* - * Return a string representing the value of this BigNumber in exponential notation and - * rounded using ROUNDING_MODE to dp fixed decimal places. - * - * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' - */ - P.toExponential = function (dp, rm) { - if (dp != null) { - intCheck(dp, 0, MAX); - dp++; - } - return format(this, dp, rm, 1); - }; - - - /* - * Return a string representing the value of this BigNumber in fixed-point notation rounding - * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted. - * - * Note: as with JavaScript's number type, (-0).toFixed(0) is '0', - * but e.g. (-0.00001).toFixed(0) is '-0'. - * - * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' - */ - P.toFixed = function (dp, rm) { - if (dp != null) { - intCheck(dp, 0, MAX); - dp = dp + this.e + 1; - } - return format(this, dp, rm); - }; - - - /* - * Return a string representing the value of this BigNumber in fixed-point notation rounded - * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties - * of the format or FORMAT object (see BigNumber.set). - * - * The formatting object may contain some or all of the properties shown below. - * - * FORMAT = { - * prefix: '', - * groupSize: 3, - * secondaryGroupSize: 0, - * groupSeparator: ',', - * decimalSeparator: '.', - * fractionGroupSize: 0, - * fractionGroupSeparator: '\xA0', // non-breaking space - * suffix: '' - * }; - * - * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * [format] {object} Formatting options. See FORMAT pbject above. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' - * '[BigNumber Error] Argument not an object: {format}' - */ - P.toFormat = function (dp, rm, format) { - var str, - x = this; - - if (format == null) { - if (dp != null && rm && typeof rm == 'object') { - format = rm; - rm = null; - } else if (dp && typeof dp == 'object') { - format = dp; - dp = rm = null; - } else { - format = FORMAT; - } - } else if (typeof format != 'object') { - throw Error - (bignumberError + 'Argument not an object: ' + format); - } - - str = x.toFixed(dp, rm); - - if (x.c) { - var i, - arr = str.split('.'), - g1 = +format.groupSize, - g2 = +format.secondaryGroupSize, - groupSeparator = format.groupSeparator || '', - intPart = arr[0], - fractionPart = arr[1], - isNeg = x.s < 0, - intDigits = isNeg ? intPart.slice(1) : intPart, - len = intDigits.length; - - if (g2) i = g1, g1 = g2, g2 = i, len -= i; - - if (g1 > 0 && len > 0) { - i = len % g1 || g1; - intPart = intDigits.substr(0, i); - for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1); - if (g2 > 0) intPart += groupSeparator + intDigits.slice(i); - if (isNeg) intPart = '-' + intPart; - } - - str = fractionPart - ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize) - ? fractionPart.replace(new RegExp('\\d{' + g2 + '}\\B', 'g'), - '$&' + (format.fractionGroupSeparator || '')) - : fractionPart) - : intPart; - } - - return (format.prefix || '') + str + (format.suffix || ''); - }; - - - /* - * Return an array of two BigNumbers representing the value of this BigNumber as a simple - * fraction with an integer numerator and an integer denominator. - * The denominator will be a positive non-zero value less than or equal to the specified - * maximum denominator. If a maximum denominator is not specified, the denominator will be - * the lowest value necessary to represent the number exactly. - * - * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator. - * - * '[BigNumber Error] Argument {not an integer|out of range} : {md}' - */ - P.toFraction = function (md) { - var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s, - x = this, - xc = x.c; - - if (md != null) { - n = new BigNumber(md); - - // Throw if md is less than one or is not an integer, unless it is Infinity. - if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) { - throw Error - (bignumberError + 'Argument ' + - (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n)); - } - } - - if (!xc) return new BigNumber(x); - - d = new BigNumber(ONE); - n1 = d0 = new BigNumber(ONE); - d1 = n0 = new BigNumber(ONE); - s = coeffToString(xc); - - // Determine initial denominator. - // d is a power of 10 and the minimum max denominator that specifies the value exactly. - e = d.e = s.length - x.e - 1; - d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp]; - md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n; - - exp = MAX_EXP; - MAX_EXP = 1 / 0; - n = new BigNumber(s); - - // n0 = d1 = 0 - n0.c[0] = 0; - - for (; ;) { - q = div(n, d, 0, 1); - d2 = d0.plus(q.times(d1)); - if (d2.comparedTo(md) == 1) break; - d0 = d1; - d1 = d2; - n1 = n0.plus(q.times(d2 = n1)); - n0 = d2; - d = n.minus(q.times(d2 = d)); - n = d2; - } - - d2 = div(md.minus(d0), d1, 0, 1); - n0 = n0.plus(d2.times(n1)); - d0 = d0.plus(d2.times(d1)); - n0.s = n1.s = x.s; - e = e * 2; - - // Determine which fraction is closer to x, n0/d0 or n1/d1 - r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo( - div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0]; - - MAX_EXP = exp; - - return r; - }; - - - /* - * Return the value of this BigNumber converted to a number primitive. - */ - P.toNumber = function () { - return +valueOf(this); - }; - - - /* - * Return a string representing the value of this BigNumber rounded to sd significant digits - * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits - * necessary to represent the integer part of the value in fixed-point notation, then use - * exponential notation. - * - * [sd] {number} Significant digits. Integer, 1 to MAX inclusive. - * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. - * - * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}' - */ - P.toPrecision = function (sd, rm) { - if (sd != null) intCheck(sd, 1, MAX); - return format(this, sd, rm, 2); - }; - - - /* - * Return a string representing the value of this BigNumber in base b, or base 10 if b is - * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and - * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent - * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than - * TO_EXP_NEG, return exponential notation. - * - * [b] {number} Integer, 2 to ALPHABET.length inclusive. - * - * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}' - */ - P.toString = function (b) { - var str, - n = this, - s = n.s, - e = n.e; - - // Infinity or NaN? - if (e === null) { - if (s) { - str = 'Infinity'; - if (s < 0) str = '-' + str; - } else { - str = 'NaN'; - } - } else { - if (b == null) { - str = e <= TO_EXP_NEG || e >= TO_EXP_POS - ? toExponential(coeffToString(n.c), e) - : toFixedPoint(coeffToString(n.c), e, '0'); - } else if (b === 10 && alphabetHasNormalDecimalDigits) { - n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE); - str = toFixedPoint(coeffToString(n.c), n.e, '0'); - } else { - intCheck(b, 2, ALPHABET.length, 'Base'); - str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true); - } - - if (s < 0 && n.c[0]) str = '-' + str; - } - - return str; - }; - - - /* - * Return as toString, but do not accept a base argument, and include the minus sign for - * negative zero. - */ - P.valueOf = P.toJSON = function () { - return valueOf(this); - }; - - - P._isBigNumber = true; - - P[Symbol.toStringTag] = 'BigNumber'; - - // Node.js v10.12.0+ - P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf; - - if (configObject != null) BigNumber.set(configObject); - - return BigNumber; -} - - -// PRIVATE HELPER FUNCTIONS - -// These functions don't need access to variables, -// e.g. DECIMAL_PLACES, in the scope of the `clone` function above. - - -function bitFloor(n) { - var i = n | 0; - return n > 0 || n === i ? i : i - 1; -} - - -// Return a coefficient array as a string of base 10 digits. -function coeffToString(a) { - var s, z, - i = 1, - j = a.length, - r = a[0] + ''; - - for (; i < j;) { - s = a[i++] + ''; - z = LOG_BASE - s.length; - for (; z--; s = '0' + s); - r += s; - } - - // Determine trailing zeros. - for (j = r.length; r.charCodeAt(--j) === 48;); - - return r.slice(0, j + 1 || 1); -} - - -// Compare the value of BigNumbers x and y. -function compare(x, y) { - var a, b, - xc = x.c, - yc = y.c, - i = x.s, - j = y.s, - k = x.e, - l = y.e; - - // Either NaN? - if (!i || !j) return null; - - a = xc && !xc[0]; - b = yc && !yc[0]; - - // Either zero? - if (a || b) return a ? b ? 0 : -j : i; - - // Signs differ? - if (i != j) return i; - - a = i < 0; - b = k == l; - - // Either Infinity? - if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1; - - // Compare exponents. - if (!b) return k > l ^ a ? 1 : -1; - - j = (k = xc.length) < (l = yc.length) ? k : l; - - // Compare digit by digit. - for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1; - - // Compare lengths. - return k == l ? 0 : k > l ^ a ? 1 : -1; -} - - -/* - * Check that n is a primitive number, an integer, and in range, otherwise throw. - */ -function intCheck(n, min, max, name) { - if (n < min || n > max || n !== mathfloor(n)) { - throw Error - (bignumberError + (name || 'Argument') + (typeof n == 'number' - ? n < min || n > max ? ' out of range: ' : ' not an integer: ' - : ' not a primitive number: ') + String(n)); - } -} - - -// Assumes finite n. -function isOdd(n) { - var k = n.c.length - 1; - return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0; -} - - -function toExponential(str, e) { - return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) + - (e < 0 ? 'e' : 'e+') + e; -} - - -function toFixedPoint(str, e, z) { - var len, zs; - - // Negative exponent? - if (e < 0) { - - // Prepend zeros. - for (zs = z + '.'; ++e; zs += z); - str = zs + str; - - // Positive exponent - } else { - len = str.length; - - // Append zeros. - if (++e > len) { - for (zs = z, e -= len; --e; zs += z); - str += zs; - } else if (e < len) { - str = str.slice(0, e) + '.' + str.slice(e); - } - } - - return str; -} - - -// EXPORT - - -var BigNumber = clone(); - -/* harmony default export */ const bignumber = (BigNumber); - -// EXTERNAL MODULE: ./node_modules/bs58/index.js -var bs58 = __webpack_require__(91); -var bs58_default = /*#__PURE__*/__webpack_require__.n(bs58); -// EXTERNAL MODULE: ./node_modules/@aelfqueen/protobufjs/ext/descriptor/index.js -var descriptor = __webpack_require__(65); -var descriptor_default = /*#__PURE__*/__webpack_require__.n(descriptor); -;// CONCATENATED MODULE: ./src/util/formatters.js -/** - * @file formatters.js - * @author Marek Kotewicz - * @author Fabian Vogelsteller - * @date 2015 - */ - - -const inputAddressFormatter = address => { - let realAddress = address; - if (address && address.value) { - realAddress = address.value; - } - if (realAddress.indexOf('_') > 0) { - const parts = realAddress.split('_'); - const list = parts.filter(v => { - try { - formatters_get_("base58").decode(v, 'hex'); - return true; - } catch (e) { - return false; - } - }); - if (list.length === 0) { - throw new Error('Invalid address'); - } - [realAddress] = list; - } - try { - formatters_get_("base58").decode(realAddress, 'hex'); - } catch (e) { - throw new Error('Invalid address'); - } - return realAddress; -}; - -/** - * @param {String} result base64 representation of serialized FileDescriptorSet - * @returns {FileDescriptorSet} decoded FileDescriptorSet message - */ -const outputFileDescriptorSetFormatter = result => { - const buffer = Buffer.from(result, 'base64'); - return formatters_get_("descriptor").FileDescriptorSet.decode(buffer); -}; -function formatters_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var formatters_RewireModuleId_ = null; -function formatters_getRewireModuleId_() { - if (formatters_RewireModuleId_ === null) { - let globalVariable = formatters_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - formatters_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return formatters_RewireModuleId_; -} -function formatters_getRewireRegistry_() { - let theGlobalVariable = formatters_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function formatters_getRewiredData_() { - let moduleId = formatters_getRewireModuleId_(); - let registry = formatters_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = formatters_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var formatters_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let formatters_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(formatters_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', formatters_get_); - addPropertyToAPIObject('__GetDependency__', formatters_get_); - addPropertyToAPIObject('__Rewire__', formatters_set_); - addPropertyToAPIObject('__set__', formatters_set_); - addPropertyToAPIObject('__reset__', formatters_reset_); - addPropertyToAPIObject('__ResetDependency__', formatters_reset_); - addPropertyToAPIObject('__with__', formatters_with_); -})(); -function formatters_get_(variableName) { - let rewireData = formatters_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return formatters_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === formatters_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function formatters_get_original_(variableName) { - switch (variableName) { - case "base58": - return base58; - case "descriptor": - return (descriptor_default()); - } - return undefined; -} -function formatters_assign_(variableName, value) { - let rewireData = formatters_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return formatters_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function formatters_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function formatters_update_operation_(operation, variableName, prefix) { - var oldValue = formatters_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - formatters_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function formatters_set_(variableName, value) { - let rewireData = formatters_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - formatters_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = formatters_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - formatters_reset_(variableName); - }; - } -} -function formatters_reset_(variableName) { - let rewireData = formatters_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete formatters_getRewireRegistry_()[formatters_getRewireModuleId_]; - } - ; -} -function formatters_with_(object) { - let rewireData = formatters_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const formatters = ((/* unused pure expression or super */ null && (formatters_RewireAPI_))); -;// CONCATENATED MODULE: ./src/common/constants.js -/** - * @file AElf-sdk constants - * @author atom-yang - */ - - -/** - * unsigned 256 int - */ -const UNSIGNED_256_INT = 'ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff'; -const CHAIN_METHODS = { - getChainStatus: { - name: 'getChainStatus', - call: 'blockChain/chainStatus', - method: 'GET', - params: [] - }, - getChainState: { - name: 'getChainState', - call: 'blockChain/blockState', - method: 'GET', - params: ['blockHash'] - }, - getContractFileDescriptorSet: { - name: 'getContractFileDescriptorSet', - call: 'blockChain/contractFileDescriptorSet', - method: 'GET', - params: ['address'], - inputFormatter: [constants_get_("inputAddressFormatter")], - outputFormatter: constants_get_("outputFileDescriptorSetFormatter") - }, - getBlockHeight: { - name: 'getBlockHeight', - call: 'blockChain/blockHeight', - method: 'GET', - params: [], - inputFormatter: [] - }, - getBlock: { - name: 'getBlock', - call: 'blockChain/block', - method: 'GET', - params: ['blockHash', 'includeTransactions'] - }, - getBlockByHeight: { - name: 'getBlockByHeight', - call: 'blockChain/blockByHeight', - method: 'GET', - params: ['blockHeight', 'includeTransactions'] - }, - getTxResult: { - name: 'getTxResult', - call: 'blockChain/transactionResult', - method: 'GET', - params: ['transactionId'], - inputFormatter: [] - }, - getTxResults: { - name: 'getTxResults', - call: 'blockChain/transactionResults', - method: 'GET', - params: ['blockHash', 'offset', 'limit'] - }, - getMerklePathByTxId: { - name: 'getMerklePathByTxId', - call: 'blockChain/merklePathByTransactionId', - method: 'GET', - params: ['transactionId'] - }, - getTransactionPoolStatus: { - name: 'getTransactionPoolStatus', - call: 'blockChain/transactionPoolStatus', - method: 'GET', - params: [] - }, - sendTransaction: { - name: 'sendTransaction', - call: 'blockChain/sendTransaction', - method: 'POST', - params: ['rawTransaction'], - inputFormatter: [] - }, - sendTransactions: { - name: 'sendTransactions', - call: 'blockChain/sendTransactions', - method: 'POST', - params: ['rawTransaction'], - inputFormatter: [] - }, - calculateTransactionFee: { - name: 'calculateTransactionFee', - call: 'blockChain/calculateTransactionFee', - method: 'POST', - params: ['rawTransaction'], - inputFormatter: [] - }, - callReadOnly: { - name: 'callReadOnly', - call: 'blockChain/executeTransaction', - method: 'POST', - params: ['rawTransaction'], - inputFormatter: [] - }, - getPeers: { - name: 'getPeers', - call: 'net/peers', - method: 'GET', - params: ['withMetrics'] - }, - addPeer: { - name: 'addPeer', - call: 'net/peer', - method: 'POST', - params: ['address'], - inputFormatter: [] - }, - removePeer: { - name: 'removePeer', - call: 'net/peer', - method: 'DELETE', - params: ['address'], - inputFormatter: [] - }, - networkInfo: { - name: 'networkInfo', - call: 'net/networkInfo', - method: 'GET', - params: [], - inputFormatter: [] - } -}; - -/** - * unit map - */ -const UNIT_MAP = { - noether: '0', - wei: '1', - kwei: '1000', - Kwei: '1000', - babbage: '1000', - femtoether: '1000', - mwei: '1000000', - Mwei: '1000000', - lovelace: '1000000', - picoether: '1000000', - gwei: '1000000000', - Gwei: '1000000000', - shannon: '1000000000', - nanoether: '1000000000', - nano: '1000000000', - szabo: '1000000000000', - microether: '1000000000000', - micro: '1000000000000', - finney: '1000000000000000', - milliether: '1000000000000000', - milli: '1000000000000000', - ether: '1000000000000000000', - kether: '1000000000000000000000', - grand: '1000000000000000000000', - mether: '1000000000000000000000000', - gether: '1000000000000000000000000000', - tether: '1000000000000000000000000000000' -}; -const TO_STRING_UTF8_ENCODING = 'utf8'; -const DEFAULT_TO_STRING_ENCODING = constants_get_("TO_STRING_UTF8_ENCODING"); -const CONGIG = { - AELF_POLLING_TIMEOUT: 1000 / 2, - chainId: 'AELF', - contractZeroAddress: 'AELF', - contractZeroAbi: 'AELF', - contractZero: 'AELF', - defaultAccount: '0x04bb9c6c297ea90b1bc3e6af2c87d416583e' -}; -const KEY_STORE_ERRORS = { - INVALID_PASSWORD: { - error: 200001, - errorMessage: 'Password Error' - }, - NOT_AELF_KEY_STORE: { - error: 200002, - errorMessage: 'Not a aelf key store' - }, - WRONG_VERSION: { - error: 200004, - errorMessage: 'The version is incorrect' - }, - WRONG_KEY_STORE_VERSION: { - error: 200005, - errorMessage: 'Not a V1 key store' - } -}; -function constants_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var constants_RewireModuleId_ = null; -function constants_getRewireModuleId_() { - if (constants_RewireModuleId_ === null) { - let globalVariable = constants_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - constants_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return constants_RewireModuleId_; -} -function constants_getRewireRegistry_() { - let theGlobalVariable = constants_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function constants_getRewiredData_() { - let moduleId = constants_getRewireModuleId_(); - let registry = constants_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = constants_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var constants_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let constants_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(constants_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', constants_get_); - addPropertyToAPIObject('__GetDependency__', constants_get_); - addPropertyToAPIObject('__Rewire__', constants_set_); - addPropertyToAPIObject('__set__', constants_set_); - addPropertyToAPIObject('__reset__', constants_reset_); - addPropertyToAPIObject('__ResetDependency__', constants_reset_); - addPropertyToAPIObject('__with__', constants_with_); -})(); -function constants_get_(variableName) { - let rewireData = constants_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return constants_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === constants_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function constants_get_original_(variableName) { - switch (variableName) { - case "inputAddressFormatter": - return inputAddressFormatter; - case "outputFileDescriptorSetFormatter": - return outputFileDescriptorSetFormatter; - case "TO_STRING_UTF8_ENCODING": - return TO_STRING_UTF8_ENCODING; - } - return undefined; -} -function constants_assign_(variableName, value) { - let rewireData = constants_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return constants_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function constants_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function constants_update_operation_(operation, variableName, prefix) { - var oldValue = constants_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - constants_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function constants_set_(variableName, value) { - let rewireData = constants_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - constants_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = constants_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - constants_reset_(variableName); - }; - } -} -function constants_reset_(variableName) { - let rewireData = constants_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete constants_getRewireRegistry_()[constants_getRewireModuleId_]; - } - ; -} -function constants_with_(object) { - let rewireData = constants_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const constants = ((/* unused pure expression or super */ null && (constants_RewireAPI_))); -;// CONCATENATED MODULE: ./src/util/transform.js -/** - * @file transform protobuf - * @author atom-yang - */ - - -const isWrappedBytes = (resolvedType, name) => { - if (!resolvedType.name || resolvedType.name !== name) { - return false; - } - if (!resolvedType.fieldsArray || resolvedType.fieldsArray.length !== 1) { - return false; - } - return resolvedType.fieldsArray[0].type === 'bytes'; -}; -const isAddress = resolvedType => transform_get_("isWrappedBytes")(resolvedType, 'Address'); -const isHash = resolvedType => transform_get_("isWrappedBytes")(resolvedType, 'Hash'); -function transform(inputType, origin) { - let transformers = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : []; - const fieldsLength = (inputType.fieldsArray || []).length; - let result = origin; - if (fieldsLength === 0) { - return origin; - } - // eslint-disable-next-line no-restricted-syntax - for (const { - filter, - transformer - } of transformers) { - if (filter(inputType) && origin) { - return transformer(origin); - } - } - // eslint-disable-next-line no-restricted-syntax - Object.keys(inputType.fields).forEach(field => { - const { - rule, - name, - resolvedType - } = inputType.fields[field]; - if (resolvedType) { - if (rule && rule === 'repeated') { - let value = origin[name]; - if (value && Array.isArray(value)) { - value = value.filter(v => v !== null && v !== undefined).map(item => transform_get_("transform")(resolvedType, item, transformers)); - } - result = { - ...result, - [name]: value - }; - } else { - result = { - ...result, - [name]: origin[name] !== null && origin[name] !== undefined ? transform_get_("transform")(resolvedType, origin[name], transformers) : origin[name] - }; - } - } - }); - return result; -} -function transformMapToArray(inputType, origin) { - const fieldsLength = inputType.fieldsArray ? inputType.fieldsArray.length : 0; - let result = origin; - if (!origin) { - return origin; - } - if (fieldsLength === 0 || fieldsLength === 1 && !inputType.fieldsArray[0].resolvedType) { - return origin; - } - // Params which satisfy address or hash format satisfy above first. - // if (isAddress(inputType) || isHash(inputType)) { - // return origin; - // } - const { - fields, - options = {} - } = inputType; - if (fieldsLength === 2 && fields.value && fields.key && options.map_entry === true) { - return Object.keys(origin).map(key => ({ - key, - value: origin[key] - })); - } - // eslint-disable-next-line no-restricted-syntax - Object.keys(inputType.fields).forEach(field => { - const { - name, - resolvedType - } = inputType.fields[field]; - if (resolvedType) { - if (origin[name] && Array.isArray(origin[name])) { - let value = origin[name]; - value = value.map(item => transform_get_("transformMapToArray")(resolvedType, item)); - result = { - ...result, - [name]: value - }; - } else { - result = { - ...result, - [name]: transform_get_("transformMapToArray")(resolvedType, origin[name]) - }; - } - } - }); - return result; -} -function transformArrayToMap(inputType, origin) { - const fieldsLength = (inputType.fieldsArray || []).length; - let result = origin; - if (fieldsLength === 0 || fieldsLength === 1 && !inputType.fieldsArray[0].resolvedType) { - return origin; - } - // Params which satisfy address or hash format satisfy above first. - // if (isAddress(inputType) || isHash(inputType)) { - // return origin; - // } - const { - fields, - options = {} - } = inputType; - if (fieldsLength === 2 && fields.value && fields.key && options.map_entry === true) { - return origin.reduce((acc, v) => ({ - ...acc, - [v.key]: v.value - }), {}); - } - // eslint-disable-next-line no-restricted-syntax - Object.keys(fields).forEach(field => { - const { - name, - resolvedType - } = fields[field]; - if (resolvedType && origin !== null && origin !== undefined) { - if (origin[name] && Array.isArray(origin[name])) { - const { - fieldsArray = [], - fields: resolvedFields, - options: resolvedOptions = {} - } = resolvedType; - // eslint-disable-next-line max-len - if (fieldsArray.length === 2 && resolvedFields.value && resolvedFields.key && resolvedOptions.map_entry === true) { - result = { - ...result, - [name]: origin[name].reduce((acc, v) => ({ - ...acc, - [v.key]: v.value - }), {}) - }; - } else { - let value = origin[name]; - value = value.map(item => transform_get_("transformArrayToMap")(resolvedType, item)); - result = { - ...result, - [name]: value - }; - } - } else { - result = { - ...result, - [name]: transform_get_("transformArrayToMap")(resolvedType, origin[name]) - }; - } - } - }); - return result; -} -const INPUT_TRANSFORMERS = [{ - filter: transform_get_("isAddress"), - transformer: origin => { - let result = origin; - if (typeof origin === 'string') { - result = { - value: Buffer.from(transform_get_("decodeAddressRep")(transform_get_("inputAddressFormatter")(origin)), 'hex') - }; - } - if (Array.isArray(origin)) { - result = origin.map(h => ({ - value: Buffer.from(transform_get_("decodeAddressRep")(transform_get_("inputAddressFormatter")(h)), 'hex') - })); - } - return result; - } -}, { - filter: transform_get_("isHash"), - transformer: origin => { - let result = origin; - if (typeof origin === 'string') { - result = { - value: Buffer.from(origin.replace('0x', ''), 'hex') - }; - } - if (Array.isArray(origin)) { - result = origin.map(h => ({ - value: Buffer.from(h.replace('0x', ''), 'hex') - })); - } - return result; - } -}]; -function encodeAddress(str) { - const buf = Buffer.from(str, 'base64'); - return transform_get_("base58").encode(buf); -} -const OUTPUT_TRANSFORMERS = [{ - filter: transform_get_("isAddress"), - transformer: origin => { - let result = origin; - if (Array.isArray(result)) { - result = result.map(h => transform_get_("encodeAddress")(h.value)); - } else if (typeof result !== 'string') { - result = transform_get_("encodeAddress")(result.value); - } - return result; - } -}, { - filter: transform_get_("isHash"), - transformer: origin => { - let result = origin; - if (Array.isArray(result)) { - result = result.map(h => Buffer.from(h.value, 'base64').toString('hex')); - } else if (typeof result !== 'string') { - result = Buffer.from(result.value, 'base64').toString('hex'); - } - return result; - } -}]; -function transform_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var transform_RewireModuleId_ = null; -function transform_getRewireModuleId_() { - if (transform_RewireModuleId_ === null) { - let globalVariable = transform_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - transform_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return transform_RewireModuleId_; -} -function transform_getRewireRegistry_() { - let theGlobalVariable = transform_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function transform_getRewiredData_() { - let moduleId = transform_getRewireModuleId_(); - let registry = transform_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = transform_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var transform_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let transform_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(transform_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', transform_get_); - addPropertyToAPIObject('__GetDependency__', transform_get_); - addPropertyToAPIObject('__Rewire__', transform_set_); - addPropertyToAPIObject('__set__', transform_set_); - addPropertyToAPIObject('__reset__', transform_reset_); - addPropertyToAPIObject('__ResetDependency__', transform_reset_); - addPropertyToAPIObject('__with__', transform_with_); -})(); -function transform_get_(variableName) { - let rewireData = transform_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return transform_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === transform_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function transform_get_original_(variableName) { - switch (variableName) { - case "isWrappedBytes": - return isWrappedBytes; - case "transform": - return transform; - case "transformMapToArray": - return transformMapToArray; - case "transformArrayToMap": - return transformArrayToMap; - case "isAddress": - return isAddress; - case "decodeAddressRep": - return decodeAddressRep; - case "inputAddressFormatter": - return inputAddressFormatter; - case "isHash": - return isHash; - case "base58": - return base58; - case "encodeAddress": - return encodeAddress; - } - return undefined; -} -function transform_assign_(variableName, value) { - let rewireData = transform_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return transform_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function transform_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function transform_update_operation_(operation, variableName, prefix) { - var oldValue = transform_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - transform_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function transform_set_(variableName, value) { - let rewireData = transform_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - transform_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = transform_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - transform_reset_(variableName); - }; - } -} -function transform_reset_(variableName) { - let rewireData = transform_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete transform_getRewireRegistry_()[transform_getRewireModuleId_]; - } - ; -} -function transform_with_(object) { - let rewireData = transform_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const util_transform = (transform_RewireAPI_); -;// CONCATENATED MODULE: ./src/util/utils.js -/** - * @file common utils - * @author atom-yang - */ - - - - - - - -const base58 = { - encode(data) { - let encoding = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'hex'; - let result = data; - if (typeof data === 'string') { - result = Buffer.from(data, encoding); - } - if (!(result instanceof Buffer)) { - throw new TypeError('"data" argument must be an Array of Buffers'); - } - let hash = result; - hash = Buffer.from(utils_get_("sha256")(result), 'hex'); - hash = Buffer.from(utils_get_("sha256")(hash), 'hex'); - hash = Buffer.from(result.toString('hex') + hash.slice(0, 4).toString('hex'), 'hex'); - return utils_get_("bs58").encode(hash); - }, - decode(str, encoding) { - const buffer = Buffer.from(utils_get_("bs58").decode(str)); - let data = buffer.slice(0, -4); - let hash = data; - hash = Buffer.from(utils_get_("sha256")(hash), 'hex'); - hash = Buffer.from(utils_get_("sha256")(hash), 'hex'); - buffer.slice(-4).forEach((check, index) => { - if (check !== hash[index]) { - throw new Error('Invalid checksum'); - } - }); - if (encoding) { - data = data.toString(encoding); - } - return data; - } -}; -const chainIdConvertor = { - // chainIdToBase58 (int32 chainId) - chainIdToBase58(chainId) { - const bufferTemp = Buffer.alloc(4); - bufferTemp.writeInt32LE(`0x${chainId.toString('16')}`, 0); - const bytes = Buffer.concat([bufferTemp], 3); - return utils_get_("bs58").encode(bytes); - }, - base58ToChainId(base58String) { - return Buffer.concat([utils_get_("bs58").decode(base58String)], 4).readInt32LE(0); - } -}; -const arrayBufferToHex = arrayBuffer => Array.prototype.map.call(new Uint8Array(arrayBuffer), n => `0${n.toString(16)}`.slice(-2)).join(''); -const arrayToHex = value => { - let hex = ''; - if (value instanceof Buffer) { - hex = value.toString('hex'); - } else { - // Uint8Array - hex = utils_get_("arrayBufferToHex")(value); - } - return hex; -}; - -/** - * Should be called to pad string to expected length - * - * @method padLeft - * @param {String} string to be padded - * @param {Number} charLen that result string should have - * @param {String} sign, by default 0 - * @returns {String} right aligned string - */ -const padLeft = (string, charLen, sign) => { - const length = charLen - string.length + 1; - return new Array(length < 0 ? 0 : length).join(sign || '0') + string; -}; - -/** - * Should be called to pad string to expected length - * - * @method padRight - * @param {String} string to be padded - * @param {Number} charLen that result string should have - * @param {String} sign, by default 0 - * @returns {String} right aligned string - */ -const padRight = (string, charLen, sign) => { - const length = charLen - string.length + 1; - return string + new Array(length < 0 ? 0 : length).join(sign || '0'); -}; - -/** - * Returns a hex rep from the encoded address - * - * @method decodeAddressRep - * @param {String} address - * @return {String} - */ -const decodeAddressRep = address => { - if (address.indexOf('_') > -1) { - const parts = address.split('_'); - const b58rep = parts[1]; - return utils_get_("base58").decode(b58rep, 'hex'); - } - return utils_get_("base58").decode(address, 'hex'); -}; - -/** - * Returns a encoded address from the hex rep - * - * @method encodeAddressRep - * @param {String} hex - * @return {String} - */ -const encodeAddressRep = hex => { - const buf = Buffer.from(hex.replace('0x', ''), 'hex'); - return utils_get_("base58").encode(buf, 'hex'); -}; - -/** - * Returns true if object is BigNumber, otherwise false - * - * @method isBigNumber - * @param {Object} object - * @return {Boolean} - */ -const isBigNumber = object => object instanceof utils_get_("BigNumber") || object && object.constructor && object.constructor.name === 'BigNumber'; - -/** - * Returns true if object is string, otherwise false - * - * @method isString - * @param {Object} object - * @return {Boolean} - */ -const isString = object => typeof object === 'string' || object && object.constructor && object.constructor.name === 'String'; - -/** - * Returns true if object is function, otherwise false - * - * @method isFunction - * @param {Object} object - * @return {Boolean} - */ -const isFunction = object => typeof object === 'function'; - -/** - * Returns true if object is Object, otherwise false - * - * @method isObject - * @param {Object} object - * @return {Boolean} - */ -const isObject = object => object !== null && !Array.isArray(object) && typeof object === 'object'; - -/** - * Returns true if object is boolean, otherwise false - * - * @method isBoolean - * @param {Object} object - * @return {Boolean} - */ -const isBoolean = object => typeof object === 'boolean'; - -/** - * Returns true if given string is valid json object - * - * @method isJson - * @param {String} str - * @return {Boolean} - */ -const isJson = str => { - try { - return !!JSON.parse(str); - } catch (e) { - return false; - } -}; - -/** - * Takes an input and transforms it into an bignumber - * - * @method toBigNumber - * @param {Number|String|BigNumber} number, a number, string, HEX string or BigNumber - * @return {BigNumber} BigNumber - */ -const toBigNumber = number => { - const num = number || 0; - if (utils_get_("isBigNumber")(num)) { - return num; - } - if (utils_get_("isString")(num) && (num.indexOf('0x') === 0 || num.indexOf('-0x') === 0)) { - return new (utils_get_("BigNumber"))(num.replace('0x', ''), 16); - } - return new (utils_get_("BigNumber"))(num.toString(10), 10); -}; - -/** - * Returns value of unit in Wei - * - * @method getValueOfUnit - * @param {String} unit the unit to convert to, default ether - * @returns {BigNumber} value of the unit (in Wei) - * @throws error if the unit is not correct:w - */ -const getValueOfUnit = unit => { - const unitValue = utils_get_("UNIT_MAP")[unit ? unit.toLowerCase() : 'ether']; - if (unitValue === undefined) { - // eslint-disable-next-line max-len - throw new Error(`This unit doesn\'t exists, please use the one of the following units ${JSON.stringify(utils_get_("UNIT_MAP"), null, 2)}`); - } - return new (utils_get_("BigNumber"))(unitValue, 10); -}; - -/** - * Takes a number of wei and converts it to any other ether unit. - * - * Possible units are: - * SI Short SI Full Effigy Other - * - kwei femtoether babbage - * - mwei picoether lovelace - * - gwei nanoether shannon nano - * - -- microether szabo micro - * - -- milliether finney milli - * - ether -- -- - * - kether -- grand - * - mether - * - gether - * - tether - * - * @method fromWei - * @param {Number|String} number can be a number, number string or a HEX of a decimal - * @param {String} unit the unit to convert to, default ether - * @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number - */ -const fromWei = (number, unit) => { - const returnValue = utils_get_("toBigNumber")(number).dividedBy(utils_get_("getValueOfUnit")(unit)); - return utils_get_("isBigNumber")(number) ? returnValue : returnValue.toString(10); -}; - -/** - * Takes a number of a unit and converts it to wei. - * - * Possible units are: - * SI Short SI Full Effigy Other - * - kwei femtoether babbage - * - mwei picoether lovelace - * - gwei nanoether shannon nano - * - -- microether szabo micro - * - -- milliether finney milli - * - ether -- -- - * - kether -- grand - * - mether - * - gether - * - tether - * - * @method toWei - * @param {Number|String|BigNumber} number can be a number, number string or a HEX of a decimal - * @param {String} unit the unit to convert from, default ether - * @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number - */ -const toWei = (number, unit) => { - const returnValue = utils_get_("toBigNumber")(number).times(utils_get_("getValueOfUnit")(unit)); - return utils_get_("isBigNumber")(number) ? returnValue : returnValue.toString(10); -}; - -/** - * Takes and input transforms it into bignumber and if it is negative value, into two's complement - * bignumber.js get rid of round + floor in 6.0 https://github.com/MikeMcl/bignumber.js/issues/139 - * the method lessThan was named isLessThan after 6.0 https://github.com/MikeMcl/bignumber.js/issues/152 - * @method toTwosComplement - * @param {Number|String|BigNumber} number - * @return {BigNumber} - */ -const toTwosComplement = number => { - const bigNumber = utils_get_("toBigNumber")(number).integerValue(); - if (bigNumber.isLessThan(0)) { - return new (utils_get_("BigNumber"))(utils_get_("UNSIGNED_256_INT"), 16).plus(bigNumber).plus(1); - } - return bigNumber; -}; - -/** - * Returns hex - * - * @method uint8ArrayToHex - * @param {Array} uint8Array - * @return {String} - */ -const uint8ArrayToHex = uint8Array => { - let string = ''; - uint8Array.forEach(item => { - let hex = item.toString(16); - if (hex.length <= 1) { - hex = `0${hex}`; - } - string += hex; - }); - return string; -}; - -/** - * empty function - */ -const noop = () => {}; - -/** - * - * @param {object} obj The object to modify - * @param {string} path The path of the property to set - * @param {*} value The value to set - * @example - * - * const object = { 'a': [{ 'b': { 'c': 3 } }] } - * - * set(object, 'test.b.c', 4) - * console.log(object.test.b.c) - * // => 4 - */ -const setPath = (obj, path, value) => { - const paths = path.split('.'); - paths.reduce((acc, p, index) => { - if (index === paths.length - 1) { - acc[p] = value; - return acc; - } - acc[p] = {}; - return acc[p]; - }, obj); -}; -const unpackSpecifiedTypeData = _ref => { - let { - data, - dataType, - encoding = 'hex' - } = _ref; - const buffer = Buffer.from(data, encoding); - const decoded = dataType.decode(buffer); - const result = dataType.toObject(decoded, { - enums: String, - // enums as string names - longs: String, - // longs as strings (requires long.js) - bytes: String, - // bytes as base64 encoded strings - defaults: true, - // includes default values - arrays: true, - // populates empty arrays (repeated fields) even if defaults=false - objects: true, - // populates empty objects (map fields) even if defaults=false - oneofs: true // includes virtual oneof fields set to the present field's name - }); - - return result; -}; -function deserializeTransaction(rawTx, paramsDataType) { - const { - from, - to, - params, - refBlockPrefix, - signature, - ...rest - } = utils_get_("unpackSpecifiedTypeData")({ - data: rawTx, - dataType: utils_get_("Transaction") - }); - let methodParameters = utils_get_("unpackSpecifiedTypeData")({ - data: params, - encoding: 'base64', - dataType: paramsDataType - }); - methodParameters = utils_get_("transform")(paramsDataType, methodParameters, utils_get_("OUTPUT_TRANSFORMERS")); - methodParameters = utils_get_("transformArrayToMap")(paramsDataType, methodParameters); - return { - from: utils_get_("encodeAddress")(from.value), - to: utils_get_("encodeAddress")(to.value), - params: methodParameters, - refBlockPrefix: Buffer.from(refBlockPrefix, 'base64').toString('hex'), - signature: Buffer.from(signature, 'base64').toString('hex'), - ...rest - }; -} -/** - * - * @param {String} userName Username - * @param {String} password Password - * @return {any} Authorization information - * - * const authorization = getAuthorization('test','pass') - * console.log(authorization) - * // => Basic dGVzdDpwYXNz - */ -function getAuthorization(userName, password) { - const base = Buffer.from(`${userName}:${password}`).toString('base64'); - return `Basic ${base}`; -} - -// /** -// * Converts value to it's hex representation -// * -// * @method fromDecimal -// * @param {String|Number|BigNumber} -// * @return {String} -// */ -// export const fromDecimal = value => { -// const number = toBigNumber(value); -// const result = number.toString(16); -// -// return number.lessThan(0) ? `-0x${result.substr(1)}` : `0x${result}`; -// }; -// -// /** -// * Should be called to get hex representation (prefixed by 0x) of utf8 string -// * -// * @method fromUtf8 -// * @param {String} string -// * @param {Boolean} allowZero to convert code point zero to 00 instead of end of string -// * @returns {String} hex representation of input string -// */ -// export const fromUtf8 = (str, allowZero) => { -// const encodeStr = utf8.encode(str); -// let hex = ''; -// for (let i = 0; i < encodeStr.length; i++) { -// const code = encodeStr.charCodeAt(i); -// if (code === 0) { -// if (allowZero) { -// hex += '00'; -// } else { -// break; -// } -// } else { -// const n = code.toString(16); -// hex += n.length < 2 ? `0${n}` : n; -// } -// } -// return `0x${hex}`; -// }; -function utils_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var utils_RewireModuleId_ = null; -function utils_getRewireModuleId_() { - if (utils_RewireModuleId_ === null) { - let globalVariable = utils_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - utils_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return utils_RewireModuleId_; -} -function utils_getRewireRegistry_() { - let theGlobalVariable = utils_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function utils_getRewiredData_() { - let moduleId = utils_getRewireModuleId_(); - let registry = utils_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = utils_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var utils_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let utils_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(utils_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', utils_get_); - addPropertyToAPIObject('__GetDependency__', utils_get_); - addPropertyToAPIObject('__Rewire__', utils_set_); - addPropertyToAPIObject('__set__', utils_set_); - addPropertyToAPIObject('__reset__', utils_reset_); - addPropertyToAPIObject('__ResetDependency__', utils_reset_); - addPropertyToAPIObject('__with__', utils_with_); -})(); -function utils_get_(variableName) { - let rewireData = utils_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return utils_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === utils_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function utils_get_original_(variableName) { - switch (variableName) { - case "sha256": - return util_sha256; - case "bs58": - return (bs58_default()); - case "arrayBufferToHex": - return arrayBufferToHex; - case "base58": - return base58; - case "BigNumber": - return bignumber; - case "isBigNumber": - return isBigNumber; - case "isString": - return isString; - case "UNIT_MAP": - return UNIT_MAP; - case "toBigNumber": - return toBigNumber; - case "getValueOfUnit": - return getValueOfUnit; - case "UNSIGNED_256_INT": - return UNSIGNED_256_INT; - case "unpackSpecifiedTypeData": - return unpackSpecifiedTypeData; - case "Transaction": - return Transaction; - case "transform": - return transform; - case "OUTPUT_TRANSFORMERS": - return OUTPUT_TRANSFORMERS; - case "transformArrayToMap": - return transformArrayToMap; - case "encodeAddress": - return encodeAddress; - } - return undefined; -} -function utils_assign_(variableName, value) { - let rewireData = utils_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return utils_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function utils_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function utils_update_operation_(operation, variableName, prefix) { - var oldValue = utils_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - utils_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function utils_set_(variableName, value) { - let rewireData = utils_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - utils_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = utils_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - utils_reset_(variableName); - }; - } -} -function utils_reset_(variableName) { - let rewireData = utils_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete utils_getRewireRegistry_()[utils_getRewireModuleId_]; - } - ; -} -function utils_with_(object) { - let rewireData = utils_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const utils = (utils_RewireAPI_); -;// CONCATENATED MODULE: ./src/util/proto.js -/** - * @file proto utils - * @author atom-yang - */ - - - - -const coreRootProto = proto_get_("protobuf").Root.fromJSON(proto_get_("coreDescriptor")); -/* eslint-disable no-unused-vars */ - -const { - Transaction, - Hash, - Address, - TransactionFeeCharged, - ResourceTokenCharged -} = proto_get_("coreRootProto"); -const getFee = function (base64Str) { - let type = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'TransactionFeeCharged'; - if (['ResourceTokenCharged', 'TransactionFeeCharged'].indexOf(type) === -1) { - throw new Error('type needs to be one of ResourceTokenCharged and TransactionFeeCharged'); - } - const dataType = proto_get_("coreRootProto")[type]; - let deserialize = dataType.decode(Buffer.from(base64Str, 'base64')); - deserialize = dataType.toObject(deserialize, { - enums: String, - // enums as string names - longs: String, - // longs as strings (requires long.js) - bytes: String, - // bytes as base64 encoded strings - defaults: true, - // includes default values - arrays: true, - // populates empty arrays (repeated fields) even if defaults=false - objects: true, - // populates empty objects (map fields) even if defaults=false - oneofs: true // includes virtual oneof fields set to the present field's name - }); - // eslint-disable-next-line max-len - let deserializeLogResult = proto_get_("transform")(dataType, deserialize, proto_get_("OUTPUT_TRANSFORMERS")); - deserializeLogResult = proto_get_("transformArrayToMap")(dataType, deserializeLogResult); - return deserializeLogResult; -}; -const getSerializedDataFromLog = log => { - const { - NonIndexed, - Indexed = [] - } = log; - const serializedData = [...(Indexed || [])]; - if (NonIndexed) { - serializedData.push(NonIndexed); - } - return serializedData.join(''); -}; -const getResourceFee = function () { - let Logs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; - if (!Array.isArray(Logs) || Logs.length === 0) { - return []; - } - return Logs.filter(log => log.Name === 'ResourceTokenCharged').map(v => proto_get_("getFee")(proto_get_("getSerializedDataFromLog")(v), 'ResourceTokenCharged')); -}; -const getTransactionFee = function () { - let Logs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; - if (!Array.isArray(Logs) || Logs.length === 0) { - return []; - } - return Logs.filter(log => log.Name === 'TransactionFeeCharged').map(v => proto_get_("getFee")(proto_get_("getSerializedDataFromLog")(v), 'TransactionFeeCharged')); -}; - -/** - * arrayBuffer To Hex - * - * @alias module:AElf/pbUtils - * @param {Buffer} arrayBuffer arrayBuffer - * @return {string} hex string - */ -const proto_arrayBufferToHex = arrayBuffer => Array.prototype.map.call(new Uint8Array(arrayBuffer), n => `0${n.toString(16)}`.slice(-2)).join(''); - -/** - * get hex rep From Address - * - * @alias module:AElf/pbUtils - * @param {protobuf} address kernel.Address - * @return {string} hex rep of address - */ -const getRepForAddress = address => { - const message = proto_get_("Address").fromObject(address); - let hex = ''; - if (message.value instanceof Buffer) { - hex = message.value.toString('hex'); - } else { - // Uint8Array - hex = proto_get_("arrayBufferToHex")(message.value); - } - return proto_get_("utils").encodeAddressRep(hex); -}; - -/** - * get address From hex rep - * - * @alias module:AElf/pbUtils - * @param {string} rep address - * @return {protobuf} address kernel.Address - */ -const getAddressFromRep = rep => { - const hex = proto_get_("utils").decodeAddressRep(rep); - return proto_get_("Address").create({ - value: Buffer.from(hex.replace('0x', ''), 'hex') - }); -}; - -/** - * get address From hex rep - * - * @alias module:AElf/pbUtils - * @param {string} rep address - * @return {protobuf} address kernel.Address - */ -const getAddressObjectFromRep = rep => proto_get_("Address").toObject(proto_get_("getAddressFromRep")(rep)); - -/** - * get hex rep From hash - * - * @alias module:AElf/pbUtils - * @param {protobuf} hash kernel.Hash - * @return {string} hex rep - */ -const getRepForHash = hash => { - const message = proto_get_("Address").fromObject(hash); - let hex = ''; - if (message.value instanceof Buffer) { - hex = message.value.toString('hex'); - } else { - // Uint8Array - hex = proto_get_("arrayBufferToHex")(message.value); - } - return hex; -}; - -/** - * get Hash From Hex - * - * @alias module:AElf/pbUtils - * @param {string} hex string - * @return {protobuf} kernel.Hash - */ -const getHashFromHex = hex => proto_get_("Hash").create({ - value: Buffer.from(hex.replace('0x', ''), 'hex') -}); - -/** - * get Hash Object From Hex - * - * @alias module:AElf/pbUtils - * @param {string} hex string - * @return {Object} kernel.Hash Hash ot Object - */ -const getHashObjectFromHex = hex => proto_get_("Hash").toObject(proto_get_("getHashFromHex")(hex)); - -/** - * encode Transaction to protobuf type - * - * @alias module:AElf/pbUtils - * @param {Object} tx object - * @return {protobuf} kernel.Transaction - */ -const encodeTransaction = tx => proto_get_("Transaction").encode(tx).finish(); - -/** - * get Transaction - * - * @alias module:AElf/pbUtils - * @param {string} from - * @param {string} to - * @param {string} methodName - * @param {string} params - * @return {protobuf} kernel.Transaction - */ -const getTransaction = (from, to, methodName, params) => { - const txn = { - from: proto_get_("getAddressFromRep")(from), - to: proto_get_("getAddressFromRep")(to), - methodName, - params - }; - return proto_get_("Transaction").create(txn); -}; - -/* eslint-enable */ -function proto_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var proto_RewireModuleId_ = null; -function proto_getRewireModuleId_() { - if (proto_RewireModuleId_ === null) { - let globalVariable = proto_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - proto_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return proto_RewireModuleId_; -} -function proto_getRewireRegistry_() { - let theGlobalVariable = proto_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function proto_getRewiredData_() { - let moduleId = proto_getRewireModuleId_(); - let registry = proto_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = proto_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var proto_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let proto_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(proto_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', proto_get_); - addPropertyToAPIObject('__GetDependency__', proto_get_); - addPropertyToAPIObject('__Rewire__', proto_set_); - addPropertyToAPIObject('__set__', proto_set_); - addPropertyToAPIObject('__reset__', proto_reset_); - addPropertyToAPIObject('__ResetDependency__', proto_reset_); - addPropertyToAPIObject('__with__', proto_with_); -})(); -function proto_get_(variableName) { - let rewireData = proto_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return proto_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === proto_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function proto_get_original_(variableName) { - switch (variableName) { - case "protobuf": - return _filterWildcardImport__(light); - case "coreDescriptor": - return core_proto_namespaceObject; - case "coreRootProto": - return coreRootProto; - case "transform": - return transform; - case "OUTPUT_TRANSFORMERS": - return OUTPUT_TRANSFORMERS; - case "transformArrayToMap": - return transformArrayToMap; - case "getFee": - return getFee; - case "getSerializedDataFromLog": - return getSerializedDataFromLog; - case "Address": - return Address; - case "arrayBufferToHex": - return proto_arrayBufferToHex; - case "utils": - return _filterWildcardImport__(utils_namespaceObject); - case "getAddressFromRep": - return getAddressFromRep; - case "Hash": - return Hash; - case "getHashFromHex": - return getHashFromHex; - case "Transaction": - return Transaction; - } - return undefined; -} -function proto_assign_(variableName, value) { - let rewireData = proto_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return proto_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function proto_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function proto_update_operation_(operation, variableName, prefix) { - var oldValue = proto_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - proto_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function proto_set_(variableName, value) { - let rewireData = proto_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - proto_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = proto_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - proto_reset_(variableName); - }; - } -} -function proto_reset_(variableName) { - let rewireData = proto_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete proto_getRewireRegistry_()[proto_getRewireModuleId_]; - } - ; -} -function proto_with_(object) { - let rewireData = proto_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -function _filterWildcardImport__() { - let wildcardImport = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; - let validPropertyNames = Object.keys(wildcardImport).filter(function (propertyName) { - return propertyName !== '__get__' && propertyName !== '__set__' && propertyName !== '__reset__' && propertyName !== '__with__' && propertyName !== '__GetDependency__' && propertyName !== '__Rewire__' && propertyName !== '__ResetDependency__' && propertyName !== '__RewireAPI__'; - }); - return validPropertyNames.reduce(function (filteredWildcardImport, propertyName) { - filteredWildcardImport[propertyName] = wildcardImport[propertyName]; - return filteredWildcardImport; - }, {}); -} - -/* harmony default export */ const proto = (proto_RewireAPI_); -;// CONCATENATED MODULE: ./src/util/bloom.js -/** - * @file bloom - * @author joshstevens19 - * @link https://github.com/joshstevens19/ethereum-bloom-filters - */ - - -/** - * @deprecated Use the new Bloom instead - */ -function isBloom(bloom) { - if (bloom instanceof Buffer || bloom instanceof Uint8Array) { - return bloom.length === 256; - } - // if (!/^(0x)?[0-9a-f]{512}$/i.test(bloom)) { - // return false; - // } - - if (/^(0x)?[0-9a-f]{512}$/.test(bloom) || /^(0x)?[0-9A-F]{512}$/.test(bloom)) { - return true; - } - return false; -} - -/** - * @param codePoint - * @return {number} - */ -function codePointToInt(codePoint) { - if (codePoint >= 48 && codePoint <= 57) { - /* ['0'..'9'] -> [0..9] */ - return codePoint - 48; - } - if (codePoint >= 65 && codePoint <= 70) { - /* ['A'..'F'] -> [10..15] */ - return codePoint - 55; - } - if (codePoint >= 97 && codePoint <= 102) { - /* ['a'..'f'] -> [10..15] */ - return codePoint - 87; - } - throw new Error('invalid bloom'); -} - -/** - * @param {string} bloom hex string - * @param {string} hash hex string - * @return {boolean} - */ -function isInBloom(bloom, hash) { - if (!bloom_get_("isBloom")(bloom)) { - throw new Error('Invalid Bloom'); - } - for (let i = 0; i < 12; i += 4) { - // calculate bit position in bloom filter that must be active - const bitpos = (parseInt(hash.substr(i, 2), 16) << 8) + parseInt(hash.substr(i + 2, 2), 16) & 2047; - - // test if bitpos in bloom is active - const code = bloom_get_("codePointToInt")(bloom.charCodeAt(bloom.length - 1 - Math.floor(bitpos / 4))); - const offset = 1 << bitpos % 4; - if ((code & offset) !== offset) { - return false; - } - } - return true; -} - -/** - * @param {string} bloom base64 string - * @param {string} eventName utf-8 string, such as `Transferred` - * @return {boolean} - */ -function isEventInBloom(bloom, eventName) { - return bloom_get_("isInBloom")(Buffer.from(bloom, 'base64').toString('hex'), bloom_get_("sha256")(eventName)); -} -function isIndexedInBloom(bloom, indexed) { - return bloom_get_("isInBloom")(Buffer.from(bloom, 'base64').toString('hex'), bloom_get_("sha256")(Buffer.from(indexed, 'base64'))); -} -function isAddressInBloom(bloom, address) { - const encodedAddress = bloom_get_("Address").encode(bloom_get_("getAddressObjectFromRep")(address)).finish(); - return bloom_get_("isInBloom")(Buffer.from(bloom, 'base64').toString('hex'), bloom_get_("sha256")(encodedAddress)); -} -function bloom_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var bloom_RewireModuleId_ = null; -function bloom_getRewireModuleId_() { - if (bloom_RewireModuleId_ === null) { - let globalVariable = bloom_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - bloom_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return bloom_RewireModuleId_; -} -function bloom_getRewireRegistry_() { - let theGlobalVariable = bloom_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function bloom_getRewiredData_() { - let moduleId = bloom_getRewireModuleId_(); - let registry = bloom_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = bloom_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var bloom_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let bloom_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(bloom_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', bloom_get_); - addPropertyToAPIObject('__GetDependency__', bloom_get_); - addPropertyToAPIObject('__Rewire__', bloom_set_); - addPropertyToAPIObject('__set__', bloom_set_); - addPropertyToAPIObject('__reset__', bloom_reset_); - addPropertyToAPIObject('__ResetDependency__', bloom_reset_); - addPropertyToAPIObject('__with__', bloom_with_); -})(); -function bloom_get_(variableName) { - let rewireData = bloom_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return bloom_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === bloom_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function bloom_get_original_(variableName) { - switch (variableName) { - case "isBloom": - return isBloom; - case "codePointToInt": - return codePointToInt; - case "isInBloom": - return isInBloom; - case "sha256": - return util_sha256; - case "Address": - return Address; - case "getAddressObjectFromRep": - return getAddressObjectFromRep; - } - return undefined; -} -function bloom_assign_(variableName, value) { - let rewireData = bloom_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return bloom_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function bloom_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function bloom_update_operation_(operation, variableName, prefix) { - var oldValue = bloom_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - bloom_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function bloom_set_(variableName, value) { - let rewireData = bloom_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - bloom_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = bloom_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - bloom_reset_(variableName); - }; - } -} -function bloom_reset_(variableName) { - let rewireData = bloom_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete bloom_getRewireRegistry_()[bloom_getRewireModuleId_]; - } - ; -} -function bloom_with_(object) { - let rewireData = bloom_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const bloom = (bloom_RewireAPI_); -;// CONCATENATED MODULE: ./src/chain/chainMethod.js -/** - * @file method on chain - * @author atom-yang - */ - -class ChainMethod { - constructor(_ref) { - let { - name, - call, - method = 'GET', - params = [], - inputFormatter = [], - outputFormatter = null - } = _ref; - this.name = name; - this.call = call; - this.requestMethod = method; - this.params = params; - this.inputFormatter = inputFormatter; - this.outputFormatter = outputFormatter; - this.requestManager = null; - this.run = this.run.bind(this); - } - formatInput(args) { - if (!this.inputFormatter || this.inputFormatter.length === 0) { - return args; - } - return args.map((arg, index) => { - const formatter = this.inputFormatter[index]; - return formatter ? formatter(arg) : arg; - }); - } - setRequestManager(manager) { - this.requestManager = manager; - } - formatOutput(result) { - return this.outputFormatter && result ? this.outputFormatter(result) : result; - } - extractArgumentsIntoObject(args) { - if (args.length < this.params.length) { - throw new Error(`should supply enough parameters for ${this.call}`); - } - const result = { - method: this.call, - requestMethod: this.requestMethod, - isSync: false, - callback: chainMethod_get_("noop"), - params: {} - }; - this.formatInput(args).forEach((arg, index) => { - if (index > this.params.length - 1) { - // if index is greater than params.length, that means arg is an extra argument - if (chainMethod_get_("isFunction")(arg)) { - // if there is a callback, user want to be in async mode, set isSync to false - result.callback = arg; - result.isSync = false; - } - if (chainMethod_get_("isBoolean")(arg?.sync)) { - result.isSync = arg.sync; - } - } else { - // if index is less than or equal to params.length, that means arg is one of the params - result.params[this.params[index]] = arg; - } - }); - return result; - } - run() { - for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { - args[_key] = arguments[_key]; - } - const argsObj = this.extractArgumentsIntoObject(args); - if (argsObj.isSync) { - return this.formatOutput(this.requestManager.send(argsObj)); - } - return this.requestManager.sendAsync(argsObj).then(result => { - argsObj.callback(null, this.formatOutput(result)); - return this.formatOutput(result); - }).catch(err => { - argsObj.callback(err); - throw err; - }); - } -} -function chainMethod_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var chainMethod_RewireModuleId_ = null; -function chainMethod_getRewireModuleId_() { - if (chainMethod_RewireModuleId_ === null) { - let globalVariable = chainMethod_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - chainMethod_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return chainMethod_RewireModuleId_; -} -function chainMethod_getRewireRegistry_() { - let theGlobalVariable = chainMethod_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function chainMethod_getRewiredData_() { - let moduleId = chainMethod_getRewireModuleId_(); - let registry = chainMethod_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = chainMethod_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var chainMethod_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let chainMethod_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(chainMethod_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', chainMethod_get_); - addPropertyToAPIObject('__GetDependency__', chainMethod_get_); - addPropertyToAPIObject('__Rewire__', chainMethod_set_); - addPropertyToAPIObject('__set__', chainMethod_set_); - addPropertyToAPIObject('__reset__', chainMethod_reset_); - addPropertyToAPIObject('__ResetDependency__', chainMethod_reset_); - addPropertyToAPIObject('__with__', chainMethod_with_); -})(); -function chainMethod_get_(variableName) { - let rewireData = chainMethod_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return chainMethod_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === chainMethod_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function chainMethod_get_original_(variableName) { - switch (variableName) { - case "noop": - return noop; - case "isFunction": - return isFunction; - case "isBoolean": - return isBoolean; - } - return undefined; -} -function chainMethod_assign_(variableName, value) { - let rewireData = chainMethod_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return chainMethod_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function chainMethod_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function chainMethod_update_operation_(operation, variableName, prefix) { - var oldValue = chainMethod_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - chainMethod_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function chainMethod_set_(variableName, value) { - let rewireData = chainMethod_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - chainMethod_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = chainMethod_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - chainMethod_reset_(variableName); - }; - } -} -function chainMethod_reset_(variableName) { - let rewireData = chainMethod_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete chainMethod_getRewireRegistry_()[chainMethod_getRewireModuleId_]; - } - ; -} -function chainMethod_with_(object) { - let rewireData = chainMethod_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let chainMethod_typeOfOriginalExport = typeof ChainMethod; -function chainMethod_addNonEnumerableProperty(name, value) { - Object.defineProperty(ChainMethod, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((chainMethod_typeOfOriginalExport === 'object' || chainMethod_typeOfOriginalExport === 'function') && Object.isExtensible(ChainMethod)) { - chainMethod_addNonEnumerableProperty('__get__', chainMethod_get_); - chainMethod_addNonEnumerableProperty('__GetDependency__', chainMethod_get_); - chainMethod_addNonEnumerableProperty('__Rewire__', chainMethod_set_); - chainMethod_addNonEnumerableProperty('__set__', chainMethod_set_); - chainMethod_addNonEnumerableProperty('__reset__', chainMethod_reset_); - chainMethod_addNonEnumerableProperty('__ResetDependency__', chainMethod_reset_); - chainMethod_addNonEnumerableProperty('__with__', chainMethod_with_); - chainMethod_addNonEnumerableProperty('__RewireAPI__', chainMethod_RewireAPI_); -} - -;// CONCATENATED MODULE: ./src/util/merkleTree.js - -const fromTwoBuffers = data => { - if (data.length !== 2) throw new TypeError('Wrong data size.'); - const compared = Buffer.compare(data[0], data[1]); - if (compared > 0) { - data.reverse(); - } - let buffer = Buffer.concat(data); - buffer = Buffer.from(merkleTree_get_("sha256")(buffer), 'hex'); - return buffer; -}; -const generateMerkleTree = data => { - if (data.length === 0) { - return null; - } - if (data.length % 2 === 1) { - data.push(data[data.length - 1]); - } - let nodeToAdd = data.length / 2; - let newAdded = 0; - let i = 0; - while (i < data.length - 1) { - const left = data[i++]; - const right = data[i++]; - data.push(merkleTree_get_("fromTwoBuffers")([left, right])); - if (++newAdded === nodeToAdd) { - // complete this row - if (nodeToAdd % 2 === 1 && nodeToAdd !== 1) { - nodeToAdd++; - data.push(data[data.length - 1]); - } - // start a new row - nodeToAdd /= 2; - newAdded = 0; - } - } - return data; -}; -const generateMerklePath = (indexArg, leafCount, tree) => { - let index = indexArg; - if (tree.length === 0 || index >= leafCount) return null; - let firstInRow = 0; - let rowcount = leafCount; - const path = []; - while (index < tree.length - 1) { - const neighbor = index % 2 === 0 ? index + 1 : index - 1; - path.push(tree[neighbor]); - rowcount = rowcount % 2 === 0 ? rowcount : rowcount + 1; - const shift = Math.floor((index - firstInRow) / 2); - firstInRow += rowcount; - index = firstInRow + shift; - rowcount /= 2; - } - return path; -}; -const computeRoot = data => { - const merkleTree = merkleTree_get_("generateMerkleTree")(data); - return merkleTree[merkleTree.length - 1]; -}; -const getMerklePath = (index, data) => { - const leafCount = data.length; - const merkleTree = merkleTree_get_("generateMerkleTree")(data); - return merkleTree_get_("generateMerklePath")(index, leafCount, merkleTree); -}; -const node = buffer => Buffer.from(merkleTree_get_("sha256")(buffer), 'hex'); -function merkleTree_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var merkleTree_RewireModuleId_ = null; -function merkleTree_getRewireModuleId_() { - if (merkleTree_RewireModuleId_ === null) { - let globalVariable = merkleTree_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - merkleTree_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return merkleTree_RewireModuleId_; -} -function merkleTree_getRewireRegistry_() { - let theGlobalVariable = merkleTree_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function merkleTree_getRewiredData_() { - let moduleId = merkleTree_getRewireModuleId_(); - let registry = merkleTree_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = merkleTree_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var merkleTree_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let merkleTree_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(merkleTree_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', merkleTree_get_); - addPropertyToAPIObject('__GetDependency__', merkleTree_get_); - addPropertyToAPIObject('__Rewire__', merkleTree_set_); - addPropertyToAPIObject('__set__', merkleTree_set_); - addPropertyToAPIObject('__reset__', merkleTree_reset_); - addPropertyToAPIObject('__ResetDependency__', merkleTree_reset_); - addPropertyToAPIObject('__with__', merkleTree_with_); -})(); -function merkleTree_get_(variableName) { - let rewireData = merkleTree_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return merkleTree_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === merkleTree_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function merkleTree_get_original_(variableName) { - switch (variableName) { - case "sha256": - return util_sha256; - case "fromTwoBuffers": - return fromTwoBuffers; - case "generateMerkleTree": - return generateMerkleTree; - case "generateMerklePath": - return generateMerklePath; - } - return undefined; -} -function merkleTree_assign_(variableName, value) { - let rewireData = merkleTree_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return merkleTree_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function merkleTree_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function merkleTree_update_operation_(operation, variableName, prefix) { - var oldValue = merkleTree_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - merkleTree_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function merkleTree_set_(variableName, value) { - let rewireData = merkleTree_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - merkleTree_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = merkleTree_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - merkleTree_reset_(variableName); - }; - } -} -function merkleTree_reset_(variableName) { - let rewireData = merkleTree_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete merkleTree_getRewireRegistry_()[merkleTree_getRewireModuleId_]; - } - ; -} -function merkleTree_with_(object) { - let rewireData = merkleTree_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const merkleTree = (merkleTree_RewireAPI_); -// EXTERNAL MODULE: ./node_modules/elliptic/lib/elliptic.js -var elliptic = __webpack_require__(48); -var elliptic_default = /*#__PURE__*/__webpack_require__.n(elliptic); -// EXTERNAL MODULE: ./node_modules/bip39/src/index.js -var src = __webpack_require__(156); -// EXTERNAL MODULE: ./node_modules/hdkey/lib/hdkey.js -var hdkey = __webpack_require__(113); -var hdkey_default = /*#__PURE__*/__webpack_require__.n(hdkey); -// EXTERNAL MODULE: ./node_modules/crypto-js/aes.js -var aes = __webpack_require__(68); -var aes_default = /*#__PURE__*/__webpack_require__.n(aes); -// EXTERNAL MODULE: ./node_modules/crypto-js/enc-utf8.js -var enc_utf8 = __webpack_require__(74); -var enc_utf8_default = /*#__PURE__*/__webpack_require__.n(enc_utf8); -// EXTERNAL MODULE: ./node_modules/scryptsy/lib/index.js -var lib = __webpack_require__(125); -var lib_default = /*#__PURE__*/__webpack_require__.n(lib); -// EXTERNAL MODULE: ./node_modules/browserify-cipher/index.js -var browserify_cipher = __webpack_require__(164); -// EXTERNAL MODULE: ./node_modules/randombytes/index.js -var randombytes = __webpack_require__(112); -var randombytes_default = /*#__PURE__*/__webpack_require__.n(randombytes); -;// CONCATENATED MODULE: ./src/util/keccak.js -const createKeccakHash = __webpack_require__(165); -const keccak = bits => str => { - let msg; - if (str.slice(0, 2) === '0x') { - msg = []; - for (let i = 2, l = str.length; i < l; i += 2) { - msg.push(parseInt(str.slice(i, i + 2), 16)); - } - msg = Buffer.from(msg); - } else { - msg = str; - } - const instance = keccak_get_("createKeccakHash")(`keccak${bits}`); - return `0x${instance.update(msg).digest('hex')}`; -}; -const keccak256 = keccak_get_("keccak")(256); -const keccak512 = keccak_get_("keccak")(512); -const keccak256s = keccak_get_("keccak")(256); -const keccak512s = keccak_get_("keccak")(512); -function keccak_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var keccak_RewireModuleId_ = null; -function keccak_getRewireModuleId_() { - if (keccak_RewireModuleId_ === null) { - let globalVariable = keccak_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - keccak_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return keccak_RewireModuleId_; -} -function keccak_getRewireRegistry_() { - let theGlobalVariable = keccak_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function keccak_getRewiredData_() { - let moduleId = keccak_getRewireModuleId_(); - let registry = keccak_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = keccak_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var keccak_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let keccak_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(keccak_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', keccak_get_); - addPropertyToAPIObject('__GetDependency__', keccak_get_); - addPropertyToAPIObject('__Rewire__', keccak_set_); - addPropertyToAPIObject('__set__', keccak_set_); - addPropertyToAPIObject('__reset__', keccak_reset_); - addPropertyToAPIObject('__ResetDependency__', keccak_reset_); - addPropertyToAPIObject('__with__', keccak_with_); -})(); -function keccak_get_(variableName) { - let rewireData = keccak_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return keccak_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === keccak_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function keccak_get_original_(variableName) { - switch (variableName) { - case "createKeccakHash": - return createKeccakHash; - case "keccak": - return keccak; - } - return undefined; -} -function keccak_assign_(variableName, value) { - let rewireData = keccak_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return keccak_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function keccak_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function keccak_update_operation_(operation, variableName, prefix) { - var oldValue = keccak_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - keccak_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function keccak_set_(variableName, value) { - let rewireData = keccak_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - keccak_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = keccak_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - keccak_reset_(variableName); - }; - } -} -function keccak_reset_(variableName) { - let rewireData = keccak_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete keccak_getRewireRegistry_()[keccak_getRewireModuleId_]; - } - ; -} -function keccak_with_(object) { - let rewireData = keccak_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const util_keccak = ((/* unused pure expression or super */ null && (keccak_RewireAPI_))); -;// CONCATENATED MODULE: ./src/util/keyStore.js -/** - * @file AElf keyStore tools - * @author atom-yang - */ - - - - - -const AES_MODES = { - 'aes-128-ecb': { - cipher: 'AES', - key: 128, - iv: 0, - mode: 'ECB', - type: 'block' - }, - 'aes-192-ecb': { - cipher: 'AES', - key: 192, - iv: 0, - mode: 'ECB', - type: 'block' - }, - 'aes-256-ecb': { - cipher: 'AES', - key: 256, - iv: 0, - mode: 'ECB', - type: 'block' - }, - 'aes-128-cbc': { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'CBC', - type: 'block' - }, - 'aes-192-cbc': { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'CBC', - type: 'block' - }, - 'aes-256-cbc': { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'CBC', - type: 'block' - }, - aes128: { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'CBC', - type: 'block' - }, - aes192: { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'CBC', - type: 'block' - }, - aes256: { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'CBC', - type: 'block' - }, - 'aes-128-cfb': { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'CFB', - type: 'stream' - }, - 'aes-192-cfb': { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'CFB', - type: 'stream' - }, - 'aes-256-cfb': { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'CFB', - type: 'stream' - }, - 'aes-128-cfb8': { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'CFB8', - type: 'stream' - }, - 'aes-192-cfb8': { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'CFB8', - type: 'stream' - }, - 'aes-256-cfb8': { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'CFB8', - type: 'stream' - }, - 'aes-128-cfb1': { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'CFB1', - type: 'stream' - }, - 'aes-192-cfb1': { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'CFB1', - type: 'stream' - }, - 'aes-256-cfb1': { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'CFB1', - type: 'stream' - }, - 'aes-128-ofb': { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'OFB', - type: 'stream' - }, - 'aes-192-ofb': { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'OFB', - type: 'stream' - }, - 'aes-256-ofb': { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'OFB', - type: 'stream' - }, - 'aes-128-ctr': { - cipher: 'AES', - key: 128, - iv: 16, - mode: 'CTR', - type: 'stream' - }, - 'aes-192-ctr': { - cipher: 'AES', - key: 192, - iv: 16, - mode: 'CTR', - type: 'stream' - }, - 'aes-256-ctr': { - cipher: 'AES', - key: 256, - iv: 16, - mode: 'CTR', - type: 'stream' - }, - 'aes-128-gcm': { - cipher: 'AES', - key: 128, - iv: 12, - mode: 'GCM', - type: 'auth' - }, - 'aes-192-gcm': { - cipher: 'AES', - key: 192, - iv: 12, - mode: 'GCM', - type: 'auth' - }, - 'aes-256-gcm': { - cipher: 'AES', - key: 256, - iv: 12, - mode: 'GCM', - type: 'auth' - } -}; -const defaultOptions = { - dklen: 32, - n: 8192, - // 2048 4096 8192 16384 - r: 8, - p: 1, - cipher: 'aes-128-ctr' -}; - -/** - * getKeyStore - * - * @method getKeyStore - * @param {Object} walletInfoInput walletInfo - * @param {string} password password - * @param {Object} option option - * @return {Object} keyStore - */ -function getKeystore(_ref, password) { - let { - mnemonic, - privateKey, - nickName = '', - address = '' - } = _ref; - let option = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : keyStore_get_("defaultOptions"); - const opt = { - ...keyStore_get_("defaultOptions"), - ...option - }; - const { - cipher = 'aes-128-ctr' - } = opt; - const sliceLength = /128/.test(cipher) ? 16 : 32; - const salt = keyStore_get_("randomBytes")(32); // instance of Buffer - const ivLength = (keyStore_get_("AES_MODES")[cipher.toLowerCase()] || {}).iv; - const iv = keyStore_get_("randomBytes")(ivLength === undefined ? 16 : ivLength); // instance of Buffer - const derivedKey = keyStore_get_("scrypt")(Buffer.from(password, 'utf8'), salt, opt.n, opt.r, opt.p, opt.dklen); // instance of Buffer - const privateKeyCipher = keyStore_get_("createCipheriv")(cipher, derivedKey.slice(0, sliceLength), iv); - const privateKeyEncrypted = Buffer.concat([privateKeyCipher.update(Buffer.from(privateKey, 'hex')), privateKeyCipher.final()]); - const mnemonicCipher = keyStore_get_("createCipheriv")(cipher, derivedKey.slice(0, sliceLength), iv); - const mnemonicEncrypted = Buffer.concat([mnemonicCipher.update(Buffer.from(mnemonic, 'utf8')), mnemonicCipher.final()]); - const rawMac = Buffer.concat([derivedKey.slice(16), privateKeyEncrypted]); - const mac = keyStore_get_("keccak256")(rawMac).replace('0x', ''); - return { - version: 1, - type: 'aelf', - nickName, - address, - crypto: { - cipher, - ciphertext: privateKeyEncrypted.toString('hex'), - cipherparams: { - iv: iv.toString('hex') - }, - mnemonicEncrypted: mnemonicEncrypted.toString('hex'), - kdf: 'scrypt', - kdfparams: { - r: opt.r, - n: opt.n, - p: opt.p, - dklen: opt.dklen, - salt: salt.toString('hex') - }, - mac - } - }; -} - -/** - * unlock AElf key store - * - * @method unlockKeystore - * @param {Object} keyStoreInput key store input - * @param {string} password password - * @return {Object} walletInfo - */ -function unlockKeystore(_ref2, password) { - let { - crypto, - nickName = '', - address = '' - } = _ref2; - let error = null; - let result = null; - const { - kdfparams, - mac, - cipherparams, - mnemonicEncrypted = '', - ciphertext, - cipher = 'aes-128-ctr' - } = crypto; - const sliceLength = /128/.test(cipher) ? 16 : 32; - const iv = Buffer.from(cipherparams.iv, 'hex'); - const derivedKey = keyStore_get_("scrypt")(Buffer.from(password), Buffer.from(kdfparams.salt, 'hex'), kdfparams.n, kdfparams.r, kdfparams.p, kdfparams.dklen || kdfparams.dkLen); - const rawMac = Buffer.concat([derivedKey.slice(16), Buffer.from(ciphertext, 'hex')]); - const currentMac = keyStore_get_("keccak256")(rawMac).replace('0x', ''); - if (currentMac === mac) { - const privateKeyDeCipher = keyStore_get_("createDecipheriv")(cipher, derivedKey.slice(0, sliceLength), iv); - const privateKey = Buffer.concat([privateKeyDeCipher.update(Buffer.from(ciphertext, 'hex')), privateKeyDeCipher.final()]).toString('hex'); - const mnemonicDeCipher = keyStore_get_("createDecipheriv")(cipher, derivedKey.slice(0, sliceLength), iv); - const mnemonic = Buffer.concat([mnemonicDeCipher.update(Buffer.from(mnemonicEncrypted, 'hex')), mnemonicDeCipher.final()]).toString('utf8'); - result = { - nickName, - address, - mnemonic, - privateKey - }; - } else { - error = { - ...keyStore_get_("KEY_STORE_ERRORS").INVALID_PASSWORD - }; - throw error; - } - return result; -} - -/** - * checkPassword - * - * @method checkPassword - * @param {Object} keyStoreInput keyStoreInput - * @param {string} password password - * @return {boolean} true or false - */ -const checkPassword = (keyStoreInput, password) => { - try { - const result = keyStore_get_("unlockKeystore")(keyStoreInput, password); - return !!result.privateKey; - } catch (e) { - return false; - } -}; -function keyStore_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var keyStore_RewireModuleId_ = null; -function keyStore_getRewireModuleId_() { - if (keyStore_RewireModuleId_ === null) { - let globalVariable = keyStore_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - keyStore_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return keyStore_RewireModuleId_; -} -function keyStore_getRewireRegistry_() { - let theGlobalVariable = keyStore_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function keyStore_getRewiredData_() { - let moduleId = keyStore_getRewireModuleId_(); - let registry = keyStore_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = keyStore_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var keyStore_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let keyStore_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(keyStore_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', keyStore_get_); - addPropertyToAPIObject('__GetDependency__', keyStore_get_); - addPropertyToAPIObject('__Rewire__', keyStore_set_); - addPropertyToAPIObject('__set__', keyStore_set_); - addPropertyToAPIObject('__reset__', keyStore_reset_); - addPropertyToAPIObject('__ResetDependency__', keyStore_reset_); - addPropertyToAPIObject('__with__', keyStore_with_); -})(); -function keyStore_get_(variableName) { - let rewireData = keyStore_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return keyStore_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === keyStore_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function keyStore_get_original_(variableName) { - switch (variableName) { - case "defaultOptions": - return defaultOptions; - case "randomBytes": - return (randombytes_default()); - case "AES_MODES": - return AES_MODES; - case "scrypt": - return (lib_default()); - case "createCipheriv": - return browserify_cipher/* createCipheriv */.CW; - case "keccak256": - return keccak256; - case "createDecipheriv": - return browserify_cipher/* createDecipheriv */.G_; - case "KEY_STORE_ERRORS": - return KEY_STORE_ERRORS; - case "unlockKeystore": - return unlockKeystore; - } - return undefined; -} -function keyStore_assign_(variableName, value) { - let rewireData = keyStore_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return keyStore_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function keyStore_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function keyStore_update_operation_(operation, variableName, prefix) { - var oldValue = keyStore_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - keyStore_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function keyStore_set_(variableName, value) { - let rewireData = keyStore_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - keyStore_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = keyStore_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - keyStore_reset_(variableName); - }; - } -} -function keyStore_reset_(variableName) { - let rewireData = keyStore_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete keyStore_getRewireRegistry_()[keyStore_getRewireModuleId_]; - } - ; -} -function keyStore_with_(object) { - let rewireData = keyStore_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} - -/* harmony default export */ const keyStore = (keyStore_RewireAPI_); -;// CONCATENATED MODULE: ./src/wallet/index.js -/** - * @file wallet - * @author atom-yang - */ - - - - - - - - - - -// eslint-disable-next-line new-cap -const ellipticEc = new (wallet_get_("elliptic").ec)('secp256k1'); - -/** - * Advanced Encryption Standard need crypto-js - * - * @alias module:AElf/wallet - * @param {string} input anything you want to encrypt - * @param {string} password password - * @return {string} using base64 encoding way - * - * @Example - * const AESEncryptPrivateKey = aelf.wallet.AESEncrypt('123', '123'); - * // AESEncryptPrivateKey = "U2FsdGVkX1+RYovrVJVEEl8eiIUA3vx4GrNR+3sqOow=" - * const AESEncryptMnemonic = alef.wallet.AESEncrypt('hello world', '123'); - * // AESEncryptMnemonic = U2FsdGVkX19gCjHzYmoY5FGZA1ArXG+eGZIR77dK2GE= - * - */ -const AESEncrypt = (input, password) => wallet_get_("AES").encrypt(input, password).toString(); - -/** - * Decrypt any encrypted information you want to decrypt - * - * @alias module:AElf/wallet - * @param {string} input anything you want to decrypt - * @param {string} password password - * @return {string} decrypted input, using utf8 decoding way - * - * @Example - * const AESDecryptPrivateKey = aelf.wallet.AESDecrypt('U2FsdGVkX18+tvF7t4rhGOi5cbUvdTH2U5a6Tbu4Ojg=', '123'); - * // AESDecryptPrivateKey = "123" - * const AESDecryptMnemonic = aelf.wallet.AESDecrypt('U2FsdGVkX19gCjHzYmoY5FGZA1ArXG+eGZIR77dK2GE=', '123'); - * // AESDecryptMnemonic = "hello world" - */ -const AESDecrypt = (input, password) => wallet_get_("AES").decrypt(input, password).toString(wallet_get_("encUTF8")); - -/** - * the same as in C# - * - * @alias module:AElf/wallet - * @param {Object} pubKey get the pubKey you want through keyPair - * @return {string} address encoded address - * - * @Example - * const pubKey = wallet.keyPair.getPublic(); - * const address = aelf.wallet.getAddressFromPubKey(pubKey); - */ -const getAddressFromPubKey = pubKey => { - const pubKeyEncoded = pubKey.encode(); - const onceSHAResult = Buffer.from(wallet_get_("sha256")(pubKeyEncoded), 'hex'); - const hash = wallet_get_("sha256")(onceSHAResult).slice(0, 64); - return wallet_get_("encodeAddressRep")(hash); -}; -const _getWallet = function (type, value) { - let BIP44Path = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'm/44\'/1616\'/0\'/0/0'; - // m/purpose'/coin_type'/account'/change/address_index - // "m/44'/1616'/0'/0/0" - - let mnemonic = ''; - let rootSeed = ''; - let childWallet = ''; - let keyPair = ''; - let hdWallet; - switch (type) { - case 'createNewWallet': - mnemonic = wallet_get_("bip39").generateMnemonic(); - rootSeed = wallet_get_("bip39").mnemonicToSeedSync(mnemonic).toString('hex'); - hdWallet = wallet_get_("hdkey").fromMasterSeed(rootSeed); - childWallet = hdWallet.derive(BIP44Path); - keyPair = wallet_get_("ellipticEc").keyFromPrivate(childWallet.privateKey); - break; - case 'getWalletByMnemonic': - mnemonic = value; - rootSeed = wallet_get_("bip39").mnemonicToSeedSync(mnemonic).toString('hex'); - hdWallet = wallet_get_("hdkey").fromMasterSeed(rootSeed); - childWallet = hdWallet.derive(BIP44Path); - keyPair = wallet_get_("ellipticEc").keyFromPrivate(childWallet.privateKey); - break; - case 'getWalletByPrivateKey': - if (typeof value === 'string') { - keyPair = wallet_get_("ellipticEc").keyFromPrivate(wallet_get_("padLeft")(value, 64, '0')); - } else { - keyPair = wallet_get_("ellipticEc").keyFromPrivate(value); - } - break; - default: - throw new Error('not a valid method'); - } - // let mnemonic = bip39.generateMnemonic(); - // let rootSeed = bip39.mnemonicToSeedHex(mnemonic); - // let hdWallet = hdkey.fromMasterSeed(rootSeed); - // let keyPair = ec.keyFromPrivate(xPrivateKey); - // TODO 1.将私钥加密保存,用密码解密才能使用。 - // TODO 2.将助记词机密保存,用密码解密才能获取。 - const privateKey = keyPair.getPrivate().toString(16, 64); - const publicKey = keyPair.getPublic(); - const address = wallet_get_("getAddressFromPubKey")(publicKey); - return { - mnemonic, - BIP44Path, - childWallet, - keyPair, - privateKey, - address - }; -}; - -/** - * get signature - * @param bytesToBeSign - * @param keyPair - * @returns {Buffer} - */ -const getSignature = (bytesToBeSign, keyPair) => { - const privateKey = keyPair.getPrivate('hex'); - const msgHash = wallet_get_("sha256")(bytesToBeSign); - const sigObj = wallet_get_("ellipticEc").sign(Buffer.from(msgHash, 'hex'), privateKey, 'hex', { - canonical: true - }); - const hex = [sigObj.r.toString('hex', 32), sigObj.s.toString('hex', 32), `0${sigObj.recoveryParam.toString()}`].join(''); - return Buffer.from(hex, 'hex'); -}; - -/** - * create a wallet - * - * @alias module:AElf/wallet - * @param {string} BIP44Path - * @return {Object} wallet - * - * @Example - * const wallet = aelf.wallet.createNewWallet(); - * // The format returned is similar to this - * // wallet = { - * // mnemonic: "hello world", - * // BIP44Path: 'm/44\'/1616\'/0\'/0/0', - * // childWallet: {}, - * // keyPair: KeyPair {ec: EC, priv: BN, pub: Point} - * // privateKey: "123f7c123" - * // address: "5uhk3434242424" - * // } - */ -const createNewWallet = function () { - let BIP44Path = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 'm/44\'/1616\'/0\'/0/0'; - return wallet_get_("_getWallet")('createNewWallet', '', BIP44Path); -}; - -/** - * create a wallet by mnemonic - * - * @alias module:AElf/wallet - * @param {string} mnemonic base on bip39 - * @param {string} BIP44Path - * @return {Object} wallet - * - * @Example - * - * const mnemonicWallet = aelf.wallet.getWalletByMnemonic('hello world'); - */ -const getWalletByMnemonic = function (mnemonic) { - let BIP44Path = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'm/44\'/1616\'/0\'/0/0'; - if (wallet_get_("bip39").validateMnemonic(mnemonic)) { - return wallet_get_("_getWallet")('getWalletByMnemonic', mnemonic, BIP44Path); - } - return false; -}; - -/** - * create a wallet by private key - * - * @alias module:AElf/wallet - * @param {string} privateKey privateKey - * @return {Object} wallet - * - * @Example - * const privateKeyWallet = aelf.wallet.getWalletByPrivateKey('123'); - * - */ -const getWalletByPrivateKey = privateKey => wallet_get_("_getWallet")('getWalletByPrivateKey', privateKey); - -/** - * sign a transaction - * - * @alias module:AElf/wallet - * @param {Object} rawTxn rawTxn - * @param {Object} keyPair Any standard key pair - * @return {Object} wallet - * - * @Example - * const rawTxn = proto.getTransaction( - * 'ELF_65dDNxzcd35jESiidFXN5JV8Z7pCwaFnepuYQToNefSgqk9', - * 'ELF_65dDNxzcd35jESiidFXN5JV8Z7pCwaFnepuYQToNefSgqk9', - * 'test', - * [] - * ); - * const signWallet = aelf.wallet.signTransaction(rawTxn, wallet.keyPair); - */ -const signTransaction = (rawTxn, keyPair) => { - let { - params - } = rawTxn; - if (params.length === 0) { - params = null; - } - // proto in proto.Transaction use proto2, but C# use proto3 - // proto3 will remove the default value key. - // The differences between proto2 and proto3: - // https://blog.csdn.net/huanggang982/article/details/77944174 - const ser = wallet_get_("Transaction").encode(rawTxn).finish(); - const sig = wallet_get_("getSignature")(ser, keyPair); - return { - ...rawTxn, - params, - signature: sig - }; -}; - -/** - * Encryption Using Elliptic Curve Algorithms（Use ECDSA) - * Please see https://www.npmjs.com/package/elliptic#incentive - * - * @alias module:AElf/wallet - * @param {string} hexString hex string - * @param {Object} keyPair Any standard key pair - * @return {Buffer} Buffer.from(hex, 'hex') - * - * @Example - * const buffer = aelf.wallet.sign('68656c6c6f20776f726c64', wallet.keyPair); - * buffer = [65, 246, 49, 108, 122, 252, 66, 187, 240, 7, 14, 48, 89, - * 38, 103, 42, 58, 0, 46, 182, 180, 194, 200, 208, 141, 15, 95, 67, - * 234, 248, 31, 199, 73, 151, 2, 133, 233, 84, 180, 216, 116, 9, 153, - * 208, 254, 175, 96, 123, 76, 184, 224, 87, 69, 220, 172, 170, 239, 232, - * 188, 123, 168, 163, 244, 151, 1] - */ -const sign = (hexString, keyPair) => { - const bytesToBeSign = Buffer.from(hexString.replace('0x', ''), 'hex'); - return wallet_get_("getSignature")(bytesToBeSign, keyPair); -}; -let _DefaultExportValue = { - hdkey: wallet_get_("hdkey"), - bip39: wallet_get_("bip39"), - sign: wallet_get_("sign"), - signTransaction: wallet_get_("signTransaction"), - createNewWallet: wallet_get_("createNewWallet"), - getWalletByMnemonic: wallet_get_("getWalletByMnemonic"), - getWalletByPrivateKey: wallet_get_("getWalletByPrivateKey"), - getAddressFromPubKey: wallet_get_("getAddressFromPubKey"), - ellipticEc: wallet_get_("ellipticEc"), - AESEncrypt: wallet_get_("AESEncrypt"), - AESDecrypt: wallet_get_("AESDecrypt"), - keyStore: wallet_get_("keyStore") -}; -/* harmony default export */ const wallet = (_DefaultExportValue); -function wallet_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var wallet_RewireModuleId_ = null; -function wallet_getRewireModuleId_() { - if (wallet_RewireModuleId_ === null) { - let globalVariable = wallet_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - wallet_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return wallet_RewireModuleId_; -} -function wallet_getRewireRegistry_() { - let theGlobalVariable = wallet_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function wallet_getRewiredData_() { - let moduleId = wallet_getRewireModuleId_(); - let registry = wallet_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = wallet_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var wallet_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let wallet_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(wallet_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', wallet_get_); - addPropertyToAPIObject('__GetDependency__', wallet_get_); - addPropertyToAPIObject('__Rewire__', wallet_set_); - addPropertyToAPIObject('__set__', wallet_set_); - addPropertyToAPIObject('__reset__', wallet_reset_); - addPropertyToAPIObject('__ResetDependency__', wallet_reset_); - addPropertyToAPIObject('__with__', wallet_with_); -})(); -function wallet_get_(variableName) { - let rewireData = wallet_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return wallet_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === wallet_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function wallet_get_original_(variableName) { - switch (variableName) { - case "elliptic": - return (elliptic_default()); - case "AES": - return (aes_default()); - case "encUTF8": - return (enc_utf8_default()); - case "sha256": - return util_sha256; - case "encodeAddressRep": - return encodeAddressRep; - case "bip39": - return wallet_filterWildcardImport_(src); - case "hdkey": - return (hdkey_default()); - case "ellipticEc": - return ellipticEc; - case "padLeft": - return padLeft; - case "getAddressFromPubKey": - return getAddressFromPubKey; - case "_getWallet": - return _getWallet; - case "Transaction": - return Transaction; - case "getSignature": - return getSignature; - case "sign": - return sign; - case "signTransaction": - return signTransaction; - case "createNewWallet": - return createNewWallet; - case "getWalletByMnemonic": - return getWalletByMnemonic; - case "getWalletByPrivateKey": - return getWalletByPrivateKey; - case "AESEncrypt": - return AESEncrypt; - case "AESDecrypt": - return AESDecrypt; - case "keyStore": - return wallet_filterWildcardImport_(keyStore_namespaceObject); - } - return undefined; -} -function wallet_assign_(variableName, value) { - let rewireData = wallet_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return wallet_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function wallet_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function wallet_update_operation_(operation, variableName, prefix) { - var oldValue = wallet_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - wallet_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function wallet_set_(variableName, value) { - let rewireData = wallet_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - wallet_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = wallet_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - wallet_reset_(variableName); - }; - } -} -function wallet_reset_(variableName) { - let rewireData = wallet_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete wallet_getRewireRegistry_()[wallet_getRewireModuleId_]; - } - ; -} -function wallet_with_(object) { - let rewireData = wallet_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let wallet_typeOfOriginalExport = typeof _DefaultExportValue; -function wallet_addNonEnumerableProperty(name, value) { - Object.defineProperty(_DefaultExportValue, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((wallet_typeOfOriginalExport === 'object' || wallet_typeOfOriginalExport === 'function') && Object.isExtensible(_DefaultExportValue)) { - wallet_addNonEnumerableProperty('__get__', wallet_get_); - wallet_addNonEnumerableProperty('__GetDependency__', wallet_get_); - wallet_addNonEnumerableProperty('__Rewire__', wallet_set_); - wallet_addNonEnumerableProperty('__set__', wallet_set_); - wallet_addNonEnumerableProperty('__reset__', wallet_reset_); - wallet_addNonEnumerableProperty('__ResetDependency__', wallet_reset_); - wallet_addNonEnumerableProperty('__with__', wallet_with_); - wallet_addNonEnumerableProperty('__RewireAPI__', wallet_RewireAPI_); -} -function wallet_filterWildcardImport_() { - let wildcardImport = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; - let validPropertyNames = Object.keys(wildcardImport).filter(function (propertyName) { - return propertyName !== '__get__' && propertyName !== '__set__' && propertyName !== '__reset__' && propertyName !== '__with__' && propertyName !== '__GetDependency__' && propertyName !== '__Rewire__' && propertyName !== '__ResetDependency__' && propertyName !== '__RewireAPI__'; - }); - return validPropertyNames.reduce(function (filteredWildcardImport, propertyName) { - filteredWildcardImport[propertyName] = wildcardImport[propertyName]; - return filteredWildcardImport; - }, {}); -} - -;// CONCATENATED MODULE: ./src/contract/contractMethod.js -/** - * @file contract method - * @author atom-yang - */ - - - - -class ContractMethod { - constructor(chain, method, contractAddress, walletInstance) { - this._chain = chain; - this._method = method; - const { - resolvedRequestType, - resolvedResponseType - } = method; - this._inputType = resolvedRequestType; - this._outputType = resolvedResponseType; - this._name = method.name; - this._contractAddress = contractAddress; - this._wallet = walletInstance; - this.sendTransaction = this.sendTransaction.bind(this); - this.unpackPackedInput = this.unpackPackedInput.bind(this); - this.packInput = this.packInput.bind(this); - this.unpackOutput = this.unpackOutput.bind(this); - this.bindMethodToContract = this.bindMethodToContract.bind(this); - this.run = this.run.bind(this); - this.request = this.request.bind(this); - this.callReadOnly = this.callReadOnly.bind(this); - this.getSignedTx = this.getSignedTx.bind(this); - this.getRawTx = this.getRawTx.bind(this); - } - packInput(input) { - if (!input) { - return null; - } - let params = contractMethod_get_("transformMapToArray")(this._inputType, input); - params = contractMethod_get_("transform")(this._inputType, params, contractMethod_get_("INPUT_TRANSFORMERS")); - const message = this._inputType.fromObject(params); - return this._inputType.encode(message).finish(); - } - unpackPackedInput(inputPacked) { - if (!inputPacked) { - return null; - } - const result = contractMethod_get_("unpackSpecifiedTypeData")({ - data: inputPacked, - dataType: this._inputType - }); - let params = contractMethod_get_("transform")(this._inputType, result, contractMethod_get_("OUTPUT_TRANSFORMERS")); - params = contractMethod_get_("transformArrayToMap")(this._inputType, params); - return params; - } - unpackOutput(output) { - if (!output) { - return null; - } - let result = contractMethod_get_("unpackSpecifiedTypeData")({ - data: output, - dataType: this._outputType - }); - result = contractMethod_get_("transform")(this._outputType, result, contractMethod_get_("OUTPUT_TRANSFORMERS")); - result = contractMethod_get_("transformArrayToMap")(this._outputType, result); - return result; - } - packOutput(result) { - if (!result) { - return null; - } - let params = contractMethod_get_("transformMapToArray")(this._outputType, result); - params = contractMethod_get_("transform")(this._outputType, params, contractMethod_get_("INPUT_TRANSFORMERS")); - const message = this._outputType.fromObject(params); - return this._outputType.encode(message).finish(); - } - handleTransaction(height, hash, encoded) { - const rawTx = this.getRawTx(height, hash, encoded); - let tx = contractMethod_get_("wallet").signTransaction(rawTx, this._wallet.keyPair); - tx = contractMethod_get_("Transaction").encode(tx).finish(); - // jest environment just go into Buffer branch - // we have test in browser example handly - if (tx instanceof Buffer) { - return tx.toString('hex'); - } - return contractMethod_get_("uint8ArrayToHex")(tx); - } - prepareParametersAsync(args) { - const filterArgs = args.filter(arg => !contractMethod_get_("isFunction")(arg) && !contractMethod_get_("isBoolean")(arg?.sync)); - const encoded = this.packInput(filterArgs[0]); - return this._chain.getChainStatus().then(status => { - const { - BestChainHeight, - BestChainHash - } = status; - return this.handleTransaction(BestChainHeight, BestChainHash, encoded); - }); - } - prepareParameters(args) { - const filterArgs = args.filter(arg => !contractMethod_get_("isFunction")(arg) && !contractMethod_get_("isBoolean")(arg.sync)); - const encoded = this.packInput(filterArgs[0]); - const { - BestChainHeight, - BestChainHash - } = this._chain.getChainStatus({ - sync: true - }); - return this.handleTransaction(BestChainHeight, BestChainHash, encoded); - } - prepareParametersWithBlockInfo(args) { - const filterArgs = args.filter(arg => !contractMethod_get_("isFunction")(arg) && !contractMethod_get_("isBoolean")(arg.sync)); - const encoded = this.packInput(filterArgs[0]); - const { - height, - hash - } = filterArgs[1]; // blockInfo - - return this.handleTransaction(height, hash, encoded); - } - sendTransaction() { - for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { - args[_key] = arguments[_key]; - } - const argsObject = this.extractArgumentsIntoObject(args); - if (argsObject.isSync) { - const parameters = this.prepareParameters(args); - return this._chain.sendTransaction(parameters, { - sync: true - }); - } - // eslint-disable-next-line arrow-body-style - return this.prepareParametersAsync(args).then(parameters => { - return this._chain.sendTransaction(parameters, argsObject.callback); - }); - } - callReadOnly() { - for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) { - args[_key2] = arguments[_key2]; - } - const argsObject = this.extractArgumentsIntoObject(args); - if (argsObject.isSync) { - const parameters = this.prepareParameters(args); - return this.unpackOutput(this._chain.callReadOnly(parameters, { - sync: true - })); - } - // eslint-disable-next-line arrow-body-style - return this.prepareParametersAsync(args).then(parameters => { - return this._chain.callReadOnly(parameters, (error, result) => { - argsObject.callback(error, this.unpackOutput(result)); - }).then(this.unpackOutput); - }); - } - extractArgumentsIntoObject(args) { - const result = { - callback: contractMethod_get_("noop"), - isSync: false - }; - if (args.length === 0) { - // has no callback, default to be async mode - return result; - } - if (contractMethod_get_("isFunction")(args[args.length - 1])) { - result.callback = args[args.length - 1]; - } - args.forEach(arg => { - if (contractMethod_get_("isBoolean")(arg?.sync)) { - result.isSync = arg.sync; - } - }); - return result; - } - - // getData(...args) { - getSignedTx() { - for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) { - args[_key3] = arguments[_key3]; - } - const filterArgs = args.filter(arg => !contractMethod_get_("isFunction")(arg) && !contractMethod_get_("isBoolean")(arg.sync)); - if (filterArgs[1]) { - const { - height, - hash - } = filterArgs[1]; // blockInfo - if (hash && height) { - return this.prepareParametersWithBlockInfo(args); - } - throw Error('The second param is the height & hash of a block'); - } - return this.prepareParameters(args); - } - getRawTx(blockHeightInput, blockHashInput, packedInput) { - const rawTx = contractMethod_get_("getTransaction")(this._wallet.address, this._contractAddress, this._name, packedInput); - rawTx.refBlockNumber = blockHeightInput; - const blockHash = blockHashInput.match(/^0x/) ? blockHashInput.substring(2) : blockHashInput; - rawTx.refBlockPrefix = Buffer.from(blockHash, 'hex').slice(0, 4); - return rawTx; - } - request() { - for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) { - args[_key4] = arguments[_key4]; - } - const { - callback - } = this.extractArgumentsIntoObject(args); - const params = this.prepareParameters(args); - return { - method: 'broadcast_tx', - callback, - params, - format: this.unpackOutput - }; - } - run() { - return this.sendTransaction(...arguments); - } - bindMethodToContract(contract) { - const { - run - } = this; - run.request = this.request; - run.call = this.callReadOnly; - run.inputTypeInfo = this._inputType.toJSON(); - run.inputType = this._inputType; - run.outputTypeInfo = this._outputType.toJSON(); - run.outputType = this._outputType; - run.unpackPackedInput = this.unpackPackedInput; - run.packInput = this.packInput; - run.packOutput = this.packOutput.bind(this); - run.sendTransaction = this.sendTransaction; - run.getSignedTx = this.getSignedTx; - run.getRawTx = this.getRawTx; - run.unpackOutput = this.unpackOutput; - // eslint-disable-next-line no-param-reassign - contract[this._name] = run; - } -} -function contractMethod_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var contractMethod_RewireModuleId_ = null; -function contractMethod_getRewireModuleId_() { - if (contractMethod_RewireModuleId_ === null) { - let globalVariable = contractMethod_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - contractMethod_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return contractMethod_RewireModuleId_; -} -function contractMethod_getRewireRegistry_() { - let theGlobalVariable = contractMethod_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function contractMethod_getRewiredData_() { - let moduleId = contractMethod_getRewireModuleId_(); - let registry = contractMethod_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = contractMethod_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var contractMethod_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let contractMethod_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(contractMethod_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', contractMethod_get_); - addPropertyToAPIObject('__GetDependency__', contractMethod_get_); - addPropertyToAPIObject('__Rewire__', contractMethod_set_); - addPropertyToAPIObject('__set__', contractMethod_set_); - addPropertyToAPIObject('__reset__', contractMethod_reset_); - addPropertyToAPIObject('__ResetDependency__', contractMethod_reset_); - addPropertyToAPIObject('__with__', contractMethod_with_); -})(); -function contractMethod_get_(variableName) { - let rewireData = contractMethod_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return contractMethod_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === contractMethod_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function contractMethod_get_original_(variableName) { - switch (variableName) { - case "transformMapToArray": - return transformMapToArray; - case "transform": - return transform; - case "INPUT_TRANSFORMERS": - return INPUT_TRANSFORMERS; - case "unpackSpecifiedTypeData": - return unpackSpecifiedTypeData; - case "OUTPUT_TRANSFORMERS": - return OUTPUT_TRANSFORMERS; - case "transformArrayToMap": - return transformArrayToMap; - case "wallet": - return wallet; - case "Transaction": - return Transaction; - case "uint8ArrayToHex": - return uint8ArrayToHex; - case "isFunction": - return isFunction; - case "isBoolean": - return isBoolean; - case "noop": - return noop; - case "getTransaction": - return getTransaction; - } - return undefined; -} -function contractMethod_assign_(variableName, value) { - let rewireData = contractMethod_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return contractMethod_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function contractMethod_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function contractMethod_update_operation_(operation, variableName, prefix) { - var oldValue = contractMethod_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - contractMethod_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function contractMethod_set_(variableName, value) { - let rewireData = contractMethod_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - contractMethod_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = contractMethod_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - contractMethod_reset_(variableName); - }; - } -} -function contractMethod_reset_(variableName) { - let rewireData = contractMethod_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete contractMethod_getRewireRegistry_()[contractMethod_getRewireModuleId_]; - } - ; -} -function contractMethod_with_(object) { - let rewireData = contractMethod_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let contractMethod_typeOfOriginalExport = typeof ContractMethod; -function contractMethod_addNonEnumerableProperty(name, value) { - Object.defineProperty(ContractMethod, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((contractMethod_typeOfOriginalExport === 'object' || contractMethod_typeOfOriginalExport === 'function') && Object.isExtensible(ContractMethod)) { - contractMethod_addNonEnumerableProperty('__get__', contractMethod_get_); - contractMethod_addNonEnumerableProperty('__GetDependency__', contractMethod_get_); - contractMethod_addNonEnumerableProperty('__Rewire__', contractMethod_set_); - contractMethod_addNonEnumerableProperty('__set__', contractMethod_set_); - contractMethod_addNonEnumerableProperty('__reset__', contractMethod_reset_); - contractMethod_addNonEnumerableProperty('__ResetDependency__', contractMethod_reset_); - contractMethod_addNonEnumerableProperty('__with__', contractMethod_with_); - contractMethod_addNonEnumerableProperty('__RewireAPI__', contractMethod_RewireAPI_); -} - -;// CONCATENATED MODULE: ./src/contract/index.js -/** - * @file contract - * @author atom-yang - */ -// eslint-disable-next-line max-classes-per-file - - - - -const getServicesFromFileDescriptors = descriptors => { - const root = contract_get_("protobuf").Root.fromDescriptor(descriptors, 'proto3').resolveAll(); - return descriptors.file.filter(f => f.service.length > 0).map(f => { - const sn = f.service[0].name; - const fullName = f.package ? `${f.package}.${sn}` : sn; - return root.lookupService(fullName); - }); -}; -class Contract { - constructor(chain, services, address) { - this._chain = chain; - this.address = address; - this.services = services; - } - deserializeLog() { - let logs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; - let logName = arguments.length > 1 ? arguments[1] : undefined; - const logInThisAddress = logs.filter(v => v.Address === this.address && logName === v.Name); - if (logInThisAddress.length === 0) { - return []; - } - return logInThisAddress.map(item => { - const { - Name, - NonIndexed, - Indexed - } = item; - let dataType; - // eslint-disable-next-line no-restricted-syntax - for (const service of this.services) { - try { - dataType = service.lookupType(Name); - break; - } catch (e) {} - } - const serializedData = [...(Indexed || [])]; - if (NonIndexed) { - serializedData.push(NonIndexed); - } - let result = serializedData.reduce((acc, v) => { - let deserialize = dataType.decode(Buffer.from(v, 'base64')); - deserialize = dataType.toObject(deserialize, { - enums: String, - // enums as string names - longs: String, - // longs as strings (requires long.js) - bytes: String, - // bytes as base64 encoded strings - defaults: false, - // includes default values - arrays: true, - // populates empty arrays (repeated fields) even if defaults=false - objects: true, - // populates empty objects (map fields) even if defaults=false - oneofs: true // includes virtual oneof fields set to the present field's name - }); - - return { - ...acc, - ...deserialize - }; - }, {}); - result = contract_get_("transform")(dataType, result, contract_get_("OUTPUT_TRANSFORMERS")); - result = contract_get_("transformArrayToMap")(dataType, result); - return result; - }); - } -} -class ContractFactory { - constructor(chain, fileDescriptorSet, wallet) { - this.chain = chain; - this.services = contract_get_("getServicesFromFileDescriptors")(fileDescriptorSet); - this.wallet = wallet; - } - static bindMethodsToContract(contract, wallet) { - contract.services.forEach(service => { - Object.keys(service.methods).forEach(key => { - const method = service.methods[key].resolve(); - const contractMethod = new (contract_get_("ContractMethod"))(contract._chain, method, contract.address, wallet); - contractMethod.bindMethodToContract(contract); - }); - }); - } - at(address) { - let callback = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : contract_get_("noop"); - const contractInstance = new (contract_get_("Contract"))(this.chain, this.services, address); - contract_get_("ContractFactory").bindMethodsToContract(contractInstance, this.wallet); - callback(null, contractInstance); - return contractInstance; - } -} -function contract_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var contract_RewireModuleId_ = null; -function contract_getRewireModuleId_() { - if (contract_RewireModuleId_ === null) { - let globalVariable = contract_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - contract_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return contract_RewireModuleId_; -} -function contract_getRewireRegistry_() { - let theGlobalVariable = contract_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function contract_getRewiredData_() { - let moduleId = contract_getRewireModuleId_(); - let registry = contract_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = contract_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var contract_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let contract_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(contract_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', contract_get_); - addPropertyToAPIObject('__GetDependency__', contract_get_); - addPropertyToAPIObject('__Rewire__', contract_set_); - addPropertyToAPIObject('__set__', contract_set_); - addPropertyToAPIObject('__reset__', contract_reset_); - addPropertyToAPIObject('__ResetDependency__', contract_reset_); - addPropertyToAPIObject('__with__', contract_with_); -})(); -function contract_get_(variableName) { - let rewireData = contract_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return contract_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === contract_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function contract_get_original_(variableName) { - switch (variableName) { - case "protobuf": - return contract_filterWildcardImport_(light); - case "transform": - return transform; - case "OUTPUT_TRANSFORMERS": - return OUTPUT_TRANSFORMERS; - case "transformArrayToMap": - return transformArrayToMap; - case "getServicesFromFileDescriptors": - return getServicesFromFileDescriptors; - case "ContractMethod": - return ContractMethod; - case "noop": - return noop; - case "Contract": - return Contract; - case "ContractFactory": - return ContractFactory; - } - return undefined; -} -function contract_assign_(variableName, value) { - let rewireData = contract_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return contract_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function contract_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function contract_update_operation_(operation, variableName, prefix) { - var oldValue = contract_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - contract_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function contract_set_(variableName, value) { - let rewireData = contract_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - contract_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = contract_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - contract_reset_(variableName); - }; - } -} -function contract_reset_(variableName) { - let rewireData = contract_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete contract_getRewireRegistry_()[contract_getRewireModuleId_]; - } - ; -} -function contract_with_(object) { - let rewireData = contract_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let contract_typeOfOriginalExport = typeof ContractFactory; -function contract_addNonEnumerableProperty(name, value) { - Object.defineProperty(ContractFactory, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((contract_typeOfOriginalExport === 'object' || contract_typeOfOriginalExport === 'function') && Object.isExtensible(ContractFactory)) { - contract_addNonEnumerableProperty('__get__', contract_get_); - contract_addNonEnumerableProperty('__GetDependency__', contract_get_); - contract_addNonEnumerableProperty('__Rewire__', contract_set_); - contract_addNonEnumerableProperty('__set__', contract_set_); - contract_addNonEnumerableProperty('__reset__', contract_reset_); - contract_addNonEnumerableProperty('__ResetDependency__', contract_reset_); - contract_addNonEnumerableProperty('__with__', contract_with_); - contract_addNonEnumerableProperty('__RewireAPI__', contract_RewireAPI_); -} -function contract_filterWildcardImport_() { - let wildcardImport = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; - let validPropertyNames = Object.keys(wildcardImport).filter(function (propertyName) { - return propertyName !== '__get__' && propertyName !== '__set__' && propertyName !== '__reset__' && propertyName !== '__with__' && propertyName !== '__GetDependency__' && propertyName !== '__Rewire__' && propertyName !== '__ResetDependency__' && propertyName !== '__RewireAPI__'; - }); - return validPropertyNames.reduce(function (filteredWildcardImport, propertyName) { - filteredWildcardImport[propertyName] = wildcardImport[propertyName]; - return filteredWildcardImport; - }, {}); -} - -;// CONCATENATED MODULE: ./src/chain/index.js -/** - * @file chain - * @author atom-yang - */ - - - - - -class Chain { - constructor(requestManager) { - Object.keys(chain_get_("CHAIN_METHODS")).forEach(key => { - const methodConfig = chain_get_("CHAIN_METHODS")[key]; - const { - name - } = methodConfig; - const method = new (chain_get_("ChainMethod"))(methodConfig); - method.setRequestManager(requestManager); - chain_get_("setPath")(this, name, method.run); - }); - } - extractArgumentsIntoObject(args) { - const result = { - callback: chain_get_("noop"), - isSync: false - }; - if (args.length === 0) { - // has no callback, default to be async mode - return result; - } - if (chain_get_("isFunction")(args[args.length - 1])) { - result.callback = args[args.length - 1]; - } - args.forEach(arg => { - if (chain_get_("isBoolean")(arg?.sync)) { - result.isSync = arg.sync; - } - }); - return result; - } - contractAt(address, wallet) { - for (var _len = arguments.length, args = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) { - args[_key - 2] = arguments[_key]; - } - const { - callback, - isSync - } = this.extractArgumentsIntoObject(args); - if (isSync) { - const fds = this.getContractFileDescriptorSet(address, { - sync: true - }); - if (fds && fds.file && fds.file.length > 0) { - const factory = new (chain_get_("ContractFactory"))(this, fds, wallet); - return factory.at(address); - } - throw new Error('no such contract'); - } - // eslint-disable-next-line consistent-return - return this.getContractFileDescriptorSet(address).then(fds => { - if (fds && fds.file && fds.file.length > 0) { - const factory = new (chain_get_("ContractFactory"))(this, fds, wallet); - const result = factory.at(address); - callback(null, result); - return result; - } - callback(new Error('no such contract')); - // if callback is noop, throw error - if (callback.length === 0) { - throw new Error('no such contract'); - } - }); - } - getMerklePath(txId, height) { - for (var _len2 = arguments.length, args = new Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) { - args[_key2 - 2] = arguments[_key2]; - } - const { - isSync - } = this.extractArgumentsIntoObject(args); - if (isSync) { - const block = this.getBlockByHeight(height, true, { - sync: true - }); - const { - BlockHash, - Body - } = block; - const txIds = Body.Transactions; - const txIndex = txIds.findIndex(id => id === txId); - if (txIndex === -1) { - throw new Error(`txId ${txId} has no correspond transaction in the block with height ${height}`); - } - const txResults = this.getTxResults(BlockHash, 0, txIds.length, { - sync: true - }); - const nodes = txResults.map((result, index) => { - const id = txIds[index]; - const status = result.Status; - const buffer = Buffer.concat([Buffer.from(id.replace('0x', ''), 'hex'), Buffer.from(status, 'utf8')]); - return chain_get_("merkleTree").node(buffer); - }); - return chain_get_("merkleTree").getMerklePath(txIndex, nodes); - } - return this.getBlockByHeight(height, true).then(block => { - const { - BlockHash, - Body - } = block; - const txIds = Body.Transactions; - const txIndex = txIds.findIndex(id => id === txId); - if (txIndex === -1) { - throw new Error(`txId ${txId} has no correspond transaction in the block with height ${height}`); - } - return this.getTxResults(BlockHash, 0, txIds.length).then(results => { - const nodes = results.map((result, index) => { - const id = txIds[index]; - const status = result.Status; - const buffer = Buffer.concat([Buffer.from(id.replace('0x', ''), 'hex'), Buffer.from(status, 'utf8')]); - return chain_get_("merkleTree").node(buffer); - }); - return chain_get_("merkleTree").getMerklePath(txIndex, nodes); - }); - }); - } -} -function chain_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var chain_RewireModuleId_ = null; -function chain_getRewireModuleId_() { - if (chain_RewireModuleId_ === null) { - let globalVariable = chain_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - chain_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return chain_RewireModuleId_; -} -function chain_getRewireRegistry_() { - let theGlobalVariable = chain_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function chain_getRewiredData_() { - let moduleId = chain_getRewireModuleId_(); - let registry = chain_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = chain_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var chain_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let chain_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(chain_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', chain_get_); - addPropertyToAPIObject('__GetDependency__', chain_get_); - addPropertyToAPIObject('__Rewire__', chain_set_); - addPropertyToAPIObject('__set__', chain_set_); - addPropertyToAPIObject('__reset__', chain_reset_); - addPropertyToAPIObject('__ResetDependency__', chain_reset_); - addPropertyToAPIObject('__with__', chain_with_); -})(); -function chain_get_(variableName) { - let rewireData = chain_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return chain_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === chain_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function chain_get_original_(variableName) { - switch (variableName) { - case "CHAIN_METHODS": - return CHAIN_METHODS; - case "ChainMethod": - return ChainMethod; - case "setPath": - return setPath; - case "noop": - return noop; - case "isFunction": - return isFunction; - case "isBoolean": - return isBoolean; - case "ContractFactory": - return ContractFactory; - case "merkleTree": - return chain_filterWildcardImport_(merkleTree_namespaceObject); - } - return undefined; -} -function chain_assign_(variableName, value) { - let rewireData = chain_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return chain_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function chain_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function chain_update_operation_(operation, variableName, prefix) { - var oldValue = chain_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - chain_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function chain_set_(variableName, value) { - let rewireData = chain_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - chain_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = chain_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - chain_reset_(variableName); - }; - } -} -function chain_reset_(variableName) { - let rewireData = chain_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete chain_getRewireRegistry_()[chain_getRewireModuleId_]; - } - ; -} -function chain_with_(object) { - let rewireData = chain_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let chain_typeOfOriginalExport = typeof Chain; -function chain_addNonEnumerableProperty(name, value) { - Object.defineProperty(Chain, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((chain_typeOfOriginalExport === 'object' || chain_typeOfOriginalExport === 'function') && Object.isExtensible(Chain)) { - chain_addNonEnumerableProperty('__get__', chain_get_); - chain_addNonEnumerableProperty('__GetDependency__', chain_get_); - chain_addNonEnumerableProperty('__Rewire__', chain_set_); - chain_addNonEnumerableProperty('__set__', chain_set_); - chain_addNonEnumerableProperty('__reset__', chain_reset_); - chain_addNonEnumerableProperty('__ResetDependency__', chain_reset_); - chain_addNonEnumerableProperty('__with__', chain_with_); - chain_addNonEnumerableProperty('__RewireAPI__', chain_RewireAPI_); -} -function chain_filterWildcardImport_() { - let wildcardImport = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; - let validPropertyNames = Object.keys(wildcardImport).filter(function (propertyName) { - return propertyName !== '__get__' && propertyName !== '__set__' && propertyName !== '__reset__' && propertyName !== '__with__' && propertyName !== '__GetDependency__' && propertyName !== '__Rewire__' && propertyName !== '__ResetDependency__' && propertyName !== '__RewireAPI__'; - }); - return validPropertyNames.reduce(function (filteredWildcardImport, propertyName) { - filteredWildcardImport[propertyName] = wildcardImport[propertyName]; - return filteredWildcardImport; - }, {}); -} - -;// CONCATENATED MODULE: ./src/util/requestManage.js -/** - * @file request methods, connected to rpc node - * @author atom-yang - */ - -class RequestManager { - constructor(provider) { - this.provider = provider; - } - static prepareRequest(_ref) { - let { - requestMethod, - method, - params = {} - } = _ref; - return { - method: requestMethod.toUpperCase(), - url: method, - params - }; - } - setProvider(provider) { - this.provider = provider; - } - send(requestBody) { - if (!this.provider) { - return null; - } - const payload = requestManage_get_("RequestManager").prepareRequest(requestBody); - return this.provider.send(payload); - } - sendAsync(requestBody) { - if (!this.provider) { - return null; - } - const payload = requestManage_get_("RequestManager").prepareRequest(requestBody); - return this.provider.sendAsync(payload); - } -} -function requestManage_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var requestManage_RewireModuleId_ = null; -function requestManage_getRewireModuleId_() { - if (requestManage_RewireModuleId_ === null) { - let globalVariable = requestManage_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - requestManage_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return requestManage_RewireModuleId_; -} -function requestManage_getRewireRegistry_() { - let theGlobalVariable = requestManage_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function requestManage_getRewiredData_() { - let moduleId = requestManage_getRewireModuleId_(); - let registry = requestManage_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = requestManage_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var requestManage_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let requestManage_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(requestManage_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', requestManage_get_); - addPropertyToAPIObject('__GetDependency__', requestManage_get_); - addPropertyToAPIObject('__Rewire__', requestManage_set_); - addPropertyToAPIObject('__set__', requestManage_set_); - addPropertyToAPIObject('__reset__', requestManage_reset_); - addPropertyToAPIObject('__ResetDependency__', requestManage_reset_); - addPropertyToAPIObject('__with__', requestManage_with_); -})(); -function requestManage_get_(variableName) { - let rewireData = requestManage_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return requestManage_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === requestManage_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function requestManage_get_original_(variableName) { - switch (variableName) { - case "RequestManager": - return RequestManager; - } - return undefined; -} -function requestManage_assign_(variableName, value) { - let rewireData = requestManage_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return requestManage_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function requestManage_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function requestManage_update_operation_(operation, variableName, prefix) { - var oldValue = requestManage_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - requestManage_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function requestManage_set_(variableName, value) { - let rewireData = requestManage_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - requestManage_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = requestManage_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - requestManage_reset_(variableName); - }; - } -} -function requestManage_reset_(variableName) { - let rewireData = requestManage_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete requestManage_getRewireRegistry_()[requestManage_getRewireModuleId_]; - } - ; -} -function requestManage_with_(object) { - let rewireData = requestManage_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let requestManage_typeOfOriginalExport = typeof RequestManager; -function requestManage_addNonEnumerableProperty(name, value) { - Object.defineProperty(RequestManager, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((requestManage_typeOfOriginalExport === 'object' || requestManage_typeOfOriginalExport === 'function') && Object.isExtensible(RequestManager)) { - requestManage_addNonEnumerableProperty('__get__', requestManage_get_); - requestManage_addNonEnumerableProperty('__GetDependency__', requestManage_get_); - requestManage_addNonEnumerableProperty('__Rewire__', requestManage_set_); - requestManage_addNonEnumerableProperty('__set__', requestManage_set_); - requestManage_addNonEnumerableProperty('__reset__', requestManage_reset_); - requestManage_addNonEnumerableProperty('__ResetDependency__', requestManage_reset_); - requestManage_addNonEnumerableProperty('__with__', requestManage_with_); - requestManage_addNonEnumerableProperty('__RewireAPI__', requestManage_RewireAPI_); -} - -// EXTERNAL MODULE: ./node_modules/query-string/index.js -var query_string = __webpack_require__(66); -;// CONCATENATED MODULE: ./src/util/httpProvider.js -/** - * @file rpc connection built with http - * @author atom-yang - */ - -const defaultHeaders = { - Accept: 'text/plain;v=1.0', - 'Content-Type': 'application/json' -}; -let RequestLibrary = {}; -let isFetch = false; -if (false) {} else { - // For node use xmlhttprequest - // eslint-disable-next-line global-require - httpProvider_assign_("RequestLibrary", (__webpack_require__(170)/* .XMLHttpRequest */ .h)); -} -class HttpProvider { - constructor() { - let host = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 'http://localhost:8545'; - let timeout = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 8000; - let headers = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : httpProvider_get_("defaultHeaders"); - this.host = host.replace(/\/$/, ''); - this.timeout = timeout; - this.headers = {}; - if (Array.isArray(headers)) { - headers.forEach(_ref => { - let { - name, - value - } = _ref; - this.headers[name] = value; - }); - this.headers = { - ...httpProvider_get_("defaultHeaders"), - ...this.headers - }; - } else { - this.headers = { - ...httpProvider_get_("defaultHeaders"), - ...headers - }; - } - } - static formatResponse(response) { - let result; - try { - result = JSON.parse(response); - } catch (e) { - result = response; - } - return result; - } - static formatResponseText(request) { - let result; - try { - const parseRequest = request; - result = { - status: parseRequest.status, - error: parseRequest.status === 200 ? 0 : parseRequest.status, - Error: { - message: request.statusText - }, - statusText: request.statusText - }; - } catch (e) { - result = request; - } - return result; - } - static timeoutPromise(delay) { - return new Promise(_resolve => { - const ids = setTimeout(() => { - clearTimeout(ids); - // eslint-disable-next-line prefer-promise-reject-errors - _resolve({ - type: 'timeout' - }); - }, delay); - }); - } - requestSendByFetch(requestConfig, request) { - const { - url, - method = 'POST', - params = {}, - signal - } = requestConfig; - const path = `/api/${url}`.replace(/\/\//g, '\/'); - let uri = `${this.host}${path}`.replace(); - const myHeaders = new Headers(); - let body = JSON.stringify(params); - if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') { - uri = Object.keys(params).length > 0 ? `${uri}?${httpProvider_get_("stringify")(params)}` : uri; - body = undefined; - } - Object.keys(this.headers).forEach(header => { - myHeaders.append(header, this.headers[header]); - }); - return request(uri, { - method: method.toUpperCase(), - headers: myHeaders, - body, - signal - }); - } - sendAsyncByFetch(requestConfig) { - const request = httpProvider_get_("RequestLibrary"); - const { - timeout - } = this; - const control = typeof AbortController === 'function' ? new AbortController() : {}; - const config = { - ...requestConfig, - signal: control.signal, - credentials: 'omit' - }; - // Simulation timeout - return Promise.race([this.requestSendByFetch(config, request), httpProvider_get_("HttpProvider").timeoutPromise(timeout)]).then(result => new Promise((resolve, reject) => { - // @deprecated unuse timeout=1 - // if (timeout !== 1) { - try { - if (result.type === 'timeout') { - // Cancel timeout request - if (control.abort) control.abort(); - reject(result); - } else { - result.text().then(text => { - const res = httpProvider_get_("HttpProvider").formatResponse(text); - if (result.status !== 200 || !result.ok) { - reject(res); - return; - } - resolve(res); - }).catch(err => reject(err)); - } - } catch (e) { - reject(e); - } - // } - })); - } - - requestSend(requestConfig, request) { - let isAsync = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false; - const { - url, - method = 'POST', - params = {} - } = requestConfig; - const path = `/api/${url}`.replace(/\/\//g, '\/'); - let uri = `${this.host}${path}`.replace(); - if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') { - uri = Object.keys(params).length > 0 ? `${uri}?${httpProvider_get_("stringify")(params)}` : uri; - } - request.open(method.toUpperCase(), uri, isAsync); - Object.keys(this.headers).forEach(header => { - request.setRequestHeader(header, this.headers[header]); - }); - if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') { - request.send(); - } else { - request.send(JSON.stringify(params)); - } - } - send(requestConfig) { - if (httpProvider_get_("isFetch")) throw new Error("Can not get XMLHttpRequest, invalid parameter: 'sync'"); - const request = new (httpProvider_get_("RequestLibrary"))(); - request.withCredentials = false; - this.requestSend(requestConfig, request); - let result = request.responseText; - result = httpProvider_get_("HttpProvider").formatResponse(result); - if (result.Error) { - throw result; - } - return result; - } - sendAsync(requestConfig) { - if (httpProvider_get_("isFetch")) return this.sendAsyncByFetch(requestConfig); - return this.sendAsyncByXMLHttp(requestConfig); - } - sendAsyncByXMLHttp(requestConfig) { - const request = new (httpProvider_get_("RequestLibrary"))(); - request.withCredentials = false; - request.timeout = this.timeout; - this.requestSend(requestConfig, request, true); - return new Promise((resolve, reject) => { - request.onreadystatechange = () => { - if (request.readyState === 4 && request.timeout !== 1) { - let result = request.responseText; - try { - result = httpProvider_get_("HttpProvider").formatResponse(result); - if (request.status !== 200 || result.Error) { - reject(result); - } else { - resolve(result); - } - } catch (e) { - // todo: error handle - reject(e); - } - } - }; - request.onerror = err => { - reject(err); - }; - request.ontimeout = err => { - // todo: timeout error - reject(err); - }; - }); - } - isConnected() { - try { - this.send({ - method: 'GET', - url: 'blockChain/chainStatus' - }); - return true; - } catch (e) { - return false; - } - } - async isConnectedAsync() { - try { - return await this.sendAsyncByFetch({ - method: 'GET', - url: 'blockChain/chainStatus' - }); - } catch (e) { - return false; - } - } -} -function httpProvider_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var httpProvider_RewireModuleId_ = null; -function httpProvider_getRewireModuleId_() { - if (httpProvider_RewireModuleId_ === null) { - let globalVariable = httpProvider_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - httpProvider_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return httpProvider_RewireModuleId_; -} -function httpProvider_getRewireRegistry_() { - let theGlobalVariable = httpProvider_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function httpProvider_getRewiredData_() { - let moduleId = httpProvider_getRewireModuleId_(); - let registry = httpProvider_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = httpProvider_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var httpProvider_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let httpProvider_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(httpProvider_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', httpProvider_get_); - addPropertyToAPIObject('__GetDependency__', httpProvider_get_); - addPropertyToAPIObject('__Rewire__', httpProvider_set_); - addPropertyToAPIObject('__set__', httpProvider_set_); - addPropertyToAPIObject('__reset__', httpProvider_reset_); - addPropertyToAPIObject('__ResetDependency__', httpProvider_reset_); - addPropertyToAPIObject('__with__', httpProvider_with_); -})(); -function httpProvider_get_(variableName) { - let rewireData = httpProvider_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return httpProvider_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === httpProvider_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function httpProvider_get_original_(variableName) { - switch (variableName) { - case "RequestLibrary": - return RequestLibrary; - case "isFetch": - return isFetch; - case "defaultHeaders": - return defaultHeaders; - case "stringify": - return query_string.stringify; - case "HttpProvider": - return HttpProvider; - } - return undefined; -} -function httpProvider_assign_(variableName, value) { - let rewireData = httpProvider_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return httpProvider_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function httpProvider_set_original_(variableName, _value) { - switch (variableName) { - case "RequestLibrary": - return RequestLibrary = _value; - case "isFetch": - return isFetch = _value; - } - return undefined; -} -function httpProvider_update_operation_(operation, variableName, prefix) { - var oldValue = httpProvider_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - httpProvider_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function httpProvider_set_(variableName, value) { - let rewireData = httpProvider_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - httpProvider_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = httpProvider_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - httpProvider_reset_(variableName); - }; - } -} -function httpProvider_reset_(variableName) { - let rewireData = httpProvider_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete httpProvider_getRewireRegistry_()[httpProvider_getRewireModuleId_]; - } - ; -} -function httpProvider_with_(object) { - let rewireData = httpProvider_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let httpProvider_typeOfOriginalExport = typeof HttpProvider; -function httpProvider_addNonEnumerableProperty(name, value) { - Object.defineProperty(HttpProvider, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((httpProvider_typeOfOriginalExport === 'object' || httpProvider_typeOfOriginalExport === 'function') && Object.isExtensible(HttpProvider)) { - httpProvider_addNonEnumerableProperty('__get__', httpProvider_get_); - httpProvider_addNonEnumerableProperty('__GetDependency__', httpProvider_get_); - httpProvider_addNonEnumerableProperty('__Rewire__', httpProvider_set_); - httpProvider_addNonEnumerableProperty('__set__', httpProvider_set_); - httpProvider_addNonEnumerableProperty('__reset__', httpProvider_reset_); - httpProvider_addNonEnumerableProperty('__ResetDependency__', httpProvider_reset_); - httpProvider_addNonEnumerableProperty('__with__', httpProvider_with_); - httpProvider_addNonEnumerableProperty('__RewireAPI__', httpProvider_RewireAPI_); -} - -;// CONCATENATED MODULE: ./src/util/settings.js -/** - * @file settings - * @author atom-yang - */ - -class Settings { - constructor() { - this.defaultAccount = undefined; - } -} -;// CONCATENATED MODULE: ./src/index.js -function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } -function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return typeof key === "symbol" ? key : String(key); } -function _toPrimitive(input, hint) { if (typeof input !== "object" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || "default"); if (typeof res !== "object") return res; throw new TypeError("@@toPrimitive must return a primitive value."); } return (hint === "string" ? String : Number)(input); } -/** - * @file AElf-sdk index export - * @author atom-yang - */ - - - - - - - - - - - - -/* eslint-disable no-underscore-dangle */ -class AElf { - constructor(provider) { - _defineProperty(this, "providers", { - HttpProvider: src_get_("HttpProvider") - }); - _defineProperty(this, "settings", new (src_get_("Settings"))()); - /** - * AElf-sdk version - * @type {{api: string}} - */ - _defineProperty(this, "version", { - api: "3.2.45-beta.1" - }); - this._requestManager = new (src_get_("RequestManager"))(provider); - this.currentProvider = provider; - this.chain = new (src_get_("Chain"))(this._requestManager); - } - /** - * check the rpc node is work or not. - * @returns {boolean} whether can connect to the rpc. - */ - isConnected() { - return this.currentProvider && this.currentProvider.isConnected(); - } - setProvider(provider) { - this._requestManager.setProvider(provider); - this.currentProvider = provider; - } -} -/* eslint-enable */ -_defineProperty(src_get_("AElf"), "version", "3.2.45-beta.1"); -_defineProperty(src_get_("AElf"), "providers", { - HttpProvider: src_get_("HttpProvider") -}); -/** - * @type {protobuf} export protobufjs for developers - */ -_defineProperty(src_get_("AElf"), "pbjs", src_get_("protobuf")); -_defineProperty(src_get_("AElf"), "pbUtils", src_get_("proto")); -_defineProperty(src_get_("AElf"), "wallet", src_get_("wallet")); -_defineProperty(src_get_("AElf"), "utils", { - ...src_get_("utils"), - ...src_get_("bloom"), - sha256: src_get_("sha256"), - transform: src_get_("transform") -}); -function src_getGlobalObject() { - try { - if (!!global) { - return global; - } - } catch (e) { - try { - if (!!window) { - return window; - } - } catch (e) { - return this; - } - } -} -; -var src_RewireModuleId_ = null; -function src_getRewireModuleId_() { - if (src_RewireModuleId_ === null) { - let globalVariable = src_getGlobalObject(); - if (!globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__) { - globalVariable.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__ = 0; - } - src_RewireModuleId_ = __$$GLOBAL_REWIRE_NEXT_MODULE_ID__++; - } - return src_RewireModuleId_; -} -function src_getRewireRegistry_() { - let theGlobalVariable = src_getGlobalObject(); - if (!theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__) { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - } - return theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__; -} -function src_getRewiredData_() { - let moduleId = src_getRewireModuleId_(); - let registry = src_getRewireRegistry_(); - let rewireData = registry[moduleId]; - if (!rewireData) { - registry[moduleId] = Object.create(null); - rewireData = registry[moduleId]; - } - return rewireData; -} -(function registerResetAll() { - let theGlobalVariable = src_getGlobalObject(); - if (!theGlobalVariable['__rewire_reset_all__']) { - theGlobalVariable['__rewire_reset_all__'] = function () { - theGlobalVariable.__$$GLOBAL_REWIRE_REGISTRY__ = Object.create(null); - }; - } -})(); -var src_INTENTIONAL_UNDEFINED = '__INTENTIONAL_UNDEFINED__'; -let src_RewireAPI_ = {}; -(function () { - function addPropertyToAPIObject(name, value) { - Object.defineProperty(src_RewireAPI_, name, { - value: value, - enumerable: false, - configurable: true - }); - } - addPropertyToAPIObject('__get__', src_get_); - addPropertyToAPIObject('__GetDependency__', src_get_); - addPropertyToAPIObject('__Rewire__', src_set_); - addPropertyToAPIObject('__set__', src_set_); - addPropertyToAPIObject('__reset__', src_reset_); - addPropertyToAPIObject('__ResetDependency__', src_reset_); - addPropertyToAPIObject('__with__', src_with_); -})(); -function src_get_(variableName) { - let rewireData = src_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return src_get_original_(variableName); - } else { - var value = rewireData[variableName]; - if (value === src_INTENTIONAL_UNDEFINED) { - return undefined; - } else { - return value; - } - } -} -function src_get_original_(variableName) { - switch (variableName) { - case "RequestManager": - return RequestManager; - case "Chain": - return Chain; - case "HttpProvider": - return HttpProvider; - case "protobuf": - return src_filterWildcardImport_(light); - case "proto": - return src_filterWildcardImport_(proto_namespaceObject); - case "wallet": - return wallet; - case "utils": - return src_filterWildcardImport_(utils_namespaceObject); - case "bloom": - return src_filterWildcardImport_(bloom_namespaceObject); - case "sha256": - return util_sha256; - case "transform": - return src_filterWildcardImport_(transform_namespaceObject); - case "Settings": - return Settings; - case "AElf": - return AElf; - } - return undefined; -} -function src_assign_(variableName, value) { - let rewireData = src_getRewiredData_(); - if (rewireData[variableName] === undefined) { - return src_set_original_(variableName, value); - } else { - return rewireData[variableName] = value; - } -} -function src_set_original_(variableName, _value) { - switch (variableName) {} - return undefined; -} -function src_update_operation_(operation, variableName, prefix) { - var oldValue = src_get_(variableName); - var newValue = operation === '++' ? oldValue + 1 : oldValue - 1; - src_assign_(variableName, newValue); - return prefix ? newValue : oldValue; -} -function src_set_(variableName, value) { - let rewireData = src_getRewiredData_(); - if (typeof variableName === 'object') { - Object.keys(variableName).forEach(function (name) { - rewireData[name] = variableName[name]; - }); - return function () { - Object.keys(variableName).forEach(function (name) { - src_reset_(variableName); - }); - }; - } else { - if (value === undefined) { - rewireData[variableName] = src_INTENTIONAL_UNDEFINED; - } else { - rewireData[variableName] = value; - } - return function () { - src_reset_(variableName); - }; - } -} -function src_reset_(variableName) { - let rewireData = src_getRewiredData_(); - delete rewireData[variableName]; - if (Object.keys(rewireData).length == 0) { - delete src_getRewireRegistry_()[src_getRewireModuleId_]; - } - ; -} -function src_with_(object) { - let rewireData = src_getRewiredData_(); - var rewiredVariableNames = Object.keys(object); - var previousValues = {}; - function reset() { - rewiredVariableNames.forEach(function (variableName) { - rewireData[variableName] = previousValues[variableName]; - }); - } - return function (callback) { - rewiredVariableNames.forEach(function (variableName) { - previousValues[variableName] = rewireData[variableName]; - rewireData[variableName] = object[variableName]; - }); - let result = callback(); - if (!!result && typeof result.then == 'function') { - result.then(reset).catch(reset); - } else { - reset(); - } - return result; - }; -} -let src_typeOfOriginalExport = typeof AElf; -function src_addNonEnumerableProperty(name, value) { - Object.defineProperty(AElf, name, { - value: value, - enumerable: false, - configurable: true - }); -} -if ((src_typeOfOriginalExport === 'object' || src_typeOfOriginalExport === 'function') && Object.isExtensible(AElf)) { - src_addNonEnumerableProperty('__get__', src_get_); - src_addNonEnumerableProperty('__GetDependency__', src_get_); - src_addNonEnumerableProperty('__Rewire__', src_set_); - src_addNonEnumerableProperty('__set__', src_set_); - src_addNonEnumerableProperty('__reset__', src_reset_); - src_addNonEnumerableProperty('__ResetDependency__', src_reset_); - src_addNonEnumerableProperty('__with__', src_with_); - src_addNonEnumerableProperty('__RewireAPI__', src_RewireAPI_); -} -function src_filterWildcardImport_() { - let wildcardImport = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; - let validPropertyNames = Object.keys(wildcardImport).filter(function (propertyName) { - return propertyName !== '__get__' && propertyName !== '__set__' && propertyName !== '__reset__' && propertyName !== '__with__' && propertyName !== '__GetDependency__' && propertyName !== '__Rewire__' && propertyName !== '__ResetDependency__' && propertyName !== '__RewireAPI__'; - }); - return validPropertyNames.reduce(function (filteredWildcardImport, propertyName) { - filteredWildcardImport[propertyName] = wildcardImport[propertyName]; - return filteredWildcardImport; - }, {}); -} - -})(); - -module.exports.AElf = __webpack_exports__["default"]; -/******/ })() -; -//# sourceMappingURL=aelf.cjs.js.map \ No newline at end of file diff --git a/dist/aelf.cjs.js.map b/dist/aelf.cjs.js.map deleted file mode 100644 index 214caeff..00000000 --- a/dist/aelf.cjs.js.map +++ /dev/null @@ -1 +0,0 @@ -{"version":3,"file":"aelf.cjs.js","mappings":";;;;;;;;;;;AAAa;;AAEb;AACA;AACA;AACA;AACA,WAAW,uCAA0C;;AAErD,YAAY,mBAAO,CAAC,EAAS;;AAE7B;AACA;;AAEA,eAAe,mBAAO,CAAC,EAAqB;AAC5C,eAAe,mBAAO,CAAC,EAAmB;AAC1C,eAAe,mBAAO,CAAC,EAAkB;;AAEzC;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,WAAW;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,WAAW;AACtB,aAAa,mBAAmB;AAChC;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA,wDAAwD,0BAA0B;AAClF;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,QAAQ;AACnB,aAAa,MAAM;AACnB;AACA,cAAc,MAAM;AACpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,mBAAO,CAAC,EAAQ;;AAE/B;AACA;AACA,sBAAsB;AACtB,2CAA2C,gCAAgC;AAC3E,qDAAqD,gCAAgC;AACrF;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,MAAM;AACnB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,eAAe,mBAAO,CAAC,CAAQ;;AAE/B;AACA;AACA,6CAA6C,+BAA+B;AAC5E;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA,gEAAgE,mBAAO,CAAC,EAAQ;AAChF;AACA,CAAC;;;;;;;;ACjLY;;AAEb;AACA,SAAS,mBAAO,CAAC,CAAO;AACxB,gBAAgB,mBAAO,CAAC,EAAqB;AAC7C,eAAe,mBAAO,CAAC,EAA2B;;AAElD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;ACrHA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,gCAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;ACr3GnB;AACb;;AAEA;AACA,uBAAuB,mBAAO,CAAC,EAAU;AACzC;;AAEA,gBAAgB,mBAAO,CAAC,EAAa;AACrC,WAAW,mBAAO,CAAC,CAAQ;;AAE3B;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,wBAAwB;AACnC,WAAW,mBAAmB;AAC9B,WAAW,QAAQ;AACnB,WAAW,wBAAwB;AACnC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,kDAAkD;;AAElD;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,+BAA+B;;AAE/B;AACA;AACA;;AAEA;AACA,oDAAoD,iBAAiB;AACrE;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,wBAAwB;AACtC,cAAc,mBAAmB;AACjC;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,MAAM;AACnB,YAAY,WAAW;AACvB,YAAY,OAAO;AACnB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;;AAEA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,MAAM;AACnB,YAAY,WAAW;AACvB,YAAY,OAAO;AACnB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;;;;;;;ACpLA;;;;;;;ACAa;AACb;;AAEA;AACA,iBAAiB,mBAAO,CAAC,EAAuB;;AAEhD;AACA,cAAc,mBAAO,CAAC,EAAoB;;AAE1C;AACA,oBAAoB,mBAAO,CAAC,EAA0B;;AAEtD;AACA,aAAa,mBAAO,CAAC,EAAmB;;AAExC;AACA,eAAe,mBAAO,CAAC,EAAqB;;AAE5C;AACA,YAAY,mBAAO,CAAC,EAAkB;;AAEtC;AACA,YAAY,mBAAO,CAAC,EAAkB;;AAEtC;AACA,gBAAgB,mBAAO,CAAC,EAAY;;AAEpC;AACA;AACA;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,qFAAqF;;AAErF;AACA;AACA,UAAU;AACV;AACA;AACA,mDAAmD,mCAAmC;;AAEtF;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,GAAG;AACd,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,GAAG;AACd,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,GAAG;AACd,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB,iBAAiB;AACzC;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,gCAAwB;AAC1C;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,iBAAiB;AAC5B,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,SAAS;AACvB;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA,kCAAkC,EAAE;;AAEpC;AACA;AACA,WAAW,aAAa;AACxB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,WAAW,mBAAmB;AAC9B,WAAW,SAAS;AACpB,aAAa,mBAAmB;AAChC;AACA,qCAAqC;AACrC,6CAA6C,iBAAiB;AAC9D;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,oBAAoB;AACjC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA,iDAAiD,kBAAkB,mBAAmB;;AAEtF;AACA;AACA;AACA;AACA,mDAAmD,kCAAkC;;AAErF;AACA;AACA;;AAEA;;AAEA,2DAA2D,kBAAkB,gBAAgB;;AAE7F;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B;AACA;AACA,qCAAqC;AACrC,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;;AAEA;AACA,kCAAkC,uBAAuB;AACzD;AACA,UAAU;AACV,aAAa,kBAAkB;AAC/B;;AAEA;AACA;AACA,WAAW,UAAU;AACrB,aAAa,aAAa;AAC1B;AACA;AACA;AACA,oBAAoB,uBAAuB;AAC3C;;AAEA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA,wBAAwB;AACxB,gEAAgE,QAAQ;AACxE;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,uBAAuB;AACzD;AACA,UAAU;AACV,WAAW,kBAAkB;AAC7B,aAAa;AACb;;AAEA;AACA;AACA,WAAW,UAAU;AACrB,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA,eAAe,QAAQ;AACvB,iBAAiB;AACjB;AACA;AACA;AACA;AACA,wBAAwB,uBAAuB;AAC/C;AACA;AACA;AACA;;AAEA;AACA,wCAAwC,sBAAsB;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AClaA;AACA;AACA,aAAa,mBAAO,CAAC,EAAQ;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA,EAAE,cAAc;AAChB;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChEA;AACA,aAAa,mBAAO,CAAC,EAAM;AAC3B;AACA;AACA;AACA,EAAE;AACF;AACA,EAAE,wCAAiD;AACnD;;;;;;;;ACRa;;AAEb,aAAa,mBAAO,CAAC,EAAqB;AAC1C,eAAe,mBAAO,CAAC,CAAU;;AAEjC,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,gBAAgB;AACtC;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA,IAAI;AACJ,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA,6BAA6B,gBAAgB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA,yBAAyB,gBAAgB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;;AAEA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA,gBAAgB;;;;;;;ACrRhB,CAAC;AACD,KAAK,IAA2B;AAChC;AACA;AACA;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,UAAc;AAClC;AACA,sBAAsB,mBAAO,CAAC,CAAQ;AACtC,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;;AAEA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,wBAAwB,QAAQ;AAChC;AACA,yBAAyB,QAAQ;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,cAAc;;AAEd;AACA;AACA;AACA;AACA,yBAAyB,QAAQ;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc;;AAEd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,wBAAwB,QAAQ;AAChC;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,yBAAyB,QAAQ;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA,mBAAmB,OAAO;AAC1B,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,iCAAiC,kBAAkB;AACnD;AACA;AACA;AACA,eAAe;AACf;AACA,iCAAiC,kBAAkB;AACnD;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,YAAY;AACzC;AACA;;AAEA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,cAAc;AAC3C;AACA;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,kBAAkB;AAC/C;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,cAAc;AAC3C;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,qBAAqB;AAClD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sCAAsC,sBAAsB;AAC5D;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA,MAAM;;AAEN;AACA;AACA;AACA,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU;;AAEV;;AAEA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,UAAU;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,UAAU;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA,EAAE;;;AAGF;;AAEA,CAAC;;;;;;;ACtyBD;;;;;;;ACAa;AACb;;AAEA;AACA,uBAAuB,mBAAO,CAAC,EAAU;AACzC;;AAEA,YAAY,mBAAO,CAAC,CAAQ;AAC5B,YAAY,mBAAO,CAAC,EAAS;AAC7B,YAAY,mBAAO,CAAC,CAAQ;;AAE5B,UAAU;;AAEV;;AAEA;AACA,uDAAuD,2BAA2B;AAClF;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,0BAA0B;AACrC,WAAW,0BAA0B;AACrC,WAAW,mBAAmB;AAC9B;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,OAAO;AACpB,YAAY,WAAW;AACvB;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,aAAa;AAChD;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,0BAA0B;AACrC,WAAW,0BAA0B;AACrC,WAAW,mBAAmB;AAC9B,WAAW,QAAQ;AACnB;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,gEAAgE;;AAEhE;AACA;AACA,cAAc;AACd;AACA,sBAAsB;;AAEtB;AACA;AACA,cAAc;AACd;AACA,kBAAkB;;AAElB;AACA;AACA,cAAc;AACd;AACA,uCAAuC;;AAEvC;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,mBAAmB;AACjC;;AAEA;AACA;AACA;AACA;AACA,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,OAAO;AACpB,YAAY,OAAO;AACnB;AACA;;AAEA;AACA;;AAEA,wEAAwE;AACxE;AACA;AACA;AACA;AACA,mGAAmG;AACnG;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,6CAA6C;;AAE7C,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,sCAAsC,eAAe,KAAK,kBAAkB;AAC5E;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa;AACb;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,+IAA+I;AAC1J,WAAW,kCAAkC;AAC7C,WAAW,GAAG;AACd,aAAa,gBAAgB;AAC7B;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,uEAAuE,yBAAyB;AAChG;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,uBAAuB;AAClC,WAAW,kCAAkC;AAC7C,aAAa,gBAAgB;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;AClXA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;ACVa;AACb;;AAEA;;AAEA,WAAW,mBAAO,CAAC,CAAQ;;AAE3B,UAAU;;AAEV;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,4BAA4B;;AAE5B;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,aAAa,mBAAmB;AAChC;AACA;AACA;AACA,mBAAmB;AACnB;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,kBAAkB;AAC/B;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,GAAG;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,GAAG;AACd,WAAW,SAAS;AACpB,aAAa,kBAAkB;AAC/B;AACA;AACA;AACA,2CAA2C;AAC3C;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,WAAW,SAAS;AACpB,aAAa,kBAAkB;AAC/B;AACA;AACA;AACA,qDAAqD,iBAAiB;AACtE;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;ACvMa;;AAEb;AACA;AACA;AACA;AACA;;AAEA,WAAW,mBAAO,CAAC,CAAQ;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,SAAS;AACvB,cAAc,QAAQ;AACtB,cAAc,gBAAgB;AAC9B,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACnMa;;AAEb;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,OAAO,EAAE,sCAAsC;AACtE;AACA,MAAM;AACN,uBAAuB,OAAO,EAAE,aAAa,KAAK,YAAY;AAC9D,MAAM;AACN,mBAAmB,OAAO,EAAE,YAAY;AACxC;AACA,IAAI;AACJ,iBAAiB,OAAO,EAAE,iBAAiB;AAC3C;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,MAAM,EAAE,YAAY,EAAE,wBAAwB;AAC/D,IAAI;AACJ;AACA,kBAAkB,KAAK,IAAI,MAAM,EAAE,YAAY,EAAE,wBAAwB;AACzE;;AAEA,4BAA4B,cAAc;AAC1C;AACA,CAAC;AACD;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;;AAEA,gBAAoB;;;;;;;;ACnHP;AACb;;AAEA;AACA,uBAAuB,mBAAO,CAAC,EAAU;AACzC;;AAEA,eAAe,mBAAO,CAAC,EAAS;AAChC,eAAe,mBAAO,CAAC,CAAQ;;AAE/B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B,aAAa,WAAW;AACxB,YAAY,WAAW;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,oBAAoB;AAC/B,WAAW,gBAAgB;AAC3B,aAAa,6BAA6B;AAC1C;AACA;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,mCAAmC;AAC9C,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA,wBAAwB,qBAAqB;AAC7C;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,mCAAmC;AAC9C,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA,wBAAwB,qBAAqB;AAC7C;AACA;AACA;AACA;;AAEA;AACA,mCAAmC,iBAAiB;AACpD;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,6BAA6B;;AAE7B;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,cAAc,mBAAmB;AACjC,cAAc,iCAAiC;AAC/C;;AAEA;AACA;AACA;AACA,UAAU;AACV;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,YAAY;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,iCAAiC;AAC5C,aAAa,WAAW;AACxB;AACA;AACA;AACA;AACA;AACA,iEAAiE,kBAAkB;AACnF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,uBAAuB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,iBAAiB;AACnD,8BAA8B,yBAAyB;AACvD,WAAW,QAAQ;AACnB,aAAa,wBAAwB;AACrC,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa,WAAW;AACxB,YAAY,WAAW;AACvB,YAAY,OAAO;AACnB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,mBAAmB;AACnD;AACA;AACA;AACA;AACA;;AAEA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa,WAAW;AACxB,YAAY,WAAW;AACvB,YAAY,OAAO;AACnB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,GAAG;AACd,aAAa,WAAW;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,WAAW;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,aAAa;AACxB,WAAW,SAAS;AACpB,aAAa,uBAAuB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;;AAEA;AACA,MAAM;AACN,wBAAwB,6BAA6B;AACrD;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,SAAS;AACpB,aAAa,uBAAuB;AACpC;AACA;AACA;;AAEA;AACA,iBAAiB,iBAAiB;AAClC,qDAAqD,+BAA+B;AACpF,WAAW,iBAAiB;AAC5B,aAAa,MAAM;AACnB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+BAA+B,iBAAiB;AAChD,qDAAqD,+BAA+B;AACpF,WAAW,iBAAiB;AAC5B,aAAa,MAAM;AACnB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,iBAAiB,IAAI,iBAAiB;AACvD,qDAAqD,+BAA+B;AACpF,WAAW,iBAAiB;AAC5B,aAAa,MAAM;AACnB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,uBAAuB;AACxC,qDAAqD,+BAA+B;AACpF,WAAW,iBAAiB;AAC5B,aAAa,SAAS;AACtB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AChbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,mBAAO,CAAC,EAAoB;AAC3C,eAAe,mBAAO,CAAC,EAAoB;AAC3C,mBAAO,CAAC,CAAU;AAClB;AACA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;AC7HY;AACb;;AAEA;AACA,uBAAuB,mBAAO,CAAC,EAAU;AACzC;;AAEA,YAAY,mBAAO,CAAC,EAAS;AAC7B,YAAY,mBAAO,CAAC,CAAQ;;AAE5B;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,4BAA4B;AACvC,WAAW,mBAAmB;AAC9B,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,mCAAmC;;AAEnC;AACA;AACA,cAAc;AACd;AACA;AACA,2BAA2B;;AAE3B;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,gBAAgB;AAC9B,cAAc,mBAAmB;AACjC;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,OAAO;AACpB,YAAY,WAAW;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,wBAAwB,8BAA8B;AACtD;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,OAAO;AACpB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,OAAO;AACpB;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,uBAAuB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B,6BAA6B;AACxD;AACA;AACA;AACA;;AAEA;AACA,sCAAsC,eAAe;AACrD;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa;AACb;;AAEA;AACA;AACA;AACA,WAAW,WAAW;AACtB,aAAa,gBAAgB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;;;;;;;AC1Ma;;AAEb,SAAS,mBAAO,CAAC,CAAO;AACxB,YAAY,mBAAO,CAAC,CAAU;AAC9B;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,gBAAgB;AAC9B;AACA,uCAAuC,QAAQ;AAC/C;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,OAAO;AACzB,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,+BAA+B,QAAQ;AACvC;AACA,oBAAoB,wBAAwB;AAC5C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,QAAQ;AACxB;;AAEA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB,SAAS;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,SAAS;AACvB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,WAAW;AAC7B,oBAAoB,UAAU;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,OAAO;AACzB;AACA;AACA;;;;;;;;AC5Xa;;AAEb,YAAY,mBAAO,CAAC,CAAS;AAC7B,aAAa,mBAAO,CAAC,EAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,OAAO;AACzB;;AAEA;AACA;AACA;AACA,oBAAoB,oBAAoB;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB,oBAAoB;AACpC;AACA;;AAEA;AACA;;;;;;;;AC3Fa;AACb;;AAEA,gBAAgB,mBAAO,CAAC,CAAgB;;AAExC,kBAAkB;;AAElB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,iCAAiC;AAC5C,WAAW,QAAQ;AACnB,WAAW,GAAG;AACd;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,oBAAoB;AACpB;;AAEA;AACA,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa,qBAAqB,GAAG,oBAAoB,yCAAyC;AAClG;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,YAAY;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,iCAAiC;AAC5C,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,QAAQ;AACrB,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,QAAQ;AACrB,YAAY,WAAW;AACvB;AACA;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,QAAQ;AACrB,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,QAAQ;AACrB,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,QAAQ;AACrB,YAAY,WAAW;AACvB;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA,wBAAwB,gBAAgB;AACxC;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,0BAA0B,IAAI,4BAA4B;AACtE,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,YAAY;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;AC1ca;AACb;;AAEA,gBAAgB,mBAAO,CAAC,CAAgB;;AAExC,kBAAkB;;AAElB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,qBAAqB,GAAG,oBAAoB,sCAAsC;AAC/F,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA,4BAA4B;AAC5B;AACA,kEAAkE;AAClE,kEAAkE;AAClE,kEAAkE;AAClE,kEAAkE;AAClE,kEAAkE;;AAElE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,mCAAmC;AACnC,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC;AACnC,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;;AAEA;AACA;AACA,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA,qCAAqC;AACrC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;;AAEA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,YAAY;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,SAAS;;AAET;AACA;AACA,SAAS;;AAET;AACA;AACA,SAAS;;AAET;AACA;AACA,SAAS;;AAET;AACA;AACA;;AAEA,KAAK;AACL;;;;;;;;ACpZa;AACb;;AAEA;AACA,gBAAgB,mBAAO,CAAC,EAAa;AACrC;;AAEA,gBAAgB,mBAAO,CAAC,CAAQ;AAChC,gBAAgB,mBAAO,CAAC,EAAS;AACjC,gBAAgB,mBAAO,CAAC,EAAS;AACjC,gBAAgB,mBAAO,CAAC,EAAY;AACpC,gBAAgB,mBAAO,CAAC,EAAW;AACnC,gBAAgB,mBAAO,CAAC,EAAW;AACnC,gBAAgB,mBAAO,CAAC,EAAU;AAClC,gBAAgB,mBAAO,CAAC,EAAU;AAClC,gBAAgB,mBAAO,CAAC,CAAQ;AAChC,gBAAgB,mBAAO,CAAC,EAAW;AACnC,gBAAgB,mBAAO,CAAC,EAAW;AACnC,gBAAgB,mBAAO,CAAC,EAAY;AACpC,gBAAgB,mBAAO,CAAC,EAAa;AACrC,gBAAgB,mBAAO,CAAC,EAAY;;AAEpC;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,uBAAuB;;AAEvB;AACA;AACA,cAAc;AACd;AACA,6BAA6B;;AAE7B;AACA;AACA,cAAc;AACd;AACA,iCAAiC;;AAEjC;AACA;AACA,cAAc;AACd;AACA,+BAA+B;;AAE/B;AACA;AACA,cAAc;AACd;AACA,4BAA4B;;AAE5B;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA,cAAc,cAAc;AAC5B;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,8DAA8D,kBAAkB;AAChF;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,gGAAgG,eAAe,0GAA0G,cAAc;AACvO;AACA,cAAc,cAAc;AAC5B;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,mBAAmB,+CAA+C;AAClE,gDAAgD;;AAEhD;AACA;AACA,wBAAwB,+CAA+C;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,WAAW,MAAM;AACjB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA,2BAA2B,8BAA8B;AACzD;AACA,uBAAuB;AACvB;AACA;AACA;AACA,yCAAyC,YAAY;AACrD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,wBAAwB;AACtC,cAAc,wBAAwB;AACtC,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B,cAAc,SAAS;AACvB;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,kBAAkB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,kBAAkB;AACxE;AACA;AACA,sDAAsD,kBAAkB;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qFAAqF,6BAA6B,uBAAuB;AACzI;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC;AACnC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa,MAAM;AACnB,YAAY,WAAW;AACvB,YAAY,OAAO;AACnB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa,MAAM;AACnB,YAAY,WAAW;AACvB,YAAY,OAAO;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,UAAU,GAAG;AAC1B;AACA;AACA;AACA;;AAEA;AACA,YAAY,yBAAyB,GAAG,0BAA0B,KAAK,yBAAyB;AAChG,aAAa,MAAM;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,+CAA+C;AACnE;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,wDAAwD,0BAA0B;AAClF,WAAW,UAAU,qBAAqB;AAC1C,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA,iDAAiD;AACjD;;AAEA;AACA,iGAAiG,0BAA0B;AAC3H,WAAW,UAAU,qBAAqB;AAC1C,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,WAAW,QAAQ;AACnB,aAAa,UAAU,GAAG;AAC1B,YAAY,OAAO;AACnB,YAAY,qBAAqB,GAAG;AACpC;AACA;AACA,gDAAgD;AAChD;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,UAAU,GAAG;AAC1B,YAAY,OAAO;AACnB,YAAY,oBAAoB;AAChC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,aAAa;AAC1B;AACA;AACA,yCAAyC;AACzC;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,UAAU,GAAG;AAC1B;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,qBAAqB,KAAK,uBAAuB;AACnF;AACA,cAAc,UAAU;AACxB;AACA,wFAAwF,YAAY;AACpG,cAAc,UAAU;AACxB;AACA;AACA,cAAc,UAAU;AACxB;AACA;AACA,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB;;AAEA;AACA;AACA,WAAW,UAAU,GAAG;AACxB,WAAW,oBAAoB;AAC/B,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;;AAEA;AACA,sCAAsC,cAAc;AACpD;AACA,UAAU;AACV,WAAW,gBAAgB;AAC3B,aAAa;AACb;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,kBAAkB;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC5kBa;AACb;;AAEA;AACA,YAAY,mBAAO,CAAC,EAAS;AAC7B;;AAEA,cAAc,mBAAO,CAAC,EAAS;AAC/B,cAAc,mBAAO,CAAC,CAAQ;;AAE9B;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B,WAAW,QAAQ;AACnB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,4BAA4B;;AAE5B;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA;AACA;AACA,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,WAAW;AACtB,aAAa,UAAU;AACvB,YAAY,WAAW;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,WAAW;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,+GAA+G;AAC1H,WAAW,4JAA4J,GAAG;AAC1K,aAAa,gBAAgB;AAC7B,yBAAyB,6FAA6F;AACtH;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;AC7Ha;AACb;;AAEA;AACA,gBAAgB,mBAAO,CAAC,EAAa;AACrC;;AAEA,aAAa,mBAAO,CAAC,EAAU;AAC/B,aAAa,mBAAO,CAAC,CAAQ;AAC7B,aAAa,mBAAO,CAAC,EAAO;;AAE5B;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B,YAAY,WAAW;AACvB;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA,uBAAuB;;AAEvB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,yBAAyB;AACvC;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,UAAU;AACrB,aAAa,SAAS;AACtB,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;AACA,2DAA2D,kBAAkB;AAC7E;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,UAAU;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,4GAA4G;AAC5G;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,aAAa;AAC1B;AACA;AACA;AACA,4BAA4B,gDAAgD;AAC5E;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;;;;;;;ACtKa;AACb;;AAEA;AACA,uBAAuB,mBAAO,CAAC,EAAU;AACzC;;AAEA,WAAW,mBAAO,CAAC,CAAQ;;AAE3B;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,kBAAkB;AAC7B,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,2BAA2B;AACtC,WAAW,2BAA2B;AACtC,WAAW,mBAAmB;AAC9B,WAAW,QAAQ;AACnB;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,cAAc;AACd;AACA,+BAA+B;;AAE/B;AACA;AACA,cAAc;AACd;AACA,oCAAoC;;AAEpC;AACA;AACA,cAAc;AACd;AACA,2DAA2D;;AAE3D;AACA;AACA,cAAc;AACd;AACA,sCAAsC;;AAEtC;AACA;AACA,cAAc;AACd;AACA,6DAA6D;;AAE7D;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,mBAAmB;AACjC;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB,YAAY,WAAW;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;;ACtJa;AACb;;AAEA,WAAW,mBAAO,CAAC,CAAgB;;AAEnC;AACA;AACA;AACA;AACA,WAAW,eAAe;AAC1B;AACA;AACA;AACA;AACA;AACA,wDAAwD,iBAAiB;AACzE;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,YAAY;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,qBAAqB;AAChC,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,qBAAqB;AAChC,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,GAAG;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,GAAG;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,aAAa;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,mBAAmB;AAC9B,aAAa,GAAG;AAChB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,GAAG;AACd,WAAW,oBAAoB;AAC/B,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;;AAEA;;;;;;;AC1Ia;AACb;;AAEA;AACA,gBAAgB,mBAAO,CAAC,EAAa;AACrC;;AAEA,cAAc,mBAAO,CAAC,EAAS;AAC/B,cAAc,mBAAO,CAAC,CAAQ;AAC9B,cAAc,mBAAO,CAAC,EAAS;AAC/B,cAAc,mBAAO,CAAC,CAAQ;;AAE9B;AACA;AACA,YAAY;;AAEZ;AACA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B;AACA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,MAAM;AACjB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,aAAa;AAC1B;AACA;;AAEA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,eAAe;AAC1B,WAAW,cAAc;AACzB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gEAAgE;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,2BAA2B;AACtD;AACA;AACA;AACA,gCAAgC,+BAA+B;AAC/D;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,gCAAgC;AAChC;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,8BAA8B,qBAAqB;AACnD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,cAAc;AACzB,aAAa;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,eAAe,sCAAsC,sBAAsB;AACtF,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,eAAe,sCAAsC,sBAAsB;AACtF,aAAa,MAAM;AACnB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,MAAM;;AAEN;AACA,wDAAwD;;AAExD,MAAM;;AAEN;AACA,4BAA4B,yBAAyB;AACrD;AACA;AACA;AACA;AACA,wBAAwB,iDAAiD;AACzE;AACA;AACA,iDAAiD;AACjD;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,kBAAkB;AAC7B,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA,+DAA+D;AAC/D;AACA;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM;;AAEN;AACA,+CAA+C;;AAE/C,MAAM;;AAEN,wBAAwB,iDAAiD;AACzE;;AAEA;AACA,+CAA+C;;AAE/C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC9VA;;;;;;;ACAa;;AAEb;;AAEA,WAAW,mBAAO,CAAC,EAAS;AAC5B,YAAY,mBAAO,CAAC,EAAS;AAC7B,YAAY,mBAAO,CAAC,CAAS;;AAE7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,QAAQ,mBAAO,CAAC,GAAyB;AACzC,EAAE;AACF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;AC7MD;;AAEA,aAAa,mBAAO,CAAC,CAAc;AACnC,cAAc,mBAAO,CAAC,EAAe;AACrC,WAAW,mBAAO,CAAC,GAAY;AAC/B,cAAc,mBAAO,CAAC,GAAe;AACrC,YAAY,mBAAO,CAAC,GAAa;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,+DAA+D;AAC/D;AACA;AACA;;;;;;;AClBA;AACA;AACA;AACA;AACA,EAAE;AACF;;AAEA;AACA,EAAE;AACF;AACA;AACA;;;;;;;ACXA,aAAa,+BAA6B;;AAE1C;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;;;;;;;;ACZA;AACA;;AAEa;;AAEb,iCAAiC,8FAA2D;AAC5F;AACA;AACA;AACA;AACA;AACA,wEAAwE,aAAa;AACrF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACrFA,aAAa,mBAAO,CAAC,GAAQ;AAC7B;AACA;AACA;AACA,EAAE,qBAAqB;AACvB,EAAE;AACF,YAAY,wCAAqD;AACjE,EAAE,cAAc;AAChB,EAAE,gBAAgB;AAClB,EAAE,0CAAuD;AACzD,EAAE,wCAAmD;AACrD,EAAE,2CAAyD;AAC3D,EAAE,8CAA6D;AAC/D,EAAE,0CAAqE;AACvE,EAAE,2CAAgE;AAClE;;;;;;;ACfA,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ,GAAG,mBAAO,CAAC,EAAQ,GAAG,mBAAO,CAAC,EAAQ;AAC3F;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,QAAQ;AAC/B,uBAAuB,QAAQ;AAC/B,uBAAuB,QAAQ;AAC/B;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA,wDAAwD,YAAY;AACpE,wDAAwD,8BAA8B;AACtF;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,gBAAgB;AACjD;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA,gBAAgB,kBAAkB;AAClC,gBAAgB,kBAAkB;AAClC,gBAAgB,QAAQ;AACxB;AACA,iBAAiB,WAAW;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD,YAAY;AACpE,wDAAwD,8BAA8B;AACtF;AACA;AACA;AACA;AACA,EAAE;;;AAGF;;AAEA,CAAC;;;;;;;ACrIY;AACb;AACA;AACA;AACA,wBAAwB,qBAAqB;AAC7C;AACA,UAAU;AACV,WAAW,YAAY;AACvB,WAAW,MAAM;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B,WAAW,GAAG;AACd,WAAW,MAAM;AACjB,aAAa,YAAY;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;;;;;;;ACnDa;AACb;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA,+DAA+D;AAC/D;AACA;AACA,MAAM,aAAa;AACnB;AACA;;;;;;;;AChBa;;AAEb;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,sBAAsB;AACvD;AACA,UAAU;AACV,WAAW,mCAAmC,YAAY,IAAI;AAC9D,WAAW,YAAY;AACvB,WAAW,iBAAiB;AAC5B,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,mCAAmC,cAAc;AACjD;AACA,UAAU;AACV,WAAW,YAAY;AACvB,WAAW,iBAAiB;AAC5B,aAAa;AACb;;AAEA,cAAc,mBAAO,CAAC,EAAe;;;;;;;;ACnCxB;AACb;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACjBa;AACb;;AAEA,eAAe,mBAAO,CAAC,CAAQ;AAC/B,eAAe,mBAAO,CAAC,EAAS;AAChC,eAAe,mBAAO,CAAC,CAAQ;;AAE/B;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA,oBAAoB,mBAAmB;AACvC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,yCAAyC;AACzC,yCAAyC,YAAY,KAAK;AAC1D;AACA;AACA,+FAA+F;AAC/F;AACA;AACA;AACA,WAAW;AACX,OAAO;;AAEP;AACA,UAAU,2BAA2B;AACrC,8BAA8B,cAAc;;AAE5C;AACA,oEAAoE;;AAEpE;AACA,sBAAsB,YAAY;AAClC;AACA;;AAEA;AACA,cAAc,OAAO;;AAErB,sBAAsB,YAAY;AAClC;AACA;AACA;AACA;;AAEA,cAAc;AACd,OAAO;;AAEP;AACA,UAAU;AACV;AACA,6DAA6D;;AAE7D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;ACnGa;AACb;;AAEA,cAAc,mBAAO,CAAC,CAAQ;AAC9B,cAAc,mBAAO,CAAC,EAAS;AAC/B,cAAc,mBAAO,CAAC,CAAQ;;AAE9B;AACA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,uGAAuG,mBAAmB;AAC1H,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,wBAAwB;;AAExB;AACA,WAAW,gDAAgD;AAC3D;AACA;AACA,qDAAqD;AACrD;;AAEA;AACA,yBAAyB;AACzB;AACA;AACA,2BAA2B;AAC3B;AACA,6BAA6B;AAC7B;AACA;AACA,2GAA2G;AAC3G;AACA;AACA,cAAc;AACd;AACA,kEAAkE;AAClE;AACA;AACA;;AAEA;AACA,UAAU,2BAA2B;;AAErC;AACA;;AAEA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,WAAW;AACX,OAAO;;AAEP;AACA,gBAAgB,+BAA+B;AAC/C;AACA;AACA;AACA,uCAAuC,WAAW;AAClD;;AAEA;AACA;AACA;AACA;;;;;;;;ACzGa;AACb;;AAEA,gBAAgB,mBAAO,CAAC,CAAQ;AAChC,gBAAgB,mBAAO,CAAC,CAAQ;;AAEhC;AACA,kIAAkI,oBAAoB;AACtJ;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA,kDAAkD;AAClD,yBAAyB;AACzB;AACA;AACA,2EAA2E,iBAAiB;AAC5F;AACA;AACA;AACA,eAAe;AACf,UAAU;AACV;AACA,eAAe;AACf,6CAA6C;AAC7C;AACA;AACA,eAAe;AACf;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,aAAa,SAAS;AACtB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;;AAEd,oBAAoB,gDAAgD;AACpE;AACA;;AAEA;AACA,6CAA6C,qBAAqB;;AAElE;AACA,yBAAyB;AACzB;AACA;AACA;AACA,0BAA0B,WAAW,KAAK;AAC1C;AACA;AACA,eAAe;;AAEf;AACA,UAAU,2BAA2B;AACrC;AACA;AACA,0BAA0B,YAAY,KAAK;AAC3C;AACA,eAAe;;AAEf;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;;;;;;;AChLa;AACb;AACA;AACA;AACA;AACA;;AAEA,WAAW,mBAAO,CAAC,CAAQ;AAC3B,WAAW,mBAAO,CAAC,CAAQ;;AAE3B;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA,kDAAkD;AAClD,0BAA0B;AAC1B,4FAA4F,iBAAiB;AAC7G;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,eAAe;AACf,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,iDAAiD;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,mBAAmB;AACvC;AACA;;AAEA;AACA,yBAAyB;AACzB,cAAc;AACd;AACA;AACA,gBAAgB;AAChB,0CAA0C,YAAY,KAAK;AAC3D;AACA,WAAW;AACX,OAAO;;AAEP;AACA,UAAU,2BAA2B;AACrC,cAAc;AACd;AACA;AACA;AACA,sBAAsB,aAAa,KAAK;AACxC;AACA,WAAW;AACX,OAAO;;AAEP;AACA,UAAU;AACV;AACA,oBAAoB,UAAU;AAC9B;AACA;AACA,OAAO;AACP;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA,wCAAwC;AACxC;AACA;AACA,cAAc;AACd,cAAc;;AAEd;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B;AACA;AACA;AACA;;AAEA,iCAAiC;AACjC,+BAA+B;AAC/B,oBAAoB,2BAA2B;AAC/C;AACA;AACA,OAAO;AACP;;AAEA,4BAA4B;AAC5B,gCAAgC;AAChC,oBAAoB,sBAAsB;AAC1C,gBAAgB;AAChB;AACA,OAAO;AACP;;AAEA,+BAA+B;AAC/B,qBAAqB;AACrB,oBAAoB,yBAAyB;AAC7C;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA,WAAW;AACX,cAAc;AACd,6CAA6C;AAC7C,UAAU;AACV,OAAO;AACP;AACA;AACA,gBAAgB,mBAAmB;AACnC;AACA;AACA;AACA;AACA,2BAA2B,eAAe;AAC1C;AACA,cAAc;AACd,6CAA6C;AAC7C,gBAAgB;AAChB,sBAAsB,aAAa,KAAK;AACxC;AACA,WAAW;AACX,UAAU,2BAA2B;AACrC,0BAA0B;AAC1B;AACA,sBAAsB,aAAa,KAAK;AACxC;AACA,WAAW;AACX,UAAU,OAAO;AACjB,0CAA0C,sBAAsB;AAChE;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;;;;;;;ACpSa;;AAEb;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA,cAAc,mBAAO,CAAC,EAAW;;AAEjC;AACA,qCAAqC,eAAe;AACpD;AACA,UAAU;AACV,WAAW,mBAAmB;AAC9B,aAAa,UAAU,GAAG;AAC1B;AACA;;AAEA;AACA,mCAAmC,eAAe;AAClD;AACA,UAAU;AACV,WAAW,UAAU,GAAG;AACxB,WAAW,oBAAoB;AAC/B,aAAa,mBAAmB;AAChC;AACA;;AAEA;AACA,gCAAgC,eAAe;AAC/C;AACA,cAAc,4BAA4B;AAC1C,cAAc,0BAA0B;AACxC;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;;AAEA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;AClFa;AACb;;AAEA,2BAA2B,EAAE;AAC7B;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB,cAAc,wBAAwB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA,UAAU;AACV,aAAa,aAAa;AAC1B;;AAEA;AACA;AACA;AACA,UAAU;AACV,aAAa,aAAa;AAC1B;;AAEA;AACA;AACA;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,aAAa;AACb;;AAEA;AACA;AACA;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB,YAAY,OAAO;AACnB;;AAEA;AACA;AACA;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,aAAa,aAAa;AAC1B;;AAEA;AACA,gCAAgC,eAAe;AAC/C;AACA,cAAc,qBAAqB;AACnC,cAAc,qBAAqB;AACnC,cAAc,qBAAqB;AACnC,cAAc,qBAAqB;AACnC,cAAc,qBAAqB;AACnC,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,aAAa,kBAAkB;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,QAAQ;AACvB,eAAe,QAAQ;AACvB,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B,UAAU;AACV,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,wBAAwB,kBAAkB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,gCAAgC,IAAI;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,4CAA4C;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA,UAAU;;AAEV;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,QAAQ;AACvB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B,gBAAgB,OAAO;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,0BAA0B;AAC1B,KAAK;AACL;AACA;;;;;;;;AC5Ya;;AAEb;;AAEA,mBAAmB,4CAAkC;AACrD,iBAAiB,mBAAO,CAAC,CAAkB;AAC3C,gBAAgB,mBAAO,CAAC,EAAS;AACjC,iBAAiB,mBAAO,CAAC,EAAkB;AAC3C,kBAAkB,mBAAO,CAAC,EAAmB;;AAE7C;AACA,cAAc,mBAAO,CAAC,GAAe;AACrC,iBAAiB,mBAAO,CAAC,GAAkB;;;;;;;;ACZ9B;;AAEb;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA,IAAI;AACJ,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACzDA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA,iBAAiB,mBAAO,CAAC,CAAQ;AACjC;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;;;;;;;AChEa;;AAEb;;AAEA,aAAa,mBAAO,CAAC,EAAQ;AAC7B,cAAc,mBAAO,CAAC,EAAS;AAC/B,aAAa,mBAAO,CAAC,EAAQ;AAC7B,gBAAgB,mBAAO,CAAC,EAAW;;;;;;;;ACPtB;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B,aAAa,mBAAO,CAAC,EAAW;AAChC,gBAAgB,mBAAO,CAAC,EAAU;AAClC,aAAa,mBAAO,CAAC,EAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;AACA,SAAS,cAAc;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc,cAAc;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACxGa;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B,aAAa,mBAAO,CAAC,EAAW;AAChC,aAAa,mBAAO,CAAC,EAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,QAAQ;AAC1B;AACA,SAAS,cAAc;AACvB,gDAAgD;AAChD;AACA,4BAA4B;AAC5B;AACA,kDAAkD;AAClD;AACA,4BAA4B;AAC5B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,cAAc;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qCAAqC;AACrC,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qCAAqC;AACrC,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;AACA;AACA;AACA;;;;;;;ACzUA,kDAA6C;;;;;;;ACA7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB,mBAAO,CAAC,GAAa;AACtC,aAAa,+BAA6B;;AAE1C,sBAAsB,mBAAO,CAAC,EAAgB;AAC9C,sBAAsB,mBAAO,CAAC,EAAoB;AAClD,eAAe,mBAAO,CAAC,EAAa;;AAEpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;;AAEA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA,sBAAsB,UAAU;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;ACnDA;;;;;;;ACAA;;;;;;ACAA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA,cAAc,OAAO;AACrB;AACA;;AAEA;AACA;;AAEA,cAAc,OAAO;AACrB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA,cAAc,WAAW;AACzB;AACA;AACA;AACA;;AAEA,cAAc,OAAO;AACrB;AACA;;AAEA,cAAc,OAAO;AACrB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc,QAAQ;;AAEtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;ACvNA,qBAAqB,mBAAO,CAAC,GAAU;AACvC,oBAAoB,mBAAO,CAAC,GAAS;;AAErC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;AC1BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,SAAS,uCAA8B;AACvC;AACA;AACA;AACA;;AAEA;AACA,aAAa,mBAAO,CAAC,GAA2B;AAChD;;AAEA,aAAa,gCAAwB;AACrC,8IAA8I;AAC9I;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB,mBAAO,CAAC,EAAM;AAC9B;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;;AAEA,iBAAiB,mBAAO,CAAC,GAAgC;AACzD,kBAAkB,mBAAO,CAAC,EAA4B;AACtD,eAAe,mBAAO,CAAC,EAA0B;AACjD;AACA,qBAAqB,wCAA0B;AAC/C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAO,CAAC,CAAU;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,yEAAyE,mFAAmF;AAC5J;AACA;AACA,qBAAqB,mBAAO,CAAC,EAAkB;AAC/C;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,wCAAwC,iDAAwC;AAChF;AACA;AACA;AACA;AACA;AACA,qBAAqB,mBAAO,CAAC,EAAkB;AAC/C;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,+FAA+F;AAC/F,QAAQ;AACR;AACA,QAAQ;AACR;AACA,QAAQ;AACR;AACA;AACA;AACA,4FAA4F;AAC5F,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,gDAAgD;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sCAAsC,iDAAwC;AAC9E;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4EAA4E;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA,4EAA4E;AAC5E;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA,kBAAkB,yBAAyB;AAC3C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,mBAAO,CAAC,GAAmC;AACrF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA,mDAAmD,+DAA+D;AAClH;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,mBAAO,CAAC,GAAyB;AAC9C;AACA;AACA;AACA;AACA;AACA,iCAAiC,OAAO;AACxC;AACA;AACA;AACA;;;;;;;AClgCa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,wFAAwF;AACxF;AACA;AACA;AACA;AACA;AACA;;;;;;;AC/Fa;;AAEb,4BAA4B,oFAAsD;AAClF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACrBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEa;;AAEb;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,aAAa,mBAAO,CAAC,GAAgB;AACrC;AACA;;AAEA;AACA,aAAa,mBAAO,CAAC,GAA2B;AAChD;;AAEA,aAAa,gCAAwB;AACrC,8IAA8I;AAC9I;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,mBAAO,CAAC,EAA4B;AACtD,eAAe,mBAAO,CAAC,EAA0B;AACjD;AACA,qBAAqB,wCAA0B;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAO,CAAC,CAAU;AAClB;AACA;AACA,qBAAqB,mBAAO,CAAC,EAAkB;AAC/C;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL,IAAI;AACJ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,EAAE;AACF;AACA;AACA;AACA;AACA;AACA,qBAAqB,mBAAO,CAAC,EAAkB;;AAE/C;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wEAAwE,sDAAsD;AAC9H;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;;;;;;;AChoBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,aAAa;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;AACA,qBAAqB,wCAA0B;AAC/C;AACA;AACA;AACA;AACA,aAAa,mBAAO,CAAC,EAAkB;AACvC,mBAAO,CAAC,CAAU;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC7La;AACb,gBAAgB,mBAAO,CAAC,GAAO;AAC/B,0EAA0E,mBAAO,CAAC,GAAuC;;AAEzH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,wBAAwB;AACtC;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,GAAG;AACjB,cAAc,GAAG;AACjB,cAAc,GAAG;AACjB,cAAc,oBAAoB;AAClC,cAAc,wBAAwB;AACtC,cAAc,2BAA2B;AACzC,cAAc,yBAAyB;AACvC,cAAc,cAAc;AAC5B,cAAc,GAAG;AACjB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,0BAA0B;AACxC,cAAc,QAAQ;AACtB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA,WAAW,sCAAsC;AACjD,aAAa,MAAM;AACnB;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,2BAA2B,4BAA4B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,uCAAuC;AACnE;AACA;AACA,4BAA4B,oCAAoC;AAChE;AACA;AACA,4BAA4B,qCAAqC;AACjE;AACA;AACA,4BAA4B,mCAAmC;AAC/D;AACA;AACA;AACA;AACA,4BAA4B,eAAe;AAC3C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,aAAa,6BAA6B;AAC1C,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oDAAoD,0FAA0F;AAC9I;AACA;AACA;AACA;;AAEA;AACA,4BAA4B,2BAA2B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+DAA+D;;AAE/D;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,yBAAyB;AACvC,cAAc,yBAAyB;AACvC,cAAc,oBAAoB;AAClC,cAAc,wBAAwB;AACtC,cAAc,kCAAkC;AAChD,cAAc,yBAAyB;AACvC,cAAc,iBAAiB;AAC/B,cAAc,iCAAiC;AAC/C,cAAc,UAAU;AACxB;;AAEA;AACA;AACA;AACA,cAAc,SAAS;AACvB;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;;AAEA;AACA;AACA,WAAW,oCAAoC;AAC/C,WAAW,QAAQ;AACnB,aAAa,MAAM;AACnB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iCAAiC;AACrD;AACA;AACA,oBAAoB,6BAA6B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,iCAAiC;AACrD;AACA;AACA,oBAAoB,kCAAkC;AACtD;AACA;AACA;AACA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA,oBAAoB,sCAAsC;AAC1D;AACA;AACA;AACA;AACA;AACA,wBAAwB,qCAAqC;AAC7D;AACA;AACA,wBAAwB,oCAAoC;AAC5D;AACA;;AAEA;AACA;;AAEA;AACA;AACA,aAAa,2BAA2B;AACxC,WAAW,QAAQ;AACnB;AACA;AACA,sDAAsD,iBAAiB;AACvE;;AAEA,6BAA6B,6BAA6B;AAC1D;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iDAAiD;AAC3G,0DAA0D,8EAA8E;AACxI;AACA,yDAAyD,gBAAgB;AACzE,aAAa;AACb;AACA;AACA,6BAA6B,6BAA6B;AAC1D;AACA,gCAAgC,6BAA6B;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,4BAA4B;AAChD,2FAA2F,0DAA0D;AACrJ;AACA,oBAAoB,0BAA0B;AAC9C;AACA;AACA;AACA,6FAA6F,sDAAsD;;AAEnJ;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,4BAA4B;AAC1C,cAAc,2BAA2B;AACzC,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,GAAG;AACjB,cAAc,eAAe;AAC7B;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA;AACA,cAAc,SAAS;AACvB,cAAc,qBAAqB;AACnC;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,yCAAyC;AACpD,WAAW,QAAQ;AACnB,aAAa,OAAO;AACpB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,uCAAuC;AACvC,wCAAwC;AACxC,wCAAwC;AACxC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D;AAC3D;AACA;AACA;AACA;;AAEA;AACA,mCAAmC;AACnC;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;;AAEA;AACA;AACA,aAAa,gCAAgC;AAC7C,WAAW,QAAQ;AACnB;AACA;AACA,2DAA2D,kCAAkC;;AAE7F;;AAEA,8BAA8B;AAC9B,iEAAiE;AACjE,8BAA8B;;AAE9B,MAAM;;AAEN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mDAAmD;AACnD,mDAAmD;AACnD,2CAA2C;AAC3C;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,+BAA+B;AAC/B;AACA;AACA,MAAM;AACN;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,6BAA6B;AAC3C,cAAc,cAAc;AAC5B;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,GAAG;AACjB;;AAEA;AACA;AACA;AACA,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB;;AAEA;;AAEA;AACA;AACA,WAAW,wCAAwC;AACnD,aAAa,MAAM;AACnB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,6BAA6B;AACrD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,+BAA+B;AAC5C;AACA;;AAEA;AACA;AACA,mDAAmD,eAAe;AAClE,8DAA8D,yCAAyC;;AAEvG;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,GAAG;AACjB;;AAEA;;AAEA;AACA;AACA,WAAW,yCAAyC;AACpD,aAAa,OAAO;AACpB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,gCAAgC;AAC7C;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,0BAA0B;AACxC,cAAc,iBAAiB;AAC/B;;AAEA;AACA;AACA;AACA,cAAc,SAAS;AACvB;;AAEA;;AAEA;AACA;AACA,WAAW,2CAA2C;AACtD,aAAa,SAAS;AACtB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB,8BAA8B;AACtD;;AAEA;AACA;;AAEA;AACA;AACA,aAAa,kCAAkC;AAC/C;AACA;;AAEA;AACA;AACA,oBAAoB,uBAAuB;AAC3C;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,gBAAgB;AAC9B,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB;;AAEA;AACA;AACA;AACA,cAAc,SAAS;AACvB;;AAEA;;AAEA;AACA;AACA,WAAW,0CAA0C;AACrD,aAAa,QAAQ;AACrB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,iCAAiC;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,qCAAqC,6BAA6B;AAClE;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,yDAAyD,eAAe;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,2DAA2D;AAC1E;AACA;;AAEA;AACA;AACA;AACA;AACA,kEAAkE,gCAAgC;AAClG;;AAEA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;;;;;;;;AC3hCa;AACb,wBAAwB,mBAAO,CAAC,GAAmB;AACnD,wBAAwB,mBAAO,CAAC,GAAsB;AACtD,qBAAqB,mBAAO,CAAC,GAAgB;AAC7C,qBAAqB,mBAAO,CAAC,GAAY;;AAEzC;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;;AAEF;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA,EAAE;AACF;;AAEA,eAAe;AACf,aAAa;;AAEb,iBAAiB;AACjB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAE;;AAEF;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,EAAE;AACF;;AAEA,gBAAgB;AAChB;AACA;AACA,EAAE;;AAEF;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH,wDAAwD,2CAA2C;AACnG;AACA;;AAEA,oBAAoB;AACpB;AACA;AACA;AACA;AACA,EAAE;;AAEF;AACA;AACA,yDAAyD,YAAY;;AAErE;AACA;AACA;AACA,oBAAoB,YAAY;AAChC;;AAEA;AACA;AACA,aAAa,2GAA2G;AACxH;;AAEA,WAAW,IAAI,EAAE,YAAY,EAAE,KAAK;AACpC;;AAEA,YAAY;AACZ;AACA;AACA;AACA,EAAE;;AAEF,QAAQ,gCAAgC;AACxC;AACA;AACA;AACA;AACA,EAAE;AACF;;AAEA,eAAe;AACf;;AAEA;AACA;;;;;;;ACjeA;AACA;AACA;;AAEA,SAAS,mBAAO,CAAC,EAAI;AACrB,SAAS,mBAAO,CAAC,EAAM;AACvB,kBAAkB,mBAAO,CAAC,GAAkB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,SAAS,EAAE,SAAS,EAAE;AAChE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI,KAAyC;AAC7C,QAAQ,OAAuB;AAC/B,QAAQ,CAAO;;AAEf;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,OAAO;AAChB;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB;AACnB;AACA;AACA,cAAc;AACd;;AAEA;;AAEA;AACA,mCAAmC,OAAO;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC5NA,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ,GAAG,mBAAO,CAAC,EAAc,GAAG,mBAAO,CAAC,EAAO,GAAG,mBAAO,CAAC,EAAU,GAAG,mBAAO,CAAC,EAAe;AAC/I;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,yBAAyB,SAAS;AAClC;AACA;AACA,eAAe;AACf;AACA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB,SAAS;AAClC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,iCAAiC,gBAAgB;AACjD;AACA;AACA,mBAAmB;AACnB;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oCAAoC,mBAAmB;AACvD;;AAEA;AACA;AACA,mBAAmB;AACnB;AACA;;AAEA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,iCAAiC,iBAAiB;AAClD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;;;AAGF;;AAEA,CAAC;;;;;;ACzOD,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ;AACrD;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,6BAA6B,cAAc;AAC3C;AACA;AACA;;AAEA;;AAEA,iCAAiC,sCAAsC;AACvE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qCAAqC,gBAAgB;AACrD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,UAAU;;AAEV;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,qBAAqB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;;;AAGF;;AAEA,CAAC;;;;;;ACvID,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ;AACrD;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,yBAAyB,QAAQ;AACjC;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA,6BAA6B,QAAQ;AACrC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,6BAA6B,OAAO;AACpC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;;AAEA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,kBAAkB;AAClC;AACA,iBAAiB,WAAW;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,kBAAkB;AAClC,gBAAgB,kBAAkB;AAClC;AACA,iBAAiB,WAAW;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;;;AAGF;;AAEA,CAAC;;;;;;AC3QD,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ;AACrD;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,6BAA6B,QAAQ;AACrC;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA;AACA;AACA;AACA,mBAAmB;AACnB;AACA,mBAAmB;AACnB;AACA,mBAAmB;AACnB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;;AAEA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA,gBAAgB,kBAAkB;AAClC;AACA,iBAAiB,WAAW;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,kBAAkB;AAClC,gBAAgB,kBAAkB;AAClC;AACA,iBAAiB,WAAW;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;;;AAGF;;AAEA,CAAC;;;;;;ACrJD,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ;AACrD;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,6BAA6B,qBAAqB;AAClD;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,MAAM;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN,EAAE;;;AAGF,CAAC;;;;;;AC9ID,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ,GAAG,mBAAO,CAAC,EAAU;AAC1E;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,mBAAmB,QAAQ;AAC3B,mBAAmB,QAAQ;AAC3B,mBAAmB,QAAQ;AAC3B,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA,uBAAuB,WAAW;AAClC;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA,+EAA+E,iBAAiB;AAChG;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA,+EAA+E,iBAAiB;AAChG;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,WAAW;AAC/B,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA,yGAAyG,iBAAiB;AAC1H;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU;;AAEV;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,MAAM;;AAEN;AACA;AACA;AACA,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B,wBAAwB,QAAQ;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B,wBAAwB,QAAQ;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf;AACA;;AAEA;AACA,6BAA6B,eAAe;AAC5C;AACA;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,6BAA6B,mBAAmB;AAChD;AACA;AACA;;AAEA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA,uBAAuB,MAAM;AAC7B,uBAAuB,SAAS;AAChC;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA,UAAU;;AAEV;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf;AACA;;AAEA;AACA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA,MAAM;;AAEN;AACA;AACA;AACA,mBAAmB,WAAW;AAC9B,mBAAmB,WAAW;AAC9B,mBAAmB,WAAW;AAC9B,mBAAmB,WAAW;AAC9B,mBAAmB,QAAQ;AAC3B,mBAAmB,MAAM;AACzB,mBAAmB,SAAS;AAC5B,mBAAmB,QAAQ;AAC3B,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe;AACf;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,cAAc;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,0CAA0C,oCAAoC;AAC9E;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,WAAW;AAClC;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,kBAAkB;AACtC,oBAAoB,WAAW;AAC/B,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,cAAc;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,kHAAkH,QAAQ;AAC1H,kHAAkH,yCAAyC;AAC3J;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,qBAAqB;AACzC,oBAAoB,WAAW;AAC/B,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA,uHAAuH,yCAAyC;AAChK,oHAAoH,yCAAyC;AAC7J;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA,oBAAoB,qBAAqB;AACzC,oBAAoB,WAAW;AAC/B;AACA,qBAAqB,cAAc;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,QAAQ;AAC5B,oBAAoB,QAAQ;AAC5B,oBAAoB,kBAAkB;AACtC;AACA,qBAAqB,cAAc;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,2BAA2B;;AAElE;AACA;AACA;;AAEA;AACA,0CAA0C,8BAA8B;AACxE;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,KAAK;AAC5B;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,kBAAkB;AACtC,oBAAoB,QAAQ;AAC5B,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,cAAc;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,0HAA0H,iCAAiC;AAC3J;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU;;AAEV;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,oBAAoB,qBAAqB;AACzC,oBAAoB,QAAQ;AAC5B,oBAAoB,QAAQ;AAC5B;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA;AACA,+HAA+H,iCAAiC;AAChK,4HAA4H,iCAAiC;AAC7J;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN,EAAE;;;AAGF,CAAC;;;;;;ACz3BD,CAAC;AACD,KAAK,IAA2B;AAChC;AACA,qCAAqC,mBAAO,CAAC,CAAQ;AACrD;AACA,MAAM,EAOJ;AACF,CAAC;;AAED;;AAEA,CAAC;;;;;;ACjBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC1BA;AACA,aAAa,mBAAO,CAAC,EAAQ;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA,EAAE,cAAc;AAChB;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC/Da;AACb,eAAe,wCAA2C;;AAE1D;;AAEA;AACA,qCAAqC,YAAY,KAAK,gBAAgB;AACtE;AACA,UAAU;AACV,WAAW,YAAY;AACvB,WAAW,MAAM;AACjB,aAAa;AACb;;AAEA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,MAAM;AACjB,WAAW,cAAc;AACzB,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,cAAc;AACzB,aAAa;AACb,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,MAAM;AACjB,aAAa,eAAe;AAC5B,SAAS;AACT;AACA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,iBAAiB;AAC5B,WAAW,MAAM;AACjB,aAAa,MAAM;AACnB,YAAY,OAAO;AACnB,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,4BAA4B,mBAAO,CAAC,EAAW;AAC/C,4BAA4B,mBAAO,CAAC,EAAW;AAC/C,4BAA4B,mBAAO,CAAC,EAAY;AAChD,4BAA4B,mBAAO,CAAC,EAAa;;AAEjD;AACA,4BAA4B,mBAAO,CAAC,EAAU;AAC9C,4BAA4B,mBAAO,CAAC,EAAa;AACjD,4BAA4B,mBAAO,CAAC,EAAQ;AAC5C,4BAA4B,mBAAO,CAAC,CAAQ;AAC5C,4BAA4B,mBAAO,CAAC,EAAQ;AAC5C,4BAA4B,mBAAO,CAAC,EAAS;AAC7C,4BAA4B,mBAAO,CAAC,EAAS;AAC7C,4BAA4B,mBAAO,CAAC,EAAY;AAChD,4BAA4B,mBAAO,CAAC,EAAW;AAC/C,4BAA4B,mBAAO,CAAC,EAAU;;AAE9C;AACA,4BAA4B,mBAAO,CAAC,EAAW;AAC/C,4BAA4B,mBAAO,CAAC,EAAY;;AAEhD;AACA,4BAA4B,mBAAO,CAAC,EAAS;AAC7C,4BAA4B,mBAAO,CAAC,CAAQ;;AAE5C;AACA;AACA;AACA;AACA;;;;;;;;ACvGa;AACb;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA,wBAAwB,mBAAO,CAAC,EAAU;AAC1C,wBAAwB,mBAAO,CAAC,EAAiB;AACjD,wBAAwB,mBAAO,CAAC,EAAU;AAC1C,wBAAwB,mBAAO,CAAC,EAAiB;;AAEjD;AACA,wBAAwB,mBAAO,CAAC,CAAgB;AAChD,wBAAwB,mBAAO,CAAC,EAAO;AACvC,wBAAwB,mBAAO,CAAC,EAAS;AACzC;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;ACnCa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,OAAO;AACvB;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA,eAAe;AACf,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA,8BAA8B,EAAE,mBAAmB,EAAE,iBAAiB,EAAE;AACxE;;;;;;;;AC1Ia;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,UAAU;AACrB,WAAW,GAAG;AACd,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,UAAU;AACrB,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,qBAAqB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,MAAM;AACjB,aAAa,mBAAmB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,qBAAqB;AACpC;AACA,oBAAoB,qBAAqB;AACzC;AACA;AACA;AACA;;;;;;;;AC3Ea;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,KAAK;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,KAAK;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA,cAAc,0CAA0C;AACxD;AACA;AACA,cAAc;AACd;AACA,qDAAqD;AACrD;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC9Ua;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA,oBAAoB,mBAAmB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA,YAAY;AACZ,oBAAoB,mBAAmB;AACvC;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACxGa;AACb;AACA;AACA;AACA,4BAA4B,gBAAgB;AAC5C;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,aAAa,YAAY;AACzB;AACA;AACA;AACA,wBAAwB,gBAAgB;AACxC;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa,YAAY;AACzB,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,eAAe;AAC1B,WAAW,YAAY;AACvB,WAAW,QAAQ;AACnB,aAAa,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC/Ca;AACb;;AAEA,WAAW,mBAAO,CAAC,CAAiB;;AAEpC;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;;AAEA;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA,6BAA6B;AAC7B,6CAA6C;AAC7C,2BAA2B;;AAE3B;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;;AAEA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACvMa;AACb;;AAEA;AACA,aAAa,mBAAO,CAAC,EAAU;AAC/B;;AAEA,WAAW,mBAAO,CAAC,CAAgB;;AAEnC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,eAAe;AAC5C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;;;;;;;;AChFa;AACb;;AAEA;AACA,aAAa,mBAAO,CAAC,EAAU;AAC/B;;AAEA,WAAW,mBAAO,CAAC,CAAgB;;AAEnC;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;;;;;;;;AC3Ca;AACb;;AAEA,WAAW,mBAAO,CAAC,CAAiB;;AAEpC;AACA;;AAEA;AACA,yCAAyC,sCAAsC;AAC/E;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA,UAAU;AACV,WAAW,YAAY;AACvB,WAAW,MAAM;AACjB,aAAa;AACb;;AAEA;AACA,+BAA+B,mBAAmB,eAAe,qBAAqB;AACtF;AACA;AACA;AACA,UAAU;AACV,WAAW,uBAAuB;AAClC,WAAW,iCAAiC;AAC5C,aAAa,wBAAwB;AACrC;;AAEA;AACA;AACA,6CAA6C,qBAAqB;AAClE;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA,mCAAmC,kCAAkC;AACrE,WAAW,qCAAqC;AAChD,WAAW,mBAAmB;AAC9B,WAAW,mBAAmB;AAC9B,WAAW,uBAAuB;AAClC,WAAW,iCAAiC;AAC5C,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,gCAAgC,mCAAmC;AACnE;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,gCAAgC,gBAAgB;AAChD;AACA;AACA;;AAEA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC7Ia;AACb;AACA;AACA;AACA;AACA;AACA,WAAW,UAAU;AACrB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,eAAe,0BAA0B;AACzC,eAAe,MAAM;AACrB,iBAAiB,kBAAkB;AACnC,gBAAgB,OAAO;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mFAAmF;AACnF;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0IAA0I,gCAAgC;AAC1K;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;;;;;;;;AClGa;AACb;AACA;AACA,gBAAgB,mBAAO,CAAC,EAAuB;AAC/C,gBAAgB,mBAAO,CAAC,EAAqB;AAC7C;AACA;AACA;AACA;AACA,mCAAmC,iBAAiB;AACpD;AACA,UAAU;AACV,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA,uBAAuB,iBAAiB;AACxC;AACA,UAAU;AACV,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,cAAc;AACzB,WAAW,eAAe;AAC1B,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,eAAe;AAC1B,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,cAAc;AACzB,aAAa,4BAA4B;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,6BAA6B;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;;;;;;;;AClHa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,QAAQ;AACrB;AACA;AACA;AACA,4BAA4B,GAAG;AAC/B;AACA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChEA,cAAc,mBAAO,CAAC,EAAQ;AAC9B;;AAEA;;;;;;;;ACHY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA,kBAAkB,qBAAqB;AACvC;AACA;AACA,kBAAkB,qBAAqB;AACvC;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA,2CAA2C;AAC3C,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,6CAA6C;AAC5E;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY,SAAS;AAChC;AACA;AACA;AACA,sCAAsC;AACtC,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,+BAA+B,6CAA6C;AAC5E;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACxHa;AACb;;AAEA;AACA,mBAAmB;;AAEnB,gBAAgB,mBAAO,CAAC,EAAY;AACpC,gBAAgB,mBAAO,CAAC,EAAQ;AAChC,gBAAgB,mBAAO,CAAC,EAAQ;AAChC,gBAAgB,mBAAO,CAAC,EAAS;AACjC,gBAAgB,mBAAO,CAAC,EAAY;AACpC,gBAAgB,mBAAO,CAAC,EAAS;AACjC,gBAAgB,mBAAO,CAAC,CAAQ;AAChC,gBAAgB,mBAAO,CAAC,EAAW;AACnC,gBAAgB,mBAAO,CAAC,EAAU;AAClC,gBAAgB,mBAAO,CAAC,EAAS;AACjC,gBAAgB,mBAAO,CAAC,CAAQ;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,YAAY;AAC5C;AACA,cAAc,kBAAkB;AAChC,cAAc,oBAAoB;AAClC,cAAc,oBAAoB;AAClC,cAAc,kBAAkB;AAChC,cAAc,MAAM;AACpB;;AAEA;AACA,sCAAsC,YAAY;AAClD;AACA,cAAc,SAAS;AACvB,cAAc,SAAS;AACvB;;AAEA;AACA;AACA;AACA,cAAc,SAAS;AACvB;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,MAAM;AACjB,WAAW,eAAe,sCAAsC,sBAAsB;AACtF,aAAa,eAAe;AAC5B,cAAc,QAAQ;AACtB,cAAc,eAAe,kBAAkB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,wDAAwD,eAAe;;AAEvE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,eAAe;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,eAAe;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,eAAe;AACf;;AAEA;AACA;;AAEA;AACA;AACA,uBAAuB;AACvB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA,mBAAmB;AACnB;AACA,0CAA0C;AAC1C;AACA,mBAAmB;AACnB,UAAU;AACV;AACA;AACA,mBAAmB;AACnB;AACA,kDAAkD;AAClD;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB;AACvB,cAAc;AACd;;AAEA,SAAS;AACT;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B;AAC3B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,0CAA0C;AAC1C;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB;AACvB,cAAc;AACd;;AAEA,SAAS;AACT;AACA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,cAAc;AACd;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,2CAA2C;AAC3C,uBAAuB;AACvB,cAAc;AACd;;AAEA,SAAS;AACT,uCAAuC;AACvC,SAAS;AACT;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,YAAY,KAAK,aAAa;AACjD;AACA;AACA;AACA;;AAEA,iCAAiC;AACjC;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA,cAAc,eAAe;AAC7B,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,mBAAmB,iBAAiB;AACpC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB;AACvB,cAAc;AACd;;AAEA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,uBAAuB;AACvB;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,eAAe,sCAAsC,sBAAsB;AACtF,aAAa,eAAe;AAC5B,cAAc,QAAQ;AACtB,cAAc,eAAe,kBAAkB;AAC/C;AACA;;;;;;;;ACrvBa;AACb;;AAEA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,mBAAmB;AAC9B,aAAa;AACb,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B,cAAc,YAAY;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,UAAU,UAAU,UAAU,YAAY;AAC3D;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B,kBAAkB,YAAY;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;AAEA;;AAEA;AACA;AACA;AACA,cAAc;AACd,kBAAkB,aAAa;AAC/B,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA,cAAc;AACd,kBAAkB,aAAa;AAC/B,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA,cAAc;AACd,kBAAkB,wBAAwB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B,kBAAkB,GAAG;AACrB,kBAAkB,QAAQ;AAC1B,kBAAkB,QAAQ;AAC1B,kBAAkB,SAAS;AAC3B,kBAAkB,SAAS;AAC3B,kBAAkB,YAAY;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,aAAa;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,aAAa;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,cAAc;AACd,kBAAkB,YAAY;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA,cAAc;AACd,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,iBAAiB;AAC9B;AACA;AACA;AACA;;;;;;;;AC9Ya;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B,SAAS,mBAAO,CAAC,CAAO;AACxB,eAAe,mBAAO,CAAC,CAAU;AACjC,WAAW,mBAAO,CAAC,EAAQ;;AAE3B;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,4DAA4D;AAC5D;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW;AACX;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,mBAAmB;AACzC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,sBAAsB,WAAW;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;ACz6Ba;;AAEb,SAAS,mBAAO,CAAC,CAAO;AACxB,eAAe,mBAAO,CAAC,CAAU;AACjC,WAAW,mBAAO,CAAC,EAAQ;;AAE3B,YAAY,mBAAO,CAAC,CAAU;;AAE9B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB;AAChB,wCAAwC;AACxC,gBAAgB;;AAEhB,sBAAsB,iBAAiB;AACvC;;AAEA,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;;;;;;ACjLa;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B,SAAS,mBAAO,CAAC,CAAO;AACxB,eAAe,mBAAO,CAAC,CAAU;AACjC,WAAW,mBAAO,CAAC,EAAQ;;AAE3B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;AClba;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B,aAAa,mBAAO,CAAC,EAAW;AAChC,gBAAgB,mBAAO,CAAC,EAAU;;AAElC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;;AAEA,QAAQ,cAAc;AACtB;;AAEA;AACA;AACA;AACA;AACA;;AAEA,cAAc,cAAc;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACzEa;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;;AAEZ;AACA;AACA;AACA,YAAY;;AAEZ;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA,WAAW;;AAEX;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;;;;;;;AChDD;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B,aAAa,mBAAO,CAAC,EAAO;;AAE5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;AC5Ba;;AAEb,YAAY,mBAAO,CAAC,CAAU;;AAE9B,aAAa,mBAAO,CAAC,EAAO;;AAE5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AClCa;;AAEb,YAAY,mBAAO,CAAC,CAAS;AAC7B,aAAa,mBAAO,CAAC,EAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B,oBAAoB;AAC/C;;AAEA,cAAc,gBAAgB;AAC9B;AACA;;AAEA;AACA,cAAc,gBAAgB;AAC9B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;AC9CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;;;;;;;AC3wBa;;AAEb,SAAS,mBAAO,CAAC,CAAO;AACxB,eAAe,mBAAO,CAAC,GAAW;AAClC,YAAY,mBAAO,CAAC,CAAU;AAC9B,aAAa,mBAAO,CAAC,EAAW;AAChC,WAAW,mBAAO,CAAC,EAAS;AAC5B;;AAEA,cAAc,mBAAO,CAAC,GAAO;AAC7B,gBAAgB,mBAAO,CAAC,GAAa;;AAErC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,2BAA2B,0CAA0C;AACrE;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;AClPa;;AAEb,WAAW,mBAAO,CAAC,EAAS;AAC5B,YAAY,mBAAO,CAAC,EAA2B;AAC/C,aAAa,mBAAO,CAAC,EAAqB;;AAE1C;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,mBAAmB;AACrC;AACA;AACA;;AAEA;AACA;AACA,0CAA0C;AAC1C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;AChHa;;AAEb,SAAS,mBAAO,CAAC,CAAO;AACxB,YAAY,mBAAO,CAAC,CAAU;AAC9B;;AAEA;AACA;AACA;AACA;;AAEA,mBAAmB,qBAAqB;AACxC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;;AAEA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;;AAEb,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;ACxHa;;AAEb,SAAS,mBAAO,CAAC,CAAO;;AAExB,YAAY,mBAAO,CAAC,CAAU;AAC9B;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,cAAc;AAC/C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACrKa;;AAEb,WAAW,mBAAO,CAAC,EAAS;AAC5B,aAAa,mBAAO,CAAC,EAAW;AAChC,YAAY,mBAAO,CAAC,CAAU;AAC9B;AACA;AACA,cAAc,mBAAO,CAAC,GAAO;AAC7B,gBAAgB,mBAAO,CAAC,GAAa;;AAErC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,UAAU,cAAc;AACxB,UAAU,sBAAsB;AAChC,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,gCAAgC;AAC9D;;AAEA;AACA,UAAU,OAAO;AACjB,UAAU,wBAAwB;AAClC,UAAU,4BAA4B;AACtC,YAAY,SAAS;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,sBAAsB;AACxC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;ACrHa;;AAEb,YAAY,mBAAO,CAAC,CAAU;AAC9B;AACA;AACA;;AAEA;AACA,UAAU,OAAO;AACjB,UAAU,QAAQ;AAClB;AACA,UAAU,aAAa;AACvB,UAAU,OAAO;AACjB,UAAU,aAAa;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,8BAA8B,UAAU;AACxC;;AAEA;AACA;AACA;AACA,8BAA8B,gBAAgB;AAC9C;;AAEA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;AC9Fa;;AAEb,SAAS,mBAAO,CAAC,CAAO;AACxB,YAAY,mBAAO,CAAC,CAAU;AAC9B;AACA;AACA;;AAEA;AACA,UAAU,OAAO;AACjB,UAAU,qBAAqB;AAC/B,UAAU,oBAAoB;AAC9B,UAAU,iBAAiB;AAC3B,UAAU,cAAc;AACxB,UAAU,cAAc;AACxB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;AChEA,aAAa,+BAA6B;;AAE1C,sBAAsB,mBAAO,CAAC,EAAgB;AAC9C,sBAAsB,mBAAO,CAAC,EAAoB;AAClD,WAAW,mBAAO,CAAC,EAAQ;AAC3B,eAAe,mBAAO,CAAC,EAAa;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,gBAAgB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,GAAG;AACH;;;;;;;ACrHA,mDAA8C;;;;;;;ACA9C,aAAa,mBAAO,CAAC,GAAQ;AAC7B,aAAa,gCAA6B;AAC1C,aAAa,mBAAO,CAAC,CAAQ;AAC7B,gBAAgB,mBAAO,CAAC,GAAW;AACnC,gBAAgB,mBAAO,CAAC,GAAW;;AAEnC;AACA;AACA;;AAEA;AACA,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wDAAwD,mBAAmB,4BAA4B;AACvG,uDAAuD,mBAAmB,2BAA2B;AACrG,uDAAuD,mBAAmB,0BAA0B;;AAEpG;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,EAAE;AACtB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA,oBAAoB;AACpB;;AAEA;AACA;AACA;;AAEA;AACA;AACA,IAAI,OAAO;AACX;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC;AAChC;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;ACjPY;;AAEZ,iBAAiB,mBAAO,CAAC,EAAa;AACtC,oBAAoB,mBAAO,CAAC,GAAQ;;AAEpC;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;ACXY;;AAEZ,aAAa,mBAAO,CAAC,GAAM;AAC3B,aAAa,+BAA6B;;AAE1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACjDA,YAAY,mBAAO,CAAC,GAAQ;AAC5B;;AAEA;;;;;;;;ACHY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,+BAA6B;AAC3C;AACA,gCAAgC;AAChC;AACA,kBAAkB,qBAAqB;AACvC;AACA;AACA,kBAAkB,qBAAqB;AACvC;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE;AACjE,qCAAqC;AACrC,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,6CAA6C;AAC5E;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY,SAAS;AAChC;AACA;AACA;AACA,sCAAsC;AACtC,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,+BAA+B,6CAA6C;AAC5E;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACtHY;AACZ,iBAAiB,mBAAO,CAAC,EAAU;;;;;;;;ACAnC;AACA;AACA;;AAEA,UAAU,6BAAmB;;AAE7B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY,QAAQ;AACpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;;;;;;;;ACjEY;AACZ,iBAAiB,mBAAO,CAAC,GAAO,EAAE,mBAAO,CAAC,GAAgB;;;;;;;;ACD9C;AACZ,aAAa,mBAAO,CAAC,GAAU;AAC/B,UAAU,mBAAO,CAAC,GAAO;AACzB,eAAe,mBAAO,CAAC,GAAiB;;AAExC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA,sBAAsB,uBAAuB;AAC7C;AACA;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;;;;;;ACpPA;AACA;AACA;;AAEA,aAAa,+BAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;AChHY;AACZ,aAAa,+BAA6B;AAC1C,iBAAiB,mBAAO,CAAC,EAAa;AACtC,SAAS,mBAAO,CAAC,CAAO;AACxB,SAAS,4BAAsB;;AAE/B,eAAe,mBAAO,CAAC,GAAkB;;AAEzC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB,OAAO,cAAc;AAC3C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB,OAAO,cAAc;AAC3C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA;;AAEA;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;;AAEA,4BAA4B;AAC5B;AACA;;AAEA;AACA;;AAEA,0BAA0B;AAC1B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,0BAA0B;AAC1B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,uBAAuB;AACvB;AACA;;AAEA;AACA;;AAEA,wBAAwB;AACxB;AACA;;AAEA;AACA;;AAEA,uBAAuB;AACvB;AACA;;AAEA,yBAAyB;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,yBAAyB;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,wBAAwB;AACxB;AACA,kBAAkB,uBAAuB;AACzC;AACA;AACA;;AAEA;AACA,kBAAkB,kBAAkB;AACpC;;AAEA;AACA;;AAEA,0BAA0B;AAC1B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,uBAAuB;AACvB;AACA;AACA;;AAEA,WAAW;AACX;;AAEA,uBAAuB;AACvB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,8CAA8C,yCAAyC;AACvF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc;AACd,iBAAiB;;AAEjB;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sCAAsC,8BAA8B;AACpE;;AAEA,eAAe;AACf,iBAAiB;;AAEjB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA,YAAY;AACZ;AACA;AACA;;AAEA,kBAAkB;AAClB;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;ACtQA,eAAe,mBAAO,CAAC,GAAc;AACrC,eAAe,mBAAO,CAAC,GAAU;AACjC;;;;;;;ACFA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;AACA,EAAE,EAAE,mBAAO,CAAC,EAAS;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;;;;;;;ACzBA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;AACA,EAAE,EAAE,mBAAO,CAAC,EAAS;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;;;;;;;ACzBA,iBAAiB,mBAAO,CAAC,EAAW,EAAE,mBAAO,CAAC,GAAgB;;;;;;;ACA9D,QAAQ,YAAY,EAAE,mBAAO,CAAC,EAAiB;;AAE/C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;AC5EA;;;;;;ACAA,yCAAkC;;;;;;;;ACArB;;AAEb,2CAA2C,gCAAgC,oCAAoC,oDAAoD,6DAA6D,iEAAiE,sCAAsC;AACvU,iCAAiC,gBAAgB,sBAAsB,OAAO,uDAAuD,6DAA6D,4CAA4C,oKAAoK,mFAAmF,KAAK;AAC1e,4CAA4C,2BAA2B,kBAAkB,kCAAkC,oEAAoE,KAAK,OAAO,oBAAoB;AAC/N,kDAAkD,0CAA0C;AAC5F,4CAA4C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD;AAC/P,8DAA8D,sEAAsE,8DAA8D,kDAAkD,iBAAiB,GAAG;AACxQ,+BAA+B,uCAAuC;AACtE,qCAAqC,+DAA+D,sCAAsC,0BAA0B,+CAA+C,yCAAyC,uEAAuE;AACnU,eAAe,mBAAO,CAAC,EAAQ;AAC/B;AACA,gBAAgB,mBAAO,CAAC,EAAM;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kDAAkD;AAClD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA,2CAA2C;AAC3C,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA,yDAAyD,cAAc;AACvE;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA,CAAC;;;;;;;ACtLY;;AAEb;AACA,4CAA4C,2BAA2B,kBAAkB,kCAAkC,oEAAoE,KAAK,OAAO,oBAAoB;AAC/N,+BAA+B,uCAAuC;AACtE,qCAAqC,+DAA+D,sCAAsC,0BAA0B,+CAA+C,yCAAyC,uEAAuE;AACnU,eAAe,mBAAO,CAAC,EAAiB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,iEAAiE;AACjE;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,SAAS;AACT,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACA;AACA,yFAAyF;AACzF;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;;;;;ACnLa;;AAEb,6EAA6E,MAAM,0BAA0B,0BAA0B,gBAAgB,eAAe,UAAU,iBAAiB,kBAAkB,OAAO;AAC1N,iCAAiC,qBAAqB,mCAAmC,gDAAgD,gCAAgC,wBAAwB,0EAA0E,uBAAuB,yEAAyE,mBAAmB;AAC9X,2CAA2C,gCAAgC,oCAAoC,oDAAoD,6DAA6D,iEAAiE,sCAAsC;AACvU,iCAAiC,gBAAgB,sBAAsB,OAAO,uDAAuD,6DAA6D,4CAA4C,oKAAoK,mFAAmF,KAAK;AAC1e,4CAA4C,2BAA2B,kBAAkB,kCAAkC,oEAAoE,KAAK,OAAO,oBAAoB;AAC/N,+BAA+B,uCAAuC;AACtE,qCAAqC,+DAA+D,sCAAsC,0BAA0B,+CAA+C,yCAAyC,uEAAuE;AACnU,2BAA2B,kFAAqD;AAChF;AACA;AACA;AACA;AACA,IAAI,iGAAiG,uFAAuF;AAC5L;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA,UAAU;AACV;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;;;;;;;ACnDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEa;;AAEb;AACA,gBAAgB,mBAAO,CAAC,EAAqB;AAC7C,mBAAO,CAAC,CAAU;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACpCA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,wCAAgC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,+BAA+B,mBAAO,CAAC,EAAiB;AACxD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yEAAyE,aAAa;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;;;;;;ACrFA,QAAQ,YAAY,EAAE,mBAAO,CAAC,EAAiB;;AAE/C;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;ACnEA,2CAA2C;AAC3C;AACA,EAAE,OAAO;AACT,EAAE,yCAA+C;AACjD;;;;;;;ACJA,SAAS,mBAAO,CAAC,EAAI;AACrB,WAAW,mBAAO,CAAC,EAAM;AACzB,SAAS,mBAAO,CAAC,GAAI;;AAErB;AACA,qBAAqB,KAAyC,GAAG,OAAuB,GAAG,CAAO;;AAElG;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,KAAyC,oBAAoB,CAAE;AACnE;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe;;AAEf;;AAEA,kBAAkB,gBAAgB;AAClC;;AAEA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC9MA,iBAAiB,mBAAO,CAAC,EAAW,EAAE,mBAAO,CAAC,GAAc;;;;;;;ACA5D,oBAAoB,mBAAO,CAAC,GAAuB;;AAEnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,YAAY;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;;AAEA;;;;;;;;ACnEa;AACb,6EAA6E,2CAA2C;;;;;;;;ACD3G;AACb,uBAAuB,EAAE;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA,kBAAkB,mBAAmB;AACrC;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;;;;;;AC7Fa;;AAEb;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;ACrBa;AACb;AACA;AACA;AACA;;AAEA,iBAAiB,iBAAiB;AAClC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;AChBA;;AAEa;AACb,wCAA6C;;;;;;;ACHhC;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,gBAAgB;AAChB;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,qJAAwB;AAClE;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,kKAAqC;AAC/E;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,mKAAsC;AAChF;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,sJAAyB;AACnE;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,sJAAyB;AACnE;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,uJAA0B;AACpE;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,uJAA0B;AACpE;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,wJAA2B;AACrE;AACA;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,0JAA6B;AACvE;AACA;AACA;AACA;AACA,IAAI,gBAAgB,cAAc,mBAAO,CAAC,GAA0B;AACpE;AACA;AACA;AACA;;;;;;;;AC5DA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;;AAEA,aAAa,+BAA6B;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,6BAA6B,sCAAsC,sCAAsC;AACzG;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;ACvSA;;AAEa;AACb,yCAAuC;;;;;;;;ACH1B;AACb,eAAe,wCAAyC;;AAExD;;AAEA;AACA,4BAA4B,mBAAO,CAAC,EAAY;AAChD,4BAA4B,mBAAO,CAAC,EAAS;AAC7C,4BAA4B,mBAAO,CAAC,EAAU;;AAE9C;AACA;;;;;;;;;;;;;;;;;;;;;;ACXa;;AAEb,sCAAiC;AACjC,yCAAqC;AACrC,wCAAqC;AACrC,yCAAqC;AACrC,wCAAqC;;;;;;;;ACNxB;;AAEb,YAAY,mBAAO,CAAC,CAAS;AAC7B,aAAa,mBAAO,CAAC,EAAU;;AAE/B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACjJa;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,mBAAmB,mBAAO,CAAC,EAAa;AACxC,iBAAiB,mBAAO,CAAC,GAAQ;AACjC,oBAAoB,mBAAO,CAAC,GAAa;AACzC,qBAAqB,mBAAO,CAAC,GAAc;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,IAAI;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,KAAK;AACvC;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,0BAA0B;AAC1B,mBAAmB,mBAAO,CAAC,GAAc;AACzC,iBAAiB;;;;;;;ACpLjB,aAAa,mBAAO,CAAC,CAAQ;;AAE7B,sBAAsB,mBAAO,CAAC,EAAoB;AAClD,sBAAsB,mBAAO,CAAC,EAAwB;AACtD,eAAe,mBAAO,CAAC,EAAiB;;AAExC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAE,4CAA0C;AAC5C,EAAE,yCAAuC;;AAEzC;AACA,EAAE;AACF,EAAE,kBAAkB;AACpB,EAAE,cAAc;AAChB;;;;;;;ACrCA,kDAA6C;;;;;;;;;;;;;;;ACA7C;;;;;;;ACAY;AACZ;AACA,EAAE,yCAAsC;AACxC,EAAE;AACF;AACA;AACA;;AAEA,EAAE,yCAAsC;AACxC;;;;;;;;ACTY;AACZ;;AAEA;AACA,eAAe;AACf;AACA;;AAEA,iBAAiB;AACjB;AACA;;AAEA,gBAAgB;AAChB;AACA;;AAEA,kBAAkB;AAClB;AACA;;AAEA,gBAAgB;AAChB;AACA;;AAEA,gBAAgB;AAChB;AACA;;AAEA;AACA,sBAAsB;AACtB;AACA;;AAEA,uBAAuB;AACvB;AACA;;AAEA,sBAAsB;AACtB;AACA;;AAEA,0BAA0B;AAC1B;AACA;;;;;;;;AC3CY;AACZ,aAAa,+BAA6B;AAC1C,YAAY,mBAAO,CAAC,GAAO;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;;AAEA,wBAAwB;AACxB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,uBAAuB;AACvB;AACA,gCAAgC,uDAAuD;;AAEvF;AACA,gCAAgC,uDAAuD;;AAEvF;AACA;;AAEA,uBAAuB;AACvB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA,WAAW;AACX;;AAEA,0BAA0B;AAC1B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,oCAAoC;AAC/C,mBAAmB,aAAa;AAChC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,oCAAoC;AAC/C,mBAAmB,aAAa;AAChC;AACA;AACA;AACA;;AAEA;AACA,SAAS,kCAAkC;AAC3C;AACA;AACA;AACA;;AAEA;AACA,SAAS,kCAAkC;AAC3C;AACA;AACA;AACA;;AAEA,WAAW;AACX;;;;;;;;AChMA,aAAa,mBAAO,CAAC,CAAQ;;AAE7B,yBAAoB,GAAG,yBAAc;AACrC,UAAsB,GAAG,yBAAgB;AACzC,yBAAsB,GAAG,yBAAgB;AACzC,UAAwB,GAAG,yBAAkB;AAC7C,yBAAmB,GAAG,yBAAkB;;;;;;;ACNxC;AACA,EAAE,yCAAsC;AACxC,EAAE;AACF,EAAE,yCAAgC;AAClC;;;;;;;;ACJA;;;;;;;ACCA;AACA;AACA;;AAEA,kDAA0C;;;;;;;;ACL1C;;;;;;ACAA;;AAEA,aAAa;AACb,sBAAsB,YAAY;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;ACzLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,UAAU,mBAAO,CAAC,GAAK;AACvB,YAAY,gCAA8B;AAC1C,SAAS,mBAAO,CAAC,EAAI;;AAErB,SAAsB;AACtB;;AAEA;AACA;AACA;AACA;AACA,aAAa,mBAAO,CAAC,GAAM;AAC3B,cAAc,mBAAO,CAAC,GAAO;;AAE7B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;;AAEA;AACA,8CAA8C;AAC9C;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA,iGAAiG;AACjG,gEAAgE;AAChE,yDAAyD;AACzD,iCAAiC;AACjC,4DAA4D;AAC5D,wCAAwC;AACxC,gDAAgD;AAChD,mCAAmC;AACnC,YAAY,EAAE;AACd,0CAA0C;AAC1C,mEAAmE,kBAAkB,gFAAgF,WAAW;AAChL,6CAA6C;AAC7C,YAAY,EAAE;AACd,iDAAiD;AACjD,mEAAmE,WAAW,WAAW;AACzF,6CAA6C;AAC7C,YAAY,EAAE;AACd,YAAY,+BAA+B;AAC3C,mEAAmE,WAAW,WAAW;AACzF,6CAA6C;AAC7C,YAAY,EAAE;AACd,8FAA8F;AAC9F,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,SAAS;AAC9D;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC3mBA;;;;;;;ACAA;;;;;;;ACAA;;;;;;;ACAA;;;;;UCAA;UACA;;UAEA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;;UAEA;UACA;;UAEA;UACA;;UAEA;UACA;UACA;;;;;WCzBA;WACA;WACA;WACA;WACA;WACA,iCAAiC,WAAW;WAC5C;WACA;;;;;WCPA;WACA;WACA;WACA;WACA,yCAAyC,wCAAwC;WACjF;WACA;WACA;;;;;WCPA;;;;;WCAA;WACA;WACA;WACA,uDAAuD,iBAAiB;WACxE;WACA,gDAAgD,aAAa;WAC7D;;;;;WCNA;WACA;WACA;WACA;WACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACJA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS,gBAAgB,sCAAsC,kBAAkB;AACjF,wBAAwB;AACxB;AACA;;AAEO;AACP;AACA;AACA;AACA,kBAAkB;AAClB;AACA;;AAEO;AACP;AACA,+CAA+C,OAAO;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA,2DAA2D,cAAc;AACzE;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA,2CAA2C,QAAQ;AACnD;AACA;;AAEO;AACP,kCAAkC;AAClC;;AAEO;AACP,uBAAuB,uFAAuF;AAC9G;AACA;AACA,yGAAyG;AACzG;AACA,sCAAsC,QAAQ;AAC9C;AACA,gEAAgE;AAChE;AACA,8CAA8C,yFAAyF;AACvI,8DAA8D,2CAA2C;AACzG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA,kBAAkB,yBAAyB;AAC3C;AACA;AACA;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA,4CAA4C,yEAAyE;AACrH;;AAEO;AACP;AACA;;AAEO;AACP,0BAA0B,+DAA+D,iBAAiB;AAC1G;AACA,kCAAkC,MAAM,+BAA+B,YAAY;AACnF,iCAAiC,MAAM,mCAAmC,YAAY;AACtF,8BAA8B;AAC9B;AACA,GAAG;AACH;;AAEO;AACP,YAAY,6BAA6B,0BAA0B,cAAc,qBAAqB;AACtG,eAAe,oDAAoD,qEAAqE,cAAc;AACtJ,qBAAqB,sBAAsB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC;AACtC,iCAAiC,SAAS;AAC1C,iCAAiC,WAAW,UAAU;AACtD,wCAAwC,cAAc;AACtD;AACA,4GAA4G,OAAO;AACnH,+EAA+E,iBAAiB;AAChG,uDAAuD,gBAAgB,QAAQ;AAC/E,6CAA6C,gBAAgB,gBAAgB;AAC7E;AACA,gCAAgC;AAChC;AACA;AACA,QAAQ,YAAY,aAAa,SAAS,UAAU;AACpD,kCAAkC,SAAS;AAC3C;AACA;;AAEO;AACP;AACA;AACA;AACA,eAAe,oCAAoC;AACnD;AACA;AACA,CAAC;AACD;AACA;AACA,CAAC;;AAEM;AACP;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,MAAM;AACxB;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;;AAEA;AACO;AACP,2BAA2B,sBAAsB;AACjD;AACA;AACA;;AAEA;AACO;AACP,gDAAgD,QAAQ;AACxD,uCAAuC,QAAQ;AAC/C,uDAAuD,QAAQ;AAC/D;AACA;AACA;;AAEO;AACP,2EAA2E,OAAO;AAClF;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA;AACA,eAAe,uFAAuF,cAAc;AACpH,qBAAqB,gCAAgC,qCAAqC,2CAA2C;AACrI,0BAA0B,MAAM,iBAAiB,YAAY;AAC7D,qBAAqB;AACrB,4BAA4B;AAC5B,2BAA2B;AAC3B,0BAA0B;AAC1B;;AAEO;AACP;AACA,eAAe,6CAA6C,UAAU,sDAAsD,cAAc;AAC1I,wBAAwB,6BAA6B,oBAAoB,uCAAuC,kBAAkB;AAClI;;AAEO;AACP;AACA;AACA,yGAAyG,uFAAuF,cAAc;AAC9M,qBAAqB,8BAA8B,gDAAgD,wDAAwD;AAC3J,2CAA2C,sCAAsC,UAAU,mBAAmB,IAAI;AAClH;;AAEO;AACP,+BAA+B,uCAAuC,YAAY,KAAK,OAAO;AAC9F;AACA;;AAEA;AACA,wCAAwC,4BAA4B;AACpE,CAAC;AACD;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP,2CAA2C;AAC3C;;AAEO;AACP;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,8CAA8C;AACnE;AACA;AACA,qBAAqB,aAAa;AAClC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+EAA+E,SAAS,gBAAgB;AACxG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gDAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;ACjXF;AACA;AACA;AACO;AACP;AACA;AACA;AACO;AACP;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;;AC9FwF;AACxF;AACA;AACA;AACA;AACA;AACA,qCAAqC,IAAI;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,mBAAmB;AACtD;AACA;AACA;AACA;AACA;AACA,sCAAsC,UAAU;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,UAAU,IAAI,UAAU;AAC5D,gDAAgD,IAAI,UAAU,EAAE;AAChE;AACA;AACA;AACA;AACA;AACA,4CAA4C,IAAI,UAAU,MAAM;AAChE;AACA;AACA,iCAAiC,UAAU;AAC3C,iCAAiC,UAAU;AAC3C;AACA;AACA;AACA;AACA;AACA,iCAAiC,aAAa;AAC9C,wBAAwB,OAAO;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,IAAI,UAAU,EAAE;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,GAAG;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACoB;AACrB;;;;ACxHwD;AACxB;AACzB,MAAM,uBAAe;AAC5B;AACA,uFAAuF,cAAc,GAAG,MAAM;AAC9G;AACA;AACA;AACO;AACP;AACA,0FAA0F,cAAc,GAAG,MAAM;AACjH;AACA,sBAAsB,4BAAW,oBAAoB,4BAAW;AAChE;;;ACbsD;AAC/C,MAAM,iBAAQ;AACrB,gBAAgB,UAAU;AAC1B;AACA;;;ACJsC;AAC/B;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;ACT2D;AACpD;;;ACDoB;AACI;AACN;;;ACFzB;AACA;AACgE;AAChE;AACA,IAAI,wBAAQ;AACZ,yBAAyB;AACzB,MAAM,iBAAe;AACd;AACP;AACA;AACA;AACA;AACA,eAAe,wBAAQ;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;ACnBA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;;ACRA;AACA;AACoD;AACR;AACF;AACU;AACpD;;ACN+C;AACN;AACD;AACwB;AAChE;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;AACA;AACA;AACA,YAAY,WAAW;AACvB;AACA;AACA;AACA,6BAA6B,eAAe;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,mBAAmB,WAAW;AAC9B;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA,wBAAwB,SAAS;AACjC;AACA,6BAA6B,SAAS;AACtC;AACA,uCAAuC,UAAU;AACjD;AACA,4BAA4B,IAAI,UAAU,EAAE;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,sBAAsB;AAClD;AACA;AACA;AACA;AACA;AACA,CAAC;AACiB;AAClB;AACA,gBAAgB,eAAe;AAC/B,2BAA2B,UAAU;AACrC,6BAA6B,SAAS;AACtC;AACA;AACA;AACA,gCAAgC,UAAU;AAC1C;AACA;AACA;AACA;;ACjF2B;AAC3B;;ACD+C;AAE/C,MAAMC,MAAM,GAAGC,KAAK,IAAI;EACtB,MAAMC,MAAM,GAAGD,KAAK;EACpB,MAAME,IAAI,GAAG,KAAAC,MAAA,aAAY;EACzBD,IAAI,CAACE,MAAM,CAACH,MAAM,CAAC;EACnB,MAAMI,cAAc,GAAGH,IAAI,CAACI,UAAU,EAAE;EACxC,OAAOC,MAAM,CAACC,IAAI,CAACH,cAAc,CAAC,CAACI,QAAQ,CAAC,KAAK,CAAC;AACpD,CAAC;AAED,kDAAAN,MAAA;AAAsB,SAAAO,iBAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,iBAAA;AAAA,SAAAC,qBAAA;EAAA,IAAAD,iBAAA;IAAA,IAAAE,cAAA,GAAAN,gBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,iBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,iBAAA;AAAA;AAAA,SAAAI,qBAAA;EAAA,IAAAC,iBAAA,GAAAT,gBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,kBAAA;EAAA,IAAAC,QAAA,GAAAT,oBAAA;EAAA,IAAAU,QAAA,GAAAP,oBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,gBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,qBAAA;AAAA,IAAAC,YAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,YAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,MAAA;EAAA2B,sBAAA,sBAAA3B,MAAA;EAAA2B,sBAAA,eAAAK,MAAA;EAAAL,sBAAA,YAAAK,MAAA;EAAAL,sBAAA,cAAAM,QAAA;EAAAN,sBAAA,wBAAAM,QAAA;EAAAN,sBAAA,aAAAO,OAAA;AAAA;AAAA,SAAAlC,OAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,iBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,eAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,qBAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,gBAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAxC,MAAA;IAAA;MAAA,OAAAC,MAAA;EAAA;EAAA,OAAAwC,SAAA;AAAA;AAAA,SAAAE,UAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,iBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,eAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,gBAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,oBAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,MAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,SAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,OAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,iBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,QAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,qBAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,QAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,SAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,iBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,oBAAA,GAAAH,oBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,QAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,iBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,qBAAA,UAAP7D,MAAM;AAAA,SAAA8D,yBAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAANjC,MAAM,EAAAgC,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,qBAAA,iBAAAA,qBAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAN/D,MAAM;EAAA8D,wBAAA,YAAA1D,MAAA;EAAA0D,wBAAA,sBAAA1D,MAAA;EAAA0D,wBAAA,eAAA1B,MAAA;EAAA0B,wBAAA,YAAA1B,MAAA;EAAA0B,wBAAA,cAAAzB,QAAA;EAAAyB,wBAAA,wBAAAzB,QAAA;EAAAyB,wBAAA,aAAAxB,OAAA;EAAAwB,wBAAA,kBAAAhC,YAAA;AAAA;;;;;ACVrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,uDAAuD;AACvF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,yBAAyB;AACjC,UAAU,QAAQ;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,SAAS;AACtC;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,kCAAkC,mDAAmD,GAAG,EAAE;AAC1F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qFAAqF,EAAE;AACvF;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,SAAS;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,0BAA0B;AAC1C;AACA;AACA,2BAA2B,6BAA6B;AACxD;AACA;AACA;AACA;AACA,mFAAmF,EAAE;AACrF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC;AACnC;AACA;AACA;AACA;AACA,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,eAAe,KAAK;AACpB;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,kBAAkB;AAC3C,yBAAyB,kBAAkB;AAC3C,yBAAyB,kBAAkB;AAC3C,yBAAyB,kBAAkB;AAC3C,yBAAyB,kBAAkB;AAC3C,yBAAyB,kBAAkB;AAC3C,4BAA4B,kBAAkB;AAC9C,yBAAyB,kBAAkB;AAC3C;AACA,yBAAyB,kBAAkB;AAC3C,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC;AACA;AACA;AACA;AACA,wBAAwB,wCAAwC;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,QAAQ;AACnC,8CAA8C,mDAAmD,GAAG,EAAE;AACtG;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,QAAQ;AAClC,6CAA6C,mDAAmD,GAAG,EAAE;AACrG;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA,8CAA8C,mDAAmD,GAAG,EAAE;AACtG;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA,qCAAqC,kEAAkE,GAAG,EAAE;AAC5G;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B,yDAAyD,EAAE;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,wBAAwB,QAAQ;AAChC,2CAA2C,mDAAmD,GAAG,EAAE;AACnG;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,QAAQ;AAClC,6CAA6C,mDAAmD,GAAG,EAAE;AACrG;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB,qDAAqD,EAAE;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,iDAAiD,EAAE;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,gDAAgD,EAAE;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,4CAA4C,EAAE;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,GAAG;AAC3F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,YAAY;AACzB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,sBAAsB,YAAY;AAClC;AACA;AACA,8BAA8B,SAAS;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,oBAAoB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,SAAS;AACrC;AACA;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,IAAI;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,0BAA0B,QAAQ;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,KAAK;AAClB;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,uBAAuB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,uBAAuB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,WAAW;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,wCAAwC,KAAK;AAC7C,UAAU;AACV;AACA;AACA;AACA,mBAAmB,KAAK;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,iBAAiB;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB;AACA;AACA,mBAAmB,SAAS;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,EAAE;AAC/C,0CAA0C,GAAG,SAAS,EAAE;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,iBAAiB;AACtC;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA,qCAAqC,SAAS;AAC9C;AACA,0BAA0B,SAAS;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,eAAe;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,MAAM;AAC9F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,aAAa;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,yBAAyB;AACjC,UAAU,yBAAyB;AACnC;AACA,kDAAkD,EAAE;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,GAAG;AAC3F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,KAAK;AACvB;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,KAAK;AAC3B;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA,oBAAoB,eAAe;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,KAAK;AACtC;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA,+BAA+B,MAAM;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,aAAa,KAAK;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,EAAE;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,gBAAgB;AACzB;AACA,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,MAAM;AAC9F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA,qBAAqB,SAAS;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,QAAQ;AAChB;AACA,kCAAkC,mDAAmD,GAAG,EAAE;AAC1F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA,8CAA8C,KAAK,MAAM,IAAI;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,MAAM;AAC9F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,MAAM;AAC9F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,eAAe,QAAQ;AACvB;AACA,kCAAkC,mDAAmD,GAAG,MAAM;AAC9F,iDAAiD,OAAO;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,WAAW;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA,kCAAkC,6BAA6B,GAAG,GAAG;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA,kCAAkC,mDAAmD,GAAG,MAAM;AAC9F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,QAAQ;AAClB;AACA,8BAA8B,mDAAmD,GAAG,EAAE;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,MAAM;AACf;AACA;AACA,WAAW,KAAK;AAChB;AACA;AACA;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,KAAK;AAC5B;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,6BAA6B,KAAK;AAClC;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA,gDAAe,SAAS,EAAC;;;;;;;;;ACx0FzB;AACA;AACA;AACA;AACA;AACA;AAC8D;AAG7C;AAEV,MAAM0C,qBAAqB,GAAGC,OAAO,IAAI;EAC9C,IAAIC,WAAW,GAAGD,OAAO;EACzB,IAAIA,OAAO,IAAIA,OAAO,CAACxE,KAAK,EAAE;IAC5ByE,WAAW,GAAGD,OAAO,CAACxE,KAAK;EAC7B;EACA,IAAIyE,WAAW,CAACC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IAChC,MAAMC,KAAK,GAAGF,WAAW,CAACG,KAAK,CAAC,GAAG,CAAC;IACpC,MAAMC,IAAI,GAAGF,KAAK,CAACG,MAAM,CAACC,CAAC,IAAI;MAC7B,IAAI;QACF5E,eAAA,WAAO6E,MAAM,CAACD,CAAC,EAAE,KAAK,CAAC;QACvB,OAAO,IAAI;MACb,CAAC,CAAC,OAAOnE,CAAC,EAAE;QACV,OAAO,KAAK;MACd;IACF,CAAC,CAAC;IACF,IAAIiE,IAAI,CAAC1B,MAAM,KAAK,CAAC,EAAE;MACrB,MAAM,IAAI8B,KAAK,CAAC,iBAAiB,CAAC;IACpC;IACA,CAACR,WAAW,CAAC,GAAGI,IAAI;EACtB;EACA,IAAI;IACF1E,eAAA,WAAO6E,MAAM,CAACP,WAAW,EAAE,KAAK,CAAC;EACnC,CAAC,CAAC,OAAO7D,CAAC,EAAE;IACV,MAAM,IAAIqE,KAAK,CAAC,iBAAiB,CAAC;EACpC;EACA,OAAOR,WAAW;AACpB,CAAC;;AAED;AACA;AACA;AACA;AACO,MAAMS,gCAAgC,GAAGzB,MAAM,IAAI;EACxD,MAAM0B,MAAM,GAAG5E,MAAM,CAACC,IAAI,CAACiD,MAAM,EAAE,QAAQ,CAAC;EAC5C,OAAOtD,eAAA,eAAWiF,iBAAiB,CAACJ,MAAM,CAACG,MAAM,CAAC;AACpD,CAAC;AAAC,SAAAzE,0BAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,0BAAA;AAAA,SAAAC,6BAAAA,CAAA;EAAA,IAAAD,0BAAA;IAAA,IAAAE,cAAA,GAAAN,0BAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,0BAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,0BAAA;AAAA;AAAA,SAAAI,6BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,0BAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,0BAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,6BAAA;EAAA,IAAAU,QAAA,GAAAP,6BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,0BAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,gCAAA;AAAA,IAAAC,qBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,qBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,eAAA;EAAA2B,sBAAA,sBAAA3B,eAAA;EAAA2B,sBAAA,eAAAK,eAAA;EAAAL,sBAAA,YAAAK,eAAA;EAAAL,sBAAA,cAAAM,iBAAA;EAAAN,sBAAA,wBAAAM,iBAAA;EAAAN,sBAAA,aAAAO,gBAAA;AAAA;AAAA,SAAAlC,eAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,0BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,wBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,gCAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,wBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAgC,MAAA;IAAA;MAAA,OAAAD,sBAAA;EAAA;EAAA,OAAA9B,SAAA;AAAA;AAAA,SAAAE,kBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,0BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,wBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,wBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,4BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,eAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,kBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,eAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,0BAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,iBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,gCAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,iBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,iBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,0BAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,6BAAA,GAAAH,6BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,gBAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,0BAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,iDAAA5B,gDAAAA,qBAAA;;AC9CF;AACA;AACA;AACA;AAI4B;;AAE5B;AACA;AACA;AACO,MAAMwD,gBAAgB,GAC3B,kEAAkE;AAE7D,MAAMC,aAAa,GAAG;EAC3BC,cAAc,EAAE;IACdxD,IAAI,EAAE,gBAAgB;IACtByD,IAAI,EAAE,wBAAwB;IAC9BC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE;EACV,CAAC;EACDC,aAAa,EAAE;IACb5D,IAAI,EAAE,eAAe;IACrByD,IAAI,EAAE,uBAAuB;IAC7BC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,WAAW;EACtB,CAAC;EACDE,4BAA4B,EAAE;IAC5B7D,IAAI,EAAE,8BAA8B;IACpCyD,IAAI,EAAE,sCAAsC;IAC5CC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,SAAS,CAAC;IACnBG,cAAc,EAAE,CAAA1F,cAAA,0BAAuB;IACvC2F,eAAe,EAAA3F,cAAA;EACjB,CAAC;EACD4F,cAAc,EAAE;IACdhE,IAAI,EAAE,gBAAgB;IACtByD,IAAI,EAAE,wBAAwB;IAC9BC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,EAAE;IACVG,cAAc,EAAE;EAClB,CAAC;EACDG,QAAQ,EAAE;IACRjE,IAAI,EAAE,UAAU;IAChByD,IAAI,EAAE,kBAAkB;IACxBC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,WAAW,EAAE,qBAAqB;EAC7C,CAAC;EACDO,gBAAgB,EAAE;IAChBlE,IAAI,EAAE,kBAAkB;IACxByD,IAAI,EAAE,0BAA0B;IAChCC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,aAAa,EAAE,qBAAqB;EAC/C,CAAC;EACDQ,WAAW,EAAE;IACXnE,IAAI,EAAE,aAAa;IACnByD,IAAI,EAAE,8BAA8B;IACpCC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,eAAe,CAAC;IACzBG,cAAc,EAAE;EAClB,CAAC;EACDM,YAAY,EAAE;IACZpE,IAAI,EAAE,cAAc;IACpByD,IAAI,EAAE,+BAA+B;IACrCC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,WAAW,EAAE,QAAQ,EAAE,OAAO;EACzC,CAAC;EACDU,mBAAmB,EAAE;IACnBrE,IAAI,EAAE,qBAAqB;IAC3ByD,IAAI,EAAE,sCAAsC;IAC5CC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,eAAe;EAC1B,CAAC;EACDW,wBAAwB,EAAE;IACxBtE,IAAI,EAAE,0BAA0B;IAChCyD,IAAI,EAAE,kCAAkC;IACxCC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE;EACV,CAAC;EACDY,eAAe,EAAE;IACfvE,IAAI,EAAE,iBAAiB;IACvByD,IAAI,EAAE,4BAA4B;IAClCC,MAAM,EAAE,MAAM;IACdC,MAAM,EAAE,CAAC,gBAAgB,CAAC;IAC1BG,cAAc,EAAE;EAClB,CAAC;EACDU,gBAAgB,EAAE;IAChBxE,IAAI,EAAE,kBAAkB;IACxByD,IAAI,EAAE,6BAA6B;IACnCC,MAAM,EAAE,MAAM;IACdC,MAAM,EAAE,CAAC,gBAAgB,CAAC;IAC1BG,cAAc,EAAE;EAClB,CAAC;EACDW,uBAAuB,EAAE;IACvBzE,IAAI,EAAE,yBAAyB;IAC/ByD,IAAI,EAAE,oCAAoC;IAC1CC,MAAM,EAAE,MAAM;IACdC,MAAM,EAAE,CAAC,gBAAgB,CAAC;IAC1BG,cAAc,EAAE;EAClB,CAAC;EACDY,YAAY,EAAE;IACZ1E,IAAI,EAAE,cAAc;IACpByD,IAAI,EAAE,+BAA+B;IACrCC,MAAM,EAAE,MAAM;IACdC,MAAM,EAAE,CAAC,gBAAgB,CAAC;IAC1BG,cAAc,EAAE;EAClB,CAAC;EACDa,QAAQ,EAAE;IACR3E,IAAI,EAAE,UAAU;IAChByD,IAAI,EAAE,WAAW;IACjBC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,CAAC,aAAa;EACxB,CAAC;EACDiB,OAAO,EAAE;IACP5E,IAAI,EAAE,SAAS;IACfyD,IAAI,EAAE,UAAU;IAChBC,MAAM,EAAE,MAAM;IACdC,MAAM,EAAE,CAAC,SAAS,CAAC;IACnBG,cAAc,EAAE;EAClB,CAAC;EACDe,UAAU,EAAE;IACV7E,IAAI,EAAE,YAAY;IAClByD,IAAI,EAAE,UAAU;IAChBC,MAAM,EAAE,QAAQ;IAChBC,MAAM,EAAE,CAAC,SAAS,CAAC;IACnBG,cAAc,EAAE;EAClB,CAAC;EACDgB,WAAW,EAAE;IACX9E,IAAI,EAAE,aAAa;IACnByD,IAAI,EAAE,iBAAiB;IACvBC,MAAM,EAAE,KAAK;IACbC,MAAM,EAAE,EAAE;IACVG,cAAc,EAAE;EAClB;AACF,CAAC;;AAED;AACA;AACA;AACO,MAAMiB,QAAQ,GAAG;EACtBC,OAAO,EAAE,GAAG;EACZC,GAAG,EAAE,GAAG;EACRC,IAAI,EAAE,MAAM;EACZC,IAAI,EAAE,MAAM;EACZC,OAAO,EAAE,MAAM;EACfC,UAAU,EAAE,MAAM;EAClBC,IAAI,EAAE,SAAS;EACfC,IAAI,EAAE,SAAS;EACfC,QAAQ,EAAE,SAAS;EACnBC,SAAS,EAAE,SAAS;EACpBC,IAAI,EAAE,YAAY;EAClBC,IAAI,EAAE,YAAY;EAClBC,OAAO,EAAE,YAAY;EACrBC,SAAS,EAAE,YAAY;EACvBC,IAAI,EAAE,YAAY;EAClBC,KAAK,EAAE,eAAe;EACtBC,UAAU,EAAE,eAAe;EAC3BC,KAAK,EAAE,eAAe;EACtBC,MAAM,EAAE,kBAAkB;EAC1BC,UAAU,EAAE,kBAAkB;EAC9BC,KAAK,EAAE,kBAAkB;EACzBC,KAAK,EAAE,qBAAqB;EAC5BC,MAAM,EAAE,wBAAwB;EAChCC,KAAK,EAAE,wBAAwB;EAC/BC,MAAM,EAAE,2BAA2B;EACnCC,MAAM,EAAE,8BAA8B;EACtCC,MAAM,EAAE;AACV,CAAC;AAEM,MAAMC,uBAAuB,GAAG,MAAM;AAEtC,MAAMC,0BAA0B,GAAAxI,cAAA,2BAA0B;AAE1D,MAAMyI,MAAM,GAAG;EACpBC,oBAAoB,EAAE,IAAI,GAAG,CAAC;EAC9BC,OAAO,EAAE,MAAM;EACfC,mBAAmB,EAAE,MAAM;EAC3BC,eAAe,EAAE,MAAM;EACvBC,YAAY,EAAE,MAAM;EACpBC,cAAc,EAAE;AAClB,CAAC;AAEM,MAAMC,gBAAgB,GAAG;EAC9BC,gBAAgB,EAAE;IAChBC,KAAK,EAAE,MAAM;IACbC,YAAY,EAAE;EAChB,CAAC;EACDC,kBAAkB,EAAE;IAClBF,KAAK,EAAE,MAAM;IACbC,YAAY,EAAE;EAChB,CAAC;EACDE,aAAa,EAAE;IACbH,KAAK,EAAE,MAAM;IACbC,YAAY,EAAE;EAChB,CAAC;EACDG,uBAAuB,EAAE;IACvBJ,KAAK,EAAE,MAAM;IACbC,YAAY,EAAE;EAChB;AACF,CAAC;AAAC,SAAA5I,yBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,yBAAA;AAAA,SAAAC,4BAAAA,CAAA;EAAA,IAAAD,yBAAA;IAAA,IAAAE,cAAA,GAAAN,yBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,yBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,yBAAA;AAAA;AAAA,SAAAI,4BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,yBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,yBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,4BAAA;EAAA,IAAAU,QAAA,GAAAP,4BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,yBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,+BAAA;AAAA,IAAAC,oBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,oBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,cAAA;EAAA2B,sBAAA,sBAAA3B,cAAA;EAAA2B,sBAAA,eAAAK,cAAA;EAAAL,sBAAA,YAAAK,cAAA;EAAAL,sBAAA,cAAAM,gBAAA;EAAAN,sBAAA,wBAAAM,gBAAA;EAAAN,sBAAA,aAAAO,eAAA;AAAA;AAAA,SAAAlC,cAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,yBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,uBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,+BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,uBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAiC,qBAAA;IAAA;MAAA,OAAAW,gCAAA;IAAA;MAAA,OAAAwD,uBAAA;EAAA;EAAA,OAAAnG,SAAA;AAAA;AAAA,SAAAE,iBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,yBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,uBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,uBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,2BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,cAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,iBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,cAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,yBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,gBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,+BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,gBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,gBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,yBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,4BAAA,GAAAH,4BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,eAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,yBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,gDAAA5B,gDAAAA,oBAAA;;ACxMF;AACA;AACA;AACA;AACmD;AACE;AAErD,MAAM8H,cAAc,GAAGA,CAACC,YAAY,EAAE7H,IAAI,KAAK;EAC7C,IAAI,CAAC6H,YAAY,CAAC7H,IAAI,IAAI6H,YAAY,CAAC7H,IAAI,KAAKA,IAAI,EAAE;IACpD,OAAO,KAAK;EACd;EACA,IAAI,CAAC6H,YAAY,CAACC,WAAW,IAAID,YAAY,CAACC,WAAW,CAAC1G,MAAM,KAAK,CAAC,EAAE;IACtE,OAAO,KAAK;EACd;EACA,OAAOyG,YAAY,CAACC,WAAW,CAAC,CAAC,CAAC,CAACC,IAAI,KAAK,OAAO;AACrD,CAAC;AAED,MAAMC,SAAS,GAAGH,YAAY,IAAIzJ,cAAA,mBAAeyJ,YAAY,EAAE,SAAS,CAAC;AAEzE,MAAMI,MAAM,GAAGJ,YAAY,IAAIzJ,cAAA,mBAAeyJ,YAAY,EAAE,MAAM,CAAC;AAE5D,SAASK,SAASA,CAACC,SAAS,EAAEC,MAAM,EAAqB;EAAA,IAAnBC,YAAY,GAAAC,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,EAAE;EAC5D,MAAMC,YAAY,GAAG,CAACJ,SAAS,CAACL,WAAW,IAAI,EAAE,EAAE1G,MAAM;EACzD,IAAIM,MAAM,GAAG0G,MAAM;EACnB,IAAIG,YAAY,KAAK,CAAC,EAAE;IACtB,OAAOH,MAAM;EACf;EACA;EACA,KAAK,MAAM;IAAErF,MAAM;IAAEyF;EAAY,CAAC,IAAIH,YAAY,EAAE;IAClD,IAAItF,MAAM,CAACoF,SAAS,CAAC,IAAIC,MAAM,EAAE;MAC/B,OAAOI,WAAW,CAACJ,MAAM,CAAC;IAC5B;EACF;EACA;EACA9I,MAAM,CAAC4B,IAAI,CAACiH,SAAS,CAACM,MAAM,CAAC,CAACtH,OAAO,CAACuH,KAAK,IAAI;IAC7C,MAAM;MACJC,IAAI;MACJ3I,IAAI;MACJ6H;IACF,CAAC,GAAGM,SAAS,CAACM,MAAM,CAACC,KAAK,CAAC;IAC3B,IAAIb,YAAY,EAAE;MAChB,IAAIc,IAAI,IAAIA,IAAI,KAAK,UAAU,EAAE;QAC/B,IAAI1K,KAAK,GAAGmK,MAAM,CAACpI,IAAI,CAAC;QACxB,IAAI/B,KAAK,IAAI2K,KAAK,CAACC,OAAO,CAAC5K,KAAK,CAAC,EAAE;UACjCA,KAAK,GAAGA,KAAK,CACV8E,MAAM,CAACC,CAAC,IAAIA,CAAC,KAAK,IAAI,IAAIA,CAAC,KAAKxC,SAAS,CAAC,CAC1CsI,GAAG,CAACC,IAAI,IAAI3K,cAAA,cAAUyJ,YAAY,EAAEkB,IAAI,EAAEV,YAAY,CAAC,CAAC;QAC7D;QACA3G,MAAM,GAAG;UACP,GAAGA,MAAM;UACT,CAAC1B,IAAI,GAAG/B;QACV,CAAC;MACH,CAAC,MAAM;QACLyD,MAAM,GAAG;UACP,GAAGA,MAAM;UACT,CAAC1B,IAAI,GAAGoI,MAAM,CAACpI,IAAI,CAAC,KAAK,IAAI,IAAIoI,MAAM,CAACpI,IAAI,CAAC,KAAKQ,SAAS,GACvDpC,cAAA,cAAUyJ,YAAY,EAAEO,MAAM,CAACpI,IAAI,CAAC,EAAEqI,YAAY,CAAC,GAAGD,MAAM,CAACpI,IAAI;QACvE,CAAC;MACH;IACF;EACF,CAAC,CAAC;EACF,OAAO0B,MAAM;AACf;AAEO,SAASsH,mBAAmBA,CAACb,SAAS,EAAEC,MAAM,EAAE;EACrD,MAAMG,YAAY,GAAGJ,SAAS,CAACL,WAAW,GAAGK,SAAS,CAACL,WAAW,CAAC1G,MAAM,GAAG,CAAC;EAC7E,IAAIM,MAAM,GAAG0G,MAAM;EACnB,IAAI,CAACA,MAAM,EAAE;IACX,OAAOA,MAAM;EACf;EACA,IAAIG,YAAY,KAAK,CAAC,IAAKA,YAAY,KAAK,CAAC,IAAI,CAACJ,SAAS,CAACL,WAAW,CAAC,CAAC,CAAC,CAACD,YAAa,EAAE;IACxF,OAAOO,MAAM;EACf;EACA;EACA;EACA;EACA;EACA,MAAM;IACJK,MAAM;IACNQ,OAAO,GAAG,CAAC;EACb,CAAC,GAAGd,SAAS;EACb,IAAII,YAAY,KAAK,CAAC,IAAIE,MAAM,CAACxK,KAAK,IAAIwK,MAAM,CAACS,GAAG,IAAID,OAAO,CAACE,SAAS,KAAK,IAAI,EAAE;IAClF,OAAO7J,MAAM,CAAC4B,IAAI,CAACkH,MAAM,CAAC,CAACU,GAAG,CAACI,GAAG,KAAK;MAAEA,GAAG;MAAEjL,KAAK,EAAEmK,MAAM,CAACc,GAAG;IAAE,CAAC,CAAC,CAAC;EACtE;EACA;EACA5J,MAAM,CAAC4B,IAAI,CAACiH,SAAS,CAACM,MAAM,CAAC,CAACtH,OAAO,CAACuH,KAAK,IAAI;IAC7C,MAAM;MACJ1I,IAAI;MACJ6H;IACF,CAAC,GAAGM,SAAS,CAACM,MAAM,CAACC,KAAK,CAAC;IAC3B,IAAIb,YAAY,EAAE;MAChB,IAAIO,MAAM,CAACpI,IAAI,CAAC,IAAI4I,KAAK,CAACC,OAAO,CAACT,MAAM,CAACpI,IAAI,CAAC,CAAC,EAAE;QAC/C,IAAI/B,KAAK,GAAGmK,MAAM,CAACpI,IAAI,CAAC;QACxB/B,KAAK,GAAGA,KAAK,CAAC6K,GAAG,CAACC,IAAI,IAAI3K,cAAA,wBAAoByJ,YAAY,EAAEkB,IAAI,CAAC,CAAC;QAClErH,MAAM,GAAG;UACP,GAAGA,MAAM;UACT,CAAC1B,IAAI,GAAG/B;QACV,CAAC;MACH,CAAC,MAAM;QACLyD,MAAM,GAAG;UACP,GAAGA,MAAM;UACT,CAAC1B,IAAI,GAAG5B,cAAA,wBAAoByJ,YAAY,EAAEO,MAAM,CAACpI,IAAI,CAAC;QACxD,CAAC;MACH;IACF;EACF,CAAC,CAAC;EACF,OAAO0B,MAAM;AACf;AAEO,SAAS0H,mBAAmBA,CAACjB,SAAS,EAAEC,MAAM,EAAE;EACrD,MAAMG,YAAY,GAAG,CAACJ,SAAS,CAACL,WAAW,IAAI,EAAE,EAAE1G,MAAM;EACzD,IAAIM,MAAM,GAAG0G,MAAM;EACnB,IACEG,YAAY,KAAK,CAAC,IACdA,YAAY,KAAK,CAAC,IAAI,CAACJ,SAAS,CAACL,WAAW,CAAC,CAAC,CAAC,CAACD,YAAa,EACjE;IACA,OAAOO,MAAM;EACf;EACA;EACA;EACA;EACA;EACA,MAAM;IAAEK,MAAM;IAAEQ,OAAO,GAAG,CAAC;EAAE,CAAC,GAAGd,SAAS;EAC1C,IACEI,YAAY,KAAK,CAAC,IACfE,MAAM,CAACxK,KAAK,IACZwK,MAAM,CAACS,GAAG,IACVD,OAAO,CAACE,SAAS,KAAK,IAAI,EAC7B;IACA,OAAOf,MAAM,CAACiB,MAAM,CAClB,CAACC,GAAG,EAAEtG,CAAC,MAAM;MACX,GAAGsG,GAAG;MACN,CAACtG,CAAC,CAACkG,GAAG,GAAGlG,CAAC,CAAC/E;IACb,CAAC,CAAC,EACF,CAAC,CAAC,CACH;EACH;EACA;EACAqB,MAAM,CAAC4B,IAAI,CAACuH,MAAM,CAAC,CAACtH,OAAO,CAACuH,KAAK,IAAI;IACnC,MAAM;MAAE1I,IAAI;MAAE6H;IAAa,CAAC,GAAGY,MAAM,CAACC,KAAK,CAAC;IAC5C,IAAIb,YAAY,IAAIO,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK5H,SAAS,EAAE;MAC3D,IAAI4H,MAAM,CAACpI,IAAI,CAAC,IAAI4I,KAAK,CAACC,OAAO,CAACT,MAAM,CAACpI,IAAI,CAAC,CAAC,EAAE;QAC/C,MAAM;UACJ8H,WAAW,GAAG,EAAE;UAChBW,MAAM,EAAEc,cAAc;UACtBN,OAAO,EAAEO,eAAe,GAAG,CAAC;QAC9B,CAAC,GAAG3B,YAAY;QAChB;QACA,IACEC,WAAW,CAAC1G,MAAM,KAAK,CAAC,IACrBmI,cAAc,CAACtL,KAAK,IACpBsL,cAAc,CAACL,GAAG,IAClBM,eAAe,CAACL,SAAS,KAAK,IAAI,EACrC;UACAzH,MAAM,GAAG;YACP,GAAGA,MAAM;YACT,CAAC1B,IAAI,GAAGoI,MAAM,CAACpI,IAAI,CAAC,CAACqJ,MAAM,CACzB,CAACC,GAAG,EAAEtG,CAAC,MAAM;cACX,GAAGsG,GAAG;cACN,CAACtG,CAAC,CAACkG,GAAG,GAAGlG,CAAC,CAAC/E;YACb,CAAC,CAAC,EACF,CAAC,CAAC;UAEN,CAAC;QACH,CAAC,MAAM;UACL,IAAIA,KAAK,GAAGmK,MAAM,CAACpI,IAAI,CAAC;UACxB/B,KAAK,GAAGA,KAAK,CAAC6K,GAAG,CAACC,IAAI,IAAI3K,cAAA,wBAAoByJ,YAAY,EAAEkB,IAAI,CAAC,CAAC;UAClErH,MAAM,GAAG;YACP,GAAGA,MAAM;YACT,CAAC1B,IAAI,GAAG/B;UACV,CAAC;QACH;MACF,CAAC,MAAM;QACLyD,MAAM,GAAG;UACP,GAAGA,MAAM;UACT,CAAC1B,IAAI,GAAG5B,cAAA,wBAAoByJ,YAAY,EAAEO,MAAM,CAACpI,IAAI,CAAC;QACxD,CAAC;MACH;IACF;EACF,CAAC,CAAC;EACF,OAAO0B,MAAM;AACf;AAEO,MAAM+H,kBAAkB,GAAG,CAChC;EACE1G,MAAM,EAAA3E,cAAA,aAAW;EACjBoK,WAAW,EAAEJ,MAAM,IAAI;IACrB,IAAI1G,MAAM,GAAG0G,MAAM;IACnB,IAAI,OAAOA,MAAM,KAAK,QAAQ,EAAE;MAC9B1G,MAAM,GAAG;QACPzD,KAAK,EAAEO,MAAM,CAACC,IAAI,CAACL,cAAA,qBAAiBA,cAAA,0BAAsBgK,MAAM,CAAC,CAAC,EAAE,KAAK;MAC3E,CAAC;IACH;IACA,IAAIQ,KAAK,CAACC,OAAO,CAACT,MAAM,CAAC,EAAE;MACzB1G,MAAM,GAAG0G,MAAM,CAACU,GAAG,CAACY,CAAC,KAAK;QACxBzL,KAAK,EAAEO,MAAM,CAACC,IAAI,CAACL,cAAA,qBAAiBA,cAAA,0BAAsBsL,CAAC,CAAC,CAAC,EAAE,KAAK;MACtE,CAAC,CAAC,CAAC;IACL;IACA,OAAOhI,MAAM;EACf;AACF,CAAC,EACD;EACEqB,MAAM,EAAA3E,cAAA,UAAQ;EACdoK,WAAW,EAAEJ,MAAM,IAAI;IACrB,IAAI1G,MAAM,GAAG0G,MAAM;IACnB,IAAI,OAAOA,MAAM,KAAK,QAAQ,EAAE;MAC9B1G,MAAM,GAAG;QACPzD,KAAK,EAAEO,MAAM,CAACC,IAAI,CAAC2J,MAAM,CAACuB,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK;MACpD,CAAC;IACH;IACA,IAAIf,KAAK,CAACC,OAAO,CAACT,MAAM,CAAC,EAAE;MACzB1G,MAAM,GAAG0G,MAAM,CAACU,GAAG,CAACY,CAAC,KAAK;QACxBzL,KAAK,EAAEO,MAAM,CAACC,IAAI,CAACiL,CAAC,CAACC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK;MAC/C,CAAC,CAAC,CAAC;IACL;IACA,OAAOjI,MAAM;EACf;AACF,CAAC,CACF;AAEM,SAASkI,aAAaA,CAACC,GAAG,EAAE;EACjC,MAAMC,GAAG,GAAGtL,MAAM,CAACC,IAAI,CAACoL,GAAG,EAAE,QAAQ,CAAC;EACtC,OAAOzL,cAAA,WAAO2L,MAAM,CAACD,GAAG,CAAC;AAC3B;AAEO,MAAME,mBAAmB,GAAG,CACjC;EACEjH,MAAM,EAAA3E,cAAA,aAAW;EACjBoK,WAAW,EAAEJ,MAAM,IAAI;IACrB,IAAI1G,MAAM,GAAG0G,MAAM;IACnB,IAAIQ,KAAK,CAACC,OAAO,CAACnH,MAAM,CAAC,EAAE;MACzBA,MAAM,GAAGA,MAAM,CAACoH,GAAG,CAACY,CAAC,IAAItL,cAAA,kBAAcsL,CAAC,CAACzL,KAAK,CAAC,CAAC;IAClD,CAAC,MAAM,IAAI,OAAOyD,MAAM,KAAK,QAAQ,EAAE;MACrCA,MAAM,GAAGtD,cAAA,kBAAcsD,MAAM,CAACzD,KAAK,CAAC;IACtC;IACA,OAAOyD,MAAM;EACf;AACF,CAAC,EACD;EACEqB,MAAM,EAAA3E,cAAA,UAAQ;EACdoK,WAAW,EAAEJ,MAAM,IAAI;IACrB,IAAI1G,MAAM,GAAG0G,MAAM;IACnB,IAAIQ,KAAK,CAACC,OAAO,CAACnH,MAAM,CAAC,EAAE;MACzBA,MAAM,GAAGA,MAAM,CAACoH,GAAG,CAACY,CAAC,IAAIlL,MAAM,CAACC,IAAI,CAACiL,CAAC,CAACzL,KAAK,EAAE,QAAQ,CAAC,CAACS,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1E,CAAC,MAAM,IAAI,OAAOgD,MAAM,KAAK,QAAQ,EAAE;MACrCA,MAAM,GAAGlD,MAAM,CAACC,IAAI,CAACiD,MAAM,CAACzD,KAAK,EAAE,QAAQ,CAAC,CAACS,QAAQ,CAAC,KAAK,CAAC;IAC9D;IACA,OAAOgD,MAAM;EACf;AACF,CAAC,CACF;AAAC,SAAA/C,yBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,yBAAA;AAAA,SAAAC,4BAAAA,CAAA;EAAA,IAAAD,yBAAA;IAAA,IAAAE,cAAA,GAAAN,yBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,yBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,yBAAA;AAAA;AAAA,SAAAI,4BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,yBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,yBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,4BAAA;EAAA,IAAAU,QAAA,GAAAP,4BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,yBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,+BAAA;AAAA,IAAAC,oBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,oBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,cAAA;EAAA2B,sBAAA,sBAAA3B,cAAA;EAAA2B,sBAAA,eAAAK,cAAA;EAAAL,sBAAA,YAAAK,cAAA;EAAAL,sBAAA,cAAAM,gBAAA;EAAAN,sBAAA,wBAAAM,gBAAA;EAAAN,sBAAA,aAAAO,eAAA;AAAA;AAAA,SAAAlC,cAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,yBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,uBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,+BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,uBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAqH,cAAA;IAAA;MAAA,OAAAM,SAAA;IAAA;MAAA,OAAAc,mBAAA;IAAA;MAAA,OAAAI,mBAAA;IAAA;MAAA,OAAApB,SAAA;IAAA;MAAA,OAAAL,gBAAA;IAAA;MAAA,OAAAnF,qBAAA;IAAA;MAAA,OAAAyF,MAAA;IAAA;MAAA,OAAA1F,MAAA;IAAA;MAAA,OAAAqH,aAAA;EAAA;EAAA,OAAApJ,SAAA;AAAA;AAAA,SAAAE,iBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,yBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,uBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,uBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,2BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,cAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,iBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,cAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,yBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,gBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,+BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,gBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,gBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,yBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,4BAAA,GAAAH,4BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,eAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,yBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,qDAAA5B,oBAAA;;AC1PF;AACA;AACA;AACA;;AAEqC;AACb;AACyC;AAC3B;AAMjB;AACS;AAGvB,MAAMyC,MAAM,GAAG;EACpBwH,MAAMA,CAACK,IAAI,EAAoB;IAAA,IAAlBC,QAAQ,GAAA/B,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,KAAK;IAC3B,IAAI5G,MAAM,GAAG0I,IAAI;IACjB,IAAI,OAAOA,IAAI,KAAK,QAAQ,EAAE;MAC5B1I,MAAM,GAAGlD,MAAM,CAACC,IAAI,CAAC2L,IAAI,EAAEC,QAAQ,CAAC;IACtC;IACA,IAAI,EAAE3I,MAAM,YAAYlD,MAAM,CAAC,EAAE;MAC/B,MAAM,IAAI8L,SAAS,CAAC,6CAA6C,CAAC;IACpE;IACA,IAAInM,IAAI,GAAGuD,MAAM;IACjBvD,IAAI,GAAGK,MAAM,CAACC,IAAI,CAACL,UAAA,WAAOsD,MAAM,CAAC,EAAE,KAAK,CAAC;IACzCvD,IAAI,GAAGK,MAAM,CAACC,IAAI,CAACL,UAAA,WAAOD,IAAI,CAAC,EAAE,KAAK,CAAC;IACvCA,IAAI,GAAGK,MAAM,CAACC,IAAI,CAACiD,MAAM,CAAChD,QAAQ,CAAC,KAAK,CAAC,GAAGP,IAAI,CAACoM,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC7L,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;IACpF,OAAON,UAAA,SAAK2L,MAAM,CAAC5L,IAAI,CAAC;EAC1B,CAAC;EACD8E,MAAMA,CAAC4G,GAAG,EAAEQ,QAAQ,EAAE;IACpB,MAAMjH,MAAM,GAAG5E,MAAM,CAACC,IAAI,CAACL,UAAA,SAAK6E,MAAM,CAAC4G,GAAG,CAAC,CAAC;IAC5C,IAAIO,IAAI,GAAGhH,MAAM,CAACmH,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9B,IAAIpM,IAAI,GAAGiM,IAAI;IACfjM,IAAI,GAAGK,MAAM,CAACC,IAAI,CAACL,UAAA,WAAOD,IAAI,CAAC,EAAE,KAAK,CAAC;IACvCA,IAAI,GAAGK,MAAM,CAACC,IAAI,CAACL,UAAA,WAAOD,IAAI,CAAC,EAAE,KAAK,CAAC;IACvCiF,MAAM,CAACmH,KAAK,CAAC,CAAC,CAAC,CAAC,CAACpJ,OAAO,CAAC,CAACqJ,KAAK,EAAEC,KAAK,KAAK;MACzC,IAAID,KAAK,KAAKrM,IAAI,CAACsM,KAAK,CAAC,EAAE;QACzB,MAAM,IAAIvH,KAAK,CAAC,kBAAkB,CAAC;MACrC;IACF,CAAC,CAAC;IACF,IAAImH,QAAQ,EAAE;MACZD,IAAI,GAAGA,IAAI,CAAC1L,QAAQ,CAAC2L,QAAQ,CAAC;IAChC;IACA,OAAOD,IAAI;EACb;AACF,CAAC;AAEM,MAAMM,gBAAgB,GAAG;EAC9B;EACAC,eAAeA,CAAC5D,OAAO,EAAE;IACvB,MAAM6D,UAAU,GAAGpM,MAAM,CAACqM,KAAK,CAAC,CAAC,CAAC;IAClCD,UAAU,CAACE,YAAY,CAAE,KAAI/D,OAAO,CAACrI,QAAQ,CAAC,IAAI,CAAE,EAAC,EAAE,CAAC,CAAC;IACzD,MAAMqM,KAAK,GAAGvM,MAAM,CAACwM,MAAM,CAAC,CAACJ,UAAU,CAAC,EAAE,CAAC,CAAC;IAC5C,OAAOxM,UAAA,SAAK2L,MAAM,CAACgB,KAAK,CAAC;EAC3B,CAAC;EACDE,eAAeA,CAACC,YAAY,EAAE;IAC5B,OAAO1M,MAAM,CAACwM,MAAM,CAAC,CAAC5M,UAAA,SAAK6E,MAAM,CAACiI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAACC,WAAW,CAAC,CAAC,CAAC;EACrE;AACF,CAAC;AAED,MAAMC,gBAAgB,GAAGC,WAAW,IAAIzC,KAAK,CAAC0C,SAAS,CAACxC,GAAG,CAACrF,IAAI,CAC9D,IAAI8H,UAAU,CAACF,WAAW,CAAC,EAC3BG,CAAC,IAAM,IAAGA,CAAC,CAAC9M,QAAQ,CAAC,EAAE,CAAE,EAAC,CAAE6L,KAAK,CAAC,CAAC,CAAC,CAAC,CACtC,CAACkB,IAAI,CAAC,EAAE,CAAC;AAEH,MAAMC,UAAU,GAAGzN,KAAK,IAAI;EACjC,IAAI0N,GAAG,GAAG,EAAE;EACZ,IAAI1N,KAAK,YAAYO,MAAM,EAAE;IAC3BmN,GAAG,GAAG1N,KAAK,CAACS,QAAQ,CAAC,KAAK,CAAC;EAC7B,CAAC,MAAM;IACL;IACAiN,GAAG,GAAGvN,UAAA,qBAAiBH,KAAK,CAAC;EAC/B;EACA,OAAO0N,GAAG;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMC,OAAO,GAAGA,CAACC,MAAM,EAAEC,OAAO,EAAEC,IAAI,KAAK;EAChD,MAAM3K,MAAM,GAAG0K,OAAO,GAAGD,MAAM,CAACzK,MAAM,GAAG,CAAC;EAC1C,OAAO,IAAIwH,KAAK,CAACxH,MAAM,GAAG,CAAC,GAAG,CAAC,GAAGA,MAAM,CAAC,CAACqK,IAAI,CAACM,IAAI,IAAI,GAAG,CAAC,GAAGF,MAAM;AACtE,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMG,QAAQ,GAAGA,CAACH,MAAM,EAAEC,OAAO,EAAEC,IAAI,KAAK;EACjD,MAAM3K,MAAM,GAAG0K,OAAO,GAAGD,MAAM,CAACzK,MAAM,GAAG,CAAC;EAC1C,OAAOyK,MAAM,GAAI,IAAIjD,KAAK,CAACxH,MAAM,GAAG,CAAC,GAAG,CAAC,GAAGA,MAAM,CAAC,CAACqK,IAAI,CAACM,IAAI,IAAI,GAAG,CAAE;AACxE,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMpE,gBAAgB,GAAGlF,OAAO,IAAI;EACzC,IAAIA,OAAO,CAACE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;IAC7B,MAAMC,KAAK,GAAGH,OAAO,CAACI,KAAK,CAAC,GAAG,CAAC;IAChC,MAAMoJ,MAAM,GAAGrJ,KAAK,CAAC,CAAC,CAAC;IACvB,OAAOxE,UAAA,WAAO6E,MAAM,CAACgJ,MAAM,EAAE,KAAK,CAAC;EACrC;EACA,OAAO7N,UAAA,WAAO6E,MAAM,CAACR,OAAO,EAAE,KAAK,CAAC;AACtC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMyJ,gBAAgB,GAAGP,GAAG,IAAI;EACrC,MAAM7B,GAAG,GAAGtL,MAAM,CAACC,IAAI,CAACkN,GAAG,CAAChC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC;EACrD,OAAOvL,UAAA,WAAO2L,MAAM,CAACD,GAAG,EAAE,KAAK,CAAC;AAClC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMqC,WAAW,GAAG9K,MAAM,IAAIA,MAAM,YAAAjD,UAAA,aAAqB,IAC1DiD,MAAM,IAAIA,MAAM,CAAC+K,WAAW,IAAI/K,MAAM,CAAC+K,WAAW,CAACpM,IAAI,KAAK,WAAY;;AAE9E;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMqM,QAAQ,GAAGhL,MAAM,IAAI,OAAOA,MAAM,KAAK,QAAQ,IACpDA,MAAM,IAAIA,MAAM,CAAC+K,WAAW,IAAI/K,MAAM,CAAC+K,WAAW,CAACpM,IAAI,KAAK,QAAS;;AAE7E;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMsM,UAAU,GAAGjL,MAAM,IAAI,OAAOA,MAAM,KAAK,UAAU;;AAEhE;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMkL,QAAQ,GAAGlL,MAAM,IAAIA,MAAM,KAAK,IAAI,IAAI,CAAEuH,KAAK,CAACC,OAAO,CAACxH,MAAM,CAAE,IAAI,OAAOA,MAAM,KAAK,QAAQ;;AAE3G;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMmL,SAAS,GAAGnL,MAAM,IAAI,OAAOA,MAAM,KAAK,SAAS;;AAE9D;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMoL,MAAM,GAAG5C,GAAG,IAAI;EAC3B,IAAI;IACF,OAAO,CAAC,CAAC6C,IAAI,CAACC,KAAK,CAAC9C,GAAG,CAAC;EAC1B,CAAC,CAAC,OAAOhL,CAAC,EAAE;IACV,OAAO,KAAK;EACd;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM+N,WAAW,GAAGC,MAAM,IAAI;EACnC,MAAMC,GAAG,GAAGD,MAAM,IAAI,CAAC;EACvB,IAAIzO,UAAA,gBAAY0O,GAAG,CAAC,EAAE;IACpB,OAAOA,GAAG;EACZ;EAEA,IAAI1O,UAAA,aAAS0O,GAAG,CAAC,KAAKA,GAAG,CAACnK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAImK,GAAG,CAACnK,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE;IAC1E,OAAO,KAAAvE,UAAA,eAAc0O,GAAG,CAACnD,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;EACjD;EAEA,OAAO,KAAAvL,UAAA,eAAc0O,GAAG,CAACpO,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;AAC5C,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMqO,cAAc,GAAGC,IAAI,IAAI;EACpC,MAAMC,SAAS,GAAG7O,UAAA,aAAS4O,IAAI,GAAGA,IAAI,CAACE,WAAW,EAAE,GAAG,OAAO,CAAC;EAC/D,IAAID,SAAS,KAAKzM,SAAS,EAAE;IAC3B;IACA,MAAM,IAAI0C,KAAK,CAAE,wEAAuEwJ,IAAI,CAACS,SAAS,CAAA/O,UAAA,cAAW,IAAI,EAAE,CAAC,CAAE,EAAC,CAAC;EAC9H;EACA,OAAO,KAAAA,UAAA,eAAc6O,SAAS,EAAE,EAAE,CAAC;AACrC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMG,OAAO,GAAGA,CAACP,MAAM,EAAEG,IAAI,KAAK;EACvC,MAAMK,WAAW,GAAGjP,UAAA,gBAAYyO,MAAM,CAAC,CAACS,SAAS,CAAClP,UAAA,mBAAe4O,IAAI,CAAC,CAAC;EAEvE,OAAO5O,UAAA,gBAAYyO,MAAM,CAAC,GAAGQ,WAAW,GAAGA,WAAW,CAAC3O,QAAQ,CAAC,EAAE,CAAC;AACrE,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM6O,KAAK,GAAGA,CAACV,MAAM,EAAEG,IAAI,KAAK;EACrC,MAAMK,WAAW,GAAGjP,UAAA,gBAAYyO,MAAM,CAAC,CAACW,KAAK,CAACpP,UAAA,mBAAe4O,IAAI,CAAC,CAAC;EAEnE,OAAO5O,UAAA,gBAAYyO,MAAM,CAAC,GAAGQ,WAAW,GAAGA,WAAW,CAAC3O,QAAQ,CAAC,EAAE,CAAC;AACrE,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM+O,gBAAgB,GAAGZ,MAAM,IAAI;EACxC,MAAMa,SAAS,GAAGtP,UAAA,gBAAYyO,MAAM,CAAC,CAACc,YAAY,EAAE;EACpD,IAAID,SAAS,CAACE,UAAU,CAAC,CAAC,CAAC,EAAE;IAC3B,OAAO,KAAAxP,UAAA,eAAAA,UAAA,sBAAgC,EAAE,CAAC,CAACyP,IAAI,CAACH,SAAS,CAAC,CAACG,IAAI,CAAC,CAAC,CAAC;EACpE;EACA,OAAOH,SAAS;AAClB,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMI,eAAe,GAAGC,UAAU,IAAI;EAC3C,IAAIlC,MAAM,GAAG,EAAE;EACfkC,UAAU,CAAC5M,OAAO,CAAC4H,IAAI,IAAI;IACzB,IAAI4C,GAAG,GAAG5C,IAAI,CAACrK,QAAQ,CAAC,EAAE,CAAC;IAC3B,IAAIiN,GAAG,CAACvK,MAAM,IAAI,CAAC,EAAE;MACnBuK,GAAG,GAAI,IAAGA,GAAI,EAAC;IACjB;IACAE,MAAM,IAAIF,GAAG;EACf,CAAC,CAAC;EACF,OAAOE,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACO,MAAMmC,IAAI,GAAGA,CAAA,KAAM,CAAC,CAAC;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMC,OAAO,GAAGA,CAACC,GAAG,EAAEC,IAAI,EAAElQ,KAAK,KAAK;EAC3C,MAAMmQ,KAAK,GAAGD,IAAI,CAACtL,KAAK,CAAC,GAAG,CAAC;EAC7BuL,KAAK,CAAC/E,MAAM,CAAC,CAACC,GAAG,EAAE+E,CAAC,EAAE5D,KAAK,KAAK;IAC9B,IAAIA,KAAK,KAAK2D,KAAK,CAAChN,MAAM,GAAG,CAAC,EAAE;MAC9BkI,GAAG,CAAC+E,CAAC,CAAC,GAAGpQ,KAAK;MACd,OAAOqL,GAAG;IACZ;IACAA,GAAG,CAAC+E,CAAC,CAAC,GAAG,CAAC,CAAC;IACX,OAAO/E,GAAG,CAAC+E,CAAC,CAAC;EACf,CAAC,EAAEH,GAAG,CAAC;AACT,CAAC;AAEM,MAAMI,uBAAuB,GAAGC,IAAA,IAA0C;EAAA,IAAzC;IAAEnE,IAAI;IAAEoE,QAAQ;IAAEnE,QAAQ,GAAG;EAAM,CAAC,GAAAkE,IAAA;EAC1E,MAAMnL,MAAM,GAAG5E,MAAM,CAACC,IAAI,CAAC2L,IAAI,EAAEC,QAAQ,CAAC;EAC1C,MAAMoE,OAAO,GAAGD,QAAQ,CAACvL,MAAM,CAACG,MAAM,CAAC;EACvC,MAAM1B,MAAM,GAAG8M,QAAQ,CAACE,QAAQ,CAACD,OAAO,EAAE;IACxCE,KAAK,EAAEC,MAAM;IAAE;IACfC,KAAK,EAAED,MAAM;IAAE;IACf7D,KAAK,EAAE6D,MAAM;IAAE;IACfE,QAAQ,EAAE,IAAI;IAAE;IAChBC,MAAM,EAAE,IAAI;IAAE;IACdC,OAAO,EAAE,IAAI;IAAE;IACfC,MAAM,EAAE,IAAI,CAAC;EACf,CAAC,CAAC;;EACF,OAAOvN,MAAM;AACf,CAAC;AAEM,SAASwN,sBAAsBA,CAACC,KAAK,EAAEC,cAAc,EAAE;EAC5D,MAAM;IACJ3Q,IAAI;IACJ4Q,EAAE;IACF1L,MAAM;IACN2L,cAAc;IACdC,SAAS;IACT,GAAGC;EACL,CAAC,GAAGpR,UAAA,4BAAwB;IAC1BgM,IAAI,EAAE+E,KAAK;IACXX,QAAQ,EAAApQ,UAAA;EACV,CAAC,CAAC;EACF,IAAIqR,gBAAgB,GAAGrR,UAAA,4BAAwB;IAC7CgM,IAAI,EAAEzG,MAAM;IACZ0G,QAAQ,EAAE,QAAQ;IAClBmE,QAAQ,EAAEY;EACZ,CAAC,CAAC;EACFK,gBAAgB,GAAGrR,UAAA,cAAUgR,cAAc,EAAEK,gBAAgB,EAAArR,UAAA,wBAAsB;EACnFqR,gBAAgB,GAAGrR,UAAA,wBAAoBgR,cAAc,EAAEK,gBAAgB,CAAC;EAExE,OAAO;IACLhR,IAAI,EAAEL,UAAA,kBAAcK,IAAI,CAACR,KAAK,CAAC;IAC/BoR,EAAE,EAAEjR,UAAA,kBAAciR,EAAE,CAACpR,KAAK,CAAC;IAC3B0F,MAAM,EAAE8L,gBAAgB;IACxBH,cAAc,EAAE9Q,MAAM,CAACC,IAAI,CAAC6Q,cAAc,EAAE,QAAQ,CAAC,CAAC5Q,QAAQ,CAAC,KAAK,CAAC;IACrE6Q,SAAS,EAAE/Q,MAAM,CAACC,IAAI,CAAC8Q,SAAS,EAAE,QAAQ,CAAC,CAAC7Q,QAAQ,CAAC,KAAK,CAAC;IAC3D,GAAG8Q;EACL,CAAC;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASE,gBAAgBA,CAACC,QAAQ,EAAEC,QAAQ,EAAE;EACnD,MAAMC,IAAI,GAAGrR,MAAM,CAACC,IAAI,CAAE,GAAEkR,QAAS,IAAGC,QAAS,EAAC,CAAC,CAAClR,QAAQ,CAAC,QAAQ,CAAC;EACtE,OAAQ,SAAQmR,IAAK,EAAC;AACxB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAA,SAAAlR,qBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,qBAAA;AAAA,SAAAC,wBAAAA,CAAA;EAAA,IAAAD,qBAAA;IAAA,IAAAE,cAAA,GAAAN,qBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,qBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,qBAAA;AAAA;AAAA,SAAAI,wBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,qBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,wBAAA;EAAA,IAAAU,QAAA,GAAAP,wBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,2BAAA;AAAA,IAAAC,gBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,gBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,UAAA;EAAA2B,sBAAA,sBAAA3B,UAAA;EAAA2B,sBAAA,eAAAK,UAAA;EAAAL,sBAAA,YAAAK,UAAA;EAAAL,sBAAA,cAAAM,YAAA;EAAAN,sBAAA,wBAAAM,YAAA;EAAAN,sBAAA,aAAAO,WAAA;AAAA;AAAA,SAAAlC,UAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,mBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,2BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,mBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAvC,WAAA;IAAA;MAAA,OAAAkM,gBAAA;IAAA;MAAA,OAAAkB,gBAAA;IAAA;MAAA,OAAA7I,MAAA;IAAA;MAAA,OAAA0H,SAAA;IAAA;MAAA,OAAAkC,WAAA;IAAA;MAAA,OAAAE,QAAA;IAAA;MAAA,OAAAtH,QAAA;IAAA;MAAA,OAAA6H,WAAA;IAAA;MAAA,OAAAG,cAAA;IAAA;MAAA,OAAAzJ,gBAAA;IAAA;MAAA,OAAAgL,uBAAA;IAAA;MAAA,OAAAnE,WAAA;IAAA;MAAA,OAAAjC,SAAA;IAAA;MAAA,OAAA8B,mBAAA;IAAA;MAAA,OAAAZ,mBAAA;IAAA;MAAA,OAAAQ,aAAA;EAAA;EAAA,OAAApJ,SAAA;AAAA;AAAA,SAAAE,aAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,mBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,mBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,uBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,UAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,aAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,UAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,YAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,2BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,YAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,YAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,wBAAA,GAAAH,wBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,WAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,qBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,4CAAA5B,gBAAA;;ACtcA;AACA;AACA;AACA;AACwD;AACC;AACxB;AAKZ;AAEd,MAAMmQ,aAAa,GAAG7R,UAAA,aAAS8R,IAAI,CAACC,QAAQ,CAAA/R,UAAA,mBAAgB;AACnE;;AAEO,MAAM;EACX+L,WAAW;EACXiG,IAAI;EACJC,OAAO;EACPC,qBAAqB;EACrBC;AACF,CAAC,GAAAnS,UAAA,iBAAgB;AAEV,MAAMoS,MAAM,GAAG,SAAAA,CAACC,SAAS,EAAqC;EAAA,IAAnC1I,IAAI,GAAAO,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,uBAAuB;EAC9D,IAAI,CAAC,sBAAsB,EAAE,uBAAuB,CAAC,CAAC3F,OAAO,CAACoF,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;IAC1E,MAAM,IAAI7E,KAAK,CAAC,wEAAwE,CAAC;EAC3F;EACA,MAAMsL,QAAQ,GAAGpQ,UAAA,kBAAc2J,IAAI,CAAC;EACpC,IAAI2I,WAAW,GAAGlC,QAAQ,CAACvL,MAAM,CAACzE,MAAM,CAACC,IAAI,CAACgS,SAAS,EAAE,QAAQ,CAAC,CAAC;EACnEC,WAAW,GAAGlC,QAAQ,CAACE,QAAQ,CAACgC,WAAW,EAAE;IAC3C/B,KAAK,EAAEC,MAAM;IAAE;IACfC,KAAK,EAAED,MAAM;IAAE;IACf7D,KAAK,EAAE6D,MAAM;IAAE;IACfE,QAAQ,EAAE,IAAI;IAAE;IAChBC,MAAM,EAAE,IAAI;IAAE;IACdC,OAAO,EAAE,IAAI;IAAE;IACfC,MAAM,EAAE,IAAI,CAAC;EACf,CAAC,CAAC;EACF;EACA,IAAI0B,oBAAoB,GAAGvS,UAAA,cAAUoQ,QAAQ,EAAEkC,WAAW,EAAAtS,UAAA,wBAAsB;EAChFuS,oBAAoB,GAAGvS,UAAA,wBAAoBoQ,QAAQ,EAAEmC,oBAAoB,CAAC;EAC1E,OAAOA,oBAAoB;AAC7B,CAAC;AAEM,MAAMC,wBAAwB,GAAGC,GAAG,IAAI;EAC7C,MAAM;IACJC,UAAU;IACVC,OAAO,GAAG;EACZ,CAAC,GAAGF,GAAG;EACP,MAAMG,cAAc,GAAG,CAAC,IAAID,OAAO,IAAI,EAAE,CAAC,CAAC;EAC3C,IAAID,UAAU,EAAE;IACdE,cAAc,CAACC,IAAI,CAACH,UAAU,CAAC;EACjC;EACA,OAAOE,cAAc,CAACvF,IAAI,CAAC,EAAE,CAAC;AAChC,CAAC;AAEM,MAAMyF,cAAc,GAAG,SAAAA,CAAA,EAAe;EAAA,IAAdC,IAAI,GAAA7I,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,EAAE;EACtC,IAAI,CAACM,KAAK,CAACC,OAAO,CAACsI,IAAI,CAAC,IAAIA,IAAI,CAAC/P,MAAM,KAAK,CAAC,EAAE;IAC7C,OAAO,EAAE;EACX;EACA,OAAO+P,IAAI,CAACpO,MAAM,CAAC8N,GAAG,IAAIA,GAAG,CAACO,IAAI,KAAK,sBAAsB,CAAC,CAC3DtI,GAAG,CAAC9F,CAAC,IAAI5E,UAAA,WAAOA,UAAA,6BAAyB4E,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;AAC1E,CAAC;AAEM,MAAMqO,iBAAiB,GAAG,SAAAA,CAAA,EAAe;EAAA,IAAdF,IAAI,GAAA7I,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,EAAE;EACzC,IAAI,CAACM,KAAK,CAACC,OAAO,CAACsI,IAAI,CAAC,IAAIA,IAAI,CAAC/P,MAAM,KAAK,CAAC,EAAE;IAC7C,OAAO,EAAE;EACX;EACA,OAAO+P,IAAI,CAACpO,MAAM,CAAC8N,GAAG,IAAIA,GAAG,CAACO,IAAI,KAAK,uBAAuB,CAAC,CAC5DtI,GAAG,CAAC9F,CAAC,IAAI5E,UAAA,WAAOA,UAAA,6BAAyB4E,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC;AAC3E,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMoI,sBAAgB,GAAGC,WAAW,IAAIzC,KAAK,CAAC0C,SAAS,CAACxC,GAAG,CAACrF,IAAI,CACrE,IAAI8H,UAAU,CAACF,WAAW,CAAC,EAC3BG,CAAC,IAAM,IAAGA,CAAC,CAAC9M,QAAQ,CAAC,EAAE,CAAE,EAAC,CAAE6L,KAAK,CAAC,CAAC,CAAC,CAAC,CACtC,CAACkB,IAAI,CAAC,EAAE,CAAC;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM6F,gBAAgB,GAAG7O,OAAO,IAAI;EACzC,MAAM8O,OAAO,GAAGnT,UAAA,YAAQoT,UAAU,CAAC/O,OAAO,CAAC;EAC3C,IAAIkJ,GAAG,GAAG,EAAE;EACZ,IAAI4F,OAAO,CAACtT,KAAK,YAAYO,MAAM,EAAE;IACnCmN,GAAG,GAAG4F,OAAO,CAACtT,KAAK,CAACS,QAAQ,CAAC,KAAK,CAAC;EACrC,CAAC,MAAM;IACL;IACAiN,GAAG,GAAGvN,UAAA,qBAAiBmT,OAAO,CAACtT,KAAK,CAAC;EACvC;EACA,OAAOG,UAAA,UAAM8N,gBAAgB,CAACP,GAAG,CAAC;AACpC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM8F,iBAAiB,GAAGC,GAAG,IAAI;EACtC,MAAM/F,GAAG,GAAGvN,UAAA,UAAMuJ,gBAAgB,CAAC+J,GAAG,CAAC;EACvC,OAAOtT,UAAA,YAAQmB,MAAM,CAAC;IACpBtB,KAAK,EAAEO,MAAM,CAACC,IAAI,CAACkN,GAAG,CAAChC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK;EACjD,CAAC,CAAC;AACJ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMgI,uBAAuB,GAAGD,GAAG,IAAItT,UAAA,YAAQsQ,QAAQ,CAACtQ,UAAA,sBAAkBsT,GAAG,CAAC,CAAC;;AAEtF;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAME,aAAa,GAAGzT,IAAI,IAAI;EACnC,MAAMoT,OAAO,GAAGnT,UAAA,YAAQoT,UAAU,CAACrT,IAAI,CAAC;EACxC,IAAIwN,GAAG,GAAG,EAAE;EACZ,IAAI4F,OAAO,CAACtT,KAAK,YAAYO,MAAM,EAAE;IACnCmN,GAAG,GAAG4F,OAAO,CAACtT,KAAK,CAACS,QAAQ,CAAC,KAAK,CAAC;EACrC,CAAC,MAAM;IACL;IACAiN,GAAG,GAAGvN,UAAA,qBAAiBmT,OAAO,CAACtT,KAAK,CAAC;EACvC;EACA,OAAO0N,GAAG;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMkG,cAAc,GAAGlG,GAAG,IAAIvN,UAAA,SAAKmB,MAAM,CAAC;EAC/CtB,KAAK,EAAEO,MAAM,CAACC,IAAI,CAACkN,GAAG,CAAChC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK;AACjD,CAAC,CAAC;;AAEF;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMmI,oBAAoB,GAAGnG,GAAG,IAAIvN,UAAA,SAAKsQ,QAAQ,CAACtQ,UAAA,mBAAeuN,GAAG,CAAC,CAAC;;AAE7E;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMoG,iBAAiB,GAAGC,EAAE,IAAI5T,UAAA,gBAAY2L,MAAM,CAACiI,EAAE,CAAC,CAACC,MAAM,EAAE;;AAEtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMC,cAAc,GAAGA,CAACzT,IAAI,EAAE4Q,EAAE,EAAE8C,UAAU,EAAExO,MAAM,KAAK;EAC9D,MAAMyO,GAAG,GAAG;IACV3T,IAAI,EAAEL,UAAA,sBAAkBK,IAAI,CAAC;IAC7B4Q,EAAE,EAAEjR,UAAA,sBAAkBiR,EAAE,CAAC;IACzB8C,UAAU;IACVxO;EACF,CAAC;EACD,OAAOvF,UAAA,gBAAYmB,MAAM,CAAC6S,GAAG,CAAC;AAChC,CAAC;;AAED;AAAA,SAAAzT,qBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,qBAAA;AAAA,SAAAC,wBAAAA,CAAA;EAAA,IAAAD,qBAAA;IAAA,IAAAE,cAAA,GAAAN,qBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,qBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,qBAAA;AAAA;AAAA,SAAAI,wBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,qBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,wBAAA;EAAA,IAAAU,QAAA,GAAAP,wBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,2BAAA;AAAA,IAAAC,gBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,gBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,UAAA;EAAA2B,sBAAA,sBAAA3B,UAAA;EAAA2B,sBAAA,eAAAK,UAAA;EAAAL,sBAAA,YAAAK,UAAA;EAAAL,sBAAA,cAAAM,YAAA;EAAAN,sBAAA,wBAAAM,YAAA;EAAAN,sBAAA,aAAAO,WAAA;AAAA;AAAA,SAAAlC,UAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,mBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,2BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,mBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAA8R,uBAAA,CAAAvC,KAAA;IAAA;MAAA,OAAAC,0BAAA;IAAA;MAAA,OAAAE,aAAA;IAAA;MAAA,OAAA/H,SAAA;IAAA;MAAA,OAAA8B,mBAAA;IAAA;MAAA,OAAAZ,mBAAA;IAAA;MAAA,OAAAoH,MAAA;IAAA;MAAA,OAAAI,wBAAA;IAAA;MAAA,OAAAP,OAAA;IAAA;MAAA,OAAAjF,sBAAA;IAAA;MAAA,OAAAiH,uBAAA,CAAArC,qBAAA;IAAA;MAAA,OAAAyB,iBAAA;IAAA;MAAA,OAAArB,IAAA;IAAA;MAAA,OAAAyB,cAAA;IAAA;MAAA,OAAA1H,WAAA;EAAA;EAAA,OAAA3J,SAAA;AAAA;AAAA,SAAAE,aAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,mBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,mBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,uBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,UAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,aAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,UAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,YAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,2BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,YAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,YAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,wBAAA,GAAAH,wBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,WAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,qBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,SAAA2Q,wBAAA;EAAA,IAAAC,cAAA,GAAAhK,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA;EAAA,IAAAiK,kBAAA,GAAAjT,MAAA,CAAA4B,IAAA,CAAAoR,cAAA,EAAAvP,MAAA,WAAAyP,YAAA;IAAA,OAAAA,YAAA,kBAAAA,YAAA,kBAAAA,YAAA,oBAAAA,YAAA,mBAAAA,YAAA,4BAAAA,YAAA,qBAAAA,YAAA,8BAAAA,YAAA;EAAA;EAAA,OAAAD,kBAAA,CAAAlJ,MAAA,WAAAoJ,sBAAA,EAAAD,YAAA;IAAAC,sBAAA,CAAAD,YAAA,IAAAF,cAAA,CAAAE,YAAA;IAAA,OAAAC,sBAAA;EAAA;AAAA;AAAA;AAAA,4CAAA3S,gBAAA;;ACnMA;AACA;AACA;AACA;AACA;AAC8B;AAIb;AACjB;AACA;AACA;AACA,SAAS4S,OAAOA,CAACC,KAAK,EAAE;EACtB,IAAIA,KAAK,YAAYnU,MAAM,IAAImU,KAAK,YAAYpH,UAAU,EAAE;IAC1D,OAAOoH,KAAK,CAACvR,MAAM,KAAK,GAAG;EAC7B;EACA;EACA;EACA;;EAEA,IACE,sBAAsB,CAACwR,IAAI,CAACD,KAAK,CAAC,IAC/B,sBAAsB,CAACC,IAAI,CAACD,KAAK,CAAC,EACrC;IACA,OAAO,IAAI;EACb;EACA,OAAO,KAAK;AACd;;AAEA;AACA;AACA;AACA;AACA,SAASE,cAAcA,CAACC,SAAS,EAAE;EACjC,IAAIA,SAAS,IAAI,EAAE,IAAIA,SAAS,IAAI,EAAE,EAAE;IACtC;IACA,OAAOA,SAAS,GAAG,EAAE;EACvB;EAEA,IAAIA,SAAS,IAAI,EAAE,IAAIA,SAAS,IAAI,EAAE,EAAE;IACtC;IACA,OAAOA,SAAS,GAAG,EAAE;EACvB;EAEA,IAAIA,SAAS,IAAI,EAAE,IAAIA,SAAS,IAAI,GAAG,EAAE;IACvC;IACA,OAAOA,SAAS,GAAG,EAAE;EACvB;EAEA,MAAM,IAAI5P,KAAK,CAAC,eAAe,CAAC;AAClC;;AAEA;AACA;AACA;AACA;AACA;AACO,SAAS6P,SAASA,CAACJ,KAAK,EAAExU,IAAI,EAAE;EACrC,IAAI,CAACC,UAAA,YAAQuU,KAAK,CAAC,EAAE;IACnB,MAAM,IAAIzP,KAAK,CAAC,eAAe,CAAC;EAClC;EACA,KAAK,IAAI8P,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAEA,CAAC,IAAI,CAAC,EAAE;IAC9B;IACA,MAAMC,MAAM,GAAI,CAACC,QAAQ,CAAC/U,IAAI,CAACgV,MAAM,CAACH,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IACjDE,QAAQ,CAAC/U,IAAI,CAACgV,MAAM,CAACH,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GACnC,IAAI;;IAER;IACA,MAAMI,IAAI,GAAGhV,UAAA,mBACXuU,KAAK,CAACU,UAAU,CAACV,KAAK,CAACvR,MAAM,GAAG,CAAC,GAAGkS,IAAI,CAACC,KAAK,CAACN,MAAM,GAAG,CAAC,CAAC,CAAC,CAC5D;IACD,MAAMO,MAAM,GAAG,CAAC,IAAIP,MAAM,GAAG,CAAC;IAE9B,IAAI,CAACG,IAAI,GAAGI,MAAM,MAAMA,MAAM,EAAE;MAC9B,OAAO,KAAK;IACd;EACF;EACA,OAAO,IAAI;AACb;;AAEA;AACA;AACA;AACA;AACA;AACO,SAASC,cAAcA,CAACd,KAAK,EAAEe,SAAS,EAAE;EAC/C,OAAOtV,UAAA,cAAUI,MAAM,CAACC,IAAI,CAACkU,KAAK,EAAE,QAAQ,CAAC,CAACjU,QAAQ,CAAC,KAAK,CAAC,EAAEN,UAAA,WAAOsV,SAAS,CAAC,CAAC;AACnF;AAEO,SAASC,gBAAgBA,CAAChB,KAAK,EAAEiB,OAAO,EAAE;EAC/C,OAAOxV,UAAA,cAAUI,MAAM,CAACC,IAAI,CAACkU,KAAK,EAAE,QAAQ,CAAC,CAACjU,QAAQ,CAAC,KAAK,CAAC,EAAEN,UAAA,WAAOI,MAAM,CAACC,IAAI,CAACmV,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;AACxG;AAEO,SAASC,gBAAgBA,CAAClB,KAAK,EAAElQ,OAAO,EAAE;EAC/C,MAAMqR,cAAc,GAAG1V,UAAA,YAAQ2L,MAAM,CAAC3L,UAAA,4BAAwBqE,OAAO,CAAC,CAAC,CAACwP,MAAM,EAAE;EAChF,OAAO7T,UAAA,cAAUI,MAAM,CAACC,IAAI,CAACkU,KAAK,EAAE,QAAQ,CAAC,CAACjU,QAAQ,CAAC,KAAK,CAAC,EAAEN,UAAA,WAAO0V,cAAc,CAAC,CAAC;AACxF;AAAC,SAAAnV,qBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,qBAAA;AAAA,SAAAC,wBAAAA,CAAA;EAAA,IAAAD,qBAAA;IAAA,IAAAE,cAAA,GAAAN,qBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,qBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,qBAAA;AAAA;AAAA,SAAAI,wBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,qBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,wBAAA;EAAA,IAAAU,QAAA,GAAAP,wBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,2BAAA;AAAA,IAAAC,gBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,gBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,UAAA;EAAA2B,sBAAA,sBAAA3B,UAAA;EAAA2B,sBAAA,eAAAK,UAAA;EAAAL,sBAAA,YAAAK,UAAA;EAAAL,sBAAA,cAAAM,YAAA;EAAAN,sBAAA,wBAAAM,YAAA;EAAAN,sBAAA,aAAAO,WAAA;AAAA;AAAA,SAAAlC,UAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,mBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,2BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,mBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAmS,OAAA;IAAA;MAAA,OAAAG,cAAA;IAAA;MAAA,OAAAE,SAAA;IAAA;MAAA,OAAA/U,WAAA;IAAA;MAAA,OAAAqS,OAAA;IAAA;MAAA,OAAAsB,uBAAA;EAAA;EAAA,OAAAnR,SAAA;AAAA;AAAA,SAAAE,aAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,mBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,mBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,uBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,UAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,aAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,UAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,YAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,2BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,YAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,YAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,wBAAA,GAAAH,wBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,WAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,qBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,4CAAA5B,gBAAA;;ACjGD;AACA;AACA;AACA;AAC4D;AAE7C,MAAMiU,WAAW,CAAC;EAC/B3H,WAAWA,CAAAmC,IAAA,EAOR;IAAA,IAPS;MACVvO,IAAI;MACJyD,IAAI;MACJC,MAAM,GAAG,KAAK;MACdC,MAAM,GAAG,EAAE;MACXG,cAAc,GAAG,EAAE;MACnBC,eAAe,GAAG;IACpB,CAAC,GAAAwK,IAAA;IACC,IAAI,CAACvO,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACyD,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACuQ,aAAa,GAAGtQ,MAAM;IAC3B,IAAI,CAACC,MAAM,GAAGA,MAAM;IACpB,IAAI,CAACG,cAAc,GAAGA,cAAc;IACpC,IAAI,CAACC,eAAe,GAAGA,eAAe;IACtC,IAAI,CAACkQ,cAAc,GAAG,IAAI;IAC1B,IAAI,CAACC,GAAG,GAAG,IAAI,CAACA,GAAG,CAACC,IAAI,CAAC,IAAI,CAAC;EAChC;EAEAC,WAAWA,CAACC,IAAI,EAAE;IAChB,IAAI,CAAC,IAAI,CAACvQ,cAAc,IAAI,IAAI,CAACA,cAAc,CAAC1C,MAAM,KAAK,CAAC,EAAE;MAC5D,OAAOiT,IAAI;IACb;IAEA,OAAOA,IAAI,CAACvL,GAAG,CAAC,CAACwL,GAAG,EAAE7J,KAAK,KAAK;MAC9B,MAAM8J,SAAS,GAAG,IAAI,CAACzQ,cAAc,CAAC2G,KAAK,CAAC;MAC5C,OAAO8J,SAAS,GAAGA,SAAS,CAACD,GAAG,CAAC,GAAGA,GAAG;IACzC,CAAC,CAAC;EACJ;EAEAE,iBAAiBA,CAACC,OAAO,EAAE;IACzB,IAAI,CAACR,cAAc,GAAGQ,OAAO;EAC/B;EAEAC,YAAYA,CAAChT,MAAM,EAAE;IACnB,OAAO,IAAI,CAACqC,eAAe,IAAIrC,MAAM,GACjC,IAAI,CAACqC,eAAe,CAACrC,MAAM,CAAC,GAC5BA,MAAM;EACZ;EAEAiT,0BAA0BA,CAACN,IAAI,EAAE;IAC/B,IAAIA,IAAI,CAACjT,MAAM,GAAG,IAAI,CAACuC,MAAM,CAACvC,MAAM,EAAE;MACpC,MAAM,IAAI8B,KAAK,CAAE,uCAAsC,IAAI,CAACO,IAAK,EAAC,CAAC;IACrE;IACA,MAAM/B,MAAM,GAAG;MACbgC,MAAM,EAAE,IAAI,CAACD,IAAI;MACjBuQ,aAAa,EAAE,IAAI,CAACA,aAAa;MACjCY,MAAM,EAAE,KAAK;MACbnT,QAAQ,EAAArD,gBAAA,QAAM;MACduF,MAAM,EAAE,CAAC;IACX,CAAC;IACD,IAAI,CAACyQ,WAAW,CAACC,IAAI,CAAC,CAAClT,OAAO,CAAC,CAACmT,GAAG,EAAE7J,KAAK,KAAK;MAC7C,IAAIA,KAAK,GAAG,IAAI,CAAC9G,MAAM,CAACvC,MAAM,GAAG,CAAC,EAAE;QAClC;QACA,IAAIhD,gBAAA,eAAWkW,GAAG,CAAC,EAAE;UACnB;UACA5S,MAAM,CAACD,QAAQ,GAAG6S,GAAG;UACrB5S,MAAM,CAACkT,MAAM,GAAG,KAAK;QACvB;QACA,IAAIxW,gBAAA,cAAUkW,GAAG,EAAEO,IAAI,CAAC,EAAE;UACxBnT,MAAM,CAACkT,MAAM,GAAGN,GAAG,CAACO,IAAI;QAC1B;MACF,CAAC,MAAM;QACL;QACAnT,MAAM,CAACiC,MAAM,CAAC,IAAI,CAACA,MAAM,CAAC8G,KAAK,CAAC,CAAC,GAAG6J,GAAG;MACzC;IACF,CAAC,CAAC;IACF,OAAO5S,MAAM;EACf;EAEAwS,GAAGA,CAAA,EAAU;IAAA,SAAAY,IAAA,GAAAxM,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAAkM,IAAA,GAAAC,IAAA,MAAAA,IAAA,GAAAD,IAAA,EAAAC,IAAA;MAAJV,IAAI,CAAAU,IAAA,IAAAzM,SAAA,CAAAyM,IAAA;IAAA;IACT,MAAMC,OAAO,GAAG,IAAI,CAACL,0BAA0B,CAACN,IAAI,CAAC;IACrD,IAAIW,OAAO,CAACJ,MAAM,EAAE;MAClB,OAAO,IAAI,CAACF,YAAY,CAAC,IAAI,CAACT,cAAc,CAACgB,IAAI,CAACD,OAAO,CAAC,CAAC;IAC7D;IACA,OAAO,IAAI,CAACf,cAAc,CACvBiB,SAAS,CAACF,OAAO,CAAC,CAClBrT,IAAI,CAACD,MAAM,IAAI;MACdsT,OAAO,CAACvT,QAAQ,CAAC,IAAI,EAAE,IAAI,CAACiT,YAAY,CAAChT,MAAM,CAAC,CAAC;MACjD,OAAO,IAAI,CAACgT,YAAY,CAAChT,MAAM,CAAC;IAClC,CAAC,CAAC,CACDE,KAAK,CAACuT,GAAG,IAAI;MACZH,OAAO,CAACvT,QAAQ,CAAC0T,GAAG,CAAC;MACrB,MAAMA,GAAG;IACX,CAAC,CAAC;EACN;AACF;AAAC,SAAAxW,2BAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,2BAAA;AAAA,SAAAC,8BAAAA,CAAA;EAAA,IAAAD,2BAAA;IAAA,IAAAE,cAAA,GAAAN,2BAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,2BAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,2BAAA;AAAA;AAAA,SAAAI,8BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,2BAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,2BAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,8BAAA;EAAA,IAAAU,QAAA,GAAAP,8BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,2BAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,iCAAA;AAAA,IAAAC,sBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,sBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,gBAAA;EAAA2B,sBAAA,sBAAA3B,gBAAA;EAAA2B,sBAAA,eAAAK,gBAAA;EAAAL,sBAAA,YAAAK,gBAAA;EAAAL,sBAAA,cAAAM,kBAAA;EAAAN,sBAAA,wBAAAM,kBAAA;EAAAN,sBAAA,aAAAO,iBAAA;AAAA;AAAA,SAAAlC,gBAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,2BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,yBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,iCAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,yBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAyN,IAAA;IAAA;MAAA,OAAA1B,UAAA;IAAA;MAAA,OAAAE,SAAA;EAAA;EAAA,OAAAhM,SAAA;AAAA;AAAA,SAAAE,mBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,2BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,yBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,yBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,6BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,gBAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,mBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,gBAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,2BAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,kBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,iCAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,kBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,kBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,2BAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,8BAAA,GAAAH,8BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,iBAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,2BAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,gCAAA,UAtFoBkS,WAAW;AAAA,SAAAjS,oCAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAX8T,WAAW,EAAA/T,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,gCAAA,iBAAAA,gCAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAXgS,WAAW;EAAAjS,oCAAA,YAAA1D,gBAAA;EAAA0D,oCAAA,sBAAA1D,gBAAA;EAAA0D,oCAAA,eAAA1B,gBAAA;EAAA0B,oCAAA,YAAA1B,gBAAA;EAAA0B,oCAAA,cAAAzB,kBAAA;EAAAyB,oCAAA,wBAAAzB,kBAAA;EAAAyB,oCAAA,aAAAxB,iBAAA;EAAAwB,oCAAA,kBAAAhC,sBAAA;AAAA;;;ACNF;AAE9B,MAAMsV,cAAc,GAAGhL,IAAI,IAAI;EAC7B,IAAIA,IAAI,CAAChJ,MAAM,KAAK,CAAC,EAAE,MAAM,IAAIkJ,SAAS,CAAC,kBAAkB,CAAC;EAE9D,MAAM+K,QAAQ,GAAG7W,MAAM,CAAC8W,OAAO,CAAClL,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC;EACjD,IAAIiL,QAAQ,GAAG,CAAC,EAAE;IAChBjL,IAAI,CAACmL,OAAO,EAAE;EAChB;EAEA,IAAInS,MAAM,GAAG5E,MAAM,CAACwM,MAAM,CAACZ,IAAI,CAAC;EAChChH,MAAM,GAAG5E,MAAM,CAACC,IAAI,CAACL,eAAA,WAAOgF,MAAM,CAAC,EAAE,KAAK,CAAC;EAC3C,OAAOA,MAAM;AACf,CAAC;AAED,MAAMoS,kBAAkB,GAAGpL,IAAI,IAAI;EACjC,IAAIA,IAAI,CAAChJ,MAAM,KAAK,CAAC,EAAE;IACrB,OAAO,IAAI;EACb;EAEA,IAAIgJ,IAAI,CAAChJ,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE;IAAEgJ,IAAI,CAAC6G,IAAI,CAAC7G,IAAI,CAACA,IAAI,CAAChJ,MAAM,GAAG,CAAC,CAAC,CAAC;EAAE;EAC/D,IAAIqU,SAAS,GAAGrL,IAAI,CAAChJ,MAAM,GAAG,CAAC;EAC/B,IAAIsU,QAAQ,GAAG,CAAC;EAChB,IAAI1C,CAAC,GAAG,CAAC;EACT,OAAOA,CAAC,GAAG5I,IAAI,CAAChJ,MAAM,GAAG,CAAC,EAAE;IAC1B,MAAMuU,IAAI,GAAGvL,IAAI,CAAC4I,CAAC,EAAE,CAAC;IACtB,MAAM4C,KAAK,GAAGxL,IAAI,CAAC4I,CAAC,EAAE,CAAC;IACvB5I,IAAI,CAAC6G,IAAI,CAAC7S,eAAA,mBAAe,CAACuX,IAAI,EAAEC,KAAK,CAAC,CAAC,CAAC;IACxC,IAAI,EAAEF,QAAQ,KAAKD,SAAS,EAAE;MAC5B;MACA,IAAIA,SAAS,GAAG,CAAC,KAAK,CAAC,IAAIA,SAAS,KAAK,CAAC,EAAE;QAC1CA,SAAS,EAAE;QACXrL,IAAI,CAAC6G,IAAI,CAAC7G,IAAI,CAACA,IAAI,CAAChJ,MAAM,GAAG,CAAC,CAAC,CAAC;MAClC;MACA;MACAqU,SAAS,IAAI,CAAC;MACdC,QAAQ,GAAG,CAAC;IACd;EACF;EACA,OAAOtL,IAAI;AACb,CAAC;AAED,MAAMyL,kBAAkB,GAAGA,CAACC,QAAQ,EAAEC,SAAS,EAAEC,IAAI,KAAK;EACxD,IAAIvL,KAAK,GAAGqL,QAAQ;EACpB,IAAIE,IAAI,CAAC5U,MAAM,KAAK,CAAC,IAAIqJ,KAAK,IAAIsL,SAAS,EAAE,OAAO,IAAI;EAExD,IAAIE,UAAU,GAAG,CAAC;EAClB,IAAIC,QAAQ,GAAGH,SAAS;EACxB,MAAM5H,IAAI,GAAG,EAAE;EACf,OAAO1D,KAAK,GAAGuL,IAAI,CAAC5U,MAAM,GAAG,CAAC,EAAE;IAC9B,MAAM+U,QAAQ,GAAG1L,KAAK,GAAG,CAAC,KAAK,CAAC,GAAGA,KAAK,GAAG,CAAC,GAAGA,KAAK,GAAG,CAAC;IACxD0D,IAAI,CAAC8C,IAAI,CAAC+E,IAAI,CAACG,QAAQ,CAAC,CAAC;IACzBD,QAAQ,GAAGA,QAAQ,GAAG,CAAC,KAAK,CAAC,GAAGA,QAAQ,GAAGA,QAAQ,GAAG,CAAC;IACvD,MAAME,KAAK,GAAG9C,IAAI,CAACC,KAAK,CAAC,CAAC9I,KAAK,GAAGwL,UAAU,IAAI,CAAC,CAAC;IAClDA,UAAU,IAAIC,QAAQ;IACtBzL,KAAK,GAAGwL,UAAU,GAAGG,KAAK;IAC1BF,QAAQ,IAAI,CAAC;EACf;EACA,OAAO/H,IAAI;AACb,CAAC;AAEM,MAAMkI,WAAW,GAAGjM,IAAI,IAAI;EACjC,MAAMkM,UAAU,GAAGlY,eAAA,uBAAmBgM,IAAI,CAAC;EAC3C,OAAOkM,UAAU,CAACA,UAAU,CAAClV,MAAM,GAAG,CAAC,CAAC;AAC1C,CAAC;AAEM,MAAMmV,aAAa,GAAGA,CAAC9L,KAAK,EAAEL,IAAI,KAAK;EAC5C,MAAM2L,SAAS,GAAG3L,IAAI,CAAChJ,MAAM;EAC7B,MAAMkV,UAAU,GAAGlY,eAAA,uBAAmBgM,IAAI,CAAC;EAC3C,OAAOhM,eAAA,uBAAmBqM,KAAK,EAAEsL,SAAS,EAAEO,UAAU,CAAC;AACzD,CAAC;AAEM,MAAME,IAAI,GAAGpT,MAAM,IAAI5E,MAAM,CAACC,IAAI,CAACL,eAAA,WAAOgF,MAAM,CAAC,EAAE,KAAK,CAAC;AAAC,SAAAzE,0BAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,0BAAA;AAAA,SAAAC,6BAAAA,CAAA;EAAA,IAAAD,0BAAA;IAAA,IAAAE,cAAA,GAAAN,0BAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,0BAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,0BAAA;AAAA;AAAA,SAAAI,6BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,0BAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,0BAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,6BAAA;EAAA,IAAAU,QAAA,GAAAP,6BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,0BAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,gCAAA;AAAA,IAAAC,qBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,qBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,eAAA;EAAA2B,sBAAA,sBAAA3B,eAAA;EAAA2B,sBAAA,eAAAK,eAAA;EAAAL,sBAAA,YAAAK,eAAA;EAAAL,sBAAA,cAAAM,iBAAA;EAAAN,sBAAA,wBAAAM,iBAAA;EAAAN,sBAAA,aAAAO,gBAAA;AAAA;AAAA,SAAAlC,eAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,0BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,wBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,gCAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,wBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAvC,WAAA;IAAA;MAAA,OAAAoX,cAAA;IAAA;MAAA,OAAAI,kBAAA;IAAA;MAAA,OAAAK,kBAAA;EAAA;EAAA,OAAArV,SAAA;AAAA;AAAA,SAAAE,kBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,0BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,wBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,wBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,4BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,eAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,kBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,eAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,0BAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,iBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,gCAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,iBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,iBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,0BAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,6BAAA,GAAAH,6BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,gBAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,0BAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,iDAAA5B,qBAAA;;;;;;;;;;;;;;;;;;;;;;;;ACxEjE,MAAM2W,gBAAgB,GAAGC,mBAAO,CAAC,GAAQ,CAAC;AAE1C,MAAMC,MAAM,GAAGC,IAAI,IAAI/M,GAAG,IAAI;EAC5B,IAAIgN,GAAG;EACP,IAAIhN,GAAG,CAACU,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE;IAC5BsM,GAAG,GAAG,EAAE;IACR,KAAK,IAAI7D,CAAC,GAAG,CAAC,EAAE8D,CAAC,GAAGjN,GAAG,CAACzI,MAAM,EAAE4R,CAAC,GAAG8D,CAAC,EAAE9D,CAAC,IAAI,CAAC,EAAE;MAC7C6D,GAAG,CAAC5F,IAAI,CAACiC,QAAQ,CAACrJ,GAAG,CAACU,KAAK,CAACyI,CAAC,EAAEA,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7C;IACA6D,GAAG,GAAGrY,MAAM,CAACC,IAAI,CAACoY,GAAG,CAAC;EACxB,CAAC,MAAM;IACLA,GAAG,GAAGhN,GAAG;EACX;EACA,MAAMkN,QAAQ,GAAG3Y,WAAA,qBAAkB,SAAQwY,IAAK,EAAC,CAAC;EAClD,OAAQ,KAAIG,QAAQ,CAAC1Y,MAAM,CAACwY,GAAG,CAAC,CAACG,MAAM,CAAC,KAAK,CAAE,EAAC;AAClD,CAAC;AAEM,MAAMC,SAAS,GAAG7Y,WAAA,WAAO,GAAG,CAAC;AAC7B,MAAM8Y,SAAS,GAAG9Y,WAAA,WAAO,GAAG,CAAC;AAC7B,MAAM+Y,UAAU,GAAG/Y,WAAA,WAAO,GAAG,CAAC;AAC9B,MAAMgZ,UAAU,GAAGhZ,WAAA,WAAO,GAAG,CAAC;AAAC,SAAAO,sBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,sBAAA;AAAA,SAAAC,yBAAAA,CAAA;EAAA,IAAAD,sBAAA;IAAA,IAAAE,cAAA,GAAAN,sBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,sBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,sBAAA;AAAA;AAAA,SAAAI,yBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,sBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,sBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,yBAAA;EAAA,IAAAU,QAAA,GAAAP,yBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,sBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,4BAAA;AAAA,IAAAC,iBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,iBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,WAAA;EAAA2B,sBAAA,sBAAA3B,WAAA;EAAA2B,sBAAA,eAAAK,WAAA;EAAAL,sBAAA,YAAAK,WAAA;EAAAL,sBAAA,cAAAM,aAAA;EAAAN,sBAAA,wBAAAM,aAAA;EAAAN,sBAAA,aAAAO,YAAA;AAAA;AAAA,SAAAlC,WAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,sBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,oBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,4BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,oBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAkW,gBAAA;IAAA;MAAA,OAAAE,MAAA;EAAA;EAAA,OAAAnW,SAAA;AAAA;AAAA,SAAAE,cAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,sBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,oBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,oBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,wBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,WAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,cAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,WAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,sBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,aAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,4BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,aAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,aAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,sBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,yBAAA,GAAAH,yBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,YAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,sBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,kDAAA5B,gDAAAA,iBAAA;;ACpBtC;AACA;AACA;AACA;AAC8B;AACuC;AAC/B;AACD;AACkB;AAEvD,MAAM2X,SAAS,GAAG;EAChB,aAAa,EAAE;IACbC,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,CAAC;IACLC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,CAAC;IACLC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,CAAC;IACLC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD8P,MAAM,EAAE;IACNH,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD+P,MAAM,EAAE;IACNJ,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACDgQ,MAAM,EAAE;IACNL,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,cAAc,EAAE;IACd2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,MAAM;IACZ7P,IAAI,EAAE;EAER,CAAC;EACD,cAAc,EAAE;IACd2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,MAAM;IACZ7P,IAAI,EAAE;EAER,CAAC;EACD,cAAc,EAAE;IACd2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,MAAM;IACZ7P,IAAI,EAAE;EAER,CAAC;EACD,cAAc,EAAE;IACd2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,MAAM;IACZ7P,IAAI,EAAE;EAER,CAAC;EACD,cAAc,EAAE;IACd2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,MAAM;IACZ7P,IAAI,EAAE;EAER,CAAC;EACD,cAAc,EAAE;IACd2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,MAAM;IACZ7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER,CAAC;EACD,aAAa,EAAE;IACb2P,MAAM,EAAE,KAAK;IACbxO,GAAG,EAAE,GAAG;IACRyO,EAAE,EAAE,EAAE;IACNC,IAAI,EAAE,KAAK;IACX7P,IAAI,EAAE;EAER;AACF,CAAC;AAED,MAAMiQ,cAAc,GAAG;EACrBC,KAAK,EAAE,EAAE;EACTzM,CAAC,EAAE,IAAI;EAAE;EACT0M,CAAC,EAAE,CAAC;EACJ7J,CAAC,EAAE,CAAC;EACJqJ,MAAM,EAAE;AACV,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASS,WAAWA,CAAA5J,IAAA,EAOzBqB,QAAQ,EAER;EAAA,IARA;IACEwI,QAAQ;IACRC,UAAU;IACVC,QAAQ,GAAG,EAAE;IACb7V,OAAO,GAAG;EACZ,CAAC,GAAA8L,IAAA;EAAA,IAEDgK,MAAM,GAAAjQ,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAAlK,aAAA;EAEN,MAAMoa,GAAG,GAAG;IACV,GAAApa,aAAA,kBAAiB;IACjB,GAAGma;EACL,CAAC;EACD,MAAM;IAAEb,MAAM,GAAG;EAAc,CAAC,GAAGc,GAAG;EACtC,MAAMC,WAAW,GAAG,KAAK,CAAC7F,IAAI,CAAC8E,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE;EAChD,MAAMgB,IAAI,GAAGta,aAAA,gBAAY,EAAE,CAAC,CAAC,CAAC;EAC9B,MAAMua,QAAQ,GAAG,CAACva,aAAA,cAAUsZ,MAAM,CAACxK,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC,EAAEyK,EAAE;EAC3D,MAAMA,EAAE,GAAGvZ,aAAA,gBAAYua,QAAQ,KAAKnY,SAAS,GAAG,EAAE,GAAGmY,QAAQ,CAAC,CAAC,CAAC;EAChE,MAAMC,UAAU,GAAGxa,aAAA,WACjBI,MAAM,CAACC,IAAI,CAACmR,QAAQ,EAAE,MAAM,CAAC,EAC7B8I,IAAI,EACJF,GAAG,CAAChN,CAAC,EACLgN,GAAG,CAACN,CAAC,EACLM,GAAG,CAACnK,CAAC,EACLmK,GAAG,CAACP,KAAK,CACV,CAAC,CAAC;EACH,MAAMY,gBAAgB,GAAGza,aAAA,mBAAesZ,MAAM,EAAEkB,UAAU,CAACrO,KAAK,CAAC,CAAC,EAAEkO,WAAW,CAAC,EAAEd,EAAE,CAAC;EACrF,MAAMmB,mBAAmB,GAAGta,MAAM,CAACwM,MAAM,CAAC,CACxC6N,gBAAgB,CAACxa,MAAM,CAACG,MAAM,CAACC,IAAI,CAAC4Z,UAAU,EAAE,KAAK,CAAC,CAAC,EACvDQ,gBAAgB,CAACE,KAAK,EAAE,CACzB,CAAC;EACF,MAAMC,cAAc,GAAG5a,aAAA,mBAAesZ,MAAM,EAAEkB,UAAU,CAACrO,KAAK,CAAC,CAAC,EAAEkO,WAAW,CAAC,EAAEd,EAAE,CAAC;EACnF,MAAMsB,iBAAiB,GAAGza,MAAM,CAACwM,MAAM,CAAC,CACtCgO,cAAc,CAAC3a,MAAM,CAACG,MAAM,CAACC,IAAI,CAAC2Z,QAAQ,EAAE,MAAM,CAAC,CAAC,EACpDY,cAAc,CAACD,KAAK,EAAE,CACvB,CAAC;EACF,MAAMG,MAAM,GAAG1a,MAAM,CAACwM,MAAM,CAAC,CAAC4N,UAAU,CAACrO,KAAK,CAAC,EAAE,CAAC,EAAEuO,mBAAmB,CAAC,CAAC;EACzE,MAAMK,GAAG,GAAG/a,aAAA,cAAU8a,MAAM,CAAC,CAACvP,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;EAC/C,OAAO;IACLyP,OAAO,EAAE,CAAC;IACVrR,IAAI,EAAE,MAAM;IACZuQ,QAAQ;IACR7V,OAAO;IACP4W,MAAM,EAAE;MACN3B,MAAM;MACN4B,UAAU,EAAER,mBAAmB,CAACpa,QAAQ,CAAC,KAAK,CAAC;MAC/C6a,YAAY,EAAE;QACZ5B,EAAE,EAAEA,EAAE,CAACjZ,QAAQ,CAAC,KAAK;MACvB,CAAC;MACDua,iBAAiB,EAAEA,iBAAiB,CAACva,QAAQ,CAAC,KAAK,CAAC;MACpD8a,GAAG,EAAE,QAAQ;MACbC,SAAS,EAAE;QACTvB,CAAC,EAAEM,GAAG,CAACN,CAAC;QACR1M,CAAC,EAAEgN,GAAG,CAAChN,CAAC;QACR6C,CAAC,EAAEmK,GAAG,CAACnK,CAAC;QACR4J,KAAK,EAAEO,GAAG,CAACP,KAAK;QAChBS,IAAI,EAAEA,IAAI,CAACha,QAAQ,CAAC,KAAK;MAC3B,CAAC;MACDya;IACF;EACF,CAAC;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASO,cAAcA,CAAAC,KAAA,EAM5B/J,QAAQ,EACR;EAAA,IANA;IACEyJ,MAAM;IACNf,QAAQ,GAAG,EAAE;IACb7V,OAAO,GAAG;EACZ,CAAC,GAAAkX,KAAA;EAGD,IAAIrS,KAAK,GAAG,IAAI;EAChB,IAAI5F,MAAM,GAAG,IAAI;EACjB,MAAM;IACJ+X,SAAS;IACTN,GAAG;IACHI,YAAY;IACZN,iBAAiB,GAAG,EAAE;IACtBK,UAAU;IACV5B,MAAM,GAAG;EACX,CAAC,GAAG2B,MAAM;EACV,MAAMZ,WAAW,GAAG,KAAK,CAAC7F,IAAI,CAAC8E,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE;EAChD,MAAMC,EAAE,GAAGnZ,MAAM,CAACC,IAAI,CAAC8a,YAAY,CAAC5B,EAAE,EAAE,KAAK,CAAC;EAC9C,MAAMiB,UAAU,GAAGxa,aAAA,WACjBI,MAAM,CAACC,IAAI,CAACmR,QAAQ,CAAC,EACrBpR,MAAM,CAACC,IAAI,CAACgb,SAAS,CAACf,IAAI,EAAE,KAAK,CAAC,EAClCe,SAAS,CAACjO,CAAC,EACXiO,SAAS,CAACvB,CAAC,EACXuB,SAAS,CAACpL,CAAC,EACXoL,SAAS,CAACxB,KAAK,IAAIwB,SAAS,CAACG,KAAK,CACnC;EACD,MAAMV,MAAM,GAAG1a,MAAM,CAACwM,MAAM,CAAC,CAAC4N,UAAU,CAACrO,KAAK,CAAC,EAAE,CAAC,EAAE/L,MAAM,CAACC,IAAI,CAAC6a,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;EACpF,MAAMO,UAAU,GAAGzb,aAAA,cAAU8a,MAAM,CAAC,CAACvP,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;EACtD,IAAIkQ,UAAU,KAAKV,GAAG,EAAE;IACtB,MAAMW,kBAAkB,GAAG1b,aAAA,qBAAiBsZ,MAAM,EAAEkB,UAAU,CAACrO,KAAK,CAAC,CAAC,EAAEkO,WAAW,CAAC,EAAEd,EAAE,CAAC;IACzF,MAAMU,UAAU,GAAG7Z,MAAM,CAACwM,MAAM,CAAC,CAC/B8O,kBAAkB,CAACzb,MAAM,CAACG,MAAM,CAACC,IAAI,CAAC6a,UAAU,EAAE,KAAK,CAAC,CAAC,EACzDQ,kBAAkB,CAACf,KAAK,EAAE,CAC3B,CAAC,CAACra,QAAQ,CAAC,KAAK,CAAC;IAElB,MAAMqb,gBAAgB,GAAG3b,aAAA,qBAAiBsZ,MAAM,EAAEkB,UAAU,CAACrO,KAAK,CAAC,CAAC,EAAEkO,WAAW,CAAC,EAAEd,EAAE,CAAC;IACvF,MAAMS,QAAQ,GAAG5Z,MAAM,CAACwM,MAAM,CAAC,CAC7B+O,gBAAgB,CAAC1b,MAAM,CAACG,MAAM,CAACC,IAAI,CAACwa,iBAAiB,EAAE,KAAK,CAAC,CAAC,EAC9Dc,gBAAgB,CAAChB,KAAK,EAAE,CACzB,CAAC,CAACra,QAAQ,CAAC,MAAM,CAAC;IACnBgD,MAAM,GAAG;MACP4W,QAAQ;MACR7V,OAAO;MACP2V,QAAQ;MACRC;IACF,CAAC;EACH,CAAC,MAAM;IACL/Q,KAAK,GAAG;MAAE,GAAGlJ,aAAA,qBAAiBiJ;IAAiB,CAAC;IAChD,MAAMC,KAAK;EACb;EAEA,OAAO5F,MAAM;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMsY,aAAa,GAAGA,CAC3BC,aAAa,EACbrK,QAAQ,KACL;EACH,IAAI;IACF,MAAMlO,MAAM,GAAGtD,aAAA,mBAAe6b,aAAa,EAAErK,QAAQ,CAAC;IACtD,OAAO,CAAC,CAAClO,MAAM,CAAC2W,UAAU;EAC5B,CAAC,CAAC,OAAOxZ,CAAC,EAAE;IACV,OAAO,KAAK;EACd;AACF,CAAC;AAAC,SAAAF,wBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,wBAAA;AAAA,SAAAC,2BAAAA,CAAA;EAAA,IAAAD,wBAAA;IAAA,IAAAE,cAAA,GAAAN,wBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,wBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,wBAAA;AAAA;AAAA,SAAAI,2BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,wBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,wBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,2BAAA;EAAA,IAAAU,QAAA,GAAAP,2BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,wBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,8BAAA;AAAA,IAAAC,mBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,mBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,aAAA;EAAA2B,sBAAA,sBAAA3B,aAAA;EAAA2B,sBAAA,eAAAK,aAAA;EAAAL,sBAAA,YAAAK,aAAA;EAAAL,sBAAA,cAAAM,eAAA;EAAAN,sBAAA,wBAAAM,eAAA;EAAAN,sBAAA,aAAAO,cAAA;AAAA;AAAA,SAAAlC,aAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,wBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,sBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,8BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,sBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAyX,cAAA;IAAA;MAAA,OAAAR,uBAAA;IAAA;MAAA,OAAAC,SAAA;IAAA;MAAA,OAAAJ,eAAA;IAAA;MAAA,OAAAC,wCAAA;IAAA;MAAA,OAAAL,SAAA;IAAA;MAAA,OAAAM,0CAAA;IAAA;MAAA,OAAAnQ,gBAAA;IAAA;MAAA,OAAAsS,cAAA;EAAA;EAAA,OAAAlZ,SAAA;AAAA;AAAA,SAAAE,gBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,wBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,sBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,sBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,0BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,aAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,gBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,aAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,wBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,eAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,8BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,eAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,eAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,wBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,2BAAA,GAAAH,2BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,cAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,wBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA;AAAA,+CAAA5B,mBAAA;;ACxYF;AACA;AACA;AACA;AACgC;AACD;AACL;AACM;AACS;AACL;AACS;AAItB;AACqB;;AAE5C;AACA,MAAM0a,UAAU,GAAG,KAAIpc,WAAA,aAASqc,EAAE,EAAC,WAAW,CAAC;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,UAAU,GAAGA,CAACC,KAAK,EAAE/K,QAAQ,KAAKxR,WAAA,QAAIwc,OAAO,CAACD,KAAK,EAAE/K,QAAQ,CAAC,CAAClR,QAAQ,EAAE;;AAE/E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMmc,UAAU,GAAGA,CAACF,KAAK,EAAE/K,QAAQ,KAAKxR,WAAA,QAAI0c,OAAO,CAACH,KAAK,EAAE/K,QAAQ,CAAC,CAAClR,QAAQ,CAAAN,WAAA,YAAS;;AAEtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM2c,oBAAoB,GAAGC,MAAM,IAAI;EACrC,MAAMC,aAAa,GAAGD,MAAM,CAACjR,MAAM,EAAE;EACrC,MAAMmR,aAAa,GAAG1c,MAAM,CAACC,IAAI,CAACL,WAAA,WAAO6c,aAAa,CAAC,EAAE,KAAK,CAAC;EAC/D,MAAM9c,IAAI,GAAGC,WAAA,WAAO8c,aAAa,CAAC,CAAC3Q,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;EAC/C,OAAOnM,WAAA,qBAAiBD,IAAI,CAAC;AAC/B,CAAC;AAED,MAAMgd,UAAU,GAAG,SAAAA,CAACpT,IAAI,EAAE9J,KAAK,EAA0C;EAAA,IAAxCmd,SAAS,GAAA9S,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,uBAAuB;EAClE;EACA;;EAEA,IAAI8P,QAAQ,GAAG,EAAE;EACjB,IAAIiD,QAAQ,GAAG,EAAE;EACjB,IAAIC,WAAW,GAAG,EAAE;EACpB,IAAIC,OAAO,GAAG,EAAE;EAChB,IAAIC,QAAQ;EACZ,QAAQzT,IAAI;IACV,KAAK,iBAAiB;MACpBqQ,QAAQ,GAAGha,WAAA,UAAMqd,gBAAgB,EAAE;MACnCJ,QAAQ,GAAGjd,WAAA,UAAMsd,kBAAkB,CAACtD,QAAQ,CAAC,CAAC1Z,QAAQ,CAAC,KAAK,CAAC;MAC7D8c,QAAQ,GAAGpd,WAAA,UAAMud,cAAc,CAACN,QAAQ,CAAC;MACzCC,WAAW,GAAGE,QAAQ,CAACI,MAAM,CAACR,SAAS,CAAC;MACxCG,OAAO,GAAGnd,WAAA,eAAWyd,cAAc,CAACP,WAAW,CAACjD,UAAU,CAAC;MAC3D;IACF,KAAK,qBAAqB;MACxBD,QAAQ,GAAGna,KAAK;MAChBod,QAAQ,GAAGjd,WAAA,UAAMsd,kBAAkB,CAACtD,QAAQ,CAAC,CAAC1Z,QAAQ,CAAC,KAAK,CAAC;MAC7D8c,QAAQ,GAAGpd,WAAA,UAAMud,cAAc,CAACN,QAAQ,CAAC;MACzCC,WAAW,GAAGE,QAAQ,CAACI,MAAM,CAACR,SAAS,CAAC;MACxCG,OAAO,GAAGnd,WAAA,eAAWyd,cAAc,CAACP,WAAW,CAACjD,UAAU,CAAC;MAC3D;IACF,KAAK,uBAAuB;MAC1B,IAAI,OAAOpa,KAAK,KAAK,QAAQ,EAAE;QAC7Bsd,OAAO,GAAGnd,WAAA,eAAWyd,cAAc,CAACzd,WAAA,YAAQH,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;MAC9D,CAAC,MAAM;QACLsd,OAAO,GAAGnd,WAAA,eAAWyd,cAAc,CAAC5d,KAAK,CAAC;MAC5C;MACA;IACF;MACE,MAAM,IAAIiF,KAAK,CAAC,oBAAoB,CAAC;EAAC;EAE1C;EACA;EACA;EACA;EACA;EACA;EACA,MAAMmV,UAAU,GAAGkD,OAAO,CAACO,UAAU,EAAE,CAACpd,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC;EACxD,MAAMqd,SAAS,GAAGR,OAAO,CAACS,SAAS,EAAE;EACrC,MAAMvZ,OAAO,GAAGrE,WAAA,yBAAqB2d,SAAS,CAAC;EAC/C,OAAO;IACL3D,QAAQ;IACRgD,SAAS;IACTE,WAAW;IACXC,OAAO;IACPlD,UAAU;IACV5V;EACF,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,MAAMwZ,YAAY,GAAGA,CAACC,aAAa,EAAEX,OAAO,KAAK;EAC/C,MAAMlD,UAAU,GAAGkD,OAAO,CAACO,UAAU,CAAC,KAAK,CAAC;EAC5C,MAAMK,OAAO,GAAG/d,WAAA,WAAO8d,aAAa,CAAC;EACrC,MAAME,MAAM,GAAGhe,WAAA,eAAW2N,IAAI,CAACvN,MAAM,CAACC,IAAI,CAAC0d,OAAO,EAAE,KAAK,CAAC,EAAE9D,UAAU,EAAE,KAAK,EAAE;IAC7EgE,SAAS,EAAE;EACb,CAAC,CAAC;EACF,MAAM1Q,GAAG,GAAG,CACVyQ,MAAM,CAAClE,CAAC,CAACxZ,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAC5B0d,MAAM,CAACE,CAAC,CAAC5d,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAC3B,IAAG0d,MAAM,CAACG,aAAa,CAAC7d,QAAQ,EAAG,EAAC,CACtC,CAAC+M,IAAI,CAAC,EAAE,CAAC;EACV,OAAOjN,MAAM,CAACC,IAAI,CAACkN,GAAG,EAAE,KAAK,CAAC;AAChC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6Q,eAAe,GAAG,SAAAA,CAAA;EAAA,IAACpB,SAAS,GAAA9S,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,uBAAuB;EAAA,OAAKlK,WAAA,eAAW,iBAAiB,EAAE,EAAE,EAAEgd,SAAS,CAAC;AAAA;;AAE7G;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMqB,mBAAmB,GAAG,SAAAA,CAACrE,QAAQ,EAA0C;EAAA,IAAxCgD,SAAS,GAAA9S,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,uBAAuB;EACxE,IAAIlK,WAAA,UAAMse,gBAAgB,CAACtE,QAAQ,CAAC,EAAE;IACpC,OAAOha,WAAA,eAAW,qBAAqB,EAAEga,QAAQ,EAAEgD,SAAS,CAAC;EAC/D;EACA,OAAO,KAAK;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMuB,qBAAqB,GAAGtE,UAAU,IAAIja,WAAA,eAAW,uBAAuB,EAAEia,UAAU,CAAC;;AAE3F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMuE,eAAe,GAAGA,CAACC,MAAM,EAAEtB,OAAO,KAAK;EAC3C,IAAI;IAAE5X;EAAO,CAAC,GAAGkZ,MAAM;EACvB,IAAIlZ,MAAM,CAACvC,MAAM,KAAK,CAAC,EAAE;IACvBuC,MAAM,GAAG,IAAI;EACf;EACA;EACA;EACA;EACA;EACA,MAAMmZ,GAAG,GAAG1e,WAAA,gBAAY2L,MAAM,CAAC8S,MAAM,CAAC,CAAC5K,MAAM,EAAE;EAC/C,MAAM8K,GAAG,GAAG3e,WAAA,iBAAa0e,GAAG,EAAEvB,OAAO,CAAC;EACtC,OAAO;IACL,GAAGsB,MAAM;IACTlZ,MAAM;IACN4L,SAAS,EAAEwN;EACb,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMhR,IAAI,GAAGA,CAACiR,SAAS,EAAEzB,OAAO,KAAK;EACnC,MAAMW,aAAa,GAAG1d,MAAM,CAACC,IAAI,CAACue,SAAS,CAACrT,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC;EACrE,OAAOvL,WAAA,iBAAa8d,aAAa,EAAEX,OAAO,CAAC;AAC7C,CAAC;AAAC,IAAA0B,mBAAA,GAEa;EACb7C,KAAK,EAAAhc,WAAA;EACL+b,KAAK,EAAA/b,WAAA;EACL2N,IAAI,EAAA3N,WAAA;EACJwe,eAAe,EAAAxe,WAAA;EACfoe,eAAe,EAAApe,WAAA;EACfqe,mBAAmB,EAAAre,WAAA;EACnBue,qBAAqB,EAAAve,WAAA;EACrB2c,oBAAoB,EAAA3c,WAAA;EACpBoc,UAAU,EAAApc,WAAA;EACVsc,UAAU,EAAAtc,WAAA;EACVyc,UAAU,EAAAzc,WAAA;EACVmc,QAAQ,EAAAnc,WAAA;AACV,CAAC;AAAA,6CAAA6e,mBAAA,EAAC;AAAD,SAAAte,sBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,sBAAA;AAAA,SAAAC,yBAAAA,CAAA;EAAA,IAAAD,sBAAA;IAAA,IAAAE,cAAA,GAAAN,sBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,sBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,sBAAA;AAAA;AAAA,SAAAI,yBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,sBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,sBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,yBAAA;EAAA,IAAAU,QAAA,GAAAP,yBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,sBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,4BAAA;AAAA,IAAAC,iBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,iBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,WAAA;EAAA2B,sBAAA,sBAAA3B,WAAA;EAAA2B,sBAAA,eAAAK,WAAA;EAAAL,sBAAA,YAAAK,WAAA;EAAAL,sBAAA,cAAAM,aAAA;EAAAN,sBAAA,wBAAAM,aAAA;EAAAN,sBAAA,aAAAO,YAAA;AAAA;AAAA,SAAAlC,WAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,sBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,oBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,4BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,oBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAA2Z,oBAAA;IAAA;MAAA,OAAAG,eAAA;IAAA;MAAA,OAAAC,oBAAA;IAAA;MAAA,OAAAtc,WAAA;IAAA;MAAA,OAAAkO,gBAAA;IAAA;MAAA,OAAAmG,4BAAA,CAAA8H,GAAA;IAAA;MAAA,OAAAC,iBAAA;IAAA;MAAA,OAAAI,UAAA;IAAA;MAAA,OAAA5O,OAAA;IAAA;MAAA,OAAAmP,oBAAA;IAAA;MAAA,OAAAI,UAAA;IAAA;MAAA,OAAAhR,WAAA;IAAA;MAAA,OAAA8R,YAAA;IAAA;MAAA,OAAAlQ,IAAA;IAAA;MAAA,OAAA6Q,eAAA;IAAA;MAAA,OAAAJ,eAAA;IAAA;MAAA,OAAAC,mBAAA;IAAA;MAAA,OAAAE,qBAAA;IAAA;MAAA,OAAAjC,UAAA;IAAA;MAAA,OAAAG,UAAA;IAAA;MAAA,OAAAxI,4BAAA,CAAAkI,wBAAA;EAAA;EAAA,OAAA/Z,SAAA;AAAA;AAAA,SAAAE,cAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,sBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,oBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,oBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,wBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,WAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,cAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,WAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,sBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,aAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,4BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,aAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,aAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,sBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,yBAAA,GAAAH,yBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,YAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,sBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,2BAAA,UAAAob,mBAAA;AAAA,SAAAnb,+BAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAAgd,mBAAA,EAAAjd,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,2BAAA,iBAAAA,2BAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAAkb,mBAAA;EAAAnb,+BAAA,YAAA1D,WAAA;EAAA0D,+BAAA,sBAAA1D,WAAA;EAAA0D,+BAAA,eAAA1B,WAAA;EAAA0B,+BAAA,YAAA1B,WAAA;EAAA0B,+BAAA,cAAAzB,aAAA;EAAAyB,+BAAA,wBAAAzB,aAAA;EAAAyB,+BAAA,aAAAxB,YAAA;EAAAwB,+BAAA,kBAAAhC,iBAAA;AAAA;AAAA,SAAAuS,4BAAAA,CAAA;EAAA,IAAAC,cAAA,GAAAhK,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA;EAAA,IAAAiK,kBAAA,GAAAjT,MAAA,CAAA4B,IAAA,CAAAoR,cAAA,EAAAvP,MAAA,WAAAyP,YAAA;IAAA,OAAAA,YAAA,kBAAAA,YAAA,kBAAAA,YAAA,oBAAAA,YAAA,mBAAAA,YAAA,4BAAAA,YAAA,qBAAAA,YAAA,8BAAAA,YAAA;EAAA;EAAA,OAAAD,kBAAA,CAAAlJ,MAAA,WAAAoJ,sBAAA,EAAAD,YAAA;IAAAC,sBAAA,CAAAD,YAAA,IAAAF,cAAA,CAAAE,YAAA;IAAA,OAAAC,sBAAA;EAAA;AAAA;;;AC3QD;AACA;AACA;AACA;AAC4D;AAOjC;AAOJ;AACQ;AAEhB,MAAM0K,cAAc,CAAC;EAClC/Q,WAAWA,CAACgR,KAAK,EAAE1Z,MAAM,EAAE2Z,eAAe,EAAEC,cAAc,EAAE;IAC1D,IAAI,CAACC,MAAM,GAAGH,KAAK;IACnB,IAAI,CAACI,OAAO,GAAG9Z,MAAM;IACrB,MAAM;MAAE+Z,mBAAmB;MAAEC;IAAqB,CAAC,GAAGha,MAAM;IAC5D,IAAI,CAACia,UAAU,GAAGF,mBAAmB;IACrC,IAAI,CAACG,WAAW,GAAGF,oBAAoB;IACvC,IAAI,CAACG,KAAK,GAAGna,MAAM,CAAC1D,IAAI;IACxB,IAAI,CAAC8d,gBAAgB,GAAGT,eAAe;IACvC,IAAI,CAACU,OAAO,GAAGT,cAAc;IAE7B,IAAI,CAAC/Y,eAAe,GAAG,IAAI,CAACA,eAAe,CAAC4P,IAAI,CAAC,IAAI,CAAC;IACtD,IAAI,CAAC6J,iBAAiB,GAAG,IAAI,CAACA,iBAAiB,CAAC7J,IAAI,CAAC,IAAI,CAAC;IAC1D,IAAI,CAAC8J,SAAS,GAAG,IAAI,CAACA,SAAS,CAAC9J,IAAI,CAAC,IAAI,CAAC;IAC1C,IAAI,CAAC+J,YAAY,GAAG,IAAI,CAACA,YAAY,CAAC/J,IAAI,CAAC,IAAI,CAAC;IAChD,IAAI,CAACgK,oBAAoB,GAAG,IAAI,CAACA,oBAAoB,CAAChK,IAAI,CAAC,IAAI,CAAC;IAChE,IAAI,CAACD,GAAG,GAAG,IAAI,CAACA,GAAG,CAACC,IAAI,CAAC,IAAI,CAAC;IAC9B,IAAI,CAACiK,OAAO,GAAG,IAAI,CAACA,OAAO,CAACjK,IAAI,CAAC,IAAI,CAAC;IACtC,IAAI,CAACzP,YAAY,GAAG,IAAI,CAACA,YAAY,CAACyP,IAAI,CAAC,IAAI,CAAC;IAChD,IAAI,CAACkK,WAAW,GAAG,IAAI,CAACA,WAAW,CAAClK,IAAI,CAAC,IAAI,CAAC;IAC9C,IAAI,CAACmK,QAAQ,GAAG,IAAI,CAACA,QAAQ,CAACnK,IAAI,CAAC,IAAI,CAAC;EAC1C;EAEA8J,SAASA,CAACtD,KAAK,EAAE;IACf,IAAI,CAACA,KAAK,EAAE;MACV,OAAO,IAAI;IACb;IACA,IAAIhX,MAAM,GAAGvF,mBAAA,wBAAoB,IAAI,CAACuf,UAAU,EAAEhD,KAAK,CAAC;IACxDhX,MAAM,GAAGvF,mBAAA,cAAU,IAAI,CAACuf,UAAU,EAAEha,MAAM,EAAAvF,mBAAA,uBAAqB;IAC/D,MAAMmT,OAAO,GAAG,IAAI,CAACoM,UAAU,CAACnM,UAAU,CAAC7N,MAAM,CAAC;IAClD,OAAO,IAAI,CAACga,UAAU,CAAC5T,MAAM,CAACwH,OAAO,CAAC,CAACU,MAAM,EAAE;EACjD;EAEA+L,iBAAiBA,CAACO,WAAW,EAAE;IAC7B,IAAI,CAACA,WAAW,EAAE;MAChB,OAAO,IAAI;IACb;IACA,MAAM7c,MAAM,GAAGtD,mBAAA,4BAAwB;MACrCgM,IAAI,EAAEmU,WAAW;MACjB/P,QAAQ,EAAE,IAAI,CAACmP;IACjB,CAAC,CAAC;IACF,IAAIha,MAAM,GAAGvF,mBAAA,cAAU,IAAI,CAACuf,UAAU,EAAEjc,MAAM,EAAAtD,mBAAA,wBAAsB;IACpEuF,MAAM,GAAGvF,mBAAA,wBAAoB,IAAI,CAACuf,UAAU,EAAEha,MAAM,CAAC;IACrD,OAAOA,MAAM;EACf;EAEAua,YAAYA,CAACM,MAAM,EAAE;IACnB,IAAI,CAACA,MAAM,EAAE;MACX,OAAO,IAAI;IACb;IACA,IAAI9c,MAAM,GAAGtD,mBAAA,4BAAwB;MACnCgM,IAAI,EAAEoU,MAAM;MACZhQ,QAAQ,EAAE,IAAI,CAACoP;IACjB,CAAC,CAAC;IACFlc,MAAM,GAAGtD,mBAAA,cAAU,IAAI,CAACwf,WAAW,EAAElc,MAAM,EAAAtD,mBAAA,wBAAsB;IACjEsD,MAAM,GAAGtD,mBAAA,wBAAoB,IAAI,CAACwf,WAAW,EAAElc,MAAM,CAAC;IACtD,OAAOA,MAAM;EACf;EAEA+c,UAAUA,CAAC/c,MAAM,EAAE;IACjB,IAAI,CAACA,MAAM,EAAE;MACX,OAAO,IAAI;IACb;IACA,IAAIiC,MAAM,GAAGvF,mBAAA,wBAAoB,IAAI,CAACwf,WAAW,EAAElc,MAAM,CAAC;IAE1DiC,MAAM,GAAGvF,mBAAA,cAAU,IAAI,CAACwf,WAAW,EAAEja,MAAM,EAAAvF,mBAAA,uBAAqB;IAEhE,MAAMmT,OAAO,GAAG,IAAI,CAACqM,WAAW,CAACpM,UAAU,CAAC7N,MAAM,CAAC;IACnD,OAAO,IAAI,CAACia,WAAW,CAAC7T,MAAM,CAACwH,OAAO,CAAC,CAACU,MAAM,EAAE;EAClD;EAEAyM,iBAAiBA,CAACC,MAAM,EAAExgB,IAAI,EAAEygB,OAAO,EAAE;IACvC,MAAMzP,KAAK,GAAG,IAAI,CAACmP,QAAQ,CAACK,MAAM,EAAExgB,IAAI,EAAEygB,OAAO,CAAC;IAElD,IAAI5M,EAAE,GAAG5T,mBAAA,WAAOwe,eAAe,CAACzN,KAAK,EAAE,IAAI,CAAC4O,OAAO,CAACxC,OAAO,CAAC;IAE5DvJ,EAAE,GAAG5T,mBAAA,gBAAY2L,MAAM,CAACiI,EAAE,CAAC,CAACC,MAAM,EAAE;IACpC;IACA;IACA,IAAID,EAAE,YAAYxT,MAAM,EAAE;MACxB,OAAOwT,EAAE,CAACtT,QAAQ,CAAC,KAAK,CAAC;IAC3B;IACA,OAAON,mBAAA,oBAAgB4T,EAAE,CAAC;EAC5B;EAEA6M,sBAAsBA,CAACxK,IAAI,EAAE;IAC3B,MAAMyK,UAAU,GAAGzK,IAAI,CAACtR,MAAM,CAC5BuR,GAAG,IAAI,CAAClW,mBAAA,eAAWkW,GAAG,CAAC,IAAI,CAAClW,mBAAA,cAAUkW,GAAG,EAAEO,IAAI,CAAC,CACjD;IACD,MAAM+J,OAAO,GAAG,IAAI,CAACX,SAAS,CAACa,UAAU,CAAC,CAAC,CAAC,CAAC;IAE7C,OAAO,IAAI,CAACvB,MAAM,CAAC/Z,cAAc,EAAE,CAAC7B,IAAI,CAACod,MAAM,IAAI;MACjD,MAAM;QAAEC,eAAe;QAAEC;MAAc,CAAC,GAAGF,MAAM;MACjD,OAAO,IAAI,CAACL,iBAAiB,CAACM,eAAe,EAAEC,aAAa,EAAEL,OAAO,CAAC;IACxE,CAAC,CAAC;EACJ;EAEAM,iBAAiBA,CAAC7K,IAAI,EAAE;IACtB,MAAMyK,UAAU,GAAGzK,IAAI,CAACtR,MAAM,CAC5BuR,GAAG,IAAI,CAAClW,mBAAA,eAAWkW,GAAG,CAAC,IAAI,CAAClW,mBAAA,cAAUkW,GAAG,CAACO,IAAI,CAAC,CAChD;IACD,MAAM+J,OAAO,GAAG,IAAI,CAACX,SAAS,CAACa,UAAU,CAAC,CAAC,CAAC,CAAC;IAE7C,MAAM;MAAEE,eAAe;MAAEC;IAAc,CAAC,GAAG,IAAI,CAAC1B,MAAM,CAAC/Z,cAAc,CAAC;MACpEqR,IAAI,EAAE;IACR,CAAC,CAAC;IAEF,OAAO,IAAI,CAAC6J,iBAAiB,CAACM,eAAe,EAAEC,aAAa,EAAEL,OAAO,CAAC;EACxE;EAEAO,8BAA8BA,CAAC9K,IAAI,EAAE;IACnC,MAAMyK,UAAU,GAAGzK,IAAI,CAACtR,MAAM,CAC5BuR,GAAG,IAAI,CAAClW,mBAAA,eAAWkW,GAAG,CAAC,IAAI,CAAClW,mBAAA,cAAUkW,GAAG,CAACO,IAAI,CAAC,CAChD;IACD,MAAM+J,OAAO,GAAG,IAAI,CAACX,SAAS,CAACa,UAAU,CAAC,CAAC,CAAC,CAAC;IAE7C,MAAM;MAAEH,MAAM;MAAExgB;IAAK,CAAC,GAAG2gB,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;;IAExC,OAAO,IAAI,CAACJ,iBAAiB,CAACC,MAAM,EAAExgB,IAAI,EAAEygB,OAAO,CAAC;EACtD;EAEAra,eAAeA,CAAA,EAAU;IAAA,SAAAuQ,IAAA,GAAAxM,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAAkM,IAAA,GAAAC,IAAA,MAAAA,IAAA,GAAAD,IAAA,EAAAC,IAAA;MAAJV,IAAI,CAAAU,IAAA,IAAAzM,SAAA,CAAAyM,IAAA;IAAA;IACrB,MAAMqK,UAAU,GAAG,IAAI,CAACzK,0BAA0B,CAACN,IAAI,CAAC;IACxD,IAAI+K,UAAU,CAACxK,MAAM,EAAE;MACrB,MAAMyK,UAAU,GAAG,IAAI,CAACH,iBAAiB,CAAC7K,IAAI,CAAC;MAC/C,OAAO,IAAI,CAACkJ,MAAM,CAAChZ,eAAe,CAAC8a,UAAU,EAAE;QAC7CxK,IAAI,EAAE;MACR,CAAC,CAAC;IACJ;IACA;IACA,OAAO,IAAI,CAACgK,sBAAsB,CAACxK,IAAI,CAAC,CAAC1S,IAAI,CAAC0d,UAAU,IAAI;MAC1D,OAAO,IAAI,CAAC9B,MAAM,CAAChZ,eAAe,CAAC8a,UAAU,EAAED,UAAU,CAAC3d,QAAQ,CAAC;IACrE,CAAC,CAAC;EACJ;EAEAiD,YAAYA,CAAA,EAAU;IAAA,SAAA4a,KAAA,GAAAhX,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAA0W,KAAA,GAAAC,KAAA,MAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA;MAAJlL,IAAI,CAAAkL,KAAA,IAAAjX,SAAA,CAAAiX,KAAA;IAAA;IAClB,MAAMH,UAAU,GAAG,IAAI,CAACzK,0BAA0B,CAACN,IAAI,CAAC;IACxD,IAAI+K,UAAU,CAACxK,MAAM,EAAE;MACrB,MAAMyK,UAAU,GAAG,IAAI,CAACH,iBAAiB,CAAC7K,IAAI,CAAC;MAC/C,OAAO,IAAI,CAAC6J,YAAY,CACtB,IAAI,CAACX,MAAM,CAAC7Y,YAAY,CAAC2a,UAAU,EAAE;QACnCxK,IAAI,EAAE;MACR,CAAC,CAAC,CACH;IACH;IACA;IACA,OAAO,IAAI,CAACgK,sBAAsB,CAACxK,IAAI,CAAC,CAAC1S,IAAI,CAAC0d,UAAU,IAAI;MAC1D,OAAO,IAAI,CAAC9B,MAAM,CACf7Y,YAAY,CAAC2a,UAAU,EAAE,CAAC/X,KAAK,EAAE5F,MAAM,KAAK;QAC3C0d,UAAU,CAAC3d,QAAQ,CAAC6F,KAAK,EAAE,IAAI,CAAC4W,YAAY,CAACxc,MAAM,CAAC,CAAC;MACvD,CAAC,CAAC,CACDC,IAAI,CAAC,IAAI,CAACuc,YAAY,CAAC;IAC5B,CAAC,CAAC;EACJ;EAEAvJ,0BAA0BA,CAACN,IAAI,EAAE;IAC/B,MAAM3S,MAAM,GAAG;MACbD,QAAQ,EAAArD,mBAAA,QAAM;MACdwW,MAAM,EAAE;IACV,CAAC;IACD,IAAIP,IAAI,CAACjT,MAAM,KAAK,CAAC,EAAE;MACrB;MACA,OAAOM,MAAM;IACf;IACA,IAAItD,mBAAA,eAAWiW,IAAI,CAACA,IAAI,CAACjT,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;MACrCM,MAAM,CAACD,QAAQ,GAAG4S,IAAI,CAACA,IAAI,CAACjT,MAAM,GAAG,CAAC,CAAC;IACzC;IACAiT,IAAI,CAAClT,OAAO,CAACmT,GAAG,IAAI;MAClB,IAAIlW,mBAAA,cAAUkW,GAAG,EAAEO,IAAI,CAAC,EAAE;QACxBnT,MAAM,CAACkT,MAAM,GAAGN,GAAG,CAACO,IAAI;MAC1B;IACF,CAAC,CAAC;IACF,OAAOnT,MAAM;EACf;;EAEA;EACA2c,WAAWA,CAAA,EAAU;IAAA,SAAAmB,KAAA,GAAAlX,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAA4W,KAAA,GAAAC,KAAA,MAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA;MAAJpL,IAAI,CAAAoL,KAAA,IAAAnX,SAAA,CAAAmX,KAAA;IAAA;IACjB,MAAMX,UAAU,GAAGzK,IAAI,CAACtR,MAAM,CAC5BuR,GAAG,IAAI,CAAClW,mBAAA,eAAWkW,GAAG,CAAC,IAAI,CAAClW,mBAAA,cAAUkW,GAAG,CAACO,IAAI,CAAC,CAChD;IAED,IAAIiK,UAAU,CAAC,CAAC,CAAC,EAAE;MACjB,MAAM;QAAEH,MAAM;QAAExgB;MAAK,CAAC,GAAG2gB,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;MACxC,IAAI3gB,IAAI,IAAIwgB,MAAM,EAAE;QAClB,OAAO,IAAI,CAACQ,8BAA8B,CAAC9K,IAAI,CAAC;MAClD;MACA,MAAMnR,KAAK,CAAC,kDAAkD,CAAC;IACjE;IAEA,OAAO,IAAI,CAACgc,iBAAiB,CAAC7K,IAAI,CAAC;EACrC;EAEAiK,QAAQA,CAACoB,gBAAgB,EAAEC,cAAc,EAAEC,WAAW,EAAE;IACtD,MAAMzQ,KAAK,GAAG/Q,mBAAA,mBACZ,IAAI,CAAC2f,OAAO,CAACtb,OAAO,EACpB,IAAI,CAACqb,gBAAgB,EACrB,IAAI,CAACD,KAAK,EACV+B,WAAW,CACZ;IAEDzQ,KAAK,CAAC0Q,cAAc,GAAGH,gBAAgB;IACvC,MAAMI,SAAS,GAAGH,cAAc,CAACI,KAAK,CAAC,KAAK,CAAC,GACzCJ,cAAc,CAACK,SAAS,CAAC,CAAC,CAAC,GAC3BL,cAAc;IAClBxQ,KAAK,CAACG,cAAc,GAAG9Q,MAAM,CAACC,IAAI,CAACqhB,SAAS,EAAE,KAAK,CAAC,CAACvV,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAChE,OAAO4E,KAAK;EACd;EAEAiP,OAAOA,CAAA,EAAU;IAAA,SAAA6B,KAAA,GAAA3X,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAAqX,KAAA,GAAAC,KAAA,MAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA;MAAJ7L,IAAI,CAAA6L,KAAA,IAAA5X,SAAA,CAAA4X,KAAA;IAAA;IACb,MAAM;MAAEze;IAAS,CAAC,GAAG,IAAI,CAACkT,0BAA0B,CAACN,IAAI,CAAC;IAC1D,MAAM1Q,MAAM,GAAG,IAAI,CAACub,iBAAiB,CAAC7K,IAAI,CAAC;IAC3C,OAAO;MACL3Q,MAAM,EAAE,cAAc;MACtBjC,QAAQ;MACRkC,MAAM;MACNwc,MAAM,EAAE,IAAI,CAACjC;IACf,CAAC;EACH;EAEAhK,GAAGA,CAAA,EAAU;IACX,OAAO,IAAI,CAAC3P,eAAe,CAAC,GAAA+D,SAAO,CAAC;EACtC;EAEA6V,oBAAoBA,CAACiC,QAAQ,EAAE;IAC7B,MAAM;MAAElM;IAAI,CAAC,GAAG,IAAI;IACpBA,GAAG,CAACkK,OAAO,GAAG,IAAI,CAACA,OAAO;IAC1BlK,GAAG,CAACzQ,IAAI,GAAG,IAAI,CAACiB,YAAY;IAC5BwP,GAAG,CAACmM,aAAa,GAAG,IAAI,CAAC1C,UAAU,CAAC2C,MAAM,EAAE;IAC5CpM,GAAG,CAAC/L,SAAS,GAAG,IAAI,CAACwV,UAAU;IAC/BzJ,GAAG,CAACqM,cAAc,GAAG,IAAI,CAAC3C,WAAW,CAAC0C,MAAM,EAAE;IAC9CpM,GAAG,CAACsM,UAAU,GAAG,IAAI,CAAC5C,WAAW;IACjC1J,GAAG,CAAC8J,iBAAiB,GAAG,IAAI,CAACA,iBAAiB;IAC9C9J,GAAG,CAAC+J,SAAS,GAAG,IAAI,CAACA,SAAS;IAC9B/J,GAAG,CAACuK,UAAU,GAAG,IAAI,CAACA,UAAU,CAACtK,IAAI,CAAC,IAAI,CAAC;IAC3CD,GAAG,CAAC3P,eAAe,GAAG,IAAI,CAACA,eAAe;IAC1C2P,GAAG,CAACmK,WAAW,GAAG,IAAI,CAACA,WAAW;IAClCnK,GAAG,CAACoK,QAAQ,GAAG,IAAI,CAACA,QAAQ;IAC5BpK,GAAG,CAACgK,YAAY,GAAG,IAAI,CAACA,YAAY;IACpC;IACAkC,QAAQ,CAAC,IAAI,CAACvC,KAAK,CAAC,GAAG3J,GAAG;EAC5B;AACF;AAAC,SAAAvV,8BAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,8BAAA;AAAA,SAAAC,iCAAAA,CAAA;EAAA,IAAAD,8BAAA;IAAA,IAAAE,cAAA,GAAAN,8BAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,8BAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,8BAAA;AAAA;AAAA,SAAAI,iCAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,8BAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,8BAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,iCAAA;EAAA,IAAAU,QAAA,GAAAP,iCAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,8BAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,oCAAA;AAAA,IAAAC,yBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,yBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,mBAAA;EAAA2B,sBAAA,sBAAA3B,mBAAA;EAAA2B,sBAAA,eAAAK,mBAAA;EAAAL,sBAAA,YAAAK,mBAAA;EAAAL,sBAAA,cAAAM,qBAAA;EAAAN,sBAAA,wBAAAM,qBAAA;EAAAN,sBAAA,aAAAO,oBAAA;AAAA;AAAA,SAAAlC,mBAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,8BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,4BAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,oCAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,4BAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAyI,mBAAA;IAAA;MAAA,OAAAd,SAAA;IAAA;MAAA,OAAAuB,kBAAA;IAAA;MAAA,OAAA6E,uBAAA;IAAA;MAAA,OAAAtE,mBAAA;IAAA;MAAA,OAAAZ,mBAAA;IAAA;MAAA,OAAA8T,MAAA;IAAA;MAAA,OAAA/S,WAAA;IAAA;MAAA,OAAA2D,eAAA;IAAA;MAAA,OAAAxB,UAAA;IAAA;MAAA,OAAAE,SAAA;IAAA;MAAA,OAAAwB,IAAA;IAAA;MAAA,OAAAkE,cAAA;EAAA;EAAA,OAAA1R,SAAA;AAAA;AAAA,SAAAE,sBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,8BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,4BAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,4BAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,gCAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,mBAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,sBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,mBAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,8BAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,qBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,oCAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,qBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,qBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,8BAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,iCAAA,GAAAH,iCAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,oBAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,8BAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,mCAAA,UAjPoBsb,cAAc;AAAA,SAAArb,uCAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAdkd,cAAc,EAAAnd,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,mCAAA,iBAAAA,mCAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAdob,cAAc;EAAArb,uCAAA,YAAA1D,mBAAA;EAAA0D,uCAAA,sBAAA1D,mBAAA;EAAA0D,uCAAA,eAAA1B,mBAAA;EAAA0B,uCAAA,YAAA1B,mBAAA;EAAA0B,uCAAA,cAAAzB,qBAAA;EAAAyB,uCAAA,wBAAAzB,qBAAA;EAAAyB,uCAAA,aAAAxB,oBAAA;EAAAwB,uCAAA,kBAAAhC,yBAAA;AAAA;;;ACrBnC;AACA;AACA;AACA;AACA;AACwD;AAK7B;AACmB;AACT;AAErC,MAAM2gB,8BAA8B,GAAGC,WAAW,IAAI;EACpD,MAAMC,IAAI,GAAGviB,aAAA,aAAS8R,IAAI,CAAC0Q,cAAc,CAACF,WAAW,EAAE,QAAQ,CAAC,CAACG,UAAU,EAAE;EAC7E,OAAOH,WAAW,CAACI,IAAI,CAAC/d,MAAM,CAACge,CAAC,IAAIA,CAAC,CAACC,OAAO,CAAC5f,MAAM,GAAG,CAAC,CAAC,CAAC0H,GAAG,CAACiY,CAAC,IAAI;IACjE,MAAME,EAAE,GAAGF,CAAC,CAACC,OAAO,CAAC,CAAC,CAAC,CAAChhB,IAAI;IAC5B,MAAMkhB,QAAQ,GAAGH,CAAC,CAACI,OAAO,GAAI,GAAEJ,CAAC,CAACI,OAAQ,IAAGF,EAAG,EAAC,GAAGA,EAAE;IACtD,OAAON,IAAI,CAACS,aAAa,CAACF,QAAQ,CAAC;EACrC,CAAC,CAAC;AACJ,CAAC;AAED,MAAMG,QAAQ,CAAC;EACbjV,WAAWA,CAACgR,KAAK,EAAEkE,QAAQ,EAAE7e,OAAO,EAAE;IACpC,IAAI,CAAC8a,MAAM,GAAGH,KAAK;IACnB,IAAI,CAAC3a,OAAO,GAAGA,OAAO;IACtB,IAAI,CAAC6e,QAAQ,GAAGA,QAAQ;EAC1B;EAEAC,cAAcA,CAAA,EAAqB;IAAA,IAApBC,IAAI,GAAAlZ,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,EAAE;IAAA,IAAEmZ,OAAO,GAAAnZ,SAAA,CAAAlH,MAAA,OAAAkH,SAAA,MAAA9H,SAAA;IAC/B,MAAMkhB,gBAAgB,GAAIF,IAAI,CAAEze,MAAM,CAACC,CAAC,IAAIA,CAAC,CAACqN,OAAO,KAAK,IAAI,CAAC5N,OAAO,IAAIgf,OAAO,KAAKze,CAAC,CAACoO,IAAI,CAAC;IAC7F,IAAIsQ,gBAAgB,CAACtgB,MAAM,KAAK,CAAC,EAAE;MACjC,OAAO,EAAE;IACX;IACA,OAAOsgB,gBAAgB,CAAC5Y,GAAG,CAACC,IAAI,IAAI;MAClC,MAAM;QACJqI,IAAI;QACJN,UAAU;QACVC;MACF,CAAC,GAAGhI,IAAI;MACR,IAAIyF,QAAQ;MACZ;MACA,KAAK,MAAMwS,OAAO,IAAI,IAAI,CAACM,QAAQ,EAAE;QACnC,IAAI;UACF9S,QAAQ,GAAGwS,OAAO,CAACW,UAAU,CAACvQ,IAAI,CAAC;UACnC;QACF,CAAC,CAAC,OAAOvS,CAAC,EAAE,CAAC;MACf;MACA,MAAMmS,cAAc,GAAG,CAAC,IAAID,OAAO,IAAI,EAAE,CAAC,CAAC;MAC3C,IAAID,UAAU,EAAE;QACdE,cAAc,CAACC,IAAI,CAACH,UAAU,CAAC;MACjC;MACA,IAAIpP,MAAM,GAAGsP,cAAc,CAAC3H,MAAM,CAAC,CAACC,GAAG,EAAEtG,CAAC,KAAK;QAC7C,IAAI0N,WAAW,GAAGlC,QAAQ,CAACvL,MAAM,CAACzE,MAAM,CAACC,IAAI,CAACuE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC3D0N,WAAW,GAAGlC,QAAQ,CAACE,QAAQ,CAACgC,WAAW,EAAE;UAC3C/B,KAAK,EAAEC,MAAM;UAAE;UACfC,KAAK,EAAED,MAAM;UAAE;UACf7D,KAAK,EAAE6D,MAAM;UAAE;UACfE,QAAQ,EAAE,KAAK;UAAE;UACjBC,MAAM,EAAE,IAAI;UAAE;UACdC,OAAO,EAAE,IAAI;UAAE;UACfC,MAAM,EAAE,IAAI,CAAC;QACf,CAAC,CAAC;;QACF,OAAO;UACL,GAAG3F,GAAG;UACN,GAAGoH;QACL,CAAC;MACH,CAAC,EAAE,CAAC,CAAC,CAAC;MACNhP,MAAM,GAAGtD,aAAA,cAAUoQ,QAAQ,EAAE9M,MAAM,EAAAtD,aAAA,wBAAsB;MACzDsD,MAAM,GAAGtD,aAAA,wBAAoBoQ,QAAQ,EAAE9M,MAAM,CAAC;MAC9C,OAAOA,MAAM;IACf,CAAC,CAAC;EACJ;AACF;AAEe,MAAMkgB,eAAe,CAAC;EACnCxV,WAAWA,CAACgR,KAAK,EAAEyE,iBAAiB,EAAE3E,MAAM,EAAE;IAC5C,IAAI,CAACE,KAAK,GAAGA,KAAK;IAClB,IAAI,CAACkE,QAAQ,GAAGljB,aAAA,mCAA+ByjB,iBAAiB,CAAC;IACjE,IAAI,CAAC3E,MAAM,GAAGA,MAAM;EACtB;EAEA,OAAO4E,qBAAqBA,CAAC1B,QAAQ,EAAElD,MAAM,EAAE;IAC7CkD,QAAQ,CAACkB,QAAQ,CAACngB,OAAO,CAAC6f,OAAO,IAAI;MACnC1hB,MAAM,CAAC4B,IAAI,CAAC8f,OAAO,CAACe,OAAO,CAAC,CAAC5gB,OAAO,CAAC+H,GAAG,IAAI;QAC1C,MAAMxF,MAAM,GAAGsd,OAAO,CAACe,OAAO,CAAC7Y,GAAG,CAAC,CAAC8Y,OAAO,EAAE;QAC7C,MAAMC,cAAc,GAAG,KAAA7jB,aAAA,oBAAmBgiB,QAAQ,CAAC7C,MAAM,EAAE7Z,MAAM,EAAE0c,QAAQ,CAAC3d,OAAO,EAAEya,MAAM,CAAC;QAC5F+E,cAAc,CAAC9D,oBAAoB,CAACiC,QAAQ,CAAC;MAC/C,CAAC,CAAC;IACJ,CAAC,CAAC;EACJ;EAEA8B,EAAEA,CAACzf,OAAO,EAAmB;IAAA,IAAjBhB,QAAQ,GAAA6G,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAAlK,aAAA;IAClB,MAAM+jB,gBAAgB,GAAG,KAAA/jB,aAAA,cAAa,IAAI,CAACgf,KAAK,EAAE,IAAI,CAACkE,QAAQ,EAAE7e,OAAO,CAAC;IACzErE,aAAA,oBAAgB0jB,qBAAqB,CAACK,gBAAgB,EAAE,IAAI,CAACjF,MAAM,CAAC;IACpEzb,QAAQ,CAAC,IAAI,EAAE0gB,gBAAgB,CAAC;IAChC,OAAOA,gBAAgB;EACzB;AACF;AAAC,SAAAxjB,wBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,wBAAA;AAAA,SAAAC,2BAAAA,CAAA;EAAA,IAAAD,wBAAA;IAAA,IAAAE,cAAA,GAAAN,wBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,wBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,wBAAA;AAAA;AAAA,SAAAI,2BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,wBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,wBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,2BAAA;EAAA,IAAAU,QAAA,GAAAP,2BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,wBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,8BAAA;AAAA,IAAAC,mBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,mBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,aAAA;EAAA2B,sBAAA,sBAAA3B,aAAA;EAAA2B,sBAAA,eAAAK,aAAA;EAAAL,sBAAA,YAAAK,aAAA;EAAAL,sBAAA,cAAAM,eAAA;EAAAN,sBAAA,wBAAAM,eAAA;EAAAN,sBAAA,aAAAO,cAAA;AAAA;AAAA,SAAAlC,aAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,wBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,sBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,8BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,sBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAA8R,8BAAA,CAAAvC,KAAA;IAAA;MAAA,OAAA5H,SAAA;IAAA;MAAA,OAAA8B,mBAAA;IAAA;MAAA,OAAAZ,mBAAA;IAAA;MAAA,OAAAqX,8BAAA;IAAA;MAAA,OAAAtD,cAAA;IAAA;MAAA,OAAAnP,IAAA;IAAA;MAAA,OAAAqT,QAAA;IAAA;MAAA,OAAAO,eAAA;EAAA;EAAA,OAAAphB,SAAA;AAAA;AAAA,SAAAE,gBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,wBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,sBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,sBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,0BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,aAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,gBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,aAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,wBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,eAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,8BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,eAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,eAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,wBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,2BAAA,GAAAH,2BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,cAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,wBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,6BAAA,UAvBoB+f,eAAe;AAAA,SAAA9f,iCAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAf2hB,eAAe,EAAA5hB,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,6BAAA,iBAAAA,6BAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAf6f,eAAe;EAAA9f,iCAAA,YAAA1D,aAAA;EAAA0D,iCAAA,sBAAA1D,aAAA;EAAA0D,iCAAA,eAAA1B,aAAA;EAAA0B,iCAAA,YAAA1B,aAAA;EAAA0B,iCAAA,cAAAzB,eAAA;EAAAyB,iCAAA,wBAAAzB,eAAA;EAAAyB,iCAAA,aAAAxB,cAAA;EAAAwB,iCAAA,kBAAAhC,mBAAA;AAAA;AAAA,SAAAuS,8BAAAA,CAAA;EAAA,IAAAC,cAAA,GAAAhK,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA;EAAA,IAAAiK,kBAAA,GAAAjT,MAAA,CAAA4B,IAAA,CAAAoR,cAAA,EAAAvP,MAAA,WAAAyP,YAAA;IAAA,OAAAA,YAAA,kBAAAA,YAAA,kBAAAA,YAAA,oBAAAA,YAAA,mBAAAA,YAAA,4BAAAA,YAAA,qBAAAA,YAAA,8BAAAA,YAAA;EAAA;EAAA,OAAAD,kBAAA,CAAAlJ,MAAA,WAAAoJ,sBAAA,EAAAD,YAAA;IAAAC,sBAAA,CAAAD,YAAA,IAAAF,cAAA,CAAAE,YAAA;IAAA,OAAAC,sBAAA;EAAA;AAAA;;;AC5EpC;AACA;AACA;AACA;AAMuB;AAC6B;AACZ;AACS;AAEP;AAE3B,MAAM2P,KAAK,CAAC;EACzBhW,WAAWA,CAAC6H,cAAc,EAAE;IAC1B3U,MAAM,CAAC4B,IAAI,CAAA9C,UAAA,kBAAe,CAAC+C,OAAO,CAAC+H,GAAG,IAAI;MACxC,MAAMmZ,YAAY,GAAGjkB,UAAA,kBAAc8K,GAAG,CAAC;MACvC,MAAM;QAAElJ;MAAK,CAAC,GAAGqiB,YAAY;MAC7B,MAAM3e,MAAM,GAAG,KAAAtF,UAAA,iBAAgBikB,YAAY,CAAC;MAC5C3e,MAAM,CAAC8Q,iBAAiB,CAACP,cAAc,CAAC;MACxC7V,UAAA,YAAQ,IAAI,EAAE4B,IAAI,EAAE0D,MAAM,CAACwQ,GAAG,CAAC;IACjC,CAAC,CAAC;EACJ;EAEAS,0BAA0BA,CAACN,IAAI,EAAE;IAC/B,MAAM3S,MAAM,GAAG;MACbD,QAAQ,EAAArD,UAAA,QAAM;MACdwW,MAAM,EAAE;IACV,CAAC;IACD,IAAIP,IAAI,CAACjT,MAAM,KAAK,CAAC,EAAE;MACrB;MACA,OAAOM,MAAM;IACf;IACA,IAAItD,UAAA,eAAWiW,IAAI,CAACA,IAAI,CAACjT,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;MACrCM,MAAM,CAACD,QAAQ,GAAG4S,IAAI,CAACA,IAAI,CAACjT,MAAM,GAAG,CAAC,CAAC;IACzC;IACAiT,IAAI,CAAClT,OAAO,CAACmT,GAAG,IAAI;MAClB,IAAIlW,UAAA,cAAUkW,GAAG,EAAEO,IAAI,CAAC,EAAE;QACxBnT,MAAM,CAACkT,MAAM,GAAGN,GAAG,CAACO,IAAI;MAC1B;IACF,CAAC,CAAC;IACF,OAAOnT,MAAM;EACf;EAEA4gB,UAAUA,CAAC7f,OAAO,EAAEya,MAAM,EAAW;IAAA,SAAApI,IAAA,GAAAxM,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAAkM,IAAA,OAAAA,IAAA,WAAAC,IAAA,MAAAA,IAAA,GAAAD,IAAA,EAAAC,IAAA;MAAJV,IAAI,CAAAU,IAAA,QAAAzM,SAAA,CAAAyM,IAAA;IAAA;IACjC,MAAM;MAAEtT,QAAQ;MAAEmT;IAAO,CAAC,GAAG,IAAI,CAACD,0BAA0B,CAACN,IAAI,CAAC;IAClE,IAAIO,MAAM,EAAE;MACV,MAAM2N,GAAG,GAAG,IAAI,CAAC1e,4BAA4B,CAACpB,OAAO,EAAE;QACrDoS,IAAI,EAAE;MACR,CAAC,CAAC;MACF,IAAI0N,GAAG,IAAIA,GAAG,CAACzB,IAAI,IAAIyB,GAAG,CAACzB,IAAI,CAAC1f,MAAM,GAAG,CAAC,EAAE;QAC1C,MAAMohB,OAAO,GAAG,KAAApkB,UAAA,qBAAoB,IAAI,EAAEmkB,GAAG,EAAErF,MAAM,CAAC;QACtD,OAAOsF,OAAO,CAACN,EAAE,CAACzf,OAAO,CAAC;MAC5B;MACA,MAAM,IAAIS,KAAK,CAAC,kBAAkB,CAAC;IACrC;IACA;IACA,OAAO,IAAI,CAACW,4BAA4B,CAACpB,OAAO,CAAC,CAACd,IAAI,CAAC4gB,GAAG,IAAI;MAC5D,IAAIA,GAAG,IAAIA,GAAG,CAACzB,IAAI,IAAIyB,GAAG,CAACzB,IAAI,CAAC1f,MAAM,GAAG,CAAC,EAAE;QAC1C,MAAMohB,OAAO,GAAG,KAAApkB,UAAA,qBAAoB,IAAI,EAAEmkB,GAAG,EAAErF,MAAM,CAAC;QACtD,MAAMxb,MAAM,GAAG8gB,OAAO,CAACN,EAAE,CAACzf,OAAO,CAAC;QAClChB,QAAQ,CAAC,IAAI,EAAEC,MAAM,CAAC;QACtB,OAAOA,MAAM;MACf;MACAD,QAAQ,CAAC,IAAIyB,KAAK,CAAC,kBAAkB,CAAC,CAAC;MACvC;MACA,IAAIzB,QAAQ,CAACL,MAAM,KAAK,CAAC,EAAE;QACzB,MAAM,IAAI8B,KAAK,CAAC,kBAAkB,CAAC;MACrC;IACF,CAAC,CAAC;EACJ;EAEAqT,aAAaA,CAACkM,IAAI,EAAE9D,MAAM,EAAW;IAAA,SAAAW,KAAA,GAAAhX,SAAA,CAAAlH,MAAA,EAANiT,IAAI,OAAAzL,KAAA,CAAA0W,KAAA,OAAAA,KAAA,WAAAC,KAAA,MAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA;MAAJlL,IAAI,CAAAkL,KAAA,QAAAjX,SAAA,CAAAiX,KAAA;IAAA;IACjC,MAAM;MAAE3K;IAAO,CAAC,GAAG,IAAI,CAACD,0BAA0B,CAACN,IAAI,CAAC;IACxD,IAAIO,MAAM,EAAE;MACV,MAAM8N,KAAK,GAAG,IAAI,CAACxe,gBAAgB,CAACya,MAAM,EAAE,IAAI,EAAE;QAChD9J,IAAI,EAAE;MACR,CAAC,CAAC;MACF,MAAM;QAAE8N,SAAS;QAAEC;MAAK,CAAC,GAAGF,KAAK;MACjC,MAAMG,KAAK,GAAGD,IAAI,CAACE,YAAY;MAC/B,MAAMC,OAAO,GAAGF,KAAK,CAACG,SAAS,CAACC,EAAE,IAAIA,EAAE,KAAKR,IAAI,CAAC;MAClD,IAAIM,OAAO,KAAK,CAAC,CAAC,EAAE;QAClB,MAAM,IAAI7f,KAAK,CACZ,QAAOuf,IAAK,2DAA0D9D,MAAO,EAAC,CAChF;MACH;MACA,MAAMuE,SAAS,GAAG,IAAI,CAAC9e,YAAY,CAACue,SAAS,EAAE,CAAC,EAAEE,KAAK,CAACzhB,MAAM,EAAE;QAC9DyT,IAAI,EAAE;MACR,CAAC,CAAC;MACF,MAAMsO,KAAK,GAAGD,SAAS,CAACpa,GAAG,CAAC,CAACpH,MAAM,EAAE+I,KAAK,KAAK;QAC7C,MAAMwY,EAAE,GAAGJ,KAAK,CAACpY,KAAK,CAAC;QACvB,MAAMsU,MAAM,GAAGrd,MAAM,CAAC0hB,MAAM;QAC5B,MAAMhgB,MAAM,GAAG5E,MAAM,CAACwM,MAAM,CAAC,CAC3BxM,MAAM,CAACC,IAAI,CAACwkB,EAAE,CAACtZ,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,EACxCnL,MAAM,CAACC,IAAI,CAACsgB,MAAM,EAAE,MAAM,CAAC,CAC5B,CAAC;QACF,OAAO3gB,UAAA,eAAWoY,IAAI,CAACpT,MAAM,CAAC;MAChC,CAAC,CAAC;MACF,OAAOhF,UAAA,eAAWmY,aAAa,CAACwM,OAAO,EAAEI,KAAK,CAAC;IACjD;IACA,OAAO,IAAI,CAACjf,gBAAgB,CAACya,MAAM,EAAE,IAAI,CAAC,CAAChd,IAAI,CAAC+gB,KAAK,IAAI;MACvD,MAAM;QAAEC,SAAS;QAAEC;MAAK,CAAC,GAAGF,KAAK;MACjC,MAAMG,KAAK,GAAGD,IAAI,CAACE,YAAY;MAC/B,MAAMC,OAAO,GAAGF,KAAK,CAACG,SAAS,CAACC,EAAE,IAAIA,EAAE,KAAKR,IAAI,CAAC;MAClD,IAAIM,OAAO,KAAK,CAAC,CAAC,EAAE;QAClB,MAAM,IAAI7f,KAAK,CACZ,QAAOuf,IAAK,2DAA0D9D,MAAO,EAAC,CAChF;MACH;MACA,OAAO,IAAI,CAACva,YAAY,CAACue,SAAS,EAAE,CAAC,EAAEE,KAAK,CAACzhB,MAAM,CAAC,CAACO,IAAI,CAAC0hB,OAAO,IAAI;QACnE,MAAMF,KAAK,GAAGE,OAAO,CAACva,GAAG,CAAC,CAACpH,MAAM,EAAE+I,KAAK,KAAK;UAC3C,MAAMwY,EAAE,GAAGJ,KAAK,CAACpY,KAAK,CAAC;UACvB,MAAMsU,MAAM,GAAGrd,MAAM,CAAC0hB,MAAM;UAC5B,MAAMhgB,MAAM,GAAG5E,MAAM,CAACwM,MAAM,CAAC,CAC3BxM,MAAM,CAACC,IAAI,CAACwkB,EAAE,CAACtZ,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,EACxCnL,MAAM,CAACC,IAAI,CAACsgB,MAAM,EAAE,MAAM,CAAC,CAC5B,CAAC;UACF,OAAO3gB,UAAA,eAAWoY,IAAI,CAACpT,MAAM,CAAC;QAChC,CAAC,CAAC;QACF,OAAOhF,UAAA,eAAWmY,aAAa,CAACwM,OAAO,EAAEI,KAAK,CAAC;MACjD,CAAC,CAAC;IACJ,CAAC,CAAC;EACJ;AACF;AAAC,SAAAxkB,qBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,qBAAA;AAAA,SAAAC,wBAAAA,CAAA;EAAA,IAAAD,qBAAA;IAAA,IAAAE,cAAA,GAAAN,qBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,qBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,qBAAA;AAAA;AAAA,SAAAI,wBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,qBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,wBAAA;EAAA,IAAAU,QAAA,GAAAP,wBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,qBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,2BAAA;AAAA,IAAAC,gBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,gBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,UAAA;EAAA2B,sBAAA,sBAAA3B,UAAA;EAAA2B,sBAAA,eAAAK,UAAA;EAAAL,sBAAA,YAAAK,UAAA;EAAAL,sBAAA,cAAAM,YAAA;EAAAN,sBAAA,wBAAAM,YAAA;EAAAN,sBAAA,aAAAO,WAAA;AAAA;AAAA,SAAAlC,UAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,mBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,2BAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,mBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAgD,aAAA;IAAA;MAAA,OAAAwQ,WAAA;IAAA;MAAA,OAAA9F,OAAA;IAAA;MAAA,OAAAD,IAAA;IAAA;MAAA,OAAA1B,UAAA;IAAA;MAAA,OAAAE,SAAA;IAAA;MAAA,OAAAoV,eAAA;IAAA;MAAA,OAAAvP,2BAAA,CAAAiE,0BAAA;EAAA;EAAA,OAAA9V,SAAA;AAAA;AAAA,SAAAE,aAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,mBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,mBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,uBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,UAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,aAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,UAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,qBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,YAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,2BAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,YAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,YAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,qBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,wBAAA,GAAAH,wBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,WAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,qBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,0BAAA,UA9GoBugB,KAAK;AAAA,SAAAtgB,8BAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAALmiB,KAAK,EAAApiB,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,0BAAA,iBAAAA,0BAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAALqgB,KAAK;EAAAtgB,8BAAA,YAAA1D,UAAA;EAAA0D,8BAAA,sBAAA1D,UAAA;EAAA0D,8BAAA,eAAA1B,UAAA;EAAA0B,8BAAA,YAAA1B,UAAA;EAAA0B,8BAAA,cAAAzB,YAAA;EAAAyB,8BAAA,wBAAAzB,YAAA;EAAAyB,8BAAA,aAAAxB,WAAA;EAAAwB,8BAAA,kBAAAhC,gBAAA;AAAA;AAAA,SAAAuS,2BAAAA,CAAA;EAAA,IAAAC,cAAA,GAAAhK,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA;EAAA,IAAAiK,kBAAA,GAAAjT,MAAA,CAAA4B,IAAA,CAAAoR,cAAA,EAAAvP,MAAA,WAAAyP,YAAA;IAAA,OAAAA,YAAA,kBAAAA,YAAA,kBAAAA,YAAA,oBAAAA,YAAA,mBAAAA,YAAA,4BAAAA,YAAA,qBAAAA,YAAA,8BAAAA,YAAA;EAAA;EAAA,OAAAD,kBAAA,CAAAlJ,MAAA,WAAAoJ,sBAAA,EAAAD,YAAA;IAAAC,sBAAA,CAAAD,YAAA,IAAAF,cAAA,CAAAE,YAAA;IAAA,OAAAC,sBAAA;EAAA;AAAA;;;AChB1B;AACA;AACA;AACA;;AAEe,MAAM6Q,cAAc,CAAC;EAClClX,WAAWA,CAACmX,QAAQ,EAAE;IACpB,IAAI,CAACA,QAAQ,GAAGA,QAAQ;EAC1B;EAEA,OAAOC,cAAcA,CAAAjV,IAAA,EAAyC;IAAA,IAAxC;MAAEyF,aAAa;MAAEtQ,MAAM;MAAEC,MAAM,GAAG,CAAC;IAAE,CAAC,GAAA4K,IAAA;IAC1D,OAAO;MACL7K,MAAM,EAAEsQ,aAAa,CAACyP,WAAW,EAAE;MACnCC,GAAG,EAAEhgB,MAAM;MACXC;IACF,CAAC;EACH;EAEAggB,WAAWA,CAACJ,QAAQ,EAAE;IACpB,IAAI,CAACA,QAAQ,GAAGA,QAAQ;EAC1B;EAEAtO,IAAIA,CAAC2O,WAAW,EAAE;IAChB,IAAI,CAAC,IAAI,CAACL,QAAQ,EAAE;MAClB,OAAO,IAAI;IACb;IAEA,MAAMM,OAAO,GAAGzlB,kBAAA,mBAAeolB,cAAc,CAACI,WAAW,CAAC;IAC1D,OAAO,IAAI,CAACL,QAAQ,CAACtO,IAAI,CAAC4O,OAAO,CAAC;EACpC;EAEA3O,SAASA,CAAC0O,WAAW,EAAE;IACrB,IAAI,CAAC,IAAI,CAACL,QAAQ,EAAE;MAClB,OAAO,IAAI;IACb;IAEA,MAAMM,OAAO,GAAGzlB,kBAAA,mBAAeolB,cAAc,CAACI,WAAW,CAAC;IAC1D,OAAO,IAAI,CAACL,QAAQ,CAACrO,SAAS,CAAC2O,OAAO,CAAC;EACzC;AACF;AAAC,SAAAllB,6BAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,6BAAA;AAAA,SAAAC,gCAAAA,CAAA;EAAA,IAAAD,6BAAA;IAAA,IAAAE,cAAA,GAAAN,6BAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,6BAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,6BAAA;AAAA;AAAA,SAAAI,gCAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,6BAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,6BAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,gCAAA;EAAA,IAAAU,QAAA,GAAAP,gCAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,6BAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,mCAAA;AAAA,IAAAC,wBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,wBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,kBAAA;EAAA2B,sBAAA,sBAAA3B,kBAAA;EAAA2B,sBAAA,eAAAK,kBAAA;EAAAL,sBAAA,YAAAK,kBAAA;EAAAL,sBAAA,cAAAM,oBAAA;EAAAN,sBAAA,wBAAAM,oBAAA;EAAAN,sBAAA,aAAAO,mBAAA;AAAA;AAAA,SAAAlC,kBAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,6BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,2BAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,mCAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,2BAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAA+iB,cAAA;EAAA;EAAA,OAAA9iB,SAAA;AAAA;AAAA,SAAAE,qBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,6BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,2BAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,2BAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,+BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,kBAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,qBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,kBAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,6BAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,oBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,mCAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,oBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,oBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,6BAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,gCAAA,GAAAH,gCAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,mBAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,6BAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,kCAAA,UAlCoByhB,cAAc;AAAA,SAAAxhB,sCAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAdqjB,cAAc,EAAAtjB,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,kCAAA,iBAAAA,kCAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAduhB,cAAc;EAAAxhB,sCAAA,YAAA1D,kBAAA;EAAA0D,sCAAA,sBAAA1D,kBAAA;EAAA0D,sCAAA,eAAA1B,kBAAA;EAAA0B,sCAAA,YAAA1B,kBAAA;EAAA0B,sCAAA,cAAAzB,oBAAA;EAAAyB,sCAAA,wBAAAzB,oBAAA;EAAAyB,sCAAA,aAAAxB,mBAAA;EAAAwB,sCAAA,kBAAAhC,wBAAA;AAAA;;;;;ACLnC;AACA;AACA;AACA;AACyC;AAEzC,MAAMgkB,cAAc,GAAG;EACrBC,MAAM,EAAE,kBAAkB;EAC1B,cAAc,EAAE;AAClB,CAAC;AAED,IAAIC,cAAc,GAAG,CAAC,CAAC;AACvB,IAAIC,OAAO,GAAG,KAAK;AACnB,IAAIC,KAAqC,EAAE,EAa1C,MAAM;EACL;EACA;EACAxjB,oBAAA,mBAAiBgW,kDAAwC;AAC3D;AAEe,MAAMgO,YAAY,CAAC;EAChCtY,WAAWA,CAAA,EAIT;IAAA,IAHAuY,IAAI,GAAArc,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,uBAAuB;IAAA,IAC9Bsc,OAAO,GAAAtc,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,IAAI;IAAA,IACduc,OAAO,GAAAvc,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAAlK,iBAAA;IAEP,IAAI,CAACumB,IAAI,GAAGA,IAAI,CAAChb,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;IACnC,IAAI,CAACib,OAAO,GAAGA,OAAO;IACtB,IAAI,CAACC,OAAO,GAAG,CAAC,CAAC;IACjB,IAAIjc,KAAK,CAACC,OAAO,CAACgc,OAAO,CAAC,EAAE;MAC1BA,OAAO,CAAC1jB,OAAO,CAACoN,IAAA,IAAqB;QAAA,IAApB;UAAEvO,IAAI;UAAE/B;QAAM,CAAC,GAAAsQ,IAAA;QAC9B,IAAI,CAACsW,OAAO,CAAC7kB,IAAI,CAAC,GAAG/B,KAAK;MAC5B,CAAC,CAAC;MACF,IAAI,CAAC4mB,OAAO,GAAG;QACb,GAAAzmB,iBAAA,kBAAiB;QACjB,GAAG,IAAI,CAACymB;MACV,CAAC;IACH,CAAC,MAAM;MACL,IAAI,CAACA,OAAO,GAAG;QACb,GAAAzmB,iBAAA,kBAAiB;QACjB,GAAGymB;MACL,CAAC;IACH;EACF;EAEA,OAAOC,cAAcA,CAACC,QAAQ,EAAE;IAC9B,IAAIrjB,MAAM;IACV,IAAI;MACFA,MAAM,GAAGgL,IAAI,CAACC,KAAK,CAACoY,QAAQ,CAAC;IAC/B,CAAC,CAAC,OAAOlmB,CAAC,EAAE;MACV6C,MAAM,GAAGqjB,QAAQ;IACnB;IACA,OAAOrjB,MAAM;EACf;EAEA,OAAOsjB,kBAAkBA,CAAC5G,OAAO,EAAE;IACjC,IAAI1c,MAAM;IACV,IAAI;MACF,MAAMujB,YAAY,GAAG7G,OAAO;MAC5B1c,MAAM,GAAG;QACPqd,MAAM,EAAEkG,YAAY,CAAClG,MAAM;QAC3BzX,KAAK,EAAE2d,YAAY,CAAClG,MAAM,KAAK,GAAG,GAAG,CAAC,GAAGkG,YAAY,CAAClG,MAAM;QAC5D7b,KAAK,EAAE;UACLqO,OAAO,EAAE6M,OAAO,CAAC8G;QACnB,CAAC;QACDA,UAAU,EAAE9G,OAAO,CAAC8G;MACtB,CAAC;IACH,CAAC,CAAC,OAAOrmB,CAAC,EAAE;MACV6C,MAAM,GAAG0c,OAAO;IAClB;IACA,OAAO1c,MAAM;EACf;EAEA,OAAOyjB,cAAcA,CAACC,KAAK,EAAE;IAC3B,OAAO,IAAIC,OAAO,CAACC,QAAQ,IAAI;MAC7B,MAAMC,GAAG,GAAGC,UAAU,CAAC,MAAM;QAC3BC,YAAY,CAACF,GAAG,CAAC;QACjB;QACAD,QAAQ,CAAC;UAAEvd,IAAI,EAAE;QAAU,CAAC,CAAC;MAC/B,CAAC,EAAEqd,KAAK,CAAC;IACX,CAAC,CAAC;EACJ;EAEAM,kBAAkBA,CAACC,aAAa,EAAEvH,OAAO,EAAE;IACzC,MAAM;MACJsF,GAAG;MACHhgB,MAAM,GAAG,MAAM;MACfC,MAAM,GAAG,CAAC,CAAC;MACXiiB;IACF,CAAC,GAAGD,aAAa;IACjB,MAAMxX,IAAI,GAAI,QAAOuV,GAAI,EAAC,CAAC/Z,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC;IACjD,IAAIkc,GAAG,GAAI,GAAE,IAAI,CAAClB,IAAK,GAAExW,IAAK,EAAC,CAACxE,OAAO,EAAE;IACzC,MAAMmc,SAAS,GAAG,IAAIC,OAAO,EAAE;IAC/B,IAAIC,IAAI,GAAGtZ,IAAI,CAACS,SAAS,CAACxJ,MAAM,CAAC;IACjC,IAAID,MAAM,CAAC+f,WAAW,EAAE,KAAK,KAAK,IAAI/f,MAAM,CAAC+f,WAAW,EAAE,KAAK,QAAQ,EAAE;MACvEoC,GAAG,GAAGvmB,MAAM,CAAC4B,IAAI,CAACyC,MAAM,CAAC,CAACvC,MAAM,GAAG,CAAC,GAAI,GAAEykB,GAAI,IAAGznB,iBAAA,cAAUuF,MAAM,CAAE,EAAC,GAAGkiB,GAAG;MAC1EG,IAAI,GAAGxlB,SAAS;IAClB;IACAlB,MAAM,CAAC4B,IAAI,CAAC,IAAI,CAAC2jB,OAAO,CAAC,CAAC1jB,OAAO,CAAC8kB,MAAM,IAAI;MAC1CH,SAAS,CAACI,MAAM,CAACD,MAAM,EAAE,IAAI,CAACpB,OAAO,CAACoB,MAAM,CAAC,CAAC;IAChD,CAAC,CAAC;IACF,OAAO7H,OAAO,CAACyH,GAAG,EAAE;MAClBniB,MAAM,EAAEA,MAAM,CAAC+f,WAAW,EAAE;MAC5BoB,OAAO,EAAEiB,SAAS;MAClBE,IAAI;MACJJ;IACF,CAAC,CAAC;EACJ;EAEAO,gBAAgBA,CAACR,aAAa,EAAE;IAC9B,MAAMvH,OAAO,GAAAhgB,iBAAA,kBAAiB;IAC9B,MAAM;MAAEwmB;IAAQ,CAAC,GAAG,IAAI;IACxB,MAAMwB,OAAO,GAAG,OAAOC,eAAe,KAAK,UAAU,GAAG,IAAIA,eAAe,EAAE,GAAG,CAAC,CAAC;IAClF,MAAMC,MAAM,GAAG;MAAE,GAAGX,aAAa;MAAEC,MAAM,EAAEQ,OAAO,CAACR,MAAM;MAAEW,WAAW,EAAE;IAAO,CAAC;IAChF;IACA,OAAOlB,OAAO,CAACmB,IAAI,CAAC,CAClB,IAAI,CAACd,kBAAkB,CAACY,MAAM,EAAElI,OAAO,CAAC,EACxChgB,iBAAA,iBAAa+mB,cAAc,CAACP,OAAO,CAAC,CACrC,CAAC,CAACjjB,IAAI,CAACD,MAAM,IAAI,IAAI2jB,OAAO,CAAC,CAACrD,OAAO,EAAEyE,MAAM,KAAK;MACjD;MACA;MACA,IAAI;QACF,IAAI/kB,MAAM,CAACqG,IAAI,KAAK,SAAS,EAAE;UAC7B;UACA,IAAIqe,OAAO,CAACM,KAAK,EAAEN,OAAO,CAACM,KAAK,EAAE;UAClCD,MAAM,CAAC/kB,MAAM,CAAC;QAChB,CAAC,MAAM;UACLA,MAAM,CACHilB,IAAI,EAAE,CACNhlB,IAAI,CAACglB,IAAI,IAAI;YACZ,MAAMC,GAAG,GAAGxoB,iBAAA,iBAAa0mB,cAAc,CAAC6B,IAAI,CAAC;YAC7C,IAAIjlB,MAAM,CAACqd,MAAM,KAAK,GAAG,IAAI,CAACrd,MAAM,CAACmlB,EAAE,EAAE;cACvCJ,MAAM,CAACG,GAAG,CAAC;cACX;YACF;YACA5E,OAAO,CAAC4E,GAAG,CAAC;UACd,CAAC,CAAC,CACDhlB,KAAK,CAACuT,GAAG,IAAIsR,MAAM,CAACtR,GAAG,CAAC,CAAC;QAC9B;MACF,CAAC,CAAC,OAAOtW,CAAC,EAAE;QACV4nB,MAAM,CAAC5nB,CAAC,CAAC;MACX;MACA;IACF,CAAC,CAAC,CAAC;EACL;;EAEAioB,WAAWA,CAACnB,aAAa,EAAEvH,OAAO,EAAmB;IAAA,IAAjB2I,OAAO,GAAAze,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA,MAAG,KAAK;IACjD,MAAM;MACJob,GAAG;MACHhgB,MAAM,GAAG,MAAM;MACfC,MAAM,GAAG,CAAC;IACZ,CAAC,GAAGgiB,aAAa;IACjB,MAAMxX,IAAI,GAAI,QAAOuV,GAAI,EAAC,CAAC/Z,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC;IACjD,IAAIkc,GAAG,GAAI,GAAE,IAAI,CAAClB,IAAK,GAAExW,IAAK,EAAC,CAACxE,OAAO,EAAE;IACzC,IAAIjG,MAAM,CAAC+f,WAAW,EAAE,KAAK,KAAK,IAAI/f,MAAM,CAAC+f,WAAW,EAAE,KAAK,QAAQ,EAAE;MACvEoC,GAAG,GAAGvmB,MAAM,CAAC4B,IAAI,CAACyC,MAAM,CAAC,CAACvC,MAAM,GAAG,CAAC,GAAI,GAAEykB,GAAI,IAAGznB,iBAAA,cAAUuF,MAAM,CAAE,EAAC,GAAGkiB,GAAG;IAC5E;IACAzH,OAAO,CAAC4I,IAAI,CAACtjB,MAAM,CAAC+f,WAAW,EAAE,EAAEoC,GAAG,EAAEkB,OAAO,CAAC;IAChDznB,MAAM,CAAC4B,IAAI,CAAC,IAAI,CAAC2jB,OAAO,CAAC,CAAC1jB,OAAO,CAAC8kB,MAAM,IAAI;MAC1C7H,OAAO,CAAC6I,gBAAgB,CAAChB,MAAM,EAAE,IAAI,CAACpB,OAAO,CAACoB,MAAM,CAAC,CAAC;IACxD,CAAC,CAAC;IACF,IAAIviB,MAAM,CAAC+f,WAAW,EAAE,KAAK,KAAK,IAAI/f,MAAM,CAAC+f,WAAW,EAAE,KAAK,QAAQ,EAAE;MACvErF,OAAO,CAACnJ,IAAI,EAAE;IAChB,CAAC,MAAM;MACLmJ,OAAO,CAACnJ,IAAI,CAACvI,IAAI,CAACS,SAAS,CAACxJ,MAAM,CAAC,CAAC;IACtC;EACF;EAEAsR,IAAIA,CAAC0Q,aAAa,EAAE;IAClB,IAAAvnB,iBAAA,aAAa,MAAM,IAAI8E,KAAK,CAAC,uDAAuD,CAAC;IACrF,MAAMkb,OAAO,GAAG,KAAAhgB,iBAAA,qBAAoB;IACpCggB,OAAO,CAAC8I,eAAe,GAAG,KAAK;IAC/B,IAAI,CAACJ,WAAW,CAACnB,aAAa,EAAEvH,OAAO,CAAC;IACxC,IAAI1c,MAAM,GAAG0c,OAAO,CAAC+I,YAAY;IAEjCzlB,MAAM,GAAGtD,iBAAA,iBAAa0mB,cAAc,CAACpjB,MAAM,CAAC;IAC5C,IAAIA,MAAM,CAACwB,KAAK,EAAE;MAChB,MAAMxB,MAAM;IACd;IACA,OAAOA,MAAM;EACf;EAEAwT,SAASA,CAACyQ,aAAa,EAAE;IACvB,IAAAvnB,iBAAA,aAAa,OAAO,IAAI,CAAC+nB,gBAAgB,CAACR,aAAa,CAAC;IACxD,OAAO,IAAI,CAACyB,kBAAkB,CAACzB,aAAa,CAAC;EAC/C;EAEAyB,kBAAkBA,CAACzB,aAAa,EAAE;IAChC,MAAMvH,OAAO,GAAG,KAAAhgB,iBAAA,qBAAoB;IACpCggB,OAAO,CAAC8I,eAAe,GAAG,KAAK;IAC/B9I,OAAO,CAACwG,OAAO,GAAG,IAAI,CAACA,OAAO;IAC9B,IAAI,CAACkC,WAAW,CAACnB,aAAa,EAAEvH,OAAO,EAAE,IAAI,CAAC;IAC9C,OAAO,IAAIiH,OAAO,CAAC,CAACrD,OAAO,EAAEyE,MAAM,KAAK;MACtCrI,OAAO,CAACiJ,kBAAkB,GAAG,MAAM;QACjC,IAAIjJ,OAAO,CAACkJ,UAAU,KAAK,CAAC,IAAIlJ,OAAO,CAACwG,OAAO,KAAK,CAAC,EAAE;UACrD,IAAIljB,MAAM,GAAG0c,OAAO,CAAC+I,YAAY;UACjC,IAAI;YACFzlB,MAAM,GAAGtD,iBAAA,iBAAa0mB,cAAc,CAACpjB,MAAM,CAAC;YAC5C,IAAI0c,OAAO,CAACW,MAAM,KAAK,GAAG,IAAIrd,MAAM,CAACwB,KAAK,EAAE;cAC1CujB,MAAM,CAAC/kB,MAAM,CAAC;YAChB,CAAC,MAAM;cACLsgB,OAAO,CAACtgB,MAAM,CAAC;YACjB;UACF,CAAC,CAAC,OAAO7C,CAAC,EAAE;YACV;YACA4nB,MAAM,CAAC5nB,CAAC,CAAC;UACX;QACF;MACF,CAAC;MAEDuf,OAAO,CAACmJ,OAAO,GAAGpS,GAAG,IAAI;QACvBsR,MAAM,CAACtR,GAAG,CAAC;MACb,CAAC;MACDiJ,OAAO,CAACoJ,SAAS,GAAGrS,GAAG,IAAI;QACzB;QACAsR,MAAM,CAACtR,GAAG,CAAC;MACb,CAAC;IACH,CAAC,CAAC;EACJ;EAEAsS,WAAWA,CAAA,EAAG;IACZ,IAAI;MACF,IAAI,CAACxS,IAAI,CAAC;QACRvR,MAAM,EAAE,KAAK;QACbggB,GAAG,EAAE;MACP,CAAC,CAAC;MACF,OAAO,IAAI;IACb,CAAC,CAAC,OAAO7kB,CAAC,EAAE;MACV,OAAO,KAAK;IACd;EACF;EAEA,MAAM6oB,gBAAgBA,CAAA,EAAG;IACvB,IAAI;MACF,OAAO,MAAM,IAAI,CAACvB,gBAAgB,CAAC;QACjCziB,MAAM,EAAE,KAAK;QACbggB,GAAG,EAAE;MACP,CAAC,CAAC;IACJ,CAAC,CAAC,OAAO7kB,CAAC,EAAE;MACV,OAAO,KAAK;IACd;EACF;AACF;AAAC,SAAAF,4BAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,4BAAA;AAAA,SAAAC,+BAAAA,CAAA;EAAA,IAAAD,4BAAA;IAAA,IAAAE,cAAA,GAAAN,4BAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,4BAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,4BAAA;AAAA;AAAA,SAAAI,+BAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,4BAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,4BAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,+BAAA;EAAA,IAAAU,QAAA,GAAAP,+BAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,4BAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,kCAAA;AAAA,IAAAC,uBAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,uBAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,iBAAA;EAAA2B,sBAAA,sBAAA3B,iBAAA;EAAA2B,sBAAA,eAAAK,iBAAA;EAAAL,sBAAA,YAAAK,iBAAA;EAAAL,sBAAA,cAAAM,mBAAA;EAAAN,sBAAA,wBAAAM,mBAAA;EAAAN,sBAAA,aAAAO,kBAAA;AAAA;AAAA,SAAAlC,iBAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,4BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,0BAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,kCAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,0BAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAAyjB,cAAA;IAAA;MAAA,OAAAC,OAAA;IAAA;MAAA,OAAAH,cAAA;IAAA;MAAA,OAAA3W,sBAAA;IAAA;MAAA,OAAAuX,YAAA;EAAA;EAAA,OAAAlkB,SAAA;AAAA;AAAA,SAAAE,oBAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,4BAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,0BAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,0BAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;IAAA;MAAA,OAAAyjB,cAAA,GAAApjB,MAAA;IAAA;MAAA,OAAAqjB,OAAA,GAAArjB,MAAA;EAAA;EAAA,OAAAJ,SAAA;AAAA;AAAA,SAAAK,8BAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,iBAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,oBAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,iBAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,4BAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,mBAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,kCAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,mBAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,mBAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,4BAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,+BAAA,GAAAH,+BAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,kBAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,4BAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,iCAAA,UA9NoB6iB,YAAY;AAAA,SAAA5iB,qCAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAZykB,YAAY,EAAA1kB,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,iCAAA,iBAAAA,iCAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAZ2iB,YAAY;EAAA5iB,qCAAA,YAAA1D,iBAAA;EAAA0D,qCAAA,sBAAA1D,iBAAA;EAAA0D,qCAAA,eAAA1B,iBAAA;EAAA0B,qCAAA,YAAA1B,iBAAA;EAAA0B,qCAAA,cAAAzB,mBAAA;EAAAyB,qCAAA,wBAAAzB,mBAAA;EAAAyB,qCAAA,aAAAxB,kBAAA;EAAAwB,qCAAA,kBAAAhC,uBAAA;AAAA;;;AChCjC;AACA;AACA;AACA;;AAEe,MAAM6nB,QAAQ,CAAC;EAC5Bvb,WAAWA,CAAA,EAAG;IACZ,IAAI,CAACjF,cAAc,GAAG3G,SAAS;EACjC;AACF;;;;;ACTA;AACA;AACA;AACA;AACwD;AAClB;AACV;AACsB;AACH;AACjB;AACQ;AACA;AACQ;AACP;AACJ;;AAEnC;AACe,MAAMqnB,IAAI,CAAC;EACxBzb,WAAWA,CAACmX,QAAQ,EAAE;IAAAuE,eAAA,oBA4BV;MACVpD,YAAY,EAAAtmB,QAAA;IACd,CAAC;IAAA0pB,eAAA,mBAEU,KAAA1pB,QAAA,eAAc;IAEzB;AACF;AACA;AACA;IAHE0pB,eAAA,kBAIU;MACRC,GAAG,EAAE7D,eAAuB8D;IAC9B,CAAC;IAvCC,IAAI,CAACC,eAAe,GAAG,KAAA7pB,QAAA,oBAAmBmlB,QAAQ,CAAC;IACnD,IAAI,CAAC2E,eAAe,GAAG3E,QAAQ;IAC/B,IAAI,CAACnG,KAAK,GAAG,KAAAhf,QAAA,WAAU,IAAI,CAAC6pB,eAAe,CAAC;EAC9C;EAsCA;AACF;AACA;AACA;EACER,WAAWA,CAAA,EAAG;IACZ,OAAO,IAAI,CAACS,eAAe,IAAI,IAAI,CAACA,eAAe,CAACT,WAAW,EAAE;EACnE;EAEA9D,WAAWA,CAACJ,QAAQ,EAAE;IACpB,IAAI,CAAC0E,eAAe,CAACtE,WAAW,CAACJ,QAAQ,CAAC;IAC1C,IAAI,CAAC2E,eAAe,GAAG3E,QAAQ;EACjC;AACF;AACA;AAAAuE,eAAA,CAAA1pB,QAAA,qBAjDmB8lB,eAAuB;AAAA4D,eAAA,CAAA1pB,QAAA,uBAErB;EACjBsmB,YAAY,EAAAtmB,QAAA;AACd,CAAC;AAED;AACF;AACA;AAFE0pB,eAAA,CAAA1pB,QAAA,kBAAAA,QAAA;AAAA0pB,eAAA,CAAA1pB,QAAA,qBAAAA,QAAA;AAAA0pB,eAAA,CAAA1pB,QAAA,oBAAAA,QAAA;AAAA0pB,eAAA,CAAA1pB,QAAA,mBASe;EACb,GAAAA,QAAA,SAAQ;EACR,GAAAA,QAAA,SAAQ;EACRJ,MAAM,EAAAI,QAAA;EACN8J,SAAS,EAAA9J,QAAA;AACX,CAAC;AAAA,SAAAO,mBAAAA,CAAA;EAAA;IAAA,MAAAC,MAAA;MAAA,OAAAA,MAAA;IAAA;EAAA,SAAAC,CAAA;IAAA;MAAA,MAAAC,MAAA;QAAA,OAAAA,MAAA;MAAA;IAAA,SAAAD,CAAA;MAAA;IAAA;EAAA;AAAA;AAAA;AAAA,IAAAE,mBAAA;AAAA,SAAAC,sBAAAA,CAAA;EAAA,IAAAD,mBAAA;IAAA,IAAAE,cAAA,GAAAN,mBAAA;IAAA,KAAAM,cAAA,CAAAC,kCAAA;MAAAD,cAAA,CAAAC,kCAAA;IAAA;IAAAH,mBAAA,GAAAG,kCAAA;EAAA;EAAA,OAAAH,mBAAA;AAAA;AAAA,SAAAI,sBAAAA,CAAA;EAAA,IAAAC,iBAAA,GAAAT,mBAAA;EAAA,KAAAS,iBAAA,CAAAC,4BAAA;IAAAD,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;EAAA;EAAA,OAAAH,iBAAA,CAAAC,4BAAA;AAAA;AAAA,SAAAG,mBAAAA,CAAA;EAAA,IAAAC,QAAA,GAAAT,sBAAA;EAAA,IAAAU,QAAA,GAAAP,sBAAA;EAAA,IAAAQ,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA,KAAAE,UAAA;IAAAD,QAAA,CAAAD,QAAA,IAAAH,MAAA,CAAAC,MAAA;IAAAI,UAAA,GAAAD,QAAA,CAAAD,QAAA;EAAA;EAAA,OAAAE,UAAA;AAAA;AAAA,UAAAC,iBAAA;EAAA,IAAAR,iBAAA,GAAAT,mBAAA;EAAA,KAAAS,iBAAA;IAAAA,iBAAA;MAAAA,iBAAA,CAAAC,4BAAA,GAAAC,MAAA,CAAAC,MAAA;IAAA;EAAA;AAAA;AAAA,IAAAM,yBAAA;AAAA,IAAAC,cAAA;AAAA;EAAA,SAAAC,uBAAAC,IAAA,EAAA/B,KAAA;IAAAqB,MAAA,CAAAW,cAAA,CAAAH,cAAA,EAAAE,IAAA;MAAA/B,KAAA,EAAAA,KAAA;MAAAiC,UAAA;MAAAC,YAAA;IAAA;EAAA;EAAAJ,sBAAA,YAAA3B,QAAA;EAAA2B,sBAAA,sBAAA3B,QAAA;EAAA2B,sBAAA,eAAAK,QAAA;EAAAL,sBAAA,YAAAK,QAAA;EAAAL,sBAAA,cAAAM,UAAA;EAAAN,sBAAA,wBAAAM,UAAA;EAAAN,sBAAA,aAAAO,SAAA;AAAA;AAAA,SAAAlC,QAAAA,CAAAmC,YAAA;EAAA,IAAAZ,UAAA,GAAAH,mBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAC,iBAAA,CAAAF,YAAA;EAAA;IAAA,IAAAtC,KAAA,GAAA0B,UAAA,CAAAY,YAAA;IAAA,IAAAtC,KAAA,KAAA4B,yBAAA;MAAA,OAAAW,SAAA;IAAA;MAAA,OAAAvC,KAAA;IAAA;EAAA;AAAA;AAAA,SAAAwC,iBAAAA,CAAAF,YAAA;EAAA,QAAAA,YAAA;IAAA;MAAA,OAAA+iB,cAAA;IAAA;MAAA,OAAAlB,KAAA;IAAA;MAAA,OAAAsC,YAAA;IAAA;MAAA,OAAArS,yBAAA,CAAAvC,KAAA;IAAA;MAAA,OAAAuC,yBAAA,CAAAuV,qBAAA;IAAA;MAAA,OAAA1K,MAAA;IAAA;MAAA,OAAA7K,yBAAA,CAAArC,qBAAA;IAAA;MAAA,OAAAqC,yBAAA,CAAAM,qBAAA;IAAA;MAAA,OAAA3U,WAAA;IAAA;MAAA,OAAAqU,yBAAA,CAAAnK,yBAAA;IAAA;MAAA,OAAAyf,QAAA;IAAA;MAAA,OAAAE,IAAA;EAAA;EAAA,OAAArnB,SAAA;AAAA;AAAA,SAAAE,WAAAA,CAAAH,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,mBAAA;EAAA,IAAAG,UAAA,CAAAY,YAAA,MAAAC,SAAA;IAAA,OAAAG,iBAAA,CAAAJ,YAAA,EAAAtC,KAAA;EAAA;IAAA,OAAA0B,UAAA,CAAAY,YAAA,IAAAtC,KAAA;EAAA;AAAA;AAAA,SAAA0C,iBAAAA,CAAAJ,YAAA,EAAAK,MAAA;EAAA,QAAAL,YAAA;EAAA,OAAAC,SAAA;AAAA;AAAA,SAAAK,qBAAAA,CAAAC,SAAA,EAAAP,YAAA,EAAAQ,MAAA;EAAA,IAAAC,QAAA,GAAA5C,QAAA,CAAAmC,YAAA;EAAA,IAAAU,QAAA,GAAAH,SAAA,YAAAE,QAAA,OAAAA,QAAA;EAAAN,WAAA,CAAAH,YAAA,EAAAU,QAAA;EAAA,OAAAF,MAAA,GAAAE,QAAA,GAAAD,QAAA;AAAA;AAAA,SAAAZ,QAAAA,CAAAG,YAAA,EAAAtC,KAAA;EAAA,IAAA0B,UAAA,GAAAH,mBAAA;EAAA,WAAAe,YAAA;IAAAjB,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;MAAAL,UAAA,CAAAK,IAAA,IAAAO,YAAA,CAAAP,IAAA;IAAA;IAAA;MAAAV,MAAA,CAAA4B,IAAA,CAAAX,YAAA,EAAAY,OAAA,WAAAnB,IAAA;QAAAK,UAAA,CAAAE,YAAA;MAAA;IAAA;EAAA;IAAA,IAAAtC,KAAA,KAAAuC,SAAA;MAAAb,UAAA,CAAAY,YAAA,IAAAV,yBAAA;IAAA;MAAAF,UAAA,CAAAY,YAAA,IAAAtC,KAAA;IAAA;IAAA;MAAAoC,UAAA,CAAAE,YAAA;IAAA;EAAA;AAAA;AAAA,SAAAF,UAAAA,CAAAE,YAAA;EAAA,IAAAZ,UAAA,GAAAH,mBAAA;EAAA,OAAAG,UAAA,CAAAY,YAAA;EAAA,IAAAjB,MAAA,CAAA4B,IAAA,CAAAvB,UAAA,EAAAyB,MAAA;IAAA,OAAAjC,sBAAA,GAAAH,sBAAA;EAAA;EAAA;AAAA;AAAA,SAAAsB,SAAAA,CAAAe,MAAA;EAAA,IAAA1B,UAAA,GAAAH,mBAAA;EAAA,IAAA8B,oBAAA,GAAAhC,MAAA,CAAA4B,IAAA,CAAAG,MAAA;EAAA,IAAAE,cAAA;EAAA,SAAAC,MAAA;IAAAF,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAgB,cAAA,CAAAhB,YAAA;IAAA;EAAA;EAAA,iBAAAkB,QAAA;IAAAH,oBAAA,CAAAH,OAAA,WAAAZ,YAAA;MAAAgB,cAAA,CAAAhB,YAAA,IAAAZ,UAAA,CAAAY,YAAA;MAAAZ,UAAA,CAAAY,YAAA,IAAAc,MAAA,CAAAd,YAAA;IAAA;IAAA,IAAAmB,MAAA,GAAAD,QAAA;IAAA,MAAAC,MAAA,WAAAA,MAAA,CAAAC,IAAA;MAAAD,MAAA,CAAAC,IAAA,CAAAH,KAAA,EAAAI,KAAA,CAAAJ,KAAA;IAAA;MAAAA,KAAA;IAAA;IAAA,OAAAE,MAAA;EAAA;AAAA;AAAA,IAAAG,wBAAA,UA3BkBgmB,IAAI;AAAA,SAAA/lB,4BAAAA,CAAA9B,IAAA,EAAA/B,KAAA;EAAAqB,MAAA,CAAAW,cAAA,CAAJ4nB,IAAI,EAAA7nB,IAAA;IAAA/B,KAAA,EAAAA,KAAA;IAAAiC,UAAA;IAAAC,YAAA;EAAA;AAAA;AAAA,KAAA0B,wBAAA,iBAAAA,wBAAA,oBAAAvC,MAAA,CAAAyC,YAAA,CAAJ8lB,IAAI;EAAA/lB,4BAAA,YAAA1D,QAAA;EAAA0D,4BAAA,sBAAA1D,QAAA;EAAA0D,4BAAA,eAAA1B,QAAA;EAAA0B,4BAAA,YAAA1B,QAAA;EAAA0B,4BAAA,cAAAzB,UAAA;EAAAyB,4BAAA,wBAAAzB,UAAA;EAAAyB,4BAAA,aAAAxB,SAAA;EAAAwB,4BAAA,kBAAAhC,cAAA;AAAA;AAAA,SAAAuS,yBAAAA,CAAA;EAAA,IAAAC,cAAA,GAAAhK,SAAA,CAAAlH,MAAA,QAAAkH,SAAA,QAAA9H,SAAA,GAAA8H,SAAA;EAAA,IAAAiK,kBAAA,GAAAjT,MAAA,CAAA4B,IAAA,CAAAoR,cAAA,EAAAvP,MAAA,WAAAyP,YAAA;IAAA,OAAAA,YAAA,kBAAAA,YAAA,kBAAAA,YAAA,oBAAAA,YAAA,mBAAAA,YAAA,4BAAAA,YAAA,qBAAAA,YAAA,8BAAAA,YAAA;EAAA;EAAA,OAAAD,kBAAA,CAAAlJ,MAAA,WAAAoJ,sBAAA,EAAAD,YAAA;IAAAC,sBAAA,CAAAD,YAAA,IAAAF,cAAA,CAAAE,YAAA;IAAA,OAAAC,sBAAA;EAAA;AAAA","sources":["webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/util.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/utils.js","webpack://AElf/./node_modules/bn.js/lib/bn.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/enum.js","webpack://AElf/external node-commonjs \"crypto\"","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/util/minimal.js","webpack://AElf/./node_modules/safe-buffer/index.js","webpack://AElf/./node_modules/inherits/inherits.js","webpack://AElf/./node_modules/hash.js/lib/hash/utils.js","webpack://AElf/./node_modules/crypto-js/core.js","webpack://AElf/external node-commonjs \"buffer\"","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/field.js","webpack://AElf/./node_modules/minimalistic-assert/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/object.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/types.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/errors.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/namespace.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_duplex.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/oneof.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/base.js","webpack://AElf/./node_modules/hash.js/lib/hash/common.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/writer.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/reader.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/type.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/mapfield.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/service.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/method.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/message.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/root.js","webpack://AElf/external node-commonjs \"util\"","webpack://AElf/./node_modules/elliptic/lib/elliptic/curves.js","webpack://AElf/./node_modules/hash.js/lib/hash.js","webpack://AElf/./node_modules/pbkdf2/lib/precondition.js","webpack://AElf/./node_modules/pbkdf2/lib/default-encoding.js","webpack://AElf/./node_modules/pbkdf2/lib/to-buffer.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/readable.js","webpack://AElf/./node_modules/crypto-js/evpkdf.js","webpack://AElf/./node_modules/@protobufjs/aspromise/index.js","webpack://AElf/./node_modules/@protobufjs/inquire/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/rpc.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/roots.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/encoder.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/decoder.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/verifier.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/converter.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/wrappers.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/tokenize.js","webpack://AElf/./node_modules/elliptic/lib/elliptic.js","webpack://AElf/./node_modules/minimalistic-crypto-utils/lib/utils.js","webpack://AElf/./node_modules/brorand/index.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/index.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/256.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/512.js","webpack://AElf/./node_modules/create-hash/index.js","webpack://AElf/./node_modules/pbkdf2/lib/sync.js","webpack://AElf/external node-commonjs \"fs\"","webpack://AElf/external node-commonjs \"path\"","webpack://AElf/./node_modules/scryptsy/lib/utils.js","webpack://AElf/./node_modules/keccak/lib/api/index.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_readable.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/state.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_writable.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_transform.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/ext/descriptor/index.js","webpack://AElf/./node_modules/query-string/index.js","webpack://AElf/./node_modules/bindings/bindings.js","webpack://AElf/./node_modules/crypto-js/aes.js","webpack://AElf/./node_modules/crypto-js/enc-base64.js","webpack://AElf/./node_modules/crypto-js/md5.js","webpack://AElf/./node_modules/crypto-js/sha1.js","webpack://AElf/./node_modules/crypto-js/hmac.js","webpack://AElf/./node_modules/crypto-js/cipher-core.js","webpack://AElf/./node_modules/crypto-js/enc-utf8.js","webpack://AElf/./node_modules/inherits/inherits_browser.js","webpack://AElf/./node_modules/hdkey/node_modules/safe-buffer/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/index-light.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/index-minimal.js","webpack://AElf/./node_modules/@protobufjs/base64/index.js","webpack://AElf/./node_modules/@protobufjs/eventemitter/index.js","webpack://AElf/./node_modules/@protobufjs/float/index.js","webpack://AElf/./node_modules/@protobufjs/utf8/index.js","webpack://AElf/./node_modules/@protobufjs/pool/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/util/longbits.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/writer_buffer.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/reader_buffer.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/rpc/service.js","webpack://AElf/./node_modules/@protobufjs/codegen/index.js","webpack://AElf/./node_modules/@protobufjs/fetch/index.js","webpack://AElf/./node_modules/@protobufjs/path/index.js","webpack://AElf/./node_modules/bs58/index.js","webpack://AElf/./node_modules/base-x/src/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/parse.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/common.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/short.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/mont.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/edwards.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/1.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/common.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/224.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/384.js","webpack://AElf/./node_modules/hash.js/lib/hash/hmac.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/ec/index.js","webpack://AElf/./node_modules/hmac-drbg/lib/hmac-drbg.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/ec/key.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/ec/signature.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/eddsa/index.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/eddsa/key.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/eddsa/signature.js","webpack://AElf/./node_modules/pbkdf2/lib/async.js","webpack://AElf/./node_modules/randombytes/index.js","webpack://AElf/./node_modules/hdkey/lib/hdkey.js","webpack://AElf/./node_modules/bs58check/index.js","webpack://AElf/./node_modules/bs58check/base.js","webpack://AElf/./node_modules/bs58check/node_modules/bs58/index.js","webpack://AElf/./node_modules/bs58check/node_modules/base-x/src/index.js","webpack://AElf/./node_modules/secp256k1/bindings.js","webpack://AElf/./node_modules/file-uri-to-path/index.js","webpack://AElf/./node_modules/secp256k1/elliptic.js","webpack://AElf/./node_modules/secp256k1/lib/index.js","webpack://AElf/./node_modules/bip66/index.js","webpack://AElf/./node_modules/secp256k1/lib/elliptic/index.js","webpack://AElf/./node_modules/scryptsy/lib/index.js","webpack://AElf/./node_modules/scryptsy/lib/scryptSync.js","webpack://AElf/./node_modules/scryptsy/lib/scrypt.js","webpack://AElf/./node_modules/keccak/bindings.js","webpack://AElf/./node_modules/keccak/lib/api/keccak.js","webpack://AElf/external node-commonjs \"stream\"","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/stream.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/from.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_passthrough.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://AElf/./node_modules/keccak/lib/api/shake.js","webpack://AElf/./node_modules/node-gyp-build/index.js","webpack://AElf/./node_modules/node-gyp-build/node-gyp-build.js","webpack://AElf/./node_modules/keccak/js.js","webpack://AElf/./node_modules/keccak/lib/keccak.js","webpack://AElf/./node_modules/strict-uri-encode/index.js","webpack://AElf/./node_modules/decode-uri-component/index.js","webpack://AElf/./node_modules/split-on-first/index.js","webpack://AElf/./node_modules/filter-obj/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/light.js","webpack://AElf/./node_modules/bip39/src/_wordlists.js","webpack://AElf/./node_modules/string_decoder/lib/string_decoder.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/index.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha.js","webpack://AElf/./node_modules/hash.js/lib/hash/ripemd.js","webpack://AElf/./node_modules/bip39/src/index.js","webpack://AElf/./node_modules/pbkdf2/index.js","webpack://AElf/./node_modules/create-hmac/index.js","webpack://AElf/external node-commonjs \"assert\"","webpack://AElf/./node_modules/secp256k1/index.js","webpack://AElf/./node_modules/secp256k1/lib/assert.js","webpack://AElf/./node_modules/secp256k1/lib/der.js","webpack://AElf/./node_modules/browserify-cipher/index.js","webpack://AElf/./node_modules/keccak/index.js","webpack://AElf/external node-commonjs \"events\"","webpack://AElf/./node_modules/util-deprecate/node.js","webpack://AElf/external node-commonjs \"os\"","webpack://AElf/./node_modules/keccak/lib/keccak-state-unroll.js","webpack://AElf/./node_modules/xmlhttprequest/lib/XMLHttpRequest.js","webpack://AElf/external node-commonjs \"url\"","webpack://AElf/external node-commonjs \"child_process\"","webpack://AElf/external node-commonjs \"http\"","webpack://AElf/external node-commonjs \"https\"","webpack://AElf/webpack/bootstrap","webpack://AElf/webpack/runtime/compat get default export","webpack://AElf/webpack/runtime/define property getters","webpack://AElf/webpack/runtime/hasOwnProperty shorthand","webpack://AElf/webpack/runtime/make namespace object","webpack://AElf/webpack/runtime/node module decorator","webpack://AElf/./node_modules/tslib/tslib.es6.mjs","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/constants.js","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/RawSha256.js","webpack://AElf/./node_modules/@smithy/util-buffer-from/dist-es/index.js","webpack://AElf/./node_modules/@smithy/util-utf8/dist-es/fromUtf8.js","webpack://AElf/./node_modules/@smithy/util-utf8/dist-es/toUint8Array.js","webpack://AElf/./node_modules/@smithy/util-utf8/dist-es/toUtf8.js","webpack://AElf/./node_modules/@smithy/util-utf8/dist-es/index.js","webpack://AElf/./node_modules/@aws-crypto/util/build/module/convertToBuffer.js","webpack://AElf/./node_modules/@aws-crypto/util/build/module/isEmptyData.js","webpack://AElf/./node_modules/@aws-crypto/util/build/module/index.js","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/jsSha256.js","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/index.js","webpack://AElf/./src/util/sha256.js","webpack://AElf/./node_modules/bignumber.js/bignumber.mjs","webpack://AElf/./src/util/formatters.js","webpack://AElf/./src/common/constants.js","webpack://AElf/./src/util/transform.js","webpack://AElf/./src/util/utils.js","webpack://AElf/./src/util/proto.js","webpack://AElf/./src/util/bloom.js","webpack://AElf/./src/chain/chainMethod.js","webpack://AElf/./src/util/merkleTree.js","webpack://AElf/./src/util/keccak.js","webpack://AElf/./src/util/keyStore.js","webpack://AElf/./src/wallet/index.js","webpack://AElf/./src/contract/contractMethod.js","webpack://AElf/./src/contract/index.js","webpack://AElf/./src/chain/index.js","webpack://AElf/./src/util/requestManage.js","webpack://AElf/./src/util/httpProvider.js","webpack://AElf/./src/util/settings.js","webpack://AElf/./src/index.js"],"sourcesContent":["\"use strict\";\n\n/**\n * Various utility functions.\n * @namespace\n */\nvar util = module.exports = require(\"./util/minimal\");\n\nvar roots = require(\"./roots\");\n\nvar Type, // cyclic\n Enum;\n\nutil.codegen = require(\"@protobufjs/codegen\");\nutil.fetch = require(\"@protobufjs/fetch\");\nutil.path = require(\"@protobufjs/path\");\n\n/**\n * Node's fs module if available.\n * @type {Object.}\n */\nutil.fs = util.inquire(\"fs\");\n\n/**\n * Converts an object's values to an array.\n * @param {Object.} object Object to convert\n * @returns {Array.<*>} Converted array\n */\nutil.toArray = function toArray(object) {\n if (object) {\n var keys = Object.keys(object),\n array = new Array(keys.length),\n index = 0;\n while (index < keys.length)\n array[index] = object[keys[index++]];\n return array;\n }\n return [];\n};\n\n/**\n * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values.\n * @param {Array.<*>} array Array to convert\n * @returns {Object.} Converted object\n */\nutil.toObject = function toObject(array) {\n var object = {},\n index = 0;\n while (index < array.length) {\n var key = array[index++],\n val = array[index++];\n if (val !== undefined)\n object[key] = val;\n }\n return object;\n};\n\nvar safePropBackslashRe = /\\\\/g,\n safePropQuoteRe = /\"/g;\n\n/**\n * Tests whether the specified name is a reserved word in JS.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nutil.isReserved = function isReserved(name) {\n return /^(?:do|if|in|for|let|new|try|var|case|else|enum|eval|false|null|this|true|void|with|break|catch|class|const|super|throw|while|yield|delete|export|import|public|return|static|switch|typeof|default|extends|finally|package|private|continue|debugger|function|arguments|interface|protected|implements|instanceof)$/.test(name);\n};\n\n/**\n * Returns a safe property accessor for the specified property name.\n * @param {string} prop Property name\n * @returns {string} Safe accessor\n */\nutil.safeProp = function safeProp(prop) {\n if (!/^[$\\w_]+$/.test(prop) || util.isReserved(prop))\n return \"[\\\"\" + prop.replace(safePropBackslashRe, \"\\\\\\\\\").replace(safePropQuoteRe, \"\\\\\\\"\") + \"\\\"]\";\n return \".\" + prop;\n};\n\n/**\n * Converts the first character of a string to upper case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.ucFirst = function ucFirst(str) {\n return str.charAt(0).toUpperCase() + str.substring(1);\n};\n\nvar camelCaseRe = /_([a-z])/g;\n\n/**\n * Converts a string to camel case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.camelCase = function camelCase(str) {\n return str.substring(0, 1)\n + str.substring(1)\n .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); });\n};\n\n/**\n * Compares reflected fields by id.\n * @param {Field} a First field\n * @param {Field} b Second field\n * @returns {number} Comparison value\n */\nutil.compareFieldsById = function compareFieldsById(a, b) {\n return a.id - b.id;\n};\n\n/**\n * Decorator helper for types (TypeScript).\n * @param {Constructor} ctor Constructor function\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {Type} Reflected type\n * @template T extends Message\n * @property {Root} root Decorators root\n */\nutil.decorateType = function decorateType(ctor, typeName) {\n\n /* istanbul ignore if */\n if (ctor.$type) {\n if (typeName && ctor.$type.name !== typeName) {\n util.decorateRoot.remove(ctor.$type);\n ctor.$type.name = typeName;\n util.decorateRoot.add(ctor.$type);\n }\n return ctor.$type;\n }\n\n /* istanbul ignore next */\n if (!Type)\n Type = require(\"./type\");\n\n var type = new Type(typeName || ctor.name);\n util.decorateRoot.add(type);\n type.ctor = ctor; // sets up .encode, .decode etc.\n Object.defineProperty(ctor, \"$type\", { value: type, enumerable: false });\n Object.defineProperty(ctor.prototype, \"$type\", { value: type, enumerable: false });\n return type;\n};\n\nvar decorateEnumIndex = 0;\n\n/**\n * Decorator helper for enums (TypeScript).\n * @param {Object} object Enum object\n * @returns {Enum} Reflected enum\n */\nutil.decorateEnum = function decorateEnum(object) {\n\n /* istanbul ignore if */\n if (object.$type)\n return object.$type;\n\n /* istanbul ignore next */\n if (!Enum)\n Enum = require(\"./enum\");\n\n var enm = new Enum(\"Enum\" + decorateEnumIndex++, object);\n util.decorateRoot.add(enm);\n Object.defineProperty(object, \"$type\", { value: enm, enumerable: false });\n return enm;\n};\n\n/**\n * Decorator root (TypeScript).\n * @name util.decorateRoot\n * @type {Root}\n * @readonly\n */\nObject.defineProperty(util, \"decorateRoot\", {\n get: function() {\n return roots[\"decorated\"] || (roots[\"decorated\"] = new (require(\"./root\"))());\n }\n});\n","'use strict';\n\nvar utils = exports;\nvar BN = require('bn.js');\nvar minAssert = require('minimalistic-assert');\nvar minUtils = require('minimalistic-crypto-utils');\n\nutils.assert = minAssert;\nutils.toArray = minUtils.toArray;\nutils.zero2 = minUtils.zero2;\nutils.toHex = minUtils.toHex;\nutils.encode = minUtils.encode;\n\n// Represent num in a w-NAF form\nfunction getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n var jsf = [\n [],\n [],\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n var m8;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n var key = '_' + name;\n obj.prototype[name] = function cachedProperty() {\n return this[key] !== undefined ? this[key] :\n this[key] = computer.call(this);\n };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [ 0 ];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '0' - '9'\n } else {\n return (c - 48) & 0xf;\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this.strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\n }\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [ 0 ];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this.strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16);\n };\n\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n assert(typeof Buffer !== 'undefined');\n return this.toArrayLike(Buffer, endian, length);\n };\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\n if (!littleEndian) {\n // Assume big-endian\n for (i = 0; i < reqLength - byteLength; i++) {\n res[i] = 0;\n }\n\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[reqLength - i - 1] = b;\n }\n } else {\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[i] = b;\n }\n\n for (; i < reqLength; i++) {\n res[i] = 0;\n }\n }\n\n return res;\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this.strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this.strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this.strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this.strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this.strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n function jumboMulTo (self, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this.strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) < num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this.strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this.strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modn = function modn (num) {\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return acc;\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n return this.strip();\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is BN v4 instance\n r.strip();\n } else {\n // r is BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n return a.umod(this.m)._forceRed(this);\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n","\"use strict\";\nmodule.exports = Enum;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = \"Enum\";\n\nvar Namespace = require(\"./namespace\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new enum instance.\n * @classdesc Reflected enum.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {Object.} [values] Enum values as an object, by name\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this enum\n * @param {Object.} [comments] The value comments for this enum\n */\nfunction Enum(name, values, options, comment, comments) {\n ReflectionObject.call(this, name, options);\n\n if (values && typeof values !== \"object\")\n throw TypeError(\"values must be an object\");\n\n /**\n * Enum values by id.\n * @type {Object.}\n */\n this.valuesById = {};\n\n /**\n * Enum values by name.\n * @type {Object.}\n */\n this.values = Object.create(this.valuesById); // toJSON, marker\n\n /**\n * Enum comment text.\n * @type {string|null}\n */\n this.comment = comment;\n\n /**\n * Value comment texts, if any.\n * @type {Object.}\n */\n this.comments = comments || {};\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n // Note that values inherit valuesById on their prototype which makes them a TypeScript-\n // compatible enum. This is used by pbts to write actual enum definitions that work for\n // static and reflection code alike instead of emitting generic object definitions.\n\n if (values)\n for (var keys = Object.keys(values), i = 0; i < keys.length; ++i)\n if (typeof values[keys[i]] === \"number\") // use forward entries only\n this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i];\n}\n\n/**\n * Enum descriptor.\n * @interface IEnum\n * @property {Object.} values Enum values\n * @property {Object.} [options] Enum options\n */\n\n/**\n * Constructs an enum from an enum descriptor.\n * @param {string} name Enum name\n * @param {IEnum} json Enum descriptor\n * @returns {Enum} Created enum\n * @throws {TypeError} If arguments are invalid\n */\nEnum.fromJSON = function fromJSON(name, json) {\n var enm = new Enum(name, json.values, json.options, json.comment, json.comments);\n enm.reserved = json.reserved;\n return enm;\n};\n\n/**\n * Converts this enum to an enum descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IEnum} Enum descriptor\n */\nEnum.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , this.options,\n \"values\" , this.values,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"comment\" , keepComments ? this.comment : undefined,\n \"comments\" , keepComments ? this.comments : undefined\n ]);\n};\n\n/**\n * Adds a value to this enum.\n * @param {string} name Value name\n * @param {number} id Value id\n * @param {string} [comment] Comment, if any\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a value with this name or id\n */\nEnum.prototype.add = function add(name, id, comment) {\n // utilized by the parser but not by .fromJSON\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (!util.isInteger(id))\n throw TypeError(\"id must be an integer\");\n\n if (this.values[name] !== undefined)\n throw Error(\"duplicate name '\" + name + \"' in \" + this);\n\n if (this.isReservedId(id))\n throw Error(\"id \" + id + \" is reserved in \" + this);\n\n if (this.isReservedName(name))\n throw Error(\"name '\" + name + \"' is reserved in \" + this);\n\n if (this.valuesById[id] !== undefined) {\n if (!(this.options && this.options.allow_alias))\n throw Error(\"duplicate id \" + id + \" in \" + this);\n this.values[name] = id;\n } else\n this.valuesById[this.values[name] = id] = name;\n\n this.comments[name] = comment || null;\n return this;\n};\n\n/**\n * Removes a value from this enum\n * @param {string} name Value name\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `name` is not a name of this enum\n */\nEnum.prototype.remove = function remove(name) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n var val = this.values[name];\n if (val == null)\n throw Error(\"name '\" + name + \"' does not exist in \" + this);\n\n delete this.valuesById[val];\n delete this.values[name];\n delete this.comments[name];\n\n return this;\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\n};\n","module.exports = require(\"crypto\");","\"use strict\";\nvar util = exports;\n\n// used to return a Promise where callback is omitted\nutil.asPromise = require(\"@protobufjs/aspromise\");\n\n// converts to / from base64 encoded strings\nutil.base64 = require(\"@protobufjs/base64\");\n\n// base class of rpc.Service\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\n\n// float handling accross browsers\nutil.float = require(\"@protobufjs/float\");\n\n// requires modules optionally and hides the call from bundlers\nutil.inquire = require(\"@protobufjs/inquire\");\n\n// converts to / from utf8 encoded strings\nutil.utf8 = require(\"@protobufjs/utf8\");\n\n// provides a node-like buffer pool in the browser\nutil.pool = require(\"@protobufjs/pool\");\n\n// utility to work with the low and high bits of a 64 bit value\nutil.LongBits = require(\"./longbits\");\n\n// global object reference\nutil.global = typeof window !== \"undefined\" && window\n || typeof global !== \"undefined\" && global\n || typeof self !== \"undefined\" && self\n || this; // eslint-disable-line no-invalid-this\n\n/**\n * An immuable empty array.\n * @memberof util\n * @type {Array.<*>}\n * @const\n */\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\n\n/**\n * An immutable empty object.\n * @type {Object}\n * @const\n */\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\n\n/**\n * Whether running within node or not.\n * @memberof util\n * @type {boolean}\n * @const\n */\nutil.isNode = Boolean(util.global.process && util.global.process.versions && util.global.process.versions.node);\n\n/**\n * Tests if the specified value is an integer.\n * @function\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is an integer\n */\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\n};\n\n/**\n * Tests if the specified value is a string.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a string\n */\nutil.isString = function isString(value) {\n return typeof value === \"string\" || value instanceof String;\n};\n\n/**\n * Tests if the specified value is a non-null object.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a non-null object\n */\nutil.isObject = function isObject(value) {\n return value && typeof value === \"object\";\n};\n\n/**\n * Checks if a property on a message is considered to be present.\n * This is an alias of {@link util.isSet}.\n * @function\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isset =\n\n/**\n * Checks if a property on a message is considered to be present.\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isSet = function isSet(obj, prop) {\n var value = obj[prop];\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\n return false;\n};\n\n/**\n * Any compatible Buffer instance.\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\n * @interface Buffer\n * @extends Uint8Array\n */\n// 纯粹为了解决问题做的\nutil.BufferTemp = require('buffer').Buffer;\n/**\n * Node's Buffer class if available.\n * @type {Constructor}\n */\nutil.Buffer = (function() {\n try {\n var Buffer = util.inquire(\"buffer\").Buffer;\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\n } catch (e) {\n /* istanbul ignore next */\n return null;\n }\n})();\n\n// Internal alias of or polyfull for Buffer.from.\nutil._Buffer_from = null;\n\n// Internal alias of or polyfill for Buffer.allocUnsafe.\nutil._Buffer_allocUnsafe = null;\n\n/**\n * Creates a new buffer of whatever type supported by the environment.\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\n * @returns {Uint8Array|Buffer} Buffer\n */\nutil.newBuffer = function newBuffer(sizeOrArray) {\n /* istanbul ignore next */\n return typeof sizeOrArray === \"number\"\n ? util.Buffer\n ? util._Buffer_allocUnsafe(sizeOrArray)\n : new util.Array(sizeOrArray)\n : util.Buffer\n ? util._Buffer_from(sizeOrArray)\n : typeof Uint8Array === \"undefined\"\n ? sizeOrArray\n : new Uint8Array(sizeOrArray);\n};\n\n/**\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\n * @type {Constructor}\n */\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\n\n/**\n * Any compatible Long instance.\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\n * @interface Long\n * @property {number} low Low bits\n * @property {number} high High bits\n * @property {boolean} unsigned Whether unsigned or not\n */\n\n/**\n * Long.js's Long class if available.\n * @type {Constructor}\n */\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\n || /* istanbul ignore next */ util.global.Long\n || util.inquire(\"long\");\n\n/**\n * Regular expression used to verify 2 bit (`bool`) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key2Re = /^true|false|0|1$/;\n\n/**\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\n\n/**\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\n\n/**\n * Converts a number or long to an 8 characters long hash string.\n * @param {Long|number} value Value to convert\n * @returns {string} Hash\n */\nutil.longToHash = function longToHash(value) {\n return value\n ? util.LongBits.from(value).toHash()\n : util.LongBits.zeroHash;\n};\n\n/**\n * Converts an 8 characters long hash string to a long or number.\n * @param {string} hash Hash\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long|number} Original value\n */\nutil.longFromHash = function longFromHash(hash, unsigned) {\n var bits = util.LongBits.fromHash(hash);\n if (util.Long)\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\n return bits.toNumber(Boolean(unsigned));\n};\n\n/**\n * Merges the properties of the source object into the destination object.\n * @memberof util\n * @param {Object.} dst Destination object\n * @param {Object.} src Source object\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\n * @returns {Object.} Destination object\n */\nfunction merge(dst, src, ifNotSet) { // used by converters\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\n if (dst[keys[i]] === undefined || !ifNotSet)\n dst[keys[i]] = src[keys[i]];\n return dst;\n}\n\nutil.merge = merge;\n\n/**\n * Converts the first character of a string to lower case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.lcFirst = function lcFirst(str) {\n return str.charAt(0).toLowerCase() + str.substring(1);\n};\n\n/**\n * Creates a custom error constructor.\n * @memberof util\n * @param {string} name Error name\n * @returns {Constructor} Custom error constructor\n */\nfunction newError(name) {\n\n function CustomError(message, properties) {\n\n if (!(this instanceof CustomError))\n return new CustomError(message, properties);\n\n // Error.call(this, message);\n // ^ just returns a new error instance because the ctor can be called as a function\n\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\n\n /* istanbul ignore next */\n if (Error.captureStackTrace) // node\n Error.captureStackTrace(this, CustomError);\n else\n Object.defineProperty(this, \"stack\", { value: (new Error()).stack || \"\" });\n\n if (properties)\n merge(this, properties);\n }\n\n (CustomError.prototype = Object.create(Error.prototype)).constructor = CustomError;\n\n Object.defineProperty(CustomError.prototype, \"name\", { get: function() { return name; } });\n\n CustomError.prototype.toString = function toString() {\n return this.name + \": \" + this.message;\n };\n\n return CustomError;\n}\n\nutil.newError = newError;\n\n/**\n * Constructs a new protocol error.\n * @classdesc Error subclass indicating a protocol specifc error.\n * @memberof util\n * @extends Error\n * @template T extends Message\n * @constructor\n * @param {string} message Error message\n * @param {Object.} [properties] Additional properties\n * @example\n * try {\n * MyMessage.decode(someBuffer); // throws if required fields are missing\n * } catch (e) {\n * if (e instanceof ProtocolError && e.instance)\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\n * }\n */\nutil.ProtocolError = newError(\"ProtocolError\");\n\n/**\n * So far decoded message instance.\n * @name util.ProtocolError#instance\n * @type {Message}\n */\n\n/**\n * A OneOf getter as returned by {@link util.oneOfGetter}.\n * @typedef OneOfGetter\n * @type {function}\n * @returns {string|undefined} Set field name, if any\n */\n\n/**\n * Builds a getter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfGetter} Unbound getter\n */\nutil.oneOfGetter = function getOneOf(fieldNames) {\n var fieldMap = {};\n for (var i = 0; i < fieldNames.length; ++i)\n fieldMap[fieldNames[i]] = 1;\n\n /**\n * @returns {string|undefined} Set field name, if any\n * @this Object\n * @ignore\n */\n return function() { // eslint-disable-line consistent-return\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\n return keys[i];\n };\n};\n\n/**\n * A OneOf setter as returned by {@link util.oneOfSetter}.\n * @typedef OneOfSetter\n * @type {function}\n * @param {string|undefined} value Field name\n * @returns {undefined}\n */\n\n/**\n * Builds a setter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfSetter} Unbound setter\n */\nutil.oneOfSetter = function setOneOf(fieldNames) {\n\n /**\n * @param {string} name Field name\n * @returns {undefined}\n * @this Object\n * @ignore\n */\n return function(name) {\n for (var i = 0; i < fieldNames.length; ++i)\n if (fieldNames[i] !== name)\n delete this[fieldNames[i]];\n };\n};\n\n/**\n * Default conversion options used for {@link Message#toJSON} implementations.\n *\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\n *\n * - Longs become strings\n * - Enums become string keys\n * - Bytes become base64 encoded strings\n * - (Sub-)Messages become plain objects\n * - Maps become plain objects with all string keys\n * - Repeated fields become arrays\n * - NaN and Infinity for float and double fields become strings\n *\n * @type {IConversionOptions}\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\n */\nutil.toJSONOptions = {\n longs: String,\n enums: String,\n bytes: String,\n json: true\n};\n\n// Sets up buffer utility according to the environment (called in index-minimal)\nutil._configure = function() {\n var Buffer = util.Buffer;\n /* istanbul ignore if */\n if (!Buffer) {\n // util._Buffer_from = util._Buffer_allocUnsafe = null;\n util._Buffer_from = null;\n util._Buffer_allocUnsafe = function Buffer_allocUnsafe(size) {\n return new util.BufferTemp(size);\n };\n return;\n }\n // because node 4.x buffers are incompatible & immutable\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\n /* istanbul ignore next */\n function Buffer_from(value, encoding) {\n return new Buffer(value, encoding);\n };\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\n /* istanbul ignore next */\n function Buffer_allocUnsafe(size) {\n return new Buffer(size);\n };\n};\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","try {\n var util = require('util');\n /* istanbul ignore next */\n if (typeof util.inherits !== 'function') throw '';\n module.exports = util.inherits;\n} catch (e) {\n /* istanbul ignore next */\n module.exports = require('./inherits_browser.js');\n}\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nexports.inherits = inherits;\n\nfunction isSurrogatePair(msg, i) {\n if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {\n return false;\n }\n if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg === 'string') {\n if (!enc) {\n // Inspired by stringToUtf8ByteArray() in closure-library by Google\n // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n // Apache License 2.0\n // https://github.com/google/closure-library/blob/master/LICENSE\n var p = 0;\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n if (c < 128) {\n res[p++] = c;\n } else if (c < 2048) {\n res[p++] = (c >> 6) | 192;\n res[p++] = (c & 63) | 128;\n } else if (isSurrogatePair(msg, i)) {\n c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);\n res[p++] = (c >> 18) | 240;\n res[p++] = ((c >> 12) & 63) | 128;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n } else {\n res[p++] = (c >> 12) | 224;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n }\n }\n } else if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n }\n return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = (w >>> 24) |\n ((w >>> 8) & 0xff00) |\n ((w << 8) & 0xff0000) |\n ((w & 0xff) << 24);\n return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little')\n w = htonl(w);\n res += zero8(w.toString(16));\n }\n return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7)\n return '0' + word;\n else if (word.length === 6)\n return '00' + word;\n else if (word.length === 5)\n return '000' + word;\n else if (word.length === 4)\n return '0000' + word;\n else if (word.length === 3)\n return '00000' + word;\n else if (word.length === 2)\n return '000000' + word;\n else if (word.length === 1)\n return '0000000' + word;\n else\n return word;\n}\nexports.zero8 = zero8;\n\nfunction join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n var res = new Array(len / 4);\n for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big')\n w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n else\n w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n res[i] = w >>> 0;\n }\n return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n if (endian === 'big') {\n res[k] = m >>> 24;\n res[k + 1] = (m >>> 16) & 0xff;\n res[k + 2] = (m >>> 8) & 0xff;\n res[k + 3] = m & 0xff;\n } else {\n res[k + 3] = m >>> 24;\n res[k + 2] = (m >>> 16) & 0xff;\n res[k + 1] = (m >>> 8) & 0xff;\n res[k] = m & 0xff;\n }\n }\n return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n}\nexports.sum32_5 = sum32_5;\n\nfunction sum64(buf, pos, ah, al) {\n var bh = buf[pos];\n var bl = buf[pos + 1];\n\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n buf[pos] = hi >>> 0;\n buf[pos + 1] = lo;\n}\nexports.sum64 = sum64;\n\nfunction sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n}\nexports.sum64_lo = sum64_lo;\n\nfunction sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n}\nexports.sum64_4_hi = sum64_4_hi;\n\nfunction sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n}\nexports.sum64_4_lo = sum64_4_lo;\n\nfunction sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n lo = (lo + el) >>> 0;\n carry += lo < el ? 1 : 0;\n\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n}\nexports.sum64_5_hi = sum64_5_hi;\n\nfunction sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n\n return lo >>> 0;\n}\nexports.sum64_5_lo = sum64_5_lo;\n\nfunction rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n}\nexports.rotr64_hi = rotr64_hi;\n\nfunction rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\n}\nexports.shr64_hi = shr64_hi;\n\nfunction shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.shr64_lo = shr64_lo;\n",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory();\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\troot.CryptoJS = factory();\n\t}\n}(this, function () {\n\n\t/*globals window, global, require*/\n\n\t/**\n\t * CryptoJS core components.\n\t */\n\tvar CryptoJS = CryptoJS || (function (Math, undefined) {\n\n\t var crypto;\n\n\t // Native crypto from window (Browser)\n\t if (typeof window !== 'undefined' && window.crypto) {\n\t crypto = window.crypto;\n\t }\n\n\t // Native crypto in web worker (Browser)\n\t if (typeof self !== 'undefined' && self.crypto) {\n\t crypto = self.crypto;\n\t }\n\n\t // Native crypto from worker\n\t if (typeof globalThis !== 'undefined' && globalThis.crypto) {\n\t crypto = globalThis.crypto;\n\t }\n\n\t // Native (experimental IE 11) crypto from window (Browser)\n\t if (!crypto && typeof window !== 'undefined' && window.msCrypto) {\n\t crypto = window.msCrypto;\n\t }\n\n\t // Native crypto from global (NodeJS)\n\t if (!crypto && typeof global !== 'undefined' && global.crypto) {\n\t crypto = global.crypto;\n\t }\n\n\t // Native crypto import via require (NodeJS)\n\t if (!crypto && typeof require === 'function') {\n\t try {\n\t crypto = require('crypto');\n\t } catch (err) {}\n\t }\n\n\t /*\n\t * Cryptographically secure pseudorandom number generator\n\t *\n\t * As Math.random() is cryptographically not safe to use\n\t */\n\t var cryptoSecureRandomInt = function () {\n\t if (crypto) {\n\t // Use getRandomValues method (Browser)\n\t if (typeof crypto.getRandomValues === 'function') {\n\t try {\n\t return crypto.getRandomValues(new Uint32Array(1))[0];\n\t } catch (err) {}\n\t }\n\n\t // Use randomBytes method (NodeJS)\n\t if (typeof crypto.randomBytes === 'function') {\n\t try {\n\t return crypto.randomBytes(4).readInt32LE();\n\t } catch (err) {}\n\t }\n\t }\n\n\t throw new Error('Native crypto module could not be used to get secure random number.');\n\t };\n\n\t /*\n\t * Local polyfill of Object.create\n\n\t */\n\t var create = Object.create || (function () {\n\t function F() {}\n\n\t return function (obj) {\n\t var subtype;\n\n\t F.prototype = obj;\n\n\t subtype = new F();\n\n\t F.prototype = null;\n\n\t return subtype;\n\t };\n\t }());\n\n\t /**\n\t * CryptoJS namespace.\n\t */\n\t var C = {};\n\n\t /**\n\t * Library namespace.\n\t */\n\t var C_lib = C.lib = {};\n\n\t /**\n\t * Base object for prototypal inheritance.\n\t */\n\t var Base = C_lib.Base = (function () {\n\n\n\t return {\n\t /**\n\t * Creates a new object that inherits from this object.\n\t *\n\t * @param {Object} overrides Properties to copy into the new object.\n\t *\n\t * @return {Object} The new object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var MyType = CryptoJS.lib.Base.extend({\n\t * field: 'value',\n\t *\n\t * method: function () {\n\t * }\n\t * });\n\t */\n\t extend: function (overrides) {\n\t // Spawn\n\t var subtype = create(this);\n\n\t // Augment\n\t if (overrides) {\n\t subtype.mixIn(overrides);\n\t }\n\n\t // Create default initializer\n\t if (!subtype.hasOwnProperty('init') || this.init === subtype.init) {\n\t subtype.init = function () {\n\t subtype.$super.init.apply(this, arguments);\n\t };\n\t }\n\n\t // Initializer's prototype is the subtype object\n\t subtype.init.prototype = subtype;\n\n\t // Reference supertype\n\t subtype.$super = this;\n\n\t return subtype;\n\t },\n\n\t /**\n\t * Extends this object and runs the init method.\n\t * Arguments to create() will be passed to init().\n\t *\n\t * @return {Object} The new object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var instance = MyType.create();\n\t */\n\t create: function () {\n\t var instance = this.extend();\n\t instance.init.apply(instance, arguments);\n\n\t return instance;\n\t },\n\n\t /**\n\t * Initializes a newly created object.\n\t * Override this method to add some logic when your objects are created.\n\t *\n\t * @example\n\t *\n\t * var MyType = CryptoJS.lib.Base.extend({\n\t * init: function () {\n\t * // ...\n\t * }\n\t * });\n\t */\n\t init: function () {\n\t },\n\n\t /**\n\t * Copies properties into this object.\n\t *\n\t * @param {Object} properties The properties to mix in.\n\t *\n\t * @example\n\t *\n\t * MyType.mixIn({\n\t * field: 'value'\n\t * });\n\t */\n\t mixIn: function (properties) {\n\t for (var propertyName in properties) {\n\t if (properties.hasOwnProperty(propertyName)) {\n\t this[propertyName] = properties[propertyName];\n\t }\n\t }\n\n\t // IE won't copy toString using the loop above\n\t if (properties.hasOwnProperty('toString')) {\n\t this.toString = properties.toString;\n\t }\n\t },\n\n\t /**\n\t * Creates a copy of this object.\n\t *\n\t * @return {Object} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = instance.clone();\n\t */\n\t clone: function () {\n\t return this.init.prototype.extend(this);\n\t }\n\t };\n\t }());\n\n\t /**\n\t * An array of 32-bit words.\n\t *\n\t * @property {Array} words The array of 32-bit words.\n\t * @property {number} sigBytes The number of significant bytes in this word array.\n\t */\n\t var WordArray = C_lib.WordArray = Base.extend({\n\t /**\n\t * Initializes a newly created word array.\n\t *\n\t * @param {Array} words (Optional) An array of 32-bit words.\n\t * @param {number} sigBytes (Optional) The number of significant bytes in the words.\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.lib.WordArray.create();\n\t * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);\n\t * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);\n\t */\n\t init: function (words, sigBytes) {\n\t words = this.words = words || [];\n\n\t if (sigBytes != undefined) {\n\t this.sigBytes = sigBytes;\n\t } else {\n\t this.sigBytes = words.length * 4;\n\t }\n\t },\n\n\t /**\n\t * Converts this word array to a string.\n\t *\n\t * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex\n\t *\n\t * @return {string} The stringified word array.\n\t *\n\t * @example\n\t *\n\t * var string = wordArray + '';\n\t * var string = wordArray.toString();\n\t * var string = wordArray.toString(CryptoJS.enc.Utf8);\n\t */\n\t toString: function (encoder) {\n\t return (encoder || Hex).stringify(this);\n\t },\n\n\t /**\n\t * Concatenates a word array to this word array.\n\t *\n\t * @param {WordArray} wordArray The word array to append.\n\t *\n\t * @return {WordArray} This word array.\n\t *\n\t * @example\n\t *\n\t * wordArray1.concat(wordArray2);\n\t */\n\t concat: function (wordArray) {\n\t // Shortcuts\n\t var thisWords = this.words;\n\t var thatWords = wordArray.words;\n\t var thisSigBytes = this.sigBytes;\n\t var thatSigBytes = wordArray.sigBytes;\n\n\t // Clamp excess bits\n\t this.clamp();\n\n\t // Concat\n\t if (thisSigBytes % 4) {\n\t // Copy one byte at a time\n\t for (var i = 0; i < thatSigBytes; i++) {\n\t var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8);\n\t }\n\t } else {\n\t // Copy one word at a time\n\t for (var j = 0; j < thatSigBytes; j += 4) {\n\t thisWords[(thisSigBytes + j) >>> 2] = thatWords[j >>> 2];\n\t }\n\t }\n\t this.sigBytes += thatSigBytes;\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Removes insignificant bits.\n\t *\n\t * @example\n\t *\n\t * wordArray.clamp();\n\t */\n\t clamp: function () {\n\t // Shortcuts\n\t var words = this.words;\n\t var sigBytes = this.sigBytes;\n\n\t // Clamp\n\t words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);\n\t words.length = Math.ceil(sigBytes / 4);\n\t },\n\n\t /**\n\t * Creates a copy of this word array.\n\t *\n\t * @return {WordArray} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = wordArray.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\t clone.words = this.words.slice(0);\n\n\t return clone;\n\t },\n\n\t /**\n\t * Creates a word array filled with random bytes.\n\t *\n\t * @param {number} nBytes The number of random bytes to generate.\n\t *\n\t * @return {WordArray} The random word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.lib.WordArray.random(16);\n\t */\n\t random: function (nBytes) {\n\t var words = [];\n\n\t for (var i = 0; i < nBytes; i += 4) {\n\t words.push(cryptoSecureRandomInt());\n\t }\n\n\t return new WordArray.init(words, nBytes);\n\t }\n\t });\n\n\t /**\n\t * Encoder namespace.\n\t */\n\t var C_enc = C.enc = {};\n\n\t /**\n\t * Hex encoding strategy.\n\t */\n\t var Hex = C_enc.Hex = {\n\t /**\n\t * Converts a word array to a hex string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The hex string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hexString = CryptoJS.enc.Hex.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var hexChars = [];\n\t for (var i = 0; i < sigBytes; i++) {\n\t var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t hexChars.push((bite >>> 4).toString(16));\n\t hexChars.push((bite & 0x0f).toString(16));\n\t }\n\n\t return hexChars.join('');\n\t },\n\n\t /**\n\t * Converts a hex string to a word array.\n\t *\n\t * @param {string} hexStr The hex string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Hex.parse(hexString);\n\t */\n\t parse: function (hexStr) {\n\t // Shortcut\n\t var hexStrLength = hexStr.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < hexStrLength; i += 2) {\n\t words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);\n\t }\n\n\t return new WordArray.init(words, hexStrLength / 2);\n\t }\n\t };\n\n\t /**\n\t * Latin1 encoding strategy.\n\t */\n\t var Latin1 = C_enc.Latin1 = {\n\t /**\n\t * Converts a word array to a Latin1 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The Latin1 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var latin1Chars = [];\n\t for (var i = 0; i < sigBytes; i++) {\n\t var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t latin1Chars.push(String.fromCharCode(bite));\n\t }\n\n\t return latin1Chars.join('');\n\t },\n\n\t /**\n\t * Converts a Latin1 string to a word array.\n\t *\n\t * @param {string} latin1Str The Latin1 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Latin1.parse(latin1String);\n\t */\n\t parse: function (latin1Str) {\n\t // Shortcut\n\t var latin1StrLength = latin1Str.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < latin1StrLength; i++) {\n\t words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);\n\t }\n\n\t return new WordArray.init(words, latin1StrLength);\n\t }\n\t };\n\n\t /**\n\t * UTF-8 encoding strategy.\n\t */\n\t var Utf8 = C_enc.Utf8 = {\n\t /**\n\t * Converts a word array to a UTF-8 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The UTF-8 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t try {\n\t return decodeURIComponent(escape(Latin1.stringify(wordArray)));\n\t } catch (e) {\n\t throw new Error('Malformed UTF-8 data');\n\t }\n\t },\n\n\t /**\n\t * Converts a UTF-8 string to a word array.\n\t *\n\t * @param {string} utf8Str The UTF-8 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Utf8.parse(utf8String);\n\t */\n\t parse: function (utf8Str) {\n\t return Latin1.parse(unescape(encodeURIComponent(utf8Str)));\n\t }\n\t };\n\n\t /**\n\t * Abstract buffered block algorithm template.\n\t *\n\t * The property blockSize must be implemented in a concrete subtype.\n\t *\n\t * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0\n\t */\n\t var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({\n\t /**\n\t * Resets this block algorithm's data buffer to its initial state.\n\t *\n\t * @example\n\t *\n\t * bufferedBlockAlgorithm.reset();\n\t */\n\t reset: function () {\n\t // Initial values\n\t this._data = new WordArray.init();\n\t this._nDataBytes = 0;\n\t },\n\n\t /**\n\t * Adds new data to this block algorithm's buffer.\n\t *\n\t * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.\n\t *\n\t * @example\n\t *\n\t * bufferedBlockAlgorithm._append('data');\n\t * bufferedBlockAlgorithm._append(wordArray);\n\t */\n\t _append: function (data) {\n\t // Convert string to WordArray, else assume WordArray already\n\t if (typeof data == 'string') {\n\t data = Utf8.parse(data);\n\t }\n\n\t // Append\n\t this._data.concat(data);\n\t this._nDataBytes += data.sigBytes;\n\t },\n\n\t /**\n\t * Processes available data blocks.\n\t *\n\t * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.\n\t *\n\t * @param {boolean} doFlush Whether all blocks and partial blocks should be processed.\n\t *\n\t * @return {WordArray} The processed data.\n\t *\n\t * @example\n\t *\n\t * var processedData = bufferedBlockAlgorithm._process();\n\t * var processedData = bufferedBlockAlgorithm._process(!!'flush');\n\t */\n\t _process: function (doFlush) {\n\t var processedWords;\n\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\t var dataSigBytes = data.sigBytes;\n\t var blockSize = this.blockSize;\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count blocks ready\n\t var nBlocksReady = dataSigBytes / blockSizeBytes;\n\t if (doFlush) {\n\t // Round up to include partial blocks\n\t nBlocksReady = Math.ceil(nBlocksReady);\n\t } else {\n\t // Round down to include only full blocks,\n\t // less the number of blocks that must remain in the buffer\n\t nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);\n\t }\n\n\t // Count words ready\n\t var nWordsReady = nBlocksReady * blockSize;\n\n\t // Count bytes ready\n\t var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);\n\n\t // Process blocks\n\t if (nWordsReady) {\n\t for (var offset = 0; offset < nWordsReady; offset += blockSize) {\n\t // Perform concrete-algorithm logic\n\t this._doProcessBlock(dataWords, offset);\n\t }\n\n\t // Remove processed words\n\t processedWords = dataWords.splice(0, nWordsReady);\n\t data.sigBytes -= nBytesReady;\n\t }\n\n\t // Return processed words\n\t return new WordArray.init(processedWords, nBytesReady);\n\t },\n\n\t /**\n\t * Creates a copy of this object.\n\t *\n\t * @return {Object} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = bufferedBlockAlgorithm.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\t clone._data = this._data.clone();\n\n\t return clone;\n\t },\n\n\t _minBufferSize: 0\n\t });\n\n\t /**\n\t * Abstract hasher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits)\n\t */\n\t var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({\n\t /**\n\t * Configuration options.\n\t */\n\t cfg: Base.extend(),\n\n\t /**\n\t * Initializes a newly created hasher.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for this hash computation.\n\t *\n\t * @example\n\t *\n\t * var hasher = CryptoJS.algo.SHA256.create();\n\t */\n\t init: function (cfg) {\n\t // Apply config defaults\n\t this.cfg = this.cfg.extend(cfg);\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this hasher to its initial state.\n\t *\n\t * @example\n\t *\n\t * hasher.reset();\n\t */\n\t reset: function () {\n\t // Reset data buffer\n\t BufferedBlockAlgorithm.reset.call(this);\n\n\t // Perform concrete-hasher logic\n\t this._doReset();\n\t },\n\n\t /**\n\t * Updates this hasher with a message.\n\t *\n\t * @param {WordArray|string} messageUpdate The message to append.\n\t *\n\t * @return {Hasher} This hasher.\n\t *\n\t * @example\n\t *\n\t * hasher.update('message');\n\t * hasher.update(wordArray);\n\t */\n\t update: function (messageUpdate) {\n\t // Append\n\t this._append(messageUpdate);\n\n\t // Update the hash\n\t this._process();\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Finalizes the hash computation.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} messageUpdate (Optional) A final message update.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @example\n\t *\n\t * var hash = hasher.finalize();\n\t * var hash = hasher.finalize('message');\n\t * var hash = hasher.finalize(wordArray);\n\t */\n\t finalize: function (messageUpdate) {\n\t // Final message update\n\t if (messageUpdate) {\n\t this._append(messageUpdate);\n\t }\n\n\t // Perform concrete-hasher logic\n\t var hash = this._doFinalize();\n\n\t return hash;\n\t },\n\n\t blockSize: 512/32,\n\n\t /**\n\t * Creates a shortcut function to a hasher's object interface.\n\t *\n\t * @param {Hasher} hasher The hasher to create a helper for.\n\t *\n\t * @return {Function} The shortcut function.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);\n\t */\n\t _createHelper: function (hasher) {\n\t return function (message, cfg) {\n\t return new hasher.init(cfg).finalize(message);\n\t };\n\t },\n\n\t /**\n\t * Creates a shortcut function to the HMAC's object interface.\n\t *\n\t * @param {Hasher} hasher The hasher to use in this HMAC helper.\n\t *\n\t * @return {Function} The shortcut function.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);\n\t */\n\t _createHmacHelper: function (hasher) {\n\t return function (message, key) {\n\t return new C_algo.HMAC.init(hasher, key).finalize(message);\n\t };\n\t }\n\t });\n\n\t /**\n\t * Algorithm namespace.\n\t */\n\t var C_algo = C.algo = {};\n\n\t return C;\n\t}(Math));\n\n\n\treturn CryptoJS;\n\n}));","module.exports = require(\"buffer\");","\"use strict\";\nmodule.exports = Field;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = \"Field\";\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar Type; // cyclic\n\nvar ruleRe = /^required|optional|repeated$/;\n\n/**\n * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class.\n * @name Field\n * @classdesc Reflected message field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a field from a field descriptor.\n * @param {string} name Field name\n * @param {IField} json Field descriptor\n * @returns {Field} Created field\n * @throws {TypeError} If arguments are invalid\n */\nField.fromJSON = function fromJSON(name, json) {\n return new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment);\n};\n\n/**\n * Not an actual constructor. Use {@link Field} instead.\n * @classdesc Base class of all reflected message fields. This is not an actual class but here for the sake of having consistent type definitions.\n * @exports FieldBase\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction Field(name, id, type, rule, extend, options, comment) {\n\n if (util.isObject(rule)) {\n comment = extend;\n options = rule;\n rule = extend = undefined;\n } else if (util.isObject(extend)) {\n comment = options;\n options = extend;\n extend = undefined;\n }\n\n ReflectionObject.call(this, name, options);\n\n if (!util.isInteger(id) || id < 0)\n throw TypeError(\"id must be a non-negative integer\");\n\n if (!util.isString(type))\n throw TypeError(\"type must be a string\");\n\n if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase()))\n throw TypeError(\"rule must be a string rule\");\n\n if (extend !== undefined && !util.isString(extend))\n throw TypeError(\"extend must be a string\");\n\n /**\n * Field rule, if any.\n * @type {string|undefined}\n */\n this.rule = rule && rule !== \"optional\" ? rule : undefined; // toJSON\n\n /**\n * Field type.\n * @type {string}\n */\n this.type = type; // toJSON\n\n /**\n * Unique field id.\n * @type {number}\n */\n this.id = id; // toJSON, marker\n\n /**\n * Extended type if different from parent.\n * @type {string|undefined}\n */\n this.extend = extend || undefined; // toJSON\n\n /**\n * Whether this field is required.\n * @type {boolean}\n */\n this.required = rule === \"required\";\n\n /**\n * Whether this field is optional.\n * @type {boolean}\n */\n this.optional = !this.required;\n\n /**\n * Whether this field is repeated.\n * @type {boolean}\n */\n this.repeated = rule === \"repeated\";\n\n /**\n * Whether this field is a map or not.\n * @type {boolean}\n */\n this.map = false;\n\n /**\n * Message this field belongs to.\n * @type {Type|null}\n */\n this.message = null;\n\n /**\n * OneOf this field belongs to, if any,\n * @type {OneOf|null}\n */\n this.partOf = null;\n\n /**\n * The field type's default value.\n * @type {*}\n */\n this.typeDefault = null;\n\n /**\n * The field's default value on prototypes.\n * @type {*}\n */\n this.defaultValue = null;\n\n /**\n * Whether this field's value should be treated as a long.\n * @type {boolean}\n */\n this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false;\n\n /**\n * Whether this field's value is a buffer.\n * @type {boolean}\n */\n this.bytes = type === \"bytes\";\n\n /**\n * Resolved type if not a basic type.\n * @type {Type|Enum|null}\n */\n this.resolvedType = null;\n\n /**\n * Sister-field within the extended type if a declaring extension field.\n * @type {Field|null}\n */\n this.extensionField = null;\n\n /**\n * Sister-field within the declaring namespace if an extended field.\n * @type {Field|null}\n */\n this.declaringField = null;\n\n /**\n * Internally remembers whether this field is packed.\n * @type {boolean|null}\n * @private\n */\n this._packed = null;\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Determines whether this field is packed. Only relevant when repeated and working with proto2.\n * @name Field#packed\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"packed\", {\n get: function() {\n // defaults to packed=true if not explicity set to false\n if (this._packed === null)\n this._packed = this.getOption(\"packed\") !== false;\n return this._packed;\n }\n});\n\n/**\n * @override\n */\nField.prototype.setOption = function setOption(name, value, ifNotSet) {\n if (name === \"packed\") // clear cached before setting\n this._packed = null;\n return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet);\n};\n\n/**\n * Field descriptor.\n * @interface IField\n * @property {string} [rule=\"optional\"] Field rule\n * @property {string} type Field type\n * @property {number} id Field id\n * @property {Object.} [options] Field options\n */\n\n/**\n * Extension field descriptor.\n * @interface IExtensionField\n * @extends IField\n * @property {string} extend Extended type\n */\n\n/**\n * Converts this field to a field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IField} Field descriptor\n */\nField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"rule\" , this.rule !== \"optional\" && this.rule || undefined,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Resolves this field's type references.\n * @returns {Field} `this`\n * @throws {Error} If any reference cannot be resolved\n */\nField.prototype.resolve = function resolve() {\n\n if (this.resolved)\n return this;\n\n if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it\n this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type);\n if (this.resolvedType instanceof Type)\n this.typeDefault = null;\n else // instanceof Enum\n this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined\n }\n\n // use explicitly set default value if present\n if (this.options && this.options[\"default\"] != null) {\n this.typeDefault = this.options[\"default\"];\n if (this.resolvedType instanceof Enum && typeof this.typeDefault === \"string\")\n this.typeDefault = this.resolvedType.values[this.typeDefault];\n }\n\n // remove unnecessary options\n if (this.options) {\n if (this.options.packed === true || this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum))\n delete this.options.packed;\n if (!Object.keys(this.options).length)\n this.options = undefined;\n }\n\n // convert to internal data type if necesssary\n if (this.long) {\n this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === \"u\");\n\n /* istanbul ignore else */\n if (Object.freeze)\n Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it)\n\n } else if (this.bytes && typeof this.typeDefault === \"string\") {\n var buf;\n if (util.base64.test(this.typeDefault))\n util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0);\n else\n util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0);\n this.typeDefault = buf;\n }\n\n // take special care of maps and repeated fields\n if (this.map)\n this.defaultValue = util.emptyObject;\n else if (this.repeated)\n this.defaultValue = util.emptyArray;\n else\n this.defaultValue = this.typeDefault;\n\n // ensure proper value on prototype\n if (this.parent instanceof Type)\n this.parent.ctor.prototype[this.name] = this.defaultValue;\n\n return ReflectionObject.prototype.resolve.call(this);\n};\n\n/**\n * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript).\n * @typedef FieldDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} fieldName Field name\n * @returns {undefined}\n */\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"string\"|\"bool\"|\"bytes\"|Object} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @param {T} [defaultValue] Default value\n * @returns {FieldDecorator} Decorator function\n * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[]\n */\nField.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) {\n\n // submessage: decorate the submessage and use its name as the type\n if (typeof fieldType === \"function\")\n fieldType = util.decorateType(fieldType).name;\n\n // enum reference: create a reflected copy of the enum and keep reuseing it\n else if (fieldType && typeof fieldType === \"object\")\n fieldType = util.decorateEnum(fieldType).name;\n\n return function fieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new Field(fieldName, fieldId, fieldType, fieldRule, { \"default\": defaultValue }));\n };\n};\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {Constructor|string} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @returns {FieldDecorator} Decorator function\n * @template T extends Message\n * @variation 2\n */\n// like Field.d but without a default value\n\n// Sets up cyclic dependencies (called in index-light)\nField._configure = function configure(Type_) {\n Type = Type_;\n};\n","module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val)\n throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r)\n throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","\"use strict\";\nmodule.exports = ReflectionObject;\n\nReflectionObject.className = \"ReflectionObject\";\n\nvar util = require(\"./util\");\n\nvar Root; // cyclic\n\n/**\n * Constructs a new reflection object instance.\n * @classdesc Base class of all reflection objects.\n * @constructor\n * @param {string} name Object name\n * @param {Object.} [options] Declared options\n * @abstract\n */\nfunction ReflectionObject(name, options) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (options && !util.isObject(options))\n throw TypeError(\"options must be an object\");\n\n /**\n * Options.\n * @type {Object.|undefined}\n */\n this.options = options; // toJSON\n\n /**\n * Unique name within its namespace.\n * @type {string}\n */\n this.name = name;\n\n /**\n * Parent namespace.\n * @type {Namespace|null}\n */\n this.parent = null;\n\n /**\n * Whether already resolved or not.\n * @type {boolean}\n */\n this.resolved = false;\n\n /**\n * Comment text, if any.\n * @type {string|null}\n */\n this.comment = null;\n\n /**\n * Defining file name.\n * @type {string|null}\n */\n this.filename = null;\n}\n\nObject.defineProperties(ReflectionObject.prototype, {\n\n /**\n * Reference to the root namespace.\n * @name ReflectionObject#root\n * @type {Root}\n * @readonly\n */\n root: {\n get: function() {\n var ptr = this;\n while (ptr.parent !== null)\n ptr = ptr.parent;\n return ptr;\n }\n },\n\n /**\n * Full name including leading dot.\n * @name ReflectionObject#fullName\n * @type {string}\n * @readonly\n */\n fullName: {\n get: function() {\n var path = [ this.name ],\n ptr = this.parent;\n while (ptr) {\n path.unshift(ptr.name);\n ptr = ptr.parent;\n }\n return path.join(\".\");\n }\n }\n});\n\n/**\n * Converts this reflection object to its descriptor representation.\n * @returns {Object.} Descriptor\n * @abstract\n */\nReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() {\n throw Error(); // not implemented, shouldn't happen\n};\n\n/**\n * Called when this object is added to a parent.\n * @param {ReflectionObject} parent Parent added to\n * @returns {undefined}\n */\nReflectionObject.prototype.onAdd = function onAdd(parent) {\n if (this.parent && this.parent !== parent)\n this.parent.remove(this);\n this.parent = parent;\n this.resolved = false;\n var root = parent.root;\n if (root instanceof Root)\n root._handleAdd(this);\n};\n\n/**\n * Called when this object is removed from a parent.\n * @param {ReflectionObject} parent Parent removed from\n * @returns {undefined}\n */\nReflectionObject.prototype.onRemove = function onRemove(parent) {\n var root = parent.root;\n if (root instanceof Root)\n root._handleRemove(this);\n this.parent = null;\n this.resolved = false;\n};\n\n/**\n * Resolves this objects type references.\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n if (this.root instanceof Root)\n this.resolved = true; // only if part of a root\n return this;\n};\n\n/**\n * Gets an option value.\n * @param {string} name Option name\n * @returns {*} Option value or `undefined` if not set\n */\nReflectionObject.prototype.getOption = function getOption(name) {\n if (this.options)\n return this.options[name];\n return undefined;\n};\n\n/**\n * Sets an option.\n * @param {string} name Option name\n * @param {*} value Option value\n * @param {boolean} [ifNotSet] Sets the option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) {\n if (!ifNotSet || !this.options || this.options[name] === undefined)\n (this.options || (this.options = {}))[name] = value;\n return this;\n};\n\n/**\n * Sets multiple options.\n * @param {Object.} options Options to set\n * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) {\n if (options)\n for (var keys = Object.keys(options), i = 0; i < keys.length; ++i)\n this.setOption(keys[i], options[keys[i]], ifNotSet);\n return this;\n};\n\n/**\n * Converts this instance to its string representation.\n * @returns {string} Class name[, space, full name]\n */\nReflectionObject.prototype.toString = function toString() {\n var className = this.constructor.className,\n fullName = this.fullName;\n if (fullName.length)\n return className + \" \" + fullName;\n return className;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nReflectionObject._configure = function(Root_) {\n Root = Root_;\n};\n","\"use strict\";\n\n/**\n * Common type constants.\n * @namespace\n */\nvar types = exports;\n\nvar util = require(\"./util\");\n\nvar s = [\n \"double\", // 0\n \"float\", // 1\n \"int32\", // 2\n \"uint32\", // 3\n \"sint32\", // 4\n \"fixed32\", // 5\n \"sfixed32\", // 6\n \"int64\", // 7\n \"uint64\", // 8\n \"sint64\", // 9\n \"fixed64\", // 10\n \"sfixed64\", // 11\n \"bool\", // 12\n \"string\", // 13\n \"bytes\" // 14\n];\n\nfunction bake(values, offset) {\n var i = 0, o = {};\n offset |= 0;\n while (i < values.length) o[s[i + offset]] = values[i++];\n return o;\n}\n\n/**\n * Basic type wire types.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n * @property {number} bytes=2 Ldelim wire type\n */\ntypes.basic = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2,\n /* bytes */ 2\n]);\n\n/**\n * Basic type defaults.\n * @type {Object.}\n * @const\n * @property {number} double=0 Double default\n * @property {number} float=0 Float default\n * @property {number} int32=0 Int32 default\n * @property {number} uint32=0 Uint32 default\n * @property {number} sint32=0 Sint32 default\n * @property {number} fixed32=0 Fixed32 default\n * @property {number} sfixed32=0 Sfixed32 default\n * @property {number} int64=0 Int64 default\n * @property {number} uint64=0 Uint64 default\n * @property {number} sint64=0 Sint32 default\n * @property {number} fixed64=0 Fixed64 default\n * @property {number} sfixed64=0 Sfixed64 default\n * @property {boolean} bool=false Bool default\n * @property {string} string=\"\" String default\n * @property {Array.} bytes=Array(0) Bytes default\n * @property {null} message=null Message default\n */\ntypes.defaults = bake([\n /* double */ 0,\n /* float */ 0,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 0,\n /* sfixed32 */ 0,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 0,\n /* sfixed64 */ 0,\n /* bool */ false,\n /* string */ \"\",\n /* bytes */ util.emptyArray,\n /* message */ null\n]);\n\n/**\n * Basic long type wire types.\n * @type {Object.}\n * @const\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n */\ntypes.long = bake([\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1\n], 7);\n\n/**\n * Allowed types for map keys with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n */\ntypes.mapKey = bake([\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2\n], 2);\n\n/**\n * Allowed types for packed repeated fields with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n */\ntypes.packed = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0\n]);\n","'use strict';\n\nconst codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error\n }\n\n function getMessage (arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message\n } else {\n return message(arg1, arg2, arg3)\n }\n }\n\n class NodeError extends Base {\n constructor (arg1, arg2, arg3) {\n super(getMessage(arg1, arg2, arg3));\n }\n }\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n\n codes[code] = NodeError;\n}\n\n// https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n const len = expected.length;\n expected = expected.map((i) => String(i));\n if (len > 2) {\n return `one of ${thing} ${expected.slice(0, len - 1).join(', ')}, or ` +\n expected[len - 1];\n } else if (len === 2) {\n return `one of ${thing} ${expected[0]} or ${expected[1]}`;\n } else {\n return `of ${thing} ${expected[0]}`;\n }\n } else {\n return `of ${thing} ${String(expected)}`;\n }\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\nfunction startsWith(str, search, pos) {\n\treturn str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\nfunction endsWith(str, search, this_len) {\n\tif (this_len === undefined || this_len > str.length) {\n\t\tthis_len = str.length;\n\t}\n\treturn str.substring(this_len - search.length, this_len) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"'\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n let determiner;\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n let msg;\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = `The ${name} ${determiner} ${oneOf(expected, 'type')}`;\n } else {\n const type = includes(name, '.') ? 'property' : 'argument';\n msg = `The \"${name}\" ${type} ${determiner} ${oneOf(expected, 'type')}`;\n }\n\n msg += `. Received type ${typeof actual}`;\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented'\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\n\nmodule.exports.codes = codes;\n","\"use strict\";\nmodule.exports = Namespace;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = \"Namespace\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\");\n\nvar Type, // cyclic\n Service,\n Enum;\n\n/**\n * Constructs a new namespace instance.\n * @name Namespace\n * @classdesc Reflected namespace.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a namespace from JSON.\n * @memberof Namespace\n * @function\n * @param {string} name Namespace name\n * @param {Object.} json JSON object\n * @returns {Namespace} Created namespace\n * @throws {TypeError} If arguments are invalid\n */\nNamespace.fromJSON = function fromJSON(name, json) {\n return new Namespace(name, json.options).addJSON(json.nested);\n};\n\n/**\n * Converts an array of reflection objects to JSON.\n * @memberof Namespace\n * @param {ReflectionObject[]} array Object array\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {Object.|undefined} JSON object or `undefined` when array is empty\n */\nfunction arrayToJSON(array, toJSONOptions) {\n if (!(array && array.length))\n return undefined;\n var obj = {};\n for (var i = 0; i < array.length; ++i)\n obj[array[i].name] = array[i].toJSON(toJSONOptions);\n return obj;\n}\n\nNamespace.arrayToJSON = arrayToJSON;\n\n/**\n * Tests if the specified id is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedId = function isReservedId(reserved, id) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (typeof reserved[i] !== \"string\" && reserved[i][0] <= id && reserved[i][1] >= id)\n return true;\n return false;\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedName = function isReservedName(reserved, name) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (reserved[i] === name)\n return true;\n return false;\n};\n\n/**\n * Not an actual constructor. Use {@link Namespace} instead.\n * @classdesc Base class of all reflection objects containing nested objects. This is not an actual class but here for the sake of having consistent type definitions.\n * @exports NamespaceBase\n * @extends ReflectionObject\n * @abstract\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n * @see {@link Namespace}\n */\nfunction Namespace(name, options) {\n ReflectionObject.call(this, name, options);\n\n /**\n * Nested objects by name.\n * @type {Object.|undefined}\n */\n this.nested = undefined; // toJSON\n\n /**\n * Cached nested objects as an array.\n * @type {ReflectionObject[]|null}\n * @private\n */\n this._nestedArray = null;\n}\n\nfunction clearCache(namespace) {\n namespace._nestedArray = null;\n return namespace;\n}\n\n/**\n * Nested objects of this namespace as an array for iteration.\n * @name NamespaceBase#nestedArray\n * @type {ReflectionObject[]}\n * @readonly\n */\nObject.defineProperty(Namespace.prototype, \"nestedArray\", {\n get: function() {\n return this._nestedArray || (this._nestedArray = util.toArray(this.nested));\n }\n});\n\n/**\n * Namespace descriptor.\n * @interface INamespace\n * @property {Object.} [options] Namespace options\n * @property {Object.} [nested] Nested object descriptors\n */\n\n/**\n * Any extension field descriptor.\n * @typedef AnyExtensionField\n * @type {IExtensionField|IExtensionMapField}\n */\n\n/**\n * Any nested object descriptor.\n * @typedef AnyNestedObject\n * @type {IEnum|IType|IService|AnyExtensionField|INamespace}\n */\n// ^ BEWARE: VSCode hangs forever when using more than 5 types (that's why AnyExtensionField exists in the first place)\n\n/**\n * Converts this namespace to a namespace descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {INamespace} Namespace descriptor\n */\nNamespace.prototype.toJSON = function toJSON(toJSONOptions) {\n return util.toObject([\n \"options\" , this.options,\n \"nested\" , arrayToJSON(this.nestedArray, toJSONOptions)\n ]);\n};\n\n/**\n * Adds nested objects to this namespace from nested object descriptors.\n * @param {Object.} nestedJson Any nested object descriptors\n * @returns {Namespace} `this`\n */\nNamespace.prototype.addJSON = function addJSON(nestedJson) {\n var ns = this;\n /* istanbul ignore else */\n if (nestedJson) {\n for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) {\n nested = nestedJson[names[i]];\n ns.add( // most to least likely\n ( nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : nested.id !== undefined\n ? Field.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n }\n return this;\n};\n\n/**\n * Gets the nested object of the specified name.\n * @param {string} name Nested object name\n * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist\n */\nNamespace.prototype.get = function get(name) {\n return this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Gets the values of the nested {@link Enum|enum} of the specified name.\n * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`.\n * @param {string} name Nested enum name\n * @returns {Object.} Enum values\n * @throws {Error} If there is no such enum\n */\nNamespace.prototype.getEnum = function getEnum(name) {\n if (this.nested && this.nested[name] instanceof Enum)\n return this.nested[name].values;\n throw Error(\"no such enum: \" + name);\n};\n\n/**\n * Adds a nested object to this namespace.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a nested object with this name\n */\nNamespace.prototype.add = function add(object) {\n\n if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof Enum || object instanceof Service || object instanceof Namespace))\n throw TypeError(\"object must be a valid nested object\");\n\n if (!this.nested)\n this.nested = {};\n else {\n var prev = this.get(object.name);\n if (prev) {\n if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) {\n // replace plain namespace but keep existing nested elements and options\n var nested = prev.nestedArray;\n for (var i = 0; i < nested.length; ++i)\n object.add(nested[i]);\n this.remove(prev);\n if (!this.nested)\n this.nested = {};\n object.setOptions(prev.options, true);\n\n } else\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n }\n }\n this.nested[object.name] = object;\n object.onAdd(this);\n return clearCache(this);\n};\n\n/**\n * Removes a nested object from this namespace.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this namespace\n */\nNamespace.prototype.remove = function remove(object) {\n\n if (!(object instanceof ReflectionObject))\n throw TypeError(\"object must be a ReflectionObject\");\n if (object.parent !== this)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.nested[object.name];\n if (!Object.keys(this.nested).length)\n this.nested = undefined;\n\n object.onRemove(this);\n return clearCache(this);\n};\n\n/**\n * Defines additial namespaces within this one if not yet existing.\n * @param {string|string[]} path Path to create\n * @param {*} [json] Nested types to create from JSON\n * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty\n */\nNamespace.prototype.define = function define(path, json) {\n\n if (util.isString(path))\n path = path.split(\".\");\n else if (!Array.isArray(path))\n throw TypeError(\"illegal path\");\n if (path && path.length && path[0] === \"\")\n throw Error(\"path must be relative\");\n\n var ptr = this;\n while (path.length > 0) {\n var part = path.shift();\n if (ptr.nested && ptr.nested[part]) {\n ptr = ptr.nested[part];\n if (!(ptr instanceof Namespace))\n throw Error(\"path conflicts with non-namespace objects\");\n } else\n ptr.add(ptr = new Namespace(part));\n }\n if (json)\n ptr.addJSON(json);\n return ptr;\n};\n\n/**\n * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost.\n * @returns {Namespace} `this`\n */\nNamespace.prototype.resolveAll = function resolveAll() {\n var nested = this.nestedArray, i = 0;\n while (i < nested.length)\n if (nested[i] instanceof Namespace)\n nested[i++].resolveAll();\n else\n nested[i++].resolve();\n return this.resolve();\n};\n\n/**\n * Recursively looks up the reflection object matching the specified path in the scope of this namespace.\n * @param {string|string[]} path Path to look up\n * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc.\n * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n */\nNamespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) {\n\n /* istanbul ignore next */\n if (typeof filterTypes === \"boolean\") {\n parentAlreadyChecked = filterTypes;\n filterTypes = undefined;\n } else if (filterTypes && !Array.isArray(filterTypes))\n filterTypes = [ filterTypes ];\n\n if (util.isString(path) && path.length) {\n if (path === \".\")\n return this.root;\n path = path.split(\".\");\n } else if (!path.length)\n return this;\n\n // Start at root if path is absolute\n if (path[0] === \"\")\n return this.root.lookup(path.slice(1), filterTypes);\n\n // Test if the first part matches any nested object, and if so, traverse if path contains more\n var found = this.get(path[0]);\n if (found) {\n if (path.length === 1) {\n if (!filterTypes || filterTypes.indexOf(found.constructor) > -1)\n return found;\n } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true)))\n return found;\n\n // Otherwise try each nested namespace\n } else\n for (var i = 0; i < this.nestedArray.length; ++i)\n if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true)))\n return found;\n\n // If there hasn't been a match, try again at the parent\n if (this.parent === null || parentAlreadyChecked)\n return null;\n return this.parent.lookup(path, filterTypes);\n};\n\n/**\n * Looks up the reflection object at the specified path, relative to this namespace.\n * @name NamespaceBase#lookup\n * @function\n * @param {string|string[]} path Path to look up\n * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n * @variation 2\n */\n// lookup(path: string, [parentAlreadyChecked: boolean])\n\n/**\n * Looks up the {@link Type|type} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type\n * @throws {Error} If `path` does not point to a type\n */\nNamespace.prototype.lookupType = function lookupType(path) {\n var found = this.lookup(path, [ Type ]);\n if (!found)\n throw Error(\"no such type: \" + path);\n return found;\n};\n\n/**\n * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Enum} Looked up enum\n * @throws {Error} If `path` does not point to an enum\n */\nNamespace.prototype.lookupEnum = function lookupEnum(path) {\n var found = this.lookup(path, [ Enum ]);\n if (!found)\n throw Error(\"no such Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type or enum\n * @throws {Error} If `path` does not point to a type or enum\n */\nNamespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) {\n var found = this.lookup(path, [ Type, Enum ]);\n if (!found)\n throw Error(\"no such Type or Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Service|service} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Service} Looked up service\n * @throws {Error} If `path` does not point to a service\n */\nNamespace.prototype.lookupService = function lookupService(path) {\n var found = this.lookup(path, [ Service ]);\n if (!found)\n throw Error(\"no such Service '\" + path + \"' in \" + this);\n return found;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nNamespace._configure = function(Type_, Service_, Enum_) {\n Type = Type_;\n Service = Service_;\n Enum = Enum_;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/**/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/**/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});","\"use strict\";\nmodule.exports = OneOf;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = \"OneOf\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new oneof instance.\n * @classdesc Reflected oneof.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Oneof name\n * @param {string[]|Object.} [fieldNames] Field names\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction OneOf(name, fieldNames, options, comment) {\n if (!Array.isArray(fieldNames)) {\n options = fieldNames;\n fieldNames = undefined;\n }\n ReflectionObject.call(this, name, options);\n\n /* istanbul ignore if */\n if (!(fieldNames === undefined || Array.isArray(fieldNames)))\n throw TypeError(\"fieldNames must be an Array\");\n\n /**\n * Field names that belong to this oneof.\n * @type {string[]}\n */\n this.oneof = fieldNames || []; // toJSON, marker\n\n /**\n * Fields that belong to this oneof as an array for iteration.\n * @type {Field[]}\n * @readonly\n */\n this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Oneof descriptor.\n * @interface IOneOf\n * @property {Array.} oneof Oneof field names\n * @property {Object.} [options] Oneof options\n */\n\n/**\n * Constructs a oneof from a oneof descriptor.\n * @param {string} name Oneof name\n * @param {IOneOf} json Oneof descriptor\n * @returns {OneOf} Created oneof\n * @throws {TypeError} If arguments are invalid\n */\nOneOf.fromJSON = function fromJSON(name, json) {\n return new OneOf(name, json.oneof, json.options, json.comment);\n};\n\n/**\n * Converts this oneof to a oneof descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IOneOf} Oneof descriptor\n */\nOneOf.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , this.options,\n \"oneof\" , this.oneof,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Adds the fields of the specified oneof to the parent if not already done so.\n * @param {OneOf} oneof The oneof\n * @returns {undefined}\n * @inner\n * @ignore\n */\nfunction addFieldsToParent(oneof) {\n if (oneof.parent)\n for (var i = 0; i < oneof.fieldsArray.length; ++i)\n if (!oneof.fieldsArray[i].parent)\n oneof.parent.add(oneof.fieldsArray[i]);\n}\n\n/**\n * Adds a field to this oneof and removes it from its current parent, if any.\n * @param {Field} field Field to add\n * @returns {OneOf} `this`\n */\nOneOf.prototype.add = function add(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n if (field.parent && field.parent !== this.parent)\n field.parent.remove(field);\n this.oneof.push(field.name);\n this.fieldsArray.push(field);\n field.partOf = this; // field.parent remains null\n addFieldsToParent(this);\n return this;\n};\n\n/**\n * Removes a field from this oneof and puts it back to the oneof's parent.\n * @param {Field} field Field to remove\n * @returns {OneOf} `this`\n */\nOneOf.prototype.remove = function remove(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n var index = this.fieldsArray.indexOf(field);\n\n /* istanbul ignore if */\n if (index < 0)\n throw Error(field + \" is not a member of \" + this);\n\n this.fieldsArray.splice(index, 1);\n index = this.oneof.indexOf(field.name);\n\n /* istanbul ignore else */\n if (index > -1) // theoretical\n this.oneof.splice(index, 1);\n\n field.partOf = null;\n return this;\n};\n\n/**\n * @override\n */\nOneOf.prototype.onAdd = function onAdd(parent) {\n ReflectionObject.prototype.onAdd.call(this, parent);\n var self = this;\n // Collect present fields\n for (var i = 0; i < this.oneof.length; ++i) {\n var field = parent.get(this.oneof[i]);\n if (field && !field.partOf) {\n field.partOf = self;\n self.fieldsArray.push(field);\n }\n }\n // Add not yet present fields\n addFieldsToParent(this);\n};\n\n/**\n * @override\n */\nOneOf.prototype.onRemove = function onRemove(parent) {\n for (var i = 0, field; i < this.fieldsArray.length; ++i)\n if ((field = this.fieldsArray[i]).parent)\n field.parent.remove(field);\n ReflectionObject.prototype.onRemove.call(this, parent);\n};\n\n/**\n * Decorator function as returned by {@link OneOf.d} (TypeScript).\n * @typedef OneOfDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} oneofName OneOf name\n * @returns {undefined}\n */\n\n/**\n * OneOf decorator (TypeScript).\n * @function\n * @param {...string} fieldNames Field names\n * @returns {OneOfDecorator} Decorator function\n * @template T extends string\n */\nOneOf.d = function decorateOneOf() {\n var fieldNames = new Array(arguments.length),\n index = 0;\n while (index < arguments.length)\n fieldNames[index] = arguments[index++];\n return function oneOfDecorator(prototype, oneofName) {\n util.decorateType(prototype.constructor)\n .add(new OneOf(oneofName, fieldNames));\n Object.defineProperty(prototype, oneofName, {\n get: util.oneOfGetter(fieldNames),\n set: util.oneOfSetter(fieldNames)\n });\n };\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar getNAF = utils.getNAF;\nvar getJSF = utils.getJSF;\nvar assert = utils.assert;\n\nfunction BaseCurve(type, conf) {\n this.type = type;\n this.p = new BN(conf.p, 16);\n\n // Use Montgomery, when there is no fast reduction for the prime\n this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n\n // Useful for many curves\n this.zero = new BN(0).toRed(this.red);\n this.one = new BN(1).toRed(this.red);\n this.two = new BN(2).toRed(this.red);\n\n // Curve configuration, optional\n this.n = conf.n && new BN(conf.n, 16);\n this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);\n\n // Temporary arrays\n this._wnafT1 = new Array(4);\n this._wnafT2 = new Array(4);\n this._wnafT3 = new Array(4);\n this._wnafT4 = new Array(4);\n\n this._bitLength = this.n ? this.n.bitLength() : 0;\n\n // Generalized Greg Maxwell's trick\n var adjustCount = this.n && this.p.div(this.n);\n if (!adjustCount || adjustCount.cmpn(100) > 0) {\n this.redN = null;\n } else {\n this._maxwellTrick = true;\n this.redN = this.n.toRed(this.red);\n }\n}\nmodule.exports = BaseCurve;\n\nBaseCurve.prototype.point = function point() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype.validate = function validate() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles();\n\n var naf = getNAF(k, 1, this._bitLength);\n var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n\n // Translate into more windowed form\n var repr = [];\n var j;\n var nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--)\n nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n\n var a = this.jpoint(null, null, null);\n var b = this.jpoint(null, null, null);\n for (var i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++) {\n nafW = repr[j];\n if (nafW === i)\n b = b.mixedAdd(doubles.points[j]);\n else if (nafW === -i)\n b = b.mixedAdd(doubles.points[j].neg());\n }\n a = a.add(b);\n }\n return a.toP();\n};\n\nBaseCurve.prototype._wnafMul = function _wnafMul(p, k) {\n var w = 4;\n\n // Precompute window\n var nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n var wnd = nafPoints.points;\n\n // Get NAF form\n var naf = getNAF(k, w, this._bitLength);\n\n // Add `this`*(N+1) for every w-NAF index\n var acc = this.jpoint(null, null, null);\n for (var i = naf.length - 1; i >= 0; i--) {\n // Count zeroes\n for (var l = 0; i >= 0 && naf[i] === 0; i--)\n l++;\n if (i >= 0)\n l++;\n acc = acc.dblp(l);\n\n if (i < 0)\n break;\n var z = naf[i];\n assert(z !== 0);\n if (p.type === 'affine') {\n // J +- P\n if (z > 0)\n acc = acc.mixedAdd(wnd[(z - 1) >> 1]);\n else\n acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());\n } else {\n // J +- J\n if (z > 0)\n acc = acc.add(wnd[(z - 1) >> 1]);\n else\n acc = acc.add(wnd[(-z - 1) >> 1].neg());\n }\n }\n return p.type === 'affine' ? acc.toP() : acc;\n};\n\nBaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,\n points,\n coeffs,\n len,\n jacobianResult) {\n var wndWidth = this._wnafT1;\n var wnd = this._wnafT2;\n var naf = this._wnafT3;\n\n // Fill all arrays\n var max = 0;\n var i;\n var j;\n var p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n wndWidth[i] = nafPoints.wnd;\n wnd[i] = nafPoints.points;\n }\n\n // Comb small window NAFs\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1;\n var b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength);\n naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength);\n max = Math.max(naf[a].length, max);\n max = Math.max(naf[b].length, max);\n continue;\n }\n\n var comb = [\n points[a], /* 1 */\n null, /* 3 */\n null, /* 5 */\n points[b], /* 7 */\n ];\n\n // Try to avoid Projective points, if possible\n if (points[a].y.cmp(points[b].y) === 0) {\n comb[1] = points[a].add(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].add(points[b].neg());\n } else {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n }\n\n var index = [\n -3, /* -1 -1 */\n -1, /* -1 0 */\n -5, /* -1 1 */\n -7, /* 0 -1 */\n 0, /* 0 0 */\n 7, /* 0 1 */\n 5, /* 1 -1 */\n 1, /* 1 0 */\n 3, /* 1 1 */\n ];\n\n var jsf = getJSF(coeffs[a], coeffs[b]);\n max = Math.max(jsf[0].length, max);\n naf[a] = new Array(max);\n naf[b] = new Array(max);\n for (j = 0; j < max; j++) {\n var ja = jsf[0][j] | 0;\n var jb = jsf[1][j] | 0;\n\n naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];\n naf[b][j] = 0;\n wnd[a] = comb;\n }\n }\n\n var acc = this.jpoint(null, null, null);\n var tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n var k = 0;\n\n while (i >= 0) {\n var zero = true;\n for (j = 0; j < len; j++) {\n tmp[j] = naf[j][i] | 0;\n if (tmp[j] !== 0)\n zero = false;\n }\n if (!zero)\n break;\n k++;\n i--;\n }\n if (i >= 0)\n k++;\n acc = acc.dblp(k);\n if (i < 0)\n break;\n\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n p;\n if (z === 0)\n continue;\n else if (z > 0)\n p = wnd[j][(z - 1) >> 1];\n else if (z < 0)\n p = wnd[j][(-z - 1) >> 1].neg();\n\n if (p.type === 'affine')\n acc = acc.mixedAdd(p);\n else\n acc = acc.add(p);\n }\n }\n // Zeroify references\n for (i = 0; i < len; i++)\n wnd[i] = null;\n\n if (jacobianResult)\n return acc;\n else\n return acc.toP();\n};\n\nfunction BasePoint(curve, type) {\n this.curve = curve;\n this.type = type;\n this.precomputed = null;\n}\nBaseCurve.BasePoint = BasePoint;\n\nBasePoint.prototype.eq = function eq(/*other*/) {\n throw new Error('Not implemented');\n};\n\nBasePoint.prototype.validate = function validate() {\n return this.curve.validate(this);\n};\n\nBaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n\n var len = this.p.byteLength();\n\n // uncompressed, hybrid-odd, hybrid-even\n if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&\n bytes.length - 1 === 2 * len) {\n if (bytes[0] === 0x06)\n assert(bytes[bytes.length - 1] % 2 === 0);\n else if (bytes[0] === 0x07)\n assert(bytes[bytes.length - 1] % 2 === 1);\n\n var res = this.point(bytes.slice(1, 1 + len),\n bytes.slice(1 + len, 1 + 2 * len));\n\n return res;\n } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&\n bytes.length - 1 === len) {\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);\n }\n throw new Error('Unknown point format');\n};\n\nBasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {\n return this.encode(enc, true);\n};\n\nBasePoint.prototype._encode = function _encode(compact) {\n var len = this.curve.p.byteLength();\n var x = this.getX().toArray('be', len);\n\n if (compact)\n return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);\n\n return [ 0x04 ].concat(x, this.getY().toArray('be', len));\n};\n\nBasePoint.prototype.encode = function encode(enc, compact) {\n return utils.encode(this._encode(compact), enc);\n};\n\nBasePoint.prototype.precompute = function precompute(power) {\n if (this.precomputed)\n return this;\n\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n precomputed.naf = this._getNAFPoints(8);\n precomputed.doubles = this._getDoubles(4, power);\n precomputed.beta = this._getBeta();\n this.precomputed = precomputed;\n\n return this;\n};\n\nBasePoint.prototype._hasDoubles = function _hasDoubles(k) {\n if (!this.precomputed)\n return false;\n\n var doubles = this.precomputed.doubles;\n if (!doubles)\n return false;\n\n return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);\n};\n\nBasePoint.prototype._getDoubles = function _getDoubles(step, power) {\n if (this.precomputed && this.precomputed.doubles)\n return this.precomputed.doubles;\n\n var doubles = [ this ];\n var acc = this;\n for (var i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++)\n acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step: step,\n points: doubles,\n };\n};\n\nBasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {\n if (this.precomputed && this.precomputed.naf)\n return this.precomputed.naf;\n\n var res = [ this ];\n var max = (1 << wnd) - 1;\n var dbl = max === 1 ? null : this.dbl();\n for (var i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd: wnd,\n points: res,\n };\n};\n\nBasePoint.prototype._getBeta = function _getBeta() {\n return null;\n};\n\nBasePoint.prototype.dblp = function dblp(k) {\n var r = this;\n for (var i = 0; i < k; i++)\n r = r.dbl();\n return r;\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n this.pending = null;\n this.pendingTotal = 0;\n this.blockSize = this.constructor.blockSize;\n this.outSize = this.constructor.outSize;\n this.hmacStrength = this.constructor.hmacStrength;\n this.padLength = this.constructor.padLength / 8;\n this.endian = 'big';\n\n this._delta8 = this.blockSize / 8;\n this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n // Convert message to array, pad it, and join into 32bit blocks\n msg = utils.toArray(msg, enc);\n if (!this.pending)\n this.pending = msg;\n else\n this.pending = this.pending.concat(msg);\n this.pendingTotal += msg.length;\n\n // Enough data, try updating\n if (this.pending.length >= this._delta8) {\n msg = this.pending;\n\n // Process pending data in blocks\n var r = msg.length % this._delta8;\n this.pending = msg.slice(msg.length - r, msg.length);\n if (this.pending.length === 0)\n this.pending = null;\n\n msg = utils.join32(msg, 0, msg.length - r, this.endian);\n for (var i = 0; i < msg.length; i += this._delta32)\n this._update(msg, i, i + this._delta32);\n }\n\n return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n this.update(this._pad());\n assert(this.pending === null);\n\n return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n var len = this.pendingTotal;\n var bytes = this._delta8;\n var k = bytes - ((len + this.padLength) % bytes);\n var res = new Array(k + this.padLength);\n res[0] = 0x80;\n for (var i = 1; i < k; i++)\n res[i] = 0;\n\n // Append length\n len <<= 3;\n if (this.endian === 'big') {\n for (var t = 8; t < this.padLength; t++)\n res[i++] = 0;\n\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = len & 0xff;\n } else {\n res[i++] = len & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n\n for (t = 8; t < this.padLength; t++)\n res[i++] = 0;\n }\n\n return res;\n};\n","\"use strict\";\nmodule.exports = Writer;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferWriter; // cyclic\n\nvar LongBits = util.LongBits,\n base64 = util.base64,\n utf8 = util.utf8;\n\n/**\n * Constructs a new writer operation instance.\n * @classdesc Scheduled writer operation.\n * @constructor\n * @param {function(*, Uint8Array, number)} fn Function to call\n * @param {number} len Value byte length\n * @param {*} val Value to write\n * @ignore\n */\nfunction Op(fn, len, val) {\n\n /**\n * Function to call.\n * @type {function(Uint8Array, number, *)}\n */\n this.fn = fn;\n\n /**\n * Value byte length.\n * @type {number}\n */\n this.len = len;\n\n /**\n * Next operation.\n * @type {Writer.Op|undefined}\n */\n this.next = undefined;\n\n /**\n * Value to write.\n * @type {*}\n */\n this.val = val; // type varies\n}\n\n/* istanbul ignore next */\nfunction noop() {} // eslint-disable-line no-empty-function\n\n/**\n * Constructs a new writer state instance.\n * @classdesc Copied writer state.\n * @memberof Writer\n * @constructor\n * @param {Writer} writer Writer to copy state from\n * @ignore\n */\nfunction State(writer) {\n\n /**\n * Current head.\n * @type {Writer.Op}\n */\n this.head = writer.head;\n\n /**\n * Current tail.\n * @type {Writer.Op}\n */\n this.tail = writer.tail;\n\n /**\n * Current buffer length.\n * @type {number}\n */\n this.len = writer.len;\n\n /**\n * Next state.\n * @type {State|null}\n */\n this.next = writer.states;\n}\n\n/**\n * Constructs a new writer instance.\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n */\nfunction Writer() {\n\n /**\n * Current length.\n * @type {number}\n */\n this.len = 0;\n\n /**\n * Operations head.\n * @type {Object}\n */\n this.head = new Op(noop, 0, 0);\n\n /**\n * Operations tail\n * @type {Object}\n */\n this.tail = this.head;\n\n /**\n * Linked forked states.\n * @type {Object|null}\n */\n this.states = null;\n\n // When a value is written, the writer calculates its byte length and puts it into a linked\n // list of operations to perform when finish() is called. This both allows us to allocate\n // buffers of the exact required size and reduces the amount of work we have to do compared\n // to first calculating over objects and then encoding over objects. In our case, the encoding\n // part is just a linked list walk calling operations with already prepared values.\n}\n\n/**\n * Creates a new writer.\n * @function\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\n */\nWriter.create = util.Buffer\n ? function create_buffer_setup() {\n return (Writer.create = function create_buffer() {\n return new BufferWriter();\n })();\n }\n /* istanbul ignore next */\n : function create_array() {\n return new Writer();\n };\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Uint8Array} Buffer\n */\nWriter.alloc = function alloc(size) {\n return new util.Array(size);\n};\n\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\n/* istanbul ignore else */\nif (util.Array !== Array)\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\n\n/**\n * Pushes a new operation to the queue.\n * @param {function(Uint8Array, number, *)} fn Function to call\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @returns {Writer} `this`\n * @private\n */\nWriter.prototype._push = function push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n};\n\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\n\nfunction writeVarint32(val, buf, pos) {\n while (val > 127) {\n buf[pos++] = val & 127 | 128;\n val >>>= 7;\n }\n buf[pos] = val;\n}\n\n/**\n * Constructs a new varint writer operation instance.\n * @classdesc Scheduled varint writer operation.\n * @extends Op\n * @constructor\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @ignore\n */\nfunction VarintOp(len, val) {\n this.len = len;\n this.next = undefined;\n this.val = val;\n}\n\nVarintOp.prototype = Object.create(Op.prototype);\nVarintOp.prototype.fn = writeVarint32;\n\n/**\n * Writes an unsigned 32 bit value as a varint.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.uint32 = function write_uint32(value) {\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\n // uint32 is by far the most frequently used operation and benefits significantly from this.\n this.len += (this.tail = this.tail.next = new VarintOp(\n (value = value >>> 0)\n < 128 ? 1\n : value < 16384 ? 2\n : value < 2097152 ? 3\n : value < 268435456 ? 4\n : 5,\n value)).len;\n return this;\n};\n\n/**\n * Writes a signed 32 bit value as a varint.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.int32 = function write_int32(value) {\n return value < 0\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\n : this.uint32(value);\n};\n\n/**\n * Writes a 32 bit value as a varint, zig-zag encoded.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sint32 = function write_sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n};\n\nfunction writeVarint64(val, buf, pos) {\n while (val.hi) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\n val.hi >>>= 7;\n }\n while (val.lo > 127) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = val.lo >>> 7;\n }\n buf[pos++] = val.lo;\n}\n\n/**\n * Writes an unsigned 64 bit value as a varint.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.uint64 = function write_uint64(value) {\n var bits = LongBits.from(value);\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a signed 64 bit value as a varint.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.int64 = Writer.prototype.uint64;\n\n/**\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sint64 = function write_sint64(value) {\n var bits = LongBits.from(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a boolish value as a varint.\n * @param {boolean} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bool = function write_bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n};\n\nfunction writeFixed32(val, buf, pos) {\n buf[pos ] = val & 255;\n buf[pos + 1] = val >>> 8 & 255;\n buf[pos + 2] = val >>> 16 & 255;\n buf[pos + 3] = val >>> 24;\n}\n\n/**\n * Writes an unsigned 32 bit value as fixed 32 bits.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.fixed32 = function write_fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n};\n\n/**\n * Writes a signed 32 bit value as fixed 32 bits.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\n\n/**\n * Writes an unsigned 64 bit value as fixed 64 bits.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.fixed64 = function write_fixed64(value) {\n var bits = LongBits.from(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n};\n\n/**\n * Writes a signed 64 bit value as fixed 64 bits.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\n\n/**\n * Writes a float (32 bit).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.float = function write_float(value) {\n return this._push(util.float.writeFloatLE, 4, value);\n};\n\n/**\n * Writes a double (64 bit float).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.double = function write_double(value) {\n return this._push(util.float.writeDoubleLE, 8, value);\n};\n\nvar writeBytes = util.Array.prototype.set\n ? function writeBytes_set(val, buf, pos) {\n buf.set(val, pos); // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytes_for(val, buf, pos) {\n for (var i = 0; i < val.length; ++i)\n buf[pos + i] = val[i];\n };\n\n/**\n * Writes a sequence of bytes.\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bytes = function write_bytes(value) {\n var len = value.length >>> 0;\n if (!len)\n return this._push(writeByte, 1, 0);\n if (util.isString(value)) {\n var buf = Writer.alloc(len = base64.length(value));\n base64.decode(value, buf, 0);\n value = buf;\n }\n return this.uint32(len)._push(writeBytes, len, value);\n};\n\n/**\n * Writes a string.\n * @param {string} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.string = function write_string(value) {\n var len = utf8.length(value);\n return len\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n};\n\n/**\n * Forks this writer's state by pushing it to a stack.\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\n * @returns {Writer} `this`\n */\nWriter.prototype.fork = function fork() {\n this.states = new State(this);\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n return this;\n};\n\n/**\n * Resets this instance to the last state.\n * @returns {Writer} `this`\n */\nWriter.prototype.reset = function reset() {\n if (this.states) {\n this.head = this.states.head;\n this.tail = this.states.tail;\n this.len = this.states.len;\n this.states = this.states.next;\n } else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n};\n\n/**\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\n * @returns {Writer} `this`\n */\nWriter.prototype.ldelim = function ldelim() {\n var head = this.head,\n tail = this.tail,\n len = this.len;\n this.reset().uint32(len);\n if (len) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n};\n\n/**\n * Finishes the write operation.\n * @returns {Uint8Array} Finished buffer\n */\nWriter.prototype.finish = function finish() {\n var head = this.head.next, // skip noop\n buf = this.constructor.alloc(this.len),\n pos = 0;\n while (head) {\n head.fn(head.val, buf, pos);\n pos += head.len;\n head = head.next;\n }\n // this.head = this.tail = null;\n return buf;\n};\n\nWriter._configure = function(BufferWriter_) {\n BufferWriter = BufferWriter_;\n};\n","\"use strict\";\nmodule.exports = Reader;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferReader; // cyclic\n\nvar LongBits = util.LongBits,\n utf8 = util.utf8;\n\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\n}\n\n/**\n * Constructs a new reader instance using the specified buffer.\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n * @param {Uint8Array} buffer Buffer to read from\n */\nfunction Reader(buffer) {\n\n /**\n * Read buffer.\n * @type {Uint8Array}\n */\n this.buf = buffer;\n\n /**\n * Read buffer position.\n * @type {number}\n */\n this.pos = 0;\n\n /**\n * Read buffer length.\n * @type {number}\n */\n this.len = buffer.length;\n}\n\nvar create_array = typeof Uint8Array !== \"undefined\"\n ? function create_typed_array(buffer) {\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n }\n /* istanbul ignore next */\n : function create_array(buffer) {\n if (Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n };\n\n/**\n * Creates a new reader using the specified buffer.\n * @function\n * @param {Uint8Array|Buffer} buffer Buffer to read from\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\n * @throws {Error} If `buffer` is not a valid buffer\n */\nReader.create = util.Buffer\n ? function create_buffer_setup(buffer) {\n return (Reader.create = function create_buffer(buffer) {\n return util.Buffer.isBuffer(buffer)\n ? new BufferReader(buffer)\n /* istanbul ignore next */\n : create_array(buffer);\n })(buffer);\n }\n /* istanbul ignore next */\n : create_array;\n\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\n\n/**\n * Reads a varint as an unsigned 32 bit value.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.uint32 = (function read_uint32_setup() {\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\n return function read_uint32() {\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\n\n /* istanbul ignore if */\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n };\n})();\n\n/**\n * Reads a varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.int32 = function read_int32() {\n return this.uint32() | 0;\n};\n\n/**\n * Reads a zig-zag encoded varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.sint32 = function read_sint32() {\n var value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readLongVarint() {\n // tends to deopt with local vars for octet etc.\n var bits = new LongBits(0, 0);\n var i = 0;\n if (this.len - this.pos > 4) { // fast route (lo)\n for (; i < 4; ++i) {\n // 1st..4th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n // 5th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n i = 0;\n } else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n // 1st..3th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n // 4th\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\n return bits;\n }\n if (this.len - this.pos > 4) { // fast route (hi)\n for (; i < 5; ++i) {\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n } else {\n for (; i < 5; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n }\n /* istanbul ignore next */\n throw Error(\"invalid varint encoding\");\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads a varint as a signed 64 bit value.\n * @name Reader#int64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as an unsigned 64 bit value.\n * @name Reader#uint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a zig-zag encoded varint as a signed 64 bit value.\n * @name Reader#sint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as a boolean.\n * @returns {boolean} Value read\n */\nReader.prototype.bool = function read_bool() {\n return this.uint32() !== 0;\n};\n\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\n return (buf[end - 4]\n | buf[end - 3] << 8\n | buf[end - 2] << 16\n | buf[end - 1] << 24) >>> 0;\n}\n\n/**\n * Reads fixed 32 bits as an unsigned 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.fixed32 = function read_fixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4);\n};\n\n/**\n * Reads fixed 32 bits as a signed 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.sfixed32 = function read_sfixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readFixed64(/* this: Reader */) {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 8);\n\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads fixed 64 bits.\n * @name Reader#fixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads zig-zag encoded fixed 64 bits.\n * @name Reader#sfixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a float (32 bit) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.float = function read_float() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n};\n\n/**\n * Reads a double (64 bit float) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.double = function read_double() {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @returns {Uint8Array} Value read\n */\nReader.prototype.bytes = function read_bytes() {\n var length = this.uint32(),\n start = this.pos,\n end = this.pos + length;\n\n /* istanbul ignore if */\n if (end > this.len)\n throw indexOutOfRange(this, length);\n\n this.pos += length;\n if (Array.isArray(this.buf)) // plain array\n return this.buf.slice(start, end);\n return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\n ? new this.buf.constructor(0)\n : this._slice.call(this.buf, start, end);\n};\n\n/**\n * Reads a string preceeded by its byte length as a varint.\n * @returns {string} Value read\n */\nReader.prototype.string = function read_string() {\n var bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n};\n\n/**\n * Skips the specified number of bytes if specified, otherwise skips a varint.\n * @param {number} [length] Length if known, otherwise a varint is assumed\n * @returns {Reader} `this`\n */\nReader.prototype.skip = function skip(length) {\n if (typeof length === \"number\") {\n /* istanbul ignore if */\n if (this.pos + length > this.len)\n throw indexOutOfRange(this, length);\n this.pos += length;\n } else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n } while (this.buf[this.pos++] & 128);\n }\n return this;\n};\n\n/**\n * Skips the next element of the specified wire type.\n * @param {number} wireType Wire type received\n * @returns {Reader} `this`\n */\nReader.prototype.skipType = function(wireType) {\n switch (wireType) {\n case 0:\n this.skip();\n break;\n case 1:\n this.skip(8);\n break;\n case 2:\n this.skip(this.uint32());\n break;\n case 3:\n while ((wireType = this.uint32() & 7) !== 4) {\n this.skipType(wireType);\n }\n break;\n case 5:\n this.skip(4);\n break;\n\n /* istanbul ignore next */\n default:\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\n }\n return this;\n};\n\nReader._configure = function(BufferReader_) {\n BufferReader = BufferReader_;\n\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\n util.merge(Reader.prototype, {\n\n int64: function read_int64() {\n return readLongVarint.call(this)[fn](false);\n },\n\n uint64: function read_uint64() {\n return readLongVarint.call(this)[fn](true);\n },\n\n sint64: function read_sint64() {\n return readLongVarint.call(this).zzDecode()[fn](false);\n },\n\n fixed64: function read_fixed64() {\n return readFixed64.call(this)[fn](true);\n },\n\n sfixed64: function read_sfixed64() {\n return readFixed64.call(this)[fn](false);\n }\n\n });\n};\n","\"use strict\";\nmodule.exports = Type;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = \"Type\";\n\nvar Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n Service = require(\"./service\"),\n Message = require(\"./message\"),\n Reader = require(\"./reader\"),\n Writer = require(\"./writer\"),\n util = require(\"./util\"),\n encoder = require(\"./encoder\"),\n decoder = require(\"./decoder\"),\n verifier = require(\"./verifier\"),\n converter = require(\"./converter\"),\n wrappers = require(\"./wrappers\");\n\n/**\n * Constructs a new reflected message type instance.\n * @classdesc Reflected message type.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Message name\n * @param {Object.} [options] Declared options\n */\nfunction Type(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Message fields.\n * @type {Object.}\n */\n this.fields = {}; // toJSON, marker\n\n /**\n * Oneofs declared within this namespace, if any.\n * @type {Object.}\n */\n this.oneofs = undefined; // toJSON\n\n /**\n * Extension ranges, if any.\n * @type {number[][]}\n */\n this.extensions = undefined; // toJSON\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n /*?\n * Whether this type is a legacy group.\n * @type {boolean|undefined}\n */\n this.group = undefined; // toJSON\n\n /**\n * Cached fields by id.\n * @type {Object.|null}\n * @private\n */\n this._fieldsById = null;\n\n /**\n * Cached fields as an array.\n * @type {Field[]|null}\n * @private\n */\n this._fieldsArray = null;\n\n /**\n * Cached oneofs as an array.\n * @type {OneOf[]|null}\n * @private\n */\n this._oneofsArray = null;\n\n /**\n * Cached constructor.\n * @type {Constructor<{}>}\n * @private\n */\n this._ctor = null;\n}\n\nObject.defineProperties(Type.prototype, {\n\n /**\n * Message fields by id.\n * @name Type#fieldsById\n * @type {Object.}\n * @readonly\n */\n fieldsById: {\n get: function() {\n\n /* istanbul ignore if */\n if (this._fieldsById)\n return this._fieldsById;\n\n this._fieldsById = {};\n for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) {\n var field = this.fields[names[i]],\n id = field.id;\n\n /* istanbul ignore if */\n if (this._fieldsById[id])\n throw Error(\"duplicate id \" + id + \" in \" + this);\n\n this._fieldsById[id] = field;\n }\n return this._fieldsById;\n }\n },\n\n /**\n * Fields of this message as an array for iteration.\n * @name Type#fieldsArray\n * @type {Field[]}\n * @readonly\n */\n fieldsArray: {\n get: function() {\n return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields));\n }\n },\n\n /**\n * Oneofs of this message as an array for iteration.\n * @name Type#oneofsArray\n * @type {OneOf[]}\n * @readonly\n */\n oneofsArray: {\n get: function() {\n return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs));\n }\n },\n\n /**\n * The registered constructor, if any registered, otherwise a generic constructor.\n * Assigning a function replaces the internal constructor. If the function does not extend {@link Message} yet, its prototype will be setup accordingly and static methods will be populated. If it already extends {@link Message}, it will just replace the internal constructor.\n * @name Type#ctor\n * @type {Constructor<{}>}\n */\n ctor: {\n get: function() {\n return this._ctor || (this.ctor = Type.generateConstructor(this)());\n },\n set: function(ctor) {\n\n // Ensure proper prototype\n var prototype = ctor.prototype;\n if (!(prototype instanceof Message)) {\n (ctor.prototype = new Message()).constructor = ctor;\n util.merge(ctor.prototype, prototype);\n }\n\n // Classes and messages reference their reflected type\n ctor.$type = ctor.prototype.$type = this;\n\n // Mix in static methods\n util.merge(ctor, Message, true);\n\n this._ctor = ctor;\n\n // Messages have non-enumerable default values on their prototype\n var i = 0;\n for (; i < /* initializes */ this.fieldsArray.length; ++i)\n this._fieldsArray[i].resolve(); // ensures a proper value\n\n // Messages have non-enumerable getters and setters for each virtual oneof field\n var ctorProperties = {};\n for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i)\n ctorProperties[this._oneofsArray[i].resolve().name] = {\n get: util.oneOfGetter(this._oneofsArray[i].oneof),\n set: util.oneOfSetter(this._oneofsArray[i].oneof)\n };\n if (i)\n Object.defineProperties(ctor.prototype, ctorProperties);\n }\n }\n});\n\n/**\n * Generates a constructor function for the specified type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nType.generateConstructor = function generateConstructor(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"p\"], mtype.name);\n // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype\n for (var i = 0, field; i < mtype.fieldsArray.length; ++i)\n if ((field = mtype._fieldsArray[i]).map) gen\n (\"this%s={}\", util.safeProp(field.name));\n else if (field.repeated) gen\n (\"this%s=[]\", util.safeProp(field.name));\n return gen\n (\"if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors\n * @property {Object.} fields Field descriptors\n * @property {number[][]} [extensions] Extension ranges\n * @property {number[][]} [reserved] Reserved ranges\n * @property {boolean} [group=false] Whether a legacy group or not\n */\n\n/**\n * Creates a message type from a message type descriptor.\n * @param {string} name Message name\n * @param {IType} json Message type descriptor\n * @returns {Type} Created message type\n */\nType.fromJSON = function fromJSON(name, json) {\n var type = new Type(name, json.options);\n type.extensions = json.extensions;\n type.reserved = json.reserved;\n var names = Object.keys(json.fields),\n i = 0;\n for (; i < names.length; ++i)\n type.add(\n ( typeof json.fields[names[i]].keyType !== \"undefined\"\n ? MapField.fromJSON\n : Field.fromJSON )(names[i], json.fields[names[i]])\n );\n if (json.oneofs)\n for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i)\n type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]]));\n if (json.nested)\n for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) {\n var nested = json.nested[names[i]];\n type.add( // most to least likely\n ( nested.id !== undefined\n ? Field.fromJSON\n : nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n if (json.extensions && json.extensions.length)\n type.extensions = json.extensions;\n if (json.reserved && json.reserved.length)\n type.reserved = json.reserved;\n if (json.group)\n type.group = true;\n if (json.comment)\n type.comment = json.comment;\n return type;\n};\n\n/**\n * Converts this message type to a message type descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IType} Message type descriptor\n */\nType.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , inherited && inherited.options || undefined,\n \"oneofs\" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions),\n \"fields\" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {},\n \"extensions\" , this.extensions && this.extensions.length ? this.extensions : undefined,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"group\" , this.group || undefined,\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nType.prototype.resolveAll = function resolveAll() {\n var fields = this.fieldsArray, i = 0;\n while (i < fields.length)\n fields[i++].resolve();\n var oneofs = this.oneofsArray; i = 0;\n while (i < oneofs.length)\n oneofs[i++].resolve();\n return Namespace.prototype.resolveAll.call(this);\n};\n\n/**\n * @override\n */\nType.prototype.get = function get(name) {\n return this.fields[name]\n || this.oneofs && this.oneofs[name]\n || this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Adds a nested object to this type.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a nested object with this name or, if a field, when there is already a field with this id\n */\nType.prototype.add = function add(object) {\n\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Field && object.extend === undefined) {\n // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects.\n // The root object takes care of adding distinct sister-fields to the respective extended\n // type instead.\n\n // avoids calling the getter if not absolutely necessary because it's called quite frequently\n if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id])\n throw Error(\"duplicate id \" + object.id + \" in \" + this);\n if (this.isReservedId(object.id))\n throw Error(\"id \" + object.id + \" is reserved in \" + this);\n if (this.isReservedName(object.name))\n throw Error(\"name '\" + object.name + \"' is reserved in \" + this);\n\n if (object.parent)\n object.parent.remove(object);\n this.fields[object.name] = object;\n object.message = this;\n object.onAdd(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n if (!this.oneofs)\n this.oneofs = {};\n this.oneofs[object.name] = object;\n object.onAdd(this);\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * Removes a nested object from this type.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this type\n */\nType.prototype.remove = function remove(object) {\n if (object instanceof Field && object.extend === undefined) {\n // See Type#add for the reason why extension fields are excluded here.\n\n /* istanbul ignore if */\n if (!this.fields || this.fields[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.fields[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n\n /* istanbul ignore if */\n if (!this.oneofs || this.oneofs[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.oneofs[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\n};\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message<{}>} Message instance\n */\nType.prototype.create = function create(properties) {\n return new this.ctor(properties);\n};\n\n/**\n * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}.\n * @returns {Type} `this`\n */\nType.prototype.setup = function setup() {\n // Sets up everything at once so that the prototype chain does not have to be re-evaluated\n // multiple times (V8, soft-deopt prototype-check).\n\n var fullName = this.fullName,\n types = [];\n for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i)\n types.push(this._fieldsArray[i].resolve().resolvedType);\n\n // Replace setup methods with type-specific generated functions\n this.encode = encoder(this)({\n Writer : Writer,\n types : types,\n util : util\n });\n this.decode = decoder(this)({\n Reader : Reader,\n types : types,\n util : util\n });\n this.verify = verifier(this)({\n types : types,\n util : util\n });\n this.fromObject = converter.fromObject(this)({\n types : types,\n util : util\n });\n this.toObject = converter.toObject(this)({\n types : types,\n util : util\n });\n\n // Inject custom wrappers for common types\n var wrapper = wrappers[fullName];\n if (wrapper) {\n var originalThis = Object.create(this);\n // if (wrapper.fromObject) {\n originalThis.fromObject = this.fromObject;\n this.fromObject = wrapper.fromObject.bind(originalThis);\n // }\n // if (wrapper.toObject) {\n originalThis.toObject = this.toObject;\n this.toObject = wrapper.toObject.bind(originalThis);\n // }\n }\n\n return this;\n};\n\n/**\n * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encode = function encode_setup(message, writer) {\n return this.setup().encode(message, writer); // overrides this method\n};\n\n/**\n * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim();\n};\n\n/**\n * Decodes a message of this type.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Length of the message, if known beforehand\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError<{}>} If required fields are missing\n */\nType.prototype.decode = function decode_setup(reader, length) {\n return this.setup().decode(reader, length); // overrides this method\n};\n\n/**\n * Decodes a message of this type preceeded by its byte length as a varint.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError} If required fields are missing\n */\nType.prototype.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof Reader))\n reader = Reader.create(reader);\n return this.decode(reader, reader.uint32());\n};\n\n/**\n * Verifies that field values are valid and that required fields are present.\n * @param {Object.} message Plain object to verify\n * @returns {null|string} `null` if valid, otherwise the reason why it is not\n */\nType.prototype.verify = function verify_setup(message) {\n return this.setup().verify(message); // overrides this method\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object to convert\n * @returns {Message<{}>} Message instance\n */\nType.prototype.fromObject = function fromObject(object) {\n return this.setup().fromObject(object);\n};\n\n/**\n * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}.\n * @interface IConversionOptions\n * @property {Function} [longs] Long conversion type.\n * Valid values are `String` and `Number` (the global types).\n * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library.\n * @property {Function} [enums] Enum value conversion type.\n * Only valid value is `String` (the global type).\n * Defaults to copy the present value, which is the numeric id.\n * @property {Function} [bytes] Bytes value conversion type.\n * Valid values are `Array` and (a base64 encoded) `String` (the global types).\n * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser.\n * @property {boolean} [defaults=false] Also sets default values on the resulting object\n * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false`\n * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false`\n * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any\n * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings\n */\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n */\nType.prototype.toObject = function toObject(message, options) {\n return this.setup().toObject(message, options);\n};\n\n/**\n * Decorator function as returned by {@link Type.d} (TypeScript).\n * @typedef TypeDecorator\n * @type {function}\n * @param {Constructor} target Target constructor\n * @returns {undefined}\n * @template T extends Message\n */\n\n/**\n * Type decorator (TypeScript).\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {TypeDecorator} Decorator function\n * @template T extends Message\n */\nType.d = function decorateType(typeName) {\n return function typeDecorator(target) {\n util.decorateType(target, typeName);\n };\n};\n","\"use strict\";\nmodule.exports = MapField;\n\n// extends Field\nvar Field = require(\"./field\");\n((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = \"MapField\";\n\nvar types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new map field instance.\n * @classdesc Reflected map field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} keyType Key type\n * @param {string} type Value type\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction MapField(name, id, keyType, type, options, comment) {\n Field.call(this, name, id, type, undefined, undefined, options, comment);\n\n /* istanbul ignore if */\n if (!util.isString(keyType))\n throw TypeError(\"keyType must be a string\");\n\n /**\n * Key type.\n * @type {string}\n */\n this.keyType = keyType; // toJSON, marker\n\n /**\n * Resolved key type if not a basic type.\n * @type {ReflectionObject|null}\n */\n this.resolvedKeyType = null;\n\n // Overrides Field#map\n this.map = true;\n}\n\n/**\n * Map field descriptor.\n * @interface IMapField\n * @extends {IField}\n * @property {string} keyType Key type\n */\n\n/**\n * Extension map field descriptor.\n * @interface IExtensionMapField\n * @extends IMapField\n * @property {string} extend Extended type\n */\n\n/**\n * Constructs a map field from a map field descriptor.\n * @param {string} name Field name\n * @param {IMapField} json Map field descriptor\n * @returns {MapField} Created map field\n * @throws {TypeError} If arguments are invalid\n */\nMapField.fromJSON = function fromJSON(name, json) {\n return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment);\n};\n\n/**\n * Converts this map field to a map field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMapField} Map field descriptor\n */\nMapField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"keyType\" , this.keyType,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nMapField.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n\n // Besides a value type, map fields have a key type that may be \"any scalar type except for floating point types and bytes\"\n if (types.mapKey[this.keyType] === undefined)\n throw Error(\"invalid key type: \" + this.keyType);\n\n return Field.prototype.resolve.call(this);\n};\n\n/**\n * Map field decorator (TypeScript).\n * @name MapField.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"} fieldKeyType Field key type\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"|\"bytes\"|Object|Constructor<{}>} fieldValueType Field value type\n * @returns {FieldDecorator} Decorator function\n * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> }\n */\nMapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) {\n\n // submessage value: decorate the submessage and use its name as the type\n if (typeof fieldValueType === \"function\")\n fieldValueType = util.decorateType(fieldValueType).name;\n\n // enum reference value: create a reflected copy of the enum and keep reuseing it\n else if (fieldValueType && typeof fieldValueType === \"object\")\n fieldValueType = util.decorateEnum(fieldValueType).name;\n\n return function mapFieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType));\n };\n};\n","\"use strict\";\nmodule.exports = Service;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = \"Service\";\n\nvar Method = require(\"./method\"),\n util = require(\"./util\"),\n rpc = require(\"./rpc\");\n\n/**\n * Constructs a new service instance.\n * @classdesc Reflected service.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Service name\n * @param {Object.} [options] Service options\n * @throws {TypeError} If arguments are invalid\n */\nfunction Service(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Service methods.\n * @type {Object.}\n */\n this.methods = {}; // toJSON, marker\n\n /**\n * Cached methods as an array.\n * @type {Method[]|null}\n * @private\n */\n this._methodsArray = null;\n}\n\n/**\n * Service descriptor.\n * @interface IService\n * @extends INamespace\n * @property {Object.} methods Method descriptors\n */\n\n/**\n * Constructs a service from a service descriptor.\n * @param {string} name Service name\n * @param {IService} json Service descriptor\n * @returns {Service} Created service\n * @throws {TypeError} If arguments are invalid\n */\nService.fromJSON = function fromJSON(name, json) {\n var service = new Service(name, json.options);\n /* istanbul ignore else */\n if (json.methods)\n for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i)\n service.add(Method.fromJSON(names[i], json.methods[names[i]]));\n if (json.nested)\n service.addJSON(json.nested);\n service.comment = json.comment;\n return service;\n};\n\n/**\n * Converts this service to a service descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IService} Service descriptor\n */\nService.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , inherited && inherited.options || undefined,\n \"methods\" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {},\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Methods of this service as an array for iteration.\n * @name Service#methodsArray\n * @type {Method[]}\n * @readonly\n */\nObject.defineProperty(Service.prototype, \"methodsArray\", {\n get: function() {\n return this._methodsArray || (this._methodsArray = util.toArray(this.methods));\n }\n});\n\nfunction clearCache(service) {\n service._methodsArray = null;\n return service;\n}\n\n/**\n * @override\n */\nService.prototype.get = function get(name) {\n return this.methods[name]\n || Namespace.prototype.get.call(this, name);\n};\n\n/**\n * @override\n */\nService.prototype.resolveAll = function resolveAll() {\n var methods = this.methodsArray;\n for (var i = 0; i < methods.length; ++i)\n methods[i].resolve();\n return Namespace.prototype.resolve.call(this);\n};\n\n/**\n * @override\n */\nService.prototype.add = function add(object) {\n\n /* istanbul ignore if */\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Method) {\n this.methods[object.name] = object;\n object.parent = this;\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * @override\n */\nService.prototype.remove = function remove(object) {\n if (object instanceof Method) {\n\n /* istanbul ignore if */\n if (this.methods[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.methods[object.name];\n object.parent = null;\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Creates a runtime service using the specified rpc implementation.\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed.\n */\nService.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) {\n var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited);\n for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) {\n var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\\w_]/g, \"\");\n rpcService[methodName] = util.codegen([\"r\",\"c\"], util.isReserved(methodName) ? methodName + \"_\" : methodName)(\"return this.rpcCall(m,q,s,r,c)\")({\n m: method,\n q: method.resolvedRequestType.ctor,\n s: method.resolvedResponseType.ctor\n });\n }\n return rpcService;\n};\n","\"use strict\";\nmodule.exports = Method;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = \"Method\";\n\nvar util = require(\"./util\");\n\n/**\n * Constructs a new service method instance.\n * @classdesc Reflected service method.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Method name\n * @param {string|undefined} type Method type, usually `\"rpc\"`\n * @param {string} requestType Request message type\n * @param {string} responseType Response message type\n * @param {boolean|Object.} [requestStream] Whether the request is streamed\n * @param {boolean|Object.} [responseStream] Whether the response is streamed\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this method\n */\nfunction Method(name, type, requestType, responseType, requestStream, responseStream, options, comment) {\n\n /* istanbul ignore next */\n if (util.isObject(requestStream)) {\n options = requestStream;\n requestStream = responseStream = undefined;\n } else if (util.isObject(responseStream)) {\n options = responseStream;\n responseStream = undefined;\n }\n\n /* istanbul ignore if */\n if (!(type === undefined || util.isString(type)))\n throw TypeError(\"type must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(requestType))\n throw TypeError(\"requestType must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(responseType))\n throw TypeError(\"responseType must be a string\");\n\n ReflectionObject.call(this, name, options);\n\n /**\n * Method type.\n * @type {string}\n */\n this.type = type || \"rpc\"; // toJSON\n\n /**\n * Request type.\n * @type {string}\n */\n this.requestType = requestType; // toJSON, marker\n\n /**\n * Whether requests are streamed or not.\n * @type {boolean|undefined}\n */\n this.requestStream = requestStream ? true : undefined; // toJSON\n\n /**\n * Response type.\n * @type {string}\n */\n this.responseType = responseType; // toJSON\n\n /**\n * Whether responses are streamed or not.\n * @type {boolean|undefined}\n */\n this.responseStream = responseStream ? true : undefined; // toJSON\n\n /**\n * Resolved request type.\n * @type {Type|null}\n */\n this.resolvedRequestType = null;\n\n /**\n * Resolved response type.\n * @type {Type|null}\n */\n this.resolvedResponseType = null;\n\n /**\n * Comment for this method\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Method descriptor.\n * @interface IMethod\n * @property {string} [type=\"rpc\"] Method type\n * @property {string} requestType Request type\n * @property {string} responseType Response type\n * @property {boolean} [requestStream=false] Whether requests are streamed\n * @property {boolean} [responseStream=false] Whether responses are streamed\n * @property {Object.} [options] Method options\n */\n\n/**\n * Constructs a method from a method descriptor.\n * @param {string} name Method name\n * @param {IMethod} json Method descriptor\n * @returns {Method} Created method\n * @throws {TypeError} If arguments are invalid\n */\nMethod.fromJSON = function fromJSON(name, json) {\n return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment);\n};\n\n/**\n * Converts this method to a method descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMethod} Method descriptor\n */\nMethod.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"type\" , this.type !== \"rpc\" && /* istanbul ignore next */ this.type || undefined,\n \"requestType\" , this.requestType,\n \"requestStream\" , this.requestStream,\n \"responseType\" , this.responseType,\n \"responseStream\" , this.responseStream,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nMethod.prototype.resolve = function resolve() {\n\n /* istanbul ignore if */\n if (this.resolved)\n return this;\n\n this.resolvedRequestType = this.parent.lookupType(this.requestType);\n this.resolvedResponseType = this.parent.lookupType(this.responseType);\n\n return ReflectionObject.prototype.resolve.call(this);\n};\n","\"use strict\";\nmodule.exports = Message;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new message instance.\n * @classdesc Abstract runtime message.\n * @constructor\n * @param {Properties} [properties] Properties to set\n * @template T extends object = object\n */\nfunction Message(properties) {\n // not used internally\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n this[keys[i]] = properties[keys[i]];\n}\n\n/**\n * Reference to the reflected type.\n * @name Message.$type\n * @type {Type}\n * @readonly\n */\n\n/**\n * Reference to the reflected type.\n * @name Message#$type\n * @type {Type}\n * @readonly\n */\n\n/*eslint-disable valid-jsdoc*/\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.create = function create(properties) {\n return this.$type.create(properties);\n};\n\n/**\n * Encodes a message of this type.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encode = function encode(message, writer) {\n return this.$type.encode(message, writer);\n};\n\n/**\n * Encodes a message of this type preceeded by its length as a varint.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encodeDelimited = function encodeDelimited(message, writer) {\n return this.$type.encodeDelimited(message, writer);\n};\n\n/**\n * Decodes a message of this type.\n * @name Message.decode\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decode = function decode(reader) {\n return this.$type.decode(reader);\n};\n\n/**\n * Decodes a message of this type preceeded by its length as a varint.\n * @name Message.decodeDelimited\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decodeDelimited = function decodeDelimited(reader) {\n return this.$type.decodeDelimited(reader);\n};\n\n/**\n * Verifies a message of this type.\n * @name Message.verify\n * @function\n * @param {Object.} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\nMessage.verify = function verify(message) {\n return this.$type.verify(message);\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object\n * @returns {T} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.fromObject = function fromObject(object) {\n return this.$type.fromObject(object);\n};\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {T} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @template T extends Message\n * @this Constructor\n */\nMessage.toObject = function toObject(message, options) {\n return this.$type.toObject(message, options);\n};\n\n/**\n * Converts this message to JSON.\n * @returns {Object.} JSON object\n */\nMessage.prototype.toJSON = function toJSON() {\n return this.$type.toObject(this, util.toJSONOptions);\n};\n\n/*eslint-enable valid-jsdoc*/","\"use strict\";\nmodule.exports = Root;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = \"Root\";\n\nvar Field = require(\"./field\"),\n Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n util = require(\"./util\");\n\nvar Type, // cyclic\n parse, // might be excluded\n common; // \"\n\n/**\n * Constructs a new root namespace instance.\n * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together.\n * @extends NamespaceBase\n * @constructor\n * @param {Object.} [options] Top level options\n */\nfunction Root(options) {\n Namespace.call(this, \"\", options);\n\n /**\n * Deferred extension fields.\n * @type {Field[]}\n */\n this.deferred = [];\n\n /**\n * Resolved file names of loaded files.\n * @type {string[]}\n */\n this.files = [];\n}\n\n/**\n * Loads a namespace descriptor into a root namespace.\n * @param {INamespace} json Nameespace descriptor\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted\n * @returns {Root} Root namespace\n */\nRoot.fromJSON = function fromJSON(json, root) {\n if (!root)\n root = new Root();\n if (json.options)\n root.setOptions(json.options);\n return root.addJSON(json.nested);\n};\n\n/**\n * Resolves the path of an imported file, relative to the importing origin.\n * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories.\n * @function\n * @param {string} origin The file name of the importing file\n * @param {string} target The file name being imported\n * @returns {string|null} Resolved path to `target` or `null` to skip the file\n */\nRoot.prototype.resolvePath = util.path.resolve;\n\n// A symbol-like function to safely signal synchronous loading\n/* istanbul ignore next */\nfunction SYNC() {} // eslint-disable-line no-empty-function\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} options Parse options\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n */\nRoot.prototype.load = function load(filename, options, callback) {\n if (typeof options === \"function\") {\n callback = options;\n options = undefined;\n }\n var self = this;\n if (!callback)\n return util.asPromise(load, self, filename, options);\n\n var sync = callback === SYNC; // undocumented\n\n // Finishes loading by calling the callback (exactly once)\n function finish(err, root) {\n /* istanbul ignore if */\n if (!callback)\n return;\n var cb = callback;\n callback = null;\n if (sync)\n throw err;\n cb(err, root);\n }\n\n // Processes a single file\n function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued)\n finish(null, self); // only once anyway\n }\n\n // Fetches a single file\n function fetch(filename, weak) {\n\n // Strip path if this file references a bundled definition\n var idx = filename.lastIndexOf(\"google/protobuf/\");\n if (idx > -1) {\n var altname = filename.substring(idx);\n if (altname in common)\n filename = altname;\n }\n\n // Skip if already loaded / attempted\n if (self.files.indexOf(filename) > -1)\n return;\n self.files.push(filename);\n\n // Shortcut bundled definitions\n if (filename in common) {\n if (sync)\n process(filename, common[filename]);\n else {\n ++queued;\n setTimeout(function() {\n --queued;\n process(filename, common[filename]);\n });\n }\n return;\n }\n\n // Otherwise fetch from disk or network\n if (sync) {\n var source;\n try {\n source = util.fs.readFileSync(filename).toString(\"utf8\");\n } catch (err) {\n if (!weak)\n finish(err);\n return;\n }\n process(filename, source);\n } else {\n ++queued;\n util.fetch(filename, function(err, source) {\n --queued;\n /* istanbul ignore if */\n if (!callback)\n return; // terminated meanwhile\n if (err) {\n /* istanbul ignore else */\n if (!weak)\n finish(err);\n else if (!queued) // can't be covered reliably\n finish(null, self);\n return;\n }\n process(filename, source);\n });\n }\n }\n var queued = 0;\n\n // Assembling the root namespace doesn't require working type\n // references anymore, so we can load everything in parallel\n if (util.isString(filename))\n filename = [ filename ];\n for (var i = 0, resolved; i < filename.length; ++i)\n if (resolved = self.resolvePath(\"\", filename[i]))\n fetch(resolved);\n\n if (sync)\n return self;\n if (!queued)\n finish(null, self);\n return undefined;\n};\n// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Promise} Promise\n * @variation 3\n */\n// function load(filename:string, [options:IParseOptions]):Promise\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only).\n * @function Root#loadSync\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n */\nRoot.prototype.loadSync = function loadSync(filename, options) {\n if (!util.isNode)\n throw Error(\"not supported\");\n return this.load(filename, options, SYNC);\n};\n\n/**\n * @override\n */\nRoot.prototype.resolveAll = function resolveAll() {\n if (this.deferred.length)\n throw Error(\"unresolvable extensions: \" + this.deferred.map(function(field) {\n return \"'extend \" + field.extend + \"' in \" + field.parent.fullName;\n }).join(\", \"));\n return Namespace.prototype.resolveAll.call(this);\n};\n\n// only uppercased (and thus conflict-free) children are exposed, see below\nvar exposeRe = /^[A-Z]/;\n\n/**\n * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type.\n * @param {Root} root Root instance\n * @param {Field} field Declaring extension field witin the declaring type\n * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise\n * @inner\n * @ignore\n */\nfunction tryHandleExtension(root, field) {\n var extendedType = field.parent.lookup(field.extend);\n if (extendedType) {\n var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options);\n sisterField.declaringField = field;\n field.extensionField = sisterField;\n extendedType.add(sisterField);\n return true;\n }\n return false;\n}\n\n/**\n * Called when any object is added to this root or its sub-namespaces.\n * @param {ReflectionObject} object Object added\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleAdd = function _handleAdd(object) {\n if (object instanceof Field) {\n\n if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField)\n if (!tryHandleExtension(this, object))\n this.deferred.push(object);\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n object.parent[object.name] = object.values; // expose enum values as property of its parent\n\n } else if (!(object instanceof OneOf)) /* everything else is a namespace */ {\n\n if (object instanceof Type) // Try to handle any deferred extensions\n for (var i = 0; i < this.deferred.length;)\n if (tryHandleExtension(this, this.deferred[i]))\n this.deferred.splice(i, 1);\n else\n ++i;\n for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace\n this._handleAdd(object._nestedArray[j]);\n if (exposeRe.test(object.name))\n object.parent[object.name] = object; // expose namespace as property of its parent\n }\n\n // The above also adds uppercased (and thus conflict-free) nested types, services and enums as\n // properties of namespaces just like static code does. This allows using a .d.ts generated for\n // a static module with reflection-based solutions where the condition is met.\n};\n\n/**\n * Called when any object is removed from this root or its sub-namespaces.\n * @param {ReflectionObject} object Object removed\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleRemove = function _handleRemove(object) {\n if (object instanceof Field) {\n\n if (/* an extension field */ object.extend !== undefined) {\n if (/* already handled */ object.extensionField) { // remove its sister field\n object.extensionField.parent.remove(object.extensionField);\n object.extensionField = null;\n } else { // cancel the extension\n var index = this.deferred.indexOf(object);\n /* istanbul ignore else */\n if (index > -1)\n this.deferred.splice(index, 1);\n }\n }\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose enum values\n\n } else if (object instanceof Namespace) {\n\n for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace\n this._handleRemove(object._nestedArray[i]);\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose namespaces\n\n }\n};\n\n// Sets up cyclic dependencies (called in index-light)\nRoot._configure = function(Type_, parse_, common_) {\n Type = Type_;\n parse = parse_;\n common = common_;\n};\n","module.exports = require(\"util\");","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\nvar curve = require('./curve');\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n if (options.type === 'short')\n this.curve = new curve.short(options);\n else if (options.type === 'edwards')\n this.curve = new curve.edwards(options);\n else\n this.curve = new curve.mont(options);\n this.g = this.curve.g;\n this.n = this.curve.n;\n this.hash = options.hash;\n\n assert(this.g.validate(), 'Invalid curve');\n assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n get: function() {\n var curve = new PresetCurve(options);\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n value: curve,\n });\n return curve;\n },\n });\n}\n\ndefineCurve('p192', {\n type: 'short',\n prime: 'p192',\n p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',\n b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',\n n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',\n hash: hash.sha256,\n gRed: false,\n g: [\n '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',\n '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811',\n ],\n});\n\ndefineCurve('p224', {\n type: 'short',\n prime: 'p224',\n p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',\n b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',\n n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',\n hash: hash.sha256,\n gRed: false,\n g: [\n 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',\n 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34',\n ],\n});\n\ndefineCurve('p256', {\n type: 'short',\n prime: null,\n p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',\n a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',\n b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',\n n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',\n hash: hash.sha256,\n gRed: false,\n g: [\n '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',\n '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5',\n ],\n});\n\ndefineCurve('p384', {\n type: 'short',\n prime: null,\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 ffffffff',\n a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 fffffffc',\n b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +\n '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +\n 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n hash: hash.sha384,\n gRed: false,\n g: [\n 'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +\n '5502f25d bf55296c 3a545e38 72760ab7',\n '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +\n '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f',\n ],\n});\n\ndefineCurve('p521', {\n type: 'short',\n prime: null,\n p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff',\n a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff fffffffc',\n b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +\n '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +\n '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +\n 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n hash: hash.sha512,\n gRed: false,\n g: [\n '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +\n '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +\n 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',\n '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +\n '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +\n '3fad0761 353c7086 a272c240 88be9476 9fd16650',\n ],\n});\n\ndefineCurve('curve25519', {\n type: 'mont',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '76d06',\n b: '1',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: [\n '9',\n ],\n});\n\ndefineCurve('ed25519', {\n type: 'edwards',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '-1',\n c: '1',\n // -121665 * (121666^(-1)) (mod P)\n d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: [\n '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',\n\n // 4/5\n '6666666666666666666666666666666666666666666666666666666666666658',\n ],\n});\n\nvar pre;\ntry {\n pre = require('./precomputed/secp256k1');\n} catch (e) {\n pre = undefined;\n}\n\ndefineCurve('secp256k1', {\n type: 'short',\n prime: 'k256',\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',\n a: '0',\n b: '7',\n n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',\n h: '1',\n hash: hash.sha256,\n\n // Precomputed endomorphism\n beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n basis: [\n {\n a: '3086d221a7d46bcde86c90e49284eb15',\n b: '-e4437ed6010e88286f547fa90abfe4c3',\n },\n {\n a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n b: '3086d221a7d46bcde86c90e49284eb15',\n },\n ],\n\n gRed: false,\n g: [\n '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',\n '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',\n pre,\n ],\n});\n","var hash = exports;\n\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac');\n\n// Proxy hash functions to the main object\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;\n","var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs\n\nmodule.exports = function (iterations, keylen) {\n if (typeof iterations !== 'number') {\n throw new TypeError('Iterations not a number')\n }\n\n if (iterations < 0) {\n throw new TypeError('Bad iterations')\n }\n\n if (typeof keylen !== 'number') {\n throw new TypeError('Key length not a number')\n }\n\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */\n throw new TypeError('Bad key length')\n }\n}\n","var defaultEncoding\n/* istanbul ignore next */\nif (global.process && global.process.browser) {\n defaultEncoding = 'utf-8'\n} else if (global.process && global.process.version) {\n var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10)\n\n defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary'\n} else {\n defaultEncoding = 'utf-8'\n}\nmodule.exports = defaultEncoding\n","var Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (thing, encoding, name) {\n if (Buffer.isBuffer(thing)) {\n return thing\n } else if (typeof thing === 'string') {\n return Buffer.from(thing, encoding)\n } else if (ArrayBuffer.isView(thing)) {\n return Buffer.from(thing.buffer)\n } else {\n throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView')\n }\n}\n","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;","var Stream = require('stream');\nif (process.env.READABLE_STREAM === 'disable' && Stream) {\n module.exports = Stream.Readable;\n Object.assign(module.exports, Stream);\n module.exports.Stream = Stream;\n} else {\n exports = module.exports = require('./lib/_stream_readable.js');\n exports.Stream = Stream || exports;\n exports.Readable = exports;\n exports.Writable = require('./lib/_stream_writable.js');\n exports.Duplex = require('./lib/_stream_duplex.js');\n exports.Transform = require('./lib/_stream_transform.js');\n exports.PassThrough = require('./lib/_stream_passthrough.js');\n exports.finished = require('./lib/internal/streams/end-of-stream.js');\n exports.pipeline = require('./lib/internal/streams/pipeline.js');\n}\n",";(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"), require(\"./sha1\"), require(\"./hmac\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./sha1\", \"./hmac\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var C_algo = C.algo;\n\t var MD5 = C_algo.MD5;\n\n\t /**\n\t * This key derivation function is meant to conform with EVP_BytesToKey.\n\t * www.openssl.org/docs/crypto/EVP_BytesToKey.html\n\t */\n\t var EvpKDF = C_algo.EvpKDF = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)\n\t * @property {Hasher} hasher The hash algorithm to use. Default: MD5\n\t * @property {number} iterations The number of iterations to perform. Default: 1\n\t */\n\t cfg: Base.extend({\n\t keySize: 128/32,\n\t hasher: MD5,\n\t iterations: 1\n\t }),\n\n\t /**\n\t * Initializes a newly created key derivation function.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for the derivation.\n\t *\n\t * @example\n\t *\n\t * var kdf = CryptoJS.algo.EvpKDF.create();\n\t * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 });\n\t * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 });\n\t */\n\t init: function (cfg) {\n\t this.cfg = this.cfg.extend(cfg);\n\t },\n\n\t /**\n\t * Derives a key from a password.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @example\n\t *\n\t * var key = kdf.compute(password, salt);\n\t */\n\t compute: function (password, salt) {\n\t var block;\n\n\t // Shortcut\n\t var cfg = this.cfg;\n\n\t // Init hasher\n\t var hasher = cfg.hasher.create();\n\n\t // Initial values\n\t var derivedKey = WordArray.create();\n\n\t // Shortcuts\n\t var derivedKeyWords = derivedKey.words;\n\t var keySize = cfg.keySize;\n\t var iterations = cfg.iterations;\n\n\t // Generate key\n\t while (derivedKeyWords.length < keySize) {\n\t if (block) {\n\t hasher.update(block);\n\t }\n\t block = hasher.update(password).finalize(salt);\n\t hasher.reset();\n\n\t // Iterations\n\t for (var i = 1; i < iterations; i++) {\n\t block = hasher.finalize(block);\n\t hasher.reset();\n\t }\n\n\t derivedKey.concat(block);\n\t }\n\t derivedKey.sigBytes = keySize * 4;\n\n\t return derivedKey;\n\t }\n\t });\n\n\t /**\n\t * Derives a key from a password.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t * @param {Object} cfg (Optional) The configuration options to use for this computation.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var key = CryptoJS.EvpKDF(password, salt);\n\t * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8 });\n\t * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8, iterations: 1000 });\n\t */\n\t C.EvpKDF = function (password, salt, cfg) {\n\t return EvpKDF.create(cfg).compute(password, salt);\n\t };\n\t}());\n\n\n\treturn CryptoJS.EvpKDF;\n\n}));","\"use strict\";\r\nmodule.exports = asPromise;\r\n\r\n/**\r\n * Callback as used by {@link util.asPromise}.\r\n * @typedef asPromiseCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {...*} params Additional arguments\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Returns a promise from a node-style callback function.\r\n * @memberof util\r\n * @param {asPromiseCallback} fn Function to call\r\n * @param {*} ctx Function context\r\n * @param {...*} params Function arguments\r\n * @returns {Promise<*>} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0,\r\n index = 2,\r\n pending = true;\r\n while (index < arguments.length)\r\n params[offset++] = arguments[index++];\r\n return new Promise(function executor(resolve, reject) {\r\n params[offset] = function callback(err/*, varargs */) {\r\n if (pending) {\r\n pending = false;\r\n if (err)\r\n reject(err);\r\n else {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0;\r\n while (offset < params.length)\r\n params[offset++] = arguments[offset];\r\n resolve.apply(null, params);\r\n }\r\n }\r\n };\r\n try {\r\n fn.apply(ctx || null, params);\r\n } catch (err) {\r\n if (pending) {\r\n pending = false;\r\n reject(err);\r\n }\r\n }\r\n });\r\n}\r\n","\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n try {\r\n var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n if (mod && (mod.length || Object.keys(mod).length))\r\n return mod;\r\n } catch (e) {} // eslint-disable-line no-empty\r\n return null;\r\n}\r\n","\"use strict\";\n\n/**\n * Streaming RPC helpers.\n * @namespace\n */\nvar rpc = exports;\n\n/**\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\n * @typedef RPCImpl\n * @type {function}\n * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called\n * @param {Uint8Array} requestData Request data\n * @param {RPCImplCallback} callback Callback function\n * @returns {undefined}\n * @example\n * function rpcImpl(method, requestData, callback) {\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\n * throw Error(\"no such method\");\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\n * callback(err, responseData);\n * });\n * }\n */\n\n/**\n * Node-style callback as used by {@link RPCImpl}.\n * @typedef RPCImplCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\n * @returns {undefined}\n */\n\nrpc.Service = require(\"./rpc/service\");\n","\"use strict\";\nmodule.exports = {};\n\n/**\n * Named roots.\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\n * Can also be used manually to make roots available accross modules.\n * @name roots\n * @type {Object.}\n * @example\n * // pbjs -r myroot -o compiled.js ...\n *\n * // in another module:\n * require(\"./compiled.js\");\n *\n * // in any subsequent module:\n * var root = protobuf.roots[\"myroot\"];\n */\n","\"use strict\";\nmodule.exports = encoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Generates a partial message type encoder.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genTypePartial(gen, field, fieldIndex, ref) {\n return field.resolvedType.group\n ? gen(\"types[%i].encode(%s,w.uint32(%i)).uint32(%i)\", fieldIndex, ref, (field.id << 3 | 3) >>> 0, (field.id << 3 | 4) >>> 0)\n : gen(\"types[%i].encode(%s,w.uint32(%i).fork()).ldelim()\", fieldIndex, ref, (field.id << 3 | 2) >>> 0);\n}\n\n/**\n * Generates an encoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction encoder(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var gen = util.codegen([\"m\", \"w\"], mtype.name + \"$encode\")\n (\"if(!w)\")\n (\"w=Writer.create()\");\n\n var i, ref;\n\n // \"when a message is serialized its known fields should be written sequentially by field number\"\n var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById);\n\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n index = mtype._fieldsArray.indexOf(field),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n wireType = types.basic[type];\n ref = \"m\" + util.safeProp(field.name);\n\n // Map fields\n if (field.map) {\n gen\n (\"if(%s!=null&&m.hasOwnProperty(%j)){\", ref, field.name) // !== undefined && !== null\n (\"for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType);\n if (wireType === undefined) gen\n (\"types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()\", index, ref); // can't be groups\n else gen\n (\".uint32(%i).%s(%s[ks[i]]).ldelim()\", 16 | wireType, type, ref);\n gen\n (\"}\")\n (\"}\");\n\n // Repeated fields\n } else if (field.repeated) { gen\n (\"if(%s!=null&&%s.length){\", ref, ref); // !== undefined && !== null\n\n // Packed repeated\n if (field.packed && types.packed[type] !== undefined) { gen\n\n (\"w.uint32(%i).fork()\", (field.id << 3 | 2) >>> 0)\n (\"for(var i=0;i<%s.length;++i)\", ref)\n (\"w.%s(%s[i])\", type, ref)\n (\"w.ldelim()\");\n\n // Non-packed\n } else { gen\n\n (\"for(var i=0;i<%s.length;++i)\", ref);\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref + \"[i]\");\n else gen\n (\"w.uint32(%i).%s(%s[i])\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n } gen\n (\"}\");\n\n // Non-repeated\n } else {\n if (field.optional) gen\n (\"if(%s!=null&&m.hasOwnProperty(%j))\", ref, field.name); // !== undefined && !== null\n\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref);\n else gen\n (\"w.uint32(%i).%s(%s)\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n }\n }\n\n return gen\n (\"return w\");\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}","\"use strict\";\nmodule.exports = decoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nfunction missing(field) {\n return \"missing required '\" + field.name + \"'\";\n}\n\n/**\n * Generates a decoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction decoder(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"r\", \"l\"], mtype.name + \"$decode\")\n (\"if(!(r instanceof Reader))\")\n (\"r=Reader.create(r)\")\n (\"var c=l===undefined?r.len:r.pos+l,m=new this.ctor\" + (mtype.fieldsArray.filter(function(field) { return field.map; }).length ? \",k\" : \"\"))\n (\"while(r.pos>>3){\");\n\n var i = 0;\n for (; i < /* initializes */ mtype.fieldsArray.length; ++i) {\n var field = mtype._fieldsArray[i].resolve(),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n ref = \"m\" + util.safeProp(field.name); gen\n (\"case %i:\", field.id);\n\n // Map fields\n if (field.map) { gen\n (\"r.skip().pos++\") // assumes id 1 + key wireType\n (\"if(%s===util.emptyObject)\", ref)\n (\"%s={}\", ref)\n (\"k=r.%s()\", field.keyType)\n (\"r.pos++\"); // assumes id 2 + value wireType\n if (types.long[field.keyType] !== undefined) {\n if (types.basic[type] === undefined) gen\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=types[%i].decode(r,r.uint32())\", ref, i); // can't be groups\n else gen\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=r.%s()\", ref, type);\n } else {\n if (types.basic[type] === undefined) gen\n (\"%s[k]=types[%i].decode(r,r.uint32())\", ref, i); // can't be groups\n else gen\n (\"%s[k]=r.%s()\", ref, type);\n }\n\n // Repeated fields\n } else if (field.repeated) { gen\n\n (\"if(!(%s&&%s.length))\", ref, ref)\n (\"%s=[]\", ref);\n\n // Packable (always check for forward and backward compatiblity)\n if (types.packed[type] !== undefined) gen\n (\"if((t&7)===2){\")\n (\"var c2=r.uint32()+r.pos\")\n (\"while(r.pos>>0\", prop, prop);\n break;\n case \"int32\":\n case \"sint32\":\n case \"sfixed32\": gen\n (\"m%s=d%s|0\", prop, prop);\n break;\n case \"uint64\":\n isUnsigned = true;\n // eslint-disable-line no-fallthrough\n case \"int64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(util.Long)\")\n (\"(m%s=util.Long.fromValue(d%s)).unsigned=%j\", prop, prop, isUnsigned)\n (\"else if(typeof d%s===\\\"string\\\")\", prop)\n (\"m%s=parseInt(d%s,10)\", prop, prop)\n (\"else if(typeof d%s===\\\"number\\\")\", prop)\n (\"m%s=d%s\", prop, prop)\n (\"else if(typeof d%s===\\\"object\\\")\", prop)\n (\"m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)\", prop, prop, prop, isUnsigned ? \"true\" : \"\");\n break;\n case \"bytes\": gen\n (\"if(typeof d%s===\\\"string\\\")\", prop)\n (\"util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)\", prop, prop, prop)\n (\"else if(d%s.length)\", prop)\n (\"m%s=d%s\", prop, prop);\n break;\n case \"string\": gen\n (\"m%s=String(d%s)\", prop, prop);\n break;\n case \"bool\": gen\n (\"m%s=Boolean(d%s)\", prop, prop);\n break;\n /* default: gen\n (\"m%s=d%s\", prop, prop);\n break; */\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a plain object to runtime message converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.fromObject = function fromObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray;\n var gen = util.codegen([\"d\"], mtype.name + \"$fromObject\")\n (\"if(d instanceof this.ctor)\")\n (\"return d\");\n if (!fields.length) return gen\n (\"return new this.ctor\");\n gen\n (\"var m=new this.ctor\");\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n prop = util.safeProp(field.name);\n\n // Map fields\n if (field.map) { gen\n (\"if(d%s){\", prop)\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\n (\"m%s={}\", prop)\n (\"for(var ks=Object.keys(d%s),i=0;i>>0,m%s.high>>>0).toNumber(%s):m%s\", prop, prop, prop, prop, isUnsigned ? \"true\": \"\", prop);\n break;\n case \"bytes\": gen\n (\"d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s\", prop, prop, prop, prop, prop);\n break;\n default: gen\n (\"d%s=m%s\", prop, prop);\n break;\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a runtime message to plain object converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.toObject = function toObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById);\n if (!fields.length)\n return util.codegen()(\"return {}\");\n var gen = util.codegen([\"m\", \"o\"], mtype.name + \"$toObject\")\n (\"if(!o)\")\n (\"o={}\")\n (\"var d={}\");\n\n var repeatedFields = [],\n mapFields = [],\n normalFields = [],\n i = 0;\n for (; i < fields.length; ++i)\n if (!fields[i].partOf)\n ( fields[i].resolve().repeated ? repeatedFields\n : fields[i].map ? mapFields\n : normalFields).push(fields[i]);\n\n if (repeatedFields.length) { gen\n (\"if(o.arrays||o.defaults){\");\n for (i = 0; i < repeatedFields.length; ++i) gen\n (\"d%s=[]\", util.safeProp(repeatedFields[i].name));\n gen\n (\"}\");\n }\n\n if (mapFields.length) { gen\n (\"if(o.objects||o.defaults){\");\n for (i = 0; i < mapFields.length; ++i) gen\n (\"d%s={}\", util.safeProp(mapFields[i].name));\n gen\n (\"}\");\n }\n\n if (normalFields.length) { gen\n (\"if(o.defaults){\");\n for (i = 0; i < normalFields.length; ++i) {\n var field = normalFields[i],\n prop = util.safeProp(field.name);\n if (field.resolvedType instanceof Enum) gen\n (\"d%s=o.enums===String?%j:%j\", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault);\n else if (field.long) gen\n (\"if(util.Long){\")\n (\"var n=new util.Long(%i,%i,%j)\", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned)\n (\"d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n\", prop)\n (\"}else\")\n (\"d%s=o.longs===String?%j:%i\", prop, field.typeDefault.toString(), field.typeDefault.toNumber());\n else if (field.bytes) {\n var arrayDefault = \"[\" + Array.prototype.slice.call(field.typeDefault).join(\",\") + \"]\";\n gen\n (\"if(o.bytes===String)d%s=%j\", prop, String.fromCharCode.apply(String, field.typeDefault))\n (\"else{\")\n (\"d%s=%s\", prop, arrayDefault)\n (\"if(o.bytes!==Array)d%s=util.newBuffer(d%s)\", prop, prop)\n (\"}\");\n } else gen\n (\"d%s=%j\", prop, field.typeDefault); // also messages (=null)\n } gen\n (\"}\");\n }\n var hasKs2 = false;\n for (i = 0; i < fields.length; ++i) {\n var field = fields[i],\n index = mtype._fieldsArray.indexOf(field),\n prop = util.safeProp(field.name);\n if (field.map) {\n if (!hasKs2) { hasKs2 = true; gen\n (\"var ks2\");\n } gen\n (\"if(m%s&&(ks2=Object.keys(m%s)).length){\", prop, prop)\n (\"d%s={}\", prop)\n (\"for(var j=0;j}\n * @const\n */\nvar wrappers = exports;\n\nvar Message = require(\"./message\");\n\n/**\n * From object converter part of an {@link IWrapper}.\n * @typedef WrapperFromObjectConverter\n * @type {function}\n * @param {Object.} object Plain object\n * @returns {Message<{}>} Message instance\n * @this Type\n */\n\n/**\n * To object converter part of an {@link IWrapper}.\n * @typedef WrapperToObjectConverter\n * @type {function}\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @this Type\n */\n\n/**\n * Common type wrapper part of {@link wrappers}.\n * @interface IWrapper\n * @property {WrapperFromObjectConverter} [fromObject] From object converter\n * @property {WrapperToObjectConverter} [toObject] To object converter\n */\n\n// Custom wrapper for Any\nwrappers[\".google.protobuf.Any\"] = {\n\n fromObject: function(object) {\n\n // unwrap value type if mapped\n if (object && object[\"@type\"]) {\n var type = this.lookup(object[\"@type\"]);\n /* istanbul ignore else */\n if (type) {\n // type_url does not accept leading \".\"\n var type_url = object[\"@type\"].charAt(0) === \".\" ?\n object[\"@type\"].substr(1) : object[\"@type\"];\n // type_url prefix is optional, but path seperator is required\n return this.create({\n type_url: \"/\" + type_url,\n value: type.encode(type.fromObject(object)).finish()\n });\n }\n }\n\n return this.fromObject(object);\n },\n\n toObject: function(message, options) {\n\n // decode value if requested and unmapped\n if (options && options.json && message.type_url && message.value) {\n // Only use fully qualified type name after the last '/'\n var name = message.type_url.substring(message.type_url.lastIndexOf(\"/\") + 1);\n var type = this.lookup(name);\n /* istanbul ignore else */\n if (type)\n message = type.decode(message.value);\n }\n\n // wrap value if unmapped\n if (!(message instanceof this.ctor) && message instanceof Message) {\n var object = message.$type.toObject(message, options);\n object[\"@type\"] = message.$type.fullName;\n return object;\n }\n\n return this.toObject(message, options);\n }\n};\n","\"use strict\";\nmodule.exports = tokenize;\n\nvar delimRe = /[\\s{}=;:[\\],'\"()<>]/g,\n stringDoubleRe = /(?:\"([^\"\\\\]*(?:\\\\.[^\"\\\\]*)*)\")/g,\n stringSingleRe = /(?:'([^'\\\\]*(?:\\\\.[^'\\\\]*)*)')/g;\n\nvar setCommentRe = /^ *[*/]+ */,\n setCommentAltRe = /^\\s*\\*?\\/*/,\n setCommentSplitRe = /\\n/g,\n whitespaceRe = /\\s/,\n unescapeRe = /\\\\(.?)/g;\n\nvar unescapeMap = {\n \"0\": \"\\0\",\n \"r\": \"\\r\",\n \"n\": \"\\n\",\n \"t\": \"\\t\"\n};\n\n/**\n * Unescapes a string.\n * @param {string} str String to unescape\n * @returns {string} Unescaped string\n * @property {Object.} map Special characters map\n * @memberof tokenize\n */\nfunction unescape(str) {\n return str.replace(unescapeRe, function($0, $1) {\n switch ($1) {\n case \"\\\\\":\n case \"\":\n return $1;\n default:\n return unescapeMap[$1] || \"\";\n }\n });\n}\n\ntokenize.unescape = unescape;\n\n/**\n * Gets the next token and advances.\n * @typedef TokenizerHandleNext\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Peeks for the next token.\n * @typedef TokenizerHandlePeek\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Pushes a token back to the stack.\n * @typedef TokenizerHandlePush\n * @type {function}\n * @param {string} token Token\n * @returns {undefined}\n */\n\n/**\n * Skips the next token.\n * @typedef TokenizerHandleSkip\n * @type {function}\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] If optional\n * @returns {boolean} Whether the token matched\n * @throws {Error} If the token didn't match and is not optional\n */\n\n/**\n * Gets the comment on the previous line or, alternatively, the line comment on the specified line.\n * @typedef TokenizerHandleCmnt\n * @type {function}\n * @param {number} [line] Line number\n * @returns {string|null} Comment text or `null` if none\n */\n\n/**\n * Handle object returned from {@link tokenize}.\n * @interface ITokenizerHandle\n * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof)\n * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof)\n * @property {TokenizerHandlePush} push Pushes a token back to the stack\n * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws\n * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any\n * @property {number} line Current line number\n */\n\n/**\n * Tokenizes the given .proto source and returns an object with useful utility functions.\n * @param {string} source Source contents\n * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode.\n * @returns {ITokenizerHandle} Tokenizer handle\n */\nfunction tokenize(source, alternateCommentMode) {\n /* eslint-disable callback-return */\n source = source.toString();\n\n var offset = 0,\n length = source.length,\n line = 1,\n commentType = null,\n commentText = null,\n commentLine = 0,\n commentLineEmpty = false;\n\n var stack = [];\n\n var stringDelim = null;\n\n /* istanbul ignore next */\n /**\n * Creates an error for illegal syntax.\n * @param {string} subject Subject\n * @returns {Error} Error created\n * @inner\n */\n function illegal(subject) {\n return Error(\"illegal \" + subject + \" (line \" + line + \")\");\n }\n\n /**\n * Reads a string till its end.\n * @returns {string} String read\n * @inner\n */\n function readString() {\n var re = stringDelim === \"'\" ? stringSingleRe : stringDoubleRe;\n re.lastIndex = offset - 1;\n var match = re.exec(source);\n if (!match)\n throw illegal(\"string\");\n offset = re.lastIndex;\n push(stringDelim);\n stringDelim = null;\n return unescape(match[1]);\n }\n\n /**\n * Gets the character at `pos` within the source.\n * @param {number} pos Position\n * @returns {string} Character\n * @inner\n */\n function charAt(pos) {\n return source.charAt(pos);\n }\n\n /**\n * Sets the current comment text.\n * @param {number} start Start offset\n * @param {number} end End offset\n * @returns {undefined}\n * @inner\n */\n function setComment(start, end) {\n commentType = source.charAt(start++);\n commentLine = line;\n commentLineEmpty = false;\n var lookback;\n if (alternateCommentMode) {\n lookback = 2; // alternate comment parsing: \"//\" or \"/*\"\n } else {\n lookback = 3; // \"///\" or \"/**\"\n }\n var commentOffset = start - lookback,\n c;\n do {\n if (--commentOffset < 0 ||\n (c = source.charAt(commentOffset)) === \"\\n\") {\n commentLineEmpty = true;\n break;\n }\n } while (c === \" \" || c === \"\\t\");\n var lines = source\n .substring(start, end)\n .split(setCommentSplitRe);\n for (var i = 0; i < lines.length; ++i)\n lines[i] = lines[i]\n .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, \"\")\n .trim();\n commentText = lines\n .join(\"\\n\")\n .trim();\n }\n\n function isDoubleSlashCommentLine(startOffset) {\n var endOffset = findEndOfLine(startOffset);\n\n // see if remaining line matches comment pattern\n var lineText = source.substring(startOffset, endOffset);\n // look for 1 or 2 slashes since startOffset would already point past\n // the first slash that started the comment.\n var isComment = /^\\s*\\/{1,2}/.test(lineText);\n return isComment;\n }\n\n function findEndOfLine(cursor) {\n // find end of cursor's line\n var endOffset = cursor;\n while (endOffset < length && charAt(endOffset) !== \"\\n\") {\n endOffset++;\n }\n return endOffset;\n }\n\n /**\n * Obtains the next token.\n * @returns {string|null} Next token or `null` on eof\n * @inner\n */\n function next() {\n if (stack.length > 0)\n return stack.shift();\n if (stringDelim)\n return readString();\n var repeat,\n prev,\n curr,\n start,\n isDoc;\n do {\n if (offset === length)\n return null;\n repeat = false;\n while (whitespaceRe.test(curr = charAt(offset))) {\n if (curr === \"\\n\")\n ++line;\n if (++offset === length)\n return null;\n }\n\n if (charAt(offset) === \"/\") {\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n if (charAt(offset) === \"/\") { // Line\n if (!alternateCommentMode) {\n // check for triple-slash comment\n isDoc = charAt(start = offset + 1) === \"/\";\n\n while (charAt(++offset) !== \"\\n\") {\n if (offset === length) {\n return null;\n }\n }\n ++offset;\n if (isDoc) {\n setComment(start, offset - 1);\n }\n ++line;\n repeat = true;\n } else {\n // check for double-slash comments, consolidating consecutive lines\n start = offset;\n isDoc = false;\n if (isDoubleSlashCommentLine(offset)) {\n isDoc = true;\n do {\n offset = findEndOfLine(offset);\n if (offset === length) {\n break;\n }\n offset++;\n } while (isDoubleSlashCommentLine(offset));\n } else {\n offset = Math.min(length, findEndOfLine(offset) + 1);\n }\n if (isDoc) {\n setComment(start, offset);\n }\n line++;\n repeat = true;\n }\n } else if ((curr = charAt(offset)) === \"*\") { /* Block */\n // check for /** (regular comment mode) or /* (alternate comment mode)\n start = offset + 1;\n isDoc = alternateCommentMode || charAt(start) === \"*\";\n do {\n if (curr === \"\\n\") {\n ++line;\n }\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n prev = curr;\n curr = charAt(offset);\n } while (prev !== \"*\" || curr !== \"/\");\n ++offset;\n if (isDoc) {\n setComment(start, offset - 2);\n }\n repeat = true;\n } else {\n return \"/\";\n }\n }\n } while (repeat);\n\n // offset !== length if we got here\n\n var end = offset;\n delimRe.lastIndex = 0;\n var delim = delimRe.test(charAt(end++));\n if (!delim)\n while (end < length && !delimRe.test(charAt(end)))\n ++end;\n var token = source.substring(offset, offset = end);\n if (token === \"\\\"\" || token === \"'\")\n stringDelim = token;\n return token;\n }\n\n /**\n * Pushes a token back to the stack.\n * @param {string} token Token\n * @returns {undefined}\n * @inner\n */\n function push(token) {\n stack.push(token);\n }\n\n /**\n * Peeks for the next token.\n * @returns {string|null} Token or `null` on eof\n * @inner\n */\n function peek() {\n if (!stack.length) {\n var token = next();\n if (token === null)\n return null;\n push(token);\n }\n return stack[0];\n }\n\n /**\n * Skips a token.\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] Whether the token is optional\n * @returns {boolean} `true` when skipped, `false` if not\n * @throws {Error} When a required token is not present\n * @inner\n */\n function skip(expected, optional) {\n var actual = peek(),\n equals = actual === expected;\n if (equals) {\n next();\n return true;\n }\n if (!optional)\n throw illegal(\"token '\" + actual + \"', '\" + expected + \"' expected\");\n return false;\n }\n\n /**\n * Gets a comment.\n * @param {number} [trailingLine] Line number if looking for a trailing comment\n * @returns {string|null} Comment text\n * @inner\n */\n function cmnt(trailingLine) {\n var ret = null;\n if (trailingLine === undefined) {\n if (commentLine === line - 1 && (alternateCommentMode || commentType === \"*\" || commentLineEmpty)) {\n ret = commentText;\n }\n } else {\n /* istanbul ignore else */\n if (commentLine < trailingLine) {\n peek();\n }\n if (commentLine === trailingLine && !commentLineEmpty && (alternateCommentMode || commentType === \"/\")) {\n ret = commentText;\n }\n }\n return ret;\n }\n\n return Object.defineProperty({\n next: next,\n peek: peek,\n push: push,\n skip: skip,\n cmnt: cmnt\n }, \"line\", {\n get: function() { return line; }\n });\n /* eslint-enable callback-return */\n}\n","'use strict';\n\nvar elliptic = exports;\n\nelliptic.version = require('../package.json').version;\nelliptic.utils = require('./elliptic/utils');\nelliptic.rand = require('brorand');\nelliptic.curve = require('./elliptic/curve');\nelliptic.curves = require('./elliptic/curves');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg !== 'string') {\n for (var i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n return res;\n }\n if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (var i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else {\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n var hi = c >> 8;\n var lo = c & 0xff;\n if (hi)\n res.push(hi, lo);\n else\n res.push(lo);\n }\n }\n return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n if (enc === 'hex')\n return toHex(arr);\n else\n return arr;\n};\n","var r;\n\nmodule.exports = function rand(len) {\n if (!r)\n r = new Rand(null);\n\n return r.generate(len);\n};\n\nfunction Rand(rand) {\n this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n if (this.rand.getBytes)\n return this.rand.getBytes(n);\n\n var res = new Uint8Array(n);\n for (var i = 0; i < res.length; i++)\n res[i] = this.rand.getByte();\n return res;\n};\n\nif (typeof self === 'object') {\n if (self.crypto && self.crypto.getRandomValues) {\n // Modern browsers\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.crypto.getRandomValues(arr);\n return arr;\n };\n } else if (self.msCrypto && self.msCrypto.getRandomValues) {\n // IE\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.msCrypto.getRandomValues(arr);\n return arr;\n };\n\n // Safari's WebWorkers do not have `crypto`\n } else if (typeof window === 'object') {\n // Old junk\n Rand.prototype._rand = function() {\n throw new Error('Not implemented yet');\n };\n }\n} else {\n // Node.js or Web worker with no crypto support\n try {\n var crypto = require('crypto');\n if (typeof crypto.randomBytes !== 'function')\n throw new Error('Not supported');\n\n Rand.prototype._rand = function _rand(n) {\n return crypto.randomBytes(n);\n };\n } catch (e) {\n }\n}\n","'use strict';\n\nvar curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\nvar assert = require('minimalistic-assert');\n\nvar sum32 = utils.sum32;\nvar sum32_4 = utils.sum32_4;\nvar sum32_5 = utils.sum32_5;\nvar ch32 = shaCommon.ch32;\nvar maj32 = shaCommon.maj32;\nvar s0_256 = shaCommon.s0_256;\nvar s1_256 = shaCommon.s1_256;\nvar g0_256 = shaCommon.g0_256;\nvar g1_256 = shaCommon.g1_256;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_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\nfunction SHA256() {\n if (!(this instanceof SHA256))\n return new SHA256();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n ];\n this.k = sha256_K;\n this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\nSHA256.blockSize = 512;\nSHA256.outSize = 256;\nSHA256.hmacStrength = 192;\nSHA256.padLength = 64;\n\nSHA256.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i++)\n W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n var f = this.h[5];\n var g = this.h[6];\n var h = this.h[7];\n\n assert(this.k.length === W.length);\n for (i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);\n var T2 = sum32(s0_256(a), maj32(a, b, c));\n h = g;\n g = f;\n f = e;\n e = sum32(d, T1);\n d = c;\n c = b;\n b = a;\n a = sum32(T1, T2);\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n this.h[5] = sum32(this.h[5], f);\n this.h[6] = sum32(this.h[6], g);\n this.h[7] = sum32(this.h[7], h);\n};\n\nSHA256.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar assert = require('minimalistic-assert');\n\nvar rotr64_hi = utils.rotr64_hi;\nvar rotr64_lo = utils.rotr64_lo;\nvar shr64_hi = utils.shr64_hi;\nvar shr64_lo = utils.shr64_lo;\nvar sum64 = utils.sum64;\nvar sum64_hi = utils.sum64_hi;\nvar sum64_lo = utils.sum64_lo;\nvar sum64_4_hi = utils.sum64_4_hi;\nvar sum64_4_lo = utils.sum64_4_lo;\nvar sum64_5_hi = utils.sum64_5_hi;\nvar sum64_5_lo = utils.sum64_5_lo;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n if (!(this instanceof SHA512))\n return new SHA512();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xf3bcc908,\n 0xbb67ae85, 0x84caa73b,\n 0x3c6ef372, 0xfe94f82b,\n 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1,\n 0x9b05688c, 0x2b3e6c1f,\n 0x1f83d9ab, 0xfb41bd6b,\n 0x5be0cd19, 0x137e2179 ];\n this.k = sha512_K;\n this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\nSHA512.blockSize = 1024;\nSHA512.outSize = 512;\nSHA512.hmacStrength = 192;\nSHA512.padLength = 128;\n\nSHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {\n var W = this.W;\n\n // 32 x 32bit words\n for (var i = 0; i < 32; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n var c3_lo = W[i - 31];\n\n W[i] = sum64_4_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n }\n};\n\nSHA512.prototype._update = function _update(msg, start) {\n this._prepareBlock(msg, start);\n\n var W = this.W;\n\n var ah = this.h[0];\n var al = this.h[1];\n var bh = this.h[2];\n var bl = this.h[3];\n var ch = this.h[4];\n var cl = this.h[5];\n var dh = this.h[6];\n var dl = this.h[7];\n var eh = this.h[8];\n var el = this.h[9];\n var fh = this.h[10];\n var fl = this.h[11];\n var gh = this.h[12];\n var gl = this.h[13];\n var hh = this.h[14];\n var hl = this.h[15];\n\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh;\n var c0_lo = hl;\n var c1_hi = s1_512_hi(eh, el);\n var c1_lo = s1_512_lo(eh, el);\n var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);\n var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);\n var c3_hi = this.k[i];\n var c3_lo = this.k[i + 1];\n var c4_hi = W[i];\n var c4_lo = W[i + 1];\n\n var T1_hi = sum64_5_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n\n c0_hi = s0_512_hi(ah, al);\n c0_lo = s0_512_lo(ah, al);\n c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);\n c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);\n\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);\n var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n\n hh = gh;\n hl = gl;\n\n gh = fh;\n gl = fl;\n\n fh = eh;\n fl = el;\n\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n dh = ch;\n dl = cl;\n\n ch = bh;\n cl = bl;\n\n bh = ah;\n bl = al;\n\n ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);\n al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);\n }\n\n sum64(this.h, 0, ah, al);\n sum64(this.h, 2, bh, bl);\n sum64(this.h, 4, ch, cl);\n sum64(this.h, 6, dh, dl);\n sum64(this.h, 8, eh, el);\n sum64(this.h, 10, fh, fl);\n sum64(this.h, 12, gh, gl);\n sum64(this.h, 14, hh, hl);\n};\n\nSHA512.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n\nfunction ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ ((~xh) & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ ((~xl) & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28);\n var c1_hi = rotr64_hi(xl, xh, 2); // 34\n var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28);\n var c1_lo = rotr64_lo(xl, xh, 2); // 34\n var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14);\n var c1_hi = rotr64_hi(xh, xl, 18);\n var c2_hi = rotr64_hi(xl, xh, 9); // 41\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14);\n var c1_lo = rotr64_lo(xh, xl, 18);\n var c2_lo = rotr64_lo(xl, xh, 9); // 41\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1);\n var c1_hi = rotr64_hi(xh, xl, 8);\n var c2_hi = shr64_hi(xh, xl, 7);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1);\n var c1_lo = rotr64_lo(xh, xl, 8);\n var c2_lo = shr64_lo(xh, xl, 7);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19);\n var c1_hi = rotr64_hi(xl, xh, 29); // 61\n var c2_hi = shr64_hi(xh, xl, 6);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19);\n var c1_lo = rotr64_lo(xl, xh, 29); // 61\n var c2_lo = shr64_lo(xh, xl, 6);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n","module.exports = require('crypto').createHash\n","var sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20\n}\n\nvar createHmac = require('create-hmac')\nvar Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar toBuffer = require('./to-buffer')\n\nfunction pbkdf2 (password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n\n digest = digest || 'sha1'\n\n var DK = Buffer.allocUnsafe(keylen)\n var block1 = Buffer.allocUnsafe(salt.length + 4)\n salt.copy(block1, 0, 0, salt.length)\n\n var destPos = 0\n var hLen = sizes[digest]\n var l = Math.ceil(keylen / hLen)\n\n for (var i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length)\n\n var T = createHmac(digest, password).update(block1).digest()\n var U = T\n\n for (var j = 1; j < iterations; j++) {\n U = createHmac(digest, password).update(U).digest()\n for (var k = 0; k < hLen; k++) T[k] ^= U[k]\n }\n\n T.copy(DK, destPos)\n destPos += hLen\n }\n\n return DK\n}\n\nmodule.exports = pbkdf2\n","module.exports = require(\"fs\");","module.exports = require(\"path\");","const crypto = require('crypto')\nconst MAX_VALUE = 0x7fffffff\nconst DEFAULT_PROMISE_INTERVAL = 5000\n/* eslint-disable camelcase */\n\nfunction checkAndInit (key, salt, N, r, p, dkLen, progressCallback) {\n if (N === 0 || (N & (N - 1)) !== 0) throw Error('N must be > 0 and a power of 2')\n\n if (N > MAX_VALUE / 128 / r) throw Error('Parameter N is too large')\n if (r > MAX_VALUE / 128 / p) throw Error('Parameter r is too large')\n\n let XY = Buffer.alloc(256 * r)\n let V = Buffer.alloc(128 * r * N)\n\n // pseudo global\n let B32 = new Int32Array(16) // salsa20_8\n let x = new Int32Array(16) // salsa20_8\n let _X = Buffer.alloc(64) // blockmix_salsa8\n\n // pseudo global\n let B = crypto.pbkdf2Sync(key, salt, 1, p * 128 * r, 'sha256')\n\n let tickCallback\n if (progressCallback) {\n let totalOps = p * N * 2\n let currentOp = 0\n\n tickCallback = function () {\n ++currentOp\n\n // send progress notifications once every 1,000 ops\n if (currentOp % 1000 === 0) {\n progressCallback({\n current: currentOp,\n total: totalOps,\n percent: (currentOp / totalOps) * 100.0\n })\n }\n }\n }\n return {\n XY,\n V,\n B32,\n x,\n _X,\n B,\n tickCallback\n }\n}\n\nasync function smix (B, Bi, r, N, V, XY, _X, B32, x, tickCallback, promiseInterval) {\n promiseInterval = promiseInterval || DEFAULT_PROMISE_INTERVAL\n let Xi = 0\n let Yi = 128 * r\n let i\n\n B.copy(XY, Xi, Bi, Bi + Yi)\n\n for (i = 0; i < N; i++) {\n XY.copy(V, i * Yi, Xi, Xi + Yi)\n if (i % promiseInterval === 0) {\n await new Promise(resolve => setImmediate(resolve))\n }\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n for (i = 0; i < N; i++) {\n let offset = Xi + (2 * r - 1) * 64\n let j = XY.readUInt32LE(offset) & (N - 1)\n blockxor(V, j * Yi, XY, Xi, Yi)\n if (i % promiseInterval === 0) {\n await new Promise(resolve => setImmediate(resolve))\n }\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n XY.copy(B, Bi, Xi, Xi + Yi)\n}\n\nfunction smixSync (B, Bi, r, N, V, XY, _X, B32, x, tickCallback) {\n let Xi = 0\n let Yi = 128 * r\n let i\n\n B.copy(XY, Xi, Bi, Bi + Yi)\n\n for (i = 0; i < N; i++) {\n XY.copy(V, i * Yi, Xi, Xi + Yi)\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n for (i = 0; i < N; i++) {\n let offset = Xi + (2 * r - 1) * 64\n let j = XY.readUInt32LE(offset) & (N - 1)\n blockxor(V, j * Yi, XY, Xi, Yi)\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n XY.copy(B, Bi, Xi, Xi + Yi)\n}\n\nfunction blockmix_salsa8 (BY, Bi, Yi, r, _X, B32, x) {\n let i\n\n arraycopy(BY, Bi + (2 * r - 1) * 64, _X, 0, 64)\n\n for (i = 0; i < 2 * r; i++) {\n blockxor(BY, i * 64, _X, 0, 64)\n salsa20_8(_X, B32, x)\n arraycopy(_X, 0, BY, Yi + (i * 64), 64)\n }\n\n for (i = 0; i < r; i++) {\n arraycopy(BY, Yi + (i * 2) * 64, BY, Bi + (i * 64), 64)\n }\n\n for (i = 0; i < r; i++) {\n arraycopy(BY, Yi + (i * 2 + 1) * 64, BY, Bi + (i + r) * 64, 64)\n }\n}\n\nfunction R (a, b) {\n return (a << b) | (a >>> (32 - b))\n}\n\nfunction salsa20_8 (B, B32, x) {\n let i\n\n for (i = 0; i < 16; i++) {\n B32[i] = (B[i * 4 + 0] & 0xff) << 0\n B32[i] |= (B[i * 4 + 1] & 0xff) << 8\n B32[i] |= (B[i * 4 + 2] & 0xff) << 16\n B32[i] |= (B[i * 4 + 3] & 0xff) << 24\n // B32[i] = B.readUInt32LE(i*4) <--- this is signficantly slower even in Node.js\n }\n\n arraycopy(B32, 0, x, 0, 16)\n\n for (i = 8; i > 0; i -= 2) {\n x[4] ^= R(x[0] + x[12], 7)\n x[8] ^= R(x[4] + x[0], 9)\n x[12] ^= R(x[8] + x[4], 13)\n x[0] ^= R(x[12] + x[8], 18)\n x[9] ^= R(x[5] + x[1], 7)\n x[13] ^= R(x[9] + x[5], 9)\n x[1] ^= R(x[13] + x[9], 13)\n x[5] ^= R(x[1] + x[13], 18)\n x[14] ^= R(x[10] + x[6], 7)\n x[2] ^= R(x[14] + x[10], 9)\n x[6] ^= R(x[2] + x[14], 13)\n x[10] ^= R(x[6] + x[2], 18)\n x[3] ^= R(x[15] + x[11], 7)\n x[7] ^= R(x[3] + x[15], 9)\n x[11] ^= R(x[7] + x[3], 13)\n x[15] ^= R(x[11] + x[7], 18)\n x[1] ^= R(x[0] + x[3], 7)\n x[2] ^= R(x[1] + x[0], 9)\n x[3] ^= R(x[2] + x[1], 13)\n x[0] ^= R(x[3] + x[2], 18)\n x[6] ^= R(x[5] + x[4], 7)\n x[7] ^= R(x[6] + x[5], 9)\n x[4] ^= R(x[7] + x[6], 13)\n x[5] ^= R(x[4] + x[7], 18)\n x[11] ^= R(x[10] + x[9], 7)\n x[8] ^= R(x[11] + x[10], 9)\n x[9] ^= R(x[8] + x[11], 13)\n x[10] ^= R(x[9] + x[8], 18)\n x[12] ^= R(x[15] + x[14], 7)\n x[13] ^= R(x[12] + x[15], 9)\n x[14] ^= R(x[13] + x[12], 13)\n x[15] ^= R(x[14] + x[13], 18)\n }\n\n for (i = 0; i < 16; ++i) B32[i] = x[i] + B32[i]\n\n for (i = 0; i < 16; i++) {\n let bi = i * 4\n B[bi + 0] = (B32[i] >> 0 & 0xff)\n B[bi + 1] = (B32[i] >> 8 & 0xff)\n B[bi + 2] = (B32[i] >> 16 & 0xff)\n B[bi + 3] = (B32[i] >> 24 & 0xff)\n // B.writeInt32LE(B32[i], i*4) //<--- this is signficantly slower even in Node.js\n }\n}\n\n// naive approach... going back to loop unrolling may yield additional performance\nfunction blockxor (S, Si, D, Di, len) {\n for (let i = 0; i < len; i++) {\n D[Di + i] ^= S[Si + i]\n }\n}\n\nfunction arraycopy (src, srcPos, dest, destPos, length) {\n if (Buffer.isBuffer(src) && Buffer.isBuffer(dest)) {\n src.copy(dest, destPos, srcPos, srcPos + length)\n } else {\n while (length--) {\n dest[destPos++] = src[srcPos++]\n }\n }\n}\n\nmodule.exports = {\n checkAndInit,\n smix,\n smixSync\n}\n","const createKeccak = require('./keccak')\nconst createShake = require('./shake')\n\nmodule.exports = function (KeccakState) {\n const Keccak = createKeccak(KeccakState)\n const Shake = createShake(KeccakState)\n\n return function (algorithm, options) {\n const hash = typeof algorithm === 'string' ? algorithm.toLowerCase() : algorithm\n switch (hash) {\n case 'keccak224': return new Keccak(1152, 448, null, 224, options)\n case 'keccak256': return new Keccak(1088, 512, null, 256, options)\n case 'keccak384': return new Keccak(832, 768, null, 384, options)\n case 'keccak512': return new Keccak(576, 1024, null, 512, options)\n\n case 'sha3-224': return new Keccak(1152, 448, 0x06, 224, options)\n case 'sha3-256': return new Keccak(1088, 512, 0x06, 256, options)\n case 'sha3-384': return new Keccak(832, 768, 0x06, 384, options)\n case 'sha3-512': return new Keccak(576, 1024, 0x06, 512, options)\n\n case 'shake128': return new Shake(1344, 256, 0x1f, options)\n case 'shake256': return new Shake(1088, 512, 0x1f, options)\n\n default: throw new Error('Invald algorithm: ' + algorithm)\n }\n }\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nmodule.exports = Readable;\n\n/**/\nvar Duplex;\n/**/\n\nReadable.ReadableState = ReadableState;\n\n/**/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/**/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/**/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* */\n\n/**/\nvar Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n\n/**/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\n}","\"use strict\";\nvar $protobuf = require(\"../..\");\nmodule.exports = exports = $protobuf.descriptor = $protobuf.Root.fromJSON(require(\"../../google/protobuf/descriptor.json\")).lookup(\".google.protobuf\");\n\nvar Namespace = $protobuf.Namespace,\n Root = $protobuf.Root,\n Enum = $protobuf.Enum,\n Type = $protobuf.Type,\n Field = $protobuf.Field,\n MapField = $protobuf.MapField,\n OneOf = $protobuf.OneOf,\n Service = $protobuf.Service,\n Method = $protobuf.Method;\n\n// --- Root ---\n\n/**\n * Properties of a FileDescriptorSet message.\n * @interface IFileDescriptorSet\n * @property {IFileDescriptorProto[]} file Files\n */\n\n/**\n * Properties of a FileDescriptorProto message.\n * @interface IFileDescriptorProto\n * @property {string} [name] File name\n * @property {string} [package] Package\n * @property {*} [dependency] Not supported\n * @property {*} [publicDependency] Not supported\n * @property {*} [weakDependency] Not supported\n * @property {IDescriptorProto[]} [messageType] Nested message types\n * @property {IEnumDescriptorProto[]} [enumType] Nested enums\n * @property {IServiceDescriptorProto[]} [service] Nested services\n * @property {IFieldDescriptorProto[]} [extension] Nested extension fields\n * @property {IFileOptions} [options] Options\n * @property {*} [sourceCodeInfo] Not supported\n * @property {string} [syntax=\"proto2\"] Syntax\n */\n\n/**\n * Properties of a FileOptions message.\n * @interface IFileOptions\n * @property {string} [javaPackage]\n * @property {string} [javaOuterClassname]\n * @property {boolean} [javaMultipleFiles]\n * @property {boolean} [javaGenerateEqualsAndHash]\n * @property {boolean} [javaStringCheckUtf8]\n * @property {IFileOptionsOptimizeMode} [optimizeFor=1]\n * @property {string} [goPackage]\n * @property {boolean} [ccGenericServices]\n * @property {boolean} [javaGenericServices]\n * @property {boolean} [pyGenericServices]\n * @property {boolean} [deprecated]\n * @property {boolean} [ccEnableArenas]\n * @property {string} [objcClassPrefix]\n * @property {string} [csharpNamespace]\n */\n\n/**\n * Values of he FileOptions.OptimizeMode enum.\n * @typedef IFileOptionsOptimizeMode\n * @type {number}\n * @property {number} SPEED=1\n * @property {number} CODE_SIZE=2\n * @property {number} LITE_RUNTIME=3\n */\n\n/**\n * Creates a root from a descriptor set.\n * @param {IFileDescriptorSet|Reader|Uint8Array} descriptor Descriptor\n * @returns {Root} Root instance\n */\nRoot.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.FileDescriptorSet.decode(descriptor);\n\n var root = new Root();\n\n if (descriptor.file) {\n var fileDescriptor,\n filePackage;\n for (var j = 0, i; j < descriptor.file.length; ++j) {\n filePackage = root;\n if ((fileDescriptor = descriptor.file[j])[\"package\"] && fileDescriptor[\"package\"].length)\n filePackage = root.define(fileDescriptor[\"package\"]);\n if (fileDescriptor.name && fileDescriptor.name.length)\n root.files.push(filePackage.filename = fileDescriptor.name);\n if (fileDescriptor.messageType)\n for (i = 0; i < fileDescriptor.messageType.length; ++i)\n filePackage.add(Type.fromDescriptor(fileDescriptor.messageType[i], fileDescriptor.syntax));\n if (fileDescriptor.enumType)\n for (i = 0; i < fileDescriptor.enumType.length; ++i)\n filePackage.add(Enum.fromDescriptor(fileDescriptor.enumType[i]));\n if (fileDescriptor.extension)\n for (i = 0; i < fileDescriptor.extension.length; ++i)\n filePackage.add(Field.fromDescriptor(fileDescriptor.extension[i]));\n if (fileDescriptor.service)\n for (i = 0; i < fileDescriptor.service.length; ++i)\n filePackage.add(Service.fromDescriptor(fileDescriptor.service[i]));\n var opts = fromDescriptorOptions(fileDescriptor.options, exports.FileOptions);\n if (opts) {\n var ks = Object.keys(opts);\n for (i = 0; i < ks.length; ++i)\n filePackage.setOption(ks[i], opts[ks[i]]);\n }\n }\n }\n\n return root;\n};\n\n/**\n * Converts a root to a descriptor set.\n * @returns {Message} Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n */\nRoot.prototype.toDescriptor = function toDescriptor(syntax) {\n var set = exports.FileDescriptorSet.create();\n Root_toDescriptorRecursive(this, set.file, syntax);\n return set;\n};\n\n// Traverses a namespace and assembles the descriptor set\nfunction Root_toDescriptorRecursive(ns, files, syntax) {\n\n // Create a new file\n var file = exports.FileDescriptorProto.create({ name: ns.filename || (ns.fullName.substring(1).replace(/\\./g, \"_\") || \"root\") + \".proto\" });\n if (syntax)\n file.syntax = syntax;\n if (!(ns instanceof Root))\n file[\"package\"] = ns.fullName.substring(1);\n\n // Add nested types\n for (var i = 0, nested; i < ns.nestedArray.length; ++i)\n if ((nested = ns._nestedArray[i]) instanceof Type)\n file.messageType.push(nested.toDescriptor(syntax));\n else if (nested instanceof Enum)\n file.enumType.push(nested.toDescriptor());\n else if (nested instanceof Field)\n file.extension.push(nested.toDescriptor(syntax));\n else if (nested instanceof Service)\n file.service.push(nested.toDescriptor());\n else if (nested instanceof /* plain */ Namespace)\n Root_toDescriptorRecursive(nested, files, syntax); // requires new file\n\n // Keep package-level options\n file.options = toDescriptorOptions(ns.options, exports.FileOptions);\n\n // And keep the file only if there is at least one nested object\n if (file.messageType.length + file.enumType.length + file.extension.length + file.service.length)\n files.push(file);\n}\n\n// --- Type ---\n\n/**\n * Properties of a DescriptorProto message.\n * @interface IDescriptorProto\n * @property {string} [name] Message type name\n * @property {IFieldDescriptorProto[]} [field] Fields\n * @property {IFieldDescriptorProto[]} [extension] Extension fields\n * @property {IDescriptorProto[]} [nestedType] Nested message types\n * @property {IEnumDescriptorProto[]} [enumType] Nested enums\n * @property {IDescriptorProtoExtensionRange[]} [extensionRange] Extension ranges\n * @property {IOneofDescriptorProto[]} [oneofDecl] Oneofs\n * @property {IMessageOptions} [options] Not supported\n * @property {IDescriptorProtoReservedRange[]} [reservedRange] Reserved ranges\n * @property {string[]} [reservedName] Reserved names\n */\n\n/**\n * Properties of a MessageOptions message.\n * @interface IMessageOptions\n * @property {boolean} [mapEntry=false] Whether this message is a map entry\n */\n\n/**\n * Properties of an ExtensionRange message.\n * @interface IDescriptorProtoExtensionRange\n * @property {number} [start] Start field id\n * @property {number} [end] End field id\n */\n\n/**\n * Properties of a ReservedRange message.\n * @interface IDescriptorProtoReservedRange\n * @property {number} [start] Start field id\n * @property {number} [end] End field id\n */\n\nvar unnamedMessageIndex = 0;\n\n/**\n * Creates a type from a descriptor.\n * @param {IDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n * @returns {Type} Type instance\n */\nType.fromDescriptor = function fromDescriptor(descriptor, syntax) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.DescriptorProto.decode(descriptor);\n\n // Create the message type\n var type = new Type(descriptor.name.length ? descriptor.name : \"Type\" + unnamedMessageIndex++, fromDescriptorOptions(descriptor.options, exports.MessageOptions)),\n i;\n\n /* Oneofs */ if (descriptor.oneofDecl)\n for (i = 0; i < descriptor.oneofDecl.length; ++i)\n type.add(OneOf.fromDescriptor(descriptor.oneofDecl[i]));\n /* Fields */ if (descriptor.field)\n for (i = 0; i < descriptor.field.length; ++i) {\n var field = Field.fromDescriptor(descriptor.field[i], syntax);\n type.add(field);\n if (descriptor.field[i].hasOwnProperty(\"oneofIndex\")) // eslint-disable-line no-prototype-builtins\n type.oneofsArray[descriptor.field[i].oneofIndex].add(field);\n }\n /* Extension fields */ if (descriptor.extension)\n for (i = 0; i < descriptor.extension.length; ++i)\n type.add(Field.fromDescriptor(descriptor.extension[i], syntax));\n /* Nested types */ if (descriptor.nestedType)\n for (i = 0; i < descriptor.nestedType.length; ++i) {\n type.add(Type.fromDescriptor(descriptor.nestedType[i], syntax));\n if (descriptor.nestedType[i].options && descriptor.nestedType[i].options.mapEntry)\n type.setOption(\"map_entry\", true);\n }\n /* Nested enums */ if (descriptor.enumType)\n for (i = 0; i < descriptor.enumType.length; ++i)\n type.add(Enum.fromDescriptor(descriptor.enumType[i]));\n /* Extension ranges */ if (descriptor.extensionRange && descriptor.extensionRange.length) {\n type.extensions = [];\n for (i = 0; i < descriptor.extensionRange.length; ++i)\n type.extensions.push([ descriptor.extensionRange[i].start, descriptor.extensionRange[i].end ]);\n }\n /* Reserved... */ if (descriptor.reservedRange && descriptor.reservedRange.length || descriptor.reservedName && descriptor.reservedName.length) {\n type.reserved = [];\n /* Ranges */ if (descriptor.reservedRange)\n for (i = 0; i < descriptor.reservedRange.length; ++i)\n type.reserved.push([ descriptor.reservedRange[i].start, descriptor.reservedRange[i].end ]);\n /* Names */ if (descriptor.reservedName)\n for (i = 0; i < descriptor.reservedName.length; ++i)\n type.reserved.push(descriptor.reservedName[i]);\n }\n\n return type;\n};\n\n/**\n * Converts a type to a descriptor.\n * @returns {Message} Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n */\nType.prototype.toDescriptor = function toDescriptor(syntax) {\n var descriptor = exports.DescriptorProto.create({ name: this.name }),\n i;\n\n /* Fields */ for (i = 0; i < this.fieldsArray.length; ++i) {\n var fieldDescriptor;\n descriptor.field.push(fieldDescriptor = this._fieldsArray[i].toDescriptor(syntax));\n if (this._fieldsArray[i] instanceof MapField) { // map fields are repeated FieldNameEntry\n var keyType = toDescriptorType(this._fieldsArray[i].keyType, this._fieldsArray[i].resolvedKeyType),\n valueType = toDescriptorType(this._fieldsArray[i].type, this._fieldsArray[i].resolvedType),\n valueTypeName = valueType === /* type */ 11 || valueType === /* enum */ 14\n ? this._fieldsArray[i].resolvedType && shortname(this.parent, this._fieldsArray[i].resolvedType) || this._fieldsArray[i].type\n : undefined;\n descriptor.nestedType.push(exports.DescriptorProto.create({\n name: fieldDescriptor.typeName,\n field: [\n exports.FieldDescriptorProto.create({ name: \"key\", number: 1, label: 1, type: keyType }), // can't reference a type or enum\n exports.FieldDescriptorProto.create({ name: \"value\", number: 2, label: 1, type: valueType, typeName: valueTypeName })\n ],\n options: exports.MessageOptions.create({ mapEntry: true })\n }));\n }\n }\n /* Oneofs */ for (i = 0; i < this.oneofsArray.length; ++i)\n descriptor.oneofDecl.push(this._oneofsArray[i].toDescriptor());\n /* Nested... */ for (i = 0; i < this.nestedArray.length; ++i) {\n /* Extension fields */ if (this._nestedArray[i] instanceof Field)\n descriptor.field.push(this._nestedArray[i].toDescriptor(syntax));\n /* Types */ else if (this._nestedArray[i] instanceof Type)\n descriptor.nestedType.push(this._nestedArray[i].toDescriptor(syntax));\n /* Enums */ else if (this._nestedArray[i] instanceof Enum)\n descriptor.enumType.push(this._nestedArray[i].toDescriptor());\n // plain nested namespaces become packages instead in Root#toDescriptor\n }\n /* Extension ranges */ if (this.extensions)\n for (i = 0; i < this.extensions.length; ++i)\n descriptor.extensionRange.push(exports.DescriptorProto.ExtensionRange.create({ start: this.extensions[i][0], end: this.extensions[i][1] }));\n /* Reserved... */ if (this.reserved)\n for (i = 0; i < this.reserved.length; ++i)\n /* Names */ if (typeof this.reserved[i] === \"string\")\n descriptor.reservedName.push(this.reserved[i]);\n /* Ranges */ else\n descriptor.reservedRange.push(exports.DescriptorProto.ReservedRange.create({ start: this.reserved[i][0], end: this.reserved[i][1] }));\n\n descriptor.options = toDescriptorOptions(this.options, exports.MessageOptions);\n\n return descriptor;\n};\n\n// --- Field ---\n\n/**\n * Properties of a FieldDescriptorProto message.\n * @interface IFieldDescriptorProto\n * @property {string} [name] Field name\n * @property {number} [number] Field id\n * @property {IFieldDescriptorProtoLabel} [label] Field rule\n * @property {IFieldDescriptorProtoType} [type] Field basic type\n * @property {string} [typeName] Field type name\n * @property {string} [extendee] Extended type name\n * @property {string} [defaultValue] Literal default value\n * @property {number} [oneofIndex] Oneof index if part of a oneof\n * @property {*} [jsonName] Not supported\n * @property {IFieldOptions} [options] Field options\n */\n\n/**\n * Values of the FieldDescriptorProto.Label enum.\n * @typedef IFieldDescriptorProtoLabel\n * @type {number}\n * @property {number} LABEL_OPTIONAL=1\n * @property {number} LABEL_REQUIRED=2\n * @property {number} LABEL_REPEATED=3\n */\n\n/**\n * Values of the FieldDescriptorProto.Type enum.\n * @typedef IFieldDescriptorProtoType\n * @type {number}\n * @property {number} TYPE_DOUBLE=1\n * @property {number} TYPE_FLOAT=2\n * @property {number} TYPE_INT64=3\n * @property {number} TYPE_UINT64=4\n * @property {number} TYPE_INT32=5\n * @property {number} TYPE_FIXED64=6\n * @property {number} TYPE_FIXED32=7\n * @property {number} TYPE_BOOL=8\n * @property {number} TYPE_STRING=9\n * @property {number} TYPE_GROUP=10\n * @property {number} TYPE_MESSAGE=11\n * @property {number} TYPE_BYTES=12\n * @property {number} TYPE_UINT32=13\n * @property {number} TYPE_ENUM=14\n * @property {number} TYPE_SFIXED32=15\n * @property {number} TYPE_SFIXED64=16\n * @property {number} TYPE_SINT32=17\n * @property {number} TYPE_SINT64=18\n */\n\n/**\n * Properties of a FieldOptions message.\n * @interface IFieldOptions\n * @property {boolean} [packed] Whether packed or not (defaults to `false` for proto2 and `true` for proto3)\n * @property {IFieldOptionsJSType} [jstype] JavaScript value type (not used by protobuf.js)\n */\n\n/**\n * Values of the FieldOptions.JSType enum.\n * @typedef IFieldOptionsJSType\n * @type {number}\n * @property {number} JS_NORMAL=0\n * @property {number} JS_STRING=1\n * @property {number} JS_NUMBER=2\n */\n\n// copied here from parse.js\nvar numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/;\n\n/**\n * Creates a field from a descriptor.\n * @param {IFieldDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n * @returns {Field} Field instance\n */\nField.fromDescriptor = function fromDescriptor(descriptor, syntax) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.DescriptorProto.decode(descriptor);\n\n if (typeof descriptor.number !== \"number\")\n throw Error(\"missing field id\");\n\n // Rewire field type\n var fieldType;\n if (descriptor.typeName && descriptor.typeName.length)\n fieldType = descriptor.typeName;\n else\n fieldType = fromDescriptorType(descriptor.type);\n\n // Rewire field rule\n var fieldRule;\n switch (descriptor.label) {\n // 0 is reserved for errors\n case 1: fieldRule = undefined; break;\n case 2: fieldRule = \"required\"; break;\n case 3: fieldRule = \"repeated\"; break;\n default: throw Error(\"illegal label: \" + descriptor.label);\n }\n\n\tvar extendee = descriptor.extendee;\n\tif (descriptor.extendee !== undefined) {\n\t\textendee = extendee.length ? extendee : undefined;\n\t}\n var field = new Field(\n $protobuf.util.camelCase(descriptor.name.length ? descriptor.name : \"field\" + descriptor.number),\n descriptor.number,\n fieldType,\n fieldRule,\n extendee\n );\n\n field.options = fromDescriptorOptions(descriptor.options, exports.FieldOptions);\n\n if (descriptor.defaultValue && descriptor.defaultValue.length) {\n var defaultValue = descriptor.defaultValue;\n switch (defaultValue) {\n case \"true\": case \"TRUE\":\n defaultValue = true;\n break;\n case \"false\": case \"FALSE\":\n defaultValue = false;\n break;\n default:\n var match = numberRe.exec(defaultValue);\n if (match)\n defaultValue = parseInt(defaultValue); // eslint-disable-line radix\n break;\n }\n field.setOption(\"default\", defaultValue);\n }\n\n if (packableDescriptorType(descriptor.type)) {\n if (syntax === \"proto3\") { // defaults to packed=true (internal preset is packed=true)\n if (descriptor.options && !descriptor.options.packed)\n field.setOption(\"packed\", false);\n } else if (!(descriptor.options && descriptor.options.packed)) // defaults to packed=false\n field.setOption(\"packed\", false);\n }\n\n return field;\n};\n\n/**\n * Converts a field to a descriptor.\n * @returns {Message} Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n */\nField.prototype.toDescriptor = function toDescriptor(syntax) {\n var descriptor = exports.FieldDescriptorProto.create({ name: this.name, number: this.id });\n\n if (this.map) {\n\n descriptor.type = 11; // message\n descriptor.typeName = $protobuf.util.ucFirst(this.name); // fieldName -> FieldNameEntry (built in Type#toDescriptor)\n descriptor.label = 3; // repeated\n\n } else {\n\n // Rewire field type\n switch (descriptor.type = toDescriptorType(this.type, this.resolve().resolvedType)) {\n case 10: // group\n case 11: // type\n case 14: // enum\n descriptor.typeName = this.resolvedType ? shortname(this.parent, this.resolvedType) : this.type;\n break;\n }\n\n // Rewire field rule\n switch (this.rule) {\n case \"repeated\": descriptor.label = 3; break;\n case \"required\": descriptor.label = 2; break;\n default: descriptor.label = 1; break;\n }\n\n }\n\n // Handle extension field\n descriptor.extendee = this.extensionField ? this.extensionField.parent.fullName : this.extend;\n\n // Handle part of oneof\n if (this.partOf)\n if ((descriptor.oneofIndex = this.parent.oneofsArray.indexOf(this.partOf)) < 0)\n throw Error(\"missing oneof\");\n\n if (this.options) {\n descriptor.options = toDescriptorOptions(this.options, exports.FieldOptions);\n if (this.options[\"default\"] != null)\n descriptor.defaultValue = String(this.options[\"default\"]);\n }\n\n if (syntax === \"proto3\") { // defaults to packed=true\n if (!this.packed)\n (descriptor.options || (descriptor.options = exports.FieldOptions.create())).packed = false;\n } else if (this.packed) // defaults to packed=false\n (descriptor.options || (descriptor.options = exports.FieldOptions.create())).packed = true;\n\n return descriptor;\n};\n\n// --- Enum ---\n\n/**\n * Properties of an EnumDescriptorProto message.\n * @interface IEnumDescriptorProto\n * @property {string} [name] Enum name\n * @property {IEnumValueDescriptorProto[]} [value] Enum values\n * @property {IEnumOptions} [options] Enum options\n */\n\n/**\n * Properties of an EnumValueDescriptorProto message.\n * @interface IEnumValueDescriptorProto\n * @property {string} [name] Name\n * @property {number} [number] Value\n * @property {*} [options] Not supported\n */\n\n/**\n * Properties of an EnumOptions message.\n * @interface IEnumOptions\n * @property {boolean} [allowAlias] Whether aliases are allowed\n * @property {boolean} [deprecated]\n */\n\nvar unnamedEnumIndex = 0;\n\n/**\n * Creates an enum from a descriptor.\n * @param {IEnumDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {Enum} Enum instance\n */\nEnum.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.EnumDescriptorProto.decode(descriptor);\n\n // Construct values object\n var values = {};\n if (descriptor.value)\n for (var i = 0; i < descriptor.value.length; ++i) {\n var name = descriptor.value[i].name,\n value = descriptor.value[i].number || 0;\n values[name && name.length ? name : \"NAME\" + value] = value;\n }\n\n return new Enum(\n descriptor.name && descriptor.name.length ? descriptor.name : \"Enum\" + unnamedEnumIndex++,\n values,\n fromDescriptorOptions(descriptor.options, exports.EnumOptions)\n );\n};\n\n/**\n * Converts an enum to a descriptor.\n * @returns {Message} Descriptor\n */\nEnum.prototype.toDescriptor = function toDescriptor() {\n\n // Values\n var values = [];\n for (var i = 0, ks = Object.keys(this.values); i < ks.length; ++i)\n values.push(exports.EnumValueDescriptorProto.create({ name: ks[i], number: this.values[ks[i]] }));\n\n return exports.EnumDescriptorProto.create({\n name: this.name,\n value: values,\n options: toDescriptorOptions(this.options, exports.EnumOptions)\n });\n};\n\n// --- OneOf ---\n\n/**\n * Properties of a OneofDescriptorProto message.\n * @interface IOneofDescriptorProto\n * @property {string} [name] Oneof name\n * @property {*} [options] Not supported\n */\n\nvar unnamedOneofIndex = 0;\n\n/**\n * Creates a oneof from a descriptor.\n * @param {IOneofDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {OneOf} OneOf instance\n */\nOneOf.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.OneofDescriptorProto.decode(descriptor);\n\n return new OneOf(\n // unnamedOneOfIndex is global, not per type, because we have no ref to a type here\n descriptor.name && descriptor.name.length ? descriptor.name : \"oneof\" + unnamedOneofIndex++\n // fromDescriptorOptions(descriptor.options, exports.OneofOptions) - only uninterpreted_option\n );\n};\n\n/**\n * Converts a oneof to a descriptor.\n * @returns {Message} Descriptor\n */\nOneOf.prototype.toDescriptor = function toDescriptor() {\n return exports.OneofDescriptorProto.create({\n name: this.name\n // options: toDescriptorOptions(this.options, exports.OneofOptions) - only uninterpreted_option\n });\n};\n\n// --- Service ---\n\n/**\n * Properties of a ServiceDescriptorProto message.\n * @interface IServiceDescriptorProto\n * @property {string} [name] Service name\n * @property {IMethodDescriptorProto[]} [method] Methods\n * @property {IServiceOptions} [options] Options\n */\n\n/**\n * Properties of a ServiceOptions message.\n * @interface IServiceOptions\n * @property {boolean} [deprecated]\n */\n\nvar unnamedServiceIndex = 0;\n\n/**\n * Creates a service from a descriptor.\n * @param {IServiceDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {Service} Service instance\n */\nService.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.ServiceDescriptorProto.decode(descriptor);\n\n var service = new Service(descriptor.name && descriptor.name.length ? descriptor.name : \"Service\" + unnamedServiceIndex++, fromDescriptorOptions(descriptor.options, exports.ServiceOptions));\n if (descriptor.method)\n for (var i = 0; i < descriptor.method.length; ++i)\n service.add(Method.fromDescriptor(descriptor.method[i]));\n\n return service;\n};\n\n/**\n * Converts a service to a descriptor.\n * @returns {Message} Descriptor\n */\nService.prototype.toDescriptor = function toDescriptor() {\n\n // Methods\n var methods = [];\n for (var i = 0; i < this.methodsArray; ++i)\n methods.push(this._methodsArray[i].toDescriptor());\n\n return exports.ServiceDescriptorProto.create({\n name: this.name,\n methods: methods,\n options: toDescriptorOptions(this.options, exports.ServiceOptions)\n });\n};\n\n// --- Method ---\n\n/**\n * Properties of a MethodDescriptorProto message.\n * @interface IMethodDescriptorProto\n * @property {string} [name] Method name\n * @property {string} [inputType] Request type name\n * @property {string} [outputType] Response type name\n * @property {IMethodOptions} [options] Not supported\n * @property {boolean} [clientStreaming=false] Whether requests are streamed\n * @property {boolean} [serverStreaming=false] Whether responses are streamed\n */\n\n/**\n * Properties of a MethodOptions message.\n * @interface IMethodOptions\n * @property {boolean} [deprecated]\n */\n\nvar unnamedMethodIndex = 0;\n\n/**\n * Creates a method from a descriptor.\n * @param {IMethodDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {Method} Reflected method instance\n */\nMethod.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.MethodDescriptorProto.decode(descriptor);\n\n return new Method(\n // unnamedMethodIndex is global, not per service, because we have no ref to a service here\n descriptor.name && descriptor.name.length ? descriptor.name : \"Method\" + unnamedMethodIndex++,\n \"rpc\",\n descriptor.inputType,\n descriptor.outputType,\n Boolean(descriptor.clientStreaming),\n Boolean(descriptor.serverStreaming),\n fromDescriptorOptions(descriptor.options, exports.MethodOptions)\n );\n};\n\n/**\n * Converts a method to a descriptor.\n * @returns {Message} Descriptor\n */\nMethod.prototype.toDescriptor = function toDescriptor() {\n return exports.MethodDescriptorProto.create({\n name: this.name,\n inputType: this.resolvedRequestType ? this.resolvedRequestType.fullName : this.requestType,\n outputType: this.resolvedResponseType ? this.resolvedResponseType.fullName : this.responseType,\n clientStreaming: this.requestStream,\n serverStreaming: this.responseStream,\n options: toDescriptorOptions(this.options, exports.MethodOptions)\n });\n};\n\n// --- utility ---\n\n// Converts a descriptor type to a protobuf.js basic type\nfunction fromDescriptorType(type) {\n switch (type) {\n // 0 is reserved for errors\n case 1: return \"double\";\n case 2: return \"float\";\n case 3: return \"int64\";\n case 4: return \"uint64\";\n case 5: return \"int32\";\n case 6: return \"fixed64\";\n case 7: return \"fixed32\";\n case 8: return \"bool\";\n case 9: return \"string\";\n case 12: return \"bytes\";\n case 13: return \"uint32\";\n case 15: return \"sfixed32\";\n case 16: return \"sfixed64\";\n case 17: return \"sint32\";\n case 18: return \"sint64\";\n }\n throw Error(\"illegal type: \" + type);\n}\n\n// Tests if a descriptor type is packable\nfunction packableDescriptorType(type) {\n switch (type) {\n case 1: // double\n case 2: // float\n case 3: // int64\n case 4: // uint64\n case 5: // int32\n case 6: // fixed64\n case 7: // fixed32\n case 8: // bool\n case 13: // uint32\n case 14: // enum (!)\n case 15: // sfixed32\n case 16: // sfixed64\n case 17: // sint32\n case 18: // sint64\n return true;\n }\n return false;\n}\n\n// Converts a protobuf.js basic type to a descriptor type\nfunction toDescriptorType(type, resolvedType) {\n switch (type) {\n // 0 is reserved for errors\n case \"double\": return 1;\n case \"float\": return 2;\n case \"int64\": return 3;\n case \"uint64\": return 4;\n case \"int32\": return 5;\n case \"fixed64\": return 6;\n case \"fixed32\": return 7;\n case \"bool\": return 8;\n case \"string\": return 9;\n case \"bytes\": return 12;\n case \"uint32\": return 13;\n case \"sfixed32\": return 15;\n case \"sfixed64\": return 16;\n case \"sint32\": return 17;\n case \"sint64\": return 18;\n }\n if (resolvedType instanceof Enum)\n return 14;\n if (resolvedType instanceof Type)\n return resolvedType.group ? 10 : 11;\n throw Error(\"illegal type: \" + type);\n}\n\n// Converts descriptor options to an options object\nfunction fromDescriptorOptions(options, type) {\n if (!options)\n return undefined;\n var out = [];\n for (var i = 0, field, key, val; i < type.fieldsArray.length; ++i)\n if ((key = (field = type._fieldsArray[i]).name) !== \"uninterpretedOption\")\n if (options.hasOwnProperty(key)) { // eslint-disable-line no-prototype-builtins\n val = options[key];\n if (field.resolvedType instanceof Enum && typeof val === \"number\" && field.resolvedType.valuesById[val] !== undefined)\n val = field.resolvedType.valuesById[val];\n out.push(underScore(key), val);\n }\n return out.length ? $protobuf.util.toObject(out) : undefined;\n}\n\n// Converts an options object to descriptor options\nfunction toDescriptorOptions(options, type) {\n if (!options)\n return undefined;\n var out = [];\n for (var i = 0, ks = Object.keys(options), key, val; i < ks.length; ++i) {\n val = options[key = ks[i]];\n if (key === \"default\")\n continue;\n var field = type.fields[key];\n if (!field && !(field = type.fields[key = $protobuf.util.camelCase(key)]))\n continue;\n out.push(key, val);\n }\n return out.length ? type.fromObject($protobuf.util.toObject(out)) : undefined;\n}\n\n// Calculates the shortest relative path from `from` to `to`.\nfunction shortname(from, to) {\n var fromPath = from.fullName.split(\".\"),\n toPath = to.fullName.split(\".\"),\n i = 0,\n j = 0,\n k = toPath.length - 1;\n if (!(from instanceof Root) && to instanceof Namespace)\n while (i < fromPath.length && j < k && fromPath[i] === toPath[j]) {\n var other = to.lookup(fromPath[i++], true);\n if (other !== null && other !== to)\n break;\n ++j;\n }\n else\n for (; i < fromPath.length && j < k && fromPath[i] === toPath[j]; ++i, ++j);\n return toPath.slice(j).join(\".\");\n}\n\n// copied here from cli/targets/proto.js\nfunction underScore(str) {\n return str.substring(0,1)\n + str.substring(1)\n .replace(/([A-Z])(?=[a-z]|$)/g, function($0, $1) { return \"_\" + $1.toLowerCase(); });\n}\n\n// --- exports ---\n\n/**\n * Reflected file descriptor set.\n * @name FileDescriptorSet\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected file descriptor proto.\n * @name FileDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected descriptor proto.\n * @name DescriptorProto\n * @type {Type}\n * @property {Type} ExtensionRange\n * @property {Type} ReservedRange\n * @const\n * @tstype $protobuf.Type & {\n * ExtensionRange: $protobuf.Type,\n * ReservedRange: $protobuf.Type\n * }\n */\n\n/**\n * Reflected field descriptor proto.\n * @name FieldDescriptorProto\n * @type {Type}\n * @property {Enum} Label\n * @property {Enum} Type\n * @const\n * @tstype $protobuf.Type & {\n * Label: $protobuf.Enum,\n * Type: $protobuf.Enum\n * }\n */\n\n/**\n * Reflected oneof descriptor proto.\n * @name OneofDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum descriptor proto.\n * @name EnumDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected service descriptor proto.\n * @name ServiceDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum value descriptor proto.\n * @name EnumValueDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected method descriptor proto.\n * @name MethodDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected file options.\n * @name FileOptions\n * @type {Type}\n * @property {Enum} OptimizeMode\n * @const\n * @tstype $protobuf.Type & {\n * OptimizeMode: $protobuf.Enum\n * }\n */\n\n/**\n * Reflected message options.\n * @name MessageOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected field options.\n * @name FieldOptions\n * @type {Type}\n * @property {Enum} CType\n * @property {Enum} JSType\n * @const\n * @tstype $protobuf.Type & {\n * CType: $protobuf.Enum,\n * JSType: $protobuf.Enum\n * }\n */\n\n/**\n * Reflected oneof options.\n * @name OneofOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum options.\n * @name EnumOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum value options.\n * @name EnumValueOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected service options.\n * @name ServiceOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected method options.\n * @name MethodOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected uninterpretet option.\n * @name UninterpretedOption\n * @type {Type}\n * @property {Type} NamePart\n * @const\n * @tstype $protobuf.Type & {\n * NamePart: $protobuf.Type\n * }\n */\n\n/**\n * Reflected source code info.\n * @name SourceCodeInfo\n * @type {Type}\n * @property {Type} Location\n * @const\n * @tstype $protobuf.Type & {\n * Location: $protobuf.Type\n * }\n */\n\n/**\n * Reflected generated code info.\n * @name GeneratedCodeInfo\n * @type {Type}\n * @property {Type} Annotation\n * @const\n * @tstype $protobuf.Type & {\n * Annotation: $protobuf.Type\n * }\n */\n","'use strict';\nconst strictUriEncode = require('strict-uri-encode');\nconst decodeComponent = require('decode-uri-component');\nconst splitOnFirst = require('split-on-first');\nconst filterObject = require('filter-obj');\n\nconst isNullOrUndefined = value => value === null || value === undefined;\n\nconst encodeFragmentIdentifier = Symbol('encodeFragmentIdentifier');\n\nfunction encoderForArrayFormat(options) {\n\tswitch (options.arrayFormat) {\n\t\tcase 'index':\n\t\t\treturn key => (result, value) => {\n\t\t\t\tconst index = result.length;\n\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, [encode(key, options), '[', index, ']'].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [\n\t\t\t\t\t...result,\n\t\t\t\t\t[encode(key, options), '[', encode(index, options), ']=', encode(value, options)].join('')\n\t\t\t\t];\n\t\t\t};\n\n\t\tcase 'bracket':\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, [encode(key, options), '[]'].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [...result, [encode(key, options), '[]=', encode(value, options)].join('')];\n\t\t\t};\n\n\t\tcase 'colon-list-separator':\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, [encode(key, options), ':list='].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [...result, [encode(key, options), ':list=', encode(value, options)].join('')];\n\t\t\t};\n\n\t\tcase 'comma':\n\t\tcase 'separator':\n\t\tcase 'bracket-separator': {\n\t\t\tconst keyValueSep = options.arrayFormat === 'bracket-separator' ?\n\t\t\t\t'[]=' :\n\t\t\t\t'=';\n\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\t// Translate null to an empty string so that it doesn't serialize as 'null'\n\t\t\t\tvalue = value === null ? '' : value;\n\n\t\t\t\tif (result.length === 0) {\n\t\t\t\t\treturn [[encode(key, options), keyValueSep, encode(value, options)].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [[result, encode(value, options)].join(options.arrayFormatSeparator)];\n\t\t\t};\n\t\t}\n\n\t\tdefault:\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, encode(key, options)];\n\t\t\t\t}\n\n\t\t\t\treturn [...result, [encode(key, options), '=', encode(value, options)].join('')];\n\t\t\t};\n\t}\n}\n\nfunction parserForArrayFormat(options) {\n\tlet result;\n\n\tswitch (options.arrayFormat) {\n\t\tcase 'index':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tresult = /\\[(\\d*)\\]$/.exec(key);\n\n\t\t\t\tkey = key.replace(/\\[\\d*\\]$/, '');\n\n\t\t\t\tif (!result) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = {};\n\t\t\t\t}\n\n\t\t\t\taccumulator[key][result[1]] = value;\n\t\t\t};\n\n\t\tcase 'bracket':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tresult = /(\\[\\])$/.exec(key);\n\t\t\t\tkey = key.replace(/\\[\\]$/, '');\n\n\t\t\t\tif (!result) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = [value];\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], value);\n\t\t\t};\n\n\t\tcase 'colon-list-separator':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tresult = /(:list)$/.exec(key);\n\t\t\t\tkey = key.replace(/:list$/, '');\n\n\t\t\t\tif (!result) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = [value];\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], value);\n\t\t\t};\n\n\t\tcase 'comma':\n\t\tcase 'separator':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tconst isArray = typeof value === 'string' && value.includes(options.arrayFormatSeparator);\n\t\t\t\tconst isEncodedArray = (typeof value === 'string' && !isArray && decode(value, options).includes(options.arrayFormatSeparator));\n\t\t\t\tvalue = isEncodedArray ? decode(value, options) : value;\n\t\t\t\tconst newValue = isArray || isEncodedArray ? value.split(options.arrayFormatSeparator).map(item => decode(item, options)) : value === null ? value : decode(value, options);\n\t\t\t\taccumulator[key] = newValue;\n\t\t\t};\n\n\t\tcase 'bracket-separator':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tconst isArray = /(\\[\\])$/.test(key);\n\t\t\t\tkey = key.replace(/\\[\\]$/, '');\n\n\t\t\t\tif (!isArray) {\n\t\t\t\t\taccumulator[key] = value ? decode(value, options) : value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst arrayValue = value === null ?\n\t\t\t\t\t[] :\n\t\t\t\t\tvalue.split(options.arrayFormatSeparator).map(item => decode(item, options));\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = arrayValue;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], arrayValue);\n\t\t\t};\n\n\t\tdefault:\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], value);\n\t\t\t};\n\t}\n}\n\nfunction validateArrayFormatSeparator(value) {\n\tif (typeof value !== 'string' || value.length !== 1) {\n\t\tthrow new TypeError('arrayFormatSeparator must be single character string');\n\t}\n}\n\nfunction encode(value, options) {\n\tif (options.encode) {\n\t\treturn options.strict ? strictUriEncode(value) : encodeURIComponent(value);\n\t}\n\n\treturn value;\n}\n\nfunction decode(value, options) {\n\tif (options.decode) {\n\t\treturn decodeComponent(value);\n\t}\n\n\treturn value;\n}\n\nfunction keysSorter(input) {\n\tif (Array.isArray(input)) {\n\t\treturn input.sort();\n\t}\n\n\tif (typeof input === 'object') {\n\t\treturn keysSorter(Object.keys(input))\n\t\t\t.sort((a, b) => Number(a) - Number(b))\n\t\t\t.map(key => input[key]);\n\t}\n\n\treturn input;\n}\n\nfunction removeHash(input) {\n\tconst hashStart = input.indexOf('#');\n\tif (hashStart !== -1) {\n\t\tinput = input.slice(0, hashStart);\n\t}\n\n\treturn input;\n}\n\nfunction getHash(url) {\n\tlet hash = '';\n\tconst hashStart = url.indexOf('#');\n\tif (hashStart !== -1) {\n\t\thash = url.slice(hashStart);\n\t}\n\n\treturn hash;\n}\n\nfunction extract(input) {\n\tinput = removeHash(input);\n\tconst queryStart = input.indexOf('?');\n\tif (queryStart === -1) {\n\t\treturn '';\n\t}\n\n\treturn input.slice(queryStart + 1);\n}\n\nfunction parseValue(value, options) {\n\tif (options.parseNumbers && !Number.isNaN(Number(value)) && (typeof value === 'string' && value.trim() !== '')) {\n\t\tvalue = Number(value);\n\t} else if (options.parseBooleans && value !== null && (value.toLowerCase() === 'true' || value.toLowerCase() === 'false')) {\n\t\tvalue = value.toLowerCase() === 'true';\n\t}\n\n\treturn value;\n}\n\nfunction parse(query, options) {\n\toptions = Object.assign({\n\t\tdecode: true,\n\t\tsort: true,\n\t\tarrayFormat: 'none',\n\t\tarrayFormatSeparator: ',',\n\t\tparseNumbers: false,\n\t\tparseBooleans: false\n\t}, options);\n\n\tvalidateArrayFormatSeparator(options.arrayFormatSeparator);\n\n\tconst formatter = parserForArrayFormat(options);\n\n\t// Create an object with no prototype\n\tconst ret = Object.create(null);\n\n\tif (typeof query !== 'string') {\n\t\treturn ret;\n\t}\n\n\tquery = query.trim().replace(/^[?#&]/, '');\n\n\tif (!query) {\n\t\treturn ret;\n\t}\n\n\tfor (const param of query.split('&')) {\n\t\tif (param === '') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet [key, value] = splitOnFirst(options.decode ? param.replace(/\\+/g, ' ') : param, '=');\n\n\t\t// Missing `=` should be `null`:\n\t\t// http://w3.org/TR/2012/WD-url-20120524/#collect-url-parameters\n\t\tvalue = value === undefined ? null : ['comma', 'separator', 'bracket-separator'].includes(options.arrayFormat) ? value : decode(value, options);\n\t\tformatter(decode(key, options), value, ret);\n\t}\n\n\tfor (const key of Object.keys(ret)) {\n\t\tconst value = ret[key];\n\t\tif (typeof value === 'object' && value !== null) {\n\t\t\tfor (const k of Object.keys(value)) {\n\t\t\t\tvalue[k] = parseValue(value[k], options);\n\t\t\t}\n\t\t} else {\n\t\t\tret[key] = parseValue(value, options);\n\t\t}\n\t}\n\n\tif (options.sort === false) {\n\t\treturn ret;\n\t}\n\n\treturn (options.sort === true ? Object.keys(ret).sort() : Object.keys(ret).sort(options.sort)).reduce((result, key) => {\n\t\tconst value = ret[key];\n\t\tif (Boolean(value) && typeof value === 'object' && !Array.isArray(value)) {\n\t\t\t// Sort object keys, not values\n\t\t\tresult[key] = keysSorter(value);\n\t\t} else {\n\t\t\tresult[key] = value;\n\t\t}\n\n\t\treturn result;\n\t}, Object.create(null));\n}\n\nexports.extract = extract;\nexports.parse = parse;\n\nexports.stringify = (object, options) => {\n\tif (!object) {\n\t\treturn '';\n\t}\n\n\toptions = Object.assign({\n\t\tencode: true,\n\t\tstrict: true,\n\t\tarrayFormat: 'none',\n\t\tarrayFormatSeparator: ','\n\t}, options);\n\n\tvalidateArrayFormatSeparator(options.arrayFormatSeparator);\n\n\tconst shouldFilter = key => (\n\t\t(options.skipNull && isNullOrUndefined(object[key])) ||\n\t\t(options.skipEmptyString && object[key] === '')\n\t);\n\n\tconst formatter = encoderForArrayFormat(options);\n\n\tconst objectCopy = {};\n\n\tfor (const key of Object.keys(object)) {\n\t\tif (!shouldFilter(key)) {\n\t\t\tobjectCopy[key] = object[key];\n\t\t}\n\t}\n\n\tconst keys = Object.keys(objectCopy);\n\n\tif (options.sort !== false) {\n\t\tkeys.sort(options.sort);\n\t}\n\n\treturn keys.map(key => {\n\t\tconst value = object[key];\n\n\t\tif (value === undefined) {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (value === null) {\n\t\t\treturn encode(key, options);\n\t\t}\n\n\t\tif (Array.isArray(value)) {\n\t\t\tif (value.length === 0 && options.arrayFormat === 'bracket-separator') {\n\t\t\t\treturn encode(key, options) + '[]';\n\t\t\t}\n\n\t\t\treturn value\n\t\t\t\t.reduce(formatter(key), [])\n\t\t\t\t.join('&');\n\t\t}\n\n\t\treturn encode(key, options) + '=' + encode(value, options);\n\t}).filter(x => x.length > 0).join('&');\n};\n\nexports.parseUrl = (url, options) => {\n\toptions = Object.assign({\n\t\tdecode: true\n\t}, options);\n\n\tconst [url_, hash] = splitOnFirst(url, '#');\n\n\treturn Object.assign(\n\t\t{\n\t\t\turl: url_.split('?')[0] || '',\n\t\t\tquery: parse(extract(url), options)\n\t\t},\n\t\toptions && options.parseFragmentIdentifier && hash ? {fragmentIdentifier: decode(hash, options)} : {}\n\t);\n};\n\nexports.stringifyUrl = (object, options) => {\n\toptions = Object.assign({\n\t\tencode: true,\n\t\tstrict: true,\n\t\t[encodeFragmentIdentifier]: true\n\t}, options);\n\n\tconst url = removeHash(object.url).split('?')[0] || '';\n\tconst queryFromUrl = exports.extract(object.url);\n\tconst parsedQueryFromUrl = exports.parse(queryFromUrl, {sort: false});\n\n\tconst query = Object.assign(parsedQueryFromUrl, object.query);\n\tlet queryString = exports.stringify(query, options);\n\tif (queryString) {\n\t\tqueryString = `?${queryString}`;\n\t}\n\n\tlet hash = getHash(object.url);\n\tif (object.fragmentIdentifier) {\n\t\thash = `#${options[encodeFragmentIdentifier] ? encode(object.fragmentIdentifier, options) : object.fragmentIdentifier}`;\n\t}\n\n\treturn `${url}${queryString}${hash}`;\n};\n\nexports.pick = (input, filter, options) => {\n\toptions = Object.assign({\n\t\tparseFragmentIdentifier: true,\n\t\t[encodeFragmentIdentifier]: false\n\t}, options);\n\n\tconst {url, query, fragmentIdentifier} = exports.parseUrl(input, options);\n\treturn exports.stringifyUrl({\n\t\turl,\n\t\tquery: filterObject(query, filter),\n\t\tfragmentIdentifier\n\t}, options);\n};\n\nexports.exclude = (input, filter, options) => {\n\tconst exclusionFilter = Array.isArray(filter) ? key => !filter.includes(key) : (key, value) => !filter(key, value);\n\n\treturn exports.pick(input, exclusionFilter, options);\n};\n","/**\n * Module dependencies.\n */\n\nvar fs = require('fs'),\n path = require('path'),\n fileURLToPath = require('file-uri-to-path'),\n join = path.join,\n dirname = path.dirname,\n exists =\n (fs.accessSync &&\n function(path) {\n try {\n fs.accessSync(path);\n } catch (e) {\n return false;\n }\n return true;\n }) ||\n fs.existsSync ||\n path.existsSync,\n defaults = {\n arrow: process.env.NODE_BINDINGS_ARROW || ' → ',\n compiled: process.env.NODE_BINDINGS_COMPILED_DIR || 'compiled',\n platform: process.platform,\n arch: process.arch,\n nodePreGyp:\n 'node-v' +\n process.versions.modules +\n '-' +\n process.platform +\n '-' +\n process.arch,\n version: process.versions.node,\n bindings: 'bindings.node',\n try: [\n // node-gyp's linked version in the \"build\" dir\n ['module_root', 'build', 'bindings'],\n // node-waf and gyp_addon (a.k.a node-gyp)\n ['module_root', 'build', 'Debug', 'bindings'],\n ['module_root', 'build', 'Release', 'bindings'],\n // Debug files, for development (legacy behavior, remove for node v0.9)\n ['module_root', 'out', 'Debug', 'bindings'],\n ['module_root', 'Debug', 'bindings'],\n // Release files, but manually compiled (legacy behavior, remove for node v0.9)\n ['module_root', 'out', 'Release', 'bindings'],\n ['module_root', 'Release', 'bindings'],\n // Legacy from node-waf, node <= 0.4.x\n ['module_root', 'build', 'default', 'bindings'],\n // Production \"Release\" buildtype binary (meh...)\n ['module_root', 'compiled', 'version', 'platform', 'arch', 'bindings'],\n // node-qbs builds\n ['module_root', 'addon-build', 'release', 'install-root', 'bindings'],\n ['module_root', 'addon-build', 'debug', 'install-root', 'bindings'],\n ['module_root', 'addon-build', 'default', 'install-root', 'bindings'],\n // node-pre-gyp path ./lib/binding/{node_abi}-{platform}-{arch}\n ['module_root', 'lib', 'binding', 'nodePreGyp', 'bindings']\n ]\n };\n\n/**\n * The main `bindings()` function loads the compiled bindings for a given module.\n * It uses V8's Error API to determine the parent filename that this function is\n * being invoked from, which is then used to find the root directory.\n */\n\nfunction bindings(opts) {\n // Argument surgery\n if (typeof opts == 'string') {\n opts = { bindings: opts };\n } else if (!opts) {\n opts = {};\n }\n\n // maps `defaults` onto `opts` object\n Object.keys(defaults).map(function(i) {\n if (!(i in opts)) opts[i] = defaults[i];\n });\n\n // Get the module root\n if (!opts.module_root) {\n opts.module_root = exports.getRoot(exports.getFileName());\n }\n\n // Ensure the given bindings name ends with .node\n if (path.extname(opts.bindings) != '.node') {\n opts.bindings += '.node';\n }\n\n // https://github.com/webpack/webpack/issues/4175#issuecomment-342931035\n var requireFunc =\n typeof __webpack_require__ === 'function'\n ? __non_webpack_require__\n : require;\n\n var tries = [],\n i = 0,\n l = opts.try.length,\n n,\n b,\n err;\n\n for (; i < l; i++) {\n n = join.apply(\n null,\n opts.try[i].map(function(p) {\n return opts[p] || p;\n })\n );\n tries.push(n);\n try {\n b = opts.path ? requireFunc.resolve(n) : requireFunc(n);\n if (!opts.path) {\n b.path = n;\n }\n return b;\n } catch (e) {\n if (e.code !== 'MODULE_NOT_FOUND' &&\n e.code !== 'QUALIFIED_PATH_RESOLUTION_FAILED' &&\n !/not find/i.test(e.message)) {\n throw e;\n }\n }\n }\n\n err = new Error(\n 'Could not locate the bindings file. Tried:\\n' +\n tries\n .map(function(a) {\n return opts.arrow + a;\n })\n .join('\\n')\n );\n err.tries = tries;\n throw err;\n}\nmodule.exports = exports = bindings;\n\n/**\n * Gets the filename of the JavaScript file that invokes this function.\n * Used to help find the root directory of a module.\n * Optionally accepts an filename argument to skip when searching for the invoking filename\n */\n\nexports.getFileName = function getFileName(calling_file) {\n var origPST = Error.prepareStackTrace,\n origSTL = Error.stackTraceLimit,\n dummy = {},\n fileName;\n\n Error.stackTraceLimit = 10;\n\n Error.prepareStackTrace = function(e, st) {\n for (var i = 0, l = st.length; i < l; i++) {\n fileName = st[i].getFileName();\n if (fileName !== __filename) {\n if (calling_file) {\n if (fileName !== calling_file) {\n return;\n }\n } else {\n return;\n }\n }\n }\n };\n\n // run the 'prepareStackTrace' function above\n Error.captureStackTrace(dummy);\n dummy.stack;\n\n // cleanup\n Error.prepareStackTrace = origPST;\n Error.stackTraceLimit = origSTL;\n\n // handle filename that starts with \"file://\"\n var fileSchema = 'file://';\n if (fileName.indexOf(fileSchema) === 0) {\n fileName = fileURLToPath(fileName);\n }\n\n return fileName;\n};\n\n/**\n * Gets the root directory of a module, given an arbitrary filename\n * somewhere in the module tree. The \"root directory\" is the directory\n * containing the `package.json` file.\n *\n * In: /home/nate/node-native-module/lib/index.js\n * Out: /home/nate/node-native-module\n */\n\nexports.getRoot = function getRoot(file) {\n var dir = dirname(file),\n prev;\n while (true) {\n if (dir === '.') {\n // Avoids an infinite loop in rare cases, like the REPL\n dir = process.cwd();\n }\n if (\n exists(join(dir, 'package.json')) ||\n exists(join(dir, 'node_modules'))\n ) {\n // Found the 'package.json' file or 'node_modules' dir; we're done\n return dir;\n }\n if (prev === dir) {\n // Got to the top\n throw new Error(\n 'Could not find module root given file: \"' +\n file +\n '\". Do you have a `package.json` file? '\n );\n }\n // Try the parent dir next\n prev = dir;\n dir = join(dir, '..');\n }\n};\n",";(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"), require(\"./enc-base64\"), require(\"./md5\"), require(\"./evpkdf\"), require(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var BlockCipher = C_lib.BlockCipher;\n\t var C_algo = C.algo;\n\n\t // Lookup tables\n\t var SBOX = [];\n\t var INV_SBOX = [];\n\t var SUB_MIX_0 = [];\n\t var SUB_MIX_1 = [];\n\t var SUB_MIX_2 = [];\n\t var SUB_MIX_3 = [];\n\t var INV_SUB_MIX_0 = [];\n\t var INV_SUB_MIX_1 = [];\n\t var INV_SUB_MIX_2 = [];\n\t var INV_SUB_MIX_3 = [];\n\n\t // Compute lookup tables\n\t (function () {\n\t // Compute double table\n\t var d = [];\n\t for (var i = 0; i < 256; i++) {\n\t if (i < 128) {\n\t d[i] = i << 1;\n\t } else {\n\t d[i] = (i << 1) ^ 0x11b;\n\t }\n\t }\n\n\t // Walk GF(2^8)\n\t var x = 0;\n\t var xi = 0;\n\t for (var i = 0; i < 256; i++) {\n\t // Compute sbox\n\t var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n\t sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;\n\t SBOX[x] = sx;\n\t INV_SBOX[sx] = x;\n\n\t // Compute multiplication\n\t var x2 = d[x];\n\t var x4 = d[x2];\n\t var x8 = d[x4];\n\n\t // Compute sub bytes, mix columns tables\n\t var t = (d[sx] * 0x101) ^ (sx * 0x1010100);\n\t SUB_MIX_0[x] = (t << 24) | (t >>> 8);\n\t SUB_MIX_1[x] = (t << 16) | (t >>> 16);\n\t SUB_MIX_2[x] = (t << 8) | (t >>> 24);\n\t SUB_MIX_3[x] = t;\n\n\t // Compute inv sub bytes, inv mix columns tables\n\t var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);\n\t INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8);\n\t INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16);\n\t INV_SUB_MIX_2[sx] = (t << 8) | (t >>> 24);\n\t INV_SUB_MIX_3[sx] = t;\n\n\t // Compute next counter\n\t if (!x) {\n\t x = xi = 1;\n\t } else {\n\t x = x2 ^ d[d[d[x8 ^ x2]]];\n\t xi ^= d[d[xi]];\n\t }\n\t }\n\t }());\n\n\t // Precomputed Rcon lookup\n\t var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];\n\n\t /**\n\t * AES block cipher algorithm.\n\t */\n\t var AES = C_algo.AES = BlockCipher.extend({\n\t _doReset: function () {\n\t var t;\n\n\t // Skip reset of nRounds has been set before and key did not change\n\t if (this._nRounds && this._keyPriorReset === this._key) {\n\t return;\n\t }\n\n\t // Shortcuts\n\t var key = this._keyPriorReset = this._key;\n\t var keyWords = key.words;\n\t var keySize = key.sigBytes / 4;\n\n\t // Compute number of rounds\n\t var nRounds = this._nRounds = keySize + 6;\n\n\t // Compute number of key schedule rows\n\t var ksRows = (nRounds + 1) * 4;\n\n\t // Compute key schedule\n\t var keySchedule = this._keySchedule = [];\n\t for (var ksRow = 0; ksRow < ksRows; ksRow++) {\n\t if (ksRow < keySize) {\n\t keySchedule[ksRow] = keyWords[ksRow];\n\t } else {\n\t t = keySchedule[ksRow - 1];\n\n\t if (!(ksRow % keySize)) {\n\t // Rot word\n\t t = (t << 8) | (t >>> 24);\n\n\t // Sub word\n\t t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];\n\n\t // Mix Rcon\n\t t ^= RCON[(ksRow / keySize) | 0] << 24;\n\t } else if (keySize > 6 && ksRow % keySize == 4) {\n\t // Sub word\n\t t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];\n\t }\n\n\t keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t;\n\t }\n\t }\n\n\t // Compute inv key schedule\n\t var invKeySchedule = this._invKeySchedule = [];\n\t for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) {\n\t var ksRow = ksRows - invKsRow;\n\n\t if (invKsRow % 4) {\n\t var t = keySchedule[ksRow];\n\t } else {\n\t var t = keySchedule[ksRow - 4];\n\t }\n\n\t if (invKsRow < 4 || ksRow <= 4) {\n\t invKeySchedule[invKsRow] = t;\n\t } else {\n\t invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^\n\t INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]];\n\t }\n\t }\n\t },\n\n\t encryptBlock: function (M, offset) {\n\t this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX);\n\t },\n\n\t decryptBlock: function (M, offset) {\n\t // Swap 2nd and 4th rows\n\t var t = M[offset + 1];\n\t M[offset + 1] = M[offset + 3];\n\t M[offset + 3] = t;\n\n\t this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX);\n\n\t // Inv swap 2nd and 4th rows\n\t var t = M[offset + 1];\n\t M[offset + 1] = M[offset + 3];\n\t M[offset + 3] = t;\n\t },\n\n\t _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) {\n\t // Shortcut\n\t var nRounds = this._nRounds;\n\n\t // Get input, add round key\n\t var s0 = M[offset] ^ keySchedule[0];\n\t var s1 = M[offset + 1] ^ keySchedule[1];\n\t var s2 = M[offset + 2] ^ keySchedule[2];\n\t var s3 = M[offset + 3] ^ keySchedule[3];\n\n\t // Key schedule row counter\n\t var ksRow = 4;\n\n\t // Rounds\n\t for (var round = 1; round < nRounds; round++) {\n\t // Shift rows, sub bytes, mix columns, add round key\n\t var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++];\n\t var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++];\n\t var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++];\n\t var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++];\n\n\t // Update state\n\t s0 = t0;\n\t s1 = t1;\n\t s2 = t2;\n\t s3 = t3;\n\t }\n\n\t // Shift rows, sub bytes, add round key\n\t var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];\n\t var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];\n\t var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];\n\t var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];\n\n\t // Set output\n\t M[offset] = t0;\n\t M[offset + 1] = t1;\n\t M[offset + 2] = t2;\n\t M[offset + 3] = t3;\n\t },\n\n\t keySize: 256/32\n\t });\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.AES.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.AES.decrypt(ciphertext, key, cfg);\n\t */\n\t C.AES = BlockCipher._createHelper(AES);\n\t}());\n\n\n\treturn CryptoJS.AES;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var C_enc = C.enc;\n\n\t /**\n\t * Base64 encoding strategy.\n\t */\n\t var Base64 = C_enc.Base64 = {\n\t /**\n\t * Converts a word array to a Base64 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The Base64 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var base64String = CryptoJS.enc.Base64.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\t var map = this._map;\n\n\t // Clamp excess bits\n\t wordArray.clamp();\n\n\t // Convert\n\t var base64Chars = [];\n\t for (var i = 0; i < sigBytes; i += 3) {\n\t var byte1 = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;\n\t var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;\n\n\t var triplet = (byte1 << 16) | (byte2 << 8) | byte3;\n\n\t for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {\n\t base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));\n\t }\n\t }\n\n\t // Add padding\n\t var paddingChar = map.charAt(64);\n\t if (paddingChar) {\n\t while (base64Chars.length % 4) {\n\t base64Chars.push(paddingChar);\n\t }\n\t }\n\n\t return base64Chars.join('');\n\t },\n\n\t /**\n\t * Converts a Base64 string to a word array.\n\t *\n\t * @param {string} base64Str The Base64 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Base64.parse(base64String);\n\t */\n\t parse: function (base64Str) {\n\t // Shortcuts\n\t var base64StrLength = base64Str.length;\n\t var map = this._map;\n\t var reverseMap = this._reverseMap;\n\n\t if (!reverseMap) {\n\t reverseMap = this._reverseMap = [];\n\t for (var j = 0; j < map.length; j++) {\n\t reverseMap[map.charCodeAt(j)] = j;\n\t }\n\t }\n\n\t // Ignore padding\n\t var paddingChar = map.charAt(64);\n\t if (paddingChar) {\n\t var paddingIndex = base64Str.indexOf(paddingChar);\n\t if (paddingIndex !== -1) {\n\t base64StrLength = paddingIndex;\n\t }\n\t }\n\n\t // Convert\n\t return parseLoop(base64Str, base64StrLength, reverseMap);\n\n\t },\n\n\t _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='\n\t };\n\n\t function parseLoop(base64Str, base64StrLength, reverseMap) {\n\t var words = [];\n\t var nBytes = 0;\n\t for (var i = 0; i < base64StrLength; i++) {\n\t if (i % 4) {\n\t var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << ((i % 4) * 2);\n\t var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> (6 - (i % 4) * 2);\n\t var bitsCombined = bits1 | bits2;\n\t words[nBytes >>> 2] |= bitsCombined << (24 - (nBytes % 4) * 8);\n\t nBytes++;\n\t }\n\t }\n\t return WordArray.create(words, nBytes);\n\t }\n\t}());\n\n\n\treturn CryptoJS.enc.Base64;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (Math) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Constants table\n\t var T = [];\n\n\t // Compute constants\n\t (function () {\n\t for (var i = 0; i < 64; i++) {\n\t T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;\n\t }\n\t }());\n\n\t /**\n\t * MD5 hash algorithm.\n\t */\n\t var MD5 = C_algo.MD5 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0x67452301, 0xefcdab89,\n\t 0x98badcfe, 0x10325476\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Swap endian\n\t for (var i = 0; i < 16; i++) {\n\t // Shortcuts\n\t var offset_i = offset + i;\n\t var M_offset_i = M[offset_i];\n\n\t M[offset_i] = (\n\t (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |\n\t (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)\n\t );\n\t }\n\n\t // Shortcuts\n\t var H = this._hash.words;\n\n\t var M_offset_0 = M[offset + 0];\n\t var M_offset_1 = M[offset + 1];\n\t var M_offset_2 = M[offset + 2];\n\t var M_offset_3 = M[offset + 3];\n\t var M_offset_4 = M[offset + 4];\n\t var M_offset_5 = M[offset + 5];\n\t var M_offset_6 = M[offset + 6];\n\t var M_offset_7 = M[offset + 7];\n\t var M_offset_8 = M[offset + 8];\n\t var M_offset_9 = M[offset + 9];\n\t var M_offset_10 = M[offset + 10];\n\t var M_offset_11 = M[offset + 11];\n\t var M_offset_12 = M[offset + 12];\n\t var M_offset_13 = M[offset + 13];\n\t var M_offset_14 = M[offset + 14];\n\t var M_offset_15 = M[offset + 15];\n\n\t // Working varialbes\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\n\t // Computation\n\t a = FF(a, b, c, d, M_offset_0, 7, T[0]);\n\t d = FF(d, a, b, c, M_offset_1, 12, T[1]);\n\t c = FF(c, d, a, b, M_offset_2, 17, T[2]);\n\t b = FF(b, c, d, a, M_offset_3, 22, T[3]);\n\t a = FF(a, b, c, d, M_offset_4, 7, T[4]);\n\t d = FF(d, a, b, c, M_offset_5, 12, T[5]);\n\t c = FF(c, d, a, b, M_offset_6, 17, T[6]);\n\t b = FF(b, c, d, a, M_offset_7, 22, T[7]);\n\t a = FF(a, b, c, d, M_offset_8, 7, T[8]);\n\t d = FF(d, a, b, c, M_offset_9, 12, T[9]);\n\t c = FF(c, d, a, b, M_offset_10, 17, T[10]);\n\t b = FF(b, c, d, a, M_offset_11, 22, T[11]);\n\t a = FF(a, b, c, d, M_offset_12, 7, T[12]);\n\t d = FF(d, a, b, c, M_offset_13, 12, T[13]);\n\t c = FF(c, d, a, b, M_offset_14, 17, T[14]);\n\t b = FF(b, c, d, a, M_offset_15, 22, T[15]);\n\n\t a = GG(a, b, c, d, M_offset_1, 5, T[16]);\n\t d = GG(d, a, b, c, M_offset_6, 9, T[17]);\n\t c = GG(c, d, a, b, M_offset_11, 14, T[18]);\n\t b = GG(b, c, d, a, M_offset_0, 20, T[19]);\n\t a = GG(a, b, c, d, M_offset_5, 5, T[20]);\n\t d = GG(d, a, b, c, M_offset_10, 9, T[21]);\n\t c = GG(c, d, a, b, M_offset_15, 14, T[22]);\n\t b = GG(b, c, d, a, M_offset_4, 20, T[23]);\n\t a = GG(a, b, c, d, M_offset_9, 5, T[24]);\n\t d = GG(d, a, b, c, M_offset_14, 9, T[25]);\n\t c = GG(c, d, a, b, M_offset_3, 14, T[26]);\n\t b = GG(b, c, d, a, M_offset_8, 20, T[27]);\n\t a = GG(a, b, c, d, M_offset_13, 5, T[28]);\n\t d = GG(d, a, b, c, M_offset_2, 9, T[29]);\n\t c = GG(c, d, a, b, M_offset_7, 14, T[30]);\n\t b = GG(b, c, d, a, M_offset_12, 20, T[31]);\n\n\t a = HH(a, b, c, d, M_offset_5, 4, T[32]);\n\t d = HH(d, a, b, c, M_offset_8, 11, T[33]);\n\t c = HH(c, d, a, b, M_offset_11, 16, T[34]);\n\t b = HH(b, c, d, a, M_offset_14, 23, T[35]);\n\t a = HH(a, b, c, d, M_offset_1, 4, T[36]);\n\t d = HH(d, a, b, c, M_offset_4, 11, T[37]);\n\t c = HH(c, d, a, b, M_offset_7, 16, T[38]);\n\t b = HH(b, c, d, a, M_offset_10, 23, T[39]);\n\t a = HH(a, b, c, d, M_offset_13, 4, T[40]);\n\t d = HH(d, a, b, c, M_offset_0, 11, T[41]);\n\t c = HH(c, d, a, b, M_offset_3, 16, T[42]);\n\t b = HH(b, c, d, a, M_offset_6, 23, T[43]);\n\t a = HH(a, b, c, d, M_offset_9, 4, T[44]);\n\t d = HH(d, a, b, c, M_offset_12, 11, T[45]);\n\t c = HH(c, d, a, b, M_offset_15, 16, T[46]);\n\t b = HH(b, c, d, a, M_offset_2, 23, T[47]);\n\n\t a = II(a, b, c, d, M_offset_0, 6, T[48]);\n\t d = II(d, a, b, c, M_offset_7, 10, T[49]);\n\t c = II(c, d, a, b, M_offset_14, 15, T[50]);\n\t b = II(b, c, d, a, M_offset_5, 21, T[51]);\n\t a = II(a, b, c, d, M_offset_12, 6, T[52]);\n\t d = II(d, a, b, c, M_offset_3, 10, T[53]);\n\t c = II(c, d, a, b, M_offset_10, 15, T[54]);\n\t b = II(b, c, d, a, M_offset_1, 21, T[55]);\n\t a = II(a, b, c, d, M_offset_8, 6, T[56]);\n\t d = II(d, a, b, c, M_offset_15, 10, T[57]);\n\t c = II(c, d, a, b, M_offset_6, 15, T[58]);\n\t b = II(b, c, d, a, M_offset_13, 21, T[59]);\n\t a = II(a, b, c, d, M_offset_4, 6, T[60]);\n\t d = II(d, a, b, c, M_offset_11, 10, T[61]);\n\t c = II(c, d, a, b, M_offset_2, 15, T[62]);\n\t b = II(b, c, d, a, M_offset_9, 21, T[63]);\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\n\t var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000);\n\t var nBitsTotalL = nBitsTotal;\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (\n\t (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00)\n\t );\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (\n\t (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00)\n\t );\n\n\t data.sigBytes = (dataWords.length + 1) * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Shortcuts\n\t var hash = this._hash;\n\t var H = hash.words;\n\n\t // Swap endian\n\t for (var i = 0; i < 4; i++) {\n\t // Shortcut\n\t var H_i = H[i];\n\n\t H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |\n\t (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);\n\t }\n\n\t // Return final computed hash\n\t return hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t function FF(a, b, c, d, x, s, t) {\n\t var n = a + ((b & c) | (~b & d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function GG(a, b, c, d, x, s, t) {\n\t var n = a + ((b & d) | (c & ~d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function HH(a, b, c, d, x, s, t) {\n\t var n = a + (b ^ c ^ d) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function II(a, b, c, d, x, s, t) {\n\t var n = a + (c ^ (b | ~d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.MD5('message');\n\t * var hash = CryptoJS.MD5(wordArray);\n\t */\n\t C.MD5 = Hasher._createHelper(MD5);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacMD5(message, key);\n\t */\n\t C.HmacMD5 = Hasher._createHmacHelper(MD5);\n\t}(Math));\n\n\n\treturn CryptoJS.MD5;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Reusable object\n\t var W = [];\n\n\t /**\n\t * SHA-1 hash algorithm.\n\t */\n\t var SHA1 = C_algo.SHA1 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0x67452301, 0xefcdab89,\n\t 0x98badcfe, 0x10325476,\n\t 0xc3d2e1f0\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcut\n\t var H = this._hash.words;\n\n\t // Working variables\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\t var e = H[4];\n\n\t // Computation\n\t for (var i = 0; i < 80; i++) {\n\t if (i < 16) {\n\t W[i] = M[offset + i] | 0;\n\t } else {\n\t var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n\t W[i] = (n << 1) | (n >>> 31);\n\t }\n\n\t var t = ((a << 5) | (a >>> 27)) + e + W[i];\n\t if (i < 20) {\n\t t += ((b & c) | (~b & d)) + 0x5a827999;\n\t } else if (i < 40) {\n\t t += (b ^ c ^ d) + 0x6ed9eba1;\n\t } else if (i < 60) {\n\t t += ((b & c) | (b & d) | (c & d)) - 0x70e44324;\n\t } else /* if (i < 80) */ {\n\t t += (b ^ c ^ d) - 0x359d3e2a;\n\t }\n\n\t e = d;\n\t d = c;\n\t c = (b << 30) | (b >>> 2);\n\t b = a;\n\t a = t;\n\t }\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t H[4] = (H[4] + e) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;\n\t data.sigBytes = dataWords.length * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Return final computed hash\n\t return this._hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA1('message');\n\t * var hash = CryptoJS.SHA1(wordArray);\n\t */\n\t C.SHA1 = Hasher._createHelper(SHA1);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA1(message, key);\n\t */\n\t C.HmacSHA1 = Hasher._createHmacHelper(SHA1);\n\t}());\n\n\n\treturn CryptoJS.SHA1;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var C_enc = C.enc;\n\t var Utf8 = C_enc.Utf8;\n\t var C_algo = C.algo;\n\n\t /**\n\t * HMAC algorithm.\n\t */\n\t var HMAC = C_algo.HMAC = Base.extend({\n\t /**\n\t * Initializes a newly created HMAC.\n\t *\n\t * @param {Hasher} hasher The hash algorithm to use.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @example\n\t *\n\t * var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);\n\t */\n\t init: function (hasher, key) {\n\t // Init hasher\n\t hasher = this._hasher = new hasher.init();\n\n\t // Convert string to WordArray, else assume WordArray already\n\t if (typeof key == 'string') {\n\t key = Utf8.parse(key);\n\t }\n\n\t // Shortcuts\n\t var hasherBlockSize = hasher.blockSize;\n\t var hasherBlockSizeBytes = hasherBlockSize * 4;\n\n\t // Allow arbitrary length keys\n\t if (key.sigBytes > hasherBlockSizeBytes) {\n\t key = hasher.finalize(key);\n\t }\n\n\t // Clamp excess bits\n\t key.clamp();\n\n\t // Clone key for inner and outer pads\n\t var oKey = this._oKey = key.clone();\n\t var iKey = this._iKey = key.clone();\n\n\t // Shortcuts\n\t var oKeyWords = oKey.words;\n\t var iKeyWords = iKey.words;\n\n\t // XOR keys with pad constants\n\t for (var i = 0; i < hasherBlockSize; i++) {\n\t oKeyWords[i] ^= 0x5c5c5c5c;\n\t iKeyWords[i] ^= 0x36363636;\n\t }\n\t oKey.sigBytes = iKey.sigBytes = hasherBlockSizeBytes;\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this HMAC to its initial state.\n\t *\n\t * @example\n\t *\n\t * hmacHasher.reset();\n\t */\n\t reset: function () {\n\t // Shortcut\n\t var hasher = this._hasher;\n\n\t // Reset\n\t hasher.reset();\n\t hasher.update(this._iKey);\n\t },\n\n\t /**\n\t * Updates this HMAC with a message.\n\t *\n\t * @param {WordArray|string} messageUpdate The message to append.\n\t *\n\t * @return {HMAC} This HMAC instance.\n\t *\n\t * @example\n\t *\n\t * hmacHasher.update('message');\n\t * hmacHasher.update(wordArray);\n\t */\n\t update: function (messageUpdate) {\n\t this._hasher.update(messageUpdate);\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Finalizes the HMAC computation.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} messageUpdate (Optional) A final message update.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @example\n\t *\n\t * var hmac = hmacHasher.finalize();\n\t * var hmac = hmacHasher.finalize('message');\n\t * var hmac = hmacHasher.finalize(wordArray);\n\t */\n\t finalize: function (messageUpdate) {\n\t // Shortcut\n\t var hasher = this._hasher;\n\n\t // Compute HMAC\n\t var innerHash = hasher.finalize(messageUpdate);\n\t hasher.reset();\n\t var hmac = hasher.finalize(this._oKey.clone().concat(innerHash));\n\n\t return hmac;\n\t }\n\t });\n\t}());\n\n\n}));",";(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"), require(\"./evpkdf\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./evpkdf\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Cipher core components.\n\t */\n\tCryptoJS.lib.Cipher || (function (undefined) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm;\n\t var C_enc = C.enc;\n\t var Utf8 = C_enc.Utf8;\n\t var Base64 = C_enc.Base64;\n\t var C_algo = C.algo;\n\t var EvpKDF = C_algo.EvpKDF;\n\n\t /**\n\t * Abstract base cipher template.\n\t *\n\t * @property {number} keySize This cipher's key size. Default: 4 (128 bits)\n\t * @property {number} ivSize This cipher's IV size. Default: 4 (128 bits)\n\t * @property {number} _ENC_XFORM_MODE A constant representing encryption mode.\n\t * @property {number} _DEC_XFORM_MODE A constant representing decryption mode.\n\t */\n\t var Cipher = C_lib.Cipher = BufferedBlockAlgorithm.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {WordArray} iv The IV to use for this operation.\n\t */\n\t cfg: Base.extend(),\n\n\t /**\n\t * Creates this cipher in encryption mode.\n\t *\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {Cipher} A cipher instance.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });\n\t */\n\t createEncryptor: function (key, cfg) {\n\t return this.create(this._ENC_XFORM_MODE, key, cfg);\n\t },\n\n\t /**\n\t * Creates this cipher in decryption mode.\n\t *\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {Cipher} A cipher instance.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });\n\t */\n\t createDecryptor: function (key, cfg) {\n\t return this.create(this._DEC_XFORM_MODE, key, cfg);\n\t },\n\n\t /**\n\t * Initializes a newly created cipher.\n\t *\n\t * @param {number} xformMode Either the encryption or decryption transormation mode constant.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });\n\t */\n\t init: function (xformMode, key, cfg) {\n\t // Apply config defaults\n\t this.cfg = this.cfg.extend(cfg);\n\n\t // Store transform mode and key\n\t this._xformMode = xformMode;\n\t this._key = key;\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this cipher to its initial state.\n\t *\n\t * @example\n\t *\n\t * cipher.reset();\n\t */\n\t reset: function () {\n\t // Reset data buffer\n\t BufferedBlockAlgorithm.reset.call(this);\n\n\t // Perform concrete-cipher logic\n\t this._doReset();\n\t },\n\n\t /**\n\t * Adds data to be encrypted or decrypted.\n\t *\n\t * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.\n\t *\n\t * @return {WordArray} The data after processing.\n\t *\n\t * @example\n\t *\n\t * var encrypted = cipher.process('data');\n\t * var encrypted = cipher.process(wordArray);\n\t */\n\t process: function (dataUpdate) {\n\t // Append\n\t this._append(dataUpdate);\n\n\t // Process available blocks\n\t return this._process();\n\t },\n\n\t /**\n\t * Finalizes the encryption or decryption process.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.\n\t *\n\t * @return {WordArray} The data after final processing.\n\t *\n\t * @example\n\t *\n\t * var encrypted = cipher.finalize();\n\t * var encrypted = cipher.finalize('data');\n\t * var encrypted = cipher.finalize(wordArray);\n\t */\n\t finalize: function (dataUpdate) {\n\t // Final data update\n\t if (dataUpdate) {\n\t this._append(dataUpdate);\n\t }\n\n\t // Perform concrete-cipher logic\n\t var finalProcessedData = this._doFinalize();\n\n\t return finalProcessedData;\n\t },\n\n\t keySize: 128/32,\n\n\t ivSize: 128/32,\n\n\t _ENC_XFORM_MODE: 1,\n\n\t _DEC_XFORM_MODE: 2,\n\n\t /**\n\t * Creates shortcut functions to a cipher's object interface.\n\t *\n\t * @param {Cipher} cipher The cipher to create a helper for.\n\t *\n\t * @return {Object} An object with encrypt and decrypt shortcut functions.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);\n\t */\n\t _createHelper: (function () {\n\t function selectCipherStrategy(key) {\n\t if (typeof key == 'string') {\n\t return PasswordBasedCipher;\n\t } else {\n\t return SerializableCipher;\n\t }\n\t }\n\n\t return function (cipher) {\n\t return {\n\t encrypt: function (message, key, cfg) {\n\t return selectCipherStrategy(key).encrypt(cipher, message, key, cfg);\n\t },\n\n\t decrypt: function (ciphertext, key, cfg) {\n\t return selectCipherStrategy(key).decrypt(cipher, ciphertext, key, cfg);\n\t }\n\t };\n\t };\n\t }())\n\t });\n\n\t /**\n\t * Abstract base stream cipher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 1 (32 bits)\n\t */\n\t var StreamCipher = C_lib.StreamCipher = Cipher.extend({\n\t _doFinalize: function () {\n\t // Process partial blocks\n\t var finalProcessedBlocks = this._process(!!'flush');\n\n\t return finalProcessedBlocks;\n\t },\n\n\t blockSize: 1\n\t });\n\n\t /**\n\t * Mode namespace.\n\t */\n\t var C_mode = C.mode = {};\n\n\t /**\n\t * Abstract base block cipher mode template.\n\t */\n\t var BlockCipherMode = C_lib.BlockCipherMode = Base.extend({\n\t /**\n\t * Creates this mode for encryption.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);\n\t */\n\t createEncryptor: function (cipher, iv) {\n\t return this.Encryptor.create(cipher, iv);\n\t },\n\n\t /**\n\t * Creates this mode for decryption.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);\n\t */\n\t createDecryptor: function (cipher, iv) {\n\t return this.Decryptor.create(cipher, iv);\n\t },\n\n\t /**\n\t * Initializes a newly created mode.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);\n\t */\n\t init: function (cipher, iv) {\n\t this._cipher = cipher;\n\t this._iv = iv;\n\t }\n\t });\n\n\t /**\n\t * Cipher Block Chaining mode.\n\t */\n\t var CBC = C_mode.CBC = (function () {\n\t /**\n\t * Abstract base CBC mode.\n\t */\n\t var CBC = BlockCipherMode.extend();\n\n\t /**\n\t * CBC encryptor.\n\t */\n\t CBC.Encryptor = CBC.extend({\n\t /**\n\t * Processes the data block at offset.\n\t *\n\t * @param {Array} words The data words to operate on.\n\t * @param {number} offset The offset where the block starts.\n\t *\n\t * @example\n\t *\n\t * mode.processBlock(data.words, offset);\n\t */\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // XOR and encrypt\n\t xorBlock.call(this, words, offset, blockSize);\n\t cipher.encryptBlock(words, offset);\n\n\t // Remember this block to use with next block\n\t this._prevBlock = words.slice(offset, offset + blockSize);\n\t }\n\t });\n\n\t /**\n\t * CBC decryptor.\n\t */\n\t CBC.Decryptor = CBC.extend({\n\t /**\n\t * Processes the data block at offset.\n\t *\n\t * @param {Array} words The data words to operate on.\n\t * @param {number} offset The offset where the block starts.\n\t *\n\t * @example\n\t *\n\t * mode.processBlock(data.words, offset);\n\t */\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // Remember this block to use with next block\n\t var thisBlock = words.slice(offset, offset + blockSize);\n\n\t // Decrypt and XOR\n\t cipher.decryptBlock(words, offset);\n\t xorBlock.call(this, words, offset, blockSize);\n\n\t // This block becomes the previous block\n\t this._prevBlock = thisBlock;\n\t }\n\t });\n\n\t function xorBlock(words, offset, blockSize) {\n\t var block;\n\n\t // Shortcut\n\t var iv = this._iv;\n\n\t // Choose mixing block\n\t if (iv) {\n\t block = iv;\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t } else {\n\t block = this._prevBlock;\n\t }\n\n\t // XOR blocks\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= block[i];\n\t }\n\t }\n\n\t return CBC;\n\t }());\n\n\t /**\n\t * Padding namespace.\n\t */\n\t var C_pad = C.pad = {};\n\n\t /**\n\t * PKCS #5/7 padding strategy.\n\t */\n\t var Pkcs7 = C_pad.Pkcs7 = {\n\t /**\n\t * Pads data using the algorithm defined in PKCS #5/7.\n\t *\n\t * @param {WordArray} data The data to pad.\n\t * @param {number} blockSize The multiple that the data should be padded to.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * CryptoJS.pad.Pkcs7.pad(wordArray, 4);\n\t */\n\t pad: function (data, blockSize) {\n\t // Shortcut\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count padding bytes\n\t var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;\n\n\t // Create padding word\n\t var paddingWord = (nPaddingBytes << 24) | (nPaddingBytes << 16) | (nPaddingBytes << 8) | nPaddingBytes;\n\n\t // Create padding\n\t var paddingWords = [];\n\t for (var i = 0; i < nPaddingBytes; i += 4) {\n\t paddingWords.push(paddingWord);\n\t }\n\t var padding = WordArray.create(paddingWords, nPaddingBytes);\n\n\t // Add padding\n\t data.concat(padding);\n\t },\n\n\t /**\n\t * Unpads data that had been padded using the algorithm defined in PKCS #5/7.\n\t *\n\t * @param {WordArray} data The data to unpad.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * CryptoJS.pad.Pkcs7.unpad(wordArray);\n\t */\n\t unpad: function (data) {\n\t // Get number of padding bytes from last byte\n\t var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;\n\n\t // Remove padding\n\t data.sigBytes -= nPaddingBytes;\n\t }\n\t };\n\n\t /**\n\t * Abstract base block cipher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 4 (128 bits)\n\t */\n\t var BlockCipher = C_lib.BlockCipher = Cipher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {Mode} mode The block mode to use. Default: CBC\n\t * @property {Padding} padding The padding strategy to use. Default: Pkcs7\n\t */\n\t cfg: Cipher.cfg.extend({\n\t mode: CBC,\n\t padding: Pkcs7\n\t }),\n\n\t reset: function () {\n\t var modeCreator;\n\n\t // Reset cipher\n\t Cipher.reset.call(this);\n\n\t // Shortcuts\n\t var cfg = this.cfg;\n\t var iv = cfg.iv;\n\t var mode = cfg.mode;\n\n\t // Reset block mode\n\t if (this._xformMode == this._ENC_XFORM_MODE) {\n\t modeCreator = mode.createEncryptor;\n\t } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {\n\t modeCreator = mode.createDecryptor;\n\t // Keep at least one block in the buffer for unpadding\n\t this._minBufferSize = 1;\n\t }\n\n\t if (this._mode && this._mode.__creator == modeCreator) {\n\t this._mode.init(this, iv && iv.words);\n\t } else {\n\t this._mode = modeCreator.call(mode, this, iv && iv.words);\n\t this._mode.__creator = modeCreator;\n\t }\n\t },\n\n\t _doProcessBlock: function (words, offset) {\n\t this._mode.processBlock(words, offset);\n\t },\n\n\t _doFinalize: function () {\n\t var finalProcessedBlocks;\n\n\t // Shortcut\n\t var padding = this.cfg.padding;\n\n\t // Finalize\n\t if (this._xformMode == this._ENC_XFORM_MODE) {\n\t // Pad data\n\t padding.pad(this._data, this.blockSize);\n\n\t // Process final blocks\n\t finalProcessedBlocks = this._process(!!'flush');\n\t } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {\n\t // Process final blocks\n\t finalProcessedBlocks = this._process(!!'flush');\n\n\t // Unpad data\n\t padding.unpad(finalProcessedBlocks);\n\t }\n\n\t return finalProcessedBlocks;\n\t },\n\n\t blockSize: 128/32\n\t });\n\n\t /**\n\t * A collection of cipher parameters.\n\t *\n\t * @property {WordArray} ciphertext The raw ciphertext.\n\t * @property {WordArray} key The key to this ciphertext.\n\t * @property {WordArray} iv The IV used in the ciphering operation.\n\t * @property {WordArray} salt The salt used with a key derivation function.\n\t * @property {Cipher} algorithm The cipher algorithm.\n\t * @property {Mode} mode The block mode used in the ciphering operation.\n\t * @property {Padding} padding The padding scheme used in the ciphering operation.\n\t * @property {number} blockSize The block size of the cipher.\n\t * @property {Format} formatter The default formatting strategy to convert this cipher params object to a string.\n\t */\n\t var CipherParams = C_lib.CipherParams = Base.extend({\n\t /**\n\t * Initializes a newly created cipher params object.\n\t *\n\t * @param {Object} cipherParams An object with any of the possible cipher parameters.\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.lib.CipherParams.create({\n\t * ciphertext: ciphertextWordArray,\n\t * key: keyWordArray,\n\t * iv: ivWordArray,\n\t * salt: saltWordArray,\n\t * algorithm: CryptoJS.algo.AES,\n\t * mode: CryptoJS.mode.CBC,\n\t * padding: CryptoJS.pad.PKCS7,\n\t * blockSize: 4,\n\t * formatter: CryptoJS.format.OpenSSL\n\t * });\n\t */\n\t init: function (cipherParams) {\n\t this.mixIn(cipherParams);\n\t },\n\n\t /**\n\t * Converts this cipher params object to a string.\n\t *\n\t * @param {Format} formatter (Optional) The formatting strategy to use.\n\t *\n\t * @return {string} The stringified cipher params.\n\t *\n\t * @throws Error If neither the formatter nor the default formatter is set.\n\t *\n\t * @example\n\t *\n\t * var string = cipherParams + '';\n\t * var string = cipherParams.toString();\n\t * var string = cipherParams.toString(CryptoJS.format.OpenSSL);\n\t */\n\t toString: function (formatter) {\n\t return (formatter || this.formatter).stringify(this);\n\t }\n\t });\n\n\t /**\n\t * Format namespace.\n\t */\n\t var C_format = C.format = {};\n\n\t /**\n\t * OpenSSL formatting strategy.\n\t */\n\t var OpenSSLFormatter = C_format.OpenSSL = {\n\t /**\n\t * Converts a cipher params object to an OpenSSL-compatible string.\n\t *\n\t * @param {CipherParams} cipherParams The cipher params object.\n\t *\n\t * @return {string} The OpenSSL-compatible string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);\n\t */\n\t stringify: function (cipherParams) {\n\t var wordArray;\n\n\t // Shortcuts\n\t var ciphertext = cipherParams.ciphertext;\n\t var salt = cipherParams.salt;\n\n\t // Format\n\t if (salt) {\n\t wordArray = WordArray.create([0x53616c74, 0x65645f5f]).concat(salt).concat(ciphertext);\n\t } else {\n\t wordArray = ciphertext;\n\t }\n\n\t return wordArray.toString(Base64);\n\t },\n\n\t /**\n\t * Converts an OpenSSL-compatible string to a cipher params object.\n\t *\n\t * @param {string} openSSLStr The OpenSSL-compatible string.\n\t *\n\t * @return {CipherParams} The cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);\n\t */\n\t parse: function (openSSLStr) {\n\t var salt;\n\n\t // Parse base64\n\t var ciphertext = Base64.parse(openSSLStr);\n\n\t // Shortcut\n\t var ciphertextWords = ciphertext.words;\n\n\t // Test for salt\n\t if (ciphertextWords[0] == 0x53616c74 && ciphertextWords[1] == 0x65645f5f) {\n\t // Extract salt\n\t salt = WordArray.create(ciphertextWords.slice(2, 4));\n\n\t // Remove salt from ciphertext\n\t ciphertextWords.splice(0, 4);\n\t ciphertext.sigBytes -= 16;\n\t }\n\n\t return CipherParams.create({ ciphertext: ciphertext, salt: salt });\n\t }\n\t };\n\n\t /**\n\t * A cipher wrapper that returns ciphertext as a serializable cipher params object.\n\t */\n\t var SerializableCipher = C_lib.SerializableCipher = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL\n\t */\n\t cfg: Base.extend({\n\t format: OpenSSLFormatter\n\t }),\n\n\t /**\n\t * Encrypts a message.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {WordArray|string} message The message to encrypt.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {CipherParams} A cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t */\n\t encrypt: function (cipher, message, key, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Encrypt\n\t var encryptor = cipher.createEncryptor(key, cfg);\n\t var ciphertext = encryptor.finalize(message);\n\n\t // Shortcut\n\t var cipherCfg = encryptor.cfg;\n\n\t // Create and return serializable cipher params\n\t return CipherParams.create({\n\t ciphertext: ciphertext,\n\t key: key,\n\t iv: cipherCfg.iv,\n\t algorithm: cipher,\n\t mode: cipherCfg.mode,\n\t padding: cipherCfg.padding,\n\t blockSize: cipher.blockSize,\n\t formatter: cfg.format\n\t });\n\t },\n\n\t /**\n\t * Decrypts serialized ciphertext.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {CipherParams|string} ciphertext The ciphertext to decrypt.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {WordArray} The plaintext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t */\n\t decrypt: function (cipher, ciphertext, key, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Convert string to CipherParams\n\t ciphertext = this._parse(ciphertext, cfg.format);\n\n\t // Decrypt\n\t var plaintext = cipher.createDecryptor(key, cfg).finalize(ciphertext.ciphertext);\n\n\t return plaintext;\n\t },\n\n\t /**\n\t * Converts serialized ciphertext to CipherParams,\n\t * else assumed CipherParams already and returns ciphertext unchanged.\n\t *\n\t * @param {CipherParams|string} ciphertext The ciphertext.\n\t * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.\n\t *\n\t * @return {CipherParams} The unserialized ciphertext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);\n\t */\n\t _parse: function (ciphertext, format) {\n\t if (typeof ciphertext == 'string') {\n\t return format.parse(ciphertext, this);\n\t } else {\n\t return ciphertext;\n\t }\n\t }\n\t });\n\n\t /**\n\t * Key derivation function namespace.\n\t */\n\t var C_kdf = C.kdf = {};\n\n\t /**\n\t * OpenSSL key derivation function.\n\t */\n\t var OpenSSLKdf = C_kdf.OpenSSL = {\n\t /**\n\t * Derives a key and IV from a password.\n\t *\n\t * @param {string} password The password to derive from.\n\t * @param {number} keySize The size in words of the key to generate.\n\t * @param {number} ivSize The size in words of the IV to generate.\n\t * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.\n\t *\n\t * @return {CipherParams} A cipher params object with the key, IV, and salt.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);\n\t * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');\n\t */\n\t execute: function (password, keySize, ivSize, salt) {\n\t // Generate random salt\n\t if (!salt) {\n\t salt = WordArray.random(64/8);\n\t }\n\n\t // Derive key and IV\n\t var key = EvpKDF.create({ keySize: keySize + ivSize }).compute(password, salt);\n\n\t // Separate key and IV\n\t var iv = WordArray.create(key.words.slice(keySize), ivSize * 4);\n\t key.sigBytes = keySize * 4;\n\n\t // Return params\n\t return CipherParams.create({ key: key, iv: iv, salt: salt });\n\t }\n\t };\n\n\t /**\n\t * A serializable cipher wrapper that derives the key from a password,\n\t * and returns ciphertext as a serializable cipher params object.\n\t */\n\t var PasswordBasedCipher = C_lib.PasswordBasedCipher = SerializableCipher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL\n\t */\n\t cfg: SerializableCipher.cfg.extend({\n\t kdf: OpenSSLKdf\n\t }),\n\n\t /**\n\t * Encrypts a message using a password.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {WordArray|string} message The message to encrypt.\n\t * @param {string} password The password.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {CipherParams} A cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');\n\t * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });\n\t */\n\t encrypt: function (cipher, message, password, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Derive key and other params\n\t var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize);\n\n\t // Add IV to config\n\t cfg.iv = derivedParams.iv;\n\n\t // Encrypt\n\t var ciphertext = SerializableCipher.encrypt.call(this, cipher, message, derivedParams.key, cfg);\n\n\t // Mix in derived params\n\t ciphertext.mixIn(derivedParams);\n\n\t return ciphertext;\n\t },\n\n\t /**\n\t * Decrypts serialized ciphertext using a password.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {CipherParams|string} ciphertext The ciphertext to decrypt.\n\t * @param {string} password The password.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {WordArray} The plaintext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });\n\t * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });\n\t */\n\t decrypt: function (cipher, ciphertext, password, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Convert string to CipherParams\n\t ciphertext = this._parse(ciphertext, cfg.format);\n\n\t // Derive key and other params\n\t var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize, ciphertext.salt);\n\n\t // Add IV to config\n\t cfg.iv = derivedParams.iv;\n\n\t // Decrypt\n\t var plaintext = SerializableCipher.decrypt.call(this, cipher, ciphertext, derivedParams.key, cfg);\n\n\t return plaintext;\n\t }\n\t });\n\t}());\n\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\treturn CryptoJS.enc.Utf8;\n\n}));","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n })\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","\"use strict\";\nvar protobuf = module.exports = require(\"./index-minimal\");\n\nprotobuf.build = \"light\";\n\n/**\n * A node-style callback as used by {@link load} and {@link Root#load}.\n * @typedef LoadCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Root} [root] Root, if there hasn't been an error\n * @returns {undefined}\n */\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} root Root namespace, defaults to create a new one if omitted.\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n */\nfunction load(filename, root, callback) {\n if (typeof root === \"function\") {\n callback = root;\n root = new protobuf.Root();\n } else if (!root)\n root = new protobuf.Root();\n return root.load(filename, callback);\n}\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Promise} Promise\n * @see {@link Root#load}\n * @variation 3\n */\n// function load(filename:string, [root:Root]):Promise\n\nprotobuf.load = load;\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only).\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n * @see {@link Root#loadSync}\n */\nfunction loadSync(filename, root) {\n if (!root)\n root = new protobuf.Root();\n return root.loadSync(filename);\n}\n\nprotobuf.loadSync = loadSync;\n\n// Serialization\nprotobuf.encoder = require(\"./encoder\");\nprotobuf.decoder = require(\"./decoder\");\nprotobuf.verifier = require(\"./verifier\");\nprotobuf.converter = require(\"./converter\");\n\n// Reflection\nprotobuf.ReflectionObject = require(\"./object\");\nprotobuf.Namespace = require(\"./namespace\");\nprotobuf.Root = require(\"./root\");\nprotobuf.Enum = require(\"./enum\");\nprotobuf.Type = require(\"./type\");\nprotobuf.Field = require(\"./field\");\nprotobuf.OneOf = require(\"./oneof\");\nprotobuf.MapField = require(\"./mapfield\");\nprotobuf.Service = require(\"./service\");\nprotobuf.Method = require(\"./method\");\n\n// Runtime\nprotobuf.Message = require(\"./message\");\nprotobuf.wrappers = require(\"./wrappers\");\n\n// Utility\nprotobuf.types = require(\"./types\");\nprotobuf.util = require(\"./util\");\n\n// Set up possibly cyclic reflection dependencies\nprotobuf.ReflectionObject._configure(protobuf.Root);\nprotobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum);\nprotobuf.Root._configure(protobuf.Type);\nprotobuf.Field._configure(protobuf.Type);\n","\"use strict\";\nvar protobuf = exports;\n\n/**\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\n * @name build\n * @type {string}\n * @const\n */\nprotobuf.build = \"minimal\";\n\n// Serialization\nprotobuf.Writer = require(\"./writer\");\nprotobuf.BufferWriter = require(\"./writer_buffer\");\nprotobuf.Reader = require(\"./reader\");\nprotobuf.BufferReader = require(\"./reader_buffer\");\n\n// Utility\nprotobuf.util = require(\"./util/minimal\");\nprotobuf.rpc = require(\"./rpc\");\nprotobuf.roots = require(\"./roots\");\nprotobuf.configure = configure;\n\n/* istanbul ignore next */\n/**\n * Reconfigures the library according to the environment.\n * @returns {undefined}\n */\nfunction configure() {\n protobuf.Reader._configure(protobuf.BufferReader);\n protobuf.util._configure();\n}\n\n// Set up buffer utility according to the environment\nprotobuf.Writer._configure(protobuf.BufferWriter);\nconfigure();\n","\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n var p = string.length;\r\n if (!p)\r\n return 0;\r\n var n = 0;\r\n while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n ++n;\r\n return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n var parts = null,\r\n chunk = [];\r\n var i = 0, // output index\r\n j = 0, // goto index\r\n t; // temporary\r\n while (start < end) {\r\n var b = buffer[start++];\r\n switch (j) {\r\n case 0:\r\n chunk[i++] = b64[b >> 2];\r\n t = (b & 3) << 4;\r\n j = 1;\r\n break;\r\n case 1:\r\n chunk[i++] = b64[t | b >> 4];\r\n t = (b & 15) << 2;\r\n j = 2;\r\n break;\r\n case 2:\r\n chunk[i++] = b64[t | b >> 6];\r\n chunk[i++] = b64[b & 63];\r\n j = 0;\r\n break;\r\n }\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (j) {\r\n chunk[i++] = b64[t];\r\n chunk[i++] = 61;\r\n if (j === 1)\r\n chunk[i++] = 61;\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n var start = offset;\r\n var j = 0, // goto index\r\n t; // temporary\r\n for (var i = 0; i < string.length;) {\r\n var c = string.charCodeAt(i++);\r\n if (c === 61 && j > 1)\r\n break;\r\n if ((c = s64[c]) === undefined)\r\n throw Error(invalidEncoding);\r\n switch (j) {\r\n case 0:\r\n t = c;\r\n j = 1;\r\n break;\r\n case 1:\r\n buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n t = c;\r\n j = 2;\r\n break;\r\n case 2:\r\n buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n t = c;\r\n j = 3;\r\n break;\r\n case 3:\r\n buffer[offset++] = (t & 3) << 6 | c;\r\n j = 0;\r\n break;\r\n }\r\n }\r\n if (j === 1)\r\n throw Error(invalidEncoding);\r\n return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n","\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n /**\r\n * Registered listeners.\r\n * @type {Object.}\r\n * @private\r\n */\r\n this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n fn : fn,\r\n ctx : ctx || this\r\n });\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n if (evt === undefined)\r\n this._listeners = {};\r\n else {\r\n if (fn === undefined)\r\n this._listeners[evt] = [];\r\n else {\r\n var listeners = this._listeners[evt];\r\n for (var i = 0; i < listeners.length;)\r\n if (listeners[i].fn === fn)\r\n listeners.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n var listeners = this._listeners[evt];\r\n if (listeners) {\r\n var args = [],\r\n i = 1;\r\n for (; i < arguments.length;)\r\n args.push(arguments[i++]);\r\n for (i = 0; i < listeners.length;)\r\n listeners[i].fn.apply(listeners[i++].ctx, args);\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n // float: typed array\r\n if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n var f32 = new Float32Array([ -0 ]),\r\n f8b = new Uint8Array(f32.buffer),\r\n le = f8b[3] === 128;\r\n\r\n function writeFloat_f32_cpy(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n }\r\n\r\n function writeFloat_f32_rev(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[3];\r\n buf[pos + 1] = f8b[2];\r\n buf[pos + 2] = f8b[1];\r\n buf[pos + 3] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n function readFloat_f32_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n function readFloat_f32_rev(buf, pos) {\r\n f8b[3] = buf[pos ];\r\n f8b[2] = buf[pos + 1];\r\n f8b[1] = buf[pos + 2];\r\n f8b[0] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n // float: ieee754\r\n })(); else (function() {\r\n\r\n function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0)\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n else if (isNaN(val))\r\n writeUint(2143289344, buf, pos);\r\n else if (val > 3.4028234663852886e+38) // +-Infinity\r\n writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n else if (val < 1.1754943508222875e-38) // denormal\r\n writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n }\r\n }\r\n\r\n exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n function readFloat_ieee754(readUint, buf, pos) {\r\n var uint = readUint(buf, pos),\r\n sign = (uint >> 31) * 2 + 1,\r\n exponent = uint >>> 23 & 255,\r\n mantissa = uint & 8388607;\r\n return exponent === 255\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 1.401298464324817e-45 * mantissa\r\n : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n }\r\n\r\n exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n })();\r\n\r\n // double: typed array\r\n if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n var f64 = new Float64Array([-0]),\r\n f8b = new Uint8Array(f64.buffer),\r\n le = f8b[7] === 128;\r\n\r\n function writeDouble_f64_cpy(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n buf[pos + 4] = f8b[4];\r\n buf[pos + 5] = f8b[5];\r\n buf[pos + 6] = f8b[6];\r\n buf[pos + 7] = f8b[7];\r\n }\r\n\r\n function writeDouble_f64_rev(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[7];\r\n buf[pos + 1] = f8b[6];\r\n buf[pos + 2] = f8b[5];\r\n buf[pos + 3] = f8b[4];\r\n buf[pos + 4] = f8b[3];\r\n buf[pos + 5] = f8b[2];\r\n buf[pos + 6] = f8b[1];\r\n buf[pos + 7] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n function readDouble_f64_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n f8b[4] = buf[pos + 4];\r\n f8b[5] = buf[pos + 5];\r\n f8b[6] = buf[pos + 6];\r\n f8b[7] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n function readDouble_f64_rev(buf, pos) {\r\n f8b[7] = buf[pos ];\r\n f8b[6] = buf[pos + 1];\r\n f8b[5] = buf[pos + 2];\r\n f8b[4] = buf[pos + 3];\r\n f8b[3] = buf[pos + 4];\r\n f8b[2] = buf[pos + 5];\r\n f8b[1] = buf[pos + 6];\r\n f8b[0] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n // double: ieee754\r\n })(); else (function() {\r\n\r\n function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n } else if (isNaN(val)) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(2146959360, buf, pos + off1);\r\n } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n writeUint(0, buf, pos + off0);\r\n writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n } else {\r\n var mantissa;\r\n if (val < 2.2250738585072014e-308) { // denormal\r\n mantissa = val / 5e-324;\r\n writeUint(mantissa >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n } else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n if (exponent === 1024)\r\n exponent = 1023;\r\n mantissa = val * Math.pow(2, -exponent);\r\n writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n }\r\n }\r\n }\r\n\r\n exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n var lo = readUint(buf, pos + off0),\r\n hi = readUint(buf, pos + off1);\r\n var sign = (hi >> 31) * 2 + 1,\r\n exponent = hi >>> 20 & 2047,\r\n mantissa = 4294967296 * (hi & 1048575) + lo;\r\n return exponent === 2047\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 5e-324 * mantissa\r\n : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n }\r\n\r\n exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n })();\r\n\r\n return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n buf[pos ] = val >>> 24;\r\n buf[pos + 1] = val >>> 16 & 255;\r\n buf[pos + 2] = val >>> 8 & 255;\r\n buf[pos + 3] = val & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n return (buf[pos ]\r\n | buf[pos + 1] << 8\r\n | buf[pos + 2] << 16\r\n | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n return (buf[pos ] << 24\r\n | buf[pos + 1] << 16\r\n | buf[pos + 2] << 8\r\n | buf[pos + 3]) >>> 0;\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n var len = 0,\r\n c = 0;\r\n for (var i = 0; i < string.length; ++i) {\r\n c = string.charCodeAt(i);\r\n if (c < 128)\r\n len += 1;\r\n else if (c < 2048)\r\n len += 2;\r\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n ++i;\r\n len += 4;\r\n } else\r\n len += 3;\r\n }\r\n return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n var len = end - start;\r\n if (len < 1)\r\n return \"\";\r\n var parts = null,\r\n chunk = [],\r\n i = 0, // char offset\r\n t; // temporary\r\n while (start < end) {\r\n t = buffer[start++];\r\n if (t < 128)\r\n chunk[i++] = t;\r\n else if (t > 191 && t < 224)\r\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n else if (t > 239 && t < 365) {\r\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n chunk[i++] = 0xD800 + (t >> 10);\r\n chunk[i++] = 0xDC00 + (t & 1023);\r\n } else\r\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n var start = offset,\r\n c1, // character 1\r\n c2; // character 2\r\n for (var i = 0; i < string.length; ++i) {\r\n c1 = string.charCodeAt(i);\r\n if (c1 < 128) {\r\n buffer[offset++] = c1;\r\n } else if (c1 < 2048) {\r\n buffer[offset++] = c1 >> 6 | 192;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n ++i;\r\n buffer[offset++] = c1 >> 18 | 240;\r\n buffer[offset++] = c1 >> 12 & 63 | 128;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else {\r\n buffer[offset++] = c1 >> 12 | 224;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n }\r\n }\r\n return offset - start;\r\n};\r\n","\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n var SIZE = size || 8192;\r\n var MAX = SIZE >>> 1;\r\n var slab = null;\r\n var offset = SIZE;\r\n return function pool_alloc(size) {\r\n if (size < 1 || size > MAX)\r\n return alloc(size);\r\n if (offset + size > SIZE) {\r\n slab = alloc(SIZE);\r\n offset = 0;\r\n }\r\n var buf = slice.call(slab, offset, offset += size);\r\n if (offset & 7) // align to 32 bit\r\n offset = (offset | 7) + 1;\r\n return buf;\r\n };\r\n}\r\n","\"use strict\";\nmodule.exports = LongBits;\n\nvar util = require(\"../util/minimal\");\n\n/**\n * Constructs new long bits.\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @constructor\n * @param {number} lo Low 32 bits, unsigned\n * @param {number} hi High 32 bits, unsigned\n */\nfunction LongBits(lo, hi) {\n\n // note that the casts below are theoretically unnecessary as of today, but older statically\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\n\n /**\n * Low bits.\n * @type {number}\n */\n this.lo = lo >>> 0;\n\n /**\n * High bits.\n * @type {number}\n */\n this.hi = hi >>> 0;\n}\n\n/**\n * Zero bits.\n * @memberof util.LongBits\n * @type {util.LongBits}\n */\nvar zero = LongBits.zero = new LongBits(0, 0);\n\nzero.toNumber = function() { return 0; };\nzero.zzEncode = zero.zzDecode = function() { return this; };\nzero.length = function() { return 1; };\n\n/**\n * Zero hash.\n * @memberof util.LongBits\n * @type {string}\n */\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\n\n/**\n * Constructs new long bits from the specified number.\n * @param {number} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.fromNumber = function fromNumber(value) {\n if (value === 0)\n return zero;\n var sign = value < 0;\n if (sign)\n value = -value;\n var lo = value >>> 0,\n hi = (value - lo) / 4294967296 >>> 0;\n if (sign) {\n hi = ~hi >>> 0;\n lo = ~lo >>> 0;\n if (++lo > 4294967295) {\n lo = 0;\n if (++hi > 4294967295)\n hi = 0;\n }\n }\n return new LongBits(lo, hi);\n};\n\n/**\n * Constructs new long bits from a number, long or string.\n * @param {Long|number|string} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.from = function from(value) {\n if (typeof value === \"number\")\n return LongBits.fromNumber(value);\n if (util.isString(value)) {\n /* istanbul ignore else */\n if (util.Long)\n value = util.Long.fromString(value);\n else\n return LongBits.fromNumber(parseInt(value, 10));\n }\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n};\n\n/**\n * Converts this long bits to a possibly unsafe JavaScript number.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {number} Possibly unsafe number\n */\nLongBits.prototype.toNumber = function toNumber(unsigned) {\n if (!unsigned && this.hi >>> 31) {\n var lo = ~this.lo + 1 >>> 0,\n hi = ~this.hi >>> 0;\n if (!lo)\n hi = hi + 1 >>> 0;\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n};\n\n/**\n * Converts this long bits to a long.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long} Long\n */\nLongBits.prototype.toLong = function toLong(unsigned) {\n return util.Long\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\n /* istanbul ignore next */\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\n};\n\nvar charCodeAt = String.prototype.charCodeAt;\n\n/**\n * Constructs new long bits from the specified 8 characters long hash.\n * @param {string} hash Hash\n * @returns {util.LongBits} Bits\n */\nLongBits.fromHash = function fromHash(hash) {\n if (hash === zeroHash)\n return zero;\n return new LongBits(\n ( charCodeAt.call(hash, 0)\n | charCodeAt.call(hash, 1) << 8\n | charCodeAt.call(hash, 2) << 16\n | charCodeAt.call(hash, 3) << 24) >>> 0\n ,\n ( charCodeAt.call(hash, 4)\n | charCodeAt.call(hash, 5) << 8\n | charCodeAt.call(hash, 6) << 16\n | charCodeAt.call(hash, 7) << 24) >>> 0\n );\n};\n\n/**\n * Converts this long bits to a 8 characters long hash.\n * @returns {string} Hash\n */\nLongBits.prototype.toHash = function toHash() {\n return String.fromCharCode(\n this.lo & 255,\n this.lo >>> 8 & 255,\n this.lo >>> 16 & 255,\n this.lo >>> 24 ,\n this.hi & 255,\n this.hi >>> 8 & 255,\n this.hi >>> 16 & 255,\n this.hi >>> 24\n );\n};\n\n/**\n * Zig-zag encodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzEncode = function zzEncode() {\n var mask = this.hi >> 31;\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\n this.lo = ( this.lo << 1 ^ mask) >>> 0;\n return this;\n};\n\n/**\n * Zig-zag decodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzDecode = function zzDecode() {\n var mask = -(this.lo & 1);\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\n this.hi = ( this.hi >>> 1 ^ mask) >>> 0;\n return this;\n};\n\n/**\n * Calculates the length of this longbits when encoded as a varint.\n * @returns {number} Length\n */\nLongBits.prototype.length = function length() {\n var part0 = this.lo,\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\n part2 = this.hi >>> 24;\n return part2 === 0\n ? part1 === 0\n ? part0 < 16384\n ? part0 < 128 ? 1 : 2\n : part0 < 2097152 ? 3 : 4\n : part1 < 16384\n ? part1 < 128 ? 5 : 6\n : part1 < 2097152 ? 7 : 8\n : part2 < 128 ? 9 : 10;\n};\n","\"use strict\";\nmodule.exports = BufferWriter;\n\n// extends Writer\nvar Writer = require(\"./writer\");\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\n\nvar util = require(\"./util/minimal\");\n\nvar Buffer = util.Buffer;\n\n/**\n * Constructs a new buffer writer instance.\n * @classdesc Wire format writer using node buffers.\n * @extends Writer\n * @constructor\n */\nfunction BufferWriter() {\n Writer.call(this);\n}\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Buffer} Buffer\n */\nBufferWriter.alloc = function alloc_buffer(size) {\n return (BufferWriter.alloc = util._Buffer_allocUnsafe)(size);\n};\n\nvar writeBytesBuffer = Buffer && Buffer.prototype instanceof Uint8Array && Buffer.prototype.set.name === \"set\"\n ? function writeBytesBuffer_set(val, buf, pos) {\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytesBuffer_copy(val, buf, pos) {\n if (val.copy) // Buffer values\n val.copy(buf, pos, 0, val.length);\n else for (var i = 0; i < val.length;) // plain array values\n buf[pos++] = val[i++];\n };\n\n/**\n * @override\n */\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\n if (util.isString(value))\n value = util._Buffer_from(value, \"base64\");\n var len = value.length >>> 0;\n this.uint32(len);\n if (len)\n this._push(writeBytesBuffer, len, value);\n return this;\n};\n\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\n util.utf8.write(val, buf, pos);\n else\n buf.utf8Write(val, pos);\n}\n\n/**\n * @override\n */\nBufferWriter.prototype.string = function write_string_buffer(value) {\n var len = Buffer.byteLength(value);\n this.uint32(len);\n if (len)\n this._push(writeStringBuffer, len, value);\n return this;\n};\n\n\n/**\n * Finishes the write operation.\n * @name BufferWriter#finish\n * @function\n * @returns {Buffer} Finished buffer\n */\n","\"use strict\";\nmodule.exports = BufferReader;\n\n// extends Reader\nvar Reader = require(\"./reader\");\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer reader instance.\n * @classdesc Wire format reader using node buffers.\n * @extends Reader\n * @constructor\n * @param {Buffer} buffer Buffer to read from\n */\nfunction BufferReader(buffer) {\n Reader.call(this, buffer);\n\n /**\n * Read buffer.\n * @name BufferReader#buf\n * @type {Buffer}\n */\n}\n\n/* istanbul ignore else */\nif (util.Buffer)\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\n\n/**\n * @override\n */\nBufferReader.prototype.string = function read_string_buffer() {\n var len = this.uint32(); // modifies pos\n return this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len));\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @name BufferReader#bytes\n * @function\n * @returns {Buffer} Value read\n */\n","\"use strict\";\nmodule.exports = Service;\n\nvar util = require(\"../util/minimal\");\n\n// Extends EventEmitter\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\n\n/**\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\n *\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\n * @typedef rpc.ServiceMethodCallback\n * @template TRes extends Message\n * @type {function}\n * @param {Error|null} error Error, if any\n * @param {TRes} [response] Response message\n * @returns {undefined}\n */\n\n/**\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\n * @typedef rpc.ServiceMethod\n * @template TReq extends Message\n * @template TRes extends Message\n * @type {function}\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message\n * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined`\n */\n\n/**\n * Constructs a new RPC service instance.\n * @classdesc An RPC service as returned by {@link Service#create}.\n * @exports rpc.Service\n * @extends util.EventEmitter\n * @constructor\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n */\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\n\n if (typeof rpcImpl !== \"function\")\n throw TypeError(\"rpcImpl must be a function\");\n\n util.EventEmitter.call(this);\n\n /**\n * RPC implementation. Becomes `null` once the service is ended.\n * @type {RPCImpl|null}\n */\n this.rpcImpl = rpcImpl;\n\n /**\n * Whether requests are length-delimited.\n * @type {boolean}\n */\n this.requestDelimited = Boolean(requestDelimited);\n\n /**\n * Whether responses are length-delimited.\n * @type {boolean}\n */\n this.responseDelimited = Boolean(responseDelimited);\n}\n\n/**\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\n * @param {Method|rpc.ServiceMethod} method Reflected or static method\n * @param {Constructor} requestCtor Request constructor\n * @param {Constructor} responseCtor Response constructor\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} callback Service callback\n * @returns {undefined}\n * @template TReq extends Message\n * @template TRes extends Message\n */\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\n\n if (!request)\n throw TypeError(\"request must be specified\");\n\n var self = this;\n if (!callback)\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\n\n if (!self.rpcImpl) {\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\n return undefined;\n }\n\n try {\n return self.rpcImpl(\n method,\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\n function rpcCallback(err, response) {\n\n if (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n\n if (response === null) {\n self.end(/* endedByRPC */ true);\n return undefined;\n }\n\n if (!(response instanceof responseCtor)) {\n try {\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\n } catch (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n }\n\n self.emit(\"data\", response, method);\n return callback(null, response);\n }\n );\n } catch (err) {\n self.emit(\"error\", err, method);\n setTimeout(function() { callback(err); }, 0);\n return undefined;\n }\n};\n\n/**\n * Ends this service and emits the `end` event.\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\n * @returns {rpc.Service} `this`\n */\nService.prototype.end = function end(endedByRPC) {\n if (this.rpcImpl) {\n if (!endedByRPC) // signal end to rpcImpl\n this.rpcImpl(null, null, null);\n this.rpcImpl = null;\n this.emit(\"end\").off();\n }\n return this;\n};\n","\"use strict\";\r\nmodule.exports = codegen;\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @param {string[]} functionParams Function parameter names\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n */\r\nfunction codegen(functionParams, functionName) {\r\n\r\n /* istanbul ignore if */\r\n if (typeof functionParams === \"string\") {\r\n functionName = functionParams;\r\n functionParams = undefined;\r\n }\r\n\r\n var body = [];\r\n\r\n /**\r\n * Appends code to the function's body or finishes generation.\r\n * @typedef Codegen\r\n * @type {function}\r\n * @param {string|Object.} [formatStringOrScope] Format string or, to finish the function, an object of additional scope variables, if any\r\n * @param {...*} [formatParams] Format parameters\r\n * @returns {Codegen|Function} Itself or the generated function if finished\r\n * @throws {Error} If format parameter counts do not match\r\n */\r\n\r\n function Codegen(formatStringOrScope) {\r\n // note that explicit array handling below makes this ~50% faster\r\n\r\n // finish the function\r\n if (typeof formatStringOrScope !== \"string\") {\r\n var source = toString();\r\n if (codegen.verbose)\r\n console.log(\"codegen: \" + source); // eslint-disable-line no-console\r\n source = \"return \" + source;\r\n if (formatStringOrScope) {\r\n var scopeKeys = Object.keys(formatStringOrScope),\r\n scopeParams = new Array(scopeKeys.length + 1),\r\n scopeValues = new Array(scopeKeys.length),\r\n scopeOffset = 0;\r\n while (scopeOffset < scopeKeys.length) {\r\n scopeParams[scopeOffset] = scopeKeys[scopeOffset];\r\n scopeValues[scopeOffset] = formatStringOrScope[scopeKeys[scopeOffset++]];\r\n }\r\n scopeParams[scopeOffset] = source;\r\n return Function.apply(null, scopeParams).apply(null, scopeValues); // eslint-disable-line no-new-func\r\n }\r\n return Function(source)(); // eslint-disable-line no-new-func\r\n }\r\n\r\n // otherwise append to body\r\n var formatParams = new Array(arguments.length - 1),\r\n formatOffset = 0;\r\n while (formatOffset < formatParams.length)\r\n formatParams[formatOffset] = arguments[++formatOffset];\r\n formatOffset = 0;\r\n formatStringOrScope = formatStringOrScope.replace(/%([%dfijs])/g, function replace($0, $1) {\r\n var value = formatParams[formatOffset++];\r\n switch ($1) {\r\n case \"d\": case \"f\": return String(Number(value));\r\n case \"i\": return String(Math.floor(value));\r\n case \"j\": return JSON.stringify(value);\r\n case \"s\": return String(value);\r\n }\r\n return \"%\";\r\n });\r\n if (formatOffset !== formatParams.length)\r\n throw Error(\"parameter count mismatch\");\r\n body.push(formatStringOrScope);\r\n return Codegen;\r\n }\r\n\r\n function toString(functionNameOverride) {\r\n return \"function \" + (functionNameOverride || functionName || \"\") + \"(\" + (functionParams && functionParams.join(\",\") || \"\") + \"){\\n \" + body.join(\"\\n \") + \"\\n}\";\r\n }\r\n\r\n Codegen.toString = toString;\r\n return Codegen;\r\n}\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @function codegen\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * When set to `true`, codegen will log generated code to console. Useful for debugging.\r\n * @name util.codegen.verbose\r\n * @type {boolean}\r\n */\r\ncodegen.verbose = false;\r\n","\"use strict\";\r\nmodule.exports = fetch;\r\n\r\nvar asPromise = require(\"@protobufjs/aspromise\"),\r\n inquire = require(\"@protobufjs/inquire\");\r\n\r\nvar fs = inquire(\"fs\");\r\n\r\n/**\r\n * Node-style callback as used by {@link util.fetch}.\r\n * @typedef FetchCallback\r\n * @type {function}\r\n * @param {?Error} error Error, if any, otherwise `null`\r\n * @param {string} [contents] File contents, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Options as used by {@link util.fetch}.\r\n * @typedef FetchOptions\r\n * @type {Object}\r\n * @property {boolean} [binary=false] Whether expecting a binary response\r\n * @property {boolean} [xhr=false] If `true`, forces the use of XMLHttpRequest\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @memberof util\r\n * @param {string} filename File path or url\r\n * @param {FetchOptions} options Fetch options\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nfunction fetch(filename, options, callback) {\r\n if (typeof options === \"function\") {\r\n callback = options;\r\n options = {};\r\n } else if (!options)\r\n options = {};\r\n\r\n if (!callback)\r\n return asPromise(fetch, this, filename, options); // eslint-disable-line no-invalid-this\r\n\r\n // if a node-like filesystem is present, try it first but fall back to XHR if nothing is found.\r\n if (!options.xhr && fs && fs.readFile)\r\n return fs.readFile(filename, function fetchReadFileCallback(err, contents) {\r\n return err && typeof XMLHttpRequest !== \"undefined\"\r\n ? fetch.xhr(filename, options, callback)\r\n : err\r\n ? callback(err)\r\n : callback(null, options.binary ? contents : contents.toString(\"utf8\"));\r\n });\r\n\r\n // use the XHR version otherwise.\r\n return fetch.xhr(filename, options, callback);\r\n}\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchOptions} [options] Fetch options\r\n * @returns {Promise} Promise\r\n * @variation 3\r\n */\r\n\r\n/**/\r\nfetch.xhr = function fetch_xhr(filename, options, callback) {\r\n var xhr = new XMLHttpRequest();\r\n xhr.onreadystatechange /* works everywhere */ = function fetchOnReadyStateChange() {\r\n\r\n if (xhr.readyState !== 4)\r\n return undefined;\r\n\r\n // local cors security errors return status 0 / empty string, too. afaik this cannot be\r\n // reliably distinguished from an actually empty file for security reasons. feel free\r\n // to send a pull request if you are aware of a solution.\r\n if (xhr.status !== 0 && xhr.status !== 200)\r\n return callback(Error(\"status \" + xhr.status));\r\n\r\n // if binary data is expected, make sure that some sort of array is returned, even if\r\n // ArrayBuffers are not supported. the binary string fallback, however, is unsafe.\r\n if (options.binary) {\r\n var buffer = xhr.response;\r\n if (!buffer) {\r\n buffer = [];\r\n for (var i = 0; i < xhr.responseText.length; ++i)\r\n buffer.push(xhr.responseText.charCodeAt(i) & 255);\r\n }\r\n return callback(null, typeof Uint8Array !== \"undefined\" ? new Uint8Array(buffer) : buffer);\r\n }\r\n return callback(null, xhr.responseText);\r\n };\r\n\r\n if (options.binary) {\r\n // ref: https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Sending_and_Receiving_Binary_Data#Receiving_binary_data_in_older_browsers\r\n if (\"overrideMimeType\" in xhr)\r\n xhr.overrideMimeType(\"text/plain; charset=x-user-defined\");\r\n xhr.responseType = \"arraybuffer\";\r\n }\r\n\r\n xhr.open(\"GET\", filename);\r\n xhr.send();\r\n};\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal path module to resolve Unix, Windows and URL paths alike.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar path = exports;\r\n\r\nvar isAbsolute =\r\n/**\r\n * Tests if the specified path is absolute.\r\n * @param {string} path Path to test\r\n * @returns {boolean} `true` if path is absolute\r\n */\r\npath.isAbsolute = function isAbsolute(path) {\r\n return /^(?:\\/|\\w+:)/.test(path);\r\n};\r\n\r\nvar normalize =\r\n/**\r\n * Normalizes the specified path.\r\n * @param {string} path Path to normalize\r\n * @returns {string} Normalized path\r\n */\r\npath.normalize = function normalize(path) {\r\n path = path.replace(/\\\\/g, \"/\")\r\n .replace(/\\/{2,}/g, \"/\");\r\n var parts = path.split(\"/\"),\r\n absolute = isAbsolute(path),\r\n prefix = \"\";\r\n if (absolute)\r\n prefix = parts.shift() + \"/\";\r\n for (var i = 0; i < parts.length;) {\r\n if (parts[i] === \"..\") {\r\n if (i > 0 && parts[i - 1] !== \"..\")\r\n parts.splice(--i, 2);\r\n else if (absolute)\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n } else if (parts[i] === \".\")\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n return prefix + parts.join(\"/\");\r\n};\r\n\r\n/**\r\n * Resolves the specified include path against the specified origin path.\r\n * @param {string} originPath Path to the origin file\r\n * @param {string} includePath Include path relative to origin path\r\n * @param {boolean} [alreadyNormalized=false] `true` if both paths are already known to be normalized\r\n * @returns {string} Path to the include file\r\n */\r\npath.resolve = function resolve(originPath, includePath, alreadyNormalized) {\r\n if (!alreadyNormalized)\r\n includePath = normalize(includePath);\r\n if (isAbsolute(includePath))\r\n return includePath;\r\n if (!alreadyNormalized)\r\n originPath = normalize(originPath);\r\n return (originPath = originPath.replace(/(?:\\/|^)[^/]+$/, \"\")).length ? normalize(originPath + \"/\" + includePath) : includePath;\r\n};\r\n","const basex = require('base-x')\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (source instanceof Uint8Array) {\n } else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source)\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = new Uint8Array(zeroes + (size - it4))\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","\"use strict\";\nmodule.exports = parse;\n\nparse.filename = null;\nparse.defaults = { keepCase: false };\n\nvar tokenize = require(\"./tokenize\"),\n Root = require(\"./root\"),\n Type = require(\"./type\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n OneOf = require(\"./oneof\"),\n Enum = require(\"./enum\"),\n Service = require(\"./service\"),\n Method = require(\"./method\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar base10Re = /^[1-9][0-9]*$/,\n base10NegRe = /^-?[1-9][0-9]*$/,\n base16Re = /^0[x][0-9a-fA-F]+$/,\n base16NegRe = /^-?0[x][0-9a-fA-F]+$/,\n base8Re = /^0[0-7]+$/,\n base8NegRe = /^-?0[0-7]+$/,\n numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,\n nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/,\n typeRefRe = /^(?:\\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,\n fqTypeRefRe = /^(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;\n\n/**\n * Result object returned from {@link parse}.\n * @interface IParserResult\n * @property {string|undefined} package Package name, if declared\n * @property {string[]|undefined} imports Imports, if any\n * @property {string[]|undefined} weakImports Weak imports, if any\n * @property {string|undefined} syntax Syntax, if specified (either `\"proto2\"` or `\"proto3\"`)\n * @property {Root} root Populated root instance\n */\n\n/**\n * Options modifying the behavior of {@link parse}.\n * @interface IParseOptions\n * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case\n * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments.\n */\n\n/**\n * Options modifying the behavior of JSON serialization.\n * @interface IToJSONOptions\n * @property {boolean} [keepComments=false] Serializes comments.\n */\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @param {string} source Source contents\n * @param {Root} root Root to populate\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n */\nfunction parse(source, root, options) {\n /* eslint-disable callback-return */\n if (!(root instanceof Root)) {\n options = root;\n root = new Root();\n }\n if (!options)\n options = parse.defaults;\n\n var tn = tokenize(source, options.alternateCommentMode || false),\n next = tn.next,\n push = tn.push,\n peek = tn.peek,\n skip = tn.skip,\n cmnt = tn.cmnt;\n\n var head = true,\n pkg,\n imports,\n weakImports,\n syntax,\n isProto3 = false;\n\n var ptr = root;\n\n var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase;\n\n /* istanbul ignore next */\n function illegal(token, name, insideTryCatch) {\n var filename = parse.filename;\n if (!insideTryCatch)\n parse.filename = null;\n return Error(\"illegal \" + (name || \"token\") + \" '\" + token + \"' (\" + (filename ? filename + \", \" : \"\") + \"line \" + tn.line + \")\");\n }\n\n function readString() {\n var values = [],\n token;\n do {\n /* istanbul ignore if */\n if ((token = next()) !== \"\\\"\" && token !== \"'\")\n throw illegal(token);\n\n values.push(next());\n skip(token);\n token = peek();\n } while (token === \"\\\"\" || token === \"'\");\n return values.join(\"\");\n }\n\n function readValue(acceptTypeRef) {\n var token = next();\n switch (token) {\n case \"'\":\n case \"\\\"\":\n push(token);\n return readString();\n case \"true\": case \"TRUE\":\n return true;\n case \"false\": case \"FALSE\":\n return false;\n }\n try {\n return parseNumber(token, /* insideTryCatch */ true);\n } catch (e) {\n\n /* istanbul ignore else */\n if (acceptTypeRef && typeRefRe.test(token))\n return token;\n\n /* istanbul ignore next */\n throw illegal(token, \"value\");\n }\n }\n\n function readRanges(target, acceptStrings) {\n var token, start;\n do {\n if (acceptStrings && ((token = peek()) === \"\\\"\" || token === \"'\"))\n target.push(readString());\n else\n target.push([ start = parseId(next()), skip(\"to\", true) ? parseId(next()) : start ]);\n } while (skip(\",\", true));\n skip(\";\");\n }\n\n function parseNumber(token, insideTryCatch) {\n var sign = 1;\n if (token.charAt(0) === \"-\") {\n sign = -1;\n token = token.substring(1);\n }\n switch (token) {\n case \"inf\": case \"INF\": case \"Inf\":\n return sign * Infinity;\n case \"nan\": case \"NAN\": case \"Nan\": case \"NaN\":\n return NaN;\n case \"0\":\n return 0;\n }\n if (base10Re.test(token))\n return sign * parseInt(token, 10);\n if (base16Re.test(token))\n return sign * parseInt(token, 16);\n if (base8Re.test(token))\n return sign * parseInt(token, 8);\n\n /* istanbul ignore else */\n if (numberRe.test(token))\n return sign * parseFloat(token);\n\n /* istanbul ignore next */\n throw illegal(token, \"number\", insideTryCatch);\n }\n\n function parseId(token, acceptNegative) {\n switch (token) {\n case \"max\": case \"MAX\": case \"Max\":\n return 536870911;\n case \"0\":\n return 0;\n }\n\n /* istanbul ignore if */\n if (!acceptNegative && token.charAt(0) === \"-\")\n throw illegal(token, \"id\");\n\n if (base10NegRe.test(token))\n return parseInt(token, 10);\n if (base16NegRe.test(token))\n return parseInt(token, 16);\n\n /* istanbul ignore else */\n if (base8NegRe.test(token))\n return parseInt(token, 8);\n\n /* istanbul ignore next */\n throw illegal(token, \"id\");\n }\n\n function parsePackage() {\n\n /* istanbul ignore if */\n if (pkg !== undefined)\n throw illegal(\"package\");\n\n pkg = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(pkg))\n throw illegal(pkg, \"name\");\n\n ptr = ptr.define(pkg);\n skip(\";\");\n }\n\n function parseImport() {\n var token = peek();\n var whichImports;\n switch (token) {\n case \"weak\":\n whichImports = weakImports || (weakImports = []);\n next();\n break;\n case \"public\":\n next();\n // eslint-disable-line no-fallthrough\n default:\n whichImports = imports || (imports = []);\n break;\n }\n token = readString();\n skip(\";\");\n whichImports.push(token);\n }\n\n function parseSyntax() {\n skip(\"=\");\n syntax = readString();\n isProto3 = syntax === \"proto3\";\n\n /* istanbul ignore if */\n if (!isProto3 && syntax !== \"proto2\")\n throw illegal(syntax, \"syntax\");\n\n skip(\";\");\n }\n\n function parseCommon(parent, token) {\n switch (token) {\n\n case \"option\":\n parseOption(parent, token);\n skip(\";\");\n return true;\n\n case \"message\":\n parseType(parent, token);\n return true;\n\n case \"enum\":\n parseEnum(parent, token);\n return true;\n\n case \"service\":\n parseService(parent, token);\n return true;\n\n case \"extend\":\n parseExtension(parent, token);\n return true;\n }\n return false;\n }\n\n function ifBlock(obj, fnIf, fnElse) {\n var trailingLine = tn.line;\n if (obj) {\n obj.comment = cmnt(); // try block-type comment\n obj.filename = parse.filename;\n }\n if (skip(\"{\", true)) {\n var token;\n while ((token = next()) !== \"}\")\n fnIf(token);\n skip(\";\", true);\n } else {\n if (fnElse)\n fnElse();\n skip(\";\");\n if (obj && typeof obj.comment !== \"string\")\n obj.comment = cmnt(trailingLine); // try line-type comment if no block\n }\n }\n\n function parseType(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"type name\");\n\n var type = new Type(token);\n ifBlock(type, function parseType_block(token) {\n if (parseCommon(type, token))\n return;\n\n switch (token) {\n\n case \"map\":\n parseMapField(type, token);\n break;\n\n case \"required\":\n case \"optional\":\n case \"repeated\":\n parseField(type, token);\n break;\n\n case \"oneof\":\n parseOneOf(type, token);\n break;\n\n case \"extensions\":\n readRanges(type.extensions || (type.extensions = []));\n break;\n\n case \"reserved\":\n readRanges(type.reserved || (type.reserved = []), true);\n break;\n\n default:\n /* istanbul ignore if */\n if (!isProto3 || !typeRefRe.test(token))\n throw illegal(token);\n\n push(token);\n parseField(type, \"optional\");\n break;\n }\n });\n parent.add(type);\n }\n\n function parseField(parent, rule, extend) {\n var type = next();\n if (type === \"group\") {\n parseGroup(parent, rule);\n return;\n }\n\n /* istanbul ignore if */\n if (!typeRefRe.test(type))\n throw illegal(type, \"type\");\n\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n name = applyCase(name);\n skip(\"=\");\n\n var field = new Field(name, parseId(next()), type, rule, extend);\n ifBlock(field, function parseField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseField_line() {\n parseInlineOptions(field);\n });\n parent.add(field);\n\n // JSON defaults to packed=true if not set so we have to set packed=false explicity when\n // parsing proto2 descriptors without the option, where applicable. This must be done for\n // all known packable types and anything that could be an enum (= is not a basic type).\n if (!isProto3 && field.repeated && (types.packed[type] !== undefined || types.basic[type] === undefined))\n field.setOption(\"packed\", false, /* ifNotSet */ true);\n }\n\n function parseGroup(parent, rule) {\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n var fieldName = util.lcFirst(name);\n if (name === fieldName)\n name = util.ucFirst(name);\n skip(\"=\");\n var id = parseId(next());\n var type = new Type(name);\n type.group = true;\n var field = new Field(fieldName, id, name, rule);\n field.filename = parse.filename;\n ifBlock(type, function parseGroup_block(token) {\n switch (token) {\n\n case \"option\":\n parseOption(type, token);\n skip(\";\");\n break;\n\n case \"required\":\n case \"optional\":\n case \"repeated\":\n parseField(type, token);\n break;\n\n /* istanbul ignore next */\n default:\n throw illegal(token); // there are no groups with proto3 semantics\n }\n });\n parent.add(type)\n .add(field);\n }\n\n function parseMapField(parent) {\n skip(\"<\");\n var keyType = next();\n\n /* istanbul ignore if */\n if (types.mapKey[keyType] === undefined)\n throw illegal(keyType, \"type\");\n\n skip(\",\");\n var valueType = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(valueType))\n throw illegal(valueType, \"type\");\n\n skip(\">\");\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n skip(\"=\");\n var field = new MapField(applyCase(name), parseId(next()), keyType, valueType);\n ifBlock(field, function parseMapField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseMapField_line() {\n parseInlineOptions(field);\n });\n parent.add(field);\n }\n\n function parseOneOf(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var oneof = new OneOf(applyCase(token));\n ifBlock(oneof, function parseOneOf_block(token) {\n if (token === \"option\") {\n parseOption(oneof, token);\n skip(\";\");\n } else {\n push(token);\n parseField(oneof, \"optional\");\n }\n });\n parent.add(oneof);\n }\n\n function parseEnum(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var enm = new Enum(token);\n ifBlock(enm, function parseEnum_block(token) {\n switch(token) {\n case \"option\":\n parseOption(enm, token);\n skip(\";\");\n break;\n\n case \"reserved\":\n readRanges(enm.reserved || (enm.reserved = []), true);\n break;\n\n default:\n parseEnumValue(enm, token);\n }\n });\n parent.add(enm);\n }\n\n function parseEnumValue(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token))\n throw illegal(token, \"name\");\n\n skip(\"=\");\n var value = parseId(next(), true),\n dummy = {};\n ifBlock(dummy, function parseEnumValue_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(dummy, token); // skip\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseEnumValue_line() {\n parseInlineOptions(dummy); // skip\n });\n parent.add(token, value, dummy.comment);\n }\n\n function parseOption(parent, token) {\n var isCustom = skip(\"(\", true);\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var name = token;\n if (isCustom) {\n skip(\")\");\n name = \"(\" + name + \")\";\n token = peek();\n if (fqTypeRefRe.test(token)) {\n name += token;\n next();\n }\n }\n skip(\"=\");\n parseOptionValue(parent, name);\n }\n\n function parseOptionValue(parent, name) {\n if (skip(\"{\", true)) { // { a: \"foo\" b { c: \"bar\" } }\n do {\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n if (peek() === \"{\")\n parseOptionValue(parent, name + \".\" + token);\n else {\n skip(\":\");\n if (peek() === \"{\")\n parseOptionValue(parent, name + \".\" + token);\n else\n setOption(parent, name + \".\" + token, readValue(true));\n }\n skip(\",\", true);\n } while (!skip(\"}\", true));\n } else\n setOption(parent, name, readValue(true));\n // Does not enforce a delimiter to be universal\n }\n\n function setOption(parent, name, value) {\n if (parent.setOption)\n parent.setOption(name, value);\n }\n\n function parseInlineOptions(parent) {\n if (skip(\"[\", true)) {\n do {\n parseOption(parent, \"option\");\n } while (skip(\",\", true));\n skip(\"]\");\n }\n return parent;\n }\n\n function parseService(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"service name\");\n\n var service = new Service(token);\n ifBlock(service, function parseService_block(token) {\n if (parseCommon(service, token))\n return;\n\n /* istanbul ignore else */\n if (token === \"rpc\")\n parseMethod(service, token);\n else\n throw illegal(token);\n });\n parent.add(service);\n }\n\n function parseMethod(parent, token) {\n var type = token;\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var name = token,\n requestType, requestStream,\n responseType, responseStream;\n\n skip(\"(\");\n if (skip(\"stream\", true))\n requestStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n requestType = token;\n skip(\")\"); skip(\"returns\"); skip(\"(\");\n if (skip(\"stream\", true))\n responseStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n responseType = token;\n skip(\")\");\n\n var method = new Method(name, type, requestType, responseType, requestStream, responseStream);\n ifBlock(method, function parseMethod_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(method, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n });\n parent.add(method);\n }\n\n function parseExtension(parent, token) {\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token, \"reference\");\n\n var reference = token;\n ifBlock(null, function parseExtension_block(token) {\n switch (token) {\n\n case \"required\":\n case \"repeated\":\n case \"optional\":\n parseField(parent, token, reference);\n break;\n\n default:\n /* istanbul ignore if */\n if (!isProto3 || !typeRefRe.test(token))\n throw illegal(token);\n push(token);\n parseField(parent, \"optional\", reference);\n break;\n }\n });\n }\n\n var token;\n while ((token = next()) !== null) {\n switch (token) {\n\n case \"package\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parsePackage();\n break;\n\n case \"import\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseImport();\n break;\n\n case \"syntax\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseSyntax();\n break;\n\n case \"option\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseOption(ptr, token);\n skip(\";\");\n break;\n\n default:\n\n /* istanbul ignore else */\n if (parseCommon(ptr, token)) {\n head = false;\n continue;\n }\n\n /* istanbul ignore next */\n throw illegal(token);\n }\n }\n\n parse.filename = null;\n return {\n \"package\" : pkg,\n \"imports\" : imports,\n weakImports : weakImports,\n syntax : syntax,\n root : root\n };\n}\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @name parse\n * @function\n * @param {string} source Source contents\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n * @variation 2\n */\n","\"use strict\";\nmodule.exports = common;\n\nvar commonRe = /\\/|\\./;\n\n/**\n * Provides common type definitions.\n * Can also be used to provide additional google types or your own custom types.\n * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name\n * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition\n * @returns {undefined}\n * @property {INamespace} google/protobuf/any.proto Any\n * @property {INamespace} google/protobuf/duration.proto Duration\n * @property {INamespace} google/protobuf/empty.proto Empty\n * @property {INamespace} google/protobuf/field_mask.proto FieldMask\n * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue\n * @property {INamespace} google/protobuf/timestamp.proto Timestamp\n * @property {INamespace} google/protobuf/wrappers.proto Wrappers\n * @example\n * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension)\n * protobuf.common(\"descriptor\", descriptorJson);\n *\n * // manually provides a custom definition (uses my.foo namespace)\n * protobuf.common(\"my/foo/bar.proto\", myFooBarJson);\n */\nfunction common(name, json) {\n if (!commonRe.test(name)) {\n name = \"google/protobuf/\" + name + \".proto\";\n json = { nested: { google: { nested: { protobuf: { nested: json } } } } };\n }\n common[name] = json;\n}\n\n// Not provided because of limited use (feel free to discuss or to provide yourself):\n//\n// google/protobuf/descriptor.proto\n// google/protobuf/source_context.proto\n// google/protobuf/type.proto\n//\n// Stripped and pre-parsed versions of these non-bundled files are instead available as part of\n// the repository or package within the google/protobuf directory.\n\ncommon(\"any\", {\n\n /**\n * Properties of a google.protobuf.Any message.\n * @interface IAny\n * @type {Object}\n * @property {string} [typeUrl]\n * @property {Uint8Array} [bytes]\n * @memberof common\n */\n Any: {\n fields: {\n type_url: {\n type: \"string\",\n id: 1\n },\n value: {\n type: \"bytes\",\n id: 2\n }\n }\n }\n});\n\nvar timeType;\n\ncommon(\"duration\", {\n\n /**\n * Properties of a google.protobuf.Duration message.\n * @interface IDuration\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Duration: timeType = {\n fields: {\n seconds: {\n type: \"int64\",\n id: 1\n },\n nanos: {\n type: \"int32\",\n id: 2\n }\n }\n }\n});\n\ncommon(\"timestamp\", {\n\n /**\n * Properties of a google.protobuf.Timestamp message.\n * @interface ITimestamp\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Timestamp: timeType\n});\n\ncommon(\"empty\", {\n\n /**\n * Properties of a google.protobuf.Empty message.\n * @interface IEmpty\n * @memberof common\n */\n Empty: {\n fields: {}\n }\n});\n\ncommon(\"struct\", {\n\n /**\n * Properties of a google.protobuf.Struct message.\n * @interface IStruct\n * @type {Object}\n * @property {Object.} [fields]\n * @memberof common\n */\n Struct: {\n fields: {\n fields: {\n keyType: \"string\",\n type: \"Value\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Value message.\n * @interface IValue\n * @type {Object}\n * @property {string} [kind]\n * @property {0} [nullValue]\n * @property {number} [numberValue]\n * @property {string} [stringValue]\n * @property {boolean} [boolValue]\n * @property {IStruct} [structValue]\n * @property {IListValue} [listValue]\n * @memberof common\n */\n Value: {\n oneofs: {\n kind: {\n oneof: [\n \"nullValue\",\n \"numberValue\",\n \"stringValue\",\n \"boolValue\",\n \"structValue\",\n \"listValue\"\n ]\n }\n },\n fields: {\n nullValue: {\n type: \"NullValue\",\n id: 1\n },\n numberValue: {\n type: \"double\",\n id: 2\n },\n stringValue: {\n type: \"string\",\n id: 3\n },\n boolValue: {\n type: \"bool\",\n id: 4\n },\n structValue: {\n type: \"Struct\",\n id: 5\n },\n listValue: {\n type: \"ListValue\",\n id: 6\n }\n }\n },\n\n NullValue: {\n values: {\n NULL_VALUE: 0\n }\n },\n\n /**\n * Properties of a google.protobuf.ListValue message.\n * @interface IListValue\n * @type {Object}\n * @property {Array.} [values]\n * @memberof common\n */\n ListValue: {\n fields: {\n values: {\n rule: \"repeated\",\n type: \"Value\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"wrappers\", {\n\n /**\n * Properties of a google.protobuf.DoubleValue message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n DoubleValue: {\n fields: {\n value: {\n type: \"double\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.FloatValue message.\n * @interface IFloatValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FloatValue: {\n fields: {\n value: {\n type: \"float\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int64Value message.\n * @interface IInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n Int64Value: {\n fields: {\n value: {\n type: \"int64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt64Value message.\n * @interface IUInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n UInt64Value: {\n fields: {\n value: {\n type: \"uint64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int32Value message.\n * @interface IInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n Int32Value: {\n fields: {\n value: {\n type: \"int32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt32Value message.\n * @interface IUInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n UInt32Value: {\n fields: {\n value: {\n type: \"uint32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BoolValue message.\n * @interface IBoolValue\n * @type {Object}\n * @property {boolean} [value]\n * @memberof common\n */\n BoolValue: {\n fields: {\n value: {\n type: \"bool\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.StringValue message.\n * @interface IStringValue\n * @type {Object}\n * @property {string} [value]\n * @memberof common\n */\n StringValue: {\n fields: {\n value: {\n type: \"string\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BytesValue message.\n * @interface IBytesValue\n * @type {Object}\n * @property {Uint8Array} [value]\n * @memberof common\n */\n BytesValue: {\n fields: {\n value: {\n type: \"bytes\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"field_mask\", {\n\n /**\n * Properties of a google.protobuf.FieldMask message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FieldMask: {\n fields: {\n paths: {\n rule: \"repeated\",\n type: \"string\",\n id: 1\n }\n }\n }\n});\n\n/**\n * Gets the root definition of the specified common proto file.\n *\n * Bundled definitions are:\n * - google/protobuf/any.proto\n * - google/protobuf/duration.proto\n * - google/protobuf/empty.proto\n * - google/protobuf/field_mask.proto\n * - google/protobuf/struct.proto\n * - google/protobuf/timestamp.proto\n * - google/protobuf/wrappers.proto\n *\n * @param {string} file Proto file name\n * @returns {INamespace|null} Root definition or `null` if not defined\n */\ncommon.get = function get(file) {\n return common[file] || null;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction ShortCurve(conf) {\n Base.call(this, 'short', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.tinv = this.two.redInvm();\n\n this.zeroA = this.a.fromRed().cmpn(0) === 0;\n this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;\n\n // If the curve is endomorphic, precalculate beta and lambda\n this.endo = this._getEndomorphism(conf);\n this._endoWnafT1 = new Array(4);\n this._endoWnafT2 = new Array(4);\n}\ninherits(ShortCurve, Base);\nmodule.exports = ShortCurve;\n\nShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {\n // No efficient endomorphism\n if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)\n return;\n\n // Compute beta and lambda, that lambda * P = (beta * Px; Py)\n var beta;\n var lambda;\n if (conf.beta) {\n beta = new BN(conf.beta, 16).toRed(this.red);\n } else {\n var betas = this._getEndoRoots(this.p);\n // Choose the smallest beta\n beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];\n beta = beta.toRed(this.red);\n }\n if (conf.lambda) {\n lambda = new BN(conf.lambda, 16);\n } else {\n // Choose the lambda that is matching selected beta\n var lambdas = this._getEndoRoots(this.n);\n if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {\n lambda = lambdas[0];\n } else {\n lambda = lambdas[1];\n assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);\n }\n }\n\n // Get basis vectors, used for balanced length-two representation\n var basis;\n if (conf.basis) {\n basis = conf.basis.map(function(vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n });\n } else {\n basis = this._getEndoBasis(lambda);\n }\n\n return {\n beta: beta,\n lambda: lambda,\n basis: basis,\n };\n};\n\nShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {\n // Find roots of for x^2 + x + 1 in F\n // Root = (-1 +- Sqrt(-3)) / 2\n //\n var red = num === this.p ? this.red : BN.mont(num);\n var tinv = new BN(2).toRed(red).redInvm();\n var ntinv = tinv.redNeg();\n\n var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);\n\n var l1 = ntinv.redAdd(s).fromRed();\n var l2 = ntinv.redSub(s).fromRed();\n return [ l1, l2 ];\n};\n\nShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {\n // aprxSqrt >= sqrt(this.n)\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));\n\n // 3.74\n // Run EGCD, until r(L + 1) < aprxSqrt\n var u = lambda;\n var v = this.n.clone();\n var x1 = new BN(1);\n var y1 = new BN(0);\n var x2 = new BN(0);\n var y2 = new BN(1);\n\n // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)\n var a0;\n var b0;\n // First vector\n var a1;\n var b1;\n // Second vector\n var a2;\n var b2;\n\n var prevR;\n var i = 0;\n var r;\n var x;\n while (u.cmpn(0) !== 0) {\n var q = v.div(u);\n r = v.sub(q.mul(u));\n x = x2.sub(q.mul(x1));\n var y = y2.sub(q.mul(y1));\n\n if (!a1 && r.cmp(aprxSqrt) < 0) {\n a0 = prevR.neg();\n b0 = x1;\n a1 = r.neg();\n b1 = x;\n } else if (a1 && ++i === 2) {\n break;\n }\n prevR = r;\n\n v = u;\n u = r;\n x2 = x1;\n x1 = x;\n y2 = y1;\n y1 = y;\n }\n a2 = r.neg();\n b2 = x;\n\n var len1 = a1.sqr().add(b1.sqr());\n var len2 = a2.sqr().add(b2.sqr());\n if (len2.cmp(len1) >= 0) {\n a2 = a0;\n b2 = b0;\n }\n\n // Normalize signs\n if (a1.negative) {\n a1 = a1.neg();\n b1 = b1.neg();\n }\n if (a2.negative) {\n a2 = a2.neg();\n b2 = b2.neg();\n }\n\n return [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ];\n};\n\nShortCurve.prototype._endoSplit = function _endoSplit(k) {\n var basis = this.endo.basis;\n var v1 = basis[0];\n var v2 = basis[1];\n\n var c1 = v2.b.mul(k).divRound(this.n);\n var c2 = v1.b.neg().mul(k).divRound(this.n);\n\n var p1 = c1.mul(v1.a);\n var p2 = c2.mul(v2.a);\n var q1 = c1.mul(v1.b);\n var q2 = c2.mul(v2.b);\n\n // Calculate answer\n var k1 = k.sub(p1).sub(p2);\n var k2 = q1.add(q2).neg();\n return { k1: k1, k2: k2 };\n};\n\nShortCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n // XXX Is there any way to tell if the number is odd without converting it\n // to non-red form?\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nShortCurve.prototype.validate = function validate(point) {\n if (point.inf)\n return true;\n\n var x = point.x;\n var y = point.y;\n\n var ax = this.a.redMul(x);\n var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n};\n\nShortCurve.prototype._endoWnafMulAdd =\n function _endoWnafMulAdd(points, coeffs, jacobianResult) {\n var npoints = this._endoWnafT1;\n var ncoeffs = this._endoWnafT2;\n for (var i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]);\n var p = points[i];\n var beta = p._getBeta();\n\n if (split.k1.negative) {\n split.k1.ineg();\n p = p.neg(true);\n }\n if (split.k2.negative) {\n split.k2.ineg();\n beta = beta.neg(true);\n }\n\n npoints[i * 2] = p;\n npoints[i * 2 + 1] = beta;\n ncoeffs[i * 2] = split.k1;\n ncoeffs[i * 2 + 1] = split.k2;\n }\n var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);\n\n // Clean-up references to points and coefficients\n for (var j = 0; j < i * 2; j++) {\n npoints[j] = null;\n ncoeffs[j] = null;\n }\n return res;\n };\n\nfunction Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, 'affine');\n if (x === null && y === null) {\n this.x = null;\n this.y = null;\n this.inf = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n // Force redgomery representation when loading from JSON\n if (isRed) {\n this.x.forceRed(this.curve.red);\n this.y.forceRed(this.curve.red);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n this.inf = false;\n }\n}\ninherits(Point, Base.BasePoint);\n\nShortCurve.prototype.point = function point(x, y, isRed) {\n return new Point(this, x, y, isRed);\n};\n\nShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {\n return Point.fromJSON(this, obj, red);\n};\n\nPoint.prototype._getBeta = function _getBeta() {\n if (!this.curve.endo)\n return;\n\n var pre = this.precomputed;\n if (pre && pre.beta)\n return pre.beta;\n\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve;\n var endoMul = function(p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n pre.beta = beta;\n beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n };\n }\n return beta;\n};\n\nPoint.prototype.toJSON = function toJSON() {\n if (!this.precomputed)\n return [ this.x, this.y ];\n\n return [ this.x, this.y, this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n } ];\n};\n\nPoint.fromJSON = function fromJSON(curve, obj, red) {\n if (typeof obj === 'string')\n obj = JSON.parse(obj);\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2])\n return res;\n\n function obj2point(obj) {\n return curve.point(obj[0], obj[1], red);\n }\n\n var pre = obj[2];\n res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [ res ].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [ res ].concat(pre.naf.points.map(obj2point)),\n },\n };\n return res;\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n return this.inf;\n};\n\nPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.inf)\n return p;\n\n // P + O = P\n if (p.inf)\n return this;\n\n // P + P = 2P\n if (this.eq(p))\n return this.dbl();\n\n // P + (-P) = O\n if (this.neg().eq(p))\n return this.curve.point(null, null);\n\n // P + Q = O\n if (this.x.cmp(p.x) === 0)\n return this.curve.point(null, null);\n\n var c = this.y.redSub(p.y);\n if (c.cmpn(0) !== 0)\n c = c.redMul(this.x.redSub(p.x).redInvm());\n var nx = c.redSqr().redISub(this.x).redISub(p.x);\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.inf)\n return this;\n\n // 2P = O\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0)\n return this.curve.point(null, null);\n\n var a = this.curve.a;\n\n var x2 = this.x.redSqr();\n var dyinv = ys1.redInvm();\n var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);\n\n var nx = c.redSqr().redISub(this.x.redAdd(this.x));\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.getX = function getX() {\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n return this.y.fromRed();\n};\n\nPoint.prototype.mul = function mul(k) {\n k = new BN(k, 16);\n if (this.isInfinity())\n return this;\n else if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else if (this.curve.endo)\n return this.curve._endoWnafMulAdd([ this ], [ k ]);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs, true);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2, true);\n};\n\nPoint.prototype.eq = function eq(p) {\n return this === p ||\n this.inf === p.inf &&\n (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);\n};\n\nPoint.prototype.neg = function neg(_precompute) {\n if (this.inf)\n return this;\n\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed;\n var negate = function(p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n};\n\nPoint.prototype.toJ = function toJ() {\n if (this.inf)\n return this.curve.jpoint(null, null, null);\n\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n};\n\nfunction JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, 'jacobian');\n if (x === null && y === null && z === null) {\n this.x = this.curve.one;\n this.y = this.curve.one;\n this.z = new BN(0);\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = new BN(z, 16);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n\n this.zOne = this.z === this.curve.one;\n}\ninherits(JPoint, Base.BasePoint);\n\nShortCurve.prototype.jpoint = function jpoint(x, y, z) {\n return new JPoint(this, x, y, z);\n};\n\nJPoint.prototype.toP = function toP() {\n if (this.isInfinity())\n return this.curve.point(null, null);\n\n var zinv = this.z.redInvm();\n var zinv2 = zinv.redSqr();\n var ax = this.x.redMul(zinv2);\n var ay = this.y.redMul(zinv2).redMul(zinv);\n\n return this.curve.point(ax, ay);\n};\n\nJPoint.prototype.neg = function neg() {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n};\n\nJPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.isInfinity())\n return p;\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 12M + 4S + 7A\n var pz2 = p.z.redSqr();\n var z2 = this.z.redSqr();\n var u1 = this.x.redMul(pz2);\n var u2 = p.x.redMul(z2);\n var s1 = this.y.redMul(pz2.redMul(p.z));\n var s2 = p.y.redMul(z2.redMul(this.z));\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(p.z).redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mixedAdd = function mixedAdd(p) {\n // O + P = P\n if (this.isInfinity())\n return p.toJ();\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 8M + 3S + 7A\n var z2 = this.z.redSqr();\n var u1 = this.x;\n var u2 = p.x.redMul(z2);\n var s1 = this.y;\n var s2 = p.y.redMul(z2).redMul(this.z);\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.dblp = function dblp(pow) {\n if (pow === 0)\n return this;\n if (this.isInfinity())\n return this;\n if (!pow)\n return this.dbl();\n\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++)\n r = r.dbl();\n return r;\n }\n\n // 1M + 2S + 1A + N * (4S + 5M + 8A)\n // N = 1 => 6M + 6S + 9A\n var a = this.curve.a;\n var tinv = this.curve.tinv;\n\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n // Reuse results\n var jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr();\n var jyd2 = jyd.redSqr();\n var jyd4 = jyd2.redSqr();\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var t1 = jx.redMul(jyd2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n var dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n if (i + 1 < pow)\n jz4 = jz4.redMul(jyd4);\n\n jx = nx;\n jz = nz;\n jyd = dny;\n }\n\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n};\n\nJPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n if (this.curve.zeroA)\n return this._zeroDbl();\n else if (this.curve.threeA)\n return this._threeDbl();\n else\n return this._dbl();\n};\n\nJPoint.prototype._zeroDbl = function _zeroDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 14A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // T = M ^ 2 - 2*S\n var t = m.redSqr().redISub(s).redISub(s);\n\n // 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2*Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-dbl-2009-l\n // 2M + 5S + 13A\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = B^2\n var c = b.redSqr();\n // D = 2 * ((X1 + B)^2 - A - C)\n var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n // E = 3 * A\n var e = a.redAdd(a).redIAdd(a);\n // F = E^2\n var f = e.redSqr();\n\n // 8 * C\n var c8 = c.redIAdd(c);\n c8 = c8.redIAdd(c8);\n c8 = c8.redIAdd(c8);\n\n // X3 = F - 2 * D\n nx = f.redISub(d).redISub(d);\n // Y3 = E * (D - X3) - 8 * C\n ny = e.redMul(d.redISub(nx)).redISub(c8);\n // Z3 = 2 * Y1 * Z1\n nz = this.y.redMul(this.z);\n nz = nz.redIAdd(nz);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._threeDbl = function _threeDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 15A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);\n // T = M^2 - 2 * S\n var t = m.redSqr().redISub(s).redISub(s);\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2 * Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n // 3M + 5S\n\n // delta = Z1^2\n var delta = this.z.redSqr();\n // gamma = Y1^2\n var gamma = this.y.redSqr();\n // beta = X1 * gamma\n var beta = this.x.redMul(gamma);\n // alpha = 3 * (X1 - delta) * (X1 + delta)\n var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n // X3 = alpha^2 - 8 * beta\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n nx = alpha.redSqr().redISub(beta8);\n // Z3 = (Y1 + Z1)^2 - gamma - delta\n nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n var ggamma8 = gamma.redSqr();\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._dbl = function _dbl() {\n var a = this.curve.a;\n\n // 4M + 6S + 10A\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n var jx2 = jx.redSqr();\n var jy2 = jy.redSqr();\n\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n\n var jyd8 = jy2.redSqr();\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n var ny = c.redMul(t2).redISub(jyd8);\n var nz = jy.redAdd(jy).redMul(jz);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.trpl = function trpl() {\n if (!this.curve.zeroA)\n return this.dbl().add(this);\n\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl\n // 5M + 10S + ...\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // ZZ = Z1^2\n var zz = this.z.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // M = 3 * XX + a * ZZ2; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // MM = M^2\n var mm = m.redSqr();\n // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM\n var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n e = e.redIAdd(e);\n e = e.redAdd(e).redIAdd(e);\n e = e.redISub(mm);\n // EE = E^2\n var ee = e.redSqr();\n // T = 16*YYYY\n var t = yyyy.redIAdd(yyyy);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n // U = (M + E)^2 - MM - EE - T\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);\n // X3 = 4 * (X1 * EE - 4 * YY * U)\n var yyu4 = yy.redMul(u);\n yyu4 = yyu4.redIAdd(yyu4);\n yyu4 = yyu4.redIAdd(yyu4);\n var nx = this.x.redMul(ee).redISub(yyu4);\n nx = nx.redIAdd(nx);\n nx = nx.redIAdd(nx);\n // Y3 = 8 * Y1 * (U * (T - U) - E * EE)\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n // Z3 = (Z1 + E)^2 - ZZ - EE\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mul = function mul(k, kbase) {\n k = new BN(k, kbase);\n\n return this.curve._wnafMul(this, k);\n};\n\nJPoint.prototype.eq = function eq(p) {\n if (p.type === 'affine')\n return this.eq(p.toJ());\n\n if (this === p)\n return true;\n\n // x1 * z2^2 == x2 * z1^2\n var z2 = this.z.redSqr();\n var pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)\n return false;\n\n // y1 * z2^3 == y2 * z1^3\n var z3 = z2.redMul(this.z);\n var pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n};\n\nJPoint.prototype.eqXToP = function eqXToP(x) {\n var zs = this.z.redSqr();\n var rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(zs);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\nJPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nJPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar utils = require('../utils');\n\nfunction MontCurve(conf) {\n Base.call(this, 'mont', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.i4 = new BN(4).toRed(this.red).redInvm();\n this.two = new BN(2).toRed(this.red);\n this.a24 = this.i4.redMul(this.a.redAdd(this.two));\n}\ninherits(MontCurve, Base);\nmodule.exports = MontCurve;\n\nMontCurve.prototype.validate = function validate(point) {\n var x = point.normalize().x;\n var x2 = x.redSqr();\n var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);\n var y = rhs.redSqrt();\n\n return y.redSqr().cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, z) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && z === null) {\n this.x = this.curve.one;\n this.z = this.curve.zero;\n } else {\n this.x = new BN(x, 16);\n this.z = new BN(z, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n }\n}\ninherits(Point, Base.BasePoint);\n\nMontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n};\n\nMontCurve.prototype.point = function point(x, z) {\n return new Point(this, x, z);\n};\n\nMontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nPoint.prototype.precompute = function precompute() {\n // No-op\n};\n\nPoint.prototype._encode = function _encode() {\n return this.getX().toArray('be', this.curve.p.byteLength());\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n\nPoint.prototype.dbl = function dbl() {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n // 2M + 2S + 4A\n\n // A = X1 + Z1\n var a = this.x.redAdd(this.z);\n // AA = A^2\n var aa = a.redSqr();\n // B = X1 - Z1\n var b = this.x.redSub(this.z);\n // BB = B^2\n var bb = b.redSqr();\n // C = AA - BB\n var c = aa.redSub(bb);\n // X3 = AA * BB\n var nx = aa.redMul(bb);\n // Z3 = C * (BB + A24 * C)\n var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.add = function add() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.diffAdd = function diffAdd(p, diff) {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3\n // 4M + 2S + 6A\n\n // A = X2 + Z2\n var a = this.x.redAdd(this.z);\n // B = X2 - Z2\n var b = this.x.redSub(this.z);\n // C = X3 + Z3\n var c = p.x.redAdd(p.z);\n // D = X3 - Z3\n var d = p.x.redSub(p.z);\n // DA = D * A\n var da = d.redMul(a);\n // CB = C * B\n var cb = c.redMul(b);\n // X5 = Z1 * (DA + CB)^2\n var nx = diff.z.redMul(da.redAdd(cb).redSqr());\n // Z5 = X1 * (DA - CB)^2\n var nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.mul = function mul(k) {\n var t = k.clone();\n var a = this; // (N / 2) * Q + Q\n var b = this.curve.point(null, null); // (N / 2) * Q\n var c = this; // Q\n\n for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))\n bits.push(t.andln(1));\n\n for (var i = bits.length - 1; i >= 0; i--) {\n if (bits[i] === 0) {\n // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q\n a = a.diffAdd(b, c);\n // N * Q = 2 * ((N / 2) * Q + Q))\n b = b.dbl();\n } else {\n // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)\n b = a.diffAdd(b, c);\n // N * Q + Q = 2 * ((N / 2) * Q + Q)\n a = a.dbl();\n }\n }\n return b;\n};\n\nPoint.prototype.mulAdd = function mulAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.jumlAdd = function jumlAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.eq = function eq(other) {\n return this.getX().cmp(other.getX()) === 0;\n};\n\nPoint.prototype.normalize = function normalize() {\n this.x = this.x.redMul(this.z.redInvm());\n this.z = this.curve.one;\n return this;\n};\n\nPoint.prototype.getX = function getX() {\n // Normalize coordinates\n this.normalize();\n\n return this.x.fromRed();\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction EdwardsCurve(conf) {\n // NOTE: Important as we are creating point in Base.call()\n this.twisted = (conf.a | 0) !== 1;\n this.mOneA = this.twisted && (conf.a | 0) === -1;\n this.extended = this.mOneA;\n\n Base.call(this, 'edwards', conf);\n\n this.a = new BN(conf.a, 16).umod(this.red.m);\n this.a = this.a.toRed(this.red);\n this.c = new BN(conf.c, 16).toRed(this.red);\n this.c2 = this.c.redSqr();\n this.d = new BN(conf.d, 16).toRed(this.red);\n this.dd = this.d.redAdd(this.d);\n\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);\n this.oneC = (conf.c | 0) === 1;\n}\ninherits(EdwardsCurve, Base);\nmodule.exports = EdwardsCurve;\n\nEdwardsCurve.prototype._mulA = function _mulA(num) {\n if (this.mOneA)\n return num.redNeg();\n else\n return this.a.redMul(num);\n};\n\nEdwardsCurve.prototype._mulC = function _mulC(num) {\n if (this.oneC)\n return num;\n else\n return this.c.redMul(num);\n};\n\n// Just for compatibility with Short curve\nEdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {\n return this.point(x, y, z, t);\n};\n\nEdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var x2 = x.redSqr();\n var rhs = this.c2.redSub(this.a.redMul(x2));\n var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));\n\n var y2 = rhs.redMul(lhs.redInvm());\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {\n y = new BN(y, 16);\n if (!y.red)\n y = y.toRed(this.red);\n\n // x^2 = (y^2 - c^2) / (c^2 d y^2 - a)\n var y2 = y.redSqr();\n var lhs = y2.redSub(this.c2);\n var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);\n var x2 = lhs.redMul(rhs.redInvm());\n\n if (x2.cmp(this.zero) === 0) {\n if (odd)\n throw new Error('invalid point');\n else\n return this.point(this.zero, y);\n }\n\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n if (x.fromRed().isOdd() !== odd)\n x = x.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.validate = function validate(point) {\n if (point.isInfinity())\n return true;\n\n // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)\n point.normalize();\n\n var x2 = point.x.redSqr();\n var y2 = point.y.redSqr();\n var lhs = x2.redMul(this.a).redAdd(y2);\n var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n\n return lhs.cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && y === null && z === null) {\n this.x = this.curve.zero;\n this.y = this.curve.one;\n this.z = this.curve.one;\n this.t = this.curve.zero;\n this.zOne = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = z ? new BN(z, 16) : this.curve.one;\n this.t = t && new BN(t, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n if (this.t && !this.t.red)\n this.t = this.t.toRed(this.curve.red);\n this.zOne = this.z === this.curve.one;\n\n // Use extended coordinates\n if (this.curve.extended && !this.t) {\n this.t = this.x.redMul(this.y);\n if (!this.zOne)\n this.t = this.t.redMul(this.z.redInvm());\n }\n }\n}\ninherits(Point, Base.BasePoint);\n\nEdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nEdwardsCurve.prototype.point = function point(x, y, z, t) {\n return new Point(this, x, y, z, t);\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.x.cmpn(0) === 0 &&\n (this.y.cmp(this.z) === 0 ||\n (this.zOne && this.y.cmp(this.curve.c) === 0));\n};\n\nPoint.prototype._extDbl = function _extDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #doubling-dbl-2008-hwcd\n // 4M + 4S\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = 2 * Z1^2\n var c = this.z.redSqr();\n c = c.redIAdd(c);\n // D = a * A\n var d = this.curve._mulA(a);\n // E = (X1 + Y1)^2 - A - B\n var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n // G = D + B\n var g = d.redAdd(b);\n // F = G - C\n var f = g.redSub(c);\n // H = D - B\n var h = d.redSub(b);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projDbl = function _projDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #doubling-dbl-2008-bbjlp\n // #doubling-dbl-2007-bl\n // and others\n // Generally 3M + 4S or 2M + 4S\n\n // B = (X1 + Y1)^2\n var b = this.x.redAdd(this.y).redSqr();\n // C = X1^2\n var c = this.x.redSqr();\n // D = Y1^2\n var d = this.y.redSqr();\n\n var nx;\n var ny;\n var nz;\n var e;\n var h;\n var j;\n if (this.curve.twisted) {\n // E = a * C\n e = this.curve._mulA(c);\n // F = E + D\n var f = e.redAdd(d);\n if (this.zOne) {\n // X3 = (B - C - D) * (F - 2)\n nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F^2 - 2 * F\n nz = f.redSqr().redSub(f).redSub(f);\n } else {\n // H = Z1^2\n h = this.z.redSqr();\n // J = F - 2 * H\n j = f.redSub(h).redISub(h);\n // X3 = (B-C-D)*J\n nx = b.redSub(c).redISub(d).redMul(j);\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F * J\n nz = f.redMul(j);\n }\n } else {\n // E = C + D\n e = c.redAdd(d);\n // H = (c * Z1)^2\n h = this.curve._mulC(this.z).redSqr();\n // J = E - 2 * H\n j = e.redSub(h).redSub(h);\n // X3 = c * (B - E) * J\n nx = this.curve._mulC(b.redISub(e)).redMul(j);\n // Y3 = c * E * (C - D)\n ny = this.curve._mulC(e).redMul(c.redISub(d));\n // Z3 = E * J\n nz = e.redMul(j);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n // Double in extended coordinates\n if (this.curve.extended)\n return this._extDbl();\n else\n return this._projDbl();\n};\n\nPoint.prototype._extAdd = function _extAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #addition-add-2008-hwcd-3\n // 8M\n\n // A = (Y1 - X1) * (Y2 - X2)\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n // B = (Y1 + X1) * (Y2 + X2)\n var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n // C = T1 * k * T2\n var c = this.t.redMul(this.curve.dd).redMul(p.t);\n // D = Z1 * 2 * Z2\n var d = this.z.redMul(p.z.redAdd(p.z));\n // E = B - A\n var e = b.redSub(a);\n // F = D - C\n var f = d.redSub(c);\n // G = D + C\n var g = d.redAdd(c);\n // H = B + A\n var h = b.redAdd(a);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projAdd = function _projAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #addition-add-2008-bbjlp\n // #addition-add-2007-bl\n // 10M + 1S\n\n // A = Z1 * Z2\n var a = this.z.redMul(p.z);\n // B = A^2\n var b = a.redSqr();\n // C = X1 * X2\n var c = this.x.redMul(p.x);\n // D = Y1 * Y2\n var d = this.y.redMul(p.y);\n // E = d * C * D\n var e = this.curve.d.redMul(c).redMul(d);\n // F = B - E\n var f = b.redSub(e);\n // G = B + E\n var g = b.redAdd(e);\n // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)\n var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);\n var nx = a.redMul(f).redMul(tmp);\n var ny;\n var nz;\n if (this.curve.twisted) {\n // Y3 = A * G * (D - a * C)\n ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));\n // Z3 = F * G\n nz = f.redMul(g);\n } else {\n // Y3 = A * G * (D - C)\n ny = a.redMul(g).redMul(d.redSub(c));\n // Z3 = c * F * G\n nz = this.curve._mulC(f).redMul(g);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.add = function add(p) {\n if (this.isInfinity())\n return p;\n if (p.isInfinity())\n return this;\n\n if (this.curve.extended)\n return this._extAdd(p);\n else\n return this._projAdd(p);\n};\n\nPoint.prototype.mul = function mul(k) {\n if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);\n};\n\nPoint.prototype.normalize = function normalize() {\n if (this.zOne)\n return this;\n\n // Normalize coordinates\n var zi = this.z.redInvm();\n this.x = this.x.redMul(zi);\n this.y = this.y.redMul(zi);\n if (this.t)\n this.t = this.t.redMul(zi);\n this.z = this.curve.one;\n this.zOne = true;\n return this;\n};\n\nPoint.prototype.neg = function neg() {\n return this.curve.point(this.x.redNeg(),\n this.y,\n this.z,\n this.t && this.t.redNeg());\n};\n\nPoint.prototype.getX = function getX() {\n this.normalize();\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n this.normalize();\n return this.y.fromRed();\n};\n\nPoint.prototype.eq = function eq(other) {\n return this === other ||\n this.getX().cmp(other.getX()) === 0 &&\n this.getY().cmp(other.getY()) === 0;\n};\n\nPoint.prototype.eqXToP = function eqXToP(x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(this.z);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\n// Compatibility with BaseCurve\nPoint.prototype.toP = Point.prototype.normalize;\nPoint.prototype.mixedAdd = Point.prototype.add;\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n 0x5A827999, 0x6ED9EBA1,\n 0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n if (!(this instanceof SHA1))\n return new SHA1();\n\n BlockHash.call(this);\n this.h = [\n 0x67452301, 0xefcdab89, 0x98badcfe,\n 0x10325476, 0xc3d2e1f0 ];\n this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n\n for(; i < W.length; i++)\n W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20);\n var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n e = d;\n d = c;\n c = rotl32(b, 30);\n b = a;\n a = t;\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n};\n\nSHA1.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0)\n return ch32(x, y, z);\n if (s === 1 || s === 3)\n return p32(x, y, z);\n if (s === 2)\n return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n if (!(this instanceof SHA224))\n return new SHA224();\n\n SHA256.call(this);\n this.h = [\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n // Just truncate output\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 7), 'big');\n else\n return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n if (!(this instanceof SHA384))\n return new SHA384();\n\n SHA512.call(this);\n this.h = [\n 0xcbbb9d5d, 0xc1059ed8,\n 0x629a292a, 0x367cd507,\n 0x9159015a, 0x3070dd17,\n 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31,\n 0x8eb44a87, 0x68581511,\n 0xdb0c2e0d, 0x64f98fa7,\n 0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 12), 'big');\n else\n return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n if (!(this instanceof Hmac))\n return new Hmac(hash, key, enc);\n this.Hash = hash;\n this.blockSize = hash.blockSize / 8;\n this.outSize = hash.outSize / 8;\n this.inner = null;\n this.outer = null;\n\n this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n // Shorten key, if needed\n if (key.length > this.blockSize)\n key = new this.Hash().update(key).digest();\n assert(key.length <= this.blockSize);\n\n // Add padding to key\n for (var i = key.length; i < this.blockSize; i++)\n key.push(0);\n\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x36;\n this.inner = new this.Hash().update(key);\n\n // 0x36 ^ 0x5c = 0x6a\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x6a;\n this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n this.inner.update(msg, enc);\n return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n this.outer.update(this.inner.digest());\n return this.outer.digest(enc);\n};\n","module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',\n 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821',\n ],\n [\n '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',\n '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf',\n ],\n [\n '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',\n 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695',\n ],\n [\n '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',\n '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9',\n ],\n [\n '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',\n '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36',\n ],\n [\n '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',\n '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f',\n ],\n [\n 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',\n '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999',\n ],\n [\n '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',\n 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09',\n ],\n [\n 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',\n '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d',\n ],\n [\n 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',\n 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088',\n ],\n [\n 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',\n '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d',\n ],\n [\n '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',\n '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8',\n ],\n [\n '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',\n '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a',\n ],\n [\n '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',\n '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453',\n ],\n [\n '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',\n '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160',\n ],\n [\n '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',\n '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0',\n ],\n [\n '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',\n '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6',\n ],\n [\n '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',\n '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589',\n ],\n [\n '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',\n 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17',\n ],\n [\n 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',\n '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda',\n ],\n [\n 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',\n '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd',\n ],\n [\n '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',\n '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2',\n ],\n [\n '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',\n '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6',\n ],\n [\n 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',\n '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f',\n ],\n [\n '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',\n 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01',\n ],\n [\n 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',\n '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3',\n ],\n [\n 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',\n 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f',\n ],\n [\n 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',\n '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7',\n ],\n [\n 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',\n 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78',\n ],\n [\n 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',\n '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1',\n ],\n [\n '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',\n 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150',\n ],\n [\n '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',\n '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82',\n ],\n [\n 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',\n '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc',\n ],\n [\n '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',\n 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b',\n ],\n [\n 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',\n '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51',\n ],\n [\n 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',\n '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45',\n ],\n [\n 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',\n 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120',\n ],\n [\n '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',\n '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84',\n ],\n [\n '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',\n '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d',\n ],\n [\n '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',\n 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d',\n ],\n [\n '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',\n '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8',\n ],\n [\n 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',\n '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8',\n ],\n [\n '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',\n '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac',\n ],\n [\n '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',\n 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f',\n ],\n [\n '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',\n '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962',\n ],\n [\n 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',\n '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907',\n ],\n [\n '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',\n 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec',\n ],\n [\n 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',\n 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d',\n ],\n [\n 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',\n '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414',\n ],\n [\n '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',\n 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd',\n ],\n [\n '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',\n 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0',\n ],\n [\n 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',\n '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811',\n ],\n [\n 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',\n '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1',\n ],\n [\n 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',\n '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c',\n ],\n [\n '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',\n 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73',\n ],\n [\n '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',\n '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd',\n ],\n [\n 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',\n 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405',\n ],\n [\n '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',\n 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589',\n ],\n [\n '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',\n '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e',\n ],\n [\n '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',\n '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27',\n ],\n [\n 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',\n 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1',\n ],\n [\n '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',\n '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482',\n ],\n [\n '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',\n '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945',\n ],\n [\n 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',\n '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573',\n ],\n [\n 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',\n 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82',\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',\n '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672',\n ],\n [\n '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',\n 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6',\n ],\n [\n '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',\n '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da',\n ],\n [\n 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',\n 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37',\n ],\n [\n '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',\n 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b',\n ],\n [\n 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',\n 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81',\n ],\n [\n 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',\n '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58',\n ],\n [\n 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',\n '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77',\n ],\n [\n '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',\n '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a',\n ],\n [\n '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',\n '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c',\n ],\n [\n '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',\n '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67',\n ],\n [\n '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',\n '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402',\n ],\n [\n 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',\n 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55',\n ],\n [\n 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',\n '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482',\n ],\n [\n '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',\n 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82',\n ],\n [\n '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',\n 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396',\n ],\n [\n '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',\n '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49',\n ],\n [\n '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',\n '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf',\n ],\n [\n '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',\n '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a',\n ],\n [\n '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',\n 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7',\n ],\n [\n 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',\n 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933',\n ],\n [\n '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',\n '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a',\n ],\n [\n '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',\n '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6',\n ],\n [\n 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',\n 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37',\n ],\n [\n '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',\n '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e',\n ],\n [\n 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',\n 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6',\n ],\n [\n 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',\n 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476',\n ],\n [\n '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',\n '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40',\n ],\n [\n '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',\n '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61',\n ],\n [\n '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',\n '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683',\n ],\n [\n 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',\n '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5',\n ],\n [\n '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',\n '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b',\n ],\n [\n 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',\n '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417',\n ],\n [\n '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',\n 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868',\n ],\n [\n '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',\n 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a',\n ],\n [\n 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',\n 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6',\n ],\n [\n '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',\n '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996',\n ],\n [\n '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',\n 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e',\n ],\n [\n 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',\n 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d',\n ],\n [\n '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',\n '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2',\n ],\n [\n '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',\n 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e',\n ],\n [\n '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',\n '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437',\n ],\n [\n '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',\n 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311',\n ],\n [\n 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',\n '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4',\n ],\n [\n '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',\n '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575',\n ],\n [\n '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',\n 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d',\n ],\n [\n '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',\n 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d',\n ],\n [\n 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',\n 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629',\n ],\n [\n 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',\n 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06',\n ],\n [\n '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',\n '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374',\n ],\n [\n '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',\n '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee',\n ],\n [\n 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',\n '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1',\n ],\n [\n 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',\n 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b',\n ],\n [\n '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',\n '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661',\n ],\n [\n '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',\n '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6',\n ],\n [\n 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',\n '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e',\n ],\n [\n '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',\n '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d',\n ],\n [\n 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',\n 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc',\n ],\n [\n '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',\n 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4',\n ],\n [\n '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',\n '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c',\n ],\n [\n 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',\n '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b',\n ],\n [\n 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',\n '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913',\n ],\n [\n '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',\n '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154',\n ],\n [\n '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',\n '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865',\n ],\n [\n '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',\n 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc',\n ],\n [\n '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',\n 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224',\n ],\n [\n '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',\n '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e',\n ],\n [\n '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',\n '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6',\n ],\n [\n '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',\n '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511',\n ],\n [\n '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',\n 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b',\n ],\n [\n 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',\n 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2',\n ],\n [\n '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',\n 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c',\n ],\n [\n 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',\n '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3',\n ],\n [\n 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',\n '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d',\n ],\n [\n 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',\n '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700',\n ],\n [\n 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',\n '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4',\n ],\n [\n '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',\n 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196',\n ],\n [\n '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',\n '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4',\n ],\n [\n '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',\n 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257',\n ],\n [\n 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',\n 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13',\n ],\n [\n 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',\n '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096',\n ],\n [\n 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',\n 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38',\n ],\n [\n 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',\n '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f',\n ],\n [\n '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',\n '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448',\n ],\n [\n 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',\n '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a',\n ],\n [\n 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',\n '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4',\n ],\n [\n '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',\n '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437',\n ],\n [\n '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',\n 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7',\n ],\n [\n 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',\n '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d',\n ],\n [\n 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',\n '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a',\n ],\n [\n 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',\n '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54',\n ],\n [\n '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',\n '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77',\n ],\n [\n 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',\n 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517',\n ],\n [\n '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',\n 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10',\n ],\n [\n 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',\n 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125',\n ],\n [\n 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',\n '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e',\n ],\n [\n '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',\n 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1',\n ],\n [\n 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',\n '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2',\n ],\n [\n 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',\n '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423',\n ],\n [\n 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',\n '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8',\n ],\n [\n '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',\n 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758',\n ],\n [\n '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',\n 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375',\n ],\n [\n 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',\n '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d',\n ],\n [\n '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',\n 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec',\n ],\n [\n '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',\n '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0',\n ],\n [\n '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',\n 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c',\n ],\n [\n 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',\n 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4',\n ],\n [\n '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',\n 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f',\n ],\n [\n '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',\n '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649',\n ],\n [\n '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',\n 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826',\n ],\n [\n '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',\n '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5',\n ],\n [\n 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',\n 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87',\n ],\n [\n '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',\n '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b',\n ],\n [\n 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',\n '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc',\n ],\n [\n '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',\n '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c',\n ],\n [\n 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',\n 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f',\n ],\n [\n 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',\n '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a',\n ],\n [\n 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',\n 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46',\n ],\n [\n '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',\n 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f',\n ],\n [\n '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',\n '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03',\n ],\n [\n '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',\n 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08',\n ],\n [\n '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',\n '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8',\n ],\n [\n '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',\n '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373',\n ],\n [\n '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',\n 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3',\n ],\n [\n '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',\n '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8',\n ],\n [\n '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',\n '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1',\n ],\n [\n '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',\n '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9',\n ],\n ],\n },\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n if (!(this instanceof EC))\n return new EC(options);\n\n // Shortcut `elliptic.ec(curve-name)`\n if (typeof options === 'string') {\n assert(Object.prototype.hasOwnProperty.call(curves, options),\n 'Unknown curve ' + options);\n\n options = curves[options];\n }\n\n // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n if (options instanceof curves.PresetCurve)\n options = { curve: options };\n\n this.curve = options.curve.curve;\n this.n = this.curve.n;\n this.nh = this.n.ushrn(1);\n this.g = this.curve.g;\n\n // Point on curve\n this.g = options.curve.g;\n this.g.precompute(options.curve.n.bitLength() + 1);\n\n // Hash for function for DRBG\n this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n if (!options)\n options = {};\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n nonce: this.n.toArray(),\n });\n\n var bytes = this.n.byteLength();\n var ns2 = this.n.sub(new BN(2));\n for (;;) {\n var priv = new BN(drbg.generate(bytes));\n if (priv.cmp(ns2) > 0)\n continue;\n\n priv.iaddn(1);\n return this.keyFromPrivate(priv);\n }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n if (delta > 0)\n msg = msg.ushrn(delta);\n if (!truncOnly && msg.cmp(this.n) >= 0)\n return msg.sub(this.n);\n else\n return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n if (typeof enc === 'object') {\n options = enc;\n enc = null;\n }\n if (!options)\n options = {};\n\n key = this.keyFromPrivate(key, enc);\n msg = this._truncateToN(new BN(msg, 16));\n\n // Zero-extend key to provide enough entropy\n var bytes = this.n.byteLength();\n var bkey = key.getPrivate().toArray('be', bytes);\n\n // Zero-extend nonce to have the same byte size as N\n var nonce = msg.toArray('be', bytes);\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce: nonce,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n });\n\n // Number of bytes to generate\n var ns1 = this.n.sub(new BN(1));\n\n for (var iter = 0; ; iter++) {\n var k = options.k ?\n options.k(iter) :\n new BN(drbg.generate(this.n.byteLength()));\n k = this._truncateToN(k, true);\n if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n continue;\n\n var kp = this.g.mul(k);\n if (kp.isInfinity())\n continue;\n\n var kpX = kp.getX();\n var r = kpX.umod(this.n);\n if (r.cmpn(0) === 0)\n continue;\n\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n s = s.umod(this.n);\n if (s.cmpn(0) === 0)\n continue;\n\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n (kpX.cmp(r) !== 0 ? 2 : 0);\n\n // Use complement of `s`, if it is > `n / 2`\n if (options.canonical && s.cmp(this.nh) > 0) {\n s = this.n.sub(s);\n recoveryParam ^= 1;\n }\n\n return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc) {\n msg = this._truncateToN(new BN(msg, 16));\n key = this.keyFromPublic(key, enc);\n signature = new Signature(signature, 'hex');\n\n // Perform primitive values validation\n var r = signature.r;\n var s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n return false;\n if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n return false;\n\n // Validate signature\n var sinv = s.invm(this.n);\n var u1 = sinv.mul(msg).umod(this.n);\n var u2 = sinv.mul(r).umod(this.n);\n var p;\n\n if (!this.curve._maxwellTrick) {\n p = this.g.mulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n return p.getX().umod(this.n).cmp(r) === 0;\n }\n\n // NOTE: Greg Maxwell's trick, inspired by:\n // https://git.io/vad3K\n\n p = this.g.jmulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n // Compare `p.x` of Jacobian point with `r`,\n // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n // inverse of `p.z^2`\n return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n assert((3 & j) === j, 'The recovery param is more than two bits');\n signature = new Signature(signature, enc);\n\n var n = this.n;\n var e = new BN(msg);\n var r = signature.r;\n var s = signature.s;\n\n // A set LSB signifies that the y-coordinate is odd\n var isYOdd = j & 1;\n var isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error('Unable to find sencond key candinate');\n\n // 1.1. Let x = r + jn.\n if (isSecondKey)\n r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n else\n r = this.curve.pointFromX(r, isYOdd);\n\n var rInv = signature.r.invm(n);\n var s1 = n.sub(e).mul(rInv).umod(n);\n var s2 = s.mul(rInv).umod(n);\n\n // 1.6.1 Compute Q = r^-1 (sR - eG)\n // Q = r^-1 (sR + -eG)\n return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n signature = new Signature(signature, enc);\n if (signature.recoveryParam !== null)\n return signature.recoveryParam;\n\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch (e) {\n continue;\n }\n\n if (Qprime.eq(Q))\n return i;\n }\n throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar utils = require('minimalistic-crypto-utils');\nvar assert = require('minimalistic-assert');\n\nfunction HmacDRBG(options) {\n if (!(this instanceof HmacDRBG))\n return new HmacDRBG(options);\n this.hash = options.hash;\n this.predResist = !!options.predResist;\n\n this.outLen = this.hash.outSize;\n this.minEntropy = options.minEntropy || this.hash.hmacStrength;\n\n this._reseed = null;\n this.reseedInterval = null;\n this.K = null;\n this.V = null;\n\n var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex');\n var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex');\n var pers = utils.toArray(options.pers, options.persEnc || 'hex');\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n this._init(entropy, nonce, pers);\n}\nmodule.exports = HmacDRBG;\n\nHmacDRBG.prototype._init = function init(entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n\n this.K = new Array(this.outLen / 8);\n this.V = new Array(this.outLen / 8);\n for (var i = 0; i < this.V.length; i++) {\n this.K[i] = 0x00;\n this.V[i] = 0x01;\n }\n\n this._update(seed);\n this._reseed = 1;\n this.reseedInterval = 0x1000000000000; // 2^48\n};\n\nHmacDRBG.prototype._hmac = function hmac() {\n return new hash.hmac(this.hash, this.K);\n};\n\nHmacDRBG.prototype._update = function update(seed) {\n var kmac = this._hmac()\n .update(this.V)\n .update([ 0x00 ]);\n if (seed)\n kmac = kmac.update(seed);\n this.K = kmac.digest();\n this.V = this._hmac().update(this.V).digest();\n if (!seed)\n return;\n\n this.K = this._hmac()\n .update(this.V)\n .update([ 0x01 ])\n .update(seed)\n .digest();\n this.V = this._hmac().update(this.V).digest();\n};\n\nHmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {\n // Optional entropy enc\n if (typeof entropyEnc !== 'string') {\n addEnc = add;\n add = entropyEnc;\n entropyEnc = null;\n }\n\n entropy = utils.toArray(entropy, entropyEnc);\n add = utils.toArray(add, addEnc);\n\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n\n this._update(entropy.concat(add || []));\n this._reseed = 1;\n};\n\nHmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval)\n throw new Error('Reseed is required');\n\n // Optional encoding\n if (typeof enc !== 'string') {\n addEnc = add;\n add = enc;\n enc = null;\n }\n\n // Optional additional data\n if (add) {\n add = utils.toArray(add, addEnc || 'hex');\n this._update(add);\n }\n\n var temp = [];\n while (temp.length < len) {\n this.V = this._hmac().update(this.V).digest();\n temp = temp.concat(this.V);\n }\n\n var res = temp.slice(0, len);\n this._update(add);\n this._reseed++;\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction KeyPair(ec, options) {\n this.ec = ec;\n this.priv = null;\n this.pub = null;\n\n // KeyPair(ec, { priv: ..., pub: ... })\n if (options.priv)\n this._importPrivate(options.priv, options.privEnc);\n if (options.pub)\n this._importPublic(options.pub, options.pubEnc);\n}\nmodule.exports = KeyPair;\n\nKeyPair.fromPublic = function fromPublic(ec, pub, enc) {\n if (pub instanceof KeyPair)\n return pub;\n\n return new KeyPair(ec, {\n pub: pub,\n pubEnc: enc,\n });\n};\n\nKeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {\n if (priv instanceof KeyPair)\n return priv;\n\n return new KeyPair(ec, {\n priv: priv,\n privEnc: enc,\n });\n};\n\nKeyPair.prototype.validate = function validate() {\n var pub = this.getPublic();\n\n if (pub.isInfinity())\n return { result: false, reason: 'Invalid public key' };\n if (!pub.validate())\n return { result: false, reason: 'Public key is not a point' };\n if (!pub.mul(this.ec.curve.n).isInfinity())\n return { result: false, reason: 'Public key * N != O' };\n\n return { result: true, reason: null };\n};\n\nKeyPair.prototype.getPublic = function getPublic(compact, enc) {\n // compact is optional argument\n if (typeof compact === 'string') {\n enc = compact;\n compact = null;\n }\n\n if (!this.pub)\n this.pub = this.ec.g.mul(this.priv);\n\n if (!enc)\n return this.pub;\n\n return this.pub.encode(enc, compact);\n};\n\nKeyPair.prototype.getPrivate = function getPrivate(enc) {\n if (enc === 'hex')\n return this.priv.toString(16, 2);\n else\n return this.priv;\n};\n\nKeyPair.prototype._importPrivate = function _importPrivate(key, enc) {\n this.priv = new BN(key, enc || 16);\n\n // Ensure that the priv won't be bigger than n, otherwise we may fail\n // in fixed multiplication method\n this.priv = this.priv.umod(this.ec.curve.n);\n};\n\nKeyPair.prototype._importPublic = function _importPublic(key, enc) {\n if (key.x || key.y) {\n // Montgomery points only have an `x` coordinate.\n // Weierstrass/Edwards points on the other hand have both `x` and\n // `y` coordinates.\n if (this.ec.curve.type === 'mont') {\n assert(key.x, 'Need x coordinate');\n } else if (this.ec.curve.type === 'short' ||\n this.ec.curve.type === 'edwards') {\n assert(key.x && key.y, 'Need both x and y coordinate');\n }\n this.pub = this.ec.curve.point(key.x, key.y);\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n};\n\n// ECDH\nKeyPair.prototype.derive = function derive(pub) {\n if(!pub.validate()) {\n assert(pub.validate(), 'public point not validated');\n }\n return pub.mul(this.priv).getX();\n};\n\n// ECDSA\nKeyPair.prototype.sign = function sign(msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n};\n\nKeyPair.prototype.verify = function verify(msg, signature) {\n return this.ec.verify(msg, signature, this);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n return '';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n if (options instanceof Signature)\n return options;\n\n if (this._importDER(options, enc))\n return;\n\n assert(options.r && options.s, 'Signature without r or s');\n this.r = new BN(options.r, 16);\n this.s = new BN(options.s, 16);\n if (options.recoveryParam === undefined)\n this.recoveryParam = null;\n else\n this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n this.place = 0;\n}\n\nfunction getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 0x80)) {\n return initial;\n }\n var octetLen = initial & 0xf;\n\n // Indefinite length or overflow\n if (octetLen === 0 || octetLen > 4) {\n return false;\n }\n\n var val = 0;\n for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n val <<= 8;\n val |= buf[off];\n val >>>= 0;\n }\n\n // Leading zeroes\n if (val <= 0x7f) {\n return false;\n }\n\n p.place = off;\n return val;\n}\n\nfunction rmPadding(buf) {\n var i = 0;\n var len = buf.length - 1;\n while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n i++;\n }\n if (i === 0) {\n return buf;\n }\n return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 0x30) {\n return false;\n }\n var len = getLength(data, p);\n if (len === false) {\n return false;\n }\n if ((len + p.place) !== data.length) {\n return false;\n }\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var rlen = getLength(data, p);\n if (rlen === false) {\n return false;\n }\n var r = data.slice(p.place, rlen + p.place);\n p.place += rlen;\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var slen = getLength(data, p);\n if (slen === false) {\n return false;\n }\n if (data.length !== slen + p.place) {\n return false;\n }\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0) {\n if (r[1] & 0x80) {\n r = r.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n if (s[0] === 0) {\n if (s[1] & 0x80) {\n s = s.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n\n this.r = new BN(r);\n this.s = new BN(s);\n this.recoveryParam = null;\n\n return true;\n};\n\nfunction constructLength(arr, len) {\n if (len < 0x80) {\n arr.push(len);\n return;\n }\n var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n arr.push(octets | 0x80);\n while (--octets) {\n arr.push((len >>> (octets << 3)) & 0xff);\n }\n arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n var r = this.r.toArray();\n var s = this.s.toArray();\n\n // Pad values\n if (r[0] & 0x80)\n r = [ 0 ].concat(r);\n // Pad values\n if (s[0] & 0x80)\n s = [ 0 ].concat(s);\n\n r = rmPadding(r);\n s = rmPadding(s);\n\n while (!s[0] && !(s[1] & 0x80)) {\n s = s.slice(1);\n }\n var arr = [ 0x02 ];\n constructLength(arr, r.length);\n arr = arr.concat(r);\n arr.push(0x02);\n constructLength(arr, s.length);\n var backHalf = arr.concat(s);\n var res = [ 0x30 ];\n constructLength(res, backHalf.length);\n res = res.concat(backHalf);\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n if (!(this instanceof EDDSA))\n return new EDDSA(curve);\n\n curve = curves[curve].curve;\n this.curve = curve;\n this.g = curve.g;\n this.g.precompute(curve.n.bitLength() + 1);\n\n this.pointClass = curve.point().constructor;\n this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret);\n var r = this.hashInt(key.messagePrefix(), message);\n var R = this.g.mul(r);\n var Rencoded = this.encodePoint(R);\n var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n .mul(key.priv());\n var S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n message = parseBytes(message);\n sig = this.makeSignature(sig);\n var key = this.keyFromPublic(pub);\n var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n var SG = this.g.mul(sig.S());\n var RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n var hash = this.hash();\n for (var i = 0; i < arguments.length; i++)\n hash.update(arguments[i]);\n return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n if (sig instanceof Signature)\n return sig;\n return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n var enc = point.getY().toArray('le', this.encodingLength);\n enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n bytes = utils.parseBytes(bytes);\n\n var lastIx = bytes.length - 1;\n var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n var y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n this.eddsa = eddsa;\n this._secret = parseBytes(params.secret);\n if (eddsa.isPoint(params.pub))\n this._pub = params.pub;\n else\n this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n if (pub instanceof KeyPair)\n return pub;\n return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n if (secret instanceof KeyPair)\n return secret;\n return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n if (this._pubBytes)\n return this.eddsa.decodePoint(this._pubBytes);\n return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n var eddsa = this.eddsa;\n var hash = this.hash();\n var lastIx = eddsa.encodingLength - 1;\n\n var a = hash.slice(0, eddsa.encodingLength);\n a[0] &= 248;\n a[lastIx] &= 127;\n a[lastIx] |= 64;\n\n return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n assert(this._secret, 'KeyPair can only verify');\n return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n assert(this._secret, 'KeyPair is public only');\n return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array|Object} sig -\n* @param {Array|Point} [sig.R] - R point as Point or bytes\n* @param {Array|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array} [sig.Rencoded] - R point encoded\n* @param {Array} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n this.eddsa = eddsa;\n\n if (typeof sig !== 'object')\n sig = parseBytes(sig);\n\n if (Array.isArray(sig)) {\n sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n };\n }\n\n assert(sig.R && sig.S, 'Signature without R or S');\n\n if (eddsa.isPoint(sig.R))\n this._R = sig.R;\n if (sig.S instanceof BN)\n this._S = sig.S;\n\n this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","var Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar sync = require('./sync')\nvar toBuffer = require('./to-buffer')\n\nvar ZERO_BUF\nvar subtle = global.crypto && global.crypto.subtle\nvar toBrowser = {\n sha: 'SHA-1',\n 'sha-1': 'SHA-1',\n sha1: 'SHA-1',\n sha256: 'SHA-256',\n 'sha-256': 'SHA-256',\n sha384: 'SHA-384',\n 'sha-384': 'SHA-384',\n 'sha-512': 'SHA-512',\n sha512: 'SHA-512'\n}\nvar checks = []\nfunction checkNative (algo) {\n if (global.process && !global.process.browser) {\n return Promise.resolve(false)\n }\n if (!subtle || !subtle.importKey || !subtle.deriveBits) {\n return Promise.resolve(false)\n }\n if (checks[algo] !== undefined) {\n return checks[algo]\n }\n ZERO_BUF = ZERO_BUF || Buffer.alloc(8)\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return true\n }).catch(function () {\n return false\n })\n checks[algo] = prom\n return prom\n}\nvar nextTick\nfunction getNextTick () {\n if (nextTick) {\n return nextTick\n }\n if (global.process && global.process.nextTick) {\n nextTick = global.process.nextTick\n } else if (global.queueMicrotask) {\n nextTick = global.queueMicrotask\n } else if (global.setImmediate) {\n nextTick = global.setImmediate\n } else {\n nextTick = global.setTimeout\n }\n return nextTick\n}\nfunction browserPbkdf2 (password, salt, iterations, length, algo) {\n return subtle.importKey(\n 'raw', password, { name: 'PBKDF2' }, false, ['deriveBits']\n ).then(function (key) {\n return subtle.deriveBits({\n name: 'PBKDF2',\n salt: salt,\n iterations: iterations,\n hash: {\n name: algo\n }\n }, key, length << 3)\n }).then(function (res) {\n return Buffer.from(res)\n })\n}\n\nfunction resolvePromise (promise, callback) {\n promise.then(function (out) {\n getNextTick()(function () {\n callback(null, out)\n })\n }, function (e) {\n getNextTick()(function () {\n callback(e)\n })\n })\n}\nmodule.exports = function (password, salt, iterations, keylen, digest, callback) {\n if (typeof digest === 'function') {\n callback = digest\n digest = undefined\n }\n\n digest = digest || 'sha1'\n var algo = toBrowser[digest.toLowerCase()]\n\n if (!algo || typeof global.Promise !== 'function') {\n getNextTick()(function () {\n var out\n try {\n out = sync(password, salt, iterations, keylen, digest)\n } catch (e) {\n return callback(e)\n }\n callback(null, out)\n })\n return\n }\n\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')\n\n resolvePromise(checkNative(algo).then(function (resp) {\n if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo)\n\n return sync(password, salt, iterations, keylen, digest)\n }), callback)\n}\n","module.exports = require('crypto').randomBytes\n","var assert = require('assert')\nvar Buffer = require('safe-buffer').Buffer\nvar crypto = require('crypto')\nvar bs58check = require('bs58check')\nvar secp256k1 = require('secp256k1')\n\nvar MASTER_SECRET = Buffer.from('Bitcoin seed', 'utf8')\nvar HARDENED_OFFSET = 0x80000000\nvar LEN = 78\n\n// Bitcoin hardcoded by default, can use package `coininfo` for others\nvar BITCOIN_VERSIONS = {private: 0x0488ADE4, public: 0x0488B21E}\n\nfunction HDKey (versions) {\n this.versions = versions || BITCOIN_VERSIONS\n this.depth = 0\n this.index = 0\n this._privateKey = null\n this._publicKey = null\n this.chainCode = null\n this._fingerprint = 0\n this.parentFingerprint = 0\n}\n\nObject.defineProperty(HDKey.prototype, 'fingerprint', { get: function () { return this._fingerprint } })\nObject.defineProperty(HDKey.prototype, 'identifier', { get: function () { return this._identifier } })\nObject.defineProperty(HDKey.prototype, 'pubKeyHash', { get: function () { return this.identifier } })\n\nObject.defineProperty(HDKey.prototype, 'privateKey', {\n get: function () {\n return this._privateKey\n },\n set: function (value) {\n assert.equal(value.length, 32, 'Private key must be 32 bytes.')\n assert(secp256k1.privateKeyVerify(value) === true, 'Invalid private key')\n\n this._privateKey = value\n this._publicKey = secp256k1.publicKeyCreate(value, true)\n this._identifier = hash160(this.publicKey)\n this._fingerprint = this._identifier.slice(0, 4).readUInt32BE(0)\n }\n})\n\nObject.defineProperty(HDKey.prototype, 'publicKey', {\n get: function () {\n return this._publicKey\n },\n set: function (value) {\n assert(value.length === 33 || value.length === 65, 'Public key must be 33 or 65 bytes.')\n assert(secp256k1.publicKeyVerify(value) === true, 'Invalid public key')\n\n this._publicKey = secp256k1.publicKeyConvert(value, true) // force compressed point\n this._identifier = hash160(this.publicKey)\n this._fingerprint = this._identifier.slice(0, 4).readUInt32BE(0)\n this._privateKey = null\n }\n})\n\nObject.defineProperty(HDKey.prototype, 'privateExtendedKey', {\n get: function () {\n if (this._privateKey) return bs58check.encode(serialize(this, this.versions.private, Buffer.concat([Buffer.alloc(1, 0), this.privateKey])))\n else return null\n }\n})\n\nObject.defineProperty(HDKey.prototype, 'publicExtendedKey', {\n get: function () {\n return bs58check.encode(serialize(this, this.versions.public, this.publicKey))\n }\n})\n\nHDKey.prototype.derive = function (path) {\n if (path === 'm' || path === 'M' || path === \"m'\" || path === \"M'\") {\n return this\n }\n\n var entries = path.split('/')\n var hdkey = this\n entries.forEach(function (c, i) {\n if (i === 0) {\n assert(/^[mM]{1}/.test(c), 'Path must start with \"m\" or \"M\"')\n return\n }\n\n var hardened = (c.length > 1) && (c[c.length - 1] === \"'\")\n var childIndex = parseInt(c, 10) // & (HARDENED_OFFSET - 1)\n assert(childIndex < HARDENED_OFFSET, 'Invalid index')\n if (hardened) childIndex += HARDENED_OFFSET\n\n hdkey = hdkey.deriveChild(childIndex)\n })\n\n return hdkey\n}\n\nHDKey.prototype.deriveChild = function (index) {\n var isHardened = index >= HARDENED_OFFSET\n var indexBuffer = Buffer.allocUnsafe(4)\n indexBuffer.writeUInt32BE(index, 0)\n\n var data\n\n if (isHardened) { // Hardened child\n assert(this.privateKey, 'Could not derive hardened child key')\n\n var pk = this.privateKey\n var zb = Buffer.alloc(1, 0)\n pk = Buffer.concat([zb, pk])\n\n // data = 0x00 || ser256(kpar) || ser32(index)\n data = Buffer.concat([pk, indexBuffer])\n } else { // Normal child\n // data = serP(point(kpar)) || ser32(index)\n // = serP(Kpar) || ser32(index)\n data = Buffer.concat([this.publicKey, indexBuffer])\n }\n\n var I = crypto.createHmac('sha512', this.chainCode).update(data).digest()\n var IL = I.slice(0, 32)\n var IR = I.slice(32)\n\n var hd = new HDKey(this.versions)\n\n // Private parent key -> private child key\n if (this.privateKey) {\n // ki = parse256(IL) + kpar (mod n)\n try {\n hd.privateKey = secp256k1.privateKeyTweakAdd(this.privateKey, IL)\n // throw if IL >= n || (privateKey + IL) === 0\n } catch (err) {\n // In case parse256(IL) >= n or ki == 0, one should proceed with the next value for i\n return this.deriveChild(index + 1)\n }\n // Public parent key -> public child key\n } else {\n // Ki = point(parse256(IL)) + Kpar\n // = G*IL + Kpar\n try {\n hd.publicKey = secp256k1.publicKeyTweakAdd(this.publicKey, IL, true)\n // throw if IL >= n || (g**IL + publicKey) is infinity\n } catch (err) {\n // In case parse256(IL) >= n or Ki is the point at infinity, one should proceed with the next value for i\n return this.deriveChild(index + 1)\n }\n }\n\n hd.chainCode = IR\n hd.depth = this.depth + 1\n hd.parentFingerprint = this.fingerprint// .readUInt32BE(0)\n hd.index = index\n\n return hd\n}\n\nHDKey.prototype.sign = function (hash) {\n return secp256k1.sign(hash, this.privateKey).signature\n}\n\nHDKey.prototype.verify = function (hash, signature) {\n return secp256k1.verify(hash, signature, this.publicKey)\n}\n\nHDKey.prototype.wipePrivateData = function () {\n if (this._privateKey) crypto.randomBytes(this._privateKey.length).copy(this._privateKey)\n this._privateKey = null\n return this\n}\n\nHDKey.prototype.toJSON = function () {\n return {\n xpriv: this.privateExtendedKey,\n xpub: this.publicExtendedKey\n }\n}\n\nHDKey.fromMasterSeed = function (seedBuffer, versions) {\n var I = crypto.createHmac('sha512', MASTER_SECRET).update(seedBuffer).digest()\n var IL = I.slice(0, 32)\n var IR = I.slice(32)\n\n var hdkey = new HDKey(versions)\n hdkey.chainCode = IR\n hdkey.privateKey = IL\n\n return hdkey\n}\n\nHDKey.fromExtendedKey = function (base58key, versions) {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n versions = versions || BITCOIN_VERSIONS\n var hdkey = new HDKey(versions)\n\n var keyBuffer = bs58check.decode(base58key)\n\n var version = keyBuffer.readUInt32BE(0)\n assert(version === versions.private || version === versions.public, 'Version mismatch: does not match private or public')\n\n hdkey.depth = keyBuffer.readUInt8(4)\n hdkey.parentFingerprint = keyBuffer.readUInt32BE(5)\n hdkey.index = keyBuffer.readUInt32BE(9)\n hdkey.chainCode = keyBuffer.slice(13, 45)\n\n var key = keyBuffer.slice(45)\n if (key.readUInt8(0) === 0) { // private\n assert(version === versions.private, 'Version mismatch: version does not match private')\n hdkey.privateKey = key.slice(1) // cut off first 0x0 byte\n } else {\n assert(version === versions.public, 'Version mismatch: version does not match public')\n hdkey.publicKey = key\n }\n\n return hdkey\n}\n\nHDKey.fromJSON = function (obj) {\n return HDKey.fromExtendedKey(obj.xpriv)\n}\n\nfunction serialize (hdkey, version, key) {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n var buffer = Buffer.allocUnsafe(LEN)\n\n buffer.writeUInt32BE(version, 0)\n buffer.writeUInt8(hdkey.depth, 4)\n\n var fingerprint = hdkey.depth ? hdkey.parentFingerprint : 0x00000000\n buffer.writeUInt32BE(fingerprint, 5)\n buffer.writeUInt32BE(hdkey.index, 9)\n\n hdkey.chainCode.copy(buffer, 13)\n key.copy(buffer, 45)\n\n return buffer\n}\n\nfunction hash160 (buf) {\n var sha = crypto.createHash('sha256').update(buf).digest()\n return crypto.createHash('ripemd160').update(sha).digest()\n}\n\nHDKey.HARDENED_OFFSET = HARDENED_OFFSET\nmodule.exports = HDKey\n","'use strict'\n\nvar createHash = require('create-hash')\nvar bs58checkBase = require('./base')\n\n// SHA256(SHA256(buffer))\nfunction sha256x2 (buffer) {\n var tmp = createHash('sha256').update(buffer).digest()\n return createHash('sha256').update(tmp).digest()\n}\n\nmodule.exports = bs58checkBase(sha256x2)\n","'use strict'\n\nvar base58 = require('bs58')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (checksumFn) {\n // Encode a buffer as a base58-check encoded string\n function encode (payload) {\n var checksum = checksumFn(payload)\n\n return base58.encode(Buffer.concat([\n payload,\n checksum\n ], payload.length + 4))\n }\n\n function decodeRaw (buffer) {\n var payload = buffer.slice(0, -4)\n var checksum = buffer.slice(-4)\n var newChecksum = checksumFn(payload)\n\n if (checksum[0] ^ newChecksum[0] |\n checksum[1] ^ newChecksum[1] |\n checksum[2] ^ newChecksum[2] |\n checksum[3] ^ newChecksum[3]) return\n\n return payload\n }\n\n // Decode a base58-check encoded string to a buffer, no result if checksum is wrong\n function decodeUnsafe (string) {\n var buffer = base58.decodeUnsafe(string)\n if (!buffer) return\n\n return decodeRaw(buffer)\n }\n\n function decode (string) {\n var buffer = base58.decode(string)\n var payload = decodeRaw(buffer, checksumFn)\n if (!payload) throw new Error('Invalid checksum')\n return payload\n }\n\n return {\n encode: encode,\n decode: decode,\n decodeUnsafe: decodeUnsafe\n }\n}\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = require('safe-buffer').Buffer\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return _Buffer.alloc(0) }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n vch.fill(0x00, 0, zeroes)\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","'use strict'\nmodule.exports = require('bindings')('secp256k1')\n","\n/**\n * Module dependencies.\n */\n\nvar sep = require('path').sep || '/';\n\n/**\n * Module exports.\n */\n\nmodule.exports = fileUriToPath;\n\n/**\n * File URI to Path function.\n *\n * @param {String} uri\n * @return {String} path\n * @api public\n */\n\nfunction fileUriToPath (uri) {\n if ('string' != typeof uri ||\n uri.length <= 7 ||\n 'file://' != uri.substring(0, 7)) {\n throw new TypeError('must pass in a file:// URI to convert to a file path');\n }\n\n var rest = decodeURI(uri.substring(7));\n var firstSlash = rest.indexOf('/');\n var host = rest.substring(0, firstSlash);\n var path = rest.substring(firstSlash + 1);\n\n // 2. Scheme Definition\n // As a special case, can be the string \"localhost\" or the empty\n // string; this is interpreted as \"the machine from which the URL is\n // being interpreted\".\n if ('localhost' == host) host = '';\n\n if (host) {\n host = sep + sep + host;\n }\n\n // 3.2 Drives, drive letters, mount points, file system root\n // Drive letters are mapped into the top of a file URI in various ways,\n // depending on the implementation; some applications substitute\n // vertical bar (\"|\") for the colon after the drive letter, yielding\n // \"file:///c|/tmp/test.txt\". In some cases, the colon is left\n // unchanged, as in \"file:///c:/tmp/test.txt\". In other cases, the\n // colon is simply omitted, as in \"file:///c/tmp/test.txt\".\n path = path.replace(/^(.+)\\|/, '$1:');\n\n // for Windows, we need to invert the path separators from what a URI uses\n if (sep == '\\\\') {\n path = path.replace(/\\//g, '\\\\');\n }\n\n if (/^.+\\:/.test(path)) {\n // has Windows drive at beginning of path\n } else {\n // unix path…\n path = sep + path;\n }\n\n return host + path;\n}\n","'use strict'\nmodule.exports = require('./lib')(require('./lib/elliptic'))\n","'use strict'\nvar assert = require('./assert')\nvar der = require('./der')\nvar messages = require('./messages.json')\n\nfunction initCompressedValue (value, defaultValue) {\n if (value === undefined) return defaultValue\n\n assert.isBoolean(value, messages.COMPRESSED_TYPE_INVALID)\n return value\n}\n\nmodule.exports = function (secp256k1) {\n return {\n privateKeyVerify: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n return privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)\n },\n\n privateKeyExport: function (privateKey, compressed) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n var publicKey = secp256k1.privateKeyExport(privateKey, compressed)\n\n return der.privateKeyExport(privateKey, publicKey, compressed)\n },\n\n privateKeyImport: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n\n privateKey = der.privateKeyImport(privateKey)\n if (privateKey && privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)) return privateKey\n\n throw new Error(messages.EC_PRIVATE_KEY_IMPORT_DER_FAIL)\n },\n\n privateKeyNegate: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.privateKeyNegate(privateKey)\n },\n\n privateKeyModInverse: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.privateKeyModInverse(privateKey)\n },\n\n privateKeyTweakAdd: function (privateKey, tweak) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n return secp256k1.privateKeyTweakAdd(privateKey, tweak)\n },\n\n privateKeyTweakMul: function (privateKey, tweak) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n return secp256k1.privateKeyTweakMul(privateKey, tweak)\n },\n\n publicKeyCreate: function (privateKey, compressed) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyCreate(privateKey, compressed)\n },\n\n publicKeyConvert: function (publicKey, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyConvert(publicKey, compressed)\n },\n\n publicKeyVerify: function (publicKey) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n return secp256k1.publicKeyVerify(publicKey)\n },\n\n publicKeyTweakAdd: function (publicKey, tweak, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyTweakAdd(publicKey, tweak, compressed)\n },\n\n publicKeyTweakMul: function (publicKey, tweak, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyTweakMul(publicKey, tweak, compressed)\n },\n\n publicKeyCombine: function (publicKeys, compressed) {\n assert.isArray(publicKeys, messages.EC_PUBLIC_KEYS_TYPE_INVALID)\n assert.isLengthGTZero(publicKeys, messages.EC_PUBLIC_KEYS_LENGTH_INVALID)\n for (var i = 0; i < publicKeys.length; ++i) {\n assert.isBuffer(publicKeys[i], messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKeys[i], 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n }\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyCombine(publicKeys, compressed)\n },\n\n signatureNormalize: function (signature) {\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n return secp256k1.signatureNormalize(signature)\n },\n\n signatureExport: function (signature) {\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = secp256k1.signatureExport(signature)\n return der.signatureExport(sigObj)\n },\n\n signatureImport: function (sig) {\n assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = der.signatureImport(sig)\n if (sigObj) return secp256k1.signatureImport(sigObj)\n\n throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL)\n },\n\n signatureImportLax: function (sig) {\n assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = der.signatureImportLax(sig)\n if (sigObj) return secp256k1.signatureImport(sigObj)\n\n throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL)\n },\n\n sign: function (message, privateKey, options) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n var data = null\n var noncefn = null\n if (options !== undefined) {\n assert.isObject(options, messages.OPTIONS_TYPE_INVALID)\n\n if (options.data !== undefined) {\n assert.isBuffer(options.data, messages.OPTIONS_DATA_TYPE_INVALID)\n assert.isBufferLength(options.data, 32, messages.OPTIONS_DATA_LENGTH_INVALID)\n data = options.data\n }\n\n if (options.noncefn !== undefined) {\n assert.isFunction(options.noncefn, messages.OPTIONS_NONCEFN_TYPE_INVALID)\n noncefn = options.noncefn\n }\n }\n\n return secp256k1.sign(message, privateKey, noncefn, data)\n },\n\n verify: function (message, signature, publicKey) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n return secp256k1.verify(message, signature, publicKey)\n },\n\n recover: function (message, signature, recovery, compressed) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n assert.isNumber(recovery, messages.RECOVERY_ID_TYPE_INVALID)\n assert.isNumberInInterval(recovery, -1, 4, messages.RECOVERY_ID_VALUE_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.recover(message, signature, recovery, compressed)\n },\n\n ecdh: function (publicKey, privateKey) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.ecdh(publicKey, privateKey)\n },\n\n ecdhUnsafe: function (publicKey, privateKey, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.ecdhUnsafe(publicKey, privateKey, compressed)\n }\n }\n}\n","// Reference https://github.com/bitcoin/bips/blob/master/bip-0066.mediawiki\n// Format: 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n// NOTE: SIGHASH byte ignored AND restricted, truncate before use\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction check (buffer) {\n if (buffer.length < 8) return false\n if (buffer.length > 72) return false\n if (buffer[0] !== 0x30) return false\n if (buffer[1] !== buffer.length - 2) return false\n if (buffer[2] !== 0x02) return false\n\n var lenR = buffer[3]\n if (lenR === 0) return false\n if (5 + lenR >= buffer.length) return false\n if (buffer[4 + lenR] !== 0x02) return false\n\n var lenS = buffer[5 + lenR]\n if (lenS === 0) return false\n if ((6 + lenR + lenS) !== buffer.length) return false\n\n if (buffer[4] & 0x80) return false\n if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) return false\n\n if (buffer[lenR + 6] & 0x80) return false\n if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) return false\n return true\n}\n\nfunction decode (buffer) {\n if (buffer.length < 8) throw new Error('DER sequence length is too short')\n if (buffer.length > 72) throw new Error('DER sequence length is too long')\n if (buffer[0] !== 0x30) throw new Error('Expected DER sequence')\n if (buffer[1] !== buffer.length - 2) throw new Error('DER sequence length is invalid')\n if (buffer[2] !== 0x02) throw new Error('Expected DER integer')\n\n var lenR = buffer[3]\n if (lenR === 0) throw new Error('R length is zero')\n if (5 + lenR >= buffer.length) throw new Error('R length is too long')\n if (buffer[4 + lenR] !== 0x02) throw new Error('Expected DER integer (2)')\n\n var lenS = buffer[5 + lenR]\n if (lenS === 0) throw new Error('S length is zero')\n if ((6 + lenR + lenS) !== buffer.length) throw new Error('S length is invalid')\n\n if (buffer[4] & 0x80) throw new Error('R value is negative')\n if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) throw new Error('R value excessively padded')\n\n if (buffer[lenR + 6] & 0x80) throw new Error('S value is negative')\n if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) throw new Error('S value excessively padded')\n\n // non-BIP66 - extract R, S values\n return {\n r: buffer.slice(4, 4 + lenR),\n s: buffer.slice(6 + lenR)\n }\n}\n\n/*\n * Expects r and s to be positive DER integers.\n *\n * The DER format uses the most significant bit as a sign bit (& 0x80).\n * If the significant bit is set AND the integer is positive, a 0x00 is prepended.\n *\n * Examples:\n *\n * 0 => 0x00\n * 1 => 0x01\n * -1 => 0xff\n * 127 => 0x7f\n * -127 => 0x81\n * 128 => 0x0080\n * -128 => 0x80\n * 255 => 0x00ff\n * -255 => 0xff01\n * 16300 => 0x3fac\n * -16300 => 0xc054\n * 62300 => 0x00f35c\n * -62300 => 0xff0ca4\n*/\nfunction encode (r, s) {\n var lenR = r.length\n var lenS = s.length\n if (lenR === 0) throw new Error('R length is zero')\n if (lenS === 0) throw new Error('S length is zero')\n if (lenR > 33) throw new Error('R length is too long')\n if (lenS > 33) throw new Error('S length is too long')\n if (r[0] & 0x80) throw new Error('R value is negative')\n if (s[0] & 0x80) throw new Error('S value is negative')\n if (lenR > 1 && (r[0] === 0x00) && !(r[1] & 0x80)) throw new Error('R value excessively padded')\n if (lenS > 1 && (s[0] === 0x00) && !(s[1] & 0x80)) throw new Error('S value excessively padded')\n\n var signature = Buffer.allocUnsafe(6 + lenR + lenS)\n\n // 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n signature[0] = 0x30\n signature[1] = signature.length - 2\n signature[2] = 0x02\n signature[3] = r.length\n r.copy(signature, 4)\n signature[4 + lenR] = 0x02\n signature[5 + lenR] = s.length\n s.copy(signature, 6 + lenR)\n\n return signature\n}\n\nmodule.exports = {\n check: check,\n decode: decode,\n encode: encode\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\n\nvar messages = require('../messages.json')\n\nvar ec = new EC('secp256k1')\nvar ecparams = ec.curve\n\nfunction loadCompressedPublicKey (first, xBuffer) {\n var x = new BN(xBuffer)\n\n // overflow\n if (x.cmp(ecparams.p) >= 0) return null\n x = x.toRed(ecparams.red)\n\n // compute corresponding Y\n var y = x.redSqr().redIMul(x).redIAdd(ecparams.b).redSqrt()\n if ((first === 0x03) !== y.isOdd()) y = y.redNeg()\n\n return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadUncompressedPublicKey (first, xBuffer, yBuffer) {\n var x = new BN(xBuffer)\n var y = new BN(yBuffer)\n\n // overflow\n if (x.cmp(ecparams.p) >= 0 || y.cmp(ecparams.p) >= 0) return null\n\n x = x.toRed(ecparams.red)\n y = y.toRed(ecparams.red)\n\n // is odd flag\n if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null\n\n // x*x*x + b = y*y\n var x3 = x.redSqr().redIMul(x)\n if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null\n\n return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadPublicKey (publicKey) {\n var first = publicKey[0]\n switch (first) {\n case 0x02:\n case 0x03:\n if (publicKey.length !== 33) return null\n return loadCompressedPublicKey(first, publicKey.slice(1, 33))\n case 0x04:\n case 0x06:\n case 0x07:\n if (publicKey.length !== 65) return null\n return loadUncompressedPublicKey(first, publicKey.slice(1, 33), publicKey.slice(33, 65))\n default:\n return null\n }\n}\n\nexports.privateKeyVerify = function (privateKey) {\n var bn = new BN(privateKey)\n return bn.cmp(ecparams.n) < 0 && !bn.isZero()\n}\n\nexports.privateKeyExport = function (privateKey, compressed) {\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PRIVATE_KEY_EXPORT_DER_FAIL)\n\n return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true))\n}\n\nexports.privateKeyNegate = function (privateKey) {\n var bn = new BN(privateKey)\n return bn.isZero() ? Buffer.alloc(32) : ecparams.n.sub(bn).umod(ecparams.n).toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyModInverse = function (privateKey) {\n var bn = new BN(privateKey)\n if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_RANGE_INVALID)\n\n return bn.invm(ecparams.n).toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyTweakAdd = function (privateKey, tweak) {\n var bn = new BN(tweak)\n if (bn.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL)\n\n bn.iadd(new BN(privateKey))\n if (bn.cmp(ecparams.n) >= 0) bn.isub(ecparams.n)\n if (bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL)\n\n return bn.toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyTweakMul = function (privateKey, tweak) {\n var bn = new BN(tweak)\n if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_MUL_FAIL)\n\n bn.imul(new BN(privateKey))\n if (bn.cmp(ecparams.n)) bn = bn.umod(ecparams.n)\n\n return bn.toArrayLike(Buffer, 'be', 32)\n}\n\nexports.publicKeyCreate = function (privateKey, compressed) {\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PUBLIC_KEY_CREATE_FAIL)\n\n return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true))\n}\n\nexports.publicKeyConvert = function (publicKey, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n return Buffer.from(pair.getPublic(compressed, true))\n}\n\nexports.publicKeyVerify = function (publicKey) {\n return loadPublicKey(publicKey) !== null\n}\n\nexports.publicKeyTweakAdd = function (publicKey, tweak, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n tweak = new BN(tweak)\n if (tweak.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL)\n\n var point = ecparams.g.mul(tweak).add(pair.pub)\n if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL)\n\n return Buffer.from(point.encode(true, compressed))\n}\n\nexports.publicKeyTweakMul = function (publicKey, tweak, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n tweak = new BN(tweak)\n if (tweak.cmp(ecparams.n) >= 0 || tweak.isZero()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_MUL_FAIL)\n\n return Buffer.from(pair.pub.mul(tweak).encode(true, compressed))\n}\n\nexports.publicKeyCombine = function (publicKeys, compressed) {\n var pairs = new Array(publicKeys.length)\n for (var i = 0; i < publicKeys.length; ++i) {\n pairs[i] = loadPublicKey(publicKeys[i])\n if (pairs[i] === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n }\n\n var point = pairs[0].pub\n for (var j = 1; j < pairs.length; ++j) point = point.add(pairs[j].pub)\n if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_COMBINE_FAIL)\n\n return Buffer.from(point.encode(true, compressed))\n}\n\nexports.signatureNormalize = function (signature) {\n var r = new BN(signature.slice(0, 32))\n var s = new BN(signature.slice(32, 64))\n if (r.cmp(ecparams.n) >= 0 || s.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n var result = Buffer.from(signature)\n if (s.cmp(ec.nh) === 1) ecparams.n.sub(s).toArrayLike(Buffer, 'be', 32).copy(result, 32)\n\n return result\n}\n\nexports.signatureExport = function (signature) {\n var r = signature.slice(0, 32)\n var s = signature.slice(32, 64)\n if (new BN(r).cmp(ecparams.n) >= 0 || new BN(s).cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n return { r: r, s: s }\n}\n\nexports.signatureImport = function (sigObj) {\n var r = new BN(sigObj.r)\n if (r.cmp(ecparams.n) >= 0) r = new BN(0)\n\n var s = new BN(sigObj.s)\n if (s.cmp(ecparams.n) >= 0) s = new BN(0)\n\n return Buffer.concat([\n r.toArrayLike(Buffer, 'be', 32),\n s.toArrayLike(Buffer, 'be', 32)\n ])\n}\n\nexports.sign = function (message, privateKey, noncefn, data) {\n if (typeof noncefn === 'function') {\n var getNonce = noncefn\n noncefn = function (counter) {\n var nonce = getNonce(message, privateKey, null, data, counter)\n if (!Buffer.isBuffer(nonce) || nonce.length !== 32) throw new Error(messages.ECDSA_SIGN_FAIL)\n\n return new BN(nonce)\n }\n }\n\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.ECDSA_SIGN_FAIL)\n\n var result = ec.sign(message, privateKey, { canonical: true, k: noncefn, pers: data })\n return {\n signature: Buffer.concat([\n result.r.toArrayLike(Buffer, 'be', 32),\n result.s.toArrayLike(Buffer, 'be', 32)\n ]),\n recovery: result.recoveryParam\n }\n}\n\nexports.verify = function (message, signature, publicKey) {\n var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) }\n\n var sigr = new BN(sigObj.r)\n var sigs = new BN(sigObj.s)\n if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n if (sigs.cmp(ec.nh) === 1 || sigr.isZero() || sigs.isZero()) return false\n\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n return ec.verify(message, sigObj, { x: pair.pub.x, y: pair.pub.y })\n}\n\nexports.recover = function (message, signature, recovery, compressed) {\n var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) }\n\n var sigr = new BN(sigObj.r)\n var sigs = new BN(sigObj.s)\n if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n try {\n if (sigr.isZero() || sigs.isZero()) throw new Error()\n\n var point = ec.recoverPubKey(message, sigObj, recovery)\n return Buffer.from(point.encode(true, compressed))\n } catch (err) {\n throw new Error(messages.ECDSA_RECOVER_FAIL)\n }\n}\n\nexports.ecdh = function (publicKey, privateKey) {\n var shared = exports.ecdhUnsafe(publicKey, privateKey, true)\n return createHash('sha256').update(shared).digest()\n}\n\nexports.ecdhUnsafe = function (publicKey, privateKey, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n var scalar = new BN(privateKey)\n if (scalar.cmp(ecparams.n) >= 0 || scalar.isZero()) throw new Error(messages.ECDH_FAIL)\n\n return Buffer.from(pair.pub.mul(scalar).encode(true, compressed))\n}\n","const scrypt = require('./scryptSync')\nscrypt.async = require('./scrypt')\nmodule.exports = scrypt\n","const crypto = require('crypto')\nconst {\n checkAndInit,\n smixSync\n} = require('./utils')\n\n// N = Cpu cost, r = Memory cost, p = parallelization cost\nfunction scrypt (key, salt, N, r, p, dkLen, progressCallback) {\n const {\n XY,\n V,\n B32,\n x,\n _X,\n B,\n tickCallback\n } = checkAndInit(key, salt, N, r, p, dkLen, progressCallback)\n\n for (var i = 0; i < p; i++) {\n smixSync(B, i * 128 * r, r, N, V, XY, _X, B32, x, tickCallback)\n }\n\n return crypto.pbkdf2Sync(key, B, 1, dkLen, 'sha256')\n}\n\nmodule.exports = scrypt\n","const crypto = require('crypto')\nconst {\n checkAndInit,\n smix\n} = require('./utils')\n\n// N = Cpu cost, r = Memory cost, p = parallelization cost\nasync function scrypt (key, salt, N, r, p, dkLen, progressCallback, promiseInterval) {\n const {\n XY,\n V,\n B32,\n x,\n _X,\n B,\n tickCallback\n } = checkAndInit(key, salt, N, r, p, dkLen, progressCallback)\n\n for (var i = 0; i < p; i++) {\n await smix(B, i * 128 * r, r, N, V, XY, _X, B32, x, tickCallback, promiseInterval)\n }\n\n return crypto.pbkdf2Sync(key, B, 1, dkLen, 'sha256')\n}\n\nmodule.exports = scrypt\n","module.exports = require('./lib/api')(require('node-gyp-build')(__dirname))\n","const { Transform } = require('readable-stream')\n\nmodule.exports = (KeccakState) => class Keccak extends Transform {\n constructor (rate, capacity, delimitedSuffix, hashBitLength, options) {\n super(options)\n\n this._rate = rate\n this._capacity = capacity\n this._delimitedSuffix = delimitedSuffix\n this._hashBitLength = hashBitLength\n this._options = options\n\n this._state = new KeccakState()\n this._state.initialize(rate, capacity)\n this._finalized = false\n }\n\n _transform (chunk, encoding, callback) {\n let error = null\n try {\n this.update(chunk, encoding)\n } catch (err) {\n error = err\n }\n\n callback(error)\n }\n\n _flush (callback) {\n let error = null\n try {\n this.push(this.digest())\n } catch (err) {\n error = err\n }\n\n callback(error)\n }\n\n update (data, encoding) {\n if (!Buffer.isBuffer(data) && typeof data !== 'string') throw new TypeError('Data must be a string or a buffer')\n if (this._finalized) throw new Error('Digest already called')\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n this._state.absorb(data)\n\n return this\n }\n\n digest (encoding) {\n if (this._finalized) throw new Error('Digest already called')\n this._finalized = true\n\n if (this._delimitedSuffix) this._state.absorbLastFewBits(this._delimitedSuffix)\n let digest = this._state.squeeze(this._hashBitLength / 8)\n if (encoding !== undefined) digest = digest.toString(encoding)\n\n this._resetState()\n\n return digest\n }\n\n // remove result from memory\n _resetState () {\n this._state.initialize(this._rate, this._capacity)\n return this\n }\n\n // because sometimes we need hash right now and little later\n _clone () {\n const clone = new Keccak(this._rate, this._capacity, this._delimitedSuffix, this._hashBitLength, this._options)\n this._state.copy(clone._state)\n clone._finalized = this._finalized\n\n return clone\n }\n}\n","module.exports = require(\"stream\");","module.exports = require('stream');\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","'use strict';\n\nfunction asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }\nfunction _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err); } _next(undefined); }); }; }\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar ERR_INVALID_ARG_TYPE = require('../../../errors').codes.ERR_INVALID_ARG_TYPE;\nfunction from(Readable, iterable, opts) {\n var iterator;\n if (iterable && typeof iterable.next === 'function') {\n iterator = iterable;\n } else if (iterable && iterable[Symbol.asyncIterator]) iterator = iterable[Symbol.asyncIterator]();else if (iterable && iterable[Symbol.iterator]) iterator = iterable[Symbol.iterator]();else throw new ERR_INVALID_ARG_TYPE('iterable', ['Iterable'], iterable);\n var readable = new Readable(_objectSpread({\n objectMode: true\n }, opts));\n // Reading boolean to protect against _read\n // being called before last iteration completion.\n var reading = false;\n readable._read = function () {\n if (!reading) {\n reading = true;\n next();\n }\n };\n function next() {\n return _next2.apply(this, arguments);\n }\n function _next2() {\n _next2 = _asyncToGenerator(function* () {\n try {\n var _yield$iterator$next = yield iterator.next(),\n value = _yield$iterator$next.value,\n done = _yield$iterator$next.done;\n if (done) {\n readable.push(null);\n } else if (readable.push(yield value)) {\n next();\n } else {\n reading = false;\n }\n } catch (err) {\n readable.destroy(err);\n }\n });\n return _next2.apply(this, arguments);\n }\n return readable;\n}\nmodule.exports = from;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","const { Transform } = require('readable-stream')\n\nmodule.exports = (KeccakState) => class Shake extends Transform {\n constructor (rate, capacity, delimitedSuffix, options) {\n super(options)\n\n this._rate = rate\n this._capacity = capacity\n this._delimitedSuffix = delimitedSuffix\n this._options = options\n\n this._state = new KeccakState()\n this._state.initialize(rate, capacity)\n this._finalized = false\n }\n\n _transform (chunk, encoding, callback) {\n let error = null\n try {\n this.update(chunk, encoding)\n } catch (err) {\n error = err\n }\n\n callback(error)\n }\n\n _flush () {}\n\n _read (size) {\n this.push(this.squeeze(size))\n }\n\n update (data, encoding) {\n if (!Buffer.isBuffer(data) && typeof data !== 'string') throw new TypeError('Data must be a string or a buffer')\n if (this._finalized) throw new Error('Squeeze already called')\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n this._state.absorb(data)\n\n return this\n }\n\n squeeze (dataByteLength, encoding) {\n if (!this._finalized) {\n this._finalized = true\n this._state.absorbLastFewBits(this._delimitedSuffix)\n }\n\n let data = this._state.squeeze(dataByteLength)\n if (encoding !== undefined) data = data.toString(encoding)\n\n return data\n }\n\n _resetState () {\n this._state.initialize(this._rate, this._capacity)\n return this\n }\n\n _clone () {\n const clone = new Shake(this._rate, this._capacity, this._delimitedSuffix, this._options)\n this._state.copy(clone._state)\n clone._finalized = this._finalized\n\n return clone\n }\n}\n","if (typeof process.addon === 'function') { // if the platform supports native resolving prefer that\n module.exports = process.addon.bind(process)\n} else { // else use the runtime version here\n module.exports = require('./node-gyp-build.js')\n}\n","var fs = require('fs')\nvar path = require('path')\nvar os = require('os')\n\n// Workaround to fix webpack's build warnings: 'the request of a dependency is an expression'\nvar runtimeRequire = typeof __webpack_require__ === 'function' ? __non_webpack_require__ : require // eslint-disable-line\n\nvar vars = (process.config && process.config.variables) || {}\nvar prebuildsOnly = !!process.env.PREBUILDS_ONLY\nvar abi = process.versions.modules // TODO: support old node where this is undef\nvar runtime = isElectron() ? 'electron' : (isNwjs() ? 'node-webkit' : 'node')\n\nvar arch = process.env.npm_config_arch || os.arch()\nvar platform = process.env.npm_config_platform || os.platform()\nvar libc = process.env.LIBC || (isAlpine(platform) ? 'musl' : 'glibc')\nvar armv = process.env.ARM_VERSION || (arch === 'arm64' ? '8' : vars.arm_version) || ''\nvar uv = (process.versions.uv || '').split('.')[0]\n\nmodule.exports = load\n\nfunction load (dir) {\n return runtimeRequire(load.resolve(dir))\n}\n\nload.resolve = load.path = function (dir) {\n dir = path.resolve(dir || '.')\n\n try {\n var name = runtimeRequire(path.join(dir, 'package.json')).name.toUpperCase().replace(/-/g, '_')\n if (process.env[name + '_PREBUILD']) dir = process.env[name + '_PREBUILD']\n } catch (err) {}\n\n if (!prebuildsOnly) {\n var release = getFirst(path.join(dir, 'build/Release'), matchBuild)\n if (release) return release\n\n var debug = getFirst(path.join(dir, 'build/Debug'), matchBuild)\n if (debug) return debug\n }\n\n var prebuild = resolve(dir)\n if (prebuild) return prebuild\n\n var nearby = resolve(path.dirname(process.execPath))\n if (nearby) return nearby\n\n var target = [\n 'platform=' + platform,\n 'arch=' + arch,\n 'runtime=' + runtime,\n 'abi=' + abi,\n 'uv=' + uv,\n armv ? 'armv=' + armv : '',\n 'libc=' + libc,\n 'node=' + process.versions.node,\n process.versions.electron ? 'electron=' + process.versions.electron : '',\n typeof __webpack_require__ === 'function' ? 'webpack=true' : '' // eslint-disable-line\n ].filter(Boolean).join(' ')\n\n throw new Error('No native build was found for ' + target + '\\n loaded from: ' + dir + '\\n')\n\n function resolve (dir) {\n // Find matching \"prebuilds/-\" directory\n var tuples = readdirSync(path.join(dir, 'prebuilds')).map(parseTuple)\n var tuple = tuples.filter(matchTuple(platform, arch)).sort(compareTuples)[0]\n if (!tuple) return\n\n // Find most specific flavor first\n var prebuilds = path.join(dir, 'prebuilds', tuple.name)\n var parsed = readdirSync(prebuilds).map(parseTags)\n var candidates = parsed.filter(matchTags(runtime, abi))\n var winner = candidates.sort(compareTags(runtime))[0]\n if (winner) return path.join(prebuilds, winner.file)\n }\n}\n\nfunction readdirSync (dir) {\n try {\n return fs.readdirSync(dir)\n } catch (err) {\n return []\n }\n}\n\nfunction getFirst (dir, filter) {\n var files = readdirSync(dir).filter(filter)\n return files[0] && path.join(dir, files[0])\n}\n\nfunction matchBuild (name) {\n return /\\.node$/.test(name)\n}\n\nfunction parseTuple (name) {\n // Example: darwin-x64+arm64\n var arr = name.split('-')\n if (arr.length !== 2) return\n\n var platform = arr[0]\n var architectures = arr[1].split('+')\n\n if (!platform) return\n if (!architectures.length) return\n if (!architectures.every(Boolean)) return\n\n return { name, platform, architectures }\n}\n\nfunction matchTuple (platform, arch) {\n return function (tuple) {\n if (tuple == null) return false\n if (tuple.platform !== platform) return false\n return tuple.architectures.includes(arch)\n }\n}\n\nfunction compareTuples (a, b) {\n // Prefer single-arch prebuilds over multi-arch\n return a.architectures.length - b.architectures.length\n}\n\nfunction parseTags (file) {\n var arr = file.split('.')\n var extension = arr.pop()\n var tags = { file: file, specificity: 0 }\n\n if (extension !== 'node') return\n\n for (var i = 0; i < arr.length; i++) {\n var tag = arr[i]\n\n if (tag === 'node' || tag === 'electron' || tag === 'node-webkit') {\n tags.runtime = tag\n } else if (tag === 'napi') {\n tags.napi = true\n } else if (tag.slice(0, 3) === 'abi') {\n tags.abi = tag.slice(3)\n } else if (tag.slice(0, 2) === 'uv') {\n tags.uv = tag.slice(2)\n } else if (tag.slice(0, 4) === 'armv') {\n tags.armv = tag.slice(4)\n } else if (tag === 'glibc' || tag === 'musl') {\n tags.libc = tag\n } else {\n continue\n }\n\n tags.specificity++\n }\n\n return tags\n}\n\nfunction matchTags (runtime, abi) {\n return function (tags) {\n if (tags == null) return false\n if (tags.runtime !== runtime && !runtimeAgnostic(tags)) return false\n if (tags.abi !== abi && !tags.napi) return false\n if (tags.uv && tags.uv !== uv) return false\n if (tags.armv && tags.armv !== armv) return false\n if (tags.libc && tags.libc !== libc) return false\n\n return true\n }\n}\n\nfunction runtimeAgnostic (tags) {\n return tags.runtime === 'node' && tags.napi\n}\n\nfunction compareTags (runtime) {\n // Precedence: non-agnostic runtime, abi over napi, then by specificity.\n return function (a, b) {\n if (a.runtime !== b.runtime) {\n return a.runtime === runtime ? -1 : 1\n } else if (a.abi !== b.abi) {\n return a.abi ? -1 : 1\n } else if (a.specificity !== b.specificity) {\n return a.specificity > b.specificity ? -1 : 1\n } else {\n return 0\n }\n }\n}\n\nfunction isNwjs () {\n return !!(process.versions && process.versions.nw)\n}\n\nfunction isElectron () {\n if (process.versions && process.versions.electron) return true\n if (process.env.ELECTRON_RUN_AS_NODE) return true\n return typeof window !== 'undefined' && window.process && window.process.type === 'renderer'\n}\n\nfunction isAlpine (platform) {\n return platform === 'linux' && fs.existsSync('/etc/alpine-release')\n}\n\n// Exposed for unit tests\n// TODO: move to lib\nload.parseTags = parseTags\nload.matchTags = matchTags\nload.compareTags = compareTags\nload.parseTuple = parseTuple\nload.matchTuple = matchTuple\nload.compareTuples = compareTuples\n","module.exports = require('./lib/api')(require('./lib/keccak'))\n","const keccakState = require('./keccak-state-unroll')\n\nfunction Keccak () {\n // much faster than `new Array(50)`\n this.state = [\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0\n ]\n\n this.blockSize = null\n this.count = 0\n this.squeezing = false\n}\n\nKeccak.prototype.initialize = function (rate, capacity) {\n for (let i = 0; i < 50; ++i) this.state[i] = 0\n this.blockSize = rate / 8\n this.count = 0\n this.squeezing = false\n}\n\nKeccak.prototype.absorb = function (data) {\n for (let i = 0; i < data.length; ++i) {\n this.state[~~(this.count / 4)] ^= data[i] << (8 * (this.count % 4))\n this.count += 1\n if (this.count === this.blockSize) {\n keccakState.p1600(this.state)\n this.count = 0\n }\n }\n}\n\nKeccak.prototype.absorbLastFewBits = function (bits) {\n this.state[~~(this.count / 4)] ^= bits << (8 * (this.count % 4))\n if ((bits & 0x80) !== 0 && this.count === (this.blockSize - 1)) keccakState.p1600(this.state)\n this.state[~~((this.blockSize - 1) / 4)] ^= 0x80 << (8 * ((this.blockSize - 1) % 4))\n keccakState.p1600(this.state)\n this.count = 0\n this.squeezing = true\n}\n\nKeccak.prototype.squeeze = function (length) {\n if (!this.squeezing) this.absorbLastFewBits(0x01)\n\n const output = Buffer.alloc(length)\n for (let i = 0; i < length; ++i) {\n output[i] = (this.state[~~(this.count / 4)] >>> (8 * (this.count % 4))) & 0xff\n this.count += 1\n if (this.count === this.blockSize) {\n keccakState.p1600(this.state)\n this.count = 0\n }\n }\n\n return output\n}\n\nKeccak.prototype.copy = function (dest) {\n for (let i = 0; i < 50; ++i) dest.state[i] = this.state[i]\n dest.blockSize = this.blockSize\n dest.count = this.count\n dest.squeezing = this.squeezing\n}\n\nmodule.exports = Keccak\n","'use strict';\nmodule.exports = str => encodeURIComponent(str).replace(/[!'()*]/g, x => `%${x.charCodeAt(0).toString(16).toUpperCase()}`);\n","'use strict';\nvar token = '%[a-f0-9]{2}';\nvar singleMatcher = new RegExp('(' + token + ')|([^%]+?)', 'gi');\nvar multiMatcher = new RegExp('(' + token + ')+', 'gi');\n\nfunction decodeComponents(components, split) {\n\ttry {\n\t\t// Try to decode the entire string first\n\t\treturn [decodeURIComponent(components.join(''))];\n\t} catch (err) {\n\t\t// Do nothing\n\t}\n\n\tif (components.length === 1) {\n\t\treturn components;\n\t}\n\n\tsplit = split || 1;\n\n\t// Split the array in 2 parts\n\tvar left = components.slice(0, split);\n\tvar right = components.slice(split);\n\n\treturn Array.prototype.concat.call([], decodeComponents(left), decodeComponents(right));\n}\n\nfunction decode(input) {\n\ttry {\n\t\treturn decodeURIComponent(input);\n\t} catch (err) {\n\t\tvar tokens = input.match(singleMatcher) || [];\n\n\t\tfor (var i = 1; i < tokens.length; i++) {\n\t\t\tinput = decodeComponents(tokens, i).join('');\n\n\t\t\ttokens = input.match(singleMatcher) || [];\n\t\t}\n\n\t\treturn input;\n\t}\n}\n\nfunction customDecodeURIComponent(input) {\n\t// Keep track of all the replacements and prefill the map with the `BOM`\n\tvar replaceMap = {\n\t\t'%FE%FF': '\\uFFFD\\uFFFD',\n\t\t'%FF%FE': '\\uFFFD\\uFFFD'\n\t};\n\n\tvar match = multiMatcher.exec(input);\n\twhile (match) {\n\t\ttry {\n\t\t\t// Decode as big chunks as possible\n\t\t\treplaceMap[match[0]] = decodeURIComponent(match[0]);\n\t\t} catch (err) {\n\t\t\tvar result = decode(match[0]);\n\n\t\t\tif (result !== match[0]) {\n\t\t\t\treplaceMap[match[0]] = result;\n\t\t\t}\n\t\t}\n\n\t\tmatch = multiMatcher.exec(input);\n\t}\n\n\t// Add `%C2` at the end of the map to make sure it does not replace the combinator before everything else\n\treplaceMap['%C2'] = '\\uFFFD';\n\n\tvar entries = Object.keys(replaceMap);\n\n\tfor (var i = 0; i < entries.length; i++) {\n\t\t// Replace all decoded components\n\t\tvar key = entries[i];\n\t\tinput = input.replace(new RegExp(key, 'g'), replaceMap[key]);\n\t}\n\n\treturn input;\n}\n\nmodule.exports = function (encodedURI) {\n\tif (typeof encodedURI !== 'string') {\n\t\tthrow new TypeError('Expected `encodedURI` to be of type `string`, got `' + typeof encodedURI + '`');\n\t}\n\n\ttry {\n\t\tencodedURI = encodedURI.replace(/\\+/g, ' ');\n\n\t\t// Try the built in decoder first\n\t\treturn decodeURIComponent(encodedURI);\n\t} catch (err) {\n\t\t// Fallback to a more advanced decoder\n\t\treturn customDecodeURIComponent(encodedURI);\n\t}\n};\n","'use strict';\n\nmodule.exports = (string, separator) => {\n\tif (!(typeof string === 'string' && typeof separator === 'string')) {\n\t\tthrow new TypeError('Expected the arguments to be of type `string`');\n\t}\n\n\tif (separator === '') {\n\t\treturn [string];\n\t}\n\n\tconst separatorIndex = string.indexOf(separator);\n\n\tif (separatorIndex === -1) {\n\t\treturn [string];\n\t}\n\n\treturn [\n\t\tstring.slice(0, separatorIndex),\n\t\tstring.slice(separatorIndex + separator.length)\n\t];\n};\n","'use strict';\nmodule.exports = function (obj, predicate) {\n\tvar ret = {};\n\tvar keys = Object.keys(obj);\n\tvar isArr = Array.isArray(predicate);\n\n\tfor (var i = 0; i < keys.length; i++) {\n\t\tvar key = keys[i];\n\t\tvar val = obj[key];\n\n\t\tif (isArr ? predicate.indexOf(key) !== -1 : predicate(key, val, obj)) {\n\t\t\tret[key] = val;\n\t\t}\n\t}\n\n\treturn ret;\n};\n","// light library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index-light\");","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// browserify by default only pulls in files that are hard coded in requires\n// In order of last to first in this file, the default wordlist will be chosen\n// based on what is present. (Bundles may remove wordlists they don't need)\nconst wordlists = {};\nexports.wordlists = wordlists;\nlet _default;\nexports._default = _default;\ntry {\n exports._default = _default = require('./wordlists/czech.json');\n wordlists.czech = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/chinese_simplified.json');\n wordlists.chinese_simplified = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/chinese_traditional.json');\n wordlists.chinese_traditional = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/korean.json');\n wordlists.korean = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/french.json');\n wordlists.french = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/italian.json');\n wordlists.italian = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/spanish.json');\n wordlists.spanish = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/japanese.json');\n wordlists.japanese = _default;\n wordlists.JA = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/portuguese.json');\n wordlists.portuguese = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/english.json');\n wordlists.english = _default;\n wordlists.EN = _default;\n}\ncatch (err) { }\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n/**/\n\nvar Buffer = require('safe-buffer').Buffer;\n/**/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return '\\ufffd';\n }\n }\n }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","// full library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index\");\n","\"use strict\";\nvar protobuf = module.exports = require(\"./index-light\");\n\nprotobuf.build = \"full\";\n\n// Parser\nprotobuf.tokenize = require(\"./tokenize\");\nprotobuf.parse = require(\"./parse\");\nprotobuf.common = require(\"./common\");\n\n// Configure parser\nprotobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common);\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n if (!(this instanceof RIPEMD160))\n return new RIPEMD160();\n\n BlockHash.call(this);\n\n this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\n var A = this.h[0];\n var B = this.h[1];\n var C = this.h[2];\n var D = this.h[3];\n var E = this.h[4];\n var Ah = A;\n var Bh = B;\n var Ch = C;\n var Dh = D;\n var Eh = E;\n for (var j = 0; j < 80; j++) {\n var T = sum32(\n rotl32(\n sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n s[j]),\n E);\n A = E;\n E = D;\n D = rotl32(C, 10);\n C = B;\n B = T;\n T = sum32(\n rotl32(\n sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n sh[j]),\n Eh);\n Ah = Eh;\n Eh = Dh;\n Dh = rotl32(Ch, 10);\n Ch = Bh;\n Bh = T;\n }\n T = sum32_3(this.h[1], C, Dh);\n this.h[1] = sum32_3(this.h[2], D, Eh);\n this.h[2] = sum32_3(this.h[3], E, Ah);\n this.h[3] = sum32_3(this.h[4], A, Bh);\n this.h[4] = sum32_3(this.h[0], B, Ch);\n this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'little');\n else\n return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n if (j <= 15)\n return x ^ y ^ z;\n else if (j <= 31)\n return (x & y) | ((~x) & z);\n else if (j <= 47)\n return (x | (~y)) ^ z;\n else if (j <= 63)\n return (x & z) | (y & (~z));\n else\n return x ^ (y | (~z));\n}\n\nfunction K(j) {\n if (j <= 15)\n return 0x00000000;\n else if (j <= 31)\n return 0x5a827999;\n else if (j <= 47)\n return 0x6ed9eba1;\n else if (j <= 63)\n return 0x8f1bbcdc;\n else\n return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n if (j <= 15)\n return 0x50a28be6;\n else if (j <= 31)\n return 0x5c4dd124;\n else if (j <= 47)\n return 0x6d703ef3;\n else if (j <= 63)\n return 0x7a6d76e9;\n else\n return 0x00000000;\n}\n\nvar r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst createHash = require(\"create-hash\");\nconst pbkdf2_1 = require(\"pbkdf2\");\nconst randomBytes = require(\"randombytes\");\nconst _wordlists_1 = require(\"./_wordlists\");\nlet DEFAULT_WORDLIST = _wordlists_1._default;\nconst INVALID_MNEMONIC = 'Invalid mnemonic';\nconst INVALID_ENTROPY = 'Invalid entropy';\nconst INVALID_CHECKSUM = 'Invalid mnemonic checksum';\nconst WORDLIST_REQUIRED = 'A wordlist is required but a default could not be found.\\n' +\n 'Please pass a 2048 word array explicitly.';\nfunction pbkdf2Promise(password, saltMixin, iterations, keylen, digest) {\n return Promise.resolve().then(() => new Promise((resolve, reject) => {\n const callback = (err, derivedKey) => {\n if (err) {\n return reject(err);\n }\n else {\n return resolve(derivedKey);\n }\n };\n pbkdf2_1.pbkdf2(password, saltMixin, iterations, keylen, digest, callback);\n }));\n}\nfunction normalize(str) {\n return (str || '').normalize('NFKD');\n}\nfunction lpad(str, padString, length) {\n while (str.length < length) {\n str = padString + str;\n }\n return str;\n}\nfunction binaryToByte(bin) {\n return parseInt(bin, 2);\n}\nfunction bytesToBinary(bytes) {\n return bytes.map((x) => lpad(x.toString(2), '0', 8)).join('');\n}\nfunction deriveChecksumBits(entropyBuffer) {\n const ENT = entropyBuffer.length * 8;\n const CS = ENT / 32;\n const hash = createHash('sha256')\n .update(entropyBuffer)\n .digest();\n return bytesToBinary(Array.from(hash)).slice(0, CS);\n}\nfunction salt(password) {\n return 'mnemonic' + (password || '');\n}\nfunction mnemonicToSeedSync(mnemonic, password) {\n const mnemonicBuffer = Buffer.from(normalize(mnemonic), 'utf8');\n const saltBuffer = Buffer.from(salt(normalize(password)), 'utf8');\n return pbkdf2_1.pbkdf2Sync(mnemonicBuffer, saltBuffer, 2048, 64, 'sha512');\n}\nexports.mnemonicToSeedSync = mnemonicToSeedSync;\nfunction mnemonicToSeed(mnemonic, password) {\n return Promise.resolve().then(() => {\n const mnemonicBuffer = Buffer.from(normalize(mnemonic), 'utf8');\n const saltBuffer = Buffer.from(salt(normalize(password)), 'utf8');\n return pbkdf2Promise(mnemonicBuffer, saltBuffer, 2048, 64, 'sha512');\n });\n}\nexports.mnemonicToSeed = mnemonicToSeed;\nfunction mnemonicToEntropy(mnemonic, wordlist) {\n wordlist = wordlist || DEFAULT_WORDLIST;\n if (!wordlist) {\n throw new Error(WORDLIST_REQUIRED);\n }\n const words = normalize(mnemonic).split(' ');\n if (words.length % 3 !== 0) {\n throw new Error(INVALID_MNEMONIC);\n }\n // convert word indices to 11 bit binary strings\n const bits = words\n .map((word) => {\n const index = wordlist.indexOf(word);\n if (index === -1) {\n throw new Error(INVALID_MNEMONIC);\n }\n return lpad(index.toString(2), '0', 11);\n })\n .join('');\n // split the binary string into ENT/CS\n const dividerIndex = Math.floor(bits.length / 33) * 32;\n const entropyBits = bits.slice(0, dividerIndex);\n const checksumBits = bits.slice(dividerIndex);\n // calculate the checksum and compare\n const entropyBytes = entropyBits.match(/(.{1,8})/g).map(binaryToByte);\n if (entropyBytes.length < 16) {\n throw new Error(INVALID_ENTROPY);\n }\n if (entropyBytes.length > 32) {\n throw new Error(INVALID_ENTROPY);\n }\n if (entropyBytes.length % 4 !== 0) {\n throw new Error(INVALID_ENTROPY);\n }\n const entropy = Buffer.from(entropyBytes);\n const newChecksum = deriveChecksumBits(entropy);\n if (newChecksum !== checksumBits) {\n throw new Error(INVALID_CHECKSUM);\n }\n return entropy.toString('hex');\n}\nexports.mnemonicToEntropy = mnemonicToEntropy;\nfunction entropyToMnemonic(entropy, wordlist) {\n if (!Buffer.isBuffer(entropy)) {\n entropy = Buffer.from(entropy, 'hex');\n }\n wordlist = wordlist || DEFAULT_WORDLIST;\n if (!wordlist) {\n throw new Error(WORDLIST_REQUIRED);\n }\n // 128 <= ENT <= 256\n if (entropy.length < 16) {\n throw new TypeError(INVALID_ENTROPY);\n }\n if (entropy.length > 32) {\n throw new TypeError(INVALID_ENTROPY);\n }\n if (entropy.length % 4 !== 0) {\n throw new TypeError(INVALID_ENTROPY);\n }\n const entropyBits = bytesToBinary(Array.from(entropy));\n const checksumBits = deriveChecksumBits(entropy);\n const bits = entropyBits + checksumBits;\n const chunks = bits.match(/(.{1,11})/g);\n const words = chunks.map((binary) => {\n const index = binaryToByte(binary);\n return wordlist[index];\n });\n return wordlist[0] === '\\u3042\\u3044\\u3053\\u304f\\u3057\\u3093' // Japanese wordlist\n ? words.join('\\u3000')\n : words.join(' ');\n}\nexports.entropyToMnemonic = entropyToMnemonic;\nfunction generateMnemonic(strength, rng, wordlist) {\n strength = strength || 128;\n if (strength % 32 !== 0) {\n throw new TypeError(INVALID_ENTROPY);\n }\n rng = rng || randomBytes;\n return entropyToMnemonic(rng(strength / 8), wordlist);\n}\nexports.generateMnemonic = generateMnemonic;\nfunction validateMnemonic(mnemonic, wordlist) {\n try {\n mnemonicToEntropy(mnemonic, wordlist);\n }\n catch (e) {\n return false;\n }\n return true;\n}\nexports.validateMnemonic = validateMnemonic;\nfunction setDefaultWordlist(language) {\n const result = _wordlists_1.wordlists[language];\n if (result) {\n DEFAULT_WORDLIST = result;\n }\n else {\n throw new Error('Could not find wordlist for language \"' + language + '\"');\n }\n}\nexports.setDefaultWordlist = setDefaultWordlist;\nfunction getDefaultWordlist() {\n if (!DEFAULT_WORDLIST) {\n throw new Error('No Default Wordlist set');\n }\n return Object.keys(_wordlists_1.wordlists).filter((lang) => {\n if (lang === 'JA' || lang === 'EN') {\n return false;\n }\n return _wordlists_1.wordlists[lang].every((word, index) => word === DEFAULT_WORDLIST[index]);\n })[0];\n}\nexports.getDefaultWordlist = getDefaultWordlist;\nvar _wordlists_2 = require(\"./_wordlists\");\nexports.wordlists = _wordlists_2.wordlists;\n","var native = require('crypto')\n\nvar checkParameters = require('./lib/precondition')\nvar defaultEncoding = require('./lib/default-encoding')\nvar toBuffer = require('./lib/to-buffer')\n\nfunction nativePBKDF2 (password, salt, iterations, keylen, digest, callback) {\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n\n if (typeof digest === 'function') {\n callback = digest\n digest = 'sha1'\n }\n if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')\n\n return native.pbkdf2(password, salt, iterations, keylen, digest, callback)\n}\n\nfunction nativePBKDF2Sync (password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n digest = digest || 'sha1'\n return native.pbkdf2Sync(password, salt, iterations, keylen, digest)\n}\n\n/* istanbul ignore next */\nif (!native.pbkdf2Sync || native.pbkdf2Sync.toString().indexOf('keylen, digest') === -1) {\n exports.pbkdf2Sync = require('./lib/sync')\n exports.pbkdf2 = require('./lib/async')\n\n// native\n} else {\n exports.pbkdf2Sync = nativePBKDF2Sync\n exports.pbkdf2 = nativePBKDF2\n}\n","module.exports = require('crypto').createHmac\n","module.exports = require(\"assert\");","'use strict'\ntry {\n module.exports = require('./bindings')\n} catch (err) {\n if (process.env.DEBUG) {\n console.error('Secp256k1 bindings are not compiled. Pure JS implementation will be used.')\n }\n\n module.exports = require('./elliptic')\n}\n","'use strict'\nvar toString = Object.prototype.toString\n\n// TypeError\nexports.isArray = function (value, message) {\n if (!Array.isArray(value)) throw TypeError(message)\n}\n\nexports.isBoolean = function (value, message) {\n if (toString.call(value) !== '[object Boolean]') throw TypeError(message)\n}\n\nexports.isBuffer = function (value, message) {\n if (!Buffer.isBuffer(value)) throw TypeError(message)\n}\n\nexports.isFunction = function (value, message) {\n if (toString.call(value) !== '[object Function]') throw TypeError(message)\n}\n\nexports.isNumber = function (value, message) {\n if (toString.call(value) !== '[object Number]') throw TypeError(message)\n}\n\nexports.isObject = function (value, message) {\n if (toString.call(value) !== '[object Object]') throw TypeError(message)\n}\n\n// RangeError\nexports.isBufferLength = function (buffer, length, message) {\n if (buffer.length !== length) throw RangeError(message)\n}\n\nexports.isBufferLength2 = function (buffer, length1, length2, message) {\n if (buffer.length !== length1 && buffer.length !== length2) throw RangeError(message)\n}\n\nexports.isLengthGTZero = function (value, message) {\n if (value.length === 0) throw RangeError(message)\n}\n\nexports.isNumberInInterval = function (number, x, y, message) {\n if (number <= x || number >= y) throw RangeError(message)\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar bip66 = require('bip66')\n\nvar EC_PRIVKEY_EXPORT_DER_COMPRESSED = Buffer.from([\n // begin\n 0x30, 0x81, 0xd3, 0x02, 0x01, 0x01, 0x04, 0x20,\n // private key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n // middle\n 0xa0, 0x81, 0x85, 0x30, 0x81, 0x82, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48,\n 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04,\n 0x21, 0x02, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87,\n 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8,\n 0x17, 0x98, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E,\n 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x24, 0x03, 0x22, 0x00,\n // public key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00\n])\n\nvar EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED = Buffer.from([\n // begin\n 0x30, 0x82, 0x01, 0x13, 0x02, 0x01, 0x01, 0x04, 0x20,\n // private key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n // middle\n 0xa0, 0x81, 0xa5, 0x30, 0x81, 0xa2, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48,\n 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04,\n 0x41, 0x04, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87,\n 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8,\n 0x17, 0x98, 0x48, 0x3a, 0xda, 0x77, 0x26, 0xa3, 0xc4, 0x65, 0x5d, 0xa4, 0xfb, 0xfc, 0x0E, 0x11,\n 0x08, 0xa8, 0xfd, 0x17, 0xb4, 0x48, 0xa6, 0x85, 0x54, 0x19, 0x9c, 0x47, 0xd0, 0x8f, 0xfb, 0x10,\n 0xd4, 0xb8, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E,\n 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x44, 0x03, 0x42, 0x00,\n // public key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00\n])\n\nexports.privateKeyExport = function (privateKey, publicKey, compressed) {\n var result = Buffer.from(compressed ? EC_PRIVKEY_EXPORT_DER_COMPRESSED : EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED)\n privateKey.copy(result, compressed ? 8 : 9)\n publicKey.copy(result, compressed ? 181 : 214)\n return result\n}\n\nexports.privateKeyImport = function (privateKey) {\n var length = privateKey.length\n\n // sequence header\n var index = 0\n if (length < index + 1 || privateKey[index] !== 0x30) return\n index += 1\n\n // sequence length constructor\n if (length < index + 1 || !(privateKey[index] & 0x80)) return\n\n var lenb = privateKey[index] & 0x7f\n index += 1\n if (lenb < 1 || lenb > 2) return\n if (length < index + lenb) return\n\n // sequence length\n var len = privateKey[index + lenb - 1] | (lenb > 1 ? privateKey[index + lenb - 2] << 8 : 0)\n index += lenb\n if (length < index + len) return\n\n // sequence element 0: version number (=1)\n if (length < index + 3 ||\n privateKey[index] !== 0x02 ||\n privateKey[index + 1] !== 0x01 ||\n privateKey[index + 2] !== 0x01) {\n return\n }\n index += 3\n\n // sequence element 1: octet string, up to 32 bytes\n if (length < index + 2 ||\n privateKey[index] !== 0x04 ||\n privateKey[index + 1] > 0x20 ||\n length < index + 2 + privateKey[index + 1]) {\n return\n }\n\n return privateKey.slice(index + 2, index + 2 + privateKey[index + 1])\n}\n\nexports.signatureExport = function (sigObj) {\n var r = Buffer.concat([Buffer.from([0]), sigObj.r])\n for (var lenR = 33, posR = 0; lenR > 1 && r[posR] === 0x00 && !(r[posR + 1] & 0x80); --lenR, ++posR);\n\n var s = Buffer.concat([Buffer.from([0]), sigObj.s])\n for (var lenS = 33, posS = 0; lenS > 1 && s[posS] === 0x00 && !(s[posS + 1] & 0x80); --lenS, ++posS);\n\n return bip66.encode(r.slice(posR), s.slice(posS))\n}\n\nexports.signatureImport = function (sig) {\n var r = Buffer.alloc(32, 0)\n var s = Buffer.alloc(32, 0)\n\n try {\n var sigObj = bip66.decode(sig)\n if (sigObj.r.length === 33 && sigObj.r[0] === 0x00) sigObj.r = sigObj.r.slice(1)\n if (sigObj.r.length > 32) throw new Error('R length is too long')\n if (sigObj.s.length === 33 && sigObj.s[0] === 0x00) sigObj.s = sigObj.s.slice(1)\n if (sigObj.s.length > 32) throw new Error('S length is too long')\n } catch (err) {\n return\n }\n\n sigObj.r.copy(r, 32 - sigObj.r.length)\n sigObj.s.copy(s, 32 - sigObj.s.length)\n\n return { r: r, s: s }\n}\n\nexports.signatureImportLax = function (sig) {\n var r = Buffer.alloc(32, 0)\n var s = Buffer.alloc(32, 0)\n\n var length = sig.length\n var index = 0\n\n // sequence tag byte\n if (sig[index++] !== 0x30) return\n\n // sequence length byte\n var lenbyte = sig[index++]\n if (lenbyte & 0x80) {\n index += lenbyte - 0x80\n if (index > length) return\n }\n\n // sequence tag byte for r\n if (sig[index++] !== 0x02) return\n\n // length for r\n var rlen = sig[index++]\n if (rlen & 0x80) {\n lenbyte = rlen - 0x80\n if (index + lenbyte > length) return\n for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1);\n for (rlen = 0; lenbyte > 0; index += 1, lenbyte -= 1) rlen = (rlen << 8) + sig[index]\n }\n if (rlen > length - index) return\n var rindex = index\n index += rlen\n\n // sequence tag byte for s\n if (sig[index++] !== 0x02) return\n\n // length for s\n var slen = sig[index++]\n if (slen & 0x80) {\n lenbyte = slen - 0x80\n if (index + lenbyte > length) return\n for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1);\n for (slen = 0; lenbyte > 0; index += 1, lenbyte -= 1) slen = (slen << 8) + sig[index]\n }\n if (slen > length - index) return\n var sindex = index\n index += slen\n\n // ignore leading zeros in r\n for (; rlen > 0 && sig[rindex] === 0x00; rlen -= 1, rindex += 1);\n // copy r value\n if (rlen > 32) return\n var rvalue = sig.slice(rindex, rindex + rlen)\n rvalue.copy(r, 32 - rvalue.length)\n\n // ignore leading zeros in s\n for (; slen > 0 && sig[sindex] === 0x00; slen -= 1, sindex += 1);\n // copy s value\n if (slen > 32) return\n var svalue = sig.slice(sindex, sindex + slen)\n svalue.copy(s, 32 - svalue.length)\n\n return { r: r, s: s }\n}\n","var crypto = require('crypto')\n\nexports.createCipher = exports.Cipher = crypto.createCipher\nexports.createCipheriv = exports.Cipheriv = crypto.createCipheriv\nexports.createDecipher = exports.Decipher = crypto.createDecipher\nexports.createDecipheriv = exports.Decipheriv = crypto.createDecipheriv\nexports.listCiphers = exports.getCiphers = crypto.getCiphers\n","try {\n module.exports = require('./bindings')\n} catch (err) {\n module.exports = require('./js')\n}\n","module.exports = require(\"events\");","\n/**\n * For Node.js, simply re-export the core `util.deprecate` function.\n */\n\nmodule.exports = require('util').deprecate;\n","module.exports = require(\"os\");","const P1600_ROUND_CONSTANTS = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649, 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0, 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771, 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648, 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648]\n\nexports.p1600 = function (s) {\n for (let round = 0; round < 24; ++round) {\n // theta\n const lo0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40]\n const hi0 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41]\n const lo1 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42]\n const hi1 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43]\n const lo2 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44]\n const hi2 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45]\n const lo3 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46]\n const hi3 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47]\n const lo4 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48]\n const hi4 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49]\n\n let lo = lo4 ^ (lo1 << 1 | hi1 >>> 31)\n let hi = hi4 ^ (hi1 << 1 | lo1 >>> 31)\n const t1slo0 = s[0] ^ lo\n const t1shi0 = s[1] ^ hi\n const t1slo5 = s[10] ^ lo\n const t1shi5 = s[11] ^ hi\n const t1slo10 = s[20] ^ lo\n const t1shi10 = s[21] ^ hi\n const t1slo15 = s[30] ^ lo\n const t1shi15 = s[31] ^ hi\n const t1slo20 = s[40] ^ lo\n const t1shi20 = s[41] ^ hi\n lo = lo0 ^ (lo2 << 1 | hi2 >>> 31)\n hi = hi0 ^ (hi2 << 1 | lo2 >>> 31)\n const t1slo1 = s[2] ^ lo\n const t1shi1 = s[3] ^ hi\n const t1slo6 = s[12] ^ lo\n const t1shi6 = s[13] ^ hi\n const t1slo11 = s[22] ^ lo\n const t1shi11 = s[23] ^ hi\n const t1slo16 = s[32] ^ lo\n const t1shi16 = s[33] ^ hi\n const t1slo21 = s[42] ^ lo\n const t1shi21 = s[43] ^ hi\n lo = lo1 ^ (lo3 << 1 | hi3 >>> 31)\n hi = hi1 ^ (hi3 << 1 | lo3 >>> 31)\n const t1slo2 = s[4] ^ lo\n const t1shi2 = s[5] ^ hi\n const t1slo7 = s[14] ^ lo\n const t1shi7 = s[15] ^ hi\n const t1slo12 = s[24] ^ lo\n const t1shi12 = s[25] ^ hi\n const t1slo17 = s[34] ^ lo\n const t1shi17 = s[35] ^ hi\n const t1slo22 = s[44] ^ lo\n const t1shi22 = s[45] ^ hi\n lo = lo2 ^ (lo4 << 1 | hi4 >>> 31)\n hi = hi2 ^ (hi4 << 1 | lo4 >>> 31)\n const t1slo3 = s[6] ^ lo\n const t1shi3 = s[7] ^ hi\n const t1slo8 = s[16] ^ lo\n const t1shi8 = s[17] ^ hi\n const t1slo13 = s[26] ^ lo\n const t1shi13 = s[27] ^ hi\n const t1slo18 = s[36] ^ lo\n const t1shi18 = s[37] ^ hi\n const t1slo23 = s[46] ^ lo\n const t1shi23 = s[47] ^ hi\n lo = lo3 ^ (lo0 << 1 | hi0 >>> 31)\n hi = hi3 ^ (hi0 << 1 | lo0 >>> 31)\n const t1slo4 = s[8] ^ lo\n const t1shi4 = s[9] ^ hi\n const t1slo9 = s[18] ^ lo\n const t1shi9 = s[19] ^ hi\n const t1slo14 = s[28] ^ lo\n const t1shi14 = s[29] ^ hi\n const t1slo19 = s[38] ^ lo\n const t1shi19 = s[39] ^ hi\n const t1slo24 = s[48] ^ lo\n const t1shi24 = s[49] ^ hi\n\n // rho & pi\n const t2slo0 = t1slo0\n const t2shi0 = t1shi0\n const t2slo16 = (t1shi5 << 4 | t1slo5 >>> 28)\n const t2shi16 = (t1slo5 << 4 | t1shi5 >>> 28)\n const t2slo7 = (t1slo10 << 3 | t1shi10 >>> 29)\n const t2shi7 = (t1shi10 << 3 | t1slo10 >>> 29)\n const t2slo23 = (t1shi15 << 9 | t1slo15 >>> 23)\n const t2shi23 = (t1slo15 << 9 | t1shi15 >>> 23)\n const t2slo14 = (t1slo20 << 18 | t1shi20 >>> 14)\n const t2shi14 = (t1shi20 << 18 | t1slo20 >>> 14)\n const t2slo10 = (t1slo1 << 1 | t1shi1 >>> 31)\n const t2shi10 = (t1shi1 << 1 | t1slo1 >>> 31)\n const t2slo1 = (t1shi6 << 12 | t1slo6 >>> 20)\n const t2shi1 = (t1slo6 << 12 | t1shi6 >>> 20)\n const t2slo17 = (t1slo11 << 10 | t1shi11 >>> 22)\n const t2shi17 = (t1shi11 << 10 | t1slo11 >>> 22)\n const t2slo8 = (t1shi16 << 13 | t1slo16 >>> 19)\n const t2shi8 = (t1slo16 << 13 | t1shi16 >>> 19)\n const t2slo24 = (t1slo21 << 2 | t1shi21 >>> 30)\n const t2shi24 = (t1shi21 << 2 | t1slo21 >>> 30)\n const t2slo20 = (t1shi2 << 30 | t1slo2 >>> 2)\n const t2shi20 = (t1slo2 << 30 | t1shi2 >>> 2)\n const t2slo11 = (t1slo7 << 6 | t1shi7 >>> 26)\n const t2shi11 = (t1shi7 << 6 | t1slo7 >>> 26)\n const t2slo2 = (t1shi12 << 11 | t1slo12 >>> 21)\n const t2shi2 = (t1slo12 << 11 | t1shi12 >>> 21)\n const t2slo18 = (t1slo17 << 15 | t1shi17 >>> 17)\n const t2shi18 = (t1shi17 << 15 | t1slo17 >>> 17)\n const t2slo9 = (t1shi22 << 29 | t1slo22 >>> 3)\n const t2shi9 = (t1slo22 << 29 | t1shi22 >>> 3)\n const t2slo5 = (t1slo3 << 28 | t1shi3 >>> 4)\n const t2shi5 = (t1shi3 << 28 | t1slo3 >>> 4)\n const t2slo21 = (t1shi8 << 23 | t1slo8 >>> 9)\n const t2shi21 = (t1slo8 << 23 | t1shi8 >>> 9)\n const t2slo12 = (t1slo13 << 25 | t1shi13 >>> 7)\n const t2shi12 = (t1shi13 << 25 | t1slo13 >>> 7)\n const t2slo3 = (t1slo18 << 21 | t1shi18 >>> 11)\n const t2shi3 = (t1shi18 << 21 | t1slo18 >>> 11)\n const t2slo19 = (t1shi23 << 24 | t1slo23 >>> 8)\n const t2shi19 = (t1slo23 << 24 | t1shi23 >>> 8)\n const t2slo15 = (t1slo4 << 27 | t1shi4 >>> 5)\n const t2shi15 = (t1shi4 << 27 | t1slo4 >>> 5)\n const t2slo6 = (t1slo9 << 20 | t1shi9 >>> 12)\n const t2shi6 = (t1shi9 << 20 | t1slo9 >>> 12)\n const t2slo22 = (t1shi14 << 7 | t1slo14 >>> 25)\n const t2shi22 = (t1slo14 << 7 | t1shi14 >>> 25)\n const t2slo13 = (t1slo19 << 8 | t1shi19 >>> 24)\n const t2shi13 = (t1shi19 << 8 | t1slo19 >>> 24)\n const t2slo4 = (t1slo24 << 14 | t1shi24 >>> 18)\n const t2shi4 = (t1shi24 << 14 | t1slo24 >>> 18)\n\n // chi\n s[0] = t2slo0 ^ (~t2slo1 & t2slo2)\n s[1] = t2shi0 ^ (~t2shi1 & t2shi2)\n s[10] = t2slo5 ^ (~t2slo6 & t2slo7)\n s[11] = t2shi5 ^ (~t2shi6 & t2shi7)\n s[20] = t2slo10 ^ (~t2slo11 & t2slo12)\n s[21] = t2shi10 ^ (~t2shi11 & t2shi12)\n s[30] = t2slo15 ^ (~t2slo16 & t2slo17)\n s[31] = t2shi15 ^ (~t2shi16 & t2shi17)\n s[40] = t2slo20 ^ (~t2slo21 & t2slo22)\n s[41] = t2shi20 ^ (~t2shi21 & t2shi22)\n s[2] = t2slo1 ^ (~t2slo2 & t2slo3)\n s[3] = t2shi1 ^ (~t2shi2 & t2shi3)\n s[12] = t2slo6 ^ (~t2slo7 & t2slo8)\n s[13] = t2shi6 ^ (~t2shi7 & t2shi8)\n s[22] = t2slo11 ^ (~t2slo12 & t2slo13)\n s[23] = t2shi11 ^ (~t2shi12 & t2shi13)\n s[32] = t2slo16 ^ (~t2slo17 & t2slo18)\n s[33] = t2shi16 ^ (~t2shi17 & t2shi18)\n s[42] = t2slo21 ^ (~t2slo22 & t2slo23)\n s[43] = t2shi21 ^ (~t2shi22 & t2shi23)\n s[4] = t2slo2 ^ (~t2slo3 & t2slo4)\n s[5] = t2shi2 ^ (~t2shi3 & t2shi4)\n s[14] = t2slo7 ^ (~t2slo8 & t2slo9)\n s[15] = t2shi7 ^ (~t2shi8 & t2shi9)\n s[24] = t2slo12 ^ (~t2slo13 & t2slo14)\n s[25] = t2shi12 ^ (~t2shi13 & t2shi14)\n s[34] = t2slo17 ^ (~t2slo18 & t2slo19)\n s[35] = t2shi17 ^ (~t2shi18 & t2shi19)\n s[44] = t2slo22 ^ (~t2slo23 & t2slo24)\n s[45] = t2shi22 ^ (~t2shi23 & t2shi24)\n s[6] = t2slo3 ^ (~t2slo4 & t2slo0)\n s[7] = t2shi3 ^ (~t2shi4 & t2shi0)\n s[16] = t2slo8 ^ (~t2slo9 & t2slo5)\n s[17] = t2shi8 ^ (~t2shi9 & t2shi5)\n s[26] = t2slo13 ^ (~t2slo14 & t2slo10)\n s[27] = t2shi13 ^ (~t2shi14 & t2shi10)\n s[36] = t2slo18 ^ (~t2slo19 & t2slo15)\n s[37] = t2shi18 ^ (~t2shi19 & t2shi15)\n s[46] = t2slo23 ^ (~t2slo24 & t2slo20)\n s[47] = t2shi23 ^ (~t2shi24 & t2shi20)\n s[8] = t2slo4 ^ (~t2slo0 & t2slo1)\n s[9] = t2shi4 ^ (~t2shi0 & t2shi1)\n s[18] = t2slo9 ^ (~t2slo5 & t2slo6)\n s[19] = t2shi9 ^ (~t2shi5 & t2shi6)\n s[28] = t2slo14 ^ (~t2slo10 & t2slo11)\n s[29] = t2shi14 ^ (~t2shi10 & t2shi11)\n s[38] = t2slo19 ^ (~t2slo15 & t2slo16)\n s[39] = t2shi19 ^ (~t2shi15 & t2shi16)\n s[48] = t2slo24 ^ (~t2slo20 & t2slo21)\n s[49] = t2shi24 ^ (~t2shi20 & t2shi21)\n\n // iota\n s[0] ^= P1600_ROUND_CONSTANTS[round * 2]\n s[1] ^= P1600_ROUND_CONSTANTS[round * 2 + 1]\n }\n}\n","/**\n * Wrapper for built-in http.js to emulate the browser XMLHttpRequest object.\n *\n * This can be used with JS designed for browsers to improve reuse of code and\n * allow the use of existing libraries.\n *\n * Usage: include(\"XMLHttpRequest.js\") and use XMLHttpRequest per W3C specs.\n *\n * @author Dan DeFelippi \n * @contributor David Ellis \n * @license MIT\n */\n\nvar Url = require(\"url\");\nvar spawn = require(\"child_process\").spawn;\nvar fs = require(\"fs\");\n\nexports.XMLHttpRequest = function() {\n \"use strict\";\n\n /**\n * Private variables\n */\n var self = this;\n var http = require(\"http\");\n var https = require(\"https\");\n\n // Holds http.js objects\n var request;\n var response;\n\n // Request settings\n var settings = {};\n\n // Disable header blacklist.\n // Not part of XHR specs.\n var disableHeaderCheck = false;\n\n // Set some default headers\n var defaultHeaders = {\n \"User-Agent\": \"node-XMLHttpRequest\",\n \"Accept\": \"*/*\",\n };\n\n var headers = {};\n var headersCase = {};\n\n // These headers are not user setable.\n // The following are allowed but banned in the spec:\n // * user-agent\n var forbiddenRequestHeaders = [\n \"accept-charset\",\n \"accept-encoding\",\n \"access-control-request-headers\",\n \"access-control-request-method\",\n \"connection\",\n \"content-length\",\n \"content-transfer-encoding\",\n \"cookie\",\n \"cookie2\",\n \"date\",\n \"expect\",\n \"host\",\n \"keep-alive\",\n \"origin\",\n \"referer\",\n \"te\",\n \"trailer\",\n \"transfer-encoding\",\n \"upgrade\",\n \"via\"\n ];\n\n // These request methods are not allowed\n var forbiddenRequestMethods = [\n \"TRACE\",\n \"TRACK\",\n \"CONNECT\"\n ];\n\n // Send flag\n var sendFlag = false;\n // Error flag, used when errors occur or abort is called\n var errorFlag = false;\n\n // Event listeners\n var listeners = {};\n\n /**\n * Constants\n */\n\n this.UNSENT = 0;\n this.OPENED = 1;\n this.HEADERS_RECEIVED = 2;\n this.LOADING = 3;\n this.DONE = 4;\n\n /**\n * Public vars\n */\n\n // Current state\n this.readyState = this.UNSENT;\n\n // default ready state change handler in case one is not set or is set late\n this.onreadystatechange = null;\n\n // Result & response\n this.responseText = \"\";\n this.responseXML = \"\";\n this.status = null;\n this.statusText = null;\n \n // Whether cross-site Access-Control requests should be made using\n // credentials such as cookies or authorization headers\n this.withCredentials = false;\n\n /**\n * Private methods\n */\n\n /**\n * Check if the specified header is allowed.\n *\n * @param string header Header to validate\n * @return boolean False if not allowed, otherwise true\n */\n var isAllowedHttpHeader = function(header) {\n return disableHeaderCheck || (header && forbiddenRequestHeaders.indexOf(header.toLowerCase()) === -1);\n };\n\n /**\n * Check if the specified method is allowed.\n *\n * @param string method Request method to validate\n * @return boolean False if not allowed, otherwise true\n */\n var isAllowedHttpMethod = function(method) {\n return (method && forbiddenRequestMethods.indexOf(method) === -1);\n };\n\n /**\n * Public methods\n */\n\n /**\n * Open the connection. Currently supports local server requests.\n *\n * @param string method Connection method (eg GET, POST)\n * @param string url URL for the connection.\n * @param boolean async Asynchronous connection. Default is true.\n * @param string user Username for basic authentication (optional)\n * @param string password Password for basic authentication (optional)\n */\n this.open = function(method, url, async, user, password) {\n this.abort();\n errorFlag = false;\n\n // Check for valid request method\n if (!isAllowedHttpMethod(method)) {\n throw new Error(\"SecurityError: Request method not allowed\");\n }\n\n settings = {\n \"method\": method,\n \"url\": url.toString(),\n \"async\": (typeof async !== \"boolean\" ? true : async),\n \"user\": user || null,\n \"password\": password || null\n };\n\n setState(this.OPENED);\n };\n\n /**\n * Disables or enables isAllowedHttpHeader() check the request. Enabled by default.\n * This does not conform to the W3C spec.\n *\n * @param boolean state Enable or disable header checking.\n */\n this.setDisableHeaderCheck = function(state) {\n disableHeaderCheck = state;\n };\n\n /**\n * Sets a header for the request or appends the value if one is already set.\n *\n * @param string header Header name\n * @param string value Header value\n */\n this.setRequestHeader = function(header, value) {\n if (this.readyState !== this.OPENED) {\n throw new Error(\"INVALID_STATE_ERR: setRequestHeader can only be called when state is OPEN\");\n }\n if (!isAllowedHttpHeader(header)) {\n console.warn(\"Refused to set unsafe header \\\"\" + header + \"\\\"\");\n return;\n }\n if (sendFlag) {\n throw new Error(\"INVALID_STATE_ERR: send flag is true\");\n }\n header = headersCase[header.toLowerCase()] || header;\n headersCase[header.toLowerCase()] = header;\n headers[header] = headers[header] ? headers[header] + ', ' + value : value;\n };\n\n /**\n * Gets a header from the server response.\n *\n * @param string header Name of header to get.\n * @return string Text of the header or null if it doesn't exist.\n */\n this.getResponseHeader = function(header) {\n if (typeof header === \"string\"\n && this.readyState > this.OPENED\n && response\n && response.headers\n && response.headers[header.toLowerCase()]\n && !errorFlag\n ) {\n return response.headers[header.toLowerCase()];\n }\n\n return null;\n };\n\n /**\n * Gets all the response headers.\n *\n * @return string A string with all response headers separated by CR+LF\n */\n this.getAllResponseHeaders = function() {\n if (this.readyState < this.HEADERS_RECEIVED || errorFlag) {\n return \"\";\n }\n var result = \"\";\n\n for (var i in response.headers) {\n // Cookie headers are excluded\n if (i !== \"set-cookie\" && i !== \"set-cookie2\") {\n result += i + \": \" + response.headers[i] + \"\\r\\n\";\n }\n }\n return result.substr(0, result.length - 2);\n };\n\n /**\n * Gets a request header\n *\n * @param string name Name of header to get\n * @return string Returns the request header or empty string if not set\n */\n this.getRequestHeader = function(name) {\n if (typeof name === \"string\" && headersCase[name.toLowerCase()]) {\n return headers[headersCase[name.toLowerCase()]];\n }\n\n return \"\";\n };\n\n /**\n * Sends the request to the server.\n *\n * @param string data Optional data to send as request body.\n */\n this.send = function(data) {\n if (this.readyState !== this.OPENED) {\n throw new Error(\"INVALID_STATE_ERR: connection must be opened before send() is called\");\n }\n\n if (sendFlag) {\n throw new Error(\"INVALID_STATE_ERR: send has already been called\");\n }\n\n var ssl = false, local = false;\n var url = Url.parse(settings.url);\n var host;\n // Determine the server\n switch (url.protocol) {\n case \"https:\":\n ssl = true;\n // SSL & non-SSL both need host, no break here.\n case \"http:\":\n host = url.hostname;\n break;\n\n case \"file:\":\n local = true;\n break;\n\n case undefined:\n case null:\n case \"\":\n host = \"localhost\";\n break;\n\n default:\n throw new Error(\"Protocol not supported.\");\n }\n\n // Load files off the local filesystem (file://)\n if (local) {\n if (settings.method !== \"GET\") {\n throw new Error(\"XMLHttpRequest: Only GET method is supported\");\n }\n\n if (settings.async) {\n fs.readFile(url.pathname, \"utf8\", function(error, data) {\n if (error) {\n self.handleError(error);\n } else {\n self.status = 200;\n self.responseText = data;\n setState(self.DONE);\n }\n });\n } else {\n try {\n this.responseText = fs.readFileSync(url.pathname, \"utf8\");\n this.status = 200;\n setState(self.DONE);\n } catch(e) {\n this.handleError(e);\n }\n }\n\n return;\n }\n\n // Default to port 80. If accessing localhost on another port be sure\n // to use http://localhost:port/path\n var port = url.port || (ssl ? 443 : 80);\n // Add query string if one is used\n var uri = url.pathname + (url.search ? url.search : \"\");\n\n // Set the defaults if they haven't been set\n for (var name in defaultHeaders) {\n if (!headersCase[name.toLowerCase()]) {\n headers[name] = defaultHeaders[name];\n }\n }\n\n // Set the Host header or the server may reject the request\n headers.Host = host;\n if (!((ssl && port === 443) || port === 80)) {\n headers.Host += \":\" + url.port;\n }\n\n // Set Basic Auth if necessary\n if (settings.user) {\n if (typeof settings.password === \"undefined\") {\n settings.password = \"\";\n }\n var authBuf = new Buffer(settings.user + \":\" + settings.password);\n headers.Authorization = \"Basic \" + authBuf.toString(\"base64\");\n }\n\n // Set content length header\n if (settings.method === \"GET\" || settings.method === \"HEAD\") {\n data = null;\n } else if (data) {\n headers[\"Content-Length\"] = Buffer.isBuffer(data) ? data.length : Buffer.byteLength(data);\n\n if (!headers[\"Content-Type\"]) {\n headers[\"Content-Type\"] = \"text/plain;charset=UTF-8\";\n }\n } else if (settings.method === \"POST\") {\n // For a post with no data set Content-Length: 0.\n // This is required by buggy servers that don't meet the specs.\n headers[\"Content-Length\"] = 0;\n }\n\n var options = {\n host: host,\n port: port,\n path: uri,\n method: settings.method,\n headers: headers,\n agent: false,\n withCredentials: self.withCredentials\n };\n\n // Reset error flag\n errorFlag = false;\n\n // Handle async requests\n if (settings.async) {\n // Use the proper protocol\n var doRequest = ssl ? https.request : http.request;\n\n // Request is being sent, set send flag\n sendFlag = true;\n\n // As per spec, this is called here for historical reasons.\n self.dispatchEvent(\"readystatechange\");\n\n // Handler for the response\n var responseHandler = function responseHandler(resp) {\n // Set response var to the response we got back\n // This is so it remains accessable outside this scope\n response = resp;\n // Check for redirect\n // @TODO Prevent looped redirects\n if (response.statusCode === 301 || response.statusCode === 302 || response.statusCode === 303 || response.statusCode === 307) {\n // Change URL to the redirect location\n settings.url = response.headers.location;\n var url = Url.parse(settings.url);\n // Set host var in case it's used later\n host = url.hostname;\n // Options for the new request\n var newOptions = {\n hostname: url.hostname,\n port: url.port,\n path: url.path,\n method: response.statusCode === 303 ? \"GET\" : settings.method,\n headers: headers,\n withCredentials: self.withCredentials\n };\n\n // Issue the new request\n request = doRequest(newOptions, responseHandler).on(\"error\", errorHandler);\n request.end();\n // @TODO Check if an XHR event needs to be fired here\n return;\n }\n\n response.setEncoding(\"utf8\");\n\n setState(self.HEADERS_RECEIVED);\n self.status = response.statusCode;\n\n response.on(\"data\", function(chunk) {\n // Make sure there's some data\n if (chunk) {\n self.responseText += chunk;\n }\n // Don't emit state changes if the connection has been aborted.\n if (sendFlag) {\n setState(self.LOADING);\n }\n });\n\n response.on(\"end\", function() {\n if (sendFlag) {\n // Discard the end event if the connection has been aborted\n setState(self.DONE);\n sendFlag = false;\n }\n });\n\n response.on(\"error\", function(error) {\n self.handleError(error);\n });\n };\n\n // Error handler for the request\n var errorHandler = function errorHandler(error) {\n self.handleError(error);\n };\n\n // Create the request\n request = doRequest(options, responseHandler).on(\"error\", errorHandler);\n\n // Node 0.4 and later won't accept empty data. Make sure it's needed.\n if (data) {\n request.write(data);\n }\n\n request.end();\n\n self.dispatchEvent(\"loadstart\");\n } else { // Synchronous\n // Create a temporary file for communication with the other Node process\n var contentFile = \".node-xmlhttprequest-content-\" + process.pid;\n var syncFile = \".node-xmlhttprequest-sync-\" + process.pid;\n fs.writeFileSync(syncFile, \"\", \"utf8\");\n // The async request the other Node process executes\n var execString = \"var http = require('http'), https = require('https'), fs = require('fs');\"\n + \"var doRequest = http\" + (ssl ? \"s\" : \"\") + \".request;\"\n + \"var options = \" + JSON.stringify(options) + \";\"\n + \"var responseText = '';\"\n + \"var req = doRequest(options, function(response) {\"\n + \"response.setEncoding('utf8');\"\n + \"response.on('data', function(chunk) {\"\n + \" responseText += chunk;\"\n + \"});\"\n + \"response.on('end', function() {\"\n + \"fs.writeFileSync('\" + contentFile + \"', JSON.stringify({err: null, data: {statusCode: response.statusCode, headers: response.headers, text: responseText}}), 'utf8');\"\n + \"fs.unlinkSync('\" + syncFile + \"');\"\n + \"});\"\n + \"response.on('error', function(error) {\"\n + \"fs.writeFileSync('\" + contentFile + \"', JSON.stringify({err: error}), 'utf8');\"\n + \"fs.unlinkSync('\" + syncFile + \"');\"\n + \"});\"\n + \"}).on('error', function(error) {\"\n + \"fs.writeFileSync('\" + contentFile + \"', JSON.stringify({err: error}), 'utf8');\"\n + \"fs.unlinkSync('\" + syncFile + \"');\"\n + \"});\"\n + (data ? \"req.write('\" + JSON.stringify(data).slice(1,-1).replace(/'/g, \"\\\\'\") + \"');\":\"\")\n + \"req.end();\";\n // Start the other Node Process, executing this string\n var syncProc = spawn(process.argv[0], [\"-e\", execString]);\n while(fs.existsSync(syncFile)) {\n // Wait while the sync file is empty\n }\n var resp = JSON.parse(fs.readFileSync(contentFile, 'utf8'));\n // Kill the child process once the file has data\n syncProc.stdin.end();\n // Remove the temporary file\n fs.unlinkSync(contentFile);\n\n if (resp.err) {\n self.handleError(resp.err);\n } else {\n response = resp.data;\n self.status = resp.data.statusCode;\n self.responseText = resp.data.text;\n setState(self.DONE);\n }\n }\n };\n\n /**\n * Called when an error is encountered to deal with it.\n */\n this.handleError = function(error) {\n this.status = 0;\n this.statusText = error;\n this.responseText = error.stack;\n errorFlag = true;\n setState(this.DONE);\n this.dispatchEvent('error');\n };\n\n /**\n * Aborts a request.\n */\n this.abort = function() {\n if (request) {\n request.abort();\n request = null;\n }\n\n headers = defaultHeaders;\n this.status = 0;\n this.responseText = \"\";\n this.responseXML = \"\";\n\n errorFlag = true;\n\n if (this.readyState !== this.UNSENT\n && (this.readyState !== this.OPENED || sendFlag)\n && this.readyState !== this.DONE) {\n sendFlag = false;\n setState(this.DONE);\n }\n this.readyState = this.UNSENT;\n this.dispatchEvent('abort');\n };\n\n /**\n * Adds an event listener. Preferred method of binding to events.\n */\n this.addEventListener = function(event, callback) {\n if (!(event in listeners)) {\n listeners[event] = [];\n }\n // Currently allows duplicate callbacks. Should it?\n listeners[event].push(callback);\n };\n\n /**\n * Remove an event callback that has already been bound.\n * Only works on the matching funciton, cannot be a copy.\n */\n this.removeEventListener = function(event, callback) {\n if (event in listeners) {\n // Filter will return a new array with the callback removed\n listeners[event] = listeners[event].filter(function(ev) {\n return ev !== callback;\n });\n }\n };\n\n /**\n * Dispatch any events, including both \"on\" methods and events attached using addEventListener.\n */\n this.dispatchEvent = function(event) {\n if (typeof self[\"on\" + event] === \"function\") {\n self[\"on\" + event]();\n }\n if (event in listeners) {\n for (var i = 0, len = listeners[event].length; i < len; i++) {\n listeners[event][i].call(self);\n }\n }\n };\n\n /**\n * Changes readyState and calls onreadystatechange.\n *\n * @param int state New state\n */\n var setState = function(state) {\n if (state == self.LOADING || self.readyState !== state) {\n self.readyState = state;\n\n if (settings.async || self.readyState < self.OPENED || self.readyState === self.DONE) {\n self.dispatchEvent(\"readystatechange\");\n }\n\n if (self.readyState === self.DONE && !errorFlag) {\n self.dispatchEvent(\"load\");\n // @TODO figure out InspectorInstrumentation::didLoadXHR(cookie)\n self.dispatchEvent(\"loadend\");\n }\n }\n };\n};\n","module.exports = require(\"url\");","module.exports = require(\"child_process\");","module.exports = require(\"http\");","module.exports = require(\"https\");","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n __assign = Object.assign || function __assign(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n }\n return t;\n }\n return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n var t = {};\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n t[p] = s[p];\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n t[p[i]] = s[p[i]];\n }\n return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n var _, done = false;\n for (var i = decorators.length - 1; i >= 0; i--) {\n var context = {};\n for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n if (kind === \"accessor\") {\n if (result === void 0) continue;\n if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n if (_ = accept(result.get)) descriptor.get = _;\n if (_ = accept(result.set)) descriptor.set = _;\n if (_ = accept(result.init)) initializers.unshift(_);\n }\n else if (_ = accept(result)) {\n if (kind === \"field\") initializers.unshift(_);\n else descriptor[key] = _;\n }\n }\n if (target) Object.defineProperty(target, contextIn.name, descriptor);\n done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n var useValue = arguments.length > 2;\n for (var i = 0; i < initializers.length; i++) {\n value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n }\n return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n}\n\nexport function __generator(thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n for (var ar = [], i = 0; i < arguments.length; i++)\n ar = ar.concat(__read(arguments[i]));\n return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n r[k] = a[j];\n return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n function fulfill(value) { resume(\"next\", value); }\n function reject(value) { resume(\"throw\", value); }\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n var i, p;\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var m = o[Symbol.asyncIterator], i;\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n __setModuleDefault(result, mod);\n return result;\n}\n\nexport function __importDefault(mod) {\n return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n if (value !== null && value !== void 0) {\n if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n var dispose;\n if (async) {\n if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n dispose = value[Symbol.asyncDispose];\n }\n if (dispose === void 0) {\n if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n dispose = value[Symbol.dispose];\n }\n if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n env.stack.push({ value: value, dispose: dispose, async: async });\n }\n else if (async) {\n env.stack.push({ async: true });\n }\n return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n var e = new Error(message);\n return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n function fail(e) {\n env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n env.hasError = true;\n }\n function next() {\n while (env.stack.length) {\n var rec = env.stack.pop();\n try {\n var result = rec.dispose && rec.dispose.call(rec.value);\n if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n }\n catch (e) {\n fail(e);\n }\n }\n if (env.hasError) throw env.error;\n }\n return next();\n}\n\nexport default {\n __extends,\n __assign,\n __rest,\n __decorate,\n __param,\n __metadata,\n __awaiter,\n __generator,\n __createBinding,\n __exportStar,\n __values,\n __read,\n __spread,\n __spreadArrays,\n __spreadArray,\n __await,\n __asyncGenerator,\n __asyncDelegator,\n __asyncValues,\n __makeTemplateObject,\n __importStar,\n __importDefault,\n __classPrivateFieldGet,\n __classPrivateFieldSet,\n __classPrivateFieldIn,\n __addDisposableResource,\n __disposeResources,\n};\n","/**\n * @internal\n */\nexport var BLOCK_SIZE = 64;\n/**\n * @internal\n */\nexport var DIGEST_LENGTH = 32;\n/**\n * @internal\n */\nexport var KEY = new Uint32Array([\n 0x428a2f98,\n 0x71374491,\n 0xb5c0fbcf,\n 0xe9b5dba5,\n 0x3956c25b,\n 0x59f111f1,\n 0x923f82a4,\n 0xab1c5ed5,\n 0xd807aa98,\n 0x12835b01,\n 0x243185be,\n 0x550c7dc3,\n 0x72be5d74,\n 0x80deb1fe,\n 0x9bdc06a7,\n 0xc19bf174,\n 0xe49b69c1,\n 0xefbe4786,\n 0x0fc19dc6,\n 0x240ca1cc,\n 0x2de92c6f,\n 0x4a7484aa,\n 0x5cb0a9dc,\n 0x76f988da,\n 0x983e5152,\n 0xa831c66d,\n 0xb00327c8,\n 0xbf597fc7,\n 0xc6e00bf3,\n 0xd5a79147,\n 0x06ca6351,\n 0x14292967,\n 0x27b70a85,\n 0x2e1b2138,\n 0x4d2c6dfc,\n 0x53380d13,\n 0x650a7354,\n 0x766a0abb,\n 0x81c2c92e,\n 0x92722c85,\n 0xa2bfe8a1,\n 0xa81a664b,\n 0xc24b8b70,\n 0xc76c51a3,\n 0xd192e819,\n 0xd6990624,\n 0xf40e3585,\n 0x106aa070,\n 0x19a4c116,\n 0x1e376c08,\n 0x2748774c,\n 0x34b0bcb5,\n 0x391c0cb3,\n 0x4ed8aa4a,\n 0x5b9cca4f,\n 0x682e6ff3,\n 0x748f82ee,\n 0x78a5636f,\n 0x84c87814,\n 0x8cc70208,\n 0x90befffa,\n 0xa4506ceb,\n 0xbef9a3f7,\n 0xc67178f2\n]);\n/**\n * @internal\n */\nexport var INIT = [\n 0x6a09e667,\n 0xbb67ae85,\n 0x3c6ef372,\n 0xa54ff53a,\n 0x510e527f,\n 0x9b05688c,\n 0x1f83d9ab,\n 0x5be0cd19\n];\n/**\n * @internal\n */\nexport var MAX_HASHABLE_LENGTH = Math.pow(2, 53) - 1;\n//# sourceMappingURL=constants.js.map","import { BLOCK_SIZE, DIGEST_LENGTH, INIT, KEY, MAX_HASHABLE_LENGTH } from \"./constants\";\n/**\n * @internal\n */\nvar RawSha256 = /** @class */ (function () {\n function RawSha256() {\n this.state = Int32Array.from(INIT);\n this.temp = new Int32Array(64);\n this.buffer = new Uint8Array(64);\n this.bufferLength = 0;\n this.bytesHashed = 0;\n /**\n * @internal\n */\n this.finished = false;\n }\n RawSha256.prototype.update = function (data) {\n if (this.finished) {\n throw new Error(\"Attempted to update an already finished hash.\");\n }\n var position = 0;\n var byteLength = data.byteLength;\n this.bytesHashed += byteLength;\n if (this.bytesHashed * 8 > MAX_HASHABLE_LENGTH) {\n throw new Error(\"Cannot hash more than 2^53 - 1 bits\");\n }\n while (byteLength > 0) {\n this.buffer[this.bufferLength++] = data[position++];\n byteLength--;\n if (this.bufferLength === BLOCK_SIZE) {\n this.hashBuffer();\n this.bufferLength = 0;\n }\n }\n };\n RawSha256.prototype.digest = function () {\n if (!this.finished) {\n var bitsHashed = this.bytesHashed * 8;\n var bufferView = new DataView(this.buffer.buffer, this.buffer.byteOffset, this.buffer.byteLength);\n var undecoratedLength = this.bufferLength;\n bufferView.setUint8(this.bufferLength++, 0x80);\n // Ensure the final block has enough room for the hashed length\n if (undecoratedLength % BLOCK_SIZE >= BLOCK_SIZE - 8) {\n for (var i = this.bufferLength; i < BLOCK_SIZE; i++) {\n bufferView.setUint8(i, 0);\n }\n this.hashBuffer();\n this.bufferLength = 0;\n }\n for (var i = this.bufferLength; i < BLOCK_SIZE - 8; i++) {\n bufferView.setUint8(i, 0);\n }\n bufferView.setUint32(BLOCK_SIZE - 8, Math.floor(bitsHashed / 0x100000000), true);\n bufferView.setUint32(BLOCK_SIZE - 4, bitsHashed);\n this.hashBuffer();\n this.finished = true;\n }\n // The value in state is little-endian rather than big-endian, so flip\n // each word into a new Uint8Array\n var out = new Uint8Array(DIGEST_LENGTH);\n for (var i = 0; i < 8; i++) {\n out[i * 4] = (this.state[i] >>> 24) & 0xff;\n out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;\n out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;\n out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;\n }\n return out;\n };\n RawSha256.prototype.hashBuffer = function () {\n var _a = this, buffer = _a.buffer, state = _a.state;\n var state0 = state[0], state1 = state[1], state2 = state[2], state3 = state[3], state4 = state[4], state5 = state[5], state6 = state[6], state7 = state[7];\n for (var i = 0; i < BLOCK_SIZE; i++) {\n if (i < 16) {\n this.temp[i] =\n ((buffer[i * 4] & 0xff) << 24) |\n ((buffer[i * 4 + 1] & 0xff) << 16) |\n ((buffer[i * 4 + 2] & 0xff) << 8) |\n (buffer[i * 4 + 3] & 0xff);\n }\n else {\n var u = this.temp[i - 2];\n var t1_1 = ((u >>> 17) | (u << 15)) ^ ((u >>> 19) | (u << 13)) ^ (u >>> 10);\n u = this.temp[i - 15];\n var t2_1 = ((u >>> 7) | (u << 25)) ^ ((u >>> 18) | (u << 14)) ^ (u >>> 3);\n this.temp[i] =\n ((t1_1 + this.temp[i - 7]) | 0) + ((t2_1 + this.temp[i - 16]) | 0);\n }\n var t1 = ((((((state4 >>> 6) | (state4 << 26)) ^\n ((state4 >>> 11) | (state4 << 21)) ^\n ((state4 >>> 25) | (state4 << 7))) +\n ((state4 & state5) ^ (~state4 & state6))) |\n 0) +\n ((state7 + ((KEY[i] + this.temp[i]) | 0)) | 0)) |\n 0;\n var t2 = ((((state0 >>> 2) | (state0 << 30)) ^\n ((state0 >>> 13) | (state0 << 19)) ^\n ((state0 >>> 22) | (state0 << 10))) +\n ((state0 & state1) ^ (state0 & state2) ^ (state1 & state2))) |\n 0;\n state7 = state6;\n state6 = state5;\n state5 = state4;\n state4 = (state3 + t1) | 0;\n state3 = state2;\n state2 = state1;\n state1 = state0;\n state0 = (t1 + t2) | 0;\n }\n state[0] += state0;\n state[1] += state1;\n state[2] += state2;\n state[3] += state3;\n state[4] += state4;\n state[5] += state5;\n state[6] += state6;\n state[7] += state7;\n };\n return RawSha256;\n}());\nexport { RawSha256 };\n//# sourceMappingURL=RawSha256.js.map","import { isArrayBuffer } from \"@smithy/is-array-buffer\";\nimport { Buffer } from \"buffer\";\nexport const fromArrayBuffer = (input, offset = 0, length = input.byteLength - offset) => {\n if (!isArrayBuffer(input)) {\n throw new TypeError(`The \"input\" argument must be ArrayBuffer. Received type ${typeof input} (${input})`);\n }\n return Buffer.from(input, offset, length);\n};\nexport const fromString = (input, encoding) => {\n if (typeof input !== \"string\") {\n throw new TypeError(`The \"input\" argument must be of type string. Received type ${typeof input} (${input})`);\n }\n return encoding ? Buffer.from(input, encoding) : Buffer.from(input);\n};\n","import { fromString } from \"@smithy/util-buffer-from\";\nexport const fromUtf8 = (input) => {\n const buf = fromString(input, \"utf8\");\n return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength / Uint8Array.BYTES_PER_ELEMENT);\n};\n","import { fromUtf8 } from \"./fromUtf8\";\nexport const toUint8Array = (data) => {\n if (typeof data === \"string\") {\n return fromUtf8(data);\n }\n if (ArrayBuffer.isView(data)) {\n return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);\n }\n return new Uint8Array(data);\n};\n","import { fromArrayBuffer } from \"@smithy/util-buffer-from\";\nexport const toUtf8 = (input) => fromArrayBuffer(input.buffer, input.byteOffset, input.byteLength).toString(\"utf8\");\n","export * from \"./fromUtf8\";\nexport * from \"./toUint8Array\";\nexport * from \"./toUtf8\";\n","// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.\n// SPDX-License-Identifier: Apache-2.0\nimport { fromUtf8 as fromUtf8Browser } from \"@smithy/util-utf8\";\n// Quick polyfill\nvar fromUtf8 = typeof Buffer !== \"undefined\" && Buffer.from\n ? function (input) { return Buffer.from(input, \"utf8\"); }\n : fromUtf8Browser;\nexport function convertToBuffer(data) {\n // Already a Uint8, do nothing\n if (data instanceof Uint8Array)\n return data;\n if (typeof data === \"string\") {\n return fromUtf8(data);\n }\n if (ArrayBuffer.isView(data)) {\n return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);\n }\n return new Uint8Array(data);\n}\n//# sourceMappingURL=convertToBuffer.js.map","// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.\n// SPDX-License-Identifier: Apache-2.0\nexport function isEmptyData(data) {\n if (typeof data === \"string\") {\n return data.length === 0;\n }\n return data.byteLength === 0;\n}\n//# sourceMappingURL=isEmptyData.js.map","// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.\n// SPDX-License-Identifier: Apache-2.0\nexport { convertToBuffer } from \"./convertToBuffer\";\nexport { isEmptyData } from \"./isEmptyData\";\nexport { numToUint8 } from \"./numToUint8\";\nexport { uint32ArrayFrom } from './uint32ArrayFrom';\n//# sourceMappingURL=index.js.map","import { __awaiter, __generator } from \"tslib\";\nimport { BLOCK_SIZE } from \"./constants\";\nimport { RawSha256 } from \"./RawSha256\";\nimport { isEmptyData, convertToBuffer } from \"@aws-crypto/util\";\nvar Sha256 = /** @class */ (function () {\n function Sha256(secret) {\n this.secret = secret;\n this.hash = new RawSha256();\n this.reset();\n }\n Sha256.prototype.update = function (toHash) {\n if (isEmptyData(toHash) || this.error) {\n return;\n }\n try {\n this.hash.update(convertToBuffer(toHash));\n }\n catch (e) {\n this.error = e;\n }\n };\n /* This synchronous method keeps compatibility\n * with the v2 aws-sdk.\n */\n Sha256.prototype.digestSync = function () {\n if (this.error) {\n throw this.error;\n }\n if (this.outer) {\n if (!this.outer.finished) {\n this.outer.update(this.hash.digest());\n }\n return this.outer.digest();\n }\n return this.hash.digest();\n };\n /* The underlying digest method here is synchronous.\n * To keep the same interface with the other hash functions\n * the default is to expose this as an async method.\n * However, it can sometimes be useful to have a sync method.\n */\n Sha256.prototype.digest = function () {\n return __awaiter(this, void 0, void 0, function () {\n return __generator(this, function (_a) {\n return [2 /*return*/, this.digestSync()];\n });\n });\n };\n Sha256.prototype.reset = function () {\n this.hash = new RawSha256();\n if (this.secret) {\n this.outer = new RawSha256();\n var inner = bufferFromSecret(this.secret);\n var outer = new Uint8Array(BLOCK_SIZE);\n outer.set(inner);\n for (var i = 0; i < BLOCK_SIZE; i++) {\n inner[i] ^= 0x36;\n outer[i] ^= 0x5c;\n }\n this.hash.update(inner);\n this.outer.update(outer);\n // overwrite the copied key in memory\n for (var i = 0; i < inner.byteLength; i++) {\n inner[i] = 0;\n }\n }\n };\n return Sha256;\n}());\nexport { Sha256 };\nfunction bufferFromSecret(secret) {\n var input = convertToBuffer(secret);\n if (input.byteLength > BLOCK_SIZE) {\n var bufferHash = new RawSha256();\n bufferHash.update(input);\n input = bufferHash.digest();\n }\n var buffer = new Uint8Array(BLOCK_SIZE);\n buffer.set(input);\n return buffer;\n}\n//# sourceMappingURL=jsSha256.js.map","export * from \"./jsSha256\";\n//# sourceMappingURL=index.js.map","import { Sha256 } from '@aws-crypto/sha256-js';\n\nconst sha256 = value => {\n const hexStr = value;\n const hash = new Sha256();\n hash.update(hexStr);\n const hashUint8Array = hash.digestSync();\n return Buffer.from(hashUint8Array).toString('hex');\n};\n\nexport default sha256;\n","/*\r\n * bignumber.js v9.1.1\r\n * A JavaScript library for arbitrary-precision arithmetic.\r\n * https://github.com/MikeMcl/bignumber.js\r\n * Copyright (c) 2022 Michael Mclaughlin \r\n * MIT Licensed.\r\n *\r\n * BigNumber.prototype methods | BigNumber methods\r\n * |\r\n * absoluteValue abs | clone\r\n * comparedTo | config set\r\n * decimalPlaces dp | DECIMAL_PLACES\r\n * dividedBy div | ROUNDING_MODE\r\n * dividedToIntegerBy idiv | EXPONENTIAL_AT\r\n * exponentiatedBy pow | RANGE\r\n * integerValue | CRYPTO\r\n * isEqualTo eq | MODULO_MODE\r\n * isFinite | POW_PRECISION\r\n * isGreaterThan gt | FORMAT\r\n * isGreaterThanOrEqualTo gte | ALPHABET\r\n * isInteger | isBigNumber\r\n * isLessThan lt | maximum max\r\n * isLessThanOrEqualTo lte | minimum min\r\n * isNaN | random\r\n * isNegative | sum\r\n * isPositive |\r\n * isZero |\r\n * minus |\r\n * modulo mod |\r\n * multipliedBy times |\r\n * negated |\r\n * plus |\r\n * precision sd |\r\n * shiftedBy |\r\n * squareRoot sqrt |\r\n * toExponential |\r\n * toFixed |\r\n * toFormat |\r\n * toFraction |\r\n * toJSON |\r\n * toNumber |\r\n * toPrecision |\r\n * toString |\r\n * valueOf |\r\n *\r\n */\r\n\r\n\r\nvar\r\n isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n mathceil = Math.ceil,\r\n mathfloor = Math.floor,\r\n\r\n bignumberError = '[BigNumber Error] ',\r\n tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n BASE = 1e14,\r\n LOG_BASE = 14,\r\n MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1\r\n // MAX_INT32 = 0x7fffffff, // 2^31 - 1\r\n POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n SQRT_BASE = 1e7,\r\n\r\n // EDITABLE\r\n // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n MAX = 1E9; // 0 to MAX_INT32\r\n\r\n\r\n/*\r\n * Create and return a BigNumber constructor.\r\n */\r\nfunction clone(configObject) {\r\n var div, convertBase, parseNumeric,\r\n P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n ONE = new BigNumber(1),\r\n\r\n\r\n //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n // The default values below must be integers within the inclusive ranges stated.\r\n // The values can also be changed at run-time using BigNumber.set.\r\n\r\n // The maximum number of decimal places for operations involving division.\r\n DECIMAL_PLACES = 20, // 0 to MAX\r\n\r\n // The rounding mode used when rounding to the above decimal places, and when using\r\n // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n // UP 0 Away from zero.\r\n // DOWN 1 Towards zero.\r\n // CEIL 2 Towards +Infinity.\r\n // FLOOR 3 Towards -Infinity.\r\n // HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n ROUNDING_MODE = 4, // 0 to 8\r\n\r\n // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n // The exponent value at and beneath which toString returns exponential notation.\r\n // Number type: -7\r\n TO_EXP_NEG = -7, // 0 to -MAX\r\n\r\n // The exponent value at and above which toString returns exponential notation.\r\n // Number type: 21\r\n TO_EXP_POS = 21, // 0 to MAX\r\n\r\n // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // Number type: -324 (5e-324)\r\n MIN_EXP = -1e7, // -1 to -MAX\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // Number type: 308 (1.7976931348623157e+308)\r\n // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n MAX_EXP = 1e7, // 1 to MAX\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n CRYPTO = false, // true or false\r\n\r\n // The modulo mode used when calculating the modulus: a mod n.\r\n // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n // The remainder (r) is calculated as: r = a - n * q.\r\n //\r\n // UP 0 The remainder is positive if the dividend is negative, else is negative.\r\n // DOWN 1 The remainder has the same sign as the dividend.\r\n // This modulo mode is commonly known as 'truncated division' and is\r\n // equivalent to (a % n) in JavaScript.\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n // The remainder is always positive.\r\n //\r\n // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n // modes are commonly used for the modulus operation.\r\n // Although the other rounding modes can also be used, they may not give useful results.\r\n MODULO_MODE = 1, // 0 to 9\r\n\r\n // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n POW_PRECISION = 0, // 0 to MAX\r\n\r\n // The format specification used by the BigNumber.prototype.toFormat method.\r\n FORMAT = {\r\n prefix: '',\r\n groupSize: 3,\r\n secondaryGroupSize: 0,\r\n groupSeparator: ',',\r\n decimalSeparator: '.',\r\n fractionGroupSize: 0,\r\n fractionGroupSeparator: '\\xA0', // non-breaking space\r\n suffix: ''\r\n },\r\n\r\n // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n // '-', '.', whitespace, or repeated character.\r\n // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n //------------------------------------------------------------------------------------------\r\n\r\n\r\n // CONSTRUCTOR\r\n\r\n\r\n /*\r\n * The BigNumber constructor and exported function.\r\n * Create and return a new instance of a BigNumber object.\r\n *\r\n * v {number|string|BigNumber} A numeric value.\r\n * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n */\r\n function BigNumber(v, b) {\r\n var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n x = this;\r\n\r\n // Enable constructor call without `new`.\r\n if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n if (b == null) {\r\n\r\n if (v && v._isBigNumber === true) {\r\n x.s = v.s;\r\n\r\n if (!v.c || v.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else if (v.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = v.e;\r\n x.c = v.c.slice();\r\n }\r\n\r\n return;\r\n }\r\n\r\n if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n // Use `1 / n` to handle minus zero also.\r\n x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n // Fast path for integers, where n < 2147483648 (2**31).\r\n if (v === ~~v) {\r\n for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n if (e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else {\r\n x.e = e;\r\n x.c = [v];\r\n }\r\n\r\n return;\r\n }\r\n\r\n str = String(v);\r\n } else {\r\n\r\n if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = str.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +str.slice(i + 1);\r\n str = str.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = str.length;\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n // Allow exponential notation to be used with base 10 argument, while\r\n // also rounding to DECIMAL_PLACES as with other bases.\r\n if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n x = new BigNumber(v);\r\n return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n }\r\n\r\n str = String(v);\r\n\r\n if (isNum = typeof v == 'number') {\r\n\r\n // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n throw Error\r\n (tooManyDigits + v);\r\n }\r\n } else {\r\n x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n alphabet = ALPHABET.slice(0, b);\r\n e = i = 0;\r\n\r\n // Check that str is a valid base b number.\r\n // Don't use RegExp, so alphabet can contain special characters.\r\n for (len = str.length; i < len; i++) {\r\n if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n if (c == '.') {\r\n\r\n // If '.' is not the first character and it has not be found before.\r\n if (i > e) {\r\n e = len;\r\n continue;\r\n }\r\n } else if (!caseChanged) {\r\n\r\n // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n caseChanged = true;\r\n i = -1;\r\n e = 0;\r\n continue;\r\n }\r\n }\r\n\r\n return parseNumeric(x, String(v), isNum, b);\r\n }\r\n }\r\n\r\n // Prevent later check for length on converted number.\r\n isNum = false;\r\n str = convertBase(str, b, 10, x.s);\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n else e = str.length;\r\n }\r\n\r\n // Determine leading zeros.\r\n for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n // Determine trailing zeros.\r\n for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n if (str = str.slice(i, ++len)) {\r\n len -= i;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (isNum && BigNumber.DEBUG &&\r\n len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n throw Error\r\n (tooManyDigits + (x.s * v));\r\n }\r\n\r\n // Overflow?\r\n if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n x.c = x.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = e;\r\n x.c = [];\r\n\r\n // Transform base\r\n\r\n // e is the base 10 exponent.\r\n // i is where to slice str to get the first element of the coefficient array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE; // i < 1\r\n\r\n if (i < len) {\r\n if (i) x.c.push(+str.slice(0, i));\r\n\r\n for (len -= LOG_BASE; i < len;) {\r\n x.c.push(+str.slice(i, i += LOG_BASE));\r\n }\r\n\r\n i = LOG_BASE - (str = str.slice(i)).length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--; str += '0');\r\n x.c.push(+str);\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n\r\n // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n BigNumber.clone = clone;\r\n\r\n BigNumber.ROUND_UP = 0;\r\n BigNumber.ROUND_DOWN = 1;\r\n BigNumber.ROUND_CEIL = 2;\r\n BigNumber.ROUND_FLOOR = 3;\r\n BigNumber.ROUND_HALF_UP = 4;\r\n BigNumber.ROUND_HALF_DOWN = 5;\r\n BigNumber.ROUND_HALF_EVEN = 6;\r\n BigNumber.ROUND_HALF_CEIL = 7;\r\n BigNumber.ROUND_HALF_FLOOR = 8;\r\n BigNumber.EUCLID = 9;\r\n\r\n\r\n /*\r\n * Configure infrequently-changing library-wide settings.\r\n *\r\n * Accept an object with the following optional properties (if the value of a property is\r\n * a number, it must be an integer within the inclusive range stated):\r\n *\r\n * DECIMAL_PLACES {number} 0 to MAX\r\n * ROUNDING_MODE {number} 0 to 8\r\n * EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]\r\n * RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]\r\n * CRYPTO {boolean} true or false\r\n * MODULO_MODE {number} 0 to 9\r\n * POW_PRECISION {number} 0 to MAX\r\n * ALPHABET {string} A string of two or more unique characters which does\r\n * not contain '.'.\r\n * FORMAT {object} An object with some of the following properties:\r\n * prefix {string}\r\n * groupSize {number}\r\n * secondaryGroupSize {number}\r\n * groupSeparator {string}\r\n * decimalSeparator {string}\r\n * fractionGroupSize {number}\r\n * fractionGroupSeparator {string}\r\n * suffix {string}\r\n *\r\n * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n *\r\n * E.g.\r\n * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n *\r\n * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n *\r\n * Return an object with the properties current values.\r\n */\r\n BigNumber.config = BigNumber.set = function (obj) {\r\n var p, v;\r\n\r\n if (obj != null) {\r\n\r\n if (typeof obj == 'object') {\r\n\r\n // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n DECIMAL_PLACES = v;\r\n }\r\n\r\n // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 8, p);\r\n ROUNDING_MODE = v;\r\n }\r\n\r\n // EXPONENTIAL_AT {number|number[]}\r\n // Integer, -MAX to MAX inclusive or\r\n // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, 0, p);\r\n intCheck(v[1], 0, MAX, p);\r\n TO_EXP_NEG = v[0];\r\n TO_EXP_POS = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n }\r\n }\r\n\r\n // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n if (obj.hasOwnProperty(p = 'RANGE')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, -1, p);\r\n intCheck(v[1], 1, MAX, p);\r\n MIN_EXP = v[0];\r\n MAX_EXP = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n if (v) {\r\n MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' cannot be zero: ' + v);\r\n }\r\n }\r\n }\r\n\r\n // CRYPTO {boolean} true or false.\r\n // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n // '[BigNumber Error] crypto unavailable'\r\n if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n v = obj[p];\r\n if (v === !!v) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues || crypto.randomBytes)) {\r\n CRYPTO = v;\r\n } else {\r\n CRYPTO = !v;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n } else {\r\n CRYPTO = v;\r\n }\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' not true or false: ' + v);\r\n }\r\n }\r\n\r\n // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 9, p);\r\n MODULO_MODE = v;\r\n }\r\n\r\n // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n POW_PRECISION = v;\r\n }\r\n\r\n // FORMAT {object}\r\n // '[BigNumber Error] FORMAT not an object: {v}'\r\n if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n v = obj[p];\r\n if (typeof v == 'object') FORMAT = v;\r\n else throw Error\r\n (bignumberError + p + ' not an object: ' + v);\r\n }\r\n\r\n // ALPHABET {string}\r\n // '[BigNumber Error] ALPHABET invalid: {v}'\r\n if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n v = obj[p];\r\n\r\n // Disallow if less than two characters,\r\n // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n ALPHABET = v;\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' invalid: ' + v);\r\n }\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Object expected: {v}'\r\n throw Error\r\n (bignumberError + 'Object expected: ' + obj);\r\n }\r\n }\r\n\r\n return {\r\n DECIMAL_PLACES: DECIMAL_PLACES,\r\n ROUNDING_MODE: ROUNDING_MODE,\r\n EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n RANGE: [MIN_EXP, MAX_EXP],\r\n CRYPTO: CRYPTO,\r\n MODULO_MODE: MODULO_MODE,\r\n POW_PRECISION: POW_PRECISION,\r\n FORMAT: FORMAT,\r\n ALPHABET: ALPHABET\r\n };\r\n };\r\n\r\n\r\n /*\r\n * Return true if v is a BigNumber instance, otherwise return false.\r\n *\r\n * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n *\r\n * v {any}\r\n *\r\n * '[BigNumber Error] Invalid BigNumber: {v}'\r\n */\r\n BigNumber.isBigNumber = function (v) {\r\n if (!v || v._isBigNumber !== true) return false;\r\n if (!BigNumber.DEBUG) return true;\r\n\r\n var i, n,\r\n c = v.c,\r\n e = v.e,\r\n s = v.s;\r\n\r\n out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n // If the first element is zero, the BigNumber value must be zero.\r\n if (c[0] === 0) {\r\n if (e === 0 && c.length === 1) return true;\r\n break out;\r\n }\r\n\r\n // Calculate number of digits that c[0] should have, based on the exponent.\r\n i = (e + 1) % LOG_BASE;\r\n if (i < 1) i += LOG_BASE;\r\n\r\n // Calculate number of digits of c[0].\r\n //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n if (String(c[0]).length == i) {\r\n\r\n for (i = 0; i < c.length; i++) {\r\n n = c[i];\r\n if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n }\r\n\r\n // Last element cannot be zero, unless it is the only element.\r\n if (n !== 0) return true;\r\n }\r\n }\r\n\r\n // Infinity/NaN\r\n } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n return true;\r\n }\r\n\r\n throw Error\r\n (bignumberError + 'Invalid BigNumber: ' + v);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.maximum = BigNumber.max = function () {\r\n return maxOrMin(arguments, P.lt);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.minimum = BigNumber.min = function () {\r\n return maxOrMin(arguments, P.gt);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n * zeros are produced).\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n * '[BigNumber Error] crypto unavailable'\r\n */\r\n BigNumber.random = (function () {\r\n var pow2_53 = 0x20000000000000;\r\n\r\n // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n // Check if Math.random() produces more than 32 bits of randomness.\r\n // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n ? function () { return mathfloor(Math.random() * pow2_53); }\r\n : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n (Math.random() * 0x800000 | 0); };\r\n\r\n return function (dp) {\r\n var a, b, e, k, v,\r\n i = 0,\r\n c = [],\r\n rand = new BigNumber(ONE);\r\n\r\n if (dp == null) dp = DECIMAL_PLACES;\r\n else intCheck(dp, 0, MAX);\r\n\r\n k = mathceil(dp / LOG_BASE);\r\n\r\n if (CRYPTO) {\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n if (crypto.getRandomValues) {\r\n\r\n a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n for (; i < k;) {\r\n\r\n // 53 bits:\r\n // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n // 11111 11111111 11111111\r\n // 0x20000 is 2^21.\r\n v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n // Rejection sampling:\r\n // 0 <= v < 9007199254740992\r\n // Probability that v >= 9e15, is\r\n // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n if (v >= 9e15) {\r\n b = crypto.getRandomValues(new Uint32Array(2));\r\n a[i] = b[0];\r\n a[i + 1] = b[1];\r\n } else {\r\n\r\n // 0 <= v <= 8999999999999999\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 2;\r\n }\r\n }\r\n i = k / 2;\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n a = crypto.randomBytes(k *= 7);\r\n\r\n for (; i < k;) {\r\n\r\n // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n // 0 <= v < 9007199254740992\r\n v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n if (v >= 9e15) {\r\n crypto.randomBytes(7).copy(a, i);\r\n } else {\r\n\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 7;\r\n }\r\n }\r\n i = k / 7;\r\n } else {\r\n CRYPTO = false;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n }\r\n\r\n // Use Math.random.\r\n if (!CRYPTO) {\r\n\r\n for (; i < k;) {\r\n v = random53bitInt();\r\n if (v < 9e15) c[i++] = v % 1e14;\r\n }\r\n }\r\n\r\n k = c[--i];\r\n dp %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to dp.\r\n if (k && dp) {\r\n v = POWS_TEN[LOG_BASE - dp];\r\n c[i] = mathfloor(k / v) * v;\r\n }\r\n\r\n // Remove trailing elements which are zero.\r\n for (; c[i] === 0; c.pop(), i--);\r\n\r\n // Zero?\r\n if (i < 0) {\r\n c = [e = 0];\r\n } else {\r\n\r\n // Remove leading elements which are zero and adjust exponent accordingly.\r\n for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n // Count the digits of the first element of c to determine leading zeros, and...\r\n for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n // adjust the exponent accordingly.\r\n if (i < LOG_BASE) e -= LOG_BASE - i;\r\n }\r\n\r\n rand.e = e;\r\n rand.c = c;\r\n return rand;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a BigNumber whose value is the sum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.sum = function () {\r\n var i = 1,\r\n args = arguments,\r\n sum = new BigNumber(args[0]);\r\n for (; i < args.length;) sum = sum.plus(args[i++]);\r\n return sum;\r\n };\r\n\r\n\r\n // PRIVATE FUNCTIONS\r\n\r\n\r\n // Called by BigNumber and BigNumber.prototype.toString.\r\n convertBase = (function () {\r\n var decimal = '0123456789';\r\n\r\n /*\r\n * Convert string of baseIn to an array of numbers of baseOut.\r\n * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n */\r\n function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n len = str.length;\r\n\r\n for (; i < len;) {\r\n for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n for (j = 0; j < arr.length; j++) {\r\n\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] == null) arr[j + 1] = 0;\r\n arr[j + 1] += arr[j] / baseOut | 0;\r\n arr[j] %= baseOut;\r\n }\r\n }\r\n }\r\n\r\n return arr.reverse();\r\n }\r\n\r\n // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n // If the caller is toString, we are converting from base 10 to baseOut.\r\n // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n var alphabet, d, e, k, r, x, xc, y,\r\n i = str.indexOf('.'),\r\n dp = DECIMAL_PLACES,\r\n rm = ROUNDING_MODE;\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n k = POW_PRECISION;\r\n\r\n // Unlimited precision.\r\n POW_PRECISION = 0;\r\n str = str.replace('.', '');\r\n y = new BigNumber(baseIn);\r\n x = y.pow(str.length - i);\r\n POW_PRECISION = k;\r\n\r\n // Convert str as if an integer, then restore the fraction part by dividing the\r\n // result by its base raised to a power.\r\n\r\n y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n 10, baseOut, decimal);\r\n y.e = y.c.length;\r\n }\r\n\r\n // Convert the number as integer.\r\n\r\n xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n ? (alphabet = ALPHABET, decimal)\r\n : (alphabet = decimal, ALPHABET));\r\n\r\n // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n e = k = xc.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--k] == 0; xc.pop());\r\n\r\n // Zero?\r\n if (!xc[0]) return alphabet.charAt(0);\r\n\r\n // Does str represent an integer? If so, no need for the division.\r\n if (i < 0) {\r\n --e;\r\n } else {\r\n x.c = xc;\r\n x.e = e;\r\n\r\n // The sign is needed for correct rounding.\r\n x.s = sign;\r\n x = div(x, y, dp, rm, baseOut);\r\n xc = x.c;\r\n r = x.r;\r\n e = x.e;\r\n }\r\n\r\n // xc now represents str converted to baseOut.\r\n\r\n // THe index of the rounding digit.\r\n d = e + dp + 1;\r\n\r\n // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n i = xc[d];\r\n\r\n // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n k = baseOut / 2;\r\n r = r || d < 0 || xc[d + 1] != null;\r\n\r\n r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n // If the index of the rounding digit is not greater than zero, or xc represents\r\n // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n // such as 0.00001.\r\n if (d < 1 || !xc[0]) {\r\n\r\n // 1^-dp or 0\r\n str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n } else {\r\n\r\n // Truncate xc to the required number of decimal places.\r\n xc.length = d;\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (--baseOut; ++xc[--d] > baseOut;) {\r\n xc[d] = 0;\r\n\r\n if (!d) {\r\n ++e;\r\n xc = [1].concat(xc);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (k = xc.length; !xc[--k];);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n // Add leading zeros, decimal point and trailing zeros as required.\r\n str = toFixedPoint(str, e, alphabet.charAt(0));\r\n }\r\n\r\n // The caller will add the sign.\r\n return str;\r\n };\r\n })();\r\n\r\n\r\n // Perform division in the specified base. Called by div and convertBase.\r\n div = (function () {\r\n\r\n // Assume non-zero x and k.\r\n function multiply(x, k, base) {\r\n var m, temp, xlo, xhi,\r\n carry = 0,\r\n i = x.length,\r\n klo = k % SQRT_BASE,\r\n khi = k / SQRT_BASE | 0;\r\n\r\n for (x = x.slice(); i--;) {\r\n xlo = x[i] % SQRT_BASE;\r\n xhi = x[i] / SQRT_BASE | 0;\r\n m = khi * xlo + xhi * klo;\r\n temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n x[i] = temp % base;\r\n }\r\n\r\n if (carry) x = [carry].concat(x);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, cmp;\r\n\r\n if (aL != bL) {\r\n cmp = aL > bL ? 1 : -1;\r\n } else {\r\n\r\n for (i = cmp = 0; i < aL; i++) {\r\n\r\n if (a[i] != b[i]) {\r\n cmp = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return cmp;\r\n }\r\n\r\n function subtract(a, b, aL, base) {\r\n var i = 0;\r\n\r\n // Subtract b from a.\r\n for (; aL--;) {\r\n a[aL] -= i;\r\n i = a[aL] < b[aL] ? 1 : 0;\r\n a[aL] = i * base + a[aL] - b[aL];\r\n }\r\n\r\n // Remove leading zeros.\r\n for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n }\r\n\r\n // x: dividend, y: divisor.\r\n return function (x, y, dp, rm, base) {\r\n var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n yL, yz,\r\n s = x.s == y.s ? 1 : -1,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n return new BigNumber(\r\n\r\n // Return NaN if either NaN, or both Infinity or 0.\r\n !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n );\r\n }\r\n\r\n q = new BigNumber(s);\r\n qc = q.c = [];\r\n e = x.e - y.e;\r\n s = dp + e + 1;\r\n\r\n if (!base) {\r\n base = BASE;\r\n e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n s = s / LOG_BASE | 0;\r\n }\r\n\r\n // Result exponent may be one less then the current value of e.\r\n // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n if (s < 0) {\r\n qc.push(1);\r\n more = true;\r\n } else {\r\n xL = xc.length;\r\n yL = yc.length;\r\n i = 0;\r\n s += 2;\r\n\r\n // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n n = mathfloor(base / (yc[0] + 1));\r\n\r\n // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n if (n > 1) {\r\n yc = multiply(yc, n, base);\r\n xc = multiply(xc, n, base);\r\n yL = yc.length;\r\n xL = xc.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xc.slice(0, yL);\r\n remL = rem.length;\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; remL < yL; rem[remL++] = 0);\r\n yz = yc.slice();\r\n yz = [0].concat(yz);\r\n yc0 = yc[0];\r\n if (yc[1] >= base / 2) yc0++;\r\n // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n do {\r\n n = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yc, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, n.\r\n\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n // n is how many times the divisor goes into the current remainder.\r\n n = mathfloor(rem0 / yc0);\r\n\r\n // Algorithm:\r\n // product = divisor multiplied by trial digit (n).\r\n // Compare product and remainder.\r\n // If product is greater than remainder:\r\n // Subtract divisor from product, decrement trial digit.\r\n // Subtract product from remainder.\r\n // If product was less than remainder at the last compare:\r\n // Compare new remainder and divisor.\r\n // If remainder is greater than divisor:\r\n // Subtract divisor from remainder, increment trial digit.\r\n\r\n if (n > 1) {\r\n\r\n // n may be > base only when base is 3.\r\n if (n >= base) n = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiply(yc, n, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n // If product > remainder then trial digit n too high.\r\n // n is 1 too high about 5% of the time, and is not known to have\r\n // ever been more than 1 too high.\r\n while (compare(prod, rem, prodL, remL) == 1) {\r\n n--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n prodL = prod.length;\r\n cmp = 1;\r\n }\r\n } else {\r\n\r\n // n is 0 or 1, cmp is -1.\r\n // If n is 0, there is no need to compare yc and rem again below,\r\n // so change cmp to 1 to avoid it.\r\n // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n if (n == 0) {\r\n\r\n // divisor < remainder, so n must be at least 1.\r\n cmp = n = 1;\r\n }\r\n\r\n // product = divisor\r\n prod = yc.slice();\r\n prodL = prod.length;\r\n }\r\n\r\n if (prodL < remL) prod = [0].concat(prod);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n remL = rem.length;\r\n\r\n // If product was < remainder.\r\n if (cmp == -1) {\r\n\r\n // Compare divisor and new remainder.\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n // Trial digit n too low.\r\n // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n while (compare(yc, rem, yL, remL) < 1) {\r\n n++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yc, remL, base);\r\n remL = rem.length;\r\n }\r\n }\r\n } else if (cmp === 0) {\r\n n++;\r\n rem = [0];\r\n } // else cmp === 1 and n will be 0\r\n\r\n // Add the next digit, n, to the result array.\r\n qc[i++] = n;\r\n\r\n // Update the remainder.\r\n if (rem[0]) {\r\n rem[remL++] = xc[xi] || 0;\r\n } else {\r\n rem = [xc[xi]];\r\n remL = 1;\r\n }\r\n } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n more = rem[0] != null;\r\n\r\n // Leading zero?\r\n if (!qc[0]) qc.splice(0, 1);\r\n }\r\n\r\n if (base == BASE) {\r\n\r\n // To calculate q.e, first get the number of digits of qc[0].\r\n for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n // Caller is convertBase.\r\n } else {\r\n q.e = e;\r\n q.r = +more;\r\n }\r\n\r\n return q;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n * notation rounded to the specified decimal places or significant digits.\r\n *\r\n * n: a BigNumber.\r\n * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n * rm: the rounding mode.\r\n * id: 1 (toExponential) or 2 (toPrecision).\r\n */\r\n function format(n, i, rm, id) {\r\n var c0, e, ne, len, str;\r\n\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n if (!n.c) return n.toString();\r\n\r\n c0 = n.c[0];\r\n ne = n.e;\r\n\r\n if (i == null) {\r\n str = coeffToString(n.c);\r\n str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n ? toExponential(str, ne)\r\n : toFixedPoint(str, ne, '0');\r\n } else {\r\n n = round(new BigNumber(n), i, rm);\r\n\r\n // n.e may have changed if the value was rounded up.\r\n e = n.e;\r\n\r\n str = coeffToString(n.c);\r\n len = str.length;\r\n\r\n // toPrecision returns exponential notation if the number of significant digits\r\n // specified is less than the number of digits necessary to represent the integer\r\n // part of the value in fixed-point notation.\r\n\r\n // Exponential notation.\r\n if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n // Append zeros?\r\n for (; len < i; str += '0', len++);\r\n str = toExponential(str, e);\r\n\r\n // Fixed-point notation.\r\n } else {\r\n i -= ne;\r\n str = toFixedPoint(str, e, '0');\r\n\r\n // Append zeros?\r\n if (e + 1 > len) {\r\n if (--i > 0) for (str += '.'; i--; str += '0');\r\n } else {\r\n i += e - len;\r\n if (i > 0) {\r\n if (e + 1 == len) str += '.';\r\n for (; i--; str += '0');\r\n }\r\n }\r\n }\r\n }\r\n\r\n return n.s < 0 && c0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Handle BigNumber.max and BigNumber.min.\r\n function maxOrMin(args, method) {\r\n var n,\r\n i = 1,\r\n m = new BigNumber(args[0]);\r\n\r\n for (; i < args.length; i++) {\r\n n = new BigNumber(args[i]);\r\n\r\n // If any number is NaN, return NaN.\r\n if (!n.s) {\r\n m = n;\r\n break;\r\n } else if (method.call(m, n)) {\r\n m = n;\r\n }\r\n }\r\n\r\n return m;\r\n }\r\n\r\n\r\n /*\r\n * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n * Called by minus, plus and times.\r\n */\r\n function normalise(n, c, e) {\r\n var i = 1,\r\n j = c.length;\r\n\r\n // Remove trailing zeros.\r\n for (; !c[--j]; c.pop());\r\n\r\n // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n // Overflow?\r\n if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n n.c = n.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n n.c = [n.e = 0];\r\n } else {\r\n n.e = e;\r\n n.c = c;\r\n }\r\n\r\n return n;\r\n }\r\n\r\n\r\n // Handle values that fail the validity test in BigNumber.\r\n parseNumeric = (function () {\r\n var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n dotAfter = /^([^.]+)\\.$/,\r\n dotBefore = /^\\.([^.]+)$/,\r\n isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n return function (x, str, isNum, b) {\r\n var base,\r\n s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n // No exception on ±Infinity or NaN.\r\n if (isInfinityOrNaN.test(s)) {\r\n x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n } else {\r\n if (!isNum) {\r\n\r\n // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n s = s.replace(basePrefix, function (m, p1, p2) {\r\n base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n return !b || b == base ? p1 : m;\r\n });\r\n\r\n if (b) {\r\n base = b;\r\n\r\n // E.g. '1.' to '1', '.1' to '0.1'\r\n s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n }\r\n\r\n if (str != s) return new BigNumber(s, base);\r\n }\r\n\r\n // '[BigNumber Error] Not a number: {n}'\r\n // '[BigNumber Error] Not a base {b} number: {n}'\r\n if (BigNumber.DEBUG) {\r\n throw Error\r\n (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n }\r\n\r\n // NaN\r\n x.s = null;\r\n }\r\n\r\n x.c = x.e = null;\r\n }\r\n })();\r\n\r\n\r\n /*\r\n * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n * If r is truthy, it is known that there are more digits after the rounding digit.\r\n */\r\n function round(x, sd, rm, r) {\r\n var d, i, j, k, n, ni, rd,\r\n xc = x.c,\r\n pows10 = POWS_TEN;\r\n\r\n // if x is not Infinity or NaN...\r\n if (xc) {\r\n\r\n // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n // ni is the index of n within x.c.\r\n // d is the number of digits of n.\r\n // i is the index of rd within n including leading zeros.\r\n // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n out: {\r\n\r\n // Get the number of digits of the first element of xc.\r\n for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n i = sd - d;\r\n\r\n // If the rounding digit is in the first element of xc...\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n n = xc[ni = 0];\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = n / pows10[d - j - 1] % 10 | 0;\r\n } else {\r\n ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n if (ni >= xc.length) {\r\n\r\n if (r) {\r\n\r\n // Needed by sqrt.\r\n for (; xc.length <= ni; xc.push(0));\r\n n = rd = 0;\r\n d = 1;\r\n i %= LOG_BASE;\r\n j = i - LOG_BASE + 1;\r\n } else {\r\n break out;\r\n }\r\n } else {\r\n n = k = xc[ni];\r\n\r\n // Get the number of digits of n.\r\n for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n // Get the index of rd within n.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within n, adjusted for leading zeros.\r\n // The number of leading zeros of n is given by LOG_BASE - d.\r\n j = i - LOG_BASE + d;\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n }\r\n }\r\n\r\n r = r || sd < 0 ||\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n // The expression n % pows10[d - j - 1] returns all digits of n to the right\r\n // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n r = rm < 4\r\n ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n // Check whether the digit to the left of the rounding digit is odd.\r\n ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 || !xc[0]) {\r\n xc.length = 0;\r\n\r\n if (r) {\r\n\r\n // Convert sd to decimal places.\r\n sd -= x.e + 1;\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n x.e = -sd || 0;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n // Remove excess digits.\r\n if (i == 0) {\r\n xc.length = ni;\r\n k = 1;\r\n ni--;\r\n } else {\r\n xc.length = ni + 1;\r\n k = pows10[LOG_BASE - i];\r\n\r\n // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n // j > 0 means i > number of leading zeros of n.\r\n xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n }\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n for (; ;) {\r\n\r\n // If the digit to be rounded up is in the first element of xc...\r\n if (ni == 0) {\r\n\r\n // i will be the length of xc[0] before k is added.\r\n for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n j = xc[0] += k;\r\n for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n // if i != k the length has increased.\r\n if (i != k) {\r\n x.e++;\r\n if (xc[0] == BASE) xc[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xc[ni] += k;\r\n if (xc[ni] != BASE) break;\r\n xc[ni--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xc.length; xc[--i] === 0; xc.pop());\r\n }\r\n\r\n // Overflow? Infinity.\r\n if (x.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n\r\n // Underflow? Zero.\r\n } else if (x.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function valueOf(n) {\r\n var str,\r\n e = n.e;\r\n\r\n if (e === null) return n.toString();\r\n\r\n str = coeffToString(n.c);\r\n\r\n str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n ? toExponential(str, e)\r\n : toFixedPoint(str, e, '0');\r\n\r\n return n.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n */\r\n P.absoluteValue = P.abs = function () {\r\n var x = new BigNumber(this);\r\n if (x.s < 0) x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return\r\n * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * 0 if they have the same value,\r\n * or null if the value of either is NaN.\r\n */\r\n P.comparedTo = function (y, b) {\r\n return compare(this, new BigNumber(y, b));\r\n };\r\n\r\n\r\n /*\r\n * If dp is undefined or null or true or false, return the number of decimal places of the\r\n * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n *\r\n * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n *\r\n * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.decimalPlaces = P.dp = function (dp, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), dp + x.e + 1, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last number.\r\n if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n if (n < 0) n = 0;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * n / 0 = I\r\n * n / N = N\r\n * n / I = 0\r\n * 0 / n = 0\r\n * 0 / 0 = N\r\n * 0 / N = N\r\n * 0 / I = 0\r\n * N / n = N\r\n * N / 0 = N\r\n * N / N = N\r\n * N / I = N\r\n * I / n = I\r\n * I / 0 = I\r\n * I / N = N\r\n * I / I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n */\r\n P.dividedBy = P.div = function (y, b) {\r\n return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n * BigNumber by the value of BigNumber(y, b).\r\n */\r\n P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n return div(this, new BigNumber(y, b), 0, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n *\r\n * If m is present, return the result modulo m.\r\n * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n *\r\n * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n *\r\n * n {number|string|BigNumber} The exponent. An integer.\r\n * [m] {number|string|BigNumber} The modulus.\r\n *\r\n * '[BigNumber Error] Exponent not an integer: {n}'\r\n */\r\n P.exponentiatedBy = P.pow = function (n, m) {\r\n var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n x = this;\r\n\r\n n = new BigNumber(n);\r\n\r\n // Allow NaN and ±Infinity, but not other non-integers.\r\n if (n.c && !n.isInteger()) {\r\n throw Error\r\n (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n }\r\n\r\n if (m != null) m = new BigNumber(m);\r\n\r\n // Exponent of MAX_SAFE_INTEGER is 15.\r\n nIsBig = n.e > 14;\r\n\r\n // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n // The sign of the result of pow when x is negative depends on the evenness of n.\r\n // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n return m ? y.mod(m) : y;\r\n }\r\n\r\n nIsNeg = n.s < 0;\r\n\r\n if (m) {\r\n\r\n // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n if (isModExp) x = x.mod(m);\r\n\r\n // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n // [1, 240000000]\r\n ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n // [80000000000000] [99999750000000]\r\n : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n // If x is negative and n is odd, k = -0, else k = 0.\r\n k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n // If x >= 1, k = ±Infinity.\r\n if (x.e > -1) k = 1 / k;\r\n\r\n // If n is negative return ±0, else return ±Infinity.\r\n return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n } else if (POW_PRECISION) {\r\n\r\n // Truncating each coefficient array to a length of k after each multiplication\r\n // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n // i.e. there will be a minimum of 28 guard digits retained.\r\n k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n }\r\n\r\n if (nIsBig) {\r\n half = new BigNumber(0.5);\r\n if (nIsNeg) n.s = 1;\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = Math.abs(+valueOf(n));\r\n nIsOdd = i % 2;\r\n }\r\n\r\n y = new BigNumber(ONE);\r\n\r\n // Performs 54 loop iterations for n of 9007199254740991.\r\n for (; ;) {\r\n\r\n if (nIsOdd) {\r\n y = y.times(x);\r\n if (!y.c) break;\r\n\r\n if (k) {\r\n if (y.c.length > k) y.c.length = k;\r\n } else if (isModExp) {\r\n y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (i) {\r\n i = mathfloor(i / 2);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n } else {\r\n n = n.times(half);\r\n round(n, n.e + 1, 1);\r\n\r\n if (n.e > 14) {\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = +valueOf(n);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n }\r\n }\r\n\r\n x = x.times(x);\r\n\r\n if (k) {\r\n if (x.c && x.c.length > k) x.c.length = k;\r\n } else if (isModExp) {\r\n x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (isModExp) return y;\r\n if (nIsNeg) y = ONE.div(y);\r\n\r\n return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n *\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n */\r\n P.integerValue = function (rm) {\r\n var n = new BigNumber(this);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n return round(n, n.e + 1, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isEqualTo = P.eq = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n */\r\n P.isFinite = function () {\r\n return !!this.c;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isGreaterThan = P.gt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is greater than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n */\r\n P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n */\r\n P.isInteger = function () {\r\n return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isLessThan = P.lt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is less than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n */\r\n P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n */\r\n P.isNaN = function () {\r\n return !this.s;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is negative, otherwise return false.\r\n */\r\n P.isNegative = function () {\r\n return this.s < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is positive, otherwise return false.\r\n */\r\n P.isPositive = function () {\r\n return this.s > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n */\r\n P.isZero = function () {\r\n return !!this.c && this.c[0] == 0;\r\n };\r\n\r\n\r\n /*\r\n * n - 0 = n\r\n * n - N = N\r\n * n - I = -I\r\n * 0 - n = -n\r\n * 0 - 0 = 0\r\n * 0 - N = N\r\n * 0 - I = -I\r\n * N - n = N\r\n * N - 0 = N\r\n * N - N = N\r\n * N - I = N\r\n * I - n = I\r\n * I - 0 = I\r\n * I - N = N\r\n * I - I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n * BigNumber(y, b).\r\n */\r\n P.minus = function (y, b) {\r\n var i, j, t, xLTy,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a || !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe || !ye) {\r\n\r\n // Either Infinity?\r\n if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n ROUNDING_MODE == 3 ? -0 : 0);\r\n }\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Determine which is the bigger number.\r\n if (a = xe - ye) {\r\n\r\n if (xLTy = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n\r\n // Prepend zeros to equalise exponents.\r\n for (b = a; b--; t.push(0));\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n\r\n if (xc[b] != yc[b]) {\r\n xLTy = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n b = (j = yc.length) - (i = xc.length);\r\n\r\n // Append zeros to xc if shorter.\r\n // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n if (b > 0) for (; b--; xc[i++] = 0);\r\n b = BASE - 1;\r\n\r\n // Subtract yc from xc.\r\n for (; j > a;) {\r\n\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i]; xc[i] = b);\r\n --xc[i];\r\n xc[j] += BASE;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n // Zero?\r\n if (!xc[0]) {\r\n\r\n // Following IEEE 754 (2008) 6.3,\r\n // n - n = +0 but n - n = -0 when rounding towards -Infinity.\r\n y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n // for finite x and y.\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /*\r\n * n % 0 = N\r\n * n % N = N\r\n * n % I = n\r\n * 0 % n = 0\r\n * -0 % n = -0\r\n * 0 % 0 = N\r\n * 0 % N = N\r\n * 0 % I = 0\r\n * N % n = N\r\n * N % 0 = N\r\n * N % N = N\r\n * N % I = N\r\n * I % n = N\r\n * I % 0 = N\r\n * I % N = N\r\n * I % I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n */\r\n P.modulo = P.mod = function (y, b) {\r\n var q, s,\r\n x = this;\r\n\r\n y = new BigNumber(y, b);\r\n\r\n // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n if (!x.c || !y.s || y.c && !y.c[0]) {\r\n return new BigNumber(NaN);\r\n\r\n // Return x if y is Infinity or x is zero.\r\n } else if (!y.c || x.c && !x.c[0]) {\r\n return new BigNumber(x);\r\n }\r\n\r\n if (MODULO_MODE == 9) {\r\n\r\n // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n // r = x - qy where 0 <= r < abs(y)\r\n s = y.s;\r\n y.s = 1;\r\n q = div(x, y, 0, 3);\r\n y.s = s;\r\n q.s *= s;\r\n } else {\r\n q = div(x, y, 0, MODULO_MODE);\r\n }\r\n\r\n y = x.minus(q.times(y));\r\n\r\n // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * n * 0 = 0\r\n * n * N = N\r\n * n * I = I\r\n * 0 * n = 0\r\n * 0 * 0 = 0\r\n * 0 * N = N\r\n * 0 * I = N\r\n * N * n = N\r\n * N * 0 = N\r\n * N * N = N\r\n * N * I = N\r\n * I * n = I\r\n * I * 0 = N\r\n * I * N = N\r\n * I * I = I\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n * of BigNumber(y, b).\r\n */\r\n P.multipliedBy = P.times = function (y, b) {\r\n var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n base, sqrtBase,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new BigNumber(y, b)).c;\r\n\r\n // Either NaN, ±Infinity or ±0?\r\n if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n y.c = y.e = y.s = null;\r\n } else {\r\n y.s *= x.s;\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n if (!xc || !yc) {\r\n y.c = y.e = null;\r\n\r\n // Return ±0 if either is ±0.\r\n } else {\r\n y.c = [0];\r\n y.e = 0;\r\n }\r\n }\r\n\r\n return y;\r\n }\r\n\r\n e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n y.s *= x.s;\r\n xcL = xc.length;\r\n ycL = yc.length;\r\n\r\n // Ensure xc points to longer array and xcL to its length.\r\n if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n // Initialise the result array with zeros.\r\n for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n base = BASE;\r\n sqrtBase = SQRT_BASE;\r\n\r\n for (i = ycL; --i >= 0;) {\r\n c = 0;\r\n ylo = yc[i] % sqrtBase;\r\n yhi = yc[i] / sqrtBase | 0;\r\n\r\n for (k = xcL, j = i + k; j > i;) {\r\n xlo = xc[--k] % sqrtBase;\r\n xhi = xc[k] / sqrtBase | 0;\r\n m = yhi * xlo + xhi * ylo;\r\n xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n zc[j--] = xlo % base;\r\n }\r\n\r\n zc[j] = c;\r\n }\r\n\r\n if (c) {\r\n ++e;\r\n } else {\r\n zc.splice(0, 1);\r\n }\r\n\r\n return normalise(y, zc, e);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n * i.e. multiplied by -1.\r\n */\r\n P.negated = function () {\r\n var x = new BigNumber(this);\r\n x.s = -x.s || null;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * n + 0 = n\r\n * n + N = N\r\n * n + I = I\r\n * 0 + n = n\r\n * 0 + 0 = 0\r\n * 0 + N = N\r\n * 0 + I = I\r\n * N + n = N\r\n * N + 0 = N\r\n * N + N = N\r\n * N + I = N\r\n * I + n = I\r\n * I + 0 = I\r\n * I + N = N\r\n * I + I = I\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n * BigNumber(y, b).\r\n */\r\n P.plus = function (y, b) {\r\n var t,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a || !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe || !ye) {\r\n\r\n // Return ±Infinity if either ±Infinity.\r\n if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n // Either zero?\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n if (a = xe - ye) {\r\n if (a > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n a = -a;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; a--; t.push(0));\r\n t.reverse();\r\n }\r\n\r\n a = xc.length;\r\n b = yc.length;\r\n\r\n // Point xc to the longer array, and b to the shorter length.\r\n if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n for (a = 0; b;) {\r\n a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n }\r\n\r\n if (a) {\r\n xc = [a].concat(xc);\r\n ++ye;\r\n }\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n // ye = MAX_EXP + 1 possible\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /*\r\n * If sd is undefined or null or true or false, return the number of significant digits of\r\n * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n * If sd is true include integer-part trailing zeros in the count.\r\n *\r\n * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n *\r\n * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n * boolean: whether to count integer-part trailing zeros: true or false.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n */\r\n P.precision = P.sd = function (sd, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (sd != null && sd !== !!sd) {\r\n intCheck(sd, 1, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), sd, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n v = c.length - 1;\r\n n = v * LOG_BASE + 1;\r\n\r\n if (v = c[v]) {\r\n\r\n // Subtract the number of trailing zeros of the last element.\r\n for (; v % 10 == 0; v /= 10, n--);\r\n\r\n // Add the number of digits of the first element.\r\n for (v = c[0]; v >= 10; v /= 10, n++);\r\n }\r\n\r\n if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n *\r\n * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n */\r\n P.shiftedBy = function (k) {\r\n intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n return this.times('1e' + k);\r\n };\r\n\r\n\r\n /*\r\n * sqrt(-n) = N\r\n * sqrt(N) = N\r\n * sqrt(-I) = N\r\n * sqrt(I) = I\r\n * sqrt(0) = 0\r\n * sqrt(-0) = -0\r\n *\r\n * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n */\r\n P.squareRoot = P.sqrt = function () {\r\n var m, n, r, rep, t,\r\n x = this,\r\n c = x.c,\r\n s = x.s,\r\n e = x.e,\r\n dp = DECIMAL_PLACES + 4,\r\n half = new BigNumber('0.5');\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 || !c || !c[0]) {\r\n return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n }\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+valueOf(x));\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n if (s == 0 || s == 1 / 0) {\r\n n = coeffToString(c);\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(+n);\r\n e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new BigNumber(n);\r\n } else {\r\n r = new BigNumber(s + '');\r\n }\r\n\r\n // Check for zero.\r\n // r could be zero if MIN_EXP is changed after the this value was created.\r\n // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n // coeffToString to throw.\r\n if (r.c[0]) {\r\n e = r.e;\r\n s = e + dp;\r\n if (s < 3) s = 0;\r\n\r\n // Newton-Raphson iteration.\r\n for (; ;) {\r\n t = r;\r\n r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n // The exponent of r may here be one less than the final result exponent,\r\n // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n // are indexed correctly.\r\n if (r.e < e) --s;\r\n n = n.slice(s - 3, s + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n // iteration.\r\n if (n == '9999' || !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the\r\n // exact result as the nines may infinitely repeat.\r\n if (!rep) {\r\n round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n dp += 4;\r\n s += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n // result. If not, then there are further digits and m will be truthy.\r\n if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n m = !r.times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in exponential notation and\r\n * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.toExponential = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp++;\r\n }\r\n return format(this, dp, rm, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n *\r\n * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.toFixed = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp = dp + this.e + 1;\r\n }\r\n return format(this, dp, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n * of the format or FORMAT object (see BigNumber.set).\r\n *\r\n * The formatting object may contain some or all of the properties shown below.\r\n *\r\n * FORMAT = {\r\n * prefix: '',\r\n * groupSize: 3,\r\n * secondaryGroupSize: 0,\r\n * groupSeparator: ',',\r\n * decimalSeparator: '.',\r\n * fractionGroupSize: 0,\r\n * fractionGroupSeparator: '\\xA0', // non-breaking space\r\n * suffix: ''\r\n * };\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n * [format] {object} Formatting options. See FORMAT pbject above.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n * '[BigNumber Error] Argument not an object: {format}'\r\n */\r\n P.toFormat = function (dp, rm, format) {\r\n var str,\r\n x = this;\r\n\r\n if (format == null) {\r\n if (dp != null && rm && typeof rm == 'object') {\r\n format = rm;\r\n rm = null;\r\n } else if (dp && typeof dp == 'object') {\r\n format = dp;\r\n dp = rm = null;\r\n } else {\r\n format = FORMAT;\r\n }\r\n } else if (typeof format != 'object') {\r\n throw Error\r\n (bignumberError + 'Argument not an object: ' + format);\r\n }\r\n\r\n str = x.toFixed(dp, rm);\r\n\r\n if (x.c) {\r\n var i,\r\n arr = str.split('.'),\r\n g1 = +format.groupSize,\r\n g2 = +format.secondaryGroupSize,\r\n groupSeparator = format.groupSeparator || '',\r\n intPart = arr[0],\r\n fractionPart = arr[1],\r\n isNeg = x.s < 0,\r\n intDigits = isNeg ? intPart.slice(1) : intPart,\r\n len = intDigits.length;\r\n\r\n if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n if (g1 > 0 && len > 0) {\r\n i = len % g1 || g1;\r\n intPart = intDigits.substr(0, i);\r\n for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n if (isNeg) intPart = '-' + intPart;\r\n }\r\n\r\n str = fractionPart\r\n ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n '$&' + (format.fractionGroupSeparator || ''))\r\n : fractionPart)\r\n : intPart;\r\n }\r\n\r\n return (format.prefix || '') + str + (format.suffix || '');\r\n };\r\n\r\n\r\n /*\r\n * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n * fraction with an integer numerator and an integer denominator.\r\n * The denominator will be a positive non-zero value less than or equal to the specified\r\n * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n * the lowest value necessary to represent the number exactly.\r\n *\r\n * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n *\r\n * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n */\r\n P.toFraction = function (md) {\r\n var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n x = this,\r\n xc = x.c;\r\n\r\n if (md != null) {\r\n n = new BigNumber(md);\r\n\r\n // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n throw Error\r\n (bignumberError + 'Argument ' +\r\n (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n }\r\n }\r\n\r\n if (!xc) return new BigNumber(x);\r\n\r\n d = new BigNumber(ONE);\r\n n1 = d0 = new BigNumber(ONE);\r\n d1 = n0 = new BigNumber(ONE);\r\n s = coeffToString(xc);\r\n\r\n // Determine initial denominator.\r\n // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n e = d.e = s.length - x.e - 1;\r\n d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n exp = MAX_EXP;\r\n MAX_EXP = 1 / 0;\r\n n = new BigNumber(s);\r\n\r\n // n0 = d1 = 0\r\n n0.c[0] = 0;\r\n\r\n for (; ;) {\r\n q = div(n, d, 0, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.comparedTo(md) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n n1 = n0.plus(q.times(d2 = n1));\r\n n0 = d2;\r\n d = n.minus(q.times(d2 = d));\r\n n = d2;\r\n }\r\n\r\n d2 = div(md.minus(d0), d1, 0, 1);\r\n n0 = n0.plus(d2.times(n1));\r\n d0 = d0.plus(d2.times(d1));\r\n n0.s = n1.s = x.s;\r\n e = e * 2;\r\n\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n MAX_EXP = exp;\r\n\r\n return r;\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this BigNumber converted to a number primitive.\r\n */\r\n P.toNumber = function () {\r\n return +valueOf(this);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n * necessary to represent the integer part of the value in fixed-point notation, then use\r\n * exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n */\r\n P.toPrecision = function (sd, rm) {\r\n if (sd != null) intCheck(sd, 1, MAX);\r\n return format(this, sd, rm, 2);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n * TO_EXP_NEG, return exponential notation.\r\n *\r\n * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n *\r\n * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n */\r\n P.toString = function (b) {\r\n var str,\r\n n = this,\r\n s = n.s,\r\n e = n.e;\r\n\r\n // Infinity or NaN?\r\n if (e === null) {\r\n if (s) {\r\n str = 'Infinity';\r\n if (s < 0) str = '-' + str;\r\n } else {\r\n str = 'NaN';\r\n }\r\n } else {\r\n if (b == null) {\r\n str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n ? toExponential(coeffToString(n.c), e)\r\n : toFixedPoint(coeffToString(n.c), e, '0');\r\n } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n } else {\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n }\r\n\r\n if (s < 0 && n.c[0]) str = '-' + str;\r\n }\r\n\r\n return str;\r\n };\r\n\r\n\r\n /*\r\n * Return as toString, but do not accept a base argument, and include the minus sign for\r\n * negative zero.\r\n */\r\n P.valueOf = P.toJSON = function () {\r\n return valueOf(this);\r\n };\r\n\r\n\r\n P._isBigNumber = true;\r\n\r\n P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n // Node.js v10.12.0+\r\n P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n if (configObject != null) BigNumber.set(configObject);\r\n\r\n return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n var i = n | 0;\r\n return n > 0 || n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n var s, z,\r\n i = 1,\r\n j = a.length,\r\n r = a[0] + '';\r\n\r\n for (; i < j;) {\r\n s = a[i++] + '';\r\n z = LOG_BASE - s.length;\r\n for (; z--; s = '0' + s);\r\n r += s;\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n return r.slice(0, j + 1 || 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n var a, b,\r\n xc = x.c,\r\n yc = y.c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either NaN?\r\n if (!i || !j) return null;\r\n\r\n a = xc && !xc[0];\r\n b = yc && !yc[0];\r\n\r\n // Either zero?\r\n if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n a = i < 0;\r\n b = k == l;\r\n\r\n // Either Infinity?\r\n if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n // Compare exponents.\r\n if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/*\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n */\r\nfunction intCheck(n, min, max, name) {\r\n if (n < min || n > max || n !== mathfloor(n)) {\r\n throw Error\r\n (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n : ' not a primitive number: ') + String(n));\r\n }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n var k = n.c.length - 1;\r\n return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n var len, zs;\r\n\r\n // Negative exponent?\r\n if (e < 0) {\r\n\r\n // Prepend zeros.\r\n for (zs = z + '.'; ++e; zs += z);\r\n str = zs + str;\r\n\r\n // Positive exponent\r\n } else {\r\n len = str.length;\r\n\r\n // Append zeros.\r\n if (++e > len) {\r\n for (zs = z, e -= len; --e; zs += z);\r\n str += zs;\r\n } else if (e < len) {\r\n str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","/**\n * @file formatters.js\n * @author Marek Kotewicz \n * @author Fabian Vogelsteller \n * @date 2015\n */\nimport descriptor from '@aelfqueen/protobufjs/ext/descriptor';\nimport {\n base58\n} from './utils';\n\nexport const inputAddressFormatter = address => {\n let realAddress = address;\n if (address && address.value) {\n realAddress = address.value;\n }\n if (realAddress.indexOf('_') > 0) {\n const parts = realAddress.split('_');\n const list = parts.filter(v => {\n try {\n base58.decode(v, 'hex');\n return true;\n } catch (e) {\n return false;\n }\n });\n if (list.length === 0) {\n throw new Error('Invalid address');\n }\n [realAddress] = list;\n }\n try {\n base58.decode(realAddress, 'hex');\n } catch (e) {\n throw new Error('Invalid address');\n }\n return realAddress;\n};\n\n/**\n * @param {String} result base64 representation of serialized FileDescriptorSet\n * @returns {FileDescriptorSet} decoded FileDescriptorSet message\n */\nexport const outputFileDescriptorSetFormatter = result => {\n const buffer = Buffer.from(result, 'base64');\n return descriptor.FileDescriptorSet.decode(buffer);\n};\n","/**\n * @file AElf-sdk constants\n * @author atom-yang\n */\nimport {\n inputAddressFormatter,\n outputFileDescriptorSetFormatter,\n} from '../util/formatters';\n\n/**\n * unsigned 256 int\n */\nexport const UNSIGNED_256_INT =\n 'ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff';\n\nexport const CHAIN_METHODS = {\n getChainStatus: {\n name: 'getChainStatus',\n call: 'blockChain/chainStatus',\n method: 'GET',\n params: [],\n },\n getChainState: {\n name: 'getChainState',\n call: 'blockChain/blockState',\n method: 'GET',\n params: ['blockHash'],\n },\n getContractFileDescriptorSet: {\n name: 'getContractFileDescriptorSet',\n call: 'blockChain/contractFileDescriptorSet',\n method: 'GET',\n params: ['address'],\n inputFormatter: [inputAddressFormatter],\n outputFormatter: outputFileDescriptorSetFormatter,\n },\n getBlockHeight: {\n name: 'getBlockHeight',\n call: 'blockChain/blockHeight',\n method: 'GET',\n params: [],\n inputFormatter: [],\n },\n getBlock: {\n name: 'getBlock',\n call: 'blockChain/block',\n method: 'GET',\n params: ['blockHash', 'includeTransactions'],\n },\n getBlockByHeight: {\n name: 'getBlockByHeight',\n call: 'blockChain/blockByHeight',\n method: 'GET',\n params: ['blockHeight', 'includeTransactions'],\n },\n getTxResult: {\n name: 'getTxResult',\n call: 'blockChain/transactionResult',\n method: 'GET',\n params: ['transactionId'],\n inputFormatter: [],\n },\n getTxResults: {\n name: 'getTxResults',\n call: 'blockChain/transactionResults',\n method: 'GET',\n params: ['blockHash', 'offset', 'limit'],\n },\n getMerklePathByTxId: {\n name: 'getMerklePathByTxId',\n call: 'blockChain/merklePathByTransactionId',\n method: 'GET',\n params: ['transactionId'],\n },\n getTransactionPoolStatus: {\n name: 'getTransactionPoolStatus',\n call: 'blockChain/transactionPoolStatus',\n method: 'GET',\n params: [],\n },\n sendTransaction: {\n name: 'sendTransaction',\n call: 'blockChain/sendTransaction',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n sendTransactions: {\n name: 'sendTransactions',\n call: 'blockChain/sendTransactions',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n calculateTransactionFee: {\n name: 'calculateTransactionFee',\n call: 'blockChain/calculateTransactionFee',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n callReadOnly: {\n name: 'callReadOnly',\n call: 'blockChain/executeTransaction',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n getPeers: {\n name: 'getPeers',\n call: 'net/peers',\n method: 'GET',\n params: ['withMetrics'],\n },\n addPeer: {\n name: 'addPeer',\n call: 'net/peer',\n method: 'POST',\n params: ['address'],\n inputFormatter: [],\n },\n removePeer: {\n name: 'removePeer',\n call: 'net/peer',\n method: 'DELETE',\n params: ['address'],\n inputFormatter: [],\n },\n networkInfo: {\n name: 'networkInfo',\n call: 'net/networkInfo',\n method: 'GET',\n params: [],\n inputFormatter: [],\n },\n};\n\n/**\n * unit map\n */\nexport const UNIT_MAP = {\n noether: '0',\n wei: '1',\n kwei: '1000',\n Kwei: '1000',\n babbage: '1000',\n femtoether: '1000',\n mwei: '1000000',\n Mwei: '1000000',\n lovelace: '1000000',\n picoether: '1000000',\n gwei: '1000000000',\n Gwei: '1000000000',\n shannon: '1000000000',\n nanoether: '1000000000',\n nano: '1000000000',\n szabo: '1000000000000',\n microether: '1000000000000',\n micro: '1000000000000',\n finney: '1000000000000000',\n milliether: '1000000000000000',\n milli: '1000000000000000',\n ether: '1000000000000000000',\n kether: '1000000000000000000000',\n grand: '1000000000000000000000',\n mether: '1000000000000000000000000',\n gether: '1000000000000000000000000000',\n tether: '1000000000000000000000000000000',\n};\n\nexport const TO_STRING_UTF8_ENCODING = 'utf8';\n\nexport const DEFAULT_TO_STRING_ENCODING = TO_STRING_UTF8_ENCODING;\n\nexport const CONGIG = {\n AELF_POLLING_TIMEOUT: 1000 / 2,\n chainId: 'AELF',\n contractZeroAddress: 'AELF',\n contractZeroAbi: 'AELF',\n contractZero: 'AELF',\n defaultAccount: '0x04bb9c6c297ea90b1bc3e6af2c87d416583e',\n};\n\nexport const KEY_STORE_ERRORS = {\n INVALID_PASSWORD: {\n error: 200001,\n errorMessage: 'Password Error',\n },\n NOT_AELF_KEY_STORE: {\n error: 200002,\n errorMessage: 'Not a aelf key store',\n },\n WRONG_VERSION: {\n error: 200004,\n errorMessage: 'The version is incorrect',\n },\n WRONG_KEY_STORE_VERSION: {\n error: 200005,\n errorMessage: 'Not a V1 key store',\n },\n};\n","/**\n * @file transform protobuf\n * @author atom-yang\n */\nimport { base58, decodeAddressRep } from './utils';\nimport { inputAddressFormatter } from './formatters';\n\nconst isWrappedBytes = (resolvedType, name) => {\n if (!resolvedType.name || resolvedType.name !== name) {\n return false;\n }\n if (!resolvedType.fieldsArray || resolvedType.fieldsArray.length !== 1) {\n return false;\n }\n return resolvedType.fieldsArray[0].type === 'bytes';\n};\n\nconst isAddress = resolvedType => isWrappedBytes(resolvedType, 'Address');\n\nconst isHash = resolvedType => isWrappedBytes(resolvedType, 'Hash');\n\nexport function transform(inputType, origin, transformers = []) {\n const fieldsLength = (inputType.fieldsArray || []).length;\n let result = origin;\n if (fieldsLength === 0) {\n return origin;\n }\n // eslint-disable-next-line no-restricted-syntax\n for (const { filter, transformer } of transformers) {\n if (filter(inputType) && origin) {\n return transformer(origin);\n }\n }\n // eslint-disable-next-line no-restricted-syntax\n Object.keys(inputType.fields).forEach(field => {\n const {\n rule,\n name,\n resolvedType\n } = inputType.fields[field];\n if (resolvedType) {\n if (rule && rule === 'repeated') {\n let value = origin[name];\n if (value && Array.isArray(value)) {\n value = value\n .filter(v => v !== null && v !== undefined)\n .map(item => transform(resolvedType, item, transformers));\n }\n result = {\n ...result,\n [name]: value\n };\n } else {\n result = {\n ...result,\n [name]: origin[name] !== null && origin[name] !== undefined\n ? transform(resolvedType, origin[name], transformers) : origin[name]\n };\n }\n }\n });\n return result;\n}\n\nexport function transformMapToArray(inputType, origin) {\n const fieldsLength = inputType.fieldsArray ? inputType.fieldsArray.length : 0;\n let result = origin;\n if (!origin) {\n return origin;\n }\n if (fieldsLength === 0 || (fieldsLength === 1 && !inputType.fieldsArray[0].resolvedType)) {\n return origin;\n }\n // Params which satisfy address or hash format satisfy above first.\n // if (isAddress(inputType) || isHash(inputType)) {\n // return origin;\n // }\n const {\n fields,\n options = {}\n } = inputType;\n if (fieldsLength === 2 && fields.value && fields.key && options.map_entry === true) {\n return Object.keys(origin).map(key => ({ key, value: origin[key] }));\n }\n // eslint-disable-next-line no-restricted-syntax\n Object.keys(inputType.fields).forEach(field => {\n const {\n name,\n resolvedType\n } = inputType.fields[field];\n if (resolvedType) {\n if (origin[name] && Array.isArray(origin[name])) {\n let value = origin[name];\n value = value.map(item => transformMapToArray(resolvedType, item));\n result = {\n ...result,\n [name]: value\n };\n } else {\n result = {\n ...result,\n [name]: transformMapToArray(resolvedType, origin[name])\n };\n }\n }\n });\n return result;\n}\n\nexport function transformArrayToMap(inputType, origin) {\n const fieldsLength = (inputType.fieldsArray || []).length;\n let result = origin;\n if (\n fieldsLength === 0\n || (fieldsLength === 1 && !inputType.fieldsArray[0].resolvedType)\n ) {\n return origin;\n }\n // Params which satisfy address or hash format satisfy above first.\n // if (isAddress(inputType) || isHash(inputType)) {\n // return origin;\n // }\n const { fields, options = {} } = inputType;\n if (\n fieldsLength === 2\n && fields.value\n && fields.key\n && options.map_entry === true\n ) {\n return origin.reduce(\n (acc, v) => ({\n ...acc,\n [v.key]: v.value,\n }),\n {}\n );\n }\n // eslint-disable-next-line no-restricted-syntax\n Object.keys(fields).forEach(field => {\n const { name, resolvedType } = fields[field];\n if (resolvedType && origin !== null && origin !== undefined) {\n if (origin[name] && Array.isArray(origin[name])) {\n const {\n fieldsArray = [],\n fields: resolvedFields,\n options: resolvedOptions = {},\n } = resolvedType;\n // eslint-disable-next-line max-len\n if (\n fieldsArray.length === 2\n && resolvedFields.value\n && resolvedFields.key\n && resolvedOptions.map_entry === true\n ) {\n result = {\n ...result,\n [name]: origin[name].reduce(\n (acc, v) => ({\n ...acc,\n [v.key]: v.value,\n }),\n {}\n ),\n };\n } else {\n let value = origin[name];\n value = value.map(item => transformArrayToMap(resolvedType, item));\n result = {\n ...result,\n [name]: value,\n };\n }\n } else {\n result = {\n ...result,\n [name]: transformArrayToMap(resolvedType, origin[name]),\n };\n }\n }\n });\n return result;\n}\n\nexport const INPUT_TRANSFORMERS = [\n {\n filter: isAddress,\n transformer: origin => {\n let result = origin;\n if (typeof origin === 'string') {\n result = {\n value: Buffer.from(decodeAddressRep(inputAddressFormatter(origin)), 'hex')\n };\n }\n if (Array.isArray(origin)) {\n result = origin.map(h => ({\n value: Buffer.from(decodeAddressRep(inputAddressFormatter(h)), 'hex')\n }));\n }\n return result;\n }\n },\n {\n filter: isHash,\n transformer: origin => {\n let result = origin;\n if (typeof origin === 'string') {\n result = {\n value: Buffer.from(origin.replace('0x', ''), 'hex')\n };\n }\n if (Array.isArray(origin)) {\n result = origin.map(h => ({\n value: Buffer.from(h.replace('0x', ''), 'hex')\n }));\n }\n return result;\n }\n },\n];\n\nexport function encodeAddress(str) {\n const buf = Buffer.from(str, 'base64');\n return base58.encode(buf);\n}\n\nexport const OUTPUT_TRANSFORMERS = [\n {\n filter: isAddress,\n transformer: origin => {\n let result = origin;\n if (Array.isArray(result)) {\n result = result.map(h => encodeAddress(h.value));\n } else if (typeof result !== 'string') {\n result = encodeAddress(result.value);\n }\n return result;\n }\n },\n {\n filter: isHash,\n transformer: origin => {\n let result = origin;\n if (Array.isArray(result)) {\n result = result.map(h => Buffer.from(h.value, 'base64').toString('hex'));\n } else if (typeof result !== 'string') {\n result = Buffer.from(result.value, 'base64').toString('hex');\n }\n return result;\n }\n },\n];\n","/**\n * @file common utils\n * @author atom-yang\n */\n\nimport BigNumber from 'bignumber.js';\nimport bs58 from 'bs58';\nimport { UNIT_MAP, UNSIGNED_256_INT } from '../common/constants';\nimport { Transaction } from './proto';\nimport {\n OUTPUT_TRANSFORMERS,\n encodeAddress,\n transform,\n transformArrayToMap\n} from './transform';\nimport sha256 from './sha256';\n\n\nexport const base58 = {\n encode(data, encoding = 'hex') {\n let result = data;\n if (typeof data === 'string') {\n result = Buffer.from(data, encoding);\n }\n if (!(result instanceof Buffer)) {\n throw new TypeError('\"data\" argument must be an Array of Buffers');\n }\n let hash = result;\n hash = Buffer.from(sha256(result), 'hex');\n hash = Buffer.from(sha256(hash), 'hex');\n hash = Buffer.from(result.toString('hex') + hash.slice(0, 4).toString('hex'), 'hex');\n return bs58.encode(hash);\n },\n decode(str, encoding) {\n const buffer = Buffer.from(bs58.decode(str));\n let data = buffer.slice(0, -4);\n let hash = data;\n hash = Buffer.from(sha256(hash), 'hex');\n hash = Buffer.from(sha256(hash), 'hex');\n buffer.slice(-4).forEach((check, index) => {\n if (check !== hash[index]) {\n throw new Error('Invalid checksum');\n }\n });\n if (encoding) {\n data = data.toString(encoding);\n }\n return data;\n }\n};\n\nexport const chainIdConvertor = {\n // chainIdToBase58 (int32 chainId)\n chainIdToBase58(chainId) {\n const bufferTemp = Buffer.alloc(4);\n bufferTemp.writeInt32LE(`0x${chainId.toString('16')}`, 0);\n const bytes = Buffer.concat([bufferTemp], 3);\n return bs58.encode(bytes);\n },\n base58ToChainId(base58String) {\n return Buffer.concat([bs58.decode(base58String)], 4).readInt32LE(0);\n }\n};\n\nconst arrayBufferToHex = arrayBuffer => Array.prototype.map.call(\n new Uint8Array(arrayBuffer),\n n => (`0${n.toString(16)}`).slice(-2)\n).join('');\n\nexport const arrayToHex = value => {\n let hex = '';\n if (value instanceof Buffer) {\n hex = value.toString('hex');\n } else {\n // Uint8Array\n hex = arrayBufferToHex(value);\n }\n return hex;\n};\n\n/**\n * Should be called to pad string to expected length\n *\n * @method padLeft\n * @param {String} string to be padded\n * @param {Number} charLen that result string should have\n * @param {String} sign, by default 0\n * @returns {String} right aligned string\n */\nexport const padLeft = (string, charLen, sign) => {\n const length = charLen - string.length + 1;\n return new Array(length < 0 ? 0 : length).join(sign || '0') + string;\n};\n\n/**\n * Should be called to pad string to expected length\n *\n * @method padRight\n * @param {String} string to be padded\n * @param {Number} charLen that result string should have\n * @param {String} sign, by default 0\n * @returns {String} right aligned string\n */\nexport const padRight = (string, charLen, sign) => {\n const length = charLen - string.length + 1;\n return string + (new Array(length < 0 ? 0 : length).join(sign || '0'));\n};\n\n\n/**\n * Returns a hex rep from the encoded address\n *\n * @method decodeAddressRep\n * @param {String} address\n * @return {String}\n */\nexport const decodeAddressRep = address => {\n if (address.indexOf('_') > -1) {\n const parts = address.split('_');\n const b58rep = parts[1];\n return base58.decode(b58rep, 'hex');\n }\n return base58.decode(address, 'hex');\n};\n\n/**\n * Returns a encoded address from the hex rep\n *\n * @method encodeAddressRep\n * @param {String} hex\n * @return {String}\n */\nexport const encodeAddressRep = hex => {\n const buf = Buffer.from(hex.replace('0x', ''), 'hex');\n return base58.encode(buf, 'hex');\n};\n\n/**\n * Returns true if object is BigNumber, otherwise false\n *\n * @method isBigNumber\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isBigNumber = object => object instanceof BigNumber\n || (object && object.constructor && object.constructor.name === 'BigNumber');\n\n/**\n * Returns true if object is string, otherwise false\n *\n * @method isString\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isString = object => typeof object === 'string'\n || (object && object.constructor && object.constructor.name === 'String');\n\n/**\n * Returns true if object is function, otherwise false\n *\n * @method isFunction\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isFunction = object => typeof object === 'function';\n\n/**\n * Returns true if object is Object, otherwise false\n *\n * @method isObject\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isObject = object => object !== null && !(Array.isArray(object)) && typeof object === 'object';\n\n/**\n * Returns true if object is boolean, otherwise false\n *\n * @method isBoolean\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isBoolean = object => typeof object === 'boolean';\n\n/**\n * Returns true if given string is valid json object\n *\n * @method isJson\n * @param {String} str\n * @return {Boolean}\n */\nexport const isJson = str => {\n try {\n return !!JSON.parse(str);\n } catch (e) {\n return false;\n }\n};\n\n/**\n * Takes an input and transforms it into an bignumber\n *\n * @method toBigNumber\n * @param {Number|String|BigNumber} number, a number, string, HEX string or BigNumber\n * @return {BigNumber} BigNumber\n */\nexport const toBigNumber = number => {\n const num = number || 0;\n if (isBigNumber(num)) {\n return num;\n }\n\n if (isString(num) && (num.indexOf('0x') === 0 || num.indexOf('-0x') === 0)) {\n return new BigNumber(num.replace('0x', ''), 16);\n }\n\n return new BigNumber(num.toString(10), 10);\n};\n\n/**\n * Returns value of unit in Wei\n *\n * @method getValueOfUnit\n * @param {String} unit the unit to convert to, default ether\n * @returns {BigNumber} value of the unit (in Wei)\n * @throws error if the unit is not correct:w\n */\nexport const getValueOfUnit = unit => {\n const unitValue = UNIT_MAP[unit ? unit.toLowerCase() : 'ether'];\n if (unitValue === undefined) {\n // eslint-disable-next-line max-len\n throw new Error(`This unit doesn\\'t exists, please use the one of the following units ${JSON.stringify(UNIT_MAP, null, 2)}`);\n }\n return new BigNumber(unitValue, 10);\n};\n\n/**\n * Takes a number of wei and converts it to any other ether unit.\n *\n * Possible units are:\n * SI Short SI Full Effigy Other\n * - kwei femtoether babbage\n * - mwei picoether lovelace\n * - gwei nanoether shannon nano\n * - -- microether szabo micro\n * - -- milliether finney milli\n * - ether -- --\n * - kether -- grand\n * - mether\n * - gether\n * - tether\n *\n * @method fromWei\n * @param {Number|String} number can be a number, number string or a HEX of a decimal\n * @param {String} unit the unit to convert to, default ether\n * @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number\n */\nexport const fromWei = (number, unit) => {\n const returnValue = toBigNumber(number).dividedBy(getValueOfUnit(unit));\n\n return isBigNumber(number) ? returnValue : returnValue.toString(10);\n};\n\n/**\n * Takes a number of a unit and converts it to wei.\n *\n * Possible units are:\n * SI Short SI Full Effigy Other\n * - kwei femtoether babbage\n * - mwei picoether lovelace\n * - gwei nanoether shannon nano\n * - -- microether szabo micro\n * - -- milliether finney milli\n * - ether -- --\n * - kether -- grand\n * - mether\n * - gether\n * - tether\n *\n * @method toWei\n * @param {Number|String|BigNumber} number can be a number, number string or a HEX of a decimal\n * @param {String} unit the unit to convert from, default ether\n * @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number\n */\nexport const toWei = (number, unit) => {\n const returnValue = toBigNumber(number).times(getValueOfUnit(unit));\n\n return isBigNumber(number) ? returnValue : returnValue.toString(10);\n};\n\n/**\n * Takes and input transforms it into bignumber and if it is negative value, into two's complement\n * bignumber.js get rid of round + floor in 6.0 https://github.com/MikeMcl/bignumber.js/issues/139\n * the method lessThan was named isLessThan after 6.0 https://github.com/MikeMcl/bignumber.js/issues/152\n * @method toTwosComplement\n * @param {Number|String|BigNumber} number\n * @return {BigNumber}\n */\nexport const toTwosComplement = number => {\n const bigNumber = toBigNumber(number).integerValue();\n if (bigNumber.isLessThan(0)) {\n return new BigNumber(UNSIGNED_256_INT, 16).plus(bigNumber).plus(1);\n }\n return bigNumber;\n};\n\n\n/**\n * Returns hex\n *\n * @method uint8ArrayToHex\n * @param {Array} uint8Array\n * @return {String}\n */\nexport const uint8ArrayToHex = uint8Array => {\n let string = '';\n uint8Array.forEach(item => {\n let hex = item.toString(16);\n if (hex.length <= 1) {\n hex = `0${hex}`;\n }\n string += hex;\n });\n return string;\n};\n\n/**\n * empty function\n */\nexport const noop = () => {};\n\n/**\n *\n * @param {object} obj The object to modify\n * @param {string} path The path of the property to set\n * @param {*} value The value to set\n * @example\n *\n * const object = { 'a': [{ 'b': { 'c': 3 } }] }\n *\n * set(object, 'test.b.c', 4)\n * console.log(object.test.b.c)\n * // => 4\n */\nexport const setPath = (obj, path, value) => {\n const paths = path.split('.');\n paths.reduce((acc, p, index) => {\n if (index === paths.length - 1) {\n acc[p] = value;\n return acc;\n }\n acc[p] = {};\n return acc[p];\n }, obj);\n};\n\nexport const unpackSpecifiedTypeData = ({ data, dataType, encoding = 'hex' }) => {\n const buffer = Buffer.from(data, encoding);\n const decoded = dataType.decode(buffer);\n const result = dataType.toObject(decoded, {\n enums: String, // enums as string names\n longs: String, // longs as strings (requires long.js)\n bytes: String, // bytes as base64 encoded strings\n defaults: true, // includes default values\n arrays: true, // populates empty arrays (repeated fields) even if defaults=false\n objects: true, // populates empty objects (map fields) even if defaults=false\n oneofs: true // includes virtual oneof fields set to the present field's name\n });\n return result;\n};\n\nexport function deserializeTransaction(rawTx, paramsDataType) {\n const {\n from,\n to,\n params,\n refBlockPrefix,\n signature,\n ...rest\n } = unpackSpecifiedTypeData({\n data: rawTx,\n dataType: Transaction\n });\n let methodParameters = unpackSpecifiedTypeData({\n data: params,\n encoding: 'base64',\n dataType: paramsDataType\n });\n methodParameters = transform(paramsDataType, methodParameters, OUTPUT_TRANSFORMERS);\n methodParameters = transformArrayToMap(paramsDataType, methodParameters);\n\n return {\n from: encodeAddress(from.value),\n to: encodeAddress(to.value),\n params: methodParameters,\n refBlockPrefix: Buffer.from(refBlockPrefix, 'base64').toString('hex'),\n signature: Buffer.from(signature, 'base64').toString('hex'),\n ...rest\n };\n}\n/**\n *\n * @param {String} userName Username\n * @param {String} password Password\n * @return {any} Authorization information\n *\n * const authorization = getAuthorization('test','pass')\n * console.log(authorization)\n * // => Basic dGVzdDpwYXNz\n */\nexport function getAuthorization(userName, password) {\n const base = Buffer.from(`${userName}:${password}`).toString('base64');\n return `Basic ${base}`;\n}\n\n// /**\n// * Converts value to it's hex representation\n// *\n// * @method fromDecimal\n// * @param {String|Number|BigNumber}\n// * @return {String}\n// */\n// export const fromDecimal = value => {\n// const number = toBigNumber(value);\n// const result = number.toString(16);\n//\n// return number.lessThan(0) ? `-0x${result.substr(1)}` : `0x${result}`;\n// };\n//\n// /**\n// * Should be called to get hex representation (prefixed by 0x) of utf8 string\n// *\n// * @method fromUtf8\n// * @param {String} string\n// * @param {Boolean} allowZero to convert code point zero to 00 instead of end of string\n// * @returns {String} hex representation of input string\n// */\n// export const fromUtf8 = (str, allowZero) => {\n// const encodeStr = utf8.encode(str);\n// let hex = '';\n// for (let i = 0; i < encodeStr.length; i++) {\n// const code = encodeStr.charCodeAt(i);\n// if (code === 0) {\n// if (allowZero) {\n// hex += '00';\n// } else {\n// break;\n// }\n// } else {\n// const n = code.toString(16);\n// hex += n.length < 2 ? `0${n}` : n;\n// }\n// }\n// return `0x${hex}`;\n// };\n","/**\n * @file proto utils\n * @author atom-yang\n */\nimport * as protobuf from '@aelfqueen/protobufjs/light';\nimport coreDescriptor from '../../proto/core.proto.json';\nimport * as utils from './utils';\nimport {\n transform,\n OUTPUT_TRANSFORMERS,\n transformArrayToMap\n} from './transform';\n\nexport const coreRootProto = protobuf.Root.fromJSON(coreDescriptor);\n/* eslint-disable no-unused-vars */\n\nexport const {\n Transaction,\n Hash,\n Address,\n TransactionFeeCharged,\n ResourceTokenCharged\n} = coreRootProto;\n\nexport const getFee = (base64Str, type = 'TransactionFeeCharged') => {\n if (['ResourceTokenCharged', 'TransactionFeeCharged'].indexOf(type) === -1) {\n throw new Error('type needs to be one of ResourceTokenCharged and TransactionFeeCharged');\n }\n const dataType = coreRootProto[type];\n let deserialize = dataType.decode(Buffer.from(base64Str, 'base64'));\n deserialize = dataType.toObject(deserialize, {\n enums: String, // enums as string names\n longs: String, // longs as strings (requires long.js)\n bytes: String, // bytes as base64 encoded strings\n defaults: true, // includes default values\n arrays: true, // populates empty arrays (repeated fields) even if defaults=false\n objects: true, // populates empty objects (map fields) even if defaults=false\n oneofs: true // includes virtual oneof fields set to the present field's name\n });\n // eslint-disable-next-line max-len\n let deserializeLogResult = transform(dataType, deserialize, OUTPUT_TRANSFORMERS);\n deserializeLogResult = transformArrayToMap(dataType, deserializeLogResult);\n return deserializeLogResult;\n};\n\nexport const getSerializedDataFromLog = log => {\n const {\n NonIndexed,\n Indexed = []\n } = log;\n const serializedData = [...(Indexed || [])];\n if (NonIndexed) {\n serializedData.push(NonIndexed);\n }\n return serializedData.join('');\n};\n\nexport const getResourceFee = (Logs = []) => {\n if (!Array.isArray(Logs) || Logs.length === 0) {\n return [];\n }\n return Logs.filter(log => log.Name === 'ResourceTokenCharged')\n .map(v => getFee(getSerializedDataFromLog(v), 'ResourceTokenCharged'));\n};\n\nexport const getTransactionFee = (Logs = []) => {\n if (!Array.isArray(Logs) || Logs.length === 0) {\n return [];\n }\n return Logs.filter(log => log.Name === 'TransactionFeeCharged')\n .map(v => getFee(getSerializedDataFromLog(v), 'TransactionFeeCharged'));\n};\n\n/**\n * arrayBuffer To Hex\n *\n * @alias module:AElf/pbUtils\n * @param {Buffer} arrayBuffer arrayBuffer\n * @return {string} hex string\n */\nexport const arrayBufferToHex = arrayBuffer => Array.prototype.map.call(\n new Uint8Array(arrayBuffer),\n n => (`0${n.toString(16)}`).slice(-2)\n).join('');\n\n/**\n * get hex rep From Address\n *\n * @alias module:AElf/pbUtils\n * @param {protobuf} address kernel.Address\n * @return {string} hex rep of address\n */\nexport const getRepForAddress = address => {\n const message = Address.fromObject(address);\n let hex = '';\n if (message.value instanceof Buffer) {\n hex = message.value.toString('hex');\n } else {\n // Uint8Array\n hex = arrayBufferToHex(message.value);\n }\n return utils.encodeAddressRep(hex);\n};\n\n/**\n * get address From hex rep\n *\n * @alias module:AElf/pbUtils\n * @param {string} rep address\n * @return {protobuf} address kernel.Address\n */\nexport const getAddressFromRep = rep => {\n const hex = utils.decodeAddressRep(rep);\n return Address.create({\n value: Buffer.from(hex.replace('0x', ''), 'hex')\n });\n};\n\n/**\n * get address From hex rep\n *\n * @alias module:AElf/pbUtils\n * @param {string} rep address\n * @return {protobuf} address kernel.Address\n */\nexport const getAddressObjectFromRep = rep => Address.toObject(getAddressFromRep(rep));\n\n/**\n * get hex rep From hash\n *\n * @alias module:AElf/pbUtils\n * @param {protobuf} hash kernel.Hash\n * @return {string} hex rep\n */\nexport const getRepForHash = hash => {\n const message = Address.fromObject(hash);\n let hex = '';\n if (message.value instanceof Buffer) {\n hex = message.value.toString('hex');\n } else {\n // Uint8Array\n hex = arrayBufferToHex(message.value);\n }\n return hex;\n};\n\n/**\n * get Hash From Hex\n *\n * @alias module:AElf/pbUtils\n * @param {string} hex string\n * @return {protobuf} kernel.Hash\n */\nexport const getHashFromHex = hex => Hash.create({\n value: Buffer.from(hex.replace('0x', ''), 'hex')\n});\n\n/**\n * get Hash Object From Hex\n *\n * @alias module:AElf/pbUtils\n * @param {string} hex string\n * @return {Object} kernel.Hash Hash ot Object\n */\nexport const getHashObjectFromHex = hex => Hash.toObject(getHashFromHex(hex));\n\n/**\n * encode Transaction to protobuf type\n *\n * @alias module:AElf/pbUtils\n * @param {Object} tx object\n * @return {protobuf} kernel.Transaction\n */\nexport const encodeTransaction = tx => Transaction.encode(tx).finish();\n\n/**\n * get Transaction\n *\n * @alias module:AElf/pbUtils\n * @param {string} from\n * @param {string} to\n * @param {string} methodName\n * @param {string} params\n * @return {protobuf} kernel.Transaction\n */\nexport const getTransaction = (from, to, methodName, params) => {\n const txn = {\n from: getAddressFromRep(from),\n to: getAddressFromRep(to),\n methodName,\n params\n };\n return Transaction.create(txn);\n};\n\n/* eslint-enable */\n","/**\n * @file bloom\n * @author joshstevens19\n * @link https://github.com/joshstevens19/ethereum-bloom-filters\n */\nimport sha256 from './sha256';\nimport {\n Address,\n getAddressObjectFromRep\n} from './proto';\n/**\n * @deprecated Use the new Bloom instead\n */\nfunction isBloom(bloom) {\n if (bloom instanceof Buffer || bloom instanceof Uint8Array) {\n return bloom.length === 256;\n }\n // if (!/^(0x)?[0-9a-f]{512}$/i.test(bloom)) {\n // return false;\n // }\n\n if (\n /^(0x)?[0-9a-f]{512}$/.test(bloom)\n || /^(0x)?[0-9A-F]{512}$/.test(bloom)\n ) {\n return true;\n }\n return false;\n}\n\n/**\n * @param codePoint\n * @return {number}\n */\nfunction codePointToInt(codePoint) {\n if (codePoint >= 48 && codePoint <= 57) {\n /* ['0'..'9'] -> [0..9] */\n return codePoint - 48;\n }\n\n if (codePoint >= 65 && codePoint <= 70) {\n /* ['A'..'F'] -> [10..15] */\n return codePoint - 55;\n }\n\n if (codePoint >= 97 && codePoint <= 102) {\n /* ['a'..'f'] -> [10..15] */\n return codePoint - 87;\n }\n\n throw new Error('invalid bloom');\n}\n\n/**\n * @param {string} bloom hex string\n * @param {string} hash hex string\n * @return {boolean}\n */\nexport function isInBloom(bloom, hash) {\n if (!isBloom(bloom)) {\n throw new Error('Invalid Bloom');\n }\n for (let i = 0; i < 12; i += 4) {\n // calculate bit position in bloom filter that must be active\n const bitpos = ((parseInt(hash.substr(i, 2), 16) << 8)\n + parseInt(hash.substr(i + 2, 2), 16))\n & 2047;\n\n // test if bitpos in bloom is active\n const code = codePointToInt(\n bloom.charCodeAt(bloom.length - 1 - Math.floor(bitpos / 4)),\n );\n const offset = 1 << bitpos % 4;\n\n if ((code & offset) !== offset) {\n return false;\n }\n }\n return true;\n}\n\n/**\n * @param {string} bloom base64 string\n * @param {string} eventName utf-8 string, such as `Transferred`\n * @return {boolean}\n */\nexport function isEventInBloom(bloom, eventName) {\n return isInBloom(Buffer.from(bloom, 'base64').toString('hex'), sha256(eventName));\n}\n\nexport function isIndexedInBloom(bloom, indexed) {\n return isInBloom(Buffer.from(bloom, 'base64').toString('hex'), sha256(Buffer.from(indexed, 'base64')));\n}\n\nexport function isAddressInBloom(bloom, address) {\n const encodedAddress = Address.encode(getAddressObjectFromRep(address)).finish();\n return isInBloom(Buffer.from(bloom, 'base64').toString('hex'), sha256(encodedAddress));\n}\n","/**\n * @file method on chain\n * @author atom-yang\n */\nimport { isFunction, noop, isBoolean } from '../util/utils';\n\nexport default class ChainMethod {\n constructor({\n name,\n call,\n method = 'GET',\n params = [],\n inputFormatter = [],\n outputFormatter = null,\n }) {\n this.name = name;\n this.call = call;\n this.requestMethod = method;\n this.params = params;\n this.inputFormatter = inputFormatter;\n this.outputFormatter = outputFormatter;\n this.requestManager = null;\n this.run = this.run.bind(this);\n }\n\n formatInput(args) {\n if (!this.inputFormatter || this.inputFormatter.length === 0) {\n return args;\n }\n\n return args.map((arg, index) => {\n const formatter = this.inputFormatter[index];\n return formatter ? formatter(arg) : arg;\n });\n }\n\n setRequestManager(manager) {\n this.requestManager = manager;\n }\n\n formatOutput(result) {\n return this.outputFormatter && result\n ? this.outputFormatter(result)\n : result;\n }\n\n extractArgumentsIntoObject(args) {\n if (args.length < this.params.length) {\n throw new Error(`should supply enough parameters for ${this.call}`);\n }\n const result = {\n method: this.call,\n requestMethod: this.requestMethod,\n isSync: false,\n callback: noop,\n params: {},\n };\n this.formatInput(args).forEach((arg, index) => {\n if (index > this.params.length - 1) {\n // if index is greater than params.length, that means arg is an extra argument\n if (isFunction(arg)) {\n // if there is a callback, user want to be in async mode, set isSync to false\n result.callback = arg;\n result.isSync = false;\n }\n if (isBoolean(arg?.sync)) {\n result.isSync = arg.sync;\n }\n } else {\n // if index is less than or equal to params.length, that means arg is one of the params\n result.params[this.params[index]] = arg;\n }\n });\n return result;\n }\n\n run(...args) {\n const argsObj = this.extractArgumentsIntoObject(args);\n if (argsObj.isSync) {\n return this.formatOutput(this.requestManager.send(argsObj));\n }\n return this.requestManager\n .sendAsync(argsObj)\n .then(result => {\n argsObj.callback(null, this.formatOutput(result));\n return this.formatOutput(result);\n })\n .catch(err => {\n argsObj.callback(err);\n throw err;\n });\n }\n}\n","import sha256 from './sha256';\n\nconst fromTwoBuffers = data => {\n if (data.length !== 2) throw new TypeError('Wrong data size.');\n\n const compared = Buffer.compare(data[0], data[1]);\n if (compared > 0) {\n data.reverse();\n }\n\n let buffer = Buffer.concat(data);\n buffer = Buffer.from(sha256(buffer), 'hex');\n return buffer;\n};\n\nconst generateMerkleTree = data => {\n if (data.length === 0) {\n return null;\n }\n\n if (data.length % 2 === 1) { data.push(data[data.length - 1]); }\n let nodeToAdd = data.length / 2;\n let newAdded = 0;\n let i = 0;\n while (i < data.length - 1) {\n const left = data[i++];\n const right = data[i++];\n data.push(fromTwoBuffers([left, right]));\n if (++newAdded === nodeToAdd) {\n // complete this row\n if (nodeToAdd % 2 === 1 && nodeToAdd !== 1) {\n nodeToAdd++;\n data.push(data[data.length - 1]);\n }\n // start a new row\n nodeToAdd /= 2;\n newAdded = 0;\n }\n }\n return data;\n};\n\nconst generateMerklePath = (indexArg, leafCount, tree) => {\n let index = indexArg;\n if (tree.length === 0 || index >= leafCount) return null;\n\n let firstInRow = 0;\n let rowcount = leafCount;\n const path = [];\n while (index < tree.length - 1) {\n const neighbor = index % 2 === 0 ? index + 1 : index - 1;\n path.push(tree[neighbor]);\n rowcount = rowcount % 2 === 0 ? rowcount : rowcount + 1;\n const shift = Math.floor((index - firstInRow) / 2);\n firstInRow += rowcount;\n index = firstInRow + shift;\n rowcount /= 2;\n }\n return path;\n};\n\nexport const computeRoot = data => {\n const merkleTree = generateMerkleTree(data);\n return merkleTree[merkleTree.length - 1];\n};\n\nexport const getMerklePath = (index, data) => {\n const leafCount = data.length;\n const merkleTree = generateMerkleTree(data);\n return generateMerklePath(index, leafCount, merkleTree);\n};\n\nexport const node = buffer => Buffer.from(sha256(buffer), 'hex');\n","const createKeccakHash = require('keccak');\n\nconst keccak = bits => str => {\n let msg;\n if (str.slice(0, 2) === '0x') {\n msg = [];\n for (let i = 2, l = str.length; i < l; i += 2) {\n msg.push(parseInt(str.slice(i, i + 2), 16));\n }\n msg = Buffer.from(msg);\n } else {\n msg = str;\n }\n const instance = createKeccakHash(`keccak${bits}`);\n return `0x${instance.update(msg).digest('hex')}`;\n};\n\nexport const keccak256 = keccak(256);\nexport const keccak512 = keccak(512);\nexport const keccak256s = keccak(256);\nexport const keccak512s = keccak(512);\n","/**\n * @file AElf keyStore tools\n * @author atom-yang\n */\nimport scrypt from 'scryptsy';\nimport { createCipheriv, createDecipheriv } from 'browserify-cipher';\nimport randomBytes from 'randombytes';\nimport { keccak256 } from './keccak';\nimport { KEY_STORE_ERRORS } from '../common/constants';\n\nconst AES_MODES = {\n 'aes-128-ecb': {\n cipher: 'AES',\n key: 128,\n iv: 0,\n mode: 'ECB',\n type: 'block',\n\n },\n 'aes-192-ecb': {\n cipher: 'AES',\n key: 192,\n iv: 0,\n mode: 'ECB',\n type: 'block',\n\n },\n 'aes-256-ecb': {\n cipher: 'AES',\n key: 256,\n iv: 0,\n mode: 'ECB',\n type: 'block',\n\n },\n 'aes-128-cbc': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n 'aes-192-cbc': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n 'aes-256-cbc': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n aes128: {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n aes192: {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n aes256: {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n 'aes-128-cfb': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CFB',\n type: 'stream',\n\n },\n 'aes-192-cfb': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CFB',\n type: 'stream',\n\n },\n 'aes-256-cfb': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CFB',\n type: 'stream',\n\n },\n 'aes-128-cfb8': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CFB8',\n type: 'stream',\n\n },\n 'aes-192-cfb8': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CFB8',\n type: 'stream',\n\n },\n 'aes-256-cfb8': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CFB8',\n type: 'stream',\n\n },\n 'aes-128-cfb1': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CFB1',\n type: 'stream',\n\n },\n 'aes-192-cfb1': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CFB1',\n type: 'stream',\n\n },\n 'aes-256-cfb1': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CFB1',\n type: 'stream',\n\n },\n 'aes-128-ofb': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'OFB',\n type: 'stream',\n\n },\n 'aes-192-ofb': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'OFB',\n type: 'stream',\n\n },\n 'aes-256-ofb': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'OFB',\n type: 'stream',\n\n },\n 'aes-128-ctr': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CTR',\n type: 'stream',\n\n },\n 'aes-192-ctr': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CTR',\n type: 'stream',\n\n },\n 'aes-256-ctr': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CTR',\n type: 'stream',\n\n },\n 'aes-128-gcm': {\n cipher: 'AES',\n key: 128,\n iv: 12,\n mode: 'GCM',\n type: 'auth',\n\n },\n 'aes-192-gcm': {\n cipher: 'AES',\n key: 192,\n iv: 12,\n mode: 'GCM',\n type: 'auth',\n\n },\n 'aes-256-gcm': {\n cipher: 'AES',\n key: 256,\n iv: 12,\n mode: 'GCM',\n type: 'auth',\n\n }\n};\n\nconst defaultOptions = {\n dklen: 32,\n n: 8192, // 2048 4096 8192 16384\n r: 8,\n p: 1,\n cipher: 'aes-128-ctr'\n};\n\n/**\n * getKeyStore\n *\n * @method getKeyStore\n * @param {Object} walletInfoInput walletInfo\n * @param {string} password password\n * @param {Object} option option\n * @return {Object} keyStore\n */\nexport function getKeystore(\n {\n mnemonic,\n privateKey,\n nickName = '',\n address = ''\n },\n password,\n option = defaultOptions\n) {\n const opt = {\n ...defaultOptions,\n ...option\n };\n const { cipher = 'aes-128-ctr' } = opt;\n const sliceLength = /128/.test(cipher) ? 16 : 32;\n const salt = randomBytes(32); // instance of Buffer\n const ivLength = (AES_MODES[cipher.toLowerCase()] || {}).iv;\n const iv = randomBytes(ivLength === undefined ? 16 : ivLength); // instance of Buffer\n const derivedKey = scrypt(\n Buffer.from(password, 'utf8'),\n salt,\n opt.n,\n opt.r,\n opt.p,\n opt.dklen\n ); // instance of Buffer\n const privateKeyCipher = createCipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const privateKeyEncrypted = Buffer.concat([\n privateKeyCipher.update(Buffer.from(privateKey, 'hex')),\n privateKeyCipher.final()\n ]);\n const mnemonicCipher = createCipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const mnemonicEncrypted = Buffer.concat([\n mnemonicCipher.update(Buffer.from(mnemonic, 'utf8')),\n mnemonicCipher.final()\n ]);\n const rawMac = Buffer.concat([derivedKey.slice(16), privateKeyEncrypted]);\n const mac = keccak256(rawMac).replace('0x', '');\n return {\n version: 1,\n type: 'aelf',\n nickName,\n address,\n crypto: {\n cipher,\n ciphertext: privateKeyEncrypted.toString('hex'),\n cipherparams: {\n iv: iv.toString('hex')\n },\n mnemonicEncrypted: mnemonicEncrypted.toString('hex'),\n kdf: 'scrypt',\n kdfparams: {\n r: opt.r,\n n: opt.n,\n p: opt.p,\n dklen: opt.dklen,\n salt: salt.toString('hex')\n },\n mac\n }\n };\n}\n\n/**\n * unlock AElf key store\n *\n * @method unlockKeystore\n * @param {Object} keyStoreInput key store input\n * @param {string} password password\n * @return {Object} walletInfo\n */\nexport function unlockKeystore(\n {\n crypto,\n nickName = '',\n address = ''\n },\n password\n) {\n let error = null;\n let result = null;\n const {\n kdfparams,\n mac,\n cipherparams,\n mnemonicEncrypted = '',\n ciphertext,\n cipher = 'aes-128-ctr'\n } = crypto;\n const sliceLength = /128/.test(cipher) ? 16 : 32;\n const iv = Buffer.from(cipherparams.iv, 'hex');\n const derivedKey = scrypt(\n Buffer.from(password),\n Buffer.from(kdfparams.salt, 'hex'),\n kdfparams.n,\n kdfparams.r,\n kdfparams.p,\n kdfparams.dklen || kdfparams.dkLen\n );\n const rawMac = Buffer.concat([derivedKey.slice(16), Buffer.from(ciphertext, 'hex')]);\n const currentMac = keccak256(rawMac).replace('0x', '');\n if (currentMac === mac) {\n const privateKeyDeCipher = createDecipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const privateKey = Buffer.concat([\n privateKeyDeCipher.update(Buffer.from(ciphertext, 'hex')),\n privateKeyDeCipher.final()\n ]).toString('hex');\n\n const mnemonicDeCipher = createDecipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const mnemonic = Buffer.concat([\n mnemonicDeCipher.update(Buffer.from(mnemonicEncrypted, 'hex')),\n mnemonicDeCipher.final()\n ]).toString('utf8');\n result = {\n nickName,\n address,\n mnemonic,\n privateKey\n };\n } else {\n error = { ...KEY_STORE_ERRORS.INVALID_PASSWORD };\n throw error;\n }\n\n return result;\n}\n\n/**\n * checkPassword\n *\n * @method checkPassword\n * @param {Object} keyStoreInput keyStoreInput\n * @param {string} password password\n * @return {boolean} true or false\n */\nexport const checkPassword = (\n keyStoreInput,\n password\n) => {\n try {\n const result = unlockKeystore(keyStoreInput, password);\n return !!result.privateKey;\n } catch (e) {\n return false;\n }\n};\n","/**\n * @file wallet\n * @author atom-yang\n */\nimport elliptic from 'elliptic';\nimport * as bip39 from 'bip39';\nimport hdkey from 'hdkey';\nimport AES from 'crypto-js/aes';\nimport encUTF8 from 'crypto-js/enc-utf8';\nimport sha256 from '../util/sha256';\nimport * as keyStore from '../util/keyStore';\nimport {\n encodeAddressRep,\n padLeft\n} from '../util/utils';\nimport { Transaction } from '../util/proto';\n\n// eslint-disable-next-line new-cap\nconst ellipticEc = new elliptic.ec('secp256k1');\n\n/**\n * Advanced Encryption Standard need crypto-js\n *\n * @alias module:AElf/wallet\n * @param {string} input anything you want to encrypt\n * @param {string} password password\n * @return {string} using base64 encoding way\n *\n * @Example\n * const AESEncryptPrivateKey = aelf.wallet.AESEncrypt('123', '123');\n * // AESEncryptPrivateKey = \"U2FsdGVkX1+RYovrVJVEEl8eiIUA3vx4GrNR+3sqOow=\"\n * const AESEncryptMnemonic = alef.wallet.AESEncrypt('hello world', '123');\n * // AESEncryptMnemonic = U2FsdGVkX19gCjHzYmoY5FGZA1ArXG+eGZIR77dK2GE=\n *\n */\nconst AESEncrypt = (input, password) => AES.encrypt(input, password).toString();\n\n/**\n * Decrypt any encrypted information you want to decrypt\n *\n * @alias module:AElf/wallet\n * @param {string} input anything you want to decrypt\n * @param {string} password password\n * @return {string} decrypted input, using utf8 decoding way\n *\n * @Example\n * const AESDecryptPrivateKey = aelf.wallet.AESDecrypt('U2FsdGVkX18+tvF7t4rhGOi5cbUvdTH2U5a6Tbu4Ojg=', '123');\n * // AESDecryptPrivateKey = \"123\"\n * const AESDecryptMnemonic = aelf.wallet.AESDecrypt('U2FsdGVkX19gCjHzYmoY5FGZA1ArXG+eGZIR77dK2GE=', '123');\n * // AESDecryptMnemonic = \"hello world\"\n */\nconst AESDecrypt = (input, password) => AES.decrypt(input, password).toString(encUTF8);\n\n/**\n * the same as in C#\n *\n * @alias module:AElf/wallet\n * @param {Object} pubKey get the pubKey you want through keyPair\n * @return {string} address encoded address\n *\n * @Example\n * const pubKey = wallet.keyPair.getPublic();\n * const address = aelf.wallet.getAddressFromPubKey(pubKey);\n */\nconst getAddressFromPubKey = pubKey => {\n const pubKeyEncoded = pubKey.encode();\n const onceSHAResult = Buffer.from(sha256(pubKeyEncoded), 'hex');\n const hash = sha256(onceSHAResult).slice(0, 64);\n return encodeAddressRep(hash);\n};\n\nconst _getWallet = (type, value, BIP44Path = 'm/44\\'/1616\\'/0\\'/0/0') => {\n // m/purpose'/coin_type'/account'/change/address_index\n // \"m/44'/1616'/0'/0/0\"\n\n let mnemonic = '';\n let rootSeed = '';\n let childWallet = '';\n let keyPair = '';\n let hdWallet;\n switch (type) {\n case 'createNewWallet':\n mnemonic = bip39.generateMnemonic();\n rootSeed = bip39.mnemonicToSeedSync(mnemonic).toString('hex');\n hdWallet = hdkey.fromMasterSeed(rootSeed);\n childWallet = hdWallet.derive(BIP44Path);\n keyPair = ellipticEc.keyFromPrivate(childWallet.privateKey);\n break;\n case 'getWalletByMnemonic':\n mnemonic = value;\n rootSeed = bip39.mnemonicToSeedSync(mnemonic).toString('hex');\n hdWallet = hdkey.fromMasterSeed(rootSeed);\n childWallet = hdWallet.derive(BIP44Path);\n keyPair = ellipticEc.keyFromPrivate(childWallet.privateKey);\n break;\n case 'getWalletByPrivateKey':\n if (typeof value === 'string') {\n keyPair = ellipticEc.keyFromPrivate(padLeft(value, 64, '0'));\n } else {\n keyPair = ellipticEc.keyFromPrivate(value);\n }\n break;\n default:\n throw new Error('not a valid method');\n }\n // let mnemonic = bip39.generateMnemonic();\n // let rootSeed = bip39.mnemonicToSeedHex(mnemonic);\n // let hdWallet = hdkey.fromMasterSeed(rootSeed);\n // let keyPair = ec.keyFromPrivate(xPrivateKey);\n // TODO 1.将私钥加密保存,用密码解密才能使用。\n // TODO 2.将助记词机密保存,用密码解密才能获取。\n const privateKey = keyPair.getPrivate().toString(16, 64);\n const publicKey = keyPair.getPublic();\n const address = getAddressFromPubKey(publicKey);\n return {\n mnemonic,\n BIP44Path,\n childWallet,\n keyPair,\n privateKey,\n address\n };\n};\n\n/**\n * get signature\n * @param bytesToBeSign\n * @param keyPair\n * @returns {Buffer}\n */\nconst getSignature = (bytesToBeSign, keyPair) => {\n const privateKey = keyPair.getPrivate('hex');\n const msgHash = sha256(bytesToBeSign);\n const sigObj = ellipticEc.sign(Buffer.from(msgHash, 'hex'), privateKey, 'hex', {\n canonical: true\n });\n const hex = [\n sigObj.r.toString('hex', 32),\n sigObj.s.toString('hex', 32),\n `0${sigObj.recoveryParam.toString()}`\n ].join('');\n return Buffer.from(hex, 'hex');\n};\n\n/**\n * create a wallet\n *\n * @alias module:AElf/wallet\n * @param {string} BIP44Path\n * @return {Object} wallet\n *\n * @Example\n * const wallet = aelf.wallet.createNewWallet();\n * // The format returned is similar to this\n * // wallet = {\n * // mnemonic: \"hello world\",\n * // BIP44Path: 'm/44\\'/1616\\'/0\\'/0/0',\n * // childWallet: {},\n * // keyPair: KeyPair {ec: EC, priv: BN, pub: Point}\n * // privateKey: \"123f7c123\"\n * // address: \"5uhk3434242424\"\n * // }\n */\nconst createNewWallet = (BIP44Path = 'm/44\\'/1616\\'/0\\'/0/0') => _getWallet('createNewWallet', '', BIP44Path);\n\n/**\n * create a wallet by mnemonic\n *\n * @alias module:AElf/wallet\n * @param {string} mnemonic base on bip39\n * @param {string} BIP44Path\n * @return {Object} wallet\n *\n * @Example\n *\n * const mnemonicWallet = aelf.wallet.getWalletByMnemonic('hello world');\n */\nconst getWalletByMnemonic = (mnemonic, BIP44Path = 'm/44\\'/1616\\'/0\\'/0/0') => {\n if (bip39.validateMnemonic(mnemonic)) {\n return _getWallet('getWalletByMnemonic', mnemonic, BIP44Path);\n }\n return false;\n};\n\n/**\n * create a wallet by private key\n *\n * @alias module:AElf/wallet\n * @param {string} privateKey privateKey\n * @return {Object} wallet\n *\n * @Example\n * const privateKeyWallet = aelf.wallet.getWalletByPrivateKey('123');\n *\n */\nconst getWalletByPrivateKey = privateKey => _getWallet('getWalletByPrivateKey', privateKey);\n\n/**\n * sign a transaction\n *\n * @alias module:AElf/wallet\n * @param {Object} rawTxn rawTxn\n * @param {Object} keyPair Any standard key pair\n * @return {Object} wallet\n *\n * @Example\n * const rawTxn = proto.getTransaction(\n * 'ELF_65dDNxzcd35jESiidFXN5JV8Z7pCwaFnepuYQToNefSgqk9',\n * 'ELF_65dDNxzcd35jESiidFXN5JV8Z7pCwaFnepuYQToNefSgqk9',\n * 'test',\n * []\n * );\n * const signWallet = aelf.wallet.signTransaction(rawTxn, wallet.keyPair);\n */\nconst signTransaction = (rawTxn, keyPair) => {\n let { params } = rawTxn;\n if (params.length === 0) {\n params = null;\n }\n // proto in proto.Transaction use proto2, but C# use proto3\n // proto3 will remove the default value key.\n // The differences between proto2 and proto3:\n // https://blog.csdn.net/huanggang982/article/details/77944174\n const ser = Transaction.encode(rawTxn).finish();\n const sig = getSignature(ser, keyPair);\n return {\n ...rawTxn,\n params,\n signature: sig\n };\n};\n\n/**\n * Encryption Using Elliptic Curve Algorithms（Use ECDSA)\n * Please see https://www.npmjs.com/package/elliptic#incentive\n *\n * @alias module:AElf/wallet\n * @param {string} hexString hex string\n * @param {Object} keyPair Any standard key pair\n * @return {Buffer} Buffer.from(hex, 'hex')\n *\n * @Example\n * const buffer = aelf.wallet.sign('68656c6c6f20776f726c64', wallet.keyPair);\n * buffer = [65, 246, 49, 108, 122, 252, 66, 187, 240, 7, 14, 48, 89,\n * 38, 103, 42, 58, 0, 46, 182, 180, 194, 200, 208, 141, 15, 95, 67,\n * 234, 248, 31, 199, 73, 151, 2, 133, 233, 84, 180, 216, 116, 9, 153,\n * 208, 254, 175, 96, 123, 76, 184, 224, 87, 69, 220, 172, 170, 239, 232,\n * 188, 123, 168, 163, 244, 151, 1]\n */\nconst sign = (hexString, keyPair) => {\n const bytesToBeSign = Buffer.from(hexString.replace('0x', ''), 'hex');\n return getSignature(bytesToBeSign, keyPair);\n};\n\nexport default {\n hdkey,\n bip39,\n sign,\n signTransaction,\n createNewWallet,\n getWalletByMnemonic,\n getWalletByPrivateKey,\n getAddressFromPubKey,\n ellipticEc,\n AESEncrypt,\n AESDecrypt,\n keyStore\n};\n","/**\n * @file contract method\n * @author atom-yang\n */\nimport { getTransaction, Transaction } from '../util/proto';\nimport {\n transformArrayToMap,\n transformMapToArray,\n transform,\n INPUT_TRANSFORMERS,\n OUTPUT_TRANSFORMERS,\n} from '../util/transform';\nimport {\n isBoolean,\n isFunction,\n noop,\n uint8ArrayToHex,\n unpackSpecifiedTypeData,\n} from '../util/utils';\nimport wallet from '../wallet';\n\nexport default class ContractMethod {\n constructor(chain, method, contractAddress, walletInstance) {\n this._chain = chain;\n this._method = method;\n const { resolvedRequestType, resolvedResponseType } = method;\n this._inputType = resolvedRequestType;\n this._outputType = resolvedResponseType;\n this._name = method.name;\n this._contractAddress = contractAddress;\n this._wallet = walletInstance;\n\n this.sendTransaction = this.sendTransaction.bind(this);\n this.unpackPackedInput = this.unpackPackedInput.bind(this);\n this.packInput = this.packInput.bind(this);\n this.unpackOutput = this.unpackOutput.bind(this);\n this.bindMethodToContract = this.bindMethodToContract.bind(this);\n this.run = this.run.bind(this);\n this.request = this.request.bind(this);\n this.callReadOnly = this.callReadOnly.bind(this);\n this.getSignedTx = this.getSignedTx.bind(this);\n this.getRawTx = this.getRawTx.bind(this);\n }\n\n packInput(input) {\n if (!input) {\n return null;\n }\n let params = transformMapToArray(this._inputType, input);\n params = transform(this._inputType, params, INPUT_TRANSFORMERS);\n const message = this._inputType.fromObject(params);\n return this._inputType.encode(message).finish();\n }\n\n unpackPackedInput(inputPacked) {\n if (!inputPacked) {\n return null;\n }\n const result = unpackSpecifiedTypeData({\n data: inputPacked,\n dataType: this._inputType,\n });\n let params = transform(this._inputType, result, OUTPUT_TRANSFORMERS);\n params = transformArrayToMap(this._inputType, params);\n return params;\n }\n\n unpackOutput(output) {\n if (!output) {\n return null;\n }\n let result = unpackSpecifiedTypeData({\n data: output,\n dataType: this._outputType,\n });\n result = transform(this._outputType, result, OUTPUT_TRANSFORMERS);\n result = transformArrayToMap(this._outputType, result);\n return result;\n }\n\n packOutput(result) {\n if (!result) {\n return null;\n }\n let params = transformMapToArray(this._outputType, result);\n\n params = transform(this._outputType, params, INPUT_TRANSFORMERS);\n\n const message = this._outputType.fromObject(params);\n return this._outputType.encode(message).finish();\n }\n\n handleTransaction(height, hash, encoded) {\n const rawTx = this.getRawTx(height, hash, encoded);\n\n let tx = wallet.signTransaction(rawTx, this._wallet.keyPair);\n\n tx = Transaction.encode(tx).finish();\n // jest environment just go into Buffer branch\n // we have test in browser example handly\n if (tx instanceof Buffer) {\n return tx.toString('hex');\n }\n return uint8ArrayToHex(tx);\n }\n\n prepareParametersAsync(args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg?.sync)\n );\n const encoded = this.packInput(filterArgs[0]);\n\n return this._chain.getChainStatus().then(status => {\n const { BestChainHeight, BestChainHash } = status;\n return this.handleTransaction(BestChainHeight, BestChainHash, encoded);\n });\n }\n\n prepareParameters(args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg.sync)\n );\n const encoded = this.packInput(filterArgs[0]);\n\n const { BestChainHeight, BestChainHash } = this._chain.getChainStatus({\n sync: true,\n });\n\n return this.handleTransaction(BestChainHeight, BestChainHash, encoded);\n }\n\n prepareParametersWithBlockInfo(args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg.sync)\n );\n const encoded = this.packInput(filterArgs[0]);\n\n const { height, hash } = filterArgs[1]; // blockInfo\n\n return this.handleTransaction(height, hash, encoded);\n }\n\n sendTransaction(...args) {\n const argsObject = this.extractArgumentsIntoObject(args);\n if (argsObject.isSync) {\n const parameters = this.prepareParameters(args);\n return this._chain.sendTransaction(parameters, {\n sync: true,\n });\n }\n // eslint-disable-next-line arrow-body-style\n return this.prepareParametersAsync(args).then(parameters => {\n return this._chain.sendTransaction(parameters, argsObject.callback);\n });\n }\n\n callReadOnly(...args) {\n const argsObject = this.extractArgumentsIntoObject(args);\n if (argsObject.isSync) {\n const parameters = this.prepareParameters(args);\n return this.unpackOutput(\n this._chain.callReadOnly(parameters, {\n sync: true,\n })\n );\n }\n // eslint-disable-next-line arrow-body-style\n return this.prepareParametersAsync(args).then(parameters => {\n return this._chain\n .callReadOnly(parameters, (error, result) => {\n argsObject.callback(error, this.unpackOutput(result));\n })\n .then(this.unpackOutput);\n });\n }\n\n extractArgumentsIntoObject(args) {\n const result = {\n callback: noop,\n isSync: false,\n };\n if (args.length === 0) {\n // has no callback, default to be async mode\n return result;\n }\n if (isFunction(args[args.length - 1])) {\n result.callback = args[args.length - 1];\n }\n args.forEach(arg => {\n if (isBoolean(arg?.sync)) {\n result.isSync = arg.sync;\n }\n });\n return result;\n }\n\n // getData(...args) {\n getSignedTx(...args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg.sync)\n );\n\n if (filterArgs[1]) {\n const { height, hash } = filterArgs[1]; // blockInfo\n if (hash && height) {\n return this.prepareParametersWithBlockInfo(args);\n }\n throw Error('The second param is the height & hash of a block');\n }\n\n return this.prepareParameters(args);\n }\n\n getRawTx(blockHeightInput, blockHashInput, packedInput) {\n const rawTx = getTransaction(\n this._wallet.address,\n this._contractAddress,\n this._name,\n packedInput\n );\n\n rawTx.refBlockNumber = blockHeightInput;\n const blockHash = blockHashInput.match(/^0x/)\n ? blockHashInput.substring(2)\n : blockHashInput;\n rawTx.refBlockPrefix = Buffer.from(blockHash, 'hex').slice(0, 4);\n return rawTx;\n }\n\n request(...args) {\n const { callback } = this.extractArgumentsIntoObject(args);\n const params = this.prepareParameters(args);\n return {\n method: 'broadcast_tx',\n callback,\n params,\n format: this.unpackOutput,\n };\n }\n\n run(...args) {\n return this.sendTransaction(...args);\n }\n\n bindMethodToContract(contract) {\n const { run } = this;\n run.request = this.request;\n run.call = this.callReadOnly;\n run.inputTypeInfo = this._inputType.toJSON();\n run.inputType = this._inputType;\n run.outputTypeInfo = this._outputType.toJSON();\n run.outputType = this._outputType;\n run.unpackPackedInput = this.unpackPackedInput;\n run.packInput = this.packInput;\n run.packOutput = this.packOutput.bind(this);\n run.sendTransaction = this.sendTransaction;\n run.getSignedTx = this.getSignedTx;\n run.getRawTx = this.getRawTx;\n run.unpackOutput = this.unpackOutput;\n // eslint-disable-next-line no-param-reassign\n contract[this._name] = run;\n }\n}\n","/**\n * @file contract\n * @author atom-yang\n */\n// eslint-disable-next-line max-classes-per-file\nimport * as protobuf from '@aelfqueen/protobufjs/light';\nimport {\n transform,\n transformArrayToMap,\n OUTPUT_TRANSFORMERS\n} from '../util/transform';\nimport ContractMethod from './contractMethod';\nimport { noop } from '../util/utils';\n\nconst getServicesFromFileDescriptors = descriptors => {\n const root = protobuf.Root.fromDescriptor(descriptors, 'proto3').resolveAll();\n return descriptors.file.filter(f => f.service.length > 0).map(f => {\n const sn = f.service[0].name;\n const fullName = f.package ? `${f.package}.${sn}` : sn;\n return root.lookupService(fullName);\n });\n};\n\nclass Contract {\n constructor(chain, services, address) {\n this._chain = chain;\n this.address = address;\n this.services = services;\n }\n\n deserializeLog(logs = [], logName) {\n const logInThisAddress = (logs).filter(v => v.Address === this.address && logName === v.Name);\n if (logInThisAddress.length === 0) {\n return [];\n }\n return logInThisAddress.map(item => {\n const {\n Name,\n NonIndexed,\n Indexed\n } = item;\n let dataType;\n // eslint-disable-next-line no-restricted-syntax\n for (const service of this.services) {\n try {\n dataType = service.lookupType(Name);\n break;\n } catch (e) {}\n }\n const serializedData = [...(Indexed || [])];\n if (NonIndexed) {\n serializedData.push(NonIndexed);\n }\n let result = serializedData.reduce((acc, v) => {\n let deserialize = dataType.decode(Buffer.from(v, 'base64'));\n deserialize = dataType.toObject(deserialize, {\n enums: String, // enums as string names\n longs: String, // longs as strings (requires long.js)\n bytes: String, // bytes as base64 encoded strings\n defaults: false, // includes default values\n arrays: true, // populates empty arrays (repeated fields) even if defaults=false\n objects: true, // populates empty objects (map fields) even if defaults=false\n oneofs: true // includes virtual oneof fields set to the present field's name\n });\n return {\n ...acc,\n ...deserialize\n };\n }, {});\n result = transform(dataType, result, OUTPUT_TRANSFORMERS);\n result = transformArrayToMap(dataType, result);\n return result;\n });\n }\n}\n\nexport default class ContractFactory {\n constructor(chain, fileDescriptorSet, wallet) {\n this.chain = chain;\n this.services = getServicesFromFileDescriptors(fileDescriptorSet);\n this.wallet = wallet;\n }\n\n static bindMethodsToContract(contract, wallet) {\n contract.services.forEach(service => {\n Object.keys(service.methods).forEach(key => {\n const method = service.methods[key].resolve();\n const contractMethod = new ContractMethod(contract._chain, method, contract.address, wallet);\n contractMethod.bindMethodToContract(contract);\n });\n });\n }\n\n at(address, callback = noop) {\n const contractInstance = new Contract(this.chain, this.services, address);\n ContractFactory.bindMethodsToContract(contractInstance, this.wallet);\n callback(null, contractInstance);\n return contractInstance;\n }\n}\n","/**\n * @file chain\n * @author atom-yang\n */\nimport {\n isBoolean,\n isFunction,\n noop,\n setPath\n} from '../util/utils';\nimport { CHAIN_METHODS } from '../common/constants';\nimport ChainMethod from './chainMethod';\nimport * as merkleTree from '../util/merkleTree';\n\nimport ContractFactory from '../contract';\n\nexport default class Chain {\n constructor(requestManager) {\n Object.keys(CHAIN_METHODS).forEach(key => {\n const methodConfig = CHAIN_METHODS[key];\n const { name } = methodConfig;\n const method = new ChainMethod(methodConfig);\n method.setRequestManager(requestManager);\n setPath(this, name, method.run);\n });\n }\n\n extractArgumentsIntoObject(args) {\n const result = {\n callback: noop,\n isSync: false,\n };\n if (args.length === 0) {\n // has no callback, default to be async mode\n return result;\n }\n if (isFunction(args[args.length - 1])) {\n result.callback = args[args.length - 1];\n }\n args.forEach(arg => {\n if (isBoolean(arg?.sync)) {\n result.isSync = arg.sync;\n }\n });\n return result;\n }\n\n contractAt(address, wallet, ...args) {\n const { callback, isSync } = this.extractArgumentsIntoObject(args);\n if (isSync) {\n const fds = this.getContractFileDescriptorSet(address, {\n sync: true,\n });\n if (fds && fds.file && fds.file.length > 0) {\n const factory = new ContractFactory(this, fds, wallet);\n return factory.at(address);\n }\n throw new Error('no such contract');\n }\n // eslint-disable-next-line consistent-return\n return this.getContractFileDescriptorSet(address).then(fds => {\n if (fds && fds.file && fds.file.length > 0) {\n const factory = new ContractFactory(this, fds, wallet);\n const result = factory.at(address);\n callback(null, result);\n return result;\n }\n callback(new Error('no such contract'));\n // if callback is noop, throw error\n if (callback.length === 0) {\n throw new Error('no such contract');\n }\n });\n }\n\n getMerklePath(txId, height, ...args) {\n const { isSync } = this.extractArgumentsIntoObject(args);\n if (isSync) {\n const block = this.getBlockByHeight(height, true, {\n sync: true,\n });\n const { BlockHash, Body } = block;\n const txIds = Body.Transactions;\n const txIndex = txIds.findIndex(id => id === txId);\n if (txIndex === -1) {\n throw new Error(\n `txId ${txId} has no correspond transaction in the block with height ${height}`\n );\n }\n const txResults = this.getTxResults(BlockHash, 0, txIds.length, {\n sync: true,\n });\n const nodes = txResults.map((result, index) => {\n const id = txIds[index];\n const status = result.Status;\n const buffer = Buffer.concat([\n Buffer.from(id.replace('0x', ''), 'hex'),\n Buffer.from(status, 'utf8'),\n ]);\n return merkleTree.node(buffer);\n });\n return merkleTree.getMerklePath(txIndex, nodes);\n }\n return this.getBlockByHeight(height, true).then(block => {\n const { BlockHash, Body } = block;\n const txIds = Body.Transactions;\n const txIndex = txIds.findIndex(id => id === txId);\n if (txIndex === -1) {\n throw new Error(\n `txId ${txId} has no correspond transaction in the block with height ${height}`\n );\n }\n return this.getTxResults(BlockHash, 0, txIds.length).then(results => {\n const nodes = results.map((result, index) => {\n const id = txIds[index];\n const status = result.Status;\n const buffer = Buffer.concat([\n Buffer.from(id.replace('0x', ''), 'hex'),\n Buffer.from(status, 'utf8'),\n ]);\n return merkleTree.node(buffer);\n });\n return merkleTree.getMerklePath(txIndex, nodes);\n });\n });\n }\n}\n","/**\n * @file request methods, connected to rpc node\n * @author atom-yang\n */\n\nexport default class RequestManager {\n constructor(provider) {\n this.provider = provider;\n }\n\n static prepareRequest({ requestMethod, method, params = {} }) {\n return {\n method: requestMethod.toUpperCase(),\n url: method,\n params\n };\n }\n\n setProvider(provider) {\n this.provider = provider;\n }\n\n send(requestBody) {\n if (!this.provider) {\n return null;\n }\n\n const payload = RequestManager.prepareRequest(requestBody);\n return this.provider.send(payload);\n }\n\n sendAsync(requestBody) {\n if (!this.provider) {\n return null;\n }\n\n const payload = RequestManager.prepareRequest(requestBody);\n return this.provider.sendAsync(payload);\n }\n}\n","/**\n * @file rpc connection built with http\n * @author atom-yang\n */\nimport { stringify } from 'query-string';\n\nconst defaultHeaders = {\n Accept: 'text/plain;v=1.0',\n 'Content-Type': 'application/json'\n};\n\nlet RequestLibrary = {};\nlet isFetch = false;\nif (process.env.RUNTIME_ENV === 'browser') {\n // For browsers use DOM Api XMLHttpRequest\n // serviceworker without window and document, only with self\n // eslint-disable-next-line no-restricted-globals\n const _self = typeof self === 'object' ? self : {};\n const _window = typeof window === 'object' ? window : _self;\n if (typeof _window.XMLHttpRequest !== 'undefined') {\n RequestLibrary = _window.XMLHttpRequest;\n isFetch = false;\n } else if (typeof _window.fetch !== 'undefined') {\n RequestLibrary = _window.fetch;\n isFetch = true;\n }\n} else {\n // For node use xmlhttprequest\n // eslint-disable-next-line global-require\n RequestLibrary = require('xmlhttprequest').XMLHttpRequest;\n}\n\nexport default class HttpProvider {\n constructor(\n host = 'http://localhost:8545',\n timeout = 8000,\n headers = defaultHeaders\n ) {\n this.host = host.replace(/\\/$/, '');\n this.timeout = timeout;\n this.headers = {};\n if (Array.isArray(headers)) {\n headers.forEach(({ name, value }) => {\n this.headers[name] = value;\n });\n this.headers = {\n ...defaultHeaders,\n ...this.headers\n };\n } else {\n this.headers = {\n ...defaultHeaders,\n ...headers,\n };\n }\n }\n\n static formatResponse(response) {\n let result;\n try {\n result = JSON.parse(response);\n } catch (e) {\n result = response;\n }\n return result;\n }\n\n static formatResponseText(request) {\n let result;\n try {\n const parseRequest = request;\n result = {\n status: parseRequest.status,\n error: parseRequest.status === 200 ? 0 : parseRequest.status,\n Error: {\n message: request.statusText,\n },\n statusText: request.statusText,\n };\n } catch (e) {\n result = request;\n }\n return result;\n }\n\n static timeoutPromise(delay) {\n return new Promise(_resolve => {\n const ids = setTimeout(() => {\n clearTimeout(ids);\n // eslint-disable-next-line prefer-promise-reject-errors\n _resolve({ type: 'timeout' });\n }, delay);\n });\n }\n\n requestSendByFetch(requestConfig, request) {\n const {\n url,\n method = 'POST',\n params = {},\n signal\n } = requestConfig;\n const path = `/api/${url}`.replace(/\\/\\//g, '\\/');\n let uri = `${this.host}${path}`.replace();\n const myHeaders = new Headers();\n let body = JSON.stringify(params);\n if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') {\n uri = Object.keys(params).length > 0 ? `${uri}?${stringify(params)}` : uri;\n body = undefined;\n }\n Object.keys(this.headers).forEach(header => {\n myHeaders.append(header, this.headers[header]);\n });\n return request(uri, {\n method: method.toUpperCase(),\n headers: myHeaders,\n body,\n signal\n });\n }\n\n sendAsyncByFetch(requestConfig) {\n const request = RequestLibrary;\n const { timeout } = this;\n const control = typeof AbortController === 'function' ? new AbortController() : {};\n const config = { ...requestConfig, signal: control.signal, credentials: 'omit' };\n // Simulation timeout\n return Promise.race([\n this.requestSendByFetch(config, request),\n HttpProvider.timeoutPromise(timeout)\n ]).then(result => new Promise((resolve, reject) => {\n // @deprecated unuse timeout=1\n // if (timeout !== 1) {\n try {\n if (result.type === 'timeout') {\n // Cancel timeout request\n if (control.abort) control.abort();\n reject(result);\n } else {\n result\n .text()\n .then(text => {\n const res = HttpProvider.formatResponse(text);\n if (result.status !== 200 || !result.ok) {\n reject(res);\n return;\n }\n resolve(res);\n })\n .catch(err => reject(err));\n }\n } catch (e) {\n reject(e);\n }\n // }\n }));\n }\n\n requestSend(requestConfig, request, isAsync = false) {\n const {\n url,\n method = 'POST',\n params = {}\n } = requestConfig;\n const path = `/api/${url}`.replace(/\\/\\//g, '\\/');\n let uri = `${this.host}${path}`.replace();\n if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') {\n uri = Object.keys(params).length > 0 ? `${uri}?${stringify(params)}` : uri;\n }\n request.open(method.toUpperCase(), uri, isAsync);\n Object.keys(this.headers).forEach(header => {\n request.setRequestHeader(header, this.headers[header]);\n });\n if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') {\n request.send();\n } else {\n request.send(JSON.stringify(params));\n }\n }\n\n send(requestConfig) {\n if (isFetch) throw new Error(\"Can not get XMLHttpRequest, invalid parameter: 'sync'\");\n const request = new RequestLibrary();\n request.withCredentials = false;\n this.requestSend(requestConfig, request);\n let result = request.responseText;\n\n result = HttpProvider.formatResponse(result);\n if (result.Error) {\n throw result;\n }\n return result;\n }\n\n sendAsync(requestConfig) {\n if (isFetch) return this.sendAsyncByFetch(requestConfig);\n return this.sendAsyncByXMLHttp(requestConfig);\n }\n\n sendAsyncByXMLHttp(requestConfig) {\n const request = new RequestLibrary();\n request.withCredentials = false;\n request.timeout = this.timeout;\n this.requestSend(requestConfig, request, true);\n return new Promise((resolve, reject) => {\n request.onreadystatechange = () => {\n if (request.readyState === 4 && request.timeout !== 1) {\n let result = request.responseText;\n try {\n result = HttpProvider.formatResponse(result);\n if (request.status !== 200 || result.Error) {\n reject(result);\n } else {\n resolve(result);\n }\n } catch (e) {\n // todo: error handle\n reject(e);\n }\n }\n };\n\n request.onerror = err => {\n reject(err);\n };\n request.ontimeout = err => {\n // todo: timeout error\n reject(err);\n };\n });\n }\n\n isConnected() {\n try {\n this.send({\n method: 'GET',\n url: 'blockChain/chainStatus'\n });\n return true;\n } catch (e) {\n return false;\n }\n }\n\n async isConnectedAsync() {\n try {\n return await this.sendAsyncByFetch({\n method: 'GET',\n url: 'blockChain/chainStatus'\n });\n } catch (e) {\n return false;\n }\n }\n}\n","/**\n * @file settings\n * @author atom-yang\n */\n\nexport default class Settings {\n constructor() {\n this.defaultAccount = undefined;\n }\n}\n","/**\n * @file AElf-sdk index export\n * @author atom-yang\n */\nimport * as protobuf from '@aelfqueen/protobufjs/light';\nimport * as bloom from './util/bloom';\nimport Chain from './chain';\nimport RequestManager from './util/requestManage';\nimport HttpProvider from './util/httpProvider';\nimport wallet from './wallet';\nimport * as utils from './util/utils';\nimport * as proto from './util/proto';\nimport * as transform from './util/transform';\nimport Settings from './util/settings';\nimport sha256 from './util/sha256';\n\n/* eslint-disable no-underscore-dangle */\nexport default class AElf {\n constructor(provider) {\n this._requestManager = new RequestManager(provider);\n this.currentProvider = provider;\n this.chain = new Chain(this._requestManager);\n }\n\n static version = process.env.SDK_VERSION;\n\n static providers = {\n HttpProvider,\n };\n\n /**\n * @type {protobuf} export protobufjs for developers\n */\n static pbjs = protobuf;\n\n static pbUtils = proto;\n\n static wallet = wallet;\n\n static utils = {\n ...utils,\n ...bloom,\n sha256,\n transform,\n };\n\n providers = {\n HttpProvider,\n };\n\n settings = new Settings();\n\n /**\n * AElf-sdk version\n * @type {{api: string}}\n */\n version = {\n api: process.env.SDK_VERSION,\n };\n\n /**\n * check the rpc node is work or not.\n * @returns {boolean} whether can connect to the rpc.\n */\n isConnected() {\n return this.currentProvider && this.currentProvider.isConnected();\n }\n\n setProvider(provider) {\n this._requestManager.setProvider(provider);\n this.currentProvider = provider;\n }\n}\n/* eslint-enable */\n"],"names":["Sha256","sha256","value","hexStr","hash","_get__","update","hashUint8Array","digestSync","Buffer","from","toString","_getGlobalObject","global","e","window","_RewireModuleId__","_getRewireModuleId__","globalVariable","__$$GLOBAL_REWIRE_NEXT_MODULE_ID__","_getRewireRegistry__","theGlobalVariable","__$$GLOBAL_REWIRE_REGISTRY__","Object","create","_getRewiredData__","moduleId","registry","rewireData","registerResetAll","INTENTIONAL_UNDEFINED","_RewireAPI__","addPropertyToAPIObject","name","defineProperty","enumerable","configurable","_set__","_reset__","_with__","variableName","undefined","_get_original__","_assign__","_set_original__","_value","_update_operation__","operation","prefix","oldValue","newValue","keys","forEach","length","object","rewiredVariableNames","previousValues","reset","callback","result","then","catch","_typeOfOriginalExport","addNonEnumerableProperty","isExtensible","__get__","__GetDependency__","__Rewire__","__set__","__ResetDependency__","__RewireAPI__","descriptor","base58","inputAddressFormatter","address","realAddress","indexOf","parts","split","list","filter","v","decode","Error","outputFileDescriptorSetFormatter","buffer","FileDescriptorSet","UNSIGNED_256_INT","CHAIN_METHODS","getChainStatus","call","method","params","getChainState","getContractFileDescriptorSet","inputFormatter","outputFormatter","getBlockHeight","getBlock","getBlockByHeight","getTxResult","getTxResults","getMerklePathByTxId","getTransactionPoolStatus","sendTransaction","sendTransactions","calculateTransactionFee","callReadOnly","getPeers","addPeer","removePeer","networkInfo","UNIT_MAP","noether","wei","kwei","Kwei","babbage","femtoether","mwei","Mwei","lovelace","picoether","gwei","Gwei","shannon","nanoether","nano","szabo","microether","micro","finney","milliether","milli","ether","kether","grand","mether","gether","tether","TO_STRING_UTF8_ENCODING","DEFAULT_TO_STRING_ENCODING","CONGIG","AELF_POLLING_TIMEOUT","chainId","contractZeroAddress","contractZeroAbi","contractZero","defaultAccount","KEY_STORE_ERRORS","INVALID_PASSWORD","error","errorMessage","NOT_AELF_KEY_STORE","WRONG_VERSION","WRONG_KEY_STORE_VERSION","decodeAddressRep","isWrappedBytes","resolvedType","fieldsArray","type","isAddress","isHash","transform","inputType","origin","transformers","arguments","fieldsLength","transformer","fields","field","rule","Array","isArray","map","item","transformMapToArray","options","key","map_entry","transformArrayToMap","reduce","acc","resolvedFields","resolvedOptions","INPUT_TRANSFORMERS","h","replace","encodeAddress","str","buf","encode","OUTPUT_TRANSFORMERS","BigNumber","bs58","Transaction","data","encoding","TypeError","slice","check","index","chainIdConvertor","chainIdToBase58","bufferTemp","alloc","writeInt32LE","bytes","concat","base58ToChainId","base58String","readInt32LE","arrayBufferToHex","arrayBuffer","prototype","Uint8Array","n","join","arrayToHex","hex","padLeft","string","charLen","sign","padRight","b58rep","encodeAddressRep","isBigNumber","constructor","isString","isFunction","isObject","isBoolean","isJson","JSON","parse","toBigNumber","number","num","getValueOfUnit","unit","unitValue","toLowerCase","stringify","fromWei","returnValue","dividedBy","toWei","times","toTwosComplement","bigNumber","integerValue","isLessThan","plus","uint8ArrayToHex","uint8Array","noop","setPath","obj","path","paths","p","unpackSpecifiedTypeData","_ref","dataType","decoded","toObject","enums","String","longs","defaults","arrays","objects","oneofs","deserializeTransaction","rawTx","paramsDataType","to","refBlockPrefix","signature","rest","methodParameters","getAuthorization","userName","password","base","protobuf","coreDescriptor","utils","coreRootProto","Root","fromJSON","Hash","Address","TransactionFeeCharged","ResourceTokenCharged","getFee","base64Str","deserialize","deserializeLogResult","getSerializedDataFromLog","log","NonIndexed","Indexed","serializedData","push","getResourceFee","Logs","Name","getTransactionFee","getRepForAddress","message","fromObject","getAddressFromRep","rep","getAddressObjectFromRep","getRepForHash","getHashFromHex","getHashObjectFromHex","encodeTransaction","tx","finish","getTransaction","methodName","txn","_filterWildcardImport__","wildcardImport","validPropertyNames","propertyName","filteredWildcardImport","isBloom","bloom","test","codePointToInt","codePoint","isInBloom","i","bitpos","parseInt","substr","code","charCodeAt","Math","floor","offset","isEventInBloom","eventName","isIndexedInBloom","indexed","isAddressInBloom","encodedAddress","ChainMethod","requestMethod","requestManager","run","bind","formatInput","args","arg","formatter","setRequestManager","manager","formatOutput","extractArgumentsIntoObject","isSync","sync","_len","_key","argsObj","send","sendAsync","err","fromTwoBuffers","compared","compare","reverse","generateMerkleTree","nodeToAdd","newAdded","left","right","generateMerklePath","indexArg","leafCount","tree","firstInRow","rowcount","neighbor","shift","computeRoot","merkleTree","getMerklePath","node","createKeccakHash","require","keccak","bits","msg","l","instance","digest","keccak256","keccak512","keccak256s","keccak512s","scrypt","createCipheriv","createDecipheriv","randomBytes","AES_MODES","cipher","iv","mode","aes128","aes192","aes256","defaultOptions","dklen","r","getKeystore","mnemonic","privateKey","nickName","option","opt","sliceLength","salt","ivLength","derivedKey","privateKeyCipher","privateKeyEncrypted","final","mnemonicCipher","mnemonicEncrypted","rawMac","mac","version","crypto","ciphertext","cipherparams","kdf","kdfparams","unlockKeystore","_ref2","dkLen","currentMac","privateKeyDeCipher","mnemonicDeCipher","checkPassword","keyStoreInput","elliptic","bip39","hdkey","AES","encUTF8","keyStore","ellipticEc","ec","AESEncrypt","input","encrypt","AESDecrypt","decrypt","getAddressFromPubKey","pubKey","pubKeyEncoded","onceSHAResult","_getWallet","BIP44Path","rootSeed","childWallet","keyPair","hdWallet","generateMnemonic","mnemonicToSeedSync","fromMasterSeed","derive","keyFromPrivate","getPrivate","publicKey","getPublic","getSignature","bytesToBeSign","msgHash","sigObj","canonical","s","recoveryParam","createNewWallet","getWalletByMnemonic","validateMnemonic","getWalletByPrivateKey","signTransaction","rawTxn","ser","sig","hexString","_DefaultExportValue","wallet","ContractMethod","chain","contractAddress","walletInstance","_chain","_method","resolvedRequestType","resolvedResponseType","_inputType","_outputType","_name","_contractAddress","_wallet","unpackPackedInput","packInput","unpackOutput","bindMethodToContract","request","getSignedTx","getRawTx","inputPacked","output","packOutput","handleTransaction","height","encoded","prepareParametersAsync","filterArgs","status","BestChainHeight","BestChainHash","prepareParameters","prepareParametersWithBlockInfo","argsObject","parameters","_len2","_key2","_len3","_key3","blockHeightInput","blockHashInput","packedInput","refBlockNumber","blockHash","match","substring","_len4","_key4","format","contract","inputTypeInfo","toJSON","outputTypeInfo","outputType","getServicesFromFileDescriptors","descriptors","root","fromDescriptor","resolveAll","file","f","service","sn","fullName","package","lookupService","Contract","services","deserializeLog","logs","logName","logInThisAddress","lookupType","ContractFactory","fileDescriptorSet","bindMethodsToContract","methods","resolve","contractMethod","at","contractInstance","Chain","methodConfig","contractAt","fds","factory","txId","block","BlockHash","Body","txIds","Transactions","txIndex","findIndex","id","txResults","nodes","Status","results","RequestManager","provider","prepareRequest","toUpperCase","url","setProvider","requestBody","payload","defaultHeaders","Accept","RequestLibrary","isFetch","process","env","RUNTIME_ENV","_self","self","_window","XMLHttpRequest","fetch","HttpProvider","host","timeout","headers","formatResponse","response","formatResponseText","parseRequest","statusText","timeoutPromise","delay","Promise","_resolve","ids","setTimeout","clearTimeout","requestSendByFetch","requestConfig","signal","uri","myHeaders","Headers","body","header","append","sendAsyncByFetch","control","AbortController","config","credentials","race","reject","abort","text","res","ok","requestSend","isAsync","open","setRequestHeader","withCredentials","responseText","sendAsyncByXMLHttp","onreadystatechange","readyState","onerror","ontimeout","isConnected","isConnectedAsync","Settings","proto","AElf","_defineProperty","api","SDK_VERSION","_requestManager","currentProvider"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/aelf.umd.js b/dist/aelf.umd.js deleted file mode 100644 index e90da848..00000000 --- a/dist/aelf.umd.js +++ /dev/null @@ -1,3 +0,0 @@ -/*! For license information please see aelf.umd.js.LICENSE.txt */ -!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define("AElf",[],t):"object"==typeof exports?exports.AElf=t():e.AElf=t()}(globalThis,(()=>(()=>{var __webpack_modules__=[e=>{"function"==typeof Object.create?e.exports=function(e,t){t&&(e.super_=t,e.prototype=Object.create(t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}))}:e.exports=function(e,t){if(t){e.super_=t;var r=function(){};r.prototype=t.prototype,e.prototype=new r,e.prototype.constructor=e}}},(e,t,r)=>{var n=r(3),i=n.Buffer;function o(e,t){for(var r in e)t[r]=e[r]}function a(e,t,r){return i(e,t,r)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?e.exports=n:(o(n,t),t.Buffer=a),a.prototype=Object.create(i.prototype),o(i,a),a.from=function(e,t,r){if("number"==typeof e)throw new TypeError("Argument must not be a number");return i(e,t,r)},a.alloc=function(e,t,r){if("number"!=typeof e)throw new TypeError("Argument must be a number");var n=i(e);return void 0!==t?"string"==typeof r?n.fill(t,r):n.fill(t):n.fill(0),n},a.allocUnsafe=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return i(e)},a.allocUnsafeSlow=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return n.SlowBuffer(e)}},function(e,t,r){!function(e,t){"use strict";function n(e,t){if(!e)throw new Error(t||"Assertion failed")}function i(e,t){e.super_=t;var r=function(){};r.prototype=t.prototype,e.prototype=new r,e.prototype.constructor=e}function o(e,t,r){if(o.isBN(e))return e;this.negative=0,this.words=null,this.length=0,this.red=null,null!==e&&("le"!==t&&"be"!==t||(r=t,t=10),this._init(e||0,t||10,r||"be"))}var a;"object"==typeof e?e.exports=o:t.BN=o,o.BN=o,o.wordSize=26;try{a="undefined"!=typeof window&&void 0!==window.Buffer?window.Buffer:r(301).Buffer}catch(e){}function s(e,t){var r=e.charCodeAt(t);return r>=65&&r<=70?r-55:r>=97&&r<=102?r-87:r-48&15}function f(e,t,r){var n=s(e,r);return r-1>=t&&(n|=s(e,r-1)<<4),n}function u(e,t,r,n){for(var i=0,o=Math.min(e.length,r),a=t;a=49?s-49+10:s>=17?s-17+10:s}return i}o.isBN=function(e){return e instanceof o||null!==e&&"object"==typeof e&&e.constructor.wordSize===o.wordSize&&Array.isArray(e.words)},o.max=function(e,t){return e.cmp(t)>0?e:t},o.min=function(e,t){return e.cmp(t)<0?e:t},o.prototype._init=function(e,t,r){if("number"==typeof e)return this._initNumber(e,t,r);if("object"==typeof e)return this._initArray(e,t,r);"hex"===t&&(t=16),n(t===(0|t)&&t>=2&&t<=36);var i=0;"-"===(e=e.toString().replace(/\s+/g,""))[0]&&(i++,this.negative=1),i=0;i-=3)a=e[i]|e[i-1]<<8|e[i-2]<<16,this.words[o]|=a<>>26-s&67108863,(s+=24)>=26&&(s-=26,o++);else if("le"===r)for(i=0,o=0;i>>26-s&67108863,(s+=24)>=26&&(s-=26,o++);return this.strip()},o.prototype._parseHex=function(e,t,r){this.length=Math.ceil((e.length-t)/6),this.words=new Array(this.length);for(var n=0;n=t;n-=2)i=f(e,t,n)<=18?(o-=18,a+=1,this.words[a]|=i>>>26):o+=8;else for(n=(e.length-t)%2==0?t+1:t;n=18?(o-=18,a+=1,this.words[a]|=i>>>26):o+=8;this.strip()},o.prototype._parseBase=function(e,t,r){this.words=[0],this.length=1;for(var n=0,i=1;i<=67108863;i*=t)n++;n--,i=i/t|0;for(var o=e.length-r,a=o%n,s=Math.min(o,o-a)+r,f=0,c=r;c1&&0===this.words[this.length-1];)this.length--;return this._normSign()},o.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},o.prototype.inspect=function(){return(this.red?""};var c=["","0","00","000","0000","00000","000000","0000000","00000000","000000000","0000000000","00000000000","000000000000","0000000000000","00000000000000","000000000000000","0000000000000000","00000000000000000","000000000000000000","0000000000000000000","00000000000000000000","000000000000000000000","0000000000000000000000","00000000000000000000000","000000000000000000000000","0000000000000000000000000"],h=[0,0,25,16,12,11,10,9,8,8,7,7,7,7,6,6,6,6,6,6,6,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5],l=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function d(e,t,r){r.negative=t.negative^e.negative;var n=e.length+t.length|0;r.length=n,n=n-1|0;var i=0|e.words[0],o=0|t.words[0],a=i*o,s=67108863&a,f=a/67108864|0;r.words[0]=s;for(var u=1;u>>26,h=67108863&f,l=Math.min(u,t.length-1),d=Math.max(0,u-e.length+1);d<=l;d++){var p=u-d|0;c+=(a=(i=0|e.words[p])*(o=0|t.words[d])+h)/67108864|0,h=67108863&a}r.words[u]=0|h,f=0|c}return 0!==f?r.words[u]=0|f:r.length--,r.strip()}o.prototype.toString=function(e,t){var r;if(t=0|t||1,16===(e=e||10)||"hex"===e){r="";for(var i=0,o=0,a=0;a>>24-i&16777215)||a!==this.length-1?c[6-f.length]+f+r:f+r,(i+=2)>=26&&(i-=26,a--)}for(0!==o&&(r=o.toString(16)+r);r.length%t!=0;)r="0"+r;return 0!==this.negative&&(r="-"+r),r}if(e===(0|e)&&e>=2&&e<=36){var u=h[e],d=l[e];r="";var p=this.clone();for(p.negative=0;!p.isZero();){var b=p.modn(d).toString(e);r=(p=p.idivn(d)).isZero()?b+r:c[u-b.length]+b+r}for(this.isZero()&&(r="0"+r);r.length%t!=0;)r="0"+r;return 0!==this.negative&&(r="-"+r),r}n(!1,"Base should be between 2 and 36")},o.prototype.toNumber=function(){var e=this.words[0];return 2===this.length?e+=67108864*this.words[1]:3===this.length&&1===this.words[2]?e+=4503599627370496+67108864*this.words[1]:this.length>2&&n(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-e:e},o.prototype.toJSON=function(){return this.toString(16)},o.prototype.toBuffer=function(e,t){return n(void 0!==a),this.toArrayLike(a,e,t)},o.prototype.toArray=function(e,t){return this.toArrayLike(Array,e,t)},o.prototype.toArrayLike=function(e,t,r){var i=this.byteLength(),o=r||Math.max(1,i);n(i<=o,"byte array longer than desired length"),n(o>0,"Requested array length <= 0"),this.strip();var a,s,f="le"===t,u=new e(o),c=this.clone();if(f){for(s=0;!c.isZero();s++)a=c.andln(255),c.iushrn(8),u[s]=a;for(;s=4096&&(r+=13,t>>>=13),t>=64&&(r+=7,t>>>=7),t>=8&&(r+=4,t>>>=4),t>=2&&(r+=2,t>>>=2),r+t},o.prototype._zeroBits=function(e){if(0===e)return 26;var t=e,r=0;return 0==(8191&t)&&(r+=13,t>>>=13),0==(127&t)&&(r+=7,t>>>=7),0==(15&t)&&(r+=4,t>>>=4),0==(3&t)&&(r+=2,t>>>=2),0==(1&t)&&r++,r},o.prototype.bitLength=function(){var e=this.words[this.length-1],t=this._countBits(e);return 26*(this.length-1)+t},o.prototype.zeroBits=function(){if(this.isZero())return 0;for(var e=0,t=0;te.length?this.clone().ior(e):e.clone().ior(this)},o.prototype.uor=function(e){return this.length>e.length?this.clone().iuor(e):e.clone().iuor(this)},o.prototype.iuand=function(e){var t;t=this.length>e.length?e:this;for(var r=0;re.length?this.clone().iand(e):e.clone().iand(this)},o.prototype.uand=function(e){return this.length>e.length?this.clone().iuand(e):e.clone().iuand(this)},o.prototype.iuxor=function(e){var t,r;this.length>e.length?(t=this,r=e):(t=e,r=this);for(var n=0;ne.length?this.clone().ixor(e):e.clone().ixor(this)},o.prototype.uxor=function(e){return this.length>e.length?this.clone().iuxor(e):e.clone().iuxor(this)},o.prototype.inotn=function(e){n("number"==typeof e&&e>=0);var t=0|Math.ceil(e/26),r=e%26;this._expand(t),r>0&&t--;for(var i=0;i0&&(this.words[i]=~this.words[i]&67108863>>26-r),this.strip()},o.prototype.notn=function(e){return this.clone().inotn(e)},o.prototype.setn=function(e,t){n("number"==typeof e&&e>=0);var r=e/26|0,i=e%26;return this._expand(r+1),this.words[r]=t?this.words[r]|1<e.length?(r=this,n=e):(r=e,n=this);for(var i=0,o=0;o>>26;for(;0!==i&&o>>26;if(this.length=r.length,0!==i)this.words[this.length]=i,this.length++;else if(r!==this)for(;oe.length?this.clone().iadd(e):e.clone().iadd(this)},o.prototype.isub=function(e){if(0!==e.negative){e.negative=0;var t=this.iadd(e);return e.negative=1,t._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(e),this.negative=1,this._normSign();var r,n,i=this.cmp(e);if(0===i)return this.negative=0,this.length=1,this.words[0]=0,this;i>0?(r=this,n=e):(r=e,n=this);for(var o=0,a=0;a>26,this.words[a]=67108863&t;for(;0!==o&&a>26,this.words[a]=67108863&t;if(0===o&&a>>13,d=0|a[1],p=8191&d,b=d>>>13,y=0|a[2],m=8191&y,g=y>>>13,_=0|a[3],v=8191&_,w=_>>>13,E=0|a[4],S=8191&E,M=E>>>13,A=0|a[5],k=8191&A,R=A>>>13,O=0|a[6],T=8191&O,I=O>>>13,x=0|a[7],B=8191&x,j=x>>>13,L=0|a[8],P=8191&L,N=L>>>13,D=0|a[9],C=8191&D,U=D>>>13,q=0|s[0],F=8191&q,G=q>>>13,z=0|s[1],$=8191&z,W=z>>>13,H=0|s[2],K=8191&H,V=H>>>13,Y=0|s[3],X=8191&Y,J=Y>>>13,Z=0|s[4],Q=8191&Z,ee=Z>>>13,te=0|s[5],re=8191&te,ne=te>>>13,ie=0|s[6],oe=8191&ie,ae=ie>>>13,se=0|s[7],fe=8191&se,ue=se>>>13,ce=0|s[8],he=8191&ce,le=ce>>>13,de=0|s[9],pe=8191&de,be=de>>>13;r.negative=e.negative^t.negative,r.length=19;var ye=(u+(n=Math.imul(h,F))|0)+((8191&(i=(i=Math.imul(h,G))+Math.imul(l,F)|0))<<13)|0;u=((o=Math.imul(l,G))+(i>>>13)|0)+(ye>>>26)|0,ye&=67108863,n=Math.imul(p,F),i=(i=Math.imul(p,G))+Math.imul(b,F)|0,o=Math.imul(b,G);var me=(u+(n=n+Math.imul(h,$)|0)|0)+((8191&(i=(i=i+Math.imul(h,W)|0)+Math.imul(l,$)|0))<<13)|0;u=((o=o+Math.imul(l,W)|0)+(i>>>13)|0)+(me>>>26)|0,me&=67108863,n=Math.imul(m,F),i=(i=Math.imul(m,G))+Math.imul(g,F)|0,o=Math.imul(g,G),n=n+Math.imul(p,$)|0,i=(i=i+Math.imul(p,W)|0)+Math.imul(b,$)|0,o=o+Math.imul(b,W)|0;var ge=(u+(n=n+Math.imul(h,K)|0)|0)+((8191&(i=(i=i+Math.imul(h,V)|0)+Math.imul(l,K)|0))<<13)|0;u=((o=o+Math.imul(l,V)|0)+(i>>>13)|0)+(ge>>>26)|0,ge&=67108863,n=Math.imul(v,F),i=(i=Math.imul(v,G))+Math.imul(w,F)|0,o=Math.imul(w,G),n=n+Math.imul(m,$)|0,i=(i=i+Math.imul(m,W)|0)+Math.imul(g,$)|0,o=o+Math.imul(g,W)|0,n=n+Math.imul(p,K)|0,i=(i=i+Math.imul(p,V)|0)+Math.imul(b,K)|0,o=o+Math.imul(b,V)|0;var _e=(u+(n=n+Math.imul(h,X)|0)|0)+((8191&(i=(i=i+Math.imul(h,J)|0)+Math.imul(l,X)|0))<<13)|0;u=((o=o+Math.imul(l,J)|0)+(i>>>13)|0)+(_e>>>26)|0,_e&=67108863,n=Math.imul(S,F),i=(i=Math.imul(S,G))+Math.imul(M,F)|0,o=Math.imul(M,G),n=n+Math.imul(v,$)|0,i=(i=i+Math.imul(v,W)|0)+Math.imul(w,$)|0,o=o+Math.imul(w,W)|0,n=n+Math.imul(m,K)|0,i=(i=i+Math.imul(m,V)|0)+Math.imul(g,K)|0,o=o+Math.imul(g,V)|0,n=n+Math.imul(p,X)|0,i=(i=i+Math.imul(p,J)|0)+Math.imul(b,X)|0,o=o+Math.imul(b,J)|0;var ve=(u+(n=n+Math.imul(h,Q)|0)|0)+((8191&(i=(i=i+Math.imul(h,ee)|0)+Math.imul(l,Q)|0))<<13)|0;u=((o=o+Math.imul(l,ee)|0)+(i>>>13)|0)+(ve>>>26)|0,ve&=67108863,n=Math.imul(k,F),i=(i=Math.imul(k,G))+Math.imul(R,F)|0,o=Math.imul(R,G),n=n+Math.imul(S,$)|0,i=(i=i+Math.imul(S,W)|0)+Math.imul(M,$)|0,o=o+Math.imul(M,W)|0,n=n+Math.imul(v,K)|0,i=(i=i+Math.imul(v,V)|0)+Math.imul(w,K)|0,o=o+Math.imul(w,V)|0,n=n+Math.imul(m,X)|0,i=(i=i+Math.imul(m,J)|0)+Math.imul(g,X)|0,o=o+Math.imul(g,J)|0,n=n+Math.imul(p,Q)|0,i=(i=i+Math.imul(p,ee)|0)+Math.imul(b,Q)|0,o=o+Math.imul(b,ee)|0;var we=(u+(n=n+Math.imul(h,re)|0)|0)+((8191&(i=(i=i+Math.imul(h,ne)|0)+Math.imul(l,re)|0))<<13)|0;u=((o=o+Math.imul(l,ne)|0)+(i>>>13)|0)+(we>>>26)|0,we&=67108863,n=Math.imul(T,F),i=(i=Math.imul(T,G))+Math.imul(I,F)|0,o=Math.imul(I,G),n=n+Math.imul(k,$)|0,i=(i=i+Math.imul(k,W)|0)+Math.imul(R,$)|0,o=o+Math.imul(R,W)|0,n=n+Math.imul(S,K)|0,i=(i=i+Math.imul(S,V)|0)+Math.imul(M,K)|0,o=o+Math.imul(M,V)|0,n=n+Math.imul(v,X)|0,i=(i=i+Math.imul(v,J)|0)+Math.imul(w,X)|0,o=o+Math.imul(w,J)|0,n=n+Math.imul(m,Q)|0,i=(i=i+Math.imul(m,ee)|0)+Math.imul(g,Q)|0,o=o+Math.imul(g,ee)|0,n=n+Math.imul(p,re)|0,i=(i=i+Math.imul(p,ne)|0)+Math.imul(b,re)|0,o=o+Math.imul(b,ne)|0;var Ee=(u+(n=n+Math.imul(h,oe)|0)|0)+((8191&(i=(i=i+Math.imul(h,ae)|0)+Math.imul(l,oe)|0))<<13)|0;u=((o=o+Math.imul(l,ae)|0)+(i>>>13)|0)+(Ee>>>26)|0,Ee&=67108863,n=Math.imul(B,F),i=(i=Math.imul(B,G))+Math.imul(j,F)|0,o=Math.imul(j,G),n=n+Math.imul(T,$)|0,i=(i=i+Math.imul(T,W)|0)+Math.imul(I,$)|0,o=o+Math.imul(I,W)|0,n=n+Math.imul(k,K)|0,i=(i=i+Math.imul(k,V)|0)+Math.imul(R,K)|0,o=o+Math.imul(R,V)|0,n=n+Math.imul(S,X)|0,i=(i=i+Math.imul(S,J)|0)+Math.imul(M,X)|0,o=o+Math.imul(M,J)|0,n=n+Math.imul(v,Q)|0,i=(i=i+Math.imul(v,ee)|0)+Math.imul(w,Q)|0,o=o+Math.imul(w,ee)|0,n=n+Math.imul(m,re)|0,i=(i=i+Math.imul(m,ne)|0)+Math.imul(g,re)|0,o=o+Math.imul(g,ne)|0,n=n+Math.imul(p,oe)|0,i=(i=i+Math.imul(p,ae)|0)+Math.imul(b,oe)|0,o=o+Math.imul(b,ae)|0;var Se=(u+(n=n+Math.imul(h,fe)|0)|0)+((8191&(i=(i=i+Math.imul(h,ue)|0)+Math.imul(l,fe)|0))<<13)|0;u=((o=o+Math.imul(l,ue)|0)+(i>>>13)|0)+(Se>>>26)|0,Se&=67108863,n=Math.imul(P,F),i=(i=Math.imul(P,G))+Math.imul(N,F)|0,o=Math.imul(N,G),n=n+Math.imul(B,$)|0,i=(i=i+Math.imul(B,W)|0)+Math.imul(j,$)|0,o=o+Math.imul(j,W)|0,n=n+Math.imul(T,K)|0,i=(i=i+Math.imul(T,V)|0)+Math.imul(I,K)|0,o=o+Math.imul(I,V)|0,n=n+Math.imul(k,X)|0,i=(i=i+Math.imul(k,J)|0)+Math.imul(R,X)|0,o=o+Math.imul(R,J)|0,n=n+Math.imul(S,Q)|0,i=(i=i+Math.imul(S,ee)|0)+Math.imul(M,Q)|0,o=o+Math.imul(M,ee)|0,n=n+Math.imul(v,re)|0,i=(i=i+Math.imul(v,ne)|0)+Math.imul(w,re)|0,o=o+Math.imul(w,ne)|0,n=n+Math.imul(m,oe)|0,i=(i=i+Math.imul(m,ae)|0)+Math.imul(g,oe)|0,o=o+Math.imul(g,ae)|0,n=n+Math.imul(p,fe)|0,i=(i=i+Math.imul(p,ue)|0)+Math.imul(b,fe)|0,o=o+Math.imul(b,ue)|0;var Me=(u+(n=n+Math.imul(h,he)|0)|0)+((8191&(i=(i=i+Math.imul(h,le)|0)+Math.imul(l,he)|0))<<13)|0;u=((o=o+Math.imul(l,le)|0)+(i>>>13)|0)+(Me>>>26)|0,Me&=67108863,n=Math.imul(C,F),i=(i=Math.imul(C,G))+Math.imul(U,F)|0,o=Math.imul(U,G),n=n+Math.imul(P,$)|0,i=(i=i+Math.imul(P,W)|0)+Math.imul(N,$)|0,o=o+Math.imul(N,W)|0,n=n+Math.imul(B,K)|0,i=(i=i+Math.imul(B,V)|0)+Math.imul(j,K)|0,o=o+Math.imul(j,V)|0,n=n+Math.imul(T,X)|0,i=(i=i+Math.imul(T,J)|0)+Math.imul(I,X)|0,o=o+Math.imul(I,J)|0,n=n+Math.imul(k,Q)|0,i=(i=i+Math.imul(k,ee)|0)+Math.imul(R,Q)|0,o=o+Math.imul(R,ee)|0,n=n+Math.imul(S,re)|0,i=(i=i+Math.imul(S,ne)|0)+Math.imul(M,re)|0,o=o+Math.imul(M,ne)|0,n=n+Math.imul(v,oe)|0,i=(i=i+Math.imul(v,ae)|0)+Math.imul(w,oe)|0,o=o+Math.imul(w,ae)|0,n=n+Math.imul(m,fe)|0,i=(i=i+Math.imul(m,ue)|0)+Math.imul(g,fe)|0,o=o+Math.imul(g,ue)|0,n=n+Math.imul(p,he)|0,i=(i=i+Math.imul(p,le)|0)+Math.imul(b,he)|0,o=o+Math.imul(b,le)|0;var Ae=(u+(n=n+Math.imul(h,pe)|0)|0)+((8191&(i=(i=i+Math.imul(h,be)|0)+Math.imul(l,pe)|0))<<13)|0;u=((o=o+Math.imul(l,be)|0)+(i>>>13)|0)+(Ae>>>26)|0,Ae&=67108863,n=Math.imul(C,$),i=(i=Math.imul(C,W))+Math.imul(U,$)|0,o=Math.imul(U,W),n=n+Math.imul(P,K)|0,i=(i=i+Math.imul(P,V)|0)+Math.imul(N,K)|0,o=o+Math.imul(N,V)|0,n=n+Math.imul(B,X)|0,i=(i=i+Math.imul(B,J)|0)+Math.imul(j,X)|0,o=o+Math.imul(j,J)|0,n=n+Math.imul(T,Q)|0,i=(i=i+Math.imul(T,ee)|0)+Math.imul(I,Q)|0,o=o+Math.imul(I,ee)|0,n=n+Math.imul(k,re)|0,i=(i=i+Math.imul(k,ne)|0)+Math.imul(R,re)|0,o=o+Math.imul(R,ne)|0,n=n+Math.imul(S,oe)|0,i=(i=i+Math.imul(S,ae)|0)+Math.imul(M,oe)|0,o=o+Math.imul(M,ae)|0,n=n+Math.imul(v,fe)|0,i=(i=i+Math.imul(v,ue)|0)+Math.imul(w,fe)|0,o=o+Math.imul(w,ue)|0,n=n+Math.imul(m,he)|0,i=(i=i+Math.imul(m,le)|0)+Math.imul(g,he)|0,o=o+Math.imul(g,le)|0;var ke=(u+(n=n+Math.imul(p,pe)|0)|0)+((8191&(i=(i=i+Math.imul(p,be)|0)+Math.imul(b,pe)|0))<<13)|0;u=((o=o+Math.imul(b,be)|0)+(i>>>13)|0)+(ke>>>26)|0,ke&=67108863,n=Math.imul(C,K),i=(i=Math.imul(C,V))+Math.imul(U,K)|0,o=Math.imul(U,V),n=n+Math.imul(P,X)|0,i=(i=i+Math.imul(P,J)|0)+Math.imul(N,X)|0,o=o+Math.imul(N,J)|0,n=n+Math.imul(B,Q)|0,i=(i=i+Math.imul(B,ee)|0)+Math.imul(j,Q)|0,o=o+Math.imul(j,ee)|0,n=n+Math.imul(T,re)|0,i=(i=i+Math.imul(T,ne)|0)+Math.imul(I,re)|0,o=o+Math.imul(I,ne)|0,n=n+Math.imul(k,oe)|0,i=(i=i+Math.imul(k,ae)|0)+Math.imul(R,oe)|0,o=o+Math.imul(R,ae)|0,n=n+Math.imul(S,fe)|0,i=(i=i+Math.imul(S,ue)|0)+Math.imul(M,fe)|0,o=o+Math.imul(M,ue)|0,n=n+Math.imul(v,he)|0,i=(i=i+Math.imul(v,le)|0)+Math.imul(w,he)|0,o=o+Math.imul(w,le)|0;var Re=(u+(n=n+Math.imul(m,pe)|0)|0)+((8191&(i=(i=i+Math.imul(m,be)|0)+Math.imul(g,pe)|0))<<13)|0;u=((o=o+Math.imul(g,be)|0)+(i>>>13)|0)+(Re>>>26)|0,Re&=67108863,n=Math.imul(C,X),i=(i=Math.imul(C,J))+Math.imul(U,X)|0,o=Math.imul(U,J),n=n+Math.imul(P,Q)|0,i=(i=i+Math.imul(P,ee)|0)+Math.imul(N,Q)|0,o=o+Math.imul(N,ee)|0,n=n+Math.imul(B,re)|0,i=(i=i+Math.imul(B,ne)|0)+Math.imul(j,re)|0,o=o+Math.imul(j,ne)|0,n=n+Math.imul(T,oe)|0,i=(i=i+Math.imul(T,ae)|0)+Math.imul(I,oe)|0,o=o+Math.imul(I,ae)|0,n=n+Math.imul(k,fe)|0,i=(i=i+Math.imul(k,ue)|0)+Math.imul(R,fe)|0,o=o+Math.imul(R,ue)|0,n=n+Math.imul(S,he)|0,i=(i=i+Math.imul(S,le)|0)+Math.imul(M,he)|0,o=o+Math.imul(M,le)|0;var Oe=(u+(n=n+Math.imul(v,pe)|0)|0)+((8191&(i=(i=i+Math.imul(v,be)|0)+Math.imul(w,pe)|0))<<13)|0;u=((o=o+Math.imul(w,be)|0)+(i>>>13)|0)+(Oe>>>26)|0,Oe&=67108863,n=Math.imul(C,Q),i=(i=Math.imul(C,ee))+Math.imul(U,Q)|0,o=Math.imul(U,ee),n=n+Math.imul(P,re)|0,i=(i=i+Math.imul(P,ne)|0)+Math.imul(N,re)|0,o=o+Math.imul(N,ne)|0,n=n+Math.imul(B,oe)|0,i=(i=i+Math.imul(B,ae)|0)+Math.imul(j,oe)|0,o=o+Math.imul(j,ae)|0,n=n+Math.imul(T,fe)|0,i=(i=i+Math.imul(T,ue)|0)+Math.imul(I,fe)|0,o=o+Math.imul(I,ue)|0,n=n+Math.imul(k,he)|0,i=(i=i+Math.imul(k,le)|0)+Math.imul(R,he)|0,o=o+Math.imul(R,le)|0;var Te=(u+(n=n+Math.imul(S,pe)|0)|0)+((8191&(i=(i=i+Math.imul(S,be)|0)+Math.imul(M,pe)|0))<<13)|0;u=((o=o+Math.imul(M,be)|0)+(i>>>13)|0)+(Te>>>26)|0,Te&=67108863,n=Math.imul(C,re),i=(i=Math.imul(C,ne))+Math.imul(U,re)|0,o=Math.imul(U,ne),n=n+Math.imul(P,oe)|0,i=(i=i+Math.imul(P,ae)|0)+Math.imul(N,oe)|0,o=o+Math.imul(N,ae)|0,n=n+Math.imul(B,fe)|0,i=(i=i+Math.imul(B,ue)|0)+Math.imul(j,fe)|0,o=o+Math.imul(j,ue)|0,n=n+Math.imul(T,he)|0,i=(i=i+Math.imul(T,le)|0)+Math.imul(I,he)|0,o=o+Math.imul(I,le)|0;var Ie=(u+(n=n+Math.imul(k,pe)|0)|0)+((8191&(i=(i=i+Math.imul(k,be)|0)+Math.imul(R,pe)|0))<<13)|0;u=((o=o+Math.imul(R,be)|0)+(i>>>13)|0)+(Ie>>>26)|0,Ie&=67108863,n=Math.imul(C,oe),i=(i=Math.imul(C,ae))+Math.imul(U,oe)|0,o=Math.imul(U,ae),n=n+Math.imul(P,fe)|0,i=(i=i+Math.imul(P,ue)|0)+Math.imul(N,fe)|0,o=o+Math.imul(N,ue)|0,n=n+Math.imul(B,he)|0,i=(i=i+Math.imul(B,le)|0)+Math.imul(j,he)|0,o=o+Math.imul(j,le)|0;var xe=(u+(n=n+Math.imul(T,pe)|0)|0)+((8191&(i=(i=i+Math.imul(T,be)|0)+Math.imul(I,pe)|0))<<13)|0;u=((o=o+Math.imul(I,be)|0)+(i>>>13)|0)+(xe>>>26)|0,xe&=67108863,n=Math.imul(C,fe),i=(i=Math.imul(C,ue))+Math.imul(U,fe)|0,o=Math.imul(U,ue),n=n+Math.imul(P,he)|0,i=(i=i+Math.imul(P,le)|0)+Math.imul(N,he)|0,o=o+Math.imul(N,le)|0;var Be=(u+(n=n+Math.imul(B,pe)|0)|0)+((8191&(i=(i=i+Math.imul(B,be)|0)+Math.imul(j,pe)|0))<<13)|0;u=((o=o+Math.imul(j,be)|0)+(i>>>13)|0)+(Be>>>26)|0,Be&=67108863,n=Math.imul(C,he),i=(i=Math.imul(C,le))+Math.imul(U,he)|0,o=Math.imul(U,le);var je=(u+(n=n+Math.imul(P,pe)|0)|0)+((8191&(i=(i=i+Math.imul(P,be)|0)+Math.imul(N,pe)|0))<<13)|0;u=((o=o+Math.imul(N,be)|0)+(i>>>13)|0)+(je>>>26)|0,je&=67108863;var Le=(u+(n=Math.imul(C,pe))|0)+((8191&(i=(i=Math.imul(C,be))+Math.imul(U,pe)|0))<<13)|0;return u=((o=Math.imul(U,be))+(i>>>13)|0)+(Le>>>26)|0,Le&=67108863,f[0]=ye,f[1]=me,f[2]=ge,f[3]=_e,f[4]=ve,f[5]=we,f[6]=Ee,f[7]=Se,f[8]=Me,f[9]=Ae,f[10]=ke,f[11]=Re,f[12]=Oe,f[13]=Te,f[14]=Ie,f[15]=xe,f[16]=Be,f[17]=je,f[18]=Le,0!==u&&(f[19]=u,r.length++),r};function b(e,t,r){return(new y).mulp(e,t,r)}function y(e,t){this.x=e,this.y=t}Math.imul||(p=d),o.prototype.mulTo=function(e,t){var r,n=this.length+e.length;return r=10===this.length&&10===e.length?p(this,e,t):n<63?d(this,e,t):n<1024?function(e,t,r){r.negative=t.negative^e.negative,r.length=e.length+t.length;for(var n=0,i=0,o=0;o>>26)|0)>>>26,a&=67108863}r.words[o]=s,n=a,a=i}return 0!==n?r.words[o]=n:r.length--,r.strip()}(this,e,t):b(this,e,t),r},y.prototype.makeRBT=function(e){for(var t=new Array(e),r=o.prototype._countBits(e)-1,n=0;n>=1;return n},y.prototype.permute=function(e,t,r,n,i,o){for(var a=0;a>>=1)i++;return 1<>>=13,r[2*a+1]=8191&o,o>>>=13;for(a=2*t;a>=26,t+=i/67108864|0,t+=o>>>26,this.words[r]=67108863&o}return 0!==t&&(this.words[r]=t,this.length++),this},o.prototype.muln=function(e){return this.clone().imuln(e)},o.prototype.sqr=function(){return this.mul(this)},o.prototype.isqr=function(){return this.imul(this.clone())},o.prototype.pow=function(e){var t=function(e){for(var t=new Array(e.bitLength()),r=0;r>>i}return t}(e);if(0===t.length)return new o(1);for(var r=this,n=0;n=0);var t,r=e%26,i=(e-r)/26,o=67108863>>>26-r<<26-r;if(0!==r){var a=0;for(t=0;t>>26-r}a&&(this.words[t]=a,this.length++)}if(0!==i){for(t=this.length-1;t>=0;t--)this.words[t+i]=this.words[t];for(t=0;t=0),i=t?(t-t%26)/26:0;var o=e%26,a=Math.min((e-o)/26,this.length),s=67108863^67108863>>>o<a)for(this.length-=a,u=0;u=0&&(0!==c||u>=i);u--){var h=0|this.words[u];this.words[u]=c<<26-o|h>>>o,c=h&s}return f&&0!==c&&(f.words[f.length++]=c),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},o.prototype.ishrn=function(e,t,r){return n(0===this.negative),this.iushrn(e,t,r)},o.prototype.shln=function(e){return this.clone().ishln(e)},o.prototype.ushln=function(e){return this.clone().iushln(e)},o.prototype.shrn=function(e){return this.clone().ishrn(e)},o.prototype.ushrn=function(e){return this.clone().iushrn(e)},o.prototype.testn=function(e){n("number"==typeof e&&e>=0);var t=e%26,r=(e-t)/26,i=1<=0);var t=e%26,r=(e-t)/26;if(n(0===this.negative,"imaskn works only with positive numbers"),this.length<=r)return this;if(0!==t&&r++,this.length=Math.min(r,this.length),0!==t){var i=67108863^67108863>>>t<=67108864;t++)this.words[t]-=67108864,t===this.length-1?this.words[t+1]=1:this.words[t+1]++;return this.length=Math.max(this.length,t+1),this},o.prototype.isubn=function(e){if(n("number"==typeof e),n(e<67108864),e<0)return this.iaddn(-e);if(0!==this.negative)return this.negative=0,this.iaddn(e),this.negative=1,this;if(this.words[0]-=e,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var t=0;t>26)-(f/67108864|0),this.words[i+r]=67108863&o}for(;i>26,this.words[i+r]=67108863&o;if(0===s)return this.strip();for(n(-1===s),s=0,i=0;i>26,this.words[i]=67108863&o;return this.negative=1,this.strip()},o.prototype._wordDiv=function(e,t){var r=(this.length,e.length),n=this.clone(),i=e,a=0|i.words[i.length-1];0!=(r=26-this._countBits(a))&&(i=i.ushln(r),n.iushln(r),a=0|i.words[i.length-1]);var s,f=n.length-i.length;if("mod"!==t){(s=new o(null)).length=f+1,s.words=new Array(s.length);for(var u=0;u=0;h--){var l=67108864*(0|n.words[i.length+h])+(0|n.words[i.length+h-1]);for(l=Math.min(l/a|0,67108863),n._ishlnsubmul(i,l,h);0!==n.negative;)l--,n.negative=0,n._ishlnsubmul(i,1,h),n.isZero()||(n.negative^=1);s&&(s.words[h]=l)}return s&&s.strip(),n.strip(),"div"!==t&&0!==r&&n.iushrn(r),{div:s||null,mod:n}},o.prototype.divmod=function(e,t,r){return n(!e.isZero()),this.isZero()?{div:new o(0),mod:new o(0)}:0!==this.negative&&0===e.negative?(s=this.neg().divmod(e,t),"mod"!==t&&(i=s.div.neg()),"div"!==t&&(a=s.mod.neg(),r&&0!==a.negative&&a.iadd(e)),{div:i,mod:a}):0===this.negative&&0!==e.negative?(s=this.divmod(e.neg(),t),"mod"!==t&&(i=s.div.neg()),{div:i,mod:s.mod}):0!=(this.negative&e.negative)?(s=this.neg().divmod(e.neg(),t),"div"!==t&&(a=s.mod.neg(),r&&0!==a.negative&&a.isub(e)),{div:s.div,mod:a}):e.length>this.length||this.cmp(e)<0?{div:new o(0),mod:this}:1===e.length?"div"===t?{div:this.divn(e.words[0]),mod:null}:"mod"===t?{div:null,mod:new o(this.modn(e.words[0]))}:{div:this.divn(e.words[0]),mod:new o(this.modn(e.words[0]))}:this._wordDiv(e,t);var i,a,s},o.prototype.div=function(e){return this.divmod(e,"div",!1).div},o.prototype.mod=function(e){return this.divmod(e,"mod",!1).mod},o.prototype.umod=function(e){return this.divmod(e,"mod",!0).mod},o.prototype.divRound=function(e){var t=this.divmod(e);if(t.mod.isZero())return t.div;var r=0!==t.div.negative?t.mod.isub(e):t.mod,n=e.ushrn(1),i=e.andln(1),o=r.cmp(n);return o<0||1===i&&0===o?t.div:0!==t.div.negative?t.div.isubn(1):t.div.iaddn(1)},o.prototype.modn=function(e){n(e<=67108863);for(var t=(1<<26)%e,r=0,i=this.length-1;i>=0;i--)r=(t*r+(0|this.words[i]))%e;return r},o.prototype.idivn=function(e){n(e<=67108863);for(var t=0,r=this.length-1;r>=0;r--){var i=(0|this.words[r])+67108864*t;this.words[r]=i/e|0,t=i%e}return this.strip()},o.prototype.divn=function(e){return this.clone().idivn(e)},o.prototype.egcd=function(e){n(0===e.negative),n(!e.isZero());var t=this,r=e.clone();t=0!==t.negative?t.umod(e):t.clone();for(var i=new o(1),a=new o(0),s=new o(0),f=new o(1),u=0;t.isEven()&&r.isEven();)t.iushrn(1),r.iushrn(1),++u;for(var c=r.clone(),h=t.clone();!t.isZero();){for(var l=0,d=1;0==(t.words[0]&d)&&l<26;++l,d<<=1);if(l>0)for(t.iushrn(l);l-- >0;)(i.isOdd()||a.isOdd())&&(i.iadd(c),a.isub(h)),i.iushrn(1),a.iushrn(1);for(var p=0,b=1;0==(r.words[0]&b)&&p<26;++p,b<<=1);if(p>0)for(r.iushrn(p);p-- >0;)(s.isOdd()||f.isOdd())&&(s.iadd(c),f.isub(h)),s.iushrn(1),f.iushrn(1);t.cmp(r)>=0?(t.isub(r),i.isub(s),a.isub(f)):(r.isub(t),s.isub(i),f.isub(a))}return{a:s,b:f,gcd:r.iushln(u)}},o.prototype._invmp=function(e){n(0===e.negative),n(!e.isZero());var t=this,r=e.clone();t=0!==t.negative?t.umod(e):t.clone();for(var i,a=new o(1),s=new o(0),f=r.clone();t.cmpn(1)>0&&r.cmpn(1)>0;){for(var u=0,c=1;0==(t.words[0]&c)&&u<26;++u,c<<=1);if(u>0)for(t.iushrn(u);u-- >0;)a.isOdd()&&a.iadd(f),a.iushrn(1);for(var h=0,l=1;0==(r.words[0]&l)&&h<26;++h,l<<=1);if(h>0)for(r.iushrn(h);h-- >0;)s.isOdd()&&s.iadd(f),s.iushrn(1);t.cmp(r)>=0?(t.isub(r),a.isub(s)):(r.isub(t),s.isub(a))}return(i=0===t.cmpn(1)?a:s).cmpn(0)<0&&i.iadd(e),i},o.prototype.gcd=function(e){if(this.isZero())return e.abs();if(e.isZero())return this.abs();var t=this.clone(),r=e.clone();t.negative=0,r.negative=0;for(var n=0;t.isEven()&&r.isEven();n++)t.iushrn(1),r.iushrn(1);for(;;){for(;t.isEven();)t.iushrn(1);for(;r.isEven();)r.iushrn(1);var i=t.cmp(r);if(i<0){var o=t;t=r,r=o}else if(0===i||0===r.cmpn(1))break;t.isub(r)}return r.iushln(n)},o.prototype.invm=function(e){return this.egcd(e).a.umod(e)},o.prototype.isEven=function(){return 0==(1&this.words[0])},o.prototype.isOdd=function(){return 1==(1&this.words[0])},o.prototype.andln=function(e){return this.words[0]&e},o.prototype.bincn=function(e){n("number"==typeof e);var t=e%26,r=(e-t)/26,i=1<>>26,s&=67108863,this.words[a]=s}return 0!==o&&(this.words[a]=o,this.length++),this},o.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},o.prototype.cmpn=function(e){var t,r=e<0;if(0!==this.negative&&!r)return-1;if(0===this.negative&&r)return 1;if(this.strip(),this.length>1)t=1;else{r&&(e=-e),n(e<=67108863,"Number is too big");var i=0|this.words[0];t=i===e?0:ie.length)return 1;if(this.length=0;r--){var n=0|this.words[r],i=0|e.words[r];if(n!==i){ni&&(t=1);break}}return t},o.prototype.gtn=function(e){return 1===this.cmpn(e)},o.prototype.gt=function(e){return 1===this.cmp(e)},o.prototype.gten=function(e){return this.cmpn(e)>=0},o.prototype.gte=function(e){return this.cmp(e)>=0},o.prototype.ltn=function(e){return-1===this.cmpn(e)},o.prototype.lt=function(e){return-1===this.cmp(e)},o.prototype.lten=function(e){return this.cmpn(e)<=0},o.prototype.lte=function(e){return this.cmp(e)<=0},o.prototype.eqn=function(e){return 0===this.cmpn(e)},o.prototype.eq=function(e){return 0===this.cmp(e)},o.red=function(e){return new S(e)},o.prototype.toRed=function(e){return n(!this.red,"Already a number in reduction context"),n(0===this.negative,"red works only with positives"),e.convertTo(this)._forceRed(e)},o.prototype.fromRed=function(){return n(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},o.prototype._forceRed=function(e){return this.red=e,this},o.prototype.forceRed=function(e){return n(!this.red,"Already a number in reduction context"),this._forceRed(e)},o.prototype.redAdd=function(e){return n(this.red,"redAdd works only with red numbers"),this.red.add(this,e)},o.prototype.redIAdd=function(e){return n(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,e)},o.prototype.redSub=function(e){return n(this.red,"redSub works only with red numbers"),this.red.sub(this,e)},o.prototype.redISub=function(e){return n(this.red,"redISub works only with red numbers"),this.red.isub(this,e)},o.prototype.redShl=function(e){return n(this.red,"redShl works only with red numbers"),this.red.shl(this,e)},o.prototype.redMul=function(e){return n(this.red,"redMul works only with red numbers"),this.red._verify2(this,e),this.red.mul(this,e)},o.prototype.redIMul=function(e){return n(this.red,"redMul works only with red numbers"),this.red._verify2(this,e),this.red.imul(this,e)},o.prototype.redSqr=function(){return n(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},o.prototype.redISqr=function(){return n(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},o.prototype.redSqrt=function(){return n(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},o.prototype.redInvm=function(){return n(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},o.prototype.redNeg=function(){return n(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},o.prototype.redPow=function(e){return n(this.red&&!e.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,e)};var m={k256:null,p224:null,p192:null,p25519:null};function g(e,t){this.name=e,this.p=new o(t,16),this.n=this.p.bitLength(),this.k=new o(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function _(){g.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function v(){g.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function w(){g.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function E(){g.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function S(e){if("string"==typeof e){var t=o._prime(e);this.m=t.p,this.prime=t}else n(e.gtn(1),"modulus must be greater than 1"),this.m=e,this.prime=null}function M(e){S.call(this,e),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new o(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}g.prototype._tmp=function(){var e=new o(null);return e.words=new Array(Math.ceil(this.n/13)),e},g.prototype.ireduce=function(e){var t,r=e;do{this.split(r,this.tmp),t=(r=(r=this.imulK(r)).iadd(this.tmp)).bitLength()}while(t>this.n);var n=t0?r.isub(this.p):void 0!==r.strip?r.strip():r._strip(),r},g.prototype.split=function(e,t){e.iushrn(this.n,0,t)},g.prototype.imulK=function(e){return e.imul(this.k)},i(_,g),_.prototype.split=function(e,t){for(var r=4194303,n=Math.min(e.length,9),i=0;i>>22,o=a}o>>>=22,e.words[i-10]=o,0===o&&e.length>10?e.length-=10:e.length-=9},_.prototype.imulK=function(e){e.words[e.length]=0,e.words[e.length+1]=0,e.length+=2;for(var t=0,r=0;r>>=26,e.words[r]=i,t=n}return 0!==t&&(e.words[e.length++]=t),e},o._prime=function(e){if(m[e])return m[e];var t;if("k256"===e)t=new _;else if("p224"===e)t=new v;else if("p192"===e)t=new w;else{if("p25519"!==e)throw new Error("Unknown prime "+e);t=new E}return m[e]=t,t},S.prototype._verify1=function(e){n(0===e.negative,"red works only with positives"),n(e.red,"red works only with red numbers")},S.prototype._verify2=function(e,t){n(0==(e.negative|t.negative),"red works only with positives"),n(e.red&&e.red===t.red,"red works only with red numbers")},S.prototype.imod=function(e){return this.prime?this.prime.ireduce(e)._forceRed(this):e.umod(this.m)._forceRed(this)},S.prototype.neg=function(e){return e.isZero()?e.clone():this.m.sub(e)._forceRed(this)},S.prototype.add=function(e,t){this._verify2(e,t);var r=e.add(t);return r.cmp(this.m)>=0&&r.isub(this.m),r._forceRed(this)},S.prototype.iadd=function(e,t){this._verify2(e,t);var r=e.iadd(t);return r.cmp(this.m)>=0&&r.isub(this.m),r},S.prototype.sub=function(e,t){this._verify2(e,t);var r=e.sub(t);return r.cmpn(0)<0&&r.iadd(this.m),r._forceRed(this)},S.prototype.isub=function(e,t){this._verify2(e,t);var r=e.isub(t);return r.cmpn(0)<0&&r.iadd(this.m),r},S.prototype.shl=function(e,t){return this._verify1(e),this.imod(e.ushln(t))},S.prototype.imul=function(e,t){return this._verify2(e,t),this.imod(e.imul(t))},S.prototype.mul=function(e,t){return this._verify2(e,t),this.imod(e.mul(t))},S.prototype.isqr=function(e){return this.imul(e,e.clone())},S.prototype.sqr=function(e){return this.mul(e,e)},S.prototype.sqrt=function(e){if(e.isZero())return e.clone();var t=this.m.andln(3);if(n(t%2==1),3===t){var r=this.m.add(new o(1)).iushrn(2);return this.pow(e,r)}for(var i=this.m.subn(1),a=0;!i.isZero()&&0===i.andln(1);)a++,i.iushrn(1);n(!i.isZero());var s=new o(1).toRed(this),f=s.redNeg(),u=this.m.subn(1).iushrn(1),c=this.m.bitLength();for(c=new o(2*c*c).toRed(this);0!==this.pow(c,u).cmp(f);)c.redIAdd(f);for(var h=this.pow(c,i),l=this.pow(e,i.addn(1).iushrn(1)),d=this.pow(e,i),p=a;0!==d.cmp(s);){for(var b=d,y=0;0!==b.cmp(s);y++)b=b.redSqr();n(y=0;n--){for(var u=t.words[n],c=f-1;c>=0;c--){var h=u>>c&1;i!==r[0]&&(i=this.sqr(i)),0!==h||0!==a?(a<<=1,a|=h,(4==++s||0===n&&0===c)&&(i=this.mul(i,r[a]),s=0,a=0)):s=0}f=26}return i},S.prototype.convertTo=function(e){var t=e.umod(this.m);return t===e?t.clone():t},S.prototype.convertFrom=function(e){var t=e.clone();return t.red=null,t},o.mont=function(e){return new M(e)},i(M,S),M.prototype.convertTo=function(e){return this.imod(e.ushln(this.shift))},M.prototype.convertFrom=function(e){var t=this.imod(e.mul(this.rinv));return t.red=null,t},M.prototype.imul=function(e,t){if(e.isZero()||t.isZero())return e.words[0]=0,e.length=1,e;var r=e.imul(t),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),o=i;return i.cmp(this.m)>=0?o=i.isub(this.m):i.cmpn(0)<0&&(o=i.iadd(this.m)),o._forceRed(this)},M.prototype.mul=function(e,t){if(e.isZero()||t.isZero())return new o(0)._forceRed(this);var r=e.mul(t),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),a=i;return i.cmp(this.m)>=0?a=i.isub(this.m):i.cmpn(0)<0&&(a=i.iadd(this.m)),a._forceRed(this)},M.prototype.invm=function(e){return this.imod(e._invmp(this.m).mul(this.r2))._forceRed(this)}}(e=r.nmd(e),this)},(e,t,r)=>{"use strict";const n=r(295),i=r(296),o="function"==typeof Symbol&&"function"==typeof Symbol.for?Symbol.for("nodejs.util.inspect.custom"):null;t.Buffer=f,t.SlowBuffer=function(e){return+e!=e&&(e=0),f.alloc(+e)},t.INSPECT_MAX_BYTES=50;const a=2147483647;function s(e){if(e>a)throw new RangeError('The value "'+e+'" is invalid for option "size"');const t=new Uint8Array(e);return Object.setPrototypeOf(t,f.prototype),t}function f(e,t,r){if("number"==typeof e){if("string"==typeof t)throw new TypeError('The "string" argument must be of type string. Received type number');return h(e)}return u(e,t,r)}function u(e,t,r){if("string"==typeof e)return function(e,t){if("string"==typeof t&&""!==t||(t="utf8"),!f.isEncoding(t))throw new TypeError("Unknown encoding: "+t);const r=0|b(e,t);let n=s(r);const i=n.write(e,t);return i!==r&&(n=n.slice(0,i)),n}(e,t);if(ArrayBuffer.isView(e))return function(e){if(Y(e,Uint8Array)){const t=new Uint8Array(e);return d(t.buffer,t.byteOffset,t.byteLength)}return l(e)}(e);if(null==e)throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof e);if(Y(e,ArrayBuffer)||e&&Y(e.buffer,ArrayBuffer))return d(e,t,r);if("undefined"!=typeof SharedArrayBuffer&&(Y(e,SharedArrayBuffer)||e&&Y(e.buffer,SharedArrayBuffer)))return d(e,t,r);if("number"==typeof e)throw new TypeError('The "value" argument must not be of type number. Received type number');const n=e.valueOf&&e.valueOf();if(null!=n&&n!==e)return f.from(n,t,r);const i=function(e){if(f.isBuffer(e)){const t=0|p(e.length),r=s(t);return 0===r.length||e.copy(r,0,0,t),r}return void 0!==e.length?"number"!=typeof e.length||X(e.length)?s(0):l(e):"Buffer"===e.type&&Array.isArray(e.data)?l(e.data):void 0}(e);if(i)return i;if("undefined"!=typeof Symbol&&null!=Symbol.toPrimitive&&"function"==typeof e[Symbol.toPrimitive])return f.from(e[Symbol.toPrimitive]("string"),t,r);throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof e)}function c(e){if("number"!=typeof e)throw new TypeError('"size" argument must be of type number');if(e<0)throw new RangeError('The value "'+e+'" is invalid for option "size"')}function h(e){return c(e),s(e<0?0:0|p(e))}function l(e){const t=e.length<0?0:0|p(e.length),r=s(t);for(let n=0;n=a)throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+a.toString(16)+" bytes");return 0|e}function b(e,t){if(f.isBuffer(e))return e.length;if(ArrayBuffer.isView(e)||Y(e,ArrayBuffer))return e.byteLength;if("string"!=typeof e)throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type '+typeof e);const r=e.length,n=arguments.length>2&&!0===arguments[2];if(!n&&0===r)return 0;let i=!1;for(;;)switch(t){case"ascii":case"latin1":case"binary":return r;case"utf8":case"utf-8":return H(e).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*r;case"hex":return r>>>1;case"base64":return K(e).length;default:if(i)return n?-1:H(e).length;t=(""+t).toLowerCase(),i=!0}}function y(e,t,r){let n=!1;if((void 0===t||t<0)&&(t=0),t>this.length)return"";if((void 0===r||r>this.length)&&(r=this.length),r<=0)return"";if((r>>>=0)<=(t>>>=0))return"";for(e||(e="utf8");;)switch(e){case"hex":return I(this,t,r);case"utf8":case"utf-8":return k(this,t,r);case"ascii":return O(this,t,r);case"latin1":case"binary":return T(this,t,r);case"base64":return A(this,t,r);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return x(this,t,r);default:if(n)throw new TypeError("Unknown encoding: "+e);e=(e+"").toLowerCase(),n=!0}}function m(e,t,r){const n=e[t];e[t]=e[r],e[r]=n}function g(e,t,r,n,i){if(0===e.length)return-1;if("string"==typeof r?(n=r,r=0):r>2147483647?r=2147483647:r<-2147483648&&(r=-2147483648),X(r=+r)&&(r=i?0:e.length-1),r<0&&(r=e.length+r),r>=e.length){if(i)return-1;r=e.length-1}else if(r<0){if(!i)return-1;r=0}if("string"==typeof t&&(t=f.from(t,n)),f.isBuffer(t))return 0===t.length?-1:_(e,t,r,n,i);if("number"==typeof t)return t&=255,"function"==typeof Uint8Array.prototype.indexOf?i?Uint8Array.prototype.indexOf.call(e,t,r):Uint8Array.prototype.lastIndexOf.call(e,t,r):_(e,[t],r,n,i);throw new TypeError("val must be string, number or Buffer")}function _(e,t,r,n,i){let o,a=1,s=e.length,f=t.length;if(void 0!==n&&("ucs2"===(n=String(n).toLowerCase())||"ucs-2"===n||"utf16le"===n||"utf-16le"===n)){if(e.length<2||t.length<2)return-1;a=2,s/=2,f/=2,r/=2}function u(e,t){return 1===a?e[t]:e.readUInt16BE(t*a)}if(i){let n=-1;for(o=r;os&&(r=s-f),o=r;o>=0;o--){let r=!0;for(let n=0;ni&&(n=i):n=i;const o=t.length;let a;for(n>o/2&&(n=o/2),a=0;a>8,i=r%256,o.push(i),o.push(n);return o}(t,e.length-r),e,r,n)}function A(e,t,r){return 0===t&&r===e.length?n.fromByteArray(e):n.fromByteArray(e.slice(t,r))}function k(e,t,r){r=Math.min(e.length,r);const n=[];let i=t;for(;i239?4:t>223?3:t>191?2:1;if(i+a<=r){let r,n,s,f;switch(a){case 1:t<128&&(o=t);break;case 2:r=e[i+1],128==(192&r)&&(f=(31&t)<<6|63&r,f>127&&(o=f));break;case 3:r=e[i+1],n=e[i+2],128==(192&r)&&128==(192&n)&&(f=(15&t)<<12|(63&r)<<6|63&n,f>2047&&(f<55296||f>57343)&&(o=f));break;case 4:r=e[i+1],n=e[i+2],s=e[i+3],128==(192&r)&&128==(192&n)&&128==(192&s)&&(f=(15&t)<<18|(63&r)<<12|(63&n)<<6|63&s,f>65535&&f<1114112&&(o=f))}}null===o?(o=65533,a=1):o>65535&&(o-=65536,n.push(o>>>10&1023|55296),o=56320|1023&o),n.push(o),i+=a}return function(e){const t=e.length;if(t<=R)return String.fromCharCode.apply(String,e);let r="",n=0;for(;nn.length?(f.isBuffer(t)||(t=f.from(t)),t.copy(n,i)):Uint8Array.prototype.set.call(n,t,i);else{if(!f.isBuffer(t))throw new TypeError('"list" argument must be an Array of Buffers');t.copy(n,i)}i+=t.length}return n},f.byteLength=b,f.prototype._isBuffer=!0,f.prototype.swap16=function(){const e=this.length;if(e%2!=0)throw new RangeError("Buffer size must be a multiple of 16-bits");for(let t=0;tr&&(e+=" ... "),""},o&&(f.prototype[o]=f.prototype.inspect),f.prototype.compare=function(e,t,r,n,i){if(Y(e,Uint8Array)&&(e=f.from(e,e.offset,e.byteLength)),!f.isBuffer(e))throw new TypeError('The "target" argument must be one of type Buffer or Uint8Array. Received type '+typeof e);if(void 0===t&&(t=0),void 0===r&&(r=e?e.length:0),void 0===n&&(n=0),void 0===i&&(i=this.length),t<0||r>e.length||n<0||i>this.length)throw new RangeError("out of range index");if(n>=i&&t>=r)return 0;if(n>=i)return-1;if(t>=r)return 1;if(this===e)return 0;let o=(i>>>=0)-(n>>>=0),a=(r>>>=0)-(t>>>=0);const s=Math.min(o,a),u=this.slice(n,i),c=e.slice(t,r);for(let e=0;e>>=0,isFinite(r)?(r>>>=0,void 0===n&&(n="utf8")):(n=r,r=void 0)}const i=this.length-t;if((void 0===r||r>i)&&(r=i),e.length>0&&(r<0||t<0)||t>this.length)throw new RangeError("Attempt to write outside buffer bounds");n||(n="utf8");let o=!1;for(;;)switch(n){case"hex":return v(this,e,t,r);case"utf8":case"utf-8":return w(this,e,t,r);case"ascii":case"latin1":case"binary":return E(this,e,t,r);case"base64":return S(this,e,t,r);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return M(this,e,t,r);default:if(o)throw new TypeError("Unknown encoding: "+n);n=(""+n).toLowerCase(),o=!0}},f.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};const R=4096;function O(e,t,r){let n="";r=Math.min(e.length,r);for(let i=t;in)&&(r=n);let i="";for(let n=t;nr)throw new RangeError("Trying to access beyond buffer length")}function j(e,t,r,n,i,o){if(!f.isBuffer(e))throw new TypeError('"buffer" argument must be a Buffer instance');if(t>i||te.length)throw new RangeError("Index out of range")}function L(e,t,r,n,i){G(t,n,i,e,r,7);let o=Number(t&BigInt(4294967295));e[r++]=o,o>>=8,e[r++]=o,o>>=8,e[r++]=o,o>>=8,e[r++]=o;let a=Number(t>>BigInt(32)&BigInt(4294967295));return e[r++]=a,a>>=8,e[r++]=a,a>>=8,e[r++]=a,a>>=8,e[r++]=a,r}function P(e,t,r,n,i){G(t,n,i,e,r,7);let o=Number(t&BigInt(4294967295));e[r+7]=o,o>>=8,e[r+6]=o,o>>=8,e[r+5]=o,o>>=8,e[r+4]=o;let a=Number(t>>BigInt(32)&BigInt(4294967295));return e[r+3]=a,a>>=8,e[r+2]=a,a>>=8,e[r+1]=a,a>>=8,e[r]=a,r+8}function N(e,t,r,n,i,o){if(r+n>e.length)throw new RangeError("Index out of range");if(r<0)throw new RangeError("Index out of range")}function D(e,t,r,n,o){return t=+t,r>>>=0,o||N(e,0,r,4),i.write(e,t,r,n,23,4),r+4}function C(e,t,r,n,o){return t=+t,r>>>=0,o||N(e,0,r,8),i.write(e,t,r,n,52,8),r+8}f.prototype.slice=function(e,t){const r=this.length;(e=~~e)<0?(e+=r)<0&&(e=0):e>r&&(e=r),(t=void 0===t?r:~~t)<0?(t+=r)<0&&(t=0):t>r&&(t=r),t>>=0,t>>>=0,r||B(e,t,this.length);let n=this[e],i=1,o=0;for(;++o>>=0,t>>>=0,r||B(e,t,this.length);let n=this[e+--t],i=1;for(;t>0&&(i*=256);)n+=this[e+--t]*i;return n},f.prototype.readUint8=f.prototype.readUInt8=function(e,t){return e>>>=0,t||B(e,1,this.length),this[e]},f.prototype.readUint16LE=f.prototype.readUInt16LE=function(e,t){return e>>>=0,t||B(e,2,this.length),this[e]|this[e+1]<<8},f.prototype.readUint16BE=f.prototype.readUInt16BE=function(e,t){return e>>>=0,t||B(e,2,this.length),this[e]<<8|this[e+1]},f.prototype.readUint32LE=f.prototype.readUInt32LE=function(e,t){return e>>>=0,t||B(e,4,this.length),(this[e]|this[e+1]<<8|this[e+2]<<16)+16777216*this[e+3]},f.prototype.readUint32BE=f.prototype.readUInt32BE=function(e,t){return e>>>=0,t||B(e,4,this.length),16777216*this[e]+(this[e+1]<<16|this[e+2]<<8|this[e+3])},f.prototype.readBigUInt64LE=Z((function(e){z(e>>>=0,"offset");const t=this[e],r=this[e+7];void 0!==t&&void 0!==r||$(e,this.length-8);const n=t+256*this[++e]+65536*this[++e]+this[++e]*2**24,i=this[++e]+256*this[++e]+65536*this[++e]+r*2**24;return BigInt(n)+(BigInt(i)<>>=0,"offset");const t=this[e],r=this[e+7];void 0!==t&&void 0!==r||$(e,this.length-8);const n=t*2**24+65536*this[++e]+256*this[++e]+this[++e],i=this[++e]*2**24+65536*this[++e]+256*this[++e]+r;return(BigInt(n)<>>=0,t>>>=0,r||B(e,t,this.length);let n=this[e],i=1,o=0;for(;++o=i&&(n-=Math.pow(2,8*t)),n},f.prototype.readIntBE=function(e,t,r){e>>>=0,t>>>=0,r||B(e,t,this.length);let n=t,i=1,o=this[e+--n];for(;n>0&&(i*=256);)o+=this[e+--n]*i;return i*=128,o>=i&&(o-=Math.pow(2,8*t)),o},f.prototype.readInt8=function(e,t){return e>>>=0,t||B(e,1,this.length),128&this[e]?-1*(255-this[e]+1):this[e]},f.prototype.readInt16LE=function(e,t){e>>>=0,t||B(e,2,this.length);const r=this[e]|this[e+1]<<8;return 32768&r?4294901760|r:r},f.prototype.readInt16BE=function(e,t){e>>>=0,t||B(e,2,this.length);const r=this[e+1]|this[e]<<8;return 32768&r?4294901760|r:r},f.prototype.readInt32LE=function(e,t){return e>>>=0,t||B(e,4,this.length),this[e]|this[e+1]<<8|this[e+2]<<16|this[e+3]<<24},f.prototype.readInt32BE=function(e,t){return e>>>=0,t||B(e,4,this.length),this[e]<<24|this[e+1]<<16|this[e+2]<<8|this[e+3]},f.prototype.readBigInt64LE=Z((function(e){z(e>>>=0,"offset");const t=this[e],r=this[e+7];void 0!==t&&void 0!==r||$(e,this.length-8);const n=this[e+4]+256*this[e+5]+65536*this[e+6]+(r<<24);return(BigInt(n)<>>=0,"offset");const t=this[e],r=this[e+7];void 0!==t&&void 0!==r||$(e,this.length-8);const n=(t<<24)+65536*this[++e]+256*this[++e]+this[++e];return(BigInt(n)<>>=0,t||B(e,4,this.length),i.read(this,e,!0,23,4)},f.prototype.readFloatBE=function(e,t){return e>>>=0,t||B(e,4,this.length),i.read(this,e,!1,23,4)},f.prototype.readDoubleLE=function(e,t){return e>>>=0,t||B(e,8,this.length),i.read(this,e,!0,52,8)},f.prototype.readDoubleBE=function(e,t){return e>>>=0,t||B(e,8,this.length),i.read(this,e,!1,52,8)},f.prototype.writeUintLE=f.prototype.writeUIntLE=function(e,t,r,n){e=+e,t>>>=0,r>>>=0,n||j(this,e,t,r,Math.pow(2,8*r)-1,0);let i=1,o=0;for(this[t]=255&e;++o>>=0,r>>>=0,n||j(this,e,t,r,Math.pow(2,8*r)-1,0);let i=r-1,o=1;for(this[t+i]=255&e;--i>=0&&(o*=256);)this[t+i]=e/o&255;return t+r},f.prototype.writeUint8=f.prototype.writeUInt8=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,1,255,0),this[t]=255&e,t+1},f.prototype.writeUint16LE=f.prototype.writeUInt16LE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,2,65535,0),this[t]=255&e,this[t+1]=e>>>8,t+2},f.prototype.writeUint16BE=f.prototype.writeUInt16BE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,2,65535,0),this[t]=e>>>8,this[t+1]=255&e,t+2},f.prototype.writeUint32LE=f.prototype.writeUInt32LE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,4,4294967295,0),this[t+3]=e>>>24,this[t+2]=e>>>16,this[t+1]=e>>>8,this[t]=255&e,t+4},f.prototype.writeUint32BE=f.prototype.writeUInt32BE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,4,4294967295,0),this[t]=e>>>24,this[t+1]=e>>>16,this[t+2]=e>>>8,this[t+3]=255&e,t+4},f.prototype.writeBigUInt64LE=Z((function(e,t=0){return L(this,e,t,BigInt(0),BigInt("0xffffffffffffffff"))})),f.prototype.writeBigUInt64BE=Z((function(e,t=0){return P(this,e,t,BigInt(0),BigInt("0xffffffffffffffff"))})),f.prototype.writeIntLE=function(e,t,r,n){if(e=+e,t>>>=0,!n){const n=Math.pow(2,8*r-1);j(this,e,t,r,n-1,-n)}let i=0,o=1,a=0;for(this[t]=255&e;++i>0)-a&255;return t+r},f.prototype.writeIntBE=function(e,t,r,n){if(e=+e,t>>>=0,!n){const n=Math.pow(2,8*r-1);j(this,e,t,r,n-1,-n)}let i=r-1,o=1,a=0;for(this[t+i]=255&e;--i>=0&&(o*=256);)e<0&&0===a&&0!==this[t+i+1]&&(a=1),this[t+i]=(e/o>>0)-a&255;return t+r},f.prototype.writeInt8=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,1,127,-128),e<0&&(e=255+e+1),this[t]=255&e,t+1},f.prototype.writeInt16LE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,2,32767,-32768),this[t]=255&e,this[t+1]=e>>>8,t+2},f.prototype.writeInt16BE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,2,32767,-32768),this[t]=e>>>8,this[t+1]=255&e,t+2},f.prototype.writeInt32LE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,4,2147483647,-2147483648),this[t]=255&e,this[t+1]=e>>>8,this[t+2]=e>>>16,this[t+3]=e>>>24,t+4},f.prototype.writeInt32BE=function(e,t,r){return e=+e,t>>>=0,r||j(this,e,t,4,2147483647,-2147483648),e<0&&(e=4294967295+e+1),this[t]=e>>>24,this[t+1]=e>>>16,this[t+2]=e>>>8,this[t+3]=255&e,t+4},f.prototype.writeBigInt64LE=Z((function(e,t=0){return L(this,e,t,-BigInt("0x8000000000000000"),BigInt("0x7fffffffffffffff"))})),f.prototype.writeBigInt64BE=Z((function(e,t=0){return P(this,e,t,-BigInt("0x8000000000000000"),BigInt("0x7fffffffffffffff"))})),f.prototype.writeFloatLE=function(e,t,r){return D(this,e,t,!0,r)},f.prototype.writeFloatBE=function(e,t,r){return D(this,e,t,!1,r)},f.prototype.writeDoubleLE=function(e,t,r){return C(this,e,t,!0,r)},f.prototype.writeDoubleBE=function(e,t,r){return C(this,e,t,!1,r)},f.prototype.copy=function(e,t,r,n){if(!f.isBuffer(e))throw new TypeError("argument should be a Buffer");if(r||(r=0),n||0===n||(n=this.length),t>=e.length&&(t=e.length),t||(t=0),n>0&&n=this.length)throw new RangeError("Index out of range");if(n<0)throw new RangeError("sourceEnd out of bounds");n>this.length&&(n=this.length),e.length-t>>=0,r=void 0===r?this.length:r>>>0,e||(e=0),"number"==typeof e)for(i=t;i=n+4;r-=3)t=`_${e.slice(r-3,r)}${t}`;return`${e.slice(0,r)}${t}`}function G(e,t,r,n,i,o){if(e>r||e3?0===t||t===BigInt(0)?`>= 0${n} and < 2${n} ** ${8*(o+1)}${n}`:`>= -(2${n} ** ${8*(o+1)-1}${n}) and < 2 ** ${8*(o+1)-1}${n}`:`>= ${t}${n} and <= ${r}${n}`,new U.ERR_OUT_OF_RANGE("value",i,e)}!function(e,t,r){z(t,"offset"),void 0!==e[t]&&void 0!==e[t+r]||$(t,e.length-(r+1))}(n,i,o)}function z(e,t){if("number"!=typeof e)throw new U.ERR_INVALID_ARG_TYPE(t,"number",e)}function $(e,t,r){if(Math.floor(e)!==e)throw z(e,r),new U.ERR_OUT_OF_RANGE(r||"offset","an integer",e);if(t<0)throw new U.ERR_BUFFER_OUT_OF_BOUNDS;throw new U.ERR_OUT_OF_RANGE(r||"offset",`>= ${r?1:0} and <= ${t}`,e)}q("ERR_BUFFER_OUT_OF_BOUNDS",(function(e){return e?`${e} is outside of buffer bounds`:"Attempt to access memory outside buffer bounds"}),RangeError),q("ERR_INVALID_ARG_TYPE",(function(e,t){return`The "${e}" argument must be of type number. Received type ${typeof t}`}),TypeError),q("ERR_OUT_OF_RANGE",(function(e,t,r){let n=`The value of "${e}" is out of range.`,i=r;return Number.isInteger(r)&&Math.abs(r)>2**32?i=F(String(r)):"bigint"==typeof r&&(i=String(r),(r>BigInt(2)**BigInt(32)||r<-(BigInt(2)**BigInt(32)))&&(i=F(i)),i+="n"),n+=` It must be ${t}. Received ${i}`,n}),RangeError);const W=/[^+/0-9A-Za-z-_]/g;function H(e,t){let r;t=t||1/0;const n=e.length;let i=null;const o=[];for(let a=0;a55295&&r<57344){if(!i){if(r>56319){(t-=3)>-1&&o.push(239,191,189);continue}if(a+1===n){(t-=3)>-1&&o.push(239,191,189);continue}i=r;continue}if(r<56320){(t-=3)>-1&&o.push(239,191,189),i=r;continue}r=65536+(i-55296<<10|r-56320)}else i&&(t-=3)>-1&&o.push(239,191,189);if(i=null,r<128){if((t-=1)<0)break;o.push(r)}else if(r<2048){if((t-=2)<0)break;o.push(r>>6|192,63&r|128)}else if(r<65536){if((t-=3)<0)break;o.push(r>>12|224,r>>6&63|128,63&r|128)}else{if(!(r<1114112))throw new Error("Invalid code point");if((t-=4)<0)break;o.push(r>>18|240,r>>12&63|128,r>>6&63|128,63&r|128)}}return o}function K(e){return n.toByteArray(function(e){if((e=(e=e.split("=")[0]).trim().replace(W,"")).length<2)return"";for(;e.length%4!=0;)e+="=";return e}(e))}function V(e,t,r,n){let i;for(i=0;i=t.length||i>=e.length);++i)t[i+r]=e[i];return i}function Y(e,t){return e instanceof t||null!=e&&null!=e.constructor&&null!=e.constructor.name&&e.constructor.name===t.name}function X(e){return e!=e}const J=function(){const e="0123456789abcdef",t=new Array(256);for(let r=0;r<16;++r){const n=16*r;for(let i=0;i<16;++i)t[n+i]=e[r]+e[i]}return t}();function Z(e){return"undefined"==typeof BigInt?Q:e}function Q(){throw new Error("BigInt not supported")}},(e,t,r)=>{"use strict";var n,i,o=e.exports=r(8),a=r(79);o.codegen=r(174),o.fetch=r(175),o.path=r(176),o.fs=o.inquire("fs"),o.toArray=function(e){if(e){for(var t=Object.keys(e),r=new Array(t.length),n=0;n{"use strict";var n=t,i=r(2),o=r(6),a=r(86);n.assert=o,n.toArray=a.toArray,n.zero2=a.zero2,n.toHex=a.toHex,n.encode=a.encode,n.getNAF=function(e,t,r){var n=new Array(Math.max(e.bitLength(),r)+1);n.fill(0);for(var i=1<(i>>1)-1?(i>>1)-f:f,o.isubn(s)):s=0,n[a]=s,o.iushrn(1)}return n},n.getJSF=function(e,t){var r=[[],[]];e=e.clone(),t=t.clone();for(var n,i=0,o=0;e.cmpn(-i)>0||t.cmpn(-o)>0;){var a,s,f=e.andln(3)+i&3,u=t.andln(3)+o&3;3===f&&(f=-1),3===u&&(u=-1),a=0==(1&f)?0:3!=(n=e.andln(7)+i&7)&&5!==n||2!==u?f:-f,r[0].push(a),s=0==(1&u)?0:3!=(n=t.andln(7)+o&7)&&5!==n||2!==f?u:-u,r[1].push(s),2*i===a+1&&(i=1-i),2*o===s+1&&(o=1-o),e.iushrn(1),t.iushrn(1)}return r},n.cachedProperty=function(e,t,r){var n="_"+t;e.prototype[t]=function(){return void 0!==this[n]?this[n]:this[n]=r.call(this)}},n.parseBytes=function(e){return"string"==typeof e?n.toArray(e,"hex"):e},n.intFromLE=function(e){return new i(e,"hex","le")}},e=>{function t(e,t){if(!e)throw new Error(t||"Assertion failed")}e.exports=t,t.equal=function(e,t,r){if(e!=t)throw new Error(r||"Assertion failed: "+e+" != "+t)}},(e,t,r)=>{"use strict";e.exports=a;var n=r(16);((a.prototype=Object.create(n.prototype)).constructor=a).className="Enum";var i=r(19),o=r(4);function a(e,t,r,i,o){if(n.call(this,e,r),t&&"object"!=typeof t)throw TypeError("values must be an object");if(this.valuesById={},this.values=Object.create(this.valuesById),this.comment=i,this.comments=o||{},this.reserved=void 0,t)for(var a=Object.keys(t),s=0;s0)},n.BufferTemp=r(3).Buffer,n.Buffer=function(){try{var e=n.inquire("buffer").Buffer;return e.prototype.utf8Write?e:null}catch(e){return null}}(),n._Buffer_from=null,n._Buffer_allocUnsafe=null,n.newBuffer=function(e){return"number"==typeof e?n.Buffer?n._Buffer_allocUnsafe(e):new n.Array(e):n.Buffer?n._Buffer_from(e):"undefined"==typeof Uint8Array?e:new Uint8Array(e)},n.Array="undefined"!=typeof Uint8Array?Uint8Array:Array,n.Long=n.global.dcodeIO&&n.global.dcodeIO.Long||n.global.Long||n.inquire("long"),n.key2Re=/^true|false|0|1$/,n.key32Re=/^-?(?:0|[1-9][0-9]*)$/,n.key64Re=/^(?:[\\x00-\\xff]{8}|-?(?:0|[1-9][0-9]*))$/,n.longToHash=function(e){return e?n.LongBits.from(e).toHash():n.LongBits.zeroHash},n.longFromHash=function(e,t){var r=n.LongBits.fromHash(e);return n.Long?n.Long.fromBits(r.lo,r.hi,t):r.toNumber(Boolean(t))},n.merge=i,n.lcFirst=function(e){return e.charAt(0).toLowerCase()+e.substring(1)},n.newError=o,n.ProtocolError=o("ProtocolError"),n.oneOfGetter=function(e){for(var t={},r=0;r-1;--r)if(1===t[e[r]]&&void 0!==this[e[r]]&&null!==this[e[r]])return e[r]}},n.oneOfSetter=function(e){return function(t){for(var r=0;r{"use strict";var n=r(6),i=r(0);function o(e,t){return 55296==(64512&e.charCodeAt(t))&&!(t<0||t+1>=e.length)&&56320==(64512&e.charCodeAt(t+1))}function a(e){return(e>>>24|e>>>8&65280|e<<8&16711680|(255&e)<<24)>>>0}function s(e){return 1===e.length?"0"+e:e}function f(e){return 7===e.length?"0"+e:6===e.length?"00"+e:5===e.length?"000"+e:4===e.length?"0000"+e:3===e.length?"00000"+e:2===e.length?"000000"+e:1===e.length?"0000000"+e:e}t.inherits=i,t.toArray=function(e,t){if(Array.isArray(e))return e.slice();if(!e)return[];var r=[];if("string"==typeof e)if(t){if("hex"===t)for((e=e.replace(/[^a-z0-9]+/gi,"")).length%2!=0&&(e="0"+e),i=0;i>6|192,r[n++]=63&a|128):o(e,i)?(a=65536+((1023&a)<<10)+(1023&e.charCodeAt(++i)),r[n++]=a>>18|240,r[n++]=a>>12&63|128,r[n++]=a>>6&63|128,r[n++]=63&a|128):(r[n++]=a>>12|224,r[n++]=a>>6&63|128,r[n++]=63&a|128)}else for(i=0;i>>0}return a},t.split32=function(e,t){for(var r=new Array(4*e.length),n=0,i=0;n>>24,r[i+1]=o>>>16&255,r[i+2]=o>>>8&255,r[i+3]=255&o):(r[i+3]=o>>>24,r[i+2]=o>>>16&255,r[i+1]=o>>>8&255,r[i]=255&o)}return r},t.rotr32=function(e,t){return e>>>t|e<<32-t},t.rotl32=function(e,t){return e<>>32-t},t.sum32=function(e,t){return e+t>>>0},t.sum32_3=function(e,t,r){return e+t+r>>>0},t.sum32_4=function(e,t,r,n){return e+t+r+n>>>0},t.sum32_5=function(e,t,r,n,i){return e+t+r+n+i>>>0},t.sum64=function(e,t,r,n){var i=e[t],o=n+e[t+1]>>>0,a=(o>>0,e[t+1]=o},t.sum64_hi=function(e,t,r,n){return(t+n>>>0>>0},t.sum64_lo=function(e,t,r,n){return t+n>>>0},t.sum64_4_hi=function(e,t,r,n,i,o,a,s){var f=0,u=t;return f+=(u=u+n>>>0)>>0)>>0)>>0},t.sum64_4_lo=function(e,t,r,n,i,o,a,s){return t+n+o+s>>>0},t.sum64_5_hi=function(e,t,r,n,i,o,a,s,f,u){var c=0,h=t;return c+=(h=h+n>>>0)>>0)>>0)>>0)>>0},t.sum64_5_lo=function(e,t,r,n,i,o,a,s,f,u){return t+n+o+s+u>>>0},t.rotr64_hi=function(e,t,r){return(t<<32-r|e>>>r)>>>0},t.rotr64_lo=function(e,t,r){return(e<<32-r|t>>>r)>>>0},t.shr64_hi=function(e,t,r){return e>>>r},t.shr64_lo=function(e,t,r){return(e<<32-r|t>>>r)>>>0}},e=>{"use strict";var t,r="object"==typeof Reflect?Reflect:null,n=r&&"function"==typeof r.apply?r.apply:function(e,t,r){return Function.prototype.apply.call(e,t,r)};t=r&&"function"==typeof r.ownKeys?r.ownKeys:Object.getOwnPropertySymbols?function(e){return Object.getOwnPropertyNames(e).concat(Object.getOwnPropertySymbols(e))}:function(e){return Object.getOwnPropertyNames(e)};var i=Number.isNaN||function(e){return e!=e};function o(){o.init.call(this)}e.exports=o,e.exports.once=function(e,t){return new Promise((function(r,n){function i(r){e.removeListener(t,o),n(r)}function o(){"function"==typeof e.removeListener&&e.removeListener("error",i),r([].slice.call(arguments))}b(e,t,o,{once:!0}),"error"!==t&&function(e,t,r){"function"==typeof e.on&&b(e,"error",t,{once:!0})}(e,i)}))},o.EventEmitter=o,o.prototype._events=void 0,o.prototype._eventsCount=0,o.prototype._maxListeners=void 0;var a=10;function s(e){if("function"!=typeof e)throw new TypeError('The "listener" argument must be of type Function. Received type '+typeof e)}function f(e){return void 0===e._maxListeners?o.defaultMaxListeners:e._maxListeners}function u(e,t,r,n){var i,o,a,u;if(s(r),void 0===(o=e._events)?(o=e._events=Object.create(null),e._eventsCount=0):(void 0!==o.newListener&&(e.emit("newListener",t,r.listener?r.listener:r),o=e._events),a=o[t]),void 0===a)a=o[t]=r,++e._eventsCount;else if("function"==typeof a?a=o[t]=n?[r,a]:[a,r]:n?a.unshift(r):a.push(r),(i=f(e))>0&&a.length>i&&!a.warned){a.warned=!0;var c=new Error("Possible EventEmitter memory leak detected. "+a.length+" "+String(t)+" listeners added. Use emitter.setMaxListeners() to increase limit");c.name="MaxListenersExceededWarning",c.emitter=e,c.type=t,c.count=a.length,u=c,console&&console.warn&&console.warn(u)}return e}function c(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function h(e,t,r){var n={fired:!1,wrapFn:void 0,target:e,type:t,listener:r},i=c.bind(n);return i.listener=r,n.wrapFn=i,i}function l(e,t,r){var n=e._events;if(void 0===n)return[];var i=n[t];return void 0===i?[]:"function"==typeof i?r?[i.listener||i]:[i]:r?function(e){for(var t=new Array(e.length),r=0;r0&&(a=t[0]),a instanceof Error)throw a;var s=new Error("Unhandled error."+(a?" ("+a.message+")":""));throw s.context=a,s}var f=o[e];if(void 0===f)return!1;if("function"==typeof f)n(f,this,t);else{var u=f.length,c=p(f,u);for(r=0;r=0;o--)if(r[o]===t||r[o].listener===t){a=r[o].listener,i=o;break}if(i<0)return this;0===i?r.shift():function(e,t){for(;t+1=0;n--)this.removeListener(e,t[n]);return this},o.prototype.listeners=function(e){return l(this,e,!0)},o.prototype.rawListeners=function(e){return l(this,e,!1)},o.listenerCount=function(e,t){return"function"==typeof e.listenerCount?e.listenerCount(t):d.call(e,t)},o.prototype.listenerCount=d,o.prototype.eventNames=function(){return this._eventsCount>0?t(this._events):[]}},function(e,t,r){var n;e.exports=(n=n||function(e,t){var n;if("undefined"!=typeof window&&window.crypto&&(n=window.crypto),"undefined"!=typeof self&&self.crypto&&(n=self.crypto),"undefined"!=typeof globalThis&&globalThis.crypto&&(n=globalThis.crypto),!n&&"undefined"!=typeof window&&window.msCrypto&&(n=window.msCrypto),!n&&void 0!==r.g&&r.g.crypto&&(n=r.g.crypto),!n)try{n=r(334)}catch(e){}var i=function(){if(n){if("function"==typeof n.getRandomValues)try{return n.getRandomValues(new Uint32Array(1))[0]}catch(e){}if("function"==typeof n.randomBytes)try{return n.randomBytes(4).readInt32LE()}catch(e){}}throw new Error("Native crypto module could not be used to get secure random number.")},o=Object.create||function(){function e(){}return function(t){var r;return e.prototype=t,r=new e,e.prototype=null,r}}(),a={},s=a.lib={},f=s.Base={extend:function(e){var t=o(this);return e&&t.mixIn(e),t.hasOwnProperty("init")&&this.init!==t.init||(t.init=function(){t.$super.init.apply(this,arguments)}),t.init.prototype=t,t.$super=this,t},create:function(){var e=this.extend();return e.init.apply(e,arguments),e},init:function(){},mixIn:function(e){for(var t in e)e.hasOwnProperty(t)&&(this[t]=e[t]);e.hasOwnProperty("toString")&&(this.toString=e.toString)},clone:function(){return this.init.prototype.extend(this)}},u=s.WordArray=f.extend({init:function(e,t){e=this.words=e||[],this.sigBytes=null!=t?t:4*e.length},toString:function(e){return(e||h).stringify(this)},concat:function(e){var t=this.words,r=e.words,n=this.sigBytes,i=e.sigBytes;if(this.clamp(),n%4)for(var o=0;o>>2]>>>24-o%4*8&255;t[n+o>>>2]|=a<<24-(n+o)%4*8}else for(var s=0;s>>2]=r[s>>>2];return this.sigBytes+=i,this},clamp:function(){var t=this.words,r=this.sigBytes;t[r>>>2]&=4294967295<<32-r%4*8,t.length=e.ceil(r/4)},clone:function(){var e=f.clone.call(this);return e.words=this.words.slice(0),e},random:function(e){for(var t=[],r=0;r>>2]>>>24-i%4*8&255;n.push((o>>>4).toString(16)),n.push((15&o).toString(16))}return n.join("")},parse:function(e){for(var t=e.length,r=[],n=0;n>>3]|=parseInt(e.substr(n,2),16)<<24-n%8*4;return new u.init(r,t/2)}},l=c.Latin1={stringify:function(e){for(var t=e.words,r=e.sigBytes,n=[],i=0;i>>2]>>>24-i%4*8&255;n.push(String.fromCharCode(o))}return n.join("")},parse:function(e){for(var t=e.length,r=[],n=0;n>>2]|=(255&e.charCodeAt(n))<<24-n%4*8;return new u.init(r,t)}},d=c.Utf8={stringify:function(e){try{return decodeURIComponent(escape(l.stringify(e)))}catch(e){throw new Error("Malformed UTF-8 data")}},parse:function(e){return l.parse(unescape(encodeURIComponent(e)))}},p=s.BufferedBlockAlgorithm=f.extend({reset:function(){this._data=new u.init,this._nDataBytes=0},_append:function(e){"string"==typeof e&&(e=d.parse(e)),this._data.concat(e),this._nDataBytes+=e.sigBytes},_process:function(t){var r,n=this._data,i=n.words,o=n.sigBytes,a=this.blockSize,s=o/(4*a),f=(s=t?e.ceil(s):e.max((0|s)-this._minBufferSize,0))*a,c=e.min(4*f,o);if(f){for(var h=0;h{"use strict";var n=65536,i=r(1).Buffer,o=r.g.crypto||r.g.msCrypto;o&&o.getRandomValues?e.exports=function(e,t){if(e>4294967295)throw new RangeError("requested too many random bytes");var r=i.allocUnsafe(e);if(e>0)if(e>n)for(var a=0;a{"use strict";var n=r(0),i=r(54),o=r(56),a=r(57),s=r(14);function f(e){s.call(this,"digest"),this._hash=e}n(f,s),f.prototype._update=function(e){this._hash.update(e)},f.prototype._final=function(){return this._hash.digest()},e.exports=function(e){return"md5"===(e=e.toLowerCase())?new i:"rmd160"===e||"ripemd160"===e?new o:new f(a(e))}},(e,t,r)=>{var n=r(1).Buffer,i=r(207).Transform,o=r(27).s;function a(e){i.call(this),this.hashMode="string"==typeof e,this.hashMode?this[e]=this._finalOrDigest:this.final=this._finalOrDigest,this._final&&(this.__final=this._final,this._final=null),this._decoder=null,this._encoding=null}r(0)(a,i),a.prototype.update=function(e,t,r){"string"==typeof e&&(e=n.from(e,t));var i=this._update(e);return this.hashMode?this:(r&&(i=this._toString(i,r)),i)},a.prototype.setAutoPadding=function(){},a.prototype.getAuthTag=function(){throw new Error("trying to get auth tag in unsupported state")},a.prototype.setAuthTag=function(){throw new Error("trying to set auth tag in unsupported state")},a.prototype.setAAD=function(){throw new Error("trying to set aad in unsupported state")},a.prototype._transform=function(e,t,r){var n;try{this.hashMode?this._update(e):this.push(this._update(e))}catch(e){n=e}finally{r(n)}},a.prototype._flush=function(e){var t;try{this.push(this.__final())}catch(e){t=e}e(t)},a.prototype._finalOrDigest=function(e){var t=this.__final()||n.alloc(0);return e&&(t=this._toString(t,e,!0)),t},a.prototype._toString=function(e,t,r){if(this._decoder||(this._decoder=new o(t),this._encoding=t),this._encoding!==t)throw new Error("can't switch encodings");var n=this._decoder.write(e);return r&&(n+=this._decoder.end()),n},e.exports=a},(e,t,r)=>{"use strict";e.exports=u;var n=r(16);((u.prototype=Object.create(n.prototype)).constructor=u).className="Field";var i,o=r(7),a=r(17),s=r(4),f=/^required|optional|repeated$/;function u(e,t,r,i,o,u,c){if(s.isObject(i)?(c=o,u=i,i=o=void 0):s.isObject(o)&&(c=u,u=o,o=void 0),n.call(this,e,u),!s.isInteger(t)||t<0)throw TypeError("id must be a non-negative integer");if(!s.isString(r))throw TypeError("type must be a string");if(void 0!==i&&!f.test(i=i.toString().toLowerCase()))throw TypeError("rule must be a string rule");if(void 0!==o&&!s.isString(o))throw TypeError("extend must be a string");this.rule=i&&"optional"!==i?i:void 0,this.type=r,this.id=t,this.extend=o||void 0,this.required="required"===i,this.optional=!this.required,this.repeated="repeated"===i,this.map=!1,this.message=null,this.partOf=null,this.typeDefault=null,this.defaultValue=null,this.long=!!s.Long&&void 0!==a.long[r],this.bytes="bytes"===r,this.resolvedType=null,this.extensionField=null,this.declaringField=null,this._packed=null,this.comment=c}u.fromJSON=function(e,t){return new u(e,t.id,t.type,t.rule,t.extend,t.options,t.comment)},Object.defineProperty(u.prototype,"packed",{get:function(){return null===this._packed&&(this._packed=!1!==this.getOption("packed")),this._packed}}),u.prototype.setOption=function(e,t,r){return"packed"===e&&(this._packed=null),n.prototype.setOption.call(this,e,t,r)},u.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return s.toObject(["rule","optional"!==this.rule&&this.rule||void 0,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},u.prototype.resolve=function(){if(this.resolved)return this;if(void 0===(this.typeDefault=a.defaults[this.type])&&(this.resolvedType=(this.declaringField?this.declaringField.parent:this.parent).lookupTypeOrEnum(this.type),this.resolvedType instanceof i?this.typeDefault=null:this.typeDefault=this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]),this.options&&null!=this.options.default&&(this.typeDefault=this.options.default,this.resolvedType instanceof o&&"string"==typeof this.typeDefault&&(this.typeDefault=this.resolvedType.values[this.typeDefault])),this.options&&(!0!==this.options.packed&&(void 0===this.options.packed||!this.resolvedType||this.resolvedType instanceof o)||delete this.options.packed,Object.keys(this.options).length||(this.options=void 0)),this.long)this.typeDefault=s.Long.fromNumber(this.typeDefault,"u"===this.type.charAt(0)),Object.freeze&&Object.freeze(this.typeDefault);else if(this.bytes&&"string"==typeof this.typeDefault){var e;s.base64.test(this.typeDefault)?s.base64.decode(this.typeDefault,e=s.newBuffer(s.base64.length(this.typeDefault)),0):s.utf8.write(this.typeDefault,e=s.newBuffer(s.utf8.length(this.typeDefault)),0),this.typeDefault=e}return this.map?this.defaultValue=s.emptyObject:this.repeated?this.defaultValue=s.emptyArray:this.defaultValue=this.typeDefault,this.parent instanceof i&&(this.parent.ctor.prototype[this.name]=this.defaultValue),n.prototype.resolve.call(this)},u.d=function(e,t,r,n){return"function"==typeof t?t=s.decorateType(t).name:t&&"object"==typeof t&&(t=s.decorateEnum(t).name),function(i,o){s.decorateType(i.constructor).add(new u(o,e,t,r,{default:n}))}},u._configure=function(e){i=e}},(e,t,r)=>{"use strict";e.exports=o,o.className="ReflectionObject";var n,i=r(4);function o(e,t){if(!i.isString(e))throw TypeError("name must be a string");if(t&&!i.isObject(t))throw TypeError("options must be an object");this.options=t,this.name=e,this.parent=null,this.resolved=!1,this.comment=null,this.filename=null}Object.defineProperties(o.prototype,{root:{get:function(){for(var e=this;null!==e.parent;)e=e.parent;return e}},fullName:{get:function(){for(var e=[this.name],t=this.parent;t;)e.unshift(t.name),t=t.parent;return e.join(".")}}}),o.prototype.toJSON=function(){throw Error()},o.prototype.onAdd=function(e){this.parent&&this.parent!==e&&this.parent.remove(this),this.parent=e,this.resolved=!1;var t=e.root;t instanceof n&&t._handleAdd(this)},o.prototype.onRemove=function(e){var t=e.root;t instanceof n&&t._handleRemove(this),this.parent=null,this.resolved=!1},o.prototype.resolve=function(){return this.resolved||this.root instanceof n&&(this.resolved=!0),this},o.prototype.getOption=function(e){if(this.options)return this.options[e]},o.prototype.setOption=function(e,t,r){return r&&this.options&&void 0!==this.options[e]||((this.options||(this.options={}))[e]=t),this},o.prototype.setOptions=function(e,t){if(e)for(var r=Object.keys(e),n=0;n{"use strict";var n=t,i=r(4),o=["double","float","int32","uint32","sint32","fixed32","sfixed32","int64","uint64","sint64","fixed64","sfixed64","bool","string","bytes"];function a(e,t){var r=0,n={};for(t|=0;r{var n=r(1).Buffer;function i(e,t){this._block=n.alloc(e),this._finalSize=t,this._blockSize=e,this._len=0}i.prototype.update=function(e,t){"string"==typeof e&&(t=t||"utf8",e=n.from(e,t));for(var r=this._block,i=this._blockSize,o=e.length,a=this._len,s=0;s=this._finalSize&&(this._update(this._block),this._block.fill(0));var r=8*this._len;if(r<=4294967295)this._block.writeUInt32BE(r,this._blockSize-4);else{var n=(4294967295&r)>>>0,i=(r-n)/4294967296;this._block.writeUInt32BE(i,this._blockSize-8),this._block.writeUInt32BE(n,this._blockSize-4)}this._update(this._block);var o=this._hash();return e?o.toString(e):o},i.prototype._update=function(){throw new Error("_update must be implemented by subclass")},e.exports=i},(e,t,r)=>{"use strict";e.exports=c;var n=r(16);((c.prototype=Object.create(n.prototype)).constructor=c).className="Namespace";var i,o,a,s=r(15),f=r(4);function u(e,t){if(e&&e.length){for(var r={},n=0;n=t)return!0;return!1},c.isReservedName=function(e,t){if(e)for(var r=0;r0;){var n=e.shift();if(r.nested&&r.nested[n]){if(!((r=r.nested[n])instanceof c))throw Error("path conflicts with non-namespace objects")}else r.add(r=new c(n))}return t&&r.addJSON(t),r},c.prototype.resolveAll=function(){for(var e=this.nestedArray,t=0;t-1)return n}else if(n instanceof c&&(n=n.lookup(e.slice(1),t,!0)))return n}else for(var i=0;i{"use strict";var n=t;n.version=r(300).i8,n.utils=r(5),n.rand=r(51),n.curve=r(87),n.curves=r(52),n.ec=r(190),n.eddsa=r(194)},e=>{"use strict";var t={};function r(e,r,n){n||(n=Error);var i=function(e){var t,n;function i(t,n,i){return e.call(this,function(e,t,n){return"string"==typeof r?r:r(e,t,n)}(t,n,i))||this}return n=e,(t=i).prototype=Object.create(n.prototype),t.prototype.constructor=t,t.__proto__=n,i}(n);i.prototype.name=n.name,i.prototype.code=e,t[e]=i}function n(e,t){if(Array.isArray(e)){var r=e.length;return e=e.map((function(e){return String(e)})),r>2?"one of ".concat(t," ").concat(e.slice(0,r-1).join(", "),", or ")+e[r-1]:2===r?"one of ".concat(t," ").concat(e[0]," or ").concat(e[1]):"of ".concat(t," ").concat(e[0])}return"of ".concat(t," ").concat(String(e))}r("ERR_INVALID_OPT_VALUE",(function(e,t){return'The value "'+t+'" is invalid for option "'+e+'"'}),TypeError),r("ERR_INVALID_ARG_TYPE",(function(e,t,r){var i,o,a,s,f;if("string"==typeof t&&(o="not ",t.substr(0,4)===o)?(i="must not be",t=t.replace(/^not /,"")):i="must be",function(e,t,r){return(void 0===r||r>e.length)&&(r=e.length),e.substring(r-9,r)===t}(e," argument"))a="The ".concat(e," ").concat(i," ").concat(n(t,"type"));else{var u=("number"!=typeof f&&(f=0),f+1>(s=e).length||-1===s.indexOf(".",f)?"argument":"property");a='The "'.concat(e,'" ').concat(u," ").concat(i," ").concat(n(t,"type"))}return a+". Received type ".concat(typeof r)}),TypeError),r("ERR_STREAM_PUSH_AFTER_EOF","stream.push() after EOF"),r("ERR_METHOD_NOT_IMPLEMENTED",(function(e){return"The "+e+" method is not implemented"})),r("ERR_STREAM_PREMATURE_CLOSE","Premature close"),r("ERR_STREAM_DESTROYED",(function(e){return"Cannot call "+e+" after a stream was destroyed"})),r("ERR_MULTIPLE_CALLBACK","Callback called multiple times"),r("ERR_STREAM_CANNOT_PIPE","Cannot pipe, not readable"),r("ERR_STREAM_WRITE_AFTER_END","write after end"),r("ERR_STREAM_NULL_VALUES","May not write null values to stream",TypeError),r("ERR_UNKNOWN_ENCODING",(function(e){return"Unknown encoding: "+e}),TypeError),r("ERR_STREAM_UNSHIFT_AFTER_END_EVENT","stream.unshift() after end event"),e.exports.q=t},e=>{"use strict";var t={};function r(e,r,n){n||(n=Error);var i=function(e){var t,n;function i(t,n,i){return e.call(this,function(e,t,n){return"string"==typeof r?r:r(e,t,n)}(t,n,i))||this}return n=e,(t=i).prototype=Object.create(n.prototype),t.prototype.constructor=t,t.__proto__=n,i}(n);i.prototype.name=n.name,i.prototype.code=e,t[e]=i}function n(e,t){if(Array.isArray(e)){var r=e.length;return e=e.map((function(e){return String(e)})),r>2?"one of ".concat(t," ").concat(e.slice(0,r-1).join(", "),", or ")+e[r-1]:2===r?"one of ".concat(t," ").concat(e[0]," or ").concat(e[1]):"of ".concat(t," ").concat(e[0])}return"of ".concat(t," ").concat(String(e))}r("ERR_INVALID_OPT_VALUE",(function(e,t){return'The value "'+t+'" is invalid for option "'+e+'"'}),TypeError),r("ERR_INVALID_ARG_TYPE",(function(e,t,r){var i,o,a,s,f;if("string"==typeof t&&(o="not ",t.substr(0,4)===o)?(i="must not be",t=t.replace(/^not /,"")):i="must be",function(e,t,r){return(void 0===r||r>e.length)&&(r=e.length),e.substring(r-9,r)===t}(e," argument"))a="The ".concat(e," ").concat(i," ").concat(n(t,"type"));else{var u=("number"!=typeof f&&(f=0),f+1>(s=e).length||-1===s.indexOf(".",f)?"argument":"property");a='The "'.concat(e,'" ').concat(u," ").concat(i," ").concat(n(t,"type"))}return a+". Received type ".concat(typeof r)}),TypeError),r("ERR_STREAM_PUSH_AFTER_EOF","stream.push() after EOF"),r("ERR_METHOD_NOT_IMPLEMENTED",(function(e){return"The "+e+" method is not implemented"})),r("ERR_STREAM_PREMATURE_CLOSE","Premature close"),r("ERR_STREAM_DESTROYED",(function(e){return"Cannot call "+e+" after a stream was destroyed"})),r("ERR_MULTIPLE_CALLBACK","Callback called multiple times"),r("ERR_STREAM_CANNOT_PIPE","Cannot pipe, not readable"),r("ERR_STREAM_WRITE_AFTER_END","write after end"),r("ERR_STREAM_NULL_VALUES","May not write null values to stream",TypeError),r("ERR_UNKNOWN_ENCODING",(function(e){return"Unknown encoding: "+e}),TypeError),r("ERR_STREAM_UNSHIFT_AFTER_END_EVENT","stream.unshift() after end event"),e.exports.q=t},e=>{e.exports=function(e,t){for(var r=Math.min(e.length,t.length),n=new Buffer(r),i=0;i{"use strict";var t={};function r(e,r,n){n||(n=Error);var i=function(e){var t,n;function i(t,n,i){return e.call(this,function(e,t,n){return"string"==typeof r?r:r(e,t,n)}(t,n,i))||this}return n=e,(t=i).prototype=Object.create(n.prototype),t.prototype.constructor=t,t.__proto__=n,i}(n);i.prototype.name=n.name,i.prototype.code=e,t[e]=i}function n(e,t){if(Array.isArray(e)){var r=e.length;return e=e.map((function(e){return String(e)})),r>2?"one of ".concat(t," ").concat(e.slice(0,r-1).join(", "),", or ")+e[r-1]:2===r?"one of ".concat(t," ").concat(e[0]," or ").concat(e[1]):"of ".concat(t," ").concat(e[0])}return"of ".concat(t," ").concat(String(e))}r("ERR_INVALID_OPT_VALUE",(function(e,t){return'The value "'+t+'" is invalid for option "'+e+'"'}),TypeError),r("ERR_INVALID_ARG_TYPE",(function(e,t,r){var i,o,a,s,f;if("string"==typeof t&&(o="not ",t.substr(0,4)===o)?(i="must not be",t=t.replace(/^not /,"")):i="must be",function(e,t,r){return(void 0===r||r>e.length)&&(r=e.length),e.substring(r-9,r)===t}(e," argument"))a="The ".concat(e," ").concat(i," ").concat(n(t,"type"));else{var u=("number"!=typeof f&&(f=0),f+1>(s=e).length||-1===s.indexOf(".",f)?"argument":"property");a='The "'.concat(e,'" ').concat(u," ").concat(i," ").concat(n(t,"type"))}return a+". Received type ".concat(typeof r)}),TypeError),r("ERR_STREAM_PUSH_AFTER_EOF","stream.push() after EOF"),r("ERR_METHOD_NOT_IMPLEMENTED",(function(e){return"The "+e+" method is not implemented"})),r("ERR_STREAM_PREMATURE_CLOSE","Premature close"),r("ERR_STREAM_DESTROYED",(function(e){return"Cannot call "+e+" after a stream was destroyed"})),r("ERR_MULTIPLE_CALLBACK","Callback called multiple times"),r("ERR_STREAM_CANNOT_PIPE","Cannot pipe, not readable"),r("ERR_STREAM_WRITE_AFTER_END","write after end"),r("ERR_STREAM_NULL_VALUES","May not write null values to stream",TypeError),r("ERR_UNKNOWN_ENCODING",(function(e){return"Unknown encoding: "+e}),TypeError),r("ERR_STREAM_UNSHIFT_AFTER_END_EVENT","stream.unshift() after end event"),e.exports.q=t},e=>{"use strict";var t={};function r(e,r,n){n||(n=Error);var i=function(e){var t,n;function i(t,n,i){return e.call(this,function(e,t,n){return"string"==typeof r?r:r(e,t,n)}(t,n,i))||this}return n=e,(t=i).prototype=Object.create(n.prototype),t.prototype.constructor=t,t.__proto__=n,i}(n);i.prototype.name=n.name,i.prototype.code=e,t[e]=i}function n(e,t){if(Array.isArray(e)){var r=e.length;return e=e.map((function(e){return String(e)})),r>2?"one of ".concat(t," ").concat(e.slice(0,r-1).join(", "),", or ")+e[r-1]:2===r?"one of ".concat(t," ").concat(e[0]," or ").concat(e[1]):"of ".concat(t," ").concat(e[0])}return"of ".concat(t," ").concat(String(e))}r("ERR_INVALID_OPT_VALUE",(function(e,t){return'The value "'+t+'" is invalid for option "'+e+'"'}),TypeError),r("ERR_INVALID_ARG_TYPE",(function(e,t,r){var i,o,a,s,f;if("string"==typeof t&&(o="not ",t.substr(0,4)===o)?(i="must not be",t=t.replace(/^not /,"")):i="must be",function(e,t,r){return(void 0===r||r>e.length)&&(r=e.length),e.substring(r-9,r)===t}(e," argument"))a="The ".concat(e," ").concat(i," ").concat(n(t,"type"));else{var u=("number"!=typeof f&&(f=0),f+1>(s=e).length||-1===s.indexOf(".",f)?"argument":"property");a='The "'.concat(e,'" ').concat(u," ").concat(i," ").concat(n(t,"type"))}return a+". Received type ".concat(typeof r)}),TypeError),r("ERR_STREAM_PUSH_AFTER_EOF","stream.push() after EOF"),r("ERR_METHOD_NOT_IMPLEMENTED",(function(e){return"The "+e+" method is not implemented"})),r("ERR_STREAM_PREMATURE_CLOSE","Premature close"),r("ERR_STREAM_DESTROYED",(function(e){return"Cannot call "+e+" after a stream was destroyed"})),r("ERR_MULTIPLE_CALLBACK","Callback called multiple times"),r("ERR_STREAM_CANNOT_PIPE","Cannot pipe, not readable"),r("ERR_STREAM_WRITE_AFTER_END","write after end"),r("ERR_STREAM_NULL_VALUES","May not write null values to stream",TypeError),r("ERR_UNKNOWN_ENCODING",(function(e){return"Unknown encoding: "+e}),TypeError),r("ERR_STREAM_UNSHIFT_AFTER_END_EVENT","stream.unshift() after end event"),e.exports.q=t},(e,t,r)=>{var n=Object.getOwnPropertyDescriptors||function(e){for(var t=Object.keys(e),r={},n=0;n=o)return e;switch(e){case"%s":return String(n[r++]);case"%d":return Number(n[r++]);case"%j":try{return JSON.stringify(n[r++])}catch(e){return"[Circular]"}default:return e}})),s=n[r];r=3&&(n.depth=arguments[2]),arguments.length>=4&&(n.colors=arguments[3]),b(r)?n.showHidden=r:r&&t._extend(n,r),_(n.showHidden)&&(n.showHidden=!1),_(n.depth)&&(n.depth=2),_(n.colors)&&(n.colors=!1),_(n.customInspect)&&(n.customInspect=!0),n.colors&&(n.stylize=u),h(n,e,n.depth)}function u(e,t){var r=f.styles[t];return r?"["+f.colors[r][0]+"m"+e+"["+f.colors[r][1]+"m":e}function c(e,t){return e}function h(e,r,n){if(e.customInspect&&r&&M(r.inspect)&&r.inspect!==t.inspect&&(!r.constructor||r.constructor.prototype!==r)){var i=r.inspect(n,e);return g(i)||(i=h(e,i,n)),i}var o=function(e,t){if(_(t))return e.stylize("undefined","undefined");if(g(t)){var r="'"+JSON.stringify(t).replace(/^"|"$/g,"").replace(/'/g,"\\'").replace(/\\"/g,'"')+"'";return e.stylize(r,"string")}return m(t)?e.stylize(""+t,"number"):b(t)?e.stylize(""+t,"boolean"):y(t)?e.stylize("null","null"):void 0}(e,r);if(o)return o;var a=Object.keys(r),s=function(e){var t={};return e.forEach((function(e,r){t[e]=!0})),t}(a);if(e.showHidden&&(a=Object.getOwnPropertyNames(r)),S(r)&&(a.indexOf("message")>=0||a.indexOf("description")>=0))return l(r);if(0===a.length){if(M(r)){var f=r.name?": "+r.name:"";return e.stylize("[Function"+f+"]","special")}if(v(r))return e.stylize(RegExp.prototype.toString.call(r),"regexp");if(E(r))return e.stylize(Date.prototype.toString.call(r),"date");if(S(r))return l(r)}var u,c="",w=!1,A=["{","}"];return p(r)&&(w=!0,A=["[","]"]),M(r)&&(c=" [Function"+(r.name?": "+r.name:"")+"]"),v(r)&&(c=" "+RegExp.prototype.toString.call(r)),E(r)&&(c=" "+Date.prototype.toUTCString.call(r)),S(r)&&(c=" "+l(r)),0!==a.length||w&&0!=r.length?n<0?v(r)?e.stylize(RegExp.prototype.toString.call(r),"regexp"):e.stylize("[Object]","special"):(e.seen.push(r),u=w?function(e,t,r,n,i){for(var o=[],a=0,s=t.length;a60?r[0]+(""===t?"":t+"\n ")+" "+e.join(",\n ")+" "+r[1]:r[0]+t+" "+e.join(", ")+" "+r[1]}(u,c,A)):A[0]+c+A[1]}function l(e){return"["+Error.prototype.toString.call(e)+"]"}function d(e,t,r,n,i,o){var a,s,f;if((f=Object.getOwnPropertyDescriptor(t,i)||{value:t[i]}).get?s=f.set?e.stylize("[Getter/Setter]","special"):e.stylize("[Getter]","special"):f.set&&(s=e.stylize("[Setter]","special")),O(n,i)||(a="["+i+"]"),s||(e.seen.indexOf(f.value)<0?(s=y(r)?h(e,f.value,null):h(e,f.value,r-1)).indexOf("\n")>-1&&(s=o?s.split("\n").map((function(e){return" "+e})).join("\n").slice(2):"\n"+s.split("\n").map((function(e){return" "+e})).join("\n")):s=e.stylize("[Circular]","special")),_(a)){if(o&&i.match(/^\d+$/))return s;(a=JSON.stringify(""+i)).match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)?(a=a.slice(1,-1),a=e.stylize(a,"name")):(a=a.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'"),a=e.stylize(a,"string"))}return a+": "+s}function p(e){return Array.isArray(e)}function b(e){return"boolean"==typeof e}function y(e){return null===e}function m(e){return"number"==typeof e}function g(e){return"string"==typeof e}function _(e){return void 0===e}function v(e){return w(e)&&"[object RegExp]"===A(e)}function w(e){return"object"==typeof e&&null!==e}function E(e){return w(e)&&"[object Date]"===A(e)}function S(e){return w(e)&&("[object Error]"===A(e)||e instanceof Error)}function M(e){return"function"==typeof e}function A(e){return Object.prototype.toString.call(e)}function k(e){return e<10?"0"+e.toString(10):e.toString(10)}t.debuglog=function(e){if(e=e.toUpperCase(),!o[e])if(a.test(e)){var r=process.pid;o[e]=function(){var n=t.format.apply(t,arguments);console.error("%s %d: %s",e,r,n)}}else o[e]=function(){};return o[e]},t.inspect=f,f.colors={bold:[1,22],italic:[3,23],underline:[4,24],inverse:[7,27],white:[37,39],grey:[90,39],black:[30,39],blue:[34,39],cyan:[36,39],green:[32,39],magenta:[35,39],red:[31,39],yellow:[33,39]},f.styles={special:"cyan",number:"yellow",boolean:"yellow",undefined:"grey",null:"bold",string:"green",date:"magenta",regexp:"red"},t.types=r(217),t.isArray=p,t.isBoolean=b,t.isNull=y,t.isNullOrUndefined=function(e){return null==e},t.isNumber=m,t.isString=g,t.isSymbol=function(e){return"symbol"==typeof e},t.isUndefined=_,t.isRegExp=v,t.types.isRegExp=v,t.isObject=w,t.isDate=E,t.types.isDate=E,t.isError=S,t.types.isNativeError=S,t.isFunction=M,t.isPrimitive=function(e){return null===e||"boolean"==typeof e||"number"==typeof e||"string"==typeof e||"symbol"==typeof e||void 0===e},t.isBuffer=r(225);var R=["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"];function O(e,t){return Object.prototype.hasOwnProperty.call(e,t)}t.log=function(){var e,r;console.log("%s - %s",(r=[k((e=new Date).getHours()),k(e.getMinutes()),k(e.getSeconds())].join(":"),[e.getDate(),R[e.getMonth()],r].join(" ")),t.format.apply(t,arguments))},t.inherits=r(0),t._extend=function(e,t){if(!t||!w(t))return e;for(var r=Object.keys(t),n=r.length;n--;)e[r[n]]=t[r[n]];return e};var T="undefined"!=typeof Symbol?Symbol("util.promisify.custom"):void 0;function I(e,t){if(!e){var r=new Error("Promise was rejected with a falsy value");r.reason=e,e=r}return t(e)}t.promisify=function(e){if("function"!=typeof e)throw new TypeError('The "original" argument must be of type Function');if(T&&e[T]){var t;if("function"!=typeof(t=e[T]))throw new TypeError('The "util.promisify.custom" argument must be of type Function');return Object.defineProperty(t,T,{value:t,enumerable:!1,writable:!1,configurable:!0}),t}function t(){for(var t,r,n=new Promise((function(e,n){t=e,r=n})),i=[],o=0;o{"use strict";var n=r(1).Buffer,i=n.isEncoding||function(e){switch((e=""+e)&&e.toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":case"raw":return!0;default:return!1}};function o(e){var t;switch(this.encoding=function(e){var t=function(e){if(!e)return"utf8";for(var t;;)switch(e){case"utf8":case"utf-8":return"utf8";case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return"utf16le";case"latin1":case"binary":return"latin1";case"base64":case"ascii":case"hex":return e;default:if(t)return;e=(""+e).toLowerCase(),t=!0}}(e);if("string"!=typeof t&&(n.isEncoding===i||!i(e)))throw new Error("Unknown encoding: "+e);return t||e}(e),this.encoding){case"utf16le":this.text=f,this.end=u,t=4;break;case"utf8":this.fillLast=s,t=4;break;case"base64":this.text=c,this.end=h,t=3;break;default:return this.write=l,void(this.end=d)}this.lastNeed=0,this.lastTotal=0,this.lastChar=n.allocUnsafe(t)}function a(e){return e<=127?0:e>>5==6?2:e>>4==14?3:e>>3==30?4:e>>6==2?-1:-2}function s(e){var t=this.lastTotal-this.lastNeed,r=function(e,t,r){if(128!=(192&t[0]))return e.lastNeed=0,"�";if(e.lastNeed>1&&t.length>1){if(128!=(192&t[1]))return e.lastNeed=1,"�";if(e.lastNeed>2&&t.length>2&&128!=(192&t[2]))return e.lastNeed=2,"�"}}(this,e);return void 0!==r?r:this.lastNeed<=e.length?(e.copy(this.lastChar,t,0,this.lastNeed),this.lastChar.toString(this.encoding,0,this.lastTotal)):(e.copy(this.lastChar,t,0,e.length),void(this.lastNeed-=e.length))}function f(e,t){if((e.length-t)%2==0){var r=e.toString("utf16le",t);if(r){var n=r.charCodeAt(r.length-1);if(n>=55296&&n<=56319)return this.lastNeed=2,this.lastTotal=4,this.lastChar[0]=e[e.length-2],this.lastChar[1]=e[e.length-1],r.slice(0,-1)}return r}return this.lastNeed=1,this.lastTotal=2,this.lastChar[0]=e[e.length-1],e.toString("utf16le",t,e.length-1)}function u(e){var t=e&&e.length?this.write(e):"";if(this.lastNeed){var r=this.lastTotal-this.lastNeed;return t+this.lastChar.toString("utf16le",0,r)}return t}function c(e,t){var r=(e.length-t)%3;return 0===r?e.toString("base64",t):(this.lastNeed=3-r,this.lastTotal=3,1===r?this.lastChar[0]=e[e.length-1]:(this.lastChar[0]=e[e.length-2],this.lastChar[1]=e[e.length-1]),e.toString("base64",t,e.length-r))}function h(e){var t=e&&e.length?this.write(e):"";return this.lastNeed?t+this.lastChar.toString("base64",0,3-this.lastNeed):t}function l(e){return e.toString(this.encoding)}function d(e){return e&&e.length?this.write(e):""}t.s=o,o.prototype.write=function(e){if(0===e.length)return"";var t,r;if(this.lastNeed){if(void 0===(t=this.fillLast(e)))return"";r=this.lastNeed,this.lastNeed=0}else r=0;return r=0?(i>0&&(e.lastNeed=i-1),i):--n=0?(i>0&&(e.lastNeed=i-2),i):--n=0?(i>0&&(2===i?i=0:e.lastNeed=i-3),i):0}(this,e,t);if(!this.lastNeed)return e.toString("utf8",t);this.lastTotal=r;var n=e.length-(r-this.lastNeed);return e.copy(this.lastChar,0,n),e.toString("utf8",t,n)},o.prototype.fillLast=function(e){if(this.lastNeed<=e.length)return e.copy(this.lastChar,this.lastTotal-this.lastNeed,0,this.lastNeed),this.lastChar.toString(this.encoding,0,this.lastTotal);e.copy(this.lastChar,this.lastTotal-this.lastNeed,0,e.length),this.lastNeed-=e.length}},(e,t,r)=>{"use strict";var n=Object.keys||function(e){var t=[];for(var r in e)t.push(r);return t};e.exports=u;var i=r(91),o=r(94);r(0)(u,i);for(var a=n(o.prototype),s=0;s{"use strict";var n=Object.keys||function(e){var t=[];for(var r in e)t.push(r);return t};e.exports=u;var i=r(98),o=r(101);r(0)(u,i);for(var a=n(o.prototype),s=0;s{"use strict";var n=Object.keys||function(e){var t=[];for(var r in e)t.push(r);return t};e.exports=u;var i=r(128),o=r(131);r(0)(u,i);for(var a=n(o.prototype),s=0;s{"use strict";var n=Object.keys||function(e){var t=[];for(var r in e)t.push(r);return t};e.exports=u;var i=r(143),o=r(146);r(0)(u,i);for(var a=n(o.prototype),s=0;s{"use strict";e.exports=a;var n=r(16);((a.prototype=Object.create(n.prototype)).constructor=a).className="OneOf";var i=r(15),o=r(4);function a(e,t,r,i){if(Array.isArray(t)||(r=t,t=void 0),n.call(this,e,r),void 0!==t&&!Array.isArray(t))throw TypeError("fieldNames must be an Array");this.oneof=t||[],this.fieldsArray=[],this.comment=i}function s(e){if(e.parent)for(var t=0;t-1&&this.oneof.splice(t,1),e.partOf=null,this},a.prototype.onAdd=function(e){n.prototype.onAdd.call(this,e);for(var t=0;t{"use strict";var n=r(2),i=r(5),o=i.getNAF,a=i.getJSF,s=i.assert;function f(e,t){this.type=e,this.p=new n(t.p,16),this.red=t.prime?n.red(t.prime):n.mont(this.p),this.zero=new n(0).toRed(this.red),this.one=new n(1).toRed(this.red),this.two=new n(2).toRed(this.red),this.n=t.n&&new n(t.n,16),this.g=t.g&&this.pointFromJSON(t.g,t.gRed),this._wnafT1=new Array(4),this._wnafT2=new Array(4),this._wnafT3=new Array(4),this._wnafT4=new Array(4),this._bitLength=this.n?this.n.bitLength():0;var r=this.n&&this.p.div(this.n);!r||r.cmpn(100)>0?this.redN=null:(this._maxwellTrick=!0,this.redN=this.n.toRed(this.red))}function u(e,t){this.curve=e,this.type=t,this.precomputed=null}e.exports=f,f.prototype.point=function(){throw new Error("Not implemented")},f.prototype.validate=function(){throw new Error("Not implemented")},f.prototype._fixedNafMul=function(e,t){s(e.precomputed);var r=e._getDoubles(),n=o(t,1,this._bitLength),i=(1<=a;c--)f=(f<<1)+n[c];u.push(f)}for(var h=this.jpoint(null,null,null),l=this.jpoint(null,null,null),d=i;d>0;d--){for(a=0;a=0;u--){for(var c=0;u>=0&&0===a[u];u--)c++;if(u>=0&&c++,f=f.dblp(c),u<0)break;var h=a[u];s(0!==h),f="affine"===e.type?h>0?f.mixedAdd(i[h-1>>1]):f.mixedAdd(i[-h-1>>1].neg()):h>0?f.add(i[h-1>>1]):f.add(i[-h-1>>1].neg())}return"affine"===e.type?f.toP():f},f.prototype._wnafMulAdd=function(e,t,r,n,i){var s,f,u,c=this._wnafT1,h=this._wnafT2,l=this._wnafT3,d=0;for(s=0;s=1;s-=2){var b=s-1,y=s;if(1===c[b]&&1===c[y]){var m=[t[b],null,null,t[y]];0===t[b].y.cmp(t[y].y)?(m[1]=t[b].add(t[y]),m[2]=t[b].toJ().mixedAdd(t[y].neg())):0===t[b].y.cmp(t[y].y.redNeg())?(m[1]=t[b].toJ().mixedAdd(t[y]),m[2]=t[b].add(t[y].neg())):(m[1]=t[b].toJ().mixedAdd(t[y]),m[2]=t[b].toJ().mixedAdd(t[y].neg()));var g=[-3,-1,-5,-7,0,7,5,1,3],_=a(r[b],r[y]);for(d=Math.max(_[0].length,d),l[b]=new Array(d),l[y]=new Array(d),f=0;f=0;s--){for(var M=0;s>=0;){var A=!0;for(f=0;f=0&&M++,E=E.dblp(M),s<0)break;for(f=0;f0?u=h[f][k-1>>1]:k<0&&(u=h[f][-k-1>>1].neg()),E="affine"===u.type?E.mixedAdd(u):E.add(u))}}for(s=0;s=Math.ceil((e.bitLength()+1)/t.step)},u.prototype._getDoubles=function(e,t){if(this.precomputed&&this.precomputed.doubles)return this.precomputed.doubles;for(var r=[this],n=this,i=0;i{"use strict";var n=r(9),i=r(6);function o(){this.pending=null,this.pendingTotal=0,this.blockSize=this.constructor.blockSize,this.outSize=this.constructor.outSize,this.hmacStrength=this.constructor.hmacStrength,this.padLength=this.constructor.padLength/8,this.endian="big",this._delta8=this.blockSize/8,this._delta32=this.blockSize/32}t.BlockHash=o,o.prototype.update=function(e,t){if(e=n.toArray(e,t),this.pending?this.pending=this.pending.concat(e):this.pending=e,this.pendingTotal+=e.length,this.pending.length>=this._delta8){var r=(e=this.pending).length%this._delta8;this.pending=e.slice(e.length-r,e.length),0===this.pending.length&&(this.pending=null),e=n.join32(e,0,e.length-r,this.endian);for(var i=0;i>>24&255,n[i++]=e>>>16&255,n[i++]=e>>>8&255,n[i++]=255&e}else for(n[i++]=255&e,n[i++]=e>>>8&255,n[i++]=e>>>16&255,n[i++]=e>>>24&255,n[i++]=0,n[i++]=0,n[i++]=0,n[i++]=0,o=8;o{function n(e){try{if(!r.g.localStorage)return!1}catch(e){return!1}var t=r.g.localStorage[e];return null!=t&&"true"===String(t).toLowerCase()}e.exports=function(e,t){if(n("noDeprecation"))return e;var r=!1;return function(){if(!r){if(n("throwDeprecation"))throw new Error(t);n("traceDeprecation")?console.trace(t):console.warn(t),r=!0}return e.apply(this,arguments)}}},(e,t,r)=>{"use strict";var n=r(109);e.exports=function(){return n()&&!!Symbol.toStringTag}},(e,t,r)=>{"use strict";var n,i=SyntaxError,o=Function,a=TypeError,s=function(e){try{return o('"use strict"; return ('+e+").constructor;")()}catch(e){}},f=Object.getOwnPropertyDescriptor;if(f)try{f({},"")}catch(e){f=null}var u=function(){throw new a},c=f?function(){try{return u}catch(e){try{return f(arguments,"callee").get}catch(e){return u}}}():u,h=r(219)(),l=Object.getPrototypeOf||function(e){return e.__proto__},d={},p="undefined"==typeof Uint8Array?n:l(Uint8Array),b={"%AggregateError%":"undefined"==typeof AggregateError?n:AggregateError,"%Array%":Array,"%ArrayBuffer%":"undefined"==typeof ArrayBuffer?n:ArrayBuffer,"%ArrayIteratorPrototype%":h?l([][Symbol.iterator]()):n,"%AsyncFromSyncIteratorPrototype%":n,"%AsyncFunction%":d,"%AsyncGenerator%":d,"%AsyncGeneratorFunction%":d,"%AsyncIteratorPrototype%":d,"%Atomics%":"undefined"==typeof Atomics?n:Atomics,"%BigInt%":"undefined"==typeof BigInt?n:BigInt,"%BigInt64Array%":"undefined"==typeof BigInt64Array?n:BigInt64Array,"%BigUint64Array%":"undefined"==typeof BigUint64Array?n:BigUint64Array,"%Boolean%":Boolean,"%DataView%":"undefined"==typeof DataView?n:DataView,"%Date%":Date,"%decodeURI%":decodeURI,"%decodeURIComponent%":decodeURIComponent,"%encodeURI%":encodeURI,"%encodeURIComponent%":encodeURIComponent,"%Error%":Error,"%eval%":eval,"%EvalError%":EvalError,"%Float32Array%":"undefined"==typeof Float32Array?n:Float32Array,"%Float64Array%":"undefined"==typeof Float64Array?n:Float64Array,"%FinalizationRegistry%":"undefined"==typeof FinalizationRegistry?n:FinalizationRegistry,"%Function%":o,"%GeneratorFunction%":d,"%Int8Array%":"undefined"==typeof Int8Array?n:Int8Array,"%Int16Array%":"undefined"==typeof Int16Array?n:Int16Array,"%Int32Array%":"undefined"==typeof Int32Array?n:Int32Array,"%isFinite%":isFinite,"%isNaN%":isNaN,"%IteratorPrototype%":h?l(l([][Symbol.iterator]())):n,"%JSON%":"object"==typeof JSON?JSON:n,"%Map%":"undefined"==typeof Map?n:Map,"%MapIteratorPrototype%":"undefined"!=typeof Map&&h?l((new Map)[Symbol.iterator]()):n,"%Math%":Math,"%Number%":Number,"%Object%":Object,"%parseFloat%":parseFloat,"%parseInt%":parseInt,"%Promise%":"undefined"==typeof Promise?n:Promise,"%Proxy%":"undefined"==typeof Proxy?n:Proxy,"%RangeError%":RangeError,"%ReferenceError%":ReferenceError,"%Reflect%":"undefined"==typeof Reflect?n:Reflect,"%RegExp%":RegExp,"%Set%":"undefined"==typeof Set?n:Set,"%SetIteratorPrototype%":"undefined"!=typeof Set&&h?l((new Set)[Symbol.iterator]()):n,"%SharedArrayBuffer%":"undefined"==typeof SharedArrayBuffer?n:SharedArrayBuffer,"%String%":String,"%StringIteratorPrototype%":h?l(""[Symbol.iterator]()):n,"%Symbol%":h?Symbol:n,"%SyntaxError%":i,"%ThrowTypeError%":c,"%TypedArray%":p,"%TypeError%":a,"%Uint8Array%":"undefined"==typeof Uint8Array?n:Uint8Array,"%Uint8ClampedArray%":"undefined"==typeof Uint8ClampedArray?n:Uint8ClampedArray,"%Uint16Array%":"undefined"==typeof Uint16Array?n:Uint16Array,"%Uint32Array%":"undefined"==typeof Uint32Array?n:Uint32Array,"%URIError%":URIError,"%WeakMap%":"undefined"==typeof WeakMap?n:WeakMap,"%WeakRef%":"undefined"==typeof WeakRef?n:WeakRef,"%WeakSet%":"undefined"==typeof WeakSet?n:WeakSet};try{null.error}catch(e){var y=l(l(e));b["%Error.prototype%"]=y}var m=function e(t){var r;if("%AsyncFunction%"===t)r=s("async function () {}");else if("%GeneratorFunction%"===t)r=s("function* () {}");else if("%AsyncGeneratorFunction%"===t)r=s("async function* () {}");else if("%AsyncGenerator%"===t){var n=e("%AsyncGeneratorFunction%");n&&(r=n.prototype)}else if("%AsyncIteratorPrototype%"===t){var i=e("%AsyncGenerator%");i&&(r=l(i.prototype))}return b[t]=r,r},g={"%ArrayBufferPrototype%":["ArrayBuffer","prototype"],"%ArrayPrototype%":["Array","prototype"],"%ArrayProto_entries%":["Array","prototype","entries"],"%ArrayProto_forEach%":["Array","prototype","forEach"],"%ArrayProto_keys%":["Array","prototype","keys"],"%ArrayProto_values%":["Array","prototype","values"],"%AsyncFunctionPrototype%":["AsyncFunction","prototype"],"%AsyncGenerator%":["AsyncGeneratorFunction","prototype"],"%AsyncGeneratorPrototype%":["AsyncGeneratorFunction","prototype","prototype"],"%BooleanPrototype%":["Boolean","prototype"],"%DataViewPrototype%":["DataView","prototype"],"%DatePrototype%":["Date","prototype"],"%ErrorPrototype%":["Error","prototype"],"%EvalErrorPrototype%":["EvalError","prototype"],"%Float32ArrayPrototype%":["Float32Array","prototype"],"%Float64ArrayPrototype%":["Float64Array","prototype"],"%FunctionPrototype%":["Function","prototype"],"%Generator%":["GeneratorFunction","prototype"],"%GeneratorPrototype%":["GeneratorFunction","prototype","prototype"],"%Int8ArrayPrototype%":["Int8Array","prototype"],"%Int16ArrayPrototype%":["Int16Array","prototype"],"%Int32ArrayPrototype%":["Int32Array","prototype"],"%JSONParse%":["JSON","parse"],"%JSONStringify%":["JSON","stringify"],"%MapPrototype%":["Map","prototype"],"%NumberPrototype%":["Number","prototype"],"%ObjectPrototype%":["Object","prototype"],"%ObjProto_toString%":["Object","prototype","toString"],"%ObjProto_valueOf%":["Object","prototype","valueOf"],"%PromisePrototype%":["Promise","prototype"],"%PromiseProto_then%":["Promise","prototype","then"],"%Promise_all%":["Promise","all"],"%Promise_reject%":["Promise","reject"],"%Promise_resolve%":["Promise","resolve"],"%RangeErrorPrototype%":["RangeError","prototype"],"%ReferenceErrorPrototype%":["ReferenceError","prototype"],"%RegExpPrototype%":["RegExp","prototype"],"%SetPrototype%":["Set","prototype"],"%SharedArrayBufferPrototype%":["SharedArrayBuffer","prototype"],"%StringPrototype%":["String","prototype"],"%SymbolPrototype%":["Symbol","prototype"],"%SyntaxErrorPrototype%":["SyntaxError","prototype"],"%TypedArrayPrototype%":["TypedArray","prototype"],"%TypeErrorPrototype%":["TypeError","prototype"],"%Uint8ArrayPrototype%":["Uint8Array","prototype"],"%Uint8ClampedArrayPrototype%":["Uint8ClampedArray","prototype"],"%Uint16ArrayPrototype%":["Uint16Array","prototype"],"%Uint32ArrayPrototype%":["Uint32Array","prototype"],"%URIErrorPrototype%":["URIError","prototype"],"%WeakMapPrototype%":["WeakMap","prototype"],"%WeakSetPrototype%":["WeakSet","prototype"]},_=r(60),v=r(221),w=_.call(Function.call,Array.prototype.concat),E=_.call(Function.apply,Array.prototype.splice),S=_.call(Function.call,String.prototype.replace),M=_.call(Function.call,String.prototype.slice),A=_.call(Function.call,RegExp.prototype.exec),k=/[^%.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|%$))/g,R=/\\(\\)?/g,O=function(e,t){var r,n=e;if(v(g,n)&&(n="%"+(r=g[n])[0]+"%"),v(b,n)){var o=b[n];if(o===d&&(o=m(n)),void 0===o&&!t)throw new a("intrinsic "+e+" exists, but is not available. Please file an issue!");return{alias:r,name:n,value:o}}throw new i("intrinsic "+e+" does not exist!")};e.exports=function(e,t){if("string"!=typeof e||0===e.length)throw new a("intrinsic name must be a non-empty string");if(arguments.length>1&&"boolean"!=typeof t)throw new a('"allowMissing" argument must be a boolean');if(null===A(/^%?[^%]*%?$/,e))throw new i("`%` may not be present anywhere but at the beginning and end of the intrinsic name");var r=function(e){var t=M(e,0,1),r=M(e,-1);if("%"===t&&"%"!==r)throw new i("invalid intrinsic syntax, expected closing `%`");if("%"===r&&"%"!==t)throw new i("invalid intrinsic syntax, expected opening `%`");var n=[];return S(e,k,(function(e,t,r,i){n[n.length]=r?S(i,R,"$1"):t||e})),n}(e),n=r.length>0?r[0]:"",o=O("%"+n+"%",t),s=o.name,u=o.value,c=!1,h=o.alias;h&&(n=h[0],E(r,w([0,1],h)));for(var l=1,d=!0;l=r.length){var g=f(u,p);u=(d=!!g)&&"get"in g&&!("originalValue"in g.get)?g.get:u[p]}else d=v(u,p),u=u[p];d&&!c&&(b[s]=u)}}return u}},(e,t,r)=>{"use strict";var n=r(228),i="function"==typeof Symbol&&"symbol"==typeof Symbol("foo"),o=Object.prototype.toString,a=Array.prototype.concat,s=Object.defineProperty,f=r(230)(),u=s&&f,c=function(e,t,r,n){if(t in e)if(!0===n){if(e[t]===r)return}else if("function"!=typeof(i=n)||"[object Function]"!==o.call(i)||!n())return;var i;u?s(e,t,{configurable:!0,enumerable:!1,value:r,writable:!0}):e[t]=r},h=function(e,t){var r=arguments.length>2?arguments[2]:{},o=n(t);i&&(o=a.call(o,Object.getOwnPropertySymbols(t)));for(var s=0;s{var n=r(160).Buffer,i=r(54);e.exports=function(e,t,r,o){if(n.isBuffer(e)||(e=n.from(e,"binary")),t&&(n.isBuffer(t)||(t=n.from(t,"binary")),8!==t.length))throw new RangeError("salt should be Buffer with 8 byte length");for(var a=r/8,s=n.alloc(a),f=n.alloc(o||0),u=n.alloc(0);a>0||o>0;){var c=new i;c.update(u),c.update(e),t&&c.update(t),u=c.digest();var h=0;if(a>0){var l=s.length-a;h=Math.min(a,u.length),u.copy(s,l,0,h),a-=h}if(h0){var d=f.length-o,p=Math.min(o,u.length-h);u.copy(f,d,h,h+p),o-=p}}return u.fill(0),{key:s,iv:f}}},(e,t,r)=>{var n=r(329),i=r(330),o=r(258),a=r(122),s=r(103),f=r(75).Buffer;function u(e){var t;"object"!=typeof e||f.isBuffer(e)||(t=e.passphrase,e=e.key),"string"==typeof e&&(e=f.from(e));var r,u,c=o(e,t),h=c.tag,l=c.data;switch(h){case"CERTIFICATE":u=n.certificate.decode(l,"der").tbsCertificate.subjectPublicKeyInfo;case"PUBLIC KEY":switch(u||(u=n.PublicKey.decode(l,"der")),r=u.algorithm.algorithm.join(".")){case"1.2.840.113549.1.1.1":return n.RSAPublicKey.decode(u.subjectPublicKey.data,"der");case"1.2.840.10045.2.1":return u.subjectPrivateKey=u.subjectPublicKey,{type:"ec",data:u};case"1.2.840.10040.4.1":return u.algorithm.params.pub_key=n.DSAparam.decode(u.subjectPublicKey.data,"der"),{type:"dsa",data:u.algorithm.params};default:throw new Error("unknown key id "+r)}case"ENCRYPTED PRIVATE KEY":l=function(e,t){var r=e.algorithm.decrypt.kde.kdeparams.salt,n=parseInt(e.algorithm.decrypt.kde.kdeparams.iters.toString(),10),o=i[e.algorithm.decrypt.cipher.algo.join(".")],u=e.algorithm.decrypt.cipher.iv,c=e.subjectPrivateKey,h=parseInt(o.split("-")[1],10)/8,l=s.pbkdf2Sync(t,r,n,h,"sha1"),d=a.createDecipheriv(o,l,u),p=[];return p.push(d.update(c)),p.push(d.final()),f.concat(p)}(l=n.EncryptedPrivateKey.decode(l,"der"),t);case"PRIVATE KEY":switch(r=(u=n.PrivateKey.decode(l,"der")).algorithm.algorithm.join(".")){case"1.2.840.113549.1.1.1":return n.RSAPrivateKey.decode(u.subjectPrivateKey,"der");case"1.2.840.10045.2.1":return{curve:u.algorithm.curve,privateKey:n.ECPrivateKey.decode(u.subjectPrivateKey,"der").privateKey};case"1.2.840.10040.4.1":return u.algorithm.params.priv_key=n.DSAparam.decode(u.subjectPrivateKey,"der"),{type:"dsa",params:u.algorithm.params};default:throw new Error("unknown key id "+r)}case"RSA PUBLIC KEY":return n.RSAPublicKey.decode(l,"der");case"RSA PRIVATE KEY":return n.RSAPrivateKey.decode(l,"der");case"DSA PRIVATE KEY":return{type:"dsa",params:n.DSAPrivateKey.decode(l,"der")};case"EC PRIVATE KEY":return{curve:(l=n.ECPrivateKey.decode(l,"der")).parameters.value,privateKey:l.privateKey};default:throw new Error("unknown key type "+h)}}e.exports=u,u.signature=n.signature},(e,t,r)=>{"use strict";var n=r(60),i=r(37),o=i("%Function.prototype.apply%"),a=i("%Function.prototype.call%"),s=i("%Reflect.apply%",!0)||n.call(a,o),f=i("%Object.getOwnPropertyDescriptor%",!0),u=i("%Object.defineProperty%",!0),c=i("%Math.max%");if(u)try{u({},"a",{value:1})}catch(e){u=null}e.exports=function(e){var t=s(n,a,arguments);return f&&u&&f(t,"length").configurable&&u(t,"length",{value:1+c(0,e.length-(arguments.length-1))}),t};var h=function(){return s(n,o,arguments)};u?u(e.exports,"apply",{value:h}):e.exports.apply=h},(e,t)=>{"use strict";function r(e){const t={};return Object.keys(e).forEach((function(r){(0|r)==r&&(r|=0);const n=e[r];t[n]=r})),t}t.tagClass={0:"universal",1:"application",2:"context",3:"private"},t.tagClassByName=r(t.tagClass),t.tag={0:"end",1:"bool",2:"int",3:"bitstr",4:"octstr",5:"null_",6:"objid",7:"objDesc",8:"external",9:"real",10:"enum",11:"embed",12:"utf8str",13:"relativeOid",16:"seq",17:"set",18:"numstr",19:"printstr",20:"t61str",21:"videostr",22:"ia5str",23:"utctime",24:"gentime",25:"graphstr",26:"iso646str",27:"genstr",28:"unistr",29:"charstr",30:"bmpstr"},t.tagByName=r(t.tag)},(e,t,r)=>{"use strict";e.exports=h;var n,i=r(8),o=i.LongBits,a=i.base64,s=i.utf8;function f(e,t,r){this.fn=e,this.len=t,this.next=void 0,this.val=r}function u(){}function c(e){this.head=e.head,this.tail=e.tail,this.len=e.len,this.next=e.states}function h(){this.len=0,this.head=new f(u,0,0),this.tail=this.head,this.states=null}function l(e,t,r){t[r]=255&e}function d(e,t){this.len=e,this.next=void 0,this.val=t}function p(e,t,r){for(;e.hi;)t[r++]=127&e.lo|128,e.lo=(e.lo>>>7|e.hi<<25)>>>0,e.hi>>>=7;for(;e.lo>127;)t[r++]=127&e.lo|128,e.lo=e.lo>>>7;t[r++]=e.lo}function b(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}h.create=i.Buffer?function(){return(h.create=function(){return new n})()}:function(){return new h},h.alloc=function(e){return new i.Array(e)},i.Array!==Array&&(h.alloc=i.pool(h.alloc,i.Array.prototype.subarray)),h.prototype._push=function(e,t,r){return this.tail=this.tail.next=new f(e,t,r),this.len+=t,this},d.prototype=Object.create(f.prototype),d.prototype.fn=function(e,t,r){for(;e>127;)t[r++]=127&e|128,e>>>=7;t[r]=e},h.prototype.uint32=function(e){return this.len+=(this.tail=this.tail.next=new d((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this},h.prototype.int32=function(e){return e<0?this._push(p,10,o.fromNumber(e)):this.uint32(e)},h.prototype.sint32=function(e){return this.uint32((e<<1^e>>31)>>>0)},h.prototype.uint64=function(e){var t=o.from(e);return this._push(p,t.length(),t)},h.prototype.int64=h.prototype.uint64,h.prototype.sint64=function(e){var t=o.from(e).zzEncode();return this._push(p,t.length(),t)},h.prototype.bool=function(e){return this._push(l,1,e?1:0)},h.prototype.fixed32=function(e){return this._push(b,4,e>>>0)},h.prototype.sfixed32=h.prototype.fixed32,h.prototype.fixed64=function(e){var t=o.from(e);return this._push(b,4,t.lo)._push(b,4,t.hi)},h.prototype.sfixed64=h.prototype.fixed64,h.prototype.float=function(e){return this._push(i.float.writeFloatLE,4,e)},h.prototype.double=function(e){return this._push(i.float.writeDoubleLE,8,e)};var y=i.Array.prototype.set?function(e,t,r){t.set(e,r)}:function(e,t,r){for(var n=0;n>>0;if(!t)return this._push(l,1,0);if(i.isString(e)){var r=h.alloc(t=a.length(e));a.decode(e,r,0),e=r}return this.uint32(t)._push(y,t,e)},h.prototype.string=function(e){var t=s.length(e);return t?this.uint32(t)._push(s.write,t,e):this._push(l,1,0)},h.prototype.fork=function(){return this.states=new c(this),this.head=this.tail=new f(u,0,0),this.len=0,this},h.prototype.reset=function(){return this.states?(this.head=this.states.head,this.tail=this.states.tail,this.len=this.states.len,this.states=this.states.next):(this.head=this.tail=new f(u,0,0),this.len=0),this},h.prototype.ldelim=function(){var e=this.head,t=this.tail,r=this.len;return this.reset().uint32(r),r&&(this.tail.next=e.next,this.tail=t,this.len+=r),this},h.prototype.finish=function(){for(var e=this.head.next,t=this.constructor.alloc(this.len),r=0;e;)e.fn(e.val,t,r),r+=e.len,e=e.next;return t},h._configure=function(e){n=e}},(e,t,r)=>{"use strict";e.exports=f;var n,i=r(8),o=i.LongBits,a=i.utf8;function s(e,t){return RangeError("index out of range: "+e.pos+" + "+(t||1)+" > "+e.len)}function f(e){this.buf=e,this.pos=0,this.len=e.length}var u,c="undefined"!=typeof Uint8Array?function(e){if(e instanceof Uint8Array||Array.isArray(e))return new f(e);throw Error("illegal buffer")}:function(e){if(Array.isArray(e))return new f(e);throw Error("illegal buffer")};function h(){var e=new o(0,0),t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw s(this);if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e}return e.lo=(e.lo|(127&this.buf[this.pos++])<<7*t)>>>0,e}for(;t<4;++t)if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e;if(e.lo=(e.lo|(127&this.buf[this.pos])<<28)>>>0,e.hi=(e.hi|(127&this.buf[this.pos])>>4)>>>0,this.buf[this.pos++]<128)return e;if(t=0,this.len-this.pos>4){for(;t<5;++t)if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}else for(;t<5;++t){if(this.pos>=this.len)throw s(this);if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}throw Error("invalid varint encoding")}function l(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}function d(){if(this.pos+8>this.len)throw s(this,8);return new o(l(this.buf,this.pos+=4),l(this.buf,this.pos+=4))}f.create=i.Buffer?function(e){return(f.create=function(e){return i.Buffer.isBuffer(e)?new n(e):c(e)})(e)}:c,f.prototype._slice=i.Array.prototype.subarray||i.Array.prototype.slice,f.prototype.uint32=(u=4294967295,function(){if(u=(127&this.buf[this.pos])>>>0,this.buf[this.pos++]<128)return u;if(u=(u|(127&this.buf[this.pos])<<7)>>>0,this.buf[this.pos++]<128)return u;if(u=(u|(127&this.buf[this.pos])<<14)>>>0,this.buf[this.pos++]<128)return u;if(u=(u|(127&this.buf[this.pos])<<21)>>>0,this.buf[this.pos++]<128)return u;if(u=(u|(15&this.buf[this.pos])<<28)>>>0,this.buf[this.pos++]<128)return u;if((this.pos+=5)>this.len)throw this.pos=this.len,s(this,10);return u}),f.prototype.int32=function(){return 0|this.uint32()},f.prototype.sint32=function(){var e=this.uint32();return e>>>1^-(1&e)|0},f.prototype.bool=function(){return 0!==this.uint32()},f.prototype.fixed32=function(){if(this.pos+4>this.len)throw s(this,4);return l(this.buf,this.pos+=4)},f.prototype.sfixed32=function(){if(this.pos+4>this.len)throw s(this,4);return 0|l(this.buf,this.pos+=4)},f.prototype.float=function(){if(this.pos+4>this.len)throw s(this,4);var e=i.float.readFloatLE(this.buf,this.pos);return this.pos+=4,e},f.prototype.double=function(){if(this.pos+8>this.len)throw s(this,4);var e=i.float.readDoubleLE(this.buf,this.pos);return this.pos+=8,e},f.prototype.bytes=function(){var e=this.uint32(),t=this.pos,r=this.pos+e;if(r>this.len)throw s(this,e);return this.pos+=e,Array.isArray(this.buf)?this.buf.slice(t,r):t===r?new this.buf.constructor(0):this._slice.call(this.buf,t,r)},f.prototype.string=function(){var e=this.bytes();return a.read(e,0,e.length)},f.prototype.skip=function(e){if("number"==typeof e){if(this.pos+e>this.len)throw s(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw s(this)}while(128&this.buf[this.pos++]);return this},f.prototype.skipType=function(e){switch(e){case 0:this.skip();break;case 1:this.skip(8);break;case 2:this.skip(this.uint32());break;case 3:for(;4!=(e=7&this.uint32());)this.skipType(e);break;case 5:this.skip(4);break;default:throw Error("invalid wire type "+e+" at offset "+this.pos)}return this},f._configure=function(e){n=e;var t=i.Long?"toLong":"toNumber";i.merge(f.prototype,{int64:function(){return h.call(this)[t](!1)},uint64:function(){return h.call(this)[t](!0)},sint64:function(){return h.call(this).zzDecode()[t](!1)},fixed64:function(){return d.call(this)[t](!0)},sfixed64:function(){return d.call(this)[t](!1)}})}},(e,t,r)=>{"use strict";e.exports=g;var n=r(19);((g.prototype=Object.create(n.prototype)).constructor=g).className="Type";var i=r(7),o=r(32),a=r(15),s=r(46),f=r(47),u=r(49),c=r(44),h=r(43),l=r(4),d=r(80),p=r(81),b=r(82),y=r(83),m=r(84);function g(e,t){n.call(this,e,t),this.fields={},this.oneofs=void 0,this.extensions=void 0,this.reserved=void 0,this.group=void 0,this._fieldsById=null,this._fieldsArray=null,this._oneofsArray=null,this._ctor=null}function _(e){return e._fieldsById=e._fieldsArray=e._oneofsArray=null,delete e.encode,delete e.decode,delete e.verify,e}Object.defineProperties(g.prototype,{fieldsById:{get:function(){if(this._fieldsById)return this._fieldsById;this._fieldsById={};for(var e=Object.keys(this.fields),t=0;t{"use strict";e.exports=a;var n=r(15);((a.prototype=Object.create(n.prototype)).constructor=a).className="MapField";var i=r(17),o=r(4);function a(e,t,r,i,a,s){if(n.call(this,e,t,i,void 0,void 0,a,s),!o.isString(r))throw TypeError("keyType must be a string");this.keyType=r,this.resolvedKeyType=null,this.map=!0}a.fromJSON=function(e,t){return new a(e,t.id,t.keyType,t.type,t.options,t.comment)},a.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return o.toObject(["keyType",this.keyType,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},a.prototype.resolve=function(){if(this.resolved)return this;if(void 0===i.mapKey[this.keyType])throw Error("invalid key type: "+this.keyType);return n.prototype.resolve.call(this)},a.d=function(e,t,r){return"function"==typeof r?r=o.decorateType(r).name:r&&"object"==typeof r&&(r=o.decorateEnum(r).name),function(n,i){o.decorateType(n.constructor).add(new a(i,e,t,r))}}},(e,t,r)=>{"use strict";e.exports=s;var n=r(19);((s.prototype=Object.create(n.prototype)).constructor=s).className="Service";var i=r(48),o=r(4),a=r(78);function s(e,t){n.call(this,e,t),this.methods={},this._methodsArray=null}function f(e){return e._methodsArray=null,e}s.fromJSON=function(e,t){var r=new s(e,t.options);if(t.methods)for(var n=Object.keys(t.methods),o=0;o{"use strict";e.exports=o;var n=r(16);((o.prototype=Object.create(n.prototype)).constructor=o).className="Method";var i=r(4);function o(e,t,r,o,a,s,f,u){if(i.isObject(a)?(f=a,a=s=void 0):i.isObject(s)&&(f=s,s=void 0),void 0!==t&&!i.isString(t))throw TypeError("type must be a string");if(!i.isString(r))throw TypeError("requestType must be a string");if(!i.isString(o))throw TypeError("responseType must be a string");n.call(this,e,f),this.type=t||"rpc",this.requestType=r,this.requestStream=!!a||void 0,this.responseType=o,this.responseStream=!!s||void 0,this.resolvedRequestType=null,this.resolvedResponseType=null,this.comment=u}o.fromJSON=function(e,t){return new o(e,t.type,t.requestType,t.responseType,t.requestStream,t.responseStream,t.options,t.comment)},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return i.toObject(["type","rpc"!==this.type&&this.type||void 0,"requestType",this.requestType,"requestStream",this.requestStream,"responseType",this.responseType,"responseStream",this.responseStream,"options",this.options,"comment",t?this.comment:void 0])},o.prototype.resolve=function(){return this.resolved?this:(this.resolvedRequestType=this.parent.lookupType(this.requestType),this.resolvedResponseType=this.parent.lookupType(this.responseType),n.prototype.resolve.call(this))}},(e,t,r)=>{"use strict";e.exports=i;var n=r(8);function i(e){if(e)for(var t=Object.keys(e),r=0;r{"use strict";e.exports=h;var n=r(19);((h.prototype=Object.create(n.prototype)).constructor=h).className="Root";var i,o,a,s=r(15),f=r(7),u=r(32),c=r(4);function h(e){n.call(this,"",e),this.deferred=[],this.files=[]}function l(){}h.fromJSON=function(e,t){return t||(t=new h),e.options&&t.setOptions(e.options),t.addJSON(e.nested)},h.prototype.resolvePath=c.path.resolve,h.prototype.load=function e(t,r,n){"function"==typeof r&&(n=r,r=void 0);var i=this;if(!n)return c.asPromise(e,i,t,r);var s=n===l;function f(e,t){if(n){var r=n;if(n=null,s)throw e;r(e,t)}}function u(e,t){try{if(c.isString(t)&&"{"===t.charAt(0)&&(t=JSON.parse(t)),c.isString(t)){o.filename=e;var n,a=o(t,i,r),u=0;if(a.imports)for(;u-1){var o=e.substring(r);o in a&&(e=o)}if(!(i.files.indexOf(e)>-1))if(i.files.push(e),e in a)s?u(e,a[e]):(++d,setTimeout((function(){--d,u(e,a[e])})));else if(s){var h;try{h=c.fs.readFileSync(e).toString("utf8")}catch(e){return void(t||f(e))}u(e,h)}else++d,c.fetch(e,(function(r,o){--d,n&&(r?t?d||f(null,i):f(r):u(e,o))}))}var d=0;c.isString(t)&&(t=[t]);for(var p,b=0;b-1&&this.deferred.splice(t,1)}}else if(e instanceof f)d.test(e.name)&&delete e.parent[e.name];else if(e instanceof n){for(var r=0;r{var n;function i(e){this.rand=e}if(e.exports=function(e){return n||(n=new i(null)),n.generate(e)},e.exports.Rand=i,i.prototype.generate=function(e){return this._rand(e)},i.prototype._rand=function(e){if(this.rand.getBytes)return this.rand.getBytes(e);for(var t=new Uint8Array(e),r=0;r{"use strict";var n,i=t,o=r(53),a=r(87),s=r(5).assert;function f(e){"short"===e.type?this.curve=new a.short(e):"edwards"===e.type?this.curve=new a.edwards(e):this.curve=new a.mont(e),this.g=this.curve.g,this.n=this.curve.n,this.hash=e.hash,s(this.g.validate(),"Invalid curve"),s(this.g.mul(this.n).isInfinity(),"Invalid curve, G*N != O")}function u(e,t){Object.defineProperty(i,e,{configurable:!0,enumerable:!0,get:function(){var r=new f(t);return Object.defineProperty(i,e,{configurable:!0,enumerable:!0,value:r}),r}})}i.PresetCurve=f,u("p192",{type:"short",prime:"p192",p:"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff",a:"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc",b:"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1",n:"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831",hash:o.sha256,gRed:!1,g:["188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012","07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811"]}),u("p224",{type:"short",prime:"p224",p:"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001",a:"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe",b:"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4",n:"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d",hash:o.sha256,gRed:!1,g:["b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21","bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34"]}),u("p256",{type:"short",prime:null,p:"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff",a:"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc",b:"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b",n:"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551",hash:o.sha256,gRed:!1,g:["6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296","4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5"]}),u("p384",{type:"short",prime:null,p:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff",a:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc",b:"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef",n:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973",hash:o.sha384,gRed:!1,g:["aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7","3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f"]}),u("p521",{type:"short",prime:null,p:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff",a:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc",b:"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00",n:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409",hash:o.sha512,gRed:!1,g:["000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66","00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650"]}),u("curve25519",{type:"mont",prime:"p25519",p:"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed",a:"76d06",b:"1",n:"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed",hash:o.sha256,gRed:!1,g:["9"]}),u("ed25519",{type:"edwards",prime:"p25519",p:"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed",a:"-1",c:"1",d:"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3",n:"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed",hash:o.sha256,gRed:!1,g:["216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a","6666666666666666666666666666666666666666666666666666666666666658"]});try{n=r(189)}catch(e){n=void 0}u("secp256k1",{type:"short",prime:"k256",p:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f",a:"0",b:"7",n:"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141",h:"1",hash:o.sha256,beta:"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee",lambda:"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72",basis:[{a:"3086d221a7d46bcde86c90e49284eb15",b:"-e4437ed6010e88286f547fa90abfe4c3"},{a:"114ca50f7a8e2f3f657c1108d9d44cfd8",b:"3086d221a7d46bcde86c90e49284eb15"}],gRed:!1,g:["79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798","483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8",n]})},(e,t,r)=>{var n=t;n.utils=r(9),n.common=r(34),n.sha=r(303),n.ripemd=r(304),n.hmac=r(188),n.sha1=n.sha.sha1,n.sha256=n.sha.sha256,n.sha224=n.sha.sha224,n.sha384=n.sha.sha384,n.sha512=n.sha.sha512,n.ripemd160=n.ripemd.ripemd160},(e,t,r)=>{"use strict";var n=r(0),i=r(90),o=r(1).Buffer,a=new Array(16);function s(){i.call(this,64),this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878}function f(e,t){return e<>>32-t}function u(e,t,r,n,i,o,a){return f(e+(t&r|~t&n)+i+o|0,a)+t|0}function c(e,t,r,n,i,o,a){return f(e+(t&n|r&~n)+i+o|0,a)+t|0}function h(e,t,r,n,i,o,a){return f(e+(t^r^n)+i+o|0,a)+t|0}function l(e,t,r,n,i,o,a){return f(e+(r^(t|~n))+i+o|0,a)+t|0}n(s,i),s.prototype._update=function(){for(var e=a,t=0;t<16;++t)e[t]=this._block.readInt32LE(4*t);var r=this._a,n=this._b,i=this._c,o=this._d;r=u(r,n,i,o,e[0],3614090360,7),o=u(o,r,n,i,e[1],3905402710,12),i=u(i,o,r,n,e[2],606105819,17),n=u(n,i,o,r,e[3],3250441966,22),r=u(r,n,i,o,e[4],4118548399,7),o=u(o,r,n,i,e[5],1200080426,12),i=u(i,o,r,n,e[6],2821735955,17),n=u(n,i,o,r,e[7],4249261313,22),r=u(r,n,i,o,e[8],1770035416,7),o=u(o,r,n,i,e[9],2336552879,12),i=u(i,o,r,n,e[10],4294925233,17),n=u(n,i,o,r,e[11],2304563134,22),r=u(r,n,i,o,e[12],1804603682,7),o=u(o,r,n,i,e[13],4254626195,12),i=u(i,o,r,n,e[14],2792965006,17),r=c(r,n=u(n,i,o,r,e[15],1236535329,22),i,o,e[1],4129170786,5),o=c(o,r,n,i,e[6],3225465664,9),i=c(i,o,r,n,e[11],643717713,14),n=c(n,i,o,r,e[0],3921069994,20),r=c(r,n,i,o,e[5],3593408605,5),o=c(o,r,n,i,e[10],38016083,9),i=c(i,o,r,n,e[15],3634488961,14),n=c(n,i,o,r,e[4],3889429448,20),r=c(r,n,i,o,e[9],568446438,5),o=c(o,r,n,i,e[14],3275163606,9),i=c(i,o,r,n,e[3],4107603335,14),n=c(n,i,o,r,e[8],1163531501,20),r=c(r,n,i,o,e[13],2850285829,5),o=c(o,r,n,i,e[2],4243563512,9),i=c(i,o,r,n,e[7],1735328473,14),r=h(r,n=c(n,i,o,r,e[12],2368359562,20),i,o,e[5],4294588738,4),o=h(o,r,n,i,e[8],2272392833,11),i=h(i,o,r,n,e[11],1839030562,16),n=h(n,i,o,r,e[14],4259657740,23),r=h(r,n,i,o,e[1],2763975236,4),o=h(o,r,n,i,e[4],1272893353,11),i=h(i,o,r,n,e[7],4139469664,16),n=h(n,i,o,r,e[10],3200236656,23),r=h(r,n,i,o,e[13],681279174,4),o=h(o,r,n,i,e[0],3936430074,11),i=h(i,o,r,n,e[3],3572445317,16),n=h(n,i,o,r,e[6],76029189,23),r=h(r,n,i,o,e[9],3654602809,4),o=h(o,r,n,i,e[12],3873151461,11),i=h(i,o,r,n,e[15],530742520,16),r=l(r,n=h(n,i,o,r,e[2],3299628645,23),i,o,e[0],4096336452,6),o=l(o,r,n,i,e[7],1126891415,10),i=l(i,o,r,n,e[14],2878612391,15),n=l(n,i,o,r,e[5],4237533241,21),r=l(r,n,i,o,e[12],1700485571,6),o=l(o,r,n,i,e[3],2399980690,10),i=l(i,o,r,n,e[10],4293915773,15),n=l(n,i,o,r,e[1],2240044497,21),r=l(r,n,i,o,e[8],1873313359,6),o=l(o,r,n,i,e[15],4264355552,10),i=l(i,o,r,n,e[6],2734768916,15),n=l(n,i,o,r,e[13],1309151649,21),r=l(r,n,i,o,e[4],4149444226,6),o=l(o,r,n,i,e[11],3174756917,10),i=l(i,o,r,n,e[2],718787259,15),n=l(n,i,o,r,e[9],3951481745,21),this._a=this._a+r|0,this._b=this._b+n|0,this._c=this._c+i|0,this._d=this._d+o|0},s.prototype._digest=function(){this._block[this._blockOffset++]=128,this._blockOffset>56&&(this._block.fill(0,this._blockOffset,64),this._update(),this._blockOffset=0),this._block.fill(0,this._blockOffset,56),this._block.writeUInt32LE(this._length[0],56),this._block.writeUInt32LE(this._length[1],60),this._update();var e=o.allocUnsafe(16);return e.writeInt32LE(this._a,0),e.writeInt32LE(this._b,4),e.writeInt32LE(this._c,8),e.writeInt32LE(this._d,12),e},e.exports=s},(e,t,r)=>{"use strict";var n=r(21).q.ERR_STREAM_PREMATURE_CLOSE;function i(){}e.exports=function e(t,r,o){if("function"==typeof r)return e(t,null,r);r||(r={}),o=function(e){var t=!1;return function(){if(!t){t=!0;for(var r=arguments.length,n=new Array(r),i=0;i{"use strict";var n=r(3).Buffer,i=r(0),o=r(90),a=new Array(16),s=[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8,3,10,14,4,9,15,8,1,2,7,0,6,13,11,5,12,1,9,11,10,0,8,12,4,13,3,7,15,14,5,6,2,4,0,5,9,7,12,2,10,14,1,3,8,11,6,15,13],f=[5,14,7,0,9,2,11,4,13,6,15,8,1,10,3,12,6,11,3,7,0,13,5,10,14,15,8,12,4,9,1,2,15,5,1,3,7,14,6,9,11,8,12,2,10,0,4,13,8,6,4,1,3,11,15,0,5,12,2,13,9,7,10,14,12,15,10,4,1,5,8,7,6,2,13,14,0,3,9,11],u=[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8,7,6,8,13,11,9,7,15,7,12,15,9,11,7,13,12,11,13,6,7,14,9,13,15,14,8,13,6,5,12,7,5,11,12,14,15,14,15,9,8,9,14,5,6,8,6,5,12,9,15,5,11,6,8,13,12,5,12,13,14,11,8,5,6],c=[8,9,9,11,13,15,15,5,7,7,8,11,14,14,12,6,9,13,15,7,12,8,9,11,7,7,12,7,6,15,13,11,9,7,15,11,8,6,6,14,12,13,5,14,13,13,7,5,15,5,8,11,14,14,6,14,6,9,12,9,12,5,15,8,8,5,12,9,12,5,14,6,8,13,6,5,15,13,11,11],h=[0,1518500249,1859775393,2400959708,2840853838],l=[1352829926,1548603684,1836072691,2053994217,0];function d(){o.call(this,64),this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520}function p(e,t){return e<>>32-t}function b(e,t,r,n,i,o,a,s){return p(e+(t^r^n)+o+a|0,s)+i|0}function y(e,t,r,n,i,o,a,s){return p(e+(t&r|~t&n)+o+a|0,s)+i|0}function m(e,t,r,n,i,o,a,s){return p(e+((t|~r)^n)+o+a|0,s)+i|0}function g(e,t,r,n,i,o,a,s){return p(e+(t&n|r&~n)+o+a|0,s)+i|0}function _(e,t,r,n,i,o,a,s){return p(e+(t^(r|~n))+o+a|0,s)+i|0}i(d,o),d.prototype._update=function(){for(var e=a,t=0;t<16;++t)e[t]=this._block.readInt32LE(4*t);for(var r=0|this._a,n=0|this._b,i=0|this._c,o=0|this._d,d=0|this._e,v=0|this._a,w=0|this._b,E=0|this._c,S=0|this._d,M=0|this._e,A=0;A<80;A+=1){var k,R;A<16?(k=b(r,n,i,o,d,e[s[A]],h[0],u[A]),R=_(v,w,E,S,M,e[f[A]],l[0],c[A])):A<32?(k=y(r,n,i,o,d,e[s[A]],h[1],u[A]),R=g(v,w,E,S,M,e[f[A]],l[1],c[A])):A<48?(k=m(r,n,i,o,d,e[s[A]],h[2],u[A]),R=m(v,w,E,S,M,e[f[A]],l[2],c[A])):A<64?(k=g(r,n,i,o,d,e[s[A]],h[3],u[A]),R=y(v,w,E,S,M,e[f[A]],l[3],c[A])):(k=_(r,n,i,o,d,e[s[A]],h[4],u[A]),R=b(v,w,E,S,M,e[f[A]],l[4],c[A])),r=d,d=o,o=p(i,10),i=n,n=k,v=M,M=S,S=p(E,10),E=w,w=R}var O=this._b+i+S|0;this._b=this._c+o+M|0,this._c=this._d+d+v|0,this._d=this._e+r+w|0,this._e=this._a+n+E|0,this._a=O},d.prototype._digest=function(){this._block[this._blockOffset++]=128,this._blockOffset>56&&(this._block.fill(0,this._blockOffset,64),this._update(),this._blockOffset=0),this._block.fill(0,this._blockOffset,56),this._block.writeUInt32LE(this._length[0],56),this._block.writeUInt32LE(this._length[1],60),this._update();var e=n.alloc?n.alloc(20):new n(20);return e.writeInt32LE(this._a,0),e.writeInt32LE(this._b,4),e.writeInt32LE(this._c,8),e.writeInt32LE(this._d,12),e.writeInt32LE(this._e,16),e},e.exports=d},(e,t,r)=>{var n=e.exports=function(e){e=e.toLowerCase();var t=n[e];if(!t)throw new Error(e+" is not supported (we accept pull requests)");return new t};n.sha=r(203),n.sha1=r(204),n.sha224=r(205),n.sha256=r(96),n.sha384=r(206),n.sha512=r(97)},(e,t,r)=>{"use strict";var n=r(22).q.ERR_STREAM_PREMATURE_CLOSE;function i(){}e.exports=function e(t,r,o){if("function"==typeof r)return e(t,null,r);r||(r={}),o=function(e){var t=!1;return function(){if(!t){t=!0;for(var r=arguments.length,n=new Array(r),i=0;i{"use strict";var n=r(37),i=r(41),o=i(n("String.prototype.indexOf"));e.exports=function(e,t){var r=n(e,!!t);return"function"==typeof r&&o(e,".prototype.")>-1?i(r):r}},(e,t,r)=>{"use strict";var n=r(220);e.exports=Function.prototype.bind||n},(e,t,r)=>{"use strict";t.randomBytes=t.rng=t.pseudoRandomBytes=t.prng=r(12),t.createHash=t.Hash=r(13),t.createHmac=t.Hmac=r(120);var n=r(311),i=Object.keys(n),o=["sha1","sha224","sha256","sha384","sha512","md5","rmd160"].concat(i);t.getHashes=function(){return o};var a=r(103);t.pbkdf2=a.pbkdf2,t.pbkdf2Sync=a.pbkdf2Sync;var s=r(237);t.Cipher=s.Cipher,t.createCipher=s.createCipher,t.Cipheriv=s.Cipheriv,t.createCipheriv=s.createCipheriv,t.Decipher=s.Decipher,t.createDecipher=s.createDecipher,t.Decipheriv=s.Decipheriv,t.createDecipheriv=s.createDecipheriv,t.getCiphers=s.getCiphers,t.listCiphers=s.listCiphers;var f=r(323);t.DiffieHellmanGroup=f.DiffieHellmanGroup,t.createDiffieHellmanGroup=f.createDiffieHellmanGroup,t.getDiffieHellman=f.getDiffieHellman,t.createDiffieHellman=f.createDiffieHellman,t.DiffieHellman=f.DiffieHellman;var u=r(244);t.createSign=u.createSign,t.Sign=u.Sign,t.createVerify=u.createVerify,t.Verify=u.Verify,t.createECDH=r(261);var c=r(162);t.publicEncrypt=c.publicEncrypt,t.privateEncrypt=c.privateEncrypt,t.publicDecrypt=c.publicDecrypt,t.privateDecrypt=c.privateDecrypt;var h=r(331);t.randomFill=h.randomFill,t.randomFillSync=h.randomFillSync,t.createCredentials=function(){throw new Error(["sorry, createCredentials is not implemented yet","we accept pull requests","https://github.com/crypto-browserify/crypto-browserify"].join("\n"))},t.constants={DH_CHECK_P_NOT_SAFE_PRIME:2,DH_CHECK_P_NOT_PRIME:1,DH_UNABLE_TO_CHECK_GENERATOR:4,DH_NOT_SUITABLE_GENERATOR:8,NPN_ENABLED:1,ALPN_ENABLED:1,RSA_PKCS1_PADDING:1,RSA_SSLV23_PADDING:2,RSA_NO_PADDING:3,RSA_PKCS1_OAEP_PADDING:4,RSA_X931_PADDING:5,RSA_PKCS1_PSS_PADDING:6,POINT_CONVERSION_COMPRESSED:2,POINT_CONVERSION_UNCOMPRESSED:4,POINT_CONVERSION_HYBRID:6}},(e,t,r)=>{"use strict";var n=r(6);function i(e){this.options=e,this.type=this.options.type,this.blockSize=8,this._init(),this.buffer=new Array(this.blockSize),this.bufferOff=0}e.exports=i,i.prototype._init=function(){},i.prototype.update=function(e){return 0===e.length?[]:"decrypt"===this.type?this._updateDecrypt(e):this._updateEncrypt(e)},i.prototype._buffer=function(e,t){for(var r=Math.min(this.buffer.length-this.bufferOff,e.length-t),n=0;n0;n--)t+=this._buffer(e,t),r+=this._flushBuffer(i,r);return t+=this._buffer(e,t),i},i.prototype.final=function(e){var t,r;return e&&(t=this.update(e)),r="encrypt"===this.type?this._finalEncrypt():this._finalDecrypt(),t?t.concat(r):r},i.prototype._pad=function(e,t){if(0===t)return!1;for(;t{var n={ECB:r(315),CBC:r(316),CFB:r(317),CFB8:r(318),CFB1:r(319),OFB:r(320),CTR:r(293),GCM:r(293)},i=r(241);for(var o in i)i[o].module=n[i[o].mode];e.exports=i},(e,t,r)=>{var n=r(1).Buffer;function i(e){n.isBuffer(e)||(e=n.from(e));for(var t=e.length/4|0,r=new Array(t),i=0;i>>24]^c[p>>>16&255]^h[b>>>8&255]^l[255&y]^t[m++],a=u[p>>>24]^c[b>>>16&255]^h[y>>>8&255]^l[255&d]^t[m++],s=u[b>>>24]^c[y>>>16&255]^h[d>>>8&255]^l[255&p]^t[m++],f=u[y>>>24]^c[d>>>16&255]^h[p>>>8&255]^l[255&b]^t[m++],d=o,p=a,b=s,y=f;return o=(n[d>>>24]<<24|n[p>>>16&255]<<16|n[b>>>8&255]<<8|n[255&y])^t[m++],a=(n[p>>>24]<<24|n[b>>>16&255]<<16|n[y>>>8&255]<<8|n[255&d])^t[m++],s=(n[b>>>24]<<24|n[y>>>16&255]<<16|n[d>>>8&255]<<8|n[255&p])^t[m++],f=(n[y>>>24]<<24|n[d>>>16&255]<<16|n[p>>>8&255]<<8|n[255&b])^t[m++],[o>>>=0,a>>>=0,s>>>=0,f>>>=0]}var s=[0,1,2,4,8,16,32,64,128,27,54],f=function(){for(var e=new Array(256),t=0;t<256;t++)e[t]=t<128?t<<1:t<<1^283;for(var r=[],n=[],i=[[],[],[],[]],o=[[],[],[],[]],a=0,s=0,f=0;f<256;++f){var u=s^s<<1^s<<2^s<<3^s<<4;u=u>>>8^255&u^99,r[a]=u,n[u]=a;var c=e[a],h=e[c],l=e[h],d=257*e[u]^16843008*u;i[0][a]=d<<24|d>>>8,i[1][a]=d<<16|d>>>16,i[2][a]=d<<8|d>>>24,i[3][a]=d,d=16843009*l^65537*h^257*c^16843008*a,o[0][u]=d<<24|d>>>8,o[1][u]=d<<16|d>>>16,o[2][u]=d<<8|d>>>24,o[3][u]=d,0===a?a=s=1:(a=c^e[e[e[l^c]]],s^=e[e[s]])}return{SBOX:r,INV_SBOX:n,SUB_MIX:i,INV_SUB_MIX:o}}();function u(e){this._key=i(e),this._reset()}u.blockSize=16,u.keySize=32,u.prototype.blockSize=u.blockSize,u.prototype.keySize=u.keySize,u.prototype._reset=function(){for(var e=this._key,t=e.length,r=t+6,n=4*(r+1),i=[],o=0;o>>24,a=f.SBOX[a>>>24]<<24|f.SBOX[a>>>16&255]<<16|f.SBOX[a>>>8&255]<<8|f.SBOX[255&a],a^=s[o/t|0]<<24):t>6&&o%t==4&&(a=f.SBOX[a>>>24]<<24|f.SBOX[a>>>16&255]<<16|f.SBOX[a>>>8&255]<<8|f.SBOX[255&a]),i[o]=i[o-t]^a}for(var u=[],c=0;c>>24]]^f.INV_SUB_MIX[1][f.SBOX[l>>>16&255]]^f.INV_SUB_MIX[2][f.SBOX[l>>>8&255]]^f.INV_SUB_MIX[3][f.SBOX[255&l]]}this._nRounds=r,this._keySchedule=i,this._invKeySchedule=u},u.prototype.encryptBlockRaw=function(e){return a(e=i(e),this._keySchedule,f.SUB_MIX,f.SBOX,this._nRounds)},u.prototype.encryptBlock=function(e){var t=this.encryptBlockRaw(e),r=n.allocUnsafe(16);return r.writeUInt32BE(t[0],0),r.writeUInt32BE(t[1],4),r.writeUInt32BE(t[2],8),r.writeUInt32BE(t[3],12),r},u.prototype.decryptBlock=function(e){var t=(e=i(e))[1];e[1]=e[3],e[3]=t;var r=a(e,this._invKeySchedule,f.INV_SUB_MIX,f.INV_SBOX,this._nRounds),o=n.allocUnsafe(16);return o.writeUInt32BE(r[0],0),o.writeUInt32BE(r[3],4),o.writeUInt32BE(r[2],8),o.writeUInt32BE(r[1],12),o},u.prototype.scrub=function(){o(this._keySchedule),o(this._invKeySchedule),o(this._key)},e.exports.AES=u},(e,t,r)=>{"use strict";var n=r(24).q.ERR_STREAM_PREMATURE_CLOSE;function i(){}e.exports=function e(t,r,o){if("function"==typeof r)return e(t,null,r);r||(r={}),o=function(e){var t=!1;return function(){if(!t){t=!0;for(var r=arguments.length,n=new Array(r),i=0;i{var n=r(161),i=r(12);function o(e){var t,r=e.modulus.byteLength();do{t=new n(i(r))}while(t.cmp(e.modulus)>=0||!t.umod(e.prime1)||!t.umod(e.prime2));return t}function a(e,t){var r=function(e){var t=o(e);return{blinder:t.toRed(n.mont(e.modulus)).redPow(new n(e.publicExponent)).fromRed(),unblinder:t.invm(e.modulus)}}(t),i=t.modulus.byteLength(),a=new n(e).mul(r.blinder).umod(t.modulus),s=a.toRed(n.mont(t.prime1)),f=a.toRed(n.mont(t.prime2)),u=t.coefficient,c=t.prime1,h=t.prime2,l=s.redPow(t.exponent1).fromRed(),d=f.redPow(t.exponent2).fromRed(),p=l.isub(d).imul(u).umod(c).imul(h);return d.iadd(p).imul(r.unblinder).umod(t.modulus).toArrayLike(Buffer,"be",i)}a.getr=o,e.exports=a},(e,t,r)=>{"use strict";var n,i=r(3),o=i.Buffer,a={};for(n in i)i.hasOwnProperty(n)&&"SlowBuffer"!==n&&"Buffer"!==n&&(a[n]=i[n]);var s=a.Buffer={};for(n in o)o.hasOwnProperty(n)&&"allocUnsafe"!==n&&"allocUnsafeSlow"!==n&&(s[n]=o[n]);if(a.Buffer.prototype=o.prototype,s.from&&s.from!==Uint8Array.from||(s.from=function(e,t,r){if("number"==typeof e)throw new TypeError('The "value" argument must not be of type number. Received type '+typeof e);if(e&&void 0===e.length)throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof e);return o(e,t,r)}),s.alloc||(s.alloc=function(e,t,r){if("number"!=typeof e)throw new TypeError('The "size" argument must be of type number. Received type '+typeof e);if(e<0||e>=2*(1<<30))throw new RangeError('The value "'+e+'" is invalid for option "size"');var n=o(e);return t&&0!==t.length?"string"==typeof r?n.fill(t,r):n.fill(t):n.fill(0),n}),!a.kStringMaxLength)try{a.kStringMaxLength=process.binding("buffer").kStringMaxLength}catch(e){}a.constants||(a.constants={MAX_LENGTH:a.kMaxLength},a.kStringMaxLength&&(a.constants.MAX_STRING_LENGTH=a.kStringMaxLength)),e.exports=a},(e,t,r)=>{"use strict";const n=r(136).b,i=r(70).R,o=r(70).C,a=r(6),s=["seq","seqof","set","setof","objid","bool","gentime","utctime","null_","enum","int","objDesc","bitstr","bmpstr","charstr","genstr","graphstr","ia5str","iso646str","numstr","octstr","printstr","t61str","unistr","utf8str","videostr"],f=["key","obj","use","optional","explicit","implicit","def","choice","any","contains"].concat(s);function u(e,t,r){const n={};this._baseState=n,n.name=r,n.enc=e,n.parent=t||null,n.children=null,n.tag=null,n.args=null,n.reverseArgs=null,n.choice=null,n.optional=!1,n.any=!1,n.obj=!1,n.use=null,n.useDecoder=null,n.key=null,n.default=null,n.explicit=null,n.implicit=null,n.contains=null,n.parent||(n.children=[],this._wrap())}e.exports=u;const c=["enc","parent","children","tag","args","reverseArgs","choice","optional","any","obj","use","alteredUse","key","default","explicit","implicit","contains"];u.prototype.clone=function(){const e=this._baseState,t={};c.forEach((function(r){t[r]=e[r]}));const r=new this.constructor(t.parent);return r._baseState=t,r},u.prototype._wrap=function(){const e=this._baseState;f.forEach((function(t){this[t]=function(){const r=new this.constructor(this);return e.children.push(r),r[t].apply(r,arguments)}}),this)},u.prototype._init=function(e){const t=this._baseState;a(null===t.parent),e.call(this),t.children=t.children.filter((function(e){return e._baseState.parent===this}),this),a.equal(t.children.length,1,"Root node can have only one child")},u.prototype._useArgs=function(e){const t=this._baseState,r=e.filter((function(e){return e instanceof this.constructor}),this);e=e.filter((function(e){return!(e instanceof this.constructor)}),this),0!==r.length&&(a(null===t.children),t.children=r,r.forEach((function(e){e._baseState.parent=this}),this)),0!==e.length&&(a(null===t.args),t.args=e,t.reverseArgs=e.map((function(e){if("object"!=typeof e||e.constructor!==Object)return e;const t={};return Object.keys(e).forEach((function(r){r==(0|r)&&(r|=0);const n=e[r];t[n]=r})),t})))},["_peekTag","_decodeTag","_use","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeInt","_decodeBool","_decodeList","_encodeComposite","_encodeStr","_encodeObjid","_encodeTime","_encodeNull","_encodeInt","_encodeBool"].forEach((function(e){u.prototype[e]=function(){const t=this._baseState;throw new Error(e+" not implemented for encoding: "+t.enc)}})),s.forEach((function(e){u.prototype[e]=function(){const t=this._baseState,r=Array.prototype.slice.call(arguments);return a(null===t.tag),t.tag=e,this._useArgs(r),this}})),u.prototype.use=function(e){a(e);const t=this._baseState;return a(null===t.use),t.use=e,this},u.prototype.optional=function(){return this._baseState.optional=!0,this},u.prototype.def=function(e){const t=this._baseState;return a(null===t.default),t.default=e,t.optional=!0,this},u.prototype.explicit=function(e){const t=this._baseState;return a(null===t.explicit&&null===t.implicit),t.explicit=e,this},u.prototype.implicit=function(e){const t=this._baseState;return a(null===t.explicit&&null===t.implicit),t.implicit=e,this},u.prototype.obj=function(){const e=this._baseState,t=Array.prototype.slice.call(arguments);return e.obj=!0,0!==t.length&&this._useArgs(t),this},u.prototype.key=function(e){const t=this._baseState;return a(null===t.key),t.key=e,this},u.prototype.any=function(){return this._baseState.any=!0,this},u.prototype.choice=function(e){const t=this._baseState;return a(null===t.choice),t.choice=e,this._useArgs(Object.keys(e).map((function(t){return e[t]}))),this},u.prototype.contains=function(e){const t=this._baseState;return a(null===t.use),t.contains=e,this},u.prototype._decode=function(e,t){const r=this._baseState;if(null===r.parent)return e.wrapResult(r.children[0]._decode(e,t));let n,i=r.default,a=!0,s=null;if(null!==r.key&&(s=e.enterKey(r.key)),r.optional){let n=null;if(null!==r.explicit?n=r.explicit:null!==r.implicit?n=r.implicit:null!==r.tag&&(n=r.tag),null!==n||r.any){if(a=this._peekTag(e,n,r.any),e.isError(a))return a}else{const n=e.save();try{null===r.choice?this._decodeGeneric(r.tag,e,t):this._decodeChoice(e,t),a=!0}catch(e){a=!1}e.restore(n)}}if(r.obj&&a&&(n=e.enterObject()),a){if(null!==r.explicit){const t=this._decodeTag(e,r.explicit);if(e.isError(t))return t;e=t}const n=e.offset;if(null===r.use&&null===r.choice){let t;r.any&&(t=e.save());const n=this._decodeTag(e,null!==r.implicit?r.implicit:r.tag,r.any);if(e.isError(n))return n;r.any?i=e.raw(t):e=n}if(t&&t.track&&null!==r.tag&&t.track(e.path(),n,e.length,"tagged"),t&&t.track&&null!==r.tag&&t.track(e.path(),e.offset,e.length,"content"),r.any||(i=null===r.choice?this._decodeGeneric(r.tag,e,t):this._decodeChoice(e,t)),e.isError(i))return i;if(r.any||null!==r.choice||null===r.children||r.children.forEach((function(r){r._decode(e,t)})),r.contains&&("octstr"===r.tag||"bitstr"===r.tag)){const n=new o(i);i=this._getUse(r.contains,e._reporterState.obj)._decode(n,t)}}return r.obj&&a&&(i=e.leaveObject(n)),null===r.key||null===i&&!0!==a?null!==s&&e.exitKey(s):e.leaveKey(s,r.key,i),i},u.prototype._decodeGeneric=function(e,t,r){const n=this._baseState;return"seq"===e||"set"===e?null:"seqof"===e||"setof"===e?this._decodeList(t,e,n.args[0],r):/str$/.test(e)?this._decodeStr(t,e,r):"objid"===e&&n.args?this._decodeObjid(t,n.args[0],n.args[1],r):"objid"===e?this._decodeObjid(t,null,null,r):"gentime"===e||"utctime"===e?this._decodeTime(t,e,r):"null_"===e?this._decodeNull(t,r):"bool"===e?this._decodeBool(t,r):"objDesc"===e?this._decodeStr(t,e,r):"int"===e||"enum"===e?this._decodeInt(t,n.args&&n.args[0],r):null!==n.use?this._getUse(n.use,t._reporterState.obj)._decode(t,r):t.error("unknown tag: "+e)},u.prototype._getUse=function(e,t){const r=this._baseState;return r.useDecoder=this._use(e,t),a(null===r.useDecoder._baseState.parent),r.useDecoder=r.useDecoder._baseState.children[0],r.implicit!==r.useDecoder._baseState.implicit&&(r.useDecoder=r.useDecoder.clone(),r.useDecoder._baseState.implicit=r.implicit),r.useDecoder},u.prototype._decodeChoice=function(e,t){const r=this._baseState;let n=null,i=!1;return Object.keys(r.choice).some((function(o){const a=e.save(),s=r.choice[o];try{const r=s._decode(e,t);if(e.isError(r))return!1;n={type:o,value:r},i=!0}catch(t){return e.restore(a),!1}return!0}),this),i?n:e.error("Choice not matched")},u.prototype._createEncoderBuffer=function(e){return new i(e,this.reporter)},u.prototype._encode=function(e,t,r){const n=this._baseState;if(null!==n.default&&n.default===e)return;const i=this._encodeValue(e,t,r);return void 0===i||this._skipDefault(i,t,r)?void 0:i},u.prototype._encodeValue=function(e,t,r){const i=this._baseState;if(null===i.parent)return i.children[0]._encode(e,t||new n);let o=null;if(this.reporter=t,i.optional&&void 0===e){if(null===i.default)return;e=i.default}let a=null,s=!1;if(i.any)o=this._createEncoderBuffer(e);else if(i.choice)o=this._encodeChoice(e,t);else if(i.contains)a=this._getUse(i.contains,r)._encode(e,t),s=!0;else if(i.children)a=i.children.map((function(r){if("null_"===r._baseState.tag)return r._encode(null,t,e);if(null===r._baseState.key)return t.error("Child should have a key");const n=t.enterKey(r._baseState.key);if("object"!=typeof e)return t.error("Child expected, but input is not object");const i=r._encode(e[r._baseState.key],t,e);return t.leaveKey(n),i}),this).filter((function(e){return e})),a=this._createEncoderBuffer(a);else if("seqof"===i.tag||"setof"===i.tag){if(!i.args||1!==i.args.length)return t.error("Too many args for : "+i.tag);if(!Array.isArray(e))return t.error("seqof/setof, but data is not Array");const r=this.clone();r._baseState.implicit=null,a=this._createEncoderBuffer(e.map((function(r){const n=this._baseState;return this._getUse(n.args[0],e)._encode(r,t)}),r))}else null!==i.use?o=this._getUse(i.use,r)._encode(e,t):(a=this._encodePrimitive(i.tag,e),s=!0);if(!i.any&&null===i.choice){const e=null!==i.implicit?i.implicit:i.tag,r=null===i.implicit?"universal":"context";null===e?null===i.use&&t.error("Tag could be omitted only for .use()"):null===i.use&&(o=this._encodeComposite(e,s,r,a))}return null!==i.explicit&&(o=this._encodeComposite(i.explicit,!1,"context",o)),o},u.prototype._encodeChoice=function(e,t){const r=this._baseState,n=r.choice[e.type];return n||a(!1,e.type+" not found in "+JSON.stringify(Object.keys(r.choice))),n._encode(e.value,t)},u.prototype._encodePrimitive=function(e,t){const r=this._baseState;if(/str$/.test(e))return this._encodeStr(t,e);if("objid"===e&&r.args)return this._encodeObjid(t,r.reverseArgs[0],r.args[1]);if("objid"===e)return this._encodeObjid(t,null,null);if("gentime"===e||"utctime"===e)return this._encodeTime(t,e);if("null_"===e)return this._encodeNull();if("int"===e||"enum"===e)return this._encodeInt(t,r.args&&r.reverseArgs[0]);if("bool"===e)return this._encodeBool(t);if("objDesc"===e)return this._encodeStr(t,e);throw new Error("Unsupported tag: "+e)},u.prototype._isNumstr=function(e){return/^[0-9 ]*$/.test(e)},u.prototype._isPrintstr=function(e){return/^[A-Za-z0-9 '()+,-./:=?]*$/.test(e)}},(e,t,r)=>{"use strict";var n=r(25).q.ERR_STREAM_PREMATURE_CLOSE;function i(){}e.exports=function e(t,r,o){if("function"==typeof r)return e(t,null,r);r||(r={}),o=function(e){var t=!1;return function(){if(!t){t=!0;for(var r=arguments.length,n=new Array(r),i=0;i{"use strict";const n=r(0),i=r(136).b,o=r(67).Buffer;function a(e,t){i.call(this,t),o.isBuffer(e)?(this.base=e,this.offset=0,this.length=e.length):this.error("Input not Buffer")}function s(e,t){if(Array.isArray(e))this.length=0,this.value=e.map((function(e){return s.isEncoderBuffer(e)||(e=new s(e,t)),this.length+=e.length,e}),this);else if("number"==typeof e){if(!(0<=e&&e<=255))return t.error("non-byte EncoderBuffer value");this.value=e,this.length=1}else if("string"==typeof e)this.value=e,this.length=o.byteLength(e);else{if(!o.isBuffer(e))return t.error("Unsupported type: "+typeof e);this.value=e,this.length=e.length}}n(a,i),t.C=a,a.isDecoderBuffer=function(e){return e instanceof a||"object"==typeof e&&o.isBuffer(e.base)&&"DecoderBuffer"===e.constructor.name&&"number"==typeof e.offset&&"number"==typeof e.length&&"function"==typeof e.save&&"function"==typeof e.restore&&"function"==typeof e.isEmpty&&"function"==typeof e.readUInt8&&"function"==typeof e.skip&&"function"==typeof e.raw},a.prototype.save=function(){return{offset:this.offset,reporter:i.prototype.save.call(this)}},a.prototype.restore=function(e){const t=new a(this.base);return t.offset=e.offset,t.length=this.offset,this.offset=e.offset,i.prototype.restore.call(this,e.reporter),t},a.prototype.isEmpty=function(){return this.offset===this.length},a.prototype.readUInt8=function(e){return this.offset+1<=this.length?this.base.readUInt8(this.offset++,!0):this.error(e||"DecoderBuffer overrun")},a.prototype.skip=function(e,t){if(!(this.offset+e<=this.length))return this.error(t||"DecoderBuffer overrun");const r=new a(this.base);return r._reporterState=this._reporterState,r.offset=this.offset,r.length=this.offset+e,this.offset+=e,r},a.prototype.raw=function(e){return this.base.slice(e?e.offset:this.offset,this.length)},t.R=s,s.isEncoderBuffer=function(e){return e instanceof s||"object"==typeof e&&"EncoderBuffer"===e.constructor.name&&"number"==typeof e.length&&"function"==typeof e.join},s.prototype.join=function(e,t){return e||(e=o.alloc(this.length)),t||(t=0),0===this.length||(Array.isArray(this.value)?this.value.forEach((function(r){r.join(e,t),t+=r.length})):("number"==typeof this.value?e[t]=this.value:"string"==typeof this.value?e.write(this.value,t):o.isBuffer(this.value)&&this.value.copy(e,t),t+=this.length)),e}},function(e,t,r){var n,i,o,a,s,f,u,c;e.exports=(c=r(11),r(155),r(156),o=(i=(n=c).lib).Base,a=i.WordArray,f=(s=n.algo).MD5,u=s.EvpKDF=o.extend({cfg:o.extend({keySize:4,hasher:f,iterations:1}),init:function(e){this.cfg=this.cfg.extend(e)},compute:function(e,t){for(var r,n=this.cfg,i=n.hasher.create(),o=a.create(),s=o.words,f=n.keySize,u=n.iterations;s.length{(t=e.exports=r(143)).Stream=t,t.Readable=t,t.Writable=r(146),t.Duplex=r(31),t.Transform=r(147),t.PassThrough=r(283),t.finished=r(69),t.pipeline=r(284)},(e,t,r)=>{"use strict";function n(e){return n="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?"symbol":typeof e},n(e)}var i,o,a=r(216).codes,s=a.ERR_AMBIGUOUS_ARGUMENT,f=a.ERR_INVALID_ARG_TYPE,u=a.ERR_INVALID_ARG_VALUE,c=a.ERR_INVALID_RETURN_VALUE,h=a.ERR_MISSING_ARGS,l=r(226),d=r(26).inspect,p=r(26).types,b=p.isPromise,y=p.isRegExp,m=Object.assign?Object.assign:r(227).assign,g=Object.is?Object.is:r(114);function _(){var e=r(232);i=e.isDeepEqual,o=e.isDeepStrictEqual}new Map;var v=!1,w=e.exports=A,E={};function S(e){if(e.message instanceof Error)throw e.message;throw new l(e)}function M(e,t,r,n){if(!r){var i=!1;if(0===t)i=!0,n="No value argument passed to `assert.ok()`";else if(n instanceof Error)throw n;var o=new l({actual:r,expected:!0,message:n,operator:"==",stackStartFn:e});throw o.generatedMessage=i,o}}function A(){for(var e=arguments.length,t=new Array(e),r=0;r1?r-1:0),i=1;i1?r-1:0),i=1;i1?r-1:0),i=1;i1?r-1:0),i=1;i=48&&r<=57?r-48:r>=65&&r<=70?r-55:r>=97&&r<=102?r-87:void n(!1,"Invalid character in "+e)}function f(e,t,r){var n=s(e,r);return r-1>=t&&(n|=s(e,r-1)<<4),n}function u(e,t,r,i){for(var o=0,a=0,s=Math.min(e.length,r),f=t;f=49?u-49+10:u>=17?u-17+10:u,n(u>=0&&a0?e:t},o.min=function(e,t){return e.cmp(t)<0?e:t},o.prototype._init=function(e,t,r){if("number"==typeof e)return this._initNumber(e,t,r);if("object"==typeof e)return this._initArray(e,t,r);"hex"===t&&(t=16),n(t===(0|t)&&t>=2&&t<=36);var i=0;"-"===(e=e.toString().replace(/\s+/g,""))[0]&&(i++,this.negative=1),i=0;i-=3)a=e[i]|e[i-1]<<8|e[i-2]<<16,this.words[o]|=a<>>26-s&67108863,(s+=24)>=26&&(s-=26,o++);else if("le"===r)for(i=0,o=0;i>>26-s&67108863,(s+=24)>=26&&(s-=26,o++);return this._strip()},o.prototype._parseHex=function(e,t,r){this.length=Math.ceil((e.length-t)/6),this.words=new Array(this.length);for(var n=0;n=t;n-=2)i=f(e,t,n)<=18?(o-=18,a+=1,this.words[a]|=i>>>26):o+=8;else for(n=(e.length-t)%2==0?t+1:t;n=18?(o-=18,a+=1,this.words[a]|=i>>>26):o+=8;this._strip()},o.prototype._parseBase=function(e,t,r){this.words=[0],this.length=1;for(var n=0,i=1;i<=67108863;i*=t)n++;n--,i=i/t|0;for(var o=e.length-r,a=o%n,s=Math.min(o,o-a)+r,f=0,c=r;c1&&0===this.words[this.length-1];)this.length--;return this._normSign()},o.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},"undefined"!=typeof Symbol&&"function"==typeof Symbol.for)try{o.prototype[Symbol.for("nodejs.util.inspect.custom")]=h}catch(e){o.prototype.inspect=h}else o.prototype.inspect=h;function h(){return(this.red?""}var l=["","0","00","000","0000","00000","000000","0000000","00000000","000000000","0000000000","00000000000","000000000000","0000000000000","00000000000000","000000000000000","0000000000000000","00000000000000000","000000000000000000","0000000000000000000","00000000000000000000","000000000000000000000","0000000000000000000000","00000000000000000000000","000000000000000000000000","0000000000000000000000000"],d=[0,0,25,16,12,11,10,9,8,8,7,7,7,7,6,6,6,6,6,6,6,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5],p=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function b(e,t,r){r.negative=t.negative^e.negative;var n=e.length+t.length|0;r.length=n,n=n-1|0;var i=0|e.words[0],o=0|t.words[0],a=i*o,s=67108863&a,f=a/67108864|0;r.words[0]=s;for(var u=1;u>>26,h=67108863&f,l=Math.min(u,t.length-1),d=Math.max(0,u-e.length+1);d<=l;d++){var p=u-d|0;c+=(a=(i=0|e.words[p])*(o=0|t.words[d])+h)/67108864|0,h=67108863&a}r.words[u]=0|h,f=0|c}return 0!==f?r.words[u]=0|f:r.length--,r._strip()}o.prototype.toString=function(e,t){var r;if(t=0|t||1,16===(e=e||10)||"hex"===e){r="";for(var i=0,o=0,a=0;a>>24-i&16777215,(i+=2)>=26&&(i-=26,a--),r=0!==o||a!==this.length-1?l[6-f.length]+f+r:f+r}for(0!==o&&(r=o.toString(16)+r);r.length%t!=0;)r="0"+r;return 0!==this.negative&&(r="-"+r),r}if(e===(0|e)&&e>=2&&e<=36){var u=d[e],c=p[e];r="";var h=this.clone();for(h.negative=0;!h.isZero();){var b=h.modrn(c).toString(e);r=(h=h.idivn(c)).isZero()?b+r:l[u-b.length]+b+r}for(this.isZero()&&(r="0"+r);r.length%t!=0;)r="0"+r;return 0!==this.negative&&(r="-"+r),r}n(!1,"Base should be between 2 and 36")},o.prototype.toNumber=function(){var e=this.words[0];return 2===this.length?e+=67108864*this.words[1]:3===this.length&&1===this.words[2]?e+=4503599627370496+67108864*this.words[1]:this.length>2&&n(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-e:e},o.prototype.toJSON=function(){return this.toString(16,2)},a&&(o.prototype.toBuffer=function(e,t){return this.toArrayLike(a,e,t)}),o.prototype.toArray=function(e,t){return this.toArrayLike(Array,e,t)},o.prototype.toArrayLike=function(e,t,r){this._strip();var i=this.byteLength(),o=r||Math.max(1,i);n(i<=o,"byte array longer than desired length"),n(o>0,"Requested array length <= 0");var a=function(e,t){return e.allocUnsafe?e.allocUnsafe(t):new e(t)}(e,o);return this["_toArrayLike"+("le"===t?"LE":"BE")](a,i),a},o.prototype._toArrayLikeLE=function(e,t){for(var r=0,n=0,i=0,o=0;i>8&255),r>16&255),6===o?(r>24&255),n=0,o=0):(n=a>>>24,o+=2)}if(r=0&&(e[r--]=a>>8&255),r>=0&&(e[r--]=a>>16&255),6===o?(r>=0&&(e[r--]=a>>24&255),n=0,o=0):(n=a>>>24,o+=2)}if(r>=0)for(e[r--]=n;r>=0;)e[r--]=0},Math.clz32?o.prototype._countBits=function(e){return 32-Math.clz32(e)}:o.prototype._countBits=function(e){var t=e,r=0;return t>=4096&&(r+=13,t>>>=13),t>=64&&(r+=7,t>>>=7),t>=8&&(r+=4,t>>>=4),t>=2&&(r+=2,t>>>=2),r+t},o.prototype._zeroBits=function(e){if(0===e)return 26;var t=e,r=0;return 0==(8191&t)&&(r+=13,t>>>=13),0==(127&t)&&(r+=7,t>>>=7),0==(15&t)&&(r+=4,t>>>=4),0==(3&t)&&(r+=2,t>>>=2),0==(1&t)&&r++,r},o.prototype.bitLength=function(){var e=this.words[this.length-1],t=this._countBits(e);return 26*(this.length-1)+t},o.prototype.zeroBits=function(){if(this.isZero())return 0;for(var e=0,t=0;te.length?this.clone().ior(e):e.clone().ior(this)},o.prototype.uor=function(e){return this.length>e.length?this.clone().iuor(e):e.clone().iuor(this)},o.prototype.iuand=function(e){var t;t=this.length>e.length?e:this;for(var r=0;re.length?this.clone().iand(e):e.clone().iand(this)},o.prototype.uand=function(e){return this.length>e.length?this.clone().iuand(e):e.clone().iuand(this)},o.prototype.iuxor=function(e){var t,r;this.length>e.length?(t=this,r=e):(t=e,r=this);for(var n=0;ne.length?this.clone().ixor(e):e.clone().ixor(this)},o.prototype.uxor=function(e){return this.length>e.length?this.clone().iuxor(e):e.clone().iuxor(this)},o.prototype.inotn=function(e){n("number"==typeof e&&e>=0);var t=0|Math.ceil(e/26),r=e%26;this._expand(t),r>0&&t--;for(var i=0;i0&&(this.words[i]=~this.words[i]&67108863>>26-r),this._strip()},o.prototype.notn=function(e){return this.clone().inotn(e)},o.prototype.setn=function(e,t){n("number"==typeof e&&e>=0);var r=e/26|0,i=e%26;return this._expand(r+1),this.words[r]=t?this.words[r]|1<e.length?(r=this,n=e):(r=e,n=this);for(var i=0,o=0;o>>26;for(;0!==i&&o>>26;if(this.length=r.length,0!==i)this.words[this.length]=i,this.length++;else if(r!==this)for(;oe.length?this.clone().iadd(e):e.clone().iadd(this)},o.prototype.isub=function(e){if(0!==e.negative){e.negative=0;var t=this.iadd(e);return e.negative=1,t._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(e),this.negative=1,this._normSign();var r,n,i=this.cmp(e);if(0===i)return this.negative=0,this.length=1,this.words[0]=0,this;i>0?(r=this,n=e):(r=e,n=this);for(var o=0,a=0;a>26,this.words[a]=67108863&t;for(;0!==o&&a>26,this.words[a]=67108863&t;if(0===o&&a>>13,d=0|a[1],p=8191&d,b=d>>>13,y=0|a[2],m=8191&y,g=y>>>13,_=0|a[3],v=8191&_,w=_>>>13,E=0|a[4],S=8191&E,M=E>>>13,A=0|a[5],k=8191&A,R=A>>>13,O=0|a[6],T=8191&O,I=O>>>13,x=0|a[7],B=8191&x,j=x>>>13,L=0|a[8],P=8191&L,N=L>>>13,D=0|a[9],C=8191&D,U=D>>>13,q=0|s[0],F=8191&q,G=q>>>13,z=0|s[1],$=8191&z,W=z>>>13,H=0|s[2],K=8191&H,V=H>>>13,Y=0|s[3],X=8191&Y,J=Y>>>13,Z=0|s[4],Q=8191&Z,ee=Z>>>13,te=0|s[5],re=8191&te,ne=te>>>13,ie=0|s[6],oe=8191&ie,ae=ie>>>13,se=0|s[7],fe=8191&se,ue=se>>>13,ce=0|s[8],he=8191&ce,le=ce>>>13,de=0|s[9],pe=8191&de,be=de>>>13;r.negative=e.negative^t.negative,r.length=19;var ye=(u+(n=Math.imul(h,F))|0)+((8191&(i=(i=Math.imul(h,G))+Math.imul(l,F)|0))<<13)|0;u=((o=Math.imul(l,G))+(i>>>13)|0)+(ye>>>26)|0,ye&=67108863,n=Math.imul(p,F),i=(i=Math.imul(p,G))+Math.imul(b,F)|0,o=Math.imul(b,G);var me=(u+(n=n+Math.imul(h,$)|0)|0)+((8191&(i=(i=i+Math.imul(h,W)|0)+Math.imul(l,$)|0))<<13)|0;u=((o=o+Math.imul(l,W)|0)+(i>>>13)|0)+(me>>>26)|0,me&=67108863,n=Math.imul(m,F),i=(i=Math.imul(m,G))+Math.imul(g,F)|0,o=Math.imul(g,G),n=n+Math.imul(p,$)|0,i=(i=i+Math.imul(p,W)|0)+Math.imul(b,$)|0,o=o+Math.imul(b,W)|0;var ge=(u+(n=n+Math.imul(h,K)|0)|0)+((8191&(i=(i=i+Math.imul(h,V)|0)+Math.imul(l,K)|0))<<13)|0;u=((o=o+Math.imul(l,V)|0)+(i>>>13)|0)+(ge>>>26)|0,ge&=67108863,n=Math.imul(v,F),i=(i=Math.imul(v,G))+Math.imul(w,F)|0,o=Math.imul(w,G),n=n+Math.imul(m,$)|0,i=(i=i+Math.imul(m,W)|0)+Math.imul(g,$)|0,o=o+Math.imul(g,W)|0,n=n+Math.imul(p,K)|0,i=(i=i+Math.imul(p,V)|0)+Math.imul(b,K)|0,o=o+Math.imul(b,V)|0;var _e=(u+(n=n+Math.imul(h,X)|0)|0)+((8191&(i=(i=i+Math.imul(h,J)|0)+Math.imul(l,X)|0))<<13)|0;u=((o=o+Math.imul(l,J)|0)+(i>>>13)|0)+(_e>>>26)|0,_e&=67108863,n=Math.imul(S,F),i=(i=Math.imul(S,G))+Math.imul(M,F)|0,o=Math.imul(M,G),n=n+Math.imul(v,$)|0,i=(i=i+Math.imul(v,W)|0)+Math.imul(w,$)|0,o=o+Math.imul(w,W)|0,n=n+Math.imul(m,K)|0,i=(i=i+Math.imul(m,V)|0)+Math.imul(g,K)|0,o=o+Math.imul(g,V)|0,n=n+Math.imul(p,X)|0,i=(i=i+Math.imul(p,J)|0)+Math.imul(b,X)|0,o=o+Math.imul(b,J)|0;var ve=(u+(n=n+Math.imul(h,Q)|0)|0)+((8191&(i=(i=i+Math.imul(h,ee)|0)+Math.imul(l,Q)|0))<<13)|0;u=((o=o+Math.imul(l,ee)|0)+(i>>>13)|0)+(ve>>>26)|0,ve&=67108863,n=Math.imul(k,F),i=(i=Math.imul(k,G))+Math.imul(R,F)|0,o=Math.imul(R,G),n=n+Math.imul(S,$)|0,i=(i=i+Math.imul(S,W)|0)+Math.imul(M,$)|0,o=o+Math.imul(M,W)|0,n=n+Math.imul(v,K)|0,i=(i=i+Math.imul(v,V)|0)+Math.imul(w,K)|0,o=o+Math.imul(w,V)|0,n=n+Math.imul(m,X)|0,i=(i=i+Math.imul(m,J)|0)+Math.imul(g,X)|0,o=o+Math.imul(g,J)|0,n=n+Math.imul(p,Q)|0,i=(i=i+Math.imul(p,ee)|0)+Math.imul(b,Q)|0,o=o+Math.imul(b,ee)|0;var we=(u+(n=n+Math.imul(h,re)|0)|0)+((8191&(i=(i=i+Math.imul(h,ne)|0)+Math.imul(l,re)|0))<<13)|0;u=((o=o+Math.imul(l,ne)|0)+(i>>>13)|0)+(we>>>26)|0,we&=67108863,n=Math.imul(T,F),i=(i=Math.imul(T,G))+Math.imul(I,F)|0,o=Math.imul(I,G),n=n+Math.imul(k,$)|0,i=(i=i+Math.imul(k,W)|0)+Math.imul(R,$)|0,o=o+Math.imul(R,W)|0,n=n+Math.imul(S,K)|0,i=(i=i+Math.imul(S,V)|0)+Math.imul(M,K)|0,o=o+Math.imul(M,V)|0,n=n+Math.imul(v,X)|0,i=(i=i+Math.imul(v,J)|0)+Math.imul(w,X)|0,o=o+Math.imul(w,J)|0,n=n+Math.imul(m,Q)|0,i=(i=i+Math.imul(m,ee)|0)+Math.imul(g,Q)|0,o=o+Math.imul(g,ee)|0,n=n+Math.imul(p,re)|0,i=(i=i+Math.imul(p,ne)|0)+Math.imul(b,re)|0,o=o+Math.imul(b,ne)|0;var Ee=(u+(n=n+Math.imul(h,oe)|0)|0)+((8191&(i=(i=i+Math.imul(h,ae)|0)+Math.imul(l,oe)|0))<<13)|0;u=((o=o+Math.imul(l,ae)|0)+(i>>>13)|0)+(Ee>>>26)|0,Ee&=67108863,n=Math.imul(B,F),i=(i=Math.imul(B,G))+Math.imul(j,F)|0,o=Math.imul(j,G),n=n+Math.imul(T,$)|0,i=(i=i+Math.imul(T,W)|0)+Math.imul(I,$)|0,o=o+Math.imul(I,W)|0,n=n+Math.imul(k,K)|0,i=(i=i+Math.imul(k,V)|0)+Math.imul(R,K)|0,o=o+Math.imul(R,V)|0,n=n+Math.imul(S,X)|0,i=(i=i+Math.imul(S,J)|0)+Math.imul(M,X)|0,o=o+Math.imul(M,J)|0,n=n+Math.imul(v,Q)|0,i=(i=i+Math.imul(v,ee)|0)+Math.imul(w,Q)|0,o=o+Math.imul(w,ee)|0,n=n+Math.imul(m,re)|0,i=(i=i+Math.imul(m,ne)|0)+Math.imul(g,re)|0,o=o+Math.imul(g,ne)|0,n=n+Math.imul(p,oe)|0,i=(i=i+Math.imul(p,ae)|0)+Math.imul(b,oe)|0,o=o+Math.imul(b,ae)|0;var Se=(u+(n=n+Math.imul(h,fe)|0)|0)+((8191&(i=(i=i+Math.imul(h,ue)|0)+Math.imul(l,fe)|0))<<13)|0;u=((o=o+Math.imul(l,ue)|0)+(i>>>13)|0)+(Se>>>26)|0,Se&=67108863,n=Math.imul(P,F),i=(i=Math.imul(P,G))+Math.imul(N,F)|0,o=Math.imul(N,G),n=n+Math.imul(B,$)|0,i=(i=i+Math.imul(B,W)|0)+Math.imul(j,$)|0,o=o+Math.imul(j,W)|0,n=n+Math.imul(T,K)|0,i=(i=i+Math.imul(T,V)|0)+Math.imul(I,K)|0,o=o+Math.imul(I,V)|0,n=n+Math.imul(k,X)|0,i=(i=i+Math.imul(k,J)|0)+Math.imul(R,X)|0,o=o+Math.imul(R,J)|0,n=n+Math.imul(S,Q)|0,i=(i=i+Math.imul(S,ee)|0)+Math.imul(M,Q)|0,o=o+Math.imul(M,ee)|0,n=n+Math.imul(v,re)|0,i=(i=i+Math.imul(v,ne)|0)+Math.imul(w,re)|0,o=o+Math.imul(w,ne)|0,n=n+Math.imul(m,oe)|0,i=(i=i+Math.imul(m,ae)|0)+Math.imul(g,oe)|0,o=o+Math.imul(g,ae)|0,n=n+Math.imul(p,fe)|0,i=(i=i+Math.imul(p,ue)|0)+Math.imul(b,fe)|0,o=o+Math.imul(b,ue)|0;var Me=(u+(n=n+Math.imul(h,he)|0)|0)+((8191&(i=(i=i+Math.imul(h,le)|0)+Math.imul(l,he)|0))<<13)|0;u=((o=o+Math.imul(l,le)|0)+(i>>>13)|0)+(Me>>>26)|0,Me&=67108863,n=Math.imul(C,F),i=(i=Math.imul(C,G))+Math.imul(U,F)|0,o=Math.imul(U,G),n=n+Math.imul(P,$)|0,i=(i=i+Math.imul(P,W)|0)+Math.imul(N,$)|0,o=o+Math.imul(N,W)|0,n=n+Math.imul(B,K)|0,i=(i=i+Math.imul(B,V)|0)+Math.imul(j,K)|0,o=o+Math.imul(j,V)|0,n=n+Math.imul(T,X)|0,i=(i=i+Math.imul(T,J)|0)+Math.imul(I,X)|0,o=o+Math.imul(I,J)|0,n=n+Math.imul(k,Q)|0,i=(i=i+Math.imul(k,ee)|0)+Math.imul(R,Q)|0,o=o+Math.imul(R,ee)|0,n=n+Math.imul(S,re)|0,i=(i=i+Math.imul(S,ne)|0)+Math.imul(M,re)|0,o=o+Math.imul(M,ne)|0,n=n+Math.imul(v,oe)|0,i=(i=i+Math.imul(v,ae)|0)+Math.imul(w,oe)|0,o=o+Math.imul(w,ae)|0,n=n+Math.imul(m,fe)|0,i=(i=i+Math.imul(m,ue)|0)+Math.imul(g,fe)|0,o=o+Math.imul(g,ue)|0,n=n+Math.imul(p,he)|0,i=(i=i+Math.imul(p,le)|0)+Math.imul(b,he)|0,o=o+Math.imul(b,le)|0;var Ae=(u+(n=n+Math.imul(h,pe)|0)|0)+((8191&(i=(i=i+Math.imul(h,be)|0)+Math.imul(l,pe)|0))<<13)|0;u=((o=o+Math.imul(l,be)|0)+(i>>>13)|0)+(Ae>>>26)|0,Ae&=67108863,n=Math.imul(C,$),i=(i=Math.imul(C,W))+Math.imul(U,$)|0,o=Math.imul(U,W),n=n+Math.imul(P,K)|0,i=(i=i+Math.imul(P,V)|0)+Math.imul(N,K)|0,o=o+Math.imul(N,V)|0,n=n+Math.imul(B,X)|0,i=(i=i+Math.imul(B,J)|0)+Math.imul(j,X)|0,o=o+Math.imul(j,J)|0,n=n+Math.imul(T,Q)|0,i=(i=i+Math.imul(T,ee)|0)+Math.imul(I,Q)|0,o=o+Math.imul(I,ee)|0,n=n+Math.imul(k,re)|0,i=(i=i+Math.imul(k,ne)|0)+Math.imul(R,re)|0,o=o+Math.imul(R,ne)|0,n=n+Math.imul(S,oe)|0,i=(i=i+Math.imul(S,ae)|0)+Math.imul(M,oe)|0,o=o+Math.imul(M,ae)|0,n=n+Math.imul(v,fe)|0,i=(i=i+Math.imul(v,ue)|0)+Math.imul(w,fe)|0,o=o+Math.imul(w,ue)|0,n=n+Math.imul(m,he)|0,i=(i=i+Math.imul(m,le)|0)+Math.imul(g,he)|0,o=o+Math.imul(g,le)|0;var ke=(u+(n=n+Math.imul(p,pe)|0)|0)+((8191&(i=(i=i+Math.imul(p,be)|0)+Math.imul(b,pe)|0))<<13)|0;u=((o=o+Math.imul(b,be)|0)+(i>>>13)|0)+(ke>>>26)|0,ke&=67108863,n=Math.imul(C,K),i=(i=Math.imul(C,V))+Math.imul(U,K)|0,o=Math.imul(U,V),n=n+Math.imul(P,X)|0,i=(i=i+Math.imul(P,J)|0)+Math.imul(N,X)|0,o=o+Math.imul(N,J)|0,n=n+Math.imul(B,Q)|0,i=(i=i+Math.imul(B,ee)|0)+Math.imul(j,Q)|0,o=o+Math.imul(j,ee)|0,n=n+Math.imul(T,re)|0,i=(i=i+Math.imul(T,ne)|0)+Math.imul(I,re)|0,o=o+Math.imul(I,ne)|0,n=n+Math.imul(k,oe)|0,i=(i=i+Math.imul(k,ae)|0)+Math.imul(R,oe)|0,o=o+Math.imul(R,ae)|0,n=n+Math.imul(S,fe)|0,i=(i=i+Math.imul(S,ue)|0)+Math.imul(M,fe)|0,o=o+Math.imul(M,ue)|0,n=n+Math.imul(v,he)|0,i=(i=i+Math.imul(v,le)|0)+Math.imul(w,he)|0,o=o+Math.imul(w,le)|0;var Re=(u+(n=n+Math.imul(m,pe)|0)|0)+((8191&(i=(i=i+Math.imul(m,be)|0)+Math.imul(g,pe)|0))<<13)|0;u=((o=o+Math.imul(g,be)|0)+(i>>>13)|0)+(Re>>>26)|0,Re&=67108863,n=Math.imul(C,X),i=(i=Math.imul(C,J))+Math.imul(U,X)|0,o=Math.imul(U,J),n=n+Math.imul(P,Q)|0,i=(i=i+Math.imul(P,ee)|0)+Math.imul(N,Q)|0,o=o+Math.imul(N,ee)|0,n=n+Math.imul(B,re)|0,i=(i=i+Math.imul(B,ne)|0)+Math.imul(j,re)|0,o=o+Math.imul(j,ne)|0,n=n+Math.imul(T,oe)|0,i=(i=i+Math.imul(T,ae)|0)+Math.imul(I,oe)|0,o=o+Math.imul(I,ae)|0,n=n+Math.imul(k,fe)|0,i=(i=i+Math.imul(k,ue)|0)+Math.imul(R,fe)|0,o=o+Math.imul(R,ue)|0,n=n+Math.imul(S,he)|0,i=(i=i+Math.imul(S,le)|0)+Math.imul(M,he)|0,o=o+Math.imul(M,le)|0;var Oe=(u+(n=n+Math.imul(v,pe)|0)|0)+((8191&(i=(i=i+Math.imul(v,be)|0)+Math.imul(w,pe)|0))<<13)|0;u=((o=o+Math.imul(w,be)|0)+(i>>>13)|0)+(Oe>>>26)|0,Oe&=67108863,n=Math.imul(C,Q),i=(i=Math.imul(C,ee))+Math.imul(U,Q)|0,o=Math.imul(U,ee),n=n+Math.imul(P,re)|0,i=(i=i+Math.imul(P,ne)|0)+Math.imul(N,re)|0,o=o+Math.imul(N,ne)|0,n=n+Math.imul(B,oe)|0,i=(i=i+Math.imul(B,ae)|0)+Math.imul(j,oe)|0,o=o+Math.imul(j,ae)|0,n=n+Math.imul(T,fe)|0,i=(i=i+Math.imul(T,ue)|0)+Math.imul(I,fe)|0,o=o+Math.imul(I,ue)|0,n=n+Math.imul(k,he)|0,i=(i=i+Math.imul(k,le)|0)+Math.imul(R,he)|0,o=o+Math.imul(R,le)|0;var Te=(u+(n=n+Math.imul(S,pe)|0)|0)+((8191&(i=(i=i+Math.imul(S,be)|0)+Math.imul(M,pe)|0))<<13)|0;u=((o=o+Math.imul(M,be)|0)+(i>>>13)|0)+(Te>>>26)|0,Te&=67108863,n=Math.imul(C,re),i=(i=Math.imul(C,ne))+Math.imul(U,re)|0,o=Math.imul(U,ne),n=n+Math.imul(P,oe)|0,i=(i=i+Math.imul(P,ae)|0)+Math.imul(N,oe)|0,o=o+Math.imul(N,ae)|0,n=n+Math.imul(B,fe)|0,i=(i=i+Math.imul(B,ue)|0)+Math.imul(j,fe)|0,o=o+Math.imul(j,ue)|0,n=n+Math.imul(T,he)|0,i=(i=i+Math.imul(T,le)|0)+Math.imul(I,he)|0,o=o+Math.imul(I,le)|0;var Ie=(u+(n=n+Math.imul(k,pe)|0)|0)+((8191&(i=(i=i+Math.imul(k,be)|0)+Math.imul(R,pe)|0))<<13)|0;u=((o=o+Math.imul(R,be)|0)+(i>>>13)|0)+(Ie>>>26)|0,Ie&=67108863,n=Math.imul(C,oe),i=(i=Math.imul(C,ae))+Math.imul(U,oe)|0,o=Math.imul(U,ae),n=n+Math.imul(P,fe)|0,i=(i=i+Math.imul(P,ue)|0)+Math.imul(N,fe)|0,o=o+Math.imul(N,ue)|0,n=n+Math.imul(B,he)|0,i=(i=i+Math.imul(B,le)|0)+Math.imul(j,he)|0,o=o+Math.imul(j,le)|0;var xe=(u+(n=n+Math.imul(T,pe)|0)|0)+((8191&(i=(i=i+Math.imul(T,be)|0)+Math.imul(I,pe)|0))<<13)|0;u=((o=o+Math.imul(I,be)|0)+(i>>>13)|0)+(xe>>>26)|0,xe&=67108863,n=Math.imul(C,fe),i=(i=Math.imul(C,ue))+Math.imul(U,fe)|0,o=Math.imul(U,ue),n=n+Math.imul(P,he)|0,i=(i=i+Math.imul(P,le)|0)+Math.imul(N,he)|0,o=o+Math.imul(N,le)|0;var Be=(u+(n=n+Math.imul(B,pe)|0)|0)+((8191&(i=(i=i+Math.imul(B,be)|0)+Math.imul(j,pe)|0))<<13)|0;u=((o=o+Math.imul(j,be)|0)+(i>>>13)|0)+(Be>>>26)|0,Be&=67108863,n=Math.imul(C,he),i=(i=Math.imul(C,le))+Math.imul(U,he)|0,o=Math.imul(U,le);var je=(u+(n=n+Math.imul(P,pe)|0)|0)+((8191&(i=(i=i+Math.imul(P,be)|0)+Math.imul(N,pe)|0))<<13)|0;u=((o=o+Math.imul(N,be)|0)+(i>>>13)|0)+(je>>>26)|0,je&=67108863;var Le=(u+(n=Math.imul(C,pe))|0)+((8191&(i=(i=Math.imul(C,be))+Math.imul(U,pe)|0))<<13)|0;return u=((o=Math.imul(U,be))+(i>>>13)|0)+(Le>>>26)|0,Le&=67108863,f[0]=ye,f[1]=me,f[2]=ge,f[3]=_e,f[4]=ve,f[5]=we,f[6]=Ee,f[7]=Se,f[8]=Me,f[9]=Ae,f[10]=ke,f[11]=Re,f[12]=Oe,f[13]=Te,f[14]=Ie,f[15]=xe,f[16]=Be,f[17]=je,f[18]=Le,0!==u&&(f[19]=u,r.length++),r};function m(e,t,r){r.negative=t.negative^e.negative,r.length=e.length+t.length;for(var n=0,i=0,o=0;o>>26)|0)>>>26,a&=67108863}r.words[o]=s,n=a,a=i}return 0!==n?r.words[o]=n:r.length--,r._strip()}function g(e,t,r){return m(e,t,r)}function _(e,t){this.x=e,this.y=t}Math.imul||(y=b),o.prototype.mulTo=function(e,t){var r=this.length+e.length;return 10===this.length&&10===e.length?y(this,e,t):r<63?b(this,e,t):r<1024?m(this,e,t):g(this,e,t)},_.prototype.makeRBT=function(e){for(var t=new Array(e),r=o.prototype._countBits(e)-1,n=0;n>=1;return n},_.prototype.permute=function(e,t,r,n,i,o){for(var a=0;a>>=1)i++;return 1<>>=13,r[2*a+1]=8191&o,o>>>=13;for(a=2*t;a>=26,r+=o/67108864|0,r+=a>>>26,this.words[i]=67108863&a}return 0!==r&&(this.words[i]=r,this.length++),t?this.ineg():this},o.prototype.muln=function(e){return this.clone().imuln(e)},o.prototype.sqr=function(){return this.mul(this)},o.prototype.isqr=function(){return this.imul(this.clone())},o.prototype.pow=function(e){var t=function(e){for(var t=new Array(e.bitLength()),r=0;r>>i&1}return t}(e);if(0===t.length)return new o(1);for(var r=this,n=0;n=0);var t,r=e%26,i=(e-r)/26,o=67108863>>>26-r<<26-r;if(0!==r){var a=0;for(t=0;t>>26-r}a&&(this.words[t]=a,this.length++)}if(0!==i){for(t=this.length-1;t>=0;t--)this.words[t+i]=this.words[t];for(t=0;t=0),i=t?(t-t%26)/26:0;var o=e%26,a=Math.min((e-o)/26,this.length),s=67108863^67108863>>>o<a)for(this.length-=a,u=0;u=0&&(0!==c||u>=i);u--){var h=0|this.words[u];this.words[u]=c<<26-o|h>>>o,c=h&s}return f&&0!==c&&(f.words[f.length++]=c),0===this.length&&(this.words[0]=0,this.length=1),this._strip()},o.prototype.ishrn=function(e,t,r){return n(0===this.negative),this.iushrn(e,t,r)},o.prototype.shln=function(e){return this.clone().ishln(e)},o.prototype.ushln=function(e){return this.clone().iushln(e)},o.prototype.shrn=function(e){return this.clone().ishrn(e)},o.prototype.ushrn=function(e){return this.clone().iushrn(e)},o.prototype.testn=function(e){n("number"==typeof e&&e>=0);var t=e%26,r=(e-t)/26,i=1<=0);var t=e%26,r=(e-t)/26;if(n(0===this.negative,"imaskn works only with positive numbers"),this.length<=r)return this;if(0!==t&&r++,this.length=Math.min(r,this.length),0!==t){var i=67108863^67108863>>>t<=67108864;t++)this.words[t]-=67108864,t===this.length-1?this.words[t+1]=1:this.words[t+1]++;return this.length=Math.max(this.length,t+1),this},o.prototype.isubn=function(e){if(n("number"==typeof e),n(e<67108864),e<0)return this.iaddn(-e);if(0!==this.negative)return this.negative=0,this.iaddn(e),this.negative=1,this;if(this.words[0]-=e,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var t=0;t>26)-(f/67108864|0),this.words[i+r]=67108863&o}for(;i>26,this.words[i+r]=67108863&o;if(0===s)return this._strip();for(n(-1===s),s=0,i=0;i>26,this.words[i]=67108863&o;return this.negative=1,this._strip()},o.prototype._wordDiv=function(e,t){var r=(this.length,e.length),n=this.clone(),i=e,a=0|i.words[i.length-1];0!=(r=26-this._countBits(a))&&(i=i.ushln(r),n.iushln(r),a=0|i.words[i.length-1]);var s,f=n.length-i.length;if("mod"!==t){(s=new o(null)).length=f+1,s.words=new Array(s.length);for(var u=0;u=0;h--){var l=67108864*(0|n.words[i.length+h])+(0|n.words[i.length+h-1]);for(l=Math.min(l/a|0,67108863),n._ishlnsubmul(i,l,h);0!==n.negative;)l--,n.negative=0,n._ishlnsubmul(i,1,h),n.isZero()||(n.negative^=1);s&&(s.words[h]=l)}return s&&s._strip(),n._strip(),"div"!==t&&0!==r&&n.iushrn(r),{div:s||null,mod:n}},o.prototype.divmod=function(e,t,r){return n(!e.isZero()),this.isZero()?{div:new o(0),mod:new o(0)}:0!==this.negative&&0===e.negative?(s=this.neg().divmod(e,t),"mod"!==t&&(i=s.div.neg()),"div"!==t&&(a=s.mod.neg(),r&&0!==a.negative&&a.iadd(e)),{div:i,mod:a}):0===this.negative&&0!==e.negative?(s=this.divmod(e.neg(),t),"mod"!==t&&(i=s.div.neg()),{div:i,mod:s.mod}):0!=(this.negative&e.negative)?(s=this.neg().divmod(e.neg(),t),"div"!==t&&(a=s.mod.neg(),r&&0!==a.negative&&a.isub(e)),{div:s.div,mod:a}):e.length>this.length||this.cmp(e)<0?{div:new o(0),mod:this}:1===e.length?"div"===t?{div:this.divn(e.words[0]),mod:null}:"mod"===t?{div:null,mod:new o(this.modrn(e.words[0]))}:{div:this.divn(e.words[0]),mod:new o(this.modrn(e.words[0]))}:this._wordDiv(e,t);var i,a,s},o.prototype.div=function(e){return this.divmod(e,"div",!1).div},o.prototype.mod=function(e){return this.divmod(e,"mod",!1).mod},o.prototype.umod=function(e){return this.divmod(e,"mod",!0).mod},o.prototype.divRound=function(e){var t=this.divmod(e);if(t.mod.isZero())return t.div;var r=0!==t.div.negative?t.mod.isub(e):t.mod,n=e.ushrn(1),i=e.andln(1),o=r.cmp(n);return o<0||1===i&&0===o?t.div:0!==t.div.negative?t.div.isubn(1):t.div.iaddn(1)},o.prototype.modrn=function(e){var t=e<0;t&&(e=-e),n(e<=67108863);for(var r=(1<<26)%e,i=0,o=this.length-1;o>=0;o--)i=(r*i+(0|this.words[o]))%e;return t?-i:i},o.prototype.modn=function(e){return this.modrn(e)},o.prototype.idivn=function(e){var t=e<0;t&&(e=-e),n(e<=67108863);for(var r=0,i=this.length-1;i>=0;i--){var o=(0|this.words[i])+67108864*r;this.words[i]=o/e|0,r=o%e}return this._strip(),t?this.ineg():this},o.prototype.divn=function(e){return this.clone().idivn(e)},o.prototype.egcd=function(e){n(0===e.negative),n(!e.isZero());var t=this,r=e.clone();t=0!==t.negative?t.umod(e):t.clone();for(var i=new o(1),a=new o(0),s=new o(0),f=new o(1),u=0;t.isEven()&&r.isEven();)t.iushrn(1),r.iushrn(1),++u;for(var c=r.clone(),h=t.clone();!t.isZero();){for(var l=0,d=1;0==(t.words[0]&d)&&l<26;++l,d<<=1);if(l>0)for(t.iushrn(l);l-- >0;)(i.isOdd()||a.isOdd())&&(i.iadd(c),a.isub(h)),i.iushrn(1),a.iushrn(1);for(var p=0,b=1;0==(r.words[0]&b)&&p<26;++p,b<<=1);if(p>0)for(r.iushrn(p);p-- >0;)(s.isOdd()||f.isOdd())&&(s.iadd(c),f.isub(h)),s.iushrn(1),f.iushrn(1);t.cmp(r)>=0?(t.isub(r),i.isub(s),a.isub(f)):(r.isub(t),s.isub(i),f.isub(a))}return{a:s,b:f,gcd:r.iushln(u)}},o.prototype._invmp=function(e){n(0===e.negative),n(!e.isZero());var t=this,r=e.clone();t=0!==t.negative?t.umod(e):t.clone();for(var i,a=new o(1),s=new o(0),f=r.clone();t.cmpn(1)>0&&r.cmpn(1)>0;){for(var u=0,c=1;0==(t.words[0]&c)&&u<26;++u,c<<=1);if(u>0)for(t.iushrn(u);u-- >0;)a.isOdd()&&a.iadd(f),a.iushrn(1);for(var h=0,l=1;0==(r.words[0]&l)&&h<26;++h,l<<=1);if(h>0)for(r.iushrn(h);h-- >0;)s.isOdd()&&s.iadd(f),s.iushrn(1);t.cmp(r)>=0?(t.isub(r),a.isub(s)):(r.isub(t),s.isub(a))}return(i=0===t.cmpn(1)?a:s).cmpn(0)<0&&i.iadd(e),i},o.prototype.gcd=function(e){if(this.isZero())return e.abs();if(e.isZero())return this.abs();var t=this.clone(),r=e.clone();t.negative=0,r.negative=0;for(var n=0;t.isEven()&&r.isEven();n++)t.iushrn(1),r.iushrn(1);for(;;){for(;t.isEven();)t.iushrn(1);for(;r.isEven();)r.iushrn(1);var i=t.cmp(r);if(i<0){var o=t;t=r,r=o}else if(0===i||0===r.cmpn(1))break;t.isub(r)}return r.iushln(n)},o.prototype.invm=function(e){return this.egcd(e).a.umod(e)},o.prototype.isEven=function(){return 0==(1&this.words[0])},o.prototype.isOdd=function(){return 1==(1&this.words[0])},o.prototype.andln=function(e){return this.words[0]&e},o.prototype.bincn=function(e){n("number"==typeof e);var t=e%26,r=(e-t)/26,i=1<>>26,s&=67108863,this.words[a]=s}return 0!==o&&(this.words[a]=o,this.length++),this},o.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},o.prototype.cmpn=function(e){var t,r=e<0;if(0!==this.negative&&!r)return-1;if(0===this.negative&&r)return 1;if(this._strip(),this.length>1)t=1;else{r&&(e=-e),n(e<=67108863,"Number is too big");var i=0|this.words[0];t=i===e?0:ie.length)return 1;if(this.length=0;r--){var n=0|this.words[r],i=0|e.words[r];if(n!==i){ni&&(t=1);break}}return t},o.prototype.gtn=function(e){return 1===this.cmpn(e)},o.prototype.gt=function(e){return 1===this.cmp(e)},o.prototype.gten=function(e){return this.cmpn(e)>=0},o.prototype.gte=function(e){return this.cmp(e)>=0},o.prototype.ltn=function(e){return-1===this.cmpn(e)},o.prototype.lt=function(e){return-1===this.cmp(e)},o.prototype.lten=function(e){return this.cmpn(e)<=0},o.prototype.lte=function(e){return this.cmp(e)<=0},o.prototype.eqn=function(e){return 0===this.cmpn(e)},o.prototype.eq=function(e){return 0===this.cmp(e)},o.red=function(e){return new k(e)},o.prototype.toRed=function(e){return n(!this.red,"Already a number in reduction context"),n(0===this.negative,"red works only with positives"),e.convertTo(this)._forceRed(e)},o.prototype.fromRed=function(){return n(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},o.prototype._forceRed=function(e){return this.red=e,this},o.prototype.forceRed=function(e){return n(!this.red,"Already a number in reduction context"),this._forceRed(e)},o.prototype.redAdd=function(e){return n(this.red,"redAdd works only with red numbers"),this.red.add(this,e)},o.prototype.redIAdd=function(e){return n(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,e)},o.prototype.redSub=function(e){return n(this.red,"redSub works only with red numbers"),this.red.sub(this,e)},o.prototype.redISub=function(e){return n(this.red,"redISub works only with red numbers"),this.red.isub(this,e)},o.prototype.redShl=function(e){return n(this.red,"redShl works only with red numbers"),this.red.shl(this,e)},o.prototype.redMul=function(e){return n(this.red,"redMul works only with red numbers"),this.red._verify2(this,e),this.red.mul(this,e)},o.prototype.redIMul=function(e){return n(this.red,"redMul works only with red numbers"),this.red._verify2(this,e),this.red.imul(this,e)},o.prototype.redSqr=function(){return n(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},o.prototype.redISqr=function(){return n(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},o.prototype.redSqrt=function(){return n(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},o.prototype.redInvm=function(){return n(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},o.prototype.redNeg=function(){return n(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},o.prototype.redPow=function(e){return n(this.red&&!e.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,e)};var v={k256:null,p224:null,p192:null,p25519:null};function w(e,t){this.name=e,this.p=new o(t,16),this.n=this.p.bitLength(),this.k=new o(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function E(){w.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function S(){w.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function M(){w.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function A(){w.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(e){if("string"==typeof e){var t=o._prime(e);this.m=t.p,this.prime=t}else n(e.gtn(1),"modulus must be greater than 1"),this.m=e,this.prime=null}function R(e){k.call(this,e),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new o(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}w.prototype._tmp=function(){var e=new o(null);return e.words=new Array(Math.ceil(this.n/13)),e},w.prototype.ireduce=function(e){var t,r=e;do{this.split(r,this.tmp),t=(r=(r=this.imulK(r)).iadd(this.tmp)).bitLength()}while(t>this.n);var n=t0?r.isub(this.p):void 0!==r.strip?r.strip():r._strip(),r},w.prototype.split=function(e,t){e.iushrn(this.n,0,t)},w.prototype.imulK=function(e){return e.imul(this.k)},i(E,w),E.prototype.split=function(e,t){for(var r=4194303,n=Math.min(e.length,9),i=0;i>>22,o=a}o>>>=22,e.words[i-10]=o,0===o&&e.length>10?e.length-=10:e.length-=9},E.prototype.imulK=function(e){e.words[e.length]=0,e.words[e.length+1]=0,e.length+=2;for(var t=0,r=0;r>>=26,e.words[r]=i,t=n}return 0!==t&&(e.words[e.length++]=t),e},o._prime=function(e){if(v[e])return v[e];var t;if("k256"===e)t=new E;else if("p224"===e)t=new S;else if("p192"===e)t=new M;else{if("p25519"!==e)throw new Error("Unknown prime "+e);t=new A}return v[e]=t,t},k.prototype._verify1=function(e){n(0===e.negative,"red works only with positives"),n(e.red,"red works only with red numbers")},k.prototype._verify2=function(e,t){n(0==(e.negative|t.negative),"red works only with positives"),n(e.red&&e.red===t.red,"red works only with red numbers")},k.prototype.imod=function(e){return this.prime?this.prime.ireduce(e)._forceRed(this):(c(e,e.umod(this.m)._forceRed(this)),e)},k.prototype.neg=function(e){return e.isZero()?e.clone():this.m.sub(e)._forceRed(this)},k.prototype.add=function(e,t){this._verify2(e,t);var r=e.add(t);return r.cmp(this.m)>=0&&r.isub(this.m),r._forceRed(this)},k.prototype.iadd=function(e,t){this._verify2(e,t);var r=e.iadd(t);return r.cmp(this.m)>=0&&r.isub(this.m),r},k.prototype.sub=function(e,t){this._verify2(e,t);var r=e.sub(t);return r.cmpn(0)<0&&r.iadd(this.m),r._forceRed(this)},k.prototype.isub=function(e,t){this._verify2(e,t);var r=e.isub(t);return r.cmpn(0)<0&&r.iadd(this.m),r},k.prototype.shl=function(e,t){return this._verify1(e),this.imod(e.ushln(t))},k.prototype.imul=function(e,t){return this._verify2(e,t),this.imod(e.imul(t))},k.prototype.mul=function(e,t){return this._verify2(e,t),this.imod(e.mul(t))},k.prototype.isqr=function(e){return this.imul(e,e.clone())},k.prototype.sqr=function(e){return this.mul(e,e)},k.prototype.sqrt=function(e){if(e.isZero())return e.clone();var t=this.m.andln(3);if(n(t%2==1),3===t){var r=this.m.add(new o(1)).iushrn(2);return this.pow(e,r)}for(var i=this.m.subn(1),a=0;!i.isZero()&&0===i.andln(1);)a++,i.iushrn(1);n(!i.isZero());var s=new o(1).toRed(this),f=s.redNeg(),u=this.m.subn(1).iushrn(1),c=this.m.bitLength();for(c=new o(2*c*c).toRed(this);0!==this.pow(c,u).cmp(f);)c.redIAdd(f);for(var h=this.pow(c,i),l=this.pow(e,i.addn(1).iushrn(1)),d=this.pow(e,i),p=a;0!==d.cmp(s);){for(var b=d,y=0;0!==b.cmp(s);y++)b=b.redSqr();n(y=0;n--){for(var u=t.words[n],c=f-1;c>=0;c--){var h=u>>c&1;i!==r[0]&&(i=this.sqr(i)),0!==h||0!==a?(a<<=1,a|=h,(4==++s||0===n&&0===c)&&(i=this.mul(i,r[a]),s=0,a=0)):s=0}f=26}return i},k.prototype.convertTo=function(e){var t=e.umod(this.m);return t===e?t.clone():t},k.prototype.convertFrom=function(e){var t=e.clone();return t.red=null,t},o.mont=function(e){return new R(e)},i(R,k),R.prototype.convertTo=function(e){return this.imod(e.ushln(this.shift))},R.prototype.convertFrom=function(e){var t=this.imod(e.mul(this.rinv));return t.red=null,t},R.prototype.imul=function(e,t){if(e.isZero()||t.isZero())return e.words[0]=0,e.length=1,e;var r=e.imul(t),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),o=i;return i.cmp(this.m)>=0?o=i.isub(this.m):i.cmpn(0)<0&&(o=i.iadd(this.m)),o._forceRed(this)},R.prototype.mul=function(e,t){if(e.isZero()||t.isZero())return new o(0)._forceRed(this);var r=e.mul(t),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),a=i;return i.cmp(this.m)>=0?a=i.isub(this.m):i.cmpn(0)<0&&(a=i.iadd(this.m)),a._forceRed(this)},R.prototype.invm=function(e){return this.imod(e._invmp(this.m).mul(this.r2))._forceRed(this)}}(e=r.nmd(e),this)},(e,t,r)=>{var n=r(3),i=n.Buffer;function o(e,t){for(var r in e)t[r]=e[r]}function a(e,t,r){return i(e,t,r)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?e.exports=n:(o(n,t),t.Buffer=a),a.prototype=Object.create(i.prototype),o(i,a),a.from=function(e,t,r){if("number"==typeof e)throw new TypeError("Argument must not be a number");return i(e,t,r)},a.alloc=function(e,t,r){if("number"!=typeof e)throw new TypeError("Argument must be a number");var n=i(e);return void 0!==t?"string"==typeof r?n.fill(t,r):n.fill(t):n.fill(0),n},a.allocUnsafe=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return i(e)},a.allocUnsafeSlow=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return n.SlowBuffer(e)}},e=>{"use strict";e.exports=function(e,t){for(var r=new Array(arguments.length-1),n=0,i=2,o=!0;i{"use strict";function inquire(moduleName){try{var mod=eval("quire".replace(/^/,"re"))(moduleName);if(mod&&(mod.length||Object.keys(mod).length))return mod}catch(e){}return null}module.exports=inquire},(e,t,r)=>{"use strict";t.Service=r(173)},e=>{"use strict";e.exports={}},(e,t,r)=>{"use strict";e.exports=function(e){for(var t,r=o.codegen(["m","w"],e.name+"$encode")("if(!w)")("w=Writer.create()"),s=e.fieldsArray.slice().sort(o.compareFieldsById),f=0;f>>0,8|i.mapKey[u.keyType],u.keyType),void 0===l?r("types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()",c,t):r(".uint32(%i).%s(%s[ks[i]]).ldelim()",16|l,h,t),r("}")("}")):u.repeated?(r("if(%s!=null&&%s.length){",t,t),u.packed&&void 0!==i.packed[h]?r("w.uint32(%i).fork()",(u.id<<3|2)>>>0)("for(var i=0;i<%s.length;++i)",t)("w.%s(%s[i])",h,t)("w.ldelim()"):(r("for(var i=0;i<%s.length;++i)",t),void 0===l?a(r,u,c,t+"[i]"):r("w.uint32(%i).%s(%s[i])",(u.id<<3|l)>>>0,h,t)),r("}")):(u.optional&&r("if(%s!=null&&m.hasOwnProperty(%j))",t,u.name),void 0===l?a(r,u,c,t):r("w.uint32(%i).%s(%s)",(u.id<<3|l)>>>0,h,t))}return r("return w")};var n=r(7),i=r(17),o=r(4);function a(e,t,r,n){return t.resolvedType.group?e("types[%i].encode(%s,w.uint32(%i)).uint32(%i)",r,n,(t.id<<3|3)>>>0,(t.id<<3|4)>>>0):e("types[%i].encode(%s,w.uint32(%i).fork()).ldelim()",r,n,(t.id<<3|2)>>>0)}},(e,t,r)=>{"use strict";e.exports=function(e){var t=o.codegen(["r","l"],e.name+"$decode")("if(!(r instanceof Reader))")("r=Reader.create(r)")("var c=l===undefined?r.len:r.pos+l,m=new this.ctor"+(e.fieldsArray.filter((function(e){return e.map})).length?",k":""))("while(r.pos>>3){");for(var r=0;r{"use strict";e.exports=function(e){var t=i.codegen(["m"],e.name+"$verify")('if(typeof m!=="object"||m===null)')("return%j","object expected"),r={};e.oneofsArray.length&&t("var p={}");for(var n=0;n{"use strict";var n=t,i=r(7),o=r(4);function a(e,t,r,n){if(t.resolvedType)if(t.resolvedType instanceof i){e("switch(d%s){",n);for(var o=t.resolvedType.values,a=Object.keys(o),s=0;s>>0",n,n);break;case"int32":case"sint32":case"sfixed32":e("m%s=d%s|0",n,n);break;case"uint64":f=!0;case"int64":case"sint64":case"fixed64":case"sfixed64":e("if(util.Long)")("(m%s=util.Long.fromValue(d%s)).unsigned=%j",n,n,f)('else if(typeof d%s==="string")',n)("m%s=parseInt(d%s,10)",n,n)('else if(typeof d%s==="number")',n)("m%s=d%s",n,n)('else if(typeof d%s==="object")',n)("m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)",n,n,n,f?"true":"");break;case"bytes":e('if(typeof d%s==="string")',n)("util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)",n,n,n)("else if(d%s.length)",n)("m%s=d%s",n,n);break;case"string":e("m%s=String(d%s)",n,n);break;case"bool":e("m%s=Boolean(d%s)",n,n)}}return e}function s(e,t,r,n){if(t.resolvedType)t.resolvedType instanceof i?e("d%s=o.enums===String?types[%i].values[m%s]:m%s",n,r,n,n):e("d%s=types[%i].toObject(m%s,o)",n,r,n);else{var o=!1;switch(t.type){case"double":case"float":e("d%s=o.json&&!isFinite(m%s)?String(m%s):m%s",n,n,n,n);break;case"uint64":o=!0;case"int64":case"sint64":case"fixed64":case"sfixed64":e('if(typeof m%s==="number")',n)("d%s=o.longs===String?String(m%s):m%s",n,n,n)("else")("d%s=o.longs===String?util.Long.prototype.toString.call(m%s):o.longs===Number?new util.LongBits(m%s.low>>>0,m%s.high>>>0).toNumber(%s):m%s",n,n,n,n,o?"true":"",n);break;case"bytes":e("d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s",n,n,n,n,n);break;default:e("d%s=m%s",n,n)}}return e}n.fromObject=function(e){var t=e.fieldsArray,r=o.codegen(["d"],e.name+"$fromObject")("if(d instanceof this.ctor)")("return d");if(!t.length)return r("return new this.ctor");r("var m=new this.ctor");for(var n=0;n{"use strict";var n=t,i=r(49);n[".google.protobuf.Any"]={fromObject:function(e){if(e&&e["@type"]){var t=this.lookup(e["@type"]);if(t){var r="."===e["@type"].charAt(0)?e["@type"].substr(1):e["@type"];return this.create({type_url:"/"+r,value:t.encode(t.fromObject(e)).finish()})}}return this.fromObject(e)},toObject:function(e,t){if(t&&t.json&&e.type_url&&e.value){var r=e.type_url.substring(e.type_url.lastIndexOf("/")+1),n=this.lookup(r);n&&(e=n.decode(e.value))}if(!(e instanceof this.ctor)&&e instanceof i){var o=e.$type.toObject(e,t);return o["@type"]=e.$type.fullName,o}return this.toObject(e,t)}}},e=>{"use strict";e.exports=h;var t=/[\s{}=;:[\],'"()<>]/g,r=/(?:"([^"\\]*(?:\\.[^"\\]*)*)")/g,n=/(?:'([^'\\]*(?:\\.[^'\\]*)*)')/g,i=/^ *[*/]+ */,o=/^\s*\*?\/*/,a=/\n/g,s=/\s/,f=/\\(.?)/g,u={0:"\0",r:"\r",n:"\n",t:"\t"};function c(e){return e.replace(f,(function(e,t){switch(t){case"\\":case"":return t;default:return u[t]||""}}))}function h(e,f){e=e.toString();var u=0,h=e.length,l=1,d=null,p=null,b=0,y=!1,m=[],g=null;function _(e){return Error("illegal "+e+" (line "+l+")")}function v(t){return e.charAt(t)}function w(t,r){d=e.charAt(t++),b=l,y=!1;var n,s=t-(f?2:3);do{if(--s<0||"\n"===(n=e.charAt(s))){y=!0;break}}while(" "===n||"\t"===n);for(var u=e.substring(t,r).split(a),c=0;c0)return m.shift();if(g)return function(){var t="'"===g?n:r;t.lastIndex=u-1;var i=t.exec(e);if(!i)throw _("string");return u=t.lastIndex,A(g),g=null,c(i[1])}();var i,o,a,d,p;do{if(u===h)return null;for(i=!1;s.test(a=v(u));)if("\n"===a&&++l,++u===h)return null;if("/"===v(u)){if(++u===h)throw _("comment");if("/"===v(u))if(f){if(d=u,p=!1,E(u)){p=!0;do{if((u=S(u))===h)break;u++}while(E(u))}else u=Math.min(h,S(u)+1);p&&w(d,u),l++,i=!0}else{for(p="/"===v(d=u+1);"\n"!==v(++u);)if(u===h)return null;++u,p&&w(d,u-1),++l,i=!0}else{if("*"!==(a=v(u)))return"/";d=u+1,p=f||"*"===v(d);do{if("\n"===a&&++l,++u===h)throw _("comment");o=a,a=v(u)}while("*"!==o||"/"!==a);++u,p&&w(d,u-2),i=!0}}}while(i);var b=u;if(t.lastIndex=0,!t.test(v(b++)))for(;b{"use strict";var r=t;function n(e){return 1===e.length?"0"+e:e}function i(e){for(var t="",r=0;r>8,a=255&i;o?r.push(o,a):r.push(a)}return r},r.zero2=n,r.toHex=i,r.encode=function(e,t){return"hex"===t?i(e):e}},(e,t,r)=>{"use strict";var n=t;n.base=r(33),n.short=r(181),n.mont=r(182),n.edwards=r(183)},(e,t,r)=>{"use strict";var n=r(9),i=r(34),o=r(185),a=r(6),s=n.sum32,f=n.sum32_4,u=n.sum32_5,c=o.ch32,h=o.maj32,l=o.s0_256,d=o.s1_256,p=o.g0_256,b=o.g1_256,y=i.BlockHash,m=[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];function g(){if(!(this instanceof g))return new g;y.call(this),this.h=[1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225],this.k=m,this.W=new Array(64)}n.inherits(g,y),e.exports=g,g.blockSize=512,g.outSize=256,g.hmacStrength=192,g.padLength=64,g.prototype._update=function(e,t){for(var r=this.W,n=0;n<16;n++)r[n]=e[t+n];for(;n{"use strict";var n=r(9),i=r(34),o=r(6),a=n.rotr64_hi,s=n.rotr64_lo,f=n.shr64_hi,u=n.shr64_lo,c=n.sum64,h=n.sum64_hi,l=n.sum64_lo,d=n.sum64_4_hi,p=n.sum64_4_lo,b=n.sum64_5_hi,y=n.sum64_5_lo,m=i.BlockHash,g=[1116352408,3609767458,1899447441,602891725,3049323471,3964484399,3921009573,2173295548,961987163,4081628472,1508970993,3053834265,2453635748,2937671579,2870763221,3664609560,3624381080,2734883394,310598401,1164996542,607225278,1323610764,1426881987,3590304994,1925078388,4068182383,2162078206,991336113,2614888103,633803317,3248222580,3479774868,3835390401,2666613458,4022224774,944711139,264347078,2341262773,604807628,2007800933,770255983,1495990901,1249150122,1856431235,1555081692,3175218132,1996064986,2198950837,2554220882,3999719339,2821834349,766784016,2952996808,2566594879,3210313671,3203337956,3336571891,1034457026,3584528711,2466948901,113926993,3758326383,338241895,168717936,666307205,1188179964,773529912,1546045734,1294757372,1522805485,1396182291,2643833823,1695183700,2343527390,1986661051,1014477480,2177026350,1206759142,2456956037,344077627,2730485921,1290863460,2820302411,3158454273,3259730800,3505952657,3345764771,106217008,3516065817,3606008344,3600352804,1432725776,4094571909,1467031594,275423344,851169720,430227734,3100823752,506948616,1363258195,659060556,3750685593,883997877,3785050280,958139571,3318307427,1322822218,3812723403,1537002063,2003034995,1747873779,3602036899,1955562222,1575990012,2024104815,1125592928,2227730452,2716904306,2361852424,442776044,2428436474,593698344,2756734187,3733110249,3204031479,2999351573,3329325298,3815920427,3391569614,3928383900,3515267271,566280711,3940187606,3454069534,4118630271,4000239992,116418474,1914138554,174292421,2731055270,289380356,3203993006,460393269,320620315,685471733,587496836,852142971,1086792851,1017036298,365543100,1126000580,2618297676,1288033470,3409855158,1501505948,4234509866,1607167915,987167468,1816402316,1246189591];function _(){if(!(this instanceof _))return new _;m.call(this),this.h=[1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209],this.k=g,this.W=new Array(160)}function v(e,t,r,n,i){var o=e&r^~e&i;return o<0&&(o+=4294967296),o}function w(e,t,r,n,i,o){var a=t&n^~t&o;return a<0&&(a+=4294967296),a}function E(e,t,r,n,i){var o=e&r^e&i^r&i;return o<0&&(o+=4294967296),o}function S(e,t,r,n,i,o){var a=t&n^t&o^n&o;return a<0&&(a+=4294967296),a}function M(e,t){var r=a(e,t,28)^a(t,e,2)^a(t,e,7);return r<0&&(r+=4294967296),r}function A(e,t){var r=s(e,t,28)^s(t,e,2)^s(t,e,7);return r<0&&(r+=4294967296),r}function k(e,t){var r=s(e,t,14)^s(e,t,18)^s(t,e,9);return r<0&&(r+=4294967296),r}function R(e,t){var r=a(e,t,1)^a(e,t,8)^f(e,t,7);return r<0&&(r+=4294967296),r}function O(e,t){var r=s(e,t,1)^s(e,t,8)^u(e,t,7);return r<0&&(r+=4294967296),r}function T(e,t){var r=s(e,t,19)^s(t,e,29)^u(e,t,6);return r<0&&(r+=4294967296),r}n.inherits(_,m),e.exports=_,_.blockSize=1024,_.outSize=512,_.hmacStrength=192,_.padLength=128,_.prototype._prepareBlock=function(e,t){for(var r=this.W,n=0;n<32;n++)r[n]=e[t+n];for(;n{"use strict";var n=r(1).Buffer,i=r(150).Transform;function o(e){i.call(this),this._block=n.allocUnsafe(e),this._blockSize=e,this._blockOffset=0,this._length=[0,0,0,0],this._finalized=!1}r(0)(o,i),o.prototype._transform=function(e,t,r){var n=null;try{this.update(e,t)}catch(e){n=e}r(n)},o.prototype._flush=function(e){var t=null;try{this.push(this.digest())}catch(e){t=e}e(t)},o.prototype.update=function(e,t){if(function(e,t){if(!n.isBuffer(e)&&"string"!=typeof e)throw new TypeError("Data must be a string or a buffer")}(e),this._finalized)throw new Error("Digest already called");n.isBuffer(e)||(e=n.from(e,t));for(var r=this._block,i=0;this._blockOffset+e.length-i>=this._blockSize;){for(var o=this._blockOffset;o0;++a)this._length[a]+=s,(s=this._length[a]/4294967296|0)>0&&(this._length[a]-=4294967296*s);return this},o.prototype._update=function(){throw new Error("_update is not implemented")},o.prototype.digest=function(e){if(this._finalized)throw new Error("Digest already called");this._finalized=!0;var t=this._digest();void 0!==e&&(t=t.toString(e)),this._block.fill(0),this._blockOffset=0;for(var r=0;r<4;++r)this._length[r]=0;return t},o.prototype._digest=function(){throw new Error("_digest is not implemented")},e.exports=o},(e,t,r)=>{"use strict";var n;e.exports=M,M.ReadableState=S,r(10).EventEmitter;var i,o=function(e,t){return e.listeners(t).length},a=r(197),s=r(3).Buffer,f=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},u=r(306);i=u&&u.debuglog?u.debuglog("stream"):function(){};var c,h,l,d=r(198),p=r(92),b=r(93).getHighWaterMark,y=r(21).q,m=y.ERR_INVALID_ARG_TYPE,g=y.ERR_STREAM_PUSH_AFTER_EOF,_=y.ERR_METHOD_NOT_IMPLEMENTED,v=y.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;r(0)(M,a);var w=p.errorOrDestroy,E=["error","close","destroy","pause","resume"];function S(e,t,i){n=n||r(28),e=e||{},"boolean"!=typeof i&&(i=t instanceof n),this.objectMode=!!e.objectMode,i&&(this.objectMode=this.objectMode||!!e.readableObjectMode),this.highWaterMark=b(this,e,"readableHighWaterMark",i),this.buffer=new d,this.length=0,this.pipes=null,this.pipesCount=0,this.flowing=null,this.ended=!1,this.endEmitted=!1,this.reading=!1,this.sync=!0,this.needReadable=!1,this.emittedReadable=!1,this.readableListening=!1,this.resumeScheduled=!1,this.paused=!0,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.destroyed=!1,this.defaultEncoding=e.defaultEncoding||"utf8",this.awaitDrain=0,this.readingMore=!1,this.decoder=null,this.encoding=null,e.encoding&&(c||(c=r(27).s),this.decoder=new c(e.encoding),this.encoding=e.encoding)}function M(e){if(n=n||r(28),!(this instanceof M))return new M(e);var t=this instanceof n;this._readableState=new S(e,this,t),this.readable=!0,e&&("function"==typeof e.read&&(this._read=e.read),"function"==typeof e.destroy&&(this._destroy=e.destroy)),a.call(this)}function A(e,t,r,n,o){i("readableAddChunk",t);var a,u=e._readableState;if(null===t)u.reading=!1,function(e,t){if(i("onEofChunk"),!t.ended){if(t.decoder){var r=t.decoder.end();r&&r.length&&(t.buffer.push(r),t.length+=t.objectMode?1:r.length)}t.ended=!0,t.sync?T(e):(t.needReadable=!1,t.emittedReadable||(t.emittedReadable=!0,I(e)))}}(e,u);else if(o||(a=function(e,t){var r,n;return n=t,s.isBuffer(n)||n instanceof f||"string"==typeof t||void 0===t||e.objectMode||(r=new m("chunk",["string","Buffer","Uint8Array"],t)),r}(u,t)),a)w(e,a);else if(u.objectMode||t&&t.length>0)if("string"==typeof t||u.objectMode||Object.getPrototypeOf(t)===s.prototype||(t=function(e){return s.from(e)}(t)),n)u.endEmitted?w(e,new v):k(e,u,t,!0);else if(u.ended)w(e,new g);else{if(u.destroyed)return!1;u.reading=!1,u.decoder&&!r?(t=u.decoder.write(t),u.objectMode||0!==t.length?k(e,u,t,!1):x(e,u)):k(e,u,t,!1)}else n||(u.reading=!1,x(e,u));return!u.ended&&(u.lengtht.highWaterMark&&(t.highWaterMark=function(e){return e>=R?e=R:(e--,e|=e>>>1,e|=e>>>2,e|=e>>>4,e|=e>>>8,e|=e>>>16,e++),e}(e)),e<=t.length?e:t.ended?t.length:(t.needReadable=!0,0))}function T(e){var t=e._readableState;i("emitReadable",t.needReadable,t.emittedReadable),t.needReadable=!1,t.emittedReadable||(i("emitReadable",t.flowing),t.emittedReadable=!0,process.nextTick(I,e))}function I(e){var t=e._readableState;i("emitReadable_",t.destroyed,t.length,t.ended),t.destroyed||!t.length&&!t.ended||(e.emit("readable"),t.emittedReadable=!1),t.needReadable=!t.flowing&&!t.ended&&t.length<=t.highWaterMark,N(e)}function x(e,t){t.readingMore||(t.readingMore=!0,process.nextTick(B,e,t))}function B(e,t){for(;!t.reading&&!t.ended&&(t.length0,t.resumeScheduled&&!t.paused?t.flowing=!0:e.listenerCount("data")>0&&e.resume()}function L(e){i("readable nexttick read 0"),e.read(0)}function P(e,t){i("resume",t.reading),t.reading||e.read(0),t.resumeScheduled=!1,e.emit("resume"),N(e),t.flowing&&!t.reading&&e.read(0)}function N(e){var t=e._readableState;for(i("flow",t.flowing);t.flowing&&null!==e.read(););}function D(e,t){return 0===t.length?null:(t.objectMode?r=t.buffer.shift():!e||e>=t.length?(r=t.decoder?t.buffer.join(""):1===t.buffer.length?t.buffer.first():t.buffer.concat(t.length),t.buffer.clear()):r=t.buffer.consume(e,t.decoder),r);var r}function C(e){var t=e._readableState;i("endReadable",t.endEmitted),t.endEmitted||(t.ended=!0,process.nextTick(U,t,e))}function U(e,t){if(i("endReadableNT",e.endEmitted,e.length),!e.endEmitted&&0===e.length&&(e.endEmitted=!0,t.readable=!1,t.emit("end"),e.autoDestroy)){var r=t._writableState;(!r||r.autoDestroy&&r.finished)&&t.destroy()}}function q(e,t){for(var r=0,n=e.length;r=t.highWaterMark:t.length>0)||t.ended))return i("read: emitReadable",t.length,t.ended),0===t.length&&t.ended?C(this):T(this),null;if(0===(e=O(e,t))&&t.ended)return 0===t.length&&C(this),null;var n,o=t.needReadable;return i("need readable",o),(0===t.length||t.length-e0?D(e,t):null)?(t.needReadable=t.length<=t.highWaterMark,e=0):(t.length-=e,t.awaitDrain=0),0===t.length&&(t.ended||(t.needReadable=!0),r!==e&&t.ended&&C(this)),null!==n&&this.emit("data",n),n},M.prototype._read=function(e){w(this,new _("_read()"))},M.prototype.pipe=function(e,t){var r=this,n=this._readableState;switch(n.pipesCount){case 0:n.pipes=e;break;case 1:n.pipes=[n.pipes,e];break;default:n.pipes.push(e)}n.pipesCount+=1,i("pipe count=%d opts=%j",n.pipesCount,t);var a=t&&!1===t.end||e===process.stdout||e===process.stderr?p:s;function s(){i("onend"),e.end()}n.endEmitted?process.nextTick(a):r.once("end",a),e.on("unpipe",(function t(o,a){i("onunpipe"),o===r&&a&&!1===a.hasUnpiped&&(a.hasUnpiped=!0,i("cleanup"),e.removeListener("close",l),e.removeListener("finish",d),e.removeListener("drain",f),e.removeListener("error",h),e.removeListener("unpipe",t),r.removeListener("end",s),r.removeListener("end",p),r.removeListener("data",c),u=!0,!n.awaitDrain||e._writableState&&!e._writableState.needDrain||f())}));var f=function(e){return function(){var t=e._readableState;i("pipeOnDrain",t.awaitDrain),t.awaitDrain&&t.awaitDrain--,0===t.awaitDrain&&o(e,"data")&&(t.flowing=!0,N(e))}}(r);e.on("drain",f);var u=!1;function c(t){i("ondata");var o=e.write(t);i("dest.write",o),!1===o&&((1===n.pipesCount&&n.pipes===e||n.pipesCount>1&&-1!==q(n.pipes,e))&&!u&&(i("false write response, pause",n.awaitDrain),n.awaitDrain++),r.pause())}function h(t){i("onerror",t),p(),e.removeListener("error",h),0===o(e,"error")&&w(e,t)}function l(){e.removeListener("finish",d),p()}function d(){i("onfinish"),e.removeListener("close",l),p()}function p(){i("unpipe"),r.unpipe(e)}return r.on("data",c),function(e,t,r){if("function"==typeof e.prependListener)return e.prependListener(t,r);e._events&&e._events[t]?Array.isArray(e._events[t])?e._events[t].unshift(r):e._events[t]=[r,e._events[t]]:e.on(t,r)}(e,"error",h),e.once("close",l),e.once("finish",d),e.emit("pipe",r),n.flowing||(i("pipe resume"),r.resume()),e},M.prototype.unpipe=function(e){var t=this._readableState,r={hasUnpiped:!1};if(0===t.pipesCount)return this;if(1===t.pipesCount)return e&&e!==t.pipes||(e||(e=t.pipes),t.pipes=null,t.pipesCount=0,t.flowing=!1,e&&e.emit("unpipe",this,r)),this;if(!e){var n=t.pipes,i=t.pipesCount;t.pipes=null,t.pipesCount=0,t.flowing=!1;for(var o=0;o0,!1!==n.flowing&&this.resume()):"readable"===e&&(n.endEmitted||n.readableListening||(n.readableListening=n.needReadable=!0,n.flowing=!1,n.emittedReadable=!1,i("on readable",n.length,n.reading),n.length?T(this):n.reading||process.nextTick(L,this))),r},M.prototype.addListener=M.prototype.on,M.prototype.removeListener=function(e,t){var r=a.prototype.removeListener.call(this,e,t);return"readable"===e&&process.nextTick(j,this),r},M.prototype.removeAllListeners=function(e){var t=a.prototype.removeAllListeners.apply(this,arguments);return"readable"!==e&&void 0!==e||process.nextTick(j,this),t},M.prototype.resume=function(){var e=this._readableState;return e.flowing||(i("resume"),e.flowing=!e.readableListening,function(e,t){t.resumeScheduled||(t.resumeScheduled=!0,process.nextTick(P,e,t))}(this,e)),e.paused=!1,this},M.prototype.pause=function(){return i("call pause flowing=%j",this._readableState.flowing),!1!==this._readableState.flowing&&(i("pause"),this._readableState.flowing=!1,this.emit("pause")),this._readableState.paused=!0,this},M.prototype.wrap=function(e){var t=this,r=this._readableState,n=!1;for(var o in e.on("end",(function(){if(i("wrapped end"),r.decoder&&!r.ended){var e=r.decoder.end();e&&e.length&&t.push(e)}t.push(null)})),e.on("data",(function(o){i("wrapped data"),r.decoder&&(o=r.decoder.write(o)),r.objectMode&&null==o||(r.objectMode||o&&o.length)&&(t.push(o)||(n=!0,e.pause()))})),e)void 0===this[o]&&"function"==typeof e[o]&&(this[o]=function(t){return function(){return e[t].apply(e,arguments)}}(o));for(var a=0;a{"use strict";function t(e,t){n(e,t),r(e)}function r(e){e._writableState&&!e._writableState.emitClose||e._readableState&&!e._readableState.emitClose||e.emit("close")}function n(e,t){e.emit("error",t)}e.exports={destroy:function(e,i){var o=this,a=this._readableState&&this._readableState.destroyed,s=this._writableState&&this._writableState.destroyed;return a||s?(i?i(e):e&&(this._writableState?this._writableState.errorEmitted||(this._writableState.errorEmitted=!0,process.nextTick(n,this,e)):process.nextTick(n,this,e)),this):(this._readableState&&(this._readableState.destroyed=!0),this._writableState&&(this._writableState.destroyed=!0),this._destroy(e||null,(function(e){!i&&e?o._writableState?o._writableState.errorEmitted?process.nextTick(r,o):(o._writableState.errorEmitted=!0,process.nextTick(t,o,e)):process.nextTick(t,o,e):i?(process.nextTick(r,o),i(e)):process.nextTick(r,o)})),this)},undestroy:function(){this._readableState&&(this._readableState.destroyed=!1,this._readableState.reading=!1,this._readableState.ended=!1,this._readableState.endEmitted=!1),this._writableState&&(this._writableState.destroyed=!1,this._writableState.ended=!1,this._writableState.ending=!1,this._writableState.finalCalled=!1,this._writableState.prefinished=!1,this._writableState.finished=!1,this._writableState.errorEmitted=!1)},errorOrDestroy:function(e,t){var r=e._readableState,n=e._writableState;r&&r.autoDestroy||n&&n.autoDestroy?e.destroy(t):e.emit("error",t)}}},(e,t,r)=>{"use strict";var n=r(21).q.ERR_INVALID_OPT_VALUE;e.exports={getHighWaterMark:function(e,t,r,i){var o=function(e,t,r){return null!=e.highWaterMark?e.highWaterMark:t?e[r]:null}(t,i,r);if(null!=o){if(!isFinite(o)||Math.floor(o)!==o||o<0)throw new n(i?r:"highWaterMark",o);return Math.floor(o)}return e.objectMode?16:16384}}},(e,t,r)=>{"use strict";function n(e){var t=this;this.next=null,this.entry=null,this.finish=function(){!function(e,t,r){var n=e.entry;for(e.entry=null;n;){var i=n.callback;t.pendingcb--,i(undefined),n=n.next}t.corkedRequestsFree.next=e}(t,e)}}var i;e.exports=M,M.WritableState=S;var o,a={deprecate:r(35)},s=r(197),f=r(3).Buffer,u=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},c=r(92),h=r(93).getHighWaterMark,l=r(21).q,d=l.ERR_INVALID_ARG_TYPE,p=l.ERR_METHOD_NOT_IMPLEMENTED,b=l.ERR_MULTIPLE_CALLBACK,y=l.ERR_STREAM_CANNOT_PIPE,m=l.ERR_STREAM_DESTROYED,g=l.ERR_STREAM_NULL_VALUES,_=l.ERR_STREAM_WRITE_AFTER_END,v=l.ERR_UNKNOWN_ENCODING,w=c.errorOrDestroy;function E(){}function S(e,t,o){i=i||r(28),e=e||{},"boolean"!=typeof o&&(o=t instanceof i),this.objectMode=!!e.objectMode,o&&(this.objectMode=this.objectMode||!!e.writableObjectMode),this.highWaterMark=h(this,e,"writableHighWaterMark",o),this.finalCalled=!1,this.needDrain=!1,this.ending=!1,this.ended=!1,this.finished=!1,this.destroyed=!1;var a=!1===e.decodeStrings;this.decodeStrings=!a,this.defaultEncoding=e.defaultEncoding||"utf8",this.length=0,this.writing=!1,this.corked=0,this.sync=!0,this.bufferProcessing=!1,this.onwrite=function(e){!function(e,t){var r=e._writableState,n=r.sync,i=r.writecb;if("function"!=typeof i)throw new b;if(function(e){e.writing=!1,e.writecb=null,e.length-=e.writelen,e.writelen=0}(r),t)!function(e,t,r,n,i){--t.pendingcb,r?(process.nextTick(i,n),process.nextTick(I,e,t),e._writableState.errorEmitted=!0,w(e,n)):(i(n),e._writableState.errorEmitted=!0,w(e,n),I(e,t))}(e,r,n,t,i);else{var o=O(r)||e.destroyed;o||r.corked||r.bufferProcessing||!r.bufferedRequest||R(e,r),n?process.nextTick(k,e,r,o,i):k(e,r,o,i)}}(t,e)},this.writecb=null,this.writelen=0,this.bufferedRequest=null,this.lastBufferedRequest=null,this.pendingcb=0,this.prefinished=!1,this.errorEmitted=!1,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.bufferedRequestCount=0,this.corkedRequestsFree=new n(this)}function M(e){var t=this instanceof(i=i||r(28));if(!t&&!o.call(M,this))return new M(e);this._writableState=new S(e,this,t),this.writable=!0,e&&("function"==typeof e.write&&(this._write=e.write),"function"==typeof e.writev&&(this._writev=e.writev),"function"==typeof e.destroy&&(this._destroy=e.destroy),"function"==typeof e.final&&(this._final=e.final)),s.call(this)}function A(e,t,r,n,i,o,a){t.writelen=n,t.writecb=a,t.writing=!0,t.sync=!0,t.destroyed?t.onwrite(new m("write")):r?e._writev(i,t.onwrite):e._write(i,o,t.onwrite),t.sync=!1}function k(e,t,r,n){r||function(e,t){0===t.length&&t.needDrain&&(t.needDrain=!1,e.emit("drain"))}(e,t),t.pendingcb--,n(),I(e,t)}function R(e,t){t.bufferProcessing=!0;var r=t.bufferedRequest;if(e._writev&&r&&r.next){var i=t.bufferedRequestCount,o=new Array(i),a=t.corkedRequestsFree;a.entry=r;for(var s=0,f=!0;r;)o[s]=r,r.isBuf||(f=!1),r=r.next,s+=1;o.allBuffers=f,A(e,t,!0,t.length,o,"",a.finish),t.pendingcb++,t.lastBufferedRequest=null,a.next?(t.corkedRequestsFree=a.next,a.next=null):t.corkedRequestsFree=new n(t),t.bufferedRequestCount=0}else{for(;r;){var u=r.chunk,c=r.encoding,h=r.callback;if(A(e,t,!1,t.objectMode?1:u.length,u,c,h),r=r.next,t.bufferedRequestCount--,t.writing)break}null===r&&(t.lastBufferedRequest=null)}t.bufferedRequest=r,t.bufferProcessing=!1}function O(e){return e.ending&&0===e.length&&null===e.bufferedRequest&&!e.finished&&!e.writing}function T(e,t){e._final((function(r){t.pendingcb--,r&&w(e,r),t.prefinished=!0,e.emit("prefinish"),I(e,t)}))}function I(e,t){var r=O(t);if(r&&(function(e,t){t.prefinished||t.finalCalled||("function"!=typeof e._final||t.destroyed?(t.prefinished=!0,e.emit("prefinish")):(t.pendingcb++,t.finalCalled=!0,process.nextTick(T,e,t)))}(e,t),0===t.pendingcb&&(t.finished=!0,e.emit("finish"),t.autoDestroy))){var n=e._readableState;(!n||n.autoDestroy&&n.endEmitted)&&e.destroy()}return r}r(0)(M,s),S.prototype.getBuffer=function(){for(var e=this.bufferedRequest,t=[];e;)t.push(e),e=e.next;return t},function(){try{Object.defineProperty(S.prototype,"buffer",{get:a.deprecate((function(){return this.getBuffer()}),"_writableState.buffer is deprecated. Use _writableState.getBuffer instead.","DEP0003")})}catch(e){}}(),"function"==typeof Symbol&&Symbol.hasInstance&&"function"==typeof Function.prototype[Symbol.hasInstance]?(o=Function.prototype[Symbol.hasInstance],Object.defineProperty(M,Symbol.hasInstance,{value:function(e){return!!o.call(this,e)||this===M&&e&&e._writableState instanceof S}})):o=function(e){return e instanceof this},M.prototype.pipe=function(){w(this,new y)},M.prototype.write=function(e,t,r){var n,i=this._writableState,o=!1,a=!i.objectMode&&(n=e,f.isBuffer(n)||n instanceof u);return a&&!f.isBuffer(e)&&(e=function(e){return f.from(e)}(e)),"function"==typeof t&&(r=t,t=null),a?t="buffer":t||(t=i.defaultEncoding),"function"!=typeof r&&(r=E),i.ending?function(e,t){var r=new _;w(e,r),process.nextTick(t,r)}(this,r):(a||function(e,t,r,n){var i;return null===r?i=new g:"string"==typeof r||t.objectMode||(i=new d("chunk",["string","Buffer"],r)),!i||(w(e,i),process.nextTick(n,i),!1)}(this,i,e,r))&&(i.pendingcb++,o=function(e,t,r,n,i,o){if(!r){var a=function(e,t,r){return e.objectMode||!1===e.decodeStrings||"string"!=typeof t||(t=f.from(t,r)),t}(t,n,i);n!==a&&(r=!0,i="buffer",n=a)}var s=t.objectMode?1:n.length;t.length+=s;var u=t.length-1))throw new v(e);return this._writableState.defaultEncoding=e,this},Object.defineProperty(M.prototype,"writableBuffer",{enumerable:!1,get:function(){return this._writableState&&this._writableState.getBuffer()}}),Object.defineProperty(M.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),M.prototype._write=function(e,t,r){r(new p("_write()"))},M.prototype._writev=null,M.prototype.end=function(e,t,r){var n=this._writableState;return"function"==typeof e?(r=e,e=null,t=null):"function"==typeof t&&(r=t,t=null),null!=e&&this.write(e,t),n.corked&&(n.corked=1,this.uncork()),n.ending||function(e,t,r){t.ending=!0,I(e,t),r&&(t.finished?process.nextTick(r):e.once("finish",r)),t.ended=!0,e.writable=!1}(this,n,r),this},Object.defineProperty(M.prototype,"writableLength",{enumerable:!1,get:function(){return this._writableState.length}}),Object.defineProperty(M.prototype,"destroyed",{enumerable:!1,get:function(){return void 0!==this._writableState&&this._writableState.destroyed},set:function(e){this._writableState&&(this._writableState.destroyed=e)}}),M.prototype.destroy=c.destroy,M.prototype._undestroy=c.undestroy,M.prototype._destroy=function(e,t){t(e)}},(e,t,r)=>{"use strict";e.exports=c;var n=r(21).q,i=n.ERR_METHOD_NOT_IMPLEMENTED,o=n.ERR_MULTIPLE_CALLBACK,a=n.ERR_TRANSFORM_ALREADY_TRANSFORMING,s=n.ERR_TRANSFORM_WITH_LENGTH_0,f=r(28);function u(e,t){var r=this._transformState;r.transforming=!1;var n=r.writecb;if(null===n)return this.emit("error",new o);r.writechunk=null,r.writecb=null,null!=t&&this.push(t),n(e);var i=this._readableState;i.reading=!1,(i.needReadable||i.length{var n=r(0),i=r(18),o=r(1).Buffer,a=[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],s=new Array(64);function f(){this.init(),this._w=s,i.call(this,64,56)}function u(e,t,r){return r^e&(t^r)}function c(e,t,r){return e&t|r&(e|t)}function h(e){return(e>>>2|e<<30)^(e>>>13|e<<19)^(e>>>22|e<<10)}function l(e){return(e>>>6|e<<26)^(e>>>11|e<<21)^(e>>>25|e<<7)}function d(e){return(e>>>7|e<<25)^(e>>>18|e<<14)^e>>>3}n(f,i),f.prototype.init=function(){return this._a=1779033703,this._b=3144134277,this._c=1013904242,this._d=2773480762,this._e=1359893119,this._f=2600822924,this._g=528734635,this._h=1541459225,this},f.prototype._update=function(e){for(var t,r=this._w,n=0|this._a,i=0|this._b,o=0|this._c,s=0|this._d,f=0|this._e,p=0|this._f,b=0|this._g,y=0|this._h,m=0;m<16;++m)r[m]=e.readInt32BE(4*m);for(;m<64;++m)r[m]=0|(((t=r[m-2])>>>17|t<<15)^(t>>>19|t<<13)^t>>>10)+r[m-7]+d(r[m-15])+r[m-16];for(var g=0;g<64;++g){var _=y+l(f)+u(f,p,b)+a[g]+r[g]|0,v=h(n)+c(n,i,o)|0;y=b,b=p,p=f,f=s+_|0,s=o,o=i,i=n,n=_+v|0}this._a=n+this._a|0,this._b=i+this._b|0,this._c=o+this._c|0,this._d=s+this._d|0,this._e=f+this._e|0,this._f=p+this._f|0,this._g=b+this._g|0,this._h=y+this._h|0},f.prototype._hash=function(){var e=o.allocUnsafe(32);return e.writeInt32BE(this._a,0),e.writeInt32BE(this._b,4),e.writeInt32BE(this._c,8),e.writeInt32BE(this._d,12),e.writeInt32BE(this._e,16),e.writeInt32BE(this._f,20),e.writeInt32BE(this._g,24),e.writeInt32BE(this._h,28),e},e.exports=f},(e,t,r)=>{var n=r(0),i=r(18),o=r(1).Buffer,a=[1116352408,3609767458,1899447441,602891725,3049323471,3964484399,3921009573,2173295548,961987163,4081628472,1508970993,3053834265,2453635748,2937671579,2870763221,3664609560,3624381080,2734883394,310598401,1164996542,607225278,1323610764,1426881987,3590304994,1925078388,4068182383,2162078206,991336113,2614888103,633803317,3248222580,3479774868,3835390401,2666613458,4022224774,944711139,264347078,2341262773,604807628,2007800933,770255983,1495990901,1249150122,1856431235,1555081692,3175218132,1996064986,2198950837,2554220882,3999719339,2821834349,766784016,2952996808,2566594879,3210313671,3203337956,3336571891,1034457026,3584528711,2466948901,113926993,3758326383,338241895,168717936,666307205,1188179964,773529912,1546045734,1294757372,1522805485,1396182291,2643833823,1695183700,2343527390,1986661051,1014477480,2177026350,1206759142,2456956037,344077627,2730485921,1290863460,2820302411,3158454273,3259730800,3505952657,3345764771,106217008,3516065817,3606008344,3600352804,1432725776,4094571909,1467031594,275423344,851169720,430227734,3100823752,506948616,1363258195,659060556,3750685593,883997877,3785050280,958139571,3318307427,1322822218,3812723403,1537002063,2003034995,1747873779,3602036899,1955562222,1575990012,2024104815,1125592928,2227730452,2716904306,2361852424,442776044,2428436474,593698344,2756734187,3733110249,3204031479,2999351573,3329325298,3815920427,3391569614,3928383900,3515267271,566280711,3940187606,3454069534,4118630271,4000239992,116418474,1914138554,174292421,2731055270,289380356,3203993006,460393269,320620315,685471733,587496836,852142971,1086792851,1017036298,365543100,1126000580,2618297676,1288033470,3409855158,1501505948,4234509866,1607167915,987167468,1816402316,1246189591],s=new Array(160);function f(){this.init(),this._w=s,i.call(this,128,112)}function u(e,t,r){return r^e&(t^r)}function c(e,t,r){return e&t|r&(e|t)}function h(e,t){return(e>>>28|t<<4)^(t>>>2|e<<30)^(t>>>7|e<<25)}function l(e,t){return(e>>>14|t<<18)^(e>>>18|t<<14)^(t>>>9|e<<23)}function d(e,t){return(e>>>1|t<<31)^(e>>>8|t<<24)^e>>>7}function p(e,t){return(e>>>1|t<<31)^(e>>>8|t<<24)^(e>>>7|t<<25)}function b(e,t){return(e>>>19|t<<13)^(t>>>29|e<<3)^e>>>6}function y(e,t){return(e>>>19|t<<13)^(t>>>29|e<<3)^(e>>>6|t<<26)}function m(e,t){return e>>>0>>0?1:0}n(f,i),f.prototype.init=function(){return this._ah=1779033703,this._bh=3144134277,this._ch=1013904242,this._dh=2773480762,this._eh=1359893119,this._fh=2600822924,this._gh=528734635,this._hh=1541459225,this._al=4089235720,this._bl=2227873595,this._cl=4271175723,this._dl=1595750129,this._el=2917565137,this._fl=725511199,this._gl=4215389547,this._hl=327033209,this},f.prototype._update=function(e){for(var t=this._w,r=0|this._ah,n=0|this._bh,i=0|this._ch,o=0|this._dh,s=0|this._eh,f=0|this._fh,g=0|this._gh,_=0|this._hh,v=0|this._al,w=0|this._bl,E=0|this._cl,S=0|this._dl,M=0|this._el,A=0|this._fl,k=0|this._gl,R=0|this._hl,O=0;O<32;O+=2)t[O]=e.readInt32BE(4*O),t[O+1]=e.readInt32BE(4*O+4);for(;O<160;O+=2){var T=t[O-30],I=t[O-30+1],x=d(T,I),B=p(I,T),j=b(T=t[O-4],I=t[O-4+1]),L=y(I,T),P=t[O-14],N=t[O-14+1],D=t[O-32],C=t[O-32+1],U=B+N|0,q=x+P+m(U,B)|0;q=(q=q+j+m(U=U+L|0,L)|0)+D+m(U=U+C|0,C)|0,t[O]=q,t[O+1]=U}for(var F=0;F<160;F+=2){q=t[F],U=t[F+1];var G=c(r,n,i),z=c(v,w,E),$=h(r,v),W=h(v,r),H=l(s,M),K=l(M,s),V=a[F],Y=a[F+1],X=u(s,f,g),J=u(M,A,k),Z=R+K|0,Q=_+H+m(Z,R)|0;Q=(Q=(Q=Q+X+m(Z=Z+J|0,J)|0)+V+m(Z=Z+Y|0,Y)|0)+q+m(Z=Z+U|0,U)|0;var ee=W+z|0,te=$+G+m(ee,W)|0;_=g,R=k,g=f,k=A,f=s,A=M,s=o+Q+m(M=S+Z|0,S)|0,o=i,S=E,i=n,E=w,n=r,w=v,r=Q+te+m(v=Z+ee|0,Z)|0}this._al=this._al+v|0,this._bl=this._bl+w|0,this._cl=this._cl+E|0,this._dl=this._dl+S|0,this._el=this._el+M|0,this._fl=this._fl+A|0,this._gl=this._gl+k|0,this._hl=this._hl+R|0,this._ah=this._ah+r+m(this._al,v)|0,this._bh=this._bh+n+m(this._bl,w)|0,this._ch=this._ch+i+m(this._cl,E)|0,this._dh=this._dh+o+m(this._dl,S)|0,this._eh=this._eh+s+m(this._el,M)|0,this._fh=this._fh+f+m(this._fl,A)|0,this._gh=this._gh+g+m(this._gl,k)|0,this._hh=this._hh+_+m(this._hl,R)|0},f.prototype._hash=function(){var e=o.allocUnsafe(64);function t(t,r,n){e.writeInt32BE(t,n),e.writeInt32BE(r,n+4)}return t(this._ah,this._al,0),t(this._bh,this._bl,8),t(this._ch,this._cl,16),t(this._dh,this._dl,24),t(this._eh,this._el,32),t(this._fh,this._fl,40),t(this._gh,this._gl,48),t(this._hh,this._hl,56),e},e.exports=f},(e,t,r)=>{"use strict";var n;e.exports=M,M.ReadableState=S,r(10).EventEmitter;var i,o=function(e,t){return e.listeners(t).length},a=r(208),s=r(3).Buffer,f=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},u=r(308);i=u&&u.debuglog?u.debuglog("stream"):function(){};var c,h,l,d=r(209),p=r(99),b=r(100).getHighWaterMark,y=r(22).q,m=y.ERR_INVALID_ARG_TYPE,g=y.ERR_STREAM_PUSH_AFTER_EOF,_=y.ERR_METHOD_NOT_IMPLEMENTED,v=y.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;r(0)(M,a);var w=p.errorOrDestroy,E=["error","close","destroy","pause","resume"];function S(e,t,i){n=n||r(29),e=e||{},"boolean"!=typeof i&&(i=t instanceof n),this.objectMode=!!e.objectMode,i&&(this.objectMode=this.objectMode||!!e.readableObjectMode),this.highWaterMark=b(this,e,"readableHighWaterMark",i),this.buffer=new d,this.length=0,this.pipes=null,this.pipesCount=0,this.flowing=null,this.ended=!1,this.endEmitted=!1,this.reading=!1,this.sync=!0,this.needReadable=!1,this.emittedReadable=!1,this.readableListening=!1,this.resumeScheduled=!1,this.paused=!0,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.destroyed=!1,this.defaultEncoding=e.defaultEncoding||"utf8",this.awaitDrain=0,this.readingMore=!1,this.decoder=null,this.encoding=null,e.encoding&&(c||(c=r(27).s),this.decoder=new c(e.encoding),this.encoding=e.encoding)}function M(e){if(n=n||r(29),!(this instanceof M))return new M(e);var t=this instanceof n;this._readableState=new S(e,this,t),this.readable=!0,e&&("function"==typeof e.read&&(this._read=e.read),"function"==typeof e.destroy&&(this._destroy=e.destroy)),a.call(this)}function A(e,t,r,n,o){i("readableAddChunk",t);var a,u=e._readableState;if(null===t)u.reading=!1,function(e,t){if(i("onEofChunk"),!t.ended){if(t.decoder){var r=t.decoder.end();r&&r.length&&(t.buffer.push(r),t.length+=t.objectMode?1:r.length)}t.ended=!0,t.sync?T(e):(t.needReadable=!1,t.emittedReadable||(t.emittedReadable=!0,I(e)))}}(e,u);else if(o||(a=function(e,t){var r,n;return n=t,s.isBuffer(n)||n instanceof f||"string"==typeof t||void 0===t||e.objectMode||(r=new m("chunk",["string","Buffer","Uint8Array"],t)),r}(u,t)),a)w(e,a);else if(u.objectMode||t&&t.length>0)if("string"==typeof t||u.objectMode||Object.getPrototypeOf(t)===s.prototype||(t=function(e){return s.from(e)}(t)),n)u.endEmitted?w(e,new v):k(e,u,t,!0);else if(u.ended)w(e,new g);else{if(u.destroyed)return!1;u.reading=!1,u.decoder&&!r?(t=u.decoder.write(t),u.objectMode||0!==t.length?k(e,u,t,!1):x(e,u)):k(e,u,t,!1)}else n||(u.reading=!1,x(e,u));return!u.ended&&(u.lengtht.highWaterMark&&(t.highWaterMark=function(e){return e>=R?e=R:(e--,e|=e>>>1,e|=e>>>2,e|=e>>>4,e|=e>>>8,e|=e>>>16,e++),e}(e)),e<=t.length?e:t.ended?t.length:(t.needReadable=!0,0))}function T(e){var t=e._readableState;i("emitReadable",t.needReadable,t.emittedReadable),t.needReadable=!1,t.emittedReadable||(i("emitReadable",t.flowing),t.emittedReadable=!0,process.nextTick(I,e))}function I(e){var t=e._readableState;i("emitReadable_",t.destroyed,t.length,t.ended),t.destroyed||!t.length&&!t.ended||(e.emit("readable"),t.emittedReadable=!1),t.needReadable=!t.flowing&&!t.ended&&t.length<=t.highWaterMark,N(e)}function x(e,t){t.readingMore||(t.readingMore=!0,process.nextTick(B,e,t))}function B(e,t){for(;!t.reading&&!t.ended&&(t.length0,t.resumeScheduled&&!t.paused?t.flowing=!0:e.listenerCount("data")>0&&e.resume()}function L(e){i("readable nexttick read 0"),e.read(0)}function P(e,t){i("resume",t.reading),t.reading||e.read(0),t.resumeScheduled=!1,e.emit("resume"),N(e),t.flowing&&!t.reading&&e.read(0)}function N(e){var t=e._readableState;for(i("flow",t.flowing);t.flowing&&null!==e.read(););}function D(e,t){return 0===t.length?null:(t.objectMode?r=t.buffer.shift():!e||e>=t.length?(r=t.decoder?t.buffer.join(""):1===t.buffer.length?t.buffer.first():t.buffer.concat(t.length),t.buffer.clear()):r=t.buffer.consume(e,t.decoder),r);var r}function C(e){var t=e._readableState;i("endReadable",t.endEmitted),t.endEmitted||(t.ended=!0,process.nextTick(U,t,e))}function U(e,t){if(i("endReadableNT",e.endEmitted,e.length),!e.endEmitted&&0===e.length&&(e.endEmitted=!0,t.readable=!1,t.emit("end"),e.autoDestroy)){var r=t._writableState;(!r||r.autoDestroy&&r.finished)&&t.destroy()}}function q(e,t){for(var r=0,n=e.length;r=t.highWaterMark:t.length>0)||t.ended))return i("read: emitReadable",t.length,t.ended),0===t.length&&t.ended?C(this):T(this),null;if(0===(e=O(e,t))&&t.ended)return 0===t.length&&C(this),null;var n,o=t.needReadable;return i("need readable",o),(0===t.length||t.length-e0?D(e,t):null)?(t.needReadable=t.length<=t.highWaterMark,e=0):(t.length-=e,t.awaitDrain=0),0===t.length&&(t.ended||(t.needReadable=!0),r!==e&&t.ended&&C(this)),null!==n&&this.emit("data",n),n},M.prototype._read=function(e){w(this,new _("_read()"))},M.prototype.pipe=function(e,t){var r=this,n=this._readableState;switch(n.pipesCount){case 0:n.pipes=e;break;case 1:n.pipes=[n.pipes,e];break;default:n.pipes.push(e)}n.pipesCount+=1,i("pipe count=%d opts=%j",n.pipesCount,t);var a=t&&!1===t.end||e===process.stdout||e===process.stderr?p:s;function s(){i("onend"),e.end()}n.endEmitted?process.nextTick(a):r.once("end",a),e.on("unpipe",(function t(o,a){i("onunpipe"),o===r&&a&&!1===a.hasUnpiped&&(a.hasUnpiped=!0,i("cleanup"),e.removeListener("close",l),e.removeListener("finish",d),e.removeListener("drain",f),e.removeListener("error",h),e.removeListener("unpipe",t),r.removeListener("end",s),r.removeListener("end",p),r.removeListener("data",c),u=!0,!n.awaitDrain||e._writableState&&!e._writableState.needDrain||f())}));var f=function(e){return function(){var t=e._readableState;i("pipeOnDrain",t.awaitDrain),t.awaitDrain&&t.awaitDrain--,0===t.awaitDrain&&o(e,"data")&&(t.flowing=!0,N(e))}}(r);e.on("drain",f);var u=!1;function c(t){i("ondata");var o=e.write(t);i("dest.write",o),!1===o&&((1===n.pipesCount&&n.pipes===e||n.pipesCount>1&&-1!==q(n.pipes,e))&&!u&&(i("false write response, pause",n.awaitDrain),n.awaitDrain++),r.pause())}function h(t){i("onerror",t),p(),e.removeListener("error",h),0===o(e,"error")&&w(e,t)}function l(){e.removeListener("finish",d),p()}function d(){i("onfinish"),e.removeListener("close",l),p()}function p(){i("unpipe"),r.unpipe(e)}return r.on("data",c),function(e,t,r){if("function"==typeof e.prependListener)return e.prependListener(t,r);e._events&&e._events[t]?Array.isArray(e._events[t])?e._events[t].unshift(r):e._events[t]=[r,e._events[t]]:e.on(t,r)}(e,"error",h),e.once("close",l),e.once("finish",d),e.emit("pipe",r),n.flowing||(i("pipe resume"),r.resume()),e},M.prototype.unpipe=function(e){var t=this._readableState,r={hasUnpiped:!1};if(0===t.pipesCount)return this;if(1===t.pipesCount)return e&&e!==t.pipes||(e||(e=t.pipes),t.pipes=null,t.pipesCount=0,t.flowing=!1,e&&e.emit("unpipe",this,r)),this;if(!e){var n=t.pipes,i=t.pipesCount;t.pipes=null,t.pipesCount=0,t.flowing=!1;for(var o=0;o0,!1!==n.flowing&&this.resume()):"readable"===e&&(n.endEmitted||n.readableListening||(n.readableListening=n.needReadable=!0,n.flowing=!1,n.emittedReadable=!1,i("on readable",n.length,n.reading),n.length?T(this):n.reading||process.nextTick(L,this))),r},M.prototype.addListener=M.prototype.on,M.prototype.removeListener=function(e,t){var r=a.prototype.removeListener.call(this,e,t);return"readable"===e&&process.nextTick(j,this),r},M.prototype.removeAllListeners=function(e){var t=a.prototype.removeAllListeners.apply(this,arguments);return"readable"!==e&&void 0!==e||process.nextTick(j,this),t},M.prototype.resume=function(){var e=this._readableState;return e.flowing||(i("resume"),e.flowing=!e.readableListening,function(e,t){t.resumeScheduled||(t.resumeScheduled=!0,process.nextTick(P,e,t))}(this,e)),e.paused=!1,this},M.prototype.pause=function(){return i("call pause flowing=%j",this._readableState.flowing),!1!==this._readableState.flowing&&(i("pause"),this._readableState.flowing=!1,this.emit("pause")),this._readableState.paused=!0,this},M.prototype.wrap=function(e){var t=this,r=this._readableState,n=!1;for(var o in e.on("end",(function(){if(i("wrapped end"),r.decoder&&!r.ended){var e=r.decoder.end();e&&e.length&&t.push(e)}t.push(null)})),e.on("data",(function(o){i("wrapped data"),r.decoder&&(o=r.decoder.write(o)),r.objectMode&&null==o||(r.objectMode||o&&o.length)&&(t.push(o)||(n=!0,e.pause()))})),e)void 0===this[o]&&"function"==typeof e[o]&&(this[o]=function(t){return function(){return e[t].apply(e,arguments)}}(o));for(var a=0;a{"use strict";function t(e,t){n(e,t),r(e)}function r(e){e._writableState&&!e._writableState.emitClose||e._readableState&&!e._readableState.emitClose||e.emit("close")}function n(e,t){e.emit("error",t)}e.exports={destroy:function(e,i){var o=this,a=this._readableState&&this._readableState.destroyed,s=this._writableState&&this._writableState.destroyed;return a||s?(i?i(e):e&&(this._writableState?this._writableState.errorEmitted||(this._writableState.errorEmitted=!0,process.nextTick(n,this,e)):process.nextTick(n,this,e)),this):(this._readableState&&(this._readableState.destroyed=!0),this._writableState&&(this._writableState.destroyed=!0),this._destroy(e||null,(function(e){!i&&e?o._writableState?o._writableState.errorEmitted?process.nextTick(r,o):(o._writableState.errorEmitted=!0,process.nextTick(t,o,e)):process.nextTick(t,o,e):i?(process.nextTick(r,o),i(e)):process.nextTick(r,o)})),this)},undestroy:function(){this._readableState&&(this._readableState.destroyed=!1,this._readableState.reading=!1,this._readableState.ended=!1,this._readableState.endEmitted=!1),this._writableState&&(this._writableState.destroyed=!1,this._writableState.ended=!1,this._writableState.ending=!1,this._writableState.finalCalled=!1,this._writableState.prefinished=!1,this._writableState.finished=!1,this._writableState.errorEmitted=!1)},errorOrDestroy:function(e,t){var r=e._readableState,n=e._writableState;r&&r.autoDestroy||n&&n.autoDestroy?e.destroy(t):e.emit("error",t)}}},(e,t,r)=>{"use strict";var n=r(22).q.ERR_INVALID_OPT_VALUE;e.exports={getHighWaterMark:function(e,t,r,i){var o=function(e,t,r){return null!=e.highWaterMark?e.highWaterMark:t?e[r]:null}(t,i,r);if(null!=o){if(!isFinite(o)||Math.floor(o)!==o||o<0)throw new n(i?r:"highWaterMark",o);return Math.floor(o)}return e.objectMode?16:16384}}},(e,t,r)=>{"use strict";function n(e){var t=this;this.next=null,this.entry=null,this.finish=function(){!function(e,t,r){var n=e.entry;for(e.entry=null;n;){var i=n.callback;t.pendingcb--,i(undefined),n=n.next}t.corkedRequestsFree.next=e}(t,e)}}var i;e.exports=M,M.WritableState=S;var o,a={deprecate:r(35)},s=r(208),f=r(3).Buffer,u=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},c=r(99),h=r(100).getHighWaterMark,l=r(22).q,d=l.ERR_INVALID_ARG_TYPE,p=l.ERR_METHOD_NOT_IMPLEMENTED,b=l.ERR_MULTIPLE_CALLBACK,y=l.ERR_STREAM_CANNOT_PIPE,m=l.ERR_STREAM_DESTROYED,g=l.ERR_STREAM_NULL_VALUES,_=l.ERR_STREAM_WRITE_AFTER_END,v=l.ERR_UNKNOWN_ENCODING,w=c.errorOrDestroy;function E(){}function S(e,t,o){i=i||r(29),e=e||{},"boolean"!=typeof o&&(o=t instanceof i),this.objectMode=!!e.objectMode,o&&(this.objectMode=this.objectMode||!!e.writableObjectMode),this.highWaterMark=h(this,e,"writableHighWaterMark",o),this.finalCalled=!1,this.needDrain=!1,this.ending=!1,this.ended=!1,this.finished=!1,this.destroyed=!1;var a=!1===e.decodeStrings;this.decodeStrings=!a,this.defaultEncoding=e.defaultEncoding||"utf8",this.length=0,this.writing=!1,this.corked=0,this.sync=!0,this.bufferProcessing=!1,this.onwrite=function(e){!function(e,t){var r=e._writableState,n=r.sync,i=r.writecb;if("function"!=typeof i)throw new b;if(function(e){e.writing=!1,e.writecb=null,e.length-=e.writelen,e.writelen=0}(r),t)!function(e,t,r,n,i){--t.pendingcb,r?(process.nextTick(i,n),process.nextTick(I,e,t),e._writableState.errorEmitted=!0,w(e,n)):(i(n),e._writableState.errorEmitted=!0,w(e,n),I(e,t))}(e,r,n,t,i);else{var o=O(r)||e.destroyed;o||r.corked||r.bufferProcessing||!r.bufferedRequest||R(e,r),n?process.nextTick(k,e,r,o,i):k(e,r,o,i)}}(t,e)},this.writecb=null,this.writelen=0,this.bufferedRequest=null,this.lastBufferedRequest=null,this.pendingcb=0,this.prefinished=!1,this.errorEmitted=!1,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.bufferedRequestCount=0,this.corkedRequestsFree=new n(this)}function M(e){var t=this instanceof(i=i||r(29));if(!t&&!o.call(M,this))return new M(e);this._writableState=new S(e,this,t),this.writable=!0,e&&("function"==typeof e.write&&(this._write=e.write),"function"==typeof e.writev&&(this._writev=e.writev),"function"==typeof e.destroy&&(this._destroy=e.destroy),"function"==typeof e.final&&(this._final=e.final)),s.call(this)}function A(e,t,r,n,i,o,a){t.writelen=n,t.writecb=a,t.writing=!0,t.sync=!0,t.destroyed?t.onwrite(new m("write")):r?e._writev(i,t.onwrite):e._write(i,o,t.onwrite),t.sync=!1}function k(e,t,r,n){r||function(e,t){0===t.length&&t.needDrain&&(t.needDrain=!1,e.emit("drain"))}(e,t),t.pendingcb--,n(),I(e,t)}function R(e,t){t.bufferProcessing=!0;var r=t.bufferedRequest;if(e._writev&&r&&r.next){var i=t.bufferedRequestCount,o=new Array(i),a=t.corkedRequestsFree;a.entry=r;for(var s=0,f=!0;r;)o[s]=r,r.isBuf||(f=!1),r=r.next,s+=1;o.allBuffers=f,A(e,t,!0,t.length,o,"",a.finish),t.pendingcb++,t.lastBufferedRequest=null,a.next?(t.corkedRequestsFree=a.next,a.next=null):t.corkedRequestsFree=new n(t),t.bufferedRequestCount=0}else{for(;r;){var u=r.chunk,c=r.encoding,h=r.callback;if(A(e,t,!1,t.objectMode?1:u.length,u,c,h),r=r.next,t.bufferedRequestCount--,t.writing)break}null===r&&(t.lastBufferedRequest=null)}t.bufferedRequest=r,t.bufferProcessing=!1}function O(e){return e.ending&&0===e.length&&null===e.bufferedRequest&&!e.finished&&!e.writing}function T(e,t){e._final((function(r){t.pendingcb--,r&&w(e,r),t.prefinished=!0,e.emit("prefinish"),I(e,t)}))}function I(e,t){var r=O(t);if(r&&(function(e,t){t.prefinished||t.finalCalled||("function"!=typeof e._final||t.destroyed?(t.prefinished=!0,e.emit("prefinish")):(t.pendingcb++,t.finalCalled=!0,process.nextTick(T,e,t)))}(e,t),0===t.pendingcb&&(t.finished=!0,e.emit("finish"),t.autoDestroy))){var n=e._readableState;(!n||n.autoDestroy&&n.endEmitted)&&e.destroy()}return r}r(0)(M,s),S.prototype.getBuffer=function(){for(var e=this.bufferedRequest,t=[];e;)t.push(e),e=e.next;return t},function(){try{Object.defineProperty(S.prototype,"buffer",{get:a.deprecate((function(){return this.getBuffer()}),"_writableState.buffer is deprecated. Use _writableState.getBuffer instead.","DEP0003")})}catch(e){}}(),"function"==typeof Symbol&&Symbol.hasInstance&&"function"==typeof Function.prototype[Symbol.hasInstance]?(o=Function.prototype[Symbol.hasInstance],Object.defineProperty(M,Symbol.hasInstance,{value:function(e){return!!o.call(this,e)||this===M&&e&&e._writableState instanceof S}})):o=function(e){return e instanceof this},M.prototype.pipe=function(){w(this,new y)},M.prototype.write=function(e,t,r){var n,i=this._writableState,o=!1,a=!i.objectMode&&(n=e,f.isBuffer(n)||n instanceof u);return a&&!f.isBuffer(e)&&(e=function(e){return f.from(e)}(e)),"function"==typeof t&&(r=t,t=null),a?t="buffer":t||(t=i.defaultEncoding),"function"!=typeof r&&(r=E),i.ending?function(e,t){var r=new _;w(e,r),process.nextTick(t,r)}(this,r):(a||function(e,t,r,n){var i;return null===r?i=new g:"string"==typeof r||t.objectMode||(i=new d("chunk",["string","Buffer"],r)),!i||(w(e,i),process.nextTick(n,i),!1)}(this,i,e,r))&&(i.pendingcb++,o=function(e,t,r,n,i,o){if(!r){var a=function(e,t,r){return e.objectMode||!1===e.decodeStrings||"string"!=typeof t||(t=f.from(t,r)),t}(t,n,i);n!==a&&(r=!0,i="buffer",n=a)}var s=t.objectMode?1:n.length;t.length+=s;var u=t.length-1))throw new v(e);return this._writableState.defaultEncoding=e,this},Object.defineProperty(M.prototype,"writableBuffer",{enumerable:!1,get:function(){return this._writableState&&this._writableState.getBuffer()}}),Object.defineProperty(M.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),M.prototype._write=function(e,t,r){r(new p("_write()"))},M.prototype._writev=null,M.prototype.end=function(e,t,r){var n=this._writableState;return"function"==typeof e?(r=e,e=null,t=null):"function"==typeof t&&(r=t,t=null),null!=e&&this.write(e,t),n.corked&&(n.corked=1,this.uncork()),n.ending||function(e,t,r){t.ending=!0,I(e,t),r&&(t.finished?process.nextTick(r):e.once("finish",r)),t.ended=!0,e.writable=!1}(this,n,r),this},Object.defineProperty(M.prototype,"writableLength",{enumerable:!1,get:function(){return this._writableState.length}}),Object.defineProperty(M.prototype,"destroyed",{enumerable:!1,get:function(){return void 0!==this._writableState&&this._writableState.destroyed},set:function(e){this._writableState&&(this._writableState.destroyed=e)}}),M.prototype.destroy=c.destroy,M.prototype._undestroy=c.undestroy,M.prototype._destroy=function(e,t){t(e)}},(e,t,r)=>{"use strict";e.exports=c;var n=r(22).q,i=n.ERR_METHOD_NOT_IMPLEMENTED,o=n.ERR_MULTIPLE_CALLBACK,a=n.ERR_TRANSFORM_ALREADY_TRANSFORMING,s=n.ERR_TRANSFORM_WITH_LENGTH_0,f=r(29);function u(e,t){var r=this._transformState;r.transforming=!1;var n=r.writecb;if(null===n)return this.emit("error",new o);r.writechunk=null,r.writecb=null,null!=t&&this.push(t),n(e);var i=this._readableState;i.reading=!1,(i.needReadable||i.length{t.pbkdf2=r(214),t.pbkdf2Sync=r(106)},e=>{var t=Math.pow(2,30)-1;e.exports=function(e,r){if("number"!=typeof e)throw new TypeError("Iterations not a number");if(e<0)throw new TypeError("Bad iterations");if("number"!=typeof r)throw new TypeError("Key length not a number");if(r<0||r>t||r!=r)throw new TypeError("Bad key length")}},(e,t,r)=>{var n;n=r.g.process&&r.g.process.browser?"utf-8":r.g.process&&r.g.process.version?parseInt(process.version.split(".")[0].slice(1),10)>=6?"utf-8":"binary":"utf-8",e.exports=n},(e,t,r)=>{var n=r(107),i=r(56),o=r(57),a=r(1).Buffer,s=r(104),f=r(105),u=r(108),c=a.alloc(128),h={md5:16,sha1:20,sha224:28,sha256:32,sha384:48,sha512:64,rmd160:20,ripemd160:20};function l(e,t,r){var s=function(e){return"rmd160"===e||"ripemd160"===e?function(e){return(new i).update(e).digest()}:"md5"===e?n:function(t){return o(e).update(t).digest()}}(e),f="sha512"===e||"sha384"===e?128:64;t.length>f?t=s(t):t.length{var n=r(54);e.exports=function(e){return(new n).update(e).digest()}},(e,t,r)=>{var n=r(1).Buffer;e.exports=function(e,t,r){if(n.isBuffer(e))return e;if("string"==typeof e)return n.from(e,t);if(ArrayBuffer.isView(e))return n.from(e.buffer);throw new TypeError(r+" must be a string, a Buffer, a typed array or a DataView")}},e=>{"use strict";e.exports=function(){if("function"!=typeof Symbol||"function"!=typeof Object.getOwnPropertySymbols)return!1;if("symbol"==typeof Symbol.iterator)return!0;var e={},t=Symbol("test"),r=Object(t);if("string"==typeof t)return!1;if("[object Symbol]"!==Object.prototype.toString.call(t))return!1;if("[object Symbol]"!==Object.prototype.toString.call(r))return!1;for(t in e[t]=42,e)return!1;if("function"==typeof Object.keys&&0!==Object.keys(e).length)return!1;if("function"==typeof Object.getOwnPropertyNames&&0!==Object.getOwnPropertyNames(e).length)return!1;var n=Object.getOwnPropertySymbols(e);if(1!==n.length||n[0]!==t)return!1;if(!Object.prototype.propertyIsEnumerable.call(e,t))return!1;if("function"==typeof Object.getOwnPropertyDescriptor){var i=Object.getOwnPropertyDescriptor(e,t);if(42!==i.value||!0!==i.enumerable)return!1}return!0}},(e,t,r)=>{"use strict";var n=r(224),i=Object.prototype.toString,o=Object.prototype.hasOwnProperty;e.exports=function(e,t,r){if(!n(t))throw new TypeError("iterator must be a function");var a;arguments.length>=3&&(a=r),"[object Array]"===i.call(e)?function(e,t,r){for(var n=0,i=e.length;n{"use strict";var n=["BigInt64Array","BigUint64Array","Float32Array","Float64Array","Int16Array","Int32Array","Int8Array","Uint16Array","Uint32Array","Uint8Array","Uint8ClampedArray"],i="undefined"==typeof globalThis?r.g:globalThis;e.exports=function(){for(var e=[],t=0;t{"use strict";var n=r(37)("%Object.getOwnPropertyDescriptor%",!0);if(n)try{n([],"length")}catch(e){n=null}e.exports=n},(e,t,r)=>{"use strict";var n=r(110),i=r(111),o=r(59),a=o("Object.prototype.toString"),s=r(36)(),f=r(112),u="undefined"==typeof globalThis?r.g:globalThis,c=i(),h=o("Array.prototype.indexOf",!0)||function(e,t){for(var r=0;r-1}return!!f&&function(e){var t=!1;return n(d,(function(r,n){if(!t)try{t=r.call(e)===n}catch(e){}})),t}(e)}},(e,t,r)=>{"use strict";var n=r(38),i=r(41),o=r(116),a=r(117),s=r(231),f=i(a(),Object);n(f,{getPolyfill:a,implementation:o,shim:s}),e.exports=f},e=>{"use strict";var t=Object.prototype.toString;e.exports=function(e){var r=t.call(e),n="[object Arguments]"===r;return n||(n="[object Array]"!==r&&null!==e&&"object"==typeof e&&"number"==typeof e.length&&e.length>=0&&"[object Function]"===t.call(e.callee)),n}},e=>{"use strict";var t=function(e){return e!=e};e.exports=function(e,r){return 0===e&&0===r?1/e==1/r:e===r||!(!t(e)||!t(r))}},(e,t,r)=>{"use strict";var n=r(116);e.exports=function(){return"function"==typeof Object.is?Object.is:n}},e=>{"use strict";e.exports=function(e){return e!=e}},(e,t,r)=>{"use strict";var n=r(118);e.exports=function(){return Number.isNaN&&Number.isNaN(NaN)&&!Number.isNaN("a")?Number.isNaN:n}},(e,t,r)=>{"use strict";var n=r(0),i=r(235),o=r(14),a=r(1).Buffer,s=r(107),f=r(56),u=r(57),c=a.alloc(128);function h(e,t){o.call(this,"digest"),"string"==typeof t&&(t=a.from(t));var r="sha512"===e||"sha384"===e?128:64;this._alg=e,this._key=t,t.length>r?t=("rmd160"===e?new f:u(e)).update(t).digest():t.length{"use strict";var n=r(6),i=r(0),o=r(239),a=r(62);function s(){this.tmp=new Array(2),this.keys=null}function f(e){a.call(this,e);var t=new s;this._desState=t,this.deriveKeys(t,e.key)}i(f,a),e.exports=f,f.create=function(e){return new f(e)};var u=[1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1];f.prototype.deriveKeys=function(e,t){e.keys=new Array(32),n.equal(t.length,this.blockSize,"Invalid key length");var r=o.readUInt32BE(t,0),i=o.readUInt32BE(t,4);o.pc1(r,i,e.tmp,0),r=e.tmp[0],i=e.tmp[1];for(var a=0;a>>1];r=o.r28shl(r,s),i=o.r28shl(i,s),o.pc2(r,i,e.keys,a)}},f.prototype._update=function(e,t,r,n){var i=this._desState,a=o.readUInt32BE(e,t),s=o.readUInt32BE(e,t+4);o.ip(a,s,i.tmp,0),a=i.tmp[0],s=i.tmp[1],"encrypt"===this.type?this._encrypt(i,a,s,i.tmp,0):this._decrypt(i,a,s,i.tmp,0),a=i.tmp[0],s=i.tmp[1],o.writeUInt32BE(r,a,n),o.writeUInt32BE(r,s,n+4)},f.prototype._pad=function(e,t){for(var r=e.length-t,n=t;n>>0,a=l}o.rip(s,a,n,i)},f.prototype._decrypt=function(e,t,r,n,i){for(var a=r,s=t,f=e.keys.length-2;f>=0;f-=2){var u=e.keys[f],c=e.keys[f+1];o.expand(a,e.tmp,0),u^=e.tmp[0],c^=e.tmp[1];var h=o.substitute(u,c),l=a;a=(s^o.permute(h))>>>0,s=l}o.rip(a,s,n,i)}},(e,t,r)=>{var n=r(314),i=r(321),o=r(241);t.createCipher=t.Cipher=n.createCipher,t.createCipheriv=t.Cipheriv=n.createCipheriv,t.createDecipher=t.Decipher=i.createDecipher,t.createDecipheriv=t.Decipheriv=i.createDecipheriv,t.listCiphers=t.getCiphers=function(){return Object.keys(o)}},e=>{e.exports=function(e){for(var t,r=e.length;r--;){if(255!==(t=e.readUInt8(r))){t++,e.writeUInt8(t,r);break}e.writeUInt8(0,r)}}},(e,t,r)=>{var n=r(64),i=r(1).Buffer,o=r(14),a=r(0),s=r(242),f=r(23),u=r(123);function c(e,t,r,a){o.call(this);var f=i.alloc(4,0);this._cipher=new n.AES(t);var c=this._cipher.encryptBlock(f);this._ghash=new s(c),r=function(e,t,r){if(12===t.length)return e._finID=i.concat([t,i.from([0,0,0,1])]),i.concat([t,i.from([0,0,0,2])]);var n=new s(r),o=t.length,a=o%16;n.update(t),a&&(a=16-a,n.update(i.alloc(a,0))),n.update(i.alloc(8,0));var f=8*o,c=i.alloc(8);c.writeUIntBE(f,0,8),n.update(c),e._finID=n.state;var h=i.from(e._finID);return u(h),h}(this,r,c),this._prev=i.from(r),this._cache=i.allocUnsafe(0),this._secCache=i.allocUnsafe(0),this._decrypt=a,this._alen=0,this._len=0,this._mode=e,this._authTag=null,this._called=!1}a(c,o),c.prototype._update=function(e){if(!this._called&&this._alen){var t=16-this._alen%16;t<16&&(t=i.alloc(t,0),this._ghash.update(t))}this._called=!0;var r=this._mode.encrypt(this,e);return this._decrypt?this._ghash.update(e):this._ghash.update(r),this._len+=e.length,r},c.prototype._final=function(){if(this._decrypt&&!this._authTag)throw new Error("Unsupported state or unable to authenticate data");var e=f(this._ghash.final(8*this._alen,8*this._len),this._cipher.encryptBlock(this._finID));if(this._decrypt&&function(e,t){var r=0;e.length!==t.length&&r++;for(var n=Math.min(e.length,t.length),i=0;i{var n=r(64),i=r(1).Buffer,o=r(14);function a(e,t,r,a){o.call(this),this._cipher=new n.AES(t),this._prev=i.from(r),this._cache=i.allocUnsafe(0),this._secCache=i.allocUnsafe(0),this._decrypt=a,this._mode=e}r(0)(a,o),a.prototype._update=function(e){return this._mode.encrypt(this,e,this._decrypt)},a.prototype._final=function(){this._cipher.scrub()},e.exports=a},(e,t,r)=>{var n=r(12);e.exports=g,g.simpleSieve=y,g.fermatTest=m;var i=r(2),o=new i(24),a=new(r(127)),s=new i(1),f=new i(2),u=new i(5),c=(new i(16),new i(8),new i(10)),h=new i(3),l=(new i(7),new i(11)),d=new i(4),p=(new i(12),null);function b(){if(null!==p)return p;var e=[];e[0]=2;for(var t=1,r=3;r<1048576;r+=2){for(var n=Math.ceil(Math.sqrt(r)),i=0;ie;)r.ishrn(1);if(r.isEven()&&r.iadd(s),r.testn(1)||r.iadd(f),t.cmp(f)){if(!t.cmp(u))for(;r.mod(c).cmp(h);)r.iadd(d)}else for(;r.mod(o).cmp(l);)r.iadd(d);if(y(p=r.shrn(1))&&y(r)&&m(p)&&m(r)&&a.test(p)&&a.test(r))return r}}},(e,t,r)=>{var n=r(2),i=r(51);function o(e){this.rand=e||new i.Rand}e.exports=o,o.create=function(e){return new o(e)},o.prototype._randbelow=function(e){var t=e.bitLength(),r=Math.ceil(t/8);do{var i=new n(this.rand.generate(r))}while(i.cmp(e)>=0);return i},o.prototype._randrange=function(e,t){var r=t.sub(e);return e.add(this._randbelow(r))},o.prototype.test=function(e,t,r){var i=e.bitLength(),o=n.mont(e),a=new n(1).toRed(o);t||(t=Math.max(1,i/48|0));for(var s=e.subn(1),f=0;!s.testn(f);f++);for(var u=e.shrn(f),c=s.toRed(o);t>0;t--){var h=this._randrange(new n(2),s);r&&r(h);var l=h.toRed(o).redPow(u);if(0!==l.cmp(a)&&0!==l.cmp(c)){for(var d=1;d0;t--){var c=this._randrange(new n(2),a),h=e.gcd(c);if(0!==h.cmpn(1))return h;var l=c.toRed(i).redPow(f);if(0!==l.cmp(o)&&0!==l.cmp(u)){for(var d=1;d{"use strict";var n;e.exports=M,M.ReadableState=S,r(10).EventEmitter;var i,o=function(e,t){return e.listeners(t).length},a=r(245),s=r(3).Buffer,f=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},u=r(325);i=u&&u.debuglog?u.debuglog("stream"):function(){};var c,h,l,d=r(246),p=r(129),b=r(130).getHighWaterMark,y=r(24).q,m=y.ERR_INVALID_ARG_TYPE,g=y.ERR_STREAM_PUSH_AFTER_EOF,_=y.ERR_METHOD_NOT_IMPLEMENTED,v=y.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;r(0)(M,a);var w=p.errorOrDestroy,E=["error","close","destroy","pause","resume"];function S(e,t,i){n=n||r(30),e=e||{},"boolean"!=typeof i&&(i=t instanceof n),this.objectMode=!!e.objectMode,i&&(this.objectMode=this.objectMode||!!e.readableObjectMode),this.highWaterMark=b(this,e,"readableHighWaterMark",i),this.buffer=new d,this.length=0,this.pipes=null,this.pipesCount=0,this.flowing=null,this.ended=!1,this.endEmitted=!1,this.reading=!1,this.sync=!0,this.needReadable=!1,this.emittedReadable=!1,this.readableListening=!1,this.resumeScheduled=!1,this.paused=!0,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.destroyed=!1,this.defaultEncoding=e.defaultEncoding||"utf8",this.awaitDrain=0,this.readingMore=!1,this.decoder=null,this.encoding=null,e.encoding&&(c||(c=r(27).s),this.decoder=new c(e.encoding),this.encoding=e.encoding)}function M(e){if(n=n||r(30),!(this instanceof M))return new M(e);var t=this instanceof n;this._readableState=new S(e,this,t),this.readable=!0,e&&("function"==typeof e.read&&(this._read=e.read),"function"==typeof e.destroy&&(this._destroy=e.destroy)),a.call(this)}function A(e,t,r,n,o){i("readableAddChunk",t);var a,u=e._readableState;if(null===t)u.reading=!1,function(e,t){if(i("onEofChunk"),!t.ended){if(t.decoder){var r=t.decoder.end();r&&r.length&&(t.buffer.push(r),t.length+=t.objectMode?1:r.length)}t.ended=!0,t.sync?T(e):(t.needReadable=!1,t.emittedReadable||(t.emittedReadable=!0,I(e)))}}(e,u);else if(o||(a=function(e,t){var r,n;return n=t,s.isBuffer(n)||n instanceof f||"string"==typeof t||void 0===t||e.objectMode||(r=new m("chunk",["string","Buffer","Uint8Array"],t)),r}(u,t)),a)w(e,a);else if(u.objectMode||t&&t.length>0)if("string"==typeof t||u.objectMode||Object.getPrototypeOf(t)===s.prototype||(t=function(e){return s.from(e)}(t)),n)u.endEmitted?w(e,new v):k(e,u,t,!0);else if(u.ended)w(e,new g);else{if(u.destroyed)return!1;u.reading=!1,u.decoder&&!r?(t=u.decoder.write(t),u.objectMode||0!==t.length?k(e,u,t,!1):x(e,u)):k(e,u,t,!1)}else n||(u.reading=!1,x(e,u));return!u.ended&&(u.lengtht.highWaterMark&&(t.highWaterMark=function(e){return e>=R?e=R:(e--,e|=e>>>1,e|=e>>>2,e|=e>>>4,e|=e>>>8,e|=e>>>16,e++),e}(e)),e<=t.length?e:t.ended?t.length:(t.needReadable=!0,0))}function T(e){var t=e._readableState;i("emitReadable",t.needReadable,t.emittedReadable),t.needReadable=!1,t.emittedReadable||(i("emitReadable",t.flowing),t.emittedReadable=!0,process.nextTick(I,e))}function I(e){var t=e._readableState;i("emitReadable_",t.destroyed,t.length,t.ended),t.destroyed||!t.length&&!t.ended||(e.emit("readable"),t.emittedReadable=!1),t.needReadable=!t.flowing&&!t.ended&&t.length<=t.highWaterMark,N(e)}function x(e,t){t.readingMore||(t.readingMore=!0,process.nextTick(B,e,t))}function B(e,t){for(;!t.reading&&!t.ended&&(t.length0,t.resumeScheduled&&!t.paused?t.flowing=!0:e.listenerCount("data")>0&&e.resume()}function L(e){i("readable nexttick read 0"),e.read(0)}function P(e,t){i("resume",t.reading),t.reading||e.read(0),t.resumeScheduled=!1,e.emit("resume"),N(e),t.flowing&&!t.reading&&e.read(0)}function N(e){var t=e._readableState;for(i("flow",t.flowing);t.flowing&&null!==e.read(););}function D(e,t){return 0===t.length?null:(t.objectMode?r=t.buffer.shift():!e||e>=t.length?(r=t.decoder?t.buffer.join(""):1===t.buffer.length?t.buffer.first():t.buffer.concat(t.length),t.buffer.clear()):r=t.buffer.consume(e,t.decoder),r);var r}function C(e){var t=e._readableState;i("endReadable",t.endEmitted),t.endEmitted||(t.ended=!0,process.nextTick(U,t,e))}function U(e,t){if(i("endReadableNT",e.endEmitted,e.length),!e.endEmitted&&0===e.length&&(e.endEmitted=!0,t.readable=!1,t.emit("end"),e.autoDestroy)){var r=t._writableState;(!r||r.autoDestroy&&r.finished)&&t.destroy()}}function q(e,t){for(var r=0,n=e.length;r=t.highWaterMark:t.length>0)||t.ended))return i("read: emitReadable",t.length,t.ended),0===t.length&&t.ended?C(this):T(this),null;if(0===(e=O(e,t))&&t.ended)return 0===t.length&&C(this),null;var n,o=t.needReadable;return i("need readable",o),(0===t.length||t.length-e0?D(e,t):null)?(t.needReadable=t.length<=t.highWaterMark,e=0):(t.length-=e,t.awaitDrain=0),0===t.length&&(t.ended||(t.needReadable=!0),r!==e&&t.ended&&C(this)),null!==n&&this.emit("data",n),n},M.prototype._read=function(e){w(this,new _("_read()"))},M.prototype.pipe=function(e,t){var r=this,n=this._readableState;switch(n.pipesCount){case 0:n.pipes=e;break;case 1:n.pipes=[n.pipes,e];break;default:n.pipes.push(e)}n.pipesCount+=1,i("pipe count=%d opts=%j",n.pipesCount,t);var a=t&&!1===t.end||e===process.stdout||e===process.stderr?p:s;function s(){i("onend"),e.end()}n.endEmitted?process.nextTick(a):r.once("end",a),e.on("unpipe",(function t(o,a){i("onunpipe"),o===r&&a&&!1===a.hasUnpiped&&(a.hasUnpiped=!0,i("cleanup"),e.removeListener("close",l),e.removeListener("finish",d),e.removeListener("drain",f),e.removeListener("error",h),e.removeListener("unpipe",t),r.removeListener("end",s),r.removeListener("end",p),r.removeListener("data",c),u=!0,!n.awaitDrain||e._writableState&&!e._writableState.needDrain||f())}));var f=function(e){return function(){var t=e._readableState;i("pipeOnDrain",t.awaitDrain),t.awaitDrain&&t.awaitDrain--,0===t.awaitDrain&&o(e,"data")&&(t.flowing=!0,N(e))}}(r);e.on("drain",f);var u=!1;function c(t){i("ondata");var o=e.write(t);i("dest.write",o),!1===o&&((1===n.pipesCount&&n.pipes===e||n.pipesCount>1&&-1!==q(n.pipes,e))&&!u&&(i("false write response, pause",n.awaitDrain),n.awaitDrain++),r.pause())}function h(t){i("onerror",t),p(),e.removeListener("error",h),0===o(e,"error")&&w(e,t)}function l(){e.removeListener("finish",d),p()}function d(){i("onfinish"),e.removeListener("close",l),p()}function p(){i("unpipe"),r.unpipe(e)}return r.on("data",c),function(e,t,r){if("function"==typeof e.prependListener)return e.prependListener(t,r);e._events&&e._events[t]?Array.isArray(e._events[t])?e._events[t].unshift(r):e._events[t]=[r,e._events[t]]:e.on(t,r)}(e,"error",h),e.once("close",l),e.once("finish",d),e.emit("pipe",r),n.flowing||(i("pipe resume"),r.resume()),e},M.prototype.unpipe=function(e){var t=this._readableState,r={hasUnpiped:!1};if(0===t.pipesCount)return this;if(1===t.pipesCount)return e&&e!==t.pipes||(e||(e=t.pipes),t.pipes=null,t.pipesCount=0,t.flowing=!1,e&&e.emit("unpipe",this,r)),this;if(!e){var n=t.pipes,i=t.pipesCount;t.pipes=null,t.pipesCount=0,t.flowing=!1;for(var o=0;o0,!1!==n.flowing&&this.resume()):"readable"===e&&(n.endEmitted||n.readableListening||(n.readableListening=n.needReadable=!0,n.flowing=!1,n.emittedReadable=!1,i("on readable",n.length,n.reading),n.length?T(this):n.reading||process.nextTick(L,this))),r},M.prototype.addListener=M.prototype.on,M.prototype.removeListener=function(e,t){var r=a.prototype.removeListener.call(this,e,t);return"readable"===e&&process.nextTick(j,this),r},M.prototype.removeAllListeners=function(e){var t=a.prototype.removeAllListeners.apply(this,arguments);return"readable"!==e&&void 0!==e||process.nextTick(j,this),t},M.prototype.resume=function(){var e=this._readableState;return e.flowing||(i("resume"),e.flowing=!e.readableListening,function(e,t){t.resumeScheduled||(t.resumeScheduled=!0,process.nextTick(P,e,t))}(this,e)),e.paused=!1,this},M.prototype.pause=function(){return i("call pause flowing=%j",this._readableState.flowing),!1!==this._readableState.flowing&&(i("pause"),this._readableState.flowing=!1,this.emit("pause")),this._readableState.paused=!0,this},M.prototype.wrap=function(e){var t=this,r=this._readableState,n=!1;for(var o in e.on("end",(function(){if(i("wrapped end"),r.decoder&&!r.ended){var e=r.decoder.end();e&&e.length&&t.push(e)}t.push(null)})),e.on("data",(function(o){i("wrapped data"),r.decoder&&(o=r.decoder.write(o)),r.objectMode&&null==o||(r.objectMode||o&&o.length)&&(t.push(o)||(n=!0,e.pause()))})),e)void 0===this[o]&&"function"==typeof e[o]&&(this[o]=function(t){return function(){return e[t].apply(e,arguments)}}(o));for(var a=0;a{"use strict";function t(e,t){n(e,t),r(e)}function r(e){e._writableState&&!e._writableState.emitClose||e._readableState&&!e._readableState.emitClose||e.emit("close")}function n(e,t){e.emit("error",t)}e.exports={destroy:function(e,i){var o=this,a=this._readableState&&this._readableState.destroyed,s=this._writableState&&this._writableState.destroyed;return a||s?(i?i(e):e&&(this._writableState?this._writableState.errorEmitted||(this._writableState.errorEmitted=!0,process.nextTick(n,this,e)):process.nextTick(n,this,e)),this):(this._readableState&&(this._readableState.destroyed=!0),this._writableState&&(this._writableState.destroyed=!0),this._destroy(e||null,(function(e){!i&&e?o._writableState?o._writableState.errorEmitted?process.nextTick(r,o):(o._writableState.errorEmitted=!0,process.nextTick(t,o,e)):process.nextTick(t,o,e):i?(process.nextTick(r,o),i(e)):process.nextTick(r,o)})),this)},undestroy:function(){this._readableState&&(this._readableState.destroyed=!1,this._readableState.reading=!1,this._readableState.ended=!1,this._readableState.endEmitted=!1),this._writableState&&(this._writableState.destroyed=!1,this._writableState.ended=!1,this._writableState.ending=!1,this._writableState.finalCalled=!1,this._writableState.prefinished=!1,this._writableState.finished=!1,this._writableState.errorEmitted=!1)},errorOrDestroy:function(e,t){var r=e._readableState,n=e._writableState;r&&r.autoDestroy||n&&n.autoDestroy?e.destroy(t):e.emit("error",t)}}},(e,t,r)=>{"use strict";var n=r(24).q.ERR_INVALID_OPT_VALUE;e.exports={getHighWaterMark:function(e,t,r,i){var o=function(e,t,r){return null!=e.highWaterMark?e.highWaterMark:t?e[r]:null}(t,i,r);if(null!=o){if(!isFinite(o)||Math.floor(o)!==o||o<0)throw new n(i?r:"highWaterMark",o);return Math.floor(o)}return e.objectMode?16:16384}}},(e,t,r)=>{"use strict";function n(e){var t=this;this.next=null,this.entry=null,this.finish=function(){!function(e,t,r){var n=e.entry;for(e.entry=null;n;){var i=n.callback;t.pendingcb--,i(undefined),n=n.next}t.corkedRequestsFree.next=e}(t,e)}}var i;e.exports=M,M.WritableState=S;var o,a={deprecate:r(35)},s=r(245),f=r(3).Buffer,u=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},c=r(129),h=r(130).getHighWaterMark,l=r(24).q,d=l.ERR_INVALID_ARG_TYPE,p=l.ERR_METHOD_NOT_IMPLEMENTED,b=l.ERR_MULTIPLE_CALLBACK,y=l.ERR_STREAM_CANNOT_PIPE,m=l.ERR_STREAM_DESTROYED,g=l.ERR_STREAM_NULL_VALUES,_=l.ERR_STREAM_WRITE_AFTER_END,v=l.ERR_UNKNOWN_ENCODING,w=c.errorOrDestroy;function E(){}function S(e,t,o){i=i||r(30),e=e||{},"boolean"!=typeof o&&(o=t instanceof i),this.objectMode=!!e.objectMode,o&&(this.objectMode=this.objectMode||!!e.writableObjectMode),this.highWaterMark=h(this,e,"writableHighWaterMark",o),this.finalCalled=!1,this.needDrain=!1,this.ending=!1,this.ended=!1,this.finished=!1,this.destroyed=!1;var a=!1===e.decodeStrings;this.decodeStrings=!a,this.defaultEncoding=e.defaultEncoding||"utf8",this.length=0,this.writing=!1,this.corked=0,this.sync=!0,this.bufferProcessing=!1,this.onwrite=function(e){!function(e,t){var r=e._writableState,n=r.sync,i=r.writecb;if("function"!=typeof i)throw new b;if(function(e){e.writing=!1,e.writecb=null,e.length-=e.writelen,e.writelen=0}(r),t)!function(e,t,r,n,i){--t.pendingcb,r?(process.nextTick(i,n),process.nextTick(I,e,t),e._writableState.errorEmitted=!0,w(e,n)):(i(n),e._writableState.errorEmitted=!0,w(e,n),I(e,t))}(e,r,n,t,i);else{var o=O(r)||e.destroyed;o||r.corked||r.bufferProcessing||!r.bufferedRequest||R(e,r),n?process.nextTick(k,e,r,o,i):k(e,r,o,i)}}(t,e)},this.writecb=null,this.writelen=0,this.bufferedRequest=null,this.lastBufferedRequest=null,this.pendingcb=0,this.prefinished=!1,this.errorEmitted=!1,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.bufferedRequestCount=0,this.corkedRequestsFree=new n(this)}function M(e){var t=this instanceof(i=i||r(30));if(!t&&!o.call(M,this))return new M(e);this._writableState=new S(e,this,t),this.writable=!0,e&&("function"==typeof e.write&&(this._write=e.write),"function"==typeof e.writev&&(this._writev=e.writev),"function"==typeof e.destroy&&(this._destroy=e.destroy),"function"==typeof e.final&&(this._final=e.final)),s.call(this)}function A(e,t,r,n,i,o,a){t.writelen=n,t.writecb=a,t.writing=!0,t.sync=!0,t.destroyed?t.onwrite(new m("write")):r?e._writev(i,t.onwrite):e._write(i,o,t.onwrite),t.sync=!1}function k(e,t,r,n){r||function(e,t){0===t.length&&t.needDrain&&(t.needDrain=!1,e.emit("drain"))}(e,t),t.pendingcb--,n(),I(e,t)}function R(e,t){t.bufferProcessing=!0;var r=t.bufferedRequest;if(e._writev&&r&&r.next){var i=t.bufferedRequestCount,o=new Array(i),a=t.corkedRequestsFree;a.entry=r;for(var s=0,f=!0;r;)o[s]=r,r.isBuf||(f=!1),r=r.next,s+=1;o.allBuffers=f,A(e,t,!0,t.length,o,"",a.finish),t.pendingcb++,t.lastBufferedRequest=null,a.next?(t.corkedRequestsFree=a.next,a.next=null):t.corkedRequestsFree=new n(t),t.bufferedRequestCount=0}else{for(;r;){var u=r.chunk,c=r.encoding,h=r.callback;if(A(e,t,!1,t.objectMode?1:u.length,u,c,h),r=r.next,t.bufferedRequestCount--,t.writing)break}null===r&&(t.lastBufferedRequest=null)}t.bufferedRequest=r,t.bufferProcessing=!1}function O(e){return e.ending&&0===e.length&&null===e.bufferedRequest&&!e.finished&&!e.writing}function T(e,t){e._final((function(r){t.pendingcb--,r&&w(e,r),t.prefinished=!0,e.emit("prefinish"),I(e,t)}))}function I(e,t){var r=O(t);if(r&&(function(e,t){t.prefinished||t.finalCalled||("function"!=typeof e._final||t.destroyed?(t.prefinished=!0,e.emit("prefinish")):(t.pendingcb++,t.finalCalled=!0,process.nextTick(T,e,t)))}(e,t),0===t.pendingcb&&(t.finished=!0,e.emit("finish"),t.autoDestroy))){var n=e._readableState;(!n||n.autoDestroy&&n.endEmitted)&&e.destroy()}return r}r(0)(M,s),S.prototype.getBuffer=function(){for(var e=this.bufferedRequest,t=[];e;)t.push(e),e=e.next;return t},function(){try{Object.defineProperty(S.prototype,"buffer",{get:a.deprecate((function(){return this.getBuffer()}),"_writableState.buffer is deprecated. Use _writableState.getBuffer instead.","DEP0003")})}catch(e){}}(),"function"==typeof Symbol&&Symbol.hasInstance&&"function"==typeof Function.prototype[Symbol.hasInstance]?(o=Function.prototype[Symbol.hasInstance],Object.defineProperty(M,Symbol.hasInstance,{value:function(e){return!!o.call(this,e)||this===M&&e&&e._writableState instanceof S}})):o=function(e){return e instanceof this},M.prototype.pipe=function(){w(this,new y)},M.prototype.write=function(e,t,r){var n,i=this._writableState,o=!1,a=!i.objectMode&&(n=e,f.isBuffer(n)||n instanceof u);return a&&!f.isBuffer(e)&&(e=function(e){return f.from(e)}(e)),"function"==typeof t&&(r=t,t=null),a?t="buffer":t||(t=i.defaultEncoding),"function"!=typeof r&&(r=E),i.ending?function(e,t){var r=new _;w(e,r),process.nextTick(t,r)}(this,r):(a||function(e,t,r,n){var i;return null===r?i=new g:"string"==typeof r||t.objectMode||(i=new d("chunk",["string","Buffer"],r)),!i||(w(e,i),process.nextTick(n,i),!1)}(this,i,e,r))&&(i.pendingcb++,o=function(e,t,r,n,i,o){if(!r){var a=function(e,t,r){return e.objectMode||!1===e.decodeStrings||"string"!=typeof t||(t=f.from(t,r)),t}(t,n,i);n!==a&&(r=!0,i="buffer",n=a)}var s=t.objectMode?1:n.length;t.length+=s;var u=t.length-1))throw new v(e);return this._writableState.defaultEncoding=e,this},Object.defineProperty(M.prototype,"writableBuffer",{enumerable:!1,get:function(){return this._writableState&&this._writableState.getBuffer()}}),Object.defineProperty(M.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),M.prototype._write=function(e,t,r){r(new p("_write()"))},M.prototype._writev=null,M.prototype.end=function(e,t,r){var n=this._writableState;return"function"==typeof e?(r=e,e=null,t=null):"function"==typeof t&&(r=t,t=null),null!=e&&this.write(e,t),n.corked&&(n.corked=1,this.uncork()),n.ending||function(e,t,r){t.ending=!0,I(e,t),r&&(t.finished?process.nextTick(r):e.once("finish",r)),t.ended=!0,e.writable=!1}(this,n,r),this},Object.defineProperty(M.prototype,"writableLength",{enumerable:!1,get:function(){return this._writableState.length}}),Object.defineProperty(M.prototype,"destroyed",{enumerable:!1,get:function(){return void 0!==this._writableState&&this._writableState.destroyed},set:function(e){this._writableState&&(this._writableState.destroyed=e)}}),M.prototype.destroy=c.destroy,M.prototype._undestroy=c.undestroy,M.prototype._destroy=function(e,t){t(e)}},(e,t,r)=>{"use strict";e.exports=c;var n=r(24).q,i=n.ERR_METHOD_NOT_IMPLEMENTED,o=n.ERR_MULTIPLE_CALLBACK,a=n.ERR_TRANSFORM_ALREADY_TRANSFORMING,s=n.ERR_TRANSFORM_WITH_LENGTH_0,f=r(30);function u(e,t){var r=this._transformState;r.transforming=!1;var n=r.writecb;if(null===n)return this.emit("error",new o);r.writechunk=null,r.writecb=null,null!=t&&this.push(t),n(e);var i=this._readableState;i.reading=!1,(i.needReadable||i.length{"use strict";const n=t;n.bignum=r(2),n.define=r(252).define,n.base=r(255),n.constants=r(256),n.decoders=r(137),n.encoders=r(134)},(e,t,r)=>{"use strict";const n=t;n.der=r(135),n.pem=r(253)},(e,t,r)=>{"use strict";const n=r(0),i=r(67).Buffer,o=r(68),a=r(42);function s(e){this.enc="der",this.name=e.name,this.entity=e,this.tree=new f,this.tree._init(e.body)}function f(e){o.call(this,"der",e)}function u(e){return e<10?"0"+e:e}e.exports=s,s.prototype.encode=function(e,t){return this.tree._encode(e,t).join()},n(f,o),f.prototype._encodeComposite=function(e,t,r,n){const o=function(e,t,r,n){let i;if("seqof"===e?e="seq":"setof"===e&&(e="set"),a.tagByName.hasOwnProperty(e))i=a.tagByName[e];else{if("number"!=typeof e||(0|e)!==e)return n.error("Unknown tag: "+e);i=e}return i>=31?n.error("Multi-octet tag encoding unsupported"):(t||(i|=32),i|=a.tagClassByName[r||"universal"]<<6,i)}(e,t,r,this.reporter);if(n.length<128){const e=i.alloc(2);return e[0]=o,e[1]=n.length,this._createEncoderBuffer([e,n])}let s=1;for(let e=n.length;e>=256;e>>=8)s++;const f=i.alloc(2+s);f[0]=o,f[1]=128|s;for(let e=1+s,t=n.length;t>0;e--,t>>=8)f[e]=255&t;return this._createEncoderBuffer([f,n])},f.prototype._encodeStr=function(e,t){if("bitstr"===t)return this._createEncoderBuffer([0|e.unused,e.data]);if("bmpstr"===t){const t=i.alloc(2*e.length);for(let r=0;r=40)return this.reporter.error("Second objid identifier OOB");e.splice(0,2,40*e[0]+e[1])}let n=0;for(let t=0;t=128;r>>=7)n++}const o=i.alloc(n);let a=o.length-1;for(let t=e.length-1;t>=0;t--){let r=e[t];for(o[a--]=127&r;(r>>=7)>0;)o[a--]=128|127&r}return this._createEncoderBuffer(o)},f.prototype._encodeTime=function(e,t){let r;const n=new Date(e);return"gentime"===t?r=[u(n.getUTCFullYear()),u(n.getUTCMonth()+1),u(n.getUTCDate()),u(n.getUTCHours()),u(n.getUTCMinutes()),u(n.getUTCSeconds()),"Z"].join(""):"utctime"===t?r=[u(n.getUTCFullYear()%100),u(n.getUTCMonth()+1),u(n.getUTCDate()),u(n.getUTCHours()),u(n.getUTCMinutes()),u(n.getUTCSeconds()),"Z"].join(""):this.reporter.error("Encoding "+t+" time is not supported yet"),this._encodeStr(r,"octstr")},f.prototype._encodeNull=function(){return this._createEncoderBuffer("")},f.prototype._encodeInt=function(e,t){if("string"==typeof e){if(!t)return this.reporter.error("String int or enum given, but no values map");if(!t.hasOwnProperty(e))return this.reporter.error("Values map doesn't contain: "+JSON.stringify(e));e=t[e]}if("number"!=typeof e&&!i.isBuffer(e)){const t=e.toArray();!e.sign&&128&t[0]&&t.unshift(0),e=i.from(t)}if(i.isBuffer(e)){let t=e.length;0===e.length&&t++;const r=i.alloc(t);return e.copy(r),0===e.length&&(r[0]=0),this._createEncoderBuffer(r)}if(e<128)return this._createEncoderBuffer(e);if(e<256)return this._createEncoderBuffer([0,e]);let r=1;for(let t=e;t>=256;t>>=8)r++;const n=new Array(r);for(let t=n.length-1;t>=0;t--)n[t]=255&e,e>>=8;return 128&n[0]&&n.unshift(0),this._createEncoderBuffer(i.from(n))},f.prototype._encodeBool=function(e){return this._createEncoderBuffer(e?255:0)},f.prototype._use=function(e,t){return"function"==typeof e&&(e=e(t)),e._getEncoder("der").tree},f.prototype._skipDefault=function(e,t,r){const n=this._baseState;let i;if(null===n.default)return!1;const o=e.join();if(void 0===n.defaultBuffer&&(n.defaultBuffer=this._encodeValue(n.default,t,r).join()),o.length!==n.defaultBuffer.length)return!1;for(i=0;i{"use strict";const n=r(0);function i(e){this._reporterState={obj:null,path:[],options:e||{},errors:[]}}function o(e,t){this.path=e,this.rethrow(t)}t.b=i,i.prototype.isError=function(e){return e instanceof o},i.prototype.save=function(){const e=this._reporterState;return{obj:e.obj,pathLen:e.path.length}},i.prototype.restore=function(e){const t=this._reporterState;t.obj=e.obj,t.path=t.path.slice(0,e.pathLen)},i.prototype.enterKey=function(e){return this._reporterState.path.push(e)},i.prototype.exitKey=function(e){const t=this._reporterState;t.path=t.path.slice(0,e-1)},i.prototype.leaveKey=function(e,t,r){const n=this._reporterState;this.exitKey(e),null!==n.obj&&(n.obj[t]=r)},i.prototype.path=function(){return this._reporterState.path.join("/")},i.prototype.enterObject=function(){const e=this._reporterState,t=e.obj;return e.obj={},t},i.prototype.leaveObject=function(e){const t=this._reporterState,r=t.obj;return t.obj=e,r},i.prototype.error=function(e){let t;const r=this._reporterState,n=e instanceof o;if(t=n?e:new o(r.path.map((function(e){return"["+JSON.stringify(e)+"]"})).join(""),e.message||e,e.stack),!r.options.partial)throw t;return n||r.errors.push(t),t},i.prototype.wrapResult=function(e){const t=this._reporterState;return t.options.partial?{result:this.isError(e)?null:e,errors:t.errors}:e},n(o,Error),o.prototype.rethrow=function(e){if(this.message=e+" at: "+(this.path||"(shallow)"),Error.captureStackTrace&&Error.captureStackTrace(this,o),!this.stack)try{throw new Error(this.message)}catch(e){this.stack=e.stack}return this}},(e,t,r)=>{"use strict";const n=t;n.der=r(138),n.pem=r(254)},(e,t,r)=>{"use strict";const n=r(0),i=r(2),o=r(70).C,a=r(68),s=r(42);function f(e){this.enc="der",this.name=e.name,this.entity=e,this.tree=new u,this.tree._init(e.body)}function u(e){a.call(this,"der",e)}function c(e,t){let r=e.readUInt8(t);if(e.isError(r))return r;const n=s.tagClass[r>>6],i=0==(32&r);if(31==(31&r)){let n=r;for(r=0;128==(128&n);){if(n=e.readUInt8(t),e.isError(n))return n;r<<=7,r|=127&n}}else r&=31;return{cls:n,primitive:i,tag:r,tagStr:s.tag[r]}}function h(e,t,r){let n=e.readUInt8(r);if(e.isError(n))return n;if(!t&&128===n)return null;if(0==(128&n))return n;const i=127&n;if(i>4)return e.error("length octect is too long");n=0;for(let t=0;t{var n=r(13),i=r(1).Buffer;function o(e){var t=i.allocUnsafe(4);return t.writeUInt32BE(e,0),t}e.exports=function(e,t){for(var r,a=i.alloc(0),s=0;a.length{e.exports=function(e,t){for(var r=e.length,n=-1;++n{var n=r(2),i=r(1).Buffer;e.exports=function(e,t){return i.from(e.toRed(n.mont(t.modulus)).redPow(new n(t.publicExponent)).fromRed().toArray())}},(e,t,r)=>{const n=r(61),i=2147483647;function o(e,t,r,n,i,o,a){let c;for(u(e,t+64*(2*n-1),i,0,64),c=0;c<2*n;c++)f(e,64*c,i,0,64),s(i,o,a),u(i,0,e,r+64*c,64);for(c=0;c>>32-t}function s(e,t,r){let n;for(n=0;n<16;n++)t[n]=(255&e[4*n+0])<<0,t[n]|=(255&e[4*n+1])<<8,t[n]|=(255&e[4*n+2])<<16,t[n]|=(255&e[4*n+3])<<24;for(u(t,0,r,0,16),n=8;n>0;n-=2)r[4]^=a(r[0]+r[12],7),r[8]^=a(r[4]+r[0],9),r[12]^=a(r[8]+r[4],13),r[0]^=a(r[12]+r[8],18),r[9]^=a(r[5]+r[1],7),r[13]^=a(r[9]+r[5],9),r[1]^=a(r[13]+r[9],13),r[5]^=a(r[1]+r[13],18),r[14]^=a(r[10]+r[6],7),r[2]^=a(r[14]+r[10],9),r[6]^=a(r[2]+r[14],13),r[10]^=a(r[6]+r[2],18),r[3]^=a(r[15]+r[11],7),r[7]^=a(r[3]+r[15],9),r[11]^=a(r[7]+r[3],13),r[15]^=a(r[11]+r[7],18),r[1]^=a(r[0]+r[3],7),r[2]^=a(r[1]+r[0],9),r[3]^=a(r[2]+r[1],13),r[0]^=a(r[3]+r[2],18),r[6]^=a(r[5]+r[4],7),r[7]^=a(r[6]+r[5],9),r[4]^=a(r[7]+r[6],13),r[5]^=a(r[4]+r[7],18),r[11]^=a(r[10]+r[9],7),r[8]^=a(r[11]+r[10],9),r[9]^=a(r[8]+r[11],13),r[10]^=a(r[9]+r[8],18),r[12]^=a(r[15]+r[14],7),r[13]^=a(r[12]+r[15],9),r[14]^=a(r[13]+r[12],13),r[15]^=a(r[14]+r[13],18);for(n=0;n<16;++n)t[n]=r[n]+t[n];for(n=0;n<16;n++){let r=4*n;e[r+0]=t[n]>>0&255,e[r+1]=t[n]>>8&255,e[r+2]=t[n]>>16&255,e[r+3]=t[n]>>24&255}}function f(e,t,r,n,i){for(let o=0;o 0 and a power of 2");if(r>i/128/o)throw Error("Parameter N is too large");if(o>i/128/a)throw Error("Parameter r is too large");let u,c=Buffer.alloc(256*o),h=Buffer.alloc(128*o*r),l=new Int32Array(16),d=new Int32Array(16),p=Buffer.alloc(64),b=n.pbkdf2Sync(e,t,1,128*a*o,"sha256");if(f){let e=a*r*2,t=0;u=function(){++t,t%1e3==0&&f({current:t,total:e,percent:t/e*100})}}return{XY:c,V:h,B32:l,x:d,_X:p,B:b,tickCallback:u}},smix:async function(e,t,r,n,i,a,s,u,c,h,l){l=l||5e3;let d,p=128*r;for(e.copy(a,0,t,t+p),d=0;dsetImmediate(e))),o(a,0,p,r,s,u,c),h&&h();for(d=0;dsetImmediate(e))),o(a,0,p,r,s,u,c),h&&h()}a.copy(e,t,0,0+p)},smixSync:function(e,t,r,n,i,a,s,u,c,h){let l,d=128*r;for(e.copy(a,0,t,t+d),l=0;l{"use strict";var n;e.exports=M,M.ReadableState=S,r(10).EventEmitter;var i,o=function(e,t){return e.listeners(t).length},a=r(279),s=r(3).Buffer,f=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},u=r(335);i=u&&u.debuglog?u.debuglog("stream"):function(){};var c,h,l,d=r(280),p=r(144),b=r(145).getHighWaterMark,y=r(25).q,m=y.ERR_INVALID_ARG_TYPE,g=y.ERR_STREAM_PUSH_AFTER_EOF,_=y.ERR_METHOD_NOT_IMPLEMENTED,v=y.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;r(0)(M,a);var w=p.errorOrDestroy,E=["error","close","destroy","pause","resume"];function S(e,t,i){n=n||r(31),e=e||{},"boolean"!=typeof i&&(i=t instanceof n),this.objectMode=!!e.objectMode,i&&(this.objectMode=this.objectMode||!!e.readableObjectMode),this.highWaterMark=b(this,e,"readableHighWaterMark",i),this.buffer=new d,this.length=0,this.pipes=null,this.pipesCount=0,this.flowing=null,this.ended=!1,this.endEmitted=!1,this.reading=!1,this.sync=!0,this.needReadable=!1,this.emittedReadable=!1,this.readableListening=!1,this.resumeScheduled=!1,this.paused=!0,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.destroyed=!1,this.defaultEncoding=e.defaultEncoding||"utf8",this.awaitDrain=0,this.readingMore=!1,this.decoder=null,this.encoding=null,e.encoding&&(c||(c=r(27).s),this.decoder=new c(e.encoding),this.encoding=e.encoding)}function M(e){if(n=n||r(31),!(this instanceof M))return new M(e);var t=this instanceof n;this._readableState=new S(e,this,t),this.readable=!0,e&&("function"==typeof e.read&&(this._read=e.read),"function"==typeof e.destroy&&(this._destroy=e.destroy)),a.call(this)}function A(e,t,r,n,o){i("readableAddChunk",t);var a,u=e._readableState;if(null===t)u.reading=!1,function(e,t){if(i("onEofChunk"),!t.ended){if(t.decoder){var r=t.decoder.end();r&&r.length&&(t.buffer.push(r),t.length+=t.objectMode?1:r.length)}t.ended=!0,t.sync?T(e):(t.needReadable=!1,t.emittedReadable||(t.emittedReadable=!0,I(e)))}}(e,u);else if(o||(a=function(e,t){var r,n;return n=t,s.isBuffer(n)||n instanceof f||"string"==typeof t||void 0===t||e.objectMode||(r=new m("chunk",["string","Buffer","Uint8Array"],t)),r}(u,t)),a)w(e,a);else if(u.objectMode||t&&t.length>0)if("string"==typeof t||u.objectMode||Object.getPrototypeOf(t)===s.prototype||(t=function(e){return s.from(e)}(t)),n)u.endEmitted?w(e,new v):k(e,u,t,!0);else if(u.ended)w(e,new g);else{if(u.destroyed)return!1;u.reading=!1,u.decoder&&!r?(t=u.decoder.write(t),u.objectMode||0!==t.length?k(e,u,t,!1):x(e,u)):k(e,u,t,!1)}else n||(u.reading=!1,x(e,u));return!u.ended&&(u.lengtht.highWaterMark&&(t.highWaterMark=function(e){return e>=R?e=R:(e--,e|=e>>>1,e|=e>>>2,e|=e>>>4,e|=e>>>8,e|=e>>>16,e++),e}(e)),e<=t.length?e:t.ended?t.length:(t.needReadable=!0,0))}function T(e){var t=e._readableState;i("emitReadable",t.needReadable,t.emittedReadable),t.needReadable=!1,t.emittedReadable||(i("emitReadable",t.flowing),t.emittedReadable=!0,process.nextTick(I,e))}function I(e){var t=e._readableState;i("emitReadable_",t.destroyed,t.length,t.ended),t.destroyed||!t.length&&!t.ended||(e.emit("readable"),t.emittedReadable=!1),t.needReadable=!t.flowing&&!t.ended&&t.length<=t.highWaterMark,N(e)}function x(e,t){t.readingMore||(t.readingMore=!0,process.nextTick(B,e,t))}function B(e,t){for(;!t.reading&&!t.ended&&(t.length0,t.resumeScheduled&&!t.paused?t.flowing=!0:e.listenerCount("data")>0&&e.resume()}function L(e){i("readable nexttick read 0"),e.read(0)}function P(e,t){i("resume",t.reading),t.reading||e.read(0),t.resumeScheduled=!1,e.emit("resume"),N(e),t.flowing&&!t.reading&&e.read(0)}function N(e){var t=e._readableState;for(i("flow",t.flowing);t.flowing&&null!==e.read(););}function D(e,t){return 0===t.length?null:(t.objectMode?r=t.buffer.shift():!e||e>=t.length?(r=t.decoder?t.buffer.join(""):1===t.buffer.length?t.buffer.first():t.buffer.concat(t.length),t.buffer.clear()):r=t.buffer.consume(e,t.decoder),r);var r}function C(e){var t=e._readableState;i("endReadable",t.endEmitted),t.endEmitted||(t.ended=!0,process.nextTick(U,t,e))}function U(e,t){if(i("endReadableNT",e.endEmitted,e.length),!e.endEmitted&&0===e.length&&(e.endEmitted=!0,t.readable=!1,t.emit("end"),e.autoDestroy)){var r=t._writableState;(!r||r.autoDestroy&&r.finished)&&t.destroy()}}function q(e,t){for(var r=0,n=e.length;r=t.highWaterMark:t.length>0)||t.ended))return i("read: emitReadable",t.length,t.ended),0===t.length&&t.ended?C(this):T(this),null;if(0===(e=O(e,t))&&t.ended)return 0===t.length&&C(this),null;var n,o=t.needReadable;return i("need readable",o),(0===t.length||t.length-e0?D(e,t):null)?(t.needReadable=t.length<=t.highWaterMark,e=0):(t.length-=e,t.awaitDrain=0),0===t.length&&(t.ended||(t.needReadable=!0),r!==e&&t.ended&&C(this)),null!==n&&this.emit("data",n),n},M.prototype._read=function(e){w(this,new _("_read()"))},M.prototype.pipe=function(e,t){var r=this,n=this._readableState;switch(n.pipesCount){case 0:n.pipes=e;break;case 1:n.pipes=[n.pipes,e];break;default:n.pipes.push(e)}n.pipesCount+=1,i("pipe count=%d opts=%j",n.pipesCount,t);var a=t&&!1===t.end||e===process.stdout||e===process.stderr?p:s;function s(){i("onend"),e.end()}n.endEmitted?process.nextTick(a):r.once("end",a),e.on("unpipe",(function t(o,a){i("onunpipe"),o===r&&a&&!1===a.hasUnpiped&&(a.hasUnpiped=!0,i("cleanup"),e.removeListener("close",l),e.removeListener("finish",d),e.removeListener("drain",f),e.removeListener("error",h),e.removeListener("unpipe",t),r.removeListener("end",s),r.removeListener("end",p),r.removeListener("data",c),u=!0,!n.awaitDrain||e._writableState&&!e._writableState.needDrain||f())}));var f=function(e){return function(){var t=e._readableState;i("pipeOnDrain",t.awaitDrain),t.awaitDrain&&t.awaitDrain--,0===t.awaitDrain&&o(e,"data")&&(t.flowing=!0,N(e))}}(r);e.on("drain",f);var u=!1;function c(t){i("ondata");var o=e.write(t);i("dest.write",o),!1===o&&((1===n.pipesCount&&n.pipes===e||n.pipesCount>1&&-1!==q(n.pipes,e))&&!u&&(i("false write response, pause",n.awaitDrain),n.awaitDrain++),r.pause())}function h(t){i("onerror",t),p(),e.removeListener("error",h),0===o(e,"error")&&w(e,t)}function l(){e.removeListener("finish",d),p()}function d(){i("onfinish"),e.removeListener("close",l),p()}function p(){i("unpipe"),r.unpipe(e)}return r.on("data",c),function(e,t,r){if("function"==typeof e.prependListener)return e.prependListener(t,r);e._events&&e._events[t]?Array.isArray(e._events[t])?e._events[t].unshift(r):e._events[t]=[r,e._events[t]]:e.on(t,r)}(e,"error",h),e.once("close",l),e.once("finish",d),e.emit("pipe",r),n.flowing||(i("pipe resume"),r.resume()),e},M.prototype.unpipe=function(e){var t=this._readableState,r={hasUnpiped:!1};if(0===t.pipesCount)return this;if(1===t.pipesCount)return e&&e!==t.pipes||(e||(e=t.pipes),t.pipes=null,t.pipesCount=0,t.flowing=!1,e&&e.emit("unpipe",this,r)),this;if(!e){var n=t.pipes,i=t.pipesCount;t.pipes=null,t.pipesCount=0,t.flowing=!1;for(var o=0;o0,!1!==n.flowing&&this.resume()):"readable"===e&&(n.endEmitted||n.readableListening||(n.readableListening=n.needReadable=!0,n.flowing=!1,n.emittedReadable=!1,i("on readable",n.length,n.reading),n.length?T(this):n.reading||process.nextTick(L,this))),r},M.prototype.addListener=M.prototype.on,M.prototype.removeListener=function(e,t){var r=a.prototype.removeListener.call(this,e,t);return"readable"===e&&process.nextTick(j,this),r},M.prototype.removeAllListeners=function(e){var t=a.prototype.removeAllListeners.apply(this,arguments);return"readable"!==e&&void 0!==e||process.nextTick(j,this),t},M.prototype.resume=function(){var e=this._readableState;return e.flowing||(i("resume"),e.flowing=!e.readableListening,function(e,t){t.resumeScheduled||(t.resumeScheduled=!0,process.nextTick(P,e,t))}(this,e)),e.paused=!1,this},M.prototype.pause=function(){return i("call pause flowing=%j",this._readableState.flowing),!1!==this._readableState.flowing&&(i("pause"),this._readableState.flowing=!1,this.emit("pause")),this._readableState.paused=!0,this},M.prototype.wrap=function(e){var t=this,r=this._readableState,n=!1;for(var o in e.on("end",(function(){if(i("wrapped end"),r.decoder&&!r.ended){var e=r.decoder.end();e&&e.length&&t.push(e)}t.push(null)})),e.on("data",(function(o){i("wrapped data"),r.decoder&&(o=r.decoder.write(o)),r.objectMode&&null==o||(r.objectMode||o&&o.length)&&(t.push(o)||(n=!0,e.pause()))})),e)void 0===this[o]&&"function"==typeof e[o]&&(this[o]=function(t){return function(){return e[t].apply(e,arguments)}}(o));for(var a=0;a{"use strict";function t(e,t){n(e,t),r(e)}function r(e){e._writableState&&!e._writableState.emitClose||e._readableState&&!e._readableState.emitClose||e.emit("close")}function n(e,t){e.emit("error",t)}e.exports={destroy:function(e,i){var o=this,a=this._readableState&&this._readableState.destroyed,s=this._writableState&&this._writableState.destroyed;return a||s?(i?i(e):e&&(this._writableState?this._writableState.errorEmitted||(this._writableState.errorEmitted=!0,process.nextTick(n,this,e)):process.nextTick(n,this,e)),this):(this._readableState&&(this._readableState.destroyed=!0),this._writableState&&(this._writableState.destroyed=!0),this._destroy(e||null,(function(e){!i&&e?o._writableState?o._writableState.errorEmitted?process.nextTick(r,o):(o._writableState.errorEmitted=!0,process.nextTick(t,o,e)):process.nextTick(t,o,e):i?(process.nextTick(r,o),i(e)):process.nextTick(r,o)})),this)},undestroy:function(){this._readableState&&(this._readableState.destroyed=!1,this._readableState.reading=!1,this._readableState.ended=!1,this._readableState.endEmitted=!1),this._writableState&&(this._writableState.destroyed=!1,this._writableState.ended=!1,this._writableState.ending=!1,this._writableState.finalCalled=!1,this._writableState.prefinished=!1,this._writableState.finished=!1,this._writableState.errorEmitted=!1)},errorOrDestroy:function(e,t){var r=e._readableState,n=e._writableState;r&&r.autoDestroy||n&&n.autoDestroy?e.destroy(t):e.emit("error",t)}}},(e,t,r)=>{"use strict";var n=r(25).q.ERR_INVALID_OPT_VALUE;e.exports={getHighWaterMark:function(e,t,r,i){var o=function(e,t,r){return null!=e.highWaterMark?e.highWaterMark:t?e[r]:null}(t,i,r);if(null!=o){if(!isFinite(o)||Math.floor(o)!==o||o<0)throw new n(i?r:"highWaterMark",o);return Math.floor(o)}return e.objectMode?16:16384}}},(e,t,r)=>{"use strict";function n(e){var t=this;this.next=null,this.entry=null,this.finish=function(){!function(e,t,r){var n=e.entry;for(e.entry=null;n;){var i=n.callback;t.pendingcb--,i(undefined),n=n.next}t.corkedRequestsFree.next=e}(t,e)}}var i;e.exports=M,M.WritableState=S;var o,a={deprecate:r(35)},s=r(279),f=r(3).Buffer,u=(void 0!==r.g?r.g:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{}).Uint8Array||function(){},c=r(144),h=r(145).getHighWaterMark,l=r(25).q,d=l.ERR_INVALID_ARG_TYPE,p=l.ERR_METHOD_NOT_IMPLEMENTED,b=l.ERR_MULTIPLE_CALLBACK,y=l.ERR_STREAM_CANNOT_PIPE,m=l.ERR_STREAM_DESTROYED,g=l.ERR_STREAM_NULL_VALUES,_=l.ERR_STREAM_WRITE_AFTER_END,v=l.ERR_UNKNOWN_ENCODING,w=c.errorOrDestroy;function E(){}function S(e,t,o){i=i||r(31),e=e||{},"boolean"!=typeof o&&(o=t instanceof i),this.objectMode=!!e.objectMode,o&&(this.objectMode=this.objectMode||!!e.writableObjectMode),this.highWaterMark=h(this,e,"writableHighWaterMark",o),this.finalCalled=!1,this.needDrain=!1,this.ending=!1,this.ended=!1,this.finished=!1,this.destroyed=!1;var a=!1===e.decodeStrings;this.decodeStrings=!a,this.defaultEncoding=e.defaultEncoding||"utf8",this.length=0,this.writing=!1,this.corked=0,this.sync=!0,this.bufferProcessing=!1,this.onwrite=function(e){!function(e,t){var r=e._writableState,n=r.sync,i=r.writecb;if("function"!=typeof i)throw new b;if(function(e){e.writing=!1,e.writecb=null,e.length-=e.writelen,e.writelen=0}(r),t)!function(e,t,r,n,i){--t.pendingcb,r?(process.nextTick(i,n),process.nextTick(I,e,t),e._writableState.errorEmitted=!0,w(e,n)):(i(n),e._writableState.errorEmitted=!0,w(e,n),I(e,t))}(e,r,n,t,i);else{var o=O(r)||e.destroyed;o||r.corked||r.bufferProcessing||!r.bufferedRequest||R(e,r),n?process.nextTick(k,e,r,o,i):k(e,r,o,i)}}(t,e)},this.writecb=null,this.writelen=0,this.bufferedRequest=null,this.lastBufferedRequest=null,this.pendingcb=0,this.prefinished=!1,this.errorEmitted=!1,this.emitClose=!1!==e.emitClose,this.autoDestroy=!!e.autoDestroy,this.bufferedRequestCount=0,this.corkedRequestsFree=new n(this)}function M(e){var t=this instanceof(i=i||r(31));if(!t&&!o.call(M,this))return new M(e);this._writableState=new S(e,this,t),this.writable=!0,e&&("function"==typeof e.write&&(this._write=e.write),"function"==typeof e.writev&&(this._writev=e.writev),"function"==typeof e.destroy&&(this._destroy=e.destroy),"function"==typeof e.final&&(this._final=e.final)),s.call(this)}function A(e,t,r,n,i,o,a){t.writelen=n,t.writecb=a,t.writing=!0,t.sync=!0,t.destroyed?t.onwrite(new m("write")):r?e._writev(i,t.onwrite):e._write(i,o,t.onwrite),t.sync=!1}function k(e,t,r,n){r||function(e,t){0===t.length&&t.needDrain&&(t.needDrain=!1,e.emit("drain"))}(e,t),t.pendingcb--,n(),I(e,t)}function R(e,t){t.bufferProcessing=!0;var r=t.bufferedRequest;if(e._writev&&r&&r.next){var i=t.bufferedRequestCount,o=new Array(i),a=t.corkedRequestsFree;a.entry=r;for(var s=0,f=!0;r;)o[s]=r,r.isBuf||(f=!1),r=r.next,s+=1;o.allBuffers=f,A(e,t,!0,t.length,o,"",a.finish),t.pendingcb++,t.lastBufferedRequest=null,a.next?(t.corkedRequestsFree=a.next,a.next=null):t.corkedRequestsFree=new n(t),t.bufferedRequestCount=0}else{for(;r;){var u=r.chunk,c=r.encoding,h=r.callback;if(A(e,t,!1,t.objectMode?1:u.length,u,c,h),r=r.next,t.bufferedRequestCount--,t.writing)break}null===r&&(t.lastBufferedRequest=null)}t.bufferedRequest=r,t.bufferProcessing=!1}function O(e){return e.ending&&0===e.length&&null===e.bufferedRequest&&!e.finished&&!e.writing}function T(e,t){e._final((function(r){t.pendingcb--,r&&w(e,r),t.prefinished=!0,e.emit("prefinish"),I(e,t)}))}function I(e,t){var r=O(t);if(r&&(function(e,t){t.prefinished||t.finalCalled||("function"!=typeof e._final||t.destroyed?(t.prefinished=!0,e.emit("prefinish")):(t.pendingcb++,t.finalCalled=!0,process.nextTick(T,e,t)))}(e,t),0===t.pendingcb&&(t.finished=!0,e.emit("finish"),t.autoDestroy))){var n=e._readableState;(!n||n.autoDestroy&&n.endEmitted)&&e.destroy()}return r}r(0)(M,s),S.prototype.getBuffer=function(){for(var e=this.bufferedRequest,t=[];e;)t.push(e),e=e.next;return t},function(){try{Object.defineProperty(S.prototype,"buffer",{get:a.deprecate((function(){return this.getBuffer()}),"_writableState.buffer is deprecated. Use _writableState.getBuffer instead.","DEP0003")})}catch(e){}}(),"function"==typeof Symbol&&Symbol.hasInstance&&"function"==typeof Function.prototype[Symbol.hasInstance]?(o=Function.prototype[Symbol.hasInstance],Object.defineProperty(M,Symbol.hasInstance,{value:function(e){return!!o.call(this,e)||this===M&&e&&e._writableState instanceof S}})):o=function(e){return e instanceof this},M.prototype.pipe=function(){w(this,new y)},M.prototype.write=function(e,t,r){var n,i=this._writableState,o=!1,a=!i.objectMode&&(n=e,f.isBuffer(n)||n instanceof u);return a&&!f.isBuffer(e)&&(e=function(e){return f.from(e)}(e)),"function"==typeof t&&(r=t,t=null),a?t="buffer":t||(t=i.defaultEncoding),"function"!=typeof r&&(r=E),i.ending?function(e,t){var r=new _;w(e,r),process.nextTick(t,r)}(this,r):(a||function(e,t,r,n){var i;return null===r?i=new g:"string"==typeof r||t.objectMode||(i=new d("chunk",["string","Buffer"],r)),!i||(w(e,i),process.nextTick(n,i),!1)}(this,i,e,r))&&(i.pendingcb++,o=function(e,t,r,n,i,o){if(!r){var a=function(e,t,r){return e.objectMode||!1===e.decodeStrings||"string"!=typeof t||(t=f.from(t,r)),t}(t,n,i);n!==a&&(r=!0,i="buffer",n=a)}var s=t.objectMode?1:n.length;t.length+=s;var u=t.length-1))throw new v(e);return this._writableState.defaultEncoding=e,this},Object.defineProperty(M.prototype,"writableBuffer",{enumerable:!1,get:function(){return this._writableState&&this._writableState.getBuffer()}}),Object.defineProperty(M.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),M.prototype._write=function(e,t,r){r(new p("_write()"))},M.prototype._writev=null,M.prototype.end=function(e,t,r){var n=this._writableState;return"function"==typeof e?(r=e,e=null,t=null):"function"==typeof t&&(r=t,t=null),null!=e&&this.write(e,t),n.corked&&(n.corked=1,this.uncork()),n.ending||function(e,t,r){t.ending=!0,I(e,t),r&&(t.finished?process.nextTick(r):e.once("finish",r)),t.ended=!0,e.writable=!1}(this,n,r),this},Object.defineProperty(M.prototype,"writableLength",{enumerable:!1,get:function(){return this._writableState.length}}),Object.defineProperty(M.prototype,"destroyed",{enumerable:!1,get:function(){return void 0!==this._writableState&&this._writableState.destroyed},set:function(e){this._writableState&&(this._writableState.destroyed=e)}}),M.prototype.destroy=c.destroy,M.prototype._undestroy=c.undestroy,M.prototype._destroy=function(e,t){t(e)}},(e,t,r)=>{"use strict";e.exports=c;var n=r(25).q,i=n.ERR_METHOD_NOT_IMPLEMENTED,o=n.ERR_MULTIPLE_CALLBACK,a=n.ERR_TRANSFORM_ALREADY_TRANSFORMING,s=n.ERR_TRANSFORM_WITH_LENGTH_0,f=r(31);function u(e,t){var r=this._transformState;r.transforming=!1;var n=r.writecb;if(null===n)return this.emit("error",new o);r.writechunk=null,r.writecb=null,null!=t&&this.push(t),n(e);var i=this._readableState;i.reading=!1,(i.needReadable||i.length{"use strict";var n=r(297);e.exports=t=n.descriptor=n.Root.fromJSON(r(299)).lookup(".google.protobuf");var i=n.Namespace,o=n.Root,a=n.Enum,s=n.Type,f=n.Field,u=n.MapField,c=n.OneOf,h=n.Service,l=n.Method;function d(e,r,n){var u=t.FileDescriptorProto.create({name:e.filename||(e.fullName.substring(1).replace(/\./g,"_")||"root")+".proto"});n&&(u.syntax=n),e instanceof o||(u.package=e.fullName.substring(1));for(var c,l=0;l{"use strict";const n=r(287),i=r(288),o=r(289),a=r(290),s=Symbol("encodeFragmentIdentifier");function f(e){if("string"!=typeof e||1!==e.length)throw new TypeError("arrayFormatSeparator must be single character string")}function u(e,t){return t.encode?t.strict?n(e):encodeURIComponent(e):e}function c(e,t){return t.decode?i(e):e}function h(e){return Array.isArray(e)?e.sort():"object"==typeof e?h(Object.keys(e)).sort(((e,t)=>Number(e)-Number(t))).map((t=>e[t])):e}function l(e){const t=e.indexOf("#");return-1!==t&&(e=e.slice(0,t)),e}function d(e){const t=(e=l(e)).indexOf("?");return-1===t?"":e.slice(t+1)}function p(e,t){return t.parseNumbers&&!Number.isNaN(Number(e))&&"string"==typeof e&&""!==e.trim()?e=Number(e):!t.parseBooleans||null===e||"true"!==e.toLowerCase()&&"false"!==e.toLowerCase()||(e="true"===e.toLowerCase()),e}function b(e,t){f((t=Object.assign({decode:!0,sort:!0,arrayFormat:"none",arrayFormatSeparator:",",parseNumbers:!1,parseBooleans:!1},t)).arrayFormatSeparator);const r=function(e){let t;switch(e.arrayFormat){case"index":return(e,r,n)=>{t=/\[(\d*)\]$/.exec(e),e=e.replace(/\[\d*\]$/,""),t?(void 0===n[e]&&(n[e]={}),n[e][t[1]]=r):n[e]=r};case"bracket":return(e,r,n)=>{t=/(\[\])$/.exec(e),e=e.replace(/\[\]$/,""),t?void 0!==n[e]?n[e]=[].concat(n[e],r):n[e]=[r]:n[e]=r};case"colon-list-separator":return(e,r,n)=>{t=/(:list)$/.exec(e),e=e.replace(/:list$/,""),t?void 0!==n[e]?n[e]=[].concat(n[e],r):n[e]=[r]:n[e]=r};case"comma":case"separator":return(t,r,n)=>{const i="string"==typeof r&&r.includes(e.arrayFormatSeparator),o="string"==typeof r&&!i&&c(r,e).includes(e.arrayFormatSeparator);r=o?c(r,e):r;const a=i||o?r.split(e.arrayFormatSeparator).map((t=>c(t,e))):null===r?r:c(r,e);n[t]=a};case"bracket-separator":return(t,r,n)=>{const i=/(\[\])$/.test(t);if(t=t.replace(/\[\]$/,""),!i)return void(n[t]=r?c(r,e):r);const o=null===r?[]:r.split(e.arrayFormatSeparator).map((t=>c(t,e)));void 0!==n[t]?n[t]=[].concat(n[t],o):n[t]=o};default:return(e,t,r)=>{void 0!==r[e]?r[e]=[].concat(r[e],t):r[e]=t}}}(t),n=Object.create(null);if("string"!=typeof e)return n;if(!(e=e.trim().replace(/^[?#&]/,"")))return n;for(const i of e.split("&")){if(""===i)continue;let[e,a]=o(t.decode?i.replace(/\+/g," "):i,"=");a=void 0===a?null:["comma","separator","bracket-separator"].includes(t.arrayFormat)?a:c(a,t),r(c(e,t),a,n)}for(const e of Object.keys(n)){const r=n[e];if("object"==typeof r&&null!==r)for(const e of Object.keys(r))r[e]=p(r[e],t);else n[e]=p(r,t)}return!1===t.sort?n:(!0===t.sort?Object.keys(n).sort():Object.keys(n).sort(t.sort)).reduce(((e,t)=>{const r=n[t];return Boolean(r)&&"object"==typeof r&&!Array.isArray(r)?e[t]=h(r):e[t]=r,e}),Object.create(null))}t.extract=d,t.parse=b,t.stringify=(e,t)=>{if(!e)return"";f((t=Object.assign({encode:!0,strict:!0,arrayFormat:"none",arrayFormatSeparator:","},t)).arrayFormatSeparator);const r=r=>t.skipNull&&null==e[r]||t.skipEmptyString&&""===e[r],n=function(e){switch(e.arrayFormat){case"index":return t=>(r,n)=>{const i=r.length;return void 0===n||e.skipNull&&null===n||e.skipEmptyString&&""===n?r:null===n?[...r,[u(t,e),"[",i,"]"].join("")]:[...r,[u(t,e),"[",u(i,e),"]=",u(n,e)].join("")]};case"bracket":return t=>(r,n)=>void 0===n||e.skipNull&&null===n||e.skipEmptyString&&""===n?r:null===n?[...r,[u(t,e),"[]"].join("")]:[...r,[u(t,e),"[]=",u(n,e)].join("")];case"colon-list-separator":return t=>(r,n)=>void 0===n||e.skipNull&&null===n||e.skipEmptyString&&""===n?r:null===n?[...r,[u(t,e),":list="].join("")]:[...r,[u(t,e),":list=",u(n,e)].join("")];case"comma":case"separator":case"bracket-separator":{const t="bracket-separator"===e.arrayFormat?"[]=":"=";return r=>(n,i)=>void 0===i||e.skipNull&&null===i||e.skipEmptyString&&""===i?n:(i=null===i?"":i,0===n.length?[[u(r,e),t,u(i,e)].join("")]:[[n,u(i,e)].join(e.arrayFormatSeparator)])}default:return t=>(r,n)=>void 0===n||e.skipNull&&null===n||e.skipEmptyString&&""===n?r:null===n?[...r,u(t,e)]:[...r,[u(t,e),"=",u(n,e)].join("")]}}(t),i={};for(const t of Object.keys(e))r(t)||(i[t]=e[t]);const o=Object.keys(i);return!1!==t.sort&&o.sort(t.sort),o.map((r=>{const i=e[r];return void 0===i?"":null===i?u(r,t):Array.isArray(i)?0===i.length&&"bracket-separator"===t.arrayFormat?u(r,t)+"[]":i.reduce(n(r),[]).join("&"):u(r,t)+"="+u(i,t)})).filter((e=>e.length>0)).join("&")},t.parseUrl=(e,t)=>{t=Object.assign({decode:!0},t);const[r,n]=o(e,"#");return Object.assign({url:r.split("?")[0]||"",query:b(d(e),t)},t&&t.parseFragmentIdentifier&&n?{fragmentIdentifier:c(n,t)}:{})},t.stringifyUrl=(e,r)=>{r=Object.assign({encode:!0,strict:!0,[s]:!0},r);const n=l(e.url).split("?")[0]||"",i=t.extract(e.url),o=t.parse(i,{sort:!1}),a=Object.assign(o,e.query);let f=t.stringify(a,r);f&&(f=`?${f}`);let c=function(e){let t="";const r=e.indexOf("#");return-1!==r&&(t=e.slice(r)),t}(e.url);return e.fragmentIdentifier&&(c=`#${r[s]?u(e.fragmentIdentifier,r):e.fragmentIdentifier}`),`${n}${f}${c}`},t.pick=(e,r,n)=>{n=Object.assign({parseFragmentIdentifier:!0,[s]:!1},n);const{url:i,query:o,fragmentIdentifier:f}=t.parseUrl(e,n);return t.stringifyUrl({url:i,query:a(o,r),fragmentIdentifier:f},n)},t.exclude=(e,r,n)=>{const i=Array.isArray(r)?e=>!r.includes(e):(e,t)=>!r(e,t);return t.pick(e,i,n)}},(e,t,r)=>{(t=e.exports=r(91)).Stream=t,t.Readable=t,t.Writable=r(94),t.Duplex=r(28),t.Transform=r(95),t.PassThrough=r(201),t.finished=r(55),t.pipeline=r(202)},(e,t,r)=>{(t=e.exports=r(128)).Stream=t,t.Readable=t,t.Writable=r(131),t.Duplex=r(30),t.Transform=r(132),t.PassThrough=r(249),t.finished=r(65),t.pipeline=r(250)},function(e,t,r){var n;e.exports=(n=r(11),r(153),r(154),r(71),r(157),function(){var e=n,t=e.lib.BlockCipher,r=e.algo,i=[],o=[],a=[],s=[],f=[],u=[],c=[],h=[],l=[],d=[];!function(){for(var e=[],t=0;t<256;t++)e[t]=t<128?t<<1:t<<1^283;var r=0,n=0;for(t=0;t<256;t++){var p=n^n<<1^n<<2^n<<3^n<<4;p=p>>>8^255&p^99,i[r]=p,o[p]=r;var b=e[r],y=e[b],m=e[y],g=257*e[p]^16843008*p;a[r]=g<<24|g>>>8,s[r]=g<<16|g>>>16,f[r]=g<<8|g>>>24,u[r]=g,g=16843009*m^65537*y^257*b^16843008*r,c[p]=g<<24|g>>>8,h[p]=g<<16|g>>>16,l[p]=g<<8|g>>>24,d[p]=g,r?(r=b^e[e[e[m^b]]],n^=e[e[n]]):r=n=1}}();var p=[0,1,2,4,8,16,32,64,128,27,54],b=r.AES=t.extend({_doReset:function(){if(!this._nRounds||this._keyPriorReset!==this._key){for(var e=this._keyPriorReset=this._key,t=e.words,r=e.sigBytes/4,n=4*((this._nRounds=r+6)+1),o=this._keySchedule=[],a=0;a6&&a%r==4&&(u=i[u>>>24]<<24|i[u>>>16&255]<<16|i[u>>>8&255]<<8|i[255&u]):(u=i[(u=u<<8|u>>>24)>>>24]<<24|i[u>>>16&255]<<16|i[u>>>8&255]<<8|i[255&u],u^=p[a/r|0]<<24),o[a]=o[a-r]^u);for(var s=this._invKeySchedule=[],f=0;f>>24]]^h[i[u>>>16&255]]^l[i[u>>>8&255]]^d[i[255&u]]}}},encryptBlock:function(e,t){this._doCryptBlock(e,t,this._keySchedule,a,s,f,u,i)},decryptBlock:function(e,t){var r=e[t+1];e[t+1]=e[t+3],e[t+3]=r,this._doCryptBlock(e,t,this._invKeySchedule,c,h,l,d,o),r=e[t+1],e[t+1]=e[t+3],e[t+3]=r},_doCryptBlock:function(e,t,r,n,i,o,a,s){for(var f=this._nRounds,u=e[t]^r[0],c=e[t+1]^r[1],h=e[t+2]^r[2],l=e[t+3]^r[3],d=4,p=1;p>>24]^i[c>>>16&255]^o[h>>>8&255]^a[255&l]^r[d++],y=n[c>>>24]^i[h>>>16&255]^o[l>>>8&255]^a[255&u]^r[d++],m=n[h>>>24]^i[l>>>16&255]^o[u>>>8&255]^a[255&c]^r[d++],g=n[l>>>24]^i[u>>>16&255]^o[c>>>8&255]^a[255&h]^r[d++];u=b,c=y,h=m,l=g}b=(s[u>>>24]<<24|s[c>>>16&255]<<16|s[h>>>8&255]<<8|s[255&l])^r[d++],y=(s[c>>>24]<<24|s[h>>>16&255]<<16|s[l>>>8&255]<<8|s[255&u])^r[d++],m=(s[h>>>24]<<24|s[l>>>16&255]<<16|s[u>>>8&255]<<8|s[255&c])^r[d++],g=(s[l>>>24]<<24|s[u>>>16&255]<<16|s[c>>>8&255]<<8|s[255&h])^r[d++],e[t]=b,e[t+1]=y,e[t+2]=m,e[t+3]=g},keySize:8});e.AES=t._createHelper(b)}(),n.AES)},function(e,t,r){var n,i,o;e.exports=(n=r(11),o=(i=n).lib.WordArray,i.enc.Base64={stringify:function(e){var t=e.words,r=e.sigBytes,n=this._map;e.clamp();for(var i=[],o=0;o>>2]>>>24-o%4*8&255)<<16|(t[o+1>>>2]>>>24-(o+1)%4*8&255)<<8|t[o+2>>>2]>>>24-(o+2)%4*8&255,s=0;s<4&&o+.75*s>>6*(3-s)&63));var f=n.charAt(64);if(f)for(;i.length%4;)i.push(f);return i.join("")},parse:function(e){var t=e.length,r=this._map,n=this._reverseMap;if(!n){n=this._reverseMap=[];for(var i=0;i>>6-a%4*2;n[i>>>2]|=s<<24-i%4*8,i++}return o.create(n,i)}(e,t,n)},_map:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="},n.enc.Base64)},function(e,t,r){var n;e.exports=(n=r(11),function(e){var t=n,r=t.lib,i=r.WordArray,o=r.Hasher,a=t.algo,s=[];!function(){for(var t=0;t<64;t++)s[t]=4294967296*e.abs(e.sin(t+1))|0}();var f=a.MD5=o.extend({_doReset:function(){this._hash=new i.init([1732584193,4023233417,2562383102,271733878])},_doProcessBlock:function(e,t){for(var r=0;r<16;r++){var n=t+r,i=e[n];e[n]=16711935&(i<<8|i>>>24)|4278255360&(i<<24|i>>>8)}var o=this._hash.words,a=e[t+0],f=e[t+1],d=e[t+2],p=e[t+3],b=e[t+4],y=e[t+5],m=e[t+6],g=e[t+7],_=e[t+8],v=e[t+9],w=e[t+10],E=e[t+11],S=e[t+12],M=e[t+13],A=e[t+14],k=e[t+15],R=o[0],O=o[1],T=o[2],I=o[3];R=u(R,O,T,I,a,7,s[0]),I=u(I,R,O,T,f,12,s[1]),T=u(T,I,R,O,d,17,s[2]),O=u(O,T,I,R,p,22,s[3]),R=u(R,O,T,I,b,7,s[4]),I=u(I,R,O,T,y,12,s[5]),T=u(T,I,R,O,m,17,s[6]),O=u(O,T,I,R,g,22,s[7]),R=u(R,O,T,I,_,7,s[8]),I=u(I,R,O,T,v,12,s[9]),T=u(T,I,R,O,w,17,s[10]),O=u(O,T,I,R,E,22,s[11]),R=u(R,O,T,I,S,7,s[12]),I=u(I,R,O,T,M,12,s[13]),T=u(T,I,R,O,A,17,s[14]),R=c(R,O=u(O,T,I,R,k,22,s[15]),T,I,f,5,s[16]),I=c(I,R,O,T,m,9,s[17]),T=c(T,I,R,O,E,14,s[18]),O=c(O,T,I,R,a,20,s[19]),R=c(R,O,T,I,y,5,s[20]),I=c(I,R,O,T,w,9,s[21]),T=c(T,I,R,O,k,14,s[22]),O=c(O,T,I,R,b,20,s[23]),R=c(R,O,T,I,v,5,s[24]),I=c(I,R,O,T,A,9,s[25]),T=c(T,I,R,O,p,14,s[26]),O=c(O,T,I,R,_,20,s[27]),R=c(R,O,T,I,M,5,s[28]),I=c(I,R,O,T,d,9,s[29]),T=c(T,I,R,O,g,14,s[30]),R=h(R,O=c(O,T,I,R,S,20,s[31]),T,I,y,4,s[32]),I=h(I,R,O,T,_,11,s[33]),T=h(T,I,R,O,E,16,s[34]),O=h(O,T,I,R,A,23,s[35]),R=h(R,O,T,I,f,4,s[36]),I=h(I,R,O,T,b,11,s[37]),T=h(T,I,R,O,g,16,s[38]),O=h(O,T,I,R,w,23,s[39]),R=h(R,O,T,I,M,4,s[40]),I=h(I,R,O,T,a,11,s[41]),T=h(T,I,R,O,p,16,s[42]),O=h(O,T,I,R,m,23,s[43]),R=h(R,O,T,I,v,4,s[44]),I=h(I,R,O,T,S,11,s[45]),T=h(T,I,R,O,k,16,s[46]),R=l(R,O=h(O,T,I,R,d,23,s[47]),T,I,a,6,s[48]),I=l(I,R,O,T,g,10,s[49]),T=l(T,I,R,O,A,15,s[50]),O=l(O,T,I,R,y,21,s[51]),R=l(R,O,T,I,S,6,s[52]),I=l(I,R,O,T,p,10,s[53]),T=l(T,I,R,O,w,15,s[54]),O=l(O,T,I,R,f,21,s[55]),R=l(R,O,T,I,_,6,s[56]),I=l(I,R,O,T,k,10,s[57]),T=l(T,I,R,O,m,15,s[58]),O=l(O,T,I,R,M,21,s[59]),R=l(R,O,T,I,b,6,s[60]),I=l(I,R,O,T,E,10,s[61]),T=l(T,I,R,O,d,15,s[62]),O=l(O,T,I,R,v,21,s[63]),o[0]=o[0]+R|0,o[1]=o[1]+O|0,o[2]=o[2]+T|0,o[3]=o[3]+I|0},_doFinalize:function(){var t=this._data,r=t.words,n=8*this._nDataBytes,i=8*t.sigBytes;r[i>>>5]|=128<<24-i%32;var o=e.floor(n/4294967296),a=n;r[15+(i+64>>>9<<4)]=16711935&(o<<8|o>>>24)|4278255360&(o<<24|o>>>8),r[14+(i+64>>>9<<4)]=16711935&(a<<8|a>>>24)|4278255360&(a<<24|a>>>8),t.sigBytes=4*(r.length+1),this._process();for(var s=this._hash,f=s.words,u=0;u<4;u++){var c=f[u];f[u]=16711935&(c<<8|c>>>24)|4278255360&(c<<24|c>>>8)}return s},clone:function(){var e=o.clone.call(this);return e._hash=this._hash.clone(),e}});function u(e,t,r,n,i,o,a){var s=e+(t&r|~t&n)+i+a;return(s<>>32-o)+t}function c(e,t,r,n,i,o,a){var s=e+(t&n|r&~n)+i+a;return(s<>>32-o)+t}function h(e,t,r,n,i,o,a){var s=e+(t^r^n)+i+a;return(s<>>32-o)+t}function l(e,t,r,n,i,o,a){var s=e+(r^(t|~n))+i+a;return(s<>>32-o)+t}t.MD5=o._createHelper(f),t.HmacMD5=o._createHmacHelper(f)}(Math),n.MD5)},function(e,t,r){var n,i,o,a,s,f,u,c;e.exports=(i=(n=c=r(11)).lib,o=i.WordArray,a=i.Hasher,s=n.algo,f=[],u=s.SHA1=a.extend({_doReset:function(){this._hash=new o.init([1732584193,4023233417,2562383102,271733878,3285377520])},_doProcessBlock:function(e,t){for(var r=this._hash.words,n=r[0],i=r[1],o=r[2],a=r[3],s=r[4],u=0;u<80;u++){if(u<16)f[u]=0|e[t+u];else{var c=f[u-3]^f[u-8]^f[u-14]^f[u-16];f[u]=c<<1|c>>>31}var h=(n<<5|n>>>27)+s+f[u];h+=u<20?1518500249+(i&o|~i&a):u<40?1859775393+(i^o^a):u<60?(i&o|i&a|o&a)-1894007588:(i^o^a)-899497514,s=a,a=o,o=i<<30|i>>>2,i=n,n=h}r[0]=r[0]+n|0,r[1]=r[1]+i|0,r[2]=r[2]+o|0,r[3]=r[3]+a|0,r[4]=r[4]+s|0},_doFinalize:function(){var e=this._data,t=e.words,r=8*this._nDataBytes,n=8*e.sigBytes;return t[n>>>5]|=128<<24-n%32,t[14+(n+64>>>9<<4)]=Math.floor(r/4294967296),t[15+(n+64>>>9<<4)]=r,e.sigBytes=4*t.length,this._process(),this._hash},clone:function(){var e=a.clone.call(this);return e._hash=this._hash.clone(),e}}),n.SHA1=a._createHelper(u),n.HmacSHA1=a._createHmacHelper(u),c.SHA1)},function(e,t,r){var n,i,o;e.exports=(i=(n=r(11)).lib.Base,o=n.enc.Utf8,void(n.algo.HMAC=i.extend({init:function(e,t){e=this._hasher=new e.init,"string"==typeof t&&(t=o.parse(t));var r=e.blockSize,n=4*r;t.sigBytes>n&&(t=e.finalize(t)),t.clamp();for(var i=this._oKey=t.clone(),a=this._iKey=t.clone(),s=i.words,f=a.words,u=0;u>>2];e.sigBytes-=t}},o.BlockCipher=l.extend({cfg:l.cfg.extend({mode:b,padding:y}),reset:function(){var e;l.reset.call(this);var t=this.cfg,r=t.iv,n=t.mode;this._xformMode==this._ENC_XFORM_MODE?e=n.createEncryptor:(e=n.createDecryptor,this._minBufferSize=1),this._mode&&this._mode.__creator==e?this._mode.init(this,r&&r.words):(this._mode=e.call(n,this,r&&r.words),this._mode.__creator=e)},_doProcessBlock:function(e,t){this._mode.processBlock(e,t)},_doFinalize:function(){var e,t=this.cfg.padding;return this._xformMode==this._ENC_XFORM_MODE?(t.pad(this._data,this.blockSize),e=this._process(!0)):(e=this._process(!0),t.unpad(e)),e},blockSize:4}),m=o.CipherParams=a.extend({init:function(e){this.mixIn(e)},toString:function(e){return(e||this.formatter).stringify(this)}}),g=(i.format={}).OpenSSL={stringify:function(e){var t=e.ciphertext,r=e.salt;return(r?s.create([1398893684,1701076831]).concat(r).concat(t):t).toString(c)},parse:function(e){var t,r=c.parse(e),n=r.words;return 1398893684==n[0]&&1701076831==n[1]&&(t=s.create(n.slice(2,4)),n.splice(0,4),r.sigBytes-=16),m.create({ciphertext:r,salt:t})}},_=o.SerializableCipher=a.extend({cfg:a.extend({format:g}),encrypt:function(e,t,r,n){n=this.cfg.extend(n);var i=e.createEncryptor(r,n),o=i.finalize(t),a=i.cfg;return m.create({ciphertext:o,key:r,iv:a.iv,algorithm:e,mode:a.mode,padding:a.padding,blockSize:e.blockSize,formatter:n.format})},decrypt:function(e,t,r,n){return n=this.cfg.extend(n),t=this._parse(t,n.format),e.createDecryptor(r,n).finalize(t.ciphertext)},_parse:function(e,t){return"string"==typeof e?t.parse(e,this):e}}),v=(i.kdf={}).OpenSSL={execute:function(e,t,r,n){n||(n=s.random(8));var i=h.create({keySize:t+r}).compute(e,n),o=s.create(i.words.slice(t),4*r);return i.sigBytes=4*t,m.create({key:i,iv:o,salt:n})}},w=o.PasswordBasedCipher=_.extend({cfg:_.cfg.extend({kdf:v}),encrypt:function(e,t,r,n){var i=(n=this.cfg.extend(n)).kdf.execute(r,e.keySize,e.ivSize);n.iv=i.iv;var o=_.encrypt.call(this,e,t,i.key,n);return o.mixIn(i),o},decrypt:function(e,t,r,n){n=this.cfg.extend(n),t=this._parse(t,n.format);var i=n.kdf.execute(r,e.keySize,e.ivSize,t.salt);return n.iv=i.iv,_.decrypt.call(this,e,t,i.key,n)}}))))},function(e,t,r){e.exports=r(11).enc.Utf8},(e,t,r)=>{var n=r(3),i=n.Buffer;function o(e,t){for(var r in e)t[r]=e[r]}function a(e,t,r){return i(e,t,r)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?e.exports=n:(o(n,t),t.Buffer=a),a.prototype=Object.create(i.prototype),o(i,a),a.from=function(e,t,r){if("number"==typeof e)throw new TypeError("Argument must not be a number");return i(e,t,r)},a.alloc=function(e,t,r){if("number"!=typeof e)throw new TypeError("Argument must be a number");var n=i(e);return void 0!==t?"string"==typeof r?n.fill(t,r):n.fill(t):n.fill(0),n},a.allocUnsafe=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return i(e)},a.allocUnsafeSlow=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return n.SlowBuffer(e)}},(e,t,r)=>{var n=r(3),i=n.Buffer;function o(e,t){for(var r in e)t[r]=e[r]}function a(e,t,r){return i(e,t,r)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?e.exports=n:(o(n,t),t.Buffer=a),a.prototype=Object.create(i.prototype),o(i,a),a.from=function(e,t,r){if("number"==typeof e)throw new TypeError("Argument must not be a number");return i(e,t,r)},a.alloc=function(e,t,r){if("number"!=typeof e)throw new TypeError("Argument must be a number");var n=i(e);return void 0!==t?"string"==typeof r?n.fill(t,r):n.fill(t):n.fill(0),n},a.allocUnsafe=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return i(e)},a.allocUnsafeSlow=function(e){if("number"!=typeof e)throw new TypeError("Argument must be a number");return n.SlowBuffer(e)}},function(e,t,r){!function(e,t){"use strict";function n(e,t){if(!e)throw new Error(t||"Assertion failed")}function i(e,t){e.super_=t;var r=function(){};r.prototype=t.prototype,e.prototype=new r,e.prototype.constructor=e}function o(e,t,r){if(o.isBN(e))return e;this.negative=0,this.words=null,this.length=0,this.red=null,null!==e&&("le"!==t&&"be"!==t||(r=t,t=10),this._init(e||0,t||10,r||"be"))}var a;"object"==typeof e?e.exports=o:t.BN=o,o.BN=o,o.wordSize=26;try{a="undefined"!=typeof window&&void 0!==window.Buffer?window.Buffer:r(327).Buffer}catch(e){}function s(e,t){var r=e.charCodeAt(t);return r>=48&&r<=57?r-48:r>=65&&r<=70?r-55:r>=97&&r<=102?r-87:void n(!1,"Invalid character in "+e)}function f(e,t,r){var n=s(e,r);return r-1>=t&&(n|=s(e,r-1)<<4),n}function u(e,t,r,i){for(var o=0,a=0,s=Math.min(e.length,r),f=t;f=49?u-49+10:u>=17?u-17+10:u,n(u>=0&&a0?e:t},o.min=function(e,t){return e.cmp(t)<0?e:t},o.prototype._init=function(e,t,r){if("number"==typeof e)return this._initNumber(e,t,r);if("object"==typeof e)return this._initArray(e,t,r);"hex"===t&&(t=16),n(t===(0|t)&&t>=2&&t<=36);var i=0;"-"===(e=e.toString().replace(/\s+/g,""))[0]&&(i++,this.negative=1),i=0;i-=3)a=e[i]|e[i-1]<<8|e[i-2]<<16,this.words[o]|=a<>>26-s&67108863,(s+=24)>=26&&(s-=26,o++);else if("le"===r)for(i=0,o=0;i>>26-s&67108863,(s+=24)>=26&&(s-=26,o++);return this._strip()},o.prototype._parseHex=function(e,t,r){this.length=Math.ceil((e.length-t)/6),this.words=new Array(this.length);for(var n=0;n=t;n-=2)i=f(e,t,n)<=18?(o-=18,a+=1,this.words[a]|=i>>>26):o+=8;else for(n=(e.length-t)%2==0?t+1:t;n=18?(o-=18,a+=1,this.words[a]|=i>>>26):o+=8;this._strip()},o.prototype._parseBase=function(e,t,r){this.words=[0],this.length=1;for(var n=0,i=1;i<=67108863;i*=t)n++;n--,i=i/t|0;for(var o=e.length-r,a=o%n,s=Math.min(o,o-a)+r,f=0,c=r;c1&&0===this.words[this.length-1];)this.length--;return this._normSign()},o.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},"undefined"!=typeof Symbol&&"function"==typeof Symbol.for)try{o.prototype[Symbol.for("nodejs.util.inspect.custom")]=h}catch(e){o.prototype.inspect=h}else o.prototype.inspect=h;function h(){return(this.red?""}var l=["","0","00","000","0000","00000","000000","0000000","00000000","000000000","0000000000","00000000000","000000000000","0000000000000","00000000000000","000000000000000","0000000000000000","00000000000000000","000000000000000000","0000000000000000000","00000000000000000000","000000000000000000000","0000000000000000000000","00000000000000000000000","000000000000000000000000","0000000000000000000000000"],d=[0,0,25,16,12,11,10,9,8,8,7,7,7,7,6,6,6,6,6,6,6,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5],p=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function b(e,t,r){r.negative=t.negative^e.negative;var n=e.length+t.length|0;r.length=n,n=n-1|0;var i=0|e.words[0],o=0|t.words[0],a=i*o,s=67108863&a,f=a/67108864|0;r.words[0]=s;for(var u=1;u>>26,h=67108863&f,l=Math.min(u,t.length-1),d=Math.max(0,u-e.length+1);d<=l;d++){var p=u-d|0;c+=(a=(i=0|e.words[p])*(o=0|t.words[d])+h)/67108864|0,h=67108863&a}r.words[u]=0|h,f=0|c}return 0!==f?r.words[u]=0|f:r.length--,r._strip()}o.prototype.toString=function(e,t){var r;if(t=0|t||1,16===(e=e||10)||"hex"===e){r="";for(var i=0,o=0,a=0;a>>24-i&16777215,(i+=2)>=26&&(i-=26,a--),r=0!==o||a!==this.length-1?l[6-f.length]+f+r:f+r}for(0!==o&&(r=o.toString(16)+r);r.length%t!=0;)r="0"+r;return 0!==this.negative&&(r="-"+r),r}if(e===(0|e)&&e>=2&&e<=36){var u=d[e],c=p[e];r="";var h=this.clone();for(h.negative=0;!h.isZero();){var b=h.modrn(c).toString(e);r=(h=h.idivn(c)).isZero()?b+r:l[u-b.length]+b+r}for(this.isZero()&&(r="0"+r);r.length%t!=0;)r="0"+r;return 0!==this.negative&&(r="-"+r),r}n(!1,"Base should be between 2 and 36")},o.prototype.toNumber=function(){var e=this.words[0];return 2===this.length?e+=67108864*this.words[1]:3===this.length&&1===this.words[2]?e+=4503599627370496+67108864*this.words[1]:this.length>2&&n(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-e:e},o.prototype.toJSON=function(){return this.toString(16,2)},a&&(o.prototype.toBuffer=function(e,t){return this.toArrayLike(a,e,t)}),o.prototype.toArray=function(e,t){return this.toArrayLike(Array,e,t)},o.prototype.toArrayLike=function(e,t,r){this._strip();var i=this.byteLength(),o=r||Math.max(1,i);n(i<=o,"byte array longer than desired length"),n(o>0,"Requested array length <= 0");var a=function(e,t){return e.allocUnsafe?e.allocUnsafe(t):new e(t)}(e,o);return this["_toArrayLike"+("le"===t?"LE":"BE")](a,i),a},o.prototype._toArrayLikeLE=function(e,t){for(var r=0,n=0,i=0,o=0;i>8&255),r>16&255),6===o?(r>24&255),n=0,o=0):(n=a>>>24,o+=2)}if(r=0&&(e[r--]=a>>8&255),r>=0&&(e[r--]=a>>16&255),6===o?(r>=0&&(e[r--]=a>>24&255),n=0,o=0):(n=a>>>24,o+=2)}if(r>=0)for(e[r--]=n;r>=0;)e[r--]=0},Math.clz32?o.prototype._countBits=function(e){return 32-Math.clz32(e)}:o.prototype._countBits=function(e){var t=e,r=0;return t>=4096&&(r+=13,t>>>=13),t>=64&&(r+=7,t>>>=7),t>=8&&(r+=4,t>>>=4),t>=2&&(r+=2,t>>>=2),r+t},o.prototype._zeroBits=function(e){if(0===e)return 26;var t=e,r=0;return 0==(8191&t)&&(r+=13,t>>>=13),0==(127&t)&&(r+=7,t>>>=7),0==(15&t)&&(r+=4,t>>>=4),0==(3&t)&&(r+=2,t>>>=2),0==(1&t)&&r++,r},o.prototype.bitLength=function(){var e=this.words[this.length-1],t=this._countBits(e);return 26*(this.length-1)+t},o.prototype.zeroBits=function(){if(this.isZero())return 0;for(var e=0,t=0;te.length?this.clone().ior(e):e.clone().ior(this)},o.prototype.uor=function(e){return this.length>e.length?this.clone().iuor(e):e.clone().iuor(this)},o.prototype.iuand=function(e){var t;t=this.length>e.length?e:this;for(var r=0;re.length?this.clone().iand(e):e.clone().iand(this)},o.prototype.uand=function(e){return this.length>e.length?this.clone().iuand(e):e.clone().iuand(this)},o.prototype.iuxor=function(e){var t,r;this.length>e.length?(t=this,r=e):(t=e,r=this);for(var n=0;ne.length?this.clone().ixor(e):e.clone().ixor(this)},o.prototype.uxor=function(e){return this.length>e.length?this.clone().iuxor(e):e.clone().iuxor(this)},o.prototype.inotn=function(e){n("number"==typeof e&&e>=0);var t=0|Math.ceil(e/26),r=e%26;this._expand(t),r>0&&t--;for(var i=0;i0&&(this.words[i]=~this.words[i]&67108863>>26-r),this._strip()},o.prototype.notn=function(e){return this.clone().inotn(e)},o.prototype.setn=function(e,t){n("number"==typeof e&&e>=0);var r=e/26|0,i=e%26;return this._expand(r+1),this.words[r]=t?this.words[r]|1<e.length?(r=this,n=e):(r=e,n=this);for(var i=0,o=0;o>>26;for(;0!==i&&o>>26;if(this.length=r.length,0!==i)this.words[this.length]=i,this.length++;else if(r!==this)for(;oe.length?this.clone().iadd(e):e.clone().iadd(this)},o.prototype.isub=function(e){if(0!==e.negative){e.negative=0;var t=this.iadd(e);return e.negative=1,t._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(e),this.negative=1,this._normSign();var r,n,i=this.cmp(e);if(0===i)return this.negative=0,this.length=1,this.words[0]=0,this;i>0?(r=this,n=e):(r=e,n=this);for(var o=0,a=0;a>26,this.words[a]=67108863&t;for(;0!==o&&a>26,this.words[a]=67108863&t;if(0===o&&a>>13,d=0|a[1],p=8191&d,b=d>>>13,y=0|a[2],m=8191&y,g=y>>>13,_=0|a[3],v=8191&_,w=_>>>13,E=0|a[4],S=8191&E,M=E>>>13,A=0|a[5],k=8191&A,R=A>>>13,O=0|a[6],T=8191&O,I=O>>>13,x=0|a[7],B=8191&x,j=x>>>13,L=0|a[8],P=8191&L,N=L>>>13,D=0|a[9],C=8191&D,U=D>>>13,q=0|s[0],F=8191&q,G=q>>>13,z=0|s[1],$=8191&z,W=z>>>13,H=0|s[2],K=8191&H,V=H>>>13,Y=0|s[3],X=8191&Y,J=Y>>>13,Z=0|s[4],Q=8191&Z,ee=Z>>>13,te=0|s[5],re=8191&te,ne=te>>>13,ie=0|s[6],oe=8191&ie,ae=ie>>>13,se=0|s[7],fe=8191&se,ue=se>>>13,ce=0|s[8],he=8191&ce,le=ce>>>13,de=0|s[9],pe=8191&de,be=de>>>13;r.negative=e.negative^t.negative,r.length=19;var ye=(u+(n=Math.imul(h,F))|0)+((8191&(i=(i=Math.imul(h,G))+Math.imul(l,F)|0))<<13)|0;u=((o=Math.imul(l,G))+(i>>>13)|0)+(ye>>>26)|0,ye&=67108863,n=Math.imul(p,F),i=(i=Math.imul(p,G))+Math.imul(b,F)|0,o=Math.imul(b,G);var me=(u+(n=n+Math.imul(h,$)|0)|0)+((8191&(i=(i=i+Math.imul(h,W)|0)+Math.imul(l,$)|0))<<13)|0;u=((o=o+Math.imul(l,W)|0)+(i>>>13)|0)+(me>>>26)|0,me&=67108863,n=Math.imul(m,F),i=(i=Math.imul(m,G))+Math.imul(g,F)|0,o=Math.imul(g,G),n=n+Math.imul(p,$)|0,i=(i=i+Math.imul(p,W)|0)+Math.imul(b,$)|0,o=o+Math.imul(b,W)|0;var ge=(u+(n=n+Math.imul(h,K)|0)|0)+((8191&(i=(i=i+Math.imul(h,V)|0)+Math.imul(l,K)|0))<<13)|0;u=((o=o+Math.imul(l,V)|0)+(i>>>13)|0)+(ge>>>26)|0,ge&=67108863,n=Math.imul(v,F),i=(i=Math.imul(v,G))+Math.imul(w,F)|0,o=Math.imul(w,G),n=n+Math.imul(m,$)|0,i=(i=i+Math.imul(m,W)|0)+Math.imul(g,$)|0,o=o+Math.imul(g,W)|0,n=n+Math.imul(p,K)|0,i=(i=i+Math.imul(p,V)|0)+Math.imul(b,K)|0,o=o+Math.imul(b,V)|0;var _e=(u+(n=n+Math.imul(h,X)|0)|0)+((8191&(i=(i=i+Math.imul(h,J)|0)+Math.imul(l,X)|0))<<13)|0;u=((o=o+Math.imul(l,J)|0)+(i>>>13)|0)+(_e>>>26)|0,_e&=67108863,n=Math.imul(S,F),i=(i=Math.imul(S,G))+Math.imul(M,F)|0,o=Math.imul(M,G),n=n+Math.imul(v,$)|0,i=(i=i+Math.imul(v,W)|0)+Math.imul(w,$)|0,o=o+Math.imul(w,W)|0,n=n+Math.imul(m,K)|0,i=(i=i+Math.imul(m,V)|0)+Math.imul(g,K)|0,o=o+Math.imul(g,V)|0,n=n+Math.imul(p,X)|0,i=(i=i+Math.imul(p,J)|0)+Math.imul(b,X)|0,o=o+Math.imul(b,J)|0;var ve=(u+(n=n+Math.imul(h,Q)|0)|0)+((8191&(i=(i=i+Math.imul(h,ee)|0)+Math.imul(l,Q)|0))<<13)|0;u=((o=o+Math.imul(l,ee)|0)+(i>>>13)|0)+(ve>>>26)|0,ve&=67108863,n=Math.imul(k,F),i=(i=Math.imul(k,G))+Math.imul(R,F)|0,o=Math.imul(R,G),n=n+Math.imul(S,$)|0,i=(i=i+Math.imul(S,W)|0)+Math.imul(M,$)|0,o=o+Math.imul(M,W)|0,n=n+Math.imul(v,K)|0,i=(i=i+Math.imul(v,V)|0)+Math.imul(w,K)|0,o=o+Math.imul(w,V)|0,n=n+Math.imul(m,X)|0,i=(i=i+Math.imul(m,J)|0)+Math.imul(g,X)|0,o=o+Math.imul(g,J)|0,n=n+Math.imul(p,Q)|0,i=(i=i+Math.imul(p,ee)|0)+Math.imul(b,Q)|0,o=o+Math.imul(b,ee)|0;var we=(u+(n=n+Math.imul(h,re)|0)|0)+((8191&(i=(i=i+Math.imul(h,ne)|0)+Math.imul(l,re)|0))<<13)|0;u=((o=o+Math.imul(l,ne)|0)+(i>>>13)|0)+(we>>>26)|0,we&=67108863,n=Math.imul(T,F),i=(i=Math.imul(T,G))+Math.imul(I,F)|0,o=Math.imul(I,G),n=n+Math.imul(k,$)|0,i=(i=i+Math.imul(k,W)|0)+Math.imul(R,$)|0,o=o+Math.imul(R,W)|0,n=n+Math.imul(S,K)|0,i=(i=i+Math.imul(S,V)|0)+Math.imul(M,K)|0,o=o+Math.imul(M,V)|0,n=n+Math.imul(v,X)|0,i=(i=i+Math.imul(v,J)|0)+Math.imul(w,X)|0,o=o+Math.imul(w,J)|0,n=n+Math.imul(m,Q)|0,i=(i=i+Math.imul(m,ee)|0)+Math.imul(g,Q)|0,o=o+Math.imul(g,ee)|0,n=n+Math.imul(p,re)|0,i=(i=i+Math.imul(p,ne)|0)+Math.imul(b,re)|0,o=o+Math.imul(b,ne)|0;var Ee=(u+(n=n+Math.imul(h,oe)|0)|0)+((8191&(i=(i=i+Math.imul(h,ae)|0)+Math.imul(l,oe)|0))<<13)|0;u=((o=o+Math.imul(l,ae)|0)+(i>>>13)|0)+(Ee>>>26)|0,Ee&=67108863,n=Math.imul(B,F),i=(i=Math.imul(B,G))+Math.imul(j,F)|0,o=Math.imul(j,G),n=n+Math.imul(T,$)|0,i=(i=i+Math.imul(T,W)|0)+Math.imul(I,$)|0,o=o+Math.imul(I,W)|0,n=n+Math.imul(k,K)|0,i=(i=i+Math.imul(k,V)|0)+Math.imul(R,K)|0,o=o+Math.imul(R,V)|0,n=n+Math.imul(S,X)|0,i=(i=i+Math.imul(S,J)|0)+Math.imul(M,X)|0,o=o+Math.imul(M,J)|0,n=n+Math.imul(v,Q)|0,i=(i=i+Math.imul(v,ee)|0)+Math.imul(w,Q)|0,o=o+Math.imul(w,ee)|0,n=n+Math.imul(m,re)|0,i=(i=i+Math.imul(m,ne)|0)+Math.imul(g,re)|0,o=o+Math.imul(g,ne)|0,n=n+Math.imul(p,oe)|0,i=(i=i+Math.imul(p,ae)|0)+Math.imul(b,oe)|0,o=o+Math.imul(b,ae)|0;var Se=(u+(n=n+Math.imul(h,fe)|0)|0)+((8191&(i=(i=i+Math.imul(h,ue)|0)+Math.imul(l,fe)|0))<<13)|0;u=((o=o+Math.imul(l,ue)|0)+(i>>>13)|0)+(Se>>>26)|0,Se&=67108863,n=Math.imul(P,F),i=(i=Math.imul(P,G))+Math.imul(N,F)|0,o=Math.imul(N,G),n=n+Math.imul(B,$)|0,i=(i=i+Math.imul(B,W)|0)+Math.imul(j,$)|0,o=o+Math.imul(j,W)|0,n=n+Math.imul(T,K)|0,i=(i=i+Math.imul(T,V)|0)+Math.imul(I,K)|0,o=o+Math.imul(I,V)|0,n=n+Math.imul(k,X)|0,i=(i=i+Math.imul(k,J)|0)+Math.imul(R,X)|0,o=o+Math.imul(R,J)|0,n=n+Math.imul(S,Q)|0,i=(i=i+Math.imul(S,ee)|0)+Math.imul(M,Q)|0,o=o+Math.imul(M,ee)|0,n=n+Math.imul(v,re)|0,i=(i=i+Math.imul(v,ne)|0)+Math.imul(w,re)|0,o=o+Math.imul(w,ne)|0,n=n+Math.imul(m,oe)|0,i=(i=i+Math.imul(m,ae)|0)+Math.imul(g,oe)|0,o=o+Math.imul(g,ae)|0,n=n+Math.imul(p,fe)|0,i=(i=i+Math.imul(p,ue)|0)+Math.imul(b,fe)|0,o=o+Math.imul(b,ue)|0;var Me=(u+(n=n+Math.imul(h,he)|0)|0)+((8191&(i=(i=i+Math.imul(h,le)|0)+Math.imul(l,he)|0))<<13)|0;u=((o=o+Math.imul(l,le)|0)+(i>>>13)|0)+(Me>>>26)|0,Me&=67108863,n=Math.imul(C,F),i=(i=Math.imul(C,G))+Math.imul(U,F)|0,o=Math.imul(U,G),n=n+Math.imul(P,$)|0,i=(i=i+Math.imul(P,W)|0)+Math.imul(N,$)|0,o=o+Math.imul(N,W)|0,n=n+Math.imul(B,K)|0,i=(i=i+Math.imul(B,V)|0)+Math.imul(j,K)|0,o=o+Math.imul(j,V)|0,n=n+Math.imul(T,X)|0,i=(i=i+Math.imul(T,J)|0)+Math.imul(I,X)|0,o=o+Math.imul(I,J)|0,n=n+Math.imul(k,Q)|0,i=(i=i+Math.imul(k,ee)|0)+Math.imul(R,Q)|0,o=o+Math.imul(R,ee)|0,n=n+Math.imul(S,re)|0,i=(i=i+Math.imul(S,ne)|0)+Math.imul(M,re)|0,o=o+Math.imul(M,ne)|0,n=n+Math.imul(v,oe)|0,i=(i=i+Math.imul(v,ae)|0)+Math.imul(w,oe)|0,o=o+Math.imul(w,ae)|0,n=n+Math.imul(m,fe)|0,i=(i=i+Math.imul(m,ue)|0)+Math.imul(g,fe)|0,o=o+Math.imul(g,ue)|0,n=n+Math.imul(p,he)|0,i=(i=i+Math.imul(p,le)|0)+Math.imul(b,he)|0,o=o+Math.imul(b,le)|0;var Ae=(u+(n=n+Math.imul(h,pe)|0)|0)+((8191&(i=(i=i+Math.imul(h,be)|0)+Math.imul(l,pe)|0))<<13)|0;u=((o=o+Math.imul(l,be)|0)+(i>>>13)|0)+(Ae>>>26)|0,Ae&=67108863,n=Math.imul(C,$),i=(i=Math.imul(C,W))+Math.imul(U,$)|0,o=Math.imul(U,W),n=n+Math.imul(P,K)|0,i=(i=i+Math.imul(P,V)|0)+Math.imul(N,K)|0,o=o+Math.imul(N,V)|0,n=n+Math.imul(B,X)|0,i=(i=i+Math.imul(B,J)|0)+Math.imul(j,X)|0,o=o+Math.imul(j,J)|0,n=n+Math.imul(T,Q)|0,i=(i=i+Math.imul(T,ee)|0)+Math.imul(I,Q)|0,o=o+Math.imul(I,ee)|0,n=n+Math.imul(k,re)|0,i=(i=i+Math.imul(k,ne)|0)+Math.imul(R,re)|0,o=o+Math.imul(R,ne)|0,n=n+Math.imul(S,oe)|0,i=(i=i+Math.imul(S,ae)|0)+Math.imul(M,oe)|0,o=o+Math.imul(M,ae)|0,n=n+Math.imul(v,fe)|0,i=(i=i+Math.imul(v,ue)|0)+Math.imul(w,fe)|0,o=o+Math.imul(w,ue)|0,n=n+Math.imul(m,he)|0,i=(i=i+Math.imul(m,le)|0)+Math.imul(g,he)|0,o=o+Math.imul(g,le)|0;var ke=(u+(n=n+Math.imul(p,pe)|0)|0)+((8191&(i=(i=i+Math.imul(p,be)|0)+Math.imul(b,pe)|0))<<13)|0;u=((o=o+Math.imul(b,be)|0)+(i>>>13)|0)+(ke>>>26)|0,ke&=67108863,n=Math.imul(C,K),i=(i=Math.imul(C,V))+Math.imul(U,K)|0,o=Math.imul(U,V),n=n+Math.imul(P,X)|0,i=(i=i+Math.imul(P,J)|0)+Math.imul(N,X)|0,o=o+Math.imul(N,J)|0,n=n+Math.imul(B,Q)|0,i=(i=i+Math.imul(B,ee)|0)+Math.imul(j,Q)|0,o=o+Math.imul(j,ee)|0,n=n+Math.imul(T,re)|0,i=(i=i+Math.imul(T,ne)|0)+Math.imul(I,re)|0,o=o+Math.imul(I,ne)|0,n=n+Math.imul(k,oe)|0,i=(i=i+Math.imul(k,ae)|0)+Math.imul(R,oe)|0,o=o+Math.imul(R,ae)|0,n=n+Math.imul(S,fe)|0,i=(i=i+Math.imul(S,ue)|0)+Math.imul(M,fe)|0,o=o+Math.imul(M,ue)|0,n=n+Math.imul(v,he)|0,i=(i=i+Math.imul(v,le)|0)+Math.imul(w,he)|0,o=o+Math.imul(w,le)|0;var Re=(u+(n=n+Math.imul(m,pe)|0)|0)+((8191&(i=(i=i+Math.imul(m,be)|0)+Math.imul(g,pe)|0))<<13)|0;u=((o=o+Math.imul(g,be)|0)+(i>>>13)|0)+(Re>>>26)|0,Re&=67108863,n=Math.imul(C,X),i=(i=Math.imul(C,J))+Math.imul(U,X)|0,o=Math.imul(U,J),n=n+Math.imul(P,Q)|0,i=(i=i+Math.imul(P,ee)|0)+Math.imul(N,Q)|0,o=o+Math.imul(N,ee)|0,n=n+Math.imul(B,re)|0,i=(i=i+Math.imul(B,ne)|0)+Math.imul(j,re)|0,o=o+Math.imul(j,ne)|0,n=n+Math.imul(T,oe)|0,i=(i=i+Math.imul(T,ae)|0)+Math.imul(I,oe)|0,o=o+Math.imul(I,ae)|0,n=n+Math.imul(k,fe)|0,i=(i=i+Math.imul(k,ue)|0)+Math.imul(R,fe)|0,o=o+Math.imul(R,ue)|0,n=n+Math.imul(S,he)|0,i=(i=i+Math.imul(S,le)|0)+Math.imul(M,he)|0,o=o+Math.imul(M,le)|0;var Oe=(u+(n=n+Math.imul(v,pe)|0)|0)+((8191&(i=(i=i+Math.imul(v,be)|0)+Math.imul(w,pe)|0))<<13)|0;u=((o=o+Math.imul(w,be)|0)+(i>>>13)|0)+(Oe>>>26)|0,Oe&=67108863,n=Math.imul(C,Q),i=(i=Math.imul(C,ee))+Math.imul(U,Q)|0,o=Math.imul(U,ee),n=n+Math.imul(P,re)|0,i=(i=i+Math.imul(P,ne)|0)+Math.imul(N,re)|0,o=o+Math.imul(N,ne)|0,n=n+Math.imul(B,oe)|0,i=(i=i+Math.imul(B,ae)|0)+Math.imul(j,oe)|0,o=o+Math.imul(j,ae)|0,n=n+Math.imul(T,fe)|0,i=(i=i+Math.imul(T,ue)|0)+Math.imul(I,fe)|0,o=o+Math.imul(I,ue)|0,n=n+Math.imul(k,he)|0,i=(i=i+Math.imul(k,le)|0)+Math.imul(R,he)|0,o=o+Math.imul(R,le)|0;var Te=(u+(n=n+Math.imul(S,pe)|0)|0)+((8191&(i=(i=i+Math.imul(S,be)|0)+Math.imul(M,pe)|0))<<13)|0;u=((o=o+Math.imul(M,be)|0)+(i>>>13)|0)+(Te>>>26)|0,Te&=67108863,n=Math.imul(C,re),i=(i=Math.imul(C,ne))+Math.imul(U,re)|0,o=Math.imul(U,ne),n=n+Math.imul(P,oe)|0,i=(i=i+Math.imul(P,ae)|0)+Math.imul(N,oe)|0,o=o+Math.imul(N,ae)|0,n=n+Math.imul(B,fe)|0,i=(i=i+Math.imul(B,ue)|0)+Math.imul(j,fe)|0,o=o+Math.imul(j,ue)|0,n=n+Math.imul(T,he)|0,i=(i=i+Math.imul(T,le)|0)+Math.imul(I,he)|0,o=o+Math.imul(I,le)|0;var Ie=(u+(n=n+Math.imul(k,pe)|0)|0)+((8191&(i=(i=i+Math.imul(k,be)|0)+Math.imul(R,pe)|0))<<13)|0;u=((o=o+Math.imul(R,be)|0)+(i>>>13)|0)+(Ie>>>26)|0,Ie&=67108863,n=Math.imul(C,oe),i=(i=Math.imul(C,ae))+Math.imul(U,oe)|0,o=Math.imul(U,ae),n=n+Math.imul(P,fe)|0,i=(i=i+Math.imul(P,ue)|0)+Math.imul(N,fe)|0,o=o+Math.imul(N,ue)|0,n=n+Math.imul(B,he)|0,i=(i=i+Math.imul(B,le)|0)+Math.imul(j,he)|0,o=o+Math.imul(j,le)|0;var xe=(u+(n=n+Math.imul(T,pe)|0)|0)+((8191&(i=(i=i+Math.imul(T,be)|0)+Math.imul(I,pe)|0))<<13)|0;u=((o=o+Math.imul(I,be)|0)+(i>>>13)|0)+(xe>>>26)|0,xe&=67108863,n=Math.imul(C,fe),i=(i=Math.imul(C,ue))+Math.imul(U,fe)|0,o=Math.imul(U,ue),n=n+Math.imul(P,he)|0,i=(i=i+Math.imul(P,le)|0)+Math.imul(N,he)|0,o=o+Math.imul(N,le)|0;var Be=(u+(n=n+Math.imul(B,pe)|0)|0)+((8191&(i=(i=i+Math.imul(B,be)|0)+Math.imul(j,pe)|0))<<13)|0;u=((o=o+Math.imul(j,be)|0)+(i>>>13)|0)+(Be>>>26)|0,Be&=67108863,n=Math.imul(C,he),i=(i=Math.imul(C,le))+Math.imul(U,he)|0,o=Math.imul(U,le);var je=(u+(n=n+Math.imul(P,pe)|0)|0)+((8191&(i=(i=i+Math.imul(P,be)|0)+Math.imul(N,pe)|0))<<13)|0;u=((o=o+Math.imul(N,be)|0)+(i>>>13)|0)+(je>>>26)|0,je&=67108863;var Le=(u+(n=Math.imul(C,pe))|0)+((8191&(i=(i=Math.imul(C,be))+Math.imul(U,pe)|0))<<13)|0;return u=((o=Math.imul(U,be))+(i>>>13)|0)+(Le>>>26)|0,Le&=67108863,f[0]=ye,f[1]=me,f[2]=ge,f[3]=_e,f[4]=ve,f[5]=we,f[6]=Ee,f[7]=Se,f[8]=Me,f[9]=Ae,f[10]=ke,f[11]=Re,f[12]=Oe,f[13]=Te,f[14]=Ie,f[15]=xe,f[16]=Be,f[17]=je,f[18]=Le,0!==u&&(f[19]=u,r.length++),r};function m(e,t,r){r.negative=t.negative^e.negative,r.length=e.length+t.length;for(var n=0,i=0,o=0;o>>26)|0)>>>26,a&=67108863}r.words[o]=s,n=a,a=i}return 0!==n?r.words[o]=n:r.length--,r._strip()}function g(e,t,r){return m(e,t,r)}function _(e,t){this.x=e,this.y=t}Math.imul||(y=b),o.prototype.mulTo=function(e,t){var r=this.length+e.length;return 10===this.length&&10===e.length?y(this,e,t):r<63?b(this,e,t):r<1024?m(this,e,t):g(this,e,t)},_.prototype.makeRBT=function(e){for(var t=new Array(e),r=o.prototype._countBits(e)-1,n=0;n>=1;return n},_.prototype.permute=function(e,t,r,n,i,o){for(var a=0;a>>=1)i++;return 1<>>=13,r[2*a+1]=8191&o,o>>>=13;for(a=2*t;a>=26,r+=o/67108864|0,r+=a>>>26,this.words[i]=67108863&a}return 0!==r&&(this.words[i]=r,this.length++),t?this.ineg():this},o.prototype.muln=function(e){return this.clone().imuln(e)},o.prototype.sqr=function(){return this.mul(this)},o.prototype.isqr=function(){return this.imul(this.clone())},o.prototype.pow=function(e){var t=function(e){for(var t=new Array(e.bitLength()),r=0;r>>i&1}return t}(e);if(0===t.length)return new o(1);for(var r=this,n=0;n=0);var t,r=e%26,i=(e-r)/26,o=67108863>>>26-r<<26-r;if(0!==r){var a=0;for(t=0;t>>26-r}a&&(this.words[t]=a,this.length++)}if(0!==i){for(t=this.length-1;t>=0;t--)this.words[t+i]=this.words[t];for(t=0;t=0),i=t?(t-t%26)/26:0;var o=e%26,a=Math.min((e-o)/26,this.length),s=67108863^67108863>>>o<a)for(this.length-=a,u=0;u=0&&(0!==c||u>=i);u--){var h=0|this.words[u];this.words[u]=c<<26-o|h>>>o,c=h&s}return f&&0!==c&&(f.words[f.length++]=c),0===this.length&&(this.words[0]=0,this.length=1),this._strip()},o.prototype.ishrn=function(e,t,r){return n(0===this.negative),this.iushrn(e,t,r)},o.prototype.shln=function(e){return this.clone().ishln(e)},o.prototype.ushln=function(e){return this.clone().iushln(e)},o.prototype.shrn=function(e){return this.clone().ishrn(e)},o.prototype.ushrn=function(e){return this.clone().iushrn(e)},o.prototype.testn=function(e){n("number"==typeof e&&e>=0);var t=e%26,r=(e-t)/26,i=1<=0);var t=e%26,r=(e-t)/26;if(n(0===this.negative,"imaskn works only with positive numbers"),this.length<=r)return this;if(0!==t&&r++,this.length=Math.min(r,this.length),0!==t){var i=67108863^67108863>>>t<=67108864;t++)this.words[t]-=67108864,t===this.length-1?this.words[t+1]=1:this.words[t+1]++;return this.length=Math.max(this.length,t+1),this},o.prototype.isubn=function(e){if(n("number"==typeof e),n(e<67108864),e<0)return this.iaddn(-e);if(0!==this.negative)return this.negative=0,this.iaddn(e),this.negative=1,this;if(this.words[0]-=e,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var t=0;t>26)-(f/67108864|0),this.words[i+r]=67108863&o}for(;i>26,this.words[i+r]=67108863&o;if(0===s)return this._strip();for(n(-1===s),s=0,i=0;i>26,this.words[i]=67108863&o;return this.negative=1,this._strip()},o.prototype._wordDiv=function(e,t){var r=(this.length,e.length),n=this.clone(),i=e,a=0|i.words[i.length-1];0!=(r=26-this._countBits(a))&&(i=i.ushln(r),n.iushln(r),a=0|i.words[i.length-1]);var s,f=n.length-i.length;if("mod"!==t){(s=new o(null)).length=f+1,s.words=new Array(s.length);for(var u=0;u=0;h--){var l=67108864*(0|n.words[i.length+h])+(0|n.words[i.length+h-1]);for(l=Math.min(l/a|0,67108863),n._ishlnsubmul(i,l,h);0!==n.negative;)l--,n.negative=0,n._ishlnsubmul(i,1,h),n.isZero()||(n.negative^=1);s&&(s.words[h]=l)}return s&&s._strip(),n._strip(),"div"!==t&&0!==r&&n.iushrn(r),{div:s||null,mod:n}},o.prototype.divmod=function(e,t,r){return n(!e.isZero()),this.isZero()?{div:new o(0),mod:new o(0)}:0!==this.negative&&0===e.negative?(s=this.neg().divmod(e,t),"mod"!==t&&(i=s.div.neg()),"div"!==t&&(a=s.mod.neg(),r&&0!==a.negative&&a.iadd(e)),{div:i,mod:a}):0===this.negative&&0!==e.negative?(s=this.divmod(e.neg(),t),"mod"!==t&&(i=s.div.neg()),{div:i,mod:s.mod}):0!=(this.negative&e.negative)?(s=this.neg().divmod(e.neg(),t),"div"!==t&&(a=s.mod.neg(),r&&0!==a.negative&&a.isub(e)),{div:s.div,mod:a}):e.length>this.length||this.cmp(e)<0?{div:new o(0),mod:this}:1===e.length?"div"===t?{div:this.divn(e.words[0]),mod:null}:"mod"===t?{div:null,mod:new o(this.modrn(e.words[0]))}:{div:this.divn(e.words[0]),mod:new o(this.modrn(e.words[0]))}:this._wordDiv(e,t);var i,a,s},o.prototype.div=function(e){return this.divmod(e,"div",!1).div},o.prototype.mod=function(e){return this.divmod(e,"mod",!1).mod},o.prototype.umod=function(e){return this.divmod(e,"mod",!0).mod},o.prototype.divRound=function(e){var t=this.divmod(e);if(t.mod.isZero())return t.div;var r=0!==t.div.negative?t.mod.isub(e):t.mod,n=e.ushrn(1),i=e.andln(1),o=r.cmp(n);return o<0||1===i&&0===o?t.div:0!==t.div.negative?t.div.isubn(1):t.div.iaddn(1)},o.prototype.modrn=function(e){var t=e<0;t&&(e=-e),n(e<=67108863);for(var r=(1<<26)%e,i=0,o=this.length-1;o>=0;o--)i=(r*i+(0|this.words[o]))%e;return t?-i:i},o.prototype.modn=function(e){return this.modrn(e)},o.prototype.idivn=function(e){var t=e<0;t&&(e=-e),n(e<=67108863);for(var r=0,i=this.length-1;i>=0;i--){var o=(0|this.words[i])+67108864*r;this.words[i]=o/e|0,r=o%e}return this._strip(),t?this.ineg():this},o.prototype.divn=function(e){return this.clone().idivn(e)},o.prototype.egcd=function(e){n(0===e.negative),n(!e.isZero());var t=this,r=e.clone();t=0!==t.negative?t.umod(e):t.clone();for(var i=new o(1),a=new o(0),s=new o(0),f=new o(1),u=0;t.isEven()&&r.isEven();)t.iushrn(1),r.iushrn(1),++u;for(var c=r.clone(),h=t.clone();!t.isZero();){for(var l=0,d=1;0==(t.words[0]&d)&&l<26;++l,d<<=1);if(l>0)for(t.iushrn(l);l-- >0;)(i.isOdd()||a.isOdd())&&(i.iadd(c),a.isub(h)),i.iushrn(1),a.iushrn(1);for(var p=0,b=1;0==(r.words[0]&b)&&p<26;++p,b<<=1);if(p>0)for(r.iushrn(p);p-- >0;)(s.isOdd()||f.isOdd())&&(s.iadd(c),f.isub(h)),s.iushrn(1),f.iushrn(1);t.cmp(r)>=0?(t.isub(r),i.isub(s),a.isub(f)):(r.isub(t),s.isub(i),f.isub(a))}return{a:s,b:f,gcd:r.iushln(u)}},o.prototype._invmp=function(e){n(0===e.negative),n(!e.isZero());var t=this,r=e.clone();t=0!==t.negative?t.umod(e):t.clone();for(var i,a=new o(1),s=new o(0),f=r.clone();t.cmpn(1)>0&&r.cmpn(1)>0;){for(var u=0,c=1;0==(t.words[0]&c)&&u<26;++u,c<<=1);if(u>0)for(t.iushrn(u);u-- >0;)a.isOdd()&&a.iadd(f),a.iushrn(1);for(var h=0,l=1;0==(r.words[0]&l)&&h<26;++h,l<<=1);if(h>0)for(r.iushrn(h);h-- >0;)s.isOdd()&&s.iadd(f),s.iushrn(1);t.cmp(r)>=0?(t.isub(r),a.isub(s)):(r.isub(t),s.isub(a))}return(i=0===t.cmpn(1)?a:s).cmpn(0)<0&&i.iadd(e),i},o.prototype.gcd=function(e){if(this.isZero())return e.abs();if(e.isZero())return this.abs();var t=this.clone(),r=e.clone();t.negative=0,r.negative=0;for(var n=0;t.isEven()&&r.isEven();n++)t.iushrn(1),r.iushrn(1);for(;;){for(;t.isEven();)t.iushrn(1);for(;r.isEven();)r.iushrn(1);var i=t.cmp(r);if(i<0){var o=t;t=r,r=o}else if(0===i||0===r.cmpn(1))break;t.isub(r)}return r.iushln(n)},o.prototype.invm=function(e){return this.egcd(e).a.umod(e)},o.prototype.isEven=function(){return 0==(1&this.words[0])},o.prototype.isOdd=function(){return 1==(1&this.words[0])},o.prototype.andln=function(e){return this.words[0]&e},o.prototype.bincn=function(e){n("number"==typeof e);var t=e%26,r=(e-t)/26,i=1<>>26,s&=67108863,this.words[a]=s}return 0!==o&&(this.words[a]=o,this.length++),this},o.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},o.prototype.cmpn=function(e){var t,r=e<0;if(0!==this.negative&&!r)return-1;if(0===this.negative&&r)return 1;if(this._strip(),this.length>1)t=1;else{r&&(e=-e),n(e<=67108863,"Number is too big");var i=0|this.words[0];t=i===e?0:ie.length)return 1;if(this.length=0;r--){var n=0|this.words[r],i=0|e.words[r];if(n!==i){ni&&(t=1);break}}return t},o.prototype.gtn=function(e){return 1===this.cmpn(e)},o.prototype.gt=function(e){return 1===this.cmp(e)},o.prototype.gten=function(e){return this.cmpn(e)>=0},o.prototype.gte=function(e){return this.cmp(e)>=0},o.prototype.ltn=function(e){return-1===this.cmpn(e)},o.prototype.lt=function(e){return-1===this.cmp(e)},o.prototype.lten=function(e){return this.cmpn(e)<=0},o.prototype.lte=function(e){return this.cmp(e)<=0},o.prototype.eqn=function(e){return 0===this.cmpn(e)},o.prototype.eq=function(e){return 0===this.cmp(e)},o.red=function(e){return new k(e)},o.prototype.toRed=function(e){return n(!this.red,"Already a number in reduction context"),n(0===this.negative,"red works only with positives"),e.convertTo(this)._forceRed(e)},o.prototype.fromRed=function(){return n(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},o.prototype._forceRed=function(e){return this.red=e,this},o.prototype.forceRed=function(e){return n(!this.red,"Already a number in reduction context"),this._forceRed(e)},o.prototype.redAdd=function(e){return n(this.red,"redAdd works only with red numbers"),this.red.add(this,e)},o.prototype.redIAdd=function(e){return n(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,e)},o.prototype.redSub=function(e){return n(this.red,"redSub works only with red numbers"),this.red.sub(this,e)},o.prototype.redISub=function(e){return n(this.red,"redISub works only with red numbers"),this.red.isub(this,e)},o.prototype.redShl=function(e){return n(this.red,"redShl works only with red numbers"),this.red.shl(this,e)},o.prototype.redMul=function(e){return n(this.red,"redMul works only with red numbers"),this.red._verify2(this,e),this.red.mul(this,e)},o.prototype.redIMul=function(e){return n(this.red,"redMul works only with red numbers"),this.red._verify2(this,e),this.red.imul(this,e)},o.prototype.redSqr=function(){return n(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},o.prototype.redISqr=function(){return n(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},o.prototype.redSqrt=function(){return n(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},o.prototype.redInvm=function(){return n(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},o.prototype.redNeg=function(){return n(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},o.prototype.redPow=function(e){return n(this.red&&!e.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,e)};var v={k256:null,p224:null,p192:null,p25519:null};function w(e,t){this.name=e,this.p=new o(t,16),this.n=this.p.bitLength(),this.k=new o(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function E(){w.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function S(){w.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function M(){w.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function A(){w.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(e){if("string"==typeof e){var t=o._prime(e);this.m=t.p,this.prime=t}else n(e.gtn(1),"modulus must be greater than 1"),this.m=e,this.prime=null}function R(e){k.call(this,e),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new o(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}w.prototype._tmp=function(){var e=new o(null);return e.words=new Array(Math.ceil(this.n/13)),e},w.prototype.ireduce=function(e){var t,r=e;do{this.split(r,this.tmp),t=(r=(r=this.imulK(r)).iadd(this.tmp)).bitLength()}while(t>this.n);var n=t0?r.isub(this.p):void 0!==r.strip?r.strip():r._strip(),r},w.prototype.split=function(e,t){e.iushrn(this.n,0,t)},w.prototype.imulK=function(e){return e.imul(this.k)},i(E,w),E.prototype.split=function(e,t){for(var r=4194303,n=Math.min(e.length,9),i=0;i>>22,o=a}o>>>=22,e.words[i-10]=o,0===o&&e.length>10?e.length-=10:e.length-=9},E.prototype.imulK=function(e){e.words[e.length]=0,e.words[e.length+1]=0,e.length+=2;for(var t=0,r=0;r>>=26,e.words[r]=i,t=n}return 0!==t&&(e.words[e.length++]=t),e},o._prime=function(e){if(v[e])return v[e];var t;if("k256"===e)t=new E;else if("p224"===e)t=new S;else if("p192"===e)t=new M;else{if("p25519"!==e)throw new Error("Unknown prime "+e);t=new A}return v[e]=t,t},k.prototype._verify1=function(e){n(0===e.negative,"red works only with positives"),n(e.red,"red works only with red numbers")},k.prototype._verify2=function(e,t){n(0==(e.negative|t.negative),"red works only with positives"),n(e.red&&e.red===t.red,"red works only with red numbers")},k.prototype.imod=function(e){return this.prime?this.prime.ireduce(e)._forceRed(this):(c(e,e.umod(this.m)._forceRed(this)),e)},k.prototype.neg=function(e){return e.isZero()?e.clone():this.m.sub(e)._forceRed(this)},k.prototype.add=function(e,t){this._verify2(e,t);var r=e.add(t);return r.cmp(this.m)>=0&&r.isub(this.m),r._forceRed(this)},k.prototype.iadd=function(e,t){this._verify2(e,t);var r=e.iadd(t);return r.cmp(this.m)>=0&&r.isub(this.m),r},k.prototype.sub=function(e,t){this._verify2(e,t);var r=e.sub(t);return r.cmpn(0)<0&&r.iadd(this.m),r._forceRed(this)},k.prototype.isub=function(e,t){this._verify2(e,t);var r=e.isub(t);return r.cmpn(0)<0&&r.iadd(this.m),r},k.prototype.shl=function(e,t){return this._verify1(e),this.imod(e.ushln(t))},k.prototype.imul=function(e,t){return this._verify2(e,t),this.imod(e.imul(t))},k.prototype.mul=function(e,t){return this._verify2(e,t),this.imod(e.mul(t))},k.prototype.isqr=function(e){return this.imul(e,e.clone())},k.prototype.sqr=function(e){return this.mul(e,e)},k.prototype.sqrt=function(e){if(e.isZero())return e.clone();var t=this.m.andln(3);if(n(t%2==1),3===t){var r=this.m.add(new o(1)).iushrn(2);return this.pow(e,r)}for(var i=this.m.subn(1),a=0;!i.isZero()&&0===i.andln(1);)a++,i.iushrn(1);n(!i.isZero());var s=new o(1).toRed(this),f=s.redNeg(),u=this.m.subn(1).iushrn(1),c=this.m.bitLength();for(c=new o(2*c*c).toRed(this);0!==this.pow(c,u).cmp(f);)c.redIAdd(f);for(var h=this.pow(c,i),l=this.pow(e,i.addn(1).iushrn(1)),d=this.pow(e,i),p=a;0!==d.cmp(s);){for(var b=d,y=0;0!==b.cmp(s);y++)b=b.redSqr();n(y=0;n--){for(var u=t.words[n],c=f-1;c>=0;c--){var h=u>>c&1;i!==r[0]&&(i=this.sqr(i)),0!==h||0!==a?(a<<=1,a|=h,(4==++s||0===n&&0===c)&&(i=this.mul(i,r[a]),s=0,a=0)):s=0}f=26}return i},k.prototype.convertTo=function(e){var t=e.umod(this.m);return t===e?t.clone():t},k.prototype.convertFrom=function(e){var t=e.clone();return t.red=null,t},o.mont=function(e){return new R(e)},i(R,k),R.prototype.convertTo=function(e){return this.imod(e.ushln(this.shift))},R.prototype.convertFrom=function(e){var t=this.imod(e.mul(this.rinv));return t.red=null,t},R.prototype.imul=function(e,t){if(e.isZero()||t.isZero())return e.words[0]=0,e.length=1,e;var r=e.imul(t),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),o=i;return i.cmp(this.m)>=0?o=i.isub(this.m):i.cmpn(0)<0&&(o=i.iadd(this.m)),o._forceRed(this)},R.prototype.mul=function(e,t){if(e.isZero()||t.isZero())return new o(0)._forceRed(this);var r=e.mul(t),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),a=i;return i.cmp(this.m)>=0?a=i.isub(this.m):i.cmpn(0)<0&&(a=i.iadd(this.m)),a._forceRed(this)},R.prototype.invm=function(e){return this.imod(e._invmp(this.m).mul(this.r2))._forceRed(this)}}(e=r.nmd(e),this)},(e,t,r)=>{t.publicEncrypt=r(262),t.privateDecrypt=r(263),t.privateEncrypt=function(e,r){return t.publicEncrypt(e,r,!0)},t.publicDecrypt=function(e,r){return t.privateDecrypt(e,r,!0)}},(e,t,r)=>{"use strict";var n=e.exports=r(164);n.build="light",n.load=function(e,t,r){return"function"==typeof t?(r=t,t=new n.Root):t||(t=new n.Root),t.load(e,r)},n.loadSync=function(e,t){return t||(t=new n.Root),t.loadSync(e)},n.encoder=r(80),n.decoder=r(81),n.verifier=r(82),n.converter=r(83),n.ReflectionObject=r(16),n.Namespace=r(19),n.Root=r(50),n.Enum=r(7),n.Type=r(45),n.Field=r(15),n.OneOf=r(32),n.MapField=r(46),n.Service=r(47),n.Method=r(48),n.Message=r(49),n.wrappers=r(84),n.types=r(17),n.util=r(4),n.ReflectionObject._configure(n.Root),n.Namespace._configure(n.Type,n.Service,n.Enum),n.Root._configure(n.Type),n.Field._configure(n.Type)},(e,t,r)=>{"use strict";var n=t;function i(){n.Reader._configure(n.BufferReader),n.util._configure()}n.build="minimal",n.Writer=r(43),n.BufferWriter=r(171),n.Reader=r(44),n.BufferReader=r(172),n.util=r(8),n.rpc=r(78),n.roots=r(79),n.configure=i,n.Writer._configure(n.BufferWriter),i()},(e,t)=>{"use strict";var r=t;r.length=function(e){var t=e.length;if(!t)return 0;for(var r=0;--t%4>1&&"="===e.charAt(t);)++r;return Math.ceil(3*e.length)/4-r};for(var n=new Array(64),i=new Array(123),o=0;o<64;)i[n[o]=o<26?o+65:o<52?o+71:o<62?o-4:o-59|43]=o++;r.encode=function(e,t,r){for(var i,o=null,a=[],s=0,f=0;t>2],i=(3&u)<<4,f=1;break;case 1:a[s++]=n[i|u>>4],i=(15&u)<<2,f=2;break;case 2:a[s++]=n[i|u>>6],a[s++]=n[63&u],f=0}s>8191&&((o||(o=[])).push(String.fromCharCode.apply(String,a)),s=0)}return f&&(a[s++]=n[i],a[s++]=61,1===f&&(a[s++]=61)),o?(s&&o.push(String.fromCharCode.apply(String,a.slice(0,s))),o.join("")):String.fromCharCode.apply(String,a.slice(0,s))};var a="invalid encoding";r.decode=function(e,t,r){for(var n,o=r,s=0,f=0;f1)break;if(void 0===(u=i[u]))throw Error(a);switch(s){case 0:n=u,s=1;break;case 1:t[r++]=n<<2|(48&u)>>4,n=u,s=2;break;case 2:t[r++]=(15&n)<<4|(60&u)>>2,n=u,s=3;break;case 3:t[r++]=(3&n)<<6|u,s=0}}if(1===s)throw Error(a);return r-o},r.test=function(e){return/^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(e)}},e=>{"use strict";function t(){this._listeners={}}e.exports=t,t.prototype.on=function(e,t,r){return(this._listeners[e]||(this._listeners[e]=[])).push({fn:t,ctx:r||this}),this},t.prototype.off=function(e,t){if(void 0===e)this._listeners={};else if(void 0===t)this._listeners[e]=[];else for(var r=this._listeners[e],n=0;n{"use strict";function t(e){return"undefined"!=typeof Float32Array?function(){var t=new Float32Array([-0]),r=new Uint8Array(t.buffer),n=128===r[3];function i(e,n,i){t[0]=e,n[i]=r[0],n[i+1]=r[1],n[i+2]=r[2],n[i+3]=r[3]}function o(e,n,i){t[0]=e,n[i]=r[3],n[i+1]=r[2],n[i+2]=r[1],n[i+3]=r[0]}function a(e,n){return r[0]=e[n],r[1]=e[n+1],r[2]=e[n+2],r[3]=e[n+3],t[0]}function s(e,n){return r[3]=e[n],r[2]=e[n+1],r[1]=e[n+2],r[0]=e[n+3],t[0]}e.writeFloatLE=n?i:o,e.writeFloatBE=n?o:i,e.readFloatLE=n?a:s,e.readFloatBE=n?s:a}():function(){function t(e,t,r,n){var i=t<0?1:0;if(i&&(t=-t),0===t)e(1/t>0?0:2147483648,r,n);else if(isNaN(t))e(2143289344,r,n);else if(t>34028234663852886e22)e((i<<31|2139095040)>>>0,r,n);else if(t<11754943508222875e-54)e((i<<31|Math.round(t/1401298464324817e-60))>>>0,r,n);else{var o=Math.floor(Math.log(t)/Math.LN2);e((i<<31|o+127<<23|8388607&Math.round(t*Math.pow(2,-o)*8388608))>>>0,r,n)}}function a(e,t,r){var n=e(t,r),i=2*(n>>31)+1,o=n>>>23&255,a=8388607&n;return 255===o?a?NaN:i*(1/0):0===o?1401298464324817e-60*i*a:i*Math.pow(2,o-150)*(a+8388608)}e.writeFloatLE=t.bind(null,r),e.writeFloatBE=t.bind(null,n),e.readFloatLE=a.bind(null,i),e.readFloatBE=a.bind(null,o)}(),"undefined"!=typeof Float64Array?function(){var t=new Float64Array([-0]),r=new Uint8Array(t.buffer),n=128===r[7];function i(e,n,i){t[0]=e,n[i]=r[0],n[i+1]=r[1],n[i+2]=r[2],n[i+3]=r[3],n[i+4]=r[4],n[i+5]=r[5],n[i+6]=r[6],n[i+7]=r[7]}function o(e,n,i){t[0]=e,n[i]=r[7],n[i+1]=r[6],n[i+2]=r[5],n[i+3]=r[4],n[i+4]=r[3],n[i+5]=r[2],n[i+6]=r[1],n[i+7]=r[0]}function a(e,n){return r[0]=e[n],r[1]=e[n+1],r[2]=e[n+2],r[3]=e[n+3],r[4]=e[n+4],r[5]=e[n+5],r[6]=e[n+6],r[7]=e[n+7],t[0]}function s(e,n){return r[7]=e[n],r[6]=e[n+1],r[5]=e[n+2],r[4]=e[n+3],r[3]=e[n+4],r[2]=e[n+5],r[1]=e[n+6],r[0]=e[n+7],t[0]}e.writeDoubleLE=n?i:o,e.writeDoubleBE=n?o:i,e.readDoubleLE=n?a:s,e.readDoubleBE=n?s:a}():function(){function t(e,t,r,n,i,o){var a=n<0?1:0;if(a&&(n=-n),0===n)e(0,i,o+t),e(1/n>0?0:2147483648,i,o+r);else if(isNaN(n))e(0,i,o+t),e(2146959360,i,o+r);else if(n>17976931348623157e292)e(0,i,o+t),e((a<<31|2146435072)>>>0,i,o+r);else{var s;if(n<22250738585072014e-324)e((s=n/5e-324)>>>0,i,o+t),e((a<<31|s/4294967296)>>>0,i,o+r);else{var f=Math.floor(Math.log(n)/Math.LN2);1024===f&&(f=1023),e(4503599627370496*(s=n*Math.pow(2,-f))>>>0,i,o+t),e((a<<31|f+1023<<20|1048576*s&1048575)>>>0,i,o+r)}}}function a(e,t,r,n,i){var o=e(n,i+t),a=e(n,i+r),s=2*(a>>31)+1,f=a>>>20&2047,u=4294967296*(1048575&a)+o;return 2047===f?u?NaN:s*(1/0):0===f?5e-324*s*u:s*Math.pow(2,f-1075)*(u+4503599627370496)}e.writeDoubleLE=t.bind(null,r,0,4),e.writeDoubleBE=t.bind(null,n,4,0),e.readDoubleLE=a.bind(null,i,0,4),e.readDoubleBE=a.bind(null,o,4,0)}(),e}function r(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}function n(e,t,r){t[r]=e>>>24,t[r+1]=e>>>16&255,t[r+2]=e>>>8&255,t[r+3]=255&e}function i(e,t){return(e[t]|e[t+1]<<8|e[t+2]<<16|e[t+3]<<24)>>>0}function o(e,t){return(e[t]<<24|e[t+1]<<16|e[t+2]<<8|e[t+3])>>>0}e.exports=t(t)},(e,t)=>{"use strict";var r=t;r.length=function(e){for(var t=0,r=0,n=0;n191&&n<224?o[a++]=(31&n)<<6|63&e[t++]:n>239&&n<365?(n=((7&n)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,o[a++]=55296+(n>>10),o[a++]=56320+(1023&n)):o[a++]=(15&n)<<12|(63&e[t++])<<6|63&e[t++],a>8191&&((i||(i=[])).push(String.fromCharCode.apply(String,o)),a=0);return i?(a&&i.push(String.fromCharCode.apply(String,o.slice(0,a))),i.join("")):String.fromCharCode.apply(String,o.slice(0,a))},r.write=function(e,t,r){for(var n,i,o=r,a=0;a>6|192,t[r++]=63&n|128):55296==(64512&n)&&56320==(64512&(i=e.charCodeAt(a+1)))?(n=65536+((1023&n)<<10)+(1023&i),++a,t[r++]=n>>18|240,t[r++]=n>>12&63|128,t[r++]=n>>6&63|128,t[r++]=63&n|128):(t[r++]=n>>12|224,t[r++]=n>>6&63|128,t[r++]=63&n|128);return r-o}},e=>{"use strict";e.exports=function(e,t,r){var n=r||8192,i=n>>>1,o=null,a=n;return function(r){if(r<1||r>i)return e(r);a+r>n&&(o=e(n),a=0);var s=t.call(o,a,a+=r);return 7&a&&(a=1+(7|a)),s}}},(e,t,r)=>{"use strict";e.exports=i;var n=r(8);function i(e,t){this.lo=e>>>0,this.hi=t>>>0}var o=i.zero=new i(0,0);o.toNumber=function(){return 0},o.zzEncode=o.zzDecode=function(){return this},o.length=function(){return 1};var a=i.zeroHash="\0\0\0\0\0\0\0\0";i.fromNumber=function(e){if(0===e)return o;var t=e<0;t&&(e=-e);var r=e>>>0,n=(e-r)/4294967296>>>0;return t&&(n=~n>>>0,r=~r>>>0,++r>4294967295&&(r=0,++n>4294967295&&(n=0))),new i(r,n)},i.from=function(e){if("number"==typeof e)return i.fromNumber(e);if(n.isString(e)){if(!n.Long)return i.fromNumber(parseInt(e,10));e=n.Long.fromString(e)}return e.low||e.high?new i(e.low>>>0,e.high>>>0):o},i.prototype.toNumber=function(e){if(!e&&this.hi>>>31){var t=1+~this.lo>>>0,r=~this.hi>>>0;return t||(r=r+1>>>0),-(t+4294967296*r)}return this.lo+4294967296*this.hi},i.prototype.toLong=function(e){return n.Long?new n.Long(0|this.lo,0|this.hi,Boolean(e)):{low:0|this.lo,high:0|this.hi,unsigned:Boolean(e)}};var s=String.prototype.charCodeAt;i.fromHash=function(e){return e===a?o:new i((s.call(e,0)|s.call(e,1)<<8|s.call(e,2)<<16|s.call(e,3)<<24)>>>0,(s.call(e,4)|s.call(e,5)<<8|s.call(e,6)<<16|s.call(e,7)<<24)>>>0)},i.prototype.toHash=function(){return String.fromCharCode(255&this.lo,this.lo>>>8&255,this.lo>>>16&255,this.lo>>>24,255&this.hi,this.hi>>>8&255,this.hi>>>16&255,this.hi>>>24)},i.prototype.zzEncode=function(){var e=this.hi>>31;return this.hi=((this.hi<<1|this.lo>>>31)^e)>>>0,this.lo=(this.lo<<1^e)>>>0,this},i.prototype.zzDecode=function(){var e=-(1&this.lo);return this.lo=((this.lo>>>1|this.hi<<31)^e)>>>0,this.hi=(this.hi>>>1^e)>>>0,this},i.prototype.length=function(){var e=this.lo,t=(this.lo>>>28|this.hi<<4)>>>0,r=this.hi>>>24;return 0===r?0===t?e<16384?e<128?1:2:e<2097152?3:4:t<16384?t<128?5:6:t<2097152?7:8:r<128?9:10}},(e,t,r)=>{"use strict";e.exports=a;var n=r(43);(a.prototype=Object.create(n.prototype)).constructor=a;var i=r(8),o=i.Buffer;function a(){n.call(this)}a.alloc=function(e){return(a.alloc=i._Buffer_allocUnsafe)(e)};var s=o&&o.prototype instanceof Uint8Array&&"set"===o.prototype.set.name?function(e,t,r){t.set(e,r)}:function(e,t,r){if(e.copy)e.copy(t,r,0,e.length);else for(var n=0;n>>0;return this.uint32(t),t&&this._push(s,t,e),this},a.prototype.string=function(e){var t=o.byteLength(e);return this.uint32(t),t&&this._push(f,t,e),this}},(e,t,r)=>{"use strict";e.exports=o;var n=r(44);(o.prototype=Object.create(n.prototype)).constructor=o;var i=r(8);function o(e){n.call(this,e)}i.Buffer&&(o.prototype._slice=i.Buffer.prototype.slice),o.prototype.string=function(){var e=this.uint32();return this.buf.utf8Slice(this.pos,this.pos=Math.min(this.pos+e,this.len))}},(e,t,r)=>{"use strict";e.exports=i;var n=r(8);function i(e,t,r){if("function"!=typeof e)throw TypeError("rpcImpl must be a function");n.EventEmitter.call(this),this.rpcImpl=e,this.requestDelimited=Boolean(t),this.responseDelimited=Boolean(r)}(i.prototype=Object.create(n.EventEmitter.prototype)).constructor=i,i.prototype.rpcCall=function e(t,r,i,o,a){if(!o)throw TypeError("request must be specified");var s=this;if(!a)return n.asPromise(e,s,t,r,i,o);if(s.rpcImpl)try{return s.rpcImpl(t,r[s.requestDelimited?"encodeDelimited":"encode"](o).finish(),(function(e,r){if(e)return s.emit("error",e,t),a(e);if(null!==r){if(!(r instanceof i))try{r=i[s.responseDelimited?"decodeDelimited":"decode"](r)}catch(e){return s.emit("error",e,t),a(e)}return s.emit("data",r,t),a(null,r)}s.end(!0)}))}catch(e){return s.emit("error",e,t),void setTimeout((function(){a(e)}),0)}else setTimeout((function(){a(Error("already ended"))}),0)},i.prototype.end=function(e){return this.rpcImpl&&(e||this.rpcImpl(null,null,null),this.rpcImpl=null,this.emit("end").off()),this}},e=>{"use strict";function t(e,r){"string"==typeof e&&(r=e,e=void 0);var n=[];function i(e){if("string"!=typeof e){var r=o();if(t.verbose&&console.log("codegen: "+r),r="return "+r,e){for(var a=Object.keys(e),s=new Array(a.length+1),f=new Array(a.length),u=0;u{"use strict";e.exports=o;var n=r(76),i=r(77)("fs");function o(e,t,r){return"function"==typeof t?(r=t,t={}):t||(t={}),r?!t.xhr&&i&&i.readFile?i.readFile(e,(function(n,i){return n&&"undefined"!=typeof XMLHttpRequest?o.xhr(e,t,r):n?r(n):r(null,t.binary?i:i.toString("utf8"))})):o.xhr(e,t,r):n(o,this,e,t)}o.xhr=function(e,t,r){var n=new XMLHttpRequest;n.onreadystatechange=function(){if(4===n.readyState){if(0!==n.status&&200!==n.status)return r(Error("status "+n.status));if(t.binary){var e=n.response;if(!e){e=[];for(var i=0;i{"use strict";var r=t,n=r.isAbsolute=function(e){return/^(?:\/|\w+:)/.test(e)},i=r.normalize=function(e){var t=(e=e.replace(/\\/g,"/").replace(/\/{2,}/g,"/")).split("/"),r=n(e),i="";r&&(i=t.shift()+"/");for(var o=0;o0&&".."!==t[o-1]?t.splice(--o,2):r?t.splice(o,1):++o:"."===t[o]?t.splice(o,1):++o;return i+t.join("/")};r.resolve=function(e,t,r){return r||(t=i(t)),n(t)?t:(r||(e=i(e)),(e=e.replace(/(?:\/|^)[^/]+$/,"")).length?i(e+"/"+t):t)}},(e,t,r)=>{const n=r(178);e.exports=n("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz")},e=>{"use strict";e.exports=function(e){if(e.length>=255)throw new TypeError("Alphabet too long");for(var t=new Uint8Array(256),r=0;r>>0,u=new Uint8Array(o);e[r];){var c=t[e.charCodeAt(r)];if(255===c)return;for(var h=0,l=o-1;(0!==c||h>>0,u[l]=c%256>>>0,c=c/256>>>0;if(0!==c)throw new Error("Non-zero carry");i=h,r++}for(var d=o-i;d!==o&&0===u[d];)d++;for(var p=new Uint8Array(n+(o-d)),b=n;d!==o;)p[b++]=u[d++];return p}return{encode:function(t){if(t instanceof Uint8Array||(ArrayBuffer.isView(t)?t=new Uint8Array(t.buffer,t.byteOffset,t.byteLength):Array.isArray(t)&&(t=Uint8Array.from(t))),!(t instanceof Uint8Array))throw new TypeError("Expected Uint8Array");if(0===t.length)return"";for(var r=0,n=0,i=0,o=t.length;i!==o&&0===t[i];)i++,r++;for(var f=(o-i)*u+1>>>0,c=new Uint8Array(f);i!==o;){for(var h=t[i],l=0,d=f-1;(0!==h||l>>0,c[d]=h%a>>>0,h=h/a>>>0;if(0!==h)throw new Error("Non-zero carry");n=l,i++}for(var p=f-n;p!==f&&0===c[p];)p++;for(var b=s.repeat(r);p{"use strict";e.exports=M,M.filename=null,M.defaults={keepCase:!1};var n=r(85),i=r(50),o=r(45),a=r(15),s=r(46),f=r(32),u=r(7),c=r(47),h=r(48),l=r(17),d=r(4),p=/^[1-9][0-9]*$/,b=/^-?[1-9][0-9]*$/,y=/^0[x][0-9a-fA-F]+$/,m=/^-?0[x][0-9a-fA-F]+$/,g=/^0[0-7]+$/,_=/^-?0[0-7]+$/,v=/^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,w=/^[a-zA-Z_][a-zA-Z_0-9]*$/,E=/^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,S=/^(?:\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;function M(e,t,r){t instanceof i||(r=t,t=new i),r||(r=M.defaults);var A,k,R,O,T,I=n(e,r.alternateCommentMode||!1),x=I.next,B=I.push,j=I.peek,L=I.skip,P=I.cmnt,N=!0,D=!1,C=t,U=r.keepCase?function(e){return e}:d.camelCase;function q(e,t,r){var n=M.filename;return r||(M.filename=null),Error("illegal "+(t||"token")+" '"+e+"' ("+(n?n+", ":"")+"line "+I.line+")")}function F(){var e,t=[];do{if('"'!==(e=x())&&"'"!==e)throw q(e);t.push(x()),L(e),e=j()}while('"'===e||"'"===e);return t.join("")}function G(e){var t=x();switch(t){case"'":case'"':return B(t),F();case"true":case"TRUE":return!0;case"false":case"FALSE":return!1}try{return function(e,t){var r=1;switch("-"===e.charAt(0)&&(r=-1,e=e.substring(1)),e){case"inf":case"INF":case"Inf":return r*(1/0);case"nan":case"NAN":case"Nan":case"NaN":return NaN;case"0":return 0}if(p.test(e))return r*parseInt(e,10);if(y.test(e))return r*parseInt(e,16);if(g.test(e))return r*parseInt(e,8);if(v.test(e))return r*parseFloat(e);throw q(e,"number",!0)}(t)}catch(r){if(e&&E.test(t))return t;throw q(t,"value")}}function z(e,t){var r,n;do{!t||'"'!==(r=j())&&"'"!==r?e.push([n=$(x()),L("to",!0)?$(x()):n]):e.push(F())}while(L(",",!0));L(";")}function $(e,t){switch(e){case"max":case"MAX":case"Max":return 536870911;case"0":return 0}if(!t&&"-"===e.charAt(0))throw q(e,"id");if(b.test(e))return parseInt(e,10);if(m.test(e))return parseInt(e,16);if(_.test(e))return parseInt(e,8);throw q(e,"id")}function W(){if(void 0!==A)throw q("package");if(A=x(),!E.test(A))throw q(A,"name");C=C.define(A),L(";")}function H(){var e,t=j();switch(t){case"weak":e=R||(R=[]),x();break;case"public":x();default:e=k||(k=[])}t=F(),L(";"),e.push(t)}function K(){if(L("="),O=F(),!(D="proto3"===O)&&"proto2"!==O)throw q(O,"syntax");L(";")}function V(e,t){switch(t){case"option":return J(e,t),L(";"),!0;case"message":return function(e,t){if(!w.test(t=x()))throw q(t,"type name");var r=new o(t);Y(r,(function(e){if(!V(r,e))switch(e){case"map":!function(e){L("<");var t=x();if(void 0===l.mapKey[t])throw q(t,"type");L(",");var r=x();if(!E.test(r))throw q(r,"type");L(">");var n=x();if(!w.test(n))throw q(n,"name");L("=");var i=new s(U(n),$(x()),t,r);Y(i,(function(e){if("option"!==e)throw q(e);J(i,e),L(";")}),(function(){ee(i)})),e.add(i)}(r);break;case"required":case"optional":case"repeated":X(r,e);break;case"oneof":!function(e,t){if(!w.test(t=x()))throw q(t,"name");var r=new f(U(t));Y(r,(function(e){"option"===e?(J(r,e),L(";")):(B(e),X(r,"optional"))})),e.add(r)}(r,e);break;case"extensions":z(r.extensions||(r.extensions=[]));break;case"reserved":z(r.reserved||(r.reserved=[]),!0);break;default:if(!D||!E.test(e))throw q(e);B(e),X(r,"optional")}})),e.add(r)}(e,t),!0;case"enum":return function(e,t){if(!w.test(t=x()))throw q(t,"name");var r=new u(t);Y(r,(function(e){switch(e){case"option":J(r,e),L(";");break;case"reserved":z(r.reserved||(r.reserved=[]),!0);break;default:!function(e,t){if(!w.test(t))throw q(t,"name");L("=");var r=$(x(),!0),n={};Y(n,(function(e){if("option"!==e)throw q(e);J(n,e),L(";")}),(function(){ee(n)})),e.add(t,r,n.comment)}(r,e)}})),e.add(r)}(e,t),!0;case"service":return function(e,t){if(!w.test(t=x()))throw q(t,"service name");var r=new c(t);Y(r,(function(e){if(!V(r,e)){if("rpc"!==e)throw q(e);!function(e,t){var r=t;if(!w.test(t=x()))throw q(t,"name");var n,i,o,a,s=t;if(L("("),L("stream",!0)&&(i=!0),!E.test(t=x()))throw q(t);if(n=t,L(")"),L("returns"),L("("),L("stream",!0)&&(a=!0),!E.test(t=x()))throw q(t);o=t,L(")");var f=new h(s,r,n,o,i,a);Y(f,(function(e){if("option"!==e)throw q(e);J(f,e),L(";")})),e.add(f)}(r,e)}})),e.add(r)}(e,t),!0;case"extend":return function(e,t){if(!E.test(t=x()))throw q(t,"reference");var r=t;Y(null,(function(t){switch(t){case"required":case"repeated":case"optional":X(e,t,r);break;default:if(!D||!E.test(t))throw q(t);B(t),X(e,"optional",r)}}))}(e,t),!0}return!1}function Y(e,t,r){var n=I.line;if(e&&(e.comment=P(),e.filename=M.filename),L("{",!0)){for(var i;"}"!==(i=x());)t(i);L(";",!0)}else r&&r(),L(";"),e&&"string"!=typeof e.comment&&(e.comment=P(n))}function X(e,t,r){var n=x();if("group"!==n){if(!E.test(n))throw q(n,"type");var i=x();if(!w.test(i))throw q(i,"name");i=U(i),L("=");var s=new a(i,$(x()),n,t,r);Y(s,(function(e){if("option"!==e)throw q(e);J(s,e),L(";")}),(function(){ee(s)})),e.add(s),D||!s.repeated||void 0===l.packed[n]&&void 0!==l.basic[n]||s.setOption("packed",!1,!0)}else!function(e,t){var r=x();if(!w.test(r))throw q(r,"name");var n=d.lcFirst(r);r===n&&(r=d.ucFirst(r)),L("=");var i=$(x()),s=new o(r);s.group=!0;var f=new a(n,i,r,t);f.filename=M.filename,Y(s,(function(e){switch(e){case"option":J(s,e),L(";");break;case"required":case"optional":case"repeated":X(s,e);break;default:throw q(e)}})),e.add(s).add(f)}(e,t)}function J(e,t){var r=L("(",!0);if(!E.test(t=x()))throw q(t,"name");var n=t;r&&(L(")"),n="("+n+")",t=j(),S.test(t)&&(n+=t,x())),L("="),Z(e,n)}function Z(e,t){if(L("{",!0))do{if(!w.test(T=x()))throw q(T,"name");"{"===j()?Z(e,t+"."+T):(L(":"),"{"===j()?Z(e,t+"."+T):Q(e,t+"."+T,G(!0))),L(",",!0)}while(!L("}",!0));else Q(e,t,G(!0))}function Q(e,t,r){e.setOption&&e.setOption(t,r)}function ee(e){if(L("[",!0)){do{J(e,"option")}while(L(",",!0));L("]")}return e}for(;null!==(T=x());)switch(T){case"package":if(!N)throw q(T);W();break;case"import":if(!N)throw q(T);H();break;case"syntax":if(!N)throw q(T);K();break;case"option":if(!N)throw q(T);J(C,T),L(";");break;default:if(V(C,T)){N=!1;continue}throw q(T)}return M.filename=null,{package:A,imports:k,weakImports:R,syntax:O,root:t}}},e=>{"use strict";e.exports=n;var t,r=/\/|\./;function n(e,t){r.test(e)||(e="google/protobuf/"+e+".proto",t={nested:{google:{nested:{protobuf:{nested:t}}}}}),n[e]=t}n("any",{Any:{fields:{type_url:{type:"string",id:1},value:{type:"bytes",id:2}}}}),n("duration",{Duration:t={fields:{seconds:{type:"int64",id:1},nanos:{type:"int32",id:2}}}}),n("timestamp",{Timestamp:t}),n("empty",{Empty:{fields:{}}}),n("struct",{Struct:{fields:{fields:{keyType:"string",type:"Value",id:1}}},Value:{oneofs:{kind:{oneof:["nullValue","numberValue","stringValue","boolValue","structValue","listValue"]}},fields:{nullValue:{type:"NullValue",id:1},numberValue:{type:"double",id:2},stringValue:{type:"string",id:3},boolValue:{type:"bool",id:4},structValue:{type:"Struct",id:5},listValue:{type:"ListValue",id:6}}},NullValue:{values:{NULL_VALUE:0}},ListValue:{fields:{values:{rule:"repeated",type:"Value",id:1}}}}),n("wrappers",{DoubleValue:{fields:{value:{type:"double",id:1}}},FloatValue:{fields:{value:{type:"float",id:1}}},Int64Value:{fields:{value:{type:"int64",id:1}}},UInt64Value:{fields:{value:{type:"uint64",id:1}}},Int32Value:{fields:{value:{type:"int32",id:1}}},UInt32Value:{fields:{value:{type:"uint32",id:1}}},BoolValue:{fields:{value:{type:"bool",id:1}}},StringValue:{fields:{value:{type:"string",id:1}}},BytesValue:{fields:{value:{type:"bytes",id:1}}}}),n("field_mask",{FieldMask:{fields:{paths:{rule:"repeated",type:"string",id:1}}}}),n.get=function(e){return n[e]||null}},(e,t,r)=>{"use strict";var n=r(5),i=r(2),o=r(0),a=r(33),s=n.assert;function f(e){a.call(this,"short",e),this.a=new i(e.a,16).toRed(this.red),this.b=new i(e.b,16).toRed(this.red),this.tinv=this.two.redInvm(),this.zeroA=0===this.a.fromRed().cmpn(0),this.threeA=0===this.a.fromRed().sub(this.p).cmpn(-3),this.endo=this._getEndomorphism(e),this._endoWnafT1=new Array(4),this._endoWnafT2=new Array(4)}function u(e,t,r,n){a.BasePoint.call(this,e,"affine"),null===t&&null===r?(this.x=null,this.y=null,this.inf=!0):(this.x=new i(t,16),this.y=new i(r,16),n&&(this.x.forceRed(this.curve.red),this.y.forceRed(this.curve.red)),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.inf=!1)}function c(e,t,r,n){a.BasePoint.call(this,e,"jacobian"),null===t&&null===r&&null===n?(this.x=this.curve.one,this.y=this.curve.one,this.z=new i(0)):(this.x=new i(t,16),this.y=new i(r,16),this.z=new i(n,16)),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)),this.zOne=this.z===this.curve.one}o(f,a),e.exports=f,f.prototype._getEndomorphism=function(e){if(this.zeroA&&this.g&&this.n&&1===this.p.modn(3)){var t,r;if(e.beta)t=new i(e.beta,16).toRed(this.red);else{var n=this._getEndoRoots(this.p);t=(t=n[0].cmp(n[1])<0?n[0]:n[1]).toRed(this.red)}if(e.lambda)r=new i(e.lambda,16);else{var o=this._getEndoRoots(this.n);0===this.g.mul(o[0]).x.cmp(this.g.x.redMul(t))?r=o[0]:(r=o[1],s(0===this.g.mul(r).x.cmp(this.g.x.redMul(t))))}return{beta:t,lambda:r,basis:e.basis?e.basis.map((function(e){return{a:new i(e.a,16),b:new i(e.b,16)}})):this._getEndoBasis(r)}}},f.prototype._getEndoRoots=function(e){var t=e===this.p?this.red:i.mont(e),r=new i(2).toRed(t).redInvm(),n=r.redNeg(),o=new i(3).toRed(t).redNeg().redSqrt().redMul(r);return[n.redAdd(o).fromRed(),n.redSub(o).fromRed()]},f.prototype._getEndoBasis=function(e){for(var t,r,n,o,a,s,f,u,c,h=this.n.ushrn(Math.floor(this.n.bitLength()/2)),l=e,d=this.n.clone(),p=new i(1),b=new i(0),y=new i(0),m=new i(1),g=0;0!==l.cmpn(0);){var _=d.div(l);u=d.sub(_.mul(l)),c=y.sub(_.mul(p));var v=m.sub(_.mul(b));if(!n&&u.cmp(h)<0)t=f.neg(),r=p,n=u.neg(),o=c;else if(n&&2==++g)break;f=u,d=l,l=u,y=p,p=c,m=b,b=v}a=u.neg(),s=c;var w=n.sqr().add(o.sqr());return a.sqr().add(s.sqr()).cmp(w)>=0&&(a=t,s=r),n.negative&&(n=n.neg(),o=o.neg()),a.negative&&(a=a.neg(),s=s.neg()),[{a:n,b:o},{a,b:s}]},f.prototype._endoSplit=function(e){var t=this.endo.basis,r=t[0],n=t[1],i=n.b.mul(e).divRound(this.n),o=r.b.neg().mul(e).divRound(this.n),a=i.mul(r.a),s=o.mul(n.a),f=i.mul(r.b),u=o.mul(n.b);return{k1:e.sub(a).sub(s),k2:f.add(u).neg()}},f.prototype.pointFromX=function(e,t){(e=new i(e,16)).red||(e=e.toRed(this.red));var r=e.redSqr().redMul(e).redIAdd(e.redMul(this.a)).redIAdd(this.b),n=r.redSqrt();if(0!==n.redSqr().redSub(r).cmp(this.zero))throw new Error("invalid point");var o=n.fromRed().isOdd();return(t&&!o||!t&&o)&&(n=n.redNeg()),this.point(e,n)},f.prototype.validate=function(e){if(e.inf)return!0;var t=e.x,r=e.y,n=this.a.redMul(t),i=t.redSqr().redMul(t).redIAdd(n).redIAdd(this.b);return 0===r.redSqr().redISub(i).cmpn(0)},f.prototype._endoWnafMulAdd=function(e,t,r){for(var n=this._endoWnafT1,i=this._endoWnafT2,o=0;o":""},u.prototype.isInfinity=function(){return this.inf},u.prototype.add=function(e){if(this.inf)return e;if(e.inf)return this;if(this.eq(e))return this.dbl();if(this.neg().eq(e))return this.curve.point(null,null);if(0===this.x.cmp(e.x))return this.curve.point(null,null);var t=this.y.redSub(e.y);0!==t.cmpn(0)&&(t=t.redMul(this.x.redSub(e.x).redInvm()));var r=t.redSqr().redISub(this.x).redISub(e.x),n=t.redMul(this.x.redSub(r)).redISub(this.y);return this.curve.point(r,n)},u.prototype.dbl=function(){if(this.inf)return this;var e=this.y.redAdd(this.y);if(0===e.cmpn(0))return this.curve.point(null,null);var t=this.curve.a,r=this.x.redSqr(),n=e.redInvm(),i=r.redAdd(r).redIAdd(r).redIAdd(t).redMul(n),o=i.redSqr().redISub(this.x.redAdd(this.x)),a=i.redMul(this.x.redSub(o)).redISub(this.y);return this.curve.point(o,a)},u.prototype.getX=function(){return this.x.fromRed()},u.prototype.getY=function(){return this.y.fromRed()},u.prototype.mul=function(e){return e=new i(e,16),this.isInfinity()?this:this._hasDoubles(e)?this.curve._fixedNafMul(this,e):this.curve.endo?this.curve._endoWnafMulAdd([this],[e]):this.curve._wnafMul(this,e)},u.prototype.mulAdd=function(e,t,r){var n=[this,t],i=[e,r];return this.curve.endo?this.curve._endoWnafMulAdd(n,i):this.curve._wnafMulAdd(1,n,i,2)},u.prototype.jmulAdd=function(e,t,r){var n=[this,t],i=[e,r];return this.curve.endo?this.curve._endoWnafMulAdd(n,i,!0):this.curve._wnafMulAdd(1,n,i,2,!0)},u.prototype.eq=function(e){return this===e||this.inf===e.inf&&(this.inf||0===this.x.cmp(e.x)&&0===this.y.cmp(e.y))},u.prototype.neg=function(e){if(this.inf)return this;var t=this.curve.point(this.x,this.y.redNeg());if(e&&this.precomputed){var r=this.precomputed,n=function(e){return e.neg()};t.precomputed={naf:r.naf&&{wnd:r.naf.wnd,points:r.naf.points.map(n)},doubles:r.doubles&&{step:r.doubles.step,points:r.doubles.points.map(n)}}}return t},u.prototype.toJ=function(){return this.inf?this.curve.jpoint(null,null,null):this.curve.jpoint(this.x,this.y,this.curve.one)},o(c,a.BasePoint),f.prototype.jpoint=function(e,t,r){return new c(this,e,t,r)},c.prototype.toP=function(){if(this.isInfinity())return this.curve.point(null,null);var e=this.z.redInvm(),t=e.redSqr(),r=this.x.redMul(t),n=this.y.redMul(t).redMul(e);return this.curve.point(r,n)},c.prototype.neg=function(){return this.curve.jpoint(this.x,this.y.redNeg(),this.z)},c.prototype.add=function(e){if(this.isInfinity())return e;if(e.isInfinity())return this;var t=e.z.redSqr(),r=this.z.redSqr(),n=this.x.redMul(t),i=e.x.redMul(r),o=this.y.redMul(t.redMul(e.z)),a=e.y.redMul(r.redMul(this.z)),s=n.redSub(i),f=o.redSub(a);if(0===s.cmpn(0))return 0!==f.cmpn(0)?this.curve.jpoint(null,null,null):this.dbl();var u=s.redSqr(),c=u.redMul(s),h=n.redMul(u),l=f.redSqr().redIAdd(c).redISub(h).redISub(h),d=f.redMul(h.redISub(l)).redISub(o.redMul(c)),p=this.z.redMul(e.z).redMul(s);return this.curve.jpoint(l,d,p)},c.prototype.mixedAdd=function(e){if(this.isInfinity())return e.toJ();if(e.isInfinity())return this;var t=this.z.redSqr(),r=this.x,n=e.x.redMul(t),i=this.y,o=e.y.redMul(t).redMul(this.z),a=r.redSub(n),s=i.redSub(o);if(0===a.cmpn(0))return 0!==s.cmpn(0)?this.curve.jpoint(null,null,null):this.dbl();var f=a.redSqr(),u=f.redMul(a),c=r.redMul(f),h=s.redSqr().redIAdd(u).redISub(c).redISub(c),l=s.redMul(c.redISub(h)).redISub(i.redMul(u)),d=this.z.redMul(a);return this.curve.jpoint(h,l,d)},c.prototype.dblp=function(e){if(0===e)return this;if(this.isInfinity())return this;if(!e)return this.dbl();var t;if(this.curve.zeroA||this.curve.threeA){var r=this;for(t=0;t=0)return!1;if(r.redIAdd(i),0===this.x.cmp(r))return!0}},c.prototype.inspect=function(){return this.isInfinity()?"":""},c.prototype.isInfinity=function(){return 0===this.z.cmpn(0)}},(e,t,r)=>{"use strict";var n=r(2),i=r(0),o=r(33),a=r(5);function s(e){o.call(this,"mont",e),this.a=new n(e.a,16).toRed(this.red),this.b=new n(e.b,16).toRed(this.red),this.i4=new n(4).toRed(this.red).redInvm(),this.two=new n(2).toRed(this.red),this.a24=this.i4.redMul(this.a.redAdd(this.two))}function f(e,t,r){o.BasePoint.call(this,e,"projective"),null===t&&null===r?(this.x=this.curve.one,this.z=this.curve.zero):(this.x=new n(t,16),this.z=new n(r,16),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)))}i(s,o),e.exports=s,s.prototype.validate=function(e){var t=e.normalize().x,r=t.redSqr(),n=r.redMul(t).redAdd(r.redMul(this.a)).redAdd(t);return 0===n.redSqrt().redSqr().cmp(n)},i(f,o.BasePoint),s.prototype.decodePoint=function(e,t){return this.point(a.toArray(e,t),1)},s.prototype.point=function(e,t){return new f(this,e,t)},s.prototype.pointFromJSON=function(e){return f.fromJSON(this,e)},f.prototype.precompute=function(){},f.prototype._encode=function(){return this.getX().toArray("be",this.curve.p.byteLength())},f.fromJSON=function(e,t){return new f(e,t[0],t[1]||e.one)},f.prototype.inspect=function(){return this.isInfinity()?"":""},f.prototype.isInfinity=function(){return 0===this.z.cmpn(0)},f.prototype.dbl=function(){var e=this.x.redAdd(this.z).redSqr(),t=this.x.redSub(this.z).redSqr(),r=e.redSub(t),n=e.redMul(t),i=r.redMul(t.redAdd(this.curve.a24.redMul(r)));return this.curve.point(n,i)},f.prototype.add=function(){throw new Error("Not supported on Montgomery curve")},f.prototype.diffAdd=function(e,t){var r=this.x.redAdd(this.z),n=this.x.redSub(this.z),i=e.x.redAdd(e.z),o=e.x.redSub(e.z).redMul(r),a=i.redMul(n),s=t.z.redMul(o.redAdd(a).redSqr()),f=t.x.redMul(o.redISub(a).redSqr());return this.curve.point(s,f)},f.prototype.mul=function(e){for(var t=e.clone(),r=this,n=this.curve.point(null,null),i=[];0!==t.cmpn(0);t.iushrn(1))i.push(t.andln(1));for(var o=i.length-1;o>=0;o--)0===i[o]?(r=r.diffAdd(n,this),n=n.dbl()):(n=r.diffAdd(n,this),r=r.dbl());return n},f.prototype.mulAdd=function(){throw new Error("Not supported on Montgomery curve")},f.prototype.jumlAdd=function(){throw new Error("Not supported on Montgomery curve")},f.prototype.eq=function(e){return 0===this.getX().cmp(e.getX())},f.prototype.normalize=function(){return this.x=this.x.redMul(this.z.redInvm()),this.z=this.curve.one,this},f.prototype.getX=function(){return this.normalize(),this.x.fromRed()}},(e,t,r)=>{"use strict";var n=r(5),i=r(2),o=r(0),a=r(33),s=n.assert;function f(e){this.twisted=1!=(0|e.a),this.mOneA=this.twisted&&-1==(0|e.a),this.extended=this.mOneA,a.call(this,"edwards",e),this.a=new i(e.a,16).umod(this.red.m),this.a=this.a.toRed(this.red),this.c=new i(e.c,16).toRed(this.red),this.c2=this.c.redSqr(),this.d=new i(e.d,16).toRed(this.red),this.dd=this.d.redAdd(this.d),s(!this.twisted||0===this.c.fromRed().cmpn(1)),this.oneC=1==(0|e.c)}function u(e,t,r,n,o){a.BasePoint.call(this,e,"projective"),null===t&&null===r&&null===n?(this.x=this.curve.zero,this.y=this.curve.one,this.z=this.curve.one,this.t=this.curve.zero,this.zOne=!0):(this.x=new i(t,16),this.y=new i(r,16),this.z=n?new i(n,16):this.curve.one,this.t=o&&new i(o,16),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)),this.t&&!this.t.red&&(this.t=this.t.toRed(this.curve.red)),this.zOne=this.z===this.curve.one,this.curve.extended&&!this.t&&(this.t=this.x.redMul(this.y),this.zOne||(this.t=this.t.redMul(this.z.redInvm()))))}o(f,a),e.exports=f,f.prototype._mulA=function(e){return this.mOneA?e.redNeg():this.a.redMul(e)},f.prototype._mulC=function(e){return this.oneC?e:this.c.redMul(e)},f.prototype.jpoint=function(e,t,r,n){return this.point(e,t,r,n)},f.prototype.pointFromX=function(e,t){(e=new i(e,16)).red||(e=e.toRed(this.red));var r=e.redSqr(),n=this.c2.redSub(this.a.redMul(r)),o=this.one.redSub(this.c2.redMul(this.d).redMul(r)),a=n.redMul(o.redInvm()),s=a.redSqrt();if(0!==s.redSqr().redSub(a).cmp(this.zero))throw new Error("invalid point");var f=s.fromRed().isOdd();return(t&&!f||!t&&f)&&(s=s.redNeg()),this.point(e,s)},f.prototype.pointFromY=function(e,t){(e=new i(e,16)).red||(e=e.toRed(this.red));var r=e.redSqr(),n=r.redSub(this.c2),o=r.redMul(this.d).redMul(this.c2).redSub(this.a),a=n.redMul(o.redInvm());if(0===a.cmp(this.zero)){if(t)throw new Error("invalid point");return this.point(this.zero,e)}var s=a.redSqrt();if(0!==s.redSqr().redSub(a).cmp(this.zero))throw new Error("invalid point");return s.fromRed().isOdd()!==t&&(s=s.redNeg()),this.point(s,e)},f.prototype.validate=function(e){if(e.isInfinity())return!0;e.normalize();var t=e.x.redSqr(),r=e.y.redSqr(),n=t.redMul(this.a).redAdd(r),i=this.c2.redMul(this.one.redAdd(this.d.redMul(t).redMul(r)));return 0===n.cmp(i)},o(u,a.BasePoint),f.prototype.pointFromJSON=function(e){return u.fromJSON(this,e)},f.prototype.point=function(e,t,r,n){return new u(this,e,t,r,n)},u.fromJSON=function(e,t){return new u(e,t[0],t[1],t[2])},u.prototype.inspect=function(){return this.isInfinity()?"":""},u.prototype.isInfinity=function(){return 0===this.x.cmpn(0)&&(0===this.y.cmp(this.z)||this.zOne&&0===this.y.cmp(this.curve.c))},u.prototype._extDbl=function(){var e=this.x.redSqr(),t=this.y.redSqr(),r=this.z.redSqr();r=r.redIAdd(r);var n=this.curve._mulA(e),i=this.x.redAdd(this.y).redSqr().redISub(e).redISub(t),o=n.redAdd(t),a=o.redSub(r),s=n.redSub(t),f=i.redMul(a),u=o.redMul(s),c=i.redMul(s),h=a.redMul(o);return this.curve.point(f,u,h,c)},u.prototype._projDbl=function(){var e,t,r,n,i,o,a=this.x.redAdd(this.y).redSqr(),s=this.x.redSqr(),f=this.y.redSqr();if(this.curve.twisted){var u=(n=this.curve._mulA(s)).redAdd(f);this.zOne?(e=a.redSub(s).redSub(f).redMul(u.redSub(this.curve.two)),t=u.redMul(n.redSub(f)),r=u.redSqr().redSub(u).redSub(u)):(i=this.z.redSqr(),o=u.redSub(i).redISub(i),e=a.redSub(s).redISub(f).redMul(o),t=u.redMul(n.redSub(f)),r=u.redMul(o))}else n=s.redAdd(f),i=this.curve._mulC(this.z).redSqr(),o=n.redSub(i).redSub(i),e=this.curve._mulC(a.redISub(n)).redMul(o),t=this.curve._mulC(n).redMul(s.redISub(f)),r=n.redMul(o);return this.curve.point(e,t,r)},u.prototype.dbl=function(){return this.isInfinity()?this:this.curve.extended?this._extDbl():this._projDbl()},u.prototype._extAdd=function(e){var t=this.y.redSub(this.x).redMul(e.y.redSub(e.x)),r=this.y.redAdd(this.x).redMul(e.y.redAdd(e.x)),n=this.t.redMul(this.curve.dd).redMul(e.t),i=this.z.redMul(e.z.redAdd(e.z)),o=r.redSub(t),a=i.redSub(n),s=i.redAdd(n),f=r.redAdd(t),u=o.redMul(a),c=s.redMul(f),h=o.redMul(f),l=a.redMul(s);return this.curve.point(u,c,l,h)},u.prototype._projAdd=function(e){var t,r,n=this.z.redMul(e.z),i=n.redSqr(),o=this.x.redMul(e.x),a=this.y.redMul(e.y),s=this.curve.d.redMul(o).redMul(a),f=i.redSub(s),u=i.redAdd(s),c=this.x.redAdd(this.y).redMul(e.x.redAdd(e.y)).redISub(o).redISub(a),h=n.redMul(f).redMul(c);return this.curve.twisted?(t=n.redMul(u).redMul(a.redSub(this.curve._mulA(o))),r=f.redMul(u)):(t=n.redMul(u).redMul(a.redSub(o)),r=this.curve._mulC(f).redMul(u)),this.curve.point(h,t,r)},u.prototype.add=function(e){return this.isInfinity()?e:e.isInfinity()?this:this.curve.extended?this._extAdd(e):this._projAdd(e)},u.prototype.mul=function(e){return this._hasDoubles(e)?this.curve._fixedNafMul(this,e):this.curve._wnafMul(this,e)},u.prototype.mulAdd=function(e,t,r){return this.curve._wnafMulAdd(1,[this,t],[e,r],2,!1)},u.prototype.jmulAdd=function(e,t,r){return this.curve._wnafMulAdd(1,[this,t],[e,r],2,!0)},u.prototype.normalize=function(){if(this.zOne)return this;var e=this.z.redInvm();return this.x=this.x.redMul(e),this.y=this.y.redMul(e),this.t&&(this.t=this.t.redMul(e)),this.z=this.curve.one,this.zOne=!0,this},u.prototype.neg=function(){return this.curve.point(this.x.redNeg(),this.y,this.z,this.t&&this.t.redNeg())},u.prototype.getX=function(){return this.normalize(),this.x.fromRed()},u.prototype.getY=function(){return this.normalize(),this.y.fromRed()},u.prototype.eq=function(e){return this===e||0===this.getX().cmp(e.getX())&&0===this.getY().cmp(e.getY())},u.prototype.eqXToP=function(e){var t=e.toRed(this.curve.red).redMul(this.z);if(0===this.x.cmp(t))return!0;for(var r=e.clone(),n=this.curve.redN.redMul(this.z);;){if(r.iadd(this.curve.n),r.cmp(this.curve.p)>=0)return!1;if(t.redIAdd(n),0===this.x.cmp(t))return!0}},u.prototype.toP=u.prototype.normalize,u.prototype.mixedAdd=u.prototype.add},(e,t,r)=>{"use strict";var n=r(9),i=r(34),o=r(185),a=n.rotl32,s=n.sum32,f=n.sum32_5,u=o.ft_1,c=i.BlockHash,h=[1518500249,1859775393,2400959708,3395469782];function l(){if(!(this instanceof l))return new l;c.call(this),this.h=[1732584193,4023233417,2562383102,271733878,3285377520],this.W=new Array(80)}n.inherits(l,c),e.exports=l,l.blockSize=512,l.outSize=160,l.hmacStrength=80,l.padLength=64,l.prototype._update=function(e,t){for(var r=this.W,n=0;n<16;n++)r[n]=e[t+n];for(;n{"use strict";var n=r(9).rotr32;function i(e,t,r){return e&t^~e&r}function o(e,t,r){return e&t^e&r^t&r}function a(e,t,r){return e^t^r}t.ft_1=function(e,t,r,n){return 0===e?i(t,r,n):1===e||3===e?a(t,r,n):2===e?o(t,r,n):void 0},t.ch32=i,t.maj32=o,t.p32=a,t.s0_256=function(e){return n(e,2)^n(e,13)^n(e,22)},t.s1_256=function(e){return n(e,6)^n(e,11)^n(e,25)},t.g0_256=function(e){return n(e,7)^n(e,18)^e>>>3},t.g1_256=function(e){return n(e,17)^n(e,19)^e>>>10}},(e,t,r)=>{"use strict";var n=r(9),i=r(88);function o(){if(!(this instanceof o))return new o;i.call(this),this.h=[3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]}n.inherits(o,i),e.exports=o,o.blockSize=512,o.outSize=224,o.hmacStrength=192,o.padLength=64,o.prototype._digest=function(e){return"hex"===e?n.toHex32(this.h.slice(0,7),"big"):n.split32(this.h.slice(0,7),"big")}},(e,t,r)=>{"use strict";var n=r(9),i=r(89);function o(){if(!(this instanceof o))return new o;i.call(this),this.h=[3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]}n.inherits(o,i),e.exports=o,o.blockSize=1024,o.outSize=384,o.hmacStrength=192,o.padLength=128,o.prototype._digest=function(e){return"hex"===e?n.toHex32(this.h.slice(0,12),"big"):n.split32(this.h.slice(0,12),"big")}},(e,t,r)=>{"use strict";var n=r(9),i=r(6);function o(e,t,r){if(!(this instanceof o))return new o(e,t,r);this.Hash=e,this.blockSize=e.blockSize/8,this.outSize=e.outSize/8,this.inner=null,this.outer=null,this._init(n.toArray(t,r))}e.exports=o,o.prototype._init=function(e){e.length>this.blockSize&&(e=(new this.Hash).update(e).digest()),i(e.length<=this.blockSize);for(var t=e.length;t{e.exports={doubles:{step:4,points:[["e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a","f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821"],["8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508","11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf"],["175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739","d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695"],["363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640","4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9"],["8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c","4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36"],["723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda","96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f"],["eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa","5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999"],["100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0","cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09"],["e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d","9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d"],["feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d","e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088"],["da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1","9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d"],["53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0","5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8"],["8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047","10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a"],["385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862","283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453"],["6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7","7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160"],["3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd","56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0"],["85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83","7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6"],["948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a","53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589"],["6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8","bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17"],["e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d","4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda"],["e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725","7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd"],["213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754","4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2"],["4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c","17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6"],["fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6","6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f"],["76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39","c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01"],["c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891","893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3"],["d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b","febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f"],["b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03","2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7"],["e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d","eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78"],["a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070","7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1"],["90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4","e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150"],["8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da","662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82"],["e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11","1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc"],["8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e","efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b"],["e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41","2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51"],["b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef","67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45"],["d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8","db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120"],["324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d","648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84"],["4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96","35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d"],["9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd","ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d"],["6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5","9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8"],["a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266","40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8"],["7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71","34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac"],["928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac","c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f"],["85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751","1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962"],["ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e","493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907"],["827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241","c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec"],["eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3","be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d"],["e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f","4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414"],["1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19","aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd"],["146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be","b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0"],["fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9","6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811"],["da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2","8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1"],["a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13","7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c"],["174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c","ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73"],["959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba","2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd"],["d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151","e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405"],["64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073","d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589"],["8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458","38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e"],["13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b","69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27"],["bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366","d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1"],["8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa","40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482"],["8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0","620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945"],["dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787","7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573"],["f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e","ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82"]]},naf:{wnd:7,points:[["f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9","388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672"],["2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4","d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6"],["5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc","6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da"],["acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe","cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37"],["774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb","d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b"],["f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8","ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81"],["d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e","581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58"],["defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34","4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77"],["2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c","85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a"],["352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5","321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c"],["2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f","2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67"],["9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714","73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402"],["daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729","a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55"],["c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db","2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482"],["6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4","e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82"],["1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5","b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396"],["605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479","2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49"],["62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d","80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf"],["80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f","1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a"],["7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb","d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7"],["d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9","eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933"],["49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963","758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a"],["77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74","958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6"],["f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530","e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37"],["463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b","5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e"],["f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247","cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6"],["caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1","cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476"],["2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120","4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40"],["7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435","91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61"],["754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18","673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683"],["e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8","59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5"],["186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb","3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b"],["df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f","55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417"],["5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143","efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868"],["290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba","e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a"],["af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45","f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6"],["766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a","744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996"],["59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e","c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e"],["f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8","e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d"],["7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c","30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2"],["948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519","e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e"],["7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab","100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437"],["3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca","ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311"],["d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf","8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4"],["1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610","68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575"],["733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4","f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d"],["15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c","d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d"],["a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940","edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629"],["e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980","a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06"],["311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3","66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374"],["34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf","9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee"],["f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63","4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1"],["d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448","fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b"],["32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf","5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661"],["7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5","8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6"],["ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6","8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e"],["16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5","5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d"],["eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99","f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc"],["78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51","f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4"],["494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5","42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c"],["a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5","204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b"],["c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997","4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913"],["841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881","73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154"],["5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5","39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865"],["36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66","d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc"],["336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726","ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224"],["8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede","6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e"],["1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94","60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6"],["85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31","3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511"],["29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51","b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b"],["a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252","ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2"],["4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5","cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c"],["d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b","6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3"],["ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4","322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d"],["af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f","6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700"],["e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889","2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4"],["591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246","b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196"],["11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984","998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4"],["3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a","b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257"],["cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030","bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13"],["c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197","6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096"],["c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593","c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38"],["a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef","21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f"],["347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38","60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448"],["da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a","49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a"],["c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111","5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4"],["4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502","7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437"],["3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea","be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7"],["cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26","8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d"],["b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986","39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a"],["d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e","62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54"],["48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4","25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77"],["dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda","ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517"],["6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859","cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10"],["e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f","f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125"],["eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c","6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e"],["13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942","fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1"],["ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a","1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2"],["b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80","5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423"],["ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d","438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8"],["8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1","cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758"],["52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63","c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375"],["e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352","6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d"],["7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193","ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec"],["5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00","9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0"],["32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58","ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c"],["e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7","d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4"],["8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8","c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f"],["4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e","67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649"],["3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d","cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826"],["674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b","299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5"],["d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f","f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87"],["30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6","462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b"],["be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297","62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc"],["93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a","7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c"],["b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c","ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f"],["d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52","4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a"],["d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb","bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46"],["463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065","bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f"],["7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917","603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03"],["74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9","cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08"],["30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3","553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8"],["9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57","712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373"],["176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66","ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3"],["75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8","9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8"],["809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721","9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1"],["1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180","4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9"]]}}},(e,t,r)=>{"use strict";var n=r(2),i=r(191),o=r(5),a=r(52),s=r(51),f=o.assert,u=r(192),c=r(193);function h(e){if(!(this instanceof h))return new h(e);"string"==typeof e&&(f(Object.prototype.hasOwnProperty.call(a,e),"Unknown curve "+e),e=a[e]),e instanceof a.PresetCurve&&(e={curve:e}),this.curve=e.curve.curve,this.n=this.curve.n,this.nh=this.n.ushrn(1),this.g=this.curve.g,this.g=e.curve.g,this.g.precompute(e.curve.n.bitLength()+1),this.hash=e.hash||e.curve.hash}e.exports=h,h.prototype.keyPair=function(e){return new u(this,e)},h.prototype.keyFromPrivate=function(e,t){return u.fromPrivate(this,e,t)},h.prototype.keyFromPublic=function(e,t){return u.fromPublic(this,e,t)},h.prototype.genKeyPair=function(e){e||(e={});for(var t=new i({hash:this.hash,pers:e.pers,persEnc:e.persEnc||"utf8",entropy:e.entropy||s(this.hash.hmacStrength),entropyEnc:e.entropy&&e.entropyEnc||"utf8",nonce:this.n.toArray()}),r=this.n.byteLength(),o=this.n.sub(new n(2));;){var a=new n(t.generate(r));if(!(a.cmp(o)>0))return a.iaddn(1),this.keyFromPrivate(a)}},h.prototype._truncateToN=function(e,t){var r=8*e.byteLength()-this.n.bitLength();return r>0&&(e=e.ushrn(r)),!t&&e.cmp(this.n)>=0?e.sub(this.n):e},h.prototype.sign=function(e,t,r,o){"object"==typeof r&&(o=r,r=null),o||(o={}),t=this.keyFromPrivate(t,r),e=this._truncateToN(new n(e,16));for(var a=this.n.byteLength(),s=t.getPrivate().toArray("be",a),f=e.toArray("be",a),u=new i({hash:this.hash,entropy:s,nonce:f,pers:o.pers,persEnc:o.persEnc||"utf8"}),h=this.n.sub(new n(1)),l=0;;l++){var d=o.k?o.k(l):new n(u.generate(this.n.byteLength()));if(!((d=this._truncateToN(d,!0)).cmpn(1)<=0||d.cmp(h)>=0)){var p=this.g.mul(d);if(!p.isInfinity()){var b=p.getX(),y=b.umod(this.n);if(0!==y.cmpn(0)){var m=d.invm(this.n).mul(y.mul(t.getPrivate()).iadd(e));if(0!==(m=m.umod(this.n)).cmpn(0)){var g=(p.getY().isOdd()?1:0)|(0!==b.cmp(y)?2:0);return o.canonical&&m.cmp(this.nh)>0&&(m=this.n.sub(m),g^=1),new c({r:y,s:m,recoveryParam:g})}}}}}},h.prototype.verify=function(e,t,r,i){e=this._truncateToN(new n(e,16)),r=this.keyFromPublic(r,i);var o=(t=new c(t,"hex")).r,a=t.s;if(o.cmpn(1)<0||o.cmp(this.n)>=0)return!1;if(a.cmpn(1)<0||a.cmp(this.n)>=0)return!1;var s,f=a.invm(this.n),u=f.mul(e).umod(this.n),h=f.mul(o).umod(this.n);return this.curve._maxwellTrick?!(s=this.g.jmulAdd(u,r.getPublic(),h)).isInfinity()&&s.eqXToP(o):!(s=this.g.mulAdd(u,r.getPublic(),h)).isInfinity()&&0===s.getX().umod(this.n).cmp(o)},h.prototype.recoverPubKey=function(e,t,r,i){f((3&r)===r,"The recovery param is more than two bits"),t=new c(t,i);var o=this.n,a=new n(e),s=t.r,u=t.s,h=1&r,l=r>>1;if(s.cmp(this.curve.p.umod(this.curve.n))>=0&&l)throw new Error("Unable to find sencond key candinate");s=l?this.curve.pointFromX(s.add(this.curve.n),h):this.curve.pointFromX(s,h);var d=t.r.invm(o),p=o.sub(a).mul(d).umod(o),b=u.mul(d).umod(o);return this.g.mulAdd(p,s,b)},h.prototype.getKeyRecoveryParam=function(e,t,r,n){if(null!==(t=new c(t,n)).recoveryParam)return t.recoveryParam;for(var i=0;i<4;i++){var o;try{o=this.recoverPubKey(e,t,i)}catch(e){continue}if(o.eq(r))return i}throw new Error("Unable to find valid recovery factor")}},(e,t,r)=>{"use strict";var n=r(53),i=r(86),o=r(6);function a(e){if(!(this instanceof a))return new a(e);this.hash=e.hash,this.predResist=!!e.predResist,this.outLen=this.hash.outSize,this.minEntropy=e.minEntropy||this.hash.hmacStrength,this._reseed=null,this.reseedInterval=null,this.K=null,this.V=null;var t=i.toArray(e.entropy,e.entropyEnc||"hex"),r=i.toArray(e.nonce,e.nonceEnc||"hex"),n=i.toArray(e.pers,e.persEnc||"hex");o(t.length>=this.minEntropy/8,"Not enough entropy. Minimum is: "+this.minEntropy+" bits"),this._init(t,r,n)}e.exports=a,a.prototype._init=function(e,t,r){var n=e.concat(t).concat(r);this.K=new Array(this.outLen/8),this.V=new Array(this.outLen/8);for(var i=0;i=this.minEntropy/8,"Not enough entropy. Minimum is: "+this.minEntropy+" bits"),this._update(e.concat(r||[])),this._reseed=1},a.prototype.generate=function(e,t,r,n){if(this._reseed>this.reseedInterval)throw new Error("Reseed is required");"string"!=typeof t&&(n=r,r=t,t=null),r&&(r=i.toArray(r,n||"hex"),this._update(r));for(var o=[];o.length{"use strict";var n=r(2),i=r(5).assert;function o(e,t){this.ec=e,this.priv=null,this.pub=null,t.priv&&this._importPrivate(t.priv,t.privEnc),t.pub&&this._importPublic(t.pub,t.pubEnc)}e.exports=o,o.fromPublic=function(e,t,r){return t instanceof o?t:new o(e,{pub:t,pubEnc:r})},o.fromPrivate=function(e,t,r){return t instanceof o?t:new o(e,{priv:t,privEnc:r})},o.prototype.validate=function(){var e=this.getPublic();return e.isInfinity()?{result:!1,reason:"Invalid public key"}:e.validate()?e.mul(this.ec.curve.n).isInfinity()?{result:!0,reason:null}:{result:!1,reason:"Public key * N != O"}:{result:!1,reason:"Public key is not a point"}},o.prototype.getPublic=function(e,t){return"string"==typeof e&&(t=e,e=null),this.pub||(this.pub=this.ec.g.mul(this.priv)),t?this.pub.encode(t,e):this.pub},o.prototype.getPrivate=function(e){return"hex"===e?this.priv.toString(16,2):this.priv},o.prototype._importPrivate=function(e,t){this.priv=new n(e,t||16),this.priv=this.priv.umod(this.ec.curve.n)},o.prototype._importPublic=function(e,t){if(e.x||e.y)return"mont"===this.ec.curve.type?i(e.x,"Need x coordinate"):"short"!==this.ec.curve.type&&"edwards"!==this.ec.curve.type||i(e.x&&e.y,"Need both x and y coordinate"),void(this.pub=this.ec.curve.point(e.x,e.y));this.pub=this.ec.curve.decodePoint(e,t)},o.prototype.derive=function(e){return e.validate()||i(e.validate(),"public point not validated"),e.mul(this.priv).getX()},o.prototype.sign=function(e,t,r){return this.ec.sign(e,this,t,r)},o.prototype.verify=function(e,t){return this.ec.verify(e,t,this)},o.prototype.inspect=function(){return""}},(e,t,r)=>{"use strict";var n=r(2),i=r(5),o=i.assert;function a(e,t){if(e instanceof a)return e;this._importDER(e,t)||(o(e.r&&e.s,"Signature without r or s"),this.r=new n(e.r,16),this.s=new n(e.s,16),void 0===e.recoveryParam?this.recoveryParam=null:this.recoveryParam=e.recoveryParam)}function s(){this.place=0}function f(e,t){var r=e[t.place++];if(!(128&r))return r;var n=15&r;if(0===n||n>4)return!1;for(var i=0,o=0,a=t.place;o>>=0;return!(i<=127)&&(t.place=a,i)}function u(e){for(var t=0,r=e.length-1;!e[t]&&!(128&e[t+1])&&t>>3);for(e.push(128|r);--r;)e.push(t>>>(r<<3)&255);e.push(t)}}e.exports=a,a.prototype._importDER=function(e,t){e=i.toArray(e,t);var r=new s;if(48!==e[r.place++])return!1;var o=f(e,r);if(!1===o)return!1;if(o+r.place!==e.length)return!1;if(2!==e[r.place++])return!1;var a=f(e,r);if(!1===a)return!1;var u=e.slice(r.place,a+r.place);if(r.place+=a,2!==e[r.place++])return!1;var c=f(e,r);if(!1===c)return!1;if(e.length!==c+r.place)return!1;var h=e.slice(r.place,c+r.place);if(0===u[0]){if(!(128&u[1]))return!1;u=u.slice(1)}if(0===h[0]){if(!(128&h[1]))return!1;h=h.slice(1)}return this.r=new n(u),this.s=new n(h),this.recoveryParam=null,!0},a.prototype.toDER=function(e){var t=this.r.toArray(),r=this.s.toArray();for(128&t[0]&&(t=[0].concat(t)),128&r[0]&&(r=[0].concat(r)),t=u(t),r=u(r);!(r[0]||128&r[1]);)r=r.slice(1);var n=[2];c(n,t.length),(n=n.concat(t)).push(2),c(n,r.length);var o=n.concat(r),a=[48];return c(a,o.length),a=a.concat(o),i.encode(a,e)}},(e,t,r)=>{"use strict";var n=r(53),i=r(52),o=r(5),a=o.assert,s=o.parseBytes,f=r(195),u=r(196);function c(e){if(a("ed25519"===e,"only tested with ed25519 so far"),!(this instanceof c))return new c(e);e=i[e].curve,this.curve=e,this.g=e.g,this.g.precompute(e.n.bitLength()+1),this.pointClass=e.point().constructor,this.encodingLength=Math.ceil(e.n.bitLength()/8),this.hash=n.sha512}e.exports=c,c.prototype.sign=function(e,t){e=s(e);var r=this.keyFromSecret(t),n=this.hashInt(r.messagePrefix(),e),i=this.g.mul(n),o=this.encodePoint(i),a=this.hashInt(o,r.pubBytes(),e).mul(r.priv()),f=n.add(a).umod(this.curve.n);return this.makeSignature({R:i,S:f,Rencoded:o})},c.prototype.verify=function(e,t,r){e=s(e),t=this.makeSignature(t);var n=this.keyFromPublic(r),i=this.hashInt(t.Rencoded(),n.pubBytes(),e),o=this.g.mul(t.S());return t.R().add(n.pub().mul(i)).eq(o)},c.prototype.hashInt=function(){for(var e=this.hash(),t=0;t{"use strict";var n=r(5),i=n.assert,o=n.parseBytes,a=n.cachedProperty;function s(e,t){this.eddsa=e,this._secret=o(t.secret),e.isPoint(t.pub)?this._pub=t.pub:this._pubBytes=o(t.pub)}s.fromPublic=function(e,t){return t instanceof s?t:new s(e,{pub:t})},s.fromSecret=function(e,t){return t instanceof s?t:new s(e,{secret:t})},s.prototype.secret=function(){return this._secret},a(s,"pubBytes",(function(){return this.eddsa.encodePoint(this.pub())})),a(s,"pub",(function(){return this._pubBytes?this.eddsa.decodePoint(this._pubBytes):this.eddsa.g.mul(this.priv())})),a(s,"privBytes",(function(){var e=this.eddsa,t=this.hash(),r=e.encodingLength-1,n=t.slice(0,e.encodingLength);return n[0]&=248,n[r]&=127,n[r]|=64,n})),a(s,"priv",(function(){return this.eddsa.decodeInt(this.privBytes())})),a(s,"hash",(function(){return this.eddsa.hash().update(this.secret()).digest()})),a(s,"messagePrefix",(function(){return this.hash().slice(this.eddsa.encodingLength)})),s.prototype.sign=function(e){return i(this._secret,"KeyPair can only verify"),this.eddsa.sign(e,this)},s.prototype.verify=function(e,t){return this.eddsa.verify(e,t,this)},s.prototype.getSecret=function(e){return i(this._secret,"KeyPair is public only"),n.encode(this.secret(),e)},s.prototype.getPublic=function(e){return n.encode(this.pubBytes(),e)},e.exports=s},(e,t,r)=>{"use strict";var n=r(2),i=r(5),o=i.assert,a=i.cachedProperty,s=i.parseBytes;function f(e,t){this.eddsa=e,"object"!=typeof t&&(t=s(t)),Array.isArray(t)&&(t={R:t.slice(0,e.encodingLength),S:t.slice(e.encodingLength)}),o(t.R&&t.S,"Signature without R or S"),e.isPoint(t.R)&&(this._R=t.R),t.S instanceof n&&(this._S=t.S),this._Rencoded=Array.isArray(t.R)?t.R:t.Rencoded,this._Sencoded=Array.isArray(t.S)?t.S:t.Sencoded}a(f,"S",(function(){return this.eddsa.decodeInt(this.Sencoded())})),a(f,"R",(function(){return this.eddsa.decodePoint(this.Rencoded())})),a(f,"Rencoded",(function(){return this.eddsa.encodePoint(this.R())})),a(f,"Sencoded",(function(){return this.eddsa.encodeInt(this.S())})),f.prototype.toBytes=function(){return this.Rencoded().concat(this.Sencoded())},f.prototype.toHex=function(){return i.encode(this.toBytes(),"hex").toUpperCase()},e.exports=f},(e,t,r)=>{e.exports=r(10).EventEmitter},(e,t,r)=>{"use strict";function n(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function i(e){for(var t=1;t0?this.tail.next=t:this.head=t,this.tail=t,++this.length}},{key:"unshift",value:function(e){var t={data:e,next:this.head};0===this.length&&(this.tail=t),this.head=t,++this.length}},{key:"shift",value:function(){if(0!==this.length){var e=this.head.data;return 1===this.length?this.head=this.tail=null:this.head=this.head.next,--this.length,e}}},{key:"clear",value:function(){this.head=this.tail=null,this.length=0}},{key:"join",value:function(e){if(0===this.length)return"";for(var t=this.head,r=""+t.data;t=t.next;)r+=e+t.data;return r}},{key:"concat",value:function(e){if(0===this.length)return f.alloc(0);for(var t,r,n,i=f.allocUnsafe(e>>>0),o=this.head,a=0;o;)t=o.data,r=i,n=a,f.prototype.copy.call(t,r,n),a+=o.data.length,o=o.next;return i}},{key:"consume",value:function(e,t){var r;return ei.length?i.length:e;if(o===i.length?n+=i:n+=i.slice(0,e),0==(e-=o)){o===i.length?(++r,t.next?this.head=t.next:this.head=this.tail=null):(this.head=t,t.data=i.slice(o));break}++r}return this.length-=r,n}},{key:"_getBuffer",value:function(e){var t=f.allocUnsafe(e),r=this.head,n=1;for(r.data.copy(t),e-=r.data.length;r=r.next;){var i=r.data,o=e>i.length?i.length:e;if(i.copy(t,t.length-e,0,o),0==(e-=o)){o===i.length?(++n,r.next?this.head=r.next:this.head=this.tail=null):(this.head=r,r.data=i.slice(o));break}++n}return this.length-=n,t}},{key:c,value:function(e,t){return u(this,i(i({},t),{},{depth:0,customInspect:!1}))}}])&&a(t.prototype,r),Object.defineProperty(t,"prototype",{writable:!1}),e}()},(e,t,r)=>{"use strict";var n;function i(e,t,r){return(t=function(e){var t=function(e,t){if("object"!=typeof e||null===e)return e;var r=e[Symbol.toPrimitive];if(void 0!==r){var n=r.call(e,"string");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(e);return"symbol"==typeof t?t:String(t)}(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}var o=r(55),a=Symbol("lastResolve"),s=Symbol("lastReject"),f=Symbol("error"),u=Symbol("ended"),c=Symbol("lastPromise"),h=Symbol("handlePromise"),l=Symbol("stream");function d(e,t){return{value:e,done:t}}function p(e){var t=e[a];if(null!==t){var r=e[l].read();null!==r&&(e[c]=null,e[a]=null,e[s]=null,t(d(r,!1)))}}function b(e){process.nextTick(p,e)}var y=Object.getPrototypeOf((function(){})),m=Object.setPrototypeOf((i(n={get stream(){return this[l]},next:function(){var e=this,t=this[f];if(null!==t)return Promise.reject(t);if(this[u])return Promise.resolve(d(void 0,!0));if(this[l].destroyed)return new Promise((function(t,r){process.nextTick((function(){e[f]?r(e[f]):t(d(void 0,!0))}))}));var r,n=this[c];if(n)r=new Promise(function(e,t){return function(r,n){e.then((function(){t[u]?r(d(void 0,!0)):t[h](r,n)}),n)}}(n,this));else{var i=this[l].read();if(null!==i)return Promise.resolve(d(i,!1));r=new Promise(this[h])}return this[c]=r,r}},Symbol.asyncIterator,(function(){return this})),i(n,"return",(function(){var e=this;return new Promise((function(t,r){e[l].destroy(null,(function(e){e?r(e):t(d(void 0,!0))}))}))})),n),y);e.exports=function(e){var t,r=Object.create(m,(i(t={},l,{value:e,writable:!0}),i(t,a,{value:null,writable:!0}),i(t,s,{value:null,writable:!0}),i(t,f,{value:null,writable:!0}),i(t,u,{value:e._readableState.endEmitted,writable:!0}),i(t,h,{value:function(e,t){var n=r[l].read();n?(r[c]=null,r[a]=null,r[s]=null,e(d(n,!1))):(r[a]=e,r[s]=t)},writable:!0}),t));return r[c]=null,o(e,(function(e){if(e&&"ERR_STREAM_PREMATURE_CLOSE"!==e.code){var t=r[s];return null!==t&&(r[c]=null,r[a]=null,r[s]=null,t(e)),void(r[f]=e)}var n=r[a];null!==n&&(r[c]=null,r[a]=null,r[s]=null,n(d(void 0,!0))),r[u]=!0})),e.on("readable",b.bind(null,r)),r}},e=>{e.exports=function(){throw new Error("Readable.from is not available in the browser")}},(e,t,r)=>{"use strict";e.exports=i;var n=r(95);function i(e){if(!(this instanceof i))return new i(e);n.call(this,e)}r(0)(i,n),i.prototype._transform=function(e,t,r){r(null,e)}},(e,t,r)=>{"use strict";var n,i=r(21).q,o=i.ERR_MISSING_ARGS,a=i.ERR_STREAM_DESTROYED;function s(e){if(e)throw e}function f(e){e()}function u(e,t){return e.pipe(t)}e.exports=function(){for(var e=arguments.length,t=new Array(e),i=0;i0,(function(e){c||(c=e),e&&l.forEach(f),o||(l.forEach(f),h(c))}))}));return t.reduce(u)}},(e,t,r)=>{var n=r(0),i=r(18),o=r(1).Buffer,a=[1518500249,1859775393,-1894007588,-899497514],s=new Array(80);function f(){this.init(),this._w=s,i.call(this,64,56)}function u(e){return e<<30|e>>>2}function c(e,t,r,n){return 0===e?t&r|~t&n:2===e?t&r|t&n|r&n:t^r^n}n(f,i),f.prototype.init=function(){return this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520,this},f.prototype._update=function(e){for(var t,r=this._w,n=0|this._a,i=0|this._b,o=0|this._c,s=0|this._d,f=0|this._e,h=0;h<16;++h)r[h]=e.readInt32BE(4*h);for(;h<80;++h)r[h]=r[h-3]^r[h-8]^r[h-14]^r[h-16];for(var l=0;l<80;++l){var d=~~(l/20),p=0|((t=n)<<5|t>>>27)+c(d,i,o,s)+f+r[l]+a[d];f=s,s=o,o=u(i),i=n,n=p}this._a=n+this._a|0,this._b=i+this._b|0,this._c=o+this._c|0,this._d=s+this._d|0,this._e=f+this._e|0},f.prototype._hash=function(){var e=o.allocUnsafe(20);return e.writeInt32BE(0|this._a,0),e.writeInt32BE(0|this._b,4),e.writeInt32BE(0|this._c,8),e.writeInt32BE(0|this._d,12),e.writeInt32BE(0|this._e,16),e},e.exports=f},(e,t,r)=>{var n=r(0),i=r(18),o=r(1).Buffer,a=[1518500249,1859775393,-1894007588,-899497514],s=new Array(80);function f(){this.init(),this._w=s,i.call(this,64,56)}function u(e){return e<<5|e>>>27}function c(e){return e<<30|e>>>2}function h(e,t,r,n){return 0===e?t&r|~t&n:2===e?t&r|t&n|r&n:t^r^n}n(f,i),f.prototype.init=function(){return this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520,this},f.prototype._update=function(e){for(var t,r=this._w,n=0|this._a,i=0|this._b,o=0|this._c,s=0|this._d,f=0|this._e,l=0;l<16;++l)r[l]=e.readInt32BE(4*l);for(;l<80;++l)r[l]=(t=r[l-3]^r[l-8]^r[l-14]^r[l-16])<<1|t>>>31;for(var d=0;d<80;++d){var p=~~(d/20),b=u(n)+h(p,i,o,s)+f+r[d]+a[p]|0;f=s,s=o,o=c(i),i=n,n=b}this._a=n+this._a|0,this._b=i+this._b|0,this._c=o+this._c|0,this._d=s+this._d|0,this._e=f+this._e|0},f.prototype._hash=function(){var e=o.allocUnsafe(20);return e.writeInt32BE(0|this._a,0),e.writeInt32BE(0|this._b,4),e.writeInt32BE(0|this._c,8),e.writeInt32BE(0|this._d,12),e.writeInt32BE(0|this._e,16),e},e.exports=f},(e,t,r)=>{var n=r(0),i=r(96),o=r(18),a=r(1).Buffer,s=new Array(64);function f(){this.init(),this._w=s,o.call(this,64,56)}n(f,i),f.prototype.init=function(){return this._a=3238371032,this._b=914150663,this._c=812702999,this._d=4144912697,this._e=4290775857,this._f=1750603025,this._g=1694076839,this._h=3204075428,this},f.prototype._hash=function(){var e=a.allocUnsafe(28);return e.writeInt32BE(this._a,0),e.writeInt32BE(this._b,4),e.writeInt32BE(this._c,8),e.writeInt32BE(this._d,12),e.writeInt32BE(this._e,16),e.writeInt32BE(this._f,20),e.writeInt32BE(this._g,24),e},e.exports=f},(e,t,r)=>{var n=r(0),i=r(97),o=r(18),a=r(1).Buffer,s=new Array(160);function f(){this.init(),this._w=s,o.call(this,128,112)}n(f,i),f.prototype.init=function(){return this._ah=3418070365,this._bh=1654270250,this._ch=2438529370,this._dh=355462360,this._eh=1731405415,this._fh=2394180231,this._gh=3675008525,this._hh=1203062813,this._al=3238371032,this._bl=914150663,this._cl=812702999,this._dl=4144912697,this._el=4290775857,this._fl=1750603025,this._gl=1694076839,this._hl=3204075428,this},f.prototype._hash=function(){var e=a.allocUnsafe(48);function t(t,r,n){e.writeInt32BE(t,n),e.writeInt32BE(r,n+4)}return t(this._ah,this._al,0),t(this._bh,this._bl,8),t(this._ch,this._cl,16),t(this._dh,this._dl,24),t(this._eh,this._el,32),t(this._fh,this._fl,40),e},e.exports=f},(e,t,r)=>{e.exports=i;var n=r(10).EventEmitter;function i(){n.call(this)}r(0)(i,n),i.Readable=r(98),i.Writable=r(101),i.Duplex=r(29),i.Transform=r(102),i.PassThrough=r(212),i.finished=r(58),i.pipeline=r(213),i.Stream=i,i.prototype.pipe=function(e,t){var r=this;function i(t){e.writable&&!1===e.write(t)&&r.pause&&r.pause()}function o(){r.readable&&r.resume&&r.resume()}r.on("data",i),e.on("drain",o),e._isStdio||t&&!1===t.end||(r.on("end",s),r.on("close",f));var a=!1;function s(){a||(a=!0,e.end())}function f(){a||(a=!0,"function"==typeof e.destroy&&e.destroy())}function u(e){if(c(),0===n.listenerCount(this,"error"))throw e}function c(){r.removeListener("data",i),e.removeListener("drain",o),r.removeListener("end",s),r.removeListener("close",f),r.removeListener("error",u),e.removeListener("error",u),r.removeListener("end",c),r.removeListener("close",c),e.removeListener("close",c)}return r.on("error",u),e.on("error",u),r.on("end",c),r.on("close",c),e.on("close",c),e.emit("pipe",r),e}},(e,t,r)=>{e.exports=r(10).EventEmitter},(e,t,r)=>{"use strict";function n(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function i(e){for(var t=1;t0?this.tail.next=t:this.head=t,this.tail=t,++this.length}},{key:"unshift",value:function(e){var t={data:e,next:this.head};0===this.length&&(this.tail=t),this.head=t,++this.length}},{key:"shift",value:function(){if(0!==this.length){var e=this.head.data;return 1===this.length?this.head=this.tail=null:this.head=this.head.next,--this.length,e}}},{key:"clear",value:function(){this.head=this.tail=null,this.length=0}},{key:"join",value:function(e){if(0===this.length)return"";for(var t=this.head,r=""+t.data;t=t.next;)r+=e+t.data;return r}},{key:"concat",value:function(e){if(0===this.length)return f.alloc(0);for(var t,r,n,i=f.allocUnsafe(e>>>0),o=this.head,a=0;o;)t=o.data,r=i,n=a,f.prototype.copy.call(t,r,n),a+=o.data.length,o=o.next;return i}},{key:"consume",value:function(e,t){var r;return ei.length?i.length:e;if(o===i.length?n+=i:n+=i.slice(0,e),0==(e-=o)){o===i.length?(++r,t.next?this.head=t.next:this.head=this.tail=null):(this.head=t,t.data=i.slice(o));break}++r}return this.length-=r,n}},{key:"_getBuffer",value:function(e){var t=f.allocUnsafe(e),r=this.head,n=1;for(r.data.copy(t),e-=r.data.length;r=r.next;){var i=r.data,o=e>i.length?i.length:e;if(i.copy(t,t.length-e,0,o),0==(e-=o)){o===i.length?(++n,r.next?this.head=r.next:this.head=this.tail=null):(this.head=r,r.data=i.slice(o));break}++n}return this.length-=n,t}},{key:c,value:function(e,t){return u(this,i(i({},t),{},{depth:0,customInspect:!1}))}}])&&a(t.prototype,r),Object.defineProperty(t,"prototype",{writable:!1}),e}()},(e,t,r)=>{"use strict";var n;function i(e,t,r){return(t=function(e){var t=function(e,t){if("object"!=typeof e||null===e)return e;var r=e[Symbol.toPrimitive];if(void 0!==r){var n=r.call(e,"string");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(e);return"symbol"==typeof t?t:String(t)}(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}var o=r(58),a=Symbol("lastResolve"),s=Symbol("lastReject"),f=Symbol("error"),u=Symbol("ended"),c=Symbol("lastPromise"),h=Symbol("handlePromise"),l=Symbol("stream");function d(e,t){return{value:e,done:t}}function p(e){var t=e[a];if(null!==t){var r=e[l].read();null!==r&&(e[c]=null,e[a]=null,e[s]=null,t(d(r,!1)))}}function b(e){process.nextTick(p,e)}var y=Object.getPrototypeOf((function(){})),m=Object.setPrototypeOf((i(n={get stream(){return this[l]},next:function(){var e=this,t=this[f];if(null!==t)return Promise.reject(t);if(this[u])return Promise.resolve(d(void 0,!0));if(this[l].destroyed)return new Promise((function(t,r){process.nextTick((function(){e[f]?r(e[f]):t(d(void 0,!0))}))}));var r,n=this[c];if(n)r=new Promise(function(e,t){return function(r,n){e.then((function(){t[u]?r(d(void 0,!0)):t[h](r,n)}),n)}}(n,this));else{var i=this[l].read();if(null!==i)return Promise.resolve(d(i,!1));r=new Promise(this[h])}return this[c]=r,r}},Symbol.asyncIterator,(function(){return this})),i(n,"return",(function(){var e=this;return new Promise((function(t,r){e[l].destroy(null,(function(e){e?r(e):t(d(void 0,!0))}))}))})),n),y);e.exports=function(e){var t,r=Object.create(m,(i(t={},l,{value:e,writable:!0}),i(t,a,{value:null,writable:!0}),i(t,s,{value:null,writable:!0}),i(t,f,{value:null,writable:!0}),i(t,u,{value:e._readableState.endEmitted,writable:!0}),i(t,h,{value:function(e,t){var n=r[l].read();n?(r[c]=null,r[a]=null,r[s]=null,e(d(n,!1))):(r[a]=e,r[s]=t)},writable:!0}),t));return r[c]=null,o(e,(function(e){if(e&&"ERR_STREAM_PREMATURE_CLOSE"!==e.code){var t=r[s];return null!==t&&(r[c]=null,r[a]=null,r[s]=null,t(e)),void(r[f]=e)}var n=r[a];null!==n&&(r[c]=null,r[a]=null,r[s]=null,n(d(void 0,!0))),r[u]=!0})),e.on("readable",b.bind(null,r)),r}},e=>{e.exports=function(){throw new Error("Readable.from is not available in the browser")}},(e,t,r)=>{"use strict";e.exports=i;var n=r(102);function i(e){if(!(this instanceof i))return new i(e);n.call(this,e)}r(0)(i,n),i.prototype._transform=function(e,t,r){r(null,e)}},(e,t,r)=>{"use strict";var n,i=r(22).q,o=i.ERR_MISSING_ARGS,a=i.ERR_STREAM_DESTROYED;function s(e){if(e)throw e}function f(e){e()}function u(e,t){return e.pipe(t)}e.exports=function(){for(var e=arguments.length,t=new Array(e),i=0;i0,(function(e){c||(c=e),e&&l.forEach(f),o||(l.forEach(f),h(c))}))}));return t.reduce(u)}},(e,t,r)=>{var n,i,o=r(1).Buffer,a=r(104),s=r(105),f=r(106),u=r(108),c=r.g.crypto&&r.g.crypto.subtle,h={sha:"SHA-1","sha-1":"SHA-1",sha1:"SHA-1",sha256:"SHA-256","sha-256":"SHA-256",sha384:"SHA-384","sha-384":"SHA-384","sha-512":"SHA-512",sha512:"SHA-512"},l=[];function d(){return i||(i=r.g.process&&r.g.process.nextTick?r.g.process.nextTick:r.g.queueMicrotask?r.g.queueMicrotask:r.g.setImmediate?r.g.setImmediate:r.g.setTimeout)}function p(e,t,r,n,i){return c.importKey("raw",e,{name:"PBKDF2"},!1,["deriveBits"]).then((function(e){return c.deriveBits({name:"PBKDF2",salt:t,iterations:r,hash:{name:i}},e,n<<3)})).then((function(e){return o.from(e)}))}e.exports=function(e,t,i,b,y,m){"function"==typeof y&&(m=y,y=void 0);var g=h[(y=y||"sha1").toLowerCase()];if(g&&"function"==typeof r.g.Promise){if(a(i,b),e=u(e,s,"Password"),t=u(t,s,"Salt"),"function"!=typeof m)throw new Error("No callback provided to pbkdf2");!function(e,t){e.then((function(e){d()((function(){t(null,e)}))}),(function(e){d()((function(){t(e)}))}))}(function(e){if(r.g.process&&!r.g.process.browser)return Promise.resolve(!1);if(!c||!c.importKey||!c.deriveBits)return Promise.resolve(!1);if(void 0!==l[e])return l[e];var t=p(n=n||o.alloc(8),n,10,128,e).then((function(){return!0})).catch((function(){return!1}));return l[e]=t,t}(g).then((function(r){return r?p(e,t,i,b,g):f(e,t,i,b,y)})),m)}else d()((function(){var r;try{r=f(e,t,i,b,y)}catch(e){return m(e)}m(null,r)}))}},(e,t,r)=>{var n=r(73),i=r(159).Buffer,o=r(61),a=r(264),s=r(268),f=i.from("Bitcoin seed","utf8"),u=2147483648,c={private:76066276,public:76067358};function h(e){this.versions=e||c,this.depth=0,this.index=0,this._privateKey=null,this._publicKey=null,this.chainCode=null,this._fingerprint=0,this.parentFingerprint=0}function l(e,t,r){var n=i.allocUnsafe(78);n.writeUInt32BE(t,0),n.writeUInt8(e.depth,4);var o=e.depth?e.parentFingerprint:0;return n.writeUInt32BE(o,5),n.writeUInt32BE(e.index,9),e.chainCode.copy(n,13),r.copy(n,45),n}function d(e){var t=o.createHash("sha256").update(e).digest();return o.createHash("ripemd160").update(t).digest()}Object.defineProperty(h.prototype,"fingerprint",{get:function(){return this._fingerprint}}),Object.defineProperty(h.prototype,"identifier",{get:function(){return this._identifier}}),Object.defineProperty(h.prototype,"pubKeyHash",{get:function(){return this.identifier}}),Object.defineProperty(h.prototype,"privateKey",{get:function(){return this._privateKey},set:function(e){n.equal(e.length,32,"Private key must be 32 bytes."),n(!0===s.privateKeyVerify(e),"Invalid private key"),this._privateKey=e,this._publicKey=s.publicKeyCreate(e,!0),this._identifier=d(this.publicKey),this._fingerprint=this._identifier.slice(0,4).readUInt32BE(0)}}),Object.defineProperty(h.prototype,"publicKey",{get:function(){return this._publicKey},set:function(e){n(33===e.length||65===e.length,"Public key must be 33 or 65 bytes."),n(!0===s.publicKeyVerify(e),"Invalid public key"),this._publicKey=s.publicKeyConvert(e,!0),this._identifier=d(this.publicKey),this._fingerprint=this._identifier.slice(0,4).readUInt32BE(0),this._privateKey=null}}),Object.defineProperty(h.prototype,"privateExtendedKey",{get:function(){return this._privateKey?a.encode(l(this,this.versions.private,i.concat([i.alloc(1,0),this.privateKey]))):null}}),Object.defineProperty(h.prototype,"publicExtendedKey",{get:function(){return a.encode(l(this,this.versions.public,this.publicKey))}}),h.prototype.derive=function(e){if("m"===e||"M"===e||"m'"===e||"M'"===e)return this;var t=e.split("/"),r=this;return t.forEach((function(e,t){if(0!==t){var i=e.length>1&&"'"===e[e.length-1],o=parseInt(e,10);n(o=u,a=i.allocUnsafe(4);if(a.writeUInt32BE(e,0),r){n(this.privateKey,"Could not derive hardened child key");var f=this.privateKey,c=i.alloc(1,0);f=i.concat([c,f]),t=i.concat([f,a])}else t=i.concat([this.publicKey,a]);var l=o.createHmac("sha512",this.chainCode).update(t).digest(),d=l.slice(0,32),p=l.slice(32),b=new h(this.versions);if(this.privateKey)try{b.privateKey=s.privateKeyTweakAdd(this.privateKey,d)}catch(t){return this.deriveChild(e+1)}else try{b.publicKey=s.publicKeyTweakAdd(this.publicKey,d,!0)}catch(t){return this.deriveChild(e+1)}return b.chainCode=p,b.depth=this.depth+1,b.parentFingerprint=this.fingerprint,b.index=e,b},h.prototype.sign=function(e){return s.sign(e,this.privateKey).signature},h.prototype.verify=function(e,t){return s.verify(e,t,this.publicKey)},h.prototype.wipePrivateData=function(){return this._privateKey&&o.randomBytes(this._privateKey.length).copy(this._privateKey),this._privateKey=null,this},h.prototype.toJSON=function(){return{xpriv:this.privateExtendedKey,xpub:this.publicExtendedKey}},h.fromMasterSeed=function(e,t){var r=o.createHmac("sha512",f).update(e).digest(),n=r.slice(0,32),i=r.slice(32),a=new h(t);return a.chainCode=i,a.privateKey=n,a},h.fromExtendedKey=function(e,t){var r=new h(t=t||c),i=a.decode(e),o=i.readUInt32BE(0);n(o===t.private||o===t.public,"Version mismatch: does not match private or public"),r.depth=i.readUInt8(4),r.parentFingerprint=i.readUInt32BE(5),r.index=i.readUInt32BE(9),r.chainCode=i.slice(13,45);var s=i.slice(45);return 0===s.readUInt8(0)?(n(o===t.private,"Version mismatch: version does not match private"),r.privateKey=s.slice(1)):(n(o===t.public,"Version mismatch: version does not match public"),r.publicKey=s),r},h.fromJSON=function(e){return h.fromExtendedKey(e.xpriv)},h.HARDENED_OFFSET=u,e.exports=h},(e,t,r)=>{"use strict";function n(e){return n="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?"symbol":typeof e},n(e)}function i(e){return i=Object.setPrototypeOf?Object.getPrototypeOf:function(e){return e.__proto__||Object.getPrototypeOf(e)},i(e)}function o(e,t){return o=Object.setPrototypeOf||function(e,t){return e.__proto__=t,e},o(e,t)}var a,s,f={};function u(e,t,r){r||(r=Error);var a=function(r){function a(r,o,s){var f;return function(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}(this,a),f=function(e,t){return!t||"object"!==n(t)&&"function"!=typeof t?function(e){if(void 0===e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return e}(e):t}(this,i(a).call(this,function(e,r,n){return"string"==typeof t?t:t(e,r,n)}(r,o,s))),f.code=e,f}return function(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),t&&o(e,t)}(a,r),a}(r);f[e]=a}function c(e,t){if(Array.isArray(e)){var r=e.length;return e=e.map((function(e){return String(e)})),r>2?"one of ".concat(t," ").concat(e.slice(0,r-1).join(", "),", or ")+e[r-1]:2===r?"one of ".concat(t," ").concat(e[0]," or ").concat(e[1]):"of ".concat(t," ").concat(e[0])}return"of ".concat(t," ").concat(String(e))}u("ERR_AMBIGUOUS_ARGUMENT",'The "%s" argument is ambiguous. %s',TypeError),u("ERR_INVALID_ARG_TYPE",(function(e,t,i){var o,s,f,u,h;if(void 0===a&&(a=r(73)),a("string"==typeof e,"'name' must be a string"),"string"==typeof t&&(s="not ",t.substr(0,4)===s)?(o="must not be",t=t.replace(/^not /,"")):o="must be",function(e,t,r){return(void 0===r||r>e.length)&&(r=e.length),e.substring(r-9,r)===t}(e," argument"))f="The ".concat(e," ").concat(o," ").concat(c(t,"type"));else{var l=("number"!=typeof h&&(h=0),h+1>(u=e).length||-1===u.indexOf(".",h)?"argument":"property");f='The "'.concat(e,'" ').concat(l," ").concat(o," ").concat(c(t,"type"))}return f+". Received type ".concat(n(i))}),TypeError),u("ERR_INVALID_ARG_VALUE",(function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"is invalid";void 0===s&&(s=r(26));var i=s.inspect(t);return i.length>128&&(i="".concat(i.slice(0,128),"...")),"The argument '".concat(e,"' ").concat(n,". Received ").concat(i)}),TypeError,RangeError),u("ERR_INVALID_RETURN_VALUE",(function(e,t,r){var i;return i=r&&r.constructor&&r.constructor.name?"instance of ".concat(r.constructor.name):"type ".concat(n(r)),"Expected ".concat(e,' to be returned from the "').concat(t,'"')+" function but got ".concat(i,".")}),TypeError),u("ERR_MISSING_ARGS",(function(){for(var e=arguments.length,t=new Array(e),n=0;n0,"At least one arg needs to be specified");var i="The ",o=t.length;switch(t=t.map((function(e){return'"'.concat(e,'"')})),o){case 1:i+="".concat(t[0]," argument");break;case 2:i+="".concat(t[0]," and ").concat(t[1]," arguments");break;default:i+=t.slice(0,o-1).join(", "),i+=", and ".concat(t[o-1]," arguments")}return"".concat(i," must be specified")}),TypeError),e.exports.codes=f},(e,t,r)=>{"use strict";var n=r(218),i=r(222),o=r(223),a=r(113);function s(e){return e.call.bind(e)}var f="undefined"!=typeof BigInt,u="undefined"!=typeof Symbol,c=s(Object.prototype.toString),h=s(Number.prototype.valueOf),l=s(String.prototype.valueOf),d=s(Boolean.prototype.valueOf);if(f)var p=s(BigInt.prototype.valueOf);if(u)var b=s(Symbol.prototype.valueOf);function y(e,t){if("object"!=typeof e)return!1;try{return t(e),!0}catch(e){return!1}}function m(e){return"[object Map]"===c(e)}function g(e){return"[object Set]"===c(e)}function _(e){return"[object WeakMap]"===c(e)}function v(e){return"[object WeakSet]"===c(e)}function w(e){return"[object ArrayBuffer]"===c(e)}function E(e){return"undefined"!=typeof ArrayBuffer&&(w.working?w(e):e instanceof ArrayBuffer)}function S(e){return"[object DataView]"===c(e)}function M(e){return"undefined"!=typeof DataView&&(S.working?S(e):e instanceof DataView)}t.isArgumentsObject=n,t.isGeneratorFunction=i,t.isTypedArray=a,t.isPromise=function(e){return"undefined"!=typeof Promise&&e instanceof Promise||null!==e&&"object"==typeof e&&"function"==typeof e.then&&"function"==typeof e.catch},t.isArrayBufferView=function(e){return"undefined"!=typeof ArrayBuffer&&ArrayBuffer.isView?ArrayBuffer.isView(e):a(e)||M(e)},t.isUint8Array=function(e){return"Uint8Array"===o(e)},t.isUint8ClampedArray=function(e){return"Uint8ClampedArray"===o(e)},t.isUint16Array=function(e){return"Uint16Array"===o(e)},t.isUint32Array=function(e){return"Uint32Array"===o(e)},t.isInt8Array=function(e){return"Int8Array"===o(e)},t.isInt16Array=function(e){return"Int16Array"===o(e)},t.isInt32Array=function(e){return"Int32Array"===o(e)},t.isFloat32Array=function(e){return"Float32Array"===o(e)},t.isFloat64Array=function(e){return"Float64Array"===o(e)},t.isBigInt64Array=function(e){return"BigInt64Array"===o(e)},t.isBigUint64Array=function(e){return"BigUint64Array"===o(e)},m.working="undefined"!=typeof Map&&m(new Map),t.isMap=function(e){return"undefined"!=typeof Map&&(m.working?m(e):e instanceof Map)},g.working="undefined"!=typeof Set&&g(new Set),t.isSet=function(e){return"undefined"!=typeof Set&&(g.working?g(e):e instanceof Set)},_.working="undefined"!=typeof WeakMap&&_(new WeakMap),t.isWeakMap=function(e){return"undefined"!=typeof WeakMap&&(_.working?_(e):e instanceof WeakMap)},v.working="undefined"!=typeof WeakSet&&v(new WeakSet),t.isWeakSet=function(e){return v(e)},w.working="undefined"!=typeof ArrayBuffer&&w(new ArrayBuffer),t.isArrayBuffer=E,S.working="undefined"!=typeof ArrayBuffer&&"undefined"!=typeof DataView&&S(new DataView(new ArrayBuffer(1),0,1)),t.isDataView=M;var A="undefined"!=typeof SharedArrayBuffer?SharedArrayBuffer:void 0;function k(e){return"[object SharedArrayBuffer]"===c(e)}function R(e){return void 0!==A&&(void 0===k.working&&(k.working=k(new A)),k.working?k(e):e instanceof A)}function O(e){return y(e,h)}function T(e){return y(e,l)}function I(e){return y(e,d)}function x(e){return f&&y(e,p)}function B(e){return u&&y(e,b)}t.isSharedArrayBuffer=R,t.isAsyncFunction=function(e){return"[object AsyncFunction]"===c(e)},t.isMapIterator=function(e){return"[object Map Iterator]"===c(e)},t.isSetIterator=function(e){return"[object Set Iterator]"===c(e)},t.isGeneratorObject=function(e){return"[object Generator]"===c(e)},t.isWebAssemblyCompiledModule=function(e){return"[object WebAssembly.Module]"===c(e)},t.isNumberObject=O,t.isStringObject=T,t.isBooleanObject=I,t.isBigIntObject=x,t.isSymbolObject=B,t.isBoxedPrimitive=function(e){return O(e)||T(e)||I(e)||x(e)||B(e)},t.isAnyArrayBuffer=function(e){return"undefined"!=typeof Uint8Array&&(E(e)||R(e))},["isProxy","isExternal","isModuleNamespaceObject"].forEach((function(e){Object.defineProperty(t,e,{enumerable:!1,value:function(){throw new Error(e+" is not supported in userland")}})}))},(e,t,r)=>{"use strict";var n=r(36)(),i=r(59)("Object.prototype.toString"),o=function(e){return!(n&&e&&"object"==typeof e&&Symbol.toStringTag in e)&&"[object Arguments]"===i(e)},a=function(e){return!!o(e)||null!==e&&"object"==typeof e&&"number"==typeof e.length&&e.length>=0&&"[object Array]"!==i(e)&&"[object Function]"===i(e.callee)},s=function(){return o(arguments)}();o.isLegacyArguments=a,e.exports=s?o:a},(e,t,r)=>{"use strict";var n="undefined"!=typeof Symbol&&Symbol,i=r(109);e.exports=function(){return"function"==typeof n&&"function"==typeof Symbol&&"symbol"==typeof n("foo")&&"symbol"==typeof Symbol("bar")&&i()}},e=>{"use strict";var t=Array.prototype.slice,r=Object.prototype.toString;e.exports=function(e){var n=this;if("function"!=typeof n||"[object Function]"!==r.call(n))throw new TypeError("Function.prototype.bind called on incompatible "+n);for(var i,o=t.call(arguments,1),a=Math.max(0,n.length-o.length),s=[],f=0;f{"use strict";var n=r(60);e.exports=n.call(Function.call,Object.prototype.hasOwnProperty)},(e,t,r)=>{"use strict";var n,i=Object.prototype.toString,o=Function.prototype.toString,a=/^\s*(?:function)?\*/,s=r(36)(),f=Object.getPrototypeOf;e.exports=function(e){if("function"!=typeof e)return!1;if(a.test(o.call(e)))return!0;if(!s)return"[object GeneratorFunction]"===i.call(e);if(!f)return!1;if(void 0===n){var t=function(){if(!s)return!1;try{return Function("return function*() {}")()}catch(e){}}();n=!!t&&f(t)}return f(e)===n}},(e,t,r)=>{"use strict";var n=r(110),i=r(111),o=r(59),a=r(112),s=o("Object.prototype.toString"),f=r(36)(),u="undefined"==typeof globalThis?r.g:globalThis,c=i(),h=o("String.prototype.slice"),l={},d=Object.getPrototypeOf;f&&a&&d&&n(c,(function(e){if("function"==typeof u[e]){var t=new u[e];if(Symbol.toStringTag in t){var r=d(t),n=a(r,Symbol.toStringTag);if(!n){var i=d(r);n=a(i,Symbol.toStringTag)}l[e]=n.get}}}));var p=r(113);e.exports=function(e){return!!p(e)&&(f&&Symbol.toStringTag in e?function(e){var t=!1;return n(l,(function(r,n){if(!t)try{var i=r.call(e);i===n&&(t=i)}catch(e){}})),t}(e):h(s(e),8,-1))}},e=>{"use strict";var t,r,n=Function.prototype.toString,i="object"==typeof Reflect&&null!==Reflect&&Reflect.apply;if("function"==typeof i&&"function"==typeof Object.defineProperty)try{t=Object.defineProperty({},"length",{get:function(){throw r}}),r={},i((function(){throw 42}),null,t)}catch(e){e!==r&&(i=null)}else i=null;var o=/^\s*class\b/,a=function(e){try{var t=n.call(e);return o.test(t)}catch(e){return!1}},s=function(e){try{return!a(e)&&(n.call(e),!0)}catch(e){return!1}},f=Object.prototype.toString,u="function"==typeof Symbol&&!!Symbol.toStringTag,c=!(0 in[,]),h=function(){return!1};if("object"==typeof document){var l=document.all;f.call(l)===f.call(document.all)&&(h=function(e){if((c||!e)&&(void 0===e||"object"==typeof e))try{var t=f.call(e);return("[object HTMLAllCollection]"===t||"[object HTML document.all class]"===t||"[object HTMLCollection]"===t||"[object Object]"===t)&&null==e("")}catch(e){}return!1})}e.exports=i?function(e){if(h(e))return!0;if(!e)return!1;if("function"!=typeof e&&"object"!=typeof e)return!1;try{i(e,null,t)}catch(e){if(e!==r)return!1}return!a(e)&&s(e)}:function(e){if(h(e))return!0;if(!e)return!1;if("function"!=typeof e&&"object"!=typeof e)return!1;if(u)return s(e);if(a(e))return!1;var t=f.call(e);return!("[object Function]"!==t&&"[object GeneratorFunction]"!==t&&!/^\[object HTML/.test(t))&&s(e)}},e=>{e.exports=function(e){return e&&"object"==typeof e&&"function"==typeof e.copy&&"function"==typeof e.fill&&"function"==typeof e.readUInt8}},(e,t,r)=>{"use strict";function n(e,t,r){return t in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}function i(e,t){for(var r=0;re.length)&&(r=e.length),e.substring(r-t.length,r)===t}var b="",y="",m="",g="",_={deepStrictEqual:"Expected values to be strictly deep-equal:",strictEqual:"Expected values to be strictly equal:",strictEqualObject:'Expected "actual" to be reference-equal to "expected":',deepEqual:"Expected values to be loosely deep-equal:",equal:"Expected values to be loosely equal:",notDeepStrictEqual:'Expected "actual" not to be strictly deep-equal to:',notStrictEqual:'Expected "actual" to be strictly unequal to:',notStrictEqualObject:'Expected "actual" not to be reference-equal to "expected":',notDeepEqual:'Expected "actual" not to be loosely deep-equal to:',notEqual:'Expected "actual" to be loosely unequal to:',notIdentical:"Values identical but not reference-equal:"};function v(e){var t=Object.keys(e),r=Object.create(Object.getPrototypeOf(e));return t.forEach((function(t){r[t]=e[t]})),Object.defineProperty(r,"message",{value:e.message}),r}function w(e){return l(e,{compact:!1,customInspect:!1,depth:1e3,maxArrayLength:1/0,showHidden:!1,breakLength:1/0,showProxy:!1,sorted:!0,getters:!0})}var E=function(e){function t(e){var r;if(function(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}(this,t),"object"!==h(e)||null===e)throw new d("options","Object",e);var n=e.message,i=e.operator,s=e.stackStartFn,f=e.actual,u=e.expected,l=Error.stackTraceLimit;if(Error.stackTraceLimit=0,null!=n)r=o(this,c(t).call(this,String(n)));else if(process.stderr&&process.stderr.isTTY&&(process.stderr&&process.stderr.getColorDepth&&1!==process.stderr.getColorDepth()?(b="",y="",g="",m=""):(b="",y="",g="",m="")),"object"===h(f)&&null!==f&&"object"===h(u)&&null!==u&&"stack"in f&&f instanceof Error&&"stack"in u&&u instanceof Error&&(f=v(f),u=v(u)),"deepStrictEqual"===i||"strictEqual"===i)r=o(this,c(t).call(this,function(e,t,r){var n="",i="",o=0,a="",s=!1,f=w(e),u=f.split("\n"),c=w(t).split("\n"),l=0,d="";if("strictEqual"===r&&"object"===h(e)&&"object"===h(t)&&null!==e&&null!==t&&(r="strictEqualObject"),1===u.length&&1===c.length&&u[0]!==c[0]){var v=u[0].length+c[0].length;if(v<=10){if(!("object"===h(e)&&null!==e||"object"===h(t)&&null!==t||0===e&&0===t))return"".concat(_[r],"\n\n")+"".concat(u[0]," !== ").concat(c[0],"\n")}else if("strictEqualObject"!==r&&v<(process.stderr&&process.stderr.isTTY?process.stderr.columns:80)){for(;u[0][l]===c[0][l];)l++;l>2&&(d="\n ".concat(function(e,t){if(t=Math.floor(t),0==e.length||0==t)return"";var r=e.length*t;for(t=Math.floor(Math.log(t)/Math.log(2));t;)e+=e,t--;return e+e.substring(0,r-e.length)}(" ",l),"^"),l=0)}}for(var E=u[u.length-1],S=c[c.length-1];E===S&&(l++<2?a="\n ".concat(E).concat(a):n=E,u.pop(),c.pop(),0!==u.length&&0!==c.length);)E=u[u.length-1],S=c[c.length-1];var M=Math.max(u.length,c.length);if(0===M){var A=f.split("\n");if(A.length>30)for(A[26]="".concat(b,"...").concat(g);A.length>27;)A.pop();return"".concat(_.notIdentical,"\n\n").concat(A.join("\n"),"\n")}l>3&&(a="\n".concat(b,"...").concat(g).concat(a),s=!0),""!==n&&(a="\n ".concat(n).concat(a),n="");var k=0,R=_[r]+"\n".concat(y,"+ actual").concat(g," ").concat(m,"- expected").concat(g),O=" ".concat(b,"...").concat(g," Lines skipped");for(l=0;l1&&l>2&&(T>4?(i+="\n".concat(b,"...").concat(g),s=!0):T>3&&(i+="\n ".concat(c[l-2]),k++),i+="\n ".concat(c[l-1]),k++),o=l,n+="\n".concat(m,"-").concat(g," ").concat(c[l]),k++;else if(c.length1&&l>2&&(T>4?(i+="\n".concat(b,"...").concat(g),s=!0):T>3&&(i+="\n ".concat(u[l-2]),k++),i+="\n ".concat(u[l-1]),k++),o=l,i+="\n".concat(y,"+").concat(g," ").concat(u[l]),k++;else{var I=c[l],x=u[l],B=x!==I&&(!p(x,",")||x.slice(0,-1)!==I);B&&p(I,",")&&I.slice(0,-1)===x&&(B=!1,x+=","),B?(T>1&&l>2&&(T>4?(i+="\n".concat(b,"...").concat(g),s=!0):T>3&&(i+="\n ".concat(u[l-2]),k++),i+="\n ".concat(u[l-1]),k++),o=l,i+="\n".concat(y,"+").concat(g," ").concat(x),n+="\n".concat(m,"-").concat(g," ").concat(I),k+=2):(i+=n,n="",1!==T&&0!==l||(i+="\n ".concat(x),k++))}if(k>20&&l30)for(S[26]="".concat(b,"...").concat(g);S.length>27;)S.pop();r=1===S.length?o(this,c(t).call(this,"".concat(E," ").concat(S[0]))):o(this,c(t).call(this,"".concat(E,"\n\n").concat(S.join("\n"),"\n")))}else{var M=w(f),A="",k=_[i];"notDeepEqual"===i||"notEqual"===i?(M="".concat(_[i],"\n\n").concat(M)).length>1024&&(M="".concat(M.slice(0,1021),"...")):(A="".concat(w(u)),M.length>512&&(M="".concat(M.slice(0,509),"...")),A.length>512&&(A="".concat(A.slice(0,509),"...")),"deepEqual"===i||"equal"===i?M="".concat(k,"\n\n").concat(M,"\n\nshould equal\n\n"):A=" ".concat(i," ").concat(A)),r=o(this,c(t).call(this,"".concat(M).concat(A)))}return Error.stackTraceLimit=l,r.generatedMessage=!n,Object.defineProperty(a(r),"name",{value:"AssertionError [ERR_ASSERTION]",enumerable:!1,writable:!0,configurable:!0}),r.code="ERR_ASSERTION",r.actual=f,r.expected=u,r.operator=i,Error.captureStackTrace&&Error.captureStackTrace(a(r),s),r.stack,r.name="AssertionError",o(r)}var r,s;return function(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),t&&u(e,t)}(t,e),r=t,s=[{key:"toString",value:function(){return"".concat(this.name," [").concat(this.code,"]: ").concat(this.message)}},{key:l.custom,value:function(e,t){return l(this,function(e){for(var t=1;t{"use strict";function t(e,t){if(null==e)throw new TypeError("Cannot convert first argument to object");for(var r=Object(e),n=1;n{"use strict";var n=Array.prototype.slice,i=r(115),o=Object.keys,a=o?function(e){return o(e)}:r(229),s=Object.keys;a.shim=function(){if(Object.keys){var e=function(){var e=Object.keys(arguments);return e&&e.length===arguments.length}(1,2);e||(Object.keys=function(e){return i(e)?s(n.call(e)):s(e)})}else Object.keys=a;return Object.keys||a},e.exports=a},(e,t,r)=>{"use strict";var n;if(!Object.keys){var i=Object.prototype.hasOwnProperty,o=Object.prototype.toString,a=r(115),s=Object.prototype.propertyIsEnumerable,f=!s.call({toString:null},"toString"),u=s.call((function(){}),"prototype"),c=["toString","toLocaleString","valueOf","hasOwnProperty","isPrototypeOf","propertyIsEnumerable","constructor"],h=function(e){var t=e.constructor;return t&&t.prototype===e},l={$applicationCache:!0,$console:!0,$external:!0,$frame:!0,$frameElement:!0,$frames:!0,$innerHeight:!0,$innerWidth:!0,$onmozfullscreenchange:!0,$onmozfullscreenerror:!0,$outerHeight:!0,$outerWidth:!0,$pageXOffset:!0,$pageYOffset:!0,$parent:!0,$scrollLeft:!0,$scrollTop:!0,$scrollX:!0,$scrollY:!0,$self:!0,$webkitIndexedDB:!0,$webkitStorageInfo:!0,$window:!0},d=function(){if("undefined"==typeof window)return!1;for(var e in window)try{if(!l["$"+e]&&i.call(window,e)&&null!==window[e]&&"object"==typeof window[e])try{h(window[e])}catch(e){return!0}}catch(e){return!0}return!1}();n=function(e){var t=null!==e&&"object"==typeof e,r="[object Function]"===o.call(e),n=a(e),s=t&&"[object String]"===o.call(e),l=[];if(!t&&!r&&!n)throw new TypeError("Object.keys called on a non-object");var p=u&&r;if(s&&e.length>0&&!i.call(e,0))for(var b=0;b0)for(var y=0;y{"use strict";var n=r(37)("%Object.defineProperty%",!0),i=function(){if(n)try{return n({},"a",{value:1}),!0}catch(e){return!1}return!1};i.hasArrayLengthDefineBug=function(){if(!i())return null;try{return 1!==n([],"length",{value:1}).length}catch(e){return!0}},e.exports=i},(e,t,r)=>{"use strict";var n=r(117),i=r(38);e.exports=function(){var e=n();return i(Object,{is:e},{is:function(){return Object.is!==e}}),e}},(e,t,r)=>{"use strict";function n(e,t){return function(e){if(Array.isArray(e))return e}(e)||function(e,t){var r=[],n=!0,i=!1,o=void 0;try{for(var a,s=e[Symbol.iterator]();!(n=(a=s.next()).done)&&(r.push(a.value),!t||r.length!==t);n=!0);}catch(e){i=!0,o=e}finally{try{n||null==s.return||s.return()}finally{if(i)throw o}}return r}(e,t)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance")}()}function i(e){return i="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?"symbol":typeof e},i(e)}var o=void 0!==/a/g.flags,a=function(e){var t=[];return e.forEach((function(e){return t.push(e)})),t},s=function(e){var t=[];return e.forEach((function(e,r){return t.push([r,e])})),t},f=Object.is?Object.is:r(114),u=Object.getOwnPropertySymbols?Object.getOwnPropertySymbols:function(){return[]},c=Number.isNaN?Number.isNaN:r(233);function h(e){return e.call.bind(e)}var l=h(Object.prototype.hasOwnProperty),d=h(Object.prototype.propertyIsEnumerable),p=h(Object.prototype.toString),b=r(26).types,y=b.isAnyArrayBuffer,m=b.isArrayBufferView,g=b.isDate,_=b.isMap,v=b.isRegExp,w=b.isSet,E=b.isNativeError,S=b.isBoxedPrimitive,M=b.isNumberObject,A=b.isStringObject,k=b.isBooleanObject,R=b.isBigIntObject,O=b.isSymbolObject,T=b.isFloat32Array,I=b.isFloat64Array;function x(e){if(0===e.length||e.length>10)return!0;for(var t=0;t57)return!0}return 10===e.length&&e>=Math.pow(2,32)}function B(e){return Object.keys(e).filter(x).concat(u(e).filter(Object.prototype.propertyIsEnumerable.bind(e)))}function j(e,t){if(e===t)return 0;for(var r=e.length,n=t.length,i=0,o=Math.min(r,n);i{"use strict";var n=r(41),i=r(38),o=r(118),a=r(119),s=r(234),f=n(a(),Number);i(f,{getPolyfill:a,implementation:o,shim:s}),e.exports=f},(e,t,r)=>{"use strict";var n=r(38),i=r(119);e.exports=function(){var e=i();return n(Number,{isNaN:e},{isNaN:function(){return Number.isNaN!==e}}),e}},(e,t,r)=>{"use strict";var n=r(0),i=r(1).Buffer,o=r(14),a=i.alloc(128),s=64;function f(e,t){o.call(this,"digest"),"string"==typeof t&&(t=i.from(t)),this._alg=e,this._key=t,t.length>s?t=e(t):t.length{"use strict";e.exports=JSON.parse('{"sha224WithRSAEncryption":{"sign":"rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"RSA-SHA224":{"sign":"ecdsa/rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"sha256WithRSAEncryption":{"sign":"rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"RSA-SHA256":{"sign":"ecdsa/rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"sha384WithRSAEncryption":{"sign":"rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"RSA-SHA384":{"sign":"ecdsa/rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"sha512WithRSAEncryption":{"sign":"rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA512":{"sign":"ecdsa/rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA1":{"sign":"rsa","hash":"sha1","id":"3021300906052b0e03021a05000414"},"ecdsa-with-SHA1":{"sign":"ecdsa","hash":"sha1","id":""},"sha256":{"sign":"ecdsa","hash":"sha256","id":""},"sha224":{"sign":"ecdsa","hash":"sha224","id":""},"sha384":{"sign":"ecdsa","hash":"sha384","id":""},"sha512":{"sign":"ecdsa","hash":"sha512","id":""},"DSA-SHA":{"sign":"dsa","hash":"sha1","id":""},"DSA-SHA1":{"sign":"dsa","hash":"sha1","id":""},"DSA":{"sign":"dsa","hash":"sha1","id":""},"DSA-WITH-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-WITH-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-WITH-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-WITH-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-RIPEMD160":{"sign":"dsa","hash":"rmd160","id":""},"ripemd160WithRSA":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"RSA-RIPEMD160":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"md5WithRSAEncryption":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"},"RSA-MD5":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"}}')},(e,t,r)=>{var n=r(238),i=r(122),o=r(63),a=r(322),s=r(39);function f(e,t,r){if(e=e.toLowerCase(),o[e])return i.createCipheriv(e,t,r);if(a[e])return new n({key:t,iv:r,mode:e});throw new TypeError("invalid suite type")}function u(e,t,r){if(e=e.toLowerCase(),o[e])return i.createDecipheriv(e,t,r);if(a[e])return new n({key:t,iv:r,mode:e,decrypt:!0});throw new TypeError("invalid suite type")}t.createCipher=t.Cipher=function(e,t){var r,n;if(e=e.toLowerCase(),o[e])r=o[e].key,n=o[e].iv;else{if(!a[e])throw new TypeError("invalid suite type");r=8*a[e].key,n=a[e].iv}var i=s(t,!1,r,n);return f(e,i.key,i.iv)},t.createCipheriv=t.Cipheriv=f,t.createDecipher=t.Decipher=function(e,t){var r,n;if(e=e.toLowerCase(),o[e])r=o[e].key,n=o[e].iv;else{if(!a[e])throw new TypeError("invalid suite type");r=8*a[e].key,n=a[e].iv}var i=s(t,!1,r,n);return u(e,i.key,i.iv)},t.createDecipheriv=t.Decipheriv=u,t.listCiphers=t.getCiphers=function(){return Object.keys(a).concat(i.getCiphers())}},(e,t,r)=>{var n=r(14),i=r(312),o=r(0),a=r(1).Buffer,s={"des-ede3-cbc":i.CBC.instantiate(i.EDE),"des-ede3":i.EDE,"des-ede-cbc":i.CBC.instantiate(i.EDE),"des-ede":i.EDE,"des-cbc":i.CBC.instantiate(i.DES),"des-ecb":i.DES};function f(e){n.call(this);var t,r=e.mode.toLowerCase(),i=s[r];t=e.decrypt?"decrypt":"encrypt";var o=e.key;a.isBuffer(o)||(o=a.from(o)),"des-ede"!==r&&"des-ede-cbc"!==r||(o=a.concat([o,o.slice(0,8)]));var f=e.iv;a.isBuffer(f)||(f=a.from(f)),this._des=i.create({key:o,iv:f,type:t})}s.des=s["des-cbc"],s.des3=s["des-ede3-cbc"],e.exports=f,o(f,n),f.prototype._update=function(e){return a.from(this._des.update(e))},f.prototype._final=function(){return a.from(this._des.final())}},(e,t)=>{"use strict";t.readUInt32BE=function(e,t){return(e[0+t]<<24|e[1+t]<<16|e[2+t]<<8|e[3+t])>>>0},t.writeUInt32BE=function(e,t,r){e[0+r]=t>>>24,e[1+r]=t>>>16&255,e[2+r]=t>>>8&255,e[3+r]=255&t},t.ip=function(e,t,r,n){for(var i=0,o=0,a=6;a>=0;a-=2){for(var s=0;s<=24;s+=8)i<<=1,i|=t>>>s+a&1;for(s=0;s<=24;s+=8)i<<=1,i|=e>>>s+a&1}for(a=6;a>=0;a-=2){for(s=1;s<=25;s+=8)o<<=1,o|=t>>>s+a&1;for(s=1;s<=25;s+=8)o<<=1,o|=e>>>s+a&1}r[n+0]=i>>>0,r[n+1]=o>>>0},t.rip=function(e,t,r,n){for(var i=0,o=0,a=0;a<4;a++)for(var s=24;s>=0;s-=8)i<<=1,i|=t>>>s+a&1,i<<=1,i|=e>>>s+a&1;for(a=4;a<8;a++)for(s=24;s>=0;s-=8)o<<=1,o|=t>>>s+a&1,o<<=1,o|=e>>>s+a&1;r[n+0]=i>>>0,r[n+1]=o>>>0},t.pc1=function(e,t,r,n){for(var i=0,o=0,a=7;a>=5;a--){for(var s=0;s<=24;s+=8)i<<=1,i|=t>>s+a&1;for(s=0;s<=24;s+=8)i<<=1,i|=e>>s+a&1}for(s=0;s<=24;s+=8)i<<=1,i|=t>>s+a&1;for(a=1;a<=3;a++){for(s=0;s<=24;s+=8)o<<=1,o|=t>>s+a&1;for(s=0;s<=24;s+=8)o<<=1,o|=e>>s+a&1}for(s=0;s<=24;s+=8)o<<=1,o|=e>>s+a&1;r[n+0]=i>>>0,r[n+1]=o>>>0},t.r28shl=function(e,t){return e<>>28-t};var r=[14,11,17,4,27,23,25,0,13,22,7,18,5,9,16,24,2,20,12,21,1,8,15,26,15,4,25,19,9,1,26,16,5,11,23,8,12,7,17,0,22,3,10,14,6,20,27,24];t.pc2=function(e,t,n,i){for(var o=0,a=0,s=r.length>>>1,f=0;f>>r[f]&1;for(f=s;f>>r[f]&1;n[i+0]=o>>>0,n[i+1]=a>>>0},t.expand=function(e,t,r){var n=0,i=0;n=(1&e)<<5|e>>>27;for(var o=23;o>=15;o-=4)n<<=6,n|=e>>>o&63;for(o=11;o>=3;o-=4)i|=e>>>o&63,i<<=6;i|=(31&e)<<1|e>>>31,t[r+0]=n>>>0,t[r+1]=i>>>0};var n=[14,0,4,15,13,7,1,4,2,14,15,2,11,13,8,1,3,10,10,6,6,12,12,11,5,9,9,5,0,3,7,8,4,15,1,12,14,8,8,2,13,4,6,9,2,1,11,7,15,5,12,11,9,3,7,14,3,10,10,0,5,6,0,13,15,3,1,13,8,4,14,7,6,15,11,2,3,8,4,14,9,12,7,0,2,1,13,10,12,6,0,9,5,11,10,5,0,13,14,8,7,10,11,1,10,3,4,15,13,4,1,2,5,11,8,6,12,7,6,12,9,0,3,5,2,14,15,9,10,13,0,7,9,0,14,9,6,3,3,4,15,6,5,10,1,2,13,8,12,5,7,14,11,12,4,11,2,15,8,1,13,1,6,10,4,13,9,0,8,6,15,9,3,8,0,7,11,4,1,15,2,14,12,3,5,11,10,5,14,2,7,12,7,13,13,8,14,11,3,5,0,6,6,15,9,0,10,3,1,4,2,7,8,2,5,12,11,1,12,10,4,14,15,9,10,3,6,15,9,0,0,6,12,10,11,1,7,13,13,8,15,9,1,4,3,5,14,11,5,12,2,7,8,2,4,14,2,14,12,11,4,2,1,12,7,4,10,7,11,13,6,1,8,5,5,0,3,15,15,10,13,3,0,9,14,8,9,6,4,11,2,8,1,12,11,7,10,1,13,14,7,2,8,13,15,6,9,15,12,0,5,9,6,10,3,4,0,5,14,3,12,10,1,15,10,4,15,2,9,7,2,12,6,9,8,5,0,6,13,1,3,13,4,14,14,0,7,11,5,3,11,8,9,4,14,3,15,2,5,12,2,9,8,5,12,15,3,10,7,11,0,14,4,1,10,7,1,6,13,0,11,8,6,13,4,13,11,0,2,11,14,7,15,4,0,9,8,1,13,10,3,14,12,3,9,5,7,12,5,2,10,15,6,8,1,6,1,6,4,11,11,13,13,8,12,1,3,4,7,10,14,7,10,9,15,5,6,0,8,15,0,14,5,2,9,3,2,12,13,1,2,15,8,13,4,8,6,10,15,3,11,7,1,4,10,12,9,5,3,6,14,11,5,0,0,14,12,9,7,2,7,2,11,1,4,14,1,7,9,4,12,10,14,8,2,13,0,15,6,12,10,9,13,0,15,3,3,5,5,6,8,11];t.substitute=function(e,t){for(var r=0,i=0;i<4;i++)r<<=4,r|=n[64*i+(e>>>18-6*i&63)];for(i=0;i<4;i++)r<<=4,r|=n[256+64*i+(t>>>18-6*i&63)];return r>>>0};var i=[16,25,12,11,3,20,4,15,31,17,9,6,27,14,1,22,30,24,8,18,0,5,29,23,13,19,2,26,10,21,28,7];t.permute=function(e){for(var t=0,r=0;r>>i[r]&1;return t>>>0},t.padSplit=function(e,t,r){for(var n=e.toString(2);n.length{"use strict";var n=r(6),i=r(0),o=r(62),a=r(121);function s(e,t){n.equal(t.length,24,"Invalid key length");var r=t.slice(0,8),i=t.slice(8,16),o=t.slice(16,24);this.ciphers="encrypt"===e?[a.create({type:"encrypt",key:r}),a.create({type:"decrypt",key:i}),a.create({type:"encrypt",key:o})]:[a.create({type:"decrypt",key:o}),a.create({type:"encrypt",key:i}),a.create({type:"decrypt",key:r})]}function f(e){o.call(this,e);var t=new s(this.type,this.options.key);this._edeState=t}i(f,o),e.exports=f,f.create=function(e){return new f(e)},f.prototype._update=function(e,t,r,n){var i=this._edeState;i.ciphers[0]._update(e,t,r,n),i.ciphers[1]._update(r,n,r,n),i.ciphers[2]._update(r,n,r,n)},f.prototype._pad=a.prototype._pad,f.prototype._unpad=a.prototype._unpad},e=>{"use strict";e.exports=JSON.parse('{"aes-128-ecb":{"cipher":"AES","key":128,"iv":0,"mode":"ECB","type":"block"},"aes-192-ecb":{"cipher":"AES","key":192,"iv":0,"mode":"ECB","type":"block"},"aes-256-ecb":{"cipher":"AES","key":256,"iv":0,"mode":"ECB","type":"block"},"aes-128-cbc":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes-192-cbc":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes-256-cbc":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes128":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes192":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes256":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes-128-cfb":{"cipher":"AES","key":128,"iv":16,"mode":"CFB","type":"stream"},"aes-192-cfb":{"cipher":"AES","key":192,"iv":16,"mode":"CFB","type":"stream"},"aes-256-cfb":{"cipher":"AES","key":256,"iv":16,"mode":"CFB","type":"stream"},"aes-128-cfb8":{"cipher":"AES","key":128,"iv":16,"mode":"CFB8","type":"stream"},"aes-192-cfb8":{"cipher":"AES","key":192,"iv":16,"mode":"CFB8","type":"stream"},"aes-256-cfb8":{"cipher":"AES","key":256,"iv":16,"mode":"CFB8","type":"stream"},"aes-128-cfb1":{"cipher":"AES","key":128,"iv":16,"mode":"CFB1","type":"stream"},"aes-192-cfb1":{"cipher":"AES","key":192,"iv":16,"mode":"CFB1","type":"stream"},"aes-256-cfb1":{"cipher":"AES","key":256,"iv":16,"mode":"CFB1","type":"stream"},"aes-128-ofb":{"cipher":"AES","key":128,"iv":16,"mode":"OFB","type":"stream"},"aes-192-ofb":{"cipher":"AES","key":192,"iv":16,"mode":"OFB","type":"stream"},"aes-256-ofb":{"cipher":"AES","key":256,"iv":16,"mode":"OFB","type":"stream"},"aes-128-ctr":{"cipher":"AES","key":128,"iv":16,"mode":"CTR","type":"stream"},"aes-192-ctr":{"cipher":"AES","key":192,"iv":16,"mode":"CTR","type":"stream"},"aes-256-ctr":{"cipher":"AES","key":256,"iv":16,"mode":"CTR","type":"stream"},"aes-128-gcm":{"cipher":"AES","key":128,"iv":12,"mode":"GCM","type":"auth"},"aes-192-gcm":{"cipher":"AES","key":192,"iv":12,"mode":"GCM","type":"auth"},"aes-256-gcm":{"cipher":"AES","key":256,"iv":12,"mode":"GCM","type":"auth"}}')},(e,t,r)=>{var n=r(1).Buffer,i=n.alloc(16,0);function o(e){var t=n.allocUnsafe(16);return t.writeUInt32BE(e[0]>>>0,0),t.writeUInt32BE(e[1]>>>0,4),t.writeUInt32BE(e[2]>>>0,8),t.writeUInt32BE(e[3]>>>0,12),t}function a(e){this.h=e,this.state=n.alloc(16,0),this.cache=n.allocUnsafe(0)}a.prototype.ghash=function(e){for(var t=-1;++t0;t--)n[t]=n[t]>>>1|(1&n[t-1])<<31;n[0]=n[0]>>>1,r&&(n[0]=n[0]^225<<24)}this.state=o(i)},a.prototype.update=function(e){var t;for(this.cache=n.concat([this.cache,e]);this.cache.length>=16;)t=this.cache.slice(0,16),this.cache=this.cache.slice(16),this.ghash(t)},a.prototype.final=function(e,t){return this.cache.length&&this.ghash(n.concat([this.cache,i],16)),this.ghash(o([0,e,0,t])),this.state},e.exports=a},(e,t,r)=>{var n=r(2),i=new(r(127)),o=new n(24),a=new n(11),s=new n(10),f=new n(3),u=new n(7),c=r(126),h=r(12);function l(e,t){return t=t||"utf8",Buffer.isBuffer(e)||(e=new Buffer(e,t)),this._pub=new n(e),this}function d(e,t){return t=t||"utf8",Buffer.isBuffer(e)||(e=new Buffer(e,t)),this._priv=new n(e),this}e.exports=b;var p={};function b(e,t,r){this.setGenerator(t),this.__prime=new n(e),this._prime=n.mont(this.__prime),this._primeLen=e.length,this._pub=void 0,this._priv=void 0,this._primeCode=void 0,r?(this.setPublicKey=l,this.setPrivateKey=d):this._primeCode=8}function y(e,t){var r=new Buffer(e.toArray());return t?r.toString(t):r}Object.defineProperty(b.prototype,"verifyError",{enumerable:!0,get:function(){return"number"!=typeof this._primeCode&&(this._primeCode=function(e,t){var r=t.toString("hex"),n=[r,e.toString(16)].join("_");if(n in p)return p[n];var h,l=0;if(e.isEven()||!c.simpleSieve||!c.fermatTest(e)||!i.test(e))return l+=1,l+="02"===r||"05"===r?8:4,p[n]=l,l;switch(i.test(e.shrn(1))||(l+=2),r){case"02":e.mod(o).cmp(a)&&(l+=8);break;case"05":(h=e.mod(s)).cmp(f)&&h.cmp(u)&&(l+=8);break;default:l+=4}return p[n]=l,l}(this.__prime,this.__gen)),this._primeCode}}),b.prototype.generateKeys=function(){return this._priv||(this._priv=new n(h(this._primeLen))),this._pub=this._gen.toRed(this._prime).redPow(this._priv).fromRed(),this.getPublicKey()},b.prototype.computeSecret=function(e){var t=(e=(e=new n(e)).toRed(this._prime)).redPow(this._priv).fromRed(),r=new Buffer(t.toArray()),i=this.getPrime();if(r.length{var n=r(1).Buffer,i=r(13),o=r(151),a=r(0),s=r(251),f=r(260),u=r(236);function c(e){o.Writable.call(this);var t=u[e];if(!t)throw new Error("Unknown message digest");this._hashType=t.hash,this._hash=i(t.hash),this._tag=t.id,this._signType=t.sign}function h(e){o.Writable.call(this);var t=u[e];if(!t)throw new Error("Unknown message digest");this._hash=i(t.hash),this._tag=t.id,this._signType=t.sign}function l(e){return new c(e)}function d(e){return new h(e)}Object.keys(u).forEach((function(e){u[e].id=n.from(u[e].id,"hex"),u[e.toLowerCase()]=u[e]})),a(c,o.Writable),c.prototype._write=function(e,t,r){this._hash.update(e),r()},c.prototype.update=function(e,t){return"string"==typeof e&&(e=n.from(e,t)),this._hash.update(e),this},c.prototype.sign=function(e,t){this.end();var r=this._hash.digest(),n=s(r,e,this._hashType,this._signType,this._tag);return t?n.toString(t):n},a(h,o.Writable),h.prototype._write=function(e,t,r){this._hash.update(e),r()},h.prototype.update=function(e,t){return"string"==typeof e&&(e=n.from(e,t)),this._hash.update(e),this},h.prototype.verify=function(e,t,r){"string"==typeof t&&(t=n.from(t,r)),this.end();var i=this._hash.digest();return f(t,i,e,this._signType,this._tag)},e.exports={Sign:l,Verify:d,createSign:l,createVerify:d}},(e,t,r)=>{e.exports=r(10).EventEmitter},(e,t,r)=>{"use strict";function n(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function i(e){for(var t=1;t0?this.tail.next=t:this.head=t,this.tail=t,++this.length}},{key:"unshift",value:function(e){var t={data:e,next:this.head};0===this.length&&(this.tail=t),this.head=t,++this.length}},{key:"shift",value:function(){if(0!==this.length){var e=this.head.data;return 1===this.length?this.head=this.tail=null:this.head=this.head.next,--this.length,e}}},{key:"clear",value:function(){this.head=this.tail=null,this.length=0}},{key:"join",value:function(e){if(0===this.length)return"";for(var t=this.head,r=""+t.data;t=t.next;)r+=e+t.data;return r}},{key:"concat",value:function(e){if(0===this.length)return f.alloc(0);for(var t,r,n,i=f.allocUnsafe(e>>>0),o=this.head,a=0;o;)t=o.data,r=i,n=a,f.prototype.copy.call(t,r,n),a+=o.data.length,o=o.next;return i}},{key:"consume",value:function(e,t){var r;return ei.length?i.length:e;if(o===i.length?n+=i:n+=i.slice(0,e),0==(e-=o)){o===i.length?(++r,t.next?this.head=t.next:this.head=this.tail=null):(this.head=t,t.data=i.slice(o));break}++r}return this.length-=r,n}},{key:"_getBuffer",value:function(e){var t=f.allocUnsafe(e),r=this.head,n=1;for(r.data.copy(t),e-=r.data.length;r=r.next;){var i=r.data,o=e>i.length?i.length:e;if(i.copy(t,t.length-e,0,o),0==(e-=o)){o===i.length?(++n,r.next?this.head=r.next:this.head=this.tail=null):(this.head=r,r.data=i.slice(o));break}++n}return this.length-=n,t}},{key:c,value:function(e,t){return u(this,i(i({},t),{},{depth:0,customInspect:!1}))}}])&&a(t.prototype,r),Object.defineProperty(t,"prototype",{writable:!1}),e}()},(e,t,r)=>{"use strict";var n;function i(e,t,r){return(t=function(e){var t=function(e,t){if("object"!=typeof e||null===e)return e;var r=e[Symbol.toPrimitive];if(void 0!==r){var n=r.call(e,"string");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(e);return"symbol"==typeof t?t:String(t)}(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}var o=r(65),a=Symbol("lastResolve"),s=Symbol("lastReject"),f=Symbol("error"),u=Symbol("ended"),c=Symbol("lastPromise"),h=Symbol("handlePromise"),l=Symbol("stream");function d(e,t){return{value:e,done:t}}function p(e){var t=e[a];if(null!==t){var r=e[l].read();null!==r&&(e[c]=null,e[a]=null,e[s]=null,t(d(r,!1)))}}function b(e){process.nextTick(p,e)}var y=Object.getPrototypeOf((function(){})),m=Object.setPrototypeOf((i(n={get stream(){return this[l]},next:function(){var e=this,t=this[f];if(null!==t)return Promise.reject(t);if(this[u])return Promise.resolve(d(void 0,!0));if(this[l].destroyed)return new Promise((function(t,r){process.nextTick((function(){e[f]?r(e[f]):t(d(void 0,!0))}))}));var r,n=this[c];if(n)r=new Promise(function(e,t){return function(r,n){e.then((function(){t[u]?r(d(void 0,!0)):t[h](r,n)}),n)}}(n,this));else{var i=this[l].read();if(null!==i)return Promise.resolve(d(i,!1));r=new Promise(this[h])}return this[c]=r,r}},Symbol.asyncIterator,(function(){return this})),i(n,"return",(function(){var e=this;return new Promise((function(t,r){e[l].destroy(null,(function(e){e?r(e):t(d(void 0,!0))}))}))})),n),y);e.exports=function(e){var t,r=Object.create(m,(i(t={},l,{value:e,writable:!0}),i(t,a,{value:null,writable:!0}),i(t,s,{value:null,writable:!0}),i(t,f,{value:null,writable:!0}),i(t,u,{value:e._readableState.endEmitted,writable:!0}),i(t,h,{value:function(e,t){var n=r[l].read();n?(r[c]=null,r[a]=null,r[s]=null,e(d(n,!1))):(r[a]=e,r[s]=t)},writable:!0}),t));return r[c]=null,o(e,(function(e){if(e&&"ERR_STREAM_PREMATURE_CLOSE"!==e.code){var t=r[s];return null!==t&&(r[c]=null,r[a]=null,r[s]=null,t(e)),void(r[f]=e)}var n=r[a];null!==n&&(r[c]=null,r[a]=null,r[s]=null,n(d(void 0,!0))),r[u]=!0})),e.on("readable",b.bind(null,r)),r}},e=>{e.exports=function(){throw new Error("Readable.from is not available in the browser")}},(e,t,r)=>{"use strict";e.exports=i;var n=r(132);function i(e){if(!(this instanceof i))return new i(e);n.call(this,e)}r(0)(i,n),i.prototype._transform=function(e,t,r){r(null,e)}},(e,t,r)=>{"use strict";var n,i=r(24).q,o=i.ERR_MISSING_ARGS,a=i.ERR_STREAM_DESTROYED;function s(e){if(e)throw e}function f(e){e()}function u(e,t){return e.pipe(t)}e.exports=function(){for(var e=arguments.length,t=new Array(e),i=0;i0,(function(e){c||(c=e),e&&l.forEach(f),o||(l.forEach(f),h(c))}))}));return t.reduce(u)}},(e,t,r)=>{var n=r(1).Buffer,i=r(120),o=r(66),a=r(20).ec,s=r(74),f=r(40),u=r(259);function c(e,t,r,o){if((e=n.from(e.toArray())).length0&&r.ishrn(n),r}function l(e,t,r){var o,a;do{for(o=n.alloc(0);8*o.length{"use strict";const n=r(134),i=r(137),o=r(0);function a(e,t){this.name=e,this.body=t,this.decoders={},this.encoders={}}t.define=function(e,t){return new a(e,t)},a.prototype._createNamed=function(e){const t=this.name;function r(e){this._initNamed(e,t)}return o(r,e),r.prototype._initNamed=function(t,r){e.call(this,t,r)},new r(this)},a.prototype._getDecoder=function(e){return e=e||"der",this.decoders.hasOwnProperty(e)||(this.decoders[e]=this._createNamed(i[e])),this.decoders[e]},a.prototype.decode=function(e,t,r){return this._getDecoder(t).decode(e,r)},a.prototype._getEncoder=function(e){return e=e||"der",this.encoders.hasOwnProperty(e)||(this.encoders[e]=this._createNamed(n[e])),this.encoders[e]},a.prototype.encode=function(e,t,r){return this._getEncoder(t).encode(e,r)}},(e,t,r)=>{"use strict";const n=r(0),i=r(135);function o(e){i.call(this,e),this.enc="pem"}n(o,i),e.exports=o,o.prototype.encode=function(e,t){const r=i.prototype.encode.call(this,e).toString("base64"),n=["-----BEGIN "+t.label+"-----"];for(let e=0;e{"use strict";const n=r(0),i=r(67).Buffer,o=r(138);function a(e){o.call(this,e),this.enc="pem"}n(a,o),e.exports=a,a.prototype.decode=function(e,t){const r=e.toString().split(/[\r\n]+/g),n=t.label.toUpperCase(),a=/^-----(BEGIN|END) ([^-]+)-----$/;let s=-1,f=-1;for(let e=0;e{"use strict";const n=t;n.Reporter=r(136).b,n.DecoderBuffer=r(70).C,n.EncoderBuffer=r(70).R,n.Node=r(68)},(e,t,r)=>{"use strict";const n=t;n._reverse=function(e){const t={};return Object.keys(e).forEach((function(r){(0|r)==r&&(r|=0);const n=e[r];t[n]=r})),t},n.der=r(42)},(e,t,r)=>{"use strict";var n=r(133),i=n.define("Time",(function(){this.choice({utcTime:this.utctime(),generalTime:this.gentime()})})),o=n.define("AttributeTypeValue",(function(){this.seq().obj(this.key("type").objid(),this.key("value").any())})),a=n.define("AlgorithmIdentifier",(function(){this.seq().obj(this.key("algorithm").objid(),this.key("parameters").optional(),this.key("curve").objid().optional())})),s=n.define("SubjectPublicKeyInfo",(function(){this.seq().obj(this.key("algorithm").use(a),this.key("subjectPublicKey").bitstr())})),f=n.define("RelativeDistinguishedName",(function(){this.setof(o)})),u=n.define("RDNSequence",(function(){this.seqof(f)})),c=n.define("Name",(function(){this.choice({rdnSequence:this.use(u)})})),h=n.define("Validity",(function(){this.seq().obj(this.key("notBefore").use(i),this.key("notAfter").use(i))})),l=n.define("Extension",(function(){this.seq().obj(this.key("extnID").objid(),this.key("critical").bool().def(!1),this.key("extnValue").octstr())})),d=n.define("TBSCertificate",(function(){this.seq().obj(this.key("version").explicit(0).int().optional(),this.key("serialNumber").int(),this.key("signature").use(a),this.key("issuer").use(c),this.key("validity").use(h),this.key("subject").use(c),this.key("subjectPublicKeyInfo").use(s),this.key("issuerUniqueID").implicit(1).bitstr().optional(),this.key("subjectUniqueID").implicit(2).bitstr().optional(),this.key("extensions").explicit(3).seqof(l).optional())})),p=n.define("X509Certificate",(function(){this.seq().obj(this.key("tbsCertificate").use(d),this.key("signatureAlgorithm").use(a),this.key("signatureValue").bitstr())}));e.exports=p},(e,t,r)=>{var n=/Proc-Type: 4,ENCRYPTED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r+/=]+)[\n\r]+/m,i=/^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,o=/^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\n\r+/=]+)-----END \1-----$/m,a=r(39),s=r(122),f=r(75).Buffer;e.exports=function(e,t){var r,u=e.toString(),c=u.match(n);if(c){var h="aes"+c[1],l=f.from(c[2],"hex"),d=f.from(c[3].replace(/[\r\n]/g,""),"base64"),p=a(t,l.slice(0,8),parseInt(c[1],10)).key,b=[],y=s.createDecipheriv(h,p,l);b.push(y.update(d)),b.push(y.final()),r=f.concat(b)}else{var m=u.match(o);r=f.from(m[2].replace(/[\r\n]/g,""),"base64")}return{tag:u.match(i)[1],data:r}}},e=>{"use strict";e.exports=JSON.parse('{"1.3.132.0.10":"secp256k1","1.3.132.0.33":"p224","1.2.840.10045.3.1.1":"p192","1.2.840.10045.3.1.7":"p256","1.3.132.0.34":"p384","1.3.132.0.35":"p521"}')},(e,t,r)=>{var n=r(1).Buffer,i=r(74),o=r(20).ec,a=r(40),s=r(259);function f(e,t){if(e.cmpn(0)<=0)throw new Error("invalid sig");if(e.cmp(t)>=t)throw new Error("invalid sig")}e.exports=function(e,t,r,u,c){var h=a(r);if("ec"===h.type){if("ecdsa"!==u&&"ecdsa/rsa"!==u)throw new Error("wrong public key type");return function(e,t,r){var n=s[r.data.algorithm.curve.join(".")];if(!n)throw new Error("unknown curve "+r.data.algorithm.curve.join("."));var i=new o(n),a=r.data.subjectPrivateKey.data;return i.verify(t,e,a)}(e,t,h)}if("dsa"===h.type){if("dsa"!==u)throw new Error("wrong public key type");return function(e,t,r){var n=r.data.p,o=r.data.q,s=r.data.g,u=r.data.pub_key,c=a.signature.decode(e,"der"),h=c.s,l=c.r;f(h,o),f(l,o);var d=i.mont(n),p=h.invm(o);return 0===s.toRed(d).redPow(new i(t).mul(p).mod(o)).fromRed().mul(u.toRed(d).redPow(l.mul(p).mod(o)).fromRed()).mod(n).mod(o).cmp(l)}(e,t,h)}if("rsa"!==u&&"ecdsa/rsa"!==u)throw new Error("wrong public key type");t=n.concat([c,t]);for(var l=h.modulus.byteLength(),d=[1],p=0;t.length+d.length+2{var n=r(20),i=r(2);e.exports=function(e){return new a(e)};var o={secp256k1:{name:"secp256k1",byteLength:32},secp224r1:{name:"p224",byteLength:28},prime256v1:{name:"p256",byteLength:32},prime192v1:{name:"p192",byteLength:24},ed25519:{name:"ed25519",byteLength:32},secp384r1:{name:"p384",byteLength:48},secp521r1:{name:"p521",byteLength:66}};function a(e){this.curveType=o[e],this.curveType||(this.curveType={name:e}),this.curve=new n.ec(this.curveType.name),this.keys=void 0}function s(e,t,r){Array.isArray(e)||(e=e.toArray());var n=new Buffer(e);if(r&&n.length{var n=r(40),i=r(12),o=r(13),a=r(139),s=r(140),f=r(2),u=r(141),c=r(66),h=r(1).Buffer;e.exports=function(e,t,r){var l;l=e.padding?e.padding:r?1:4;var d,p=n(e);if(4===l)d=function(e,t){var r=e.modulus.byteLength(),n=t.length,u=o("sha1").update(h.alloc(0)).digest(),c=u.length,l=2*c;if(n>r-l-2)throw new Error("message too long");var d=h.alloc(r-n-l-2),p=r-c-1,b=i(c),y=s(h.concat([u,d,h.alloc(1,1),t],p),a(b,p)),m=s(b,a(y,c));return new f(h.concat([h.alloc(1),m,y],r))}(p,t);else if(1===l)d=function(e,t,r){var n,o=t.length,a=e.modulus.byteLength();if(o>a-11)throw new Error("message too long");return n=r?h.alloc(a-o-3,255):function(e){for(var t,r=h.allocUnsafe(e),n=0,o=i(2*e),a=0;n=0)throw new Error("data too long for modulus")}return r?c(d,p):u(d,p)}},(e,t,r)=>{var n=r(40),i=r(139),o=r(140),a=r(2),s=r(66),f=r(13),u=r(141),c=r(1).Buffer;e.exports=function(e,t,r){var h;h=e.padding?e.padding:r?1:4;var l,d=n(e),p=d.modulus.byteLength();if(t.length>p||new a(t).cmp(d.modulus)>=0)throw new Error("decryption error");l=r?u(new a(t),d):s(t,d);var b=c.alloc(p-l.length);if(l=c.concat([b,l],p),4===h)return function(e,t){var r=e.modulus.byteLength(),n=f("sha1").update(c.alloc(0)).digest(),a=n.length;if(0!==t[0])throw new Error("decryption error");var s=t.slice(1,a+1),u=t.slice(a+1),h=o(s,i(u,a)),l=o(u,i(h,r-a-1));if(function(e,t){e=c.from(e),t=c.from(t);var r=0,n=e.length;e.length!==t.length&&(r++,n=Math.min(e.length,t.length));for(var i=-1;++i=t.length){o++;break}var a=t.slice(2,i-1);if(("0002"!==n.toString("hex")&&!r||"0001"!==n.toString("hex")&&r)&&o++,a.length<8&&o++,o)throw new Error("decryption error");return t.slice(i)}(0,l,r);if(3===h)return l;throw new Error("unknown padding")}},(e,t,r)=>{"use strict";var n=r(13),i=r(265);e.exports=i((function(e){var t=n("sha256").update(e).digest();return n("sha256").update(t).digest()}))},(e,t,r)=>{"use strict";var n=r(266),i=r(1).Buffer;e.exports=function(e){function t(t){var r=t.slice(0,-4),n=t.slice(-4),i=e(r);if(!(n[0]^i[0]|n[1]^i[1]|n[2]^i[2]|n[3]^i[3]))return r}return{encode:function(t){var r=e(t);return n.encode(i.concat([t,r],t.length+4))},decode:function(e){var r=t(n.decode(e));if(!r)throw new Error("Invalid checksum");return r},decodeUnsafe:function(e){var r=n.decodeUnsafe(e);if(r)return t(r)}}}},(e,t,r)=>{var n=r(267);e.exports=n("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz")},(e,t,r)=>{"use strict";var n=r(1).Buffer;e.exports=function(e){if(e.length>=255)throw new TypeError("Alphabet too long");for(var t=new Uint8Array(256),r=0;r>>0,c=new Uint8Array(a);e[r];){var h=t[e.charCodeAt(r)];if(255===h)return;for(var l=0,d=a-1;(0!==h||l>>0,c[d]=h%256>>>0,h=h/256>>>0;if(0!==h)throw new Error("Non-zero carry");o=l,r++}for(var p=a-o;p!==a&&0===c[p];)p++;var b=n.allocUnsafe(i+(a-p));b.fill(0,0,i);for(var y=i;p!==a;)b[y++]=c[p++];return b}return{encode:function(t){if((Array.isArray(t)||t instanceof Uint8Array)&&(t=n.from(t)),!n.isBuffer(t))throw new TypeError("Expected Buffer");if(0===t.length)return"";for(var r=0,i=0,o=0,a=t.length;o!==a&&0===t[o];)o++,r++;for(var u=(a-o)*c+1>>>0,h=new Uint8Array(u);o!==a;){for(var l=t[o],d=0,p=u-1;(0!==l||d>>0,h[p]=l%s>>>0,l=l/s>>>0;if(0!==l)throw new Error("Non-zero carry");i=d,o++}for(var b=u-i;b!==u&&0===h[b];)b++;for(var y=f.repeat(r);b{"use strict";e.exports=r(269)(r(272))},(e,t,r)=>{"use strict";var n=r(332),i=r(333),o=r(271);function a(e,t){return void 0===e?t:(n.isBoolean(e,o.COMPRESSED_TYPE_INVALID),e)}e.exports=function(e){return{privateKeyVerify:function(t){return n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),32===t.length&&e.privateKeyVerify(t)},privateKeyExport:function(t,r){n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),n.isBufferLength(t,32,o.EC_PRIVATE_KEY_LENGTH_INVALID),r=a(r,!0);var s=e.privateKeyExport(t,r);return i.privateKeyExport(t,s,r)},privateKeyImport:function(t){if(n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),(t=i.privateKeyImport(t))&&32===t.length&&e.privateKeyVerify(t))return t;throw new Error(o.EC_PRIVATE_KEY_IMPORT_DER_FAIL)},privateKeyNegate:function(t){return n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),n.isBufferLength(t,32,o.EC_PRIVATE_KEY_LENGTH_INVALID),e.privateKeyNegate(t)},privateKeyModInverse:function(t){return n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),n.isBufferLength(t,32,o.EC_PRIVATE_KEY_LENGTH_INVALID),e.privateKeyModInverse(t)},privateKeyTweakAdd:function(t,r){return n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),n.isBufferLength(t,32,o.EC_PRIVATE_KEY_LENGTH_INVALID),n.isBuffer(r,o.TWEAK_TYPE_INVALID),n.isBufferLength(r,32,o.TWEAK_LENGTH_INVALID),e.privateKeyTweakAdd(t,r)},privateKeyTweakMul:function(t,r){return n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),n.isBufferLength(t,32,o.EC_PRIVATE_KEY_LENGTH_INVALID),n.isBuffer(r,o.TWEAK_TYPE_INVALID),n.isBufferLength(r,32,o.TWEAK_LENGTH_INVALID),e.privateKeyTweakMul(t,r)},publicKeyCreate:function(t,r){return n.isBuffer(t,o.EC_PRIVATE_KEY_TYPE_INVALID),n.isBufferLength(t,32,o.EC_PRIVATE_KEY_LENGTH_INVALID),r=a(r,!0),e.publicKeyCreate(t,r)},publicKeyConvert:function(t,r){return n.isBuffer(t,o.EC_PUBLIC_KEY_TYPE_INVALID),n.isBufferLength2(t,33,65,o.EC_PUBLIC_KEY_LENGTH_INVALID),r=a(r,!0),e.publicKeyConvert(t,r)},publicKeyVerify:function(t){return n.isBuffer(t,o.EC_PUBLIC_KEY_TYPE_INVALID),e.publicKeyVerify(t)},publicKeyTweakAdd:function(t,r,i){return n.isBuffer(t,o.EC_PUBLIC_KEY_TYPE_INVALID),n.isBufferLength2(t,33,65,o.EC_PUBLIC_KEY_LENGTH_INVALID),n.isBuffer(r,o.TWEAK_TYPE_INVALID),n.isBufferLength(r,32,o.TWEAK_LENGTH_INVALID),i=a(i,!0),e.publicKeyTweakAdd(t,r,i)},publicKeyTweakMul:function(t,r,i){return n.isBuffer(t,o.EC_PUBLIC_KEY_TYPE_INVALID),n.isBufferLength2(t,33,65,o.EC_PUBLIC_KEY_LENGTH_INVALID),n.isBuffer(r,o.TWEAK_TYPE_INVALID),n.isBufferLength(r,32,o.TWEAK_LENGTH_INVALID),i=a(i,!0),e.publicKeyTweakMul(t,r,i)},publicKeyCombine:function(t,r){n.isArray(t,o.EC_PUBLIC_KEYS_TYPE_INVALID),n.isLengthGTZero(t,o.EC_PUBLIC_KEYS_LENGTH_INVALID);for(var i=0;i{var n=r(1).Buffer;e.exports={check:function(e){if(e.length<8)return!1;if(e.length>72)return!1;if(48!==e[0])return!1;if(e[1]!==e.length-2)return!1;if(2!==e[2])return!1;var t=e[3];if(0===t)return!1;if(5+t>=e.length)return!1;if(2!==e[4+t])return!1;var r=e[5+t];return!(0===r||6+t+r!==e.length||128&e[4]||t>1&&0===e[4]&&!(128&e[5])||128&e[t+6]||r>1&&0===e[t+6]&&!(128&e[t+7]))},decode:function(e){if(e.length<8)throw new Error("DER sequence length is too short");if(e.length>72)throw new Error("DER sequence length is too long");if(48!==e[0])throw new Error("Expected DER sequence");if(e[1]!==e.length-2)throw new Error("DER sequence length is invalid");if(2!==e[2])throw new Error("Expected DER integer");var t=e[3];if(0===t)throw new Error("R length is zero");if(5+t>=e.length)throw new Error("R length is too long");if(2!==e[4+t])throw new Error("Expected DER integer (2)");var r=e[5+t];if(0===r)throw new Error("S length is zero");if(6+t+r!==e.length)throw new Error("S length is invalid");if(128&e[4])throw new Error("R value is negative");if(t>1&&0===e[4]&&!(128&e[5]))throw new Error("R value excessively padded");if(128&e[t+6])throw new Error("S value is negative");if(r>1&&0===e[t+6]&&!(128&e[t+7]))throw new Error("S value excessively padded");return{r:e.slice(4,4+t),s:e.slice(6+t)}},encode:function(e,t){var r=e.length,i=t.length;if(0===r)throw new Error("R length is zero");if(0===i)throw new Error("S length is zero");if(r>33)throw new Error("R length is too long");if(i>33)throw new Error("S length is too long");if(128&e[0])throw new Error("R value is negative");if(128&t[0])throw new Error("S value is negative");if(r>1&&0===e[0]&&!(128&e[1]))throw new Error("R value excessively padded");if(i>1&&0===t[0]&&!(128&t[1]))throw new Error("S value excessively padded");var o=n.allocUnsafe(6+r+i);return o[0]=48,o[1]=o.length-2,o[2]=2,o[3]=e.length,e.copy(o,4),o[4+r]=2,o[5+r]=t.length,t.copy(o,6+r),o}}},e=>{"use strict";e.exports=JSON.parse('{"COMPRESSED_TYPE_INVALID":"compressed should be a boolean","EC_PRIVATE_KEY_TYPE_INVALID":"private key should be a Buffer","EC_PRIVATE_KEY_LENGTH_INVALID":"private key length is invalid","EC_PRIVATE_KEY_RANGE_INVALID":"private key range is invalid","EC_PRIVATE_KEY_TWEAK_ADD_FAIL":"tweak out of range or resulting private key is invalid","EC_PRIVATE_KEY_TWEAK_MUL_FAIL":"tweak out of range","EC_PRIVATE_KEY_EXPORT_DER_FAIL":"couldn\'t export to DER format","EC_PRIVATE_KEY_IMPORT_DER_FAIL":"couldn\'t import from DER format","EC_PUBLIC_KEYS_TYPE_INVALID":"public keys should be an Array","EC_PUBLIC_KEYS_LENGTH_INVALID":"public keys Array should have at least 1 element","EC_PUBLIC_KEY_TYPE_INVALID":"public key should be a Buffer","EC_PUBLIC_KEY_LENGTH_INVALID":"public key length is invalid","EC_PUBLIC_KEY_PARSE_FAIL":"the public key could not be parsed or is invalid","EC_PUBLIC_KEY_CREATE_FAIL":"private was invalid, try again","EC_PUBLIC_KEY_TWEAK_ADD_FAIL":"tweak out of range or resulting public key is invalid","EC_PUBLIC_KEY_TWEAK_MUL_FAIL":"tweak out of range","EC_PUBLIC_KEY_COMBINE_FAIL":"the sum of the public keys is not valid","ECDH_FAIL":"scalar was invalid (zero or overflow)","ECDSA_SIGNATURE_TYPE_INVALID":"signature should be a Buffer","ECDSA_SIGNATURE_LENGTH_INVALID":"signature length is invalid","ECDSA_SIGNATURE_PARSE_FAIL":"couldn\'t parse signature","ECDSA_SIGNATURE_PARSE_DER_FAIL":"couldn\'t parse DER signature","ECDSA_SIGNATURE_SERIALIZE_DER_FAIL":"couldn\'t serialize signature to DER format","ECDSA_SIGN_FAIL":"nonce generation function failed or private key is invalid","ECDSA_RECOVER_FAIL":"couldn\'t recover public key from signature","MSG32_TYPE_INVALID":"message should be a Buffer","MSG32_LENGTH_INVALID":"message length is invalid","OPTIONS_TYPE_INVALID":"options should be an Object","OPTIONS_DATA_TYPE_INVALID":"options.data should be a Buffer","OPTIONS_DATA_LENGTH_INVALID":"options.data length is invalid","OPTIONS_NONCEFN_TYPE_INVALID":"options.noncefn should be a Function","RECOVERY_ID_TYPE_INVALID":"recovery should be a Number","RECOVERY_ID_VALUE_INVALID":"recovery should have value between -1 and 4","TWEAK_TYPE_INVALID":"tweak should be a Buffer","TWEAK_LENGTH_INVALID":"tweak length is invalid"}')},(e,t,r)=>{"use strict";var n=r(1).Buffer,i=r(13),o=r(2),a=r(20).ec,s=r(271),f=new a("secp256k1"),u=f.curve;function c(e){var t=e[0];switch(t){case 2:case 3:return 33!==e.length?null:function(e,t){var r=new o(t);if(r.cmp(u.p)>=0)return null;var n=(r=r.toRed(u.red)).redSqr().redIMul(r).redIAdd(u.b).redSqrt();return 3===e!==n.isOdd()&&(n=n.redNeg()),f.keyPair({pub:{x:r,y:n}})}(t,e.slice(1,33));case 4:case 6:case 7:return 65!==e.length?null:function(e,t,r){var n=new o(t),i=new o(r);if(n.cmp(u.p)>=0||i.cmp(u.p)>=0)return null;if(n=n.toRed(u.red),i=i.toRed(u.red),(6===e||7===e)&&i.isOdd()!==(7===e))return null;var a=n.redSqr().redIMul(n);return i.redSqr().redISub(a.redIAdd(u.b)).isZero()?f.keyPair({pub:{x:n,y:i}}):null}(t,e.slice(1,33),e.slice(33,65));default:return null}}t.privateKeyVerify=function(e){var t=new o(e);return t.cmp(u.n)<0&&!t.isZero()},t.privateKeyExport=function(e,t){var r=new o(e);if(r.cmp(u.n)>=0||r.isZero())throw new Error(s.EC_PRIVATE_KEY_EXPORT_DER_FAIL);return n.from(f.keyFromPrivate(e).getPublic(t,!0))},t.privateKeyNegate=function(e){var t=new o(e);return t.isZero()?n.alloc(32):u.n.sub(t).umod(u.n).toArrayLike(n,"be",32)},t.privateKeyModInverse=function(e){var t=new o(e);if(t.cmp(u.n)>=0||t.isZero())throw new Error(s.EC_PRIVATE_KEY_RANGE_INVALID);return t.invm(u.n).toArrayLike(n,"be",32)},t.privateKeyTweakAdd=function(e,t){var r=new o(t);if(r.cmp(u.n)>=0)throw new Error(s.EC_PRIVATE_KEY_TWEAK_ADD_FAIL);if(r.iadd(new o(e)),r.cmp(u.n)>=0&&r.isub(u.n),r.isZero())throw new Error(s.EC_PRIVATE_KEY_TWEAK_ADD_FAIL);return r.toArrayLike(n,"be",32)},t.privateKeyTweakMul=function(e,t){var r=new o(t);if(r.cmp(u.n)>=0||r.isZero())throw new Error(s.EC_PRIVATE_KEY_TWEAK_MUL_FAIL);return r.imul(new o(e)),r.cmp(u.n)&&(r=r.umod(u.n)),r.toArrayLike(n,"be",32)},t.publicKeyCreate=function(e,t){var r=new o(e);if(r.cmp(u.n)>=0||r.isZero())throw new Error(s.EC_PUBLIC_KEY_CREATE_FAIL);return n.from(f.keyFromPrivate(e).getPublic(t,!0))},t.publicKeyConvert=function(e,t){var r=c(e);if(null===r)throw new Error(s.EC_PUBLIC_KEY_PARSE_FAIL);return n.from(r.getPublic(t,!0))},t.publicKeyVerify=function(e){return null!==c(e)},t.publicKeyTweakAdd=function(e,t,r){var i=c(e);if(null===i)throw new Error(s.EC_PUBLIC_KEY_PARSE_FAIL);if((t=new o(t)).cmp(u.n)>=0)throw new Error(s.EC_PUBLIC_KEY_TWEAK_ADD_FAIL);var a=u.g.mul(t).add(i.pub);if(a.isInfinity())throw new Error(s.EC_PUBLIC_KEY_TWEAK_ADD_FAIL);return n.from(a.encode(!0,r))},t.publicKeyTweakMul=function(e,t,r){var i=c(e);if(null===i)throw new Error(s.EC_PUBLIC_KEY_PARSE_FAIL);if((t=new o(t)).cmp(u.n)>=0||t.isZero())throw new Error(s.EC_PUBLIC_KEY_TWEAK_MUL_FAIL);return n.from(i.pub.mul(t).encode(!0,r))},t.publicKeyCombine=function(e,t){for(var r=new Array(e.length),i=0;i=0||r.cmp(u.n)>=0)throw new Error(s.ECDSA_SIGNATURE_PARSE_FAIL);var i=n.from(e);return 1===r.cmp(f.nh)&&u.n.sub(r).toArrayLike(n,"be",32).copy(i,32),i},t.signatureExport=function(e){var t=e.slice(0,32),r=e.slice(32,64);if(new o(t).cmp(u.n)>=0||new o(r).cmp(u.n)>=0)throw new Error(s.ECDSA_SIGNATURE_PARSE_FAIL);return{r:t,s:r}},t.signatureImport=function(e){var t=new o(e.r);t.cmp(u.n)>=0&&(t=new o(0));var r=new o(e.s);return r.cmp(u.n)>=0&&(r=new o(0)),n.concat([t.toArrayLike(n,"be",32),r.toArrayLike(n,"be",32)])},t.sign=function(e,t,r,i){if("function"==typeof r){var a=r;r=function(r){var f=a(e,t,null,i,r);if(!n.isBuffer(f)||32!==f.length)throw new Error(s.ECDSA_SIGN_FAIL);return new o(f)}}var c=new o(t);if(c.cmp(u.n)>=0||c.isZero())throw new Error(s.ECDSA_SIGN_FAIL);var h=f.sign(e,t,{canonical:!0,k:r,pers:i});return{signature:n.concat([h.r.toArrayLike(n,"be",32),h.s.toArrayLike(n,"be",32)]),recovery:h.recoveryParam}},t.verify=function(e,t,r){var n={r:t.slice(0,32),s:t.slice(32,64)},i=new o(n.r),a=new o(n.s);if(i.cmp(u.n)>=0||a.cmp(u.n)>=0)throw new Error(s.ECDSA_SIGNATURE_PARSE_FAIL);if(1===a.cmp(f.nh)||i.isZero()||a.isZero())return!1;var h=c(r);if(null===h)throw new Error(s.EC_PUBLIC_KEY_PARSE_FAIL);return f.verify(e,n,{x:h.pub.x,y:h.pub.y})},t.recover=function(e,t,r,i){var a={r:t.slice(0,32),s:t.slice(32,64)},c=new o(a.r),h=new o(a.s);if(c.cmp(u.n)>=0||h.cmp(u.n)>=0)throw new Error(s.ECDSA_SIGNATURE_PARSE_FAIL);try{if(c.isZero()||h.isZero())throw new Error;var l=f.recoverPubKey(e,a,r);return n.from(l.encode(!0,i))}catch(e){throw new Error(s.ECDSA_RECOVER_FAIL)}},t.ecdh=function(e,r){var n=t.ecdhUnsafe(e,r,!0);return i("sha256").update(n).digest()},t.ecdhUnsafe=function(e,t,r){var i=c(e);if(null===i)throw new Error(s.EC_PUBLIC_KEY_PARSE_FAIL);var a=new o(t);if(a.cmp(u.n)>=0||a.isZero())throw new Error(s.ECDH_FAIL);return n.from(i.pub.mul(a).encode(!0,r))}},(e,t,r)=>{const n=r(274);n.async=r(275),e.exports=n},(e,t,r)=>{const n=r(61),{checkAndInit:i,smixSync:o}=r(142);e.exports=function(e,t,r,a,s,f,u){const{XY:c,V:h,B32:l,x:d,_X:p,B:b,tickCallback:y}=i(e,t,r,a,s,f,u);for(var m=0;m{const n=r(61),{checkAndInit:i,smix:o}=r(142);e.exports=async function(e,t,r,a,s,f,u,c){const{XY:h,V:l,B32:d,x:p,_X:b,B:y,tickCallback:m}=i(e,t,r,a,s,f,u);for(var g=0;g{e.exports=r(277)(r(286))},(e,t,r)=>{const n=r(278),i=r(285);e.exports=function(e){const t=n(e),r=i(e);return function(e,n){switch("string"==typeof e?e.toLowerCase():e){case"keccak224":return new t(1152,448,null,224,n);case"keccak256":return new t(1088,512,null,256,n);case"keccak384":return new t(832,768,null,384,n);case"keccak512":return new t(576,1024,null,512,n);case"sha3-224":return new t(1152,448,6,224,n);case"sha3-256":return new t(1088,512,6,256,n);case"sha3-384":return new t(832,768,6,384,n);case"sha3-512":return new t(576,1024,6,512,n);case"shake128":return new r(1344,256,31,n);case"shake256":return new r(1088,512,31,n);default:throw new Error("Invald algorithm: "+e)}}}},(e,t,r)=>{const{Transform:n}=r(72);e.exports=e=>class t extends n{constructor(t,r,n,i,o){super(o),this._rate=t,this._capacity=r,this._delimitedSuffix=n,this._hashBitLength=i,this._options=o,this._state=new e,this._state.initialize(t,r),this._finalized=!1}_transform(e,t,r){let n=null;try{this.update(e,t)}catch(e){n=e}r(n)}_flush(e){let t=null;try{this.push(this.digest())}catch(e){t=e}e(t)}update(e,t){if(!Buffer.isBuffer(e)&&"string"!=typeof e)throw new TypeError("Data must be a string or a buffer");if(this._finalized)throw new Error("Digest already called");return Buffer.isBuffer(e)||(e=Buffer.from(e,t)),this._state.absorb(e),this}digest(e){if(this._finalized)throw new Error("Digest already called");this._finalized=!0,this._delimitedSuffix&&this._state.absorbLastFewBits(this._delimitedSuffix);let t=this._state.squeeze(this._hashBitLength/8);return void 0!==e&&(t=t.toString(e)),this._resetState(),t}_resetState(){return this._state.initialize(this._rate,this._capacity),this}_clone(){const e=new t(this._rate,this._capacity,this._delimitedSuffix,this._hashBitLength,this._options);return this._state.copy(e._state),e._finalized=this._finalized,e}}},(e,t,r)=>{e.exports=r(10).EventEmitter},(e,t,r)=>{"use strict";function n(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function i(e){for(var t=1;t0?this.tail.next=t:this.head=t,this.tail=t,++this.length}},{key:"unshift",value:function(e){var t={data:e,next:this.head};0===this.length&&(this.tail=t),this.head=t,++this.length}},{key:"shift",value:function(){if(0!==this.length){var e=this.head.data;return 1===this.length?this.head=this.tail=null:this.head=this.head.next,--this.length,e}}},{key:"clear",value:function(){this.head=this.tail=null,this.length=0}},{key:"join",value:function(e){if(0===this.length)return"";for(var t=this.head,r=""+t.data;t=t.next;)r+=e+t.data;return r}},{key:"concat",value:function(e){if(0===this.length)return f.alloc(0);for(var t,r,n,i=f.allocUnsafe(e>>>0),o=this.head,a=0;o;)t=o.data,r=i,n=a,f.prototype.copy.call(t,r,n),a+=o.data.length,o=o.next;return i}},{key:"consume",value:function(e,t){var r;return ei.length?i.length:e;if(o===i.length?n+=i:n+=i.slice(0,e),0==(e-=o)){o===i.length?(++r,t.next?this.head=t.next:this.head=this.tail=null):(this.head=t,t.data=i.slice(o));break}++r}return this.length-=r,n}},{key:"_getBuffer",value:function(e){var t=f.allocUnsafe(e),r=this.head,n=1;for(r.data.copy(t),e-=r.data.length;r=r.next;){var i=r.data,o=e>i.length?i.length:e;if(i.copy(t,t.length-e,0,o),0==(e-=o)){o===i.length?(++n,r.next?this.head=r.next:this.head=this.tail=null):(this.head=r,r.data=i.slice(o));break}++n}return this.length-=n,t}},{key:c,value:function(e,t){return u(this,i(i({},t),{},{depth:0,customInspect:!1}))}}])&&a(t.prototype,r),Object.defineProperty(t,"prototype",{writable:!1}),e}()},(e,t,r)=>{"use strict";var n;function i(e,t,r){return(t=function(e){var t=function(e,t){if("object"!=typeof e||null===e)return e;var r=e[Symbol.toPrimitive];if(void 0!==r){var n=r.call(e,"string");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(e);return"symbol"==typeof t?t:String(t)}(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}var o=r(69),a=Symbol("lastResolve"),s=Symbol("lastReject"),f=Symbol("error"),u=Symbol("ended"),c=Symbol("lastPromise"),h=Symbol("handlePromise"),l=Symbol("stream");function d(e,t){return{value:e,done:t}}function p(e){var t=e[a];if(null!==t){var r=e[l].read();null!==r&&(e[c]=null,e[a]=null,e[s]=null,t(d(r,!1)))}}function b(e){process.nextTick(p,e)}var y=Object.getPrototypeOf((function(){})),m=Object.setPrototypeOf((i(n={get stream(){return this[l]},next:function(){var e=this,t=this[f];if(null!==t)return Promise.reject(t);if(this[u])return Promise.resolve(d(void 0,!0));if(this[l].destroyed)return new Promise((function(t,r){process.nextTick((function(){e[f]?r(e[f]):t(d(void 0,!0))}))}));var r,n=this[c];if(n)r=new Promise(function(e,t){return function(r,n){e.then((function(){t[u]?r(d(void 0,!0)):t[h](r,n)}),n)}}(n,this));else{var i=this[l].read();if(null!==i)return Promise.resolve(d(i,!1));r=new Promise(this[h])}return this[c]=r,r}},Symbol.asyncIterator,(function(){return this})),i(n,"return",(function(){var e=this;return new Promise((function(t,r){e[l].destroy(null,(function(e){e?r(e):t(d(void 0,!0))}))}))})),n),y);e.exports=function(e){var t,r=Object.create(m,(i(t={},l,{value:e,writable:!0}),i(t,a,{value:null,writable:!0}),i(t,s,{value:null,writable:!0}),i(t,f,{value:null,writable:!0}),i(t,u,{value:e._readableState.endEmitted,writable:!0}),i(t,h,{value:function(e,t){var n=r[l].read();n?(r[c]=null,r[a]=null,r[s]=null,e(d(n,!1))):(r[a]=e,r[s]=t)},writable:!0}),t));return r[c]=null,o(e,(function(e){if(e&&"ERR_STREAM_PREMATURE_CLOSE"!==e.code){var t=r[s];return null!==t&&(r[c]=null,r[a]=null,r[s]=null,t(e)),void(r[f]=e)}var n=r[a];null!==n&&(r[c]=null,r[a]=null,r[s]=null,n(d(void 0,!0))),r[u]=!0})),e.on("readable",b.bind(null,r)),r}},e=>{e.exports=function(){throw new Error("Readable.from is not available in the browser")}},(e,t,r)=>{"use strict";e.exports=i;var n=r(147);function i(e){if(!(this instanceof i))return new i(e);n.call(this,e)}r(0)(i,n),i.prototype._transform=function(e,t,r){r(null,e)}},(e,t,r)=>{"use strict";var n,i=r(25).q,o=i.ERR_MISSING_ARGS,a=i.ERR_STREAM_DESTROYED;function s(e){if(e)throw e}function f(e){e()}function u(e,t){return e.pipe(t)}e.exports=function(){for(var e=arguments.length,t=new Array(e),i=0;i0,(function(e){c||(c=e),e&&l.forEach(f),o||(l.forEach(f),h(c))}))}));return t.reduce(u)}},(e,t,r)=>{const{Transform:n}=r(72);e.exports=e=>class t extends n{constructor(t,r,n,i){super(i),this._rate=t,this._capacity=r,this._delimitedSuffix=n,this._options=i,this._state=new e,this._state.initialize(t,r),this._finalized=!1}_transform(e,t,r){let n=null;try{this.update(e,t)}catch(e){n=e}r(n)}_flush(){}_read(e){this.push(this.squeeze(e))}update(e,t){if(!Buffer.isBuffer(e)&&"string"!=typeof e)throw new TypeError("Data must be a string or a buffer");if(this._finalized)throw new Error("Squeeze already called");return Buffer.isBuffer(e)||(e=Buffer.from(e,t)),this._state.absorb(e),this}squeeze(e,t){this._finalized||(this._finalized=!0,this._state.absorbLastFewBits(this._delimitedSuffix));let r=this._state.squeeze(e);return void 0!==t&&(r=r.toString(t)),r}_resetState(){return this._state.initialize(this._rate,this._capacity),this}_clone(){const e=new t(this._rate,this._capacity,this._delimitedSuffix,this._options);return this._state.copy(e._state),e._finalized=this._finalized,e}}},(e,t,r)=>{const n=r(337);function i(){this.state=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],this.blockSize=null,this.count=0,this.squeezing=!1}i.prototype.initialize=function(e,t){for(let e=0;e<50;++e)this.state[e]=0;this.blockSize=e/8,this.count=0,this.squeezing=!1},i.prototype.absorb=function(e){for(let t=0;t>>this.count%4*8&255,this.count+=1,this.count===this.blockSize&&(n.p1600(this.state),this.count=0);return t},i.prototype.copy=function(e){for(let t=0;t<50;++t)e.state[t]=this.state[t];e.blockSize=this.blockSize,e.count=this.count,e.squeezing=this.squeezing},e.exports=i},e=>{"use strict";e.exports=e=>encodeURIComponent(e).replace(/[!'()*]/g,(e=>`%${e.charCodeAt(0).toString(16).toUpperCase()}`))},e=>{"use strict";var t="%[a-f0-9]{2}",r=new RegExp("("+t+")|([^%]+?)","gi"),n=new RegExp("("+t+")+","gi");function i(e,t){try{return[decodeURIComponent(e.join(""))]}catch(e){}if(1===e.length)return e;t=t||1;var r=e.slice(0,t),n=e.slice(t);return Array.prototype.concat.call([],i(r),i(n))}function o(e){try{return decodeURIComponent(e)}catch(o){for(var t=e.match(r)||[],n=1;n{"use strict";e.exports=(e,t)=>{if("string"!=typeof e||"string"!=typeof t)throw new TypeError("Expected the arguments to be of type `string`");if(""===t)return[e];const r=e.indexOf(t);return-1===r?[e]:[e.slice(0,r),e.slice(r+t.length)]}},e=>{"use strict";e.exports=function(e,t){for(var r={},n=Object.keys(e),i=Array.isArray(t),o=0;o{"use strict";e.exports=r(163)},(e,t,r)=>{"use strict";Object.defineProperty(t,"__esModule",{value:!0});const n={};let i;t.wordlists=n,t._default=i;try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/czech.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.czech=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/chinese_simplified.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.chinese_simplified=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/chinese_traditional.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.chinese_traditional=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/korean.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.korean=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/french.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.french=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/italian.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.italian=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/spanish.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.spanish=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/japanese.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.japanese=i,n.JA=i}catch(e){}try{t._default=i=r(Object(function(){var e=new Error("Cannot find module './wordlists/portuguese.json'");throw e.code="MODULE_NOT_FOUND",e}())),n.portuguese=i}catch(e){}try{t._default=i=r(310),n.english=i,n.EN=i}catch(e){}},(e,t,r)=>{var n=r(23),i=r(1).Buffer,o=r(123);function a(e){var t=e._cipher.encryptBlockRaw(e._prev);return o(e._prev),t}t.encrypt=function(e,t){var r=Math.ceil(t.length/16),o=e._cache.length;e._cache=i.concat([e._cache,i.allocUnsafe(16*r)]);for(var s=0;s{"use strict";t.byteLength=function(e){var t=s(e),r=t[0],n=t[1];return 3*(r+n)/4-n},t.toByteArray=function(e){var t,r,o=s(e),a=o[0],f=o[1],u=new i(function(e,t,r){return 3*(t+r)/4-r}(0,a,f)),c=0,h=f>0?a-4:a;for(r=0;r>16&255,u[c++]=t>>8&255,u[c++]=255&t;return 2===f&&(t=n[e.charCodeAt(r)]<<2|n[e.charCodeAt(r+1)]>>4,u[c++]=255&t),1===f&&(t=n[e.charCodeAt(r)]<<10|n[e.charCodeAt(r+1)]<<4|n[e.charCodeAt(r+2)]>>2,u[c++]=t>>8&255,u[c++]=255&t),u},t.fromByteArray=function(e){for(var t,n=e.length,i=n%3,o=[],a=16383,s=0,u=n-i;su?u:s+a));return 1===i?(t=e[n-1],o.push(r[t>>2]+r[t<<4&63]+"==")):2===i&&(t=(e[n-2]<<8)+e[n-1],o.push(r[t>>10]+r[t>>4&63]+r[t<<2&63]+"=")),o.join("")};for(var r=[],n=[],i="undefined"!=typeof Uint8Array?Uint8Array:Array,o="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",a=0;a<64;++a)r[a]=o[a],n[o.charCodeAt(a)]=a;function s(e){var t=e.length;if(t%4>0)throw new Error("Invalid string. Length must be a multiple of 4");var r=e.indexOf("=");return-1===r&&(r=t),[r,r===t?0:4-r%4]}function f(e,t,n){for(var i,o,a=[],s=t;s>18&63]+r[o>>12&63]+r[o>>6&63]+r[63&o]);return a.join("")}n["-".charCodeAt(0)]=62,n["_".charCodeAt(0)]=63},(e,t)=>{t.read=function(e,t,r,n,i){var o,a,s=8*i-n-1,f=(1<>1,c=-7,h=r?i-1:0,l=r?-1:1,d=e[t+h];for(h+=l,o=d&(1<<-c)-1,d>>=-c,c+=s;c>0;o=256*o+e[t+h],h+=l,c-=8);for(a=o&(1<<-c)-1,o>>=-c,c+=n;c>0;a=256*a+e[t+h],h+=l,c-=8);if(0===o)o=1-u;else{if(o===f)return a?NaN:1/0*(d?-1:1);a+=Math.pow(2,n),o-=u}return(d?-1:1)*a*Math.pow(2,o-n)},t.write=function(e,t,r,n,i,o){var a,s,f,u=8*o-i-1,c=(1<>1,l=23===i?Math.pow(2,-24)-Math.pow(2,-77):0,d=n?0:o-1,p=n?1:-1,b=t<0||0===t&&1/t<0?1:0;for(t=Math.abs(t),isNaN(t)||t===1/0?(s=isNaN(t)?1:0,a=c):(a=Math.floor(Math.log(t)/Math.LN2),t*(f=Math.pow(2,-a))<1&&(a--,f*=2),(t+=a+h>=1?l/f:l*Math.pow(2,1-h))*f>=2&&(a++,f/=2),a+h>=c?(s=0,a=c):a+h>=1?(s=(t*f-1)*Math.pow(2,i),a+=h):(s=t*Math.pow(2,h-1)*Math.pow(2,i),a=0));i>=8;e[r+d]=255&s,d+=p,s/=256,i-=8);for(a=a<0;e[r+d]=255&a,d+=p,a/=256,u-=8);e[r+d-p]|=128*b}},(e,t,r)=>{"use strict";e.exports=r(298)},(e,t,r)=>{"use strict";var n=e.exports=r(163);n.build="full",n.tokenize=r(85),n.parse=r(179),n.common=r(180),n.Root._configure(n.Type,n.parse,n.common)},e=>{"use strict";e.exports=JSON.parse('{"nested":{"google":{"nested":{"protobuf":{"nested":{"FileDescriptorSet":{"fields":{"file":{"rule":"repeated","type":"FileDescriptorProto","id":1}}},"FileDescriptorProto":{"fields":{"name":{"type":"string","id":1},"package":{"type":"string","id":2},"dependency":{"rule":"repeated","type":"string","id":3},"publicDependency":{"rule":"repeated","type":"int32","id":10,"options":{"packed":false}},"weakDependency":{"rule":"repeated","type":"int32","id":11,"options":{"packed":false}},"messageType":{"rule":"repeated","type":"DescriptorProto","id":4},"enumType":{"rule":"repeated","type":"EnumDescriptorProto","id":5},"service":{"rule":"repeated","type":"ServiceDescriptorProto","id":6},"extension":{"rule":"repeated","type":"FieldDescriptorProto","id":7},"options":{"type":"FileOptions","id":8},"sourceCodeInfo":{"type":"SourceCodeInfo","id":9},"syntax":{"type":"string","id":12}}},"DescriptorProto":{"fields":{"name":{"type":"string","id":1},"field":{"rule":"repeated","type":"FieldDescriptorProto","id":2},"extension":{"rule":"repeated","type":"FieldDescriptorProto","id":6},"nestedType":{"rule":"repeated","type":"DescriptorProto","id":3},"enumType":{"rule":"repeated","type":"EnumDescriptorProto","id":4},"extensionRange":{"rule":"repeated","type":"ExtensionRange","id":5},"oneofDecl":{"rule":"repeated","type":"OneofDescriptorProto","id":8},"options":{"type":"MessageOptions","id":7},"reservedRange":{"rule":"repeated","type":"ReservedRange","id":9},"reservedName":{"rule":"repeated","type":"string","id":10}},"nested":{"ExtensionRange":{"fields":{"start":{"type":"int32","id":1},"end":{"type":"int32","id":2}}},"ReservedRange":{"fields":{"start":{"type":"int32","id":1},"end":{"type":"int32","id":2}}}}},"FieldDescriptorProto":{"fields":{"name":{"type":"string","id":1},"number":{"type":"int32","id":3},"label":{"type":"Label","id":4},"type":{"type":"Type","id":5},"typeName":{"type":"string","id":6},"extendee":{"type":"string","id":2},"defaultValue":{"type":"string","id":7},"oneofIndex":{"type":"int32","id":9},"jsonName":{"type":"string","id":10},"options":{"type":"FieldOptions","id":8}},"nested":{"Type":{"values":{"TYPE_DOUBLE":1,"TYPE_FLOAT":2,"TYPE_INT64":3,"TYPE_UINT64":4,"TYPE_INT32":5,"TYPE_FIXED64":6,"TYPE_FIXED32":7,"TYPE_BOOL":8,"TYPE_STRING":9,"TYPE_GROUP":10,"TYPE_MESSAGE":11,"TYPE_BYTES":12,"TYPE_UINT32":13,"TYPE_ENUM":14,"TYPE_SFIXED32":15,"TYPE_SFIXED64":16,"TYPE_SINT32":17,"TYPE_SINT64":18}},"Label":{"values":{"LABEL_OPTIONAL":1,"LABEL_REQUIRED":2,"LABEL_REPEATED":3}}}},"OneofDescriptorProto":{"fields":{"name":{"type":"string","id":1},"options":{"type":"OneofOptions","id":2}}},"EnumDescriptorProto":{"fields":{"name":{"type":"string","id":1},"value":{"rule":"repeated","type":"EnumValueDescriptorProto","id":2},"options":{"type":"EnumOptions","id":3}}},"EnumValueDescriptorProto":{"fields":{"name":{"type":"string","id":1},"number":{"type":"int32","id":2},"options":{"type":"EnumValueOptions","id":3}}},"ServiceDescriptorProto":{"fields":{"name":{"type":"string","id":1},"method":{"rule":"repeated","type":"MethodDescriptorProto","id":2},"options":{"type":"ServiceOptions","id":3}}},"MethodDescriptorProto":{"fields":{"name":{"type":"string","id":1},"inputType":{"type":"string","id":2},"outputType":{"type":"string","id":3},"options":{"type":"MethodOptions","id":4},"clientStreaming":{"type":"bool","id":5},"serverStreaming":{"type":"bool","id":6}}},"FileOptions":{"fields":{"javaPackage":{"type":"string","id":1},"javaOuterClassname":{"type":"string","id":8},"javaMultipleFiles":{"type":"bool","id":10},"javaGenerateEqualsAndHash":{"type":"bool","id":20,"options":{"deprecated":true}},"javaStringCheckUtf8":{"type":"bool","id":27},"optimizeFor":{"type":"OptimizeMode","id":9,"options":{"default":"SPEED"}},"goPackage":{"type":"string","id":11},"ccGenericServices":{"type":"bool","id":16},"javaGenericServices":{"type":"bool","id":17},"pyGenericServices":{"type":"bool","id":18},"deprecated":{"type":"bool","id":23},"ccEnableArenas":{"type":"bool","id":31},"objcClassPrefix":{"type":"string","id":36},"csharpNamespace":{"type":"string","id":37},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]],"reserved":[[38,38]],"nested":{"OptimizeMode":{"values":{"SPEED":1,"CODE_SIZE":2,"LITE_RUNTIME":3}}}},"MessageOptions":{"fields":{"messageSetWireFormat":{"type":"bool","id":1},"noStandardDescriptorAccessor":{"type":"bool","id":2},"deprecated":{"type":"bool","id":3},"mapEntry":{"type":"bool","id":7},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]],"reserved":[[8,8]]},"FieldOptions":{"fields":{"ctype":{"type":"CType","id":1,"options":{"default":"STRING"}},"packed":{"type":"bool","id":2},"jstype":{"type":"JSType","id":6,"options":{"default":"JS_NORMAL"}},"lazy":{"type":"bool","id":5},"deprecated":{"type":"bool","id":3},"weak":{"type":"bool","id":10},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]],"reserved":[[4,4]],"nested":{"CType":{"values":{"STRING":0,"CORD":1,"STRING_PIECE":2}},"JSType":{"values":{"JS_NORMAL":0,"JS_STRING":1,"JS_NUMBER":2}}}},"OneofOptions":{"fields":{"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"EnumOptions":{"fields":{"allowAlias":{"type":"bool","id":2},"deprecated":{"type":"bool","id":3},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"EnumValueOptions":{"fields":{"deprecated":{"type":"bool","id":1},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"ServiceOptions":{"fields":{"deprecated":{"type":"bool","id":33},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"MethodOptions":{"fields":{"deprecated":{"type":"bool","id":33},"uninterpretedOption":{"rule":"repeated","type":"UninterpretedOption","id":999}},"extensions":[[1000,536870911]]},"UninterpretedOption":{"fields":{"name":{"rule":"repeated","type":"NamePart","id":2},"identifierValue":{"type":"string","id":3},"positiveIntValue":{"type":"uint64","id":4},"negativeIntValue":{"type":"int64","id":5},"doubleValue":{"type":"double","id":6},"stringValue":{"type":"bytes","id":7},"aggregateValue":{"type":"string","id":8}},"nested":{"NamePart":{"fields":{"namePart":{"rule":"required","type":"string","id":1},"isExtension":{"rule":"required","type":"bool","id":2}}}}},"SourceCodeInfo":{"fields":{"location":{"rule":"repeated","type":"Location","id":1}},"nested":{"Location":{"fields":{"path":{"rule":"repeated","type":"int32","id":1},"span":{"rule":"repeated","type":"int32","id":2},"leadingComments":{"type":"string","id":3},"trailingComments":{"type":"string","id":4},"leadingDetachedComments":{"rule":"repeated","type":"string","id":6}}}}},"GeneratedCodeInfo":{"fields":{"annotation":{"rule":"repeated","type":"Annotation","id":1}},"nested":{"Annotation":{"fields":{"path":{"rule":"repeated","type":"int32","id":1},"sourceFile":{"type":"string","id":2},"begin":{"type":"int32","id":3},"end":{"type":"int32","id":4}}}}}}}}}}}')},e=>{"use strict";e.exports={i8:"6.5.4"}},()=>{},()=>{},(e,t,r)=>{"use strict";t.sha1=r(184),t.sha224=r(186),t.sha256=r(88),t.sha384=r(187),t.sha512=r(89)},(e,t,r)=>{"use strict";var n=r(9),i=r(34),o=n.rotl32,a=n.sum32,s=n.sum32_3,f=n.sum32_4,u=i.BlockHash;function c(){if(!(this instanceof c))return new c;u.call(this),this.h=[1732584193,4023233417,2562383102,271733878,3285377520],this.endian="little"}function h(e,t,r,n){return e<=15?t^r^n:e<=31?t&r|~t&n:e<=47?(t|~r)^n:e<=63?t&n|r&~n:t^(r|~n)}function l(e){return e<=15?0:e<=31?1518500249:e<=47?1859775393:e<=63?2400959708:2840853838}function d(e){return e<=15?1352829926:e<=31?1548603684:e<=47?1836072691:e<=63?2053994217:0}n.inherits(c,u),t.ripemd160=c,c.blockSize=512,c.outSize=160,c.hmacStrength=192,c.padLength=64,c.prototype._update=function(e,t){for(var r=this.h[0],n=this.h[1],i=this.h[2],u=this.h[3],c=this.h[4],g=r,_=n,v=i,w=u,E=c,S=0;S<80;S++){var M=a(o(f(r,h(S,n,i,u),e[p[S]+t],l(S)),y[S]),c);r=c,c=u,u=o(i,10),i=n,n=M,M=a(o(f(g,h(79-S,_,v,w),e[b[S]+t],d(S)),m[S]),E),g=E,E=w,w=o(v,10),v=_,_=M}M=s(this.h[1],i,w),this.h[1]=s(this.h[2],u,E),this.h[2]=s(this.h[3],c,g),this.h[3]=s(this.h[4],r,_),this.h[4]=s(this.h[0],n,v),this.h[0]=M},c.prototype._digest=function(e){return"hex"===e?n.toHex32(this.h,"little"):n.split32(this.h,"little")};var p=[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8,3,10,14,4,9,15,8,1,2,7,0,6,13,11,5,12,1,9,11,10,0,8,12,4,13,3,7,15,14,5,6,2,4,0,5,9,7,12,2,10,14,1,3,8,11,6,15,13],b=[5,14,7,0,9,2,11,4,13,6,15,8,1,10,3,12,6,11,3,7,0,13,5,10,14,15,8,12,4,9,1,2,15,5,1,3,7,14,6,9,11,8,12,2,10,0,4,13,8,6,4,1,3,11,15,0,5,12,2,13,9,7,10,14,12,15,10,4,1,5,8,7,6,2,13,14,0,3,9,11],y=[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8,7,6,8,13,11,9,7,15,7,12,15,9,11,7,13,12,11,13,6,7,14,9,13,15,14,8,13,6,5,12,7,5,11,12,14,15,14,15,9,8,9,14,5,6,8,6,5,12,9,15,5,11,6,8,13,12,5,12,13,14,11,8,5,6],m=[8,9,9,11,13,15,15,5,7,7,8,11,14,14,12,6,9,13,15,7,12,8,9,11,7,7,12,7,6,15,13,11,9,7,15,11,8,6,6,14,12,13,5,14,13,13,7,5,15,5,8,11,14,14,6,14,6,9,12,9,12,5,15,8,8,5,12,9,12,5,14,6,8,13,6,5,15,13,11,11]},(e,t,r)=>{"use strict";Object.defineProperty(t,"__esModule",{value:!0});const n=r(13),i=r(103),o=r(12),a=r(292);let s=a._default;const f="Invalid mnemonic",u="Invalid entropy",c="A wordlist is required but a default could not be found.\nPlease pass a 2048 word array explicitly.";function h(e){return(e||"").normalize("NFKD")}function l(e,t,r){for(;e.lengthl(e.toString(2),"0",8))).join("")}function b(e){const t=8*e.length/32,r=n("sha256").update(e).digest();return p(Array.from(r)).slice(0,t)}function y(e){return"mnemonic"+(e||"")}function m(e,t){if(!(t=t||s))throw new Error(c);const r=h(e).split(" ");if(r.length%3!=0)throw new Error(f);const n=r.map((e=>{const r=t.indexOf(e);if(-1===r)throw new Error(f);return l(r.toString(2),"0",11)})).join(""),i=32*Math.floor(n.length/33),o=n.slice(0,i),a=n.slice(i),p=o.match(/(.{1,8})/g).map(d);if(p.length<16)throw new Error(u);if(p.length>32)throw new Error(u);if(p.length%4!=0)throw new Error(u);const y=Buffer.from(p);if(b(y)!==a)throw new Error("Invalid mnemonic checksum");return y.toString("hex")}function g(e,t){if(Buffer.isBuffer(e)||(e=Buffer.from(e,"hex")),!(t=t||s))throw new Error(c);if(e.length<16)throw new TypeError(u);if(e.length>32)throw new TypeError(u);if(e.length%4!=0)throw new TypeError(u);const r=(p(Array.from(e))+b(e)).match(/(.{1,11})/g).map((e=>{const r=d(e);return t[r]}));return"あいこくしん"===t[0]?r.join("　"):r.join(" ")}t.mnemonicToSeedSync=function(e,t){const r=Buffer.from(h(e),"utf8"),n=Buffer.from(y(h(t)),"utf8");return i.pbkdf2Sync(r,n,2048,64,"sha512")},t.mnemonicToSeed=function(e,t){return Promise.resolve().then((()=>function(e,t,r,n,o){return Promise.resolve().then((()=>new Promise(((r,n)=>{i.pbkdf2(e,t,2048,64,"sha512",((e,t)=>e?n(e):r(t)))}))))}(Buffer.from(h(e),"utf8"),Buffer.from(y(h(t)),"utf8"))))},t.mnemonicToEntropy=m,t.entropyToMnemonic=g,t.generateMnemonic=function(e,t,r){if((e=e||128)%32!=0)throw new TypeError(u);return g((t=t||o)(e/8),r)},t.validateMnemonic=function(e,t){try{m(e,t)}catch(e){return!1}return!0},t.setDefaultWordlist=function(e){const t=a.wordlists[e];if(!t)throw new Error('Could not find wordlist for language "'+e+'"');s=t},t.getDefaultWordlist=function(){if(!s)throw new Error("No Default Wordlist set");return Object.keys(a.wordlists).filter((e=>"JA"!==e&&"EN"!==e&&a.wordlists[e].every(((e,t)=>e===s[t]))))[0]};var _=r(292);t.wordlists=_.wordlists},()=>{},()=>{},()=>{},()=>{},e=>{"use strict";e.exports=JSON.parse('["abandon","ability","able","about","above","absent","absorb","abstract","absurd","abuse","access","accident","account","accuse","achieve","acid","acoustic","acquire","across","act","action","actor","actress","actual","adapt","add","addict","address","adjust","admit","adult","advance","advice","aerobic","affair","afford","afraid","again","age","agent","agree","ahead","aim","air","airport","aisle","alarm","album","alcohol","alert","alien","all","alley","allow","almost","alone","alpha","already","also","alter","always","amateur","amazing","among","amount","amused","analyst","anchor","ancient","anger","angle","angry","animal","ankle","announce","annual","another","answer","antenna","antique","anxiety","any","apart","apology","appear","apple","approve","april","arch","arctic","area","arena","argue","arm","armed","armor","army","around","arrange","arrest","arrive","arrow","art","artefact","artist","artwork","ask","aspect","assault","asset","assist","assume","asthma","athlete","atom","attack","attend","attitude","attract","auction","audit","august","aunt","author","auto","autumn","average","avocado","avoid","awake","aware","away","awesome","awful","awkward","axis","baby","bachelor","bacon","badge","bag","balance","balcony","ball","bamboo","banana","banner","bar","barely","bargain","barrel","base","basic","basket","battle","beach","bean","beauty","because","become","beef","before","begin","behave","behind","believe","below","belt","bench","benefit","best","betray","better","between","beyond","bicycle","bid","bike","bind","biology","bird","birth","bitter","black","blade","blame","blanket","blast","bleak","bless","blind","blood","blossom","blouse","blue","blur","blush","board","boat","body","boil","bomb","bone","bonus","book","boost","border","boring","borrow","boss","bottom","bounce","box","boy","bracket","brain","brand","brass","brave","bread","breeze","brick","bridge","brief","bright","bring","brisk","broccoli","broken","bronze","broom","brother","brown","brush","bubble","buddy","budget","buffalo","build","bulb","bulk","bullet","bundle","bunker","burden","burger","burst","bus","business","busy","butter","buyer","buzz","cabbage","cabin","cable","cactus","cage","cake","call","calm","camera","camp","can","canal","cancel","candy","cannon","canoe","canvas","canyon","capable","capital","captain","car","carbon","card","cargo","carpet","carry","cart","case","cash","casino","castle","casual","cat","catalog","catch","category","cattle","caught","cause","caution","cave","ceiling","celery","cement","census","century","cereal","certain","chair","chalk","champion","change","chaos","chapter","charge","chase","chat","cheap","check","cheese","chef","cherry","chest","chicken","chief","child","chimney","choice","choose","chronic","chuckle","chunk","churn","cigar","cinnamon","circle","citizen","city","civil","claim","clap","clarify","claw","clay","clean","clerk","clever","click","client","cliff","climb","clinic","clip","clock","clog","close","cloth","cloud","clown","club","clump","cluster","clutch","coach","coast","coconut","code","coffee","coil","coin","collect","color","column","combine","come","comfort","comic","common","company","concert","conduct","confirm","congress","connect","consider","control","convince","cook","cool","copper","copy","coral","core","corn","correct","cost","cotton","couch","country","couple","course","cousin","cover","coyote","crack","cradle","craft","cram","crane","crash","crater","crawl","crazy","cream","credit","creek","crew","cricket","crime","crisp","critic","crop","cross","crouch","crowd","crucial","cruel","cruise","crumble","crunch","crush","cry","crystal","cube","culture","cup","cupboard","curious","current","curtain","curve","cushion","custom","cute","cycle","dad","damage","damp","dance","danger","daring","dash","daughter","dawn","day","deal","debate","debris","decade","december","decide","decline","decorate","decrease","deer","defense","define","defy","degree","delay","deliver","demand","demise","denial","dentist","deny","depart","depend","deposit","depth","deputy","derive","describe","desert","design","desk","despair","destroy","detail","detect","develop","device","devote","diagram","dial","diamond","diary","dice","diesel","diet","differ","digital","dignity","dilemma","dinner","dinosaur","direct","dirt","disagree","discover","disease","dish","dismiss","disorder","display","distance","divert","divide","divorce","dizzy","doctor","document","dog","doll","dolphin","domain","donate","donkey","donor","door","dose","double","dove","draft","dragon","drama","drastic","draw","dream","dress","drift","drill","drink","drip","drive","drop","drum","dry","duck","dumb","dune","during","dust","dutch","duty","dwarf","dynamic","eager","eagle","early","earn","earth","easily","east","easy","echo","ecology","economy","edge","edit","educate","effort","egg","eight","either","elbow","elder","electric","elegant","element","elephant","elevator","elite","else","embark","embody","embrace","emerge","emotion","employ","empower","empty","enable","enact","end","endless","endorse","enemy","energy","enforce","engage","engine","enhance","enjoy","enlist","enough","enrich","enroll","ensure","enter","entire","entry","envelope","episode","equal","equip","era","erase","erode","erosion","error","erupt","escape","essay","essence","estate","eternal","ethics","evidence","evil","evoke","evolve","exact","example","excess","exchange","excite","exclude","excuse","execute","exercise","exhaust","exhibit","exile","exist","exit","exotic","expand","expect","expire","explain","expose","express","extend","extra","eye","eyebrow","fabric","face","faculty","fade","faint","faith","fall","false","fame","family","famous","fan","fancy","fantasy","farm","fashion","fat","fatal","father","fatigue","fault","favorite","feature","february","federal","fee","feed","feel","female","fence","festival","fetch","fever","few","fiber","fiction","field","figure","file","film","filter","final","find","fine","finger","finish","fire","firm","first","fiscal","fish","fit","fitness","fix","flag","flame","flash","flat","flavor","flee","flight","flip","float","flock","floor","flower","fluid","flush","fly","foam","focus","fog","foil","fold","follow","food","foot","force","forest","forget","fork","fortune","forum","forward","fossil","foster","found","fox","fragile","frame","frequent","fresh","friend","fringe","frog","front","frost","frown","frozen","fruit","fuel","fun","funny","furnace","fury","future","gadget","gain","galaxy","gallery","game","gap","garage","garbage","garden","garlic","garment","gas","gasp","gate","gather","gauge","gaze","general","genius","genre","gentle","genuine","gesture","ghost","giant","gift","giggle","ginger","giraffe","girl","give","glad","glance","glare","glass","glide","glimpse","globe","gloom","glory","glove","glow","glue","goat","goddess","gold","good","goose","gorilla","gospel","gossip","govern","gown","grab","grace","grain","grant","grape","grass","gravity","great","green","grid","grief","grit","grocery","group","grow","grunt","guard","guess","guide","guilt","guitar","gun","gym","habit","hair","half","hammer","hamster","hand","happy","harbor","hard","harsh","harvest","hat","have","hawk","hazard","head","health","heart","heavy","hedgehog","height","hello","helmet","help","hen","hero","hidden","high","hill","hint","hip","hire","history","hobby","hockey","hold","hole","holiday","hollow","home","honey","hood","hope","horn","horror","horse","hospital","host","hotel","hour","hover","hub","huge","human","humble","humor","hundred","hungry","hunt","hurdle","hurry","hurt","husband","hybrid","ice","icon","idea","identify","idle","ignore","ill","illegal","illness","image","imitate","immense","immune","impact","impose","improve","impulse","inch","include","income","increase","index","indicate","indoor","industry","infant","inflict","inform","inhale","inherit","initial","inject","injury","inmate","inner","innocent","input","inquiry","insane","insect","inside","inspire","install","intact","interest","into","invest","invite","involve","iron","island","isolate","issue","item","ivory","jacket","jaguar","jar","jazz","jealous","jeans","jelly","jewel","job","join","joke","journey","joy","judge","juice","jump","jungle","junior","junk","just","kangaroo","keen","keep","ketchup","key","kick","kid","kidney","kind","kingdom","kiss","kit","kitchen","kite","kitten","kiwi","knee","knife","knock","know","lab","label","labor","ladder","lady","lake","lamp","language","laptop","large","later","latin","laugh","laundry","lava","law","lawn","lawsuit","layer","lazy","leader","leaf","learn","leave","lecture","left","leg","legal","legend","leisure","lemon","lend","length","lens","leopard","lesson","letter","level","liar","liberty","library","license","life","lift","light","like","limb","limit","link","lion","liquid","list","little","live","lizard","load","loan","lobster","local","lock","logic","lonely","long","loop","lottery","loud","lounge","love","loyal","lucky","luggage","lumber","lunar","lunch","luxury","lyrics","machine","mad","magic","magnet","maid","mail","main","major","make","mammal","man","manage","mandate","mango","mansion","manual","maple","marble","march","margin","marine","market","marriage","mask","mass","master","match","material","math","matrix","matter","maximum","maze","meadow","mean","measure","meat","mechanic","medal","media","melody","melt","member","memory","mention","menu","mercy","merge","merit","merry","mesh","message","metal","method","middle","midnight","milk","million","mimic","mind","minimum","minor","minute","miracle","mirror","misery","miss","mistake","mix","mixed","mixture","mobile","model","modify","mom","moment","monitor","monkey","monster","month","moon","moral","more","morning","mosquito","mother","motion","motor","mountain","mouse","move","movie","much","muffin","mule","multiply","muscle","museum","mushroom","music","must","mutual","myself","mystery","myth","naive","name","napkin","narrow","nasty","nation","nature","near","neck","need","negative","neglect","neither","nephew","nerve","nest","net","network","neutral","never","news","next","nice","night","noble","noise","nominee","noodle","normal","north","nose","notable","note","nothing","notice","novel","now","nuclear","number","nurse","nut","oak","obey","object","oblige","obscure","observe","obtain","obvious","occur","ocean","october","odor","off","offer","office","often","oil","okay","old","olive","olympic","omit","once","one","onion","online","only","open","opera","opinion","oppose","option","orange","orbit","orchard","order","ordinary","organ","orient","original","orphan","ostrich","other","outdoor","outer","output","outside","oval","oven","over","own","owner","oxygen","oyster","ozone","pact","paddle","page","pair","palace","palm","panda","panel","panic","panther","paper","parade","parent","park","parrot","party","pass","patch","path","patient","patrol","pattern","pause","pave","payment","peace","peanut","pear","peasant","pelican","pen","penalty","pencil","people","pepper","perfect","permit","person","pet","phone","photo","phrase","physical","piano","picnic","picture","piece","pig","pigeon","pill","pilot","pink","pioneer","pipe","pistol","pitch","pizza","place","planet","plastic","plate","play","please","pledge","pluck","plug","plunge","poem","poet","point","polar","pole","police","pond","pony","pool","popular","portion","position","possible","post","potato","pottery","poverty","powder","power","practice","praise","predict","prefer","prepare","present","pretty","prevent","price","pride","primary","print","priority","prison","private","prize","problem","process","produce","profit","program","project","promote","proof","property","prosper","protect","proud","provide","public","pudding","pull","pulp","pulse","pumpkin","punch","pupil","puppy","purchase","purity","purpose","purse","push","put","puzzle","pyramid","quality","quantum","quarter","question","quick","quit","quiz","quote","rabbit","raccoon","race","rack","radar","radio","rail","rain","raise","rally","ramp","ranch","random","range","rapid","rare","rate","rather","raven","raw","razor","ready","real","reason","rebel","rebuild","recall","receive","recipe","record","recycle","reduce","reflect","reform","refuse","region","regret","regular","reject","relax","release","relief","rely","remain","remember","remind","remove","render","renew","rent","reopen","repair","repeat","replace","report","require","rescue","resemble","resist","resource","response","result","retire","retreat","return","reunion","reveal","review","reward","rhythm","rib","ribbon","rice","rich","ride","ridge","rifle","right","rigid","ring","riot","ripple","risk","ritual","rival","river","road","roast","robot","robust","rocket","romance","roof","rookie","room","rose","rotate","rough","round","route","royal","rubber","rude","rug","rule","run","runway","rural","sad","saddle","sadness","safe","sail","salad","salmon","salon","salt","salute","same","sample","sand","satisfy","satoshi","sauce","sausage","save","say","scale","scan","scare","scatter","scene","scheme","school","science","scissors","scorpion","scout","scrap","screen","script","scrub","sea","search","season","seat","second","secret","section","security","seed","seek","segment","select","sell","seminar","senior","sense","sentence","series","service","session","settle","setup","seven","shadow","shaft","shallow","share","shed","shell","sheriff","shield","shift","shine","ship","shiver","shock","shoe","shoot","shop","short","shoulder","shove","shrimp","shrug","shuffle","shy","sibling","sick","side","siege","sight","sign","silent","silk","silly","silver","similar","simple","since","sing","siren","sister","situate","six","size","skate","sketch","ski","skill","skin","skirt","skull","slab","slam","sleep","slender","slice","slide","slight","slim","slogan","slot","slow","slush","small","smart","smile","smoke","smooth","snack","snake","snap","sniff","snow","soap","soccer","social","sock","soda","soft","solar","soldier","solid","solution","solve","someone","song","soon","sorry","sort","soul","sound","soup","source","south","space","spare","spatial","spawn","speak","special","speed","spell","spend","sphere","spice","spider","spike","spin","spirit","split","spoil","sponsor","spoon","sport","spot","spray","spread","spring","spy","square","squeeze","squirrel","stable","stadium","staff","stage","stairs","stamp","stand","start","state","stay","steak","steel","stem","step","stereo","stick","still","sting","stock","stomach","stone","stool","story","stove","strategy","street","strike","strong","struggle","student","stuff","stumble","style","subject","submit","subway","success","such","sudden","suffer","sugar","suggest","suit","summer","sun","sunny","sunset","super","supply","supreme","sure","surface","surge","surprise","surround","survey","suspect","sustain","swallow","swamp","swap","swarm","swear","sweet","swift","swim","swing","switch","sword","symbol","symptom","syrup","system","table","tackle","tag","tail","talent","talk","tank","tape","target","task","taste","tattoo","taxi","teach","team","tell","ten","tenant","tennis","tent","term","test","text","thank","that","theme","then","theory","there","they","thing","this","thought","three","thrive","throw","thumb","thunder","ticket","tide","tiger","tilt","timber","time","tiny","tip","tired","tissue","title","toast","tobacco","today","toddler","toe","together","toilet","token","tomato","tomorrow","tone","tongue","tonight","tool","tooth","top","topic","topple","torch","tornado","tortoise","toss","total","tourist","toward","tower","town","toy","track","trade","traffic","tragic","train","transfer","trap","trash","travel","tray","treat","tree","trend","trial","tribe","trick","trigger","trim","trip","trophy","trouble","truck","true","truly","trumpet","trust","truth","try","tube","tuition","tumble","tuna","tunnel","turkey","turn","turtle","twelve","twenty","twice","twin","twist","two","type","typical","ugly","umbrella","unable","unaware","uncle","uncover","under","undo","unfair","unfold","unhappy","uniform","unique","unit","universe","unknown","unlock","until","unusual","unveil","update","upgrade","uphold","upon","upper","upset","urban","urge","usage","use","used","useful","useless","usual","utility","vacant","vacuum","vague","valid","valley","valve","van","vanish","vapor","various","vast","vault","vehicle","velvet","vendor","venture","venue","verb","verify","version","very","vessel","veteran","viable","vibrant","vicious","victory","video","view","village","vintage","violin","virtual","virus","visa","visit","visual","vital","vivid","vocal","voice","void","volcano","volume","vote","voyage","wage","wagon","wait","walk","wall","walnut","want","warfare","warm","warrior","wash","wasp","waste","water","wave","way","wealth","weapon","wear","weasel","weather","web","wedding","weekend","weird","welcome","west","wet","whale","what","wheat","wheel","when","where","whip","whisper","wide","width","wife","wild","will","win","window","wine","wing","wink","winner","winter","wire","wisdom","wise","wish","witness","wolf","woman","wonder","wood","wool","word","work","world","worry","worth","wrap","wreck","wrestle","wrist","write","wrong","yard","year","yellow","you","young","youth","zebra","zero","zone","zoo"]')},(e,t,r)=>{e.exports=r(236)},(e,t,r)=>{"use strict";t.utils=r(239),t.Cipher=r(62),t.DES=r(121),t.CBC=r(313),t.EDE=r(240)},(e,t,r)=>{"use strict";var n=r(6),i=r(0),o={};function a(e){n.equal(e.length,8,"Invalid IV length"),this.iv=new Array(8);for(var t=0;t{var n=r(63),i=r(124),o=r(1).Buffer,a=r(125),s=r(14),f=r(64),u=r(39);function c(e,t,r){s.call(this),this._cache=new l,this._cipher=new f.AES(t),this._prev=o.from(r),this._mode=e,this._autopadding=!0}r(0)(c,s),c.prototype._update=function(e){var t,r;this._cache.add(e);for(var n=[];t=this._cache.get();)r=this._mode.encrypt(this,t),n.push(r);return o.concat(n)};var h=o.alloc(16,16);function l(){this.cache=o.allocUnsafe(0)}function d(e,t,r){var s=n[e.toLowerCase()];if(!s)throw new TypeError("invalid suite type");if("string"==typeof t&&(t=o.from(t)),t.length!==s.key/8)throw new TypeError("invalid key length "+t.length);if("string"==typeof r&&(r=o.from(r)),"GCM"!==s.mode&&r.length!==s.iv)throw new TypeError("invalid iv length "+r.length);return"stream"===s.type?new a(s.module,t,r):"auth"===s.type?new i(s.module,t,r):new c(s.module,t,r)}c.prototype._final=function(){var e=this._cache.flush();if(this._autopadding)return e=this._mode.encrypt(this,e),this._cipher.scrub(),e;if(!e.equals(h))throw this._cipher.scrub(),new Error("data not multiple of block length")},c.prototype.setAutoPadding=function(e){return this._autopadding=!!e,this},l.prototype.add=function(e){this.cache=o.concat([this.cache,e])},l.prototype.get=function(){if(this.cache.length>15){var e=this.cache.slice(0,16);return this.cache=this.cache.slice(16),e}return null},l.prototype.flush=function(){for(var e=16-this.cache.length,t=o.allocUnsafe(e),r=-1;++r{t.encrypt=function(e,t){return e._cipher.encryptBlock(t)},t.decrypt=function(e,t){return e._cipher.decryptBlock(t)}},(e,t,r)=>{var n=r(23);t.encrypt=function(e,t){var r=n(t,e._prev);return e._prev=e._cipher.encryptBlock(r),e._prev},t.decrypt=function(e,t){var r=e._prev;e._prev=t;var i=e._cipher.decryptBlock(t);return n(i,r)}},(e,t,r)=>{var n=r(1).Buffer,i=r(23);function o(e,t,r){var o=t.length,a=i(t,e._cache);return e._cache=e._cache.slice(o),e._prev=n.concat([e._prev,r?t:a]),a}t.encrypt=function(e,t,r){for(var i,a=n.allocUnsafe(0);t.length;){if(0===e._cache.length&&(e._cache=e._cipher.encryptBlock(e._prev),e._prev=n.allocUnsafe(0)),!(e._cache.length<=t.length)){a=n.concat([a,o(e,t,r)]);break}i=e._cache.length,a=n.concat([a,o(e,t.slice(0,i),r)]),t=t.slice(i)}return a}},(e,t,r)=>{var n=r(1).Buffer;function i(e,t,r){var i=e._cipher.encryptBlock(e._prev)[0]^t;return e._prev=n.concat([e._prev.slice(1),n.from([r?t:i])]),i}t.encrypt=function(e,t,r){for(var o=t.length,a=n.allocUnsafe(o),s=-1;++s{var n=r(1).Buffer;function i(e,t,r){for(var n,i,a=-1,s=0;++a<8;)n=t&1<<7-a?128:0,s+=(128&(i=e._cipher.encryptBlock(e._prev)[0]^n))>>a%8,e._prev=o(e._prev,r?n:i);return s}function o(e,t){var r=e.length,i=-1,o=n.allocUnsafe(e.length);for(e=n.concat([e,n.from([t])]);++i>7;return o}t.encrypt=function(e,t,r){for(var o=t.length,a=n.allocUnsafe(o),s=-1;++s{var n=r(23);function i(e){return e._prev=e._cipher.encryptBlock(e._prev),e._prev}t.encrypt=function(e,t){for(;e._cache.length{var n=r(124),i=r(1).Buffer,o=r(63),a=r(125),s=r(14),f=r(64),u=r(39);function c(e,t,r){s.call(this),this._cache=new h,this._last=void 0,this._cipher=new f.AES(t),this._prev=i.from(r),this._mode=e,this._autopadding=!0}function h(){this.cache=i.allocUnsafe(0)}function l(e,t,r){var s=o[e.toLowerCase()];if(!s)throw new TypeError("invalid suite type");if("string"==typeof r&&(r=i.from(r)),"GCM"!==s.mode&&r.length!==s.iv)throw new TypeError("invalid iv length "+r.length);if("string"==typeof t&&(t=i.from(t)),t.length!==s.key/8)throw new TypeError("invalid key length "+t.length);return"stream"===s.type?new a(s.module,t,r,!0):"auth"===s.type?new n(s.module,t,r,!0):new c(s.module,t,r)}r(0)(c,s),c.prototype._update=function(e){var t,r;this._cache.add(e);for(var n=[];t=this._cache.get(this._autopadding);)r=this._mode.decrypt(this,t),n.push(r);return i.concat(n)},c.prototype._final=function(){var e=this._cache.flush();if(this._autopadding)return function(e){var t=e[15];if(t<1||t>16)throw new Error("unable to decrypt data");for(var r=-1;++r16)return t=this.cache.slice(0,16),this.cache=this.cache.slice(16),t}else if(this.cache.length>=16)return t=this.cache.slice(0,16),this.cache=this.cache.slice(16),t;return null},h.prototype.flush=function(){if(this.cache.length)return this.cache},t.createDecipher=function(e,t){var r=o[e.toLowerCase()];if(!r)throw new TypeError("invalid suite type");var n=u(t,!1,r.key,r.iv);return l(e,n.key,n.iv)},t.createDecipheriv=l},(e,t)=>{t["des-ecb"]={key:8,iv:0},t["des-cbc"]=t.des={key:8,iv:8},t["des-ede3-cbc"]=t.des3={key:24,iv:8},t["des-ede3"]={key:24,iv:0},t["des-ede-cbc"]={key:16,iv:8},t["des-ede"]={key:16,iv:0}},(e,t,r)=>{var n=r(126),i=r(324),o=r(243),a={binary:!0,hex:!0,base64:!0};t.DiffieHellmanGroup=t.createDiffieHellmanGroup=t.getDiffieHellman=function(e){var t=new Buffer(i[e].prime,"hex"),r=new Buffer(i[e].gen,"hex");return new o(t,r)},t.createDiffieHellman=t.DiffieHellman=function e(t,r,i,s){return Buffer.isBuffer(r)||void 0===a[r]?e(t,"binary",r,i):(r=r||"binary",s=s||"binary",i=i||new Buffer([2]),Buffer.isBuffer(i)||(i=new Buffer(i,s)),"number"==typeof t?new o(n(t,i),i,!0):(Buffer.isBuffer(t)||(t=new Buffer(t,r)),new o(t,i,!0)))}},e=>{"use strict";e.exports=JSON.parse('{"modp1":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff"},"modp2":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff"},"modp5":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff"},"modp14":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff"},"modp15":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff"},"modp16":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff"},"modp17":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff"},"modp18":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff"}}')},()=>{},()=>{},()=>{},()=>{},(e,t,r)=>{"use strict";var n=r(133);t.certificate=r(257);var i=n.define("RSAPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("modulus").int(),this.key("publicExponent").int(),this.key("privateExponent").int(),this.key("prime1").int(),this.key("prime2").int(),this.key("exponent1").int(),this.key("exponent2").int(),this.key("coefficient").int())}));t.RSAPrivateKey=i;var o=n.define("RSAPublicKey",(function(){this.seq().obj(this.key("modulus").int(),this.key("publicExponent").int())}));t.RSAPublicKey=o;var a=n.define("SubjectPublicKeyInfo",(function(){this.seq().obj(this.key("algorithm").use(s),this.key("subjectPublicKey").bitstr())}));t.PublicKey=a;var s=n.define("AlgorithmIdentifier",(function(){this.seq().obj(this.key("algorithm").objid(),this.key("none").null_().optional(),this.key("curve").objid().optional(),this.key("params").seq().obj(this.key("p").int(),this.key("q").int(),this.key("g").int()).optional())})),f=n.define("PrivateKeyInfo",(function(){this.seq().obj(this.key("version").int(),this.key("algorithm").use(s),this.key("subjectPrivateKey").octstr())}));t.PrivateKey=f;var u=n.define("EncryptedPrivateKeyInfo",(function(){this.seq().obj(this.key("algorithm").seq().obj(this.key("id").objid(),this.key("decrypt").seq().obj(this.key("kde").seq().obj(this.key("id").objid(),this.key("kdeparams").seq().obj(this.key("salt").octstr(),this.key("iters").int())),this.key("cipher").seq().obj(this.key("algo").objid(),this.key("iv").octstr()))),this.key("subjectPrivateKey").octstr())}));t.EncryptedPrivateKey=u;var c=n.define("DSAPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("p").int(),this.key("q").int(),this.key("g").int(),this.key("pub_key").int(),this.key("priv_key").int())}));t.DSAPrivateKey=c,t.DSAparam=n.define("DSAparam",(function(){this.int()}));var h=n.define("ECPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("privateKey").octstr(),this.key("parameters").optional().explicit(0).use(l),this.key("publicKey").optional().explicit(1).bitstr())}));t.ECPrivateKey=h;var l=n.define("ECParameters",(function(){this.choice({namedCurve:this.objid()})}));t.signature=n.define("signature",(function(){this.seq().obj(this.key("r").int(),this.key("s").int())}))},e=>{"use strict";e.exports=JSON.parse('{"2.16.840.1.101.3.4.1.1":"aes-128-ecb","2.16.840.1.101.3.4.1.2":"aes-128-cbc","2.16.840.1.101.3.4.1.3":"aes-128-ofb","2.16.840.1.101.3.4.1.4":"aes-128-cfb","2.16.840.1.101.3.4.1.21":"aes-192-ecb","2.16.840.1.101.3.4.1.22":"aes-192-cbc","2.16.840.1.101.3.4.1.23":"aes-192-ofb","2.16.840.1.101.3.4.1.24":"aes-192-cfb","2.16.840.1.101.3.4.1.41":"aes-256-ecb","2.16.840.1.101.3.4.1.42":"aes-256-cbc","2.16.840.1.101.3.4.1.43":"aes-256-ofb","2.16.840.1.101.3.4.1.44":"aes-256-cfb"}')},(e,t,r)=>{"use strict";function n(){throw new Error("secure random number generation not supported by this browser\nuse chrome, FireFox or Internet Explorer 11")}var i=r(1),o=r(12),a=i.Buffer,s=i.kMaxLength,f=r.g.crypto||r.g.msCrypto,u=Math.pow(2,32)-1;function c(e,t){if("number"!=typeof e||e!=e)throw new TypeError("offset must be a number");if(e>u||e<0)throw new TypeError("offset must be a uint32");if(e>s||e>t)throw new RangeError("offset out of range")}function h(e,t,r){if("number"!=typeof e||e!=e)throw new TypeError("size must be a number");if(e>u||e<0)throw new TypeError("size must be a uint32");if(e+t>r||e>s)throw new RangeError("buffer too small")}function l(e,t,r,n){if(process.browser){var i=e.buffer,a=new Uint8Array(i,t,r);return f.getRandomValues(a),n?void process.nextTick((function(){n(null,e)})):e}if(!n)return o(r).copy(e,t),e;o(r,(function(r,i){if(r)return n(r);i.copy(e,t),n(null,e)}))}f&&f.getRandomValues||!process.browser?(t.randomFill=function(e,t,n,i){if(!(a.isBuffer(e)||e instanceof r.g.Uint8Array))throw new TypeError('"buf" argument must be a Buffer or Uint8Array');if("function"==typeof t)i=t,t=0,n=e.length;else if("function"==typeof n)i=n,n=e.length-t;else if("function"!=typeof i)throw new TypeError('"cb" argument must be a function');return c(t,e.length),h(n,t,e.length),l(e,t,n,i)},t.randomFillSync=function(e,t,n){if(void 0===t&&(t=0),!(a.isBuffer(e)||e instanceof r.g.Uint8Array))throw new TypeError('"buf" argument must be a Buffer or Uint8Array');return c(t,e.length),void 0===n&&(n=e.length-t),h(n,t,e.length),l(e,t,n)}):(t.randomFill=n,t.randomFillSync=n)},(e,t)=>{"use strict";var r=Object.prototype.toString;t.isArray=function(e,t){if(!Array.isArray(e))throw TypeError(t)},t.isBoolean=function(e,t){if("[object Boolean]"!==r.call(e))throw TypeError(t)},t.isBuffer=function(e,t){if(!Buffer.isBuffer(e))throw TypeError(t)},t.isFunction=function(e,t){if("[object Function]"!==r.call(e))throw TypeError(t)},t.isNumber=function(e,t){if("[object Number]"!==r.call(e))throw TypeError(t)},t.isObject=function(e,t){if("[object Object]"!==r.call(e))throw TypeError(t)},t.isBufferLength=function(e,t,r){if(e.length!==t)throw RangeError(r)},t.isBufferLength2=function(e,t,r,n){if(e.length!==t&&e.length!==r)throw RangeError(n)},t.isLengthGTZero=function(e,t){if(0===e.length)throw RangeError(t)},t.isNumberInInterval=function(e,t,r,n){if(e<=t||e>=r)throw RangeError(n)}},(e,t,r)=>{"use strict";var n=r(1).Buffer,i=r(270),o=n.from([48,129,211,2,1,1,4,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,160,129,133,48,129,130,2,1,1,48,44,6,7,42,134,72,206,61,1,1,2,33,0,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,254,255,255,252,47,48,6,4,1,0,4,1,7,4,33,2,121,190,102,126,249,220,187,172,85,160,98,149,206,135,11,7,2,155,252,219,45,206,40,217,89,242,129,91,22,248,23,152,2,33,0,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,254,186,174,220,230,175,72,160,59,191,210,94,140,208,54,65,65,2,1,1,161,36,3,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]),a=n.from([48,130,1,19,2,1,1,4,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,160,129,165,48,129,162,2,1,1,48,44,6,7,42,134,72,206,61,1,1,2,33,0,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,254,255,255,252,47,48,6,4,1,0,4,1,7,4,65,4,121,190,102,126,249,220,187,172,85,160,98,149,206,135,11,7,2,155,252,219,45,206,40,217,89,242,129,91,22,248,23,152,72,58,218,119,38,163,196,101,93,164,251,252,14,17,8,168,253,23,180,72,166,133,84,25,156,71,208,143,251,16,212,184,2,33,0,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,254,186,174,220,230,175,72,160,59,191,210,94,140,208,54,65,65,2,1,1,161,68,3,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]);t.privateKeyExport=function(e,t,r){var i=n.from(r?o:a);return e.copy(i,r?8:9),t.copy(i,r?181:214),i},t.privateKeyImport=function(e){var t=e.length,r=0;if(!(t2||t1?e[r+n-2]<<8:0);if(!(t<(r+=n)+i||t32||t1&&0===t[o]&&!(128&t[o+1]);--r,++o);for(var a=n.concat([n.from([0]),e.s]),s=33,f=0;s>1&&0===a[f]&&!(128&a[f+1]);--s,++f);return i.encode(t.slice(o),a.slice(f))},t.signatureImport=function(e){var t=n.alloc(32,0),r=n.alloc(32,0);try{var o=i.decode(e);if(33===o.r.length&&0===o.r[0]&&(o.r=o.r.slice(1)),o.r.length>32)throw new Error("R length is too long");if(33===o.s.length&&0===o.s[0]&&(o.s=o.s.slice(1)),o.s.length>32)throw new Error("S length is too long")}catch(e){return}return o.r.copy(t,32-o.r.length),o.s.copy(r,32-o.s.length),{r:t,s:r}},t.signatureImportLax=function(e){var t=n.alloc(32,0),r=n.alloc(32,0),i=e.length,o=0;if(48===e[o++]){var a=e[o++];if(!(128&a&&(o+=a-128)>i)&&2===e[o++]){var s=e[o++];if(128&s){if(o+(a=s-128)>i)return;for(;a>0&&0===e[o];o+=1,a-=1);for(s=0;a>0;o+=1,a-=1)s=(s<<8)+e[o]}if(!(s>i-o)){var f=o;if(o+=s,2===e[o++]){var u=e[o++];if(128&u){if(o+(a=u-128)>i)return;for(;a>0&&0===e[o];o+=1,a-=1);for(u=0;a>0;o+=1,a-=1)u=(u<<8)+e[o]}if(!(u>i-o)){var c=o;for(o+=u;s>0&&0===e[f];s-=1,f+=1);if(!(s>32)){var h=e.slice(f,f+s);for(h.copy(t,32-h.length);u>0&&0===e[c];u-=1,c+=1);if(!(u>32)){var l=e.slice(c,c+u);return l.copy(r,32-l.length),{r:t,s:r}}}}}}}}}},()=>{},()=>{},()=>{},(e,t)=>{const r=[1,0,32898,0,32906,2147483648,2147516416,2147483648,32907,0,2147483649,0,2147516545,2147483648,32777,2147483648,138,0,136,0,2147516425,0,2147483658,0,2147516555,0,139,2147483648,32905,2147483648,32771,2147483648,32770,2147483648,128,2147483648,32778,0,2147483658,2147483648,2147516545,2147483648,32896,2147483648,2147483649,0,2147516424,2147483648];t.p1600=function(e){for(let t=0;t<24;++t){const n=e[0]^e[10]^e[20]^e[30]^e[40],i=e[1]^e[11]^e[21]^e[31]^e[41],o=e[2]^e[12]^e[22]^e[32]^e[42],a=e[3]^e[13]^e[23]^e[33]^e[43],s=e[4]^e[14]^e[24]^e[34]^e[44],f=e[5]^e[15]^e[25]^e[35]^e[45],u=e[6]^e[16]^e[26]^e[36]^e[46],c=e[7]^e[17]^e[27]^e[37]^e[47],h=e[8]^e[18]^e[28]^e[38]^e[48],l=e[9]^e[19]^e[29]^e[39]^e[49];let d=h^(o<<1|a>>>31),p=l^(a<<1|o>>>31);const b=e[0]^d,y=e[1]^p,m=e[10]^d,g=e[11]^p,_=e[20]^d,v=e[21]^p,w=e[30]^d,E=e[31]^p,S=e[40]^d,M=e[41]^p;d=n^(s<<1|f>>>31),p=i^(f<<1|s>>>31);const A=e[2]^d,k=e[3]^p,R=e[12]^d,O=e[13]^p,T=e[22]^d,I=e[23]^p,x=e[32]^d,B=e[33]^p,j=e[42]^d,L=e[43]^p;d=o^(u<<1|c>>>31),p=a^(c<<1|u>>>31);const P=e[4]^d,N=e[5]^p,D=e[14]^d,C=e[15]^p,U=e[24]^d,q=e[25]^p,F=e[34]^d,G=e[35]^p,z=e[44]^d,$=e[45]^p;d=s^(h<<1|l>>>31),p=f^(l<<1|h>>>31);const W=e[6]^d,H=e[7]^p,K=e[16]^d,V=e[17]^p,Y=e[26]^d,X=e[27]^p,J=e[36]^d,Z=e[37]^p,Q=e[46]^d,ee=e[47]^p;d=u^(n<<1|i>>>31),p=c^(i<<1|n>>>31);const te=e[8]^d,re=e[9]^p,ne=e[18]^d,ie=e[19]^p,oe=e[28]^d,ae=e[29]^p,se=e[38]^d,fe=e[39]^p,ue=e[48]^d,ce=e[49]^p,he=b,le=y,de=g<<4|m>>>28,pe=m<<4|g>>>28,be=_<<3|v>>>29,ye=v<<3|_>>>29,me=E<<9|w>>>23,ge=w<<9|E>>>23,_e=S<<18|M>>>14,ve=M<<18|S>>>14,we=A<<1|k>>>31,Ee=k<<1|A>>>31,Se=O<<12|R>>>20,Me=R<<12|O>>>20,Ae=T<<10|I>>>22,ke=I<<10|T>>>22,Re=B<<13|x>>>19,Oe=x<<13|B>>>19,Te=j<<2|L>>>30,Ie=L<<2|j>>>30,xe=N<<30|P>>>2,Be=P<<30|N>>>2,je=D<<6|C>>>26,Le=C<<6|D>>>26,Pe=q<<11|U>>>21,Ne=U<<11|q>>>21,De=F<<15|G>>>17,Ce=G<<15|F>>>17,Ue=$<<29|z>>>3,qe=z<<29|$>>>3,Fe=W<<28|H>>>4,Ge=H<<28|W>>>4,ze=V<<23|K>>>9,$e=K<<23|V>>>9,We=Y<<25|X>>>7,He=X<<25|Y>>>7,Ke=J<<21|Z>>>11,Ve=Z<<21|J>>>11,Ye=ee<<24|Q>>>8,Xe=Q<<24|ee>>>8,Je=te<<27|re>>>5,Ze=re<<27|te>>>5,Qe=ne<<20|ie>>>12,et=ie<<20|ne>>>12,tt=ae<<7|oe>>>25,rt=oe<<7|ae>>>25,nt=se<<8|fe>>>24,it=fe<<8|se>>>24,ot=ue<<14|ce>>>18,at=ce<<14|ue>>>18;e[0]=he^~Se&Pe,e[1]=le^~Me&Ne,e[10]=Fe^~Qe&be,e[11]=Ge^~et&ye,e[20]=we^~je&We,e[21]=Ee^~Le&He,e[30]=Je^~de&Ae,e[31]=Ze^~pe&ke,e[40]=xe^~ze&tt,e[41]=Be^~$e&rt,e[2]=Se^~Pe&Ke,e[3]=Me^~Ne&Ve,e[12]=Qe^~be&Re,e[13]=et^~ye&Oe,e[22]=je^~We&nt,e[23]=Le^~He&it,e[32]=de^~Ae&De,e[33]=pe^~ke&Ce,e[42]=ze^~tt&me,e[43]=$e^~rt&ge,e[4]=Pe^~Ke&ot,e[5]=Ne^~Ve&at,e[14]=be^~Re&Ue,e[15]=ye^~Oe&qe,e[24]=We^~nt&_e,e[25]=He^~it&ve,e[34]=Ae^~De&Ye,e[35]=ke^~Ce&Xe,e[44]=tt^~me&Te,e[45]=rt^~ge&Ie,e[6]=Ke^~ot&he,e[7]=Ve^~at&le,e[16]=Re^~Ue&Fe,e[17]=Oe^~qe&Ge,e[26]=nt^~_e&we,e[27]=it^~ve&Ee,e[36]=De^~Ye&Je,e[37]=Ce^~Xe&Ze,e[46]=me^~Te&xe,e[47]=ge^~Ie&Be,e[8]=ot^~he&Se,e[9]=at^~le&Me,e[18]=Ue^~Fe&Qe,e[19]=qe^~Ge&et,e[28]=_e^~we&je,e[29]=ve^~Ee&Le,e[38]=Ye^~Je&de,e[39]=Xe^~Ze&pe,e[48]=Te^~xe&ze,e[49]=Ie^~Be&$e,e[0]^=r[2*t],e[1]^=r[2*t+1]}}}],__webpack_module_cache__={};function __webpack_require__(e){var t=__webpack_module_cache__[e];if(void 0!==t)return t.exports;var r=__webpack_module_cache__[e]={id:e,loaded:!1,exports:{}};return __webpack_modules__[e].call(r.exports,r,r.exports,__webpack_require__),r.loaded=!0,r.exports}__webpack_require__.n=e=>{var t=e&&e.__esModule?()=>e.default:()=>e;return __webpack_require__.d(t,{a:t}),t},__webpack_require__.d=(e,t)=>{for(var r in t)__webpack_require__.o(t,r)&&!__webpack_require__.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},__webpack_require__.g=function(){if("object"==typeof globalThis)return globalThis;try{return this||new Function("return this")()}catch(e){if("object"==typeof window)return window}}(),__webpack_require__.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),__webpack_require__.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},__webpack_require__.nmd=e=>(e.paths=[],e.children||(e.children=[]),e);var __webpack_exports__={};return(()=>{"use strict";__webpack_require__.d(__webpack_exports__,{default:()=>Qo});var e={};__webpack_require__.r(e),__webpack_require__.d(e,{INPUT_TRANSFORMERS:()=>Ne,OUTPUT_TRANSFORMERS:()=>Ce,__GetDependency__:()=>He,__ResetDependency__:()=>Ve,__RewireAPI__:()=>We,__Rewire__:()=>Ke,__get__:()=>He,__set__:()=>Ke,default:()=>Xe,encodeAddress:()=>De,transform:()=>je,transformArrayToMap:()=>Pe,transformMapToArray:()=>Le});var t={};__webpack_require__.r(t),__webpack_require__.d(t,{__GetDependency__:()=>Tt,__ResetDependency__:()=>xt,__RewireAPI__:()=>Ot,__Rewire__:()=>It,__get__:()=>Tt,__set__:()=>It,arrayToHex:()=>et,base58:()=>Je,chainIdConvertor:()=>Ze,decodeAddressRep:()=>nt,default:()=>jt,deserializeTransaction:()=>vt,encodeAddressRep:()=>it,fromWei:()=>dt,getAuthorization:()=>wt,getValueOfUnit:()=>lt,isBigNumber:()=>ot,isBoolean:()=>ut,isFunction:()=>st,isJson:()=>ct,isObject:()=>ft,isString:()=>at,noop:()=>mt,padLeft:()=>tt,padRight:()=>rt,setPath:()=>gt,toBigNumber:()=>ht,toTwosComplement:()=>bt,toWei:()=>pt,uint8ArrayToHex:()=>yt,unpackSpecifiedTypeData:()=>_t});var r={};__webpack_require__.r(r),__webpack_require__.d(r,{Address:()=>Dt,Hash:()=>Nt,ResourceTokenCharged:()=>Ut,Transaction:()=>Pt,TransactionFeeCharged:()=>Ct,__GetDependency__:()=>ar,__ResetDependency__:()=>fr,__RewireAPI__:()=>or,__Rewire__:()=>sr,__get__:()=>ar,__set__:()=>sr,arrayBufferToHex:()=>$t,coreRootProto:()=>Lt,default:()=>hr,encodeTransaction:()=>Jt,getAddressFromRep:()=>Ht,getAddressObjectFromRep:()=>Kt,getFee:()=>qt,getHashFromHex:()=>Yt,getHashObjectFromHex:()=>Xt,getRepForAddress:()=>Wt,getRepForHash:()=>Vt,getResourceFee:()=>Gt,getSerializedDataFromLog:()=>Ft,getTransaction:()=>Zt,getTransactionFee:()=>zt});var n={};__webpack_require__.r(n),__webpack_require__.d(n,{__GetDependency__:()=>Ar,__ResetDependency__:()=>Rr,__RewireAPI__:()=>Mr,__Rewire__:()=>kr,__get__:()=>Ar,__set__:()=>kr,default:()=>Tr,isAddressInBloom:()=>mr,isEventInBloom:()=>br,isInBloom:()=>pr,isIndexedInBloom:()=>yr});var i={};__webpack_require__.r(i),__webpack_require__.d(i,{__GetDependency__:()=>nn,__ResetDependency__:()=>an,__RewireAPI__:()=>rn,__Rewire__:()=>on,__get__:()=>nn,__set__:()=>on,computeRoot:()=>Kr,default:()=>fn,getMerklePath:()=>Vr,node:()=>Yr});var o={};__webpack_require__.r(o),__webpack_require__.d(o,{__GetDependency__:()=>Yn,__ResetDependency__:()=>Jn,__RewireAPI__:()=>Vn,__Rewire__:()=>Xn,__get__:()=>Yn,__set__:()=>Xn,checkPassword:()=>Fn,default:()=>Qn,getKeystore:()=>Un,unlockKeystore:()=>qn});var a=__webpack_require__(291);Object.create,Object.create,"function"==typeof SuppressedError&&SuppressedError;var s=64,f=new Uint32Array([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]),u=[1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225],c=Math.pow(2,53)-1,h=function(){function e(){this.state=Int32Array.from(u),this.temp=new Int32Array(64),this.buffer=new Uint8Array(64),this.bufferLength=0,this.bytesHashed=0,this.finished=!1}return e.prototype.update=function(e){if(this.finished)throw new Error("Attempted to update an already finished hash.");var t=0,r=e.byteLength;if(this.bytesHashed+=r,8*this.bytesHashed>c)throw new Error("Cannot hash more than 2^53 - 1 bits");for(;r>0;)this.buffer[this.bufferLength++]=e[t++],r--,this.bufferLength===s&&(this.hashBuffer(),this.bufferLength=0)},e.prototype.digest=function(){if(!this.finished){var e=8*this.bytesHashed,t=new DataView(this.buffer.buffer,this.buffer.byteOffset,this.buffer.byteLength),r=this.bufferLength;if(t.setUint8(this.bufferLength++,128),r%s>=56){for(var n=this.bufferLength;n>>24&255,i[4*n+1]=this.state[n]>>>16&255,i[4*n+2]=this.state[n]>>>8&255,i[4*n+3]=this.state[n]>>>0&255;return i},e.prototype.hashBuffer=function(){for(var e=this.buffer,t=this.state,r=t[0],n=t[1],i=t[2],o=t[3],a=t[4],u=t[5],c=t[6],h=t[7],l=0;l>>17|d<<15)^(d>>>19|d<<13)^d>>>10,b=((d=this.temp[l-15])>>>7|d<<25)^(d>>>18|d<<14)^d>>>3;this.temp[l]=(p+this.temp[l-7]|0)+(b+this.temp[l-16]|0)}var y=(((a>>>6|a<<26)^(a>>>11|a<<21)^(a>>>25|a<<7))+(a&u^~a&c)|0)+(h+(f[l]+this.temp[l]|0)|0)|0,m=((r>>>2|r<<30)^(r>>>13|r<<19)^(r>>>22|r<<10))+(r&n^r&i^n&i)|0;h=c,c=u,u=a,a=o+y|0,o=i,i=n,n=r,r=y+m|0}t[0]+=r,t[1]+=n,t[2]+=i,t[3]+=o,t[4]+=a,t[5]+=u,t[6]+=c,t[7]+=h},e}(),l="undefined"!=typeof Buffer&&Buffer.from?function(e){return Buffer.from(e,"utf8")}:e=>(new TextEncoder).encode(e);function d(e){return e instanceof Uint8Array?e:"string"==typeof e?l(e):ArrayBuffer.isView(e)?new Uint8Array(e.buffer,e.byteOffset,e.byteLength/Uint8Array.BYTES_PER_ELEMENT):new Uint8Array(e)}var p=function(){function e(e){this.secret=e,this.hash=new h,this.reset()}return e.prototype.update=function(e){var t;if(("string"==typeof(t=e)?0!==t.length:0!==t.byteLength)&&!this.error)try{this.hash.update(d(e))}catch(e){this.error=e}},e.prototype.digestSync=function(){if(this.error)throw this.error;return this.outer?(this.outer.finished||this.outer.update(this.hash.digest()),this.outer.digest()):this.hash.digest()},e.prototype.digest=function(){return e=this,t=void 0,n=function(){return function(e,t){var r,n,i,o,a={label:0,sent:function(){if(1&i[0])throw i[1];return i[1]},trys:[],ops:[]};return o={next:s(0),throw:s(1),return:s(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function s(s){return function(f){return function(s){if(r)throw new TypeError("Generator is already executing.");for(;o&&(o=0,s[0]&&(a=0)),a;)try{if(r=1,n&&(i=2&s[0]?n.return:s[0]?n.throw||((i=n.return)&&i.call(n),0):n.next)&&!(i=i.call(n,s[1])).done)return i;switch(n=0,i&&(s=[2&s[0],i.value]),s[0]){case 0:case 1:i=s;break;case 4:return a.label++,{value:s[1],done:!1};case 5:a.label++,n=s[1],s=[0];continue;case 7:s=a.ops.pop(),a.trys.pop();continue;default:if(!((i=(i=a.trys).length>0&&i[i.length-1])||6!==s[0]&&2!==s[0])){a=0;continue}if(3===s[0]&&(!i||s[1]>i[0]&&s[1]s){var r=new h;r.update(t),t=r.digest()}var n=new Uint8Array(s);return n.set(t),n}(this.secret),t=new Uint8Array(s);t.set(e);for(var r=0;r{const t=e,r=new(M("Sha256"));r.update(t);const n=r.digestSync();return Buffer.from(n).toString("hex")},y=M("sha256");function m(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var g=null;function _(){if(null===g){let e=m();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),g=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return g}function v(){let e=m();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function w(){let e=_(),t=v(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=m();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var E="__INTENTIONAL_UNDEFINED__";let S={};function M(e){let t=w();if(void 0===t[e])return function(e){switch(e){case"Sha256":return p;case"sha256":return b}}(e);var r=t[e];return r===E?void 0:r}function A(e,t){let r=w();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){k(e)}))}):(r[e]=void 0===t?E:t,function(){k(e)})}function k(e){let t=w();delete t[e],0==Object.keys(t).length&&delete v()[_]}function R(e){let t=w();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(S,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",M),e("__GetDependency__",M),e("__Rewire__",A),e("__set__",A),e("__reset__",k),e("__ResetDependency__",k),e("__with__",R)}();let O=typeof b;function T(e,t){Object.defineProperty(b,e,{value:t,enumerable:!1,configurable:!0})}"object"!==O&&"function"!==O||!Object.isExtensible(b)||(T("__get__",M),T("__GetDependency__",M),T("__Rewire__",A),T("__set__",A),T("__reset__",k),T("__ResetDependency__",k),T("__with__",R),T("__RewireAPI__",S));const I=JSON.parse('{"nested":{"Transaction":{"fields":{"from":{"type":"Address","id":1},"to":{"type":"Address","id":2},"refBlockNumber":{"type":"int64","id":3},"refBlockPrefix":{"type":"bytes","id":4},"methodName":{"type":"string","id":5},"params":{"type":"bytes","id":6},"signature":{"type":"bytes","id":10000}}},"Address":{"fields":{"value":{"type":"bytes","id":1}}},"Hash":{"fields":{"value":{"type":"bytes","id":1}}},"MerklePath":{"fields":{"merklePathNodes":{"rule":"repeated","type":"MerklePathNode","id":1}}},"MerklePathNode":{"fields":{"hash":{"type":"Hash","id":1},"isLeftChildNode":{"type":"bool","id":2}}},"BinaryMerkleTree":{"fields":{"nodes":{"rule":"repeated","type":"Hash","id":1},"root":{"type":"Hash","id":2},"leafCount":{"type":"int32","id":3}}},"TransactionFeeCharged":{"fields":{"symbol":{"type":"string","id":1},"amount":{"type":"int64","id":2}}},"ResourceTokenCharged":{"fields":{"symbol":{"type":"string","id":1},"amount":{"type":"int64","id":2},"contractAddress":{"type":"Address","id":3}}},"ResourceTokenOwned":{"fields":{"symbol":{"type":"string","id":1},"amount":{"type":"int64","id":2}}},"google":{"nested":{"protobuf":{"nested":{"Timestamp":{"fields":{"seconds":{"type":"int64","id":1},"nanos":{"type":"int32","id":2}}}}}}}}}');var x=/^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,B=Math.ceil,j=Math.floor,L="[BigNumber Error] ",P=L+"Number primitive has more than 15 significant digits: ",N=1e14,D=14,C=9007199254740991,U=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],q=1e7,F=1e9;function G(e){var t=0|e;return e>0||e===t?t:t-1}function z(e){for(var t,r,n=1,i=e.length,o=e[0]+"";nu^r?1:-1;for(s=(f=i.length)<(u=o.length)?f:u,a=0;ao[a]^r?1:-1;return f==u?0:f>u^r?1:-1}function W(e,t,r,n){if(er||e!==j(e))throw Error(L+(n||"Argument")+("number"==typeof e?er?" out of range: ":" not an integer: ":" not a primitive number: ")+String(e))}function H(e){var t=e.c.length-1;return G(e.e/D)==t&&e.c[t]%2!=0}function K(e,t){return(e.length>1?e.charAt(0)+"."+e.slice(1):e)+(t<0?"e":"e+")+t}function V(e,t,r){var n,i;if(t<0){for(i=r+".";++t;i+=r);e=i+e}else if(++t>(n=e.length)){for(i=r,t-=n;--t;i+=r);e+=i}else t_?l.c=l.e=null:e.e=10;f/=10,s++);return void(s>_?l.c=l.e=null:(l.e=s,l.c=[e]))}h=String(e)}else{if(!x.test(h=String(e)))return i(l,h,u);l.s=45==h.charCodeAt(0)?(h=h.slice(1),-1):1}(s=h.indexOf("."))>-1&&(h=h.replace(".","")),(f=h.search(/e/i))>0?(s<0&&(s=f),s+=+h.slice(f+1),h=h.substring(0,f)):s<0&&(s=h.length)}else{if(W(t,2,M.length,"Base"),10==t&&A)return I(l=new k(e),p+l.e+1,b);if(h=String(e),u="number"==typeof e){if(0*e!=0)return i(l,h,u,t);if(l.s=1/e<0?(h=h.slice(1),-1):1,k.DEBUG&&h.replace(/^0\.0*|\./,"").length>15)throw Error(P+e)}else l.s=45===h.charCodeAt(0)?(h=h.slice(1),-1):1;for(r=M.slice(0,t),s=f=0,c=h.length;fs){s=c;continue}}else if(!a&&(h==h.toUpperCase()&&(h=h.toLowerCase())||h==h.toLowerCase()&&(h=h.toUpperCase()))){a=!0,f=-1,s=0;continue}return i(l,String(e),u,t)}u=!1,(s=(h=n(h,t,10,l.s)).indexOf("."))>-1?h=h.replace(".",""):s=h.length}for(f=0;48===h.charCodeAt(f);f++);for(c=h.length;48===h.charCodeAt(--c););if(h=h.slice(f,++c)){if(c-=f,u&&k.DEBUG&&c>15&&(e>C||e!==j(e)))throw Error(P+l.s*e);if((s=s-f-1)>_)l.c=l.e=null;else if(s=m)?K(f,a):V(f,a,"0");else if(o=(e=I(new k(e),t,r)).e,s=(f=z(e.c)).length,1==n||2==n&&(t<=o||o<=y)){for(;ss){if(--t>0)for(f+=".";t--;f+="0");}else if((t+=o-s)>0)for(o+1==s&&(f+=".");t--;f+="0");return e.s<0&&i?"-"+f:f}function O(e,t){for(var r,n=1,i=new k(e[0]);n=10;i/=10,n++);return(r=n+r*D-1)>_?e.c=e.e=null:r=10;s/=10,i++);if((o=t-i)<0)o+=D,a=t,c=(f=h[u=0])/l[i-a-1]%10|0;else if((u=B((o+1)/D))>=h.length){if(!n)break e;for(;h.length<=u;h.push(0));f=c=0,i=1,a=(o%=D)-D+1}else{for(f=s=h[u],i=1;s>=10;s/=10,i++);c=(a=(o%=D)-D+i)<0?0:f/l[i-a-1]%10|0}if(n=n||t<0||null!=h[u+1]||(a<0?f:f%l[i-a-1]),n=r<4?(c||n)&&(0==r||r==(e.s<0?3:2)):c>5||5==c&&(4==r||n||6==r&&(o>0?a>0?f/l[i-a]:0:h[u-1])%10&1||r==(e.s<0?8:7)),t<1||!h[0])return h.length=0,n?(t-=e.e+1,h[0]=l[(D-t%D)%D],e.e=-t||0):h[0]=e.e=0,e;if(0==o?(h.length=u,s=1,u--):(h.length=u+1,s=l[D-o],h[u]=a>0?j(f/l[i-a]%l[a])*s:0),n)for(;;){if(0==u){for(o=1,a=h[0];a>=10;a/=10,o++);for(a=h[0]+=s,s=1;a>=10;a/=10,s++);o!=s&&(e.e++,h[0]==N&&(h[0]=1));break}if(h[u]+=s,h[u]!=N)break;h[u--]=0,s=1}for(o=h.length;0===h[--o];h.pop());}e.e>_?e.c=e.e=null:e.e=m?K(t,r):V(t,r,"0"),e.s<0?"-"+t:t)}return k.clone=e,k.ROUND_UP=0,k.ROUND_DOWN=1,k.ROUND_CEIL=2,k.ROUND_FLOOR=3,k.ROUND_HALF_UP=4,k.ROUND_HALF_DOWN=5,k.ROUND_HALF_EVEN=6,k.ROUND_HALF_CEIL=7,k.ROUND_HALF_FLOOR=8,k.EUCLID=9,k.config=k.set=function(e){var t,r;if(null!=e){if("object"!=typeof e)throw Error(L+"Object expected: "+e);if(e.hasOwnProperty(t="DECIMAL_PLACES")&&(W(r=e[t],0,F,t),p=r),e.hasOwnProperty(t="ROUNDING_MODE")&&(W(r=e[t],0,8,t),b=r),e.hasOwnProperty(t="EXPONENTIAL_AT")&&((r=e[t])&&r.pop?(W(r[0],-F,0,t),W(r[1],0,F,t),y=r[0],m=r[1]):(W(r,-F,F,t),y=-(m=r<0?-r:r))),e.hasOwnProperty(t="RANGE"))if((r=e[t])&&r.pop)W(r[0],-F,-1,t),W(r[1],1,F,t),g=r[0],_=r[1];else{if(W(r,-F,F,t),!r)throw Error(L+t+" cannot be zero: "+r);g=-(_=r<0?-r:r)}if(e.hasOwnProperty(t="CRYPTO")){if((r=e[t])!==!!r)throw Error(L+t+" not true or false: "+r);if(r){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw v=!r,Error(L+"crypto unavailable");v=r}else v=r}if(e.hasOwnProperty(t="MODULO_MODE")&&(W(r=e[t],0,9,t),w=r),e.hasOwnProperty(t="POW_PRECISION")&&(W(r=e[t],0,F,t),E=r),e.hasOwnProperty(t="FORMAT")){if("object"!=typeof(r=e[t]))throw Error(L+t+" not an object: "+r);S=r}if(e.hasOwnProperty(t="ALPHABET")){if("string"!=typeof(r=e[t])||/^.?$|[+\-.\s]|(.).*\1/.test(r))throw Error(L+t+" invalid: "+r);A="0123456789"==r.slice(0,10),M=r}}return{DECIMAL_PLACES:p,ROUNDING_MODE:b,EXPONENTIAL_AT:[y,m],RANGE:[g,_],CRYPTO:v,MODULO_MODE:w,POW_PRECISION:E,FORMAT:S,ALPHABET:M}},k.isBigNumber=function(e){if(!e||!0!==e._isBigNumber)return!1;if(!k.DEBUG)return!0;var t,r,n=e.c,i=e.e,o=e.s;e:if("[object Array]"=={}.toString.call(n)){if((1===o||-1===o)&&i>=-F&&i<=F&&i===j(i)){if(0===n[0]){if(0===i&&1===n.length)return!0;break e}if((t=(i+1)%D)<1&&(t+=D),String(n[0]).length==t){for(t=0;t=N||r!==j(r))break e;if(0!==r)return!0}}}else if(null===n&&null===i&&(null===o||1===o||-1===o))return!0;throw Error(L+"Invalid BigNumber: "+e)},k.maximum=k.max=function(){return O(arguments,l.lt)},k.minimum=k.min=function(){return O(arguments,l.gt)},k.random=(o=9007199254740992,a=Math.random()*o&2097151?function(){return j(Math.random()*o)}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)},function(e){var t,r,n,i,o,s=0,f=[],u=new k(d);if(null==e?e=p:W(e,0,F),i=B(e/D),v)if(crypto.getRandomValues){for(t=crypto.getRandomValues(new Uint32Array(i*=2));s>>11))>=9e15?(r=crypto.getRandomValues(new Uint32Array(2)),t[s]=r[0],t[s+1]=r[1]):(f.push(o%1e14),s+=2);s=i/2}else{if(!crypto.randomBytes)throw v=!1,Error(L+"crypto unavailable");for(t=crypto.randomBytes(i*=7);s=9e15?crypto.randomBytes(7).copy(t,s):(f.push(o%1e14),s+=7);s=i/7}if(!v)for(;s=10;o/=10,s++);sr-1&&(null==a[i+1]&&(a[i+1]=0),a[i+1]+=a[i]/r|0,a[i]%=r)}return a.reverse()}return function(n,i,o,a,s){var f,u,c,h,l,d,y,m,g=n.indexOf("."),_=p,v=b;for(g>=0&&(h=E,E=0,n=n.replace(".",""),d=(m=new k(i)).pow(n.length-g),E=h,m.c=t(V(z(d.c),d.e,"0"),10,o,e),m.e=m.c.length),c=h=(y=t(n,i,o,s?(f=M,e):(f=e,M))).length;0==y[--h];y.pop());if(!y[0])return f.charAt(0);if(g<0?--c:(d.c=y,d.e=c,d.s=a,y=(d=r(d,m,_,v,o)).c,l=d.r,c=d.e),g=y[u=c+_+1],h=o/2,l=l||u<0||null!=y[u+1],l=v<4?(null!=g||l)&&(0==v||v==(d.s<0?3:2)):g>h||g==h&&(4==v||l||6==v&&1&y[u-1]||v==(d.s<0?8:7)),u<1||!y[0])n=l?V(f.charAt(1),-_,f.charAt(0)):f.charAt(0);else{if(y.length=u,l)for(--o;++y[--u]>o;)y[u]=0,u||(++c,y=[1].concat(y));for(h=y.length;!y[--h];);for(g=0,n="";g<=h;n+=f.charAt(y[g++]));n=V(n,c,f.charAt(0))}return n}}(),r=function(){function e(e,t,r){var n,i,o,a,s=0,f=e.length,u=t%q,c=t/q|0;for(e=e.slice();f--;)s=((i=u*(o=e[f]%q)+(n=c*o+(a=e[f]/q|0)*u)%q*q+s)/r|0)+(n/q|0)+c*a,e[f]=i%r;return s&&(e=[s].concat(e)),e}function t(e,t,r,n){var i,o;if(r!=n)o=r>n?1:-1;else for(i=o=0;it[i]?1:-1;break}return o}function r(e,t,r,n){for(var i=0;r--;)e[r]-=i,i=e[r]1;e.splice(0,1));}return function(n,i,o,a,s){var f,u,c,h,l,d,p,b,y,m,g,_,v,w,E,S,M,A=n.s==i.s?1:-1,R=n.c,O=i.c;if(!(R&&R[0]&&O&&O[0]))return new k(n.s&&i.s&&(R?!O||R[0]!=O[0]:O)?R&&0==R[0]||!O?0*A:A/0:NaN);for(y=(b=new k(A)).c=[],A=o+(u=n.e-i.e)+1,s||(s=N,u=G(n.e/D)-G(i.e/D),A=A/D|0),c=0;O[c]==(R[c]||0);c++);if(O[c]>(R[c]||0)&&u--,A<0)y.push(1),h=!0;else{for(w=R.length,S=O.length,c=0,A+=2,(l=j(s/(O[0]+1)))>1&&(O=e(O,l,s),R=e(R,l,s),S=O.length,w=R.length),v=S,g=(m=R.slice(0,S)).length;g=s/2&&E++;do{if(l=0,(f=t(O,m,S,g))<0){if(_=m[0],S!=g&&(_=_*s+(m[1]||0)),(l=j(_/E))>1)for(l>=s&&(l=s-1),p=(d=e(O,l,s)).length,g=m.length;1==t(d,m,p,g);)l--,r(d,S=10;A/=10,c++);I(b,o+(b.e=c+u*D-1)+1,a,h)}else b.e=u,b.r=+h;return b}}(),s=/^(-?)0([xbo])(?=\w[\w.]*$)/i,f=/^([^.]+)\.$/,u=/^\.([^.]+)$/,c=/^-?(Infinity|NaN)$/,h=/^\s*\+(?=[\w.])|^\s+|\s+$/g,i=function(e,t,r,n){var i,o=r?t:t.replace(h,"");if(c.test(o))e.s=isNaN(o)?null:o<0?-1:1;else{if(!r&&(o=o.replace(s,(function(e,t,r){return i="x"==(r=r.toLowerCase())?16:"b"==r?2:8,n&&n!=i?e:t})),n&&(i=n,o=o.replace(f,"$1").replace(u,"0.$1")),t!=o))return new k(o,i);if(k.DEBUG)throw Error(L+"Not a"+(n?" base "+n:"")+" number: "+t);e.s=null}e.c=e.e=null},l.absoluteValue=l.abs=function(){var e=new k(this);return e.s<0&&(e.s=1),e},l.comparedTo=function(e,t){return $(this,new k(e,t))},l.decimalPlaces=l.dp=function(e,t){var r,n,i,o=this;if(null!=e)return W(e,0,F),null==t?t=b:W(t,0,8),I(new k(o),e+o.e+1,t);if(!(r=o.c))return null;if(n=((i=r.length-1)-G(this.e/D))*D,i=r[i])for(;i%10==0;i/=10,n--);return n<0&&(n=0),n},l.dividedBy=l.div=function(e,t){return r(this,new k(e,t),p,b)},l.dividedToIntegerBy=l.idiv=function(e,t){return r(this,new k(e,t),0,1)},l.exponentiatedBy=l.pow=function(e,t){var r,n,i,o,a,s,f,u,c=this;if((e=new k(e)).c&&!e.isInteger())throw Error(L+"Exponent not an integer: "+Y(e));if(null!=t&&(t=new k(t)),a=e.e>14,!c.c||!c.c[0]||1==c.c[0]&&!c.e&&1==c.c.length||!e.c||!e.c[0])return u=new k(Math.pow(+Y(c),a?e.s*(2-H(e)):+Y(e))),t?u.mod(t):u;if(s=e.s<0,t){if(t.c?!t.c[0]:!t.s)return new k(NaN);(n=!s&&c.isInteger()&&t.isInteger())&&(c=c.mod(t))}else{if(e.e>9&&(c.e>0||c.e<-1||(0==c.e?c.c[0]>1||a&&c.c[1]>=24e7:c.c[0]<8e13||a&&c.c[0]<=9999975e7)))return o=c.s<0&&H(e)?-0:0,c.e>-1&&(o=1/o),new k(s?1/o:o);E&&(o=B(E/D+2))}for(a?(r=new k(.5),s&&(e.s=1),f=H(e)):f=(i=Math.abs(+Y(e)))%2,u=new k(d);;){if(f){if(!(u=u.times(c)).c)break;o?u.c.length>o&&(u.c.length=o):n&&(u=u.mod(t))}if(i){if(0===(i=j(i/2)))break;f=i%2}else if(I(e=e.times(r),e.e+1,1),e.e>14)f=H(e);else{if(0==(i=+Y(e)))break;f=i%2}c=c.times(c),o?c.c&&c.c.length>o&&(c.c.length=o):n&&(c=c.mod(t))}return n?u:(s&&(u=d.div(u)),t?u.mod(t):o?I(u,E,b,void 0):u)},l.integerValue=function(e){var t=new k(this);return null==e?e=b:W(e,0,8),I(t,t.e+1,e)},l.isEqualTo=l.eq=function(e,t){return 0===$(this,new k(e,t))},l.isFinite=function(){return!!this.c},l.isGreaterThan=l.gt=function(e,t){return $(this,new k(e,t))>0},l.isGreaterThanOrEqualTo=l.gte=function(e,t){return 1===(t=$(this,new k(e,t)))||0===t},l.isInteger=function(){return!!this.c&&G(this.e/D)>this.c.length-2},l.isLessThan=l.lt=function(e,t){return $(this,new k(e,t))<0},l.isLessThanOrEqualTo=l.lte=function(e,t){return-1===(t=$(this,new k(e,t)))||0===t},l.isNaN=function(){return!this.s},l.isNegative=function(){return this.s<0},l.isPositive=function(){return this.s>0},l.isZero=function(){return!!this.c&&0==this.c[0]},l.minus=function(e,t){var r,n,i,o,a=this,s=a.s;if(t=(e=new k(e,t)).s,!s||!t)return new k(NaN);if(s!=t)return e.s=-t,a.plus(e);var f=a.e/D,u=e.e/D,c=a.c,h=e.c;if(!f||!u){if(!c||!h)return c?(e.s=-t,e):new k(h?a:NaN);if(!c[0]||!h[0])return h[0]?(e.s=-t,e):new k(c[0]?a:3==b?-0:0)}if(f=G(f),u=G(u),c=c.slice(),s=f-u){for((o=s<0)?(s=-s,i=c):(u=f,i=h),i.reverse(),t=s;t--;i.push(0));i.reverse()}else for(n=(o=(s=c.length)<(t=h.length))?s:t,s=t=0;t0)for(;t--;c[r++]=0);for(t=N-1;n>s;){if(c[--n]=0;){for(r=0,l=_[i]%y,d=_[i]/y|0,o=i+(a=f);o>i;)r=((u=l*(u=g[--a]%y)+(s=d*u+(c=g[a]/y|0)*l)%y*y+p[o]+r)/b|0)+(s/y|0)+d*c,p[o--]=u%b;p[o]=r}return r?++n:p.splice(0,1),T(e,p,n)},l.negated=function(){var e=new k(this);return e.s=-e.s||null,e},l.plus=function(e,t){var r,n=this,i=n.s;if(t=(e=new k(e,t)).s,!i||!t)return new k(NaN);if(i!=t)return e.s=-t,n.minus(e);var o=n.e/D,a=e.e/D,s=n.c,f=e.c;if(!o||!a){if(!s||!f)return new k(i/0);if(!s[0]||!f[0])return f[0]?e:new k(s[0]?n:0*i)}if(o=G(o),a=G(a),s=s.slice(),i=o-a){for(i>0?(a=o,r=f):(i=-i,r=s),r.reverse();i--;r.push(0));r.reverse()}for((i=s.length)-(t=f.length)<0&&(r=f,f=s,s=r,t=i),i=0;t;)i=(s[--t]=s[t]+f[t]+i)/N|0,s[t]=N===s[t]?0:s[t]%N;return i&&(s=[i].concat(s),++a),T(e,s,a)},l.precision=l.sd=function(e,t){var r,n,i,o=this;if(null!=e&&e!==!!e)return W(e,1,F),null==t?t=b:W(t,0,8),I(new k(o),e,t);if(!(r=o.c))return null;if(n=(i=r.length-1)*D+1,i=r[i]){for(;i%10==0;i/=10,n--);for(i=r[0];i>=10;i/=10,n++);}return e&&o.e+1>n&&(n=o.e+1),n},l.shiftedBy=function(e){return W(e,-9007199254740991,C),this.times("1e"+e)},l.squareRoot=l.sqrt=function(){var e,t,n,i,o,a=this,s=a.c,f=a.s,u=a.e,c=p+4,h=new k("0.5");if(1!==f||!s||!s[0])return new k(!f||f<0&&(!s||s[0])?NaN:s?a:1/0);if(0==(f=Math.sqrt(+Y(a)))||f==1/0?(((t=z(s)).length+u)%2==0&&(t+="0"),f=Math.sqrt(+t),u=G((u+1)/2)-(u<0||u%2),n=new k(t=f==1/0?"5e"+u:(t=f.toExponential()).slice(0,t.indexOf("e")+1)+u)):n=new k(f+""),n.c[0])for((f=(u=n.e)+c)<3&&(f=0);;)if(o=n,n=h.times(o.plus(r(a,o,c,1))),z(o.c).slice(0,f)===(t=z(n.c)).slice(0,f)){if(n.e0&&p>0){for(o=p%s||s,c=d.substr(0,o);o0&&(c+=u+d.slice(o)),l&&(c="-"+c)}n=h?c+(r.decimalSeparator||"")+((f=+r.fractionGroupSize)?h.replace(new RegExp("\\d{"+f+"}\\B","g"),"$&"+(r.fractionGroupSeparator||"")):h):c}return(r.prefix||"")+n+(r.suffix||"")},l.toFraction=function(e){var t,n,i,o,a,s,f,u,c,h,l,p,y=this,m=y.c;if(null!=e&&(!(f=new k(e)).isInteger()&&(f.c||1!==f.s)||f.lt(d)))throw Error(L+"Argument "+(f.isInteger()?"out of range: ":"not an integer: ")+Y(f));if(!m)return new k(y);for(t=new k(d),c=n=new k(d),i=u=new k(d),p=z(m),a=t.e=p.length-y.e-1,t.c[0]=U[(s=a%D)<0?D+s:s],e=!e||f.comparedTo(t)>0?a>0?t:c:f,s=_,_=1/0,f=new k(p),u.c[0]=0;h=r(f,t,0,1),1!=(o=n.plus(h.times(i))).comparedTo(e);)n=i,i=o,c=u.plus(h.times(o=c)),u=o,t=f.minus(h.times(o=t)),f=o;return o=r(e.minus(n),i,0,1),u=u.plus(o.times(c)),n=n.plus(o.times(i)),u.s=c.s=y.s,l=r(c,i,a*=2,b).minus(y).abs().comparedTo(r(u,n,a,b).minus(y).abs())<1?[c,i]:[u,n],_=s,l},l.toNumber=function(){return+Y(this)},l.toPrecision=function(e,t){return null!=e&&W(e,1,F),R(this,e,t,2)},l.toString=function(e){var t,r=this,i=r.s,o=r.e;return null===o?i?(t="Infinity",i<0&&(t="-"+t)):t="NaN":(null==e?t=o<=y||o>=m?K(z(r.c),o):V(z(r.c),o,"0"):10===e&&A?t=V(z((r=I(new k(r),p+o+1,b)).c),r.e,"0"):(W(e,2,M.length,"Base"),t=n(V(z(r.c),o,"0"),10,e,i,!0)),i<0&&r.c[0]&&(t="-"+t)),t},l.valueOf=l.toJSON=function(){return Y(this)},l._isBigNumber=!0,l[Symbol.toStringTag]="BigNumber",l[Symbol.for("nodejs.util.inspect.custom")]=l.valueOf,null!=t&&k.set(t),k}();const X=Y;var J=__webpack_require__(177),Z=__webpack_require__.n(J),Q=__webpack_require__(148),ee=__webpack_require__.n(Q);const te=e=>{let t=e;if(e&&e.value&&(t=e.value),t.indexOf("_")>0){const e=t.split("_").filter((e=>{try{return ce("base58").decode(e,"hex"),!0}catch(e){return!1}}));if(0===e.length)throw new Error("Invalid address");[t]=e}try{ce("base58").decode(t,"hex")}catch(e){throw new Error("Invalid address")}return t},re=e=>{const t=Buffer.from(e,"base64");return ce("descriptor").FileDescriptorSet.decode(t)};function ne(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var ie=null;function oe(){if(null===ie){let e=ne();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),ie=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return ie}function ae(){let e=ne();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function se(){let e=oe(),t=ae(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=ne();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var fe="__INTENTIONAL_UNDEFINED__";let ue={};function ce(e){let t=se();if(void 0===t[e])return function(e){switch(e){case"base58":return Je;case"descriptor":return ee()}}(e);var r=t[e];return r===fe?void 0:r}function he(e,t){let r=se();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){le(e)}))}):(r[e]=void 0===t?fe:t,function(){le(e)})}function le(e){let t=se();delete t[e],0==Object.keys(t).length&&delete ae()[oe]}function de(e){let t=se();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(ue,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",ce),e("__GetDependency__",ce),e("__Rewire__",he),e("__set__",he),e("__reset__",le),e("__ResetDependency__",le),e("__with__",de)}();const pe="ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",be={getChainStatus:{name:"getChainStatus",call:"blockChain/chainStatus",method:"GET",params:[]},getChainState:{name:"getChainState",call:"blockChain/blockState",method:"GET",params:["blockHash"]},getContractFileDescriptorSet:{name:"getContractFileDescriptorSet",call:"blockChain/contractFileDescriptorSet",method:"GET",params:["address"],inputFormatter:[ke("inputAddressFormatter")],outputFormatter:ke("outputFileDescriptorSetFormatter")},getBlockHeight:{name:"getBlockHeight",call:"blockChain/blockHeight",method:"GET",params:[],inputFormatter:[]},getBlock:{name:"getBlock",call:"blockChain/block",method:"GET",params:["blockHash","includeTransactions"]},getBlockByHeight:{name:"getBlockByHeight",call:"blockChain/blockByHeight",method:"GET",params:["blockHeight","includeTransactions"]},getTxResult:{name:"getTxResult",call:"blockChain/transactionResult",method:"GET",params:["transactionId"],inputFormatter:[]},getTxResults:{name:"getTxResults",call:"blockChain/transactionResults",method:"GET",params:["blockHash","offset","limit"]},getMerklePathByTxId:{name:"getMerklePathByTxId",call:"blockChain/merklePathByTransactionId",method:"GET",params:["transactionId"]},getTransactionPoolStatus:{name:"getTransactionPoolStatus",call:"blockChain/transactionPoolStatus",method:"GET",params:[]},sendTransaction:{name:"sendTransaction",call:"blockChain/sendTransaction",method:"POST",params:["rawTransaction"],inputFormatter:[]},sendTransactions:{name:"sendTransactions",call:"blockChain/sendTransactions",method:"POST",params:["rawTransaction"],inputFormatter:[]},calculateTransactionFee:{name:"calculateTransactionFee",call:"blockChain/calculateTransactionFee",method:"POST",params:["rawTransaction"],inputFormatter:[]},callReadOnly:{name:"callReadOnly",call:"blockChain/executeTransaction",method:"POST",params:["rawTransaction"],inputFormatter:[]},getPeers:{name:"getPeers",call:"net/peers",method:"GET",params:["withMetrics"]},addPeer:{name:"addPeer",call:"net/peer",method:"POST",params:["address"],inputFormatter:[]},removePeer:{name:"removePeer",call:"net/peer",method:"DELETE",params:["address"],inputFormatter:[]},networkInfo:{name:"networkInfo",call:"net/networkInfo",method:"GET",params:[],inputFormatter:[]}},ye={noether:"0",wei:"1",kwei:"1000",Kwei:"1000",babbage:"1000",femtoether:"1000",mwei:"1000000",Mwei:"1000000",lovelace:"1000000",picoether:"1000000",gwei:"1000000000",Gwei:"1000000000",shannon:"1000000000",nanoether:"1000000000",nano:"1000000000",szabo:"1000000000000",microether:"1000000000000",micro:"1000000000000",finney:"1000000000000000",milliether:"1000000000000000",milli:"1000000000000000",ether:"1000000000000000000",kether:"1000000000000000000000",grand:"1000000000000000000000",mether:"1000000000000000000000000",gether:"1000000000000000000000000000",tether:"1000000000000000000000000000000"},me="utf8",ge=(ke("TO_STRING_UTF8_ENCODING"),{INVALID_PASSWORD:{error:200001,errorMessage:"Password Error"},NOT_AELF_KEY_STORE:{error:200002,errorMessage:"Not a aelf key store"},WRONG_VERSION:{error:200004,errorMessage:"The version is incorrect"},WRONG_KEY_STORE_VERSION:{error:200005,errorMessage:"Not a V1 key store"}});function _e(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var ve=null;function we(){if(null===ve){let e=_e();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),ve=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return ve}function Ee(){let e=_e();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function Se(){let e=we(),t=Ee(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=_e();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Me="__INTENTIONAL_UNDEFINED__";let Ae={};function ke(e){let t=Se();if(void 0===t[e])return function(e){switch(e){case"inputAddressFormatter":return te;case"outputFileDescriptorSetFormatter":return re;case"TO_STRING_UTF8_ENCODING":return me}}(e);var r=t[e];return r===Me?void 0:r}function Re(e,t){let r=Se();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Oe(e)}))}):(r[e]=void 0===t?Me:t,function(){Oe(e)})}function Oe(e){let t=Se();delete t[e],0==Object.keys(t).length&&delete Ee()[we]}function Te(e){let t=Se();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(Ae,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",ke),e("__GetDependency__",ke),e("__Rewire__",Re),e("__set__",Re),e("__reset__",Oe),e("__ResetDependency__",Oe),e("__with__",Te)}();const Ie=(e,t)=>!(!e.name||e.name!==t||!e.fieldsArray||1!==e.fieldsArray.length||"bytes"!==e.fieldsArray[0].type),xe=e=>He("isWrappedBytes")(e,"Address"),Be=e=>He("isWrappedBytes")(e,"Hash");function je(e,t){let r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:[];const n=(e.fieldsArray||[]).length;let i=t;if(0===n)return t;for(const{filter:n,transformer:i}of r)if(n(e)&&t)return i(t);return Object.keys(e.fields).forEach((n=>{const{rule:o,name:a,resolvedType:s}=e.fields[n];if(s)if(o&&"repeated"===o){let e=t[a];e&&Array.isArray(e)&&(e=e.filter((e=>null!=e)).map((e=>He("transform")(s,e,r)))),i={...i,[a]:e}}else i={...i,[a]:null!==t[a]&&void 0!==t[a]?He("transform")(s,t[a],r):t[a]}})),i}function Le(e,t){const r=e.fieldsArray?e.fieldsArray.length:0;let n=t;if(!t)return t;if(0===r||1===r&&!e.fieldsArray[0].resolvedType)return t;const{fields:i,options:o={}}=e;return 2===r&&i.value&&i.key&&!0===o.map_entry?Object.keys(t).map((e=>({key:e,value:t[e]}))):(Object.keys(e.fields).forEach((r=>{const{name:i,resolvedType:o}=e.fields[r];if(o)if(t[i]&&Array.isArray(t[i])){let e=t[i];e=e.map((e=>He("transformMapToArray")(o,e))),n={...n,[i]:e}}else n={...n,[i]:He("transformMapToArray")(o,t[i])}})),n)}function Pe(e,t){const r=(e.fieldsArray||[]).length;let n=t;if(0===r||1===r&&!e.fieldsArray[0].resolvedType)return t;const{fields:i,options:o={}}=e;return 2===r&&i.value&&i.key&&!0===o.map_entry?t.reduce(((e,t)=>({...e,[t.key]:t.value})),{}):(Object.keys(i).forEach((e=>{const{name:r,resolvedType:o}=i[e];if(o&&null!=t)if(t[r]&&Array.isArray(t[r])){const{fieldsArray:e=[],fields:i,options:a={}}=o;if(2===e.length&&i.value&&i.key&&!0===a.map_entry)n={...n,[r]:t[r].reduce(((e,t)=>({...e,[t.key]:t.value})),{})};else{let e=t[r];e=e.map((e=>He("transformArrayToMap")(o,e))),n={...n,[r]:e}}}else n={...n,[r]:He("transformArrayToMap")(o,t[r])}})),n)}const Ne=[{filter:He("isAddress"),transformer:e=>{let t=e;return"string"==typeof e&&(t={value:Buffer.from(He("decodeAddressRep")(He("inputAddressFormatter")(e)),"hex")}),Array.isArray(e)&&(t=e.map((e=>({value:Buffer.from(He("decodeAddressRep")(He("inputAddressFormatter")(e)),"hex")})))),t}},{filter:He("isHash"),transformer:e=>{let t=e;return"string"==typeof e&&(t={value:Buffer.from(e.replace("0x",""),"hex")}),Array.isArray(e)&&(t=e.map((e=>({value:Buffer.from(e.replace("0x",""),"hex")})))),t}}];function De(e){const t=Buffer.from(e,"base64");return He("base58").encode(t)}const Ce=[{filter:He("isAddress"),transformer:e=>{let t=e;return Array.isArray(t)?t=t.map((e=>He("encodeAddress")(e.value))):"string"!=typeof t&&(t=He("encodeAddress")(t.value)),t}},{filter:He("isHash"),transformer:e=>{let t=e;return Array.isArray(t)?t=t.map((e=>Buffer.from(e.value,"base64").toString("hex"))):"string"!=typeof t&&(t=Buffer.from(t.value,"base64").toString("hex")),t}}];function Ue(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var qe=null;function Fe(){if(null===qe){let e=Ue();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),qe=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return qe}function Ge(){let e=Ue();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function ze(){let e=Fe(),t=Ge(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=Ue();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var $e="__INTENTIONAL_UNDEFINED__";let We={};function He(e){let t=ze();if(void 0===t[e])return function(e){switch(e){case"isWrappedBytes":return Ie;case"transform":return je;case"transformMapToArray":return Le;case"transformArrayToMap":return Pe;case"isAddress":return xe;case"decodeAddressRep":return nt;case"inputAddressFormatter":return te;case"isHash":return Be;case"base58":return Je;case"encodeAddress":return De}}(e);var r=t[e];return r===$e?void 0:r}function Ke(e,t){let r=ze();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Ve(e)}))}):(r[e]=void 0===t?$e:t,function(){Ve(e)})}function Ve(e){let t=ze();delete t[e],0==Object.keys(t).length&&delete Ge()[Fe]}function Ye(e){let t=ze();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(We,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",He),e("__GetDependency__",He),e("__Rewire__",Ke),e("__set__",Ke),e("__reset__",Ve),e("__ResetDependency__",Ve),e("__with__",Ye)}();const Xe=We,Je={encode(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"hex",r=e;if("string"==typeof e&&(r=Buffer.from(e,t)),!(r instanceof Buffer))throw new TypeError('"data" argument must be an Array of Buffers');let n=r;return n=Buffer.from(Tt("sha256")(r),"hex"),n=Buffer.from(Tt("sha256")(n),"hex"),n=Buffer.from(r.toString("hex")+n.slice(0,4).toString("hex"),"hex"),Tt("bs58").encode(n)},decode(e,t){const r=Buffer.from(Tt("bs58").decode(e));let n=r.slice(0,-4),i=n;return i=Buffer.from(Tt("sha256")(i),"hex"),i=Buffer.from(Tt("sha256")(i),"hex"),r.slice(-4).forEach(((e,t)=>{if(e!==i[t])throw new Error("Invalid checksum")})),t&&(n=n.toString(t)),n}},Ze={chainIdToBase58(e){const t=Buffer.alloc(4);t.writeInt32LE(`0x${e.toString("16")}`,0);const r=Buffer.concat([t],3);return Tt("bs58").encode(r)},base58ToChainId:e=>Buffer.concat([Tt("bs58").decode(e)],4).readInt32LE(0)},Qe=e=>Array.prototype.map.call(new Uint8Array(e),(e=>`0${e.toString(16)}`.slice(-2))).join(""),et=e=>{let t="";return t=e instanceof Buffer?e.toString("hex"):Tt("arrayBufferToHex")(e),t},tt=(e,t,r)=>{const n=t-e.length+1;return new Array(n<0?0:n).join(r||"0")+e},rt=(e,t,r)=>{const n=t-e.length+1;return e+new Array(n<0?0:n).join(r||"0")},nt=e=>{if(e.indexOf("_")>-1){const t=e.split("_")[1];return Tt("base58").decode(t,"hex")}return Tt("base58").decode(e,"hex")},it=e=>{const t=Buffer.from(e.replace("0x",""),"hex");return Tt("base58").encode(t,"hex")},ot=e=>e instanceof Tt("BigNumber")||e&&e.constructor&&"BigNumber"===e.constructor.name,at=e=>"string"==typeof e||e&&e.constructor&&"String"===e.constructor.name,st=e=>"function"==typeof e,ft=e=>null!==e&&!Array.isArray(e)&&"object"==typeof e,ut=e=>"boolean"==typeof e,ct=e=>{try{return!!JSON.parse(e)}catch(e){return!1}},ht=e=>{const t=e||0;return Tt("isBigNumber")(t)?t:!Tt("isString")(t)||0!==t.indexOf("0x")&&0!==t.indexOf("-0x")?new(Tt("BigNumber"))(t.toString(10),10):new(Tt("BigNumber"))(t.replace("0x",""),16)},lt=e=>{const t=Tt("UNIT_MAP")[e?e.toLowerCase():"ether"];if(void 0===t)throw new Error(`This unit doesn't exists, please use the one of the following units ${JSON.stringify(Tt("UNIT_MAP"),null,2)}`);return new(Tt("BigNumber"))(t,10)},dt=(e,t)=>{const r=Tt("toBigNumber")(e).dividedBy(Tt("getValueOfUnit")(t));return Tt("isBigNumber")(e)?r:r.toString(10)},pt=(e,t)=>{const r=Tt("toBigNumber")(e).times(Tt("getValueOfUnit")(t));return Tt("isBigNumber")(e)?r:r.toString(10)},bt=e=>{const t=Tt("toBigNumber")(e).integerValue();return t.isLessThan(0)?new(Tt("BigNumber"))(Tt("UNSIGNED_256_INT"),16).plus(t).plus(1):t},yt=e=>{let t="";return e.forEach((e=>{let r=e.toString(16);r.length<=1&&(r=`0${r}`),t+=r})),t},mt=()=>{},gt=(e,t,r)=>{const n=t.split(".");n.reduce(((e,t,i)=>i===n.length-1?(e[t]=r,e):(e[t]={},e[t])),e)},_t=e=>{let{data:t,dataType:r,encoding:n="hex"}=e;const i=Buffer.from(t,n),o=r.decode(i);return r.toObject(o,{enums:String,longs:String,bytes:String,defaults:!0,arrays:!0,objects:!0,oneofs:!0})};function vt(e,t){const{from:r,to:n,params:i,refBlockPrefix:o,signature:a,...s}=Tt("unpackSpecifiedTypeData")({data:e,dataType:Tt("Transaction")});let f=Tt("unpackSpecifiedTypeData")({data:i,encoding:"base64",dataType:t});return f=Tt("transform")(t,f,Tt("OUTPUT_TRANSFORMERS")),f=Tt("transformArrayToMap")(t,f),{from:Tt("encodeAddress")(r.value),to:Tt("encodeAddress")(n.value),params:f,refBlockPrefix:Buffer.from(o,"base64").toString("hex"),signature:Buffer.from(a,"base64").toString("hex"),...s}}function wt(e,t){return`Basic ${Buffer.from(`${e}:${t}`).toString("base64")}`}function Et(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var St=null;function Mt(){if(null===St){let e=Et();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),St=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return St}function At(){let e=Et();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function kt(){let e=Mt(),t=At(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=Et();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Rt="__INTENTIONAL_UNDEFINED__";let Ot={};function Tt(e){let t=kt();if(void 0===t[e])return function(e){switch(e){case"sha256":return y;case"bs58":return Z();case"arrayBufferToHex":return Qe;case"base58":return Je;case"BigNumber":return X;case"isBigNumber":return ot;case"isString":return at;case"UNIT_MAP":return ye;case"toBigNumber":return ht;case"getValueOfUnit":return lt;case"UNSIGNED_256_INT":return pe;case"unpackSpecifiedTypeData":return _t;case"Transaction":return Pt;case"transform":return je;case"OUTPUT_TRANSFORMERS":return Ce;case"transformArrayToMap":return Pe;case"encodeAddress":return De}}(e);var r=t[e];return r===Rt?void 0:r}function It(e,t){let r=kt();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){xt(e)}))}):(r[e]=void 0===t?Rt:t,function(){xt(e)})}function xt(e){let t=kt();delete t[e],0==Object.keys(t).length&&delete At()[Mt]}function Bt(e){let t=kt();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(Ot,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",Tt),e("__GetDependency__",Tt),e("__Rewire__",It),e("__set__",It),e("__reset__",xt),e("__ResetDependency__",xt),e("__with__",Bt)}();const jt=Ot,Lt=ar("protobuf").Root.fromJSON(ar("coreDescriptor")),{Transaction:Pt,Hash:Nt,Address:Dt,TransactionFeeCharged:Ct,ResourceTokenCharged:Ut}=ar("coreRootProto"),qt=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"TransactionFeeCharged";if(-1===["ResourceTokenCharged","TransactionFeeCharged"].indexOf(t))throw new Error("type needs to be one of ResourceTokenCharged and TransactionFeeCharged");const r=ar("coreRootProto")[t];let n=r.decode(Buffer.from(e,"base64"));n=r.toObject(n,{enums:String,longs:String,bytes:String,defaults:!0,arrays:!0,objects:!0,oneofs:!0});let i=ar("transform")(r,n,ar("OUTPUT_TRANSFORMERS"));return i=ar("transformArrayToMap")(r,i),i},Ft=e=>{const{NonIndexed:t,Indexed:r=[]}=e,n=[...r||[]];return t&&n.push(t),n.join("")},Gt=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[];return Array.isArray(e)&&0!==e.length?e.filter((e=>"ResourceTokenCharged"===e.Name)).map((e=>ar("getFee")(ar("getSerializedDataFromLog")(e),"ResourceTokenCharged"))):[]},zt=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[];return Array.isArray(e)&&0!==e.length?e.filter((e=>"TransactionFeeCharged"===e.Name)).map((e=>ar("getFee")(ar("getSerializedDataFromLog")(e),"TransactionFeeCharged"))):[]},$t=e=>Array.prototype.map.call(new Uint8Array(e),(e=>`0${e.toString(16)}`.slice(-2))).join(""),Wt=e=>{const t=ar("Address").fromObject(e);let r="";return r=t.value instanceof Buffer?t.value.toString("hex"):ar("arrayBufferToHex")(t.value),ar("utils").encodeAddressRep(r)},Ht=e=>{const t=ar("utils").decodeAddressRep(e);return ar("Address").create({value:Buffer.from(t.replace("0x",""),"hex")})},Kt=e=>ar("Address").toObject(ar("getAddressFromRep")(e)),Vt=e=>{const t=ar("Address").fromObject(e);let r="";return r=t.value instanceof Buffer?t.value.toString("hex"):ar("arrayBufferToHex")(t.value),r},Yt=e=>ar("Hash").create({value:Buffer.from(e.replace("0x",""),"hex")}),Xt=e=>ar("Hash").toObject(ar("getHashFromHex")(e)),Jt=e=>ar("Transaction").encode(e).finish(),Zt=(e,t,r,n)=>{const i={from:ar("getAddressFromRep")(e),to:ar("getAddressFromRep")(t),methodName:r,params:n};return ar("Transaction").create(i)};function Qt(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var er=null;function tr(){if(null===er){let e=Qt();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),er=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return er}function rr(){let e=Qt();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function nr(){let e=tr(),t=rr(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=Qt();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var ir="__INTENTIONAL_UNDEFINED__";let or={};function ar(e){let r=nr();if(void 0===r[e])return function(e){switch(e){case"protobuf":return cr(a);case"coreDescriptor":return I;case"coreRootProto":return Lt;case"transform":return je;case"OUTPUT_TRANSFORMERS":return Ce;case"transformArrayToMap":return Pe;case"getFee":return qt;case"getSerializedDataFromLog":return Ft;case"Address":return Dt;case"arrayBufferToHex":return $t;case"utils":return cr(t);case"getAddressFromRep":return Ht;case"Hash":return Nt;case"getHashFromHex":return Yt;case"Transaction":return Pt}}(e);var n=r[e];return n===ir?void 0:n}function sr(e,t){let r=nr();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){fr(e)}))}):(r[e]=void 0===t?ir:t,function(){fr(e)})}function fr(e){let t=nr();delete t[e],0==Object.keys(t).length&&delete rr()[tr]}function ur(e){let t=nr();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}function cr(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};return Object.keys(e).filter((function(e){return"__get__"!==e&&"__set__"!==e&&"__reset__"!==e&&"__with__"!==e&&"__GetDependency__"!==e&&"__Rewire__"!==e&&"__ResetDependency__"!==e&&"__RewireAPI__"!==e})).reduce((function(t,r){return t[r]=e[r],t}),{})}!function(){function e(e,t){Object.defineProperty(or,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",ar),e("__GetDependency__",ar),e("__Rewire__",sr),e("__set__",sr),e("__reset__",fr),e("__ResetDependency__",fr),e("__with__",ur)}();const hr=or;function lr(e){return e instanceof Buffer||e instanceof Uint8Array?256===e.length:!(!/^(0x)?[0-9a-f]{512}$/.test(e)&&!/^(0x)?[0-9A-F]{512}$/.test(e))}function dr(e){if(e>=48&&e<=57)return e-48;if(e>=65&&e<=70)return e-55;if(e>=97&&e<=102)return e-87;throw new Error("invalid bloom")}function pr(e,t){if(!Ar("isBloom")(e))throw new Error("Invalid Bloom");for(let r=0;r<12;r+=4){const n=(parseInt(t.substr(r,2),16)<<8)+parseInt(t.substr(r+2,2),16)&2047,i=1<{const r=this.inputFormatter[t];return r?r(e):e})):e}setRequestManager(e){this.requestManager=e}formatOutput(e){return this.outputFormatter&&e?this.outputFormatter(e):e}extractArgumentsIntoObject(e){if(e.length{r>this.params.length-1?(Cr("isFunction")(e)&&(t.callback=e,t.isSync=!1),Cr("isBoolean")(e?.sync)&&(t.isSync=e.sync)):t.params[this.params[r]]=e})),t}run(){for(var e=arguments.length,t=new Array(e),r=0;r(n.callback(null,this.formatOutput(e)),this.formatOutput(e)))).catch((e=>{throw n.callback(e),e}))}}function xr(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var Br=null;function jr(){if(null===Br){let e=xr();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),Br=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return Br}function Lr(){let e=xr();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function Pr(){let e=jr(),t=Lr(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=xr();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Nr="__INTENTIONAL_UNDEFINED__";let Dr={};function Cr(e){let t=Pr();if(void 0===t[e])return function(e){switch(e){case"noop":return mt;case"isFunction":return st;case"isBoolean":return ut}}(e);var r=t[e];return r===Nr?void 0:r}function Ur(e,t){let r=Pr();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){qr(e)}))}):(r[e]=void 0===t?Nr:t,function(){qr(e)})}function qr(e){let t=Pr();delete t[e],0==Object.keys(t).length&&delete Lr()[jr]}function Fr(e){let t=Pr();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(Dr,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",Cr),e("__GetDependency__",Cr),e("__Rewire__",Ur),e("__set__",Ur),e("__reset__",qr),e("__ResetDependency__",qr),e("__with__",Fr)}();let Gr=typeof Ir;function zr(e,t){Object.defineProperty(Ir,e,{value:t,enumerable:!1,configurable:!0})}"object"!==Gr&&"function"!==Gr||!Object.isExtensible(Ir)||(zr("__get__",Cr),zr("__GetDependency__",Cr),zr("__Rewire__",Ur),zr("__set__",Ur),zr("__reset__",qr),zr("__ResetDependency__",qr),zr("__with__",Fr),zr("__RewireAPI__",Dr));const $r=e=>{if(2!==e.length)throw new TypeError("Wrong data size.");Buffer.compare(e[0],e[1])>0&&e.reverse();let t=Buffer.concat(e);return t=Buffer.from(nn("sha256")(t),"hex"),t},Wr=e=>{if(0===e.length)return null;e.length%2==1&&e.push(e[e.length-1]);let t=e.length/2,r=0,n=0;for(;n{let n=e;if(0===r.length||n>=t)return null;let i=0,o=t;const a=[];for(;n{const t=nn("generateMerkleTree")(e);return t[t.length-1]},Vr=(e,t)=>{const r=t.length,n=nn("generateMerkleTree")(t);return nn("generateMerklePath")(e,r,n)},Yr=e=>Buffer.from(nn("sha256")(e),"hex");function Xr(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var Jr=null;function Zr(){if(null===Jr){let e=Xr();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),Jr=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return Jr}function Qr(){let e=Xr();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function en(){let e=Zr(),t=Qr(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=Xr();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var tn="__INTENTIONAL_UNDEFINED__";let rn={};function nn(e){let t=en();if(void 0===t[e])return function(e){switch(e){case"sha256":return y;case"fromTwoBuffers":return $r;case"generateMerkleTree":return Wr;case"generateMerklePath":return Hr}}(e);var r=t[e];return r===tn?void 0:r}function on(e,t){let r=en();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){an(e)}))}):(r[e]=void 0===t?tn:t,function(){an(e)})}function an(e){let t=en();delete t[e],0==Object.keys(t).length&&delete Qr()[Zr]}function sn(e){let t=en();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(rn,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",nn),e("__GetDependency__",nn),e("__Rewire__",on),e("__set__",on),e("__reset__",an),e("__ResetDependency__",an),e("__with__",sn)}();const fn=rn;var un=__webpack_require__(20),cn=__webpack_require__.n(un),hn=__webpack_require__(305),ln=__webpack_require__(215),dn=__webpack_require__.n(ln),pn=__webpack_require__(152),bn=__webpack_require__.n(pn),yn=__webpack_require__(158),mn=__webpack_require__.n(yn),gn=__webpack_require__(273),_n=__webpack_require__.n(gn),vn=__webpack_require__(237),wn=__webpack_require__(12),En=__webpack_require__.n(wn);const Sn=__webpack_require__(276),Mn=e=>t=>{let r;if("0x"===t.slice(0,2)){r=[];for(let e=2,n=t.length;e2&&void 0!==arguments[2]?arguments[2]:Yn("defaultOptions");const s={...Yn("defaultOptions"),...a},{cipher:f="aes-128-ctr"}=s,u=/128/.test(f)?16:32,c=Yn("randomBytes")(32),h=(Yn("AES_MODES")[f.toLowerCase()]||{}).iv,l=Yn("randomBytes")(void 0===h?16:h),d=Yn("scrypt")(Buffer.from(t,"utf8"),c,s.n,s.r,s.p,s.dklen),p=Yn("createCipheriv")(f,d.slice(0,u),l),b=Buffer.concat([p.update(Buffer.from(n,"hex")),p.final()]),y=Yn("createCipheriv")(f,d.slice(0,u),l),m=Buffer.concat([y.update(Buffer.from(r,"utf8")),y.final()]),g=Buffer.concat([d.slice(16),b]),_=Yn("keccak256")(g).replace("0x","");return{version:1,type:"aelf",nickName:i,address:o,crypto:{cipher:f,ciphertext:b.toString("hex"),cipherparams:{iv:l.toString("hex")},mnemonicEncrypted:m.toString("hex"),kdf:"scrypt",kdfparams:{r:s.r,n:s.n,p:s.p,dklen:s.dklen,salt:c.toString("hex")},mac:_}}}function qn(e,t){let{crypto:r,nickName:n="",address:i=""}=e,o=null,a=null;const{kdfparams:s,mac:f,cipherparams:u,mnemonicEncrypted:c="",ciphertext:h,cipher:l="aes-128-ctr"}=r,d=/128/.test(l)?16:32,p=Buffer.from(u.iv,"hex"),b=Yn("scrypt")(Buffer.from(t),Buffer.from(s.salt,"hex"),s.n,s.r,s.p,s.dklen||s.dkLen),y=Buffer.concat([b.slice(16),Buffer.from(h,"hex")]);if(Yn("keccak256")(y).replace("0x","")!==f)throw o={...Yn("KEY_STORE_ERRORS").INVALID_PASSWORD},o;{const e=Yn("createDecipheriv")(l,b.slice(0,d),p),t=Buffer.concat([e.update(Buffer.from(h,"hex")),e.final()]).toString("hex"),r=Yn("createDecipheriv")(l,b.slice(0,d),p);a={nickName:n,address:i,mnemonic:Buffer.concat([r.update(Buffer.from(c,"hex")),r.final()]).toString("utf8"),privateKey:t}}return a}const Fn=(e,t)=>{try{return!!Yn("unlockKeystore")(e,t).privateKey}catch(e){return!1}};function Gn(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var zn=null;function $n(){if(null===zn){let e=Gn();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),zn=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return zn}function Wn(){let e=Gn();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function Hn(){let e=$n(),t=Wn(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=Gn();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Kn="__INTENTIONAL_UNDEFINED__";let Vn={};function Yn(e){let t=Hn();if(void 0===t[e])return function(e){switch(e){case"defaultOptions":return Cn;case"randomBytes":return En();case"AES_MODES":return Dn;case"scrypt":return _n();case"createCipheriv":return vn.createCipheriv;case"keccak256":return An;case"createDecipheriv":return vn.createDecipheriv;case"KEY_STORE_ERRORS":return ge;case"unlockKeystore":return qn}}(e);var r=t[e];return r===Kn?void 0:r}function Xn(e,t){let r=Hn();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Jn(e)}))}):(r[e]=void 0===t?Kn:t,function(){Jn(e)})}function Jn(e){let t=Hn();delete t[e],0==Object.keys(t).length&&delete Wn()[$n]}function Zn(e){let t=Hn();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(Vn,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",Yn),e("__GetDependency__",Yn),e("__Rewire__",Xn),e("__set__",Xn),e("__reset__",Jn),e("__ResetDependency__",Jn),e("__with__",Zn)}();const Qn=Vn,ei=new(vi("elliptic").ec)("secp256k1"),ti=(e,t)=>vi("AES").encrypt(e,t).toString(),ri=(e,t)=>vi("AES").decrypt(e,t).toString(vi("encUTF8")),ni=e=>{const t=e.encode(),r=Buffer.from(vi("sha256")(t),"hex"),n=vi("sha256")(r).slice(0,64);return vi("encodeAddressRep")(n)},ii=function(e,t){let r,n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"m/44'/1616'/0'/0/0",i="",o="",a="",s="";switch(e){case"createNewWallet":i=vi("bip39").generateMnemonic(),o=vi("bip39").mnemonicToSeedSync(i).toString("hex"),r=vi("hdkey").fromMasterSeed(o),a=r.derive(n),s=vi("ellipticEc").keyFromPrivate(a.privateKey);break;case"getWalletByMnemonic":i=t,o=vi("bip39").mnemonicToSeedSync(i).toString("hex"),r=vi("hdkey").fromMasterSeed(o),a=r.derive(n),s=vi("ellipticEc").keyFromPrivate(a.privateKey);break;case"getWalletByPrivateKey":s="string"==typeof t?vi("ellipticEc").keyFromPrivate(vi("padLeft")(t,64,"0")):vi("ellipticEc").keyFromPrivate(t);break;default:throw new Error("not a valid method")}const f=s.getPrivate().toString(16,64),u=s.getPublic();return{mnemonic:i,BIP44Path:n,childWallet:a,keyPair:s,privateKey:f,address:vi("getAddressFromPubKey")(u)}},oi=(e,t)=>{const r=t.getPrivate("hex"),n=vi("sha256")(e),i=vi("ellipticEc").sign(Buffer.from(n,"hex"),r,"hex",{canonical:!0}),o=[i.r.toString("hex",32),i.s.toString("hex",32),`0${i.recoveryParam.toString()}`].join("");return Buffer.from(o,"hex")},ai=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"m/44'/1616'/0'/0/0";return vi("_getWallet")("createNewWallet","",e)},si=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"m/44'/1616'/0'/0/0";return!!vi("bip39").validateMnemonic(e)&&vi("_getWallet")("getWalletByMnemonic",e,t)},fi=e=>vi("_getWallet")("getWalletByPrivateKey",e),ui=(e,t)=>{let{params:r}=e;0===r.length&&(r=null);const n=vi("Transaction").encode(e).finish(),i=vi("getSignature")(n,t);return{...e,params:r,signature:i}},ci=(e,t)=>{const r=Buffer.from(e.replace("0x",""),"hex");return vi("getSignature")(r,t)};let hi={hdkey:vi("hdkey"),bip39:vi("bip39"),sign:vi("sign"),signTransaction:vi("signTransaction"),createNewWallet:vi("createNewWallet"),getWalletByMnemonic:vi("getWalletByMnemonic"),getWalletByPrivateKey:vi("getWalletByPrivateKey"),getAddressFromPubKey:vi("getAddressFromPubKey"),ellipticEc:vi("ellipticEc"),AESEncrypt:vi("AESEncrypt"),AESDecrypt:vi("AESDecrypt"),keyStore:vi("keyStore")};const li=hi;function di(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var pi=null;function bi(){if(null===pi){let e=di();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),pi=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return pi}function yi(){let e=di();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function mi(){let e=bi(),t=yi(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=di();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var gi="__INTENTIONAL_UNDEFINED__";let _i={};function vi(e){let t=mi();if(void 0===t[e])return function(e){switch(e){case"elliptic":return cn();case"AES":return bn();case"encUTF8":return mn();case"sha256":return y;case"encodeAddressRep":return it;case"bip39":return ki(hn);case"hdkey":return dn();case"ellipticEc":return ei;case"padLeft":return tt;case"getAddressFromPubKey":return ni;case"_getWallet":return ii;case"Transaction":return Pt;case"getSignature":return oi;case"sign":return ci;case"signTransaction":return ui;case"createNewWallet":return ai;case"getWalletByMnemonic":return si;case"getWalletByPrivateKey":return fi;case"AESEncrypt":return ti;case"AESDecrypt":return ri;case"keyStore":return ki(o)}}(e);var r=t[e];return r===gi?void 0:r}function wi(e,t){let r=mi();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Ei(e)}))}):(r[e]=void 0===t?gi:t,function(){Ei(e)})}function Ei(e){let t=mi();delete t[e],0==Object.keys(t).length&&delete yi()[bi]}function Si(e){let t=mi();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(_i,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",vi),e("__GetDependency__",vi),e("__Rewire__",wi),e("__set__",wi),e("__reset__",Ei),e("__ResetDependency__",Ei),e("__with__",Si)}();let Mi=typeof hi;function Ai(e,t){Object.defineProperty(hi,e,{value:t,enumerable:!1,configurable:!0})}function ki(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};return Object.keys(e).filter((function(e){return"__get__"!==e&&"__set__"!==e&&"__reset__"!==e&&"__with__"!==e&&"__GetDependency__"!==e&&"__Rewire__"!==e&&"__ResetDependency__"!==e&&"__RewireAPI__"!==e})).reduce((function(t,r){return t[r]=e[r],t}),{})}"object"!==Mi&&"function"!==Mi||!Object.isExtensible(hi)||(Ai("__get__",vi),Ai("__GetDependency__",vi),Ai("__Rewire__",wi),Ai("__set__",wi),Ai("__reset__",Ei),Ai("__ResetDependency__",Ei),Ai("__with__",Si),Ai("__RewireAPI__",_i));class Ri{constructor(e,t,r,n){this._chain=e,this._method=t;const{resolvedRequestType:i,resolvedResponseType:o}=t;this._inputType=i,this._outputType=o,this._name=t.name,this._contractAddress=r,this._wallet=n,this.sendTransaction=this.sendTransaction.bind(this),this.unpackPackedInput=this.unpackPackedInput.bind(this),this.packInput=this.packInput.bind(this),this.unpackOutput=this.unpackOutput.bind(this),this.bindMethodToContract=this.bindMethodToContract.bind(this),this.run=this.run.bind(this),this.request=this.request.bind(this),this.callReadOnly=this.callReadOnly.bind(this),this.getSignedTx=this.getSignedTx.bind(this),this.getRawTx=this.getRawTx.bind(this)}packInput(e){if(!e)return null;let t=Pi("transformMapToArray")(this._inputType,e);t=Pi("transform")(this._inputType,t,Pi("INPUT_TRANSFORMERS"));const r=this._inputType.fromObject(t);return this._inputType.encode(r).finish()}unpackPackedInput(e){if(!e)return null;const t=Pi("unpackSpecifiedTypeData")({data:e,dataType:this._inputType});let r=Pi("transform")(this._inputType,t,Pi("OUTPUT_TRANSFORMERS"));return r=Pi("transformArrayToMap")(this._inputType,r),r}unpackOutput(e){if(!e)return null;let t=Pi("unpackSpecifiedTypeData")({data:e,dataType:this._outputType});return t=Pi("transform")(this._outputType,t,Pi("OUTPUT_TRANSFORMERS")),t=Pi("transformArrayToMap")(this._outputType,t),t}packOutput(e){if(!e)return null;let t=Pi("transformMapToArray")(this._outputType,e);t=Pi("transform")(this._outputType,t,Pi("INPUT_TRANSFORMERS"));const r=this._outputType.fromObject(t);return this._outputType.encode(r).finish()}handleTransaction(e,t,r){const n=this.getRawTx(e,t,r);let i=Pi("wallet").signTransaction(n,this._wallet.keyPair);return i=Pi("Transaction").encode(i).finish(),i instanceof Buffer?i.toString("hex"):Pi("uint8ArrayToHex")(i)}prepareParametersAsync(e){const t=e.filter((e=>!Pi("isFunction")(e)&&!Pi("isBoolean")(e?.sync))),r=this.packInput(t[0]);return this._chain.getChainStatus().then((e=>{const{BestChainHeight:t,BestChainHash:n}=e;return this.handleTransaction(t,n,r)}))}prepareParameters(e){const t=e.filter((e=>!Pi("isFunction")(e)&&!Pi("isBoolean")(e.sync))),r=this.packInput(t[0]),{BestChainHeight:n,BestChainHash:i}=this._chain.getChainStatus({sync:!0});return this.handleTransaction(n,i,r)}prepareParametersWithBlockInfo(e){const t=e.filter((e=>!Pi("isFunction")(e)&&!Pi("isBoolean")(e.sync))),r=this.packInput(t[0]),{height:n,hash:i}=t[1];return this.handleTransaction(n,i,r)}sendTransaction(){for(var e=arguments.length,t=new Array(e),r=0;rthis._chain.sendTransaction(e,n.callback)))}callReadOnly(){for(var e=arguments.length,t=new Array(e),r=0;rthis._chain.callReadOnly(e,((e,t)=>{n.callback(e,this.unpackOutput(t))})).then(this.unpackOutput)))}extractArgumentsIntoObject(e){const t={callback:Pi("noop"),isSync:!1};return 0===e.length||(Pi("isFunction")(e[e.length-1])&&(t.callback=e[e.length-1]),e.forEach((e=>{Pi("isBoolean")(e?.sync)&&(t.isSync=e.sync)}))),t}getSignedTx(){for(var e=arguments.length,t=new Array(e),r=0;r!Pi("isFunction")(e)&&!Pi("isBoolean")(e.sync)));if(n[1]){const{height:e,hash:r}=n[1];if(r&&e)return this.prepareParametersWithBlockInfo(t);throw Error("The second param is the height & hash of a block")}return this.prepareParameters(t)}getRawTx(e,t,r){const n=Pi("getTransaction")(this._wallet.address,this._contractAddress,this._name,r);n.refBlockNumber=e;const i=t.match(/^0x/)?t.substring(2):t;return n.refBlockPrefix=Buffer.from(i,"hex").slice(0,4),n}request(){for(var e=arguments.length,t=new Array(e),r=0;r{const t=Ji("protobuf").Root.fromDescriptor(e,"proto3").resolveAll();return e.file.filter((e=>e.service.length>0)).map((e=>{const r=e.service[0].name,n=e.package?`${e.package}.${r}`:r;return t.lookupService(n)}))};class Gi{constructor(e,t,r){this._chain=e,this.address=r,this.services=t}deserializeLog(){let e=arguments.length>1?arguments[1]:void 0;const t=(arguments.length>0&&void 0!==arguments[0]?arguments[0]:[]).filter((t=>t.Address===this.address&&e===t.Name));return 0===t.length?[]:t.map((e=>{const{Name:t,NonIndexed:r,Indexed:n}=e;let i;for(const e of this.services)try{i=e.lookupType(t);break}catch(e){}const o=[...n||[]];r&&o.push(r);let a=o.reduce(((e,t)=>{let r=i.decode(Buffer.from(t,"base64"));return r=i.toObject(r,{enums:String,longs:String,bytes:String,defaults:!1,arrays:!0,objects:!0,oneofs:!0}),{...e,...r}}),{});return a=Ji("transform")(i,a,Ji("OUTPUT_TRANSFORMERS")),a=Ji("transformArrayToMap")(i,a),a}))}}class zi{constructor(e,t,r){this.chain=e,this.services=Ji("getServicesFromFileDescriptors")(t),this.wallet=r}static bindMethodsToContract(e,t){e.services.forEach((r=>{Object.keys(r.methods).forEach((n=>{const i=r.methods[n].resolve();new(Ji("ContractMethod"))(e._chain,i,e.address,t).bindMethodToContract(e)}))}))}at(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:Ji("noop");const r=new(Ji("Contract"))(this.chain,this.services,e);return Ji("ContractFactory").bindMethodsToContract(r,this.wallet),t(null,r),r}}function $i(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var Wi=null;function Hi(){if(null===Wi){let e=$i();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),Wi=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return Wi}function Ki(){let e=$i();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function Vi(){let e=Hi(),t=Ki(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=$i();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Yi="__INTENTIONAL_UNDEFINED__";let Xi={};function Ji(e){let t=Vi();if(void 0===t[e])return function(e){switch(e){case"protobuf":return function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};return Object.keys(e).filter((function(e){return"__get__"!==e&&"__set__"!==e&&"__reset__"!==e&&"__with__"!==e&&"__GetDependency__"!==e&&"__Rewire__"!==e&&"__ResetDependency__"!==e&&"__RewireAPI__"!==e})).reduce((function(t,r){return t[r]=e[r],t}),{})}(a);case"transform":return je;case"OUTPUT_TRANSFORMERS":return Ce;case"transformArrayToMap":return Pe;case"getServicesFromFileDescriptors":return Fi;case"ContractMethod":return Ri;case"noop":return mt;case"Contract":return Gi;case"ContractFactory":return zi}}(e);var r=t[e];return r===Yi?void 0:r}function Zi(e,t){let r=Vi();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Qi(e)}))}):(r[e]=void 0===t?Yi:t,function(){Qi(e)})}function Qi(e){let t=Vi();delete t[e],0==Object.keys(t).length&&delete Ki()[Hi]}function eo(e){let t=Vi();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(Xi,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",Ji),e("__GetDependency__",Ji),e("__Rewire__",Zi),e("__set__",Zi),e("__reset__",Qi),e("__ResetDependency__",Qi),e("__with__",eo)}();let to=typeof zi;function ro(e,t){Object.defineProperty(zi,e,{value:t,enumerable:!1,configurable:!0})}"object"!==to&&"function"!==to||!Object.isExtensible(zi)||(ro("__get__",Ji),ro("__GetDependency__",Ji),ro("__Rewire__",Zi),ro("__set__",Zi),ro("__reset__",Qi),ro("__ResetDependency__",Qi),ro("__with__",eo),ro("__RewireAPI__",Xi));class no{constructor(e){Object.keys(ho("CHAIN_METHODS")).forEach((t=>{const r=ho("CHAIN_METHODS")[t],{name:n}=r,i=new(ho("ChainMethod"))(r);i.setRequestManager(e),ho("setPath")(this,n,i.run)}))}extractArgumentsIntoObject(e){const t={callback:ho("noop"),isSync:!1};return 0===e.length||(ho("isFunction")(e[e.length-1])&&(t.callback=e[e.length-1]),e.forEach((e=>{ho("isBoolean")(e?.sync)&&(t.isSync=e.sync)}))),t}contractAt(e,t){for(var r=arguments.length,n=new Array(r>2?r-2:0),i=2;i0)return new(ho("ContractFactory"))(this,r,t).at(e);throw new Error("no such contract")}return this.getContractFileDescriptorSet(e).then((r=>{if(r&&r.file&&r.file.length>0){const n=new(ho("ContractFactory"))(this,r,t).at(e);return o(null,n),n}if(o(new Error("no such contract")),0===o.length)throw new Error("no such contract")}))}getMerklePath(e,t){for(var r=arguments.length,n=new Array(r>2?r-2:0),i=2;it===e));if(-1===a)throw new Error(`txId ${e} has no correspond transaction in the block with height ${t}`);const s=this.getTxResults(n,0,o.length,{sync:!0}).map(((e,t)=>{const r=o[t],n=e.Status,i=Buffer.concat([Buffer.from(r.replace("0x",""),"hex"),Buffer.from(n,"utf8")]);return ho("merkleTree").node(i)}));return ho("merkleTree").getMerklePath(a,s)}return this.getBlockByHeight(t,!0).then((r=>{const{BlockHash:n,Body:i}=r,o=i.Transactions,a=o.findIndex((t=>t===e));if(-1===a)throw new Error(`txId ${e} has no correspond transaction in the block with height ${t}`);return this.getTxResults(n,0,o.length).then((e=>{const t=e.map(((e,t)=>{const r=o[t],n=e.Status,i=Buffer.concat([Buffer.from(r.replace("0x",""),"hex"),Buffer.from(n,"utf8")]);return ho("merkleTree").node(i)}));return ho("merkleTree").getMerklePath(a,t)}))}))}}function io(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var oo=null;function ao(){if(null===oo){let e=io();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),oo=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return oo}function so(){let e=io();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function fo(){let e=ao(),t=so(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=io();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var uo="__INTENTIONAL_UNDEFINED__";let co={};function ho(e){let t=fo();if(void 0===t[e])return function(e){switch(e){case"CHAIN_METHODS":return be;case"ChainMethod":return Ir;case"setPath":return gt;case"noop":return mt;case"isFunction":return st;case"isBoolean":return ut;case"ContractFactory":return zi;case"merkleTree":return function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};return Object.keys(e).filter((function(e){return"__get__"!==e&&"__set__"!==e&&"__reset__"!==e&&"__with__"!==e&&"__GetDependency__"!==e&&"__Rewire__"!==e&&"__ResetDependency__"!==e&&"__RewireAPI__"!==e})).reduce((function(t,r){return t[r]=e[r],t}),{})}(i)}}(e);var r=t[e];return r===uo?void 0:r}function lo(e,t){let r=fo();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){po(e)}))}):(r[e]=void 0===t?uo:t,function(){po(e)})}function po(e){let t=fo();delete t[e],0==Object.keys(t).length&&delete so()[ao]}function bo(e){let t=fo();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(co,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",ho),e("__GetDependency__",ho),e("__Rewire__",lo),e("__set__",lo),e("__reset__",po),e("__ResetDependency__",po),e("__with__",bo)}();let yo=typeof no;function mo(e,t){Object.defineProperty(no,e,{value:t,enumerable:!1,configurable:!0})}"object"!==yo&&"function"!==yo||!Object.isExtensible(no)||(mo("__get__",ho),mo("__GetDependency__",ho),mo("__Rewire__",lo),mo("__set__",lo),mo("__reset__",po),mo("__ResetDependency__",po),mo("__with__",bo),mo("__RewireAPI__",co));class go{constructor(e){this.provider=e}static prepareRequest(e){let{requestMethod:t,method:r,params:n={}}=e;return{method:t.toUpperCase(),url:r,params:n}}setProvider(e){this.provider=e}send(e){if(!this.provider)return null;const t=ko("RequestManager").prepareRequest(e);return this.provider.send(t)}sendAsync(e){if(!this.provider)return null;const t=ko("RequestManager").prepareRequest(e);return this.provider.sendAsync(t)}}function _o(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var vo=null;function wo(){if(null===vo){let e=_o();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),vo=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return vo}function Eo(){let e=_o();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function So(){let e=wo(),t=Eo(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=_o();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Mo="__INTENTIONAL_UNDEFINED__";let Ao={};function ko(e){let t=So();if(void 0===t[e])return function(e){if("RequestManager"===e)return go}(e);var r=t[e];return r===Mo?void 0:r}function Ro(e,t){let r=So();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Oo(e)}))}):(r[e]=void 0===t?Mo:t,function(){Oo(e)})}function Oo(e){let t=So();delete t[e],0==Object.keys(t).length&&delete Eo()[wo]}function To(e){let t=So();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(Ao,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",ko),e("__GetDependency__",ko),e("__Rewire__",Ro),e("__set__",Ro),e("__reset__",Oo),e("__ResetDependency__",Oo),e("__with__",To)}();let Io=typeof go;function xo(e,t){Object.defineProperty(go,e,{value:t,enumerable:!1,configurable:!0})}"object"!==Io&&"function"!==Io||!Object.isExtensible(go)||(xo("__get__",ko),xo("__GetDependency__",ko),xo("__Rewire__",Ro),xo("__set__",Ro),xo("__reset__",Oo),xo("__ResetDependency__",Oo),xo("__with__",To),xo("__RewireAPI__",Ao));var Bo=__webpack_require__(149);const jo={Accept:"text/plain;v=1.0","Content-Type":"application/json"};let Lo={},Po=!1;{const e="object"==typeof self?self:{},t="object"==typeof window?window:e;void 0!==t.XMLHttpRequest?(Wo("RequestLibrary",t.XMLHttpRequest),Wo("isFetch",!1)):void 0!==t.fetch&&(Wo("RequestLibrary",t.fetch),Wo("isFetch",!0))}class No{constructor(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"http://localhost:8545",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:8e3,r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:$o("defaultHeaders");this.host=e.replace(/\/$/,""),this.timeout=t,this.headers={},Array.isArray(r)?(r.forEach((e=>{let{name:t,value:r}=e;this.headers[t]=r})),this.headers={...$o("defaultHeaders"),...this.headers}):this.headers={...$o("defaultHeaders"),...r}}static formatResponse(e){let t;try{t=JSON.parse(e)}catch(r){t=e}return t}static formatResponseText(e){let t;try{const r=e;t={status:r.status,error:200===r.status?0:r.status,Error:{message:e.statusText},statusText:e.statusText}}catch(r){t=e}return t}static timeoutPromise(e){return new Promise((t=>{const r=setTimeout((()=>{clearTimeout(r),t({type:"timeout"})}),e)}))}requestSendByFetch(e,t){const{url:r,method:n="POST",params:i={},signal:o}=e,a=`/api/${r}`.replace(/\/\//g,"/");let s=`${this.host}${a}`.replace();const f=new Headers;let u=JSON.stringify(i);return"GET"!==n.toUpperCase()&&"DELETE"!==n.toUpperCase()||(s=Object.keys(i).length>0?`${s}?${$o("stringify")(i)}`:s,u=void 0),Object.keys(this.headers).forEach((e=>{f.append(e,this.headers[e])})),t(s,{method:n.toUpperCase(),headers:f,body:u,signal:o})}sendAsyncByFetch(e){const t=$o("RequestLibrary"),{timeout:r}=this,n="function"==typeof AbortController?new AbortController:{},i={...e,signal:n.signal,credentials:"omit"};return Promise.race([this.requestSendByFetch(i,t),$o("HttpProvider").timeoutPromise(r)]).then((e=>new Promise(((t,r)=>{try{"timeout"===e.type?(n.abort&&n.abort(),r(e)):e.text().then((n=>{const i=$o("HttpProvider").formatResponse(n);200===e.status&&e.ok?t(i):r(i)})).catch((e=>r(e)))}catch(e){r(e)}}))))}requestSend(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];const{url:n,method:i="POST",params:o={}}=e,a=`/api/${n}`.replace(/\/\//g,"/");let s=`${this.host}${a}`.replace();"GET"!==i.toUpperCase()&&"DELETE"!==i.toUpperCase()||(s=Object.keys(o).length>0?`${s}?${$o("stringify")(o)}`:s),t.open(i.toUpperCase(),s,r),Object.keys(this.headers).forEach((e=>{t.setRequestHeader(e,this.headers[e])})),"GET"===i.toUpperCase()||"DELETE"===i.toUpperCase()?t.send():t.send(JSON.stringify(o))}send(e){if($o("isFetch"))throw new Error("Can not get XMLHttpRequest, invalid parameter: 'sync'");const t=new($o("RequestLibrary"));t.withCredentials=!1,this.requestSend(e,t);let r=t.responseText;if(r=$o("HttpProvider").formatResponse(r),r.Error)throw r;return r}sendAsync(e){return $o("isFetch")?this.sendAsyncByFetch(e):this.sendAsyncByXMLHttp(e)}sendAsyncByXMLHttp(e){const t=new($o("RequestLibrary"));return t.withCredentials=!1,t.timeout=this.timeout,this.requestSend(e,t,!0),new Promise(((e,r)=>{t.onreadystatechange=()=>{if(4===t.readyState&&1!==t.timeout){let n=t.responseText;try{n=$o("HttpProvider").formatResponse(n),200!==t.status||n.Error?r(n):e(n)}catch(e){r(e)}}},t.onerror=e=>{r(e)},t.ontimeout=e=>{r(e)}}))}isConnected(){try{return this.send({method:"GET",url:"blockChain/chainStatus"}),!0}catch(e){return!1}}async isConnectedAsync(){try{return await this.sendAsyncByFetch({method:"GET",url:"blockChain/chainStatus"})}catch(e){return!1}}}function Do(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}var Co=null;function Uo(){if(null===Co){let e=Do();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),Co=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return Co}function qo(){let e=Do();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function Fo(){let e=Uo(),t=qo(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=Do();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var Go="__INTENTIONAL_UNDEFINED__";let zo={};function $o(e){let t=Fo();if(void 0===t[e])return function(e){switch(e){case"RequestLibrary":return Lo;case"isFetch":return Po;case"defaultHeaders":return jo;case"stringify":return Bo.stringify;case"HttpProvider":return No}}(e);var r=t[e];return r===Go?void 0:r}function Wo(e,t){let r=Fo();return void 0===r[e]?function(e,t){switch(e){case"RequestLibrary":return Lo=t;case"isFetch":return Po=t}}(e,t):r[e]=t}function Ho(e,t){let r=Fo();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){Ko(e)}))}):(r[e]=void 0===t?Go:t,function(){Ko(e)})}function Ko(e){let t=Fo();delete t[e],0==Object.keys(t).length&&delete qo()[Uo]}function Vo(e){let t=Fo();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(zo,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",$o),e("__GetDependency__",$o),e("__Rewire__",Ho),e("__set__",Ho),e("__reset__",Ko),e("__ResetDependency__",Ko),e("__with__",Vo)}();let Yo=typeof No;function Xo(e,t){Object.defineProperty(No,e,{value:t,enumerable:!1,configurable:!0})}"object"!==Yo&&"function"!==Yo||!Object.isExtensible(No)||(Xo("__get__",$o),Xo("__GetDependency__",$o),Xo("__Rewire__",Ho),Xo("__set__",Ho),Xo("__reset__",Ko),Xo("__ResetDependency__",Ko),Xo("__with__",Vo),Xo("__RewireAPI__",zo));class Jo{constructor(){this.defaultAccount=void 0}}function Zo(e,t,r){return(t=function(e){var t=function(e,t){if("object"!=typeof e||null===e)return e;var r=e[Symbol.toPrimitive];if(void 0!==r){var n=r.call(e,"string");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(e);return"symbol"==typeof t?t:String(t)}(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}class Qo{constructor(e){Zo(this,"providers",{HttpProvider:sa("HttpProvider")}),Zo(this,"settings",new(sa("Settings"))),Zo(this,"version",{api:"3.2.45-beta.1"}),this._requestManager=new(sa("RequestManager"))(e),this.currentProvider=e,this.chain=new(sa("Chain"))(this._requestManager)}isConnected(){return this.currentProvider&&this.currentProvider.isConnected()}setProvider(e){this._requestManager.setProvider(e),this.currentProvider=e}}function ea(){try{if(__webpack_require__.g)return __webpack_require__.g}catch(e){try{if(window)return window}catch(e){return this}}}Zo(sa("AElf"),"version","3.2.45-beta.1"),Zo(sa("AElf"),"providers",{HttpProvider:sa("HttpProvider")}),Zo(sa("AElf"),"pbjs",sa("protobuf")),Zo(sa("AElf"),"pbUtils",sa("proto")),Zo(sa("AElf"),"wallet",sa("wallet")),Zo(sa("AElf"),"utils",{...sa("utils"),...sa("bloom"),sha256:sa("sha256"),transform:sa("transform")});var ta=null;function ra(){if(null===ta){let e=ea();e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__||(e.__$$GLOBAL_REWIRE_NEXT_MODULE_ID__=0),ta=__$$GLOBAL_REWIRE_NEXT_MODULE_ID__++}return ta}function na(){let e=ea();return e.__$$GLOBAL_REWIRE_REGISTRY__||(e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)),e.__$$GLOBAL_REWIRE_REGISTRY__}function ia(){let e=ra(),t=na(),r=t[e];return r||(t[e]=Object.create(null),r=t[e]),r}!function(){let e=ea();e.__rewire_reset_all__||(e.__rewire_reset_all__=function(){e.__$$GLOBAL_REWIRE_REGISTRY__=Object.create(null)})}();var oa="__INTENTIONAL_UNDEFINED__";let aa={};function sa(i){let o=ia();if(void 0===o[i])return function(i){switch(i){case"RequestManager":return go;case"Chain":return no;case"HttpProvider":return No;case"protobuf":return da(a);case"proto":return da(r);case"wallet":return li;case"utils":return da(t);case"bloom":return da(n);case"sha256":return y;case"transform":return da(e);case"Settings":return Jo;case"AElf":return Qo}}(i);var s=o[i];return s===oa?void 0:s}function fa(e,t){let r=ia();return"object"==typeof e?(Object.keys(e).forEach((function(t){r[t]=e[t]})),function(){Object.keys(e).forEach((function(t){ua(e)}))}):(r[e]=void 0===t?oa:t,function(){ua(e)})}function ua(e){let t=ia();delete t[e],0==Object.keys(t).length&&delete na()[ra]}function ca(e){let t=ia();var r=Object.keys(e),n={};function i(){r.forEach((function(e){t[e]=n[e]}))}return function(o){r.forEach((function(r){n[r]=t[r],t[r]=e[r]}));let a=o();return a&&"function"==typeof a.then?a.then(i).catch(i):i(),a}}!function(){function e(e,t){Object.defineProperty(aa,e,{value:t,enumerable:!1,configurable:!0})}e("__get__",sa),e("__GetDependency__",sa),e("__Rewire__",fa),e("__set__",fa),e("__reset__",ua),e("__ResetDependency__",ua),e("__with__",ca)}();let ha=typeof Qo;function la(e,t){Object.defineProperty(Qo,e,{value:t,enumerable:!1,configurable:!0})}function da(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};return Object.keys(e).filter((function(e){return"__get__"!==e&&"__set__"!==e&&"__reset__"!==e&&"__with__"!==e&&"__GetDependency__"!==e&&"__Rewire__"!==e&&"__ResetDependency__"!==e&&"__RewireAPI__"!==e})).reduce((function(t,r){return t[r]=e[r],t}),{})}"object"!==ha&&"function"!==ha||!Object.isExtensible(Qo)||(la("__get__",sa),la("__GetDependency__",sa),la("__Rewire__",fa),la("__set__",fa),la("__reset__",ua),la("__ResetDependency__",ua),la("__with__",ca),la("__RewireAPI__",aa))})(),__webpack_exports__=__webpack_exports__.default,__webpack_exports__})())); -//# sourceMappingURL=aelf.umd.js.map \ No newline at end of file diff --git a/dist/aelf.umd.js.map b/dist/aelf.umd.js.map deleted file mode 100644 index 0721bab8..00000000 --- a/dist/aelf.umd.js.map +++ /dev/null @@ -1 +0,0 @@ -{"version":3,"file":"aelf.umd.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,OAAQ,GAAIH,GACO,iBAAZC,QACdA,QAAc,KAAID,IAElBD,EAAW,KAAIC,GAChB,CATD,CASGK,YAAY,IACf,mCCV6B,mBAAlBC,OAAOC,OAEhBL,EAAOD,QAAU,SAAkBO,EAAMC,GACnCA,IACFD,EAAKE,OAASD,EACdD,EAAKG,UAAYL,OAAOC,OAAOE,EAAUE,UAAW,CAClDC,YAAa,CACXC,MAAOL,EACPM,YAAY,EACZC,UAAU,EACVC,cAAc,KAItB,EAGAd,EAAOD,QAAU,SAAkBO,EAAMC,GACvC,GAAIA,EAAW,CACbD,EAAKE,OAASD,EACd,IAAIQ,EAAW,WAAa,EAC5BA,EAASN,UAAYF,EAAUE,UAC/BH,EAAKG,UAAY,IAAIM,EACrBT,EAAKG,UAAUC,YAAcJ,CAC/B,CACF,aCvBF,IAAIU,EAAS,EAAQ,GACjBC,EAASD,EAAOC,OAGpB,SAASC,EAAWC,EAAKC,GACvB,IAAK,IAAIC,KAAOF,EACdC,EAAIC,GAAOF,EAAIE,EAEnB,CASA,SAASC,EAAYC,EAAKC,EAAkBC,GAC1C,OAAOR,EAAOM,EAAKC,EAAkBC,EACvC,CAVIR,EAAOS,MAAQT,EAAOU,OAASV,EAAOW,aAAeX,EAAOY,gBAC9D7B,EAAOD,QAAUiB,GAGjBE,EAAUF,EAAQjB,GAClBA,EAAQkB,OAASK,GAOnBA,EAAWb,UAAYL,OAAOC,OAAOY,EAAOR,WAG5CS,EAAUD,EAAQK,GAElBA,EAAWI,KAAO,SAAUH,EAAKC,EAAkBC,GACjD,GAAmB,iBAARF,EACT,MAAM,IAAIO,UAAU,iCAEtB,OAAOb,EAAOM,EAAKC,EAAkBC,EACvC,EAEAH,EAAWK,MAAQ,SAAUI,EAAMC,EAAMC,GACvC,GAAoB,iBAATF,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAII,EAAMjB,EAAOc,GAUjB,YATaI,IAATH,EACsB,iBAAbC,EACTC,EAAIF,KAAKA,EAAMC,GAEfC,EAAIF,KAAKA,GAGXE,EAAIF,KAAK,GAEJE,CACT,EAEAZ,EAAWM,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOb,EAAOc,EAChB,EAEAT,EAAWO,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOd,EAAOoB,WAAWL,EAC3B,oBChEA,SAAW/B,EAAQD,GACjB,aAGA,SAASsC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,mBACnC,CAIA,SAASE,EAAUnC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIQ,EAAW,WAAa,EAC5BA,EAASN,UAAYF,EAAUE,UAC/BH,EAAKG,UAAY,IAAIM,EACrBT,EAAKG,UAAUC,YAAcJ,CAC/B,CAIA,SAASoC,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKtB,OAAS,EAGdsB,KAAKG,IAAM,KAEI,OAAXP,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKI,MAAMR,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAElD,CAUA,IAAI5B,EATkB,iBAAXjB,EACTA,EAAOD,QAAU2C,EAEjB3C,EAAQ2C,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGU,SAAW,GAGd,IAEInC,EADoB,oBAAXoC,aAAmD,IAAlBA,OAAOpC,OACxCoC,OAAOpC,OAEP,aAEb,CAAE,MAAOqC,GACT,CA+HA,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,EAEtB,CAEA,SAASE,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,CACT,CA6CA,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAGnC,IAFA,IAAIL,EAAI,EACJM,EAAMC,KAAKC,IAAIN,EAAIvC,OAAQyC,GACtBK,EAAIN,EAAOM,EAAIH,EAAKG,IAAK,CAChC,IAAIb,EAAIM,EAAIL,WAAWY,GAAK,GAE5BT,GAAKK,EAIHL,GADEJ,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,CAET,CACA,OAAOI,CACT,CApNApB,EAAGI,KAAO,SAAe0B,GACvB,OAAIA,aAAe9B,GAIJ,OAAR8B,GAA+B,iBAARA,GAC5BA,EAAI9D,YAAY0C,WAAaV,EAAGU,UAAYqB,MAAMC,QAAQF,EAAIvB,MAClE,EAEAP,EAAGiC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAnC,EAAG4B,IAAM,SAAcM,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAnC,EAAGjC,UAAU0C,MAAQ,SAAeR,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAKgC,YAAYpC,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAKiC,WAAWrC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETP,EAAOO,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqB,EAAQ,EACM,OAFlBtB,EAASA,EAAOsC,WAAWC,QAAQ,OAAQ,KAEhC,KACTjB,IACAlB,KAAKC,SAAW,GAGdiB,EAAQtB,EAAOlB,SACJ,KAATmB,EACFG,KAAKoC,UAAUxC,EAAQsB,EAAOpB,IAE9BE,KAAKqC,WAAWzC,EAAQC,EAAMqB,GACf,OAAXpB,GACFE,KAAKiC,WAAWjC,KAAKsC,UAAWzC,EAAMC,IAI9C,EAEAH,EAAGjC,UAAUsE,YAAc,SAAsBpC,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAW,SAATN,GACfI,KAAKtB,OAAS,GACLkB,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKtB,OAAS,IAEdY,EAAOM,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKtB,OAAS,GAGD,OAAXoB,GAGJE,KAAKiC,WAAWjC,KAAKsC,UAAWzC,EAAMC,EACxC,EAEAH,EAAGjC,UAAUuE,WAAa,SAAqBrC,EAAQC,EAAMC,GAG3D,GADAR,EAAgC,iBAAlBM,EAAOlB,QACjBkB,EAAOlB,QAAU,EAGnB,OAFAsB,KAAKE,MAAQ,CAAE,GACfF,KAAKtB,OAAS,EACPsB,KAGTA,KAAKtB,OAAS4C,KAAKiB,KAAK3C,EAAOlB,OAAS,GACxCsB,KAAKE,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/BxB,KAAKE,MAAMsB,GAAK,EAGlB,IAAIgB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAX5C,EACF,IAAK0B,EAAI5B,EAAOlB,OAAS,EAAG8D,EAAI,EAAGhB,GAAK,EAAGA,GAAK,EAC9CiB,EAAI7C,EAAO4B,GAAM5B,EAAO4B,EAAI,IAAM,EAAM5B,EAAO4B,EAAI,IAAM,GACzDxB,KAAKE,MAAMsC,IAAOC,GAAKC,EAAO,SAC9B1C,KAAKE,MAAMsC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAX1C,EACT,IAAK0B,EAAI,EAAGgB,EAAI,EAAGhB,EAAI5B,EAAOlB,OAAQ8C,GAAK,EACzCiB,EAAI7C,EAAO4B,GAAM5B,EAAO4B,EAAI,IAAM,EAAM5B,EAAO4B,EAAI,IAAM,GACzDxB,KAAKE,MAAMsC,IAAOC,GAAKC,EAAO,SAC9B1C,KAAKE,MAAMsC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAOxC,KAAK2C,OACd,EAwBAhD,EAAGjC,UAAU0E,UAAY,SAAoBxC,EAAQsB,EAAOpB,GAE1DE,KAAKtB,OAAS4C,KAAKiB,MAAM3C,EAAOlB,OAASwC,GAAS,GAClDlB,KAAKE,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/BxB,KAAKE,MAAMsB,GAAK,EAIlB,IAGIiB,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAX1C,EACF,IAAK0B,EAAI5B,EAAOlB,OAAS,EAAG8C,GAAKN,EAAOM,GAAK,EAC3CiB,EAAI5B,EAAajB,EAAQsB,EAAOM,IAAMkB,EACtC1C,KAAKE,MAAMsC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLxC,KAAKE,MAAMsC,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKlB,GADa5B,EAAOlB,OAASwC,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOM,EAAI5B,EAAOlB,OAAQ8C,GAAK,EAC1EiB,EAAI5B,EAAajB,EAAQsB,EAAOM,IAAMkB,EACtC1C,KAAKE,MAAMsC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLxC,KAAKE,MAAMsC,IAAMC,IAAM,IAEvBC,GAAO,EAKb1C,KAAK2C,OACP,EA0BAhD,EAAGjC,UAAU2E,WAAa,SAAqBzC,EAAQC,EAAMqB,GAE3DlB,KAAKE,MAAQ,CAAE,GACfF,KAAKtB,OAAS,EAGd,IAAK,IAAIkE,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWhD,EAClE+C,IAEFA,IACAC,EAAWA,EAAUhD,EAAQ,EAO7B,IALA,IAAIiD,EAAQlD,EAAOlB,OAASwC,EACxB6B,EAAMD,EAAQF,EACdzB,EAAMG,KAAKC,IAAIuB,EAAOA,EAAQC,GAAO7B,EAErC8B,EAAO,EACFxB,EAAIN,EAAOM,EAAIL,EAAKK,GAAKoB,EAChCI,EAAOhC,EAAUpB,EAAQ4B,EAAGA,EAAIoB,EAAS/C,GAEzCG,KAAKiD,MAAMJ,GACP7C,KAAKE,MAAM,GAAK8C,EAAO,SACzBhD,KAAKE,MAAM,IAAM8C,EAEjBhD,KAAKkD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOhC,EAAUpB,EAAQ4B,EAAG5B,EAAOlB,OAAQmB,GAEtC2B,EAAI,EAAGA,EAAIuB,EAAKvB,IACnB2B,GAAOtD,EAGTG,KAAKiD,MAAME,GACPnD,KAAKE,MAAM,GAAK8C,EAAO,SACzBhD,KAAKE,MAAM,IAAM8C,EAEjBhD,KAAKkD,OAAOF,EAEhB,CAEAhD,KAAK2C,OACP,EAEAhD,EAAGjC,UAAU0F,KAAO,SAAeC,GACjCA,EAAKnD,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/B6B,EAAKnD,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAE7B6B,EAAK3E,OAASsB,KAAKtB,OACnB2E,EAAKpD,SAAWD,KAAKC,SACrBoD,EAAKlD,IAAMH,KAAKG,GAClB,EAEAR,EAAGjC,UAAU4F,MAAQ,WACnB,IAAIvC,EAAI,IAAIpB,EAAG,MAEf,OADAK,KAAKoD,KAAKrC,GACHA,CACT,EAEApB,EAAGjC,UAAU6F,QAAU,SAAkBvE,GACvC,KAAOgB,KAAKtB,OAASM,GACnBgB,KAAKE,MAAMF,KAAKtB,UAAY,EAE9B,OAAOsB,IACT,EAGAL,EAAGjC,UAAUiF,MAAQ,WACnB,KAAO3C,KAAKtB,OAAS,GAAqC,IAAhCsB,KAAKE,MAAMF,KAAKtB,OAAS,IACjDsB,KAAKtB,SAEP,OAAOsB,KAAKwD,WACd,EAEA7D,EAAGjC,UAAU8F,UAAY,WAKvB,OAHoB,IAAhBxD,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACT,EAEAL,EAAGjC,UAAU+F,QAAU,WACrB,OAAQzD,KAAKG,IAAM,UAAY,SAAWH,KAAKkC,SAAS,IAAM,GAChE,EAgCA,IAAIwB,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAMrC,EAAKsC,GAC9BA,EAAI9D,SAAWwB,EAAIxB,SAAW6D,EAAK7D,SACnC,IAAIoB,EAAOyC,EAAKpF,OAAS+C,EAAI/C,OAAU,EACvCqF,EAAIrF,OAAS2C,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAI2C,EAAoB,EAAhBF,EAAK5D,MAAM,GACf+D,EAAmB,EAAfxC,EAAIvB,MAAM,GACda,EAAIiD,EAAIC,EAERC,EAAS,SAAJnD,EACLoD,EAASpD,EAAI,SAAa,EAC9BgD,EAAI7D,MAAM,GAAKgE,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI/C,EAAK+C,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOjD,KAAKC,IAAI6C,EAAG3C,EAAI/C,OAAS,GAC3B8D,EAAIlB,KAAKM,IAAI,EAAGwC,EAAIN,EAAKpF,OAAS,GAAI8D,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIhB,EAAK4C,EAAI5B,EAAK,EAIlB6B,IADAtD,GAFAiD,EAAoB,EAAhBF,EAAK5D,MAAMsB,KACfyC,EAAmB,EAAfxC,EAAIvB,MAAMsC,IACF8B,GACG,SAAa,EAC5BA,EAAY,SAAJvD,CACV,CACAgD,EAAI7D,MAAMkE,GAAa,EAARE,EACfH,EAAiB,EAATE,CACV,CAOA,OANc,IAAVF,EACFJ,EAAI7D,MAAMkE,GAAa,EAARD,EAEfJ,EAAIrF,SAGCqF,EAAIpB,OACb,CA1lBAhD,EAAGjC,UAAUwE,SAAW,SAAmBrC,EAAM2E,GAI/C,IAAIT,EACJ,GAHAS,EAAoB,EAAVA,GAAe,EAGZ,MAJb3E,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCkE,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNyB,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIiB,EAAIzC,KAAKE,MAAMsB,GACfwB,GAA+B,UAArBP,GAAKC,EAAOyB,IAAmBjC,SAAS,IAGpD6B,EADY,IADdI,EAAS1B,IAAO,GAAKC,EAAQ,WACVlB,IAAMxB,KAAKtB,OAAS,EAC/BgF,EAAM,EAAIV,EAAKtE,QAAUsE,EAAOe,EAEhCf,EAAOe,GAEfrB,GAAO,IACI,KACTA,GAAO,GACPlB,IAEJ,CAIA,IAHc,IAAV2C,IACFJ,EAAMI,EAAMjC,SAAS,IAAM6B,GAEtBA,EAAIrF,OAAS8F,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB/D,KAAKC,WACP8D,EAAM,IAAMA,GAEPA,CACT,CAEA,GAAIlE,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI4E,EAAYd,EAAW9D,GAEvB6E,EAAYd,EAAW/D,GAC3BkE,EAAM,GACN,IAAIpD,EAAIX,KAAKsD,QAEb,IADA3C,EAAEV,SAAW,GACLU,EAAEgE,UAAU,CAClB,IAAI5D,EAAIJ,EAAEiE,KAAKF,GAAWxC,SAASrC,GAMjCkE,GALFpD,EAAIA,EAAEkE,MAAMH,IAELC,SAGC5D,EAAIgD,EAFJL,EAAMe,EAAY1D,EAAErC,QAAUqC,EAAIgD,CAI5C,CAIA,IAHI/D,KAAK2E,WACPZ,EAAM,IAAMA,GAEPA,EAAIrF,OAAS8F,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB/D,KAAKC,WACP8D,EAAM,IAAMA,GAEPA,CACT,CAEAzE,GAAO,EAAO,kCAChB,EAEAK,EAAGjC,UAAUoH,SAAW,WACtB,IAAIC,EAAM/E,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKtB,OACPqG,GAAuB,SAAhB/E,KAAKE,MAAM,GACO,IAAhBF,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,GAEzC6E,GAAO,iBAAoC,SAAhB/E,KAAKE,MAAM,GAC7BF,KAAKtB,OAAS,GACvBY,GAAO,EAAO,8CAEU,IAAlBU,KAAKC,UAAmB8E,EAAMA,CACxC,EAEApF,EAAGjC,UAAUsH,OAAS,WACpB,OAAOhF,KAAKkC,SAAS,GACvB,EAEAvC,EAAGjC,UAAUuH,SAAW,SAAmBnF,EAAQpB,GAEjD,OADAY,OAAyB,IAAXpB,GACP8B,KAAKkF,YAAYhH,EAAQ4B,EAAQpB,EAC1C,EAEAiB,EAAGjC,UAAU4E,QAAU,SAAkBxC,EAAQpB,GAC/C,OAAOsB,KAAKkF,YAAYxD,MAAO5B,EAAQpB,EACzC,EAEAiB,EAAGjC,UAAUwH,YAAc,SAAsBC,EAAWrF,EAAQpB,GAClE,IAAI0G,EAAapF,KAAKoF,aAClBC,EAAY3G,GAAU4C,KAAKM,IAAI,EAAGwD,GACtC9F,EAAO8F,GAAcC,EAAW,yCAChC/F,EAAO+F,EAAY,EAAG,+BAEtBrF,KAAK2C,QACL,IAGIsB,EAAGzC,EAHH8D,EAA0B,OAAXxF,EACfyF,EAAM,IAAIJ,EAAUE,GAGpBG,EAAIxF,KAAKsD,QACb,GAAKgC,EAYE,CACL,IAAK9D,EAAI,GAAIgE,EAAEb,SAAUnD,IACvByC,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAI/D,GAAKyC,EAGX,KAAOzC,EAAI6D,EAAW7D,IACpB+D,EAAI/D,GAAK,CAEb,KAvBmB,CAEjB,IAAKA,EAAI,EAAGA,EAAI6D,EAAYD,EAAY5D,IACtC+D,EAAI/D,GAAK,EAGX,IAAKA,EAAI,GAAIgE,EAAEb,SAAUnD,IACvByC,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIF,EAAY7D,EAAI,GAAKyC,CAE7B,CAaA,OAAOsB,CACT,EAEIjE,KAAKqE,MACPhG,EAAGjC,UAAUkI,WAAa,SAAqBnD,GAC7C,OAAO,GAAKnB,KAAKqE,MAAMlD,EACzB,EAEA9C,EAAGjC,UAAUkI,WAAa,SAAqBnD,GAC7C,IAAIoD,EAAIpD,EACJ1B,EAAI,EAiBR,OAhBI8E,GAAK,OACP9E,GAAK,GACL8E,KAAO,IAELA,GAAK,KACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAEF9E,EAAI8E,CACb,EAGFlG,EAAGjC,UAAUoI,UAAY,SAAoBrD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIoD,EAAIpD,EACJ1B,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ8E,KACH9E,GAAK,GACL8E,KAAO,IAEU,IAAV,IAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,GAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,IACH9E,IAEKA,CACT,EAGApB,EAAGjC,UAAUqI,UAAY,WACvB,IAAItD,EAAIzC,KAAKE,MAAMF,KAAKtB,OAAS,GAC7BsH,EAAKhG,KAAK4F,WAAWnD,GACzB,OAA2B,IAAnBzC,KAAKtB,OAAS,GAAUsH,CAClC,EAgBArG,EAAGjC,UAAUuI,SAAW,WACtB,GAAIjG,KAAK2E,SAAU,OAAO,EAG1B,IADA,IAAI5D,EAAI,EACCS,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIyC,EAAIjE,KAAK8F,UAAU9F,KAAKE,MAAMsB,IAElC,GADAT,GAAKkD,EACK,KAANA,EAAU,KAChB,CACA,OAAOlD,CACT,EAEApB,EAAGjC,UAAU0H,WAAa,WACxB,OAAO9D,KAAKiB,KAAKvC,KAAK+F,YAAc,EACtC,EAEApG,EAAGjC,UAAUwI,OAAS,SAAiBC,GACrC,OAAsB,IAAlBnG,KAAKC,SACAD,KAAKoG,MAAMC,MAAMF,GAAOG,MAAM,GAEhCtG,KAAKsD,OACd,EAEA3D,EAAGjC,UAAU6I,SAAW,SAAmBJ,GACzC,OAAInG,KAAKwG,MAAML,EAAQ,GACdnG,KAAKyG,KAAKN,GAAOG,MAAM,GAAGI,OAE5B1G,KAAKsD,OACd,EAEA3D,EAAGjC,UAAUiJ,MAAQ,WACnB,OAAyB,IAAlB3G,KAAKC,QACd,EAGAN,EAAGjC,UAAUkJ,IAAM,WACjB,OAAO5G,KAAKsD,QAAQoD,MACtB,EAEA/G,EAAGjC,UAAUgJ,KAAO,WAKlB,OAJK1G,KAAK2E,WACR3E,KAAKC,UAAY,GAGZD,IACT,EAGAL,EAAGjC,UAAUmJ,KAAO,SAAepF,GACjC,KAAOzB,KAAKtB,OAAS+C,EAAI/C,QACvBsB,KAAKE,MAAMF,KAAKtB,UAAY,EAG9B,IAAK,IAAI8C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAC9BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAAKC,EAAIvB,MAAMsB,GAG5C,OAAOxB,KAAK2C,OACd,EAEAhD,EAAGjC,UAAUoJ,IAAM,SAAcrF,GAE/B,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAK6G,KAAKpF,EACnB,EAGA9B,EAAGjC,UAAUqJ,GAAK,SAAatF,GAC7B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQwD,IAAIrF,GAC/CA,EAAI6B,QAAQwD,IAAI9G,KACzB,EAEAL,EAAGjC,UAAUsJ,IAAM,SAAcvF,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQuD,KAAKpF,GAChDA,EAAI6B,QAAQuD,KAAK7G,KAC1B,EAGAL,EAAGjC,UAAUuJ,MAAQ,SAAgBxF,GAEnC,IAAIwC,EAEFA,EADEjE,KAAKtB,OAAS+C,EAAI/C,OAChB+C,EAEAzB,KAGN,IAAK,IAAIwB,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAAKC,EAAIvB,MAAMsB,GAK5C,OAFAxB,KAAKtB,OAASuF,EAAEvF,OAETsB,KAAK2C,OACd,EAEAhD,EAAGjC,UAAUwJ,KAAO,SAAezF,GAEjC,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAKiH,MAAMxF,EACpB,EAGA9B,EAAGjC,UAAUyJ,IAAM,SAAc1F,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ4D,KAAKzF,GAChDA,EAAI6B,QAAQ4D,KAAKlH,KAC1B,EAEAL,EAAGjC,UAAU0J,KAAO,SAAe3F,GACjC,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ2D,MAAMxF,GACjDA,EAAI6B,QAAQ2D,MAAMjH,KAC3B,EAGAL,EAAGjC,UAAU2J,MAAQ,SAAgB5F,GAEnC,IAAIuC,EACAC,EACAjE,KAAKtB,OAAS+C,EAAI/C,QACpBsF,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAGN,IAAK,IAAIwB,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAAKyC,EAAE/D,MAAMsB,GAGvC,GAAIxB,OAASgE,EACX,KAAOxC,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAM5B,OAFAxB,KAAKtB,OAASsF,EAAEtF,OAETsB,KAAK2C,OACd,EAEAhD,EAAGjC,UAAU4J,KAAO,SAAe7F,GAEjC,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAKqH,MAAM5F,EACpB,EAGA9B,EAAGjC,UAAU6J,IAAM,SAAc9F,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQgE,KAAK7F,GAChDA,EAAI6B,QAAQgE,KAAKtH,KAC1B,EAEAL,EAAGjC,UAAU8J,KAAO,SAAe/F,GACjC,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ+D,MAAM5F,GACjDA,EAAI6B,QAAQ+D,MAAMrH,KAC3B,EAGAL,EAAGjC,UAAU2I,MAAQ,SAAgBF,GACnC7G,EAAwB,iBAAV6G,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBnG,KAAKiB,KAAK4D,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBnG,KAAKuD,QAAQkE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIjG,EAAI,EAAGA,EAAIiG,EAAajG,IAC/BxB,KAAKE,MAAMsB,GAAsB,UAAhBxB,KAAKE,MAAMsB,GAS9B,OALIkG,EAAW,IACb1H,KAAKE,MAAMsB,IAAMxB,KAAKE,MAAMsB,GAAM,UAAc,GAAKkG,GAIhD1H,KAAK2C,OACd,EAEAhD,EAAGjC,UAAU+I,KAAO,SAAeN,GACjC,OAAOnG,KAAKsD,QAAQ+C,MAAMF,EAC5B,EAGAxG,EAAGjC,UAAUiK,KAAO,SAAeC,EAAKrI,GACtCD,EAAsB,iBAARsI,GAAoBA,GAAO,GAEzC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA5H,KAAKuD,QAAQb,EAAM,GAGjB1C,KAAKE,MAAMwC,GADTnD,EACgBS,KAAKE,MAAMwC,GAAQ,GAAKmF,EAExB7H,KAAKE,MAAMwC,KAAS,GAAKmF,GAGtC7H,KAAK2C,OACd,EAGAhD,EAAGjC,UAAUoK,KAAO,SAAerG,GACjC,IAAIV,EAkBAiD,EAAGC,EAfP,GAAsB,IAAlBjE,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAI7B,OAHAD,KAAKC,SAAW,EAChBc,EAAIf,KAAK+H,KAAKtG,GACdzB,KAAKC,UAAY,EACVD,KAAKwD,YAGP,GAAsB,IAAlBxD,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAIpC,OAHAwB,EAAIxB,SAAW,EACfc,EAAIf,KAAK+H,KAAKtG,GACdA,EAAIxB,SAAW,EACRc,EAAEyC,YAKPxD,KAAKtB,OAAS+C,EAAI/C,QACpBsF,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAIN,IADA,IAAImE,EAAQ,EACH3C,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BT,GAAkB,EAAbiD,EAAE9D,MAAMsB,KAAwB,EAAbyC,EAAE/D,MAAMsB,IAAU2C,EAC1CnE,KAAKE,MAAMsB,GAAS,SAAJT,EAChBoD,EAAQpD,IAAM,GAEhB,KAAiB,IAAVoD,GAAe3C,EAAIwC,EAAEtF,OAAQ8C,IAClCT,GAAkB,EAAbiD,EAAE9D,MAAMsB,IAAU2C,EACvBnE,KAAKE,MAAMsB,GAAS,SAAJT,EAChBoD,EAAQpD,IAAM,GAIhB,GADAf,KAAKtB,OAASsF,EAAEtF,OACF,IAAVyF,EACFnE,KAAKE,MAAMF,KAAKtB,QAAUyF,EAC1BnE,KAAKtB,cAEA,GAAIsF,IAAMhE,KACf,KAAOwB,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAI5B,OAAOxB,IACT,EAGAL,EAAGjC,UAAUsK,IAAM,SAAcvG,GAC/B,IAAI8D,EACJ,OAAqB,IAAjB9D,EAAIxB,UAAoC,IAAlBD,KAAKC,UAC7BwB,EAAIxB,SAAW,EACfsF,EAAMvF,KAAKiI,IAAIxG,GACfA,EAAIxB,UAAY,EACTsF,GACmB,IAAjB9D,EAAIxB,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChBsF,EAAM9D,EAAIwG,IAAIjI,MACdA,KAAKC,SAAW,EACTsF,GAGLvF,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQwE,KAAKrG,GAEhDA,EAAI6B,QAAQwE,KAAK9H,KAC1B,EAGAL,EAAGjC,UAAUqK,KAAO,SAAetG,GAEjC,GAAqB,IAAjBA,EAAIxB,SAAgB,CACtBwB,EAAIxB,SAAW,EACf,IAAIc,EAAIf,KAAK8H,KAAKrG,GAElB,OADAA,EAAIxB,SAAW,EACRc,EAAEyC,WAGX,CAAO,GAAsB,IAAlBxD,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAK8H,KAAKrG,GACVzB,KAAKC,SAAW,EACTD,KAAKwD,YAId,IAWIQ,EAAGC,EAXHlC,EAAM/B,KAAK+B,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHA/B,KAAKC,SAAW,EAChBD,KAAKtB,OAAS,EACdsB,KAAKE,MAAM,GAAK,EACTF,KAKL+B,EAAM,GACRiC,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAIN,IADA,IAAImE,EAAQ,EACH3C,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAE5B2C,GADApD,GAAkB,EAAbiD,EAAE9D,MAAMsB,KAAwB,EAAbyC,EAAE/D,MAAMsB,IAAU2C,IAC7B,GACbnE,KAAKE,MAAMsB,GAAS,SAAJT,EAElB,KAAiB,IAAVoD,GAAe3C,EAAIwC,EAAEtF,OAAQ8C,IAElC2C,GADApD,GAAkB,EAAbiD,EAAE9D,MAAMsB,IAAU2C,IACV,GACbnE,KAAKE,MAAMsB,GAAS,SAAJT,EAIlB,GAAc,IAAVoD,GAAe3C,EAAIwC,EAAEtF,QAAUsF,IAAMhE,KACvC,KAAOwB,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAU5B,OANAxB,KAAKtB,OAAS4C,KAAKM,IAAI5B,KAAKtB,OAAQ8C,GAEhCwC,IAAMhE,OACRA,KAAKC,SAAW,GAGXD,KAAK2C,OACd,EAGAhD,EAAGjC,UAAUuK,IAAM,SAAcxG,GAC/B,OAAOzB,KAAKsD,QAAQyE,KAAKtG,EAC3B,EA8CA,IAAIyG,EAAc,SAAsBpE,EAAMrC,EAAKsC,GACjD,IAIIG,EACAiE,EACAnC,EANAhC,EAAIF,EAAK5D,MACT+D,EAAIxC,EAAIvB,MACRkI,EAAIrE,EAAI7D,MACRS,EAAI,EAIJ0H,EAAY,EAAPrE,EAAE,GACPsE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxE,EAAE,GACPyE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3E,EAAE,GACP4E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9E,EAAE,GACP+E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjF,EAAE,GACPkF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpF,EAAE,GACPqF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvF,EAAE,GACPwF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1F,EAAE,GACP2F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlG,EAAE,GACPmG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrG,EAAE,GACPsG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxG,EAAE,GACPyG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3G,EAAE,GACP4G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9G,EAAE,GACP+G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPjH,EAAE,GACPkH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpH,EAAE,GACPqH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvH,EAAE,GACPwH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1H,EAAE,GACP2H,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP7H,EAAE,GACP8H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB/H,EAAI9D,SAAW6D,EAAK7D,SAAWwB,EAAIxB,SACnC8D,EAAIrF,OAAS,GAMb,IAAIuN,IAAQtL,GAJZuD,EAAK5C,KAAK4K,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM7G,KAAK4K,KAAK5D,EAAK+B,IACR/I,KAAK4K,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDzJ,IAFAqF,EAAK1E,KAAK4K,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAK5C,KAAK4K,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKzD,EAAK4B,IACR/I,KAAK4K,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQxL,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKkC,GAAQ,GACvBlJ,KAAK4K,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrD5J,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAK5C,KAAK4K,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKtD,EAAKyB,IACR/I,KAAK4K,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKrD,EAAKwB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK+B,GAAQ,GACvBlJ,KAAK4K,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQzL,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKqC,GAAQ,GACvBrJ,KAAK4K,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD/J,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAK5C,KAAK4K,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKnD,EAAKsB,IACR/I,KAAK4K,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKlD,EAAKqB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK4B,GAAQ,GACvBlJ,KAAK4K,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKkC,GAAQ,GACvBrJ,KAAK4K,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQ1L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKwC,GAAQ,GACvBxJ,KAAK4K,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDlK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAK5C,KAAK4K,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKhD,EAAKmB,IACR/I,KAAK4K,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAK/C,EAAKkB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKyB,GAAQ,GACvBlJ,KAAK4K,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK+B,GAAQ,GACvBrJ,KAAK4K,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK8B,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKqC,GAAQ,GACvBxJ,KAAK4K,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQ3L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK2C,IAAQ,GACvB3J,KAAK4K,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDrK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAK5C,KAAK4K,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAK7C,EAAKgB,IACR/I,KAAK4K,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAK5C,EAAKe,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKsB,GAAQ,GACvBlJ,KAAK4K,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK4B,GAAQ,GACvBrJ,KAAK4K,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK2B,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKkC,GAAQ,GACvBxJ,KAAK4K,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKiC,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKwC,IAAQ,GACvB3J,KAAK4K,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQ5L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK8C,IAAQ,GACvB9J,KAAK4K,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDxK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAK5C,KAAK4K,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAK1C,EAAKa,IACR/I,KAAK4K,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKzC,EAAKY,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKmB,GAAQ,GACvBlJ,KAAK4K,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKyB,GAAQ,GACvBrJ,KAAK4K,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKwB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK+B,GAAQ,GACvBxJ,KAAK4K,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK8B,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKqC,IAAQ,GACvB3J,KAAK4K,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK2C,IAAQ,GACvB9J,KAAK4K,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ7L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKiD,IAAQ,GACvBjK,KAAK4K,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrD3K,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAK5C,KAAK4K,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKvC,EAAKU,IACR/I,KAAK4K,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKtC,EAAKS,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKgB,GAAQ,GACvBlJ,KAAK4K,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKsB,GAAQ,GACvBrJ,KAAK4K,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKqB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK4B,GAAQ,GACvBxJ,KAAK4K,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK2B,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKkC,IAAQ,GACvB3J,KAAK4K,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKwC,IAAQ,GACvB9J,KAAK4K,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKuC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK8C,IAAQ,GACvBjK,KAAK4K,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ9L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKoD,IAAQ,GACvBpK,KAAK4K,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD9K,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAK5C,KAAK4K,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKpC,EAAKO,IACR/I,KAAK4K,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKnC,EAAKM,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKa,GAAQ,GACvBlJ,KAAK4K,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKY,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKmB,GAAQ,GACvBrJ,KAAK4K,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKkB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKyB,GAAQ,GACvBxJ,KAAK4K,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKwB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK+B,IAAQ,GACvB3J,KAAK4K,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKqC,IAAQ,GACvB9J,KAAK4K,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKoC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK2C,IAAQ,GACvBjK,KAAK4K,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKiD,IAAQ,GACvBpK,KAAK4K,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ/L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKuD,IAAQ,GACvBvK,KAAK4K,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDjL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAK5C,KAAK4K,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKI,IACR/I,KAAK4K,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKhC,EAAKG,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKU,GAAQ,GACvBlJ,KAAK4K,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKS,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKgB,GAAQ,GACvBrJ,KAAK4K,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKe,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKsB,GAAQ,GACvBxJ,KAAK4K,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKqB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK4B,IAAQ,GACvB3J,KAAK4K,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKkC,IAAQ,GACvB9J,KAAK4K,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKiC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKwC,IAAQ,GACvBjK,KAAK4K,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK8C,IAAQ,GACvBpK,KAAK4K,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK6C,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKoD,IAAQ,GACvBvK,KAAK4K,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQhM,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK0D,IAAQ,GACvB1K,KAAK4K,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENzI,EAAK5C,KAAK4K,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKO,IACRlJ,KAAK4K,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK1E,KAAK4K,KAAKhC,EAAKM,GACpBtG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKa,GAAQ,GACvBrJ,KAAK4K,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKY,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKmB,GAAQ,GACvBxJ,KAAK4K,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKkB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKyB,IAAQ,GACvB3J,KAAK4K,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK+B,IAAQ,GACvB9J,KAAK4K,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK8B,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKqC,IAAQ,GACvBjK,KAAK4K,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK2C,IAAQ,GACvBpK,KAAK4K,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK0C,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKiD,IAAQ,GACvBvK,KAAK4K,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASjM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKuD,IAAQ,GACvB1K,KAAK4K,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAK5C,KAAK4K,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKU,IACRrJ,KAAK4K,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK1E,KAAK4K,KAAKhC,EAAKS,GACpBzG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKgB,GAAQ,GACvBxJ,KAAK4K,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKe,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKsB,IAAQ,GACvB3J,KAAK4K,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKqB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAK4B,IAAQ,GACvB9J,KAAK4K,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKkC,IAAQ,GACvBjK,KAAK4K,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKwC,IAAQ,GACvBpK,KAAK4K,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKuC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK8C,IAAQ,GACvBvK,KAAK4K,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASlM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKoD,IAAQ,GACvB1K,KAAK4K,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAK5C,KAAK4K,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKa,IACRxJ,KAAK4K,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK1E,KAAK4K,KAAKhC,EAAKY,GACpB5G,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKmB,IAAQ,GACvB3J,KAAK4K,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKkB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKyB,IAAQ,GACvB9J,KAAK4K,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKwB,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAK+B,IAAQ,GACvBjK,KAAK4K,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKqC,IAAQ,GACvBpK,KAAK4K,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKoC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK2C,IAAQ,GACvBvK,KAAK4K,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAASnM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKiD,IAAQ,GACvB1K,KAAK4K,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAK5C,KAAK4K,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKgB,KACR3J,KAAK4K,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK1E,KAAK4K,KAAKhC,EAAKe,IACpB/G,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKsB,IAAQ,GACvB9J,KAAK4K,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKqB,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAK4B,IAAQ,GACvBjK,KAAK4K,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAK2B,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKkC,IAAQ,GACvBpK,KAAK4K,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKiC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKwC,IAAQ,GACvBvK,KAAK4K,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASpM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK8C,IAAQ,GACvB1K,KAAK4K,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAK5C,KAAK4K,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKmB,KACR9J,KAAK4K,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK1E,KAAK4K,KAAKhC,EAAKkB,IACpBlH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKyB,IAAQ,GACvBjK,KAAK4K,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKwB,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAK+B,IAAQ,GACvBpK,KAAK4K,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAK8B,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKqC,IAAQ,GACvBvK,KAAK4K,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASrM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK2C,IAAQ,GACvB1K,KAAK4K,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAK5C,KAAK4K,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKsB,KACRjK,KAAK4K,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK1E,KAAK4K,KAAKhC,EAAKqB,IACpBrH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAK4B,IAAQ,GACvBpK,KAAK4K,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAK2B,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKkC,IAAQ,GACvBvK,KAAK4K,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAStM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKwC,IAAQ,GACvB1K,KAAK4K,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAK5C,KAAK4K,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKyB,KACRpK,KAAK4K,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK1E,KAAK4K,KAAKhC,EAAKwB,IACpBxH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAK+B,IAAQ,GACvBvK,KAAK4K,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASvM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKqC,IAAQ,GACvB1K,KAAK4K,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPhJ,EAAK5C,KAAK4K,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAK4B,KACRvK,KAAK4K,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK1E,KAAK4K,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASxM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKkC,IAAQ,GACvB1K,KAAK4K,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASzM,GAJbuD,EAAK5C,KAAK4K,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAK+B,KACR1K,KAAK4K,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBApL,IAFAqF,EAAK1E,KAAK4K,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANzM,IACFyH,EAAE,IAAMzH,EACRoD,EAAIrF,UAECqF,CACT,EAgDA,SAASsJ,EAAYvJ,EAAMrC,EAAKsC,GAE9B,OADW,IAAIuJ,GACHC,KAAKzJ,EAAMrC,EAAKsC,EAC9B,CAqBA,SAASuJ,EAAME,EAAGC,GAChBzN,KAAKwN,EAAIA,EACTxN,KAAKyN,EAAIA,CACX,CAxEKnM,KAAK4K,OACRhE,EAAcrE,GAiDhBlE,EAAGjC,UAAUgQ,MAAQ,SAAgBjM,EAAKsC,GACxC,IAAIwB,EACAlE,EAAMrB,KAAKtB,OAAS+C,EAAI/C,OAW5B,OATE6G,EADkB,KAAhBvF,KAAKtB,QAAgC,KAAf+C,EAAI/C,OACtBwJ,EAAYlI,KAAMyB,EAAKsC,GACpB1C,EAAM,GACTwC,EAAW7D,KAAMyB,EAAKsC,GACnB1C,EAAM,KArDnB,SAAmByC,EAAMrC,EAAKsC,GAC5BA,EAAI9D,SAAWwB,EAAIxB,SAAW6D,EAAK7D,SACnC8D,EAAIrF,OAASoF,EAAKpF,OAAS+C,EAAI/C,OAI/B,IAFA,IAAIyF,EAAQ,EACRwJ,EAAU,EACLvJ,EAAI,EAAGA,EAAIL,EAAIrF,OAAS,EAAG0F,IAAK,CAGvC,IAAIC,EAASsJ,EACbA,EAAU,EAGV,IAFA,IAAIrJ,EAAgB,SAARH,EACRI,EAAOjD,KAAKC,IAAI6C,EAAG3C,EAAI/C,OAAS,GAC3B8D,EAAIlB,KAAKM,IAAI,EAAGwC,EAAIN,EAAKpF,OAAS,GAAI8D,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIhB,EAAI4C,EAAI5B,EAGRzB,GAFoB,EAAhB+C,EAAK5D,MAAMsB,KACI,EAAfC,EAAIvB,MAAMsC,IAGd0B,EAAS,SAAJnD,EAGTuD,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBqJ,IAFAtJ,GAHAA,EAAUA,GAAWtD,EAAI,SAAa,GAAM,IAGxBmD,IAAO,IAAO,KAEZ,GACtBG,GAAU,QACZ,CACAN,EAAI7D,MAAMkE,GAAKE,EACfH,EAAQE,EACRA,EAASsJ,CACX,CAOA,OANc,IAAVxJ,EACFJ,EAAI7D,MAAMkE,GAAKD,EAEfJ,EAAIrF,SAGCqF,EAAIpB,OACb,CAeUiL,CAAS5N,KAAMyB,EAAKsC,GAEpBsJ,EAAWrN,KAAMyB,EAAKsC,GAGvBwB,CACT,EAUA+H,EAAK5P,UAAUmQ,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAInE,MAAMoM,GACdC,EAAIpO,EAAGjC,UAAUkI,WAAWkI,GAAK,EAC5BtM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrBqE,EAAErE,GAAKxB,KAAKgO,OAAOxM,EAAGuM,EAAGD,GAG3B,OAAOjI,CACT,EAGAyH,EAAK5P,UAAUsQ,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAzM,EAAI,EAAGA,EAAIuM,EAAGvM,IACrByM,IAAW,EAAJT,IAAWO,EAAIvM,EAAI,EAC1BgM,IAAM,EAGR,OAAOS,CACT,EAIAX,EAAK5P,UAAUwQ,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAItM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrB8M,EAAK9M,GAAK4M,EAAID,EAAI3M,IAClB+M,EAAK/M,GAAK6M,EAAIF,EAAI3M,GAEtB,EAEA8L,EAAK5P,UAAU8Q,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEnO,KAAKkO,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQpN,KAAKqN,IAAI,EAAIrN,KAAKsN,GAAKb,GAC/Bc,EAAQvN,KAAKwN,IAAI,EAAIxN,KAAKsN,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJrM,EAAI,EAAGA,EAAIiM,EAAGjM,IAAK,CAC1B,IAAI0M,EAAKZ,EAAKS,EAAIvM,GACd2M,EAAKZ,EAAKQ,EAAIvM,GAEd4M,EAAKd,EAAKS,EAAIvM,EAAIiM,GAClBY,EAAKd,EAAKQ,EAAIvM,EAAIiM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAIvM,GAAK0M,EAAKE,EACnBb,EAAKQ,EAAIvM,GAAK2M,EAAKE,EAEnBf,EAAKS,EAAIvM,EAAIiM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAIvM,EAAIiM,GAAKU,EAAKE,EAGnB7M,IAAMuL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,EAEb,CAGN,EAEAhC,EAAK5P,UAAU6R,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjBxM,KAAKM,IAAI6N,EAAGD,GAChBE,EAAU,EAAJ5B,EACNtM,EAAI,EACR,IAAKsM,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BtM,IAGF,OAAO,GAAKA,EAAI,EAAIkO,CACtB,EAEApC,EAAK5P,UAAUiS,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAItM,EAAI,EAAGA,EAAIsM,EAAI,EAAGtM,IAAK,CAC9B,IAAIqE,EAAIuI,EAAI5M,GAEZ4M,EAAI5M,GAAK4M,EAAIN,EAAItM,EAAI,GACrB4M,EAAIN,EAAItM,EAAI,GAAKqE,EAEjBA,EAAIwI,EAAI7M,GAER6M,EAAI7M,IAAM6M,EAAIP,EAAItM,EAAI,GACtB6M,EAAIP,EAAItM,EAAI,IAAMqE,CACpB,CACF,EAEAyH,EAAK5P,UAAUkS,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI3J,EAAQ,EACH3C,EAAI,EAAGA,EAAIsM,EAAI,EAAGtM,IAAK,CAC9B,IAAIiB,EAAoC,KAAhCnB,KAAKwO,MAAMD,EAAG,EAAIrO,EAAI,GAAKsM,GACjCxM,KAAKwO,MAAMD,EAAG,EAAIrO,GAAKsM,GACvB3J,EAEF0L,EAAGrO,GAAS,SAAJiB,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,CAE5B,CAEA,OAAOoN,CACT,EAEAvC,EAAK5P,UAAUqS,WAAa,SAAqBF,EAAIxO,EAAK+M,EAAKN,GAE7D,IADA,IAAI3J,EAAQ,EACH3C,EAAI,EAAGA,EAAIH,EAAKG,IACvB2C,GAAyB,EAAR0L,EAAGrO,GAEpB4M,EAAI,EAAI5M,GAAa,KAAR2C,EAAgBA,KAAkB,GAC/CiK,EAAI,EAAI5M,EAAI,GAAa,KAAR2C,EAAgBA,KAAkB,GAIrD,IAAK3C,EAAI,EAAIH,EAAKG,EAAIsM,IAAKtM,EACzB4M,EAAI5M,GAAK,EAGXlC,EAAiB,IAAV6E,GACP7E,EAA6B,KAAb,KAAR6E,GACV,EAEAmJ,EAAK5P,UAAUsS,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAIvO,MAAMoM,GACVtM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrByO,EAAGzO,GAAK,EAGV,OAAOyO,CACT,EAEA3C,EAAK5P,UAAU6P,KAAO,SAAeC,EAAGC,EAAG1J,GACzC,IAAI+J,EAAI,EAAI9N,KAAKuP,YAAY/B,EAAE9O,OAAQ+O,EAAE/O,QAErCyP,EAAMnO,KAAK6N,QAAQC,GAEnBoC,EAAIlQ,KAAKgQ,KAAKlC,GAEdM,EAAM,IAAI1M,MAAMoM,GAChBqC,EAAO,IAAIzO,MAAMoM,GACjBsC,EAAO,IAAI1O,MAAMoM,GAEjBuC,EAAO,IAAI3O,MAAMoM,GACjBwC,EAAQ,IAAI5O,MAAMoM,GAClByC,EAAQ,IAAI7O,MAAMoM,GAElB0C,EAAOzM,EAAI7D,MACfsQ,EAAK9R,OAASoP,EAEd9N,KAAK+P,WAAWvC,EAAEtN,MAAOsN,EAAE9O,OAAQ0P,EAAKN,GACxC9N,KAAK+P,WAAWtC,EAAEvN,MAAOuN,EAAE/O,OAAQ2R,EAAMvC,GAEzC9N,KAAKwO,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtCnO,KAAKwO,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAI3M,EAAI,EAAGA,EAAIsM,EAAGtM,IAAK,CAC1B,IAAI8N,EAAKa,EAAK3O,GAAK8O,EAAM9O,GAAK4O,EAAK5O,GAAK+O,EAAM/O,GAC9C4O,EAAK5O,GAAK2O,EAAK3O,GAAK+O,EAAM/O,GAAK4O,EAAK5O,GAAK8O,EAAM9O,GAC/C2O,EAAK3O,GAAK8N,CACZ,CASA,OAPAtP,KAAK2P,UAAUQ,EAAMC,EAAMtC,GAC3B9N,KAAKwO,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvCnO,KAAK2P,UAAUa,EAAMN,EAAGpC,GACxB9N,KAAK4P,aAAaY,EAAM1C,GAExB/J,EAAI9D,SAAWuN,EAAEvN,SAAWwN,EAAExN,SAC9B8D,EAAIrF,OAAS8O,EAAE9O,OAAS+O,EAAE/O,OACnBqF,EAAIpB,OACb,EAGAhD,EAAGjC,UAAU0D,IAAM,SAAcK,GAC/B,IAAIsC,EAAM,IAAIpE,EAAG,MAEjB,OADAoE,EAAI7D,MAAQ,IAAIwB,MAAM1B,KAAKtB,OAAS+C,EAAI/C,QACjCsB,KAAK0N,MAAMjM,EAAKsC,EACzB,EAGApE,EAAGjC,UAAU+S,KAAO,SAAehP,GACjC,IAAIsC,EAAM,IAAIpE,EAAG,MAEjB,OADAoE,EAAI7D,MAAQ,IAAIwB,MAAM1B,KAAKtB,OAAS+C,EAAI/C,QACjC2O,EAAWrN,KAAMyB,EAAKsC,EAC/B,EAGApE,EAAGjC,UAAUwO,KAAO,SAAezK,GACjC,OAAOzB,KAAKsD,QAAQoK,MAAMjM,EAAKzB,KACjC,EAEAL,EAAGjC,UAAUuF,MAAQ,SAAgBxB,GACnCnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UAIb,IADA,IAAI0C,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIiB,GAAqB,EAAhBzC,KAAKE,MAAMsB,IAAUC,EAC1ByC,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChBlE,KAAKE,MAAMsB,GAAU,SAAL0C,CAClB,CAOA,OALc,IAAVC,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,UAGAsB,IACT,EAEAL,EAAGjC,UAAUgT,KAAO,SAAejP,GACjC,OAAOzB,KAAKsD,QAAQL,MAAMxB,EAC5B,EAGA9B,EAAGjC,UAAUiT,IAAM,WACjB,OAAO3Q,KAAKoB,IAAIpB,KAClB,EAGAL,EAAGjC,UAAUkT,KAAO,WAClB,OAAO5Q,KAAKkM,KAAKlM,KAAKsD,QACxB,EAGA3D,EAAGjC,UAAUyF,IAAM,SAAc1B,GAC/B,IAAIgB,EAxxCN,SAAqBhB,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAIsE,aAEb6B,EAAM,EAAGA,EAAMnF,EAAE/D,OAAQkJ,IAAO,CACvC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnF,EAAEmF,IAAQnG,EAAIvB,MAAMwC,GAAQ,GAAKmF,KAAWA,CAC9C,CAEA,OAAOpF,CACT,CA6wCUoO,CAAWpP,GACnB,GAAiB,IAAbgB,EAAE/D,OAAc,OAAO,IAAIiB,EAAG,GAIlC,IADA,IAAI4F,EAAMvF,KACDwB,EAAI,EAAGA,EAAIiB,EAAE/D,QACP,IAAT+D,EAAEjB,GADsBA,IAAK+D,EAAMA,EAAIoL,OAI7C,KAAMnP,EAAIiB,EAAE/D,OACV,IAAK,IAAI8G,EAAID,EAAIoL,MAAOnP,EAAIiB,EAAE/D,OAAQ8C,IAAKgE,EAAIA,EAAEmL,MAClC,IAATlO,EAAEjB,KAEN+D,EAAMA,EAAInE,IAAIoE,IAIlB,OAAOD,CACT,EAGA5F,EAAGjC,UAAUoT,OAAS,SAAiBC,GACrCzR,EAAuB,iBAATyR,GAAqBA,GAAQ,GAC3C,IAGIvP,EAHAT,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GACjBiQ,EAAa,WAAe,GAAKjQ,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoD,EAAQ,EAEZ,IAAK3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAChC,IAAIyP,EAAWjR,KAAKE,MAAMsB,GAAKwP,EAC3BrQ,GAAsB,EAAhBX,KAAKE,MAAMsB,IAAUyP,GAAalQ,EAC5Cf,KAAKE,MAAMsB,GAAKb,EAAIwD,EACpBA,EAAQ8M,IAAc,GAAKlQ,CAC7B,CAEIoD,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,SAET,CAEA,GAAU,IAAN+P,EAAS,CACX,IAAKjN,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAChCxB,KAAKE,MAAMsB,EAAIiN,GAAKzO,KAAKE,MAAMsB,GAGjC,IAAKA,EAAI,EAAGA,EAAIiN,EAAGjN,IACjBxB,KAAKE,MAAMsB,GAAK,EAGlBxB,KAAKtB,QAAU+P,CACjB,CAEA,OAAOzO,KAAK2C,OACd,EAEAhD,EAAGjC,UAAUwT,MAAQ,SAAgBH,GAGnC,OADAzR,EAAyB,IAAlBU,KAAKC,UACLD,KAAK8Q,OAAOC,EACrB,EAKApR,EAAGjC,UAAUgI,OAAS,SAAiBqL,EAAMI,EAAMC,GAEjD,IAAIC,EADJ/R,EAAuB,iBAATyR,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIpQ,EAAIgQ,EAAO,GACXtC,EAAInN,KAAKC,KAAKwP,EAAOhQ,GAAK,GAAIf,KAAKtB,QACnC4S,EAAO,SAAc,WAAcvQ,GAAMA,EACzCwQ,EAAcH,EAMlB,GAJAC,GAAK5C,EACL4C,EAAI/P,KAAKM,IAAI,EAAGyP,GAGZE,EAAa,CACf,IAAK,IAAI/P,EAAI,EAAGA,EAAIiN,EAAGjN,IACrB+P,EAAYrR,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAEpC+P,EAAY7S,OAAS+P,CACvB,CAEA,GAAU,IAANA,QAEG,GAAIzO,KAAKtB,OAAS+P,EAEvB,IADAzO,KAAKtB,QAAU+P,EACVjN,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC3BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,EAAIiN,QAGjCzO,KAAKE,MAAM,GAAK,EAChBF,KAAKtB,OAAS,EAGhB,IAAIyF,EAAQ,EACZ,IAAK3C,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,IAAgB,IAAV2C,GAAe3C,GAAK6P,GAAI7P,IAAK,CAChE,IAAIwB,EAAuB,EAAhBhD,KAAKE,MAAMsB,GACtBxB,KAAKE,MAAMsB,GAAM2C,GAAU,GAAKpD,EAAOiC,IAASjC,EAChDoD,EAAQnB,EAAOsO,CACjB,CAYA,OATIC,GAAyB,IAAVpN,IACjBoN,EAAYrR,MAAMqR,EAAY7S,UAAYyF,GAGxB,IAAhBnE,KAAKtB,SACPsB,KAAKE,MAAM,GAAK,EAChBF,KAAKtB,OAAS,GAGTsB,KAAK2C,OACd,EAEAhD,EAAGjC,UAAU8T,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA9R,EAAyB,IAAlBU,KAAKC,UACLD,KAAK0F,OAAOqL,EAAMI,EAAMC,EACjC,EAGAzR,EAAGjC,UAAU+T,KAAO,SAAeV,GACjC,OAAO/Q,KAAKsD,QAAQ4N,MAAMH,EAC5B,EAEApR,EAAGjC,UAAUgU,MAAQ,SAAgBX,GACnC,OAAO/Q,KAAKsD,QAAQwN,OAAOC,EAC7B,EAGApR,EAAGjC,UAAUiU,KAAO,SAAeZ,GACjC,OAAO/Q,KAAKsD,QAAQkO,MAAMT,EAC5B,EAEApR,EAAGjC,UAAUkU,MAAQ,SAAgBb,GACnC,OAAO/Q,KAAKsD,QAAQoC,OAAOqL,EAC7B,EAGApR,EAAGjC,UAAU8I,MAAQ,SAAgBoB,GACnCtI,EAAsB,iBAARsI,GAAoBA,GAAO,GACzC,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,QAAIf,KAAKtB,QAAU+P,KAGXzO,KAAKE,MAAMuO,GAELjJ,GAChB,EAGA7F,EAAGjC,UAAUmU,OAAS,SAAiBd,GACrCzR,EAAuB,iBAATyR,GAAqBA,GAAQ,GAC3C,IAAIhQ,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GAIrB,GAFAzB,EAAyB,IAAlBU,KAAKC,SAAgB,2CAExBD,KAAKtB,QAAU+P,EACjB,OAAOzO,KAQT,GALU,IAANe,GACF0N,IAEFzO,KAAKtB,OAAS4C,KAAKC,IAAIkN,EAAGzO,KAAKtB,QAErB,IAANqC,EAAS,CACX,IAAIuQ,EAAO,SAAc,WAAcvQ,GAAMA,EAC7Cf,KAAKE,MAAMF,KAAKtB,OAAS,IAAM4S,CACjC,CAEA,OAAOtR,KAAK2C,OACd,EAGAhD,EAAGjC,UAAUoU,MAAQ,SAAgBf,GACnC,OAAO/Q,KAAKsD,QAAQuO,OAAOd,EAC7B,EAGApR,EAAGjC,UAAU4I,MAAQ,SAAgB7E,GAGnC,OAFAnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UACTA,EAAM,EAAUzB,KAAK+R,OAAOtQ,GAGV,IAAlBzB,KAAKC,SACa,IAAhBD,KAAKtB,SAAiC,EAAhBsB,KAAKE,MAAM,IAAUuB,GAC7CzB,KAAKE,MAAM,GAAKuB,GAAuB,EAAhBzB,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK+R,MAAMtQ,GACXzB,KAAKC,SAAW,EACTD,MAIFA,KAAKkD,OAAOzB,EACrB,EAEA9B,EAAGjC,UAAUwF,OAAS,SAAiBzB,GACrCzB,KAAKE,MAAM,IAAMuB,EAGjB,IAAK,IAAID,EAAI,EAAGA,EAAIxB,KAAKtB,QAAUsB,KAAKE,MAAMsB,IAAM,SAAWA,IAC7DxB,KAAKE,MAAMsB,IAAM,SACbA,IAAMxB,KAAKtB,OAAS,EACtBsB,KAAKE,MAAMsB,EAAI,GAAK,EAEpBxB,KAAKE,MAAMsB,EAAI,KAKnB,OAFAxB,KAAKtB,OAAS4C,KAAKM,IAAI5B,KAAKtB,OAAQ8C,EAAI,GAEjCxB,IACT,EAGAL,EAAGjC,UAAUqU,MAAQ,SAAgBtQ,GAGnC,GAFAnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UACTA,EAAM,EAAG,OAAOzB,KAAKsG,OAAO7E,GAEhC,GAAsB,IAAlBzB,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKsG,MAAM7E,GACXzB,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAMuB,EAEG,IAAhBzB,KAAKtB,QAAgBsB,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAIuB,EAAI,EAAGA,EAAIxB,KAAKtB,QAAUsB,KAAKE,MAAMsB,GAAK,EAAGA,IACpDxB,KAAKE,MAAMsB,IAAM,SACjBxB,KAAKE,MAAMsB,EAAI,IAAM,EAIzB,OAAOxB,KAAK2C,OACd,EAEAhD,EAAGjC,UAAUsU,KAAO,SAAevQ,GACjC,OAAOzB,KAAKsD,QAAQgD,MAAM7E,EAC5B,EAEA9B,EAAGjC,UAAUuU,KAAO,SAAexQ,GACjC,OAAOzB,KAAKsD,QAAQyO,MAAMtQ,EAC5B,EAEA9B,EAAGjC,UAAUwU,KAAO,WAGlB,OAFAlS,KAAKC,SAAW,EAETD,IACT,EAEAL,EAAGjC,UAAU0I,IAAM,WACjB,OAAOpG,KAAKsD,QAAQ4O,MACtB,EAEAvS,EAAGjC,UAAUyU,aAAe,SAAuB1Q,EAAKL,EAAKgR,GAC3D,IACI5Q,EAIAiB,EALApB,EAAMI,EAAI/C,OAAS0T,EAGvBpS,KAAKuD,QAAQlC,GAGb,IAAI8C,EAAQ,EACZ,IAAK3C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CAC/BiB,GAA6B,EAAxBzC,KAAKE,MAAMsB,EAAI4Q,IAAcjO,EAClC,IAAIrC,GAAwB,EAAfL,EAAIvB,MAAMsB,IAAUJ,EAEjC+C,IADA1B,GAAa,SAARX,IACS,KAAQA,EAAQ,SAAa,GAC3C9B,KAAKE,MAAMsB,EAAI4Q,GAAa,SAAJ3P,CAC1B,CACA,KAAOjB,EAAIxB,KAAKtB,OAAS0T,EAAO5Q,IAE9B2C,GADA1B,GAA6B,EAAxBzC,KAAKE,MAAMsB,EAAI4Q,IAAcjO,IACrB,GACbnE,KAAKE,MAAMsB,EAAI4Q,GAAa,SAAJ3P,EAG1B,GAAc,IAAV0B,EAAa,OAAOnE,KAAK2C,QAK7B,IAFArD,GAAkB,IAAX6E,GACPA,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAE3B2C,GADA1B,IAAsB,EAAhBzC,KAAKE,MAAMsB,IAAU2C,IACd,GACbnE,KAAKE,MAAMsB,GAAS,SAAJiB,EAIlB,OAFAzC,KAAKC,SAAW,EAETD,KAAK2C,OACd,EAEAhD,EAAGjC,UAAU2U,SAAW,SAAmB5Q,EAAK6Q,GAC9C,IAAIF,GAAQpS,KAAKtB,OAAS+C,EAAI/C,QAE1BsF,EAAIhE,KAAKsD,QACTW,EAAIxC,EAGJ8Q,EAA8B,EAAxBtO,EAAE/D,MAAM+D,EAAEvF,OAAS,GAGf,IADd0T,EAAQ,GADMpS,KAAK4F,WAAW2M,MAG5BtO,EAAIA,EAAEyN,MAAMU,GACZpO,EAAE8M,OAAOsB,GACTG,EAA8B,EAAxBtO,EAAE/D,MAAM+D,EAAEvF,OAAS,IAI3B,IACI8G,EADAiK,EAAIzL,EAAEtF,OAASuF,EAAEvF,OAGrB,GAAa,QAAT4T,EAAgB,EAClB9M,EAAI,IAAI7F,EAAG,OACTjB,OAAS+Q,EAAI,EACfjK,EAAEtF,MAAQ,IAAIwB,MAAM8D,EAAE9G,QACtB,IAAK,IAAI8C,EAAI,EAAGA,EAAIgE,EAAE9G,OAAQ8C,IAC5BgE,EAAEtF,MAAMsB,GAAK,CAEjB,CAEA,IAAIgR,EAAOxO,EAAEV,QAAQ6O,aAAalO,EAAG,EAAGwL,GAClB,IAAlB+C,EAAKvS,WACP+D,EAAIwO,EACAhN,IACFA,EAAEtF,MAAMuP,GAAK,IAIjB,IAAK,IAAIjN,EAAIiN,EAAI,EAAGjN,GAAK,EAAGA,IAAK,CAC/B,IAAIiQ,EAAmC,UAAL,EAAxBzO,EAAE9D,MAAM+D,EAAEvF,OAAS8D,KACE,EAA5BwB,EAAE9D,MAAM+D,EAAEvF,OAAS8D,EAAI,IAO1B,IAHAiQ,EAAKnR,KAAKC,IAAKkR,EAAKF,EAAO,EAAG,UAE9BvO,EAAEmO,aAAalO,EAAGwO,EAAIjQ,GACA,IAAfwB,EAAE/D,UACPwS,IACAzO,EAAE/D,SAAW,EACb+D,EAAEmO,aAAalO,EAAG,EAAGzB,GAChBwB,EAAEW,WACLX,EAAE/D,UAAY,GAGduF,IACFA,EAAEtF,MAAMsC,GAAKiQ,EAEjB,CAWA,OAVIjN,GACFA,EAAE7C,QAEJqB,EAAErB,QAGW,QAAT2P,GAA4B,IAAVF,GACpBpO,EAAE0B,OAAO0M,GAGJ,CACLM,IAAKlN,GAAK,KACVzC,IAAKiB,EAET,EAMArE,EAAGjC,UAAUiV,OAAS,SAAiBlR,EAAK6Q,EAAMM,GAGhD,OAFAtT,GAAQmC,EAAIkD,UAER3E,KAAK2E,SACA,CACL+N,IAAK,IAAI/S,EAAG,GACZoD,IAAK,IAAIpD,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjBwB,EAAIxB,UAC7BsF,EAAMvF,KAAK4G,MAAM+L,OAAOlR,EAAK6Q,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGH,QAAT0L,IACFvP,EAAMwC,EAAIxC,IAAI6D,MACVgM,GAA6B,IAAjB7P,EAAI9C,UAClB8C,EAAI+E,KAAKrG,IAIN,CACLiR,IAAKA,EACL3P,IAAKA,IAIa,IAAlB/C,KAAKC,UAAmC,IAAjBwB,EAAIxB,UAC7BsF,EAAMvF,KAAK2S,OAAOlR,EAAImF,MAAO0L,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGT,CACL8L,IAAKA,EACL3P,IAAKwC,EAAIxC,MAI0B,IAAlC/C,KAAKC,SAAWwB,EAAIxB,WACvBsF,EAAMvF,KAAK4G,MAAM+L,OAAOlR,EAAImF,MAAO0L,GAEtB,QAATA,IACFvP,EAAMwC,EAAIxC,IAAI6D,MACVgM,GAA6B,IAAjB7P,EAAI9C,UAClB8C,EAAIgF,KAAKtG,IAIN,CACLiR,IAAKnN,EAAImN,IACT3P,IAAKA,IAOLtB,EAAI/C,OAASsB,KAAKtB,QAAUsB,KAAK+B,IAAIN,GAAO,EACvC,CACLiR,IAAK,IAAI/S,EAAG,GACZoD,IAAK/C,MAKU,IAAfyB,EAAI/C,OACO,QAAT4T,EACK,CACLI,IAAK1S,KAAK6S,KAAKpR,EAAIvB,MAAM,IACzB6C,IAAK,MAII,QAATuP,EACK,CACLI,IAAK,KACL3P,IAAK,IAAIpD,EAAGK,KAAK4E,KAAKnD,EAAIvB,MAAM,MAI7B,CACLwS,IAAK1S,KAAK6S,KAAKpR,EAAIvB,MAAM,IACzB6C,IAAK,IAAIpD,EAAGK,KAAK4E,KAAKnD,EAAIvB,MAAM,MAI7BF,KAAKqS,SAAS5Q,EAAK6Q,GAlF1B,IAAII,EAAK3P,EAAKwC,CAmFhB,EAGA5F,EAAGjC,UAAUgV,IAAM,SAAcjR,GAC/B,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAOiR,GACxC,EAGA/S,EAAGjC,UAAUqF,IAAM,SAActB,GAC/B,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAOsB,GACxC,EAEApD,EAAGjC,UAAUoV,KAAO,SAAerR,GACjC,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAMsB,GACvC,EAGApD,EAAGjC,UAAUqV,SAAW,SAAmBtR,GACzC,IAAIuR,EAAKhT,KAAK2S,OAAOlR,GAGrB,GAAIuR,EAAGjQ,IAAI4B,SAAU,OAAOqO,EAAGN,IAE/B,IAAI3P,EAA0B,IAApBiQ,EAAGN,IAAIzS,SAAiB+S,EAAGjQ,IAAIgF,KAAKtG,GAAOuR,EAAGjQ,IAEpDkQ,EAAOxR,EAAImQ,MAAM,GACjBsB,EAAKzR,EAAIgE,MAAM,GACf1D,EAAMgB,EAAIhB,IAAIkR,GAGlB,OAAIlR,EAAM,GAAY,IAAPmR,GAAoB,IAARnR,EAAkBiR,EAAGN,IAGrB,IAApBM,EAAGN,IAAIzS,SAAiB+S,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIpM,MAAM,EAChE,EAEA3G,EAAGjC,UAAUkH,KAAO,SAAenD,GACjCnC,EAAOmC,GAAO,UAId,IAHA,IAAIsN,GAAK,GAAK,IAAMtN,EAEhB0R,EAAM,EACD3R,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IACpC2R,GAAOpE,EAAIoE,GAAuB,EAAhBnT,KAAKE,MAAMsB,KAAWC,EAG1C,OAAO0R,CACT,EAGAxT,EAAGjC,UAAUmH,MAAQ,SAAgBpD,GACnCnC,EAAOmC,GAAO,UAGd,IADA,IAAI0C,EAAQ,EACH3C,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACzC,IAAIiB,GAAqB,EAAhBzC,KAAKE,MAAMsB,IAAkB,SAAR2C,EAC9BnE,KAAKE,MAAMsB,GAAMiB,EAAIhB,EAAO,EAC5B0C,EAAQ1B,EAAIhB,CACd,CAEA,OAAOzB,KAAK2C,OACd,EAEAhD,EAAGjC,UAAUmV,KAAO,SAAepR,GACjC,OAAOzB,KAAKsD,QAAQuB,MAAMpD,EAC5B,EAEA9B,EAAGjC,UAAU0V,KAAO,SAAerE,GACjCzP,EAAsB,IAAfyP,EAAE9O,UACTX,GAAQyP,EAAEpK,UAEV,IAAI6I,EAAIxN,KACJyN,EAAIsB,EAAEzL,QAGRkK,EADiB,IAAfA,EAAEvN,SACAuN,EAAEsF,KAAK/D,GAEPvB,EAAElK,QAaR,IATA,IAAI+P,EAAI,IAAI1T,EAAG,GACX2T,EAAI,IAAI3T,EAAG,GAGX4T,EAAI,IAAI5T,EAAG,GACX6T,EAAI,IAAI7T,EAAG,GAEX8T,EAAI,EAEDjG,EAAEkG,UAAYjG,EAAEiG,UACrBlG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP+N,EAMJ,IAHA,IAAIE,EAAKlG,EAAEnK,QACPsQ,EAAKpG,EAAElK,SAEHkK,EAAE7I,UAAU,CAClB,IAAK,IAAInD,EAAI,EAAGqS,EAAK,EAAyB,IAArBrG,EAAEtN,MAAM,GAAK2T,IAAarS,EAAI,KAAMA,EAAGqS,IAAO,GACvE,GAAIrS,EAAI,EAEN,IADAgM,EAAE9H,OAAOlE,GACFA,KAAM,IACP6R,EAAES,SAAWR,EAAEQ,WACjBT,EAAEvL,KAAK6L,GACPL,EAAEvL,KAAK6L,IAGTP,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIb,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArBtG,EAAEvN,MAAM,GAAK6T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAiL,EAAE/H,OAAOlD,GACFA,KAAM,IACP+Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAEzL,KAAK6L,GACPH,EAAEzL,KAAK6L,IAGTL,EAAE7N,OAAO,GACT8N,EAAE9N,OAAO,GAIT8H,EAAEzL,IAAI0L,IAAM,GACdD,EAAEzF,KAAK0F,GACP4F,EAAEtL,KAAKwL,GACPD,EAAEvL,KAAKyL,KAEP/F,EAAE1F,KAAKyF,GACP+F,EAAExL,KAAKsL,GACPG,EAAEzL,KAAKuL,GAEX,CAEA,MAAO,CACLtP,EAAGuP,EACHtP,EAAGuP,EACHQ,IAAKvG,EAAEqD,OAAO2C,GAElB,EAKA9T,EAAGjC,UAAUuW,OAAS,SAAiBlF,GACrCzP,EAAsB,IAAfyP,EAAE9O,UACTX,GAAQyP,EAAEpK,UAEV,IAAIX,EAAIhE,KACJiE,EAAI8K,EAAEzL,QAGRU,EADiB,IAAfA,EAAE/D,SACA+D,EAAE8O,KAAK/D,GAEP/K,EAAEV,QAQR,IALA,IAuCIiC,EAvCA2O,EAAK,IAAIvU,EAAG,GACZwU,EAAK,IAAIxU,EAAG,GAEZyU,EAAQnQ,EAAEX,QAEPU,EAAEqQ,KAAK,GAAK,GAAKpQ,EAAEoQ,KAAK,GAAK,GAAG,CACrC,IAAK,IAAI7S,EAAI,EAAGqS,EAAK,EAAyB,IAArB7P,EAAE9D,MAAM,GAAK2T,IAAarS,EAAI,KAAMA,EAAGqS,IAAO,GACvE,GAAIrS,EAAI,EAEN,IADAwC,EAAE0B,OAAOlE,GACFA,KAAM,GACP0S,EAAGJ,SACLI,EAAGpM,KAAKsM,GAGVF,EAAGxO,OAAO,GAId,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArB9P,EAAE/D,MAAM,GAAK6T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAyB,EAAEyB,OAAOlD,GACFA,KAAM,GACP2R,EAAGL,SACLK,EAAGrM,KAAKsM,GAGVD,EAAGzO,OAAO,GAIV1B,EAAEjC,IAAIkC,IAAM,GACdD,EAAE+D,KAAK9D,GACPiQ,EAAGnM,KAAKoM,KAERlQ,EAAE8D,KAAK/D,GACPmQ,EAAGpM,KAAKmM,GAEZ,CAaA,OATE3O,EADgB,IAAdvB,EAAEqQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB9O,EAAIuC,KAAKiH,GAGJxJ,CACT,EAEA5F,EAAGjC,UAAUsW,IAAM,SAAcvS,GAC/B,GAAIzB,KAAK2E,SAAU,OAAOlD,EAAI2E,MAC9B,GAAI3E,EAAIkD,SAAU,OAAO3E,KAAKoG,MAE9B,IAAIpC,EAAIhE,KAAKsD,QACTW,EAAIxC,EAAI6B,QACZU,EAAE/D,SAAW,EACbgE,EAAEhE,SAAW,EAGb,IAAK,IAAImS,EAAQ,EAAGpO,EAAE0P,UAAYzP,EAAEyP,SAAUtB,IAC5CpO,EAAE0B,OAAO,GACTzB,EAAEyB,OAAO,GAGX,OAAG,CACD,KAAO1B,EAAE0P,UACP1P,EAAE0B,OAAO,GAEX,KAAOzB,EAAEyP,UACPzP,EAAEyB,OAAO,GAGX,IAAI3E,EAAIiD,EAAEjC,IAAIkC,GACd,GAAIlD,EAAI,EAAG,CAET,IAAI8E,EAAI7B,EACRA,EAAIC,EACJA,EAAI4B,CACN,MAAO,GAAU,IAAN9E,GAAyB,IAAdkD,EAAEoQ,KAAK,GAC3B,MAGFrQ,EAAE+D,KAAK9D,EACT,CAEA,OAAOA,EAAE6M,OAAOsB,EAClB,EAGAzS,EAAGjC,UAAU4W,KAAO,SAAe7S,GACjC,OAAOzB,KAAKoT,KAAK3R,GAAKuC,EAAE8O,KAAKrR,EAC/B,EAEA9B,EAAGjC,UAAUgW,OAAS,WACpB,OAA+B,IAAP,EAAhB1T,KAAKE,MAAM,GACrB,EAEAP,EAAGjC,UAAUoW,MAAQ,WACnB,OAA+B,IAAP,EAAhB9T,KAAKE,MAAM,GACrB,EAGAP,EAAGjC,UAAU+H,MAAQ,SAAgBhE,GACnC,OAAOzB,KAAKE,MAAM,GAAKuB,CACzB,EAGA9B,EAAGjC,UAAU6W,MAAQ,SAAgB3M,GACnCtI,EAAsB,iBAARsI,GACd,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,GAAIf,KAAKtB,QAAU+P,EAGjB,OAFAzO,KAAKuD,QAAQkL,EAAI,GACjBzO,KAAKE,MAAMuO,IAAMjJ,EACVxF,KAKT,IADA,IAAImE,EAAQqB,EACHhE,EAAIiN,EAAa,IAAVtK,GAAe3C,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACnD,IAAIiB,EAAoB,EAAhBzC,KAAKE,MAAMsB,GAEnB2C,GADA1B,GAAK0B,KACS,GACd1B,GAAK,SACLzC,KAAKE,MAAMsB,GAAKiB,CAClB,CAKA,OAJc,IAAV0B,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,UAEAsB,IACT,EAEAL,EAAGjC,UAAUiH,OAAS,WACpB,OAAuB,IAAhB3E,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,EACzC,EAEAP,EAAGjC,UAAU2W,KAAO,SAAe5S,GACjC,IAOI8D,EAPAtF,EAAWwB,EAAM,EAErB,GAAsB,IAAlBzB,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAK2C,QAGD3C,KAAKtB,OAAS,EAChB6G,EAAM,MACD,CACDtF,IACFwB,GAAOA,GAGTnC,EAAOmC,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhBzC,KAAKE,MAAM,GACnBqF,EAAM9C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,CACvC,CACA,OAAsB,IAAlBzB,KAAKC,SAA8B,GAANsF,EAC1BA,CACT,EAMA5F,EAAGjC,UAAUqE,IAAM,SAAcN,GAC/B,GAAsB,IAAlBzB,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAAgB,OAAO,EAEtD,IAAIsF,EAAMvF,KAAKwU,KAAK/S,GACpB,OAAsB,IAAlBzB,KAAKC,SAA8B,GAANsF,EAC1BA,CACT,EAGA5F,EAAGjC,UAAU8W,KAAO,SAAe/S,GAEjC,GAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAQ,OAAO,EACrC,GAAIsB,KAAKtB,OAAS+C,EAAI/C,OAAQ,OAAQ,EAGtC,IADA,IAAI6G,EAAM,EACD/D,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACzC,IAAIwC,EAAoB,EAAhBhE,KAAKE,MAAMsB,GACfyC,EAAmB,EAAfxC,EAAIvB,MAAMsB,GAElB,GAAIwC,IAAMC,EAAV,CACID,EAAIC,EACNsB,GAAO,EACEvB,EAAIC,IACbsB,EAAM,GAER,KANqB,CAOvB,CACA,OAAOA,CACT,EAEA5F,EAAGjC,UAAU+W,IAAM,SAAchT,GAC/B,OAA0B,IAAnBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUgX,GAAK,SAAajT,GAC7B,OAAyB,IAAlBzB,KAAK+B,IAAIN,EAClB,EAEA9B,EAAGjC,UAAUiX,KAAO,SAAelT,GACjC,OAAOzB,KAAKqU,KAAK5S,IAAQ,CAC3B,EAEA9B,EAAGjC,UAAUkX,IAAM,SAAcnT,GAC/B,OAAOzB,KAAK+B,IAAIN,IAAQ,CAC1B,EAEA9B,EAAGjC,UAAUmX,IAAM,SAAcpT,GAC/B,OAA2B,IAApBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUoX,GAAK,SAAarT,GAC7B,OAA0B,IAAnBzB,KAAK+B,IAAIN,EAClB,EAEA9B,EAAGjC,UAAUqX,KAAO,SAAetT,GACjC,OAAOzB,KAAKqU,KAAK5S,IAAQ,CAC3B,EAEA9B,EAAGjC,UAAUsX,IAAM,SAAcvT,GAC/B,OAAOzB,KAAK+B,IAAIN,IAAQ,CAC1B,EAEA9B,EAAGjC,UAAUuX,IAAM,SAAcxT,GAC/B,OAA0B,IAAnBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUwX,GAAK,SAAazT,GAC7B,OAAyB,IAAlBzB,KAAK+B,IAAIN,EAClB,EAMA9B,EAAGQ,IAAM,SAAcsB,GACrB,OAAO,IAAI0T,EAAI1T,EACjB,EAEA9B,EAAGjC,UAAU0X,MAAQ,SAAgBC,GAGnC,OAFA/V,GAAQU,KAAKG,IAAK,yCAClBb,EAAyB,IAAlBU,KAAKC,SAAgB,iCACrBoV,EAAIC,UAAUtV,MAAMuV,UAAUF,EACvC,EAEA1V,EAAGjC,UAAU8X,QAAU,WAErB,OADAlW,EAAOU,KAAKG,IAAK,wDACVH,KAAKG,IAAIsV,YAAYzV,KAC9B,EAEAL,EAAGjC,UAAU6X,UAAY,SAAoBF,GAE3C,OADArV,KAAKG,IAAMkV,EACJrV,IACT,EAEAL,EAAGjC,UAAUgY,SAAW,SAAmBL,GAEzC,OADA/V,GAAQU,KAAKG,IAAK,yCACXH,KAAKuV,UAAUF,EACxB,EAEA1V,EAAGjC,UAAUiY,OAAS,SAAiBlU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI6H,IAAIhI,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUkY,QAAU,SAAkBnU,GAEvC,OADAnC,EAAOU,KAAKG,IAAK,uCACVH,KAAKG,IAAI2H,KAAK9H,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAUmY,OAAS,SAAiBpU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI8H,IAAIjI,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUoY,QAAU,SAAkBrU,GAEvC,OADAnC,EAAOU,KAAKG,IAAK,uCACVH,KAAKG,IAAI4H,KAAK/H,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAUqY,OAAS,SAAiBtU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI6V,IAAIhW,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUuY,OAAS,SAAiBxU,GAGrC,OAFAnC,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAI+V,SAASlW,KAAMyB,GACjBzB,KAAKG,IAAIiB,IAAIpB,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUyY,QAAU,SAAkB1U,GAGvC,OAFAnC,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAI+V,SAASlW,KAAMyB,GACjBzB,KAAKG,IAAI+L,KAAKlM,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAU0Y,OAAS,WAGpB,OAFA9W,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIwQ,IAAI3Q,KACtB,EAEAL,EAAGjC,UAAU4Y,QAAU,WAGrB,OAFAhX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIyQ,KAAK5Q,KACvB,EAGAL,EAAGjC,UAAU6Y,QAAU,WAGrB,OAFAjX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIqW,KAAKxW,KACvB,EAEAL,EAAGjC,UAAU+Y,QAAU,WAGrB,OAFAnX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAImU,KAAKtU,KACvB,EAGAL,EAAGjC,UAAUgZ,OAAS,WAGpB,OAFApX,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIyG,IAAI5G,KACtB,EAEAL,EAAGjC,UAAUiZ,OAAS,SAAiBlV,GAGrC,OAFAnC,EAAOU,KAAKG,MAAQsB,EAAItB,IAAK,qBAC7BH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIgD,IAAInD,KAAMyB,EAC5B,EAGA,IAAImV,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMnI,GAErB/O,KAAKkX,KAAOA,EACZlX,KAAK+O,EAAI,IAAIpP,EAAGoP,EAAG,IACnB/O,KAAKwP,EAAIxP,KAAK+O,EAAEhJ,YAChB/F,KAAKoE,EAAI,IAAIzE,EAAG,GAAGmR,OAAO9Q,KAAKwP,GAAGzH,KAAK/H,KAAK+O,GAE5C/O,KAAKmX,IAAMnX,KAAKoX,MAClB,CAgDA,SAASC,IACPJ,EAAOK,KACLtX,KACA,OACA,0EACJ,CA8DA,SAASuX,IACPN,EAAOK,KACLtX,KACA,OACA,iEACJ,CAGA,SAASwX,IACPP,EAAOK,KACLtX,KACA,OACA,wDACJ,CAGA,SAASyX,IAEPR,EAAOK,KACLtX,KACA,QACA,sEACJ,CA6CA,SAASmV,EAAK1F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIiI,EAAQ/X,EAAGgY,OAAOlI,GACtBzP,KAAKyP,EAAIiI,EAAM3I,EACf/O,KAAK0X,MAAQA,CACf,MACEpY,EAAOmQ,EAAEgF,IAAI,GAAI,kCACjBzU,KAAKyP,EAAIA,EACTzP,KAAK0X,MAAQ,IAEjB,CAgOA,SAASE,EAAMnI,GACb0F,EAAImC,KAAKtX,KAAMyP,GAEfzP,KAAKoS,MAAQpS,KAAKyP,EAAE1J,YAChB/F,KAAKoS,MAAQ,IAAO,IACtBpS,KAAKoS,OAAS,GAAMpS,KAAKoS,MAAQ,IAGnCpS,KAAKe,EAAI,IAAIpB,EAAG,GAAGmR,OAAO9Q,KAAKoS,OAC/BpS,KAAKkT,GAAKlT,KAAK6X,KAAK7X,KAAKe,EAAE4P,OAC3B3Q,KAAK8X,KAAO9X,KAAKe,EAAEkT,OAAOjU,KAAKyP,GAE/BzP,KAAK+X,KAAO/X,KAAK8X,KAAK1W,IAAIpB,KAAKe,GAAGgR,MAAM,GAAGW,IAAI1S,KAAKyP,GACpDzP,KAAK+X,KAAO/X,KAAK+X,KAAKjF,KAAK9S,KAAKe,GAChCf,KAAK+X,KAAO/X,KAAKe,EAAEkH,IAAIjI,KAAK+X,KAC9B,CA7aAd,EAAOvZ,UAAU0Z,KAAO,WACtB,IAAID,EAAM,IAAIxX,EAAG,MAEjB,OADAwX,EAAIjX,MAAQ,IAAIwB,MAAMJ,KAAKiB,KAAKvC,KAAKwP,EAAI,KAClC2H,CACT,EAEAF,EAAOvZ,UAAUsa,QAAU,SAAkBvW,GAG3C,IACIwW,EADAlX,EAAIU,EAGR,GACEzB,KAAKkY,MAAMnX,EAAGf,KAAKmX,KAGnBc,GADAlX,GADAA,EAAIf,KAAKmY,MAAMpX,IACT+G,KAAK9H,KAAKmX,MACPpR,kBACFkS,EAAOjY,KAAKwP,GAErB,IAAIzN,EAAMkW,EAAOjY,KAAKwP,GAAK,EAAIzO,EAAEyT,KAAKxU,KAAK+O,GAgB3C,OAfY,IAARhN,GACFhB,EAAEb,MAAM,GAAK,EACba,EAAErC,OAAS,GACFqD,EAAM,EACfhB,EAAEgH,KAAK/H,KAAK+O,QAEI3P,IAAZ2B,EAAE4B,MAEJ5B,EAAE4B,QAGF5B,EAAEqX,SAICrX,CACT,EAEAkW,EAAOvZ,UAAUwa,MAAQ,SAAgBG,EAAOtU,GAC9CsU,EAAM3S,OAAO1F,KAAKwP,EAAG,EAAGzL,EAC1B,EAEAkT,EAAOvZ,UAAUya,MAAQ,SAAgB1W,GACvC,OAAOA,EAAIyK,KAAKlM,KAAKoE,EACvB,EAQA1E,EAAS2X,EAAMJ,GAEfI,EAAK3Z,UAAUwa,MAAQ,SAAgBG,EAAOC,GAK5C,IAHA,IAAIhH,EAAO,QAEPiH,EAASjX,KAAKC,IAAI8W,EAAM3Z,OAAQ,GAC3B8C,EAAI,EAAGA,EAAI+W,EAAQ/W,IAC1B8W,EAAOpY,MAAMsB,GAAK6W,EAAMnY,MAAMsB,GAIhC,GAFA8W,EAAO5Z,OAAS6Z,EAEZF,EAAM3Z,QAAU,EAGlB,OAFA2Z,EAAMnY,MAAM,GAAK,OACjBmY,EAAM3Z,OAAS,GAKjB,IAAI8Z,EAAOH,EAAMnY,MAAM,GAGvB,IAFAoY,EAAOpY,MAAMoY,EAAO5Z,UAAY8Z,EAAOlH,EAElC9P,EAAI,GAAIA,EAAI6W,EAAM3Z,OAAQ8C,IAAK,CAClC,IAAIiX,EAAwB,EAAjBJ,EAAMnY,MAAMsB,GACvB6W,EAAMnY,MAAMsB,EAAI,KAAQiX,EAAOnH,IAAS,EAAMkH,IAAS,GACvDA,EAAOC,CACT,CACAD,KAAU,GACVH,EAAMnY,MAAMsB,EAAI,IAAMgX,EACT,IAATA,GAAcH,EAAM3Z,OAAS,GAC/B2Z,EAAM3Z,QAAU,GAEhB2Z,EAAM3Z,QAAU,CAEpB,EAEA2Y,EAAK3Z,UAAUya,MAAQ,SAAgB1W,GAErCA,EAAIvB,MAAMuB,EAAI/C,QAAU,EACxB+C,EAAIvB,MAAMuB,EAAI/C,OAAS,GAAK,EAC5B+C,EAAI/C,QAAU,EAId,IADA,IAAIwF,EAAK,EACA1C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CACnC,IAAIiB,EAAmB,EAAfhB,EAAIvB,MAAMsB,GAClB0C,GAAU,IAAJzB,EACNhB,EAAIvB,MAAMsB,GAAU,SAAL0C,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,EACtC,CASA,OANkC,IAA9BzC,EAAIvB,MAAMuB,EAAI/C,OAAS,KACzB+C,EAAI/C,SAC8B,IAA9B+C,EAAIvB,MAAMuB,EAAI/C,OAAS,IACzB+C,EAAI/C,UAGD+C,CACT,EAQA/B,EAAS6X,EAAMN,GAQfvX,EAAS8X,EAAMP,GASfvX,EAAS+X,EAAQR,GAEjBQ,EAAO/Z,UAAUya,MAAQ,SAAgB1W,GAGvC,IADA,IAAI0C,EAAQ,EACH3C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CACnC,IAAIwE,EAA0B,IAAL,EAAfvE,EAAIvB,MAAMsB,IAAiB2C,EACjCD,EAAU,SAAL8B,EACTA,KAAQ,GAERvE,EAAIvB,MAAMsB,GAAK0C,EACfC,EAAQ6B,CACV,CAIA,OAHc,IAAV7B,IACF1C,EAAIvB,MAAMuB,EAAI/C,UAAYyF,GAErB1C,CACT,EAGA9B,EAAGgY,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAIzX,MAAM,iBAAmByX,GAFnCQ,EAAQ,IAAID,CAGd,CAGA,OAFAb,EAAOM,GAAQQ,EAERA,CACT,EAiBAvC,EAAIzX,UAAU2Y,SAAW,SAAmBrS,GAC1C1E,EAAsB,IAAf0E,EAAE/D,SAAgB,iCACzBX,EAAO0E,EAAE7D,IAAK,kCAChB,EAEAgV,EAAIzX,UAAUwY,SAAW,SAAmBlS,EAAGC,GAC7C3E,EAAqC,IAA7B0E,EAAE/D,SAAWgE,EAAEhE,UAAiB,iCACxCX,EAAO0E,EAAE7D,KAAO6D,EAAE7D,MAAQ8D,EAAE9D,IAC1B,kCACJ,EAEAgV,EAAIzX,UAAUma,KAAO,SAAe7T,GAClC,OAAIhE,KAAK0X,MAAc1X,KAAK0X,MAAMM,QAAQhU,GAAGuR,UAAUvV,MAChDgE,EAAE8O,KAAK9S,KAAKyP,GAAG8F,UAAUvV,KAClC,EAEAmV,EAAIzX,UAAUkJ,IAAM,SAAc5C,GAChC,OAAIA,EAAEW,SACGX,EAAEV,QAGJtD,KAAKyP,EAAExH,IAAIjE,GAAGuR,UAAUvV,KACjC,EAEAmV,EAAIzX,UAAUsK,IAAM,SAAchE,EAAGC,GACnCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEgE,IAAI/D,GAIhB,OAHIsB,EAAIxD,IAAI/B,KAAKyP,IAAM,GACrBlK,EAAIwC,KAAK/H,KAAKyP,GAETlK,EAAIgQ,UAAUvV,KACvB,EAEAmV,EAAIzX,UAAUoK,KAAO,SAAe9D,EAAGC,GACrCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE8D,KAAK7D,GAIjB,OAHIsB,EAAIxD,IAAI/B,KAAKyP,IAAM,GACrBlK,EAAIwC,KAAK/H,KAAKyP,GAETlK,CACT,EAEA4P,EAAIzX,UAAUuK,IAAM,SAAcjE,EAAGC,GACnCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEiE,IAAIhE,GAIhB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK9H,KAAKyP,GAETlK,EAAIgQ,UAAUvV,KACvB,EAEAmV,EAAIzX,UAAUqK,KAAO,SAAe/D,EAAGC,GACrCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE+D,KAAK9D,GAIjB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK9H,KAAKyP,GAETlK,CACT,EAEA4P,EAAIzX,UAAUsY,IAAM,SAAchS,EAAGvC,GAEnC,OADAzB,KAAKqW,SAASrS,GACPhE,KAAK6X,KAAK7T,EAAE0N,MAAMjQ,GAC3B,EAEA0T,EAAIzX,UAAUwO,KAAO,SAAelI,EAAGC,GAErC,OADAjE,KAAKkW,SAASlS,EAAGC,GACVjE,KAAK6X,KAAK7T,EAAEkI,KAAKjI,GAC1B,EAEAkR,EAAIzX,UAAU0D,IAAM,SAAc4C,EAAGC,GAEnC,OADAjE,KAAKkW,SAASlS,EAAGC,GACVjE,KAAK6X,KAAK7T,EAAE5C,IAAI6C,GACzB,EAEAkR,EAAIzX,UAAUkT,KAAO,SAAe5M,GAClC,OAAOhE,KAAKkM,KAAKlI,EAAGA,EAAEV,QACxB,EAEA6R,EAAIzX,UAAUiT,IAAM,SAAc3M,GAChC,OAAOhE,KAAKoB,IAAI4C,EAAGA,EACrB,EAEAmR,EAAIzX,UAAU8Y,KAAO,SAAexS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEV,QAEzB,IAAIoV,EAAO1Y,KAAKyP,EAAEhK,MAAM,GAIxB,GAHAnG,EAAOoZ,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIvV,EAAMnD,KAAKyP,EAAEzH,IAAI,IAAIrI,EAAG,IAAI+F,OAAO,GACvC,OAAO1F,KAAKmD,IAAIa,EAAGb,EACrB,CAOA,IAFA,IAAIqC,EAAIxF,KAAKyP,EAAEwC,KAAK,GAChBxD,EAAI,GACAjJ,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXpG,GAAQkG,EAAEb,UAEV,IAAIgU,EAAM,IAAIhZ,EAAG,GAAGyV,MAAMpV,MACtB4Y,EAAOD,EAAIjC,SAIXmC,EAAO7Y,KAAKyP,EAAEwC,KAAK,GAAGvM,OAAO,GAC7BoT,EAAI9Y,KAAKyP,EAAE1J,YAGf,IAFA+S,EAAI,IAAInZ,EAAG,EAAImZ,EAAIA,GAAG1D,MAAMpV,MAEW,IAAhCA,KAAKmD,IAAI2V,EAAGD,GAAM9W,IAAI6W,IAC3BE,EAAElD,QAAQgD,GAOZ,IAJA,IAAIjY,EAAIX,KAAKmD,IAAI2V,EAAGtT,GAChBzE,EAAIf,KAAKmD,IAAIa,EAAGwB,EAAEwM,KAAK,GAAGtM,OAAO,IACjCG,EAAI7F,KAAKmD,IAAIa,EAAGwB,GAChBiK,EAAIhB,EACc,IAAf5I,EAAE9D,IAAI4W,IAAY,CAEvB,IADA,IAAIxB,EAAMtR,EACDrE,EAAI,EAAoB,IAAjB2V,EAAIpV,IAAI4W,GAAYnX,IAClC2V,EAAMA,EAAIf,SAEZ9W,EAAOkC,EAAIiO,GACX,IAAIxL,EAAIjE,KAAKmD,IAAIxC,EAAG,IAAIhB,EAAG,GAAGmR,OAAOrB,EAAIjO,EAAI,IAE7CT,EAAIA,EAAEkV,OAAOhS,GACbtD,EAAIsD,EAAEmS,SACNvQ,EAAIA,EAAEoQ,OAAOtV,GACb8O,EAAIjO,CACN,CAEA,OAAOT,CACT,EAEAoU,EAAIzX,UAAU4W,KAAO,SAAetQ,GAClC,IAAI+U,EAAM/U,EAAEiQ,OAAOjU,KAAKyP,GACxB,OAAqB,IAAjBsJ,EAAI9Y,UACN8Y,EAAI9Y,SAAW,EACRD,KAAK6X,KAAKkB,GAAKrC,UAEf1W,KAAK6X,KAAKkB,EAErB,EAEA5D,EAAIzX,UAAUyF,IAAM,SAAca,EAAGvC,GACnC,GAAIA,EAAIkD,SAAU,OAAO,IAAIhF,EAAG,GAAGyV,MAAMpV,MACzC,GAAoB,IAAhByB,EAAI4S,KAAK,GAAU,OAAOrQ,EAAEV,QAEhC,IACI0V,EAAM,IAAItX,MAAM,IACpBsX,EAAI,GAAK,IAAIrZ,EAAG,GAAGyV,MAAMpV,MACzBgZ,EAAI,GAAKhV,EACT,IAAK,IAAIxC,EAAI,EAAGA,EAAIwX,EAAIta,OAAQ8C,IAC9BwX,EAAIxX,GAAKxB,KAAKoB,IAAI4X,EAAIxX,EAAI,GAAIwC,GAGhC,IAAIuB,EAAMyT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbhY,EAAQO,EAAIsE,YAAc,GAK9B,IAJc,IAAV7E,IACFA,EAAQ,IAGLM,EAAIC,EAAI/C,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIwB,EAAOvB,EAAIvB,MAAMsB,GACZgB,EAAItB,EAAQ,EAAGsB,GAAK,EAAGA,IAAK,CACnC,IAAIoF,EAAO5E,GAAQR,EAAK,EACpB+C,IAAQyT,EAAI,KACdzT,EAAMvF,KAAK2Q,IAAIpL,IAGL,IAARqC,GAAyB,IAAZqR,GAKjBA,IAAY,EACZA,GAAWrR,GA9BE,KA+BbsR,GACwC,IAAN1X,GAAiB,IAANgB,KAE7C+C,EAAMvF,KAAKoB,IAAImE,EAAKyT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYjB,CACAhY,EAAQ,EACV,CAEA,OAAOqE,CACT,EAEA4P,EAAIzX,UAAU4X,UAAY,SAAoB7T,GAC5C,IAAIV,EAAIU,EAAIqR,KAAK9S,KAAKyP,GAEtB,OAAO1O,IAAMU,EAAMV,EAAEuC,QAAUvC,CACjC,EAEAoU,EAAIzX,UAAU+X,YAAc,SAAsBhU,GAChD,IAAI8D,EAAM9D,EAAI6B,QAEd,OADAiC,EAAIpF,IAAM,KACHoF,CACT,EAMA5F,EAAGwZ,KAAO,SAAe1X,GACvB,OAAO,IAAImW,EAAKnW,EAClB,EAkBA/B,EAASkY,EAAMzC,GAEfyC,EAAKla,UAAU4X,UAAY,SAAoB7T,GAC7C,OAAOzB,KAAK6X,KAAKpW,EAAIiQ,MAAM1R,KAAKoS,OAClC,EAEAwF,EAAKla,UAAU+X,YAAc,SAAsBhU,GACjD,IAAIV,EAAIf,KAAK6X,KAAKpW,EAAIL,IAAIpB,KAAK8X,OAE/B,OADA/W,EAAEZ,IAAM,KACDY,CACT,EAEA6W,EAAKla,UAAUwO,KAAO,SAAelI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE9D,MAAM,GAAK,EACb8D,EAAEtF,OAAS,EACJsF,EAGT,IAAI6B,EAAI7B,EAAEkI,KAAKjI,GACXtD,EAAIkF,EAAEiM,MAAM9R,KAAKoS,OAAOhR,IAAIpB,KAAK+X,MAAMlG,OAAO7R,KAAKoS,OAAOhR,IAAIpB,KAAKyP,GACnE2J,EAAIvT,EAAEkC,KAAKpH,GAAG+E,OAAO1F,KAAKoS,OAC1B7M,EAAM6T,EAQV,OANIA,EAAErX,IAAI/B,KAAKyP,IAAM,EACnBlK,EAAM6T,EAAErR,KAAK/H,KAAKyP,GACT2J,EAAE/E,KAAK,GAAK,IACrB9O,EAAM6T,EAAEtR,KAAK9H,KAAKyP,IAGblK,EAAIgQ,UAAUvV,KACvB,EAEA4X,EAAKla,UAAU0D,IAAM,SAAc4C,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAIhF,EAAG,GAAG4V,UAAUvV,MAEzD,IAAI6F,EAAI7B,EAAE5C,IAAI6C,GACVtD,EAAIkF,EAAEiM,MAAM9R,KAAKoS,OAAOhR,IAAIpB,KAAK+X,MAAMlG,OAAO7R,KAAKoS,OAAOhR,IAAIpB,KAAKyP,GACnE2J,EAAIvT,EAAEkC,KAAKpH,GAAG+E,OAAO1F,KAAKoS,OAC1B7M,EAAM6T,EAOV,OANIA,EAAErX,IAAI/B,KAAKyP,IAAM,EACnBlK,EAAM6T,EAAErR,KAAK/H,KAAKyP,GACT2J,EAAE/E,KAAK,GAAK,IACrB9O,EAAM6T,EAAEtR,KAAK9H,KAAKyP,IAGblK,EAAIgQ,UAAUvV,KACvB,EAEA4X,EAAKla,UAAU4W,KAAO,SAAetQ,GAGnC,OADUhE,KAAK6X,KAAK7T,EAAEiQ,OAAOjU,KAAKyP,GAAGrO,IAAIpB,KAAKkT,KACnCqC,UAAUvV,KACvB,CACD,CAr3GD,YAq3G4CA,8BC32G5C,MAAMqZ,EAAS,EAAQ,KACjBC,EAAU,EAAQ,KAClBC,EACe,mBAAXC,QAAkD,mBAAlBA,OAAY,IAChDA,OAAY,IAAE,8BACd,KAENxc,EAAQkB,OAASA,EACjBlB,EAAQqC,WAyTR,SAAqBX,GAInB,OAHKA,GAAUA,IACbA,EAAS,GAEJR,EAAOU,OAAOF,EACvB,EA7TA1B,EAAQyc,kBAAoB,GAE5B,MAAMC,EAAe,WAwDrB,SAASC,EAAcjb,GACrB,GAAIA,EAASgb,EACX,MAAM,IAAIE,WAAW,cAAgBlb,EAAS,kCAGhD,MAAMS,EAAM,IAAI0a,WAAWnb,GAE3B,OADArB,OAAOyc,eAAe3a,EAAKjB,EAAOR,WAC3ByB,CACT,CAYA,SAASjB,EAAQM,EAAKC,EAAkBC,GAEtC,GAAmB,iBAARF,EAAkB,CAC3B,GAAgC,iBAArBC,EACT,MAAM,IAAIM,UACR,sEAGJ,OAAOF,EAAYL,EACrB,CACA,OAAOG,EAAKH,EAAKC,EAAkBC,EACrC,CAIA,SAASC,EAAMf,EAAOa,EAAkBC,GACtC,GAAqB,iBAAVd,EACT,OAqHJ,SAAqB6C,EAAQvB,GAK3B,GAJwB,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,SAGRhB,EAAO6b,WAAW7a,GACrB,MAAM,IAAIH,UAAU,qBAAuBG,GAG7C,MAAMR,EAAwC,EAA/B0G,EAAW3E,EAAQvB,GAClC,IAAIC,EAAMwa,EAAajb,GAEvB,MAAMsb,EAAS7a,EAAI8a,MAAMxZ,EAAQvB,GASjC,OAPI8a,IAAWtb,IAIbS,EAAMA,EAAI+a,MAAM,EAAGF,IAGd7a,CACT,CA3IWgb,CAAWvc,EAAOa,GAG3B,GAAI2b,YAAYC,OAAOzc,GACrB,OAkJJ,SAAwB0c,GACtB,GAAIC,EAAWD,EAAWT,YAAa,CACrC,MAAMzW,EAAO,IAAIyW,WAAWS,GAC5B,OAAOE,EAAgBpX,EAAKnF,OAAQmF,EAAKqX,WAAYrX,EAAKgC,WAC5D,CACA,OAAOsV,EAAcJ,EACvB,CAxJWK,CAAc/c,GAGvB,GAAa,MAATA,EACF,MAAM,IAAImB,UACR,yHACiDnB,GAIrD,GAAI2c,EAAW3c,EAAOwc,cACjBxc,GAAS2c,EAAW3c,EAAMK,OAAQmc,aACrC,OAAOI,EAAgB5c,EAAOa,EAAkBC,GAGlD,GAAiC,oBAAtBkc,oBACNL,EAAW3c,EAAOgd,oBAClBhd,GAAS2c,EAAW3c,EAAMK,OAAQ2c,oBACrC,OAAOJ,EAAgB5c,EAAOa,EAAkBC,GAGlD,GAAqB,iBAAVd,EACT,MAAM,IAAImB,UACR,yEAIJ,MAAM8b,EAAUjd,EAAMid,SAAWjd,EAAMid,UACvC,GAAe,MAAXA,GAAmBA,IAAYjd,EACjC,OAAOM,EAAOS,KAAKkc,EAASpc,EAAkBC,GAGhD,MAAMuF,EAkJR,SAAqB6W,GACnB,GAAI5c,EAAO6c,SAASD,GAAM,CACxB,MAAMzZ,EAA4B,EAAtB2Z,EAAQF,EAAIpc,QAClBS,EAAMwa,EAAatY,GAEzB,OAAmB,IAAflC,EAAIT,QAIRoc,EAAI1X,KAAKjE,EAAK,EAAG,EAAGkC,GAHXlC,CAKX,CAEA,YAAmBC,IAAf0b,EAAIpc,OACoB,iBAAfoc,EAAIpc,QAAuBuc,EAAYH,EAAIpc,QAC7Cib,EAAa,GAEfe,EAAcI,GAGN,WAAbA,EAAII,MAAqBxZ,MAAMC,QAAQmZ,EAAIK,MACtCT,EAAcI,EAAIK,WAD3B,CAGF,CAzKYC,CAAWxd,GACrB,GAAIqG,EAAG,OAAOA,EAEd,GAAsB,oBAAXuV,QAAgD,MAAtBA,OAAO6B,aACH,mBAA9Bzd,EAAM4b,OAAO6B,aACtB,OAAOnd,EAAOS,KAAKf,EAAM4b,OAAO6B,aAAa,UAAW5c,EAAkBC,GAG5E,MAAM,IAAIK,UACR,yHACiDnB,EAErD,CAmBA,SAAS0d,EAAYtc,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,0CACf,GAAIC,EAAO,EAChB,MAAM,IAAI4a,WAAW,cAAgB5a,EAAO,iCAEhD,CA0BA,SAASH,EAAaG,GAEpB,OADAsc,EAAWtc,GACJ2a,EAAa3a,EAAO,EAAI,EAAoB,EAAhBgc,EAAQhc,GAC7C,CAuCA,SAAS0b,EAAea,GACtB,MAAM7c,EAAS6c,EAAM7c,OAAS,EAAI,EAA4B,EAAxBsc,EAAQO,EAAM7c,QAC9CS,EAAMwa,EAAajb,GACzB,IAAK,IAAI8C,EAAI,EAAGA,EAAI9C,EAAQ8C,GAAK,EAC/BrC,EAAIqC,GAAgB,IAAX+Z,EAAM/Z,GAEjB,OAAOrC,CACT,CAUA,SAASqb,EAAiBe,EAAOd,EAAY/b,GAC3C,GAAI+b,EAAa,GAAKc,EAAMnW,WAAaqV,EACvC,MAAM,IAAIb,WAAW,wCAGvB,GAAI2B,EAAMnW,WAAaqV,GAAc/b,GAAU,GAC7C,MAAM,IAAIkb,WAAW,wCAGvB,IAAIza,EAYJ,OAVEA,OADiBC,IAAfqb,QAAuCrb,IAAXV,EACxB,IAAImb,WAAW0B,QACDnc,IAAXV,EACH,IAAImb,WAAW0B,EAAOd,GAEtB,IAAIZ,WAAW0B,EAAOd,EAAY/b,GAI1CrB,OAAOyc,eAAe3a,EAAKjB,EAAOR,WAE3ByB,CACT,CA2BA,SAAS6b,EAAStc,GAGhB,GAAIA,GAAUgb,EACZ,MAAM,IAAIE,WAAW,0DACaF,EAAaxX,SAAS,IAAM,UAEhE,OAAgB,EAATxD,CACT,CAsGA,SAAS0G,EAAY3E,EAAQvB,GAC3B,GAAIhB,EAAO6c,SAASta,GAClB,OAAOA,EAAO/B,OAEhB,GAAI0b,YAAYC,OAAO5Z,IAAW8Z,EAAW9Z,EAAQ2Z,aACnD,OAAO3Z,EAAO2E,WAEhB,GAAsB,iBAAX3E,EACT,MAAM,IAAI1B,UACR,kGAC0B0B,GAI9B,MAAMY,EAAMZ,EAAO/B,OACb8c,EAAaC,UAAU/c,OAAS,IAAsB,IAAjB+c,UAAU,GACrD,IAAKD,GAAqB,IAARna,EAAW,OAAO,EAGpC,IAAIqa,GAAc,EAClB,OACE,OAAQxc,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOmC,EACT,IAAK,OACL,IAAK,QACH,OAAOsa,EAAYlb,GAAQ/B,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAAN2C,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAOua,EAAcnb,GAAQ/B,OAC/B,QACE,GAAIgd,EACF,OAAOF,GAAa,EAAIG,EAAYlb,GAAQ/B,OAE9CQ,GAAY,GAAKA,GAAU2c,cAC3BH,GAAc,EAGtB,CAGA,SAASI,EAAc5c,EAAUgC,EAAOC,GACtC,IAAIua,GAAc,EAclB,SALctc,IAAV8B,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQlB,KAAKtB,OACf,MAAO,GAOT,SAJYU,IAAR+B,GAAqBA,EAAMnB,KAAKtB,UAClCyC,EAAMnB,KAAKtB,QAGTyC,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACTD,KAAW,GAGT,MAAO,GAKT,IAFKhC,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAO6c,EAAS/b,KAAMkB,EAAOC,GAE/B,IAAK,OACL,IAAK,QACH,OAAO6a,EAAUhc,KAAMkB,EAAOC,GAEhC,IAAK,QACH,OAAO8a,EAAWjc,KAAMkB,EAAOC,GAEjC,IAAK,SACL,IAAK,SACH,OAAO+a,EAAYlc,KAAMkB,EAAOC,GAElC,IAAK,SACH,OAAOgb,EAAYnc,KAAMkB,EAAOC,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOib,EAAapc,KAAMkB,EAAOC,GAEnC,QACE,GAAIua,EAAa,MAAM,IAAI3c,UAAU,qBAAuBG,GAC5DA,GAAYA,EAAW,IAAI2c,cAC3BH,GAAc,EAGtB,CAUA,SAASW,EAAMpY,EAAGuL,EAAGC,GACnB,MAAMjO,EAAIyC,EAAEuL,GACZvL,EAAEuL,GAAKvL,EAAEwL,GACTxL,EAAEwL,GAAKjO,CACT,CA2IA,SAAS8a,EAAsBre,EAAQsB,EAAKkb,EAAYvb,EAAUqd,GAEhE,GAAsB,IAAlBte,EAAOS,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAf+b,GACTvb,EAAWub,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAGZQ,EADJR,GAAcA,KAGZA,EAAa8B,EAAM,EAAKte,EAAOS,OAAS,GAItC+b,EAAa,IAAGA,EAAaxc,EAAOS,OAAS+b,GAC7CA,GAAcxc,EAAOS,OAAQ,CAC/B,GAAI6d,EAAK,OAAQ,EACZ9B,EAAaxc,EAAOS,OAAS,CACpC,MAAO,GAAI+b,EAAa,EAAG,CACzB,IAAI8B,EACC,OAAQ,EADJ9B,EAAa,CAExB,CAQA,GALmB,iBAARlb,IACTA,EAAMrB,EAAOS,KAAKY,EAAKL,IAIrBhB,EAAO6c,SAASxb,GAElB,OAAmB,IAAfA,EAAIb,QACE,EAEH8d,EAAave,EAAQsB,EAAKkb,EAAYvb,EAAUqd,GAClD,GAAmB,iBAARhd,EAEhB,OADAA,GAAY,IACgC,mBAAjCsa,WAAWnc,UAAU+e,QAC1BF,EACK1C,WAAWnc,UAAU+e,QAAQnF,KAAKrZ,EAAQsB,EAAKkb,GAE/CZ,WAAWnc,UAAUgf,YAAYpF,KAAKrZ,EAAQsB,EAAKkb,GAGvD+B,EAAave,EAAQ,CAACsB,GAAMkb,EAAYvb,EAAUqd,GAG3D,MAAM,IAAIxd,UAAU,uCACtB,CAEA,SAASyd,EAAcG,EAAKpd,EAAKkb,EAAYvb,EAAUqd,GACrD,IA0BI/a,EA1BAob,EAAY,EACZC,EAAYF,EAAIje,OAChBoe,EAAYvd,EAAIb,OAEpB,QAAiBU,IAAbF,IAEe,UADjBA,EAAW6d,OAAO7d,GAAU2c,gBACY,UAAb3c,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAIyd,EAAIje,OAAS,GAAKa,EAAIb,OAAS,EACjC,OAAQ,EAEVke,EAAY,EACZC,GAAa,EACbC,GAAa,EACbrC,GAAc,CAChB,CAGF,SAASuC,EAAM7d,EAAKqC,GAClB,OAAkB,IAAdob,EACKzd,EAAIqC,GAEJrC,EAAI8d,aAAazb,EAAIob,EAEhC,CAGA,GAAIL,EAAK,CACP,IAAIW,GAAc,EAClB,IAAK1b,EAAIiZ,EAAYjZ,EAAIqb,EAAWrb,IAClC,GAAIwb,EAAKL,EAAKnb,KAAOwb,EAAKzd,GAAqB,IAAhB2d,EAAoB,EAAI1b,EAAI0b,IAEzD,IADoB,IAAhBA,IAAmBA,EAAa1b,GAChCA,EAAI0b,EAAa,IAAMJ,EAAW,OAAOI,EAAaN,OAEtC,IAAhBM,IAAmB1b,GAAKA,EAAI0b,GAChCA,GAAc,CAGpB,MAEE,IADIzC,EAAaqC,EAAYD,IAAWpC,EAAaoC,EAAYC,GAC5Dtb,EAAIiZ,EAAYjZ,GAAK,EAAGA,IAAK,CAChC,IAAI2b,GAAQ,EACZ,IAAK,IAAI3a,EAAI,EAAGA,EAAIsa,EAAWta,IAC7B,GAAIwa,EAAKL,EAAKnb,EAAIgB,KAAOwa,EAAKzd,EAAKiD,GAAI,CACrC2a,GAAQ,EACR,KACF,CAEF,GAAIA,EAAO,OAAO3b,CACpB,CAGF,OAAQ,CACV,CAcA,SAAS4b,EAAUje,EAAKsB,EAAQ4c,EAAQ3e,GACtC2e,EAASC,OAAOD,IAAW,EAC3B,MAAME,EAAYpe,EAAIT,OAAS2e,EAC1B3e,GAGHA,EAAS4e,OAAO5e,IACH6e,IACX7e,EAAS6e,GAJX7e,EAAS6e,EAQX,MAAMC,EAAS/c,EAAO/B,OAKtB,IAAI8C,EACJ,IAJI9C,EAAS8e,EAAS,IACpB9e,EAAS8e,EAAS,GAGfhc,EAAI,EAAGA,EAAI9C,IAAU8C,EAAG,CAC3B,MAAMic,EAASC,SAASjd,EAAOkd,OAAW,EAAJnc,EAAO,GAAI,IACjD,GAAIyZ,EAAYwC,GAAS,OAAOjc,EAChCrC,EAAIke,EAAS7b,GAAKic,CACpB,CACA,OAAOjc,CACT,CAEA,SAASoc,EAAWze,EAAKsB,EAAQ4c,EAAQ3e,GACvC,OAAOmf,EAAWlC,EAAYlb,EAAQtB,EAAIT,OAAS2e,GAASle,EAAKke,EAAQ3e,EAC3E,CAEA,SAASof,EAAY3e,EAAKsB,EAAQ4c,EAAQ3e,GACxC,OAAOmf,EAypCT,SAAuB5c,GACrB,MAAM8c,EAAY,GAClB,IAAK,IAAIvc,EAAI,EAAGA,EAAIP,EAAIvC,SAAU8C,EAEhCuc,EAAUC,KAAyB,IAApB/c,EAAIL,WAAWY,IAEhC,OAAOuc,CACT,CAhqCoBE,CAAaxd,GAAStB,EAAKke,EAAQ3e,EACvD,CAEA,SAASwf,EAAa/e,EAAKsB,EAAQ4c,EAAQ3e,GACzC,OAAOmf,EAAWjC,EAAcnb,GAAStB,EAAKke,EAAQ3e,EACxD,CAEA,SAASyf,EAAWhf,EAAKsB,EAAQ4c,EAAQ3e,GACvC,OAAOmf,EA0pCT,SAAyB5c,EAAKmd,GAC5B,IAAIzd,EAAGqF,EAAI9B,EACX,MAAM6Z,EAAY,GAClB,IAAK,IAAIvc,EAAI,EAAGA,EAAIP,EAAIvC,WACjB0f,GAAS,GAAK,KADa5c,EAGhCb,EAAIM,EAAIL,WAAWY,GACnBwE,EAAKrF,GAAK,EACVuD,EAAKvD,EAAI,IACTod,EAAUC,KAAK9Z,GACf6Z,EAAUC,KAAKhY,GAGjB,OAAO+X,CACT,CAxqCoBM,CAAe5d,EAAQtB,EAAIT,OAAS2e,GAASle,EAAKke,EAAQ3e,EAC9E,CA8EA,SAASyd,EAAahd,EAAK+B,EAAOC,GAChC,OAAc,IAAVD,GAAeC,IAAQhC,EAAIT,OACtB2a,EAAOiF,cAAcnf,GAErBka,EAAOiF,cAAcnf,EAAI+a,MAAMhZ,EAAOC,GAEjD,CAEA,SAAS6a,EAAW7c,EAAK+B,EAAOC,GAC9BA,EAAMG,KAAKC,IAAIpC,EAAIT,OAAQyC,GAC3B,MAAMoE,EAAM,GAEZ,IAAI/D,EAAIN,EACR,KAAOM,EAAIL,GAAK,CACd,MAAMod,EAAYpf,EAAIqC,GACtB,IAAIgd,EAAY,KACZC,EAAoBF,EAAY,IAChC,EACCA,EAAY,IACT,EACCA,EAAY,IACT,EACA,EAEZ,GAAI/c,EAAIid,GAAoBtd,EAAK,CAC/B,IAAIud,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EACHG,EAAavf,EAAIqC,EAAI,GACO,MAAV,IAAbkd,KACHG,GAA6B,GAAZN,IAAqB,EAAoB,GAAbG,EACzCG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAavf,EAAIqC,EAAI,GACrBmd,EAAYxf,EAAIqC,EAAI,GACQ,MAAV,IAAbkd,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZN,IAAoB,IAAoB,GAAbG,IAAsB,EAAmB,GAAZC,EACrEE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAavf,EAAIqC,EAAI,GACrBmd,EAAYxf,EAAIqC,EAAI,GACpBod,EAAazf,EAAIqC,EAAI,GACO,MAAV,IAAbkd,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZN,IAAoB,IAAqB,GAAbG,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,EAClGC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,IAItB,CAEkB,OAAdL,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbjZ,EAAIyY,KAAKQ,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvBjZ,EAAIyY,KAAKQ,GACThd,GAAKid,CACP,CAEA,OAQF,SAAgCK,GAC9B,MAAMzd,EAAMyd,EAAWpgB,OACvB,GAAI2C,GAAO0d,EACT,OAAOhC,OAAOiC,aAAaC,MAAMlC,OAAQ+B,GAI3C,IAAIvZ,EAAM,GACN/D,EAAI,EACR,KAAOA,EAAIH,GACTkE,GAAOwX,OAAOiC,aAAaC,MACzBlC,OACA+B,EAAW5E,MAAM1Y,EAAGA,GAAKud,IAG7B,OAAOxZ,CACT,CAxBS2Z,CAAsB3Z,EAC/B,CA3+BAvI,EAAQmiB,WAAazF,EAgBrBxb,EAAOkhB,oBAUP,WAEE,IACE,MAAMzC,EAAM,IAAI9C,WAAW,GACrBwF,EAAQ,CAAEC,IAAK,WAAc,OAAO,EAAG,GAG7C,OAFAjiB,OAAOyc,eAAeuF,EAAOxF,WAAWnc,WACxCL,OAAOyc,eAAe6C,EAAK0C,GACN,KAAd1C,EAAI2C,KACb,CAAE,MAAO/e,GACP,OAAO,CACT,CACF,CArB6Bgf,GAExBrhB,EAAOkhB,qBAA0C,oBAAZI,SACb,mBAAlBA,QAAQC,OACjBD,QAAQC,MACN,iJAkBJpiB,OAAOqiB,eAAexhB,EAAOR,UAAW,SAAU,CAChDG,YAAY,EACZ8hB,IAAK,WACH,GAAKzhB,EAAO6c,SAAS/a,MACrB,OAAOA,KAAK/B,MACd,IAGFZ,OAAOqiB,eAAexhB,EAAOR,UAAW,SAAU,CAChDG,YAAY,EACZ8hB,IAAK,WACH,GAAKzhB,EAAO6c,SAAS/a,MACrB,OAAOA,KAAKya,UACd,IAoCFvc,EAAO0hB,SAAW,KA8DlB1hB,EAAOS,KAAO,SAAUf,EAAOa,EAAkBC,GAC/C,OAAOC,EAAKf,EAAOa,EAAkBC,EACvC,EAIArB,OAAOyc,eAAe5b,EAAOR,UAAWmc,WAAWnc,WACnDL,OAAOyc,eAAe5b,EAAQ2b,YA8B9B3b,EAAOU,MAAQ,SAAUI,EAAMC,EAAMC,GACnC,OArBF,SAAgBF,EAAMC,EAAMC,GAE1B,OADAoc,EAAWtc,GACPA,GAAQ,EACH2a,EAAa3a,QAETI,IAATH,EAIyB,iBAAbC,EACVya,EAAa3a,GAAMC,KAAKA,EAAMC,GAC9Bya,EAAa3a,GAAMC,KAAKA,GAEvB0a,EAAa3a,EACtB,CAOSJ,CAAMI,EAAMC,EAAMC,EAC3B,EAUAhB,EAAOW,YAAc,SAAUG,GAC7B,OAAOH,EAAYG,EACrB,EAIAd,EAAOY,gBAAkB,SAAUE,GACjC,OAAOH,EAAYG,EACrB,EA6GAd,EAAO6c,SAAW,SAAmB9W,GACnC,OAAY,MAALA,IAA6B,IAAhBA,EAAE4b,WACpB5b,IAAM/F,EAAOR,SACjB,EAEAQ,EAAO4hB,QAAU,SAAkB9b,EAAGC,GAGpC,GAFIsW,EAAWvW,EAAG6V,cAAa7V,EAAI9F,EAAOS,KAAKqF,EAAGA,EAAEqZ,OAAQrZ,EAAEoB,aAC1DmV,EAAWtW,EAAG4V,cAAa5V,EAAI/F,EAAOS,KAAKsF,EAAGA,EAAEoZ,OAAQpZ,EAAEmB,cACzDlH,EAAO6c,SAAS/W,KAAO9F,EAAO6c,SAAS9W,GAC1C,MAAM,IAAIlF,UACR,yEAIJ,GAAIiF,IAAMC,EAAG,OAAO,EAEpB,IAAIuJ,EAAIxJ,EAAEtF,OACN+O,EAAIxJ,EAAEvF,OAEV,IAAK,IAAI8C,EAAI,EAAGH,EAAMC,KAAKC,IAAIiM,EAAGC,GAAIjM,EAAIH,IAAOG,EAC/C,GAAIwC,EAAExC,KAAOyC,EAAEzC,GAAI,CACjBgM,EAAIxJ,EAAExC,GACNiM,EAAIxJ,EAAEzC,GACN,KACF,CAGF,OAAIgM,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,CACT,EAEAtP,EAAO6b,WAAa,SAAqB7a,GACvC,OAAQ6d,OAAO7d,GAAU2c,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,EAEb,EAEA3d,EAAO6hB,OAAS,SAAiBC,EAAMthB,GACrC,IAAKgD,MAAMC,QAAQqe,GACjB,MAAM,IAAIjhB,UAAU,+CAGtB,GAAoB,IAAhBihB,EAAKthB,OACP,OAAOR,EAAOU,MAAM,GAGtB,IAAI4C,EACJ,QAAepC,IAAXV,EAEF,IADAA,EAAS,EACJ8C,EAAI,EAAGA,EAAIwe,EAAKthB,SAAU8C,EAC7B9C,GAAUshB,EAAKxe,GAAG9C,OAItB,MAAMT,EAASC,EAAOW,YAAYH,GAClC,IAAIuhB,EAAM,EACV,IAAKze,EAAI,EAAGA,EAAIwe,EAAKthB,SAAU8C,EAAG,CAChC,IAAIrC,EAAM6gB,EAAKxe,GACf,GAAI+Y,EAAWpb,EAAK0a,YACdoG,EAAM9gB,EAAIT,OAAST,EAAOS,QACvBR,EAAO6c,SAAS5b,KAAMA,EAAMjB,EAAOS,KAAKQ,IAC7CA,EAAIiE,KAAKnF,EAAQgiB,IAEjBpG,WAAWnc,UAAUwiB,IAAI5I,KACvBrZ,EACAkB,EACA8gB,OAGC,KAAK/hB,EAAO6c,SAAS5b,GAC1B,MAAM,IAAIJ,UAAU,+CAEpBI,EAAIiE,KAAKnF,EAAQgiB,EACnB,CACAA,GAAO9gB,EAAIT,MACb,CACA,OAAOT,CACT,EAiDAC,EAAOkH,WAAaA,EA8EpBlH,EAAOR,UAAUmiB,WAAY,EAQ7B3hB,EAAOR,UAAUyiB,OAAS,WACxB,MAAM9e,EAAMrB,KAAKtB,OACjB,GAAI2C,EAAM,GAAM,EACd,MAAM,IAAIuY,WAAW,6CAEvB,IAAK,IAAIpY,EAAI,EAAGA,EAAIH,EAAKG,GAAK,EAC5B6a,EAAKrc,KAAMwB,EAAGA,EAAI,GAEpB,OAAOxB,IACT,EAEA9B,EAAOR,UAAU0iB,OAAS,WACxB,MAAM/e,EAAMrB,KAAKtB,OACjB,GAAI2C,EAAM,GAAM,EACd,MAAM,IAAIuY,WAAW,6CAEvB,IAAK,IAAIpY,EAAI,EAAGA,EAAIH,EAAKG,GAAK,EAC5B6a,EAAKrc,KAAMwB,EAAGA,EAAI,GAClB6a,EAAKrc,KAAMwB,EAAI,EAAGA,EAAI,GAExB,OAAOxB,IACT,EAEA9B,EAAOR,UAAU2iB,OAAS,WACxB,MAAMhf,EAAMrB,KAAKtB,OACjB,GAAI2C,EAAM,GAAM,EACd,MAAM,IAAIuY,WAAW,6CAEvB,IAAK,IAAIpY,EAAI,EAAGA,EAAIH,EAAKG,GAAK,EAC5B6a,EAAKrc,KAAMwB,EAAGA,EAAI,GAClB6a,EAAKrc,KAAMwB,EAAI,EAAGA,EAAI,GACtB6a,EAAKrc,KAAMwB,EAAI,EAAGA,EAAI,GACtB6a,EAAKrc,KAAMwB,EAAI,EAAGA,EAAI,GAExB,OAAOxB,IACT,EAEA9B,EAAOR,UAAUwE,SAAW,WAC1B,MAAMxD,EAASsB,KAAKtB,OACpB,OAAe,IAAXA,EAAqB,GACA,IAArB+c,UAAU/c,OAAqBsd,EAAUhc,KAAM,EAAGtB,GAC/Cod,EAAamD,MAAMjf,KAAMyb,UAClC,EAEAvd,EAAOR,UAAU4iB,eAAiBpiB,EAAOR,UAAUwE,SAEnDhE,EAAOR,UAAU6iB,OAAS,SAAiBtc,GACzC,IAAK/F,EAAO6c,SAAS9W,GAAI,MAAM,IAAIlF,UAAU,6BAC7C,OAAIiB,OAASiE,GACsB,IAA5B/F,EAAO4hB,QAAQ9f,KAAMiE,EAC9B,EAEA/F,EAAOR,UAAU+F,QAAU,WACzB,IAAIxC,EAAM,GACV,MAAMW,EAAM5E,EAAQyc,kBAGpB,OAFAxY,EAAMjB,KAAKkC,SAAS,MAAO,EAAGN,GAAKO,QAAQ,UAAW,OAAOqe,OACzDxgB,KAAKtB,OAASkD,IAAKX,GAAO,SACvB,WAAaA,EAAM,GAC5B,EACIsY,IACFrb,EAAOR,UAAU6b,GAAuBrb,EAAOR,UAAU+F,SAG3DvF,EAAOR,UAAUoiB,QAAU,SAAkBW,EAAQvf,EAAOC,EAAKuf,EAAWC,GAI1E,GAHIpG,EAAWkG,EAAQ5G,cACrB4G,EAASviB,EAAOS,KAAK8hB,EAAQA,EAAOpD,OAAQoD,EAAOrb,cAEhDlH,EAAO6c,SAAS0F,GACnB,MAAM,IAAI1hB,UACR,wFAC2B0hB,GAiB/B,QAbcrhB,IAAV8B,IACFA,EAAQ,QAEE9B,IAAR+B,IACFA,EAAMsf,EAASA,EAAO/hB,OAAS,QAEfU,IAAdshB,IACFA,EAAY,QAEEthB,IAAZuhB,IACFA,EAAU3gB,KAAKtB,QAGbwC,EAAQ,GAAKC,EAAMsf,EAAO/hB,QAAUgiB,EAAY,GAAKC,EAAU3gB,KAAKtB,OACtE,MAAM,IAAIkb,WAAW,sBAGvB,GAAI8G,GAAaC,GAAWzf,GAASC,EACnC,OAAO,EAET,GAAIuf,GAAaC,EACf,OAAQ,EAEV,GAAIzf,GAASC,EACX,OAAO,EAQT,GAAInB,OAASygB,EAAQ,OAAO,EAE5B,IAAIjT,GAJJmT,KAAa,IADbD,KAAe,GAMXjT,GAPJtM,KAAS,IADTD,KAAW,GASX,MAAMG,EAAMC,KAAKC,IAAIiM,EAAGC,GAElBmT,EAAW5gB,KAAKka,MAAMwG,EAAWC,GACjCE,EAAaJ,EAAOvG,MAAMhZ,EAAOC,GAEvC,IAAK,IAAIK,EAAI,EAAGA,EAAIH,IAAOG,EACzB,GAAIof,EAASpf,KAAOqf,EAAWrf,GAAI,CACjCgM,EAAIoT,EAASpf,GACbiM,EAAIoT,EAAWrf,GACf,KACF,CAGF,OAAIgM,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,CACT,EA2HAtP,EAAOR,UAAUojB,SAAW,SAAmBvhB,EAAKkb,EAAYvb,GAC9D,OAAoD,IAA7Cc,KAAKyc,QAAQld,EAAKkb,EAAYvb,EACvC,EAEAhB,EAAOR,UAAU+e,QAAU,SAAkBld,EAAKkb,EAAYvb,GAC5D,OAAOod,EAAqBtc,KAAMT,EAAKkb,EAAYvb,GAAU,EAC/D,EAEAhB,EAAOR,UAAUgf,YAAc,SAAsBnd,EAAKkb,EAAYvb,GACpE,OAAOod,EAAqBtc,KAAMT,EAAKkb,EAAYvb,GAAU,EAC/D,EA4CAhB,EAAOR,UAAUuc,MAAQ,SAAgBxZ,EAAQ4c,EAAQ3e,EAAQQ,GAE/D,QAAeE,IAAXie,EACFne,EAAW,OACXR,EAASsB,KAAKtB,OACd2e,EAAS,OAEJ,QAAeje,IAAXV,GAA0C,iBAAX2e,EACxCne,EAAWme,EACX3e,EAASsB,KAAKtB,OACd2e,EAAS,MAEJ,KAAI0D,SAAS1D,GAUlB,MAAM,IAAI5d,MACR,2EAVF4d,KAAoB,EAChB0D,SAASriB,IACXA,KAAoB,OACHU,IAAbF,IAAwBA,EAAW,UAEvCA,EAAWR,EACXA,OAASU,EAMb,CAEA,MAAMme,EAAYvd,KAAKtB,OAAS2e,EAGhC,SAFeje,IAAXV,GAAwBA,EAAS6e,KAAW7e,EAAS6e,GAEpD9c,EAAO/B,OAAS,IAAMA,EAAS,GAAK2e,EAAS,IAAOA,EAASrd,KAAKtB,OACrE,MAAM,IAAIkb,WAAW,0CAGlB1a,IAAUA,EAAW,QAE1B,IAAIwc,GAAc,EAClB,OACE,OAAQxc,GACN,IAAK,MACH,OAAOke,EAASpd,KAAMS,EAAQ4c,EAAQ3e,GAExC,IAAK,OACL,IAAK,QACH,OAAOkf,EAAU5d,KAAMS,EAAQ4c,EAAQ3e,GAEzC,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOof,EAAW9d,KAAMS,EAAQ4c,EAAQ3e,GAE1C,IAAK,SAEH,OAAOwf,EAAYle,KAAMS,EAAQ4c,EAAQ3e,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOyf,EAAUne,KAAMS,EAAQ4c,EAAQ3e,GAEzC,QACE,GAAIgd,EAAa,MAAM,IAAI3c,UAAU,qBAAuBG,GAC5DA,GAAY,GAAKA,GAAU2c,cAC3BH,GAAc,EAGtB,EAEAxd,EAAOR,UAAUsH,OAAS,WACxB,MAAO,CACLkW,KAAM,SACNC,KAAMzZ,MAAMhE,UAAUwc,MAAM5C,KAAKtX,KAAKghB,MAAQhhB,KAAM,GAExD,EAyFA,MAAM+e,EAAuB,KAoB7B,SAAS9C,EAAY9c,EAAK+B,EAAOC,GAC/B,IAAI4D,EAAM,GACV5D,EAAMG,KAAKC,IAAIpC,EAAIT,OAAQyC,GAE3B,IAAK,IAAIK,EAAIN,EAAOM,EAAIL,IAAOK,EAC7BuD,GAAOgY,OAAOiC,aAAsB,IAAT7f,EAAIqC,IAEjC,OAAOuD,CACT,CAEA,SAASmX,EAAa/c,EAAK+B,EAAOC,GAChC,IAAI4D,EAAM,GACV5D,EAAMG,KAAKC,IAAIpC,EAAIT,OAAQyC,GAE3B,IAAK,IAAIK,EAAIN,EAAOM,EAAIL,IAAOK,EAC7BuD,GAAOgY,OAAOiC,aAAa7f,EAAIqC,IAEjC,OAAOuD,CACT,CAEA,SAASgX,EAAU5c,EAAK+B,EAAOC,GAC7B,MAAME,EAAMlC,EAAIT,SAEXwC,GAASA,EAAQ,KAAGA,EAAQ,KAC5BC,GAAOA,EAAM,GAAKA,EAAME,KAAKF,EAAME,GAExC,IAAI0C,EAAM,GACV,IAAK,IAAIvC,EAAIN,EAAOM,EAAIL,IAAOK,EAC7BuC,GAAOkd,EAAoB9hB,EAAIqC,IAEjC,OAAOuC,CACT,CAEA,SAASqY,EAAcjd,EAAK+B,EAAOC,GACjC,MAAM+f,EAAQ/hB,EAAI+a,MAAMhZ,EAAOC,GAC/B,IAAIoE,EAAM,GAEV,IAAK,IAAI/D,EAAI,EAAGA,EAAI0f,EAAMxiB,OAAS,EAAG8C,GAAK,EACzC+D,GAAOwX,OAAOiC,aAAakC,EAAM1f,GAAqB,IAAf0f,EAAM1f,EAAI,IAEnD,OAAO+D,CACT,CAiCA,SAAS4b,EAAa9D,EAAQ+D,EAAK1iB,GACjC,GAAK2e,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAIzD,WAAW,sBAC3D,GAAIyD,EAAS+D,EAAM1iB,EAAQ,MAAM,IAAIkb,WAAW,wCAClD,CAyQA,SAASyH,EAAUliB,EAAKvB,EAAOyf,EAAQ+D,EAAKxf,EAAKL,GAC/C,IAAKrD,EAAO6c,SAAS5b,GAAM,MAAM,IAAIJ,UAAU,+CAC/C,GAAInB,EAAQgE,GAAOhE,EAAQ2D,EAAK,MAAM,IAAIqY,WAAW,qCACrD,GAAIyD,EAAS+D,EAAMjiB,EAAIT,OAAQ,MAAM,IAAIkb,WAAW,qBACtD,CA+FA,SAAS0H,EAAgBniB,EAAKvB,EAAOyf,EAAQ9b,EAAKK,GAChD2f,EAAW3jB,EAAO2D,EAAKK,EAAKzC,EAAKke,EAAQ,GAEzC,IAAInZ,EAAKoZ,OAAO1f,EAAQ4jB,OAAO,aAC/BriB,EAAIke,KAAYnZ,EAChBA,IAAW,EACX/E,EAAIke,KAAYnZ,EAChBA,IAAW,EACX/E,EAAIke,KAAYnZ,EAChBA,IAAW,EACX/E,EAAIke,KAAYnZ,EAChB,IAAI8B,EAAKsX,OAAO1f,GAAS4jB,OAAO,IAAMA,OAAO,aAQ7C,OAPAriB,EAAIke,KAAYrX,EAChBA,IAAW,EACX7G,EAAIke,KAAYrX,EAChBA,IAAW,EACX7G,EAAIke,KAAYrX,EAChBA,IAAW,EACX7G,EAAIke,KAAYrX,EACTqX,CACT,CAEA,SAASoE,EAAgBtiB,EAAKvB,EAAOyf,EAAQ9b,EAAKK,GAChD2f,EAAW3jB,EAAO2D,EAAKK,EAAKzC,EAAKke,EAAQ,GAEzC,IAAInZ,EAAKoZ,OAAO1f,EAAQ4jB,OAAO,aAC/BriB,EAAIke,EAAS,GAAKnZ,EAClBA,IAAW,EACX/E,EAAIke,EAAS,GAAKnZ,EAClBA,IAAW,EACX/E,EAAIke,EAAS,GAAKnZ,EAClBA,IAAW,EACX/E,EAAIke,EAAS,GAAKnZ,EAClB,IAAI8B,EAAKsX,OAAO1f,GAAS4jB,OAAO,IAAMA,OAAO,aAQ7C,OAPAriB,EAAIke,EAAS,GAAKrX,EAClBA,IAAW,EACX7G,EAAIke,EAAS,GAAKrX,EAClBA,IAAW,EACX7G,EAAIke,EAAS,GAAKrX,EAClBA,IAAW,EACX7G,EAAIke,GAAUrX,EACPqX,EAAS,CAClB,CAkHA,SAASqE,EAAcviB,EAAKvB,EAAOyf,EAAQ+D,EAAKxf,EAAKL,GACnD,GAAI8b,EAAS+D,EAAMjiB,EAAIT,OAAQ,MAAM,IAAIkb,WAAW,sBACpD,GAAIyD,EAAS,EAAG,MAAM,IAAIzD,WAAW,qBACvC,CAEA,SAAS+H,EAAYxiB,EAAKvB,EAAOyf,EAAQ/X,EAAcsc,GAOrD,OANAhkB,GAASA,EACTyf,KAAoB,EACfuE,GACHF,EAAaviB,EAAKvB,EAAOyf,EAAQ,GAEnC/D,EAAQW,MAAM9a,EAAKvB,EAAOyf,EAAQ/X,EAAc,GAAI,GAC7C+X,EAAS,CAClB,CAUA,SAASwE,EAAa1iB,EAAKvB,EAAOyf,EAAQ/X,EAAcsc,GAOtD,OANAhkB,GAASA,EACTyf,KAAoB,EACfuE,GACHF,EAAaviB,EAAKvB,EAAOyf,EAAQ,GAEnC/D,EAAQW,MAAM9a,EAAKvB,EAAOyf,EAAQ/X,EAAc,GAAI,GAC7C+X,EAAS,CAClB,CAzkBAnf,EAAOR,UAAUwc,MAAQ,SAAgBhZ,EAAOC,GAC9C,MAAME,EAAMrB,KAAKtB,QACjBwC,IAAUA,GAGE,GACVA,GAASG,GACG,IAAGH,EAAQ,GACdA,EAAQG,IACjBH,EAAQG,IANVF,OAAc/B,IAAR+B,EAAoBE,IAAQF,GASxB,GACRA,GAAOE,GACG,IAAGF,EAAM,GACVA,EAAME,IACfF,EAAME,GAGJF,EAAMD,IAAOC,EAAMD,GAEvB,MAAM4gB,EAAS9hB,KAAK+hB,SAAS7gB,EAAOC,GAIpC,OAFA9D,OAAOyc,eAAegI,EAAQ5jB,EAAOR,WAE9BokB,CACT,EAUA5jB,EAAOR,UAAUskB,WACjB9jB,EAAOR,UAAUukB,WAAa,SAAqB5E,EAAQjY,EAAYwc,GACrEvE,KAAoB,EACpBjY,KAA4B,EACvBwc,GAAUT,EAAY9D,EAAQjY,EAAYpF,KAAKtB,QAEpD,IAAIa,EAAMS,KAAKqd,GACXjc,EAAM,EACNI,EAAI,EACR,OAASA,EAAI4D,IAAehE,GAAO,MACjC7B,GAAOS,KAAKqd,EAAS7b,GAAKJ,EAG5B,OAAO7B,CACT,EAEArB,EAAOR,UAAUwkB,WACjBhkB,EAAOR,UAAUykB,WAAa,SAAqB9E,EAAQjY,EAAYwc,GACrEvE,KAAoB,EACpBjY,KAA4B,EACvBwc,GACHT,EAAY9D,EAAQjY,EAAYpF,KAAKtB,QAGvC,IAAIa,EAAMS,KAAKqd,IAAWjY,GACtBhE,EAAM,EACV,KAAOgE,EAAa,IAAMhE,GAAO,MAC/B7B,GAAOS,KAAKqd,IAAWjY,GAAchE,EAGvC,OAAO7B,CACT,EAEArB,EAAOR,UAAU0kB,UACjBlkB,EAAOR,UAAU2kB,UAAY,SAAoBhF,EAAQuE,GAGvD,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACpCsB,KAAKqd,EACd,EAEAnf,EAAOR,UAAU4kB,aACjBpkB,EAAOR,UAAU6kB,aAAe,SAAuBlF,EAAQuE,GAG7D,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACpCsB,KAAKqd,GAAWrd,KAAKqd,EAAS,IAAM,CAC7C,EAEAnf,EAAOR,UAAU8kB,aACjBtkB,EAAOR,UAAUuf,aAAe,SAAuBI,EAAQuE,GAG7D,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACnCsB,KAAKqd,IAAW,EAAKrd,KAAKqd,EAAS,EAC7C,EAEAnf,EAAOR,UAAU+kB,aACjBvkB,EAAOR,UAAUglB,aAAe,SAAuBrF,EAAQuE,GAI7D,OAHAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,SAElCsB,KAAKqd,GACTrd,KAAKqd,EAAS,IAAM,EACpBrd,KAAKqd,EAAS,IAAM,IACD,SAAnBrd,KAAKqd,EAAS,EACrB,EAEAnf,EAAOR,UAAUilB,aACjBzkB,EAAOR,UAAUklB,aAAe,SAAuBvF,EAAQuE,GAI7D,OAHAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QAEpB,SAAfsB,KAAKqd,IACTrd,KAAKqd,EAAS,IAAM,GACrBrd,KAAKqd,EAAS,IAAM,EACrBrd,KAAKqd,EAAS,GAClB,EAEAnf,EAAOR,UAAUmlB,gBAAkBC,GAAmB,SAA0BzF,GAE9E0F,EADA1F,KAAoB,EACG,UACvB,MAAM2F,EAAQhjB,KAAKqd,GACb4F,EAAOjjB,KAAKqd,EAAS,QACbje,IAAV4jB,QAAgC5jB,IAAT6jB,GACzBC,EAAY7F,EAAQrd,KAAKtB,OAAS,GAGpC,MAAMwF,EAAK8e,EACQ,IAAjBhjB,OAAOqd,GACU,MAAjBrd,OAAOqd,GACPrd,OAAOqd,GAAU,GAAK,GAElBrX,EAAKhG,OAAOqd,GACC,IAAjBrd,OAAOqd,GACU,MAAjBrd,OAAOqd,GACP4F,EAAO,GAAK,GAEd,OAAOzB,OAAOtd,IAAOsd,OAAOxb,IAAOwb,OAAO,IAC5C,IAEAtjB,EAAOR,UAAUylB,gBAAkBL,GAAmB,SAA0BzF,GAE9E0F,EADA1F,KAAoB,EACG,UACvB,MAAM2F,EAAQhjB,KAAKqd,GACb4F,EAAOjjB,KAAKqd,EAAS,QACbje,IAAV4jB,QAAgC5jB,IAAT6jB,GACzBC,EAAY7F,EAAQrd,KAAKtB,OAAS,GAGpC,MAAMsH,EAAKgd,EAAQ,GAAK,GACL,MAAjBhjB,OAAOqd,GACU,IAAjBrd,OAAOqd,GACPrd,OAAOqd,GAEHnZ,EAAKlE,OAAOqd,GAAU,GAAK,GACd,MAAjBrd,OAAOqd,GACU,IAAjBrd,OAAOqd,GACP4F,EAEF,OAAQzB,OAAOxb,IAAOwb,OAAO,KAAOA,OAAOtd,EAC7C,IAEAhG,EAAOR,UAAU0lB,UAAY,SAAoB/F,EAAQjY,EAAYwc,GACnEvE,KAAoB,EACpBjY,KAA4B,EACvBwc,GAAUT,EAAY9D,EAAQjY,EAAYpF,KAAKtB,QAEpD,IAAIa,EAAMS,KAAKqd,GACXjc,EAAM,EACNI,EAAI,EACR,OAASA,EAAI4D,IAAehE,GAAO,MACjC7B,GAAOS,KAAKqd,EAAS7b,GAAKJ,EAM5B,OAJAA,GAAO,IAEH7B,GAAO6B,IAAK7B,GAAO+B,KAAK6B,IAAI,EAAG,EAAIiC,IAEhC7F,CACT,EAEArB,EAAOR,UAAU2lB,UAAY,SAAoBhG,EAAQjY,EAAYwc,GACnEvE,KAAoB,EACpBjY,KAA4B,EACvBwc,GAAUT,EAAY9D,EAAQjY,EAAYpF,KAAKtB,QAEpD,IAAI8C,EAAI4D,EACJhE,EAAM,EACN7B,EAAMS,KAAKqd,IAAW7b,GAC1B,KAAOA,EAAI,IAAMJ,GAAO,MACtB7B,GAAOS,KAAKqd,IAAW7b,GAAKJ,EAM9B,OAJAA,GAAO,IAEH7B,GAAO6B,IAAK7B,GAAO+B,KAAK6B,IAAI,EAAG,EAAIiC,IAEhC7F,CACT,EAEArB,EAAOR,UAAU4lB,SAAW,SAAmBjG,EAAQuE,GAGrD,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACtB,IAAfsB,KAAKqd,IAC0B,GAA5B,IAAOrd,KAAKqd,GAAU,GADKrd,KAAKqd,EAE3C,EAEAnf,EAAOR,UAAU6lB,YAAc,SAAsBlG,EAAQuE,GAC3DvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QAC3C,MAAMa,EAAMS,KAAKqd,GAAWrd,KAAKqd,EAAS,IAAM,EAChD,OAAc,MAAN9d,EAAsB,WAANA,EAAmBA,CAC7C,EAEArB,EAAOR,UAAU8lB,YAAc,SAAsBnG,EAAQuE,GAC3DvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QAC3C,MAAMa,EAAMS,KAAKqd,EAAS,GAAMrd,KAAKqd,IAAW,EAChD,OAAc,MAAN9d,EAAsB,WAANA,EAAmBA,CAC7C,EAEArB,EAAOR,UAAU+lB,YAAc,SAAsBpG,EAAQuE,GAI3D,OAHAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QAEnCsB,KAAKqd,GACVrd,KAAKqd,EAAS,IAAM,EACpBrd,KAAKqd,EAAS,IAAM,GACpBrd,KAAKqd,EAAS,IAAM,EACzB,EAEAnf,EAAOR,UAAUgmB,YAAc,SAAsBrG,EAAQuE,GAI3D,OAHAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QAEnCsB,KAAKqd,IAAW,GACrBrd,KAAKqd,EAAS,IAAM,GACpBrd,KAAKqd,EAAS,IAAM,EACpBrd,KAAKqd,EAAS,EACnB,EAEAnf,EAAOR,UAAUimB,eAAiBb,GAAmB,SAAyBzF,GAE5E0F,EADA1F,KAAoB,EACG,UACvB,MAAM2F,EAAQhjB,KAAKqd,GACb4F,EAAOjjB,KAAKqd,EAAS,QACbje,IAAV4jB,QAAgC5jB,IAAT6jB,GACzBC,EAAY7F,EAAQrd,KAAKtB,OAAS,GAGpC,MAAMa,EAAMS,KAAKqd,EAAS,GACL,IAAnBrd,KAAKqd,EAAS,GACK,MAAnBrd,KAAKqd,EAAS,IACb4F,GAAQ,IAEX,OAAQzB,OAAOjiB,IAAQiiB,OAAO,KAC5BA,OAAOwB,EACU,IAAjBhjB,OAAOqd,GACU,MAAjBrd,OAAOqd,GACPrd,OAAOqd,GAAU,GAAK,GAC1B,IAEAnf,EAAOR,UAAUkmB,eAAiBd,GAAmB,SAAyBzF,GAE5E0F,EADA1F,KAAoB,EACG,UACvB,MAAM2F,EAAQhjB,KAAKqd,GACb4F,EAAOjjB,KAAKqd,EAAS,QACbje,IAAV4jB,QAAgC5jB,IAAT6jB,GACzBC,EAAY7F,EAAQrd,KAAKtB,OAAS,GAGpC,MAAMa,GAAOyjB,GAAS,IACH,MAAjBhjB,OAAOqd,GACU,IAAjBrd,OAAOqd,GACPrd,OAAOqd,GAET,OAAQmE,OAAOjiB,IAAQiiB,OAAO,KAC5BA,OAAOxhB,OAAOqd,GAAU,GAAK,GACZ,MAAjBrd,OAAOqd,GACU,IAAjBrd,OAAOqd,GACP4F,EACJ,IAEA/kB,EAAOR,UAAUmmB,YAAc,SAAsBxG,EAAQuE,GAG3D,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACpC4a,EAAQ0D,KAAKhd,KAAMqd,GAAQ,EAAM,GAAI,EAC9C,EAEAnf,EAAOR,UAAUomB,YAAc,SAAsBzG,EAAQuE,GAG3D,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACpC4a,EAAQ0D,KAAKhd,KAAMqd,GAAQ,EAAO,GAAI,EAC/C,EAEAnf,EAAOR,UAAUqmB,aAAe,SAAuB1G,EAAQuE,GAG7D,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACpC4a,EAAQ0D,KAAKhd,KAAMqd,GAAQ,EAAM,GAAI,EAC9C,EAEAnf,EAAOR,UAAUsmB,aAAe,SAAuB3G,EAAQuE,GAG7D,OAFAvE,KAAoB,EACfuE,GAAUT,EAAY9D,EAAQ,EAAGrd,KAAKtB,QACpC4a,EAAQ0D,KAAKhd,KAAMqd,GAAQ,EAAO,GAAI,EAC/C,EAQAnf,EAAOR,UAAUumB,YACjB/lB,EAAOR,UAAUwmB,YAAc,SAAsBtmB,EAAOyf,EAAQjY,EAAYwc,GAC9EhkB,GAASA,EACTyf,KAAoB,EACpBjY,KAA4B,EACvBwc,GAEHP,EAASrhB,KAAMpC,EAAOyf,EAAQjY,EADb9D,KAAK6B,IAAI,EAAG,EAAIiC,GAAc,EACK,GAGtD,IAAIhE,EAAM,EACNI,EAAI,EAER,IADAxB,KAAKqd,GAAkB,IAARzf,IACN4D,EAAI4D,IAAehE,GAAO,MACjCpB,KAAKqd,EAAS7b,GAAM5D,EAAQwD,EAAO,IAGrC,OAAOic,EAASjY,CAClB,EAEAlH,EAAOR,UAAUymB,YACjBjmB,EAAOR,UAAU0mB,YAAc,SAAsBxmB,EAAOyf,EAAQjY,EAAYwc,GAC9EhkB,GAASA,EACTyf,KAAoB,EACpBjY,KAA4B,EACvBwc,GAEHP,EAASrhB,KAAMpC,EAAOyf,EAAQjY,EADb9D,KAAK6B,IAAI,EAAG,EAAIiC,GAAc,EACK,GAGtD,IAAI5D,EAAI4D,EAAa,EACjBhE,EAAM,EAEV,IADApB,KAAKqd,EAAS7b,GAAa,IAAR5D,IACV4D,GAAK,IAAMJ,GAAO,MACzBpB,KAAKqd,EAAS7b,GAAM5D,EAAQwD,EAAO,IAGrC,OAAOic,EAASjY,CAClB,EAEAlH,EAAOR,UAAU2mB,WACjBnmB,EAAOR,UAAU4mB,WAAa,SAAqB1mB,EAAOyf,EAAQuE,GAKhE,OAJAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,IAAM,GACtDrd,KAAKqd,GAAmB,IAARzf,EACTyf,EAAS,CAClB,EAEAnf,EAAOR,UAAU6mB,cACjBrmB,EAAOR,UAAU8mB,cAAgB,SAAwB5mB,EAAOyf,EAAQuE,GAMtE,OALAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,MAAQ,GACxDrd,KAAKqd,GAAmB,IAARzf,EAChBoC,KAAKqd,EAAS,GAAMzf,IAAU,EACvByf,EAAS,CAClB,EAEAnf,EAAOR,UAAU+mB,cACjBvmB,EAAOR,UAAUgnB,cAAgB,SAAwB9mB,EAAOyf,EAAQuE,GAMtE,OALAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,MAAQ,GACxDrd,KAAKqd,GAAWzf,IAAU,EAC1BoC,KAAKqd,EAAS,GAAc,IAARzf,EACbyf,EAAS,CAClB,EAEAnf,EAAOR,UAAUinB,cACjBzmB,EAAOR,UAAUknB,cAAgB,SAAwBhnB,EAAOyf,EAAQuE,GAQtE,OAPAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,WAAY,GAC5Drd,KAAKqd,EAAS,GAAMzf,IAAU,GAC9BoC,KAAKqd,EAAS,GAAMzf,IAAU,GAC9BoC,KAAKqd,EAAS,GAAMzf,IAAU,EAC9BoC,KAAKqd,GAAmB,IAARzf,EACTyf,EAAS,CAClB,EAEAnf,EAAOR,UAAUmnB,cACjB3mB,EAAOR,UAAUonB,cAAgB,SAAwBlnB,EAAOyf,EAAQuE,GAQtE,OAPAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,WAAY,GAC5Drd,KAAKqd,GAAWzf,IAAU,GAC1BoC,KAAKqd,EAAS,GAAMzf,IAAU,GAC9BoC,KAAKqd,EAAS,GAAMzf,IAAU,EAC9BoC,KAAKqd,EAAS,GAAc,IAARzf,EACbyf,EAAS,CAClB,EA8CAnf,EAAOR,UAAUqnB,iBAAmBjC,GAAmB,SAA2BllB,EAAOyf,EAAS,GAChG,OAAOiE,EAAethB,KAAMpC,EAAOyf,EAAQmE,OAAO,GAAIA,OAAO,sBAC/D,IAEAtjB,EAAOR,UAAUsnB,iBAAmBlC,GAAmB,SAA2BllB,EAAOyf,EAAS,GAChG,OAAOoE,EAAezhB,KAAMpC,EAAOyf,EAAQmE,OAAO,GAAIA,OAAO,sBAC/D,IAEAtjB,EAAOR,UAAUunB,WAAa,SAAqBrnB,EAAOyf,EAAQjY,EAAYwc,GAG5E,GAFAhkB,GAASA,EACTyf,KAAoB,GACfuE,EAAU,CACb,MAAMsD,EAAQ5jB,KAAK6B,IAAI,EAAI,EAAIiC,EAAc,GAE7Cic,EAASrhB,KAAMpC,EAAOyf,EAAQjY,EAAY8f,EAAQ,GAAIA,EACxD,CAEA,IAAI1jB,EAAI,EACJJ,EAAM,EACN6G,EAAM,EAEV,IADAjI,KAAKqd,GAAkB,IAARzf,IACN4D,EAAI4D,IAAehE,GAAO,MAC7BxD,EAAQ,GAAa,IAARqK,GAAsC,IAAzBjI,KAAKqd,EAAS7b,EAAI,KAC9CyG,EAAM,GAERjI,KAAKqd,EAAS7b,IAAO5D,EAAQwD,GAAQ,GAAK6G,EAAM,IAGlD,OAAOoV,EAASjY,CAClB,EAEAlH,EAAOR,UAAUynB,WAAa,SAAqBvnB,EAAOyf,EAAQjY,EAAYwc,GAG5E,GAFAhkB,GAASA,EACTyf,KAAoB,GACfuE,EAAU,CACb,MAAMsD,EAAQ5jB,KAAK6B,IAAI,EAAI,EAAIiC,EAAc,GAE7Cic,EAASrhB,KAAMpC,EAAOyf,EAAQjY,EAAY8f,EAAQ,GAAIA,EACxD,CAEA,IAAI1jB,EAAI4D,EAAa,EACjBhE,EAAM,EACN6G,EAAM,EAEV,IADAjI,KAAKqd,EAAS7b,GAAa,IAAR5D,IACV4D,GAAK,IAAMJ,GAAO,MACrBxD,EAAQ,GAAa,IAARqK,GAAsC,IAAzBjI,KAAKqd,EAAS7b,EAAI,KAC9CyG,EAAM,GAERjI,KAAKqd,EAAS7b,IAAO5D,EAAQwD,GAAQ,GAAK6G,EAAM,IAGlD,OAAOoV,EAASjY,CAClB,EAEAlH,EAAOR,UAAU0nB,UAAY,SAAoBxnB,EAAOyf,EAAQuE,GAM9D,OALAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,KAAO,KACnDzf,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCoC,KAAKqd,GAAmB,IAARzf,EACTyf,EAAS,CAClB,EAEAnf,EAAOR,UAAU2nB,aAAe,SAAuBznB,EAAOyf,EAAQuE,GAMpE,OALAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,OAAS,OACzDrd,KAAKqd,GAAmB,IAARzf,EAChBoC,KAAKqd,EAAS,GAAMzf,IAAU,EACvByf,EAAS,CAClB,EAEAnf,EAAOR,UAAU4nB,aAAe,SAAuB1nB,EAAOyf,EAAQuE,GAMpE,OALAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,OAAS,OACzDrd,KAAKqd,GAAWzf,IAAU,EAC1BoC,KAAKqd,EAAS,GAAc,IAARzf,EACbyf,EAAS,CAClB,EAEAnf,EAAOR,UAAU6nB,aAAe,SAAuB3nB,EAAOyf,EAAQuE,GAQpE,OAPAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,YAAa,YAC7Drd,KAAKqd,GAAmB,IAARzf,EAChBoC,KAAKqd,EAAS,GAAMzf,IAAU,EAC9BoC,KAAKqd,EAAS,GAAMzf,IAAU,GAC9BoC,KAAKqd,EAAS,GAAMzf,IAAU,GACvByf,EAAS,CAClB,EAEAnf,EAAOR,UAAU8nB,aAAe,SAAuB5nB,EAAOyf,EAAQuE,GASpE,OARAhkB,GAASA,EACTyf,KAAoB,EACfuE,GAAUP,EAASrhB,KAAMpC,EAAOyf,EAAQ,EAAG,YAAa,YACzDzf,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5CoC,KAAKqd,GAAWzf,IAAU,GAC1BoC,KAAKqd,EAAS,GAAMzf,IAAU,GAC9BoC,KAAKqd,EAAS,GAAMzf,IAAU,EAC9BoC,KAAKqd,EAAS,GAAc,IAARzf,EACbyf,EAAS,CAClB,EAEAnf,EAAOR,UAAU+nB,gBAAkB3C,GAAmB,SAA0BllB,EAAOyf,EAAS,GAC9F,OAAOiE,EAAethB,KAAMpC,EAAOyf,GAASmE,OAAO,sBAAuBA,OAAO,sBACnF,IAEAtjB,EAAOR,UAAUgoB,gBAAkB5C,GAAmB,SAA0BllB,EAAOyf,EAAS,GAC9F,OAAOoE,EAAezhB,KAAMpC,EAAOyf,GAASmE,OAAO,sBAAuBA,OAAO,sBACnF,IAiBAtjB,EAAOR,UAAUioB,aAAe,SAAuB/nB,EAAOyf,EAAQuE,GACpE,OAAOD,EAAW3hB,KAAMpC,EAAOyf,GAAQ,EAAMuE,EAC/C,EAEA1jB,EAAOR,UAAUkoB,aAAe,SAAuBhoB,EAAOyf,EAAQuE,GACpE,OAAOD,EAAW3hB,KAAMpC,EAAOyf,GAAQ,EAAOuE,EAChD,EAYA1jB,EAAOR,UAAUmoB,cAAgB,SAAwBjoB,EAAOyf,EAAQuE,GACtE,OAAOC,EAAY7hB,KAAMpC,EAAOyf,GAAQ,EAAMuE,EAChD,EAEA1jB,EAAOR,UAAUooB,cAAgB,SAAwBloB,EAAOyf,EAAQuE,GACtE,OAAOC,EAAY7hB,KAAMpC,EAAOyf,GAAQ,EAAOuE,EACjD,EAGA1jB,EAAOR,UAAU0F,KAAO,SAAeqd,EAAQsF,EAAa7kB,EAAOC,GACjE,IAAKjD,EAAO6c,SAAS0F,GAAS,MAAM,IAAI1hB,UAAU,+BAQlD,GAPKmC,IAAOA,EAAQ,GACfC,GAAe,IAARA,IAAWA,EAAMnB,KAAKtB,QAC9BqnB,GAAetF,EAAO/hB,SAAQqnB,EAActF,EAAO/hB,QAClDqnB,IAAaA,EAAc,GAC5B5kB,EAAM,GAAKA,EAAMD,IAAOC,EAAMD,GAG9BC,IAAQD,EAAO,OAAO,EAC1B,GAAsB,IAAlBuf,EAAO/hB,QAAgC,IAAhBsB,KAAKtB,OAAc,OAAO,EAGrD,GAAIqnB,EAAc,EAChB,MAAM,IAAInM,WAAW,6BAEvB,GAAI1Y,EAAQ,GAAKA,GAASlB,KAAKtB,OAAQ,MAAM,IAAIkb,WAAW,sBAC5D,GAAIzY,EAAM,EAAG,MAAM,IAAIyY,WAAW,2BAG9BzY,EAAMnB,KAAKtB,SAAQyC,EAAMnB,KAAKtB,QAC9B+hB,EAAO/hB,OAASqnB,EAAc5kB,EAAMD,IACtCC,EAAMsf,EAAO/hB,OAASqnB,EAAc7kB,GAGtC,MAAMG,EAAMF,EAAMD,EAalB,OAXIlB,OAASygB,GAAqD,mBAApC5G,WAAWnc,UAAUsoB,WAEjDhmB,KAAKgmB,WAAWD,EAAa7kB,EAAOC,GAEpC0Y,WAAWnc,UAAUwiB,IAAI5I,KACvBmJ,EACAzgB,KAAK+hB,SAAS7gB,EAAOC,GACrB4kB,GAIG1kB,CACT,EAMAnD,EAAOR,UAAUuB,KAAO,SAAeM,EAAK2B,EAAOC,EAAKjC,GAEtD,GAAmB,iBAARK,EAAkB,CAS3B,GARqB,iBAAV2B,GACThC,EAAWgC,EACXA,EAAQ,EACRC,EAAMnB,KAAKtB,QACa,iBAARyC,IAChBjC,EAAWiC,EACXA,EAAMnB,KAAKtB,aAEIU,IAAbF,GAA8C,iBAAbA,EACnC,MAAM,IAAIH,UAAU,6BAEtB,GAAwB,iBAAbG,IAA0BhB,EAAO6b,WAAW7a,GACrD,MAAM,IAAIH,UAAU,qBAAuBG,GAE7C,GAAmB,IAAfK,EAAIb,OAAc,CACpB,MAAMunB,EAAO1mB,EAAIqB,WAAW,IACV,SAAb1B,GAAuB+mB,EAAO,KAClB,WAAb/mB,KAEFK,EAAM0mB,EAEV,CACF,KAA0B,iBAAR1mB,EAChBA,GAAY,IACY,kBAARA,IAChBA,EAAM+d,OAAO/d,IAIf,GAAI2B,EAAQ,GAAKlB,KAAKtB,OAASwC,GAASlB,KAAKtB,OAASyC,EACpD,MAAM,IAAIyY,WAAW,sBAGvB,GAAIzY,GAAOD,EACT,OAAOlB,KAQT,IAAIwB,EACJ,GANAN,KAAkB,EAClBC,OAAc/B,IAAR+B,EAAoBnB,KAAKtB,OAASyC,IAAQ,EAE3C5B,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKiC,EAAIN,EAAOM,EAAIL,IAAOK,EACzBxB,KAAKwB,GAAKjC,MAEP,CACL,MAAM2hB,EAAQhjB,EAAO6c,SAASxb,GAC1BA,EACArB,EAAOS,KAAKY,EAAKL,GACfmC,EAAM6f,EAAMxiB,OAClB,GAAY,IAAR2C,EACF,MAAM,IAAItC,UAAU,cAAgBQ,EAClC,qCAEJ,IAAKiC,EAAI,EAAGA,EAAIL,EAAMD,IAASM,EAC7BxB,KAAKwB,EAAIN,GAASggB,EAAM1f,EAAIH,EAEhC,CAEA,OAAOrB,IACT,EAMA,MAAMkmB,EAAS,CAAC,EAChB,SAASC,EAAGC,EAAKC,EAAYC,GAC3BJ,EAAOE,GAAO,cAAwBE,EACpC3oB,cACE4oB,QAEAlpB,OAAOqiB,eAAe1f,KAAM,UAAW,CACrCpC,MAAOyoB,EAAWpH,MAAMjf,KAAMyb,WAC9B3d,UAAU,EACVC,cAAc,IAIhBiC,KAAKkX,KAAO,GAAGlX,KAAKkX,SAASkP,KAG7BpmB,KAAKwmB,aAEExmB,KAAKkX,IACd,CAEI+O,WACF,OAAOG,CACT,CAEIH,SAAMroB,GACRP,OAAOqiB,eAAe1f,KAAM,OAAQ,CAClCjC,cAAc,EACdF,YAAY,EACZD,QACAE,UAAU,GAEd,CAEAoE,WACE,MAAO,GAAGlC,KAAKkX,SAASkP,OAASpmB,KAAKymB,SACxC,EAEJ,CA+BA,SAASC,EAAuBnnB,GAC9B,IAAIgG,EAAM,GACN/D,EAAIjC,EAAIb,OACZ,MAAMwC,EAAmB,MAAX3B,EAAI,GAAa,EAAI,EACnC,KAAOiC,GAAKN,EAAQ,EAAGM,GAAK,EAC1B+D,EAAM,IAAIhG,EAAI2a,MAAM1Y,EAAI,EAAGA,KAAK+D,IAElC,MAAO,GAAGhG,EAAI2a,MAAM,EAAG1Y,KAAK+D,GAC9B,CAYA,SAASgc,EAAY3jB,EAAO2D,EAAKK,EAAKzC,EAAKke,EAAQjY,GACjD,GAAIxH,EAAQgE,GAAOhE,EAAQ2D,EAAK,CAC9B,MAAMiO,EAAmB,iBAARjO,EAAmB,IAAM,GAC1C,IAAIolB,EAWJ,MARIA,EAFAvhB,EAAa,EACH,IAAR7D,GAAaA,IAAQigB,OAAO,GACtB,OAAOhS,YAAYA,QAA2B,GAAlBpK,EAAa,KAASoK,IAElD,SAASA,QAA2B,GAAlBpK,EAAa,GAAS,IAAIoK,iBACtB,GAAlBpK,EAAa,GAAS,IAAIoK,IAGhC,MAAMjO,IAAMiO,YAAY5N,IAAM4N,IAElC,IAAI0W,EAAOU,iBAAiB,QAASD,EAAO/oB,EACpD,EAtBF,SAAsBuB,EAAKke,EAAQjY,GACjC2d,EAAe1F,EAAQ,eACHje,IAAhBD,EAAIke,SAAsDje,IAA7BD,EAAIke,EAASjY,IAC5C8d,EAAY7F,EAAQle,EAAIT,QAAU0G,EAAa,GAEnD,CAkBEyhB,CAAY1nB,EAAKke,EAAQjY,EAC3B,CAEA,SAAS2d,EAAgBnlB,EAAOsZ,GAC9B,GAAqB,iBAAVtZ,EACT,MAAM,IAAIsoB,EAAOY,qBAAqB5P,EAAM,SAAUtZ,EAE1D,CAEA,SAASslB,EAAatlB,EAAOc,EAAQwc,GACnC,GAAI5Z,KAAKylB,MAAMnpB,KAAWA,EAExB,MADAmlB,EAAenlB,EAAOsd,GAChB,IAAIgL,EAAOU,iBAAiB1L,GAAQ,SAAU,aAActd,GAGpE,GAAIc,EAAS,EACX,MAAM,IAAIwnB,EAAOc,yBAGnB,MAAM,IAAId,EAAOU,iBAAiB1L,GAAQ,SACR,MAAMA,EAAO,EAAI,YAAYxc,IAC7Bd,EACpC,CAvFAuoB,EAAE,4BACA,SAAUjP,GACR,OAAIA,EACK,GAAGA,gCAGL,gDACT,GAAG0C,YACLuM,EAAE,wBACA,SAAUjP,EAAM8C,GACd,MAAO,QAAQ9C,4DAA+D8C,GAChF,GAAGjb,WACLonB,EAAE,oBACA,SAAUllB,EAAK0lB,EAAOtO,GACpB,IAAI7Y,EAAM,iBAAiByB,sBACvBgmB,EAAW5O,EAWf,OAVIiF,OAAO4J,UAAU7O,IAAU/W,KAAK8E,IAAIiS,GAAS,GAAK,GACpD4O,EAAWP,EAAsB3J,OAAO1E,IACd,iBAAVA,IAChB4O,EAAWlK,OAAO1E,IACdA,EAAQmJ,OAAO,IAAMA,OAAO,KAAOnJ,IAAUmJ,OAAO,IAAMA,OAAO,QACnEyF,EAAWP,EAAsBO,IAEnCA,GAAY,KAEdznB,GAAO,eAAemnB,eAAmBM,IAClCznB,CACT,GAAGoa,YAiEL,MAAMuN,EAAoB,oBAgB1B,SAASxL,EAAalb,EAAQ2d,GAE5B,IAAII,EADJJ,EAAQA,GAASgJ,IAEjB,MAAM1oB,EAAS+B,EAAO/B,OACtB,IAAI2oB,EAAgB,KACpB,MAAMnG,EAAQ,GAEd,IAAK,IAAI1f,EAAI,EAAGA,EAAI9C,IAAU8C,EAAG,CAI/B,GAHAgd,EAAY/d,EAAOG,WAAWY,GAG1Bgd,EAAY,OAAUA,EAAY,MAAQ,CAE5C,IAAK6I,EAAe,CAElB,GAAI7I,EAAY,MAAQ,EAEjBJ,GAAS,IAAM,GAAG8C,EAAMlD,KAAK,IAAM,IAAM,KAC9C,QACF,CAAO,GAAIxc,EAAI,IAAM9C,EAAQ,EAEtB0f,GAAS,IAAM,GAAG8C,EAAMlD,KAAK,IAAM,IAAM,KAC9C,QACF,CAGAqJ,EAAgB7I,EAEhB,QACF,CAGA,GAAIA,EAAY,MAAQ,EACjBJ,GAAS,IAAM,GAAG8C,EAAMlD,KAAK,IAAM,IAAM,KAC9CqJ,EAAgB7I,EAChB,QACF,CAGAA,EAAkE,OAArD6I,EAAgB,OAAU,GAAK7I,EAAY,MAC1D,MAAW6I,IAEJjJ,GAAS,IAAM,GAAG8C,EAAMlD,KAAK,IAAM,IAAM,KAMhD,GAHAqJ,EAAgB,KAGZ7I,EAAY,IAAM,CACpB,IAAKJ,GAAS,GAAK,EAAG,MACtB8C,EAAMlD,KAAKQ,EACb,MAAO,GAAIA,EAAY,KAAO,CAC5B,IAAKJ,GAAS,GAAK,EAAG,MACtB8C,EAAMlD,KACJQ,GAAa,EAAM,IACP,GAAZA,EAAmB,IAEvB,MAAO,GAAIA,EAAY,MAAS,CAC9B,IAAKJ,GAAS,GAAK,EAAG,MACtB8C,EAAMlD,KACJQ,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAEvB,KAAO,MAAIA,EAAY,SASrB,MAAM,IAAI/e,MAAM,sBARhB,IAAK2e,GAAS,GAAK,EAAG,MACtB8C,EAAMlD,KACJQ,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAIvB,CACF,CAEA,OAAO0C,CACT,CA2BA,SAAStF,EAAe3a,GACtB,OAAOoY,EAAOiO,YAxHhB,SAAsBrmB,GAMpB,IAFAA,GAFAA,EAAMA,EAAIiX,MAAM,KAAK,IAEXsI,OAAOre,QAAQglB,EAAmB,KAEpCzoB,OAAS,EAAG,MAAO,GAE3B,KAAOuC,EAAIvC,OAAS,GAAM,GACxBuC,GAAY,IAEd,OAAOA,CACT,CA4G4BsmB,CAAYtmB,GACxC,CAEA,SAAS4c,EAAYzf,EAAKC,EAAKgf,EAAQ3e,GACrC,IAAI8C,EACJ,IAAKA,EAAI,EAAGA,EAAI9C,KACT8C,EAAI6b,GAAUhf,EAAIK,QAAY8C,GAAKpD,EAAIM,UADpB8C,EAExBnD,EAAImD,EAAI6b,GAAUjf,EAAIoD,GAExB,OAAOA,CACT,CAKA,SAAS+Y,EAAYO,EAAKI,GACxB,OAAOJ,aAAeI,GACZ,MAAPJ,GAAkC,MAAnBA,EAAInd,aAA+C,MAAxBmd,EAAInd,YAAYuZ,MACzD4D,EAAInd,YAAYuZ,OAASgE,EAAKhE,IACpC,CACA,SAAS+D,EAAaH,GAEpB,OAAOA,GAAQA,CACjB,CAIA,MAAMmG,EAAsB,WAC1B,MAAMuG,EAAW,mBACXC,EAAQ,IAAI/lB,MAAM,KACxB,IAAK,IAAIF,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,MAAMkmB,EAAU,GAAJlmB,EACZ,IAAK,IAAIgB,EAAI,EAAGA,EAAI,KAAMA,EACxBilB,EAAMC,EAAMllB,GAAKglB,EAAShmB,GAAKgmB,EAAShlB,EAE5C,CACA,OAAOilB,CACR,CAV2B,GAa5B,SAAS3E,EAAoB6E,GAC3B,MAAyB,oBAAXnG,OAAyBoG,EAAyBD,CAClE,CAEA,SAASC,IACP,MAAM,IAAInoB,MAAM,uBAClB,0BCnjEA,IAIIooB,EACAC,EALAC,EAAO9qB,EAAOD,QAAU,EAAjB,GAEPgrB,EAAQ,EAAQ,IAKpBD,EAAKE,QAAU,EAAQ,KACvBF,EAAKG,MAAU,EAAQ,KACvBH,EAAKI,KAAU,EAAQ,KAMvBJ,EAAKK,GAAKL,EAAKM,QAAQ,MAOvBN,EAAKzlB,QAAU,SAAiBgmB,GAC5B,GAAIA,EAAQ,CAIR,IAHA,IAAIC,EAAQlrB,OAAOkrB,KAAKD,GACpB/M,EAAQ,IAAI7Z,MAAM6mB,EAAK7pB,QACvBgC,EAAQ,EACLA,EAAQ6nB,EAAK7pB,QAChB6c,EAAM7a,GAAS4nB,EAAOC,EAAK7nB,MAC/B,OAAO6a,CACX,CACA,MAAO,EACX,EAOAwM,EAAKS,SAAW,SAAkBjN,GAG9B,IAFA,IAAI+M,EAAS,CAAC,EACV5nB,EAAS,EACNA,EAAQ6a,EAAM7c,QAAQ,CACzB,IAAIJ,EAAMid,EAAM7a,KACZnB,EAAMgc,EAAM7a,UACJtB,IAARG,IACA+oB,EAAOhqB,GAAOiB,EACtB,CACA,OAAO+oB,CACX,EAEA,IAAIG,EAAsB,MACtBC,EAAsB,KAO1BX,EAAKY,WAAa,SAAoBzR,GAClC,MAAO,uTAAuT0R,KAAK1R,EACvU,EAOA6Q,EAAKc,SAAW,SAAkBC,GAC9B,OAAK,YAAYF,KAAKE,IAASf,EAAKY,WAAWG,GACpC,KAAQA,EAAK3mB,QAAQsmB,EAAqB,QAAQtmB,QAAQumB,EAAiB,OAAU,KACzF,IAAMI,CACjB,EAOAf,EAAKgB,QAAU,SAAiB9nB,GAC5B,OAAOA,EAAI+nB,OAAO,GAAGC,cAAgBhoB,EAAIioB,UAAU,EACvD,EAEA,IAAIC,EAAc,YAOlBpB,EAAKqB,UAAY,SAAmBnoB,GAChC,OAAOA,EAAIioB,UAAU,EAAG,GACjBjoB,EAAIioB,UAAU,GACT/mB,QAAQgnB,GAAa,SAASE,EAAIC,GAAM,OAAOA,EAAGL,aAAe,GACjF,EAQAlB,EAAKwB,kBAAoB,SAA2BvlB,EAAGC,GACnD,OAAOD,EAAEwlB,GAAKvlB,EAAEulB,EACpB,EAUAzB,EAAK0B,aAAe,SAAsBlsB,EAAMmsB,GAG5C,GAAInsB,EAAKosB,MAML,OALID,GAAYnsB,EAAKosB,MAAMzS,OAASwS,IAChC3B,EAAK6B,aAAaC,OAAOtsB,EAAKosB,OAC9BpsB,EAAKosB,MAAMzS,KAAOwS,EAClB3B,EAAK6B,aAAa5hB,IAAIzK,EAAKosB,QAExBpsB,EAAKosB,MAIX9B,IACDA,EAAO,EAAQ,KAEnB,IAAI3M,EAAO,IAAI2M,EAAK6B,GAAYnsB,EAAK2Z,MAKrC,OAJA6Q,EAAK6B,aAAa5hB,IAAIkT,GACtBA,EAAK3d,KAAOA,EACZF,OAAOqiB,eAAeniB,EAAM,QAAS,CAAEK,MAAOsd,EAAMrd,YAAY,IAChER,OAAOqiB,eAAeniB,EAAKG,UAAW,QAAS,CAAEE,MAAOsd,EAAMrd,YAAY,IACnEqd,CACX,EAEA,IAAI4O,EAAoB,EAOxB/B,EAAKgC,aAAe,SAAsBzB,GAGtC,GAAIA,EAAOqB,MACP,OAAOrB,EAAOqB,MAGb7B,IACDA,EAAO,EAAQ,IAEnB,IAAIkC,EAAM,IAAIlC,EAAK,OAASgC,IAAqBxB,GAGjD,OAFAP,EAAK6B,aAAa5hB,IAAIgiB,GACtB3sB,OAAOqiB,eAAe4I,EAAQ,QAAS,CAAE1qB,MAAOosB,EAAKnsB,YAAY,IAC1DmsB,CACX,EAQA3sB,OAAOqiB,eAAeqI,EAAM,eAAgB,CACxCpI,IAAK,WACD,OAAOqI,EAAiB,YAAMA,EAAiB,UAAI,IAAK,EAAQ,KACpE,4BC9KJ,IAAIiC,EAAQjtB,EACR2C,EAAK,EAAQ,GACbuqB,EAAY,EAAQ,GACpBC,EAAW,EAAQ,IAEvBF,EAAM3qB,OAAS4qB,EACfD,EAAM3nB,QAAU6nB,EAAS7nB,QACzB2nB,EAAMG,MAAQD,EAASC,MACvBH,EAAMI,MAAQF,EAASE,MACvBJ,EAAMK,OAASH,EAASG,OA6BxBL,EAAMM,OA1BN,SAAgB9oB,EAAKgB,EAAGsO,GACtB,IAAIyZ,EAAM,IAAI9oB,MAAMJ,KAAKM,IAAIH,EAAIsE,YAAagL,GAAQ,GACtDyZ,EAAIvrB,KAAK,GAKT,IAHA,IAAI4Q,EAAK,GAAMpN,EAAI,EACf2B,EAAI3C,EAAI6B,QAEH9B,EAAI,EAAGA,EAAIgpB,EAAI9rB,OAAQ8C,IAAK,CACnC,IAAIsX,EACA/V,EAAMqB,EAAEqB,MAAMoK,EAAK,GACnBzL,EAAE0P,SAEFgF,EADE/V,GAAO8M,GAAM,GAAK,GACfA,GAAM,GAAK9M,EAEZA,EACNqB,EAAE2N,MAAM+G,IAERA,EAAI,EAGN0R,EAAIhpB,GAAKsX,EACT1U,EAAEsB,OAAO,EACX,CAEA,OAAO8kB,CACT,EA0DAP,EAAMQ,OAtDN,SAAgBC,EAAIC,GAClB,IAAIC,EAAM,CACR,GACA,IAGFF,EAAKA,EAAGpnB,QACRqnB,EAAKA,EAAGrnB,QAIR,IAHA,IAEIunB,EAFAC,EAAK,EACLC,EAAK,EAEFL,EAAGrW,MAAMyW,GAAM,GAAKH,EAAGtW,MAAM0W,GAAM,GAAG,CAE3C,IAMIC,EAYAC,EAlBAC,EAAOR,EAAGjlB,MAAM,GAAKqlB,EAAM,EAC3BK,EAAOR,EAAGllB,MAAM,GAAKslB,EAAM,EACnB,IAARG,IACFA,GAAO,GACG,IAARC,IACFA,GAAO,GAGPH,EADgB,IAAP,EAANE,GACE,EAGO,IADZL,EAAMH,EAAGjlB,MAAM,GAAKqlB,EAAM,IACF,IAAPD,GAAqB,IAARM,EAGvBD,GAFCA,EAIVN,EAAI,GAAG5M,KAAKgN,GAIVC,EADgB,IAAP,EAANE,GACE,EAGO,IADZN,EAAMF,EAAGllB,MAAM,GAAKslB,EAAM,IACF,IAAPF,GAAqB,IAARK,EAGvBC,GAFCA,EAIVP,EAAI,GAAG5M,KAAKiN,GAGR,EAAIH,IAAOE,EAAK,IAClBF,EAAK,EAAIA,GACP,EAAIC,IAAOE,EAAK,IAClBF,EAAK,EAAIA,GACXL,EAAGhlB,OAAO,GACVilB,EAAGjlB,OAAO,EACZ,CAEA,OAAOklB,CACT,EAUAX,EAAMmB,eAPN,SAAwBtQ,EAAK5D,EAAMmU,GACjC,IAAI/sB,EAAM,IAAM4Y,EAChB4D,EAAIpd,UAAUwZ,GAAQ,WACpB,YAAqB9X,IAAdY,KAAK1B,GAAqB0B,KAAK1B,GACpC0B,KAAK1B,GAAO+sB,EAAS/T,KAAKtX,KAC9B,CACF,EAOAiqB,EAAMqB,WAJN,SAAoBpK,GAClB,MAAwB,iBAAVA,EAAqB+I,EAAM3nB,QAAQ4e,EAAO,OACtDA,CACJ,EAMA+I,EAAMsB,UAHN,SAAmBrK,GACjB,OAAO,IAAIvhB,EAAGuhB,EAAO,MAAO,KAC9B,OClHA,SAAS5hB,EAAOC,EAAKC,GACnB,IAAKD,EACH,MAAM,IAAIE,MAAMD,GAAO,mBAC3B,CALAvC,EAAOD,QAAUsC,EAOjBA,EAAOksB,MAAQ,SAAqBzd,EAAGhN,EAAGvB,GACxC,GAAIuO,GAAKhN,EACP,MAAM,IAAItB,MAAMD,GAAQ,qBAAuBuO,EAAI,OAAShN,EAChE,0BCTA9D,EAAOD,QAAU8qB,EAGjB,IAAI2D,EAAmB,EAAQ,MAC7B3D,EAAKpqB,UAAYL,OAAOC,OAAOmuB,EAAiB/tB,YAAYC,YAAcmqB,GAAM4D,UAAY,OAE9F,IAAIC,EAAY,EAAQ,IACpB5D,EAAO,EAAQ,GAanB,SAASD,EAAK5Q,EAAM0U,EAAQC,EAASC,EAASC,GAG1C,GAFAN,EAAiBnU,KAAKtX,KAAMkX,EAAM2U,GAE9BD,GAA4B,iBAAXA,EACjB,MAAM7sB,UAAU,4BAoCpB,GA9BAiB,KAAKgsB,WAAa,CAAC,EAMnBhsB,KAAK4rB,OAASvuB,OAAOC,OAAO0C,KAAKgsB,YAMjChsB,KAAK8rB,QAAUA,EAMf9rB,KAAK+rB,SAAWA,GAAY,CAAC,EAM7B/rB,KAAKisB,cAAW7sB,EAMZwsB,EACA,IAAK,IAAIrD,EAAOlrB,OAAOkrB,KAAKqD,GAASpqB,EAAI,EAAGA,EAAI+mB,EAAK7pB,SAAU8C,EAC5B,iBAApBoqB,EAAOrD,EAAK/mB,MACnBxB,KAAKgsB,WAAYhsB,KAAK4rB,OAAOrD,EAAK/mB,IAAMoqB,EAAOrD,EAAK/mB,KAAQ+mB,EAAK/mB,GACjF,CAgBAsmB,EAAKoE,SAAW,SAAkBhV,EAAMiV,GACpC,IAAInC,EAAM,IAAIlC,EAAK5Q,EAAMiV,EAAKP,OAAQO,EAAKN,QAASM,EAAKL,QAASK,EAAKJ,UAEvE,OADA/B,EAAIiC,SAAWE,EAAKF,SACbjC,CACX,EAOAlC,EAAKpqB,UAAUsH,OAAS,SAAgBonB,GACpC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,UAAaxoB,KAAK6rB,QAClB,SAAa7rB,KAAK4rB,OAClB,WAAa5rB,KAAKisB,UAAYjsB,KAAKisB,SAASvtB,OAASsB,KAAKisB,cAAW7sB,EACrE,UAAaitB,EAAersB,KAAK8rB,aAAU1sB,EAC3C,WAAaitB,EAAersB,KAAK+rB,cAAW3sB,GAEpD,EAWA0oB,EAAKpqB,UAAUsK,IAAM,SAAakP,EAAMsS,EAAIsC,GAGxC,IAAK/D,EAAKwE,SAASrV,GACf,MAAMnY,UAAU,yBAEpB,IAAKgpB,EAAKb,UAAUsC,GAChB,MAAMzqB,UAAU,yBAEpB,QAA0BK,IAAtBY,KAAK4rB,OAAO1U,GACZ,MAAMzX,MAAM,mBAAqByX,EAAO,QAAUlX,MAEtD,GAAIA,KAAKwsB,aAAahD,GAClB,MAAM/pB,MAAM,MAAQ+pB,EAAK,mBAAqBxpB,MAElD,GAAIA,KAAKysB,eAAevV,GACpB,MAAMzX,MAAM,SAAWyX,EAAO,oBAAsBlX,MAExD,QAA4BZ,IAAxBY,KAAKgsB,WAAWxC,GAAmB,CACnC,IAAMxpB,KAAK6rB,UAAW7rB,KAAK6rB,QAAQa,YAC/B,MAAMjtB,MAAM,gBAAkB+pB,EAAK,OAASxpB,MAChDA,KAAK4rB,OAAO1U,GAAQsS,CACxB,MACIxpB,KAAKgsB,WAAWhsB,KAAK4rB,OAAO1U,GAAQsS,GAAMtS,EAG9C,OADAlX,KAAK+rB,SAAS7U,GAAQ4U,GAAW,KAC1B9rB,IACX,EASA8nB,EAAKpqB,UAAUmsB,OAAS,SAAgB3S,GAEpC,IAAK6Q,EAAKwE,SAASrV,GACf,MAAMnY,UAAU,yBAEpB,IAAIQ,EAAMS,KAAK4rB,OAAO1U,GACtB,GAAW,MAAP3X,EACA,MAAME,MAAM,SAAWyX,EAAO,uBAAyBlX,MAM3D,cAJOA,KAAKgsB,WAAWzsB,UAChBS,KAAK4rB,OAAO1U,UACZlX,KAAK+rB,SAAS7U,GAEdlX,IACX,EAOA8nB,EAAKpqB,UAAU8uB,aAAe,SAAsBhD,GAChD,OAAOmC,EAAUa,aAAaxsB,KAAKisB,SAAUzC,EACjD,EAOA1B,EAAKpqB,UAAU+uB,eAAiB,SAAwBvV,GACpD,OAAOyU,EAAUc,eAAezsB,KAAKisB,SAAU/U,EACnD,gCCnLA,IAAI6Q,EAAO/qB,EAqOX,SAAS2vB,EAAMtuB,EAAKD,EAAKwuB,GACrB,IAAK,IAAIrE,EAAOlrB,OAAOkrB,KAAKnqB,GAAMoD,EAAI,EAAGA,EAAI+mB,EAAK7pB,SAAU8C,OACnCpC,IAAjBf,EAAIkqB,EAAK/mB,KAAsBorB,IAC/BvuB,EAAIkqB,EAAK/mB,IAAMpD,EAAImqB,EAAK/mB,KAChC,OAAOnD,CACX,CAmBA,SAASwuB,EAAS3V,GAEd,SAAS4V,EAAYrG,EAASsG,GAE1B,KAAM/sB,gBAAgB8sB,GAClB,OAAO,IAAIA,EAAYrG,EAASsG,GAKpC1vB,OAAOqiB,eAAe1f,KAAM,UAAW,CAAE2f,IAAK,WAAa,OAAO8G,CAAS,IAGvEhnB,MAAMutB,kBACNvtB,MAAMutB,kBAAkBhtB,KAAM8sB,GAE9BzvB,OAAOqiB,eAAe1f,KAAM,QAAS,CAAEpC,OAAO,IAAK6B,OAAS+mB,OAAS,KAErEuG,GACAJ,EAAM3sB,KAAM+sB,EACpB,CAUA,OARCD,EAAYpvB,UAAYL,OAAOC,OAAOmC,MAAM/B,YAAYC,YAAcmvB,EAEvEzvB,OAAOqiB,eAAeoN,EAAYpvB,UAAW,OAAQ,CAAEiiB,IAAK,WAAa,OAAOzI,CAAM,IAEtF4V,EAAYpvB,UAAUwE,SAAW,WAC7B,OAAOlC,KAAKkX,KAAO,KAAOlX,KAAKymB,OACnC,EAEOqG,CACX,CAzRA/E,EAAKkF,UAAY,EAAQ,IAGzBlF,EAAK1O,OAAS,EAAQ,KAGtB0O,EAAKmF,aAAe,EAAQ,KAG5BnF,EAAKoF,MAAQ,EAAQ,KAGrBpF,EAAKM,QAAU,EAAQ,IAGvBN,EAAKqF,KAAO,EAAQ,KAGpBrF,EAAKsF,KAAO,EAAQ,KAGpBtF,EAAKuF,SAAW,EAAQ,KAGxBvF,EAAKwF,OAA2B,oBAAXjtB,QAA0BA,aACf,IAAX,EAAAmT,GAA0B,EAAAA,GACf,oBAAX3P,MAA0BA,MACjC9D,KAQd+nB,EAAKyF,WAAanwB,OAAOowB,OAASpwB,OAAOowB,OAAO,IAAiC,GAOjF1F,EAAK2F,YAAcrwB,OAAOowB,OAASpwB,OAAOowB,OAAO,CAAC,GAAgC,CAAC,EAQnF1F,EAAK4F,OAASrB,QAAQvE,EAAKwF,OAAOK,SAAW7F,EAAKwF,OAAOK,QAAQC,UAAY9F,EAAKwF,OAAOK,QAAQC,SAASC,MAQ1G/F,EAAKb,UAAY5J,OAAO4J,WAAwC,SAAmBtpB,GAC/E,MAAwB,iBAAVA,GAAsBmjB,SAASnjB,IAAU0D,KAAKylB,MAAMnpB,KAAWA,CACjF,EAOAmqB,EAAKwE,SAAW,SAAkB3uB,GAC9B,MAAwB,iBAAVA,GAAsBA,aAAiBmf,MACzD,EAOAgL,EAAKgG,SAAW,SAAkBnwB,GAC9B,OAAOA,GAA0B,iBAAVA,CAC3B,EAUAmqB,EAAKiG,MAQLjG,EAAKkG,MAAQ,SAAenT,EAAKgO,GAC7B,IAAIlrB,EAAQkd,EAAIgO,GAChB,QAAa,MAATlrB,IAAiBkd,EAAIoT,eAAepF,MACZ,iBAAVlrB,IAAuB8D,MAAMC,QAAQ/D,GAASA,EAAMc,OAASrB,OAAOkrB,KAAK3qB,GAAOc,QAAU,EAEhH,EASAqpB,EAAKoG,WAAa,YAKlBpG,EAAK7pB,OAAS,WACV,IACI,IAAIA,EAAS6pB,EAAKM,QAAQ,UAAUnqB,OAEpC,OAAOA,EAAOR,UAAUkgB,UAAY1f,EAAoC,IAC5E,CAAE,MAAOqC,GAEL,OAAO,IACX,CACH,CATa,GAYdwnB,EAAKqG,aAAe,KAGpBrG,EAAKsG,oBAAsB,KAO3BtG,EAAKuG,UAAY,SAAmBC,GAEhC,MAA8B,iBAAhBA,EACRxG,EAAK7pB,OACD6pB,EAAKsG,oBAAoBE,GACzB,IAAIxG,EAAKrmB,MAAM6sB,GACnBxG,EAAK7pB,OACD6pB,EAAKqG,aAAaG,GACI,oBAAf1U,WACH0U,EACA,IAAI1U,WAAW0U,EACjC,EAMAxG,EAAKrmB,MAA8B,oBAAfmY,WAA6BA,WAAwCnY,MAezFqmB,EAAKyG,KAAkCzG,EAAKwF,OAAOkB,SAAsC1G,EAAKwF,OAAOkB,QAAQD,MACtEzG,EAAKwF,OAAOiB,MACvCzG,EAAKM,QAAQ,QAOzBN,EAAK2G,OAAS,mBAOd3G,EAAK4G,QAAU,wBAOf5G,EAAK6G,QAAU,6CAOf7G,EAAK8G,WAAa,SAAoBjxB,GAClC,OAAOA,EACDmqB,EAAKuF,SAAS3uB,KAAKf,GAAOkxB,SAC1B/G,EAAKuF,SAASyB,QACxB,EAQAhH,EAAKiH,aAAe,SAAsBC,EAAMC,GAC5C,IAAIne,EAAOgX,EAAKuF,SAAS6B,SAASF,GAClC,OAAIlH,EAAKyG,KACEzG,EAAKyG,KAAKY,SAASre,EAAK7M,GAAI6M,EAAK/K,GAAIkpB,GACzCne,EAAKjM,SAASwnB,QAAQ4C,GACjC,EAiBAnH,EAAK4E,MAAQA,EAOb5E,EAAKsH,QAAU,SAAiBpuB,GAC5B,OAAOA,EAAI+nB,OAAO,GAAGnN,cAAgB5a,EAAIioB,UAAU,EACvD,EAyCAnB,EAAK8E,SAAWA,EAmBhB9E,EAAKuH,cAAgBzC,EAAS,iBAoB9B9E,EAAKwH,YAAc,SAAkBC,GAEjC,IADA,IAAIC,EAAW,CAAC,EACPjuB,EAAI,EAAGA,EAAIguB,EAAW9wB,SAAU8C,EACrCiuB,EAASD,EAAWhuB,IAAM,EAO9B,OAAO,WACH,IAAK,IAAI+mB,EAAOlrB,OAAOkrB,KAAKvoB,MAAOwB,EAAI+mB,EAAK7pB,OAAS,EAAG8C,GAAK,IAAKA,EAC9D,GAA0B,IAAtBiuB,EAASlH,EAAK/mB,UAA+BpC,IAAlBY,KAAKuoB,EAAK/mB,KAAuC,OAAlBxB,KAAKuoB,EAAK/mB,IACpE,OAAO+mB,EAAK/mB,EACxB,CACJ,EAeAumB,EAAK2H,YAAc,SAAkBF,GAQjC,OAAO,SAAStY,GACZ,IAAK,IAAI1V,EAAI,EAAGA,EAAIguB,EAAW9wB,SAAU8C,EACjCguB,EAAWhuB,KAAO0V,UACXlX,KAAKwvB,EAAWhuB,GACnC,CACJ,EAkBAumB,EAAKqE,cAAgB,CACjBuD,MAAO5S,OACP6S,MAAO7S,OACPmE,MAAOnE,OACPoP,MAAM,GAIVpE,EAAK8H,WAAa,WACd,IAAI3xB,EAAS6pB,EAAK7pB,OAElB,IAAKA,EAMD,OAJA6pB,EAAKqG,aAAe,UACpBrG,EAAKsG,oBAAsB,SAA4BrvB,GACnD,OAAO,IAAI+oB,EAAKoG,WAAWnvB,EAC/B,GAKJ+oB,EAAKqG,aAAelwB,EAAOS,OAASkb,WAAWlb,MAAQT,EAAOS,MAE1D,SAAqBf,EAAOsB,GACxB,OAAO,IAAIhB,EAAON,EAAOsB,EAC7B,EACJ6oB,EAAKsG,oBAAsBnwB,EAAOW,aAE9B,SAA4BG,GACxB,OAAO,IAAId,EAAOc,EACtB,CACR,0BChaA,IAAIM,EAAS,EAAQ,GACjBI,EAAW,EAAQ,GAIvB,SAASowB,EAAgBtwB,EAAKgC,GAC5B,OAAqC,QAAZ,MAApBhC,EAAIoB,WAAWY,OAGhBA,EAAI,GAAKA,EAAI,GAAKhC,EAAId,SAGkB,QAAZ,MAAxBc,EAAIoB,WAAWY,EAAI,GAC7B,CAyDA,SAASuuB,EAAMttB,GAKb,OAJWA,IAAM,GACLA,IAAM,EAAK,MACXA,GAAK,EAAK,UACN,IAAJA,IAAa,MACV,CACjB,CAeA,SAAS2nB,EAAMpnB,GACb,OAAoB,IAAhBA,EAAKtE,OACA,IAAMsE,EAENA,CACX,CAGA,SAASgtB,EAAMhtB,GACb,OAAoB,IAAhBA,EAAKtE,OACA,IAAMsE,EACU,IAAhBA,EAAKtE,OACL,KAAOsE,EACS,IAAhBA,EAAKtE,OACL,MAAQsE,EACQ,IAAhBA,EAAKtE,OACL,OAASsE,EACO,IAAhBA,EAAKtE,OACL,QAAUsE,EACM,IAAhBA,EAAKtE,OACL,SAAWsE,EACK,IAAhBA,EAAKtE,OACL,UAAYsE,EAEZA,CACX,CAjHAhG,EAAQ0C,SAAWA,EAyDnB1C,EAAQsF,QA7CR,SAAiB9C,EAAKywB,GACpB,GAAIvuB,MAAMC,QAAQnC,GAChB,OAAOA,EAAI0a,QACb,IAAK1a,EACH,MAAO,GACT,IAAI+F,EAAM,GACV,GAAmB,iBAAR/F,EACT,GAAKywB,GAyBE,GAAY,QAARA,EAIT,KAHAzwB,EAAMA,EAAI2C,QAAQ,eAAgB,KAC1BzD,OAAS,GAAM,IACrBc,EAAM,IAAMA,GACTgC,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,GAAK,EAC/B+D,EAAIyY,KAAKN,SAASle,EAAIgC,GAAKhC,EAAIgC,EAAI,GAAI,UAxBzC,IADA,IAAIuN,EAAI,EACCvN,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAAK,CACnC,IAAIb,EAAInB,EAAIoB,WAAWY,GACnBb,EAAI,IACN4E,EAAIwJ,KAAOpO,EACFA,EAAI,MACb4E,EAAIwJ,KAAQpO,GAAK,EAAK,IACtB4E,EAAIwJ,KAAY,GAAJpO,EAAU,KACbmvB,EAAgBtwB,EAAKgC,IAC9Bb,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBnB,EAAIoB,aAAaY,IACvD+D,EAAIwJ,KAAQpO,GAAK,GAAM,IACvB4E,EAAIwJ,KAASpO,GAAK,GAAM,GAAM,IAC9B4E,EAAIwJ,KAASpO,GAAK,EAAK,GAAM,IAC7B4E,EAAIwJ,KAAY,GAAJpO,EAAU,MAEtB4E,EAAIwJ,KAAQpO,GAAK,GAAM,IACvB4E,EAAIwJ,KAASpO,GAAK,EAAK,GAAM,IAC7B4E,EAAIwJ,KAAY,GAAJpO,EAAU,IAE1B,MASF,IAAKa,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAC1B+D,EAAI/D,GAAc,EAAThC,EAAIgC,GAEjB,OAAO+D,CACT,EASAvI,EAAQqtB,MANR,SAAe7qB,GAEb,IADA,IAAI+F,EAAM,GACD/D,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAC9B+D,GAAO6kB,EAAM5qB,EAAIgC,GAAGU,SAAS,KAC/B,OAAOqD,CACT,EAUAvI,EAAQ+yB,MAAQA,EAYhB/yB,EAAQkzB,QAVR,SAAiB1wB,EAAKM,GAEpB,IADA,IAAIyF,EAAM,GACD/D,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAAK,CACnC,IAAIiB,EAAIjD,EAAIgC,GACG,WAAX1B,IACF2C,EAAIstB,EAAMttB,IACZ8C,GAAOyqB,EAAMvtB,EAAEP,SAAS,IAC1B,CACA,OAAOqD,CACT,EASAvI,EAAQotB,MAAQA,EAoBhBptB,EAAQgzB,MAAQA,EAgBhBhzB,EAAQmzB,OAdR,SAAgB3wB,EAAK0B,EAAOC,EAAKrB,GAC/B,IAAIuB,EAAMF,EAAMD,EAChB5B,EAAO+B,EAAM,GAAM,GAEnB,IADA,IAAIkE,EAAM,IAAI7D,MAAML,EAAM,GACjBG,EAAI,EAAG4C,EAAIlD,EAAOM,EAAI+D,EAAI7G,OAAQ8C,IAAK4C,GAAK,EAAG,CACtD,IAAI3B,EAEFA,EADa,QAAX3C,EACGN,EAAI4E,IAAM,GAAO5E,EAAI4E,EAAI,IAAM,GAAO5E,EAAI4E,EAAI,IAAM,EAAK5E,EAAI4E,EAAI,GAEjE5E,EAAI4E,EAAI,IAAM,GAAO5E,EAAI4E,EAAI,IAAM,GAAO5E,EAAI4E,EAAI,IAAM,EAAK5E,EAAI4E,GACxEmB,EAAI/D,GAAKiB,IAAM,CACjB,CACA,OAAO8C,CACT,EAqBAvI,EAAQozB,QAlBR,SAAiB5wB,EAAKM,GAEpB,IADA,IAAIyF,EAAM,IAAI7D,MAAmB,EAAblC,EAAId,QACf8C,EAAI,EAAG4C,EAAI,EAAG5C,EAAIhC,EAAId,OAAQ8C,IAAK4C,GAAK,EAAG,CAClD,IAAIqL,EAAIjQ,EAAIgC,GACG,QAAX1B,GACFyF,EAAInB,GAAKqL,IAAM,GACflK,EAAInB,EAAI,GAAMqL,IAAM,GAAM,IAC1BlK,EAAInB,EAAI,GAAMqL,IAAM,EAAK,IACzBlK,EAAInB,EAAI,GAAS,IAAJqL,IAEblK,EAAInB,EAAI,GAAKqL,IAAM,GACnBlK,EAAInB,EAAI,GAAMqL,IAAM,GAAM,IAC1BlK,EAAInB,EAAI,GAAMqL,IAAM,EAAK,IACzBlK,EAAInB,GAAS,IAAJqL,EAEb,CACA,OAAOlK,CACT,EAMAvI,EAAQqzB,OAHR,SAAgB5tB,EAAGwB,GACjB,OAAQxB,IAAMwB,EAAMxB,GAAM,GAAKwB,CACjC,EAMAjH,EAAQszB,OAHR,SAAgB7tB,EAAGwB,GACjB,OAAQxB,GAAKwB,EAAMxB,IAAO,GAAKwB,CACjC,EAMAjH,EAAQuzB,MAHR,SAAevsB,EAAGC,GAChB,OAAQD,EAAIC,IAAO,CACrB,EAMAjH,EAAQwzB,QAHR,SAAiBxsB,EAAGC,EAAGtD,GACrB,OAAQqD,EAAIC,EAAItD,IAAO,CACzB,EAMA3D,EAAQyzB,QAHR,SAAiBzsB,EAAGC,EAAGtD,EAAG+vB,GACxB,OAAQ1sB,EAAIC,EAAItD,EAAI+vB,IAAO,CAC7B,EAMA1zB,EAAQ2zB,QAHR,SAAiB3sB,EAAGC,EAAGtD,EAAG+vB,EAAGnwB,GAC3B,OAAQyD,EAAIC,EAAItD,EAAI+vB,EAAInwB,IAAO,CACjC,EAYAvD,EAAQ4zB,MATR,SAAezxB,EAAK8gB,EAAK4Q,EAAIC,GAC3B,IAAIC,EAAK5xB,EAAI8gB,GAGT/b,EAAM4sB,EAFD3xB,EAAI8gB,EAAM,KAEI,EACnBja,GAAM9B,EAAK4sB,EAAK,EAAI,GAAKD,EAAKE,EAClC5xB,EAAI8gB,GAAOja,IAAO,EAClB7G,EAAI8gB,EAAM,GAAK/b,CACjB,EAQAlH,EAAQg0B,SALR,SAAkBH,EAAIC,EAAIC,EAAIE,GAG5B,OAFUH,EAAKG,IAAQ,EACRH,EAAK,EAAI,GAAKD,EAAKE,IACpB,CAChB,EAOA/zB,EAAQk0B,SAJR,SAAkBL,EAAIC,EAAIC,EAAIE,GAE5B,OADSH,EAAKG,IACA,CAChB,EAgBAj0B,EAAQm0B,WAbR,SAAoBN,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,GAC9C,IAAIptB,EAAQ,EACRD,EAAK4sB,EAST,OAPA3sB,IADAD,EAAMA,EAAK+sB,IAAQ,GACLH,EAAK,EAAI,EAEvB3sB,IADAD,EAAMA,EAAKmtB,IAAQ,GACLA,EAAK,EAAI,EAIdR,EAAKE,EAAKK,EAAKE,GAFxBntB,IADAD,EAAMA,EAAKqtB,IAAQ,GACLA,EAAK,EAAI,KAGT,CAChB,EAOAv0B,EAAQw0B,WAJR,SAAoBX,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,GAE9C,OADST,EAAKG,EAAKI,EAAKE,IACV,CAChB,EAkBAv0B,EAAQy0B,WAfR,SAAoBZ,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,EAAIG,EAAIC,GACtD,IAAIxtB,EAAQ,EACRD,EAAK4sB,EAWT,OATA3sB,IADAD,EAAMA,EAAK+sB,IAAQ,GACLH,EAAK,EAAI,EAEvB3sB,IADAD,EAAMA,EAAKmtB,IAAQ,GACLA,EAAK,EAAI,EAEvBltB,IADAD,EAAMA,EAAKqtB,IAAQ,GACLA,EAAK,EAAI,EAIdV,EAAKE,EAAKK,EAAKE,EAAKI,GAF7BvtB,IADAD,EAAMA,EAAKytB,IAAQ,GACLA,EAAK,EAAI,KAGT,CAChB,EAQA30B,EAAQ40B,WALR,SAAoBf,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,EAAIG,EAAIC,GAGtD,OAFSb,EAAKG,EAAKI,EAAKE,EAAKI,IAEf,CAChB,EAOA30B,EAAQ60B,UAJR,SAAmBhB,EAAIC,EAAIrvB,GAEzB,OADSqvB,GAAO,GAAKrvB,EAASovB,IAAOpvB,KACxB,CACf,EAOAzE,EAAQ80B,UAJR,SAAmBjB,EAAIC,EAAIrvB,GAEzB,OADSovB,GAAO,GAAKpvB,EAASqvB,IAAOrvB,KACxB,CACf,EAMAzE,EAAQ+0B,SAHR,SAAkBlB,EAAIC,EAAIrvB,GACxB,OAAOovB,IAAOpvB,CAChB,EAOAzE,EAAQg1B,SAJR,SAAkBnB,EAAIC,EAAIrvB,GAExB,OADSovB,GAAO,GAAKpvB,EAASqvB,IAAOrvB,KACxB,CACf,oBC7PA,IAOIwwB,EAPAC,EAAuB,iBAAZC,QAAuBA,QAAU,KAC5CC,EAAeF,GAAwB,mBAAZA,EAAEjT,MAC7BiT,EAAEjT,MACF,SAAsBwB,EAAQ4R,EAAUC,GACxC,OAAOC,SAAS70B,UAAUuhB,MAAM3H,KAAKmJ,EAAQ4R,EAAUC,EACzD,EAIAL,EADEC,GAA0B,mBAAdA,EAAEM,QACCN,EAAEM,QACVn1B,OAAOo1B,sBACC,SAAwBhS,GACvC,OAAOpjB,OAAOq1B,oBAAoBjS,GAC/BV,OAAO1iB,OAAOo1B,sBAAsBhS,GACzC,EAEiB,SAAwBA,GACvC,OAAOpjB,OAAOq1B,oBAAoBjS,EACpC,EAOF,IAAIkS,EAAcrV,OAAOsV,OAAS,SAAqBh1B,GACrD,OAAOA,GAAUA,CACnB,EAEA,SAASsvB,IACPA,EAAa2F,KAAKvb,KAAKtX,KACzB,CACA/C,EAAOD,QAAUkwB,EACjBjwB,EAAOD,QAAQ81B,KAwYf,SAAcC,EAAS7b,GACrB,OAAO,IAAI8b,SAAQ,SAAUC,EAASC,GACpC,SAASC,EAAcC,GACrBL,EAAQM,eAAenc,EAAMoc,GAC7BJ,EAAOE,EACT,CAEA,SAASE,IAC+B,mBAA3BP,EAAQM,gBACjBN,EAAQM,eAAe,QAASF,GAElCF,EAAQ,GAAG/Y,MAAM5C,KAAKmE,WACxB,CAEA8X,EAA+BR,EAAS7b,EAAMoc,EAAU,CAAER,MAAM,IACnD,UAAT5b,GAMR,SAAuC6b,EAASS,EAASC,GAC7B,mBAAfV,EAAQW,IACjBH,EAA+BR,EAAS,QAASS,EAPO,CAAEV,MAAM,GASpE,CATMa,CAA8BZ,EAASI,EAE3C,GACF,EAxZAjG,EAAaA,aAAeA,EAE5BA,EAAaxvB,UAAUk2B,aAAUx0B,EACjC8tB,EAAaxvB,UAAUm2B,aAAe,EACtC3G,EAAaxvB,UAAUo2B,mBAAgB10B,EAIvC,IAAI20B,EAAsB,GAE1B,SAASC,EAAcC,GACrB,GAAwB,mBAAbA,EACT,MAAM,IAAIl1B,UAAU,0EAA4Ek1B,EAEpG,CAoCA,SAASC,EAAiBC,GACxB,YAA2B/0B,IAAvB+0B,EAAKL,cACA5G,EAAa6G,oBACfI,EAAKL,aACd,CAkDA,SAASM,EAAa3T,EAAQvF,EAAM+Y,EAAUI,GAC5C,IAAI5kB,EACA6kB,EACAC,EA1HsBC,EAgJ1B,GApBAR,EAAcC,QAGC70B,KADfk1B,EAAS7T,EAAOmT,UAEdU,EAAS7T,EAAOmT,QAAUv2B,OAAOC,OAAO,MACxCmjB,EAAOoT,aAAe,SAIKz0B,IAAvBk1B,EAAOG,cACThU,EAAOiU,KAAK,cAAexZ,EACf+Y,EAASA,SAAWA,EAASA,SAAWA,GAIpDK,EAAS7T,EAAOmT,SAElBW,EAAWD,EAAOpZ,SAGH9b,IAAbm1B,EAEFA,EAAWD,EAAOpZ,GAAQ+Y,IACxBxT,EAAOoT,kBAeT,GAbwB,mBAAbU,EAETA,EAAWD,EAAOpZ,GAChBmZ,EAAU,CAACJ,EAAUM,GAAY,CAACA,EAAUN,GAErCI,EACTE,EAASI,QAAQV,GAEjBM,EAASvW,KAAKiW,IAIhBxkB,EAAIykB,EAAiBzT,IACb,GAAK8T,EAAS71B,OAAS+Q,IAAM8kB,EAASK,OAAQ,CACpDL,EAASK,QAAS,EAGlB,IAAInyB,EAAI,IAAIhD,MAAM,+CACE80B,EAAS71B,OAAS,IAAMqe,OAAO7B,GADjC,qEAIlBzY,EAAEyU,KAAO,8BACTzU,EAAEswB,QAAUtS,EACZhe,EAAEyY,KAAOA,EACTzY,EAAEoyB,MAAQN,EAAS71B,OA7KG81B,EA8KH/xB,EA7KnB+c,SAAWA,QAAQsV,MAAMtV,QAAQsV,KAAKN,EA8KxC,CAGF,OAAO/T,CACT,CAaA,SAASsU,IACP,IAAK/0B,KAAKg1B,MAGR,OAFAh1B,KAAKygB,OAAO4S,eAAerzB,KAAKkb,KAAMlb,KAAKi1B,QAC3Cj1B,KAAKg1B,OAAQ,EACY,IAArBvZ,UAAU/c,OACLsB,KAAKi0B,SAAS3c,KAAKtX,KAAKygB,QAC1BzgB,KAAKi0B,SAAShV,MAAMjf,KAAKygB,OAAQhF,UAE5C,CAEA,SAASyZ,EAAUzU,EAAQvF,EAAM+Y,GAC/B,IAAIkB,EAAQ,CAAEH,OAAO,EAAOC,YAAQ71B,EAAWqhB,OAAQA,EAAQvF,KAAMA,EAAM+Y,SAAUA,GACjFmB,EAAUL,EAAYM,KAAKF,GAG/B,OAFAC,EAAQnB,SAAWA,EACnBkB,EAAMF,OAASG,EACRA,CACT,CAyHA,SAASE,EAAW7U,EAAQvF,EAAMqa,GAChC,IAAIjB,EAAS7T,EAAOmT,QAEpB,QAAex0B,IAAXk1B,EACF,MAAO,GAET,IAAIkB,EAAalB,EAAOpZ,GACxB,YAAmB9b,IAAfo2B,EACK,GAEiB,mBAAfA,EACFD,EAAS,CAACC,EAAWvB,UAAYuB,GAAc,CAACA,GAElDD,EAsDT,SAAyB5Y,GAEvB,IADA,IAAI5X,EAAM,IAAIrD,MAAMib,EAAIje,QACf8C,EAAI,EAAGA,EAAIuD,EAAIrG,SAAU8C,EAChCuD,EAAIvD,GAAKmb,EAAInb,GAAGyyB,UAAYtX,EAAInb,GAElC,OAAOuD,CACT,CA3DI0wB,CAAgBD,GAAcE,EAAWF,EAAYA,EAAW92B,OACpE,CAmBA,SAASi3B,EAAcza,GACrB,IAAIoZ,EAASt0B,KAAK4zB,QAElB,QAAex0B,IAAXk1B,EAAsB,CACxB,IAAIkB,EAAalB,EAAOpZ,GAExB,GAA0B,mBAAfsa,EACT,OAAO,EACF,QAAmBp2B,IAAfo2B,EACT,OAAOA,EAAW92B,MAEtB,CAEA,OAAO,CACT,CAMA,SAASg3B,EAAW/Y,EAAKnN,GAEvB,IADA,IAAIpM,EAAO,IAAI1B,MAAM8N,GACZhO,EAAI,EAAGA,EAAIgO,IAAKhO,EACvB4B,EAAK5B,GAAKmb,EAAInb,GAChB,OAAO4B,CACT,CA2CA,SAASmwB,EAA+BR,EAAS7b,EAAM+c,EAAUR,GAC/D,GAA0B,mBAAfV,EAAQW,GACbD,EAAMX,KACRC,EAAQD,KAAK5b,EAAM+c,GAEnBlB,EAAQW,GAAGxc,EAAM+c,OAEd,IAAwC,mBAA7BlB,EAAQ6C,iBAYxB,MAAM,IAAI72B,UAAU,6EAA+Eg0B,GATnGA,EAAQ6C,iBAAiB1e,GAAM,SAAS2e,EAAar3B,GAG/Ci1B,EAAMX,MACRC,EAAQ+C,oBAAoB5e,EAAM2e,GAEpC5B,EAASz1B,EACX,GAGF,CACF,CAraAnB,OAAOqiB,eAAewN,EAAc,sBAAuB,CACzDrvB,YAAY,EACZ8hB,IAAK,WACH,OAAOoU,CACT,EACA7T,IAAK,SAAS1hB,GACZ,GAAmB,iBAARA,GAAoBA,EAAM,GAAKm0B,EAAYn0B,GACpD,MAAM,IAAIob,WAAW,kGAAoGpb,EAAM,KAEjIu1B,EAAsBv1B,CACxB,IAGF0uB,EAAa2F,KAAO,gBAEGzzB,IAAjBY,KAAK4zB,SACL5zB,KAAK4zB,UAAYv2B,OAAO04B,eAAe/1B,MAAM4zB,UAC/C5zB,KAAK4zB,QAAUv2B,OAAOC,OAAO,MAC7B0C,KAAK6zB,aAAe,GAGtB7zB,KAAK8zB,cAAgB9zB,KAAK8zB,oBAAiB10B,CAC7C,EAIA8tB,EAAaxvB,UAAUs4B,gBAAkB,SAAyBxmB,GAChE,GAAiB,iBAANA,GAAkBA,EAAI,GAAKmjB,EAAYnjB,GAChD,MAAM,IAAIoK,WAAW,gFAAkFpK,EAAI,KAG7G,OADAxP,KAAK8zB,cAAgBtkB,EACdxP,IACT,EAQAktB,EAAaxvB,UAAUu4B,gBAAkB,WACvC,OAAO/B,EAAiBl0B,KAC1B,EAEAktB,EAAaxvB,UAAUg3B,KAAO,SAAcxZ,GAE1C,IADA,IAAIoX,EAAO,GACF9wB,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK8wB,EAAKtU,KAAKvC,UAAUja,IAC/D,IAAI00B,EAAoB,UAAThb,EAEXoZ,EAASt0B,KAAK4zB,QAClB,QAAex0B,IAAXk1B,EACF4B,EAAWA,QAA4B92B,IAAjBk1B,EAAO7U,WAC1B,IAAKyW,EACR,OAAO,EAGT,GAAIA,EAAS,CACX,IAAIC,EAGJ,GAFI7D,EAAK5zB,OAAS,IAChBy3B,EAAK7D,EAAK,IACR6D,aAAc12B,MAGhB,MAAM02B,EAGR,IAAI/C,EAAM,IAAI3zB,MAAM,oBAAsB02B,EAAK,KAAOA,EAAG1P,QAAU,IAAM,KAEzE,MADA2M,EAAIgD,QAAUD,EACR/C,CACR,CAEA,IAAII,EAAUc,EAAOpZ,GAErB,QAAgB9b,IAAZo0B,EACF,OAAO,EAET,GAAuB,mBAAZA,EACTpB,EAAaoB,EAASxzB,KAAMsyB,OAE5B,KAAIjxB,EAAMmyB,EAAQ90B,OACd23B,EAAYX,EAAWlC,EAASnyB,GACpC,IAASG,EAAI,EAAGA,EAAIH,IAAOG,EACzB4wB,EAAaiE,EAAU70B,GAAIxB,KAAMsyB,EAHX,CAM1B,OAAO,CACT,EAgEApF,EAAaxvB,UAAU44B,YAAc,SAAqBpb,EAAM+Y,GAC9D,OAAOG,EAAap0B,KAAMkb,EAAM+Y,GAAU,EAC5C,EAEA/G,EAAaxvB,UAAUg2B,GAAKxG,EAAaxvB,UAAU44B,YAEnDpJ,EAAaxvB,UAAU64B,gBACnB,SAAyBrb,EAAM+Y,GAC7B,OAAOG,EAAap0B,KAAMkb,EAAM+Y,GAAU,EAC5C,EAoBJ/G,EAAaxvB,UAAUo1B,KAAO,SAAc5X,EAAM+Y,GAGhD,OAFAD,EAAcC,GACdj0B,KAAK0zB,GAAGxY,EAAMga,EAAUl1B,KAAMkb,EAAM+Y,IAC7Bj0B,IACT,EAEAktB,EAAaxvB,UAAU84B,oBACnB,SAA6Btb,EAAM+Y,GAGjC,OAFAD,EAAcC,GACdj0B,KAAKu2B,gBAAgBrb,EAAMga,EAAUl1B,KAAMkb,EAAM+Y,IAC1Cj0B,IACT,EAGJktB,EAAaxvB,UAAU21B,eACnB,SAAwBnY,EAAM+Y,GAC5B,IAAIjU,EAAMsU,EAAQmC,EAAUj1B,EAAGk1B,EAK/B,GAHA1C,EAAcC,QAGC70B,KADfk1B,EAASt0B,KAAK4zB,SAEZ,OAAO5zB,KAGT,QAAaZ,KADb4gB,EAAOsU,EAAOpZ,IAEZ,OAAOlb,KAET,GAAIggB,IAASiU,GAAYjU,EAAKiU,WAAaA,EACb,KAAtBj0B,KAAK6zB,aACT7zB,KAAK4zB,QAAUv2B,OAAOC,OAAO,cAEtBg3B,EAAOpZ,GACVoZ,EAAOjB,gBACTrzB,KAAK00B,KAAK,iBAAkBxZ,EAAM8E,EAAKiU,UAAYA,SAElD,GAAoB,mBAATjU,EAAqB,CAGrC,IAFAyW,GAAY,EAEPj1B,EAAIwe,EAAKthB,OAAS,EAAG8C,GAAK,EAAGA,IAChC,GAAIwe,EAAKxe,KAAOyyB,GAAYjU,EAAKxe,GAAGyyB,WAAaA,EAAU,CACzDyC,EAAmB1W,EAAKxe,GAAGyyB,SAC3BwC,EAAWj1B,EACX,KACF,CAGF,GAAIi1B,EAAW,EACb,OAAOz2B,KAEQ,IAAby2B,EACFzW,EAAK5N,QAiIf,SAAmB4N,EAAMtf,GACvB,KAAOA,EAAQ,EAAIsf,EAAKthB,OAAQgC,IAC9Bsf,EAAKtf,GAASsf,EAAKtf,EAAQ,GAC7Bsf,EAAK2W,KACP,CAnIUC,CAAU5W,EAAMyW,GAGE,IAAhBzW,EAAKthB,SACP41B,EAAOpZ,GAAQ8E,EAAK,SAEQ5gB,IAA1Bk1B,EAAOjB,gBACTrzB,KAAK00B,KAAK,iBAAkBxZ,EAAMwb,GAAoBzC,EAC1D,CAEA,OAAOj0B,IACT,EAEJktB,EAAaxvB,UAAUgF,IAAMwqB,EAAaxvB,UAAU21B,eAEpDnG,EAAaxvB,UAAUm5B,mBACnB,SAA4B3b,GAC1B,IAAImb,EAAW/B,EAAQ9yB,EAGvB,QAAepC,KADfk1B,EAASt0B,KAAK4zB,SAEZ,OAAO5zB,KAGT,QAA8BZ,IAA1Bk1B,EAAOjB,eAUT,OATyB,IAArB5X,UAAU/c,QACZsB,KAAK4zB,QAAUv2B,OAAOC,OAAO,MAC7B0C,KAAK6zB,aAAe,QACMz0B,IAAjBk1B,EAAOpZ,KACY,KAAtBlb,KAAK6zB,aACT7zB,KAAK4zB,QAAUv2B,OAAOC,OAAO,aAEtBg3B,EAAOpZ,IAEXlb,KAIT,GAAyB,IAArByb,UAAU/c,OAAc,CAC1B,IACIJ,EADAiqB,EAAOlrB,OAAOkrB,KAAK+L,GAEvB,IAAK9yB,EAAI,EAAGA,EAAI+mB,EAAK7pB,SAAU8C,EAEjB,oBADZlD,EAAMiqB,EAAK/mB,KAEXxB,KAAK62B,mBAAmBv4B,GAK1B,OAHA0B,KAAK62B,mBAAmB,kBACxB72B,KAAK4zB,QAAUv2B,OAAOC,OAAO,MAC7B0C,KAAK6zB,aAAe,EACb7zB,IACT,CAIA,GAAyB,mBAFzBq2B,EAAY/B,EAAOpZ,IAGjBlb,KAAKqzB,eAAenY,EAAMmb,QACrB,QAAkBj3B,IAAdi3B,EAET,IAAK70B,EAAI60B,EAAU33B,OAAS,EAAG8C,GAAK,EAAGA,IACrCxB,KAAKqzB,eAAenY,EAAMmb,EAAU70B,IAIxC,OAAOxB,IACT,EAmBJktB,EAAaxvB,UAAU24B,UAAY,SAAmBnb,GACpD,OAAOoa,EAAWt1B,KAAMkb,GAAM,EAChC,EAEAgS,EAAaxvB,UAAUo5B,aAAe,SAAsB5b,GAC1D,OAAOoa,EAAWt1B,KAAMkb,GAAM,EAChC,EAEAgS,EAAayI,cAAgB,SAAS5C,EAAS7X,GAC7C,MAAqC,mBAA1B6X,EAAQ4C,cACV5C,EAAQ4C,cAAcza,GAEtBya,EAAcre,KAAKyb,EAAS7X,EAEvC,EAEAgS,EAAaxvB,UAAUi4B,cAAgBA,EAiBvCzI,EAAaxvB,UAAUq5B,WAAa,WAClC,OAAO/2B,KAAK6zB,aAAe,EAAI5B,EAAejyB,KAAK4zB,SAAW,EAChE,mBCzaE,IAoBGoD,EAjBH/5B,EAAOD,SAiBJg6B,EAAWA,GAAa,SAAU11B,EAAMlC,GAExC,IAAI63B,EA4BJ,GAzBsB,oBAAX32B,QAA0BA,OAAO22B,SACxCA,EAAS32B,OAAO22B,QAIA,oBAATnzB,MAAwBA,KAAKmzB,SACpCA,EAASnzB,KAAKmzB,QAIQ,oBAAf75B,YAA8BA,WAAW65B,SAChDA,EAAS75B,WAAW65B,SAInBA,GAA4B,oBAAX32B,QAA0BA,OAAO42B,WACnDD,EAAS32B,OAAO42B,WAIfD,QAA4B,IAAX,EAAAxjB,GAA0B,EAAAA,EAAOwjB,SACnDA,EAAS,EAAAxjB,EAAOwjB,SAIfA,EACD,IACIA,EAAS,EAAQ,IACrB,CAAE,MAAO7D,GAAM,CAQnB,IAAI+D,EAAwB,WACxB,GAAIF,EAAQ,CAER,GAAsC,mBAA3BA,EAAOG,gBACd,IACI,OAAOH,EAAOG,gBAAgB,IAAIC,YAAY,IAAI,EACtD,CAAE,MAAOjE,GAAM,CAInB,GAAkC,mBAAvB6D,EAAOK,YACd,IACI,OAAOL,EAAOK,YAAY,GAAG7T,aACjC,CAAE,MAAO2P,GAAM,CAEvB,CAEA,MAAM,IAAI3zB,MAAM,sEACpB,EAMInC,EAASD,OAAOC,QAAW,WAC3B,SAASi6B,IAAK,CAEd,OAAO,SAAUzc,GACb,IAAI0c,EAQJ,OANAD,EAAE75B,UAAYod,EAEd0c,EAAU,IAAID,EAEdA,EAAE75B,UAAY,KAEP85B,CACX,CACJ,CAd8B,GAmB1BjkB,EAAI,CAAC,EAKLkkB,EAAQlkB,EAAEmkB,IAAM,CAAC,EAKjBpR,EAAOmR,EAAMnR,KAGN,CAmBHqR,OAAQ,SAAUC,GAEd,IAAIJ,EAAUl6B,EAAO0C,MAoBrB,OAjBI43B,GACAJ,EAAQK,MAAMD,GAIbJ,EAAQtJ,eAAe,SAAWluB,KAAK6yB,OAAS2E,EAAQ3E,OACzD2E,EAAQ3E,KAAO,WACX2E,EAAQM,OAAOjF,KAAK5T,MAAMjf,KAAMyb,UACpC,GAIJ+b,EAAQ3E,KAAKn1B,UAAY85B,EAGzBA,EAAQM,OAAS93B,KAEVw3B,CACX,EAcAl6B,OAAQ,WACJ,IAAIy6B,EAAW/3B,KAAK23B,SAGpB,OAFAI,EAASlF,KAAK5T,MAAM8Y,EAAUtc,WAEvBsc,CACX,EAcAlF,KAAM,WACN,EAaAgF,MAAO,SAAU9K,GACb,IAAK,IAAIiL,KAAgBjL,EACjBA,EAAWmB,eAAe8J,KAC1Bh4B,KAAKg4B,GAAgBjL,EAAWiL,IAKpCjL,EAAWmB,eAAe,cAC1BluB,KAAKkC,SAAW6qB,EAAW7qB,SAEnC,EAWAoB,MAAO,WACH,OAAOtD,KAAK6yB,KAAKn1B,UAAUi6B,OAAO33B,KACtC,GAUJi4B,EAAYR,EAAMQ,UAAY3R,EAAKqR,OAAO,CAa1C9E,KAAM,SAAU3yB,EAAOg4B,GACnBh4B,EAAQF,KAAKE,MAAQA,GAAS,GAG1BF,KAAKk4B,SA7OM,MA4OXA,EACgBA,EAEe,EAAfh4B,EAAMxB,MAE9B,EAeAwD,SAAU,SAAUi2B,GAChB,OAAQA,GAAWC,GAAKC,UAAUr4B,KACtC,EAaA+f,OAAQ,SAAUuY,GAEd,IAAIC,EAAYv4B,KAAKE,MACjBs4B,EAAYF,EAAUp4B,MACtBu4B,EAAez4B,KAAKk4B,SACpBQ,EAAeJ,EAAUJ,SAM7B,GAHAl4B,KAAK24B,QAGDF,EAAe,EAEf,IAAK,IAAIj3B,EAAI,EAAGA,EAAIk3B,EAAcl3B,IAAK,CACnC,IAAIo3B,EAAYJ,EAAUh3B,IAAM,KAAQ,GAAMA,EAAI,EAAK,EAAM,IAC7D+2B,EAAWE,EAAej3B,IAAO,IAAMo3B,GAAa,IAAOH,EAAej3B,GAAK,EAAK,CACxF,MAGA,IAAK,IAAIgB,EAAI,EAAGA,EAAIk2B,EAAcl2B,GAAK,EACnC+1B,EAAWE,EAAej2B,IAAO,GAAKg2B,EAAUh2B,IAAM,GAM9D,OAHAxC,KAAKk4B,UAAYQ,EAGV14B,IACX,EASA24B,MAAO,WAEH,IAAIz4B,EAAQF,KAAKE,MACbg4B,EAAWl4B,KAAKk4B,SAGpBh4B,EAAMg4B,IAAa,IAAM,YAAe,GAAMA,EAAW,EAAK,EAC9Dh4B,EAAMxB,OAAS4C,EAAKiB,KAAK21B,EAAW,EACxC,EAWA50B,MAAO,WACH,IAAIA,EAAQgjB,EAAKhjB,MAAMgU,KAAKtX,MAG5B,OAFAsD,EAAMpD,MAAQF,KAAKE,MAAMga,MAAM,GAExB5W,CACX,EAeAu1B,OAAQ,SAAUC,GAGd,IAFA,IAAI54B,EAAQ,GAEHsB,EAAI,EAAGA,EAAIs3B,EAAQt3B,GAAK,EAC7BtB,EAAM8d,KAAKmZ,KAGf,OAAO,IAAIc,EAAUpF,KAAK3yB,EAAO44B,EACrC,IAMAC,EAAQxlB,EAAE0c,IAAM,CAAC,EAKjBmI,EAAMW,EAAMX,IAAM,CAclBC,UAAW,SAAUC,GAOjB,IALA,IAAIp4B,EAAQo4B,EAAUp4B,MAClBg4B,EAAWI,EAAUJ,SAGrBc,EAAW,GACNx3B,EAAI,EAAGA,EAAI02B,EAAU12B,IAAK,CAC/B,IAAIy3B,EAAQ/4B,EAAMsB,IAAM,KAAQ,GAAMA,EAAI,EAAK,EAAM,IACrDw3B,EAAShb,MAAMib,IAAS,GAAG/2B,SAAS,KACpC82B,EAAShb,MAAa,GAAPib,GAAa/2B,SAAS,IACzC,CAEA,OAAO82B,EAASE,KAAK,GACzB,EAeAC,MAAO,SAAUC,GAMb,IAJA,IAAIC,EAAeD,EAAO16B,OAGtBwB,EAAQ,GACHsB,EAAI,EAAGA,EAAI63B,EAAc73B,GAAK,EACnCtB,EAAMsB,IAAM,IAAMkc,SAAS0b,EAAOzb,OAAOnc,EAAG,GAAI,KAAQ,GAAMA,EAAI,EAAK,EAG3E,OAAO,IAAIy2B,EAAUpF,KAAK3yB,EAAOm5B,EAAe,EACpD,GAMAC,EAASP,EAAMO,OAAS,CAcxBjB,UAAW,SAAUC,GAOjB,IALA,IAAIp4B,EAAQo4B,EAAUp4B,MAClBg4B,EAAWI,EAAUJ,SAGrBqB,EAAc,GACT/3B,EAAI,EAAGA,EAAI02B,EAAU12B,IAAK,CAC/B,IAAIy3B,EAAQ/4B,EAAMsB,IAAM,KAAQ,GAAMA,EAAI,EAAK,EAAM,IACrD+3B,EAAYvb,KAAKjB,OAAOiC,aAAaia,GACzC,CAEA,OAAOM,EAAYL,KAAK,GAC5B,EAeAC,MAAO,SAAUK,GAMb,IAJA,IAAIC,EAAkBD,EAAU96B,OAG5BwB,EAAQ,GACHsB,EAAI,EAAGA,EAAIi4B,EAAiBj4B,IACjCtB,EAAMsB,IAAM,KAAiC,IAA1Bg4B,EAAU54B,WAAWY,KAAe,GAAMA,EAAI,EAAK,EAG1E,OAAO,IAAIy2B,EAAUpF,KAAK3yB,EAAOu5B,EACrC,GAMAC,EAAOX,EAAMW,KAAO,CAcpBrB,UAAW,SAAUC,GACjB,IACI,OAAOqB,mBAAmBC,OAAON,EAAOjB,UAAUC,IACtD,CAAE,MAAO/3B,GACL,MAAM,IAAId,MAAM,uBACpB,CACJ,EAeA05B,MAAO,SAAUU,GACb,OAAOP,EAAOH,MAAMW,SAASC,mBAAmBF,IACpD,GAUAG,EAAyBvC,EAAMuC,uBAAyB1T,EAAKqR,OAAO,CAQpEsC,MAAO,WAEHj6B,KAAKk6B,MAAQ,IAAIjC,EAAUpF,KAC3B7yB,KAAKm6B,YAAc,CACvB,EAYAC,QAAS,SAAUjf,GAEI,iBAARA,IACPA,EAAOue,EAAKP,MAAMhe,IAItBnb,KAAKk6B,MAAMna,OAAO5E,GAClBnb,KAAKm6B,aAAehf,EAAK+c,QAC7B,EAgBAmC,SAAU,SAAUC,GAChB,IAAIC,EAGApf,EAAOnb,KAAKk6B,MACZM,EAAYrf,EAAKjb,MACjBu6B,EAAetf,EAAK+c,SACpBwC,EAAY16B,KAAK06B,UAIjBC,EAAeF,GAHc,EAAZC,GAcjBE,GARAD,EAFAL,EAEeh5B,EAAKiB,KAAKo4B,GAIVr5B,EAAKM,KAAoB,EAAf+4B,GAAoB36B,KAAK66B,eAAgB,IAIrCH,EAG7BI,EAAcx5B,EAAKC,IAAkB,EAAdq5B,EAAiBH,GAG5C,GAAIG,EAAa,CACb,IAAK,IAAIvd,EAAS,EAAGA,EAASud,EAAavd,GAAUqd,EAEjD16B,KAAK+6B,gBAAgBP,EAAWnd,GAIpCkd,EAAiBC,EAAUQ,OAAO,EAAGJ,GACrCzf,EAAK+c,UAAY4C,CACrB,CAGA,OAAO,IAAI7C,EAAUpF,KAAK0H,EAAgBO,EAC9C,EAWAx3B,MAAO,WACH,IAAIA,EAAQgjB,EAAKhjB,MAAMgU,KAAKtX,MAG5B,OAFAsD,EAAM42B,MAAQl6B,KAAKk6B,MAAM52B,QAElBA,CACX,EAEAu3B,eAAgB,IA2IhBI,GAnISxD,EAAMyD,OAASlB,EAAuBrC,OAAO,CAItDwD,IAAK7U,EAAKqR,SAWV9E,KAAM,SAAUsI,GAEZn7B,KAAKm7B,IAAMn7B,KAAKm7B,IAAIxD,OAAOwD,GAG3Bn7B,KAAKi6B,OACT,EASAA,MAAO,WAEHD,EAAuBC,MAAM3iB,KAAKtX,MAGlCA,KAAKo7B,UACT,EAcAC,OAAQ,SAAUC,GAQd,OANAt7B,KAAKo6B,QAAQkB,GAGbt7B,KAAKq6B,WAGEr6B,IACX,EAgBAu7B,SAAU,SAAUD,GAShB,OAPIA,GACAt7B,KAAKo6B,QAAQkB,GAINt7B,KAAKw7B,aAGpB,EAEAd,UAAW,GAeXe,cAAe,SAAUC,GACrB,OAAO,SAAUjV,EAAS0U,GACtB,OAAO,IAAIO,EAAO7I,KAAKsI,GAAKI,SAAS9U,EACzC,CACJ,EAeAkV,kBAAmB,SAAUD,GACzB,OAAO,SAAUjV,EAASnoB,GACtB,OAAO,IAAI28B,EAAOW,KAAK/I,KAAK6I,EAAQp9B,GAAKi9B,SAAS9U,EACtD,CACJ,IAMSlT,EAAEsoB,KAAO,CAAC,GAEvB,OAAOtoB,CACX,CA7wB2B,CA6wBzBjS,MAGK01B,2BChyBR,IAAI8E,EAAY,MAUZ59B,EAAS,YACT+4B,EAAS,EAAAxjB,EAAOwjB,QAAU,EAAAxjB,EAAOyjB,SAEjCD,GAAUA,EAAOG,gBACnBn6B,EAAOD,QAKT,SAAsBgC,EAAM+8B,GAE1B,GAAI/8B,EAjBW,WAiBQ,MAAM,IAAI4a,WAAW,mCAE5C,IAAIsH,EAAQhjB,EAAOW,YAAYG,GAE/B,GAAIA,EAAO,EACT,GAAIA,EAAO88B,EAET,IAAK,IAAIE,EAAY,EAAGA,EAAYh9B,EAAMg9B,GAAaF,EAGrD7E,EAAOG,gBAAgBlW,EAAMhH,MAAM8hB,EAAWA,EAAYF,SAG5D7E,EAAOG,gBAAgBlW,GAI3B,MAAkB,mBAAP6a,EACFnO,QAAQqO,UAAS,WACtBF,EAAG,KAAM7a,EACX,IAGKA,CACT,EA7BEjkB,EAAOD,QAVT,WACE,MAAM,IAAIyC,MAAM,iHAClB,0BCXA,IAAIC,EAAW,EAAQ,GACnBw8B,EAAM,EAAQ,IACdC,EAAY,EAAQ,IACpBC,EAAM,EAAQ,IACd9V,EAAO,EAAQ,IAEnB,SAAS+V,EAAMpN,GACb3I,EAAKhP,KAAKtX,KAAM,UAEhBA,KAAKs8B,MAAQrN,CACf,CAEAvvB,EAAS28B,EAAM/V,GAEf+V,EAAK3+B,UAAU6+B,QAAU,SAAUphB,GACjCnb,KAAKs8B,MAAMjB,OAAOlgB,EACpB,EAEAkhB,EAAK3+B,UAAU8+B,OAAS,WACtB,OAAOx8B,KAAKs8B,MAAMG,QACpB,EAEAx/B,EAAOD,QAAU,SAAqB0/B,GAEpC,MAAY,SADZA,EAAMA,EAAI7gB,eACgB,IAAIqgB,EAClB,WAARQ,GAA4B,cAARA,EAA4B,IAAIP,EAEjD,IAAIE,EAAKD,EAAIM,GACtB,aC7BA,IAAIx+B,EAAS,YACTy+B,EAAY,iBACZC,EAAgB,QAGpB,SAASC,EAAYC,GACnBH,EAAUrlB,KAAKtX,MACfA,KAAK88B,SAA+B,iBAAbA,EACnB98B,KAAK88B,SACP98B,KAAK88B,GAAY98B,KAAK+8B,eAEtB/8B,KAAKg9B,MAAQh9B,KAAK+8B,eAEhB/8B,KAAKw8B,SACPx8B,KAAKi9B,QAAUj9B,KAAKw8B,OACpBx8B,KAAKw8B,OAAS,MAEhBx8B,KAAKk9B,SAAW,KAChBl9B,KAAKm9B,UAAY,IACnB,CAhBe,EAAQ,EAiBvBz9B,CAASm9B,EAAYF,GAErBE,EAAWn/B,UAAU29B,OAAS,SAAUlgB,EAAMiiB,EAAUC,GAClC,iBAATliB,IACTA,EAAOjd,EAAOS,KAAKwc,EAAMiiB,IAG3B,IAAIE,EAAUt9B,KAAKu8B,QAAQphB,GAC3B,OAAInb,KAAK88B,SAAiB98B,MAEtBq9B,IACFC,EAAUt9B,KAAKu9B,UAAUD,EAASD,IAG7BC,EACT,EAEAT,EAAWn/B,UAAU8/B,eAAiB,WAAa,EACnDX,EAAWn/B,UAAU+/B,WAAa,WAChC,MAAM,IAAIh+B,MAAM,8CAClB,EAEAo9B,EAAWn/B,UAAUggC,WAAa,WAChC,MAAM,IAAIj+B,MAAM,8CAClB,EAEAo9B,EAAWn/B,UAAUigC,OAAS,WAC5B,MAAM,IAAIl+B,MAAM,yCAClB,EAEAo9B,EAAWn/B,UAAUkgC,WAAa,SAAUziB,EAAMjL,EAAGuI,GACnD,IAAI2a,EACJ,IACMpzB,KAAK88B,SACP98B,KAAKu8B,QAAQphB,GAEbnb,KAAKge,KAAKhe,KAAKu8B,QAAQphB,GAE3B,CAAE,MAAO5a,GACP6yB,EAAM7yB,CACR,CAAE,QACAkY,EAAK2a,EACP,CACF,EACAyJ,EAAWn/B,UAAUmgC,OAAS,SAAUC,GACtC,IAAI1K,EACJ,IACEpzB,KAAKge,KAAKhe,KAAKi9B,UACjB,CAAE,MAAO18B,GACP6yB,EAAM7yB,CACR,CAEAu9B,EAAK1K,EACP,EACAyJ,EAAWn/B,UAAUq/B,eAAiB,SAAUM,GAC9C,IAAIC,EAAUt9B,KAAKi9B,WAAa/+B,EAAOU,MAAM,GAI7C,OAHIy+B,IACFC,EAAUt9B,KAAKu9B,UAAUD,EAASD,GAAW,IAExCC,CACT,EAEAT,EAAWn/B,UAAU6/B,UAAY,SAAU3/B,EAAOqyB,EAAK8N,GAMrD,GALK/9B,KAAKk9B,WACRl9B,KAAKk9B,SAAW,IAAIN,EAAc3M,GAClCjwB,KAAKm9B,UAAYlN,GAGfjwB,KAAKm9B,YAAclN,EAAK,MAAM,IAAIxwB,MAAM,0BAE5C,IAAIsE,EAAM/D,KAAKk9B,SAASjjB,MAAMrc,GAK9B,OAJImgC,IACFh6B,GAAO/D,KAAKk9B,SAAS/7B,OAGhB4C,CACT,EAEA9G,EAAOD,QAAU6/B,0BCjGjB5/B,EAAOD,QAAUghC,EAGjB,IAAIvS,EAAmB,EAAQ,MAC7BuS,EAAMtgC,UAAYL,OAAOC,OAAOmuB,EAAiB/tB,YAAYC,YAAcqgC,GAAOtS,UAAY,QAEhG,IAII7D,EAJAC,EAAQ,EAAQ,GAChBmW,EAAQ,EAAQ,IAChBlW,EAAQ,EAAQ,GAIhBmW,EAAS,+BAyCb,SAASF,EAAM9mB,EAAMsS,EAAItO,EAAMijB,EAAMxG,EAAQ9L,EAASC,GAclD,GAZI/D,EAAKgG,SAASoQ,IACdrS,EAAU6L,EACV9L,EAAUsS,EACVA,EAAOxG,OAASv4B,GACT2oB,EAAKgG,SAAS4J,KACrB7L,EAAUD,EACVA,EAAU8L,EACVA,OAASv4B,GAGbqsB,EAAiBnU,KAAKtX,KAAMkX,EAAM2U,IAE7B9D,EAAKb,UAAUsC,IAAOA,EAAK,EAC5B,MAAMzqB,UAAU,qCAEpB,IAAKgpB,EAAKwE,SAASrR,GACf,MAAMnc,UAAU,yBAEpB,QAAaK,IAAT++B,IAAuBD,EAAOtV,KAAKuV,EAAOA,EAAKj8B,WAAW2Z,eAC1D,MAAM9c,UAAU,8BAEpB,QAAeK,IAAXu4B,IAAyB5P,EAAKwE,SAASoL,GACvC,MAAM54B,UAAU,2BAMpBiB,KAAKm+B,KAAOA,GAAiB,aAATA,EAAsBA,OAAO/+B,EAMjDY,KAAKkb,KAAOA,EAMZlb,KAAKwpB,GAAKA,EAMVxpB,KAAK23B,OAASA,QAAUv4B,EAMxBY,KAAKo+B,SAAoB,aAATD,EAMhBn+B,KAAKq+B,UAAYr+B,KAAKo+B,SAMtBp+B,KAAKs+B,SAAoB,aAATH,EAMhBn+B,KAAKu+B,KAAM,EAMXv+B,KAAKymB,QAAU,KAMfzmB,KAAKw+B,OAAS,KAMdx+B,KAAKy+B,YAAc,KAMnBz+B,KAAK0+B,aAAe,KAMpB1+B,KAAK2+B,OAAO5W,EAAKyG,WAA4BpvB,IAArB6+B,EAAMU,KAAKzjB,GAMnClb,KAAKkhB,MAAiB,UAAThG,EAMblb,KAAK4+B,aAAe,KAMpB5+B,KAAK6+B,eAAiB,KAMtB7+B,KAAK8+B,eAAiB,KAOtB9+B,KAAK++B,QAAU,KAMf/+B,KAAK8rB,QAAUA,CACnB,CA9JAkS,EAAM9R,SAAW,SAAkBhV,EAAMiV,GACrC,OAAO,IAAI6R,EAAM9mB,EAAMiV,EAAK3C,GAAI2C,EAAKjR,KAAMiR,EAAKgS,KAAMhS,EAAKwL,OAAQxL,EAAKN,QAASM,EAAKL,QAC1F,EAoKAzuB,OAAOqiB,eAAese,EAAMtgC,UAAW,SAAU,CAC7CiiB,IAAK,WAID,OAFqB,OAAjB3f,KAAK++B,UACL/+B,KAAK++B,SAAuC,IAA7B/+B,KAAKg/B,UAAU,WAC3Bh/B,KAAK++B,OAChB,IAMJf,EAAMtgC,UAAUuhC,UAAY,SAAmB/nB,EAAMtZ,EAAOgvB,GAGxD,MAFa,WAAT1V,IACAlX,KAAK++B,QAAU,MACZtT,EAAiB/tB,UAAUuhC,UAAU3nB,KAAKtX,KAAMkX,EAAMtZ,EAAOgvB,EACxE,EAuBAoR,EAAMtgC,UAAUsH,OAAS,SAAgBonB,GACrC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,OAA0B,aAAdxoB,KAAKm+B,MAAuBn+B,KAAKm+B,WAAQ/+B,EACrD,OAAYY,KAAKkb,KACjB,KAAYlb,KAAKwpB,GACjB,SAAYxpB,KAAK23B,OACjB,UAAY33B,KAAK6rB,QACjB,UAAYQ,EAAersB,KAAK8rB,aAAU1sB,GAElD,EAOA4+B,EAAMtgC,UAAUu1B,QAAU,WAEtB,GAAIjzB,KAAKk/B,SACL,OAAOl/B,KA0BX,QAxBuDZ,KAAlDY,KAAKy+B,YAAcR,EAAMkB,SAASn/B,KAAKkb,SACxClb,KAAK4+B,cAAgB5+B,KAAK8+B,eAAiB9+B,KAAK8+B,eAAeM,OAASp/B,KAAKo/B,QAAQC,iBAAiBr/B,KAAKkb,MACvGlb,KAAK4+B,wBAAwB/W,EAC7B7nB,KAAKy+B,YAAc,KAEnBz+B,KAAKy+B,YAAcz+B,KAAK4+B,aAAahT,OAAOvuB,OAAOkrB,KAAKvoB,KAAK4+B,aAAahT,QAAQ,KAItF5rB,KAAK6rB,SAAsC,MAA3B7rB,KAAK6rB,QAAiB,UACtC7rB,KAAKy+B,YAAcz+B,KAAK6rB,QAAiB,QACrC7rB,KAAK4+B,wBAAwB9W,GAAoC,iBAArB9nB,KAAKy+B,cACjDz+B,KAAKy+B,YAAcz+B,KAAK4+B,aAAahT,OAAO5rB,KAAKy+B,eAIrDz+B,KAAK6rB,WACuB,IAAxB7rB,KAAK6rB,QAAQyT,cAA2ClgC,IAAxBY,KAAK6rB,QAAQyT,SAAwBt/B,KAAK4+B,cAAkB5+B,KAAK4+B,wBAAwB9W,WAClH9nB,KAAK6rB,QAAQyT,OACnBjiC,OAAOkrB,KAAKvoB,KAAK6rB,SAASntB,SAC3BsB,KAAK6rB,aAAUzsB,IAInBY,KAAK2+B,KACL3+B,KAAKy+B,YAAc1W,EAAKyG,KAAK+Q,WAAWv/B,KAAKy+B,YAAqC,MAAxBz+B,KAAKkb,KAAK8N,OAAO,IAGvE3rB,OAAOowB,QACPpwB,OAAOowB,OAAOztB,KAAKy+B,kBAEpB,GAAIz+B,KAAKkhB,OAAqC,iBAArBlhB,KAAKy+B,YAA0B,CAC3D,IAAIt/B,EACA4oB,EAAK1O,OAAOuP,KAAK5oB,KAAKy+B,aACtB1W,EAAK1O,OAAOmmB,OAAOx/B,KAAKy+B,YAAat/B,EAAM4oB,EAAKuG,UAAUvG,EAAK1O,OAAO3a,OAAOsB,KAAKy+B,cAAe,GAEjG1W,EAAKqF,KAAKnT,MAAMja,KAAKy+B,YAAat/B,EAAM4oB,EAAKuG,UAAUvG,EAAKqF,KAAK1uB,OAAOsB,KAAKy+B,cAAe,GAChGz+B,KAAKy+B,YAAct/B,CACvB,CAcA,OAXIa,KAAKu+B,IACLv+B,KAAK0+B,aAAe3W,EAAK2F,YACpB1tB,KAAKs+B,SACVt+B,KAAK0+B,aAAe3W,EAAKyF,WAEzBxtB,KAAK0+B,aAAe1+B,KAAKy+B,YAGzBz+B,KAAKo/B,kBAAkBvX,IACvB7nB,KAAKo/B,OAAO7hC,KAAKG,UAAUsC,KAAKkX,MAAQlX,KAAK0+B,cAE1CjT,EAAiB/tB,UAAUu1B,QAAQ3b,KAAKtX,KACnD,EAsBAg+B,EAAMtN,EAAI,SAAuB+O,EAASC,EAAWC,EAAWjB,GAU5D,MAPyB,mBAAdgB,EACPA,EAAY3X,EAAK0B,aAAaiW,GAAWxoB,KAGpCwoB,GAAkC,iBAAdA,IACzBA,EAAY3X,EAAKgC,aAAa2V,GAAWxoB,MAEtC,SAAwBxZ,EAAWkiC,GACtC7X,EAAK0B,aAAa/rB,EAAUC,aACvBqK,IAAI,IAAIg2B,EAAM4B,EAAWH,EAASC,EAAWC,EAAW,CAAE,QAAWjB,IAC9E,CACJ,EAgBAV,EAAMnO,WAAa,SAAmBgQ,GAClChY,EAAOgY,CACX,0BCjXA5iC,EAAOD,QAAUyuB,EAEjBA,EAAiBC,UAAY,mBAE7B,IAEIoU,EAFA/X,EAAO,EAAQ,GAYnB,SAAS0D,EAAiBvU,EAAM2U,GAE5B,IAAK9D,EAAKwE,SAASrV,GACf,MAAMnY,UAAU,yBAEpB,GAAI8sB,IAAY9D,EAAKgG,SAASlC,GAC1B,MAAM9sB,UAAU,6BAMpBiB,KAAK6rB,QAAUA,EAMf7rB,KAAKkX,KAAOA,EAMZlX,KAAKo/B,OAAS,KAMdp/B,KAAKk/B,UAAW,EAMhBl/B,KAAK8rB,QAAU,KAMf9rB,KAAK+/B,SAAW,IACpB,CAEA1iC,OAAO2iC,iBAAiBvU,EAAiB/tB,UAAW,CAQhDZ,KAAM,CACF6iB,IAAK,WAED,IADA,IAAIsgB,EAAMjgC,KACY,OAAfigC,EAAIb,QACPa,EAAMA,EAAIb,OACd,OAAOa,CACX,GASJC,SAAU,CACNvgB,IAAK,WAGD,IAFA,IAAIwI,EAAO,CAAEnoB,KAAKkX,MACd+oB,EAAMjgC,KAAKo/B,OACRa,GACH9X,EAAKwM,QAAQsL,EAAI/oB,MACjB+oB,EAAMA,EAAIb,OAEd,OAAOjX,EAAK+Q,KAAK,IACrB,KASRzN,EAAiB/tB,UAAUsH,OAAoC,WAC3D,MAAMvF,OACV,EAOAgsB,EAAiB/tB,UAAUyiC,MAAQ,SAAef,GAC1Cp/B,KAAKo/B,QAAUp/B,KAAKo/B,SAAWA,GAC/Bp/B,KAAKo/B,OAAOvV,OAAO7pB,MACvBA,KAAKo/B,OAASA,EACdp/B,KAAKk/B,UAAW,EAChB,IAAIpiC,EAAOsiC,EAAOtiC,KACdA,aAAgBgjC,GAChBhjC,EAAKsjC,WAAWpgC,KACxB,EAOAyrB,EAAiB/tB,UAAU2iC,SAAW,SAAkBjB,GACpD,IAAItiC,EAAOsiC,EAAOtiC,KACdA,aAAgBgjC,GAChBhjC,EAAKwjC,cAActgC,MACvBA,KAAKo/B,OAAS,KACdp/B,KAAKk/B,UAAW,CACpB,EAMAzT,EAAiB/tB,UAAUu1B,QAAU,WACjC,OAAIjzB,KAAKk/B,UAELl/B,KAAKlD,gBAAgBgjC,IACrB9/B,KAAKk/B,UAAW,GAFTl/B,IAIf,EAOAyrB,EAAiB/tB,UAAUshC,UAAY,SAAmB9nB,GACtD,GAAIlX,KAAK6rB,QACL,OAAO7rB,KAAK6rB,QAAQ3U,EAE5B,EASAuU,EAAiB/tB,UAAUuhC,UAAY,SAAmB/nB,EAAMtZ,EAAOgvB,GAGnE,OAFKA,GAAa5sB,KAAK6rB,cAAkCzsB,IAAvBY,KAAK6rB,QAAQ3U,MAC1ClX,KAAK6rB,UAAY7rB,KAAK6rB,QAAU,CAAC,IAAI3U,GAAQtZ,GAC3CoC,IACX,EAQAyrB,EAAiB/tB,UAAU6iC,WAAa,SAAoB1U,EAASe,GACjE,GAAIf,EACA,IAAK,IAAItD,EAAOlrB,OAAOkrB,KAAKsD,GAAUrqB,EAAI,EAAGA,EAAI+mB,EAAK7pB,SAAU8C,EAC5DxB,KAAKi/B,UAAU1W,EAAK/mB,GAAIqqB,EAAQtD,EAAK/mB,IAAKorB,GAClD,OAAO5sB,IACX,EAMAyrB,EAAiB/tB,UAAUwE,SAAW,WAClC,IAAIwpB,EAAY1rB,KAAKrC,YAAY+tB,UAC7BwU,EAAYlgC,KAAKkgC,SACrB,OAAIA,EAASxhC,OACFgtB,EAAY,IAAMwU,EACtBxU,CACX,EAGAD,EAAiBoE,WAAa,SAAS2Q,GACnCV,EAAOU,CACX,0BCjMA,IAAIvC,EAAQjhC,EAER+qB,EAAO,EAAQ,GAEftZ,EAAI,CACJ,SACA,QACA,QACA,SACA,SACA,UACA,WACA,QACA,SACA,SACA,UACA,WACA,OACA,SACA,SAGJ,SAASgyB,EAAK7U,EAAQvO,GAClB,IAAI7b,EAAI,EAAG4G,EAAI,CAAC,EAEhB,IADAiV,GAAU,EACH7b,EAAIoqB,EAAOltB,QAAQ0J,EAAEqG,EAAEjN,EAAI6b,IAAWuO,EAAOpqB,KACpD,OAAO4G,CACX,CAsBA61B,EAAMyC,MAAQD,EAAK,CACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAwBnBxC,EAAMkB,SAAWsB,EAAK,CACH,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EACA,GACA1Y,EAAKyF,WACL,OAanByQ,EAAMU,KAAO8B,EAAK,CACC,EACA,EACA,EACA,EACA,GAChB,GAmBHxC,EAAM0C,OAASF,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAChB,GAoBHxC,EAAMqB,OAASmB,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,eClMnB,IAAIviC,EAAS,YAGb,SAASm+B,EAAM3B,EAAWkG,GACxB5gC,KAAK6gC,OAAS3iC,EAAOU,MAAM87B,GAC3B16B,KAAK8gC,WAAaF,EAClB5gC,KAAK+gC,WAAarG,EAClB16B,KAAKghC,KAAO,CACd,CAEA3E,EAAK3+B,UAAU29B,OAAS,SAAUlgB,EAAM8U,GAClB,iBAAT9U,IACT8U,EAAMA,GAAO,OACb9U,EAAOjd,EAAOS,KAAKwc,EAAM8U,IAQ3B,IALA,IAAIgR,EAAQjhC,KAAK6gC,OACbnG,EAAY16B,KAAK+gC,WACjBriC,EAASyc,EAAKzc,OACdwiC,EAAQlhC,KAAKghC,KAER3jB,EAAS,EAAGA,EAAS3e,GAAS,CAIrC,IAHA,IAAIyiC,EAAWD,EAAQxG,EACnB0G,EAAY9/B,KAAKC,IAAI7C,EAAS2e,EAAQqd,EAAYyG,GAE7C3/B,EAAI,EAAGA,EAAI4/B,EAAW5/B,IAC7By/B,EAAME,EAAW3/B,GAAK2Z,EAAKkC,EAAS7b,GAItC6b,GAAU+jB,GADVF,GAASE,GAGI1G,GAAe,GAC1B16B,KAAKu8B,QAAQ0E,EAEjB,CAGA,OADAjhC,KAAKghC,MAAQtiC,EACNsB,IACT,EAEAq8B,EAAK3+B,UAAU++B,OAAS,SAAUxM,GAChC,IAAIoR,EAAMrhC,KAAKghC,KAAOhhC,KAAK+gC,WAE3B/gC,KAAK6gC,OAAOQ,GAAO,IAInBrhC,KAAK6gC,OAAO5hC,KAAK,EAAGoiC,EAAM,GAEtBA,GAAOrhC,KAAK8gC,aACd9gC,KAAKu8B,QAAQv8B,KAAK6gC,QAClB7gC,KAAK6gC,OAAO5hC,KAAK,IAGnB,IAAI8R,EAAmB,EAAZ/Q,KAAKghC,KAGhB,GAAIjwB,GAAQ,WACV/Q,KAAK6gC,OAAO/b,cAAc/T,EAAM/Q,KAAK+gC,WAAa,OAG7C,CACL,IAAIO,GAAkB,WAAPvwB,KAAuB,EAClCwwB,GAAYxwB,EAAOuwB,GAAW,WAElCthC,KAAK6gC,OAAO/b,cAAcyc,EAAUvhC,KAAK+gC,WAAa,GACtD/gC,KAAK6gC,OAAO/b,cAAcwc,EAASthC,KAAK+gC,WAAa,EACvD,CAEA/gC,KAAKu8B,QAAQv8B,KAAK6gC,QAClB,IAAI5R,EAAOjvB,KAAKs8B,QAEhB,OAAOrM,EAAMhB,EAAK/sB,SAAS+tB,GAAOhB,CACpC,EAEAoN,EAAK3+B,UAAU6+B,QAAU,WACvB,MAAM,IAAI98B,MAAM,0CAClB,EAEAxC,EAAOD,QAAUq/B,0BC/EjBp/B,EAAOD,QAAU2uB,EAGjB,IAAIF,EAAmB,EAAQ,MAC7BE,EAAUjuB,UAAYL,OAAOC,OAAOmuB,EAAiB/tB,YAAYC,YAAcguB,GAAWD,UAAY,YAExG,IAGI7D,EACA2Z,EACA1Z,EALAkW,EAAW,EAAQ,IACnBjW,EAAW,EAAQ,GAoCvB,SAAS0Z,EAAYlmB,EAAO6Q,GACxB,GAAM7Q,GAASA,EAAM7c,OAArB,CAGA,IADA,IAAIoc,EAAM,CAAC,EACFtZ,EAAI,EAAGA,EAAI+Z,EAAM7c,SAAU8C,EAChCsZ,EAAIS,EAAM/Z,GAAG0V,MAAQqE,EAAM/Z,GAAGwD,OAAOonB,GACzC,OAAOtR,CAJa,CAKxB,CA2CA,SAAS6Q,EAAUzU,EAAM2U,GACrBJ,EAAiBnU,KAAKtX,KAAMkX,EAAM2U,GAMlC7rB,KAAK0hC,YAAStiC,EAOdY,KAAK2hC,aAAe,IACxB,CAEA,SAASC,EAAWC,GAEhB,OADAA,EAAUF,aAAe,KAClBE,CACX,CAjFAlW,EAAUO,SAAW,SAAkBhV,EAAMiV,GACzC,OAAO,IAAIR,EAAUzU,EAAMiV,EAAKN,SAASiW,QAAQ3V,EAAKuV,OAC1D,EAkBA/V,EAAU8V,YAAcA,EAQxB9V,EAAUa,aAAe,SAAsBP,EAAUzC,GACrD,GAAIyC,EACA,IAAK,IAAIzqB,EAAI,EAAGA,EAAIyqB,EAASvtB,SAAU8C,EACnC,GAA2B,iBAAhByqB,EAASzqB,IAAmByqB,EAASzqB,GAAG,IAAMgoB,GAAMyC,EAASzqB,GAAG,IAAMgoB,EAC7E,OAAO,EACnB,OAAO,CACX,EAQAmC,EAAUc,eAAiB,SAAwBR,EAAU/U,GACzD,GAAI+U,EACA,IAAK,IAAIzqB,EAAI,EAAGA,EAAIyqB,EAASvtB,SAAU8C,EACnC,GAAIyqB,EAASzqB,KAAO0V,EAChB,OAAO,EACnB,OAAO,CACX,EAyCA7Z,OAAOqiB,eAAeiM,EAAUjuB,UAAW,cAAe,CACtDiiB,IAAK,WACD,OAAO3f,KAAK2hC,eAAiB3hC,KAAK2hC,aAAe5Z,EAAKzlB,QAAQtC,KAAK0hC,QACvE,IA4BJ/V,EAAUjuB,UAAUsH,OAAS,SAAgBonB,GACzC,OAAOrE,EAAKS,SAAS,CACjB,UAAYxoB,KAAK6rB,QACjB,SAAY4V,EAAYzhC,KAAK+hC,YAAa3V,IAElD,EAOAT,EAAUjuB,UAAUokC,QAAU,SAAiBE,GAG3C,GAAIA,EACA,IAAK,IAA4CN,EAAxCO,EAAQ5kC,OAAOkrB,KAAKyZ,GAAaxgC,EAAI,EAAWA,EAAIygC,EAAMvjC,SAAU8C,EACzEkgC,EAASM,EAAWC,EAAMzgC,IAJzBxB,KAKEgI,UACqB5I,IAAlBsiC,EAAOQ,OACPra,EAAKqE,cACa9sB,IAAlBsiC,EAAO9V,OACP9D,EAAKoE,cACc9sB,IAAnBsiC,EAAOS,QACPX,EAAQtV,cACM9sB,IAAdsiC,EAAOlY,GACPwU,EAAM9R,SACNP,EAAUO,UAAW+V,EAAMzgC,GAAIkgC,IAI7C,OAAO1hC,IACX,EAOA2rB,EAAUjuB,UAAUiiB,IAAM,SAAazI,GACnC,OAAOlX,KAAK0hC,QAAU1hC,KAAK0hC,OAAOxqB,IAC3B,IACX,EASAyU,EAAUjuB,UAAU0kC,QAAU,SAAiBlrB,GAC3C,GAAIlX,KAAK0hC,QAAU1hC,KAAK0hC,OAAOxqB,aAAiB4Q,EAC5C,OAAO9nB,KAAK0hC,OAAOxqB,GAAM0U,OAC7B,MAAMnsB,MAAM,iBAAmByX,EACnC,EASAyU,EAAUjuB,UAAUsK,IAAM,SAAasgB,GAEnC,KAAMA,aAAkB0V,QAA2B5+B,IAAlBkpB,EAAOqP,QAAwBrP,aAAkBT,GAAQS,aAAkBR,GAAQQ,aAAkBkZ,GAAWlZ,aAAkBqD,GAC/J,MAAM5sB,UAAU,wCAEpB,GAAKiB,KAAK0hC,OAEL,CACD,IAAIlpB,EAAOxY,KAAK2f,IAAI2I,EAAOpR,MAC3B,GAAIsB,EAAM,CACN,KAAIA,aAAgBmT,GAAarD,aAAkBqD,IAAenT,aAAgBqP,GAAQrP,aAAgBgpB,EAWtG,MAAM/hC,MAAM,mBAAqB6oB,EAAOpR,KAAO,QAAUlX,MARzD,IADA,IAAI0hC,EAASlpB,EAAKupB,YACTvgC,EAAI,EAAGA,EAAIkgC,EAAOhjC,SAAU8C,EACjC8mB,EAAOtgB,IAAI05B,EAAOlgC,IACtBxB,KAAK6pB,OAAOrR,GACPxY,KAAK0hC,SACN1hC,KAAK0hC,OAAS,CAAC,GACnBpZ,EAAOiY,WAAW/nB,EAAKqT,SAAS,EAIxC,CACJ,MAjBI7rB,KAAK0hC,OAAS,CAAC,EAoBnB,OAFA1hC,KAAK0hC,OAAOpZ,EAAOpR,MAAQoR,EAC3BA,EAAO6X,MAAMngC,MACN4hC,EAAW5hC,KACtB,EASA2rB,EAAUjuB,UAAUmsB,OAAS,SAAgBvB,GAEzC,KAAMA,aAAkBmD,GACpB,MAAM1sB,UAAU,qCACpB,GAAIupB,EAAO8W,SAAWp/B,KAClB,MAAMP,MAAM6oB,EAAS,uBAAyBtoB,MAOlD,cALOA,KAAK0hC,OAAOpZ,EAAOpR,MACrB7Z,OAAOkrB,KAAKvoB,KAAK0hC,QAAQhjC,SAC1BsB,KAAK0hC,YAAStiC,GAElBkpB,EAAO+X,SAASrgC,MACT4hC,EAAW5hC,KACtB,EAQA2rB,EAAUjuB,UAAUR,OAAS,SAAgBirB,EAAMgE,GAE/C,GAAIpE,EAAKwE,SAASpE,GACdA,EAAOA,EAAKjQ,MAAM,UACjB,IAAKxW,MAAMC,QAAQwmB,GACpB,MAAMppB,UAAU,gBACpB,GAAIopB,GAAQA,EAAKzpB,QAAsB,KAAZypB,EAAK,GAC5B,MAAM1oB,MAAM,yBAGhB,IADA,IAAIwgC,EAAMjgC,KACHmoB,EAAKzpB,OAAS,GAAG,CACpB,IAAI2jC,EAAOla,EAAK/V,QAChB,GAAI6tB,EAAIyB,QAAUzB,EAAIyB,OAAOW,IAEzB,MADApC,EAAMA,EAAIyB,OAAOW,cACI1W,GACjB,MAAMlsB,MAAM,kDAEhBwgC,EAAIj4B,IAAIi4B,EAAM,IAAItU,EAAU0W,GACpC,CAGA,OAFIlW,GACA8T,EAAI6B,QAAQ3V,GACT8T,CACX,EAMAtU,EAAUjuB,UAAU4kC,WAAa,WAE7B,IADA,IAAIZ,EAAS1hC,KAAK+hC,YAAavgC,EAAI,EAC5BA,EAAIkgC,EAAOhjC,QACVgjC,EAAOlgC,aAAcmqB,EACrB+V,EAAOlgC,KAAK8gC,aAEZZ,EAAOlgC,KAAKyxB,UACpB,OAAOjzB,KAAKizB,SAChB,EASAtH,EAAUjuB,UAAU6kC,OAAS,SAAgBpa,EAAMqa,EAAaC,GAS5D,GAN2B,kBAAhBD,GACPC,EAAuBD,EACvBA,OAAcpjC,GACPojC,IAAgB9gC,MAAMC,QAAQ6gC,KACrCA,EAAc,CAAEA,IAEhBza,EAAKwE,SAASpE,IAASA,EAAKzpB,OAAQ,CACpC,GAAa,MAATypB,EACA,OAAOnoB,KAAKlD,KAChBqrB,EAAOA,EAAKjQ,MAAM,IACtB,MAAO,IAAKiQ,EAAKzpB,OACb,OAAOsB,KAGX,GAAgB,KAAZmoB,EAAK,GACL,OAAOnoB,KAAKlD,KAAKylC,OAAOpa,EAAKjO,MAAM,GAAIsoB,GAG3C,IAAIrlB,EAAQnd,KAAK2f,IAAIwI,EAAK,IAC1B,GAAIhL,GACA,GAAoB,IAAhBgL,EAAKzpB,QACL,IAAK8jC,GAAeA,EAAY/lB,QAAQU,EAAMxf,cAAgB,EAC1D,OAAOwf,OACR,GAAIA,aAAiBwO,IAAcxO,EAAQA,EAAMolB,OAAOpa,EAAKjO,MAAM,GAAIsoB,GAAa,IACvF,OAAOrlB,OAIX,IAAK,IAAI3b,EAAI,EAAGA,EAAIxB,KAAK+hC,YAAYrjC,SAAU8C,EAC3C,GAAIxB,KAAK2hC,aAAangC,aAAcmqB,IAAcxO,EAAQnd,KAAK2hC,aAAangC,GAAG+gC,OAAOpa,EAAMqa,GAAa,IACrG,OAAOrlB,EAGnB,OAAoB,OAAhBnd,KAAKo/B,QAAmBqD,EACjB,KACJziC,KAAKo/B,OAAOmD,OAAOpa,EAAMqa,EACpC,EAoBA7W,EAAUjuB,UAAUglC,WAAa,SAAoBva,GACjD,IAAIhL,EAAQnd,KAAKuiC,OAAOpa,EAAM,CAAEN,IAChC,IAAK1K,EACD,MAAM1d,MAAM,iBAAmB0oB,GACnC,OAAOhL,CACX,EASAwO,EAAUjuB,UAAUilC,WAAa,SAAoBxa,GACjD,IAAIhL,EAAQnd,KAAKuiC,OAAOpa,EAAM,CAAEL,IAChC,IAAK3K,EACD,MAAM1d,MAAM,iBAAmB0oB,EAAO,QAAUnoB,MACpD,OAAOmd,CACX,EASAwO,EAAUjuB,UAAU2hC,iBAAmB,SAA0BlX,GAC7D,IAAIhL,EAAQnd,KAAKuiC,OAAOpa,EAAM,CAAEN,EAAMC,IACtC,IAAK3K,EACD,MAAM1d,MAAM,yBAA2B0oB,EAAO,QAAUnoB,MAC5D,OAAOmd,CACX,EASAwO,EAAUjuB,UAAUklC,cAAgB,SAAuBza,GACvD,IAAIhL,EAAQnd,KAAKuiC,OAAOpa,EAAM,CAAEqZ,IAChC,IAAKrkB,EACD,MAAM1d,MAAM,oBAAsB0oB,EAAO,QAAUnoB,MACvD,OAAOmd,CACX,EAGAwO,EAAUkE,WAAa,SAASgQ,EAAOgD,EAAUC,GAC7Cjb,EAAUgY,EACV2B,EAAUqB,EACV/a,EAAUgb,CACd,0BC9aA,IAAIC,EAAW/lC,EAEf+lC,EAASC,QAAU,UACnBD,EAAS9Y,MAAQ,EAAQ,GACzB8Y,EAASE,KAAO,EAAQ,IACxBF,EAASG,MAAQ,EAAQ,IACzBH,EAASI,OAAS,EAAQ,IAG1BJ,EAASK,GAAK,EAAQ,KACtBL,EAASM,MAAQ,EAAQ,uBCRzB,IAAIC,EAAQ,CAAC,EAEb,SAASC,EAAgBtd,EAAMQ,EAASH,GACjCA,IACHA,EAAO7mB,OAWT,IAAI+jC,EAEJ,SAAUC,GAnBZ,IAAwBC,EAAUC,EAsB9B,SAASH,EAAUI,EAAMC,EAAMC,GAC7B,OAAOL,EAAMnsB,KAAKtX,KAdtB,SAAoB4jC,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZrd,EACFA,EAEAA,EAAQmd,EAAMC,EAAMC,EAE/B,CAQ4Bzd,CAAWud,EAAMC,EAAMC,KAAU9jC,IAC3D,CAEA,OA1B8B2jC,EAoBJF,GApBNC,EAoBLF,GApBsC9lC,UAAYL,OAAOC,OAAOqmC,EAAWjmC,WAAYgmC,EAAShmC,UAAUC,YAAc+lC,EAAUA,EAASK,UAAYJ,EA0B/JH,CACT,CARA,CAQEld,GAEFkd,EAAU9lC,UAAUwZ,KAAOoP,EAAKpP,KAChCssB,EAAU9lC,UAAUuoB,KAAOA,EAC3Bqd,EAAMrd,GAAQud,CAChB,CAGA,SAASQ,EAAMC,EAAUC,GACvB,GAAIxiC,MAAMC,QAAQsiC,GAAW,CAC3B,IAAI5iC,EAAM4iC,EAASvlC,OAKnB,OAJAulC,EAAWA,EAAS1F,KAAI,SAAU/8B,GAChC,OAAOub,OAAOvb,EAChB,IAEIH,EAAM,EACD,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS/pB,MAAM,EAAG7Y,EAAM,GAAG63B,KAAK,MAAO,SAAW+K,EAAS5iC,EAAM,GAC3F,IAARA,EACF,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAAI,QAAQlkB,OAAOkkB,EAAS,IAEzE,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAEpD,CACE,MAAO,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOhD,OAAOknB,GAElD,CA6BAV,EAAgB,yBAAyB,SAAUrsB,EAAMtZ,GACvD,MAAO,cAAgBA,EAAQ,4BAA8BsZ,EAAO,GACtE,GAAGnY,WACHwkC,EAAgB,wBAAwB,SAAUrsB,EAAM+sB,EAAUjqB,GAEhE,IAAImqB,EA/BmBC,EAwCnB5kC,EA1BYyB,EAAaC,EA4B7B,GATwB,iBAAb+iC,IAjCYG,EAiCkC,OAAVH,EAhCpCtmB,OAAyB,EAAUymB,KAAmBA,IAiC/DD,EAAa,cACbF,EAAWA,EAAS9hC,QAAQ,QAAS,KAErCgiC,EAAa,UAhCjB,SAAkBljC,EAAKmjC,EAAQC,GAK7B,YAJiBjlC,IAAbilC,GAA0BA,EAAWpjC,EAAIvC,UAC3C2lC,EAAWpjC,EAAIvC,QAGVuC,EAAIioB,UAAUmb,EAAWD,EAAeC,KAAcD,CAC/D,CA+BME,CAASptB,EAAM,aAEjB1X,EAAM,OAAOugB,OAAO7I,EAAM,KAAK6I,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,aACzE,CACL,IAAI/oB,GA/Be,iBAAVha,IACTA,EAAQ,GAGNA,EAAQkjC,GALInjC,EAgCMiW,GA3BUxY,SAGS,IAAhCuC,EAAIwb,QAwBe,IAxBCvb,GAwBmB,WAAb,YACjC1B,EAAM,QAASugB,OAAO7I,EAAM,MAAO6I,OAAO7E,EAAM,KAAK6E,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,QACtG,CAGA,OADAzkC,EAAO,mBAAmBugB,cAAc/F,EAE1C,GAAGjb,WACHwkC,EAAgB,4BAA6B,2BAC7CA,EAAgB,8BAA8B,SAAUrsB,GACtD,MAAO,OAASA,EAAO,4BACzB,IACAqsB,EAAgB,6BAA8B,mBAC9CA,EAAgB,wBAAwB,SAAUrsB,GAChD,MAAO,eAAiBA,EAAO,+BACjC,IACAqsB,EAAgB,wBAAyB,kCACzCA,EAAgB,yBAA0B,6BAC1CA,EAAgB,6BAA8B,mBAC9CA,EAAgB,yBAA0B,sCAAuCxkC,WACjFwkC,EAAgB,wBAAwB,SAAU/kC,GAChD,MAAO,qBAAuBA,CAChC,GAAGO,WACHwkC,EAAgB,qCAAsC,oCACtDtmC,EAAOD,QAAQ,EAAQsmC,oBC1HvB,IAAIA,EAAQ,CAAC,EAEb,SAASC,EAAgBtd,EAAMQ,EAASH,GACjCA,IACHA,EAAO7mB,OAWT,IAAI+jC,EAEJ,SAAUC,GAnBZ,IAAwBC,EAAUC,EAsB9B,SAASH,EAAUI,EAAMC,EAAMC,GAC7B,OAAOL,EAAMnsB,KAAKtX,KAdtB,SAAoB4jC,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZrd,EACFA,EAEAA,EAAQmd,EAAMC,EAAMC,EAE/B,CAQ4Bzd,CAAWud,EAAMC,EAAMC,KAAU9jC,IAC3D,CAEA,OA1B8B2jC,EAoBJF,GApBNC,EAoBLF,GApBsC9lC,UAAYL,OAAOC,OAAOqmC,EAAWjmC,WAAYgmC,EAAShmC,UAAUC,YAAc+lC,EAAUA,EAASK,UAAYJ,EA0B/JH,CACT,CARA,CAQEld,GAEFkd,EAAU9lC,UAAUwZ,KAAOoP,EAAKpP,KAChCssB,EAAU9lC,UAAUuoB,KAAOA,EAC3Bqd,EAAMrd,GAAQud,CAChB,CAGA,SAASQ,EAAMC,EAAUC,GACvB,GAAIxiC,MAAMC,QAAQsiC,GAAW,CAC3B,IAAI5iC,EAAM4iC,EAASvlC,OAKnB,OAJAulC,EAAWA,EAAS1F,KAAI,SAAU/8B,GAChC,OAAOub,OAAOvb,EAChB,IAEIH,EAAM,EACD,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS/pB,MAAM,EAAG7Y,EAAM,GAAG63B,KAAK,MAAO,SAAW+K,EAAS5iC,EAAM,GAC3F,IAARA,EACF,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAAI,QAAQlkB,OAAOkkB,EAAS,IAEzE,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAEpD,CACE,MAAO,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOhD,OAAOknB,GAElD,CA6BAV,EAAgB,yBAAyB,SAAUrsB,EAAMtZ,GACvD,MAAO,cAAgBA,EAAQ,4BAA8BsZ,EAAO,GACtE,GAAGnY,WACHwkC,EAAgB,wBAAwB,SAAUrsB,EAAM+sB,EAAUjqB,GAEhE,IAAImqB,EA/BmBC,EAwCnB5kC,EA1BYyB,EAAaC,EA4B7B,GATwB,iBAAb+iC,IAjCYG,EAiCkC,OAAVH,EAhCpCtmB,OAAyB,EAAUymB,KAAmBA,IAiC/DD,EAAa,cACbF,EAAWA,EAAS9hC,QAAQ,QAAS,KAErCgiC,EAAa,UAhCjB,SAAkBljC,EAAKmjC,EAAQC,GAK7B,YAJiBjlC,IAAbilC,GAA0BA,EAAWpjC,EAAIvC,UAC3C2lC,EAAWpjC,EAAIvC,QAGVuC,EAAIioB,UAAUmb,EAAWD,EAAeC,KAAcD,CAC/D,CA+BME,CAASptB,EAAM,aAEjB1X,EAAM,OAAOugB,OAAO7I,EAAM,KAAK6I,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,aACzE,CACL,IAAI/oB,GA/Be,iBAAVha,IACTA,EAAQ,GAGNA,EAAQkjC,GALInjC,EAgCMiW,GA3BUxY,SAGS,IAAhCuC,EAAIwb,QAwBe,IAxBCvb,GAwBmB,WAAb,YACjC1B,EAAM,QAASugB,OAAO7I,EAAM,MAAO6I,OAAO7E,EAAM,KAAK6E,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,QACtG,CAGA,OADAzkC,EAAO,mBAAmBugB,cAAc/F,EAE1C,GAAGjb,WACHwkC,EAAgB,4BAA6B,2BAC7CA,EAAgB,8BAA8B,SAAUrsB,GACtD,MAAO,OAASA,EAAO,4BACzB,IACAqsB,EAAgB,6BAA8B,mBAC9CA,EAAgB,wBAAwB,SAAUrsB,GAChD,MAAO,eAAiBA,EAAO,+BACjC,IACAqsB,EAAgB,wBAAyB,kCACzCA,EAAgB,yBAA0B,6BAC1CA,EAAgB,6BAA8B,mBAC9CA,EAAgB,yBAA0B,sCAAuCxkC,WACjFwkC,EAAgB,wBAAwB,SAAU/kC,GAChD,MAAO,qBAAuBA,CAChC,GAAGO,WACHwkC,EAAgB,qCAAsC,oCACtDtmC,EAAOD,QAAQ,EAAQsmC,OC9HvBrmC,EAAOD,QAAU,SAAcgH,EAAGC,GAIhC,IAHA,IAAIvF,EAAS4C,KAAKC,IAAIyC,EAAEtF,OAAQuF,EAAEvF,QAC9BT,EAAS,IAAIC,OAAOQ,GAEf8C,EAAI,EAAGA,EAAI9C,IAAU8C,EAC5BvD,EAAOuD,GAAKwC,EAAExC,GAAKyC,EAAEzC,GAGvB,OAAOvD,CACT,oBCLA,IAAIqlC,EAAQ,CAAC,EAEb,SAASC,EAAgBtd,EAAMQ,EAASH,GACjCA,IACHA,EAAO7mB,OAWT,IAAI+jC,EAEJ,SAAUC,GAnBZ,IAAwBC,EAAUC,EAsB9B,SAASH,EAAUI,EAAMC,EAAMC,GAC7B,OAAOL,EAAMnsB,KAAKtX,KAdtB,SAAoB4jC,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZrd,EACFA,EAEAA,EAAQmd,EAAMC,EAAMC,EAE/B,CAQ4Bzd,CAAWud,EAAMC,EAAMC,KAAU9jC,IAC3D,CAEA,OA1B8B2jC,EAoBJF,GApBNC,EAoBLF,GApBsC9lC,UAAYL,OAAOC,OAAOqmC,EAAWjmC,WAAYgmC,EAAShmC,UAAUC,YAAc+lC,EAAUA,EAASK,UAAYJ,EA0B/JH,CACT,CARA,CAQEld,GAEFkd,EAAU9lC,UAAUwZ,KAAOoP,EAAKpP,KAChCssB,EAAU9lC,UAAUuoB,KAAOA,EAC3Bqd,EAAMrd,GAAQud,CAChB,CAGA,SAASQ,EAAMC,EAAUC,GACvB,GAAIxiC,MAAMC,QAAQsiC,GAAW,CAC3B,IAAI5iC,EAAM4iC,EAASvlC,OAKnB,OAJAulC,EAAWA,EAAS1F,KAAI,SAAU/8B,GAChC,OAAOub,OAAOvb,EAChB,IAEIH,EAAM,EACD,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS/pB,MAAM,EAAG7Y,EAAM,GAAG63B,KAAK,MAAO,SAAW+K,EAAS5iC,EAAM,GAC3F,IAARA,EACF,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAAI,QAAQlkB,OAAOkkB,EAAS,IAEzE,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAEpD,CACE,MAAO,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOhD,OAAOknB,GAElD,CA6BAV,EAAgB,yBAAyB,SAAUrsB,EAAMtZ,GACvD,MAAO,cAAgBA,EAAQ,4BAA8BsZ,EAAO,GACtE,GAAGnY,WACHwkC,EAAgB,wBAAwB,SAAUrsB,EAAM+sB,EAAUjqB,GAEhE,IAAImqB,EA/BmBC,EAwCnB5kC,EA1BYyB,EAAaC,EA4B7B,GATwB,iBAAb+iC,IAjCYG,EAiCkC,OAAVH,EAhCpCtmB,OAAyB,EAAUymB,KAAmBA,IAiC/DD,EAAa,cACbF,EAAWA,EAAS9hC,QAAQ,QAAS,KAErCgiC,EAAa,UAhCjB,SAAkBljC,EAAKmjC,EAAQC,GAK7B,YAJiBjlC,IAAbilC,GAA0BA,EAAWpjC,EAAIvC,UAC3C2lC,EAAWpjC,EAAIvC,QAGVuC,EAAIioB,UAAUmb,EAAWD,EAAeC,KAAcD,CAC/D,CA+BME,CAASptB,EAAM,aAEjB1X,EAAM,OAAOugB,OAAO7I,EAAM,KAAK6I,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,aACzE,CACL,IAAI/oB,GA/Be,iBAAVha,IACTA,EAAQ,GAGNA,EAAQkjC,GALInjC,EAgCMiW,GA3BUxY,SAGS,IAAhCuC,EAAIwb,QAwBe,IAxBCvb,GAwBmB,WAAb,YACjC1B,EAAM,QAASugB,OAAO7I,EAAM,MAAO6I,OAAO7E,EAAM,KAAK6E,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,QACtG,CAGA,OADAzkC,EAAO,mBAAmBugB,cAAc/F,EAE1C,GAAGjb,WACHwkC,EAAgB,4BAA6B,2BAC7CA,EAAgB,8BAA8B,SAAUrsB,GACtD,MAAO,OAASA,EAAO,4BACzB,IACAqsB,EAAgB,6BAA8B,mBAC9CA,EAAgB,wBAAwB,SAAUrsB,GAChD,MAAO,eAAiBA,EAAO,+BACjC,IACAqsB,EAAgB,wBAAyB,kCACzCA,EAAgB,yBAA0B,6BAC1CA,EAAgB,6BAA8B,mBAC9CA,EAAgB,yBAA0B,sCAAuCxkC,WACjFwkC,EAAgB,wBAAwB,SAAU/kC,GAChD,MAAO,qBAAuBA,CAChC,GAAGO,WACHwkC,EAAgB,qCAAsC,oCACtDtmC,EAAOD,QAAQ,EAAQsmC,oBC1HvB,IAAIA,EAAQ,CAAC,EAEb,SAASC,EAAgBtd,EAAMQ,EAASH,GACjCA,IACHA,EAAO7mB,OAWT,IAAI+jC,EAEJ,SAAUC,GAnBZ,IAAwBC,EAAUC,EAsB9B,SAASH,EAAUI,EAAMC,EAAMC,GAC7B,OAAOL,EAAMnsB,KAAKtX,KAdtB,SAAoB4jC,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZrd,EACFA,EAEAA,EAAQmd,EAAMC,EAAMC,EAE/B,CAQ4Bzd,CAAWud,EAAMC,EAAMC,KAAU9jC,IAC3D,CAEA,OA1B8B2jC,EAoBJF,GApBNC,EAoBLF,GApBsC9lC,UAAYL,OAAOC,OAAOqmC,EAAWjmC,WAAYgmC,EAAShmC,UAAUC,YAAc+lC,EAAUA,EAASK,UAAYJ,EA0B/JH,CACT,CARA,CAQEld,GAEFkd,EAAU9lC,UAAUwZ,KAAOoP,EAAKpP,KAChCssB,EAAU9lC,UAAUuoB,KAAOA,EAC3Bqd,EAAMrd,GAAQud,CAChB,CAGA,SAASQ,EAAMC,EAAUC,GACvB,GAAIxiC,MAAMC,QAAQsiC,GAAW,CAC3B,IAAI5iC,EAAM4iC,EAASvlC,OAKnB,OAJAulC,EAAWA,EAAS1F,KAAI,SAAU/8B,GAChC,OAAOub,OAAOvb,EAChB,IAEIH,EAAM,EACD,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS/pB,MAAM,EAAG7Y,EAAM,GAAG63B,KAAK,MAAO,SAAW+K,EAAS5iC,EAAM,GAC3F,IAARA,EACF,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAAI,QAAQlkB,OAAOkkB,EAAS,IAEzE,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAEpD,CACE,MAAO,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOhD,OAAOknB,GAElD,CA6BAV,EAAgB,yBAAyB,SAAUrsB,EAAMtZ,GACvD,MAAO,cAAgBA,EAAQ,4BAA8BsZ,EAAO,GACtE,GAAGnY,WACHwkC,EAAgB,wBAAwB,SAAUrsB,EAAM+sB,EAAUjqB,GAEhE,IAAImqB,EA/BmBC,EAwCnB5kC,EA1BYyB,EAAaC,EA4B7B,GATwB,iBAAb+iC,IAjCYG,EAiCkC,OAAVH,EAhCpCtmB,OAAyB,EAAUymB,KAAmBA,IAiC/DD,EAAa,cACbF,EAAWA,EAAS9hC,QAAQ,QAAS,KAErCgiC,EAAa,UAhCjB,SAAkBljC,EAAKmjC,EAAQC,GAK7B,YAJiBjlC,IAAbilC,GAA0BA,EAAWpjC,EAAIvC,UAC3C2lC,EAAWpjC,EAAIvC,QAGVuC,EAAIioB,UAAUmb,EAAWD,EAAeC,KAAcD,CAC/D,CA+BME,CAASptB,EAAM,aAEjB1X,EAAM,OAAOugB,OAAO7I,EAAM,KAAK6I,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,aACzE,CACL,IAAI/oB,GA/Be,iBAAVha,IACTA,EAAQ,GAGNA,EAAQkjC,GALInjC,EAgCMiW,GA3BUxY,SAGS,IAAhCuC,EAAIwb,QAwBe,IAxBCvb,GAwBmB,WAAb,YACjC1B,EAAM,QAASugB,OAAO7I,EAAM,MAAO6I,OAAO7E,EAAM,KAAK6E,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,QACtG,CAGA,OADAzkC,EAAO,mBAAmBugB,cAAc/F,EAE1C,GAAGjb,WACHwkC,EAAgB,4BAA6B,2BAC7CA,EAAgB,8BAA8B,SAAUrsB,GACtD,MAAO,OAASA,EAAO,4BACzB,IACAqsB,EAAgB,6BAA8B,mBAC9CA,EAAgB,wBAAwB,SAAUrsB,GAChD,MAAO,eAAiBA,EAAO,+BACjC,IACAqsB,EAAgB,wBAAyB,kCACzCA,EAAgB,yBAA0B,6BAC1CA,EAAgB,6BAA8B,mBAC9CA,EAAgB,yBAA0B,sCAAuCxkC,WACjFwkC,EAAgB,wBAAwB,SAAU/kC,GAChD,MAAO,qBAAuBA,CAChC,GAAGO,WACHwkC,EAAgB,qCAAsC,oCACtDtmC,EAAOD,QAAQ,EAAQsmC,aCzGvB,IAAIiB,EAA4BlnC,OAAOknC,2BACrC,SAAmCzpB,GAGjC,IAFA,IAAIyN,EAAOlrB,OAAOkrB,KAAKzN,GACnB0pB,EAAc,CAAC,EACVhjC,EAAI,EAAGA,EAAI+mB,EAAK7pB,OAAQ8C,IAC/BgjC,EAAYjc,EAAK/mB,IAAMnE,OAAOonC,yBAAyB3pB,EAAKyN,EAAK/mB,IAEnE,OAAOgjC,CACT,EAEEE,EAAe,WACnB1nC,EAAQ2nC,OAAS,SAASC,GACxB,IAAKrY,EAASqY,GAAI,CAEhB,IADA,IAAIC,EAAU,GACLrjC,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IACpCqjC,EAAQ7mB,KAAKva,EAAQgY,UAAUja,KAEjC,OAAOqjC,EAAQ3L,KAAK,IACtB,CAEI13B,EAAI,EAmBR,IAnBA,IACI8wB,EAAO7W,UACPpa,EAAMixB,EAAK5zB,OACXuC,EAAM8b,OAAO6nB,GAAGziC,QAAQuiC,GAAc,SAASl3B,GACjD,GAAU,OAANA,EAAY,MAAO,IACvB,GAAIhM,GAAKH,EAAK,OAAOmM,EACrB,OAAQA,GACN,IAAK,KAAM,OAAOuP,OAAOuV,EAAK9wB,MAC9B,IAAK,KAAM,OAAO8b,OAAOgV,EAAK9wB,MAC9B,IAAK,KACH,IACE,OAAOsjC,KAAKzM,UAAU/F,EAAK9wB,KAC7B,CAAE,MAAO0O,GACP,MAAO,YACT,CACF,QACE,OAAO1C,EAEb,IACSA,EAAI8kB,EAAK9wB,GAAIA,EAAIH,EAAKmM,EAAI8kB,IAAO9wB,GACpCujC,EAAOv3B,KAAOugB,EAASvgB,GACzBvM,GAAO,IAAMuM,EAEbvM,GAAO,IAAMwC,EAAQ+J,GAGzB,OAAOvM,CACT,EAMAjE,EAAQgoC,UAAY,SAASrd,EAAInoB,GAC/B,GAAuB,oBAAZouB,UAAqD,IAA1BA,QAAQqX,cAC5C,OAAOtd,EAIT,GAAuB,oBAAZiG,QACT,OAAO,WACL,OAAO5wB,EAAQgoC,UAAUrd,EAAInoB,GAAKyf,MAAMjf,KAAMyb,UAChD,EAGF,IAAImZ,GAAS,EAeb,OAdA,WACE,IAAKA,EAAQ,CACX,GAAIhH,QAAQsX,iBACV,MAAM,IAAIzlC,MAAMD,GACPouB,QAAQuX,iBACjB3lB,QAAQ4lB,MAAM5lC,GAEdggB,QAAQC,MAAMjgB,GAEhBo1B,GAAS,CACX,CACA,OAAOjN,EAAG1I,MAAMjf,KAAMyb,UACxB,CAGF,EAGA,IAAI4pB,EAAS,CAAC,EACVC,EAAgB,KAEpB,GAAI1X,QAAQ2X,IAAIC,WAAY,CAC1B,IAAIC,EAAW7X,QAAQ2X,IAAIC,WAC3BC,EAAWA,EAAStjC,QAAQ,qBAAsB,QAC/CA,QAAQ,MAAO,MACfA,QAAQ,KAAM,OACd8mB,cACHqc,EAAgB,IAAII,OAAO,IAAMD,EAAW,IAAK,IACnD,CA0BA,SAAShiC,EAAQqX,EAAK6qB,GAEpB,IAAItwB,EAAM,CACRuwB,KAAM,GACNC,QAASC,GAkBX,OAfIrqB,UAAU/c,QAAU,IAAG2W,EAAI0wB,MAAQtqB,UAAU,IAC7CA,UAAU/c,QAAU,IAAG2W,EAAI2wB,OAASvqB,UAAU,IAC9CwqB,EAAUN,GAEZtwB,EAAI6wB,WAAaP,EACRA,GAET3oC,EAAQmpC,QAAQ9wB,EAAKswB,GAGnBS,EAAY/wB,EAAI6wB,cAAa7wB,EAAI6wB,YAAa,GAC9CE,EAAY/wB,EAAI0wB,SAAQ1wB,EAAI0wB,MAAQ,GACpCK,EAAY/wB,EAAI2wB,UAAS3wB,EAAI2wB,QAAS,GACtCI,EAAY/wB,EAAIgxB,iBAAgBhxB,EAAIgxB,eAAgB,GACpDhxB,EAAI2wB,SAAQ3wB,EAAIwwB,QAAUS,GACvBC,EAAYlxB,EAAKyF,EAAKzF,EAAI0wB,MACnC,CAmCA,SAASO,EAAiBrlC,EAAKulC,GAC7B,IAAIC,EAAQhjC,EAAQijC,OAAOF,GAE3B,OAAIC,EACK,KAAYhjC,EAAQuiC,OAAOS,GAAO,GAAK,IAAMxlC,EAC7C,KAAYwC,EAAQuiC,OAAOS,GAAO,GAAK,IAEvCxlC,CAEX,CAGA,SAAS6kC,EAAe7kC,EAAKulC,GAC3B,OAAOvlC,CACT,CAcA,SAASslC,EAAYlxB,EAAKzX,EAAO+oC,GAG/B,GAAItxB,EAAIgxB,eACJzoC,GACAgpC,EAAWhpC,EAAM6F,UAEjB7F,EAAM6F,UAAYzG,EAAQyG,WAExB7F,EAAMD,aAAeC,EAAMD,YAAYD,YAAcE,GAAQ,CACjE,IAAImH,EAAMnH,EAAM6F,QAAQkjC,EAActxB,GAItC,OAHKkX,EAASxnB,KACZA,EAAMwhC,EAAYlxB,EAAKtQ,EAAK4hC,IAEvB5hC,CACT,CAGA,IAAI8hC,EA+FN,SAAyBxxB,EAAKzX,GAC5B,GAAIwoC,EAAYxoC,GACd,OAAOyX,EAAIwwB,QAAQ,YAAa,aAClC,GAAItZ,EAAS3uB,GAAQ,CACnB,IAAIkpC,EAAS,IAAOhC,KAAKzM,UAAUz6B,GAAOuE,QAAQ,SAAU,IAClBA,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAAO,IACjE,OAAOkT,EAAIwwB,QAAQiB,EAAQ,SAC7B,CACA,OAAIC,EAASnpC,GACJyX,EAAIwwB,QAAQ,GAAKjoC,EAAO,UAC7BqoC,EAAUroC,GACLyX,EAAIwwB,QAAQ,GAAKjoC,EAAO,WAE7BmnC,EAAOnnC,GACFyX,EAAIwwB,QAAQ,OAAQ,aAD7B,CAEF,CA/GkBmB,CAAgB3xB,EAAKzX,GACrC,GAAIipC,EACF,OAAOA,EAIT,IAAIte,EAAOlrB,OAAOkrB,KAAK3qB,GACnBqpC,EApCN,SAAqB1rB,GACnB,IAAI0T,EAAO,CAAC,EAMZ,OAJA1T,EAAM2rB,SAAQ,SAAS3nC,EAAK4nC,GAC1BlY,EAAK1vB,IAAO,CACd,IAEO0vB,CACT,CA4BoBmY,CAAY7e,GAQ9B,GANIlT,EAAI6wB,aACN3d,EAAOlrB,OAAOq1B,oBAAoB90B,IAKhCypC,EAAQzpC,KACJ2qB,EAAK9L,QAAQ,YAAc,GAAK8L,EAAK9L,QAAQ,gBAAkB,GACrE,OAAO6qB,EAAY1pC,GAIrB,GAAoB,IAAhB2qB,EAAK7pB,OAAc,CACrB,GAAIkoC,EAAWhpC,GAAQ,CACrB,IAAIsZ,EAAOtZ,EAAMsZ,KAAO,KAAOtZ,EAAMsZ,KAAO,GAC5C,OAAO7B,EAAIwwB,QAAQ,YAAc3uB,EAAO,IAAK,UAC/C,CACA,GAAIqwB,EAAS3pC,GACX,OAAOyX,EAAIwwB,QAAQH,OAAOhoC,UAAUwE,SAASoV,KAAK1Z,GAAQ,UAE5D,GAAI4pC,EAAO5pC,GACT,OAAOyX,EAAIwwB,QAAQ4B,KAAK/pC,UAAUwE,SAASoV,KAAK1Z,GAAQ,QAE1D,GAAIypC,EAAQzpC,GACV,OAAO0pC,EAAY1pC,EAEvB,CAEA,IA2CI0a,EA3CAzY,EAAO,GAAI0b,GAAQ,EAAOmsB,EAAS,CAAC,IAAK,KA6B7C,OA1BI/lC,EAAQ/D,KACV2d,GAAQ,EACRmsB,EAAS,CAAC,IAAK,MAIbd,EAAWhpC,KAEbiC,EAAO,cADCjC,EAAMsZ,KAAO,KAAOtZ,EAAMsZ,KAAO,IACf,KAIxBqwB,EAAS3pC,KACXiC,EAAO,IAAM6lC,OAAOhoC,UAAUwE,SAASoV,KAAK1Z,IAI1C4pC,EAAO5pC,KACTiC,EAAO,IAAM4nC,KAAK/pC,UAAUiqC,YAAYrwB,KAAK1Z,IAI3CypC,EAAQzpC,KACViC,EAAO,IAAMynC,EAAY1pC,IAGP,IAAhB2qB,EAAK7pB,QAAkB6c,GAAyB,GAAhB3d,EAAMc,OAItCioC,EAAe,EACbY,EAAS3pC,GACJyX,EAAIwwB,QAAQH,OAAOhoC,UAAUwE,SAASoV,KAAK1Z,GAAQ,UAEnDyX,EAAIwwB,QAAQ,WAAY,YAInCxwB,EAAIuwB,KAAK5nB,KAAKpgB,GAIZ0a,EADEiD,EAsCN,SAAqBlG,EAAKzX,EAAO+oC,EAAcM,EAAa1e,GAE1D,IADA,IAAIjQ,EAAS,GACJ9W,EAAI,EAAGuM,EAAInQ,EAAMc,OAAQ8C,EAAIuM,IAAKvM,EACrC0sB,EAAetwB,EAAOmf,OAAOvb,IAC/B8W,EAAO0F,KAAK4pB,EAAevyB,EAAKzX,EAAO+oC,EAAcM,EACjDlqB,OAAOvb,IAAI,IAEf8W,EAAO0F,KAAK,IAShB,OANAuK,EAAK2e,SAAQ,SAAS5oC,GACfA,EAAIupC,MAAM,UACbvvB,EAAO0F,KAAK4pB,EAAevyB,EAAKzX,EAAO+oC,EAAcM,EACjD3oC,GAAK,GAEb,IACOga,CACT,CAtDawvB,CAAYzyB,EAAKzX,EAAO+oC,EAAcM,EAAa1e,GAEnDA,EAAKgW,KAAI,SAASjgC,GACzB,OAAOspC,EAAevyB,EAAKzX,EAAO+oC,EAAcM,EAAa3oC,EAAKid,EACpE,IAGFlG,EAAIuwB,KAAKjP,MA6GX,SAA8Bre,EAAQzY,EAAM6nC,GAQ1C,OANapvB,EAAOyvB,QAAO,SAASvvB,EAAMwvB,GAGxC,OADIA,EAAIvrB,QAAQ,MACTjE,EAAOwvB,EAAI7lC,QAAQ,kBAAmB,IAAIzD,OAAS,CAC5D,GAAG,GAEU,GACJgpC,EAAO,IACG,KAAT7nC,EAAc,GAAKA,EAAO,OAC3B,IACAyY,EAAO4gB,KAAK,SACZ,IACAwO,EAAO,GAGTA,EAAO,GAAK7nC,EAAO,IAAMyY,EAAO4gB,KAAK,MAAQ,IAAMwO,EAAO,EACnE,CA7HSO,CAAqB3vB,EAAQzY,EAAM6nC,IAxBjCA,EAAO,GAAK7nC,EAAO6nC,EAAO,EAyBrC,CAsBA,SAASJ,EAAY1pC,GACnB,MAAO,IAAM6B,MAAM/B,UAAUwE,SAASoV,KAAK1Z,GAAS,GACtD,CAuBA,SAASgqC,EAAevyB,EAAKzX,EAAO+oC,EAAcM,EAAa3oC,EAAKid,GAClE,IAAIrE,EAAMjW,EAAKinC,EAsCf,IArCAA,EAAO7qC,OAAOonC,yBAAyB7mC,EAAOU,IAAQ,CAAEV,MAAOA,EAAMU,KAC5DqhB,IAEL1e,EADEinC,EAAKhoB,IACD7K,EAAIwwB,QAAQ,kBAAmB,WAE/BxwB,EAAIwwB,QAAQ,WAAY,WAG5BqC,EAAKhoB,MACPjf,EAAMoU,EAAIwwB,QAAQ,WAAY,YAG7B3X,EAAe+Y,EAAa3oC,KAC/B4Y,EAAO,IAAM5Y,EAAM,KAEhB2C,IACCoU,EAAIuwB,KAAKnpB,QAAQyrB,EAAKtqC,OAAS,GAE/BqD,EADE8jC,EAAO4B,GACHJ,EAAYlxB,EAAK6yB,EAAKtqC,MAAO,MAE7B2oC,EAAYlxB,EAAK6yB,EAAKtqC,MAAO+oC,EAAe,IAE5ClqB,QAAQ,OAAS,IAErBxb,EADEsa,EACIta,EAAIiX,MAAM,MAAMqmB,KAAI,SAAS4J,GACjC,MAAO,KAAOA,CAChB,IAAGjP,KAAK,MAAMhf,MAAM,GAEd,KAAOjZ,EAAIiX,MAAM,MAAMqmB,KAAI,SAAS4J,GACxC,MAAO,MAAQA,CACjB,IAAGjP,KAAK,OAIZj4B,EAAMoU,EAAIwwB,QAAQ,aAAc,YAGhCO,EAAYlvB,GAAO,CACrB,GAAIqE,GAASjd,EAAIupC,MAAM,SACrB,OAAO5mC,GAETiW,EAAO4tB,KAAKzM,UAAU,GAAK/5B,IAClBupC,MAAM,iCACb3wB,EAAOA,EAAKgD,MAAM,GAAI,GACtBhD,EAAO7B,EAAIwwB,QAAQ3uB,EAAM,UAEzBA,EAAOA,EAAK/U,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAChBA,QAAQ,WAAY,KAChC+U,EAAO7B,EAAIwwB,QAAQ3uB,EAAM,UAE7B,CAEA,OAAOA,EAAO,KAAOjW,CACvB,CA4BA,SAASU,EAAQymC,GACf,OAAO1mC,MAAMC,QAAQymC,EACvB,CAGA,SAASnC,EAAUznC,GACjB,MAAsB,kBAARA,CAChB,CAGA,SAASumC,EAAOvmC,GACd,OAAe,OAARA,CACT,CAQA,SAASuoC,EAASvoC,GAChB,MAAsB,iBAARA,CAChB,CAGA,SAAS+tB,EAAS/tB,GAChB,MAAsB,iBAARA,CAChB,CAQA,SAAS4nC,EAAY5nC,GACnB,YAAe,IAARA,CACT,CAGA,SAAS+oC,EAASr4B,GAChB,OAAO6e,EAAS7e,IAA8B,oBAAvBm5B,EAAen5B,EACxC,CAIA,SAAS6e,EAASvvB,GAChB,MAAsB,iBAARA,GAA4B,OAARA,CACpC,CAGA,SAASgpC,EAAO9W,GACd,OAAO3C,EAAS2C,IAA4B,kBAAtB2X,EAAe3X,EACvC,CAIA,SAAS2W,EAAQ9mC,GACf,OAAOwtB,EAASxtB,KACW,mBAAtB8nC,EAAe9nC,IAA2BA,aAAad,MAC9D,CAIA,SAASmnC,EAAWpoC,GAClB,MAAsB,mBAARA,CAChB,CAeA,SAAS6pC,EAAejgC,GACtB,OAAO/K,OAAOK,UAAUwE,SAASoV,KAAKlP,EACxC,CAGA,SAASkgC,EAAI94B,GACX,OAAOA,EAAI,GAAK,IAAMA,EAAEtN,SAAS,IAAMsN,EAAEtN,SAAS,GACpD,CAxbAlF,EAAQurC,SAAW,SAASroB,GAE1B,GADAA,EAAMA,EAAI+I,eACLoc,EAAOnlB,GACV,GAAIolB,EAAc1c,KAAK1I,GAAM,CAC3B,IAAIsoB,EAAM5a,QAAQ4a,IAClBnD,EAAOnlB,GAAO,WACZ,IAAI1gB,EAAMxC,EAAQ2nC,OAAO1lB,MAAMjiB,EAASye,WACxC+D,QAAQC,MAAM,YAAaS,EAAKsoB,EAAKhpC,EACvC,CACF,MACE6lC,EAAOnlB,GAAO,WAAY,EAG9B,OAAOmlB,EAAOnlB,EAChB,EAmCAljB,EAAQyG,QAAUA,EAIlBA,EAAQuiC,OAAS,CACf,KAAS,CAAC,EAAG,IACb,OAAW,CAAC,EAAG,IACf,UAAc,CAAC,EAAG,IAClB,QAAY,CAAC,EAAG,IAChB,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,QAAY,CAAC,GAAI,IACjB,IAAQ,CAAC,GAAI,IACb,OAAW,CAAC,GAAI,KAIlBviC,EAAQijC,OAAS,CACf,QAAW,OACX,OAAU,SACV,QAAW,SACX,UAAa,OACb,KAAQ,OACR,OAAU,QACV,KAAQ,UAER,OAAU,OA+QZ1pC,EAAQihC,MAAQ,EAAhB,KAKAjhC,EAAQ2E,QAAUA,EAKlB3E,EAAQipC,UAAYA,EAKpBjpC,EAAQ+nC,OAASA,EAKjB/nC,EAAQyrC,kBAHR,SAA2BjqC,GACzB,OAAc,MAAPA,CACT,EAMAxB,EAAQ+pC,SAAWA,EAKnB/pC,EAAQuvB,SAAWA,EAKnBvvB,EAAQ0rC,SAHR,SAAkBlqC,GAChB,MAAsB,iBAARA,CAChB,EAMAxB,EAAQopC,YAAcA,EAKtBppC,EAAQuqC,SAAWA,EACnBvqC,EAAQihC,MAAMsJ,SAAWA,EAKzBvqC,EAAQ+wB,SAAWA,EAKnB/wB,EAAQwqC,OAASA,EACjBxqC,EAAQihC,MAAMuJ,OAASA,EAMvBxqC,EAAQqqC,QAAUA,EAClBrqC,EAAQihC,MAAM0K,cAAgBtB,EAK9BrqC,EAAQ4pC,WAAaA,EAUrB5pC,EAAQ4rC,YARR,SAAqBpqC,GACnB,OAAe,OAARA,GACe,kBAARA,GACQ,iBAARA,GACQ,iBAARA,GACQ,iBAARA,QACQ,IAARA,CAChB,EAGAxB,EAAQ+d,SAAW,EAAnB,KAYA,IAAI8tB,EAAS,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACxD,MAAO,MAAO,OA6C5B,SAAS3a,EAAepT,EAAKgO,GAC3B,OAAOzrB,OAAOK,UAAUwwB,eAAe5W,KAAKwD,EAAKgO,EACnD,CAlCA9rB,EAAQ8rC,IAAM,WAVd,IACMpY,EACAqY,EASJvpB,QAAQspB,IAAI,WATRC,EAAO,CAACT,GADR5X,EAAI,IAAI+W,MACMuB,YACNV,EAAI5X,EAAEuY,cACNX,EAAI5X,EAAEwY,eAAehQ,KAAK,KAC/B,CAACxI,EAAEyY,UAAWN,EAAOnY,EAAE0Y,YAAaL,GAAM7P,KAAK,MAMlBl8B,EAAQ2nC,OAAO1lB,MAAMjiB,EAASye,WACpE,EAgBAze,EAAQ0C,SAAW,EAAnB,GAEA1C,EAAQmpC,QAAU,SAASkD,EAAQrhC,GAEjC,IAAKA,IAAQ+lB,EAAS/lB,GAAM,OAAOqhC,EAInC,IAFA,IAAI9gB,EAAOlrB,OAAOkrB,KAAKvgB,GACnBxG,EAAI+mB,EAAK7pB,OACN8C,KACL6nC,EAAO9gB,EAAK/mB,IAAMwG,EAAIugB,EAAK/mB,IAE7B,OAAO6nC,CACT,EAMA,IAAIC,EAA6C,oBAAX9vB,OAAyBA,OAAO,8BAA2Bpa,EA0DjG,SAASmqC,EAAsBC,EAAQzN,GAKrC,IAAKyN,EAAQ,CACX,IAAIC,EAAY,IAAIhqC,MAAM,2CAC1BgqC,EAAUD,OAASA,EACnBA,EAASC,CACX,CACA,OAAO1N,EAAGyN,EACZ,CAnEAxsC,EAAQ0sC,UAAY,SAAmBC,GACrC,GAAwB,mBAAbA,EACT,MAAM,IAAI5qC,UAAU,oDAEtB,GAAIuqC,GAA4BK,EAASL,GAA2B,CAClE,IAAI3hB,EACJ,GAAkB,mBADdA,EAAKgiB,EAASL,IAEhB,MAAM,IAAIvqC,UAAU,iEAKtB,OAHA1B,OAAOqiB,eAAeiI,EAAI2hB,EAA0B,CAClD1rC,MAAO+pB,EAAI9pB,YAAY,EAAOC,UAAU,EAAOC,cAAc,IAExD4pB,CACT,CAEA,SAASA,IAQP,IAPA,IAAIiiB,EAAgBC,EAChBC,EAAU,IAAI9W,SAAQ,SAAUC,EAASC,GAC3C0W,EAAiB3W,EACjB4W,EAAgB3W,CAClB,IAEIZ,EAAO,GACF9wB,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IACpC8wB,EAAKtU,KAAKvC,UAAUja,IAEtB8wB,EAAKtU,MAAK,SAAUoV,EAAKx1B,GACnBw1B,EACFyW,EAAczW,GAEdwW,EAAehsC,EAEnB,IAEA,IACE+rC,EAAS1qB,MAAMjf,KAAMsyB,EACvB,CAAE,MAAOc,GACPyW,EAAczW,EAChB,CAEA,OAAO0W,CACT,CAOA,OALAzsC,OAAOyc,eAAe6N,EAAItqB,OAAO04B,eAAe4T,IAE5CL,GAA0BjsC,OAAOqiB,eAAeiI,EAAI2hB,EAA0B,CAChF1rC,MAAO+pB,EAAI9pB,YAAY,EAAOC,UAAU,EAAOC,cAAc,IAExDV,OAAO2iC,iBACZrY,EACA4c,EAA0BoF,GAE9B,EAEA3sC,EAAQ0sC,UAAUK,OAAST,EAiD3BtsC,EAAQgtC,YAlCR,SAAqBL,GACnB,GAAwB,mBAAbA,EACT,MAAM,IAAI5qC,UAAU,oDAMtB,SAASkrC,IAEP,IADA,IAAI3X,EAAO,GACF9wB,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IACpC8wB,EAAKtU,KAAKvC,UAAUja,IAGtB,IAAI0oC,EAAU5X,EAAKqE,MACnB,GAAuB,mBAAZuT,EACT,MAAM,IAAInrC,UAAU,8CAEtB,IAAI+E,EAAO9D,KACP+7B,EAAK,WACP,OAAOmO,EAAQjrB,MAAMnb,EAAM2X,UAC7B,EAGAkuB,EAAS1qB,MAAMjf,KAAMsyB,GAClB6X,MAAK,SAASplC,GAAO6oB,QAAQqO,SAASF,EAAG1G,KAAK,KAAM,KAAMtwB,GAAM,IAC3D,SAASqlC,GAAOxc,QAAQqO,SAASsN,EAAsBlU,KAAK,KAAM+U,EAAKrO,GAAK,GACtF,CAKA,OAHA1+B,OAAOyc,eAAemwB,EAAe5sC,OAAO04B,eAAe4T,IAC3DtsC,OAAO2iC,iBAAiBiK,EACA1F,EAA0BoF,IAC3CM,CACT,0BChrBA,IAAI/rC,EAAS,YAGT6b,EAAa7b,EAAO6b,YAAc,SAAU7a,GAE9C,QADAA,EAAW,GAAKA,IACIA,EAAS2c,eAC3B,IAAK,MAAM,IAAK,OAAO,IAAK,QAAQ,IAAK,QAAQ,IAAK,SAAS,IAAK,SAAS,IAAK,OAAO,IAAK,QAAQ,IAAK,UAAU,IAAK,WAAW,IAAK,MACxI,OAAO,EACT,QACE,OAAO,EAEb,EA0CA,SAAS+gB,EAAc19B,GAErB,IAAImrC,EACJ,OAFArqC,KAAKd,SAXP,SAA2B+wB,GACzB,IAAIqa,EA/BN,SAA4Bra,GAC1B,IAAKA,EAAK,MAAO,OAEjB,IADA,IAAIsa,IAEF,OAAQta,GACN,IAAK,OACL,IAAK,QACH,MAAO,OACT,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,MAAO,UACT,IAAK,SACL,IAAK,SACH,MAAO,SACT,IAAK,SACL,IAAK,QACL,IAAK,MACH,OAAOA,EACT,QACE,GAAIsa,EAAS,OACbta,GAAO,GAAKA,GAAKpU,cACjB0uB,GAAU,EAGlB,CAKaC,CAAmBva,GAC9B,GAAoB,iBAATqa,IAAsBpsC,EAAO6b,aAAeA,IAAeA,EAAWkW,IAAO,MAAM,IAAIxwB,MAAM,qBAAuBwwB,GAC/H,OAAOqa,GAAQra,CACjB,CAOkBwa,CAAkBvrC,GAE1Bc,KAAKd,UACX,IAAK,UACHc,KAAK0qC,KAAOC,EACZ3qC,KAAKmB,IAAMypC,EACXP,EAAK,EACL,MACF,IAAK,OACHrqC,KAAK6qC,SAAWC,EAChBT,EAAK,EACL,MACF,IAAK,SACHrqC,KAAK0qC,KAAOK,EACZ/qC,KAAKmB,IAAM6pC,EACXX,EAAK,EACL,MACF,QAGE,OAFArqC,KAAKia,MAAQgxB,OACbjrC,KAAKmB,IAAM+pC,GAGflrC,KAAKmrC,SAAW,EAChBnrC,KAAKorC,UAAY,EACjBprC,KAAKqrC,SAAWntC,EAAOW,YAAYwrC,EACrC,CAmCA,SAASiB,EAAcC,GACrB,OAAIA,GAAQ,IAAa,EAAWA,GAAQ,GAAM,EAAa,EAAWA,GAAQ,GAAM,GAAa,EAAWA,GAAQ,GAAM,GAAa,EACpIA,GAAQ,GAAM,GAAQ,GAAK,CACpC,CA0DA,SAAST,EAAa3rC,GACpB,IAAI4P,EAAI/O,KAAKorC,UAAYprC,KAAKmrC,SAC1BpqC,EAtBN,SAA6B+C,EAAM3E,EAAK4P,GACtC,GAAwB,MAAV,IAAT5P,EAAI,IAEP,OADA2E,EAAKqnC,SAAW,EACT,IAET,GAAIrnC,EAAKqnC,SAAW,GAAKhsC,EAAIT,OAAS,EAAG,CACvC,GAAwB,MAAV,IAATS,EAAI,IAEP,OADA2E,EAAKqnC,SAAW,EACT,IAET,GAAIrnC,EAAKqnC,SAAW,GAAKhsC,EAAIT,OAAS,GACZ,MAAV,IAATS,EAAI,IAEP,OADA2E,EAAKqnC,SAAW,EACT,GAGb,CACF,CAKUK,CAAoBxrC,KAAMb,GAClC,YAAUC,IAAN2B,EAAwBA,EACxBf,KAAKmrC,UAAYhsC,EAAIT,QACvBS,EAAIiE,KAAKpD,KAAKqrC,SAAUt8B,EAAG,EAAG/O,KAAKmrC,UAC5BnrC,KAAKqrC,SAASnpC,SAASlC,KAAKd,SAAU,EAAGc,KAAKorC,aAEvDjsC,EAAIiE,KAAKpD,KAAKqrC,SAAUt8B,EAAG,EAAG5P,EAAIT,aAClCsB,KAAKmrC,UAAYhsC,EAAIT,QACvB,CA0BA,SAASisC,EAAUxrC,EAAKqC,GACtB,IAAKrC,EAAIT,OAAS8C,GAAK,GAAM,EAAG,CAC9B,IAAIT,EAAI5B,EAAI+C,SAAS,UAAWV,GAChC,GAAIT,EAAG,CACL,IAAIJ,EAAII,EAAEH,WAAWG,EAAErC,OAAS,GAChC,GAAIiC,GAAK,OAAUA,GAAK,MAKtB,OAJAX,KAAKmrC,SAAW,EAChBnrC,KAAKorC,UAAY,EACjBprC,KAAKqrC,SAAS,GAAKlsC,EAAIA,EAAIT,OAAS,GACpCsB,KAAKqrC,SAAS,GAAKlsC,EAAIA,EAAIT,OAAS,GAC7BqC,EAAEmZ,MAAM,GAAI,EAEvB,CACA,OAAOnZ,CACT,CAIA,OAHAf,KAAKmrC,SAAW,EAChBnrC,KAAKorC,UAAY,EACjBprC,KAAKqrC,SAAS,GAAKlsC,EAAIA,EAAIT,OAAS,GAC7BS,EAAI+C,SAAS,UAAWV,EAAGrC,EAAIT,OAAS,EACjD,CAIA,SAASksC,EAASzrC,GAChB,IAAI4B,EAAI5B,GAAOA,EAAIT,OAASsB,KAAKia,MAAM9a,GAAO,GAC9C,GAAIa,KAAKmrC,SAAU,CACjB,IAAIhqC,EAAMnB,KAAKorC,UAAYprC,KAAKmrC,SAChC,OAAOpqC,EAAIf,KAAKqrC,SAASnpC,SAAS,UAAW,EAAGf,EAClD,CACA,OAAOJ,CACT,CAEA,SAASgqC,EAAW5rC,EAAKqC,GACvB,IAAIgO,GAAKrQ,EAAIT,OAAS8C,GAAK,EAC3B,OAAU,IAANgO,EAAgBrQ,EAAI+C,SAAS,SAAUV,IAC3CxB,KAAKmrC,SAAW,EAAI37B,EACpBxP,KAAKorC,UAAY,EACP,IAAN57B,EACFxP,KAAKqrC,SAAS,GAAKlsC,EAAIA,EAAIT,OAAS,IAEpCsB,KAAKqrC,SAAS,GAAKlsC,EAAIA,EAAIT,OAAS,GACpCsB,KAAKqrC,SAAS,GAAKlsC,EAAIA,EAAIT,OAAS,IAE/BS,EAAI+C,SAAS,SAAUV,EAAGrC,EAAIT,OAAS8Q,GAChD,CAEA,SAASw7B,EAAU7rC,GACjB,IAAI4B,EAAI5B,GAAOA,EAAIT,OAASsB,KAAKia,MAAM9a,GAAO,GAC9C,OAAIa,KAAKmrC,SAAiBpqC,EAAIf,KAAKqrC,SAASnpC,SAAS,SAAU,EAAG,EAAIlC,KAAKmrC,UACpEpqC,CACT,CAGA,SAASkqC,EAAY9rC,GACnB,OAAOA,EAAI+C,SAASlC,KAAKd,SAC3B,CAEA,SAASgsC,EAAU/rC,GACjB,OAAOA,GAAOA,EAAIT,OAASsB,KAAKia,MAAM9a,GAAO,EAC/C,CA1NAnC,EAAQ,EAAgB4/B,EA6BxBA,EAAcl/B,UAAUuc,MAAQ,SAAU9a,GACxC,GAAmB,IAAfA,EAAIT,OAAc,MAAO,GAC7B,IAAIqC,EACAS,EACJ,GAAIxB,KAAKmrC,SAAU,CAEjB,QAAU/rC,KADV2B,EAAIf,KAAK6qC,SAAS1rC,IACG,MAAO,GAC5BqC,EAAIxB,KAAKmrC,SACTnrC,KAAKmrC,SAAW,CAClB,MACE3pC,EAAI,EAEN,OAAIA,EAAIrC,EAAIT,OAAeqC,EAAIA,EAAIf,KAAK0qC,KAAKvrC,EAAKqC,GAAKxB,KAAK0qC,KAAKvrC,EAAKqC,GAC/DT,GAAK,EACd,EAEA67B,EAAcl/B,UAAUyD,IAwGxB,SAAiBhC,GACf,IAAI4B,EAAI5B,GAAOA,EAAIT,OAASsB,KAAKia,MAAM9a,GAAO,GAC9C,OAAIa,KAAKmrC,SAAiBpqC,EAAI,IACvBA,CACT,EAzGA67B,EAAcl/B,UAAUgtC,KA0FxB,SAAkBvrC,EAAKqC,GACrB,IAAIsB,EArEN,SAA6BgB,EAAM3E,EAAKqC,GACtC,IAAIgB,EAAIrD,EAAIT,OAAS,EACrB,GAAI8D,EAAIhB,EAAG,OAAO,EAClB,IAAI6oC,EAAKiB,EAAcnsC,EAAIqD,IAC3B,OAAI6nC,GAAM,GACJA,EAAK,IAAGvmC,EAAKqnC,SAAWd,EAAK,GAC1BA,KAEH7nC,EAAIhB,IAAa,IAAR6oC,EAAkB,GACjCA,EAAKiB,EAAcnsC,EAAIqD,MACb,GACJ6nC,EAAK,IAAGvmC,EAAKqnC,SAAWd,EAAK,GAC1BA,KAEH7nC,EAAIhB,IAAa,IAAR6oC,EAAkB,GACjCA,EAAKiB,EAAcnsC,EAAIqD,MACb,GACJ6nC,EAAK,IACI,IAAPA,EAAUA,EAAK,EAAOvmC,EAAKqnC,SAAWd,EAAK,GAE1CA,GAEF,CACT,CA8CcoB,CAAoBzrC,KAAMb,EAAKqC,GAC3C,IAAKxB,KAAKmrC,SAAU,OAAOhsC,EAAI+C,SAAS,OAAQV,GAChDxB,KAAKorC,UAAYtoC,EACjB,IAAI3B,EAAMhC,EAAIT,QAAUoE,EAAQ9C,KAAKmrC,UAErC,OADAhsC,EAAIiE,KAAKpD,KAAKqrC,SAAU,EAAGlqC,GACpBhC,EAAI+C,SAAS,OAAQV,EAAGL,EACjC,EA9FAy7B,EAAcl/B,UAAUmtC,SAAW,SAAU1rC,GAC3C,GAAIa,KAAKmrC,UAAYhsC,EAAIT,OAEvB,OADAS,EAAIiE,KAAKpD,KAAKqrC,SAAUrrC,KAAKorC,UAAYprC,KAAKmrC,SAAU,EAAGnrC,KAAKmrC,UACzDnrC,KAAKqrC,SAASnpC,SAASlC,KAAKd,SAAU,EAAGc,KAAKorC,WAEvDjsC,EAAIiE,KAAKpD,KAAKqrC,SAAUrrC,KAAKorC,UAAYprC,KAAKmrC,SAAU,EAAGhsC,EAAIT,QAC/DsB,KAAKmrC,UAAYhsC,EAAIT,MACvB,0BC1GA,IAAIgtC,EAAaruC,OAAOkrB,MAAQ,SAAUzN,GACxC,IAAIyN,EAAO,GACX,IAAK,IAAIjqB,KAAOwc,EAAKyN,EAAKvK,KAAK1f,GAC/B,OAAOiqB,CACT,EAGAtrB,EAAOD,QAAU2uC,EACjB,IAAIC,EAAW,EAAQ,IACnBC,EAAW,EAAQ,IACvB,EAAQ,EAAR,CAAoBF,EAAQC,GAI1B,IADA,IAAIrjB,EAAOmjB,EAAWG,EAASnuC,WACtBouC,EAAI,EAAGA,EAAIvjB,EAAK7pB,OAAQotC,IAAK,CACpC,IAAIC,EAASxjB,EAAKujB,GACbH,EAAOjuC,UAAUquC,KAASJ,EAAOjuC,UAAUquC,GAAUF,EAASnuC,UAAUquC,GAC/E,CAEF,SAASJ,EAAO9f,GACd,KAAM7rB,gBAAgB2rC,GAAS,OAAO,IAAIA,EAAO9f,GACjD+f,EAASt0B,KAAKtX,KAAM6rB,GACpBggB,EAASv0B,KAAKtX,KAAM6rB,GACpB7rB,KAAKgsC,eAAgB,EACjBngB,KACuB,IAArBA,EAAQogB,WAAoBjsC,KAAKisC,UAAW,IACvB,IAArBpgB,EAAQ/tB,WAAoBkC,KAAKlC,UAAW,IAClB,IAA1B+tB,EAAQmgB,gBACVhsC,KAAKgsC,eAAgB,EACrBhsC,KAAK8yB,KAAK,MAAOoZ,IAGvB,CA8BA,SAASA,IAEHlsC,KAAKmsC,eAAeC,OAIxBxe,QAAQqO,SAASoQ,EAASrsC,KAC5B,CACA,SAASqsC,EAAQvoC,GACfA,EAAK3C,KACP,CAvCA9D,OAAOqiB,eAAeisB,EAAOjuC,UAAW,wBAAyB,CAI/DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAEFjvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAEFlvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAeFrB,OAAOqiB,eAAeisB,EAAOjuC,UAAW,YAAa,CAInDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,gBAGvCnsC,KAAKwsC,eAAeC,WAAazsC,KAAKmsC,eAAeM,SAC9D,EACAvsB,IAAK,SAAatiB,QAGYwB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,iBAM9CnsC,KAAKwsC,eAAeC,UAAY7uC,EAChCoC,KAAKmsC,eAAeM,UAAY7uC,EAClC,4BC/FF,IAAI8tC,EAAaruC,OAAOkrB,MAAQ,SAAUzN,GACxC,IAAIyN,EAAO,GACX,IAAK,IAAIjqB,KAAOwc,EAAKyN,EAAKvK,KAAK1f,GAC/B,OAAOiqB,CACT,EAGAtrB,EAAOD,QAAU2uC,EACjB,IAAIC,EAAW,EAAQ,IACnBC,EAAW,EAAQ,KACvB,EAAQ,EAAR,CAAoBF,EAAQC,GAI1B,IADA,IAAIrjB,EAAOmjB,EAAWG,EAASnuC,WACtBouC,EAAI,EAAGA,EAAIvjB,EAAK7pB,OAAQotC,IAAK,CACpC,IAAIC,EAASxjB,EAAKujB,GACbH,EAAOjuC,UAAUquC,KAASJ,EAAOjuC,UAAUquC,GAAUF,EAASnuC,UAAUquC,GAC/E,CAEF,SAASJ,EAAO9f,GACd,KAAM7rB,gBAAgB2rC,GAAS,OAAO,IAAIA,EAAO9f,GACjD+f,EAASt0B,KAAKtX,KAAM6rB,GACpBggB,EAASv0B,KAAKtX,KAAM6rB,GACpB7rB,KAAKgsC,eAAgB,EACjBngB,KACuB,IAArBA,EAAQogB,WAAoBjsC,KAAKisC,UAAW,IACvB,IAArBpgB,EAAQ/tB,WAAoBkC,KAAKlC,UAAW,IAClB,IAA1B+tB,EAAQmgB,gBACVhsC,KAAKgsC,eAAgB,EACrBhsC,KAAK8yB,KAAK,MAAOoZ,IAGvB,CA8BA,SAASA,IAEHlsC,KAAKmsC,eAAeC,OAIxBxe,QAAQqO,SAASoQ,EAASrsC,KAC5B,CACA,SAASqsC,EAAQvoC,GACfA,EAAK3C,KACP,CAvCA9D,OAAOqiB,eAAeisB,EAAOjuC,UAAW,wBAAyB,CAI/DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAEFjvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAEFlvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAeFrB,OAAOqiB,eAAeisB,EAAOjuC,UAAW,YAAa,CAInDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,gBAGvCnsC,KAAKwsC,eAAeC,WAAazsC,KAAKmsC,eAAeM,SAC9D,EACAvsB,IAAK,SAAatiB,QAGYwB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,iBAM9CnsC,KAAKwsC,eAAeC,UAAY7uC,EAChCoC,KAAKmsC,eAAeM,UAAY7uC,EAClC,4BC/FF,IAAI8tC,EAAaruC,OAAOkrB,MAAQ,SAAUzN,GACxC,IAAIyN,EAAO,GACX,IAAK,IAAIjqB,KAAOwc,EAAKyN,EAAKvK,KAAK1f,GAC/B,OAAOiqB,CACT,EAGAtrB,EAAOD,QAAU2uC,EACjB,IAAIC,EAAW,EAAQ,KACnBC,EAAW,EAAQ,KACvB,EAAQ,EAAR,CAAoBF,EAAQC,GAI1B,IADA,IAAIrjB,EAAOmjB,EAAWG,EAASnuC,WACtBouC,EAAI,EAAGA,EAAIvjB,EAAK7pB,OAAQotC,IAAK,CACpC,IAAIC,EAASxjB,EAAKujB,GACbH,EAAOjuC,UAAUquC,KAASJ,EAAOjuC,UAAUquC,GAAUF,EAASnuC,UAAUquC,GAC/E,CAEF,SAASJ,EAAO9f,GACd,KAAM7rB,gBAAgB2rC,GAAS,OAAO,IAAIA,EAAO9f,GACjD+f,EAASt0B,KAAKtX,KAAM6rB,GACpBggB,EAASv0B,KAAKtX,KAAM6rB,GACpB7rB,KAAKgsC,eAAgB,EACjBngB,KACuB,IAArBA,EAAQogB,WAAoBjsC,KAAKisC,UAAW,IACvB,IAArBpgB,EAAQ/tB,WAAoBkC,KAAKlC,UAAW,IAClB,IAA1B+tB,EAAQmgB,gBACVhsC,KAAKgsC,eAAgB,EACrBhsC,KAAK8yB,KAAK,MAAOoZ,IAGvB,CA8BA,SAASA,IAEHlsC,KAAKmsC,eAAeC,OAIxBxe,QAAQqO,SAASoQ,EAASrsC,KAC5B,CACA,SAASqsC,EAAQvoC,GACfA,EAAK3C,KACP,CAvCA9D,OAAOqiB,eAAeisB,EAAOjuC,UAAW,wBAAyB,CAI/DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAEFjvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAEFlvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAeFrB,OAAOqiB,eAAeisB,EAAOjuC,UAAW,YAAa,CAInDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,gBAGvCnsC,KAAKwsC,eAAeC,WAAazsC,KAAKmsC,eAAeM,SAC9D,EACAvsB,IAAK,SAAatiB,QAGYwB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,iBAM9CnsC,KAAKwsC,eAAeC,UAAY7uC,EAChCoC,KAAKmsC,eAAeM,UAAY7uC,EAClC,4BC/FF,IAAI8tC,EAAaruC,OAAOkrB,MAAQ,SAAUzN,GACxC,IAAIyN,EAAO,GACX,IAAK,IAAIjqB,KAAOwc,EAAKyN,EAAKvK,KAAK1f,GAC/B,OAAOiqB,CACT,EAGAtrB,EAAOD,QAAU2uC,EACjB,IAAIC,EAAW,EAAQ,KACnBC,EAAW,EAAQ,KACvB,EAAQ,EAAR,CAAoBF,EAAQC,GAI1B,IADA,IAAIrjB,EAAOmjB,EAAWG,EAASnuC,WACtBouC,EAAI,EAAGA,EAAIvjB,EAAK7pB,OAAQotC,IAAK,CACpC,IAAIC,EAASxjB,EAAKujB,GACbH,EAAOjuC,UAAUquC,KAASJ,EAAOjuC,UAAUquC,GAAUF,EAASnuC,UAAUquC,GAC/E,CAEF,SAASJ,EAAO9f,GACd,KAAM7rB,gBAAgB2rC,GAAS,OAAO,IAAIA,EAAO9f,GACjD+f,EAASt0B,KAAKtX,KAAM6rB,GACpBggB,EAASv0B,KAAKtX,KAAM6rB,GACpB7rB,KAAKgsC,eAAgB,EACjBngB,KACuB,IAArBA,EAAQogB,WAAoBjsC,KAAKisC,UAAW,IACvB,IAArBpgB,EAAQ/tB,WAAoBkC,KAAKlC,UAAW,IAClB,IAA1B+tB,EAAQmgB,gBACVhsC,KAAKgsC,eAAgB,EACrBhsC,KAAK8yB,KAAK,MAAOoZ,IAGvB,CA8BA,SAASA,IAEHlsC,KAAKmsC,eAAeC,OAIxBxe,QAAQqO,SAASoQ,EAASrsC,KAC5B,CACA,SAASqsC,EAAQvoC,GACfA,EAAK3C,KACP,CAvCA9D,OAAOqiB,eAAeisB,EAAOjuC,UAAW,wBAAyB,CAI/DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAEFjvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAEFlvC,OAAOqiB,eAAeisB,EAAOjuC,UAAW,iBAAkB,CAIxDG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAeFrB,OAAOqiB,eAAeisB,EAAOjuC,UAAW,YAAa,CAInDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,gBAGvCnsC,KAAKwsC,eAAeC,WAAazsC,KAAKmsC,eAAeM,SAC9D,EACAvsB,IAAK,SAAatiB,QAGYwB,IAAxBY,KAAKwsC,qBAAwDptC,IAAxBY,KAAKmsC,iBAM9CnsC,KAAKwsC,eAAeC,UAAY7uC,EAChCoC,KAAKmsC,eAAeM,UAAY7uC,EAClC,4BC3HFX,EAAOD,QAAU0vC,EAGjB,IAAIjhB,EAAmB,EAAQ,MAC7BihB,EAAMhvC,UAAYL,OAAOC,OAAOmuB,EAAiB/tB,YAAYC,YAAc+uC,GAAOhhB,UAAY,QAEhG,IAAIsS,EAAQ,EAAQ,IAChBjW,EAAQ,EAAQ,GAYpB,SAAS2kB,EAAMx1B,EAAMsY,EAAY3D,EAASC,GAQtC,GAPKpqB,MAAMC,QAAQ6tB,KACf3D,EAAU2D,EACVA,OAAapwB,GAEjBqsB,EAAiBnU,KAAKtX,KAAMkX,EAAM2U,QAGbzsB,IAAfowB,IAA4B9tB,MAAMC,QAAQ6tB,GAC5C,MAAMzwB,UAAU,+BAMpBiB,KAAK2sC,MAAQnd,GAAc,GAO3BxvB,KAAK4sC,YAAc,GAMnB5sC,KAAK8rB,QAAUA,CACnB,CAyCA,SAAS+gB,EAAkBF,GACvB,GAAIA,EAAMvN,OACN,IAAK,IAAI59B,EAAI,EAAGA,EAAImrC,EAAMC,YAAYluC,SAAU8C,EACvCmrC,EAAMC,YAAYprC,GAAG49B,QACtBuN,EAAMvN,OAAOp3B,IAAI2kC,EAAMC,YAAYprC,GACnD,CA9BAkrC,EAAMxgB,SAAW,SAAkBhV,EAAMiV,GACrC,OAAO,IAAIugB,EAAMx1B,EAAMiV,EAAKwgB,MAAOxgB,EAAKN,QAASM,EAAKL,QAC1D,EAOA4gB,EAAMhvC,UAAUsH,OAAS,SAAgBonB,GACrC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,UAAYxoB,KAAK6rB,QACjB,QAAY7rB,KAAK2sC,MACjB,UAAYtgB,EAAersB,KAAK8rB,aAAU1sB,GAElD,EAqBAstC,EAAMhvC,UAAUsK,IAAM,SAAa8kC,GAG/B,KAAMA,aAAiB9O,GACnB,MAAMj/B,UAAU,yBAQpB,OANI+tC,EAAM1N,QAAU0N,EAAM1N,SAAWp/B,KAAKo/B,QACtC0N,EAAM1N,OAAOvV,OAAOijB,GACxB9sC,KAAK2sC,MAAM3uB,KAAK8uB,EAAM51B,MACtBlX,KAAK4sC,YAAY5uB,KAAK8uB,GACtBA,EAAMtO,OAASx+B,KACf6sC,EAAkB7sC,MACXA,IACX,EAOA0sC,EAAMhvC,UAAUmsB,OAAS,SAAgBijB,GAGrC,KAAMA,aAAiB9O,GACnB,MAAMj/B,UAAU,yBAEpB,IAAI2B,EAAQV,KAAK4sC,YAAYnwB,QAAQqwB,GAGrC,GAAIpsC,EAAQ,EACR,MAAMjB,MAAMqtC,EAAQ,uBAAyB9sC,MAUjD,OARAA,KAAK4sC,YAAY5R,OAAOt6B,EAAO,IAC/BA,EAAQV,KAAK2sC,MAAMlwB,QAAQqwB,EAAM51B,QAGpB,GACTlX,KAAK2sC,MAAM3R,OAAOt6B,EAAO,GAE7BosC,EAAMtO,OAAS,KACRx+B,IACX,EAKA0sC,EAAMhvC,UAAUyiC,MAAQ,SAAef,GACnC3T,EAAiB/tB,UAAUyiC,MAAM7oB,KAAKtX,KAAMo/B,GAG5C,IAFA,IAES59B,EAAI,EAAGA,EAAIxB,KAAK2sC,MAAMjuC,SAAU8C,EAAG,CACxC,IAAIsrC,EAAQ1N,EAAOzf,IAAI3f,KAAK2sC,MAAMnrC,IAC9BsrC,IAAUA,EAAMtO,SAChBsO,EAAMtO,OALHx+B,UAME4sC,YAAY5uB,KAAK8uB,GAE9B,CAEAD,EAAkB7sC,KACtB,EAKA0sC,EAAMhvC,UAAU2iC,SAAW,SAAkBjB,GACzC,IAAK,IAAW0N,EAAPtrC,EAAI,EAAUA,EAAIxB,KAAK4sC,YAAYluC,SAAU8C,GAC7CsrC,EAAQ9sC,KAAK4sC,YAAYprC,IAAI49B,QAC9B0N,EAAM1N,OAAOvV,OAAOijB,GAC5BrhB,EAAiB/tB,UAAU2iC,SAAS/oB,KAAKtX,KAAMo/B,EACnD,EAkBAsN,EAAMhc,EAAI,WAGN,IAFA,IAAIlB,EAAa,IAAI9tB,MAAM+Z,UAAU/c,QACjCgC,EAAQ,EACLA,EAAQ+a,UAAU/c,QACrB8wB,EAAW9uB,GAAS+a,UAAU/a,KAClC,OAAO,SAAwBhD,EAAWqvC,GACtChlB,EAAK0B,aAAa/rB,EAAUC,aACvBqK,IAAI,IAAI0kC,EAAMK,EAAWvd,IAC9BnyB,OAAOqiB,eAAehiB,EAAWqvC,EAAW,CACxCptB,IAAKoI,EAAKwH,YAAYC,GACtBtP,IAAK6H,EAAK2H,YAAYF,IAE9B,CACJ,0BCxMA,IAAI7vB,EAAK,EAAQ,GACbsqB,EAAQ,EAAQ,GAChBM,EAASN,EAAMM,OACfE,EAASR,EAAMQ,OACfnrB,EAAS2qB,EAAM3qB,OAEnB,SAAS0tC,EAAU9xB,EAAM+xB,GACvBjtC,KAAKkb,KAAOA,EACZlb,KAAK+O,EAAI,IAAIpP,EAAGstC,EAAKl+B,EAAG,IAGxB/O,KAAKG,IAAM8sC,EAAKv1B,MAAQ/X,EAAGQ,IAAI8sC,EAAKv1B,OAAS/X,EAAGwZ,KAAKnZ,KAAK+O,GAG1D/O,KAAKktC,KAAO,IAAIvtC,EAAG,GAAGyV,MAAMpV,KAAKG,KACjCH,KAAK2Y,IAAM,IAAIhZ,EAAG,GAAGyV,MAAMpV,KAAKG,KAChCH,KAAKmtC,IAAM,IAAIxtC,EAAG,GAAGyV,MAAMpV,KAAKG,KAGhCH,KAAKwP,EAAIy9B,EAAKz9B,GAAK,IAAI7P,EAAGstC,EAAKz9B,EAAG,IAClCxP,KAAKyT,EAAIw5B,EAAKx5B,GAAKzT,KAAKotC,cAAcH,EAAKx5B,EAAGw5B,EAAKI,MAGnDrtC,KAAKstC,QAAU,IAAI5rC,MAAM,GACzB1B,KAAKutC,QAAU,IAAI7rC,MAAM,GACzB1B,KAAKwtC,QAAU,IAAI9rC,MAAM,GACzB1B,KAAKytC,QAAU,IAAI/rC,MAAM,GAEzB1B,KAAK0tC,WAAa1tC,KAAKwP,EAAIxP,KAAKwP,EAAEzJ,YAAc,EAGhD,IAAI4nC,EAAc3tC,KAAKwP,GAAKxP,KAAK+O,EAAE2D,IAAI1S,KAAKwP,IACvCm+B,GAAeA,EAAYt5B,KAAK,KAAO,EAC1CrU,KAAK4tC,KAAO,MAEZ5tC,KAAK6tC,eAAgB,EACrB7tC,KAAK4tC,KAAO5tC,KAAKwP,EAAE4F,MAAMpV,KAAKG,KAElC,CAsNA,SAAS2tC,EAAU5K,EAAOhoB,GACxBlb,KAAKkjC,MAAQA,EACbljC,KAAKkb,KAAOA,EACZlb,KAAK+tC,YAAc,IACrB,CAzNA9wC,EAAOD,QAAUgwC,EAEjBA,EAAUtvC,UAAUswC,MAAQ,WAC1B,MAAM,IAAIvuC,MAAM,kBAClB,EAEAutC,EAAUtvC,UAAUuwC,SAAW,WAC7B,MAAM,IAAIxuC,MAAM,kBAClB,EAEAutC,EAAUtvC,UAAUwwC,aAAe,SAAsBn/B,EAAG3K,GAC1D9E,EAAOyP,EAAEg/B,aACT,IAAII,EAAUp/B,EAAEq/B,cAEZ5jB,EAAMD,EAAOnmB,EAAG,EAAGpE,KAAK0tC,YACxBW,GAAK,GAAMF,EAAQG,KAAO,IAAOH,EAAQG,KAAO,GAAM,EAAI,EAAI,GAClED,GAAK,EAGL,IACI7rC,EACA+rC,EAFAC,EAAO,GAGX,IAAKhsC,EAAI,EAAGA,EAAIgoB,EAAI9rB,OAAQ8D,GAAK2rC,EAAQG,KAAM,CAC7CC,EAAO,EACP,IAAK,IAAIxgC,EAAIvL,EAAI2rC,EAAQG,KAAO,EAAGvgC,GAAKvL,EAAGuL,IACzCwgC,GAAQA,GAAQ,GAAK/jB,EAAIzc,GAC3BygC,EAAKxwB,KAAKuwB,EACZ,CAIA,IAFA,IAAIvqC,EAAIhE,KAAKyuC,OAAO,KAAM,KAAM,MAC5BxqC,EAAIjE,KAAKyuC,OAAO,KAAM,KAAM,MACvBjtC,EAAI6sC,EAAG7sC,EAAI,EAAGA,IAAK,CAC1B,IAAKgB,EAAI,EAAGA,EAAIgsC,EAAK9vC,OAAQ8D,KAC3B+rC,EAAOC,EAAKhsC,MACChB,EACXyC,EAAIA,EAAEyqC,SAASP,EAAQQ,OAAOnsC,IACvB+rC,KAAU/sC,IACjByC,EAAIA,EAAEyqC,SAASP,EAAQQ,OAAOnsC,GAAGoE,QAErC5C,EAAIA,EAAEgE,IAAI/D,EACZ,CACA,OAAOD,EAAE4qC,KACX,EAEA5B,EAAUtvC,UAAUmxC,SAAW,SAAkB9/B,EAAG3K,GAClD,IAAI3B,EAAI,EAGJqsC,EAAY//B,EAAEggC,cAActsC,GAChCA,EAAIqsC,EAAU91B,IAQd,IAPA,IAAIA,EAAM81B,EAAUH,OAGhBnkB,EAAMD,EAAOnmB,EAAG3B,EAAGzC,KAAK0tC,YAGxBv6B,EAAMnT,KAAKyuC,OAAO,KAAM,KAAM,MACzBjtC,EAAIgpB,EAAI9rB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CAExC,IAAK,IAAIuM,EAAI,EAAGvM,GAAK,GAAgB,IAAXgpB,EAAIhpB,GAAUA,IACtCuM,IAKF,GAJIvM,GAAK,GACPuM,IACFoF,EAAMA,EAAI67B,KAAKjhC,GAEXvM,EAAI,EACN,MACF,IAAIsX,EAAI0R,EAAIhpB,GACZlC,EAAa,IAANwZ,GAIH3F,EAHW,WAAXpE,EAAEmM,KAEApC,EAAI,EACA3F,EAAIu7B,SAAS11B,EAAKF,EAAI,GAAM,IAE5B3F,EAAIu7B,SAAS11B,GAAMF,EAAI,GAAM,GAAGlS,OAGpCkS,EAAI,EACA3F,EAAInL,IAAIgR,EAAKF,EAAI,GAAM,IAEvB3F,EAAInL,IAAIgR,GAAMF,EAAI,GAAM,GAAGlS,MAEvC,CACA,MAAkB,WAAXmI,EAAEmM,KAAoB/H,EAAIy7B,MAAQz7B,CAC3C,EAEA65B,EAAUtvC,UAAUuxC,YAAc,SAAqBC,EACrDP,EACAQ,EACA9tC,EACA+tC,GACA,IAMI5tC,EACAgB,EACAuM,EARAsgC,EAAWrvC,KAAKstC,QAChBt0B,EAAMhZ,KAAKutC,QACX/iB,EAAMxqB,KAAKwtC,QAGX5rC,EAAM,EAIV,IAAKJ,EAAI,EAAGA,EAAIH,EAAKG,IAAK,CAExB,IAAIstC,GADJ//B,EAAI4/B,EAAOntC,IACOutC,cAAcG,GAChCG,EAAS7tC,GAAKstC,EAAU91B,IACxBA,EAAIxX,GAAKstC,EAAUH,MACrB,CAGA,IAAKntC,EAAIH,EAAM,EAAGG,GAAK,EAAGA,GAAK,EAAG,CAChC,IAAIwC,EAAIxC,EAAI,EACRyC,EAAIzC,EACR,GAAoB,IAAhB6tC,EAASrrC,IAA4B,IAAhBqrC,EAASprC,GAAlC,CAQA,IAAIqrC,EAAO,CACTX,EAAO3qC,GACP,KACA,KACA2qC,EAAO1qC,IAI4B,IAAjC0qC,EAAO3qC,GAAGyJ,EAAE1L,IAAI4sC,EAAO1qC,GAAGwJ,IAC5B6hC,EAAK,GAAKX,EAAO3qC,GAAGgE,IAAI2mC,EAAO1qC,IAC/BqrC,EAAK,GAAKX,EAAO3qC,GAAGurC,MAAMb,SAASC,EAAO1qC,GAAG2C,QACM,IAA1C+nC,EAAO3qC,GAAGyJ,EAAE1L,IAAI4sC,EAAO1qC,GAAGwJ,EAAEiJ,WACrC44B,EAAK,GAAKX,EAAO3qC,GAAGurC,MAAMb,SAASC,EAAO1qC,IAC1CqrC,EAAK,GAAKX,EAAO3qC,GAAGgE,IAAI2mC,EAAO1qC,GAAG2C,SAElC0oC,EAAK,GAAKX,EAAO3qC,GAAGurC,MAAMb,SAASC,EAAO1qC,IAC1CqrC,EAAK,GAAKX,EAAO3qC,GAAGurC,MAAMb,SAASC,EAAO1qC,GAAG2C,QAG/C,IAAIlG,EAAQ,EACT,GACA,GACA,GACA,EACD,EACA,EACA,EACA,EACA,GAGEkqB,EAAMH,EAAO0kB,EAAOnrC,GAAImrC,EAAOlrC,IAInC,IAHArC,EAAMN,KAAKM,IAAIgpB,EAAI,GAAGlsB,OAAQkD,GAC9B4oB,EAAIxmB,GAAK,IAAItC,MAAME,GACnB4oB,EAAIvmB,GAAK,IAAIvC,MAAME,GACdY,EAAI,EAAGA,EAAIZ,EAAKY,IAAK,CACxB,IAAIgtC,EAAiB,EAAZ5kB,EAAI,GAAGpoB,GACZitC,EAAiB,EAAZ7kB,EAAI,GAAGpoB,GAEhBgoB,EAAIxmB,GAAGxB,GAAK9B,EAAiB,GAAV8uC,EAAK,IAAUC,EAAK,IACvCjlB,EAAIvmB,GAAGzB,GAAK,EACZwW,EAAIhV,GAAKsrC,CACX,CA5CA,MALE9kB,EAAIxmB,GAAKumB,EAAO4kB,EAAOnrC,GAAIqrC,EAASrrC,GAAIhE,KAAK0tC,YAC7CljB,EAAIvmB,GAAKsmB,EAAO4kB,EAAOlrC,GAAIorC,EAASprC,GAAIjE,KAAK0tC,YAC7C9rC,EAAMN,KAAKM,IAAI4oB,EAAIxmB,GAAGtF,OAAQkD,GAC9BA,EAAMN,KAAKM,IAAI4oB,EAAIvmB,GAAGvF,OAAQkD,EA+ClC,CAEA,IAAIuR,EAAMnT,KAAKyuC,OAAO,KAAM,KAAM,MAC9Bt3B,EAAMnX,KAAKytC,QACf,IAAKjsC,EAAII,EAAKJ,GAAK,EAAGA,IAAK,CAGzB,IAFA,IAAI4C,EAAI,EAED5C,GAAK,GAAG,CACb,IAAI0rC,GAAO,EACX,IAAK1qC,EAAI,EAAGA,EAAInB,EAAKmB,IACnB2U,EAAI3U,GAAiB,EAAZgoB,EAAIhoB,GAAGhB,GACD,IAAX2V,EAAI3U,KACN0qC,GAAO,GAEX,IAAKA,EACH,MACF9oC,IACA5C,GACF,CAIA,GAHIA,GAAK,GACP4C,IACF+O,EAAMA,EAAI67B,KAAK5qC,GACX5C,EAAI,EACN,MAEF,IAAKgB,EAAI,EAAGA,EAAInB,EAAKmB,IAAK,CACxB,IAAIsW,EAAI3B,EAAI3U,GAEF,IAANsW,IAEKA,EAAI,EACX/J,EAAIiK,EAAIxW,GAAIsW,EAAI,GAAM,GACfA,EAAI,IACX/J,EAAIiK,EAAIxW,IAAKsW,EAAI,GAAM,GAAGlS,OAG1BuM,EADa,WAAXpE,EAAEmM,KACE/H,EAAIu7B,SAAS3/B,GAEboE,EAAInL,IAAI+G,GAClB,CACF,CAEA,IAAKvN,EAAI,EAAGA,EAAIH,EAAKG,IACnBwX,EAAIxX,GAAK,KAEX,OAAI4tC,EACKj8B,EAEAA,EAAIy7B,KACf,EAOA5B,EAAUc,UAAYA,EAEtBA,EAAUpwC,UAAUwX,GAAK,WACvB,MAAM,IAAIzV,MAAM,kBAClB,EAEAquC,EAAUpwC,UAAUuwC,SAAW,WAC7B,OAAOjuC,KAAKkjC,MAAM+K,SAASjuC,KAC7B,EAEAgtC,EAAUtvC,UAAUgyC,YAAc,SAAqBxuB,EAAO+O,GAC5D/O,EAAQ+I,EAAM3nB,QAAQ4e,EAAO+O,GAE7B,IAAI5uB,EAAMrB,KAAK+O,EAAE3J,aAGjB,IAAkB,IAAb8b,EAAM,IAA4B,IAAbA,EAAM,IAA4B,IAAbA,EAAM,KACjDA,EAAMxiB,OAAS,GAAM,EAAI2C,EAS3B,OARiB,IAAb6f,EAAM,GACR5hB,EAAO4hB,EAAMA,EAAMxiB,OAAS,GAAK,GAAM,GACnB,IAAbwiB,EAAM,IACb5hB,EAAO4hB,EAAMA,EAAMxiB,OAAS,GAAK,GAAM,GAE9BsB,KAAKguC,MAAM9sB,EAAMhH,MAAM,EAAG,EAAI7Y,GACvC6f,EAAMhH,MAAM,EAAI7Y,EAAK,EAAI,EAAIA,IAG1B,IAAkB,IAAb6f,EAAM,IAA4B,IAAbA,EAAM,KAC3BA,EAAMxiB,OAAS,IAAM2C,EAC/B,OAAOrB,KAAK2vC,WAAWzuB,EAAMhH,MAAM,EAAG,EAAI7Y,GAAmB,IAAb6f,EAAM,IAExD,MAAM,IAAIzhB,MAAM,uBAClB,EAEAquC,EAAUpwC,UAAUkyC,iBAAmB,SAA0B3f,GAC/D,OAAOjwB,KAAKsqB,OAAO2F,GAAK,EAC1B,EAEA6d,EAAUpwC,UAAUmyC,QAAU,SAAiBC,GAC7C,IAAIzuC,EAAMrB,KAAKkjC,MAAMn0B,EAAE3J,aACnBoI,EAAIxN,KAAK+vC,OAAOztC,QAAQ,KAAMjB,GAElC,OAAIyuC,EACK,CAAE9vC,KAAKgwC,OAAOt8B,SAAW,EAAO,GAAOqM,OAAOvS,GAEhD,CAAE,GAAOuS,OAAOvS,EAAGxN,KAAKgwC,OAAO1tC,QAAQ,KAAMjB,GACtD,EAEAysC,EAAUpwC,UAAU4sB,OAAS,SAAgB2F,EAAK6f,GAChD,OAAO7lB,EAAMK,OAAOtqB,KAAK6vC,QAAQC,GAAU7f,EAC7C,EAEA6d,EAAUpwC,UAAUuyC,WAAa,SAAoBC,GACnD,GAAIlwC,KAAK+tC,YACP,OAAO/tC,KAET,IAAI+tC,EAAc,CAChBI,QAAS,KACT3jB,IAAK,KACL2lB,KAAM,MAOR,OALApC,EAAYvjB,IAAMxqB,KAAK+uC,cAAc,GACrChB,EAAYI,QAAUnuC,KAAKouC,YAAY,EAAG8B,GAC1CnC,EAAYoC,KAAOnwC,KAAKowC,WACxBpwC,KAAK+tC,YAAcA,EAEZ/tC,IACT,EAEA8tC,EAAUpwC,UAAU2yC,YAAc,SAAqBjsC,GACrD,IAAKpE,KAAK+tC,YACR,OAAO,EAET,IAAII,EAAUnuC,KAAK+tC,YAAYI,QAC/B,QAAKA,GAGEA,EAAQQ,OAAOjwC,QAAU4C,KAAKiB,MAAM6B,EAAE2B,YAAc,GAAKooC,EAAQG,KAC1E,EAEAR,EAAUpwC,UAAU0wC,YAAc,SAAqBE,EAAM4B,GAC3D,GAAIlwC,KAAK+tC,aAAe/tC,KAAK+tC,YAAYI,QACvC,OAAOnuC,KAAK+tC,YAAYI,QAI1B,IAFA,IAAIA,EAAU,CAAEnuC,MACZmT,EAAMnT,KACDwB,EAAI,EAAGA,EAAI0uC,EAAO1uC,GAAK8sC,EAAM,CACpC,IAAK,IAAI9rC,EAAI,EAAGA,EAAI8rC,EAAM9rC,IACxB2Q,EAAMA,EAAIm9B,MACZnC,EAAQnwB,KAAK7K,EACf,CACA,MAAO,CACLm7B,KAAMA,EACNK,OAAQR,EAEZ,EAEAL,EAAUpwC,UAAUqxC,cAAgB,SAAuB/1B,GACzD,GAAIhZ,KAAK+tC,aAAe/tC,KAAK+tC,YAAYvjB,IACvC,OAAOxqB,KAAK+tC,YAAYvjB,IAK1B,IAHA,IAAIjlB,EAAM,CAAEvF,MACR4B,GAAO,GAAKoX,GAAO,EACnBs3B,EAAc,IAAR1uC,EAAY,KAAO5B,KAAKswC,MACzB9uC,EAAI,EAAGA,EAAII,EAAKJ,IACvB+D,EAAI/D,GAAK+D,EAAI/D,EAAI,GAAGwG,IAAIsoC,GAC1B,MAAO,CACLt3B,IAAKA,EACL21B,OAAQppC,EAEZ,EAEAuoC,EAAUpwC,UAAU0yC,SAAW,WAC7B,OAAO,IACT,EAEAtC,EAAUpwC,UAAUsxC,KAAO,SAAc5qC,GAEvC,IADA,IAAIrD,EAAIf,KACCwB,EAAI,EAAGA,EAAI4C,EAAG5C,IACrBT,EAAIA,EAAEuvC,MACR,OAAOvvC,CACT,0BC1XA,IAAIkpB,EAAQ,EAAQ,GAChB3qB,EAAS,EAAQ,GAErB,SAASixC,IACPvwC,KAAKwwC,QAAU,KACfxwC,KAAKywC,aAAe,EACpBzwC,KAAK06B,UAAY16B,KAAKrC,YAAY+8B,UAClC16B,KAAK0wC,QAAU1wC,KAAKrC,YAAY+yC,QAChC1wC,KAAK2wC,aAAe3wC,KAAKrC,YAAYgzC,aACrC3wC,KAAK4wC,UAAY5wC,KAAKrC,YAAYizC,UAAY,EAC9C5wC,KAAKF,OAAS,MAEdE,KAAK6wC,QAAU7wC,KAAK06B,UAAY,EAChC16B,KAAK8wC,SAAW9wC,KAAK06B,UAAY,EACnC,CACA19B,EAAQuzC,UAAYA,EAEpBA,EAAU7yC,UAAU29B,OAAS,SAAgB77B,EAAKywB,GAUhD,GARAzwB,EAAMyqB,EAAM3nB,QAAQ9C,EAAKywB,GACpBjwB,KAAKwwC,QAGRxwC,KAAKwwC,QAAUxwC,KAAKwwC,QAAQzwB,OAAOvgB,GAFnCQ,KAAKwwC,QAAUhxC,EAGjBQ,KAAKywC,cAAgBjxC,EAAId,OAGrBsB,KAAKwwC,QAAQ9xC,QAAUsB,KAAK6wC,QAAS,CAIvC,IAAI9vC,GAHJvB,EAAMQ,KAAKwwC,SAGC9xC,OAASsB,KAAK6wC,QAC1B7wC,KAAKwwC,QAAUhxC,EAAI0a,MAAM1a,EAAId,OAASqC,EAAGvB,EAAId,QACjB,IAAxBsB,KAAKwwC,QAAQ9xC,SACfsB,KAAKwwC,QAAU,MAEjBhxC,EAAMyqB,EAAMkG,OAAO3wB,EAAK,EAAGA,EAAId,OAASqC,EAAGf,KAAKF,QAChD,IAAK,IAAI0B,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,GAAKxB,KAAK8wC,SACxC9wC,KAAKu8B,QAAQ/8B,EAAKgC,EAAGA,EAAIxB,KAAK8wC,SAClC,CAEA,OAAO9wC,IACT,EAEAuwC,EAAU7yC,UAAU++B,OAAS,SAAgBxM,GAI3C,OAHAjwB,KAAKq7B,OAAOr7B,KAAK+wC,QACjBzxC,EAAwB,OAAjBU,KAAKwwC,SAELxwC,KAAKgxC,QAAQ/gB,EACtB,EAEAsgB,EAAU7yC,UAAUqzC,KAAO,WACzB,IAAI1vC,EAAMrB,KAAKywC,aACXvvB,EAAQlhB,KAAK6wC,QACbzsC,EAAI8c,GAAU7f,EAAMrB,KAAK4wC,WAAa1vB,EACtC3b,EAAM,IAAI7D,MAAM0C,EAAIpE,KAAK4wC,WAC7BrrC,EAAI,GAAK,IACT,IAAK,IAAI/D,EAAI,EAAGA,EAAI4C,EAAG5C,IACrB+D,EAAI/D,GAAK,EAIX,GADAH,IAAQ,EACY,QAAhBrB,KAAKF,OAAkB,CACzB,IAAK,IAAI+F,EAAI,EAAGA,EAAI7F,KAAK4wC,UAAW/qC,IAClCN,EAAI/D,KAAO,EAEb+D,EAAI/D,KAAO,EACX+D,EAAI/D,KAAO,EACX+D,EAAI/D,KAAO,EACX+D,EAAI/D,KAAO,EACX+D,EAAI/D,KAAQH,IAAQ,GAAM,IAC1BkE,EAAI/D,KAAQH,IAAQ,GAAM,IAC1BkE,EAAI/D,KAAQH,IAAQ,EAAK,IACzBkE,EAAI/D,KAAa,IAANH,CACb,MAUE,IATAkE,EAAI/D,KAAa,IAANH,EACXkE,EAAI/D,KAAQH,IAAQ,EAAK,IACzBkE,EAAI/D,KAAQH,IAAQ,GAAM,IAC1BkE,EAAI/D,KAAQH,IAAQ,GAAM,IAC1BkE,EAAI/D,KAAO,EACX+D,EAAI/D,KAAO,EACX+D,EAAI/D,KAAO,EACX+D,EAAI/D,KAAO,EAENqE,EAAI,EAAGA,EAAI7F,KAAK4wC,UAAW/qC,IAC9BN,EAAI/D,KAAO,EAGf,OAAO+D,CACT,aCnCA,SAAS0rC,EAAQ/5B,GAEf,IACE,IAAK,EAAAzD,EAAOy9B,aAAc,OAAO,CACnC,CAAE,MAAOhhC,GACP,OAAO,CACT,CACA,IAAI3Q,EAAM,EAAAkU,EAAOy9B,aAAah6B,GAC9B,OAAI,MAAQ3X,GACyB,SAA9Bwd,OAAOxd,GAAKsc,aACrB,CA7DA5e,EAAOD,QAoBP,SAAoB2qB,EAAInoB,GACtB,GAAIyxC,EAAO,iBACT,OAAOtpB,EAGT,IAAIiN,GAAS,EAeb,OAdA,WACE,IAAKA,EAAQ,CACX,GAAIqc,EAAO,oBACT,MAAM,IAAIxxC,MAAMD,GACPyxC,EAAO,oBAChBzxB,QAAQ4lB,MAAM5lC,GAEdggB,QAAQsV,KAAKt1B,GAEfo1B,GAAS,CACX,CACA,OAAOjN,EAAG1I,MAAMjf,KAAMyb,UACxB,CAGF,0BC5CA,IAAI01B,EAAa,EAAQ,KAEzBl0C,EAAOD,QAAU,WAChB,OAAOm0C,OAAkB33B,OAAO43B,WACjC,0BCJA,IAAIhyC,EAEAiyC,EAAeC,YACfC,EAAYhf,SACZif,EAAazyC,UAGb0yC,EAAwB,SAAUC,GACrC,IACC,OAAOH,EAAU,yBAA2BG,EAAmB,iBAAxDH,EACR,CAAE,MAAOhxC,GAAI,CACd,EAEIoxC,EAAQt0C,OAAOonC,yBACnB,GAAIkN,EACH,IACCA,EAAM,CAAC,EAAG,GACX,CAAE,MAAOpxC,GACRoxC,EAAQ,IACT,CAGD,IAAIC,EAAiB,WACpB,MAAM,IAAIJ,CACX,EACIK,EAAiBF,EACjB,WACF,IAGC,OAAOC,CACR,CAAE,MAAOE,GACR,IAEC,OAAOH,EAAMl2B,UAAW,UAAUkE,GACnC,CAAE,MAAOoyB,GACR,OAAOH,CACR,CACD,CACD,CAbE,GAcAA,EAECT,EAAa,EAAQ,IAAR,GAEba,EAAW30C,OAAO04B,gBAAkB,SAAUvoB,GAAK,OAAOA,EAAEu2B,SAAW,EAEvEkO,EAAY,CAAC,EAEbC,EAAmC,oBAAfr4B,WAA6Bza,EAAY4yC,EAASn4B,YAEtEs4B,EAAa,CAChB,mBAA8C,oBAAnBC,eAAiChzC,EAAYgzC,eACxE,UAAW1wC,MACX,gBAAwC,oBAAhB0Y,YAA8Bhb,EAAYgb,YAClE,2BAA4B+2B,EAAaa,EAAS,GAAGx4B,OAAO64B,aAAejzC,EAC3E,mCAAoCA,EACpC,kBAAmB6yC,EACnB,mBAAoBA,EACpB,2BAA4BA,EAC5B,2BAA4BA,EAC5B,YAAgC,oBAAZK,QAA0BlzC,EAAYkzC,QAC1D,WAA8B,oBAAX9wB,OAAyBpiB,EAAYoiB,OACxD,kBAA4C,oBAAlB+wB,cAAgCnzC,EAAYmzC,cACtE,mBAA8C,oBAAnBC,eAAiCpzC,EAAYozC,eACxE,YAAalmB,QACb,aAAkC,oBAAbmmB,SAA2BrzC,EAAYqzC,SAC5D,SAAUhL,KACV,cAAeiL,UACf,uBAAwB/Y,mBACxB,cAAegZ,UACf,uBAAwB5Y,mBACxB,UAAWt6B,MACX,SAAUmzC,KACV,cAAeC,UACf,iBAA0C,oBAAjBC,aAA+B1zC,EAAY0zC,aACpE,iBAA0C,oBAAjBC,aAA+B3zC,EAAY2zC,aACpE,yBAA0D,oBAAzBC,qBAAuC5zC,EAAY4zC,qBACpF,aAAczB,EACd,sBAAuBU,EACvB,cAAoC,oBAAdgB,UAA4B7zC,EAAY6zC,UAC9D,eAAsC,oBAAfC,WAA6B9zC,EAAY8zC,WAChE,eAAsC,oBAAfC,WAA6B/zC,EAAY+zC,WAChE,aAAcpyB,SACd,UAAW6R,MACX,sBAAuBue,EAAaa,EAASA,EAAS,GAAGx4B,OAAO64B,cAAgBjzC,EAChF,SAA0B,iBAAT0lC,KAAoBA,KAAO1lC,EAC5C,QAAwB,oBAARg0C,IAAsBh0C,EAAYg0C,IAClD,yBAAyC,oBAARA,KAAwBjC,EAAyBa,GAAS,IAAIoB,KAAM55B,OAAO64B,aAAtCjzC,EACtE,SAAUkC,KACV,WAAYgc,OACZ,WAAYjgB,OACZ,eAAgBg2C,WAChB,aAAc31B,SACd,YAAgC,oBAAZsV,QAA0B5zB,EAAY4zB,QAC1D,UAA4B,oBAAVsgB,MAAwBl0C,EAAYk0C,MACtD,eAAgB15B,WAChB,mBAAoB25B,eACpB,YAAgC,oBAAZphB,QAA0B/yB,EAAY+yB,QAC1D,WAAYuT,OACZ,QAAwB,oBAAR8N,IAAsBp0C,EAAYo0C,IAClD,yBAAyC,oBAARA,KAAwBrC,EAAyBa,GAAS,IAAIwB,KAAMh6B,OAAO64B,aAAtCjzC,EACtE,sBAAoD,oBAAtBwb,kBAAoCxb,EAAYwb,kBAC9E,WAAYmC,OACZ,4BAA6Bo0B,EAAaa,EAAS,GAAGx4B,OAAO64B,aAAejzC,EAC5E,WAAY+xC,EAAa33B,OAASpa,EAClC,gBAAiBiyC,EACjB,mBAAoBQ,EACpB,eAAgBK,EAChB,cAAeV,EACf,eAAsC,oBAAf33B,WAA6Bza,EAAYya,WAChE,sBAAoD,oBAAtB45B,kBAAoCr0C,EAAYq0C,kBAC9E,gBAAwC,oBAAhBC,YAA8Bt0C,EAAYs0C,YAClE,gBAAwC,oBAAhBrc,YAA8Bj4B,EAAYi4B,YAClE,aAAcsc,SACd,YAAgC,oBAAZC,QAA0Bx0C,EAAYw0C,QAC1D,YAAgC,oBAAZC,QAA0Bz0C,EAAYy0C,QAC1D,YAAgC,oBAAZC,QAA0B10C,EAAY00C,SAG3D,IACC,KAAKr0B,KACN,CAAE,MAAOlf,GAER,IAAIwzC,EAAa/B,EAASA,EAASzxC,IACnC4xC,EAAW,qBAAuB4B,CACnC,CAEA,IAAIC,EAAS,SAASA,EAAO98B,GAC5B,IAAItZ,EACJ,GAAa,oBAATsZ,EACHtZ,EAAQ6zC,EAAsB,6BACxB,GAAa,wBAATv6B,EACVtZ,EAAQ6zC,EAAsB,wBACxB,GAAa,6BAATv6B,EACVtZ,EAAQ6zC,EAAsB,8BACxB,GAAa,qBAATv6B,EAA6B,CACvC,IAAIyQ,EAAKqsB,EAAO,4BACZrsB,IACH/pB,EAAQ+pB,EAAGjqB,UAEb,MAAO,GAAa,6BAATwZ,EAAqC,CAC/C,IAAI+8B,EAAMD,EAAO,oBACbC,IACHr2C,EAAQo0C,EAASiC,EAAIv2C,WAEvB,CAIA,OAFAy0C,EAAWj7B,GAAQtZ,EAEZA,CACR,EAEIs2C,EAAiB,CACpB,yBAA0B,CAAC,cAAe,aAC1C,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,QAAS,YAAa,WAC/C,uBAAwB,CAAC,QAAS,YAAa,WAC/C,oBAAqB,CAAC,QAAS,YAAa,QAC5C,sBAAuB,CAAC,QAAS,YAAa,UAC9C,2BAA4B,CAAC,gBAAiB,aAC9C,mBAAoB,CAAC,yBAA0B,aAC/C,4BAA6B,CAAC,yBAA0B,YAAa,aACrE,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,WAAY,aACpC,kBAAmB,CAAC,OAAQ,aAC5B,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,YAAa,aACtC,0BAA2B,CAAC,eAAgB,aAC5C,0BAA2B,CAAC,eAAgB,aAC5C,sBAAuB,CAAC,WAAY,aACpC,cAAe,CAAC,oBAAqB,aACrC,uBAAwB,CAAC,oBAAqB,YAAa,aAC3D,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,wBAAyB,CAAC,aAAc,aACxC,cAAe,CAAC,OAAQ,SACxB,kBAAmB,CAAC,OAAQ,aAC5B,iBAAkB,CAAC,MAAO,aAC1B,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,sBAAuB,CAAC,SAAU,YAAa,YAC/C,qBAAsB,CAAC,SAAU,YAAa,WAC9C,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,UAAW,YAAa,QAChD,gBAAiB,CAAC,UAAW,OAC7B,mBAAoB,CAAC,UAAW,UAChC,oBAAqB,CAAC,UAAW,WACjC,wBAAyB,CAAC,aAAc,aACxC,4BAA6B,CAAC,iBAAkB,aAChD,oBAAqB,CAAC,SAAU,aAChC,iBAAkB,CAAC,MAAO,aAC1B,+BAAgC,CAAC,oBAAqB,aACtD,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,yBAA0B,CAAC,cAAe,aAC1C,wBAAyB,CAAC,aAAc,aACxC,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,+BAAgC,CAAC,oBAAqB,aACtD,yBAA0B,CAAC,cAAe,aAC1C,yBAA0B,CAAC,cAAe,aAC1C,sBAAuB,CAAC,WAAY,aACpC,qBAAsB,CAAC,UAAW,aAClC,qBAAsB,CAAC,UAAW,cAG/B7e,EAAO,EAAQ,IACf8e,EAAS,EAAQ,KACjBC,EAAU/e,EAAK/d,KAAKib,SAASjb,KAAM5V,MAAMhE,UAAUqiB,QACnDs0B,EAAehf,EAAK/d,KAAKib,SAAStT,MAAOvd,MAAMhE,UAAUs9B,QACzDsZ,EAAWjf,EAAK/d,KAAKib,SAASjb,KAAMyF,OAAOrf,UAAUyE,SACrDoyC,EAAYlf,EAAK/d,KAAKib,SAASjb,KAAMyF,OAAOrf,UAAUwc,OACtDs6B,EAAQnf,EAAK/d,KAAKib,SAASjb,KAAMouB,OAAOhoC,UAAU+2C,MAGlDC,EAAa,qGACbC,EAAe,WAiBfC,EAAmB,SAA0B19B,EAAM29B,GACtD,IACIC,EADAC,EAAgB79B,EAOpB,GALIi9B,EAAOD,EAAgBa,KAE1BA,EAAgB,KADhBD,EAAQZ,EAAea,IACK,GAAK,KAG9BZ,EAAOhC,EAAY4C,GAAgB,CACtC,IAAIn3C,EAAQu0C,EAAW4C,GAIvB,GAHIn3C,IAAUq0C,IACbr0C,EAAQo2C,EAAOe,SAEK,IAAVn3C,IAA0Bi3C,EACpC,MAAM,IAAIrD,EAAW,aAAet6B,EAAO,wDAG5C,MAAO,CACN49B,MAAOA,EACP59B,KAAM69B,EACNn3C,MAAOA,EAET,CAEA,MAAM,IAAIyzC,EAAa,aAAen6B,EAAO,mBAC9C,EAEAja,EAAOD,QAAU,SAAsBka,EAAM29B,GAC5C,GAAoB,iBAAT39B,GAAqC,IAAhBA,EAAKxY,OACpC,MAAM,IAAI8yC,EAAW,6CAEtB,GAAI/1B,UAAU/c,OAAS,GAA6B,kBAAjBm2C,EAClC,MAAM,IAAIrD,EAAW,6CAGtB,GAAmC,OAA/BgD,EAAM,cAAet9B,GACxB,MAAM,IAAIm6B,EAAa,sFAExB,IAAI2D,EAtDc,SAAsBv0C,GACxC,IAAIuiB,EAAQuxB,EAAU9zC,EAAQ,EAAG,GAC7BwiB,EAAOsxB,EAAU9zC,GAAS,GAC9B,GAAc,MAAVuiB,GAA0B,MAATC,EACpB,MAAM,IAAIouB,EAAa,kDACjB,GAAa,MAATpuB,GAA0B,MAAVD,EAC1B,MAAM,IAAIquB,EAAa,kDAExB,IAAI4D,EAAS,GAIb,OAHAX,EAAS7zC,EAAQi0C,GAAY,SAAU7M,EAAOjoC,EAAQs1C,EAAOC,GAC5DF,EAAOA,EAAOv2C,QAAUw2C,EAAQZ,EAASa,EAAWR,EAAc,MAAQ/0C,GAAUioC,CACrF,IACOoN,CACR,CAyCaG,CAAal+B,GACrBm+B,EAAoBL,EAAMt2C,OAAS,EAAIs2C,EAAM,GAAK,GAElDM,EAAYV,EAAiB,IAAMS,EAAoB,IAAKR,GAC5DU,EAAoBD,EAAUp+B,KAC9BtZ,EAAQ03C,EAAU13C,MAClB43C,GAAqB,EAErBV,EAAQQ,EAAUR,MAClBA,IACHO,EAAoBP,EAAM,GAC1BT,EAAaW,EAAOZ,EAAQ,CAAC,EAAG,GAAIU,KAGrC,IAAK,IAAItzC,EAAI,EAAGi0C,GAAQ,EAAMj0C,EAAIwzC,EAAMt2C,OAAQ8C,GAAK,EAAG,CACvD,IAAI6gC,EAAO2S,EAAMxzC,GACbwhB,EAAQuxB,EAAUlS,EAAM,EAAG,GAC3Bpf,EAAOsxB,EAAUlS,GAAO,GAC5B,IAEa,MAAVrf,GAA2B,MAAVA,GAA2B,MAAVA,GACtB,MAATC,GAAyB,MAATA,GAAyB,MAATA,IAElCD,IAAUC,EAEb,MAAM,IAAIouB,EAAa,wDASxB,GAPa,gBAAThP,GAA2BoT,IAC9BD,GAAqB,GAMlBrB,EAAOhC,EAFXoD,EAAoB,KADpBF,GAAqB,IAAMhT,GACmB,KAG7CzkC,EAAQu0C,EAAWoD,QACb,GAAa,MAAT33C,EAAe,CACzB,KAAMykC,KAAQzkC,GAAQ,CACrB,IAAKi3C,EACJ,MAAM,IAAIrD,EAAW,sBAAwBt6B,EAAO,+CAErD,MACD,CACA,GAAIy6B,GAAUnwC,EAAI,GAAMwzC,EAAMt2C,OAAQ,CACrC,IAAIwpC,EAAOyJ,EAAM/zC,EAAOykC,GAWvBzkC,GAVD63C,IAAUvN,IASG,QAASA,KAAU,kBAAmBA,EAAKvoB,KAC/CuoB,EAAKvoB,IAEL/hB,EAAMykC,EAEhB,MACCoT,EAAQtB,EAAOv2C,EAAOykC,GACtBzkC,EAAQA,EAAMykC,GAGXoT,IAAUD,IACbrD,EAAWoD,GAAqB33C,EAElC,CACD,CACA,OAAOA,CACR,0BCrVA,IAAI2qB,EAAO,EAAQ,KACf4oB,EAA+B,mBAAX33B,QAAkD,iBAAlBA,OAAO,OAE3Dk8B,EAAQr4C,OAAOK,UAAUwE,SACzB6d,EAASre,MAAMhE,UAAUqiB,OACzB41B,EAAqBt4C,OAAOqiB,eAM5Bk2B,EAAyB,EAAQ,IAAR,GAEzBC,EAAsBF,GAAsBC,EAE5Cl2B,EAAiB,SAAU4I,EAAQpR,EAAMtZ,EAAOk4C,GACnD,GAAI5+B,KAAQoR,EACX,IAAkB,IAAdwtB,GACH,GAAIxtB,EAAOpR,KAAUtZ,EACpB,YAEK,GAba,mBADK+pB,EAcFmuB,IAb8B,sBAAnBJ,EAAMp+B,KAAKqQ,KAaPmuB,IACrC,OAfc,IAAUnuB,EAkBtBkuB,EACHF,EAAmBrtB,EAAQpR,EAAM,CAChCnZ,cAAc,EACdF,YAAY,EACZD,MAAOA,EACPE,UAAU,IAGXwqB,EAAOpR,GAAQtZ,CAEjB,EAEIoiC,EAAmB,SAAU1X,EAAQiW,GACxC,IAAIwX,EAAat6B,UAAU/c,OAAS,EAAI+c,UAAU,GAAK,CAAC,EACpDu6B,EAAQztB,EAAKgW,GACb4S,IACH6E,EAAQj2B,EAAOzI,KAAK0+B,EAAO34C,OAAOo1B,sBAAsB8L,KAEzD,IAAK,IAAI/8B,EAAI,EAAGA,EAAIw0C,EAAMt3C,OAAQ8C,GAAK,EACtCke,EAAe4I,EAAQ0tB,EAAMx0C,GAAI+8B,EAAIyX,EAAMx0C,IAAKu0C,EAAWC,EAAMx0C,IAEnE,EAEAw+B,EAAiB6V,sBAAwBA,EAEzC54C,EAAOD,QAAUgjC,aCpDjB,IAAI9hC,EAAS,cACTg+B,EAAM,EAAQ,IA2ClBj/B,EAAOD,QAxCP,SAAyBi5C,EAAUC,EAAMC,EAASC,GAEhD,GADKl4C,EAAO6c,SAASk7B,KAAWA,EAAW/3C,EAAOS,KAAKs3C,EAAU,WAC7DC,IACGh4C,EAAO6c,SAASm7B,KAAOA,EAAOh4C,EAAOS,KAAKu3C,EAAM,WACjC,IAAhBA,EAAKx3C,QAAc,MAAM,IAAIkb,WAAW,4CAQ9C,IALA,IAAIy8B,EAASF,EAAU,EACnB73C,EAAMJ,EAAOU,MAAMy3C,GACnBC,EAAKp4C,EAAOU,MAAMw3C,GAAS,GAC3Bj/B,EAAMjZ,EAAOU,MAAM,GAEhBy3C,EAAS,GAAKD,EAAQ,GAAG,CAC9B,IAAInnB,EAAO,IAAIiN,EACfjN,EAAKoM,OAAOlkB,GACZ8X,EAAKoM,OAAO4a,GACRC,GAAMjnB,EAAKoM,OAAO6a,GACtB/+B,EAAM8X,EAAKwN,SAEX,IAAI8Z,EAAO,EAEX,GAAIF,EAAS,EAAG,CACd,IAAIG,EAAWl4C,EAAII,OAAS23C,EAC5BE,EAAOj1C,KAAKC,IAAI80C,EAAQl/B,EAAIzY,QAC5ByY,EAAI/T,KAAK9E,EAAKk4C,EAAU,EAAGD,GAC3BF,GAAUE,CACZ,CAEA,GAAIA,EAAOp/B,EAAIzY,QAAU03C,EAAQ,EAAG,CAClC,IAAIK,EAAUH,EAAG53C,OAAS03C,EACtB13C,EAAS4C,KAAKC,IAAI60C,EAAOj/B,EAAIzY,OAAS63C,GAC1Cp/B,EAAI/T,KAAKkzC,EAAIG,EAASF,EAAMA,EAAO73C,GACnC03C,GAAS13C,CACX,CACF,CAGA,OADAyY,EAAIlY,KAAK,GACF,CAAEX,IAAKA,EAAKg4C,GAAIA,EACzB,aC1CA,IAAII,EAAO,EAAQ,KACfC,EAAQ,EAAQ,KAChBC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,KAClBC,EAAS,EAAQ,KACjB54C,EAAS,aAGb,SAAS64C,EAAW94C,GAClB,IAAIg4C,EACkB,iBAAXh4C,GAAwBC,EAAO6c,SAAS9c,KACjDg4C,EAAWh4C,EAAO+4C,WAClB/4C,EAASA,EAAOK,KAEI,iBAAXL,IACTA,EAASC,EAAOS,KAAKV,IAGvB,IAIIu5B,EAASyf,EAJTC,EAAWN,EAAQ34C,EAAQg4C,GAE3B/6B,EAAOg8B,EAASC,IAChBh8B,EAAO+7B,EAAS/7B,KAEpB,OAAQD,GACN,IAAK,cACH+7B,EAAQP,EAAKU,YAAY5X,OAAOrkB,EAAM,OAAOk8B,eAAeC,qBAE9D,IAAK,aAKH,OAJKL,IACHA,EAAQP,EAAKa,UAAU/X,OAAOrkB,EAAM,QAEtCqc,EAAUyf,EAAMO,UAAUA,UAAUte,KAAK,MAEvC,IAAK,uBACH,OAAOwd,EAAKe,aAAajY,OAAOyX,EAAMS,iBAAiBv8B,KAAM,OAC/D,IAAK,oBAEH,OADA87B,EAAMU,kBAAoBV,EAAMS,iBACzB,CACLx8B,KAAM,KACNC,KAAM87B,GAEV,IAAK,oBAEH,OADAA,EAAMO,UAAUI,OAAOC,QAAUnB,EAAKoB,SAAStY,OAAOyX,EAAMS,iBAAiBv8B,KAAM,OAC5E,CACLD,KAAM,MACNC,KAAM87B,EAAMO,UAAUI,QAE1B,QAAS,MAAM,IAAIn4C,MAAM,kBAAoB+3B,GAGjD,IAAK,wBAEHrc,EAyCN,SAAkBA,EAAM86B,GACtB,IAAIC,EAAO/6B,EAAKq8B,UAAUO,QAAQC,IAAIC,UAAU/B,KAC5CgC,EAAQx6B,SAASvC,EAAKq8B,UAAUO,QAAQC,IAAIC,UAAUC,MAAMh2C,WAAY,IACxE25B,EAAO8a,EAAMx7B,EAAKq8B,UAAUO,QAAQI,OAAOtc,KAAK3C,KAAK,MACrDod,EAAKn7B,EAAKq8B,UAAUO,QAAQI,OAAO7B,GACnC8B,EAAaj9B,EAAKw8B,kBAClBU,EAAS36B,SAASme,EAAK3jB,MAAM,KAAK,GAAI,IAAM,EAC5C5Z,EAAMw4C,EAAOwB,WAAWrC,EAAUC,EAAMgC,EAAOG,EAAQ,QACvDF,EAAStB,EAAQ0B,iBAAiB1c,EAAMv9B,EAAKg4C,GAC7CvyC,EAAM,GAGV,OAFAA,EAAIia,KAAKm6B,EAAO9c,OAAO+c,IACvBr0C,EAAIia,KAAKm6B,EAAOnb,SACT9+B,EAAO6hB,OAAOhc,EACvB,CAtDag0C,CADP58B,EAAOu7B,EAAK8B,oBAAoBhZ,OAAOrkB,EAAM,OACxB86B,GAEvB,IAAK,cAGH,OADAze,GADAyf,EAAQP,EAAK+B,WAAWjZ,OAAOrkB,EAAM,QACrBq8B,UAAUA,UAAUte,KAAK,MAEvC,IAAK,uBACH,OAAOwd,EAAKgC,cAAclZ,OAAOyX,EAAMU,kBAAmB,OAC5D,IAAK,oBACH,MAAO,CACLzU,MAAO+T,EAAMO,UAAUtU,MACvByV,WAAYjC,EAAKkC,aAAapZ,OAAOyX,EAAMU,kBAAmB,OAAOgB,YAEzE,IAAK,oBAEH,OADA1B,EAAMO,UAAUI,OAAOiB,SAAWnC,EAAKoB,SAAStY,OAAOyX,EAAMU,kBAAmB,OACzE,CACLz8B,KAAM,MACN08B,OAAQX,EAAMO,UAAUI,QAE5B,QAAS,MAAM,IAAIn4C,MAAM,kBAAoB+3B,GAGjD,IAAK,iBACH,OAAOkf,EAAKe,aAAajY,OAAOrkB,EAAM,OACxC,IAAK,kBACH,OAAOu7B,EAAKgC,cAAclZ,OAAOrkB,EAAM,OACzC,IAAK,kBACH,MAAO,CACLD,KAAM,MACN08B,OAAQlB,EAAKoC,cAActZ,OAAOrkB,EAAM,QAE5C,IAAK,iBAEH,MAAO,CACL+nB,OAFF/nB,EAAOu7B,EAAKkC,aAAapZ,OAAOrkB,EAAM,QAExB49B,WAAWn7C,MACvB+6C,WAAYx9B,EAAKw9B,YAErB,QAAS,MAAM,IAAIl5C,MAAM,oBAAsByb,GAEnD,CArFAje,EAAOD,QAAU+5C,EAsFjBA,EAAUiC,UAAYtC,EAAKsC,kCC1F3B,IAAI3jB,EAAO,EAAQ,IACf4jB,EAAe,EAAQ,IAEvBC,EAASD,EAAa,8BACtBE,EAAQF,EAAa,6BACrBG,EAAgBH,EAAa,mBAAmB,IAAS5jB,EAAK/d,KAAK6hC,EAAOD,GAE1EvH,EAAQsH,EAAa,qCAAqC,GAC1DI,EAAkBJ,EAAa,2BAA2B,GAC1DK,EAAOL,EAAa,cAExB,GAAII,EACH,IACCA,EAAgB,CAAC,EAAG,IAAK,CAAEz7C,MAAO,GACnC,CAAE,MAAO2C,GAER84C,EAAkB,IACnB,CAGDp8C,EAAOD,QAAU,SAAkBu8C,GAClC,IAAIC,EAAOJ,EAAc/jB,EAAM8jB,EAAO19B,WAYtC,OAXIk2B,GAAS0H,GACD1H,EAAM6H,EAAM,UACdz7C,cAERs7C,EACCG,EACA,SACA,CAAE57C,MAAO,EAAI07C,EAAK,EAAGC,EAAiB76C,QAAU+c,UAAU/c,OAAS,MAI/D86C,CACR,EAEA,IAAIC,EAAY,WACf,OAAOL,EAAc/jB,EAAM6jB,EAAQz9B,UACpC,EAEI49B,EACHA,EAAgBp8C,EAAOD,QAAS,QAAS,CAAEY,MAAO67C,IAElDx8C,EAAOD,QAAQiiB,MAAQw6B,wBC1CxB,SAASC,EAAQnb,GACf,MAAMh5B,EAAM,CAAC,EAWb,OATAlI,OAAOkrB,KAAKgW,GAAK2I,SAAQ,SAAS5oC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMV,EAAQ2gC,EAAIjgC,GAClBiH,EAAI3H,GAASU,CACf,IAEOiH,CACT,CAEAvI,EAAQ28C,SAAW,CACjB,EAAG,YACH,EAAG,cACH,EAAG,UACH,EAAG,WAEL38C,EAAQ48C,eAAiBF,EAAQ18C,EAAQ28C,UAEzC38C,EAAQm6C,IAAM,CACZ,EAAM,MACN,EAAM,OACN,EAAM,MACN,EAAM,SACN,EAAM,SACN,EAAM,QACN,EAAM,QACN,EAAM,UACN,EAAM,WACN,EAAM,OACN,GAAM,OACN,GAAM,QACN,GAAM,UACN,GAAM,cACN,GAAM,MACN,GAAM,MACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,UACN,GAAM,UACN,GAAM,WACN,GAAM,YACN,GAAM,SACN,GAAM,SACN,GAAM,UACN,GAAM,UAERn6C,EAAQ68C,UAAYH,EAAQ18C,EAAQm6C,6BCxDpCl6C,EAAOD,QAAU88C,EAEjB,IAEIC,EAFAhyB,EAAY,EAAQ,GAIpBuF,EAAYvF,EAAKuF,SACjBjU,EAAY0O,EAAK1O,OACjB+T,EAAYrF,EAAKqF,KAWrB,SAAS4sB,EAAGryB,EAAItmB,EAAK9B,GAMjBS,KAAK2nB,GAAKA,EAMV3nB,KAAKqB,IAAMA,EAMXrB,KAAKyY,UAAOrZ,EAMZY,KAAKT,IAAMA,CACf,CAGA,SAAS06C,IAAQ,CAUjB,SAASC,EAAMC,GAMXn6C,KAAKo6C,KAAOD,EAAOC,KAMnBp6C,KAAKq6C,KAAOF,EAAOE,KAMnBr6C,KAAKqB,IAAM84C,EAAO94C,IAMlBrB,KAAKyY,KAAO0hC,EAAOG,MACvB,CAOA,SAASR,IAML95C,KAAKqB,IAAM,EAMXrB,KAAKo6C,KAAO,IAAIJ,EAAGC,EAAM,EAAG,GAM5Bj6C,KAAKq6C,KAAOr6C,KAAKo6C,KAMjBp6C,KAAKs6C,OAAS,IAOlB,CA8CA,SAASC,EAAUh7C,EAAKJ,EAAK8gB,GACzB9gB,EAAI8gB,GAAa,IAAN1gB,CACf,CAmBA,SAASi7C,EAASn5C,EAAK9B,GACnBS,KAAKqB,IAAMA,EACXrB,KAAKyY,UAAOrZ,EACZY,KAAKT,IAAMA,CACf,CA6CA,SAASk7C,EAAcl7C,EAAKJ,EAAK8gB,GAC7B,KAAO1gB,EAAIyG,IACP7G,EAAI8gB,KAAkB,IAAT1gB,EAAI2E,GAAW,IAC5B3E,EAAI2E,IAAM3E,EAAI2E,KAAO,EAAI3E,EAAIyG,IAAM,MAAQ,EAC3CzG,EAAIyG,MAAQ,EAEhB,KAAOzG,EAAI2E,GAAK,KACZ/E,EAAI8gB,KAAkB,IAAT1gB,EAAI2E,GAAW,IAC5B3E,EAAI2E,GAAK3E,EAAI2E,KAAO,EAExB/E,EAAI8gB,KAAS1gB,EAAI2E,EACrB,CA0CA,SAASw2C,EAAan7C,EAAKJ,EAAK8gB,GAC5B9gB,EAAI8gB,GAA0B,IAAd1gB,EAChBJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,EAAM,IAC9BJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,GAAM,IAC9BJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,EAC5B,CAvKAu6C,EAAOx8C,OAASyqB,EAAK7pB,OACf,WACE,OAAQ47C,EAAOx8C,OAAS,WACpB,OAAO,IAAIy8C,CACf,IACJ,EAEE,WACE,OAAO,IAAID,CACf,EAOJA,EAAOl7C,MAAQ,SAAeI,GAC1B,OAAO,IAAI+oB,EAAKrmB,MAAM1C,EAC1B,EAII+oB,EAAKrmB,QAAUA,QACfo4C,EAAOl7C,MAAQmpB,EAAKsF,KAAKysB,EAAOl7C,MAAOmpB,EAAKrmB,MAAMhE,UAAUqkB,WAUhE+3B,EAAOp8C,UAAUi9C,MAAQ,SAAchzB,EAAItmB,EAAK9B,GAG5C,OAFAS,KAAKq6C,KAAOr6C,KAAKq6C,KAAK5hC,KAAO,IAAIuhC,EAAGryB,EAAItmB,EAAK9B,GAC7CS,KAAKqB,KAAOA,EACLrB,IACX,EA6BAw6C,EAAS98C,UAAYL,OAAOC,OAAO08C,EAAGt8C,WACtC88C,EAAS98C,UAAUiqB,GAxBnB,SAAuBpoB,EAAKJ,EAAK8gB,GAC7B,KAAO1gB,EAAM,KACTJ,EAAI8gB,KAAe,IAAN1gB,EAAY,IACzBA,KAAS,EAEbJ,EAAI8gB,GAAO1gB,CACf,EAyBAu6C,EAAOp8C,UAAUk9C,OAAS,SAAsBh9C,GAW5C,OARAoC,KAAKqB,MAAQrB,KAAKq6C,KAAOr6C,KAAKq6C,KAAK5hC,KAAO,IAAI+hC,GACzC58C,KAAkB,GACT,IAAY,EACpBA,EAAQ,MAAY,EACpBA,EAAQ,QAAY,EACpBA,EAAQ,UAAY,EACA,EAC1BA,IAAQyD,IACDrB,IACX,EAQA85C,EAAOp8C,UAAUm9C,MAAQ,SAAqBj9C,GAC1C,OAAOA,EAAQ,EACToC,KAAK26C,MAAMF,EAAe,GAAIntB,EAASiS,WAAW3hC,IAClDoC,KAAK46C,OAAOh9C,EACtB,EAOAk8C,EAAOp8C,UAAUo9C,OAAS,SAAsBl9C,GAC5C,OAAOoC,KAAK46C,QAAQh9C,GAAS,EAAIA,GAAS,MAAQ,EACtD,EAqBAk8C,EAAOp8C,UAAUq9C,OAAS,SAAsBn9C,GAC5C,IAAImT,EAAOuc,EAAS3uB,KAAKf,GACzB,OAAOoC,KAAK26C,MAAMF,EAAe1pC,EAAKrS,SAAUqS,EACpD,EASA+oC,EAAOp8C,UAAUs9C,MAAQlB,EAAOp8C,UAAUq9C,OAQ1CjB,EAAOp8C,UAAUu9C,OAAS,SAAsBr9C,GAC5C,IAAImT,EAAOuc,EAAS3uB,KAAKf,GAAOs9C,WAChC,OAAOl7C,KAAK26C,MAAMF,EAAe1pC,EAAKrS,SAAUqS,EACpD,EAOA+oC,EAAOp8C,UAAUy9C,KAAO,SAAoBv9C,GACxC,OAAOoC,KAAK26C,MAAMJ,EAAW,EAAG38C,EAAQ,EAAI,EAChD,EAcAk8C,EAAOp8C,UAAU09C,QAAU,SAAuBx9C,GAC9C,OAAOoC,KAAK26C,MAAMD,EAAc,EAAG98C,IAAU,EACjD,EAQAk8C,EAAOp8C,UAAU29C,SAAWvB,EAAOp8C,UAAU09C,QAQ7CtB,EAAOp8C,UAAU49C,QAAU,SAAuB19C,GAC9C,IAAImT,EAAOuc,EAAS3uB,KAAKf,GACzB,OAAOoC,KAAK26C,MAAMD,EAAc,EAAG3pC,EAAK7M,IAAIy2C,MAAMD,EAAc,EAAG3pC,EAAK/K,GAC5E,EASA8zC,EAAOp8C,UAAU69C,SAAWzB,EAAOp8C,UAAU49C,QAQ7CxB,EAAOp8C,UAAUyvB,MAAQ,SAAqBvvB,GAC1C,OAAOoC,KAAK26C,MAAM5yB,EAAKoF,MAAMxH,aAAc,EAAG/nB,EAClD,EAQAk8C,EAAOp8C,UAAU89C,OAAS,SAAsB59C,GAC5C,OAAOoC,KAAK26C,MAAM5yB,EAAKoF,MAAMtH,cAAe,EAAGjoB,EACnD,EAEA,IAAI69C,EAAa1zB,EAAKrmB,MAAMhE,UAAUwiB,IAChC,SAAwB3gB,EAAKJ,EAAK8gB,GAChC9gB,EAAI+gB,IAAI3gB,EAAK0gB,EACjB,EAEE,SAAwB1gB,EAAKJ,EAAK8gB,GAChC,IAAK,IAAIze,EAAI,EAAGA,EAAIjC,EAAIb,SAAU8C,EAC9BrC,EAAI8gB,EAAMze,GAAKjC,EAAIiC,EAC3B,EAOJs4C,EAAOp8C,UAAUwjB,MAAQ,SAAqBtjB,GAC1C,IAAIyD,EAAMzD,EAAMc,SAAW,EAC3B,IAAK2C,EACD,OAAOrB,KAAK26C,MAAMJ,EAAW,EAAG,GACpC,GAAIxyB,EAAKwE,SAAS3uB,GAAQ,CACtB,IAAIuB,EAAM26C,EAAOl7C,MAAMyC,EAAMgY,EAAO3a,OAAOd,IAC3Cyb,EAAOmmB,OAAO5hC,EAAOuB,EAAK,GAC1BvB,EAAQuB,CACZ,CACA,OAAOa,KAAK46C,OAAOv5C,GAAKs5C,MAAMc,EAAYp6C,EAAKzD,EACnD,EAOAk8C,EAAOp8C,UAAU+C,OAAS,SAAsB7C,GAC5C,IAAIyD,EAAM+rB,EAAK1uB,OAAOd,GACtB,OAAOyD,EACDrB,KAAK46C,OAAOv5C,GAAKs5C,MAAMvtB,EAAKnT,MAAO5Y,EAAKzD,GACxCoC,KAAK26C,MAAMJ,EAAW,EAAG,EACnC,EAOAT,EAAOp8C,UAAUg+C,KAAO,WAIpB,OAHA17C,KAAKs6C,OAAS,IAAIJ,EAAMl6C,MACxBA,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,IAAIL,EAAGC,EAAM,EAAG,GACxCj6C,KAAKqB,IAAM,EACJrB,IACX,EAMA85C,EAAOp8C,UAAUu8B,MAAQ,WAUrB,OATIj6B,KAAKs6C,QACLt6C,KAAKo6C,KAASp6C,KAAKs6C,OAAOF,KAC1Bp6C,KAAKq6C,KAASr6C,KAAKs6C,OAAOD,KAC1Br6C,KAAKqB,IAASrB,KAAKs6C,OAAOj5C,IAC1BrB,KAAKs6C,OAASt6C,KAAKs6C,OAAO7hC,OAE1BzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,IAAIL,EAAGC,EAAM,EAAG,GACxCj6C,KAAKqB,IAAO,GAETrB,IACX,EAMA85C,EAAOp8C,UAAUi+C,OAAS,WACtB,IAAIvB,EAAOp6C,KAAKo6C,KACZC,EAAOr6C,KAAKq6C,KACZh5C,EAAOrB,KAAKqB,IAOhB,OANArB,KAAKi6B,QAAQ2gB,OAAOv5C,GAChBA,IACArB,KAAKq6C,KAAK5hC,KAAO2hC,EAAK3hC,KACtBzY,KAAKq6C,KAAOA,EACZr6C,KAAKqB,KAAOA,GAETrB,IACX,EAMA85C,EAAOp8C,UAAUk+C,OAAS,WAItB,IAHA,IAAIxB,EAAOp6C,KAAKo6C,KAAK3hC,KACjBtZ,EAAOa,KAAKrC,YAAYiB,MAAMoB,KAAKqB,KACnC4e,EAAO,EACJm6B,GACHA,EAAKzyB,GAAGyyB,EAAK76C,IAAKJ,EAAK8gB,GACvBA,GAAOm6B,EAAK/4C,IACZ+4C,EAAOA,EAAK3hC,KAGhB,OAAOtZ,CACX,EAEA26C,EAAOjqB,WAAa,SAASgsB,GACzB9B,EAAe8B,CACnB,0BCzcA5+C,EAAOD,QAAU8+C,EAEjB,IAEIC,EAFAh0B,EAAY,EAAQ,GAIpBuF,EAAYvF,EAAKuF,SACjBF,EAAYrF,EAAKqF,KAGrB,SAAS4uB,EAAgBC,EAAQC,GAC7B,OAAOtiC,WAAW,uBAAyBqiC,EAAOh8B,IAAM,OAASi8B,GAAe,GAAK,MAAQD,EAAO56C,IACxG,CAQA,SAASy6C,EAAO79C,GAMZ+B,KAAKb,IAAMlB,EAMX+B,KAAKigB,IAAM,EAMXjgB,KAAKqB,IAAMpD,EAAOS,MACtB,CAEA,IAwCQd,EAxCJu+C,EAAqC,oBAAftiC,WACpB,SAA4B5b,GAC1B,GAAIA,aAAkB4b,YAAcnY,MAAMC,QAAQ1D,GAC9C,OAAO,IAAI69C,EAAO79C,GACtB,MAAMwB,MAAM,iBAChB,EAEE,SAAsBxB,GACpB,GAAIyD,MAAMC,QAAQ1D,GACd,OAAO,IAAI69C,EAAO79C,GACtB,MAAMwB,MAAM,iBAChB,EAiEJ,SAAS28C,IAEL,IAAIrrC,EAAO,IAAIuc,EAAS,EAAG,GACvB9rB,EAAI,EACR,KAAIxB,KAAKqB,IAAMrB,KAAKigB,IAAM,GAanB,CACH,KAAOze,EAAI,IAAKA,EAAG,CAEf,GAAIxB,KAAKigB,KAAOjgB,KAAKqB,IACjB,MAAM26C,EAAgBh8C,MAG1B,GADA+Q,EAAK7M,IAAM6M,EAAK7M,IAA2B,IAArBlE,KAAKb,IAAIa,KAAKigB,OAAmB,EAAJze,KAAW,EAC1DxB,KAAKb,IAAIa,KAAKigB,OAAS,IACvB,OAAOlP,CACf,CAGA,OADAA,EAAK7M,IAAM6M,EAAK7M,IAA6B,IAAvBlE,KAAKb,IAAIa,KAAKigB,SAAqB,EAAJze,KAAW,EACzDuP,CACX,CAzBI,KAAOvP,EAAI,IAAKA,EAGZ,GADAuP,EAAK7M,IAAM6M,EAAK7M,IAA2B,IAArBlE,KAAKb,IAAIa,KAAKigB,OAAmB,EAAJze,KAAW,EAC1DxB,KAAKb,IAAIa,KAAKigB,OAAS,IACvB,OAAOlP,EAKf,GAFAA,EAAK7M,IAAM6M,EAAK7M,IAA2B,IAArBlE,KAAKb,IAAIa,KAAKigB,OAAe,MAAQ,EAC3DlP,EAAK/K,IAAM+K,EAAK/K,IAA2B,IAArBhG,KAAKb,IAAIa,KAAKigB,OAAgB,KAAO,EACvDjgB,KAAKb,IAAIa,KAAKigB,OAAS,IACvB,OAAOlP,EAgBf,GAfIvP,EAAI,EAeJxB,KAAKqB,IAAMrB,KAAKigB,IAAM,GACtB,KAAOze,EAAI,IAAKA,EAGZ,GADAuP,EAAK/K,IAAM+K,EAAK/K,IAA2B,IAArBhG,KAAKb,IAAIa,KAAKigB,OAAmB,EAAJze,EAAQ,KAAO,EAC9DxB,KAAKb,IAAIa,KAAKigB,OAAS,IACvB,OAAOlP,OAGf,KAAOvP,EAAI,IAAKA,EAAG,CAEf,GAAIxB,KAAKigB,KAAOjgB,KAAKqB,IACjB,MAAM26C,EAAgBh8C,MAG1B,GADA+Q,EAAK/K,IAAM+K,EAAK/K,IAA2B,IAArBhG,KAAKb,IAAIa,KAAKigB,OAAmB,EAAJze,EAAQ,KAAO,EAC9DxB,KAAKb,IAAIa,KAAKigB,OAAS,IACvB,OAAOlP,CACf,CAGJ,MAAMtR,MAAM,0BAChB,CAiCA,SAAS48C,EAAgBl9C,EAAKgC,GAC1B,OAAQhC,EAAIgC,EAAM,GACVhC,EAAIgC,EAAM,IAAM,EAChBhC,EAAIgC,EAAM,IAAM,GAChBhC,EAAIgC,EAAM,IAAM,MAAQ,CACpC,CA8BA,SAASm7C,IAGL,GAAIt8C,KAAKigB,IAAM,EAAIjgB,KAAKqB,IACpB,MAAM26C,EAAgBh8C,KAAM,GAEhC,OAAO,IAAIstB,EAAS+uB,EAAgBr8C,KAAKb,IAAKa,KAAKigB,KAAO,GAAIo8B,EAAgBr8C,KAAKb,IAAKa,KAAKigB,KAAO,GACxG,CAtLA67B,EAAOx+C,OAASyqB,EAAK7pB,OACf,SAA6BD,GAC3B,OAAQ69C,EAAOx+C,OAAS,SAAuBW,GAC3C,OAAO8pB,EAAK7pB,OAAO6c,SAAS9c,GACtB,IAAI89C,EAAa99C,GAEjBk+C,EAAal+C,EACvB,GAAGA,EACP,EAEEk+C,EAENL,EAAOp+C,UAAU6+C,OAASx0B,EAAKrmB,MAAMhE,UAAUqkB,UAAuCgG,EAAKrmB,MAAMhE,UAAUwc,MAO3G4hC,EAAOp+C,UAAUk9C,QACTh9C,EAAQ,WACL,WACuD,GAA1DA,GAAuC,IAArBoC,KAAKb,IAAIa,KAAKigB,QAAuB,EAAOjgB,KAAKb,IAAIa,KAAKigB,OAAS,IAAK,OAAOriB,EACvC,GAA1DA,GAASA,GAA8B,IAArBoC,KAAKb,IAAIa,KAAKigB,OAAgB,KAAO,EAAOjgB,KAAKb,IAAIa,KAAKigB,OAAS,IAAK,OAAOriB,EACvC,GAA1DA,GAASA,GAA8B,IAArBoC,KAAKb,IAAIa,KAAKigB,OAAe,MAAQ,EAAOjgB,KAAKb,IAAIa,KAAKigB,OAAS,IAAK,OAAOriB,EACvC,GAA1DA,GAASA,GAA8B,IAArBoC,KAAKb,IAAIa,KAAKigB,OAAe,MAAQ,EAAOjgB,KAAKb,IAAIa,KAAKigB,OAAS,IAAK,OAAOriB,EACvC,GAA1DA,GAASA,GAA+B,GAAtBoC,KAAKb,IAAIa,KAAKigB,OAAe,MAAQ,EAAOjgB,KAAKb,IAAIa,KAAKigB,OAAS,IAAK,OAAOriB,EAGjG,IAAKoC,KAAKigB,KAAO,GAAKjgB,KAAKqB,IAEvB,MADArB,KAAKigB,IAAMjgB,KAAKqB,IACV26C,EAAgBh8C,KAAM,IAEhC,OAAOpC,CACX,GAOJk+C,EAAOp+C,UAAUm9C,MAAQ,WACrB,OAAuB,EAAhB76C,KAAK46C,QAChB,EAMAkB,EAAOp+C,UAAUo9C,OAAS,WACtB,IAAIl9C,EAAQoC,KAAK46C,SACjB,OAAOh9C,IAAU,IAAc,EAARA,GAAa,CACxC,EAoFAk+C,EAAOp+C,UAAUy9C,KAAO,WACpB,OAAyB,IAAlBn7C,KAAK46C,QAChB,EAaAkB,EAAOp+C,UAAU09C,QAAU,WAGvB,GAAIp7C,KAAKigB,IAAM,EAAIjgB,KAAKqB,IACpB,MAAM26C,EAAgBh8C,KAAM,GAEhC,OAAOq8C,EAAgBr8C,KAAKb,IAAKa,KAAKigB,KAAO,EACjD,EAMA67B,EAAOp+C,UAAU29C,SAAW,WAGxB,GAAIr7C,KAAKigB,IAAM,EAAIjgB,KAAKqB,IACpB,MAAM26C,EAAgBh8C,KAAM,GAEhC,OAAkD,EAA3Cq8C,EAAgBr8C,KAAKb,IAAKa,KAAKigB,KAAO,EACjD,EAkCA67B,EAAOp+C,UAAUyvB,MAAQ,WAGrB,GAAIntB,KAAKigB,IAAM,EAAIjgB,KAAKqB,IACpB,MAAM26C,EAAgBh8C,KAAM,GAEhC,IAAIpC,EAAQmqB,EAAKoF,MAAMtJ,YAAY7jB,KAAKb,IAAKa,KAAKigB,KAElD,OADAjgB,KAAKigB,KAAO,EACLriB,CACX,EAOAk+C,EAAOp+C,UAAU89C,OAAS,WAGtB,GAAIx7C,KAAKigB,IAAM,EAAIjgB,KAAKqB,IACpB,MAAM26C,EAAgBh8C,KAAM,GAEhC,IAAIpC,EAAQmqB,EAAKoF,MAAMpJ,aAAa/jB,KAAKb,IAAKa,KAAKigB,KAEnD,OADAjgB,KAAKigB,KAAO,EACLriB,CACX,EAMAk+C,EAAOp+C,UAAUwjB,MAAQ,WACrB,IAAIxiB,EAASsB,KAAK46C,SACd15C,EAASlB,KAAKigB,IACd9e,EAASnB,KAAKigB,IAAMvhB,EAGxB,GAAIyC,EAAMnB,KAAKqB,IACX,MAAM26C,EAAgBh8C,KAAMtB,GAGhC,OADAsB,KAAKigB,KAAOvhB,EACRgD,MAAMC,QAAQ3B,KAAKb,KACZa,KAAKb,IAAI+a,MAAMhZ,EAAOC,GAC1BD,IAAUC,EACX,IAAInB,KAAKb,IAAIxB,YAAY,GACzBqC,KAAKu8C,OAAOjlC,KAAKtX,KAAKb,IAAK+B,EAAOC,EAC5C,EAMA26C,EAAOp+C,UAAU+C,OAAS,WACtB,IAAIygB,EAAQlhB,KAAKkhB,QACjB,OAAOkM,EAAKpQ,KAAKkE,EAAO,EAAGA,EAAMxiB,OACrC,EAOAo9C,EAAOp+C,UAAU8+C,KAAO,SAAc99C,GAClC,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIsB,KAAKigB,IAAMvhB,EAASsB,KAAKqB,IACzB,MAAM26C,EAAgBh8C,KAAMtB,GAChCsB,KAAKigB,KAAOvhB,CAChB,MACI,GAEI,GAAIsB,KAAKigB,KAAOjgB,KAAKqB,IACjB,MAAM26C,EAAgBh8C,YACE,IAAvBA,KAAKb,IAAIa,KAAKigB,QAE3B,OAAOjgB,IACX,EAOA87C,EAAOp+C,UAAU++C,SAAW,SAASC,GACjC,OAAQA,GACJ,KAAK,EACD18C,KAAKw8C,OACL,MACJ,KAAK,EACDx8C,KAAKw8C,KAAK,GACV,MACJ,KAAK,EACDx8C,KAAKw8C,KAAKx8C,KAAK46C,UACf,MACJ,KAAK,EACD,KAA0C,IAAlC8B,EAA2B,EAAhB18C,KAAK46C,WACpB56C,KAAKy8C,SAASC,GAElB,MACJ,KAAK,EACD18C,KAAKw8C,KAAK,GACV,MAGJ,QACI,MAAM/8C,MAAM,qBAAuBi9C,EAAW,cAAgB18C,KAAKigB,KAE3E,OAAOjgB,IACX,EAEA87C,EAAOjsB,WAAa,SAAS8sB,GACzBZ,EAAeY,EAEf,IAAIh1B,EAAKI,EAAKyG,KAAO,SAAsC,WAC3DzG,EAAK4E,MAAMmvB,EAAOp+C,UAAW,CAEzBs9C,MAAO,WACH,OAAOoB,EAAe9kC,KAAKtX,MAAM2nB,IAAI,EACzC,EAEAozB,OAAQ,WACJ,OAAOqB,EAAe9kC,KAAKtX,MAAM2nB,IAAI,EACzC,EAEAszB,OAAQ,WACJ,OAAOmB,EAAe9kC,KAAKtX,MAAM48C,WAAWj1B,IAAI,EACpD,EAEA2zB,QAAS,WACL,OAAOgB,EAAYhlC,KAAKtX,MAAM2nB,IAAI,EACtC,EAEA4zB,SAAU,WACN,OAAOe,EAAYhlC,KAAKtX,MAAM2nB,IAAI,EACtC,GAGR,0BCnZA1qB,EAAOD,QAAU6qB,EAGjB,IAAI8D,EAAY,EAAQ,MACtB9D,EAAKnqB,UAAYL,OAAOC,OAAOquB,EAAUjuB,YAAYC,YAAckqB,GAAM6D,UAAY,OAEvF,IAAI5D,EAAY,EAAQ,GACpB4kB,EAAY,EAAQ,IACpB1O,EAAY,EAAQ,IACpB6e,EAAY,EAAQ,IACpBrb,EAAY,EAAQ,IACpBsb,EAAY,EAAQ,IACpBhB,EAAY,EAAQ,IACpBhC,EAAY,EAAQ,IACpB/xB,EAAY,EAAQ,GACpBoQ,EAAY,EAAQ,IACpB4kB,EAAY,EAAQ,IACpBC,EAAY,EAAQ,IACpBC,EAAY,EAAQ,IACpBC,EAAY,EAAQ,IAUxB,SAASr1B,EAAK3Q,EAAM2U,GAChBF,EAAUrU,KAAKtX,KAAMkX,EAAM2U,GAM3B7rB,KAAKkiC,OAAS,CAAC,EAMfliC,KAAKm9C,YAAS/9C,EAMdY,KAAKo9C,gBAAah+C,EAMlBY,KAAKisB,cAAW7sB,EAMhBY,KAAKq9C,WAAQj+C,EAObY,KAAKs9C,YAAc,KAOnBt9C,KAAKu9C,aAAe,KAOpBv9C,KAAKw9C,aAAe,KAOpBx9C,KAAKy9C,MAAQ,IACjB,CAyHA,SAAS7b,EAAW1mB,GAKhB,OAJAA,EAAKoiC,YAAcpiC,EAAKqiC,aAAeriC,EAAKsiC,aAAe,YACpDtiC,EAAKoP,cACLpP,EAAKskB,cACLtkB,EAAKwiC,OACLxiC,CACX,CA7HA7d,OAAO2iC,iBAAiBnY,EAAKnqB,UAAW,CAQpCigD,WAAY,CACRh+B,IAAK,WAGD,GAAI3f,KAAKs9C,YACL,OAAOt9C,KAAKs9C,YAEhBt9C,KAAKs9C,YAAc,CAAC,EACpB,IAAK,IAAIrb,EAAQ5kC,OAAOkrB,KAAKvoB,KAAKkiC,QAAS1gC,EAAI,EAAGA,EAAIygC,EAAMvjC,SAAU8C,EAAG,CACrE,IAAIsrC,EAAQ9sC,KAAKkiC,OAAOD,EAAMzgC,IAC1BgoB,EAAKsjB,EAAMtjB,GAGf,GAAIxpB,KAAKs9C,YAAY9zB,GACjB,MAAM/pB,MAAM,gBAAkB+pB,EAAK,OAASxpB,MAEhDA,KAAKs9C,YAAY9zB,GAAMsjB,CAC3B,CACA,OAAO9sC,KAAKs9C,WAChB,GASJ1Q,YAAa,CACTjtB,IAAK,WACD,OAAO3f,KAAKu9C,eAAiBv9C,KAAKu9C,aAAex1B,EAAKzlB,QAAQtC,KAAKkiC,QACvE,GASJ0b,YAAa,CACTj+B,IAAK,WACD,OAAO3f,KAAKw9C,eAAiBx9C,KAAKw9C,aAAez1B,EAAKzlB,QAAQtC,KAAKm9C,QACvE,GASJ5/C,KAAM,CACFoiB,IAAK,WACD,OAAO3f,KAAKy9C,QAAUz9C,KAAKzC,KAAOsqB,EAAKg2B,oBAAoB79C,KAAzB6nB,GACtC,EACA3H,IAAK,SAAS3iB,GAGV,IAAIG,EAAYH,EAAKG,UACfA,aAAqBo/C,KACtBv/C,EAAKG,UAAY,IAAIo/C,GAAWn/C,YAAcJ,EAC/CwqB,EAAK4E,MAAMpvB,EAAKG,UAAWA,IAI/BH,EAAKosB,MAAQpsB,EAAKG,UAAUisB,MAAQ3pB,KAGpC+nB,EAAK4E,MAAMpvB,EAAMu/C,GAAS,GAE1B98C,KAAKy9C,MAAQlgD,EAIb,IADA,IAAIiE,EAAI,EACDA,EAAsBxB,KAAK4sC,YAAYluC,SAAU8C,EACpDxB,KAAKu9C,aAAa/7C,GAAGyxB,UAGzB,IAAI6qB,EAAiB,CAAC,EACtB,IAAKt8C,EAAI,EAAGA,EAAsBxB,KAAK49C,YAAYl/C,SAAU8C,EACzDs8C,EAAe99C,KAAKw9C,aAAah8C,GAAGyxB,UAAU/b,MAAQ,CAClDyI,IAAKoI,EAAKwH,YAAYvvB,KAAKw9C,aAAah8C,GAAGmrC,OAC3CzsB,IAAK6H,EAAK2H,YAAY1vB,KAAKw9C,aAAah8C,GAAGmrC,QAE/CnrC,GACAnE,OAAO2iC,iBAAiBziC,EAAKG,UAAWogD,EAChD,KASRj2B,EAAKg2B,oBAAsB,SAA6BE,GAIpD,IAFA,IAEgBjR,EAFZmH,EAAMlsB,EAAKE,QAAQ,CAAC,KAAM81B,EAAM7mC,MAE3B1V,EAAI,EAAUA,EAAIu8C,EAAMnR,YAAYluC,SAAU8C,GAC9CsrC,EAAQiR,EAAMR,aAAa/7C,IAAI+8B,IAAK0V,EACpC,YAAalsB,EAAKc,SAASikB,EAAM51B,OAC7B41B,EAAMxO,UAAU2V,EACpB,YAAalsB,EAAKc,SAASikB,EAAM51B,OAC1C,OAAO+8B,EACN,wEADMA,CAEF,uBAET,EA2BApsB,EAAKqE,SAAW,SAAkBhV,EAAMiV,GACpC,IAAIjR,EAAO,IAAI2M,EAAK3Q,EAAMiV,EAAKN,SAC/B3Q,EAAKkiC,WAAajxB,EAAKixB,WACvBliC,EAAK+Q,SAAWE,EAAKF,SAGrB,IAFA,IAAIgW,EAAQ5kC,OAAOkrB,KAAK4D,EAAK+V,QACzB1gC,EAAI,EACDA,EAAIygC,EAAMvjC,SAAU8C,EACvB0Z,EAAKlT,UAC0C,IAAlCmkB,EAAK+V,OAAOD,EAAMzgC,IAAIw8C,QAC7BnB,EAAS3wB,SACT8R,EAAM9R,UAAW+V,EAAMzgC,GAAI2qB,EAAK+V,OAAOD,EAAMzgC,MAEvD,GAAI2qB,EAAKgxB,OACL,IAAKlb,EAAQ5kC,OAAOkrB,KAAK4D,EAAKgxB,QAAS37C,EAAI,EAAGA,EAAIygC,EAAMvjC,SAAU8C,EAC9D0Z,EAAKlT,IAAI0kC,EAAMxgB,SAAS+V,EAAMzgC,GAAI2qB,EAAKgxB,OAAOlb,EAAMzgC,MAC5D,GAAI2qB,EAAKuV,OACL,IAAKO,EAAQ5kC,OAAOkrB,KAAK4D,EAAKuV,QAASlgC,EAAI,EAAGA,EAAIygC,EAAMvjC,SAAU8C,EAAG,CACjE,IAAIkgC,EAASvV,EAAKuV,OAAOO,EAAMzgC,IAC/B0Z,EAAKlT,UACe5I,IAAdsiC,EAAOlY,GACPwU,EAAM9R,cACY9sB,IAAlBsiC,EAAOQ,OACPra,EAAKqE,cACa9sB,IAAlBsiC,EAAO9V,OACP9D,EAAKoE,cACc9sB,IAAnBsiC,EAAOS,QACPX,EAAQtV,SACRP,EAAUO,UAAW+V,EAAMzgC,GAAIkgC,GAEzC,CASJ,OARIvV,EAAKixB,YAAcjxB,EAAKixB,WAAW1+C,SACnCwc,EAAKkiC,WAAajxB,EAAKixB,YACvBjxB,EAAKF,UAAYE,EAAKF,SAASvtB,SAC/Bwc,EAAK+Q,SAAWE,EAAKF,UACrBE,EAAKkxB,QACLniC,EAAKmiC,OAAQ,GACblxB,EAAKL,UACL5Q,EAAK4Q,QAAUK,EAAKL,SACjB5Q,CACX,EAOA2M,EAAKnqB,UAAUsH,OAAS,SAAgBonB,GACpC,IAAI6xB,EAAYtyB,EAAUjuB,UAAUsH,OAAOsS,KAAKtX,KAAMosB,GAClDC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,UAAey1B,GAAaA,EAAUpyB,cAAWzsB,EACjD,SAAeusB,EAAU8V,YAAYzhC,KAAK49C,YAAaxxB,GACvD,SAAeT,EAAU8V,YAAYzhC,KAAK4sC,YAAYsR,QAAO,SAASpjC,GAAO,OAAQA,EAAIgkB,cAAgB,IAAI1S,IAAkB,CAAC,EAChI,aAAepsB,KAAKo9C,YAAcp9C,KAAKo9C,WAAW1+C,OAASsB,KAAKo9C,gBAAah+C,EAC7E,WAAeY,KAAKisB,UAAYjsB,KAAKisB,SAASvtB,OAASsB,KAAKisB,cAAW7sB,EACvE,QAAeY,KAAKq9C,YAASj+C,EAC7B,SAAe6+C,GAAaA,EAAUvc,aAAUtiC,EAChD,UAAeitB,EAAersB,KAAK8rB,aAAU1sB,GAErD,EAKAyoB,EAAKnqB,UAAU4kC,WAAa,WAExB,IADA,IAAIJ,EAASliC,KAAK4sC,YAAaprC,EAAI,EAC5BA,EAAI0gC,EAAOxjC,QACdwjC,EAAO1gC,KAAKyxB,UAChB,IAAIkqB,EAASn9C,KAAK49C,YAClB,IAD+Bp8C,EAAI,EAC5BA,EAAI27C,EAAOz+C,QACdy+C,EAAO37C,KAAKyxB,UAChB,OAAOtH,EAAUjuB,UAAU4kC,WAAWhrB,KAAKtX,KAC/C,EAKA6nB,EAAKnqB,UAAUiiB,IAAM,SAAazI,GAC9B,OAAOlX,KAAKkiC,OAAOhrB,IACZlX,KAAKm9C,QAAUn9C,KAAKm9C,OAAOjmC,IAC3BlX,KAAK0hC,QAAU1hC,KAAK0hC,OAAOxqB,IAC3B,IACX,EASA2Q,EAAKnqB,UAAUsK,IAAM,SAAasgB,GAE9B,GAAItoB,KAAK2f,IAAI2I,EAAOpR,MAChB,MAAMzX,MAAM,mBAAqB6oB,EAAOpR,KAAO,QAAUlX,MAE7D,GAAIsoB,aAAkB0V,QAA2B5+B,IAAlBkpB,EAAOqP,OAAsB,CAMxD,GAAI33B,KAAKs9C,YAAyCt9C,KAAKs9C,YAAYh1B,EAAOkB,IAAMxpB,KAAK29C,WAAWr1B,EAAOkB,IACnG,MAAM/pB,MAAM,gBAAkB6oB,EAAOkB,GAAK,OAASxpB,MACvD,GAAIA,KAAKwsB,aAAalE,EAAOkB,IACzB,MAAM/pB,MAAM,MAAQ6oB,EAAOkB,GAAK,mBAAqBxpB,MACzD,GAAIA,KAAKysB,eAAenE,EAAOpR,MAC3B,MAAMzX,MAAM,SAAW6oB,EAAOpR,KAAO,oBAAsBlX,MAO/D,OALIsoB,EAAO8W,QACP9W,EAAO8W,OAAOvV,OAAOvB,GACzBtoB,KAAKkiC,OAAO5Z,EAAOpR,MAAQoR,EAC3BA,EAAO7B,QAAUzmB,KACjBsoB,EAAO6X,MAAMngC,MACN4hC,EAAW5hC,KACtB,CACA,OAAIsoB,aAAkBokB,GACb1sC,KAAKm9C,SACNn9C,KAAKm9C,OAAS,CAAC,GACnBn9C,KAAKm9C,OAAO70B,EAAOpR,MAAQoR,EAC3BA,EAAO6X,MAAMngC,MACN4hC,EAAW5hC,OAEf2rB,EAAUjuB,UAAUsK,IAAIsP,KAAKtX,KAAMsoB,EAC9C,EASAT,EAAKnqB,UAAUmsB,OAAS,SAAgBvB,GACpC,GAAIA,aAAkB0V,QAA2B5+B,IAAlBkpB,EAAOqP,OAAsB,CAIxD,IAAK33B,KAAKkiC,QAAUliC,KAAKkiC,OAAO5Z,EAAOpR,QAAUoR,EAC7C,MAAM7oB,MAAM6oB,EAAS,uBAAyBtoB,MAKlD,cAHOA,KAAKkiC,OAAO5Z,EAAOpR,MAC1BoR,EAAO8W,OAAS,KAChB9W,EAAO+X,SAASrgC,MACT4hC,EAAW5hC,KACtB,CACA,GAAIsoB,aAAkBokB,EAAO,CAGzB,IAAK1sC,KAAKm9C,QAAUn9C,KAAKm9C,OAAO70B,EAAOpR,QAAUoR,EAC7C,MAAM7oB,MAAM6oB,EAAS,uBAAyBtoB,MAKlD,cAHOA,KAAKm9C,OAAO70B,EAAOpR,MAC1BoR,EAAO8W,OAAS,KAChB9W,EAAO+X,SAASrgC,MACT4hC,EAAW5hC,KACtB,CACA,OAAO2rB,EAAUjuB,UAAUmsB,OAAOvS,KAAKtX,KAAMsoB,EACjD,EAOAT,EAAKnqB,UAAU8uB,aAAe,SAAsBhD,GAChD,OAAOmC,EAAUa,aAAaxsB,KAAKisB,SAAUzC,EACjD,EAOA3B,EAAKnqB,UAAU+uB,eAAiB,SAAwBvV,GACpD,OAAOyU,EAAUc,eAAezsB,KAAKisB,SAAU/U,EACnD,EAOA2Q,EAAKnqB,UAAUJ,OAAS,SAAgByvB,GACpC,OAAO,IAAI/sB,KAAKzC,KAAKwvB,EACzB,EAMAlF,EAAKnqB,UAAUygD,MAAQ,WAMnB,IAFA,IAAIje,EAAWlgC,KAAKkgC,SAChBjC,EAAW,GACNz8B,EAAI,EAAGA,EAAsBxB,KAAK4sC,YAAYluC,SAAU8C,EAC7Dy8B,EAAMjgB,KAAKhe,KAAKu9C,aAAa/7C,GAAGyxB,UAAU2L,cAG9C5+B,KAAKsqB,OAAS6N,EAAQn4B,KAARm4B,CAAc,CACxB2hB,OAASA,EACT7b,MAASA,EACTlW,KAASA,IAEb/nB,KAAKw/B,OAASud,EAAQ/8C,KAAR+8C,CAAc,CACxBjB,OAASA,EACT7d,MAASA,EACTlW,KAASA,IAEb/nB,KAAK09C,OAASV,EAASh9C,KAATg9C,CAAe,CACzB/e,MAAQA,EACRlW,KAAQA,IAEZ/nB,KAAKob,WAAa6hC,EAAU7hC,WAAWpb,KAArBi9C,CAA2B,CACzChf,MAAQA,EACRlW,KAAQA,IAEZ/nB,KAAKwoB,SAAWy0B,EAAUz0B,SAASxoB,KAAnBi9C,CAAyB,CACrChf,MAAQA,EACRlW,KAAQA,IAIZ,IAAIq2B,EAAUlB,EAAShd,GACvB,GAAIke,EAAS,CACT,IAAIC,EAAehhD,OAAOC,OAAO0C,MAE7Bq+C,EAAajjC,WAAapb,KAAKob,WAC/Bpb,KAAKob,WAAagjC,EAAQhjC,WAAWia,KAAKgpB,GAG1CA,EAAa71B,SAAWxoB,KAAKwoB,SAC7BxoB,KAAKwoB,SAAW41B,EAAQ51B,SAAS6M,KAAKgpB,EAE9C,CAEA,OAAOr+C,IACX,EAQA6nB,EAAKnqB,UAAU4sB,OAAS,SAAsB7D,EAAS0zB,GACnD,OAAOn6C,KAAKm+C,QAAQ7zB,OAAO7D,EAAS0zB,EACxC,EAQAtyB,EAAKnqB,UAAU4gD,gBAAkB,SAAyB73B,EAAS0zB,GAC/D,OAAOn6C,KAAKsqB,OAAO7D,EAAS0zB,GAAUA,EAAO94C,IAAM84C,EAAOuB,OAASvB,GAAQwB,QAC/E,EAUA9zB,EAAKnqB,UAAU8hC,OAAS,SAAsByc,EAAQv9C,GAClD,OAAOsB,KAAKm+C,QAAQ3e,OAAOyc,EAAQv9C,EACvC,EASAmpB,EAAKnqB,UAAU6gD,gBAAkB,SAAyBtC,GAGtD,OAFMA,aAAkBH,IACpBG,EAASH,EAAOx+C,OAAO2+C,IACpBj8C,KAAKw/B,OAAOyc,EAAQA,EAAOrB,SACtC,EAOA/yB,EAAKnqB,UAAUggD,OAAS,SAAsBj3B,GAC1C,OAAOzmB,KAAKm+C,QAAQT,OAAOj3B,EAC/B,EAOAoB,EAAKnqB,UAAU0d,WAAa,SAAoBkN,GAC5C,OAAOtoB,KAAKm+C,QAAQ/iC,WAAWkN,EACnC,EA2BAT,EAAKnqB,UAAU8qB,SAAW,SAAkB/B,EAASoF,GACjD,OAAO7rB,KAAKm+C,QAAQ31B,SAAS/B,EAASoF,EAC1C,EAiBAhE,EAAK6I,EAAI,SAAsBhH,GAC3B,OAAO,SAAuBjJ,GAC1BsH,EAAK0B,aAAahJ,EAAQiJ,EAC9B,CACJ,0BC3kBAzsB,EAAOD,QAAU6/C,EAGjB,IAAI7e,EAAQ,EAAQ,MAClB6e,EAASn/C,UAAYL,OAAOC,OAAO0gC,EAAMtgC,YAAYC,YAAck/C,GAAUnxB,UAAY,WAE3F,IAAIuS,EAAU,EAAQ,IAClBlW,EAAU,EAAQ,GActB,SAAS80B,EAAS3lC,EAAMsS,EAAIw0B,EAAS9iC,EAAM2Q,EAASC,GAIhD,GAHAkS,EAAM1mB,KAAKtX,KAAMkX,EAAMsS,EAAItO,OAAM9b,OAAWA,EAAWysB,EAASC,IAG3D/D,EAAKwE,SAASyxB,GACf,MAAMj/C,UAAU,4BAMpBiB,KAAKg+C,QAAUA,EAMfh+C,KAAKw+C,gBAAkB,KAGvBx+C,KAAKu+B,KAAM,CACf,CAuBAse,EAAS3wB,SAAW,SAAkBhV,EAAMiV,GACxC,OAAO,IAAI0wB,EAAS3lC,EAAMiV,EAAK3C,GAAI2C,EAAK6xB,QAAS7xB,EAAKjR,KAAMiR,EAAKN,QAASM,EAAKL,QACnF,EAOA+wB,EAASn/C,UAAUsH,OAAS,SAAgBonB,GACxC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,UAAYxoB,KAAKg+C,QACjB,OAAYh+C,KAAKkb,KACjB,KAAYlb,KAAKwpB,GACjB,SAAYxpB,KAAK23B,OACjB,UAAY33B,KAAK6rB,QACjB,UAAYQ,EAAersB,KAAK8rB,aAAU1sB,GAElD,EAKAy9C,EAASn/C,UAAUu1B,QAAU,WACzB,GAAIjzB,KAAKk/B,SACL,OAAOl/B,KAGX,QAAmCZ,IAA/B6+B,EAAM0C,OAAO3gC,KAAKg+C,SAClB,MAAMv+C,MAAM,qBAAuBO,KAAKg+C,SAE5C,OAAOhgB,EAAMtgC,UAAUu1B,QAAQ3b,KAAKtX,KACxC,EAYA68C,EAASnsB,EAAI,SAA0B+O,EAASgf,EAAcC,GAU1D,MAP8B,mBAAnBA,EACPA,EAAiB32B,EAAK0B,aAAai1B,GAAgBxnC,KAG9CwnC,GAA4C,iBAAnBA,IAC9BA,EAAiB32B,EAAKgC,aAAa20B,GAAgBxnC,MAEhD,SAA2BxZ,EAAWkiC,GACzC7X,EAAK0B,aAAa/rB,EAAUC,aACvBqK,IAAI,IAAI60C,EAASjd,EAAWH,EAASgf,EAAcC,GAC5D,CACJ,0BC5HAzhD,EAAOD,QAAUwkC,EAGjB,IAAI7V,EAAY,EAAQ,MACtB6V,EAAQ9jC,UAAYL,OAAOC,OAAOquB,EAAUjuB,YAAYC,YAAc6jC,GAAS9V,UAAY,UAE7F,IAAIizB,EAAS,EAAQ,IACjB52B,EAAS,EAAQ,GACjB62B,EAAS,EAAQ,IAWrB,SAASpd,EAAQtqB,EAAM2U,GACnBF,EAAUrU,KAAKtX,KAAMkX,EAAM2U,GAM3B7rB,KAAKmiC,QAAU,CAAC,EAOhBniC,KAAK6+C,cAAgB,IACzB,CAwDA,SAASjd,EAAWkd,GAEhB,OADAA,EAAQD,cAAgB,KACjBC,CACX,CA3CAtd,EAAQtV,SAAW,SAAkBhV,EAAMiV,GACvC,IAAI2yB,EAAU,IAAItd,EAAQtqB,EAAMiV,EAAKN,SAErC,GAAIM,EAAKgW,QACL,IAAK,IAAIF,EAAQ5kC,OAAOkrB,KAAK4D,EAAKgW,SAAU3gC,EAAI,EAAGA,EAAIygC,EAAMvjC,SAAU8C,EACnEs9C,EAAQ92C,IAAI22C,EAAOzyB,SAAS+V,EAAMzgC,GAAI2qB,EAAKgW,QAAQF,EAAMzgC,MAIjE,OAHI2qB,EAAKuV,QACLod,EAAQhd,QAAQ3V,EAAKuV,QACzBod,EAAQhzB,QAAUK,EAAKL,QAChBgzB,CACX,EAOAtd,EAAQ9jC,UAAUsH,OAAS,SAAgBonB,GACvC,IAAI6xB,EAAYtyB,EAAUjuB,UAAUsH,OAAOsS,KAAKtX,KAAMosB,GAClDC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,UAAYy1B,GAAaA,EAAUpyB,cAAWzsB,EAC9C,UAAYusB,EAAU8V,YAAYzhC,KAAK++C,aAAc3yB,IAA6C,CAAC,EACnG,SAAY6xB,GAAaA,EAAUvc,aAAUtiC,EAC7C,UAAYitB,EAAersB,KAAK8rB,aAAU1sB,GAElD,EAQA/B,OAAOqiB,eAAe8hB,EAAQ9jC,UAAW,eAAgB,CACrDiiB,IAAK,WACD,OAAO3f,KAAK6+C,gBAAkB7+C,KAAK6+C,cAAgB92B,EAAKzlB,QAAQtC,KAAKmiC,SACzE,IAWJX,EAAQ9jC,UAAUiiB,IAAM,SAAazI,GACjC,OAAOlX,KAAKmiC,QAAQjrB,IACbyU,EAAUjuB,UAAUiiB,IAAIrI,KAAKtX,KAAMkX,EAC9C,EAKAsqB,EAAQ9jC,UAAU4kC,WAAa,WAE3B,IADA,IAAIH,EAAUniC,KAAK++C,aACVv9C,EAAI,EAAGA,EAAI2gC,EAAQzjC,SAAU8C,EAClC2gC,EAAQ3gC,GAAGyxB,UACf,OAAOtH,EAAUjuB,UAAUu1B,QAAQ3b,KAAKtX,KAC5C,EAKAwhC,EAAQ9jC,UAAUsK,IAAM,SAAasgB,GAGjC,GAAItoB,KAAK2f,IAAI2I,EAAOpR,MAChB,MAAMzX,MAAM,mBAAqB6oB,EAAOpR,KAAO,QAAUlX,MAE7D,OAAIsoB,aAAkBq2B,GAClB3+C,KAAKmiC,QAAQ7Z,EAAOpR,MAAQoR,EAC5BA,EAAO8W,OAASp/B,KACT4hC,EAAW5hC,OAEf2rB,EAAUjuB,UAAUsK,IAAIsP,KAAKtX,KAAMsoB,EAC9C,EAKAkZ,EAAQ9jC,UAAUmsB,OAAS,SAAgBvB,GACvC,GAAIA,aAAkBq2B,EAAQ,CAG1B,GAAI3+C,KAAKmiC,QAAQ7Z,EAAOpR,QAAUoR,EAC9B,MAAM7oB,MAAM6oB,EAAS,uBAAyBtoB,MAIlD,cAFOA,KAAKmiC,QAAQ7Z,EAAOpR,MAC3BoR,EAAO8W,OAAS,KACTwC,EAAW5hC,KACtB,CACA,OAAO2rB,EAAUjuB,UAAUmsB,OAAOvS,KAAKtX,KAAMsoB,EACjD,EASAkZ,EAAQ9jC,UAAUJ,OAAS,SAAgB0hD,EAASC,EAAkBC,GAElE,IADA,IACgBnT,EADZoT,EAAa,IAAIP,EAAIpd,QAAQwd,EAASC,EAAkBC,GACnD19C,EAAI,EAAWA,EAAsBxB,KAAK++C,aAAargD,SAAU8C,EAAG,CACzE,IAAI49C,EAAar3B,EAAKsH,SAAS0c,EAAS/rC,KAAK6+C,cAAcr9C,IAAIyxB,UAAU/b,MAAM/U,QAAQ,WAAY,IACnGg9C,EAAWC,GAAcr3B,EAAKE,QAAQ,CAAC,IAAI,KAAMF,EAAKY,WAAWy2B,GAAcA,EAAa,IAAMA,EAAzEr3B,CAAqF,iCAArFA,CAAuH,CAC5ItY,EAAGs8B,EACHvmC,EAAGumC,EAAOsT,oBAAoB9hD,KAC9BkR,EAAGs9B,EAAOuT,qBAAqB/hD,MAEvC,CACA,OAAO4hD,CACX,0BCrKAliD,EAAOD,QAAU2hD,EAGjB,IAAIlzB,EAAmB,EAAQ,MAC7BkzB,EAAOjhD,UAAYL,OAAOC,OAAOmuB,EAAiB/tB,YAAYC,YAAcghD,GAAQjzB,UAAY,SAElG,IAAI3D,EAAO,EAAQ,GAgBnB,SAAS42B,EAAOznC,EAAMgE,EAAMqkC,EAAaC,EAAcC,EAAeC,EAAgB7zB,EAASC,GAY3F,GATI/D,EAAKgG,SAAS0xB,IACd5zB,EAAU4zB,EACVA,EAAgBC,OAAiBtgD,GAC1B2oB,EAAKgG,SAAS2xB,KACrB7zB,EAAU6zB,EACVA,OAAiBtgD,QAINA,IAAT8b,IAAsB6M,EAAKwE,SAASrR,GACtC,MAAMnc,UAAU,yBAGpB,IAAKgpB,EAAKwE,SAASgzB,GACf,MAAMxgD,UAAU,gCAGpB,IAAKgpB,EAAKwE,SAASizB,GACf,MAAMzgD,UAAU,iCAEpB0sB,EAAiBnU,KAAKtX,KAAMkX,EAAM2U,GAMlC7rB,KAAKkb,KAAOA,GAAQ,MAMpBlb,KAAKu/C,YAAcA,EAMnBv/C,KAAKy/C,gBAAgBA,QAAuBrgD,EAM5CY,KAAKw/C,aAAeA,EAMpBx/C,KAAK0/C,iBAAiBA,QAAwBtgD,EAM9CY,KAAKq/C,oBAAsB,KAM3Br/C,KAAKs/C,qBAAuB,KAM5Bt/C,KAAK8rB,QAAUA,CACnB,CAoBA6yB,EAAOzyB,SAAW,SAAkBhV,EAAMiV,GACtC,OAAO,IAAIwyB,EAAOznC,EAAMiV,EAAKjR,KAAMiR,EAAKozB,YAAapzB,EAAKqzB,aAAcrzB,EAAKszB,cAAetzB,EAAKuzB,eAAgBvzB,EAAKN,QAASM,EAAKL,QACxI,EAOA6yB,EAAOjhD,UAAUsH,OAAS,SAAgBonB,GACtC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOtE,EAAKS,SAAS,CACjB,OAAiC,QAAdxoB,KAAKkb,MAA6Clb,KAAKkb,WAAQ9b,EAClF,cAAmBY,KAAKu/C,YACxB,gBAAmBv/C,KAAKy/C,cACxB,eAAmBz/C,KAAKw/C,aACxB,iBAAmBx/C,KAAK0/C,eACxB,UAAmB1/C,KAAK6rB,QACxB,UAAmBQ,EAAersB,KAAK8rB,aAAU1sB,GAEzD,EAKAu/C,EAAOjhD,UAAUu1B,QAAU,WAGvB,OAAIjzB,KAAKk/B,SACEl/B,MAEXA,KAAKq/C,oBAAsBr/C,KAAKo/B,OAAOsD,WAAW1iC,KAAKu/C,aACvDv/C,KAAKs/C,qBAAuBt/C,KAAKo/B,OAAOsD,WAAW1iC,KAAKw/C,cAEjD/zB,EAAiB/tB,UAAUu1B,QAAQ3b,KAAKtX,MACnD,0BCrJA/C,EAAOD,QAAU8/C,EAEjB,IAAI/0B,EAAO,EAAQ,GASnB,SAAS+0B,EAAQ/vB,GAEb,GAAIA,EACA,IAAK,IAAIxE,EAAOlrB,OAAOkrB,KAAKwE,GAAavrB,EAAI,EAAGA,EAAI+mB,EAAK7pB,SAAU8C,EAC/DxB,KAAKuoB,EAAK/mB,IAAMurB,EAAWxE,EAAK/mB,GAC5C,CAyBAs7C,EAAQx/C,OAAS,SAAgByvB,GAC7B,OAAO/sB,KAAK2pB,MAAMrsB,OAAOyvB,EAC7B,EAUA+vB,EAAQxyB,OAAS,SAAgB7D,EAAS0zB,GACtC,OAAOn6C,KAAK2pB,MAAMW,OAAO7D,EAAS0zB,EACtC,EAUA2C,EAAQwB,gBAAkB,SAAyB73B,EAAS0zB,GACxD,OAAOn6C,KAAK2pB,MAAM20B,gBAAgB73B,EAAS0zB,EAC/C,EAWA2C,EAAQtd,OAAS,SAAgByc,GAC7B,OAAOj8C,KAAK2pB,MAAM6V,OAAOyc,EAC7B,EAWAa,EAAQyB,gBAAkB,SAAyBtC,GAC/C,OAAOj8C,KAAK2pB,MAAM40B,gBAAgBtC,EACtC,EASAa,EAAQY,OAAS,SAAgBj3B,GAC7B,OAAOzmB,KAAK2pB,MAAM+zB,OAAOj3B,EAC7B,EASAq2B,EAAQ1hC,WAAa,SAAoBkN,GACrC,OAAOtoB,KAAK2pB,MAAMvO,WAAWkN,EACjC,EAUAw0B,EAAQt0B,SAAW,SAAkB/B,EAASoF,GAC1C,OAAO7rB,KAAK2pB,MAAMnB,SAAS/B,EAASoF,EACxC,EAMAixB,EAAQp/C,UAAUsH,OAAS,WACvB,OAAOhF,KAAK2pB,MAAMnB,SAASxoB,KAAM+nB,EAAKqE,cAC1C,0BCvIAnvB,EAAOD,QAAU8iC,EAGjB,IAAInU,EAAY,EAAQ,MACtBmU,EAAKpiC,UAAYL,OAAOC,OAAOquB,EAAUjuB,YAAYC,YAAcmiC,GAAMpU,UAAY,OAEvF,IAKI7D,EACAsR,EACAwmB,EAPA3hB,EAAU,EAAQ,IAClBlW,EAAU,EAAQ,GAClB4kB,EAAU,EAAQ,IAClB3kB,EAAU,EAAQ,GAatB,SAAS+X,EAAKjU,GACVF,EAAUrU,KAAKtX,KAAM,GAAI6rB,GAMzB7rB,KAAK4/C,SAAW,GAMhB5/C,KAAK6/C,MAAQ,EACjB,CA4BA,SAASC,IAAQ,CApBjBhgB,EAAK5T,SAAW,SAAkBC,EAAMrvB,GAKpC,OAJKA,IACDA,EAAO,IAAIgjC,GACX3T,EAAKN,SACL/uB,EAAKyjC,WAAWpU,EAAKN,SAClB/uB,EAAKglC,QAAQ3V,EAAKuV,OAC7B,EAUA5B,EAAKpiC,UAAUqiD,YAAch4B,EAAKI,KAAK8K,QAavC6M,EAAKpiC,UAAUsiD,KAAO,SAASA,EAAKjgB,EAAUlU,EAASo0B,GAC5B,mBAAZp0B,IACPo0B,EAAWp0B,EACXA,OAAUzsB,GAEd,IAAI0E,EAAO9D,KACX,IAAKigD,EACD,OAAOl4B,EAAKkF,UAAU+yB,EAAMl8C,EAAMi8B,EAAUlU,GAEhD,IAAIq0B,EAAOD,IAAaH,EAGxB,SAASlE,EAAOxoB,EAAKt2B,GAEjB,GAAKmjD,EAAL,CAEA,IAAIlkB,EAAKkkB,EAET,GADAA,EAAW,KACPC,EACA,MAAM9sB,EACV2I,EAAG3I,EAAKt2B,EALE,CAMd,CAGA,SAAS8wB,EAAQmS,EAAUogB,GACvB,IAGI,GAFIp4B,EAAKwE,SAAS4zB,IAAgC,MAArBA,EAAOn3B,OAAO,KACvCm3B,EAASrb,KAAK3L,MAAMgnB,IACnBp4B,EAAKwE,SAAS4zB,GAEd,CACDhnB,EAAM4G,SAAWA,EACjB,IACIb,EADAzhB,EAAS0b,EAAMgnB,EAAQr8C,EAAM+nB,GAE7BrqB,EAAI,EACR,GAAIic,EAAO2iC,QACP,KAAO5+C,EAAIic,EAAO2iC,QAAQ1hD,SAAU8C,GAC5B09B,EAAWp7B,EAAKi8C,YAAYhgB,EAAUtiB,EAAO2iC,QAAQ5+C,MACrD0mB,EAAMgX,GAClB,GAAIzhB,EAAO4iC,YACP,IAAK7+C,EAAI,EAAGA,EAAIic,EAAO4iC,YAAY3hD,SAAU8C,GACrC09B,EAAWp7B,EAAKi8C,YAAYhgB,EAAUtiB,EAAO4iC,YAAY7+C,MACzD0mB,EAAMgX,GAAU,EAChC,MAdIp7B,EAAKy8B,WAAW4f,EAAOt0B,SAASiW,QAAQqe,EAAOze,OAevD,CAAE,MAAOtO,GACLwoB,EAAOxoB,EACX,CACK8sB,GAASI,GACV1E,EAAO,KAAM93C,EACrB,CAGA,SAASokB,EAAM6X,EAAUwgB,GAGrB,IAAIpZ,EAAMpH,EAASrjB,YAAY,oBAC/B,GAAIyqB,GAAO,EAAG,CACV,IAAIqZ,EAAUzgB,EAAS7W,UAAUie,GAC7BqZ,KAAWb,IACX5f,EAAWygB,EACnB,CAGA,KAAI18C,EAAK+7C,MAAMpjC,QAAQsjB,IAAa,GAKpC,GAHAj8B,EAAK+7C,MAAM7hC,KAAK+hB,GAGZA,KAAY4f,EACRO,EACAtyB,EAAQmS,EAAU4f,EAAO5f,OAEvBugB,EACFG,YAAW,aACLH,EACF1yB,EAAQmS,EAAU4f,EAAO5f,GAC7B,UAMR,GAAImgB,EAAM,CACN,IAAIC,EACJ,IACIA,EAASp4B,EAAKK,GAAGs4B,aAAa3gB,GAAU79B,SAAS,OACrD,CAAE,MAAOkxB,GAGL,YAFKmtB,GACD3E,EAAOxoB,GAEf,CACAxF,EAAQmS,EAAUogB,EACtB,OACMG,EACFv4B,EAAKG,MAAM6X,GAAU,SAAS3M,EAAK+sB,KAC7BG,EAEGL,IAED7sB,EAEKmtB,EAEKD,GACN1E,EAAO,KAAM93C,GAFb83C,EAAOxoB,GAKfxF,EAAQmS,EAAUogB,GACtB,GAER,CACA,IAAIG,EAAS,EAITv4B,EAAKwE,SAASwT,KACdA,EAAW,CAAEA,IACjB,IAAK,IAAWb,EAAP19B,EAAI,EAAaA,EAAIu+B,EAASrhC,SAAU8C,GACzC09B,EAAWp7B,EAAKi8C,YAAY,GAAIhgB,EAASv+B,MACzC0mB,EAAMgX,GAEd,GAAIghB,EACA,OAAOp8C,EACNw8C,GACD1E,EAAO,KAAM93C,EAErB,EA+BAg8B,EAAKpiC,UAAUijD,SAAW,SAAkB5gB,EAAUlU,GAClD,IAAK9D,EAAK4F,OACN,MAAMluB,MAAM,iBAChB,OAAOO,KAAKggD,KAAKjgB,EAAUlU,EAASi0B,EACxC,EAKAhgB,EAAKpiC,UAAU4kC,WAAa,WACxB,GAAItiC,KAAK4/C,SAASlhD,OACd,MAAMe,MAAM,4BAA8BO,KAAK4/C,SAASrhB,KAAI,SAASuO,GACjE,MAAO,WAAaA,EAAMnV,OAAS,QAAUmV,EAAM1N,OAAOc,QAC9D,IAAGhH,KAAK,OACZ,OAAOvN,EAAUjuB,UAAU4kC,WAAWhrB,KAAKtX,KAC/C,EAGA,IAAI4gD,EAAW,SAUf,SAASC,EAAmB/jD,EAAMgwC,GAC9B,IAAIgU,EAAehU,EAAM1N,OAAOmD,OAAOuK,EAAMnV,QAC7C,GAAImpB,EAAc,CACd,IAAIC,EAAc,IAAI/iB,EAAM8O,EAAM5M,SAAU4M,EAAMtjB,GAAIsjB,EAAM5xB,KAAM4xB,EAAM3O,UAAM/+B,EAAW0tC,EAAMjhB,SAI/F,OAHAk1B,EAAYjiB,eAAiBgO,EAC7BA,EAAMjO,eAAiBkiB,EACvBD,EAAa94C,IAAI+4C,IACV,CACX,CACA,OAAO,CACX,CAQAjhB,EAAKpiC,UAAU0iC,WAAa,SAAoB9X,GAC5C,GAAIA,aAAkB0V,OAE2D5+B,IAAlBkpB,EAAOqP,QAAmDrP,EAAOuW,gBACnHgiB,EAAmB7gD,EAAMsoB,IAC1BtoB,KAAK4/C,SAAS5hC,KAAKsK,QAExB,GAAIA,aAAkBR,EAErB84B,EAASh4B,KAAKN,EAAOpR,QACrBoR,EAAO8W,OAAO9W,EAAOpR,MAAQoR,EAAOsD,aAErC,KAAMtD,aAAkBokB,GAA6C,CAExE,GAAIpkB,aAAkBT,EAClB,IAAK,IAAIrmB,EAAI,EAAGA,EAAIxB,KAAK4/C,SAASlhD,QAC1BmiD,EAAmB7gD,EAAMA,KAAK4/C,SAASp+C,IACvCxB,KAAK4/C,SAAS5kB,OAAOx5B,EAAG,KAEtBA,EACd,IAAK,IAAIgB,EAAI,EAAGA,EAAsB8lB,EAAOyZ,YAAYrjC,SAAU8D,EAC/DxC,KAAKogC,WAAW9X,EAAOqZ,aAAan/B,IACpCo+C,EAASh4B,KAAKN,EAAOpR,QACrBoR,EAAO8W,OAAO9W,EAAOpR,MAAQoR,EACrC,CAKJ,EAQAwX,EAAKpiC,UAAU4iC,cAAgB,SAAuBhY,GAClD,GAAIA,aAAkB0V,GAElB,QAA+C5+B,IAAlBkpB,EAAOqP,OAChC,GAA0BrP,EAAOuW,eAC7BvW,EAAOuW,eAAeO,OAAOvV,OAAOvB,EAAOuW,gBAC3CvW,EAAOuW,eAAiB,SACrB,CACH,IAAIn+B,EAAQV,KAAK4/C,SAASnjC,QAAQ6L,GAE9B5nB,GAAS,GACTV,KAAK4/C,SAAS5kB,OAAOt6B,EAAO,EACpC,OAGD,GAAI4nB,aAAkBR,EAErB84B,EAASh4B,KAAKN,EAAOpR,cACdoR,EAAO8W,OAAO9W,EAAOpR,WAE7B,GAAIoR,aAAkBqD,EAAW,CAEpC,IAAK,IAAInqB,EAAI,EAAGA,EAAsB8mB,EAAOyZ,YAAYrjC,SAAU8C,EAC/DxB,KAAKsgC,cAAchY,EAAOqZ,aAAangC,IAEvCo/C,EAASh4B,KAAKN,EAAOpR,cACdoR,EAAO8W,OAAO9W,EAAOpR,KAEpC,CACJ,EAGA4oB,EAAKjQ,WAAa,SAASgQ,EAAOmhB,EAAQC,GACtCp5B,EAASgY,EACT1G,EAAS6nB,EACTrB,EAASsB,CACb,aC9VA,IAAIlgD,EASJ,SAASmgD,EAAKje,GACZjjC,KAAKijC,KAAOA,CACd,CAkBA,GA3BAhmC,EAAOD,QAAU,SAAcqE,GAI7B,OAHKN,IACHA,EAAI,IAAImgD,EAAK,OAERngD,EAAEogD,SAAS9/C,EACpB,EAKApE,EAAOD,QAAQkkD,KAAOA,EAEtBA,EAAKxjD,UAAUyjD,SAAW,SAAkB9/C,GAC1C,OAAOrB,KAAKohD,MAAM//C,EACpB,EAGA6/C,EAAKxjD,UAAU0jD,MAAQ,SAAe5xC,GACpC,GAAIxP,KAAKijC,KAAKoe,SACZ,OAAOrhD,KAAKijC,KAAKoe,SAAS7xC,GAG5B,IADA,IAAIjK,EAAM,IAAIsU,WAAWrK,GAChBhO,EAAI,EAAGA,EAAI+D,EAAI7G,OAAQ8C,IAC9B+D,EAAI/D,GAAKxB,KAAKijC,KAAKqe,UACrB,OAAO/7C,CACT,EAEoB,iBAATzB,KACLA,KAAKmzB,QAAUnzB,KAAKmzB,OAAOG,gBAE7B8pB,EAAKxjD,UAAU0jD,MAAQ,SAAe5xC,GACpC,IAAImN,EAAM,IAAI9C,WAAWrK,GAEzB,OADA1L,KAAKmzB,OAAOG,gBAAgBza,GACrBA,CACT,EACS7Y,KAAKozB,UAAYpzB,KAAKozB,SAASE,gBAExC8pB,EAAKxjD,UAAU0jD,MAAQ,SAAe5xC,GACpC,IAAImN,EAAM,IAAI9C,WAAWrK,GAEzB,OADA1L,KAAKozB,SAASE,gBAAgBza,GACvBA,CACT,EAG2B,iBAAXrc,SAEhB4gD,EAAKxjD,UAAU0jD,MAAQ,WACrB,MAAM,IAAI3hD,MAAM,sBAClB,QAIF,IACE,IAAIw3B,EAAS,EAAQ,KACrB,GAAkC,mBAAvBA,EAAOK,YAChB,MAAM,IAAI73B,MAAM,iBAElByhD,EAAKxjD,UAAU0jD,MAAQ,SAAe5xC,GACpC,OAAOynB,EAAOK,YAAY9nB,EAC5B,CACF,CAAE,MAAOjP,GACT,0BC7DF,IAsKIghD,EAtKApe,EAASnmC,EAETiyB,EAAO,EAAQ,IACfiU,EAAQ,EAAQ,IAGhB5jC,EAFQ,EAAQ,GAEDA,OAEnB,SAASkiD,EAAY31B,GACE,UAAjBA,EAAQ3Q,KACVlb,KAAKkjC,MAAQ,IAAIA,EAAMue,MAAM51B,GACL,YAAjBA,EAAQ3Q,KACflb,KAAKkjC,MAAQ,IAAIA,EAAMwe,QAAQ71B,GAE/B7rB,KAAKkjC,MAAQ,IAAIA,EAAM/pB,KAAK0S,GAC9B7rB,KAAKyT,EAAIzT,KAAKkjC,MAAMzvB,EACpBzT,KAAKwP,EAAIxP,KAAKkjC,MAAM1zB,EACpBxP,KAAKivB,KAAOpD,EAAQoD,KAEpB3vB,EAAOU,KAAKyT,EAAEw6B,WAAY,iBAC1B3uC,EAAOU,KAAKyT,EAAErS,IAAIpB,KAAKwP,GAAGmyC,aAAc,0BAC1C,CAGA,SAASC,EAAY1qC,EAAM2U,GACzBxuB,OAAOqiB,eAAeyjB,EAAQjsB,EAAM,CAClCnZ,cAAc,EACdF,YAAY,EACZ8hB,IAAK,WACH,IAAIujB,EAAQ,IAAIse,EAAY31B,GAM5B,OALAxuB,OAAOqiB,eAAeyjB,EAAQjsB,EAAM,CAClCnZ,cAAc,EACdF,YAAY,EACZD,MAAOslC,IAEFA,CACT,GAEJ,CAhBAC,EAAOqe,YAAcA,EAkBrBI,EAAY,OAAQ,CAClB1mC,KAAM,QACNxD,MAAO,OACP3I,EAAG,wDACH/K,EAAG,wDACHC,EAAG,wDACHuL,EAAG,wDACHyf,KAAMA,EAAK4yB,OACXxU,MAAM,EACN55B,EAAG,CACD,wDACA,2DAIJmuC,EAAY,OAAQ,CAClB1mC,KAAM,QACNxD,MAAO,OACP3I,EAAG,iEACH/K,EAAG,iEACHC,EAAG,iEACHuL,EAAG,iEACHyf,KAAMA,EAAK4yB,OACXxU,MAAM,EACN55B,EAAG,CACD,iEACA,oEAIJmuC,EAAY,OAAQ,CAClB1mC,KAAM,QACNxD,MAAO,KACP3I,EAAG,0EACH/K,EAAG,0EACHC,EAAG,0EACHuL,EAAG,0EACHyf,KAAMA,EAAK4yB,OACXxU,MAAM,EACN55B,EAAG,CACD,0EACA,6EAIJmuC,EAAY,OAAQ,CAClB1mC,KAAM,QACNxD,MAAO,KACP3I,EAAG,8GAEH/K,EAAG,8GAEHC,EAAG,8GAEHuL,EAAG,8GAEHyf,KAAMA,EAAK6yB,OACXzU,MAAM,EACN55B,EAAG,CACD,8GAEA,iHAKJmuC,EAAY,OAAQ,CAClB1mC,KAAM,QACNxD,MAAO,KACP3I,EAAG,2JAGH/K,EAAG,2JAGHC,EAAG,2JAGHuL,EAAG,2JAGHyf,KAAMA,EAAK8yB,OACX1U,MAAM,EACN55B,EAAG,CACD,2JAGA,8JAMJmuC,EAAY,aAAc,CACxB1mC,KAAM,OACNxD,MAAO,SACP3I,EAAG,sEACH/K,EAAG,QACHC,EAAG,IACHuL,EAAG,sEACHyf,KAAMA,EAAK4yB,OACXxU,MAAM,EACN55B,EAAG,CACD,OAIJmuC,EAAY,UAAW,CACrB1mC,KAAM,UACNxD,MAAO,SACP3I,EAAG,sEACH/K,EAAG,KACHrD,EAAG,IAEH+vB,EAAG,sEACHlhB,EAAG,sEACHyf,KAAMA,EAAK4yB,OACXxU,MAAM,EACN55B,EAAG,CACD,mEAGA,sEAKJ,IACE8tC,EAAM,EAAQ,IAChB,CAAE,MAAOhhD,GACPghD,OAAMniD,CACR,CAEAwiD,EAAY,YAAa,CACvB1mC,KAAM,QACNxD,MAAO,OACP3I,EAAG,0EACH/K,EAAG,IACHC,EAAG,IACHuL,EAAG,0EACH6B,EAAG,IACH4d,KAAMA,EAAK4yB,OAGX1R,KAAM,mEACN6R,OAAQ,mEACRC,MAAO,CACL,CACEj+C,EAAG,mCACHC,EAAG,qCAEL,CACED,EAAG,oCACHC,EAAG,qCAIPopC,MAAM,EACN55B,EAAG,CACD,mEACA,mEACA8tC,gBC3MJ,IAAItyB,EAAOjyB,EAEXiyB,EAAKhF,MAAQ,EAAQ,GACrBgF,EAAK0wB,OAAS,EAAQ,IACtB1wB,EAAKmN,IAAM,EAAQ,KACnBnN,EAAKizB,OAAS,EAAQ,KACtBjzB,EAAKkzB,KAAO,EAAQ,KAGpBlzB,EAAKmzB,KAAOnzB,EAAKmN,IAAIgmB,KACrBnzB,EAAK4yB,OAAS5yB,EAAKmN,IAAIylB,OACvB5yB,EAAKozB,OAASpzB,EAAKmN,IAAIimB,OACvBpzB,EAAK6yB,OAAS7yB,EAAKmN,IAAI0lB,OACvB7yB,EAAK8yB,OAAS9yB,EAAKmN,IAAI2lB,OACvB9yB,EAAKqzB,UAAYrzB,EAAKizB,OAAOI,kCCb7B,IAAI5iD,EAAW,EAAQ,GACnB6iD,EAAW,EAAQ,IACnBrkD,EAAS,YAETskD,EAAU,IAAI9gD,MAAM,IAExB,SAASw6B,IACPqmB,EAASjrC,KAAKtX,KAAM,IAGpBA,KAAKyiD,GAAK,WACVziD,KAAK0iD,GAAK,WACV1iD,KAAK2iD,GAAK,WACV3iD,KAAK4iD,GAAK,SACZ,CA8GA,SAASC,EAAMr1C,EAAGgC,GAChB,OAAQhC,GAAKgC,EAAMhC,IAAO,GAAKgC,CACjC,CAEA,SAASszC,EAAK9+C,EAAGC,EAAGtD,EAAG+vB,EAAGjhB,EAAGrL,EAAGqK,GAC9B,OAAQo0C,EAAM7+C,GAAMC,EAAItD,GAAQsD,EAAKysB,GAAMjhB,EAAIrL,EAAK,EAAGqK,GAAKxK,EAAK,CACnE,CAEA,SAAS8+C,EAAK/+C,EAAGC,EAAGtD,EAAG+vB,EAAGjhB,EAAGrL,EAAGqK,GAC9B,OAAQo0C,EAAM7+C,GAAMC,EAAIysB,EAAM/vB,GAAM+vB,GAAOjhB,EAAIrL,EAAK,EAAGqK,GAAKxK,EAAK,CACnE,CAEA,SAAS++C,EAAKh/C,EAAGC,EAAGtD,EAAG+vB,EAAGjhB,EAAGrL,EAAGqK,GAC9B,OAAQo0C,EAAM7+C,GAAKC,EAAItD,EAAI+vB,GAAKjhB,EAAIrL,EAAK,EAAGqK,GAAKxK,EAAK,CACxD,CAEA,SAASg/C,EAAKj/C,EAAGC,EAAGtD,EAAG+vB,EAAGjhB,EAAGrL,EAAGqK,GAC9B,OAAQo0C,EAAM7+C,GAAMrD,GAAKsD,GAAMysB,IAAQjhB,EAAIrL,EAAK,EAAGqK,GAAKxK,EAAK,CAC/D,CA9HAvE,EAASw8B,EAAKqmB,GAEdrmB,EAAIx+B,UAAU6+B,QAAU,WAEtB,IADA,IAAI2mB,EAAIV,EACChhD,EAAI,EAAGA,EAAI,KAAMA,EAAG0hD,EAAE1hD,GAAKxB,KAAK6gC,OAAOpd,YAAgB,EAAJjiB,GAE5D,IAAIwC,EAAIhE,KAAKyiD,GACTx+C,EAAIjE,KAAK0iD,GACT/hD,EAAIX,KAAK2iD,GACTjyB,EAAI1wB,KAAK4iD,GAEb5+C,EAAI8+C,EAAI9+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIoyB,EAAIpyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAImiD,EAAIniD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,UAAY,IACtCj/C,EAAI6+C,EAAI7+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAI8+C,EAAI9+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIoyB,EAAIpyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAImiD,EAAIniD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,WAAY,IACtCj/C,EAAI6+C,EAAI7+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAI8+C,EAAI9+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIoyB,EAAIpyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAImiD,EAAIniD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,WAAY,IACvCj/C,EAAI6+C,EAAI7+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,IAAK,WAAY,IACvCl/C,EAAI8+C,EAAI9+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,IAAK,WAAY,GACvCxyB,EAAIoyB,EAAIpyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,IAAK,WAAY,IACvCviD,EAAImiD,EAAIniD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,WAAY,IAGvCl/C,EAAI++C,EAAI/+C,EAFRC,EAAI6+C,EAAI7+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,IAAK,WAAY,IAEzBviD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIqyB,EAAIryB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,GACtCviD,EAAIoiD,EAAIpiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,UAAY,IACvCj/C,EAAI8+C,EAAI9+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAI++C,EAAI/+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIqyB,EAAIryB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,IAAK,SAAY,GACvCviD,EAAIoiD,EAAIpiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,WAAY,IACvCj/C,EAAI8+C,EAAI9+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAI++C,EAAI/+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,UAAY,GACtCxyB,EAAIqyB,EAAIryB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,IAAK,WAAY,GACvCviD,EAAIoiD,EAAIpiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,WAAY,IACtCj/C,EAAI8+C,EAAI9+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAI++C,EAAI/+C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,IAAK,WAAY,GACvCxyB,EAAIqyB,EAAIryB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,GACtCviD,EAAIoiD,EAAIpiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,WAAY,IAGtCl/C,EAAIg/C,EAAIh/C,EAFRC,EAAI8+C,EAAI9+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,IAAK,WAAY,IAEzBviD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIsyB,EAAItyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAIqiD,EAAIriD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,WAAY,IACvCj/C,EAAI++C,EAAI/+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,IAAK,WAAY,IACvCl/C,EAAIg/C,EAAIh/C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIsyB,EAAItyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAIqiD,EAAIriD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,WAAY,IACtCj/C,EAAI++C,EAAI/+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,IAAK,WAAY,IACvCl/C,EAAIg/C,EAAIh/C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,IAAK,UAAY,GACvCxyB,EAAIsyB,EAAItyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAIqiD,EAAIriD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,WAAY,IACtCj/C,EAAI++C,EAAI/+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,SAAY,IACtCl/C,EAAIg/C,EAAIh/C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIsyB,EAAItyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,IAAK,WAAY,IACvCviD,EAAIqiD,EAAIriD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,UAAY,IAGvCl/C,EAAIi/C,EAAIj/C,EAFRC,EAAI++C,EAAI/+C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IAExBviD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIuyB,EAAIvyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAIsiD,EAAItiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,WAAY,IACvCj/C,EAAIg/C,EAAIh/C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAIi/C,EAAIj/C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,IAAK,WAAY,GACvCxyB,EAAIuyB,EAAIvyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,GAAI,WAAY,IACtCviD,EAAIsiD,EAAItiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,IAAK,WAAY,IACvCj/C,EAAIg/C,EAAIh/C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IACtCl/C,EAAIi/C,EAAIj/C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIuyB,EAAIvyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,IAAK,WAAY,IACvCviD,EAAIsiD,EAAItiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,WAAY,IACtCj/C,EAAIg/C,EAAIh/C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,IAAK,WAAY,IACvCl/C,EAAIi/C,EAAIj/C,EAAGC,EAAGtD,EAAG+vB,EAAGwyB,EAAE,GAAI,WAAY,GACtCxyB,EAAIuyB,EAAIvyB,EAAG1sB,EAAGC,EAAGtD,EAAGuiD,EAAE,IAAK,WAAY,IACvCviD,EAAIsiD,EAAItiD,EAAG+vB,EAAG1sB,EAAGC,EAAGi/C,EAAE,GAAI,UAAY,IACtCj/C,EAAIg/C,EAAIh/C,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/C,EAAE,GAAI,WAAY,IAEtCljD,KAAKyiD,GAAMziD,KAAKyiD,GAAKz+C,EAAK,EAC1BhE,KAAK0iD,GAAM1iD,KAAK0iD,GAAKz+C,EAAK,EAC1BjE,KAAK2iD,GAAM3iD,KAAK2iD,GAAKhiD,EAAK,EAC1BX,KAAK4iD,GAAM5iD,KAAK4iD,GAAKlyB,EAAK,CAC5B,EAEAwL,EAAIx+B,UAAUszC,QAAU,WAEtBhxC,KAAK6gC,OAAO7gC,KAAKmjD,gBAAkB,IAC/BnjD,KAAKmjD,aAAe,KACtBnjD,KAAK6gC,OAAO5hC,KAAK,EAAGe,KAAKmjD,aAAc,IACvCnjD,KAAKu8B,UACLv8B,KAAKmjD,aAAe,GAGtBnjD,KAAK6gC,OAAO5hC,KAAK,EAAGe,KAAKmjD,aAAc,IACvCnjD,KAAK6gC,OAAOjc,cAAc5kB,KAAKojD,QAAQ,GAAI,IAC3CpjD,KAAK6gC,OAAOjc,cAAc5kB,KAAKojD,QAAQ,GAAI,IAC3CpjD,KAAKu8B,UAGL,IAAIt+B,EAASC,EAAOW,YAAY,IAKhC,OAJAZ,EAAOsnB,aAAavlB,KAAKyiD,GAAI,GAC7BxkD,EAAOsnB,aAAavlB,KAAK0iD,GAAI,GAC7BzkD,EAAOsnB,aAAavlB,KAAK2iD,GAAI,GAC7B1kD,EAAOsnB,aAAavlB,KAAK4iD,GAAI,IACtB3kD,CACT,EAsBAhB,EAAOD,QAAUk/B,0BC5IjB,IAAImnB,EAA6B,mCAYjC,SAASpJ,IAAQ,CAoEjBh9C,EAAOD,QAhEP,SAASsmD,EAAIC,EAAQ5d,EAAMsa,GACzB,GAAoB,mBAATta,EAAqB,OAAO2d,EAAIC,EAAQ,KAAM5d,GACpDA,IAAMA,EAAO,CAAC,GACnBsa,EAlBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACL,IAAIA,EAAJ,CACAA,GAAS,EACT,IAAK,IAAIxiB,EAAOvlB,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAC/EnxB,EAAKmxB,GAAQhoC,UAAUgoC,GAEzBxD,EAAShhC,MAAMjf,KAAMsyB,EALH,CAMpB,CACF,CAQaQ,CAAKmtB,GAAYhG,GAC5B,IAAIhO,EAAWtG,EAAKsG,WAA8B,IAAlBtG,EAAKsG,UAAsBsX,EAAOtX,SAC9DnuC,EAAW6nC,EAAK7nC,WAA8B,IAAlB6nC,EAAK7nC,UAAsBylD,EAAOzlD,SAC9D4lD,EAAiB,WACdH,EAAOzlD,UAAU6lD,GACxB,EACIC,EAAgBL,EAAOpX,gBAAkBoX,EAAOpX,eAAe0X,SAC/DF,EAAW,WACb7lD,GAAW,EACX8lD,GAAgB,EACX3X,GAAUgU,EAAS3oC,KAAKisC,EAC/B,EACIO,EAAgBP,EAAO/W,gBAAkB+W,EAAO/W,eAAeuX,WAC/D7X,EAAQ,WACVD,GAAW,EACX6X,GAAgB,EACXhmD,GAAUmiD,EAAS3oC,KAAKisC,EAC/B,EACIS,EAAU,SAAiB5wB,GAC7B6sB,EAAS3oC,KAAKisC,EAAQnwB,EACxB,EACI6wB,EAAU,WACZ,IAAI7wB,EACJ,OAAI6Y,IAAa6X,GACVP,EAAO/W,gBAAmB+W,EAAO/W,eAAeJ,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,IAE3Bt1B,IAAa8lD,GACVL,EAAOpX,gBAAmBoX,EAAOpX,eAAeC,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,SAF/B,CAIF,EACI8wB,EAAY,WACdX,EAAOY,IAAIzwB,GAAG,SAAUiwB,EAC1B,EAcA,OAtDF,SAAmBJ,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuCMC,CAAUf,IACZA,EAAO7vB,GAAG,WAAYiwB,GACtBJ,EAAO7vB,GAAG,QAASuwB,GACfV,EAAOY,IAAKD,IAAiBX,EAAO7vB,GAAG,UAAWwwB,IAC7CpmD,IAAaylD,EAAOpX,iBAE7BoX,EAAO7vB,GAAG,MAAOgwB,GACjBH,EAAO7vB,GAAG,QAASgwB,IAErBH,EAAO7vB,GAAG,MAAOwY,GACjBqX,EAAO7vB,GAAG,SAAUiwB,IACD,IAAfhe,EAAKlmB,OAAiB8jC,EAAO7vB,GAAG,QAASswB,GAC7CT,EAAO7vB,GAAG,QAASuwB,GACZ,WACLV,EAAOlwB,eAAe,WAAYswB,GAClCJ,EAAOlwB,eAAe,QAAS4wB,GAC/BV,EAAOlwB,eAAe,UAAW6wB,GAC7BX,EAAOY,KAAKZ,EAAOY,IAAI9wB,eAAe,SAAUswB,GACpDJ,EAAOlwB,eAAe,MAAOqwB,GAC7BH,EAAOlwB,eAAe,QAASqwB,GAC/BH,EAAOlwB,eAAe,SAAUswB,GAChCJ,EAAOlwB,eAAe,MAAO6Y,GAC7BqX,EAAOlwB,eAAe,QAAS2wB,GAC/BT,EAAOlwB,eAAe,QAAS4wB,EACjC,CACF,0BCnFA,IAAI/lD,EAAS,YACTwB,EAAW,EAAQ,GACnB6iD,EAAW,EAAQ,IAEnBC,EAAU,IAAI9gD,MAAM,IAEpB6iD,EAAK,CACP,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhDC,EAAK,CACP,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhDC,EAAK,CACP,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnDC,EAAK,CACP,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,IAGlDC,EAAK,CAAC,EAAY,WAAY,WAAY,WAAY,YACtDC,EAAK,CAAC,WAAY,WAAY,WAAY,WAAY,GAE1D,SAASzoB,IACPomB,EAASjrC,KAAKtX,KAAM,IAGpBA,KAAKyiD,GAAK,WACVziD,KAAK0iD,GAAK,WACV1iD,KAAK2iD,GAAK,WACV3iD,KAAK4iD,GAAK,UACV5iD,KAAK6kD,GAAK,UACZ,CAuFA,SAAShC,EAAMr1C,EAAGgC,GAChB,OAAQhC,GAAKgC,EAAMhC,IAAO,GAAKgC,CACjC,CAEA,SAASs1C,EAAK9gD,EAAGC,EAAGtD,EAAG+vB,EAAGnwB,EAAGkP,EAAGrL,EAAGqK,GACjC,OAAQo0C,EAAM7+C,GAAKC,EAAItD,EAAI+vB,GAAKjhB,EAAIrL,EAAK,EAAGqK,GAAKlO,EAAK,CACxD,CAEA,SAASwkD,EAAK/gD,EAAGC,EAAGtD,EAAG+vB,EAAGnwB,EAAGkP,EAAGrL,EAAGqK,GACjC,OAAQo0C,EAAM7+C,GAAMC,EAAItD,GAAQsD,EAAKysB,GAAMjhB,EAAIrL,EAAK,EAAGqK,GAAKlO,EAAK,CACnE,CAEA,SAASykD,EAAKhhD,EAAGC,EAAGtD,EAAG+vB,EAAGnwB,EAAGkP,EAAGrL,EAAGqK,GACjC,OAAQo0C,EAAM7+C,IAAMC,GAAMtD,GAAM+vB,GAAKjhB,EAAIrL,EAAK,EAAGqK,GAAKlO,EAAK,CAC7D,CAEA,SAAS0kD,EAAKjhD,EAAGC,EAAGtD,EAAG+vB,EAAGnwB,EAAGkP,EAAGrL,EAAGqK,GACjC,OAAQo0C,EAAM7+C,GAAMC,EAAIysB,EAAM/vB,GAAM+vB,GAAOjhB,EAAIrL,EAAK,EAAGqK,GAAKlO,EAAK,CACnE,CAEA,SAAS2kD,EAAKlhD,EAAGC,EAAGtD,EAAG+vB,EAAGnwB,EAAGkP,EAAGrL,EAAGqK,GACjC,OAAQo0C,EAAM7+C,GAAKC,GAAKtD,GAAM+vB,IAAOjhB,EAAIrL,EAAK,EAAGqK,GAAKlO,EAAK,CAC7D,CA3GAb,EAASy8B,EAAWomB,GAEpBpmB,EAAUz+B,UAAU6+B,QAAU,WAE5B,IADA,IAAIr8B,EAAQsiD,EACHhgD,EAAI,EAAGA,EAAI,KAAMA,EAAGtC,EAAMsC,GAAKxC,KAAK6gC,OAAOpd,YAAgB,EAAJjhB,GAehE,IAbA,IAAIsuB,EAAe,EAAV9wB,KAAKyiD,GACVxxB,EAAe,EAAVjxB,KAAK0iD,GACVrxB,EAAe,EAAVrxB,KAAK2iD,GACVpxB,EAAe,EAAVvxB,KAAK4iD,GACVjxB,EAAe,EAAV3xB,KAAK6kD,GAEVzc,EAAe,EAAVpoC,KAAKyiD,GACV0C,EAAe,EAAVnlD,KAAK0iD,GACV0C,EAAe,EAAVplD,KAAK2iD,GACV0C,EAAe,EAAVrlD,KAAK4iD,GACVzsB,EAAe,EAAVn2B,KAAK6kD,GAGLrjD,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC9B,IAAI8jD,EACAC,EACA/jD,EAAI,IACN8jD,EAAKR,EAAIh0B,EAAIG,EAAII,EAAIE,EAAII,EAAIzxB,EAAMqkD,EAAG/iD,IAAKmjD,EAAG,GAAIF,EAAGjjD,IACrD+jD,EAAKL,EAAI9c,EAAI+c,EAAIC,EAAIC,EAAIlvB,EAAIj2B,EAAMskD,EAAGhjD,IAAKojD,EAAG,GAAIF,EAAGljD,KAC5CA,EAAI,IACb8jD,EAAKP,EAAIj0B,EAAIG,EAAII,EAAIE,EAAII,EAAIzxB,EAAMqkD,EAAG/iD,IAAKmjD,EAAG,GAAIF,EAAGjjD,IACrD+jD,EAAKN,EAAI7c,EAAI+c,EAAIC,EAAIC,EAAIlvB,EAAIj2B,EAAMskD,EAAGhjD,IAAKojD,EAAG,GAAIF,EAAGljD,KAC5CA,EAAI,IACb8jD,EAAKN,EAAIl0B,EAAIG,EAAII,EAAIE,EAAII,EAAIzxB,EAAMqkD,EAAG/iD,IAAKmjD,EAAG,GAAIF,EAAGjjD,IACrD+jD,EAAKP,EAAI5c,EAAI+c,EAAIC,EAAIC,EAAIlvB,EAAIj2B,EAAMskD,EAAGhjD,IAAKojD,EAAG,GAAIF,EAAGljD,KAC5CA,EAAI,IACb8jD,EAAKL,EAAIn0B,EAAIG,EAAII,EAAIE,EAAII,EAAIzxB,EAAMqkD,EAAG/iD,IAAKmjD,EAAG,GAAIF,EAAGjjD,IACrD+jD,EAAKR,EAAI3c,EAAI+c,EAAIC,EAAIC,EAAIlvB,EAAIj2B,EAAMskD,EAAGhjD,IAAKojD,EAAG,GAAIF,EAAGljD,MAErD8jD,EAAKJ,EAAIp0B,EAAIG,EAAII,EAAIE,EAAII,EAAIzxB,EAAMqkD,EAAG/iD,IAAKmjD,EAAG,GAAIF,EAAGjjD,IACrD+jD,EAAKT,EAAI1c,EAAI+c,EAAIC,EAAIC,EAAIlvB,EAAIj2B,EAAMskD,EAAGhjD,IAAKojD,EAAG,GAAIF,EAAGljD,KAGvDsvB,EAAKa,EACLA,EAAKJ,EACLA,EAAKsxB,EAAKxxB,EAAI,IACdA,EAAKJ,EACLA,EAAKq0B,EAELld,EAAKjS,EACLA,EAAKkvB,EACLA,EAAKxC,EAAKuC,EAAI,IACdA,EAAKD,EACLA,EAAKI,CACP,CAGA,IAAI1/C,EAAK7F,KAAK0iD,GAAKrxB,EAAKg0B,EAAM,EAC9BrlD,KAAK0iD,GAAM1iD,KAAK2iD,GAAKpxB,EAAK4E,EAAM,EAChCn2B,KAAK2iD,GAAM3iD,KAAK4iD,GAAKjxB,EAAKyW,EAAM,EAChCpoC,KAAK4iD,GAAM5iD,KAAK6kD,GAAK/zB,EAAKq0B,EAAM,EAChCnlD,KAAK6kD,GAAM7kD,KAAKyiD,GAAKxxB,EAAKm0B,EAAM,EAChCplD,KAAKyiD,GAAK58C,CACZ,EAEAs2B,EAAUz+B,UAAUszC,QAAU,WAE5BhxC,KAAK6gC,OAAO7gC,KAAKmjD,gBAAkB,IAC/BnjD,KAAKmjD,aAAe,KACtBnjD,KAAK6gC,OAAO5hC,KAAK,EAAGe,KAAKmjD,aAAc,IACvCnjD,KAAKu8B,UACLv8B,KAAKmjD,aAAe,GAGtBnjD,KAAK6gC,OAAO5hC,KAAK,EAAGe,KAAKmjD,aAAc,IACvCnjD,KAAK6gC,OAAOjc,cAAc5kB,KAAKojD,QAAQ,GAAI,IAC3CpjD,KAAK6gC,OAAOjc,cAAc5kB,KAAKojD,QAAQ,GAAI,IAC3CpjD,KAAKu8B,UAGL,IAAIt+B,EAASC,EAAOU,MAAQV,EAAOU,MAAM,IAAM,IAAIV,EAAO,IAM1D,OALAD,EAAOsnB,aAAavlB,KAAKyiD,GAAI,GAC7BxkD,EAAOsnB,aAAavlB,KAAK0iD,GAAI,GAC7BzkD,EAAOsnB,aAAavlB,KAAK2iD,GAAI,GAC7B1kD,EAAOsnB,aAAavlB,KAAK4iD,GAAI,IAC7B3kD,EAAOsnB,aAAavlB,KAAK6kD,GAAI,IACtB5mD,CACT,EA0BAhB,EAAOD,QAAUm/B,aClKjB,IAAIn/B,EAAUC,EAAOD,QAAU,SAAcw6C,GAC3CA,EAAYA,EAAU37B,cAEtB,IAAI2pC,EAAYxoD,EAAQw6C,GACxB,IAAKgO,EAAW,MAAM,IAAI/lD,MAAM+3C,EAAY,+CAE5C,OAAO,IAAIgO,CACb,EAEAxoD,EAAQo/B,IAAM,EAAQ,KACtBp/B,EAAQolD,KAAO,EAAQ,KACvBplD,EAAQqlD,OAAS,EAAQ,KACzBrlD,EAAQ6kD,OAAS,EAAQ,IACzB7kD,EAAQ8kD,OAAS,EAAQ,KACzB9kD,EAAQ+kD,OAAS,EAAQ,4BCTzB,IAAIsB,EAA6B,mCAYjC,SAASpJ,IAAQ,CAoEjBh9C,EAAOD,QAhEP,SAASsmD,EAAIC,EAAQ5d,EAAMsa,GACzB,GAAoB,mBAATta,EAAqB,OAAO2d,EAAIC,EAAQ,KAAM5d,GACpDA,IAAMA,EAAO,CAAC,GACnBsa,EAlBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACL,IAAIA,EAAJ,CACAA,GAAS,EACT,IAAK,IAAIxiB,EAAOvlB,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAC/EnxB,EAAKmxB,GAAQhoC,UAAUgoC,GAEzBxD,EAAShhC,MAAMjf,KAAMsyB,EALH,CAMpB,CACF,CAQaQ,CAAKmtB,GAAYhG,GAC5B,IAAIhO,EAAWtG,EAAKsG,WAA8B,IAAlBtG,EAAKsG,UAAsBsX,EAAOtX,SAC9DnuC,EAAW6nC,EAAK7nC,WAA8B,IAAlB6nC,EAAK7nC,UAAsBylD,EAAOzlD,SAC9D4lD,EAAiB,WACdH,EAAOzlD,UAAU6lD,GACxB,EACIC,EAAgBL,EAAOpX,gBAAkBoX,EAAOpX,eAAe0X,SAC/DF,EAAW,WACb7lD,GAAW,EACX8lD,GAAgB,EACX3X,GAAUgU,EAAS3oC,KAAKisC,EAC/B,EACIO,EAAgBP,EAAO/W,gBAAkB+W,EAAO/W,eAAeuX,WAC/D7X,EAAQ,WACVD,GAAW,EACX6X,GAAgB,EACXhmD,GAAUmiD,EAAS3oC,KAAKisC,EAC/B,EACIS,EAAU,SAAiB5wB,GAC7B6sB,EAAS3oC,KAAKisC,EAAQnwB,EACxB,EACI6wB,EAAU,WACZ,IAAI7wB,EACJ,OAAI6Y,IAAa6X,GACVP,EAAO/W,gBAAmB+W,EAAO/W,eAAeJ,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,IAE3Bt1B,IAAa8lD,GACVL,EAAOpX,gBAAmBoX,EAAOpX,eAAeC,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,SAF/B,CAIF,EACI8wB,EAAY,WACdX,EAAOY,IAAIzwB,GAAG,SAAUiwB,EAC1B,EAcA,OAtDF,SAAmBJ,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuCMC,CAAUf,IACZA,EAAO7vB,GAAG,WAAYiwB,GACtBJ,EAAO7vB,GAAG,QAASuwB,GACfV,EAAOY,IAAKD,IAAiBX,EAAO7vB,GAAG,UAAWwwB,IAC7CpmD,IAAaylD,EAAOpX,iBAE7BoX,EAAO7vB,GAAG,MAAOgwB,GACjBH,EAAO7vB,GAAG,QAASgwB,IAErBH,EAAO7vB,GAAG,MAAOwY,GACjBqX,EAAO7vB,GAAG,SAAUiwB,IACD,IAAfhe,EAAKlmB,OAAiB8jC,EAAO7vB,GAAG,QAASswB,GAC7CT,EAAO7vB,GAAG,QAASuwB,GACZ,WACLV,EAAOlwB,eAAe,WAAYswB,GAClCJ,EAAOlwB,eAAe,QAAS4wB,GAC/BV,EAAOlwB,eAAe,UAAW6wB,GAC7BX,EAAOY,KAAKZ,EAAOY,IAAI9wB,eAAe,SAAUswB,GACpDJ,EAAOlwB,eAAe,MAAOqwB,GAC7BH,EAAOlwB,eAAe,QAASqwB,GAC/BH,EAAOlwB,eAAe,SAAUswB,GAChCJ,EAAOlwB,eAAe,MAAO6Y,GAC7BqX,EAAOlwB,eAAe,QAAS2wB,GAC/BT,EAAOlwB,eAAe,QAAS4wB,EACjC,CACF,0BClFA,IAAIhL,EAAe,EAAQ,IAEvBwM,EAAW,EAAQ,IAEnBC,EAAWD,EAASxM,EAAa,6BAErCh8C,EAAOD,QAAU,SAA4Bka,EAAM29B,GAClD,IAAIS,EAAY2D,EAAa/hC,IAAQ29B,GACrC,MAAyB,mBAAdS,GAA4BoQ,EAASxuC,EAAM,gBAAkB,EAChEuuC,EAASnQ,GAEVA,CACR,0BCZA,IAAIqQ,EAAiB,EAAQ,KAE7B1oD,EAAOD,QAAUu1B,SAAS70B,UAAU23B,MAAQswB,0BCF5C3oD,EAAQs6B,YAAct6B,EAAQ4oD,IAAM5oD,EAAQ6oD,kBAAoB7oD,EAAQ8oD,KAAO,EAAf,IAChE9oD,EAAQ+oD,WAAa/oD,EAAQq/B,KAAO,EAAf,IACrBr/B,EAAQgpD,WAAahpD,EAAQipD,KAAO,EAAf,KAErB,IAAIC,EAAQ,EAAQ,KAChBC,EAAW9oD,OAAOkrB,KAAK29B,GACvBE,EAAS,CAAC,OAAQ,SAAU,SAAU,SAAU,SAAU,MAAO,UAAUrmC,OAAOomC,GACtFnpD,EAAQqpD,UAAY,WAClB,OAAOD,CACT,EAEA,IAAIr3C,EAAI,EAAQ,KAChB/R,EAAQspD,OAASv3C,EAAEu3C,OACnBtpD,EAAQs7C,WAAavpC,EAAEupC,WAEvB,IAAIiO,EAAM,EAAQ,KAElBvpD,EAAQwpD,OAASD,EAAIC,OACrBxpD,EAAQypD,aAAeF,EAAIE,aAC3BzpD,EAAQ0pD,SAAWH,EAAIG,SACvB1pD,EAAQ2pD,eAAiBJ,EAAII,eAC7B3pD,EAAQ4pD,SAAWL,EAAIK,SACvB5pD,EAAQ6pD,eAAiBN,EAAIM,eAC7B7pD,EAAQ8pD,WAAaP,EAAIO,WACzB9pD,EAAQu7C,iBAAmBgO,EAAIhO,iBAC/Bv7C,EAAQ+pD,WAAaR,EAAIQ,WACzB/pD,EAAQgqD,YAAcT,EAAIS,YAE1B,IAAI11B,EAAK,EAAQ,KAEjBt0B,EAAQiqD,mBAAqB31B,EAAG21B,mBAChCjqD,EAAQkqD,yBAA2B51B,EAAG41B,yBACtClqD,EAAQmqD,iBAAmB71B,EAAG61B,iBAC9BnqD,EAAQoqD,oBAAsB91B,EAAG81B,oBACjCpqD,EAAQqqD,cAAgB/1B,EAAG+1B,cAE3B,IAAIC,EAAO,EAAQ,KAEnBtqD,EAAQuqD,WAAaD,EAAKC,WAC1BvqD,EAAQwqD,KAAOF,EAAKE,KACpBxqD,EAAQyqD,aAAeH,EAAKG,aAC5BzqD,EAAQ0qD,OAASJ,EAAKI,OAEtB1qD,EAAQ2qD,WAAa,EAArB,KAEA,IAAIC,EAAgB,EAAQ,KAE5B5qD,EAAQ4qD,cAAgBA,EAAcA,cACtC5qD,EAAQ6qD,eAAiBD,EAAcC,eACvC7qD,EAAQ8qD,cAAgBF,EAAcE,cACtC9qD,EAAQ+qD,eAAiBH,EAAcG,eAevC,IAAIC,EAAK,EAAQ,KAEjBhrD,EAAQirD,WAAaD,EAAGC,WACxBjrD,EAAQkrD,eAAiBF,EAAGE,eAE5BlrD,EAAQmrD,kBAAoB,WAC1B,MAAM,IAAI1oD,MAAM,CACd,kDACA,0BACA,0DACAy5B,KAAK,MACT,EAEAl8B,EAAQorD,UAAY,CAClB,0BAA6B,EAC7B,qBAAwB,EACxB,6BAAgC,EAChC,0BAA6B,EAC7B,YAAe,EACf,aAAgB,EAChB,kBAAqB,EACrB,mBAAsB,EACtB,eAAkB,EAClB,uBAA0B,EAC1B,iBAAoB,EACpB,sBAAyB,EACzB,4BAA+B,EAC/B,8BAAiC,EACjC,wBAA2B,2BC7F7B,IAAI9oD,EAAS,EAAQ,GAErB,SAASknD,EAAO36B,GACd7rB,KAAK6rB,QAAUA,EAEf7rB,KAAKkb,KAAOlb,KAAK6rB,QAAQ3Q,KACzBlb,KAAK06B,UAAY,EACjB16B,KAAKI,QAELJ,KAAK/B,OAAS,IAAIyD,MAAM1B,KAAK06B,WAC7B16B,KAAKqoD,UAAY,CACnB,CACAprD,EAAOD,QAAUwpD,EAEjBA,EAAO9oD,UAAU0C,MAAQ,WAEzB,EAEAomD,EAAO9oD,UAAU29B,OAAS,SAAgBlgB,GACxC,OAAoB,IAAhBA,EAAKzc,OACA,GAES,YAAdsB,KAAKkb,KACAlb,KAAKsoD,eAAentC,GAEpBnb,KAAKuoD,eAAeptC,EAC/B,EAEAqrC,EAAO9oD,UAAU8qD,QAAU,SAAiBrtC,EAAMzY,GAGhD,IADA,IAAInB,EAAMD,KAAKC,IAAIvB,KAAK/B,OAAOS,OAASsB,KAAKqoD,UAAWltC,EAAKzc,OAASgE,GAC7DlB,EAAI,EAAGA,EAAID,EAAKC,IACvBxB,KAAK/B,OAAO+B,KAAKqoD,UAAY7mD,GAAK2Z,EAAKzY,EAAMlB,GAI/C,OAHAxB,KAAKqoD,WAAa9mD,EAGXA,CACT,EAEAilD,EAAO9oD,UAAU+qD,aAAe,SAAsB1kD,EAAKrB,GAGzD,OAFA1C,KAAKu8B,QAAQv8B,KAAK/B,OAAQ,EAAG8F,EAAKrB,GAClC1C,KAAKqoD,UAAY,EACVroD,KAAK06B,SACd,EAEA8rB,EAAO9oD,UAAU6qD,eAAiB,SAAwBptC,GACxD,IAAIutC,EAAW,EACXC,EAAY,EAEZ9zB,GAAU70B,KAAKqoD,UAAYltC,EAAKzc,QAAUsB,KAAK06B,UAAa,EAC5D32B,EAAM,IAAIrC,MAAMmzB,EAAQ70B,KAAK06B,WAEV,IAAnB16B,KAAKqoD,YACPK,GAAY1oD,KAAKwoD,QAAQrtC,EAAMutC,GAE3B1oD,KAAKqoD,YAAcroD,KAAK/B,OAAOS,SACjCiqD,GAAa3oD,KAAKyoD,aAAa1kD,EAAK4kD,KAKxC,IADA,IAAI/mD,EAAMuZ,EAAKzc,QAAWyc,EAAKzc,OAASgqD,GAAY1oD,KAAK06B,UAClDguB,EAAW9mD,EAAK8mD,GAAY1oD,KAAK06B,UACtC16B,KAAKu8B,QAAQphB,EAAMutC,EAAU3kD,EAAK4kD,GAClCA,GAAa3oD,KAAK06B,UAIpB,KAAOguB,EAAWvtC,EAAKzc,OAAQgqD,IAAY1oD,KAAKqoD,YAC9CroD,KAAK/B,OAAO+B,KAAKqoD,WAAaltC,EAAKutC,GAErC,OAAO3kD,CACT,EAEAyiD,EAAO9oD,UAAU4qD,eAAiB,SAAwBntC,GAQxD,IAPA,IAAIutC,EAAW,EACXC,EAAY,EAEZ9zB,EAAQvzB,KAAKiB,MAAMvC,KAAKqoD,UAAYltC,EAAKzc,QAAUsB,KAAK06B,WAAa,EACrE32B,EAAM,IAAIrC,MAAMmzB,EAAQ70B,KAAK06B,WAG1B7F,EAAQ,EAAGA,IAChB6zB,GAAY1oD,KAAKwoD,QAAQrtC,EAAMutC,GAC/BC,GAAa3oD,KAAKyoD,aAAa1kD,EAAK4kD,GAMtC,OAFAD,GAAY1oD,KAAKwoD,QAAQrtC,EAAMutC,GAExB3kD,CACT,EAEAyiD,EAAO9oD,UAAUs/B,MAAQ,SAAe/+B,GACtC,IAAI+kB,EAIAC,EAMJ,OATIhlB,IACF+kB,EAAQhjB,KAAKq7B,OAAOp9B,IAIpBglB,EADgB,YAAdjjB,KAAKkb,KACAlb,KAAK4oD,gBAEL5oD,KAAK6oD,gBAEV7lC,EACKA,EAAMjD,OAAOkD,GAEbA,CACX,EAEAujC,EAAO9oD,UAAUqzC,KAAO,SAAc9yC,EAAQyE,GAC5C,GAAY,IAARA,EACF,OAAO,EAET,KAAOA,EAAMzE,EAAOS,QAClBT,EAAOyE,KAAS,EAElB,OAAO,CACT,EAEA8jD,EAAO9oD,UAAUkrD,cAAgB,WAC/B,IAAK5oD,KAAK+wC,KAAK/wC,KAAK/B,OAAQ+B,KAAKqoD,WAC/B,MAAO,GAET,IAAItkD,EAAM,IAAIrC,MAAM1B,KAAK06B,WAEzB,OADA16B,KAAKu8B,QAAQv8B,KAAK/B,OAAQ,EAAG8F,EAAK,GAC3BA,CACT,EAEAyiD,EAAO9oD,UAAUorD,OAAS,SAAgB7qD,GACxC,OAAOA,CACT,EAEAuoD,EAAO9oD,UAAUmrD,cAAgB,WAC/BvpD,EAAOksB,MAAMxrB,KAAKqoD,UAAWroD,KAAK06B,UAAW,8BAC7C,IAAI32B,EAAM,IAAIrC,MAAM1B,KAAK06B,WAGzB,OAFA16B,KAAKyoD,aAAa1kD,EAAK,GAEhB/D,KAAK8oD,OAAO/kD,EACrB,aC5IA,IAAIglD,EAAc,CAChBC,IAAK,EAAQ,KACbC,IAAK,EAAQ,KACbC,IAAK,EAAQ,KACbC,KAAM,EAAQ,KACdC,KAAM,EAAQ,KACdC,IAAK,EAAQ,KACbC,IAAK,EAAQ,KACbC,IAAK,EAAQ,MAGXC,EAAQ,EAAQ,KAEpB,IAAK,IAAIlrD,KAAOkrD,EACdA,EAAMlrD,GAAKrB,OAAS8rD,EAAYS,EAAMlrD,GAAKgU,MAG7CrV,EAAOD,QAAUwsD,aCZjB,IAAItrD,EAAS,YAEb,SAASurD,EAAetqD,GACjBjB,EAAO6c,SAAS5b,KAAMA,EAAMjB,EAAOS,KAAKQ,IAK7C,IAHA,IAAIkC,EAAOlC,EAAIT,OAAS,EAAK,EACzBqF,EAAM,IAAIrC,MAAML,GAEXG,EAAI,EAAGA,EAAIH,EAAKG,IACvBuC,EAAIvC,GAAKrC,EAAIyjB,aAAiB,EAAJphB,GAG5B,OAAOuC,CACT,CAEA,SAAS2lD,EAAU5d,GACjB,KAAa,EAAOA,EAAEptC,OAAQotC,IAC5BA,EADW,GACJ,CAEX,CAEA,SAAS6d,EAAYzG,EAAG0G,EAAaC,EAASC,EAAMC,GAalD,IAZA,IASIC,EAAIC,EAAIC,EAAIC,EATZC,EAAWP,EAAQ,GACnBQ,EAAWR,EAAQ,GACnBS,EAAWT,EAAQ,GACnBU,EAAWV,EAAQ,GAEnBW,EAAKtH,EAAE,GAAK0G,EAAY,GACxBa,EAAKvH,EAAE,GAAK0G,EAAY,GACxBc,EAAKxH,EAAE,GAAK0G,EAAY,GACxBe,EAAKzH,EAAE,GAAK0G,EAAY,GAExBgB,EAAQ,EAEH96C,EAAQ,EAAGA,EAAQi6C,EAASj6C,IACnCk6C,EAAKI,EAASI,IAAO,IAAMH,EAAUI,IAAO,GAAM,KAAQH,EAAUI,IAAO,EAAK,KAAQH,EAAc,IAALI,GAAaf,EAAYgB,KAC1HX,EAAKG,EAASK,IAAO,IAAMJ,EAAUK,IAAO,GAAM,KAAQJ,EAAUK,IAAO,EAAK,KAAQJ,EAAc,IAALC,GAAaZ,EAAYgB,KAC1HV,EAAKE,EAASM,IAAO,IAAML,EAAUM,IAAO,GAAM,KAAQL,EAAUE,IAAO,EAAK,KAAQD,EAAc,IAALE,GAAab,EAAYgB,KAC1HT,EAAKC,EAASO,IAAO,IAAMN,EAAUG,IAAO,GAAM,KAAQF,EAAUG,IAAO,EAAK,KAAQF,EAAc,IAALG,GAAad,EAAYgB,KAC1HJ,EAAKR,EACLS,EAAKR,EACLS,EAAKR,EACLS,EAAKR,EAYP,OATAH,GAAOF,EAAKU,IAAO,KAAO,GAAOV,EAAMW,IAAO,GAAM,MAAS,GAAOX,EAAMY,IAAO,EAAK,MAAS,EAAKZ,EAAU,IAALa,IAAcf,EAAYgB,KACnIX,GAAOH,EAAKW,IAAO,KAAO,GAAOX,EAAMY,IAAO,GAAM,MAAS,GAAOZ,EAAMa,IAAO,EAAK,MAAS,EAAKb,EAAU,IAALU,IAAcZ,EAAYgB,KACnIV,GAAOJ,EAAKY,IAAO,KAAO,GAAOZ,EAAMa,IAAO,GAAM,MAAS,GAAOb,EAAMU,IAAO,EAAK,MAAS,EAAKV,EAAU,IAALW,IAAcb,EAAYgB,KACnIT,GAAOL,EAAKa,IAAO,KAAO,GAAOb,EAAMU,IAAO,GAAM,MAAS,GAAOV,EAAMW,IAAO,EAAK,MAAS,EAAKX,EAAU,IAALY,IAAcd,EAAYgB,KAM5H,CALPZ,KAAY,EACZC,KAAY,EACZC,KAAY,EACZC,KAAY,EAGd,CAGA,IAAIU,EAAO,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IACpEC,EAAI,WAGN,IADA,IAAIp6B,EAAI,IAAIhvB,MAAM,KACTc,EAAI,EAAGA,EAAI,IAAKA,IAErBkuB,EAAEluB,GADAA,EAAI,IACCA,GAAK,EAEJA,GAAK,EAAK,IAYtB,IARA,IAAIsnD,EAAO,GACPiB,EAAW,GACXlB,EAAU,CAAC,GAAI,GAAI,GAAI,IACvBmB,EAAc,CAAC,GAAI,GAAI,GAAI,IAG3Bx9C,EAAI,EACJy9C,EAAK,EACAzpD,EAAI,EAAGA,EAAI,MAAOA,EAAG,CAE5B,IAAI0pD,EAAKD,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EACzDC,EAAMA,IAAO,EAAW,IAALA,EAAa,GAChCpB,EAAKt8C,GAAK09C,EACVH,EAASG,GAAM19C,EAGf,IAAI2G,EAAKuc,EAAEljB,GACP29C,EAAKz6B,EAAEvc,GACPi3C,EAAK16B,EAAEy6B,GAGPtlD,EAAa,IAAR6qB,EAAEw6B,GAAqB,SAALA,EAC3BrB,EAAQ,GAAGr8C,GAAM3H,GAAK,GAAOA,IAAM,EACnCgkD,EAAQ,GAAGr8C,GAAM3H,GAAK,GAAOA,IAAM,GACnCgkD,EAAQ,GAAGr8C,GAAM3H,GAAK,EAAMA,IAAM,GAClCgkD,EAAQ,GAAGr8C,GAAK3H,EAGhBA,EAAU,SAALulD,EAAwB,MAALD,EAAsB,IAALh3C,EAAmB,SAAJ3G,EACxDw9C,EAAY,GAAGE,GAAOrlD,GAAK,GAAOA,IAAM,EACxCmlD,EAAY,GAAGE,GAAOrlD,GAAK,GAAOA,IAAM,GACxCmlD,EAAY,GAAGE,GAAOrlD,GAAK,EAAMA,IAAM,GACvCmlD,EAAY,GAAGE,GAAMrlD,EAEX,IAAN2H,EACFA,EAAIy9C,EAAK,GAETz9C,EAAI2G,EAAKuc,EAAEA,EAAEA,EAAE06B,EAAKj3C,KACpB82C,GAAMv6B,EAAEA,EAAEu6B,IAEd,CAEA,MAAO,CACLnB,KAAMA,EACNiB,SAAUA,EACVlB,QAASA,EACTmB,YAAaA,EAEhB,CA3DO,GA6DR,SAASK,EAAK/sD,GACZ0B,KAAKyjD,KAAOgG,EAAcnrD,GAC1B0B,KAAKsrD,QACP,CAEAD,EAAI3wB,UAAY,GAChB2wB,EAAIE,QAAU,GACdF,EAAI3tD,UAAUg9B,UAAY2wB,EAAI3wB,UAC9B2wB,EAAI3tD,UAAU6tD,QAAUF,EAAIE,QAC5BF,EAAI3tD,UAAU4tD,OAAS,WAOrB,IANA,IAAIE,EAAWxrD,KAAKyjD,KAChB8H,EAAUC,EAAS9sD,OACnBqrD,EAAUwB,EAAU,EACpBE,EAAyB,GAAf1B,EAAU,GAEpBH,EAAc,GACTxlD,EAAI,EAAGA,EAAImnD,EAASnnD,IAC3BwlD,EAAYxlD,GAAKonD,EAASpnD,GAG5B,IAAKA,EAAImnD,EAASnnD,EAAIqnD,EAAQrnD,IAAK,CACjC,IAAIyB,EAAI+jD,EAAYxlD,EAAI,GAEpBA,EAAImnD,GAAY,GAClB1lD,EAAKA,GAAK,EAAMA,IAAM,GACtBA,EACGilD,EAAEhB,KAAKjkD,IAAM,KAAO,GACpBilD,EAAEhB,KAAMjkD,IAAM,GAAM,MAAS,GAC7BilD,EAAEhB,KAAMjkD,IAAM,EAAK,MAAS,EAC5BilD,EAAEhB,KAAS,IAAJjkD,GAEVA,GAAKglD,EAAMzmD,EAAImnD,EAAW,IAAM,IACvBA,EAAU,GAAKnnD,EAAImnD,GAAY,IACxC1lD,EACGilD,EAAEhB,KAAKjkD,IAAM,KAAO,GACpBilD,EAAEhB,KAAMjkD,IAAM,GAAM,MAAS,GAC7BilD,EAAEhB,KAAMjkD,IAAM,EAAK,MAAS,EAC5BilD,EAAEhB,KAAS,IAAJjkD,IAGZ+jD,EAAYxlD,GAAKwlD,EAAYxlD,EAAImnD,GAAW1lD,CAC9C,CAGA,IADA,IAAI6lD,EAAiB,GACZC,EAAK,EAAGA,EAAKF,EAAQE,IAAM,CAClC,IAAIC,EAAMH,EAASE,EACfE,EAAKjC,EAAYgC,GAAOD,EAAK,EAAI,EAAI,IAGvCD,EAAeC,GADbA,EAAK,GAAKC,GAAO,EACEC,EAGnBf,EAAEE,YAAY,GAAGF,EAAEhB,KAAK+B,IAAO,KAC/Bf,EAAEE,YAAY,GAAGF,EAAEhB,KAAM+B,IAAO,GAAM,MACtCf,EAAEE,YAAY,GAAGF,EAAEhB,KAAM+B,IAAO,EAAK,MACrCf,EAAEE,YAAY,GAAGF,EAAEhB,KAAU,IAAL+B,GAE9B,CAEA7rD,KAAK8rD,SAAW/B,EAChB/pD,KAAK+rD,aAAenC,EACpB5pD,KAAKgsD,gBAAkBN,CACzB,EAEAL,EAAI3tD,UAAUuuD,gBAAkB,SAAU/I,GAExC,OAAOyG,EADPzG,EAAIuG,EAAcvG,GACGljD,KAAK+rD,aAAcjB,EAAEjB,QAASiB,EAAEhB,KAAM9pD,KAAK8rD,SAClE,EAEAT,EAAI3tD,UAAUwuD,aAAe,SAAUhJ,GACrC,IAAIn/C,EAAM/D,KAAKisD,gBAAgB/I,GAC3B/jD,EAAMjB,EAAOW,YAAY,IAK7B,OAJAM,EAAI2lB,cAAc/gB,EAAI,GAAI,GAC1B5E,EAAI2lB,cAAc/gB,EAAI,GAAI,GAC1B5E,EAAI2lB,cAAc/gB,EAAI,GAAI,GAC1B5E,EAAI2lB,cAAc/gB,EAAI,GAAI,IACnB5E,CACT,EAEAksD,EAAI3tD,UAAUyuD,aAAe,SAAUjJ,GAIrC,IAAIkJ,GAHJlJ,EAAIuG,EAAcvG,IAGP,GACXA,EAAE,GAAKA,EAAE,GACTA,EAAE,GAAKkJ,EAEP,IAAIroD,EAAM4lD,EAAWzG,EAAGljD,KAAKgsD,gBAAiBlB,EAAEE,YAAaF,EAAEC,SAAU/qD,KAAK8rD,UAC1E3sD,EAAMjB,EAAOW,YAAY,IAK7B,OAJAM,EAAI2lB,cAAc/gB,EAAI,GAAI,GAC1B5E,EAAI2lB,cAAc/gB,EAAI,GAAI,GAC1B5E,EAAI2lB,cAAc/gB,EAAI,GAAI,GAC1B5E,EAAI2lB,cAAc/gB,EAAI,GAAI,IACnB5E,CACT,EAEAksD,EAAI3tD,UAAU2uD,MAAQ,WACpB3C,EAAS1pD,KAAK+rD,cACdrC,EAAS1pD,KAAKgsD,iBACdtC,EAAS1pD,KAAKyjD,KAChB,EAEAxmD,EAAOD,QAAQquD,IAAMA,0BC9NrB,IAAIhI,EAA6B,mCAYjC,SAASpJ,IAAQ,CAoEjBh9C,EAAOD,QAhEP,SAASsmD,EAAIC,EAAQ5d,EAAMsa,GACzB,GAAoB,mBAATta,EAAqB,OAAO2d,EAAIC,EAAQ,KAAM5d,GACpDA,IAAMA,EAAO,CAAC,GACnBsa,EAlBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACL,IAAIA,EAAJ,CACAA,GAAS,EACT,IAAK,IAAIxiB,EAAOvlB,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAC/EnxB,EAAKmxB,GAAQhoC,UAAUgoC,GAEzBxD,EAAShhC,MAAMjf,KAAMsyB,EALH,CAMpB,CACF,CAQaQ,CAAKmtB,GAAYhG,GAC5B,IAAIhO,EAAWtG,EAAKsG,WAA8B,IAAlBtG,EAAKsG,UAAsBsX,EAAOtX,SAC9DnuC,EAAW6nC,EAAK7nC,WAA8B,IAAlB6nC,EAAK7nC,UAAsBylD,EAAOzlD,SAC9D4lD,EAAiB,WACdH,EAAOzlD,UAAU6lD,GACxB,EACIC,EAAgBL,EAAOpX,gBAAkBoX,EAAOpX,eAAe0X,SAC/DF,EAAW,WACb7lD,GAAW,EACX8lD,GAAgB,EACX3X,GAAUgU,EAAS3oC,KAAKisC,EAC/B,EACIO,EAAgBP,EAAO/W,gBAAkB+W,EAAO/W,eAAeuX,WAC/D7X,EAAQ,WACVD,GAAW,EACX6X,GAAgB,EACXhmD,GAAUmiD,EAAS3oC,KAAKisC,EAC/B,EACIS,EAAU,SAAiB5wB,GAC7B6sB,EAAS3oC,KAAKisC,EAAQnwB,EACxB,EACI6wB,EAAU,WACZ,IAAI7wB,EACJ,OAAI6Y,IAAa6X,GACVP,EAAO/W,gBAAmB+W,EAAO/W,eAAeJ,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,IAE3Bt1B,IAAa8lD,GACVL,EAAOpX,gBAAmBoX,EAAOpX,eAAeC,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,SAF/B,CAIF,EACI8wB,EAAY,WACdX,EAAOY,IAAIzwB,GAAG,SAAUiwB,EAC1B,EAcA,OAtDF,SAAmBJ,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuCMC,CAAUf,IACZA,EAAO7vB,GAAG,WAAYiwB,GACtBJ,EAAO7vB,GAAG,QAASuwB,GACfV,EAAOY,IAAKD,IAAiBX,EAAO7vB,GAAG,UAAWwwB,IAC7CpmD,IAAaylD,EAAOpX,iBAE7BoX,EAAO7vB,GAAG,MAAOgwB,GACjBH,EAAO7vB,GAAG,QAASgwB,IAErBH,EAAO7vB,GAAG,MAAOwY,GACjBqX,EAAO7vB,GAAG,SAAUiwB,IACD,IAAfhe,EAAKlmB,OAAiB8jC,EAAO7vB,GAAG,QAASswB,GAC7CT,EAAO7vB,GAAG,QAASuwB,GACZ,WACLV,EAAOlwB,eAAe,WAAYswB,GAClCJ,EAAOlwB,eAAe,QAAS4wB,GAC/BV,EAAOlwB,eAAe,UAAW6wB,GAC7BX,EAAOY,KAAKZ,EAAOY,IAAI9wB,eAAe,SAAUswB,GACpDJ,EAAOlwB,eAAe,MAAOqwB,GAC7BH,EAAOlwB,eAAe,QAASqwB,GAC/BH,EAAOlwB,eAAe,SAAUswB,GAChCJ,EAAOlwB,eAAe,MAAO6Y,GAC7BqX,EAAOlwB,eAAe,QAAS2wB,GAC/BT,EAAOlwB,eAAe,QAAS4wB,EACjC,CACF,aCpFA,IAAItkD,EAAK,EAAQ,KACb23B,EAAc,EAAQ,IAQ1B,SAASg1B,EAAMC,GACb,IACIxrD,EADAM,EAAMkrD,EAAKC,QAAQpnD,aAEvB,GACErE,EAAI,IAAIpB,EAAG23B,EAAYj2B,UAChBN,EAAEgB,IAAIwqD,EAAKC,UAAY,IAAMzrD,EAAE+R,KAAKy5C,EAAKE,UAAY1rD,EAAE+R,KAAKy5C,EAAKG,SAC1E,OAAO3rD,CACT,CAEA,SAAS4rD,EAAKntD,EAAK+sD,GACjB,IAAIK,EAhBN,SAAgBL,GACd,IAAIxrD,EAAIurD,EAAKC,GAEb,MAAO,CAAEM,QADK9rD,EAAEqU,MAAMzV,EAAGwZ,KAAKozC,EAAKC,UAAU71C,OAAO,IAAIhX,EAAG4sD,EAAKO,iBAAiBt3C,UACtDu3C,UAAWhsD,EAAEuT,KAAKi4C,EAAKC,SACpD,CAYeQ,CAAMT,GACflrD,EAAMkrD,EAAKC,QAAQpnD,aACnB6nD,EAAU,IAAIttD,EAAGH,GAAK4B,IAAIwrD,EAAOC,SAAS/5C,KAAKy5C,EAAKC,SACpDU,EAAKD,EAAQ73C,MAAMzV,EAAGwZ,KAAKozC,EAAKE,SAChCU,EAAKF,EAAQ73C,MAAMzV,EAAGwZ,KAAKozC,EAAKG,SAChCU,EAAOb,EAAKc,YACZt+C,EAAIw9C,EAAKE,OACTjnD,EAAI+mD,EAAKG,OACTN,EAAKc,EAAGv2C,OAAO41C,EAAKe,WAAW93C,UAC/B+3C,EAAKJ,EAAGx2C,OAAO41C,EAAKiB,WAAWh4C,UAC/BnE,EAAI+6C,EAAGrkD,KAAKwlD,GAAIrhD,KAAKkhD,GAAMt6C,KAAK/D,GAAG7C,KAAK1G,GAC5C,OAAO+nD,EAAGzlD,KAAKuJ,GAAGnF,KAAK0gD,EAAOG,WAAWj6C,KAAKy5C,EAAKC,SAAStnD,YAAYhH,OAAQ,KAAMmD,EACxF,CACAsrD,EAAIL,KAAOA,EAEXrvD,EAAOD,QAAU2vD,0BC9BjB,IAKIruD,EALAL,EAAS,EAAQ,GACjBC,EAASD,EAAOC,OAEhBuvD,EAAQ,CAAC,EAIb,IAAKnvD,KAAOL,EACLA,EAAOiwB,eAAe5vB,IACf,eAARA,GAAgC,WAARA,IAC5BmvD,EAAMnvD,GAAOL,EAAOK,IAGtB,IAAIovD,EAAQD,EAAMvvD,OAAS,CAAC,EAC5B,IAAKI,KAAOJ,EACLA,EAAOgwB,eAAe5vB,IACf,gBAARA,GAAiC,oBAARA,IAC7BovD,EAAMpvD,GAAOJ,EAAOI,IAqCtB,GAlCAmvD,EAAMvvD,OAAOR,UAAYQ,EAAOR,UAE3BgwD,EAAM/uD,MAAQ+uD,EAAM/uD,OAASkb,WAAWlb,OAC3C+uD,EAAM/uD,KAAO,SAAUf,EAAOa,EAAkBC,GAC9C,GAAqB,iBAAVd,EACT,MAAM,IAAImB,UAAU,yEAA2EnB,GAEjG,GAAIA,QAAiC,IAAjBA,EAAMc,OACxB,MAAM,IAAIK,UAAU,yHAA2HnB,GAEjJ,OAAOM,EAAON,EAAOa,EAAkBC,EACzC,GAGGgvD,EAAM9uD,QACT8uD,EAAM9uD,MAAQ,SAAUI,EAAMC,EAAMC,GAClC,GAAoB,iBAATF,EACT,MAAM,IAAID,UAAU,oEAAsEC,GAE5F,GAAIA,EAAO,GAAKA,GAAQ,GAAK,GAAK,IAChC,MAAM,IAAI4a,WAAW,cAAgB5a,EAAO,kCAE9C,IAAIG,EAAMjB,EAAOc,GAQjB,OAPKC,GAAwB,IAAhBA,EAAKP,OAEa,iBAAbQ,EAChBC,EAAIF,KAAKA,EAAMC,GAEfC,EAAIF,KAAKA,GAJTE,EAAIF,KAAK,GAMJE,CACT,IAGGsuD,EAAME,iBACT,IACEF,EAAME,iBAAmB//B,QAAQggC,QAAQ,UAAUD,gBACrD,CAAE,MAAOptD,GAGT,CAGGktD,EAAMrF,YACTqF,EAAMrF,UAAY,CAChByF,WAAYJ,EAAMtuC,YAEhBsuC,EAAME,mBACRF,EAAMrF,UAAU0F,kBAAoBL,EAAME,mBAI9C1wD,EAAOD,QAAUywD,0BC1EjB,MAAMM,EAAW,SACXC,EAAgB,QAChBC,EAAgB,QAChB3uD,EAAS,EAAQ,GAGjB4uD,EAAO,CACX,MAAO,QAAS,MAAO,QAAS,QAAS,OACzC,UAAW,UAAW,QAAS,OAAQ,MAAO,UAC9C,SAAU,SAAU,UAAW,SAAU,WAAY,SAAU,YAC/D,SAAU,SAAU,WAAY,SAAU,SAAU,UAAW,YAI3D/rB,EAAU,CACd,MAAO,MAAO,MAAO,WAAY,WAAY,WAAY,MAAO,SAChE,MAAO,YACPpiB,OAAOmuC,GAYT,SAASC,EAAKl+B,EAAKmP,EAAQloB,GACzB,MAAMie,EAAQ,CAAC,EACfn1B,KAAKouD,WAAaj5B,EAElBA,EAAMje,KAAOA,EACbie,EAAMlF,IAAMA,EAEZkF,EAAMiK,OAASA,GAAU,KACzBjK,EAAMk5B,SAAW,KAGjBl5B,EAAMgiB,IAAM,KACZhiB,EAAM7C,KAAO,KACb6C,EAAMm5B,YAAc,KACpBn5B,EAAMo5B,OAAS,KACfp5B,EAAMkJ,UAAW,EACjBlJ,EAAMq5B,KAAM,EACZr5B,EAAMra,KAAM,EACZqa,EAAMs5B,IAAM,KACZt5B,EAAMu5B,WAAa,KACnBv5B,EAAM72B,IAAM,KACZ62B,EAAe,QAAI,KACnBA,EAAMw5B,SAAW,KACjBx5B,EAAMy5B,SAAW,KACjBz5B,EAAM05B,SAAW,KAGZ15B,EAAMiK,SACTjK,EAAMk5B,SAAW,GACjBruD,KAAK8uD,QAET,CACA7xD,EAAOD,QAAUmxD,EAEjB,MAAMY,EAAa,CACjB,MAAO,SAAU,WAAY,MAAO,OAAQ,cAAe,SAC3D,WAAY,MAAO,MAAO,MAAO,aAAc,MAAO,UAAW,WACjE,WAAY,YAGdZ,EAAKzwD,UAAU4F,MAAQ,WACrB,MAAM6xB,EAAQn1B,KAAKouD,WACbY,EAAS,CAAC,EAChBD,EAAW7nB,SAAQ,SAASpe,GAC1BkmC,EAAOlmC,GAAQqM,EAAMrM,EACvB,IACA,MAAMvjB,EAAM,IAAIvF,KAAKrC,YAAYqxD,EAAO5vB,QAExC,OADA75B,EAAI6oD,WAAaY,EACVzpD,CACT,EAEA4oD,EAAKzwD,UAAUoxD,MAAQ,WACrB,MAAM35B,EAAQn1B,KAAKouD,WACnBjsB,EAAQ+E,SAAQ,SAAS6E,GACvB/rC,KAAK+rC,GAAU,WACb,MAAMzoC,EAAQ,IAAItD,KAAKrC,YAAYqC,MAEnC,OADAm1B,EAAMk5B,SAASrwC,KAAK1a,GACbA,EAAMyoC,GAAQ9sB,MAAM3b,EAAOmY,UACpC,CACF,GAAGzb,KACL,EAEAmuD,EAAKzwD,UAAU0C,MAAQ,SAAc6uD,GACnC,MAAM95B,EAAQn1B,KAAKouD,WAEnB9uD,EAAwB,OAAjB61B,EAAMiK,QACb6vB,EAAK33C,KAAKtX,MAGVm1B,EAAMk5B,SAAWl5B,EAAMk5B,SAASnQ,QAAO,SAASgR,GAC9C,OAAOA,EAAMd,WAAWhvB,SAAWp/B,IACrC,GAAGA,MACHV,EAAOksB,MAAM2J,EAAMk5B,SAAS3vD,OAAQ,EAAG,oCACzC,EAEAyvD,EAAKzwD,UAAUyxD,SAAW,SAAiB78B,GACzC,MAAM6C,EAAQn1B,KAAKouD,WAGbC,EAAW/7B,EAAK4rB,QAAO,SAAS1/C,GACpC,OAAOA,aAAewB,KAAKrC,WAC7B,GAAGqC,MACHsyB,EAAOA,EAAK4rB,QAAO,SAAS1/C,GAC1B,QAASA,aAAewB,KAAKrC,YAC/B,GAAGqC,MAEqB,IAApBquD,EAAS3vD,SACXY,EAA0B,OAAnB61B,EAAMk5B,UACbl5B,EAAMk5B,SAAWA,EAGjBA,EAASnnB,SAAQ,SAASgoB,GACxBA,EAAMd,WAAWhvB,OAASp/B,IAC5B,GAAGA,OAEe,IAAhBsyB,EAAK5zB,SACPY,EAAsB,OAAf61B,EAAM7C,MACb6C,EAAM7C,KAAOA,EACb6C,EAAMm5B,YAAch8B,EAAKiM,KAAI,SAAS//B,GACpC,GAAmB,iBAARA,GAAoBA,EAAIb,cAAgBN,OACjD,OAAOmB,EAET,MAAM+G,EAAM,CAAC,EAOb,OANAlI,OAAOkrB,KAAK/pB,GAAK0oC,SAAQ,SAAS5oC,GAC5BA,IAAc,EAANA,KACVA,GAAO,GACT,MAAMV,EAAQY,EAAIF,GAClBiH,EAAI3H,GAASU,CACf,IACOiH,CACT,IAEJ,EAzHkB,CAChB,WAAY,aAAc,OAC1B,aAAc,eAAgB,cAC9B,cAAe,aAAc,cAAe,cAE5C,mBAAoB,aAAc,eAAgB,cAClD,cAAe,aAAc,eAyHrB2hC,SAAQ,SAAS6E,GACzBoiB,EAAKzwD,UAAUquC,GAAU,WACvB,MAAM5W,EAAQn1B,KAAKouD,WACnB,MAAM,IAAI3uD,MAAMssC,EAAS,kCAAoC5W,EAAMlF,IACrE,CACF,IAMAi+B,EAAKhnB,SAAQ,SAASiQ,GACpBgX,EAAKzwD,UAAUy5C,GAAO,WACpB,MAAMhiB,EAAQn1B,KAAKouD,WACb97B,EAAO5wB,MAAMhE,UAAUwc,MAAM5C,KAAKmE,WAOxC,OALAnc,EAAqB,OAAd61B,EAAMgiB,KACbhiB,EAAMgiB,IAAMA,EAEZn3C,KAAKmvD,SAAS78B,GAEPtyB,IACT,CACF,IAEAmuD,EAAKzwD,UAAU+wD,IAAM,SAAaW,GAChC9vD,EAAO8vD,GACP,MAAMj6B,EAAQn1B,KAAKouD,WAKnB,OAHA9uD,EAAqB,OAAd61B,EAAMs5B,KACbt5B,EAAMs5B,IAAMW,EAELpvD,IACT,EAEAmuD,EAAKzwD,UAAU2gC,SAAW,WAKxB,OAJcr+B,KAAKouD,WAEb/vB,UAAW,EAEVr+B,IACT,EAEAmuD,EAAKzwD,UAAU2xD,IAAM,SAAa9vD,GAChC,MAAM41B,EAAQn1B,KAAKouD,WAMnB,OAJA9uD,EAA4B,OAArB61B,EAAe,SACtBA,EAAe,QAAI51B,EACnB41B,EAAMkJ,UAAW,EAEVr+B,IACT,EAEAmuD,EAAKzwD,UAAUixD,SAAW,SAAkBltD,GAC1C,MAAM0zB,EAAQn1B,KAAKouD,WAKnB,OAHA9uD,EAA0B,OAAnB61B,EAAMw5B,UAAwC,OAAnBx5B,EAAMy5B,UACxCz5B,EAAMw5B,SAAWltD,EAEVzB,IACT,EAEAmuD,EAAKzwD,UAAUkxD,SAAW,SAAkBntD,GAC1C,MAAM0zB,EAAQn1B,KAAKouD,WAKnB,OAHA9uD,EAA0B,OAAnB61B,EAAMw5B,UAAwC,OAAnBx5B,EAAMy5B,UACxCz5B,EAAMy5B,SAAWntD,EAEVzB,IACT,EAEAmuD,EAAKzwD,UAAUod,IAAM,WACnB,MAAMqa,EAAQn1B,KAAKouD,WACb97B,EAAO5wB,MAAMhE,UAAUwc,MAAM5C,KAAKmE,WAOxC,OALA0Z,EAAMra,KAAM,EAEQ,IAAhBwX,EAAK5zB,QACPsB,KAAKmvD,SAAS78B,GAETtyB,IACT,EAEAmuD,EAAKzwD,UAAUY,IAAM,SAAagxD,GAChC,MAAMn6B,EAAQn1B,KAAKouD,WAKnB,OAHA9uD,EAAqB,OAAd61B,EAAM72B,KACb62B,EAAM72B,IAAMgxD,EAELtvD,IACT,EAEAmuD,EAAKzwD,UAAU8wD,IAAM,WAKnB,OAJcxuD,KAAKouD,WAEbI,KAAM,EAELxuD,IACT,EAEAmuD,EAAKzwD,UAAU6wD,OAAS,SAAgBzzC,GACtC,MAAMqa,EAAQn1B,KAAKouD,WAQnB,OANA9uD,EAAwB,OAAjB61B,EAAMo5B,QACbp5B,EAAMo5B,OAASzzC,EACf9a,KAAKmvD,SAAS9xD,OAAOkrB,KAAKzN,GAAKyjB,KAAI,SAASjgC,GAC1C,OAAOwc,EAAIxc,EACb,KAEO0B,IACT,EAEAmuD,EAAKzwD,UAAUmxD,SAAW,SAAkBO,GAC1C,MAAMj6B,EAAQn1B,KAAKouD,WAKnB,OAHA9uD,EAAqB,OAAd61B,EAAMs5B,KACbt5B,EAAM05B,SAAWO,EAEVpvD,IACT,EAMAmuD,EAAKzwD,UAAU6xD,QAAU,SAAgBl3C,EAAOwT,GAC9C,MAAMsJ,EAAQn1B,KAAKouD,WAGnB,GAAqB,OAAjBj5B,EAAMiK,OACR,OAAO/mB,EAAMm3C,WAAWr6B,EAAMk5B,SAAS,GAAGkB,QAAQl3C,EAAOwT,IAE3D,IAuCI4jC,EAvCAxa,EAAS9f,EAAe,QACxBu6B,GAAU,EAEVC,EAAU,KAKd,GAJkB,OAAdx6B,EAAM72B,MACRqxD,EAAUt3C,EAAMu3C,SAASz6B,EAAM72B,MAG7B62B,EAAMkJ,SAAU,CAClB,IAAI8Y,EAAM,KAQV,GAPuB,OAAnBhiB,EAAMw5B,SACRxX,EAAMhiB,EAAMw5B,SACc,OAAnBx5B,EAAMy5B,SACbzX,EAAMhiB,EAAMy5B,SACS,OAAdz5B,EAAMgiB,MACbA,EAAMhiB,EAAMgiB,KAEF,OAARA,GAAiBhiB,EAAMq5B,KAgBzB,GAFAkB,EAAU1vD,KAAK6vD,SAASx3C,EAAO8+B,EAAKhiB,EAAMq5B,KAEtCn2C,EAAMgvB,QAAQqoB,GAChB,OAAOA,MAjBqB,CAE9B,MAAMI,EAAOz3C,EAAMy3C,OACnB,IACuB,OAAjB36B,EAAMo5B,OACRvuD,KAAK+vD,eAAe56B,EAAMgiB,IAAK9+B,EAAOwT,GAEtC7rB,KAAKgwD,cAAc33C,EAAOwT,GAC5B6jC,GAAU,CACZ,CAAE,MAAOnvD,GACPmvD,GAAU,CACZ,CACAr3C,EAAM43C,QAAQH,EAChB,CAMF,CAOA,GAHI36B,EAAMra,KAAO40C,IACfD,EAAUp3C,EAAM63C,eAEdR,EAAS,CAEX,GAAuB,OAAnBv6B,EAAMw5B,SAAmB,CAC3B,MAAMA,EAAW3uD,KAAKmwD,WAAW93C,EAAO8c,EAAMw5B,UAC9C,GAAIt2C,EAAMgvB,QAAQsnB,GAChB,OAAOA,EACTt2C,EAAQs2C,CACV,CAEA,MAAMztD,EAAQmX,EAAMgF,OAGpB,GAAkB,OAAd8X,EAAMs5B,KAAiC,OAAjBt5B,EAAMo5B,OAAiB,CAC/C,IAAIuB,EACA36B,EAAMq5B,MACRsB,EAAOz3C,EAAMy3C,QACf,MAAMb,EAAOjvD,KAAKmwD,WAChB93C,EACmB,OAAnB8c,EAAMy5B,SAAoBz5B,EAAMy5B,SAAWz5B,EAAMgiB,IACjDhiB,EAAMq5B,KAER,GAAIn2C,EAAMgvB,QAAQ4nB,GAChB,OAAOA,EAEL95B,EAAMq5B,IACRvZ,EAAS58B,EAAM+3C,IAAIN,GAEnBz3C,EAAQ42C,CACZ,CAiBA,GAfIpjC,GAAWA,EAAQwkC,OAAuB,OAAdl7B,EAAMgiB,KACpCtrB,EAAQwkC,MAAMh4C,EAAM8P,OAAQjnB,EAAOmX,EAAM3Z,OAAQ,UAE/CmtB,GAAWA,EAAQwkC,OAAuB,OAAdl7B,EAAMgiB,KACpCtrB,EAAQwkC,MAAMh4C,EAAM8P,OAAQ9P,EAAMgF,OAAQhF,EAAM3Z,OAAQ,WAGtDy2B,EAAMq5B,MAGRvZ,EAD0B,OAAjB9f,EAAMo5B,OACNvuD,KAAK+vD,eAAe56B,EAAMgiB,IAAK9+B,EAAOwT,GAEtC7rB,KAAKgwD,cAAc33C,EAAOwT,IAGjCxT,EAAMgvB,QAAQ4N,GAChB,OAAOA,EAYT,GATK9f,EAAMq5B,KAAwB,OAAjBr5B,EAAMo5B,QAAsC,OAAnBp5B,EAAMk5B,UAC/Cl5B,EAAMk5B,SAASnnB,SAAQ,SAAwBgoB,GAG7CA,EAAMK,QAAQl3C,EAAOwT,EACvB,IAIEsJ,EAAM05B,WAA2B,WAAd15B,EAAMgiB,KAAkC,WAAdhiB,EAAMgiB,KAAmB,CACxE,MAAMh8B,EAAO,IAAI8yC,EAAchZ,GAC/BA,EAASj1C,KAAKswD,QAAQn7B,EAAM05B,SAAUx2C,EAAMk4C,eAAez1C,KACxDy0C,QAAQp0C,EAAM0Q,EACnB,CACF,CAYA,OATIsJ,EAAMra,KAAO40C,IACfza,EAAS58B,EAAMm4C,YAAYf,IAGX,OAAdt6B,EAAM72B,KAA4B,OAAX22C,IAA+B,IAAZya,EAEzB,OAAZC,GACPt3C,EAAMo4C,QAAQd,GAFdt3C,EAAMq4C,SAASf,EAASx6B,EAAM72B,IAAK22C,GAI9BA,CACT,EAEAkZ,EAAKzwD,UAAUqyD,eAAiB,SAAuB5Y,EAAK9+B,EAAOwT,GACjE,MAAMsJ,EAAQn1B,KAAKouD,WAEnB,MAAY,QAARjX,GAAyB,QAARA,EACZ,KACG,UAARA,GAA2B,UAARA,EACdn3C,KAAK2wD,YAAYt4C,EAAO8+B,EAAKhiB,EAAM7C,KAAK,GAAIzG,GAC5C,OAAOjD,KAAKuuB,GACZn3C,KAAK4wD,WAAWv4C,EAAO8+B,EAAKtrB,GACpB,UAARsrB,GAAmBhiB,EAAM7C,KACzBtyB,KAAK6wD,aAAax4C,EAAO8c,EAAM7C,KAAK,GAAI6C,EAAM7C,KAAK,GAAIzG,GAC/C,UAARsrB,EACAn3C,KAAK6wD,aAAax4C,EAAO,KAAM,KAAMwT,GAC7B,YAARsrB,GAA6B,YAARA,EACrBn3C,KAAK8wD,YAAYz4C,EAAO8+B,EAAKtrB,GACrB,UAARsrB,EACAn3C,KAAK+wD,YAAY14C,EAAOwT,GAChB,SAARsrB,EACAn3C,KAAKgxD,YAAY34C,EAAOwT,GAChB,YAARsrB,EACAn3C,KAAK4wD,WAAWv4C,EAAO8+B,EAAKtrB,GACpB,QAARsrB,GAAyB,SAARA,EACjBn3C,KAAKixD,WAAW54C,EAAO8c,EAAM7C,MAAQ6C,EAAM7C,KAAK,GAAIzG,GAE3C,OAAdsJ,EAAMs5B,IACDzuD,KAAKswD,QAAQn7B,EAAMs5B,IAAKp2C,EAAMk4C,eAAez1C,KACjDy0C,QAAQl3C,EAAOwT,GAEXxT,EAAMoH,MAAM,gBAAkB03B,EAEzC,EAEAgX,EAAKzwD,UAAU4yD,QAAU,SAAiBY,EAAQp2C,GAEhD,MAAMqa,EAAQn1B,KAAKouD,WASnB,OAPAj5B,EAAMu5B,WAAa1uD,KAAKmxD,KAAKD,EAAQp2C,GACrCxb,EAA8C,OAAvC61B,EAAMu5B,WAAWN,WAAWhvB,QACnCjK,EAAMu5B,WAAav5B,EAAMu5B,WAAWN,WAAWC,SAAS,GACpDl5B,EAAMy5B,WAAaz5B,EAAMu5B,WAAWN,WAAWQ,WACjDz5B,EAAMu5B,WAAav5B,EAAMu5B,WAAWprD,QACpC6xB,EAAMu5B,WAAWN,WAAWQ,SAAWz5B,EAAMy5B,UAExCz5B,EAAMu5B,UACf,EAEAP,EAAKzwD,UAAUsyD,cAAgB,SAAsB33C,EAAOwT,GAC1D,MAAMsJ,EAAQn1B,KAAKouD,WACnB,IAAInZ,EAAS,KACTpN,GAAQ,EAmBZ,OAjBAxqC,OAAOkrB,KAAK4M,EAAMo5B,QAAQ6C,MAAK,SAAS9yD,GACtC,MAAMwxD,EAAOz3C,EAAMy3C,OACbhiC,EAAOqH,EAAMo5B,OAAOjwD,GAC1B,IACE,MAAMV,EAAQkwB,EAAKyhC,QAAQl3C,EAAOwT,GAClC,GAAIxT,EAAMgvB,QAAQzpC,GAChB,OAAO,EAETq3C,EAAS,CAAE/5B,KAAM5c,EAAKV,MAAOA,GAC7BiqC,GAAQ,CACV,CAAE,MAAOtnC,GAEP,OADA8X,EAAM43C,QAAQH,IACP,CACT,CACA,OAAO,CACT,GAAG9vD,MAEE6nC,EAGEoN,EAFE58B,EAAMoH,MAAM,qBAGvB,EAMA0uC,EAAKzwD,UAAU2zD,qBAAuB,SAA6Bl2C,GACjE,OAAO,IAAI6yC,EAAc7yC,EAAMnb,KAAKsxD,SACtC,EAEAnD,EAAKzwD,UAAUmyC,QAAU,SAAgB10B,EAAMm2C,EAAUlyB,GACvD,MAAMjK,EAAQn1B,KAAKouD,WACnB,GAAyB,OAArBj5B,EAAe,SAAcA,EAAe,UAAMha,EACpD,OAEF,MAAM85B,EAASj1C,KAAKuxD,aAAap2C,EAAMm2C,EAAUlyB,GACjD,YAAehgC,IAAX61C,GAGAj1C,KAAKwxD,aAAavc,EAAQqc,EAAUlyB,QAHxC,EAMO6V,CACT,EAEAkZ,EAAKzwD,UAAU6zD,aAAe,SAAgBp2C,EAAMm2C,EAAUlyB,GAC5D,MAAMjK,EAAQn1B,KAAKouD,WAGnB,GAAqB,OAAjBj5B,EAAMiK,OACR,OAAOjK,EAAMk5B,SAAS,GAAGxe,QAAQ10B,EAAMm2C,GAAY,IAAIvD,GAEzD,IAAI9Y,EAAS,KAMb,GAHAj1C,KAAKsxD,SAAWA,EAGZn8B,EAAMkJ,eAAqBj/B,IAAT+b,EAAoB,CACxC,GAAyB,OAArBga,EAAe,QAGjB,OAFAha,EAAOga,EAAe,OAG1B,CAGA,IAAIs8B,EAAU,KACV5qB,GAAY,EAChB,GAAI1R,EAAMq5B,IAERvZ,EAASj1C,KAAKqxD,qBAAqBl2C,QAC9B,GAAIga,EAAMo5B,OACftZ,EAASj1C,KAAK0xD,cAAcv2C,EAAMm2C,QAC7B,GAAIn8B,EAAM05B,SACf4C,EAAUzxD,KAAKswD,QAAQn7B,EAAM05B,SAAUzvB,GAAQyQ,QAAQ10B,EAAMm2C,GAC7DzqB,GAAY,OACP,GAAI1R,EAAMk5B,SACfoD,EAAUt8B,EAAMk5B,SAAS9vB,KAAI,SAAS2wB,GACpC,GAA6B,UAAzBA,EAAMd,WAAWjX,IACnB,OAAO+X,EAAMrf,QAAQ,KAAMyhB,EAAUn2C,GAEvC,GAA6B,OAAzB+zC,EAAMd,WAAW9vD,IACnB,OAAOgzD,EAAS7xC,MAAM,2BACxB,MAAMkwC,EAAU2B,EAAS1B,SAASV,EAAMd,WAAW9vD,KAEnD,GAAoB,iBAAT6c,EACT,OAAOm2C,EAAS7xC,MAAM,2CAExB,MAAMla,EAAM2pD,EAAMrf,QAAQ10B,EAAK+zC,EAAMd,WAAW9vD,KAAMgzD,EAAUn2C,GAGhE,OAFAm2C,EAASZ,SAASf,GAEXpqD,CACT,GAAGvF,MAAMk+C,QAAO,SAASgR,GACvB,OAAOA,CACT,IACAuC,EAAUzxD,KAAKqxD,qBAAqBI,QAEpC,GAAkB,UAAdt8B,EAAMgiB,KAAiC,UAAdhiB,EAAMgiB,IAAiB,CAElD,IAAMhiB,EAAM7C,MAA8B,IAAtB6C,EAAM7C,KAAK5zB,OAC7B,OAAO4yD,EAAS7xC,MAAM,uBAAyB0V,EAAMgiB,KAEvD,IAAKz1C,MAAMC,QAAQwZ,GACjB,OAAOm2C,EAAS7xC,MAAM,sCAExB,MAAMyvC,EAAQlvD,KAAKsD,QACnB4rD,EAAMd,WAAWQ,SAAW,KAC5B6C,EAAUzxD,KAAKqxD,qBAAqBl2C,EAAKojB,KAAI,SAAS6wB,GACpD,MAAMj6B,EAAQn1B,KAAKouD,WAEnB,OAAOpuD,KAAKswD,QAAQn7B,EAAM7C,KAAK,GAAInX,GAAM00B,QAAQuf,EAAMkC,EACzD,GAAGpC,GACL,MAAyB,OAAd/5B,EAAMs5B,IACfxZ,EAASj1C,KAAKswD,QAAQn7B,EAAMs5B,IAAKrvB,GAAQyQ,QAAQ10B,EAAMm2C,IAEvDG,EAAUzxD,KAAK2xD,iBAAiBx8B,EAAMgiB,IAAKh8B,GAC3C0rB,GAAY,GAKhB,IAAK1R,EAAMq5B,KAAwB,OAAjBr5B,EAAMo5B,OAAiB,CACvC,MAAMpX,EAAyB,OAAnBhiB,EAAMy5B,SAAoBz5B,EAAMy5B,SAAWz5B,EAAMgiB,IACvDya,EAAyB,OAAnBz8B,EAAMy5B,SAAoB,YAAc,UAExC,OAARzX,EACgB,OAAdhiB,EAAMs5B,KACR6C,EAAS7xC,MAAM,wCAEC,OAAd0V,EAAMs5B,MACRxZ,EAASj1C,KAAK6xD,iBAAiB1a,EAAKtQ,EAAW+qB,EAAKH,GAE1D,CAMA,OAHuB,OAAnBt8B,EAAMw5B,WACR1Z,EAASj1C,KAAK6xD,iBAAiB18B,EAAMw5B,UAAU,EAAO,UAAW1Z,IAE5DA,CACT,EAEAkZ,EAAKzwD,UAAUg0D,cAAgB,SAAsBv2C,EAAMm2C,GACzD,MAAMn8B,EAAQn1B,KAAKouD,WAEbtgC,EAAOqH,EAAMo5B,OAAOpzC,EAAKD,MAO/B,OANK4S,GACHxuB,GACE,EACA6b,EAAKD,KAAO,iBACN4pB,KAAKzM,UAAUh7B,OAAOkrB,KAAK4M,EAAMo5B,UAEpCzgC,EAAK+hB,QAAQ10B,EAAKvd,MAAO0zD,EAClC,EAEAnD,EAAKzwD,UAAUi0D,iBAAmB,SAAyBxa,EAAKh8B,GAC9D,MAAMga,EAAQn1B,KAAKouD,WAEnB,GAAI,OAAOxlC,KAAKuuB,GACd,OAAOn3C,KAAK8xD,WAAW32C,EAAMg8B,GAC1B,GAAY,UAARA,GAAmBhiB,EAAM7C,KAChC,OAAOtyB,KAAK+xD,aAAa52C,EAAMga,EAAMm5B,YAAY,GAAIn5B,EAAM7C,KAAK,IAC7D,GAAY,UAAR6kB,EACP,OAAOn3C,KAAK+xD,aAAa52C,EAAM,KAAM,MAClC,GAAY,YAARg8B,GAA6B,YAARA,EAC5B,OAAOn3C,KAAKgyD,YAAY72C,EAAMg8B,GAC3B,GAAY,UAARA,EACP,OAAOn3C,KAAKiyD,cACT,GAAY,QAAR9a,GAAyB,SAARA,EACxB,OAAOn3C,KAAKkyD,WAAW/2C,EAAMga,EAAM7C,MAAQ6C,EAAMm5B,YAAY,IAC1D,GAAY,SAARnX,EACP,OAAOn3C,KAAKmyD,YAAYh3C,GACrB,GAAY,YAARg8B,EACP,OAAOn3C,KAAK8xD,WAAW32C,EAAMg8B,GAE7B,MAAM,IAAI13C,MAAM,oBAAsB03C,EAC1C,EAEAgX,EAAKzwD,UAAU00D,UAAY,SAAkBnxD,GAC3C,MAAO,YAAY2nB,KAAK3nB,EAC1B,EAEAktD,EAAKzwD,UAAU20D,YAAc,SAAoBpxD,GAC/C,MAAO,6BAA6B2nB,KAAK3nB,EAC3C,0BCxnBA,IAAIoiD,EAA6B,mCAYjC,SAASpJ,IAAQ,CAoEjBh9C,EAAOD,QAhEP,SAASsmD,EAAIC,EAAQ5d,EAAMsa,GACzB,GAAoB,mBAATta,EAAqB,OAAO2d,EAAIC,EAAQ,KAAM5d,GACpDA,IAAMA,EAAO,CAAC,GACnBsa,EAlBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACL,IAAIA,EAAJ,CACAA,GAAS,EACT,IAAK,IAAIxiB,EAAOvlB,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAC/EnxB,EAAKmxB,GAAQhoC,UAAUgoC,GAEzBxD,EAAShhC,MAAMjf,KAAMsyB,EALH,CAMpB,CACF,CAQaQ,CAAKmtB,GAAYhG,GAC5B,IAAIhO,EAAWtG,EAAKsG,WAA8B,IAAlBtG,EAAKsG,UAAsBsX,EAAOtX,SAC9DnuC,EAAW6nC,EAAK7nC,WAA8B,IAAlB6nC,EAAK7nC,UAAsBylD,EAAOzlD,SAC9D4lD,EAAiB,WACdH,EAAOzlD,UAAU6lD,GACxB,EACIC,EAAgBL,EAAOpX,gBAAkBoX,EAAOpX,eAAe0X,SAC/DF,EAAW,WACb7lD,GAAW,EACX8lD,GAAgB,EACX3X,GAAUgU,EAAS3oC,KAAKisC,EAC/B,EACIO,EAAgBP,EAAO/W,gBAAkB+W,EAAO/W,eAAeuX,WAC/D7X,EAAQ,WACVD,GAAW,EACX6X,GAAgB,EACXhmD,GAAUmiD,EAAS3oC,KAAKisC,EAC/B,EACIS,EAAU,SAAiB5wB,GAC7B6sB,EAAS3oC,KAAKisC,EAAQnwB,EACxB,EACI6wB,EAAU,WACZ,IAAI7wB,EACJ,OAAI6Y,IAAa6X,GACVP,EAAO/W,gBAAmB+W,EAAO/W,eAAeJ,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,IAE3Bt1B,IAAa8lD,GACVL,EAAOpX,gBAAmBoX,EAAOpX,eAAeC,QAAOhZ,EAAM,IAAIiwB,GAC/DpD,EAAS3oC,KAAKisC,EAAQnwB,SAF/B,CAIF,EACI8wB,EAAY,WACdX,EAAOY,IAAIzwB,GAAG,SAAUiwB,EAC1B,EAcA,OAtDF,SAAmBJ,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuCMC,CAAUf,IACZA,EAAO7vB,GAAG,WAAYiwB,GACtBJ,EAAO7vB,GAAG,QAASuwB,GACfV,EAAOY,IAAKD,IAAiBX,EAAO7vB,GAAG,UAAWwwB,IAC7CpmD,IAAaylD,EAAOpX,iBAE7BoX,EAAO7vB,GAAG,MAAOgwB,GACjBH,EAAO7vB,GAAG,QAASgwB,IAErBH,EAAO7vB,GAAG,MAAOwY,GACjBqX,EAAO7vB,GAAG,SAAUiwB,IACD,IAAfhe,EAAKlmB,OAAiB8jC,EAAO7vB,GAAG,QAASswB,GAC7CT,EAAO7vB,GAAG,QAASuwB,GACZ,WACLV,EAAOlwB,eAAe,WAAYswB,GAClCJ,EAAOlwB,eAAe,QAAS4wB,GAC/BV,EAAOlwB,eAAe,UAAW6wB,GAC7BX,EAAOY,KAAKZ,EAAOY,IAAI9wB,eAAe,SAAUswB,GACpDJ,EAAOlwB,eAAe,MAAOqwB,GAC7BH,EAAOlwB,eAAe,QAASqwB,GAC/BH,EAAOlwB,eAAe,SAAUswB,GAChCJ,EAAOlwB,eAAe,MAAO6Y,GAC7BqX,EAAOlwB,eAAe,QAAS2wB,GAC/BT,EAAOlwB,eAAe,QAAS4wB,EACjC,CACF,0BClFA,MAAMvkD,EAAW,EAAQ,GACnBquD,EAAW,SACX7vD,EAAS,aAEf,SAAS+vD,EAAcpuD,EAAMgsB,GAC3BkiC,EAASz2C,KAAKtX,KAAM6rB,GACf3tB,EAAO6c,SAASlb,IAKrBG,KAAKH,KAAOA,EACZG,KAAKqd,OAAS,EACdrd,KAAKtB,OAASmB,EAAKnB,QANjBsB,KAAKyf,MAAM,mBAOf,CAuEA,SAASuuC,EAAcpwD,EAAO0zD,GAC5B,GAAI5vD,MAAMC,QAAQ/D,GAChBoC,KAAKtB,OAAS,EACdsB,KAAKpC,MAAQA,EAAM2gC,KAAI,SAAS6wB,GAI9B,OAHKpB,EAAcsE,gBAAgBlD,KACjCA,EAAO,IAAIpB,EAAcoB,EAAMkC,IACjCtxD,KAAKtB,QAAU0wD,EAAK1wD,OACb0wD,CACT,GAAGpvD,WACE,GAAqB,iBAAVpC,EAAoB,CACpC,KAAM,GAAKA,GAASA,GAAS,KAC3B,OAAO0zD,EAAS7xC,MAAM,gCACxBzf,KAAKpC,MAAQA,EACboC,KAAKtB,OAAS,CAChB,MAAO,GAAqB,iBAAVd,EAChBoC,KAAKpC,MAAQA,EACboC,KAAKtB,OAASR,EAAOkH,WAAWxH,OAC3B,KAAIM,EAAO6c,SAASnd,GAIzB,OAAO0zD,EAAS7xC,MAAM,4BAA8B7hB,GAHpDoC,KAAKpC,MAAQA,EACboC,KAAKtB,OAASd,EAAMc,MAGtB,CACF,CA7FAgB,EAASuuD,EAAeF,GACxB/wD,EAAQ,EAAgBixD,EAExBA,EAAcsE,gBAAkB,SAAyBp3C,GACvD,OAAIA,aAAgB8yC,GAKiB,iBAAT9yC,GAC1Bjd,EAAO6c,SAASI,EAAKtb,OACK,kBAA1Bsb,EAAKxd,YAAYuZ,MACM,iBAAhBiE,EAAKkC,QACW,iBAAhBlC,EAAKzc,QACS,mBAAdyc,EAAK20C,MACY,mBAAjB30C,EAAK80C,SACY,mBAAjB90C,EAAKq3C,SACc,mBAAnBr3C,EAAKkH,WACS,mBAAdlH,EAAKqhC,MACQ,mBAAbrhC,EAAKi1C,GAGhB,EAEAnC,EAAcvwD,UAAUoyD,KAAO,WAC7B,MAAO,CAAEzyC,OAAQrd,KAAKqd,OAAQi0C,SAAUvD,EAASrwD,UAAUoyD,KAAKx4C,KAAKtX,MACvE,EAEAiuD,EAAcvwD,UAAUuyD,QAAU,SAAiBH,GAEjD,MAAMvqD,EAAM,IAAI0oD,EAAcjuD,KAAKH,MAOnC,OANA0F,EAAI8X,OAASyyC,EAAKzyC,OAClB9X,EAAI7G,OAASsB,KAAKqd,OAElBrd,KAAKqd,OAASyyC,EAAKzyC,OACnB0wC,EAASrwD,UAAUuyD,QAAQ34C,KAAKtX,KAAM8vD,EAAKwB,UAEpC/rD,CACT,EAEA0oD,EAAcvwD,UAAU80D,QAAU,WAChC,OAAOxyD,KAAKqd,SAAWrd,KAAKtB,MAC9B,EAEAuvD,EAAcvwD,UAAU2kB,UAAY,SAAmBowC,GACrD,OAAIzyD,KAAKqd,OAAS,GAAKrd,KAAKtB,OACnBsB,KAAKH,KAAKwiB,UAAUriB,KAAKqd,UAAU,GAEnCrd,KAAKyf,MAAMgzC,GAAQ,wBAC9B,EAEAxE,EAAcvwD,UAAU8+C,KAAO,SAAct7B,EAAOuxC,GAClD,KAAMzyD,KAAKqd,OAAS6D,GAASlhB,KAAKtB,QAChC,OAAOsB,KAAKyf,MAAMgzC,GAAQ,yBAE5B,MAAMltD,EAAM,IAAI0oD,EAAcjuD,KAAKH,MAQnC,OALA0F,EAAIgrD,eAAiBvwD,KAAKuwD,eAE1BhrD,EAAI8X,OAASrd,KAAKqd,OAClB9X,EAAI7G,OAASsB,KAAKqd,OAAS6D,EAC3BlhB,KAAKqd,QAAU6D,EACR3b,CACT,EAEA0oD,EAAcvwD,UAAU0yD,IAAM,SAAaN,GACzC,OAAO9vD,KAAKH,KAAKqa,MAAM41C,EAAOA,EAAKzyC,OAASrd,KAAKqd,OAAQrd,KAAKtB,OAChE,EA0BA1B,EAAQ,EAAgBgxD,EAExBA,EAAcsE,gBAAkB,SAAyBn3C,GACvD,OAAIA,aAAgB6yC,GAKiB,iBAAT7yC,GACA,kBAA1BA,EAAKxd,YAAYuZ,MACM,iBAAhBiE,EAAKzc,QACS,mBAAdyc,EAAK+d,IAGhB,EAEA80B,EAActwD,UAAUw7B,KAAO,SAAcn1B,EAAKsZ,GAMhD,OALKtZ,IACHA,EAAM7F,EAAOU,MAAMoB,KAAKtB,SACrB2e,IACHA,EAAS,GAES,IAAhBrd,KAAKtB,SAGLgD,MAAMC,QAAQ3B,KAAKpC,OACrBoC,KAAKpC,MAAMspC,SAAQ,SAASkoB,GAC1BA,EAAKl2B,KAAKn1B,EAAKsZ,GACfA,GAAU+xC,EAAK1wD,MACjB,KAE0B,iBAAfsB,KAAKpC,MACdmG,EAAIsZ,GAAUrd,KAAKpC,MACU,iBAAfoC,KAAKpC,MACnBmG,EAAIkW,MAAMja,KAAKpC,MAAOyf,GACfnf,EAAO6c,SAAS/a,KAAKpC,QAC5BoC,KAAKpC,MAAMwF,KAAKW,EAAKsZ,GACvBA,GAAUrd,KAAKtB,SAdRqF,CAkBX,mBCxJE,IAiBOwP,EACAkkB,EACAnR,EACA2R,EACAgD,EACAiB,EAMAw2B,EAfS17B,EAVhB/5B,EAAOD,SAUSg6B,EAVmB,EAAQ,IAAW,EAAQ,KAAW,EAAQ,KAgB1E1Q,GADAmR,GADAlkB,EAAIyjB,GACMU,KACGpR,KACb2R,EAAYR,EAAMQ,UAElBiE,GADAjB,EAAS1nB,EAAEsoB,MACEK,IAMbw2B,EAASz3B,EAAOy3B,OAASpsC,EAAKqR,OAAO,CAQrCwD,IAAK7U,EAAKqR,OAAO,CACb4zB,QAAS,EACT7vB,OAAQQ,EACRy2B,WAAY,IAchB9/B,KAAM,SAAUsI,GACZn7B,KAAKm7B,IAAMn7B,KAAKm7B,IAAIxD,OAAOwD,EAC/B,EAcAy3B,QAAS,SAAU3c,EAAUC,GAkBzB,IAjBA,IAAIjV,EAGA9F,EAAMn7B,KAAKm7B,IAGXO,EAASP,EAAIO,OAAOp+B,SAGpBu1D,EAAa56B,EAAU36B,SAGvBw1D,EAAkBD,EAAW3yD,MAC7BqrD,EAAUpwB,EAAIowB,QACdoH,EAAax3B,EAAIw3B,WAGdG,EAAgBp0D,OAAS6sD,GAAS,CACjCtqB,GACAvF,EAAOL,OAAO4F,GAElBA,EAAQvF,EAAOL,OAAO4a,GAAU1a,SAAS2a,GACzCxa,EAAOzB,QAGP,IAAK,IAAIz4B,EAAI,EAAGA,EAAImxD,EAAYnxD,IAC5By/B,EAAQvF,EAAOH,SAAS0F,GACxBvF,EAAOzB,QAGX44B,EAAW9yC,OAAOkhB,EACtB,CAGA,OAFA4xB,EAAW36B,SAAqB,EAAVqzB,EAEfsH,CACX,IAoBJt/C,EAAEm/C,OAAS,SAAUzc,EAAUC,EAAM/a,GACjC,OAAOu3B,EAAOp1D,OAAO69B,GAAKy3B,QAAQ3c,EAAUC,EAChD,EAIGlf,EAAS07B,oBCnIjB11D,EAAUC,EAAOD,QAAU,EAAjB,MACF+1D,OAAS/1D,EACjBA,EAAQ4uC,SAAW5uC,EACnBA,EAAQ6uC,SAAW,EAAnB,KACA7uC,EAAQ2uC,OAAS,EAAjB,IACA3uC,EAAQ2/B,UAAY,EAApB,KACA3/B,EAAQg2D,YAAc,EAAtB,KACAh2D,EAAQ6mD,SAAW,EAAnB,IACA7mD,EAAQi2D,SAAW,EAAnB,6BCeA,SAASC,EAAQp4C,GAAwT,OAAtOo4C,EAArD,mBAAX15C,QAAoD,iBAApBA,OAAO64B,SAAmC,SAAiBv3B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXtB,QAAyBsB,EAAInd,cAAgB6b,QAAUsB,IAAQtB,OAAO9b,UAAY,gBAAkBod,CAAK,EAAYo4C,EAAQp4C,EAAM,CAI9V,IAoBIq4C,EACAC,EApBAC,EADW,EAAQ,KACO/vB,MAC1BgwB,EAAyBD,EAAeC,uBACxCxsC,EAAuBusC,EAAevsC,qBACtCysC,EAAwBF,EAAeE,sBACvCC,EAA2BH,EAAeG,yBAC1CC,EAAmBJ,EAAeI,iBAElCC,EAAiB,EAAQ,KAGzBjwD,EADY,EAAQ,IACAA,QAEpBkwD,EAAiB,YACjBC,EAAYD,EAAeC,UAC3BrsB,EAAWosB,EAAepsB,SAE1BssB,EAAex2D,OAAOy2D,OAASz2D,OAAOy2D,OAAS,cAC/CC,EAAW12D,OAAO22D,GAAK32D,OAAO22D,GAAK,EAAQ,KAQ/C,SAASC,IACP,IAAIC,EAAa,EAAQ,KAEzBf,EAAce,EAAWf,YACzBC,EAAoBc,EAAWd,iBACjC,CAZiB,IAAIhgB,IAiBrB,IAOIxe,GAAS,EAITt1B,EAASrC,EAAOD,QAAUm3D,EAC1BC,EAAwB,CAAC,EAM7B,SAASC,EAAUv5C,GACjB,GAAIA,EAAI2L,mBAAmBhnB,MAAO,MAAMqb,EAAI2L,QAC5C,MAAM,IAAIitC,EAAe54C,EAC3B,CA+CA,SAASw5C,EAAQ3sC,EAAI4sC,EAAQ32D,EAAO6oB,GAClC,IAAK7oB,EAAO,CACV,IAAI42D,GAAmB,EAEvB,GAAe,IAAXD,EACFC,GAAmB,EACnB/tC,EAAU,iDACL,GAAIA,aAAmBhnB,MAC5B,MAAMgnB,EAGR,IAAI2M,EAAM,IAAIsgC,EAAe,CAC3B15C,OAAQpc,EACRqmC,UAAU,EACVxd,QAASA,EACTguC,SAAU,KACVC,aAAc/sC,IAGhB,MADAyL,EAAIohC,iBAAmBA,EACjBphC,CACR,CACF,CAIA,SAAS+gC,IACP,IAAK,IAAInzB,EAAOvlB,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAC/EnxB,EAAKmxB,GAAQhoC,UAAUgoC,GAGzB6Q,EAAQr1C,WAAM,EAAQ,CAACk1C,EAAI7hC,EAAK5zB,QAAQqhB,OAAOuS,GACjD,CAnCAhzB,EAAOmzD,KAzCP,SAASA,EAAKz4C,EAAQiqB,EAAUxd,EAASguC,EAAUC,GACjD,IACIC,EADAC,EAAUn5C,UAAU/c,OAkBxB,GAfgB,IAAZk2D,EACFD,EAAkB,SACG,IAAZC,GACTnuC,EAAUzM,EACVA,OAAS5a,KAEM,IAAXw1B,IACFA,GAAS,GACEhH,QAAQinC,YAAcjnC,QAAQinC,YAAcr1C,QAAQsV,KAAKO,KAAK7V,UACpE,2HAAiI,qBAAsB,YAG9I,IAAZo1C,IAAeH,EAAW,OAG5BhuC,aAAmBhnB,MAAO,MAAMgnB,EACpC,IAAIquC,EAAU,CACZ96C,OAAQA,EACRiqB,SAAUA,EACVwwB,cAAuBr1D,IAAbq1D,EAAyB,OAASA,EAC5CC,aAAcA,GAAgBjC,QAGhBrzD,IAAZqnB,IACFquC,EAAQruC,QAAUA,GAGpB,IAAI2M,EAAM,IAAIsgC,EAAeoB,GAO7B,MALIH,IACFvhC,EAAI3M,QAAUkuC,EACdvhC,EAAIohC,kBAAmB,GAGnBphC,CACR,EAIA9zB,EAAOo0D,eAAiBA,EAmCxBp0D,EAAO60D,GAAKA,EAIZ70D,EAAOksB,MAAQ,SAASA,EAAMxR,EAAQiqB,EAAUxd,GAC9C,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,YAInCz5C,GAAUiqB,GACZowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,KACVC,aAAclpC,GAGpB,EAIAlsB,EAAOy1D,SAAW,SAASA,EAAS/6C,EAAQiqB,EAAUxd,GACpD,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,YAInCz5C,GAAUiqB,GACZowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,KACVC,aAAcK,GAGpB,EAGAz1D,EAAO01D,UAAY,SAASA,EAAUh7C,EAAQiqB,EAAUxd,GACtD,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,iBAGnBr0D,IAAhB+zD,GAA2Bc,IAE1Bd,EAAYn5C,EAAQiqB,IACvBowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,YACVC,aAAcM,GAGpB,EAGA11D,EAAO21D,aAAe,SAASA,EAAaj7C,EAAQiqB,EAAUxd,GAC5D,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,iBAGnBr0D,IAAhB+zD,GAA2Bc,IAE3Bd,EAAYn5C,EAAQiqB,IACtBowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,eACVC,aAAcO,GAGpB,EAIA31D,EAAO41D,gBAAkB,SAASA,EAAgBl7C,EAAQiqB,EAAUxd,GAClE,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,iBAGnBr0D,IAAhB+zD,GAA2Bc,IAE1Bb,EAAkBp5C,EAAQiqB,IAC7BowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,kBACVC,aAAcQ,GAGpB,EAEA51D,EAAO61D,mBAEP,SAASA,EAAmBn7C,EAAQiqB,EAAUxd,GAC5C,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,iBAGnBr0D,IAAhB+zD,GAA2Bc,IAE3Bb,EAAkBp5C,EAAQiqB,IAC5BowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,qBACVC,aAAcS,GAGpB,EAEA71D,EAAO81D,YAAc,SAASA,EAAYp7C,EAAQiqB,EAAUxd,GAC1D,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,YAGlCM,EAAS/5C,EAAQiqB,IACpBowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,cACVC,aAAcU,GAGpB,EAEA91D,EAAO+1D,eAAiB,SAASA,EAAer7C,EAAQiqB,EAAUxd,GAChE,GAAIhL,UAAU/c,OAAS,EACrB,MAAM,IAAI+0D,EAAiB,SAAU,YAGnCM,EAAS/5C,EAAQiqB,IACnBowB,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU,iBACVC,aAAcW,GAGpB,EAEA,IAAIC,EAAa,SAASA,EAAWx6C,EAAKyN,EAAMvO,GAC9C,IAAIu7C,EAAQv1D,MAlSd,SAAyB+3B,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAoStJ02D,CAAgBz1D,KAAMs1D,GAEtB/sC,EAAK2e,SAAQ,SAAU5oC,GACjBA,KAAOwc,SACM1b,IAAX4a,GAA+C,iBAAhBA,EAAO1b,IAAqBipC,EAASzsB,EAAIxc,KAASwc,EAAIxc,GAAKsqB,KAAK5O,EAAO1b,IACxGi3D,EAAMj3D,GAAO0b,EAAO1b,GAEpBi3D,EAAMj3D,GAAOwc,EAAIxc,GAGvB,GACF,EA8BA,SAASo3D,EAAkB17C,EAAQiqB,EAAUzkC,EAAKmoB,GAChD,GAAwB,mBAAbsc,EAAyB,CAClC,GAAIsD,EAAStD,GAAW,OAAOA,EAASrb,KAAK5O,GAE7C,GAAyB,IAArByB,UAAU/c,OACZ,MAAM,IAAIooB,EAAqB,WAAY,CAAC,WAAY,UAAWmd,GAIrE,GAAwB,WAApBivB,EAAQl5C,IAAmC,OAAXA,EAAiB,CACnD,IAAIoZ,EAAM,IAAIsgC,EAAe,CAC3B15C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASjnB,EACTi1D,SAAU,kBACVC,aAAc/sC,IAGhB,MADAyL,EAAIqhC,SAAW9sC,EAAGzQ,KACZkc,CACR,CAEA,IAAI7K,EAAOlrB,OAAOkrB,KAAK0b,GAGvB,GAAIA,aAAoBxkC,MACtB8oB,EAAKvK,KAAK,OAAQ,gBACb,GAAoB,IAAhBuK,EAAK7pB,OACd,MAAM,IAAI60D,EAAsB,QAAStvB,EAAU,8BAWrD,YARoB7kC,IAAhB+zD,GAA2Bc,IAC/B1rC,EAAK2e,SAAQ,SAAU5oC,GACM,iBAAhB0b,EAAO1b,IAAqBipC,EAAStD,EAAS3lC,KAAS2lC,EAAS3lC,GAAKsqB,KAAK5O,EAAO1b,KA5DlG,SAA6B0b,EAAQiqB,EAAU3lC,EAAKmoB,EAAS8B,EAAMZ,GACjE,KAAMrpB,KAAO0b,KAAYo5C,EAAkBp5C,EAAO1b,GAAM2lC,EAAS3lC,IAAO,CACtE,IAAKmoB,EAAS,CAEZ,IAAIziB,EAAI,IAAIsxD,EAAWt7C,EAAQuO,GAC3BtkB,EAAI,IAAIqxD,EAAWrxB,EAAU1b,EAAMvO,GACnCoZ,EAAM,IAAIsgC,EAAe,CAC3B15C,OAAQhW,EACRigC,SAAUhgC,EACVwwD,SAAU,kBACVC,aAAc/sC,IAKhB,MAHAyL,EAAIpZ,OAASA,EACboZ,EAAI6Q,SAAWA,EACf7Q,EAAIqhC,SAAW9sC,EAAGzQ,KACZkc,CACR,CAEAihC,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUA,EACVxd,QAASA,EACTguC,SAAU9sC,EAAGzQ,KACbw9C,aAAc/sC,GAElB,CACF,CAsCMguC,CAAoB37C,EAAQiqB,EAAU3lC,EAAKkB,EAAK+oB,EAAMZ,EACxD,KACO,CACT,CAGA,YAA2BvoB,IAAvB6kC,EAASvmC,WAA2Bsc,aAAkBiqB,IAItDxkC,MAAMm2D,cAAc3xB,KAIa,IAA9BA,EAAS3sB,KAAK,CAAC,EAAG0C,EAC3B,CAEA,SAAS67C,EAAUluC,GACjB,GAAkB,mBAAPA,EACT,MAAM,IAAIb,EAAqB,KAAM,WAAYa,GAGnD,IACEA,GACF,CAAE,MAAOpnB,GACP,OAAOA,CACT,CAEA,OAAO6zD,CACT,CAEA,SAAS0B,EAAeh7C,GAOtB,OAAO84C,EAAU94C,IAAgB,OAARA,GAAiC,WAAjBo4C,EAAQp4C,IAAyC,mBAAbA,EAAIqvB,MAA4C,mBAAdrvB,EAAIi7C,KACrH,CAEA,SAASC,EAAcC,GACrB,OAAOjjC,QAAQC,UAAUkX,MAAK,WAC5B,IAAI+rB,EAEJ,GAAyB,mBAAdD,GAIT,IAAKH,EAFLI,EAAgBD,KAGd,MAAM,IAAIzC,EAAyB,sBAAuB,YAAa0C,OAEpE,KAAIJ,EAAeG,GAGxB,MAAM,IAAInvC,EAAqB,YAAa,CAAC,WAAY,WAAYmvC,GAFrEC,EAAgBD,CAGlB,CAEA,OAAOjjC,QAAQC,UAAUkX,MAAK,WAC5B,OAAO+rB,CACT,IAAG/rB,MAAK,WACN,OAAOiqB,CACT,IAAG2B,OAAM,SAAUx1D,GACjB,OAAOA,CACT,GACF,GACF,CAEA,SAAS41D,EAAazB,EAAc16C,EAAQyF,EAAOgH,GACjD,GAAqB,iBAAVhH,EAAoB,CAC7B,GAAyB,IAArBhE,UAAU/c,OACZ,MAAM,IAAIooB,EAAqB,QAAS,CAAC,SAAU,QAAS,WAAY,UAAWrH,GAGrF,GAAwB,WAApByzC,EAAQl5C,IAAmC,OAAXA,GAClC,GAAIA,EAAOyM,UAAYhH,EACrB,MAAM,IAAI6zC,EAAuB,gBAAiB,sBAAuBvzC,OAAO/F,EAAOyM,QAAS,wCAE7F,GAAIzM,IAAWyF,EACpB,MAAM,IAAI6zC,EAAuB,gBAAiB,cAAevzC,OAAO/F,EAAQ,mCAGlFyM,EAAUhH,EACVA,OAAQrgB,CACV,MAAO,GAAa,MAATqgB,GAAoC,WAAnByzC,EAAQzzC,IAAwC,mBAAVA,EAChE,MAAM,IAAIqH,EAAqB,QAAS,CAAC,SAAU,QAAS,WAAY,UAAWrH,GAGrF,GAAIzF,IAAWo6C,EAAuB,CACpC,IAAIgC,EAAU,GAEV32C,GAASA,EAAMvI,OACjBk/C,GAAW,KAAKr2C,OAAON,EAAMvI,KAAM,MAGrCk/C,GAAW3vC,EAAU,KAAK1G,OAAO0G,GAAW,IAC5C,IAAI4vC,EAA+B,YAAtB3B,EAAax9C,KAAqB,YAAc,YAC7Dm9C,EAAU,CACRr6C,YAAQ5a,EACR6kC,SAAUxkB,EACVg1C,SAAUC,EAAax9C,KACvBuP,QAAS,oBAAoB1G,OAAOs2C,GAAQt2C,OAAOq2C,GACnD1B,aAAcA,GAElB,CAEA,GAAIj1C,IAAUi2C,EAAkB17C,EAAQyF,EAAOgH,EAASiuC,GACtD,MAAM16C,CAEV,CAEA,SAASs8C,EAAe5B,EAAc16C,EAAQyF,EAAOgH,GACnD,GAAIzM,IAAWo6C,EAAf,CAOA,GALqB,iBAAV30C,IACTgH,EAAUhH,EACVA,OAAQrgB,IAGLqgB,GAASi2C,EAAkB17C,EAAQyF,GAAQ,CAC9C,IAAI22C,EAAU3vC,EAAU,KAAK1G,OAAO0G,GAAW,IAC3C4vC,EAA+B,kBAAtB3B,EAAax9C,KAA2B,YAAc,YACnEm9C,EAAU,CACRr6C,OAAQA,EACRiqB,SAAUxkB,EACVg1C,SAAUC,EAAax9C,KACvBuP,QAAS,gBAAgB1G,OAAOs2C,GAAQt2C,OAAOq2C,EAAS,MAAQ,oBAAqBr2C,OAAO/F,GAAUA,EAAOyM,QAAS,KACtHiuC,aAAcA,GAElB,CAEA,MAAM16C,CAnBsC,CAoB9C,CA0FA,SAASu8C,IACP,IAAK,IAAIC,EAAQ/6C,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAM80D,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpFnkC,EAAKmkC,GAASh7C,UAAUg7C,GAG1BnC,EAAQr1C,WAAM,EAAQ,CAACs3C,EAAQjkC,EAAK5zB,QAAQqhB,OAAOuS,GACrD,CA9FAhzB,EAAOo3D,OAAS,SAASA,EAAOT,GAC9B,IAAK,IAAIU,EAAQl7C,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMi1D,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxGtkC,EAAKskC,EAAQ,GAAKn7C,UAAUm7C,GAG9BT,EAAal3C,WAAM,EAAQ,CAACy3C,EAAQb,EAAUI,IAAYl2C,OAAOuS,GACnE,EAEAhzB,EAAOu3D,QAAU,SAASA,EAAQZ,GAChC,IAAK,IAAIa,EAAQr7C,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMo1D,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxGzkC,EAAKykC,EAAQ,GAAKt7C,UAAUs7C,GAG9B,OAAOf,EAAcC,GAAW9rB,MAAK,SAAU8K,GAC7C,OAAOkhB,EAAal3C,WAAM,EAAQ,CAAC43C,EAAS5hB,GAAQl1B,OAAOuS,GAC7D,GACF,EAEAhzB,EAAO03D,aAAe,SAASA,EAAarvC,GAC1C,IAAK,IAAIsvC,EAAQx7C,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMu1D,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxG5kC,EAAK4kC,EAAQ,GAAKz7C,UAAUy7C,GAG9BZ,EAAer3C,WAAM,EAAQ,CAAC+3C,EAAcnB,EAAUluC,IAAK5H,OAAOuS,GACpE,EAEAhzB,EAAO63D,cAAgB,SAASA,EAAcxvC,GAC5C,IAAK,IAAIyvC,EAAQ37C,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAM01D,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxG/kC,EAAK+kC,EAAQ,GAAK57C,UAAU47C,GAG9B,OAAOrB,EAAcruC,GAAIwiB,MAAK,SAAU8K,GACtC,OAAOqhB,EAAer3C,WAAM,EAAQ,CAACk4C,EAAeliB,GAAQl1B,OAAOuS,GACrE,GACF,EAEAhzB,EAAOg4D,QAAU,SAASA,EAAQlkC,GAChC,GAAIA,QAAmC,CACrC,IAAI3M,EAAU,mCAEO,WAAjBysC,EAAQ9/B,IAA4C,iBAAhBA,EAAI3M,QACf,IAAvB2M,EAAI3M,QAAQ/nB,QAAgB00B,EAAIz1B,YAClC8oB,GAAW2M,EAAIz1B,YAAYuZ,KAE3BuP,GAAW2M,EAAI3M,QAGjBA,GAAWhjB,EAAQ2vB,GAGrB,IAAImkC,EAAS,IAAI7D,EAAe,CAC9B15C,OAAQoZ,EACR6Q,SAAU,KACVwwB,SAAU,UACVhuC,QAASA,EACTiuC,aAAc4C,IAGZE,EAAYpkC,EAAI5M,MAEpB,GAAyB,iBAAdgxC,EAAwB,CAIjC,IAAIC,EAAOD,EAAUt/C,MAAM,MAC3Bu/C,EAAKrlD,QAIL,IAFA,IAAIslD,EAAOH,EAAO/wC,MAAMtO,MAAM,MAErB1W,EAAI,EAAGA,EAAIi2D,EAAK/4D,OAAQ8C,IAAK,CAEpC,IAAIye,EAAMy3C,EAAKj7C,QAAQg7C,EAAKj2D,IAE5B,IAAa,IAATye,EAAY,CAEdy3C,EAAOA,EAAKx9C,MAAM,EAAG+F,GACrB,KACF,CACF,CAEAs3C,EAAO/wC,MAAQ,GAAGzG,OAAO23C,EAAKx+B,KAAK,MAAO,MAAMnZ,OAAO03C,EAAKv+B,KAAK,MACnE,CAEA,MAAMq+B,CACR,CACF,EAWAj4D,EAAOi3D,OAAS1C,EAAa0C,EAAQj3D,EAAQ,CAC3CksB,MAAOlsB,EAAO81D,YACdJ,UAAW11D,EAAO41D,gBAClBH,SAAUz1D,EAAO+1D,eACjBJ,aAAc31D,EAAO61D,qBAEvB71D,EAAOi3D,OAAOA,OAASj3D,EAAOi3D,yBCtnB9B,SAAWt5D,EAAQD,GACjB,aAGA,SAASsC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,mBACnC,CAIA,SAASE,EAAUnC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIQ,EAAW,WAAa,EAC5BA,EAASN,UAAYF,EAAUE,UAC/BH,EAAKG,UAAY,IAAIM,EACrBT,EAAKG,UAAUC,YAAcJ,CAC/B,CAIA,SAASoC,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKtB,OAAS,EAGdsB,KAAKG,IAAM,KAEI,OAAXP,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKI,MAAMR,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAElD,CAUA,IAAI5B,EATkB,iBAAXjB,EACTA,EAAOD,QAAU2C,EAEjB3C,EAAQ2C,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGU,SAAW,GAGd,IAEInC,EADoB,oBAAXoC,aAAmD,IAAlBA,OAAOpC,OACxCoC,OAAOpC,OAEP,aAEb,CAAE,MAAOqC,GACT,CA+HA,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEXrB,GAAO,EAAO,wBAA0BmB,EAE5C,CAEA,SAASI,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,CACT,CA6CA,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAInC,IAHA,IAAIL,EAAI,EACJkD,EAAI,EACJ5C,EAAMC,KAAKC,IAAIN,EAAIvC,OAAQyC,GACtBK,EAAIN,EAAOM,EAAIH,EAAKG,IAAK,CAChC,IAAIb,EAAIM,EAAIL,WAAWY,GAAK,GAE5BT,GAAKK,EAIH6C,EADEtD,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENrB,EAAOqB,GAAK,GAAKsD,EAAI7C,EAAK,qBAC1BL,GAAKkD,CACP,CACA,OAAOlD,CACT,CA2DA,SAAS42D,EAAMt0D,EAAMjF,GACnBiF,EAAKnD,MAAQ9B,EAAI8B,MACjBmD,EAAK3E,OAASN,EAAIM,OAClB2E,EAAKpD,SAAW7B,EAAI6B,SACpBoD,EAAKlD,IAAM/B,EAAI+B,GACjB,CAqCA,GA9TAR,EAAGI,KAAO,SAAe0B,GACvB,OAAIA,aAAe9B,GAIJ,OAAR8B,GAA+B,iBAARA,GAC5BA,EAAI9D,YAAY0C,WAAaV,EAAGU,UAAYqB,MAAMC,QAAQF,EAAIvB,MAClE,EAEAP,EAAGiC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAnC,EAAG4B,IAAM,SAAcM,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAnC,EAAGjC,UAAU0C,MAAQ,SAAeR,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAKgC,YAAYpC,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAKiC,WAAWrC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETP,EAAOO,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqB,EAAQ,EACM,OAFlBtB,EAASA,EAAOsC,WAAWC,QAAQ,OAAQ,KAEhC,KACTjB,IACAlB,KAAKC,SAAW,GAGdiB,EAAQtB,EAAOlB,SACJ,KAATmB,EACFG,KAAKoC,UAAUxC,EAAQsB,EAAOpB,IAE9BE,KAAKqC,WAAWzC,EAAQC,EAAMqB,GACf,OAAXpB,GACFE,KAAKiC,WAAWjC,KAAKsC,UAAWzC,EAAMC,IAI9C,EAEAH,EAAGjC,UAAUsE,YAAc,SAAsBpC,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAU,SAATN,GACdI,KAAKtB,OAAS,GACLkB,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKtB,OAAS,IAEdY,EAAOM,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKtB,OAAS,GAGD,OAAXoB,GAGJE,KAAKiC,WAAWjC,KAAKsC,UAAWzC,EAAMC,EACxC,EAEAH,EAAGjC,UAAUuE,WAAa,SAAqBrC,EAAQC,EAAMC,GAG3D,GADAR,EAAgC,iBAAlBM,EAAOlB,QACjBkB,EAAOlB,QAAU,EAGnB,OAFAsB,KAAKE,MAAQ,CAAC,GACdF,KAAKtB,OAAS,EACPsB,KAGTA,KAAKtB,OAAS4C,KAAKiB,KAAK3C,EAAOlB,OAAS,GACxCsB,KAAKE,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/BxB,KAAKE,MAAMsB,GAAK,EAGlB,IAAIgB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAX5C,EACF,IAAK0B,EAAI5B,EAAOlB,OAAS,EAAG8D,EAAI,EAAGhB,GAAK,EAAGA,GAAK,EAC9CiB,EAAI7C,EAAO4B,GAAM5B,EAAO4B,EAAI,IAAM,EAAM5B,EAAO4B,EAAI,IAAM,GACzDxB,KAAKE,MAAMsC,IAAOC,GAAKC,EAAO,SAC9B1C,KAAKE,MAAMsC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAX1C,EACT,IAAK0B,EAAI,EAAGgB,EAAI,EAAGhB,EAAI5B,EAAOlB,OAAQ8C,GAAK,EACzCiB,EAAI7C,EAAO4B,GAAM5B,EAAO4B,EAAI,IAAM,EAAM5B,EAAO4B,EAAI,IAAM,GACzDxB,KAAKE,MAAMsC,IAAOC,GAAKC,EAAO,SAC9B1C,KAAKE,MAAMsC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAOxC,KAAKoY,QACd,EA0BAzY,EAAGjC,UAAU0E,UAAY,SAAoBxC,EAAQsB,EAAOpB,GAE1DE,KAAKtB,OAAS4C,KAAKiB,MAAM3C,EAAOlB,OAASwC,GAAS,GAClDlB,KAAKE,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/BxB,KAAKE,MAAMsB,GAAK,EAIlB,IAGIiB,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAX1C,EACF,IAAK0B,EAAI5B,EAAOlB,OAAS,EAAG8C,GAAKN,EAAOM,GAAK,EAC3CiB,EAAI5B,EAAajB,EAAQsB,EAAOM,IAAMkB,EACtC1C,KAAKE,MAAMsC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLxC,KAAKE,MAAMsC,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKlB,GADa5B,EAAOlB,OAASwC,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOM,EAAI5B,EAAOlB,OAAQ8C,GAAK,EAC1EiB,EAAI5B,EAAajB,EAAQsB,EAAOM,IAAMkB,EACtC1C,KAAKE,MAAMsC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLxC,KAAKE,MAAMsC,IAAMC,IAAM,IAEvBC,GAAO,EAKb1C,KAAKoY,QACP,EA6BAzY,EAAGjC,UAAU2E,WAAa,SAAqBzC,EAAQC,EAAMqB,GAE3DlB,KAAKE,MAAQ,CAAC,GACdF,KAAKtB,OAAS,EAGd,IAAK,IAAIkE,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWhD,EAClE+C,IAEFA,IACAC,EAAWA,EAAUhD,EAAQ,EAO7B,IALA,IAAIiD,EAAQlD,EAAOlB,OAASwC,EACxB6B,EAAMD,EAAQF,EACdzB,EAAMG,KAAKC,IAAIuB,EAAOA,EAAQC,GAAO7B,EAErC8B,EAAO,EACFxB,EAAIN,EAAOM,EAAIL,EAAKK,GAAKoB,EAChCI,EAAOhC,EAAUpB,EAAQ4B,EAAGA,EAAIoB,EAAS/C,GAEzCG,KAAKiD,MAAMJ,GACP7C,KAAKE,MAAM,GAAK8C,EAAO,SACzBhD,KAAKE,MAAM,IAAM8C,EAEjBhD,KAAKkD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOhC,EAAUpB,EAAQ4B,EAAG5B,EAAOlB,OAAQmB,GAEtC2B,EAAI,EAAGA,EAAIuB,EAAKvB,IACnB2B,GAAOtD,EAGTG,KAAKiD,MAAME,GACPnD,KAAKE,MAAM,GAAK8C,EAAO,SACzBhD,KAAKE,MAAM,IAAM8C,EAEjBhD,KAAKkD,OAAOF,EAEhB,CAEAhD,KAAKoY,QACP,EAEAzY,EAAGjC,UAAU0F,KAAO,SAAeC,GACjCA,EAAKnD,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/B6B,EAAKnD,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAE7B6B,EAAK3E,OAASsB,KAAKtB,OACnB2E,EAAKpD,SAAWD,KAAKC,SACrBoD,EAAKlD,IAAMH,KAAKG,GAClB,EASAR,EAAGjC,UAAUk6D,MAAQ,SAAgBv0D,GACnCs0D,EAAKt0D,EAAMrD,KACb,EAEAL,EAAGjC,UAAU4F,MAAQ,WACnB,IAAIvC,EAAI,IAAIpB,EAAG,MAEf,OADAK,KAAKoD,KAAKrC,GACHA,CACT,EAEApB,EAAGjC,UAAU6F,QAAU,SAAkBvE,GACvC,KAAOgB,KAAKtB,OAASM,GACnBgB,KAAKE,MAAMF,KAAKtB,UAAY,EAE9B,OAAOsB,IACT,EAGAL,EAAGjC,UAAU0a,OAAS,WACpB,KAAOpY,KAAKtB,OAAS,GAAqC,IAAhCsB,KAAKE,MAAMF,KAAKtB,OAAS,IACjDsB,KAAKtB,SAEP,OAAOsB,KAAKwD,WACd,EAEA7D,EAAGjC,UAAU8F,UAAY,WAKvB,OAHoB,IAAhBxD,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACT,EAIsB,oBAAXwZ,QAAgD,mBAAfA,OAAOq+C,IACjD,IACEl4D,EAAGjC,UAAU8b,OAAOq+C,IAAI,+BAAiCp0D,CAC3D,CAAE,MAAOlD,GACPZ,EAAGjC,UAAU+F,QAAUA,CACzB,MAEA9D,EAAGjC,UAAU+F,QAAUA,EAGzB,SAASA,IACP,OAAQzD,KAAKG,IAAM,UAAY,SAAWH,KAAKkC,SAAS,IAAM,GAChE,CAgCA,IAAIwB,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UA4mB9D,SAASC,EAAYC,EAAMrC,EAAKsC,GAC9BA,EAAI9D,SAAWwB,EAAIxB,SAAW6D,EAAK7D,SACnC,IAAIoB,EAAOyC,EAAKpF,OAAS+C,EAAI/C,OAAU,EACvCqF,EAAIrF,OAAS2C,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAI2C,EAAoB,EAAhBF,EAAK5D,MAAM,GACf+D,EAAmB,EAAfxC,EAAIvB,MAAM,GACda,EAAIiD,EAAIC,EAERC,EAAS,SAAJnD,EACLoD,EAASpD,EAAI,SAAa,EAC9BgD,EAAI7D,MAAM,GAAKgE,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI/C,EAAK+C,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOjD,KAAKC,IAAI6C,EAAG3C,EAAI/C,OAAS,GAC3B8D,EAAIlB,KAAKM,IAAI,EAAGwC,EAAIN,EAAKpF,OAAS,GAAI8D,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIhB,EAAK4C,EAAI5B,EAAK,EAIlB6B,IADAtD,GAFAiD,EAAoB,EAAhBF,EAAK5D,MAAMsB,KACfyC,EAAmB,EAAfxC,EAAIvB,MAAMsC,IACF8B,GACG,SAAa,EAC5BA,EAAY,SAAJvD,CACV,CACAgD,EAAI7D,MAAMkE,GAAa,EAARE,EACfH,EAAiB,EAATE,CACV,CAOA,OANc,IAAVF,EACFJ,EAAI7D,MAAMkE,GAAa,EAARD,EAEfJ,EAAIrF,SAGCqF,EAAIqU,QACb,CAhpBAzY,EAAGjC,UAAUwE,SAAW,SAAmBrC,EAAM2E,GAI/C,IAAIT,EACJ,GAHAS,EAAoB,EAAVA,GAAe,EAGZ,MAJb3E,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCkE,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNyB,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIiB,EAAIzC,KAAKE,MAAMsB,GACfwB,GAA+B,UAArBP,GAAKC,EAAOyB,IAAmBjC,SAAS,IACtDiC,EAAS1B,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACPlB,KAGAuC,EADY,IAAVI,GAAe3C,IAAMxB,KAAKtB,OAAS,EAC/BgF,EAAM,EAAIV,EAAKtE,QAAUsE,EAAOe,EAEhCf,EAAOe,CAEjB,CAIA,IAHc,IAAVI,IACFJ,EAAMI,EAAMjC,SAAS,IAAM6B,GAEtBA,EAAIrF,OAAS8F,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB/D,KAAKC,WACP8D,EAAM,IAAMA,GAEPA,CACT,CAEA,GAAIlE,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI4E,EAAYd,EAAW9D,GAEvB6E,EAAYd,EAAW/D,GAC3BkE,EAAM,GACN,IAAIpD,EAAIX,KAAKsD,QAEb,IADA3C,EAAEV,SAAW,GACLU,EAAEgE,UAAU,CAClB,IAAI5D,EAAIJ,EAAEm3D,MAAMpzD,GAAWxC,SAASrC,GAMlCkE,GALFpD,EAAIA,EAAEkE,MAAMH,IAELC,SAGC5D,EAAIgD,EAFJL,EAAMe,EAAY1D,EAAErC,QAAUqC,EAAIgD,CAI5C,CAIA,IAHI/D,KAAK2E,WACPZ,EAAM,IAAMA,GAEPA,EAAIrF,OAAS8F,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB/D,KAAKC,WACP8D,EAAM,IAAMA,GAEPA,CACT,CAEAzE,GAAO,EAAO,kCAChB,EAEAK,EAAGjC,UAAUoH,SAAW,WACtB,IAAIC,EAAM/E,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKtB,OACPqG,GAAuB,SAAhB/E,KAAKE,MAAM,GACO,IAAhBF,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,GAEzC6E,GAAO,iBAAoC,SAAhB/E,KAAKE,MAAM,GAC7BF,KAAKtB,OAAS,GACvBY,GAAO,EAAO,8CAEU,IAAlBU,KAAKC,UAAmB8E,EAAMA,CACxC,EAEApF,EAAGjC,UAAUsH,OAAS,WACpB,OAAOhF,KAAKkC,SAAS,GAAI,EAC3B,EAEIhE,IACFyB,EAAGjC,UAAUuH,SAAW,SAAmBnF,EAAQpB,GACjD,OAAOsB,KAAKkF,YAAYhH,EAAQ4B,EAAQpB,EAC1C,GAGFiB,EAAGjC,UAAU4E,QAAU,SAAkBxC,EAAQpB,GAC/C,OAAOsB,KAAKkF,YAAYxD,MAAO5B,EAAQpB,EACzC,EASAiB,EAAGjC,UAAUwH,YAAc,SAAsBC,EAAWrF,EAAQpB,GAClEsB,KAAKoY,SAEL,IAAIhT,EAAapF,KAAKoF,aAClBC,EAAY3G,GAAU4C,KAAKM,IAAI,EAAGwD,GACtC9F,EAAO8F,GAAcC,EAAW,yCAChC/F,EAAO+F,EAAY,EAAG,+BAEtB,IAAIE,EAfS,SAAmBJ,EAAWnG,GAC3C,OAAImG,EAAUtG,YACLsG,EAAUtG,YAAYG,GAExB,IAAImG,EAAUnG,EACvB,CAUY+4D,CAAS5yD,EAAWE,GAG9B,OADArF,KAAK,gBADoB,OAAXF,EAAkB,KAAO,OACRyF,EAAKH,GAC7BG,CACT,EAEA5F,EAAGjC,UAAUs6D,eAAiB,SAAyBzyD,EAAKH,GAI1D,IAHA,IAAIqxB,EAAW,EACXtyB,EAAQ,EAEH3C,EAAI,EAAG4Q,EAAQ,EAAG5Q,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAC/C,IAAIwB,EAAQhD,KAAKE,MAAMsB,IAAM4Q,EAASjO,EAEtCoB,EAAIkxB,KAAqB,IAAPzzB,EACdyzB,EAAWlxB,EAAI7G,SACjB6G,EAAIkxB,KAAezzB,GAAQ,EAAK,KAE9ByzB,EAAWlxB,EAAI7G,SACjB6G,EAAIkxB,KAAezzB,GAAQ,GAAM,KAGrB,IAAVoP,GACEqkB,EAAWlxB,EAAI7G,SACjB6G,EAAIkxB,KAAezzB,GAAQ,GAAM,KAEnCmB,EAAQ,EACRiO,EAAQ,IAERjO,EAAQnB,IAAS,GACjBoP,GAAS,EAEb,CAEA,GAAIqkB,EAAWlxB,EAAI7G,OAGjB,IAFA6G,EAAIkxB,KAActyB,EAEXsyB,EAAWlxB,EAAI7G,QACpB6G,EAAIkxB,KAAc,CAGxB,EAEA92B,EAAGjC,UAAUu6D,eAAiB,SAAyB1yD,EAAKH,GAI1D,IAHA,IAAIqxB,EAAWlxB,EAAI7G,OAAS,EACxByF,EAAQ,EAEH3C,EAAI,EAAG4Q,EAAQ,EAAG5Q,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAC/C,IAAIwB,EAAQhD,KAAKE,MAAMsB,IAAM4Q,EAASjO,EAEtCoB,EAAIkxB,KAAqB,IAAPzzB,EACdyzB,GAAY,IACdlxB,EAAIkxB,KAAezzB,GAAQ,EAAK,KAE9ByzB,GAAY,IACdlxB,EAAIkxB,KAAezzB,GAAQ,GAAM,KAGrB,IAAVoP,GACEqkB,GAAY,IACdlxB,EAAIkxB,KAAezzB,GAAQ,GAAM,KAEnCmB,EAAQ,EACRiO,EAAQ,IAERjO,EAAQnB,IAAS,GACjBoP,GAAS,EAEb,CAEA,GAAIqkB,GAAY,EAGd,IAFAlxB,EAAIkxB,KAActyB,EAEXsyB,GAAY,GACjBlxB,EAAIkxB,KAAc,CAGxB,EAEIn1B,KAAKqE,MACPhG,EAAGjC,UAAUkI,WAAa,SAAqBnD,GAC7C,OAAO,GAAKnB,KAAKqE,MAAMlD,EACzB,EAEA9C,EAAGjC,UAAUkI,WAAa,SAAqBnD,GAC7C,IAAIoD,EAAIpD,EACJ1B,EAAI,EAiBR,OAhBI8E,GAAK,OACP9E,GAAK,GACL8E,KAAO,IAELA,GAAK,KACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAEF9E,EAAI8E,CACb,EAGFlG,EAAGjC,UAAUoI,UAAY,SAAoBrD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIoD,EAAIpD,EACJ1B,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ8E,KACH9E,GAAK,GACL8E,KAAO,IAEU,IAAV,IAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,GAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,IACH9E,IAEKA,CACT,EAGApB,EAAGjC,UAAUqI,UAAY,WACvB,IAAItD,EAAIzC,KAAKE,MAAMF,KAAKtB,OAAS,GAC7BsH,EAAKhG,KAAK4F,WAAWnD,GACzB,OAA2B,IAAnBzC,KAAKtB,OAAS,GAAUsH,CAClC,EAgBArG,EAAGjC,UAAUuI,SAAW,WACtB,GAAIjG,KAAK2E,SAAU,OAAO,EAG1B,IADA,IAAI5D,EAAI,EACCS,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIyC,EAAIjE,KAAK8F,UAAU9F,KAAKE,MAAMsB,IAElC,GADAT,GAAKkD,EACK,KAANA,EAAU,KAChB,CACA,OAAOlD,CACT,EAEApB,EAAGjC,UAAU0H,WAAa,WACxB,OAAO9D,KAAKiB,KAAKvC,KAAK+F,YAAc,EACtC,EAEApG,EAAGjC,UAAUwI,OAAS,SAAiBC,GACrC,OAAsB,IAAlBnG,KAAKC,SACAD,KAAKoG,MAAMC,MAAMF,GAAOG,MAAM,GAEhCtG,KAAKsD,OACd,EAEA3D,EAAGjC,UAAU6I,SAAW,SAAmBJ,GACzC,OAAInG,KAAKwG,MAAML,EAAQ,GACdnG,KAAKyG,KAAKN,GAAOG,MAAM,GAAGI,OAE5B1G,KAAKsD,OACd,EAEA3D,EAAGjC,UAAUiJ,MAAQ,WACnB,OAAyB,IAAlB3G,KAAKC,QACd,EAGAN,EAAGjC,UAAUkJ,IAAM,WACjB,OAAO5G,KAAKsD,QAAQoD,MACtB,EAEA/G,EAAGjC,UAAUgJ,KAAO,WAKlB,OAJK1G,KAAK2E,WACR3E,KAAKC,UAAY,GAGZD,IACT,EAGAL,EAAGjC,UAAUmJ,KAAO,SAAepF,GACjC,KAAOzB,KAAKtB,OAAS+C,EAAI/C,QACvBsB,KAAKE,MAAMF,KAAKtB,UAAY,EAG9B,IAAK,IAAI8C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAC9BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAAKC,EAAIvB,MAAMsB,GAG5C,OAAOxB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUoJ,IAAM,SAAcrF,GAE/B,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAK6G,KAAKpF,EACnB,EAGA9B,EAAGjC,UAAUqJ,GAAK,SAAatF,GAC7B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQwD,IAAIrF,GAC/CA,EAAI6B,QAAQwD,IAAI9G,KACzB,EAEAL,EAAGjC,UAAUsJ,IAAM,SAAcvF,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQuD,KAAKpF,GAChDA,EAAI6B,QAAQuD,KAAK7G,KAC1B,EAGAL,EAAGjC,UAAUuJ,MAAQ,SAAgBxF,GAEnC,IAAIwC,EAEFA,EADEjE,KAAKtB,OAAS+C,EAAI/C,OAChB+C,EAEAzB,KAGN,IAAK,IAAIwB,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAAKC,EAAIvB,MAAMsB,GAK5C,OAFAxB,KAAKtB,OAASuF,EAAEvF,OAETsB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUwJ,KAAO,SAAezF,GAEjC,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAKiH,MAAMxF,EACpB,EAGA9B,EAAGjC,UAAUyJ,IAAM,SAAc1F,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ4D,KAAKzF,GAChDA,EAAI6B,QAAQ4D,KAAKlH,KAC1B,EAEAL,EAAGjC,UAAU0J,KAAO,SAAe3F,GACjC,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ2D,MAAMxF,GACjDA,EAAI6B,QAAQ2D,MAAMjH,KAC3B,EAGAL,EAAGjC,UAAU2J,MAAQ,SAAgB5F,GAEnC,IAAIuC,EACAC,EACAjE,KAAKtB,OAAS+C,EAAI/C,QACpBsF,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAGN,IAAK,IAAIwB,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAAKyC,EAAE/D,MAAMsB,GAGvC,GAAIxB,OAASgE,EACX,KAAOxC,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAM5B,OAFAxB,KAAKtB,OAASsF,EAAEtF,OAETsB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU4J,KAAO,SAAe7F,GAEjC,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAKqH,MAAM5F,EACpB,EAGA9B,EAAGjC,UAAU6J,IAAM,SAAc9F,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQgE,KAAK7F,GAChDA,EAAI6B,QAAQgE,KAAKtH,KAC1B,EAEAL,EAAGjC,UAAU8J,KAAO,SAAe/F,GACjC,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ+D,MAAM5F,GACjDA,EAAI6B,QAAQ+D,MAAMrH,KAC3B,EAGAL,EAAGjC,UAAU2I,MAAQ,SAAgBF,GACnC7G,EAAwB,iBAAV6G,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBnG,KAAKiB,KAAK4D,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBnG,KAAKuD,QAAQkE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIjG,EAAI,EAAGA,EAAIiG,EAAajG,IAC/BxB,KAAKE,MAAMsB,GAAsB,UAAhBxB,KAAKE,MAAMsB,GAS9B,OALIkG,EAAW,IACb1H,KAAKE,MAAMsB,IAAMxB,KAAKE,MAAMsB,GAAM,UAAc,GAAKkG,GAIhD1H,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU+I,KAAO,SAAeN,GACjC,OAAOnG,KAAKsD,QAAQ+C,MAAMF,EAC5B,EAGAxG,EAAGjC,UAAUiK,KAAO,SAAeC,EAAKrI,GACtCD,EAAsB,iBAARsI,GAAoBA,GAAO,GAEzC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA5H,KAAKuD,QAAQb,EAAM,GAGjB1C,KAAKE,MAAMwC,GADTnD,EACgBS,KAAKE,MAAMwC,GAAQ,GAAKmF,EAExB7H,KAAKE,MAAMwC,KAAS,GAAKmF,GAGtC7H,KAAKoY,QACd,EAGAzY,EAAGjC,UAAUoK,KAAO,SAAerG,GACjC,IAAIV,EAkBAiD,EAAGC,EAfP,GAAsB,IAAlBjE,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAI7B,OAHAD,KAAKC,SAAW,EAChBc,EAAIf,KAAK+H,KAAKtG,GACdzB,KAAKC,UAAY,EACVD,KAAKwD,YAGP,GAAsB,IAAlBxD,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAIpC,OAHAwB,EAAIxB,SAAW,EACfc,EAAIf,KAAK+H,KAAKtG,GACdA,EAAIxB,SAAW,EACRc,EAAEyC,YAKPxD,KAAKtB,OAAS+C,EAAI/C,QACpBsF,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAIN,IADA,IAAImE,EAAQ,EACH3C,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BT,GAAkB,EAAbiD,EAAE9D,MAAMsB,KAAwB,EAAbyC,EAAE/D,MAAMsB,IAAU2C,EAC1CnE,KAAKE,MAAMsB,GAAS,SAAJT,EAChBoD,EAAQpD,IAAM,GAEhB,KAAiB,IAAVoD,GAAe3C,EAAIwC,EAAEtF,OAAQ8C,IAClCT,GAAkB,EAAbiD,EAAE9D,MAAMsB,IAAU2C,EACvBnE,KAAKE,MAAMsB,GAAS,SAAJT,EAChBoD,EAAQpD,IAAM,GAIhB,GADAf,KAAKtB,OAASsF,EAAEtF,OACF,IAAVyF,EACFnE,KAAKE,MAAMF,KAAKtB,QAAUyF,EAC1BnE,KAAKtB,cAEA,GAAIsF,IAAMhE,KACf,KAAOwB,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAI5B,OAAOxB,IACT,EAGAL,EAAGjC,UAAUsK,IAAM,SAAcvG,GAC/B,IAAI8D,EACJ,OAAqB,IAAjB9D,EAAIxB,UAAoC,IAAlBD,KAAKC,UAC7BwB,EAAIxB,SAAW,EACfsF,EAAMvF,KAAKiI,IAAIxG,GACfA,EAAIxB,UAAY,EACTsF,GACmB,IAAjB9D,EAAIxB,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChBsF,EAAM9D,EAAIwG,IAAIjI,MACdA,KAAKC,SAAW,EACTsF,GAGLvF,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQwE,KAAKrG,GAEhDA,EAAI6B,QAAQwE,KAAK9H,KAC1B,EAGAL,EAAGjC,UAAUqK,KAAO,SAAetG,GAEjC,GAAqB,IAAjBA,EAAIxB,SAAgB,CACtBwB,EAAIxB,SAAW,EACf,IAAIc,EAAIf,KAAK8H,KAAKrG,GAElB,OADAA,EAAIxB,SAAW,EACRc,EAAEyC,WAGX,CAAO,GAAsB,IAAlBxD,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAK8H,KAAKrG,GACVzB,KAAKC,SAAW,EACTD,KAAKwD,YAId,IAWIQ,EAAGC,EAXHlC,EAAM/B,KAAK+B,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHA/B,KAAKC,SAAW,EAChBD,KAAKtB,OAAS,EACdsB,KAAKE,MAAM,GAAK,EACTF,KAKL+B,EAAM,GACRiC,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAIN,IADA,IAAImE,EAAQ,EACH3C,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAE5B2C,GADApD,GAAkB,EAAbiD,EAAE9D,MAAMsB,KAAwB,EAAbyC,EAAE/D,MAAMsB,IAAU2C,IAC7B,GACbnE,KAAKE,MAAMsB,GAAS,SAAJT,EAElB,KAAiB,IAAVoD,GAAe3C,EAAIwC,EAAEtF,OAAQ8C,IAElC2C,GADApD,GAAkB,EAAbiD,EAAE9D,MAAMsB,IAAU2C,IACV,GACbnE,KAAKE,MAAMsB,GAAS,SAAJT,EAIlB,GAAc,IAAVoD,GAAe3C,EAAIwC,EAAEtF,QAAUsF,IAAMhE,KACvC,KAAOwB,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAU5B,OANAxB,KAAKtB,OAAS4C,KAAKM,IAAI5B,KAAKtB,OAAQ8C,GAEhCwC,IAAMhE,OACRA,KAAKC,SAAW,GAGXD,KAAKoY,QACd,EAGAzY,EAAGjC,UAAUuK,IAAM,SAAcxG,GAC/B,OAAOzB,KAAKsD,QAAQyE,KAAKtG,EAC3B,EA8CA,IAAIyG,EAAc,SAAsBpE,EAAMrC,EAAKsC,GACjD,IAIIG,EACAiE,EACAnC,EANAhC,EAAIF,EAAK5D,MACT+D,EAAIxC,EAAIvB,MACRkI,EAAIrE,EAAI7D,MACRS,EAAI,EAIJ0H,EAAY,EAAPrE,EAAE,GACPsE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxE,EAAE,GACPyE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3E,EAAE,GACP4E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9E,EAAE,GACP+E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjF,EAAE,GACPkF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpF,EAAE,GACPqF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvF,EAAE,GACPwF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1F,EAAE,GACP2F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlG,EAAE,GACPmG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrG,EAAE,GACPsG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxG,EAAE,GACPyG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3G,EAAE,GACP4G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9G,EAAE,GACP+G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPjH,EAAE,GACPkH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpH,EAAE,GACPqH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvH,EAAE,GACPwH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1H,EAAE,GACP2H,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP7H,EAAE,GACP8H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB/H,EAAI9D,SAAW6D,EAAK7D,SAAWwB,EAAIxB,SACnC8D,EAAIrF,OAAS,GAMb,IAAIuN,IAAQtL,GAJZuD,EAAK5C,KAAK4K,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM7G,KAAK4K,KAAK5D,EAAK+B,IACR/I,KAAK4K,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDzJ,IAFAqF,EAAK1E,KAAK4K,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAK5C,KAAK4K,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKzD,EAAK4B,IACR/I,KAAK4K,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQxL,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKkC,GAAQ,GACvBlJ,KAAK4K,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrD5J,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAK5C,KAAK4K,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKtD,EAAKyB,IACR/I,KAAK4K,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKrD,EAAKwB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK+B,GAAQ,GACvBlJ,KAAK4K,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQzL,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKqC,GAAQ,GACvBrJ,KAAK4K,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD/J,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAK5C,KAAK4K,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKnD,EAAKsB,IACR/I,KAAK4K,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKlD,EAAKqB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK4B,GAAQ,GACvBlJ,KAAK4K,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKkC,GAAQ,GACvBrJ,KAAK4K,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQ1L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKwC,GAAQ,GACvBxJ,KAAK4K,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDlK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAK5C,KAAK4K,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKhD,EAAKmB,IACR/I,KAAK4K,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAK/C,EAAKkB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKyB,GAAQ,GACvBlJ,KAAK4K,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK+B,GAAQ,GACvBrJ,KAAK4K,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK8B,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKqC,GAAQ,GACvBxJ,KAAK4K,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQ3L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK2C,IAAQ,GACvB3J,KAAK4K,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDrK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAK5C,KAAK4K,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAK7C,EAAKgB,IACR/I,KAAK4K,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAK5C,EAAKe,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKsB,GAAQ,GACvBlJ,KAAK4K,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK4B,GAAQ,GACvBrJ,KAAK4K,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK2B,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKkC,GAAQ,GACvBxJ,KAAK4K,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKiC,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKwC,IAAQ,GACvB3J,KAAK4K,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQ5L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK8C,IAAQ,GACvB9J,KAAK4K,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDxK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAK5C,KAAK4K,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAK1C,EAAKa,IACR/I,KAAK4K,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKzC,EAAKY,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKmB,GAAQ,GACvBlJ,KAAK4K,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKyB,GAAQ,GACvBrJ,KAAK4K,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKwB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK+B,GAAQ,GACvBxJ,KAAK4K,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK8B,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKqC,IAAQ,GACvB3J,KAAK4K,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK2C,IAAQ,GACvB9J,KAAK4K,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ7L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKiD,IAAQ,GACvBjK,KAAK4K,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrD3K,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAK5C,KAAK4K,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKvC,EAAKU,IACR/I,KAAK4K,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKtC,EAAKS,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKgB,GAAQ,GACvBlJ,KAAK4K,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKsB,GAAQ,GACvBrJ,KAAK4K,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKqB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK4B,GAAQ,GACvBxJ,KAAK4K,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK2B,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKkC,IAAQ,GACvB3J,KAAK4K,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKwC,IAAQ,GACvB9J,KAAK4K,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKuC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK8C,IAAQ,GACvBjK,KAAK4K,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ9L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKoD,IAAQ,GACvBpK,KAAK4K,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD9K,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAK5C,KAAK4K,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKpC,EAAKO,IACR/I,KAAK4K,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKnC,EAAKM,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKa,GAAQ,GACvBlJ,KAAK4K,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKY,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKmB,GAAQ,GACvBrJ,KAAK4K,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKkB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKyB,GAAQ,GACvBxJ,KAAK4K,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKwB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK+B,IAAQ,GACvB3J,KAAK4K,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKqC,IAAQ,GACvB9J,KAAK4K,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKoC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK2C,IAAQ,GACvBjK,KAAK4K,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKiD,IAAQ,GACvBpK,KAAK4K,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ/L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKuD,IAAQ,GACvBvK,KAAK4K,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDjL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAK5C,KAAK4K,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKI,IACR/I,KAAK4K,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKhC,EAAKG,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKU,GAAQ,GACvBlJ,KAAK4K,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKS,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKgB,GAAQ,GACvBrJ,KAAK4K,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKe,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKsB,GAAQ,GACvBxJ,KAAK4K,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKqB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK4B,IAAQ,GACvB3J,KAAK4K,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKkC,IAAQ,GACvB9J,KAAK4K,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKiC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKwC,IAAQ,GACvBjK,KAAK4K,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK8C,IAAQ,GACvBpK,KAAK4K,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK6C,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKoD,IAAQ,GACvBvK,KAAK4K,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQhM,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK0D,IAAQ,GACvB1K,KAAK4K,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENzI,EAAK5C,KAAK4K,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKO,IACRlJ,KAAK4K,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK1E,KAAK4K,KAAKhC,EAAKM,GACpBtG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKa,GAAQ,GACvBrJ,KAAK4K,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKY,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKmB,GAAQ,GACvBxJ,KAAK4K,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKkB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKyB,IAAQ,GACvB3J,KAAK4K,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK+B,IAAQ,GACvB9J,KAAK4K,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK8B,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKqC,IAAQ,GACvBjK,KAAK4K,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK2C,IAAQ,GACvBpK,KAAK4K,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK0C,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKiD,IAAQ,GACvBvK,KAAK4K,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASjM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKuD,IAAQ,GACvB1K,KAAK4K,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAK5C,KAAK4K,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKU,IACRrJ,KAAK4K,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK1E,KAAK4K,KAAKhC,EAAKS,GACpBzG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKgB,GAAQ,GACvBxJ,KAAK4K,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKe,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKsB,IAAQ,GACvB3J,KAAK4K,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKqB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAK4B,IAAQ,GACvB9J,KAAK4K,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKkC,IAAQ,GACvBjK,KAAK4K,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKwC,IAAQ,GACvBpK,KAAK4K,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKuC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK8C,IAAQ,GACvBvK,KAAK4K,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASlM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKoD,IAAQ,GACvB1K,KAAK4K,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAK5C,KAAK4K,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKa,IACRxJ,KAAK4K,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK1E,KAAK4K,KAAKhC,EAAKY,GACpB5G,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKmB,IAAQ,GACvB3J,KAAK4K,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKkB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKyB,IAAQ,GACvB9J,KAAK4K,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKwB,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAK+B,IAAQ,GACvBjK,KAAK4K,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKqC,IAAQ,GACvBpK,KAAK4K,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKoC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK2C,IAAQ,GACvBvK,KAAK4K,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAASnM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKiD,IAAQ,GACvB1K,KAAK4K,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAK5C,KAAK4K,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKgB,KACR3J,KAAK4K,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK1E,KAAK4K,KAAKhC,EAAKe,IACpB/G,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKsB,IAAQ,GACvB9J,KAAK4K,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKqB,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAK4B,IAAQ,GACvBjK,KAAK4K,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAK2B,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKkC,IAAQ,GACvBpK,KAAK4K,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKiC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKwC,IAAQ,GACvBvK,KAAK4K,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASpM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK8C,IAAQ,GACvB1K,KAAK4K,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAK5C,KAAK4K,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKmB,KACR9J,KAAK4K,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK1E,KAAK4K,KAAKhC,EAAKkB,IACpBlH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKyB,IAAQ,GACvBjK,KAAK4K,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKwB,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAK+B,IAAQ,GACvBpK,KAAK4K,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAK8B,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKqC,IAAQ,GACvBvK,KAAK4K,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASrM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK2C,IAAQ,GACvB1K,KAAK4K,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAK5C,KAAK4K,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKsB,KACRjK,KAAK4K,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK1E,KAAK4K,KAAKhC,EAAKqB,IACpBrH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAK4B,IAAQ,GACvBpK,KAAK4K,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAK2B,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKkC,IAAQ,GACvBvK,KAAK4K,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAStM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKwC,IAAQ,GACvB1K,KAAK4K,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAK5C,KAAK4K,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKyB,KACRpK,KAAK4K,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK1E,KAAK4K,KAAKhC,EAAKwB,IACpBxH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAK+B,IAAQ,GACvBvK,KAAK4K,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASvM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKqC,IAAQ,GACvB1K,KAAK4K,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPhJ,EAAK5C,KAAK4K,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAK4B,KACRvK,KAAK4K,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK1E,KAAK4K,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASxM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKkC,IAAQ,GACvB1K,KAAK4K,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASzM,GAJbuD,EAAK5C,KAAK4K,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAK+B,KACR1K,KAAK4K,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBApL,IAFAqF,EAAK1E,KAAK4K,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANzM,IACFyH,EAAE,IAAMzH,EACRoD,EAAIrF,UAECqF,CACT,EAOA,SAAS6J,EAAU9J,EAAMrC,EAAKsC,GAC5BA,EAAI9D,SAAWwB,EAAIxB,SAAW6D,EAAK7D,SACnC8D,EAAIrF,OAASoF,EAAKpF,OAAS+C,EAAI/C,OAI/B,IAFA,IAAIyF,EAAQ,EACRwJ,EAAU,EACLvJ,EAAI,EAAGA,EAAIL,EAAIrF,OAAS,EAAG0F,IAAK,CAGvC,IAAIC,EAASsJ,EACbA,EAAU,EAGV,IAFA,IAAIrJ,EAAgB,SAARH,EACRI,EAAOjD,KAAKC,IAAI6C,EAAG3C,EAAI/C,OAAS,GAC3B8D,EAAIlB,KAAKM,IAAI,EAAGwC,EAAIN,EAAKpF,OAAS,GAAI8D,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIhB,EAAI4C,EAAI5B,EAGRzB,GAFoB,EAAhB+C,EAAK5D,MAAMsB,KACI,EAAfC,EAAIvB,MAAMsC,IAGd0B,EAAS,SAAJnD,EAGTuD,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBqJ,IAFAtJ,GAHAA,EAAUA,GAAWtD,EAAI,SAAa,GAAM,IAGxBmD,IAAO,IAAO,KAEZ,GACtBG,GAAU,QACZ,CACAN,EAAI7D,MAAMkE,GAAKE,EACfH,EAAQE,EACRA,EAASsJ,CACX,CAOA,OANc,IAAVxJ,EACFJ,EAAI7D,MAAMkE,GAAKD,EAEfJ,EAAIrF,SAGCqF,EAAIqU,QACb,CAEA,SAAS/K,EAAYvJ,EAAMrC,EAAKsC,GAI9B,OAAO6J,EAAS9J,EAAMrC,EAAKsC,EAC7B,CAqBA,SAASuJ,EAAME,EAAGC,GAChBzN,KAAKwN,EAAIA,EACTxN,KAAKyN,EAAIA,CACX,CA1EKnM,KAAK4K,OACRhE,EAAcrE,GAmDhBlE,EAAGjC,UAAUgQ,MAAQ,SAAgBjM,EAAKsC,GACxC,IACI1C,EAAMrB,KAAKtB,OAAS+C,EAAI/C,OAW5B,OAVoB,KAAhBsB,KAAKtB,QAAgC,KAAf+C,EAAI/C,OACtBwJ,EAAYlI,KAAMyB,EAAKsC,GACpB1C,EAAM,GACTwC,EAAW7D,KAAMyB,EAAKsC,GACnB1C,EAAM,KACTuM,EAAS5N,KAAMyB,EAAKsC,GAEpBsJ,EAAWrN,KAAMyB,EAAKsC,EAIhC,EAUAuJ,EAAK5P,UAAUmQ,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAInE,MAAMoM,GACdC,EAAIpO,EAAGjC,UAAUkI,WAAWkI,GAAK,EAC5BtM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrBqE,EAAErE,GAAKxB,KAAKgO,OAAOxM,EAAGuM,EAAGD,GAG3B,OAAOjI,CACT,EAGAyH,EAAK5P,UAAUsQ,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAzM,EAAI,EAAGA,EAAIuM,EAAGvM,IACrByM,IAAW,EAAJT,IAAWO,EAAIvM,EAAI,EAC1BgM,IAAM,EAGR,OAAOS,CACT,EAIAX,EAAK5P,UAAUwQ,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAItM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrB8M,EAAK9M,GAAK4M,EAAID,EAAI3M,IAClB+M,EAAK/M,GAAK6M,EAAIF,EAAI3M,GAEtB,EAEA8L,EAAK5P,UAAU8Q,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEnO,KAAKkO,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQpN,KAAKqN,IAAI,EAAIrN,KAAKsN,GAAKb,GAC/Bc,EAAQvN,KAAKwN,IAAI,EAAIxN,KAAKsN,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJrM,EAAI,EAAGA,EAAIiM,EAAGjM,IAAK,CAC1B,IAAI0M,EAAKZ,EAAKS,EAAIvM,GACd2M,EAAKZ,EAAKQ,EAAIvM,GAEd4M,EAAKd,EAAKS,EAAIvM,EAAIiM,GAClBY,EAAKd,EAAKQ,EAAIvM,EAAIiM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAIvM,GAAK0M,EAAKE,EACnBb,EAAKQ,EAAIvM,GAAK2M,EAAKE,EAEnBf,EAAKS,EAAIvM,EAAIiM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAIvM,EAAIiM,GAAKU,EAAKE,EAGnB7M,IAAMuL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,EAEb,CAGN,EAEAhC,EAAK5P,UAAU6R,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjBxM,KAAKM,IAAI6N,EAAGD,GAChBE,EAAU,EAAJ5B,EACNtM,EAAI,EACR,IAAKsM,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BtM,IAGF,OAAO,GAAKA,EAAI,EAAIkO,CACtB,EAEApC,EAAK5P,UAAUiS,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAItM,EAAI,EAAGA,EAAIsM,EAAI,EAAGtM,IAAK,CAC9B,IAAIqE,EAAIuI,EAAI5M,GAEZ4M,EAAI5M,GAAK4M,EAAIN,EAAItM,EAAI,GACrB4M,EAAIN,EAAItM,EAAI,GAAKqE,EAEjBA,EAAIwI,EAAI7M,GAER6M,EAAI7M,IAAM6M,EAAIP,EAAItM,EAAI,GACtB6M,EAAIP,EAAItM,EAAI,IAAMqE,CACpB,CACF,EAEAyH,EAAK5P,UAAUkS,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI3J,EAAQ,EACH3C,EAAI,EAAGA,EAAIsM,EAAI,EAAGtM,IAAK,CAC9B,IAAIiB,EAAoC,KAAhCnB,KAAKwO,MAAMD,EAAG,EAAIrO,EAAI,GAAKsM,GACjCxM,KAAKwO,MAAMD,EAAG,EAAIrO,GAAKsM,GACvB3J,EAEF0L,EAAGrO,GAAS,SAAJiB,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,CAE5B,CAEA,OAAOoN,CACT,EAEAvC,EAAK5P,UAAUqS,WAAa,SAAqBF,EAAIxO,EAAK+M,EAAKN,GAE7D,IADA,IAAI3J,EAAQ,EACH3C,EAAI,EAAGA,EAAIH,EAAKG,IACvB2C,GAAyB,EAAR0L,EAAGrO,GAEpB4M,EAAI,EAAI5M,GAAa,KAAR2C,EAAgBA,KAAkB,GAC/CiK,EAAI,EAAI5M,EAAI,GAAa,KAAR2C,EAAgBA,KAAkB,GAIrD,IAAK3C,EAAI,EAAIH,EAAKG,EAAIsM,IAAKtM,EACzB4M,EAAI5M,GAAK,EAGXlC,EAAiB,IAAV6E,GACP7E,EAA6B,KAAb,KAAR6E,GACV,EAEAmJ,EAAK5P,UAAUsS,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAIvO,MAAMoM,GACVtM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrByO,EAAGzO,GAAK,EAGV,OAAOyO,CACT,EAEA3C,EAAK5P,UAAU6P,KAAO,SAAeC,EAAGC,EAAG1J,GACzC,IAAI+J,EAAI,EAAI9N,KAAKuP,YAAY/B,EAAE9O,OAAQ+O,EAAE/O,QAErCyP,EAAMnO,KAAK6N,QAAQC,GAEnBoC,EAAIlQ,KAAKgQ,KAAKlC,GAEdM,EAAM,IAAI1M,MAAMoM,GAChBqC,EAAO,IAAIzO,MAAMoM,GACjBsC,EAAO,IAAI1O,MAAMoM,GAEjBuC,EAAO,IAAI3O,MAAMoM,GACjBwC,EAAQ,IAAI5O,MAAMoM,GAClByC,EAAQ,IAAI7O,MAAMoM,GAElB0C,EAAOzM,EAAI7D,MACfsQ,EAAK9R,OAASoP,EAEd9N,KAAK+P,WAAWvC,EAAEtN,MAAOsN,EAAE9O,OAAQ0P,EAAKN,GACxC9N,KAAK+P,WAAWtC,EAAEvN,MAAOuN,EAAE/O,OAAQ2R,EAAMvC,GAEzC9N,KAAKwO,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtCnO,KAAKwO,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAI3M,EAAI,EAAGA,EAAIsM,EAAGtM,IAAK,CAC1B,IAAI8N,EAAKa,EAAK3O,GAAK8O,EAAM9O,GAAK4O,EAAK5O,GAAK+O,EAAM/O,GAC9C4O,EAAK5O,GAAK2O,EAAK3O,GAAK+O,EAAM/O,GAAK4O,EAAK5O,GAAK8O,EAAM9O,GAC/C2O,EAAK3O,GAAK8N,CACZ,CASA,OAPAtP,KAAK2P,UAAUQ,EAAMC,EAAMtC,GAC3B9N,KAAKwO,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvCnO,KAAK2P,UAAUa,EAAMN,EAAGpC,GACxB9N,KAAK4P,aAAaY,EAAM1C,GAExB/J,EAAI9D,SAAWuN,EAAEvN,SAAWwN,EAAExN,SAC9B8D,EAAIrF,OAAS8O,EAAE9O,OAAS+O,EAAE/O,OACnBqF,EAAIqU,QACb,EAGAzY,EAAGjC,UAAU0D,IAAM,SAAcK,GAC/B,IAAIsC,EAAM,IAAIpE,EAAG,MAEjB,OADAoE,EAAI7D,MAAQ,IAAIwB,MAAM1B,KAAKtB,OAAS+C,EAAI/C,QACjCsB,KAAK0N,MAAMjM,EAAKsC,EACzB,EAGApE,EAAGjC,UAAU+S,KAAO,SAAehP,GACjC,IAAIsC,EAAM,IAAIpE,EAAG,MAEjB,OADAoE,EAAI7D,MAAQ,IAAIwB,MAAM1B,KAAKtB,OAAS+C,EAAI/C,QACjC2O,EAAWrN,KAAMyB,EAAKsC,EAC/B,EAGApE,EAAGjC,UAAUwO,KAAO,SAAezK,GACjC,OAAOzB,KAAKsD,QAAQoK,MAAMjM,EAAKzB,KACjC,EAEAL,EAAGjC,UAAUuF,MAAQ,SAAgBxB,GACnC,IAAIy2D,EAAWz2D,EAAM,EACjBy2D,IAAUz2D,GAAOA,GAErBnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UAIb,IADA,IAAI0C,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIiB,GAAqB,EAAhBzC,KAAKE,MAAMsB,IAAUC,EAC1ByC,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChBlE,KAAKE,MAAMsB,GAAU,SAAL0C,CAClB,CAOA,OALc,IAAVC,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,UAGAw5D,EAAWl4D,KAAK0G,OAAS1G,IAClC,EAEAL,EAAGjC,UAAUgT,KAAO,SAAejP,GACjC,OAAOzB,KAAKsD,QAAQL,MAAMxB,EAC5B,EAGA9B,EAAGjC,UAAUiT,IAAM,WACjB,OAAO3Q,KAAKoB,IAAIpB,KAClB,EAGAL,EAAGjC,UAAUkT,KAAO,WAClB,OAAO5Q,KAAKkM,KAAKlM,KAAKsD,QACxB,EAGA3D,EAAGjC,UAAUyF,IAAM,SAAc1B,GAC/B,IAAIgB,EA7xCN,SAAqBhB,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAIsE,aAEb6B,EAAM,EAAGA,EAAMnF,EAAE/D,OAAQkJ,IAAO,CACvC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnF,EAAEmF,GAAQnG,EAAIvB,MAAMwC,KAASmF,EAAQ,CACvC,CAEA,OAAOpF,CACT,CAkxCUoO,CAAWpP,GACnB,GAAiB,IAAbgB,EAAE/D,OAAc,OAAO,IAAIiB,EAAG,GAIlC,IADA,IAAI4F,EAAMvF,KACDwB,EAAI,EAAGA,EAAIiB,EAAE/D,QACP,IAAT+D,EAAEjB,GADsBA,IAAK+D,EAAMA,EAAIoL,OAI7C,KAAMnP,EAAIiB,EAAE/D,OACV,IAAK,IAAI8G,EAAID,EAAIoL,MAAOnP,EAAIiB,EAAE/D,OAAQ8C,IAAKgE,EAAIA,EAAEmL,MAClC,IAATlO,EAAEjB,KAEN+D,EAAMA,EAAInE,IAAIoE,IAIlB,OAAOD,CACT,EAGA5F,EAAGjC,UAAUoT,OAAS,SAAiBC,GACrCzR,EAAuB,iBAATyR,GAAqBA,GAAQ,GAC3C,IAGIvP,EAHAT,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GACjBiQ,EAAa,WAAe,GAAKjQ,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoD,EAAQ,EAEZ,IAAK3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAChC,IAAIyP,EAAWjR,KAAKE,MAAMsB,GAAKwP,EAC3BrQ,GAAsB,EAAhBX,KAAKE,MAAMsB,IAAUyP,GAAalQ,EAC5Cf,KAAKE,MAAMsB,GAAKb,EAAIwD,EACpBA,EAAQ8M,IAAc,GAAKlQ,CAC7B,CAEIoD,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,SAET,CAEA,GAAU,IAAN+P,EAAS,CACX,IAAKjN,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAChCxB,KAAKE,MAAMsB,EAAIiN,GAAKzO,KAAKE,MAAMsB,GAGjC,IAAKA,EAAI,EAAGA,EAAIiN,EAAGjN,IACjBxB,KAAKE,MAAMsB,GAAK,EAGlBxB,KAAKtB,QAAU+P,CACjB,CAEA,OAAOzO,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUwT,MAAQ,SAAgBH,GAGnC,OADAzR,EAAyB,IAAlBU,KAAKC,UACLD,KAAK8Q,OAAOC,EACrB,EAKApR,EAAGjC,UAAUgI,OAAS,SAAiBqL,EAAMI,EAAMC,GAEjD,IAAIC,EADJ/R,EAAuB,iBAATyR,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIpQ,EAAIgQ,EAAO,GACXtC,EAAInN,KAAKC,KAAKwP,EAAOhQ,GAAK,GAAIf,KAAKtB,QACnC4S,EAAO,SAAc,WAAcvQ,GAAMA,EACzCwQ,EAAcH,EAMlB,GAJAC,GAAK5C,EACL4C,EAAI/P,KAAKM,IAAI,EAAGyP,GAGZE,EAAa,CACf,IAAK,IAAI/P,EAAI,EAAGA,EAAIiN,EAAGjN,IACrB+P,EAAYrR,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAEpC+P,EAAY7S,OAAS+P,CACvB,CAEA,GAAU,IAANA,QAEG,GAAIzO,KAAKtB,OAAS+P,EAEvB,IADAzO,KAAKtB,QAAU+P,EACVjN,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC3BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,EAAIiN,QAGjCzO,KAAKE,MAAM,GAAK,EAChBF,KAAKtB,OAAS,EAGhB,IAAIyF,EAAQ,EACZ,IAAK3C,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,IAAgB,IAAV2C,GAAe3C,GAAK6P,GAAI7P,IAAK,CAChE,IAAIwB,EAAuB,EAAhBhD,KAAKE,MAAMsB,GACtBxB,KAAKE,MAAMsB,GAAM2C,GAAU,GAAKpD,EAAOiC,IAASjC,EAChDoD,EAAQnB,EAAOsO,CACjB,CAYA,OATIC,GAAyB,IAAVpN,IACjBoN,EAAYrR,MAAMqR,EAAY7S,UAAYyF,GAGxB,IAAhBnE,KAAKtB,SACPsB,KAAKE,MAAM,GAAK,EAChBF,KAAKtB,OAAS,GAGTsB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU8T,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA9R,EAAyB,IAAlBU,KAAKC,UACLD,KAAK0F,OAAOqL,EAAMI,EAAMC,EACjC,EAGAzR,EAAGjC,UAAU+T,KAAO,SAAeV,GACjC,OAAO/Q,KAAKsD,QAAQ4N,MAAMH,EAC5B,EAEApR,EAAGjC,UAAUgU,MAAQ,SAAgBX,GACnC,OAAO/Q,KAAKsD,QAAQwN,OAAOC,EAC7B,EAGApR,EAAGjC,UAAUiU,KAAO,SAAeZ,GACjC,OAAO/Q,KAAKsD,QAAQkO,MAAMT,EAC5B,EAEApR,EAAGjC,UAAUkU,MAAQ,SAAgBb,GACnC,OAAO/Q,KAAKsD,QAAQoC,OAAOqL,EAC7B,EAGApR,EAAGjC,UAAU8I,MAAQ,SAAgBoB,GACnCtI,EAAsB,iBAARsI,GAAoBA,GAAO,GACzC,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,QAAIf,KAAKtB,QAAU+P,KAGXzO,KAAKE,MAAMuO,GAELjJ,GAChB,EAGA7F,EAAGjC,UAAUmU,OAAS,SAAiBd,GACrCzR,EAAuB,iBAATyR,GAAqBA,GAAQ,GAC3C,IAAIhQ,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GAIrB,GAFAzB,EAAyB,IAAlBU,KAAKC,SAAgB,2CAExBD,KAAKtB,QAAU+P,EACjB,OAAOzO,KAQT,GALU,IAANe,GACF0N,IAEFzO,KAAKtB,OAAS4C,KAAKC,IAAIkN,EAAGzO,KAAKtB,QAErB,IAANqC,EAAS,CACX,IAAIuQ,EAAO,SAAc,WAAcvQ,GAAMA,EAC7Cf,KAAKE,MAAMF,KAAKtB,OAAS,IAAM4S,CACjC,CAEA,OAAOtR,KAAKoY,QACd,EAGAzY,EAAGjC,UAAUoU,MAAQ,SAAgBf,GACnC,OAAO/Q,KAAKsD,QAAQuO,OAAOd,EAC7B,EAGApR,EAAGjC,UAAU4I,MAAQ,SAAgB7E,GAGnC,OAFAnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UACTA,EAAM,EAAUzB,KAAK+R,OAAOtQ,GAGV,IAAlBzB,KAAKC,SACa,IAAhBD,KAAKtB,SAAiC,EAAhBsB,KAAKE,MAAM,KAAWuB,GAC9CzB,KAAKE,MAAM,GAAKuB,GAAuB,EAAhBzB,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK+R,MAAMtQ,GACXzB,KAAKC,SAAW,EACTD,MAIFA,KAAKkD,OAAOzB,EACrB,EAEA9B,EAAGjC,UAAUwF,OAAS,SAAiBzB,GACrCzB,KAAKE,MAAM,IAAMuB,EAGjB,IAAK,IAAID,EAAI,EAAGA,EAAIxB,KAAKtB,QAAUsB,KAAKE,MAAMsB,IAAM,SAAWA,IAC7DxB,KAAKE,MAAMsB,IAAM,SACbA,IAAMxB,KAAKtB,OAAS,EACtBsB,KAAKE,MAAMsB,EAAI,GAAK,EAEpBxB,KAAKE,MAAMsB,EAAI,KAKnB,OAFAxB,KAAKtB,OAAS4C,KAAKM,IAAI5B,KAAKtB,OAAQ8C,EAAI,GAEjCxB,IACT,EAGAL,EAAGjC,UAAUqU,MAAQ,SAAgBtQ,GAGnC,GAFAnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UACTA,EAAM,EAAG,OAAOzB,KAAKsG,OAAO7E,GAEhC,GAAsB,IAAlBzB,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKsG,MAAM7E,GACXzB,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAMuB,EAEG,IAAhBzB,KAAKtB,QAAgBsB,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAIuB,EAAI,EAAGA,EAAIxB,KAAKtB,QAAUsB,KAAKE,MAAMsB,GAAK,EAAGA,IACpDxB,KAAKE,MAAMsB,IAAM,SACjBxB,KAAKE,MAAMsB,EAAI,IAAM,EAIzB,OAAOxB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUsU,KAAO,SAAevQ,GACjC,OAAOzB,KAAKsD,QAAQgD,MAAM7E,EAC5B,EAEA9B,EAAGjC,UAAUuU,KAAO,SAAexQ,GACjC,OAAOzB,KAAKsD,QAAQyO,MAAMtQ,EAC5B,EAEA9B,EAAGjC,UAAUwU,KAAO,WAGlB,OAFAlS,KAAKC,SAAW,EAETD,IACT,EAEAL,EAAGjC,UAAU0I,IAAM,WACjB,OAAOpG,KAAKsD,QAAQ4O,MACtB,EAEAvS,EAAGjC,UAAUyU,aAAe,SAAuB1Q,EAAKL,EAAKgR,GAC3D,IACI5Q,EAIAiB,EALApB,EAAMI,EAAI/C,OAAS0T,EAGvBpS,KAAKuD,QAAQlC,GAGb,IAAI8C,EAAQ,EACZ,IAAK3C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CAC/BiB,GAA6B,EAAxBzC,KAAKE,MAAMsB,EAAI4Q,IAAcjO,EAClC,IAAIrC,GAAwB,EAAfL,EAAIvB,MAAMsB,IAAUJ,EAEjC+C,IADA1B,GAAa,SAARX,IACS,KAAQA,EAAQ,SAAa,GAC3C9B,KAAKE,MAAMsB,EAAI4Q,GAAa,SAAJ3P,CAC1B,CACA,KAAOjB,EAAIxB,KAAKtB,OAAS0T,EAAO5Q,IAE9B2C,GADA1B,GAA6B,EAAxBzC,KAAKE,MAAMsB,EAAI4Q,IAAcjO,IACrB,GACbnE,KAAKE,MAAMsB,EAAI4Q,GAAa,SAAJ3P,EAG1B,GAAc,IAAV0B,EAAa,OAAOnE,KAAKoY,SAK7B,IAFA9Y,GAAkB,IAAX6E,GACPA,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAE3B2C,GADA1B,IAAsB,EAAhBzC,KAAKE,MAAMsB,IAAU2C,IACd,GACbnE,KAAKE,MAAMsB,GAAS,SAAJiB,EAIlB,OAFAzC,KAAKC,SAAW,EAETD,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU2U,SAAW,SAAmB5Q,EAAK6Q,GAC9C,IAAIF,GAAQpS,KAAKtB,OAAS+C,EAAI/C,QAE1BsF,EAAIhE,KAAKsD,QACTW,EAAIxC,EAGJ8Q,EAA8B,EAAxBtO,EAAE/D,MAAM+D,EAAEvF,OAAS,GAGf,IADd0T,EAAQ,GADMpS,KAAK4F,WAAW2M,MAG5BtO,EAAIA,EAAEyN,MAAMU,GACZpO,EAAE8M,OAAOsB,GACTG,EAA8B,EAAxBtO,EAAE/D,MAAM+D,EAAEvF,OAAS,IAI3B,IACI8G,EADAiK,EAAIzL,EAAEtF,OAASuF,EAAEvF,OAGrB,GAAa,QAAT4T,EAAgB,EAClB9M,EAAI,IAAI7F,EAAG,OACTjB,OAAS+Q,EAAI,EACfjK,EAAEtF,MAAQ,IAAIwB,MAAM8D,EAAE9G,QACtB,IAAK,IAAI8C,EAAI,EAAGA,EAAIgE,EAAE9G,OAAQ8C,IAC5BgE,EAAEtF,MAAMsB,GAAK,CAEjB,CAEA,IAAIgR,EAAOxO,EAAEV,QAAQ6O,aAAalO,EAAG,EAAGwL,GAClB,IAAlB+C,EAAKvS,WACP+D,EAAIwO,EACAhN,IACFA,EAAEtF,MAAMuP,GAAK,IAIjB,IAAK,IAAIjN,EAAIiN,EAAI,EAAGjN,GAAK,EAAGA,IAAK,CAC/B,IAAIiQ,EAAmC,UAAL,EAAxBzO,EAAE9D,MAAM+D,EAAEvF,OAAS8D,KACE,EAA5BwB,EAAE9D,MAAM+D,EAAEvF,OAAS8D,EAAI,IAO1B,IAHAiQ,EAAKnR,KAAKC,IAAKkR,EAAKF,EAAO,EAAG,UAE9BvO,EAAEmO,aAAalO,EAAGwO,EAAIjQ,GACA,IAAfwB,EAAE/D,UACPwS,IACAzO,EAAE/D,SAAW,EACb+D,EAAEmO,aAAalO,EAAG,EAAGzB,GAChBwB,EAAEW,WACLX,EAAE/D,UAAY,GAGduF,IACFA,EAAEtF,MAAMsC,GAAKiQ,EAEjB,CAWA,OAVIjN,GACFA,EAAE4S,SAEJpU,EAAEoU,SAGW,QAAT9F,GAA4B,IAAVF,GACpBpO,EAAE0B,OAAO0M,GAGJ,CACLM,IAAKlN,GAAK,KACVzC,IAAKiB,EAET,EAMArE,EAAGjC,UAAUiV,OAAS,SAAiBlR,EAAK6Q,EAAMM,GAGhD,OAFAtT,GAAQmC,EAAIkD,UAER3E,KAAK2E,SACA,CACL+N,IAAK,IAAI/S,EAAG,GACZoD,IAAK,IAAIpD,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjBwB,EAAIxB,UAC7BsF,EAAMvF,KAAK4G,MAAM+L,OAAOlR,EAAK6Q,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGH,QAAT0L,IACFvP,EAAMwC,EAAIxC,IAAI6D,MACVgM,GAA6B,IAAjB7P,EAAI9C,UAClB8C,EAAI+E,KAAKrG,IAIN,CACLiR,IAAKA,EACL3P,IAAKA,IAIa,IAAlB/C,KAAKC,UAAmC,IAAjBwB,EAAIxB,UAC7BsF,EAAMvF,KAAK2S,OAAOlR,EAAImF,MAAO0L,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGT,CACL8L,IAAKA,EACL3P,IAAKwC,EAAIxC,MAI0B,IAAlC/C,KAAKC,SAAWwB,EAAIxB,WACvBsF,EAAMvF,KAAK4G,MAAM+L,OAAOlR,EAAImF,MAAO0L,GAEtB,QAATA,IACFvP,EAAMwC,EAAIxC,IAAI6D,MACVgM,GAA6B,IAAjB7P,EAAI9C,UAClB8C,EAAIgF,KAAKtG,IAIN,CACLiR,IAAKnN,EAAImN,IACT3P,IAAKA,IAOLtB,EAAI/C,OAASsB,KAAKtB,QAAUsB,KAAK+B,IAAIN,GAAO,EACvC,CACLiR,IAAK,IAAI/S,EAAG,GACZoD,IAAK/C,MAKU,IAAfyB,EAAI/C,OACO,QAAT4T,EACK,CACLI,IAAK1S,KAAK6S,KAAKpR,EAAIvB,MAAM,IACzB6C,IAAK,MAII,QAATuP,EACK,CACLI,IAAK,KACL3P,IAAK,IAAIpD,EAAGK,KAAK83D,MAAMr2D,EAAIvB,MAAM,MAI9B,CACLwS,IAAK1S,KAAK6S,KAAKpR,EAAIvB,MAAM,IACzB6C,IAAK,IAAIpD,EAAGK,KAAK83D,MAAMr2D,EAAIvB,MAAM,MAI9BF,KAAKqS,SAAS5Q,EAAK6Q,GAlF1B,IAAII,EAAK3P,EAAKwC,CAmFhB,EAGA5F,EAAGjC,UAAUgV,IAAM,SAAcjR,GAC/B,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAOiR,GACxC,EAGA/S,EAAGjC,UAAUqF,IAAM,SAActB,GAC/B,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAOsB,GACxC,EAEApD,EAAGjC,UAAUoV,KAAO,SAAerR,GACjC,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAMsB,GACvC,EAGApD,EAAGjC,UAAUqV,SAAW,SAAmBtR,GACzC,IAAIuR,EAAKhT,KAAK2S,OAAOlR,GAGrB,GAAIuR,EAAGjQ,IAAI4B,SAAU,OAAOqO,EAAGN,IAE/B,IAAI3P,EAA0B,IAApBiQ,EAAGN,IAAIzS,SAAiB+S,EAAGjQ,IAAIgF,KAAKtG,GAAOuR,EAAGjQ,IAEpDkQ,EAAOxR,EAAImQ,MAAM,GACjBsB,EAAKzR,EAAIgE,MAAM,GACf1D,EAAMgB,EAAIhB,IAAIkR,GAGlB,OAAIlR,EAAM,GAAa,IAAPmR,GAAoB,IAARnR,EAAmBiR,EAAGN,IAGvB,IAApBM,EAAGN,IAAIzS,SAAiB+S,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIpM,MAAM,EAChE,EAEA3G,EAAGjC,UAAUo6D,MAAQ,SAAgBr2D,GACnC,IAAIy2D,EAAWz2D,EAAM,EACjBy2D,IAAUz2D,GAAOA,GAErBnC,EAAOmC,GAAO,UAId,IAHA,IAAIsN,GAAK,GAAK,IAAMtN,EAEhB0R,EAAM,EACD3R,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IACpC2R,GAAOpE,EAAIoE,GAAuB,EAAhBnT,KAAKE,MAAMsB,KAAWC,EAG1C,OAAOy2D,GAAY/kD,EAAMA,CAC3B,EAGAxT,EAAGjC,UAAUkH,KAAO,SAAenD,GACjC,OAAOzB,KAAK83D,MAAMr2D,EACpB,EAGA9B,EAAGjC,UAAUmH,MAAQ,SAAgBpD,GACnC,IAAIy2D,EAAWz2D,EAAM,EACjBy2D,IAAUz2D,GAAOA,GAErBnC,EAAOmC,GAAO,UAGd,IADA,IAAI0C,EAAQ,EACH3C,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACzC,IAAIiB,GAAqB,EAAhBzC,KAAKE,MAAMsB,IAAkB,SAAR2C,EAC9BnE,KAAKE,MAAMsB,GAAMiB,EAAIhB,EAAO,EAC5B0C,EAAQ1B,EAAIhB,CACd,CAGA,OADAzB,KAAKoY,SACE8/C,EAAWl4D,KAAK0G,OAAS1G,IAClC,EAEAL,EAAGjC,UAAUmV,KAAO,SAAepR,GACjC,OAAOzB,KAAKsD,QAAQuB,MAAMpD,EAC5B,EAEA9B,EAAGjC,UAAU0V,KAAO,SAAerE,GACjCzP,EAAsB,IAAfyP,EAAE9O,UACTX,GAAQyP,EAAEpK,UAEV,IAAI6I,EAAIxN,KACJyN,EAAIsB,EAAEzL,QAGRkK,EADiB,IAAfA,EAAEvN,SACAuN,EAAEsF,KAAK/D,GAEPvB,EAAElK,QAaR,IATA,IAAI+P,EAAI,IAAI1T,EAAG,GACX2T,EAAI,IAAI3T,EAAG,GAGX4T,EAAI,IAAI5T,EAAG,GACX6T,EAAI,IAAI7T,EAAG,GAEX8T,EAAI,EAEDjG,EAAEkG,UAAYjG,EAAEiG,UACrBlG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP+N,EAMJ,IAHA,IAAIE,EAAKlG,EAAEnK,QACPsQ,EAAKpG,EAAElK,SAEHkK,EAAE7I,UAAU,CAClB,IAAK,IAAInD,EAAI,EAAGqS,EAAK,EAAyB,IAArBrG,EAAEtN,MAAM,GAAK2T,IAAarS,EAAI,KAAMA,EAAGqS,IAAO,GACvE,GAAIrS,EAAI,EAEN,IADAgM,EAAE9H,OAAOlE,GACFA,KAAM,IACP6R,EAAES,SAAWR,EAAEQ,WACjBT,EAAEvL,KAAK6L,GACPL,EAAEvL,KAAK6L,IAGTP,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIb,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArBtG,EAAEvN,MAAM,GAAK6T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAiL,EAAE/H,OAAOlD,GACFA,KAAM,IACP+Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAEzL,KAAK6L,GACPH,EAAEzL,KAAK6L,IAGTL,EAAE7N,OAAO,GACT8N,EAAE9N,OAAO,GAIT8H,EAAEzL,IAAI0L,IAAM,GACdD,EAAEzF,KAAK0F,GACP4F,EAAEtL,KAAKwL,GACPD,EAAEvL,KAAKyL,KAEP/F,EAAE1F,KAAKyF,GACP+F,EAAExL,KAAKsL,GACPG,EAAEzL,KAAKuL,GAEX,CAEA,MAAO,CACLtP,EAAGuP,EACHtP,EAAGuP,EACHQ,IAAKvG,EAAEqD,OAAO2C,GAElB,EAKA9T,EAAGjC,UAAUuW,OAAS,SAAiBlF,GACrCzP,EAAsB,IAAfyP,EAAE9O,UACTX,GAAQyP,EAAEpK,UAEV,IAAIX,EAAIhE,KACJiE,EAAI8K,EAAEzL,QAGRU,EADiB,IAAfA,EAAE/D,SACA+D,EAAE8O,KAAK/D,GAEP/K,EAAEV,QAQR,IALA,IAuCIiC,EAvCA2O,EAAK,IAAIvU,EAAG,GACZwU,EAAK,IAAIxU,EAAG,GAEZyU,EAAQnQ,EAAEX,QAEPU,EAAEqQ,KAAK,GAAK,GAAKpQ,EAAEoQ,KAAK,GAAK,GAAG,CACrC,IAAK,IAAI7S,EAAI,EAAGqS,EAAK,EAAyB,IAArB7P,EAAE9D,MAAM,GAAK2T,IAAarS,EAAI,KAAMA,EAAGqS,IAAO,GACvE,GAAIrS,EAAI,EAEN,IADAwC,EAAE0B,OAAOlE,GACFA,KAAM,GACP0S,EAAGJ,SACLI,EAAGpM,KAAKsM,GAGVF,EAAGxO,OAAO,GAId,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArB9P,EAAE/D,MAAM,GAAK6T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAyB,EAAEyB,OAAOlD,GACFA,KAAM,GACP2R,EAAGL,SACLK,EAAGrM,KAAKsM,GAGVD,EAAGzO,OAAO,GAIV1B,EAAEjC,IAAIkC,IAAM,GACdD,EAAE+D,KAAK9D,GACPiQ,EAAGnM,KAAKoM,KAERlQ,EAAE8D,KAAK/D,GACPmQ,EAAGpM,KAAKmM,GAEZ,CAaA,OATE3O,EADgB,IAAdvB,EAAEqQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB9O,EAAIuC,KAAKiH,GAGJxJ,CACT,EAEA5F,EAAGjC,UAAUsW,IAAM,SAAcvS,GAC/B,GAAIzB,KAAK2E,SAAU,OAAOlD,EAAI2E,MAC9B,GAAI3E,EAAIkD,SAAU,OAAO3E,KAAKoG,MAE9B,IAAIpC,EAAIhE,KAAKsD,QACTW,EAAIxC,EAAI6B,QACZU,EAAE/D,SAAW,EACbgE,EAAEhE,SAAW,EAGb,IAAK,IAAImS,EAAQ,EAAGpO,EAAE0P,UAAYzP,EAAEyP,SAAUtB,IAC5CpO,EAAE0B,OAAO,GACTzB,EAAEyB,OAAO,GAGX,OAAG,CACD,KAAO1B,EAAE0P,UACP1P,EAAE0B,OAAO,GAEX,KAAOzB,EAAEyP,UACPzP,EAAEyB,OAAO,GAGX,IAAI3E,EAAIiD,EAAEjC,IAAIkC,GACd,GAAIlD,EAAI,EAAG,CAET,IAAI8E,EAAI7B,EACRA,EAAIC,EACJA,EAAI4B,CACN,MAAO,GAAU,IAAN9E,GAAyB,IAAdkD,EAAEoQ,KAAK,GAC3B,MAGFrQ,EAAE+D,KAAK9D,EACT,CAEA,OAAOA,EAAE6M,OAAOsB,EAClB,EAGAzS,EAAGjC,UAAU4W,KAAO,SAAe7S,GACjC,OAAOzB,KAAKoT,KAAK3R,GAAKuC,EAAE8O,KAAKrR,EAC/B,EAEA9B,EAAGjC,UAAUgW,OAAS,WACpB,OAA+B,IAAP,EAAhB1T,KAAKE,MAAM,GACrB,EAEAP,EAAGjC,UAAUoW,MAAQ,WACnB,OAA+B,IAAP,EAAhB9T,KAAKE,MAAM,GACrB,EAGAP,EAAGjC,UAAU+H,MAAQ,SAAgBhE,GACnC,OAAOzB,KAAKE,MAAM,GAAKuB,CACzB,EAGA9B,EAAGjC,UAAU6W,MAAQ,SAAgB3M,GACnCtI,EAAsB,iBAARsI,GACd,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,GAAIf,KAAKtB,QAAU+P,EAGjB,OAFAzO,KAAKuD,QAAQkL,EAAI,GACjBzO,KAAKE,MAAMuO,IAAMjJ,EACVxF,KAKT,IADA,IAAImE,EAAQqB,EACHhE,EAAIiN,EAAa,IAAVtK,GAAe3C,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACnD,IAAIiB,EAAoB,EAAhBzC,KAAKE,MAAMsB,GAEnB2C,GADA1B,GAAK0B,KACS,GACd1B,GAAK,SACLzC,KAAKE,MAAMsB,GAAKiB,CAClB,CAKA,OAJc,IAAV0B,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,UAEAsB,IACT,EAEAL,EAAGjC,UAAUiH,OAAS,WACpB,OAAuB,IAAhB3E,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,EACzC,EAEAP,EAAGjC,UAAU2W,KAAO,SAAe5S,GACjC,IAOI8D,EAPAtF,EAAWwB,EAAM,EAErB,GAAsB,IAAlBzB,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAKoY,SAGDpY,KAAKtB,OAAS,EAChB6G,EAAM,MACD,CACDtF,IACFwB,GAAOA,GAGTnC,EAAOmC,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhBzC,KAAKE,MAAM,GACnBqF,EAAM9C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,CACvC,CACA,OAAsB,IAAlBzB,KAAKC,SAA8B,GAANsF,EAC1BA,CACT,EAMA5F,EAAGjC,UAAUqE,IAAM,SAAcN,GAC/B,GAAsB,IAAlBzB,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAAgB,OAAO,EAEtD,IAAIsF,EAAMvF,KAAKwU,KAAK/S,GACpB,OAAsB,IAAlBzB,KAAKC,SAA8B,GAANsF,EAC1BA,CACT,EAGA5F,EAAGjC,UAAU8W,KAAO,SAAe/S,GAEjC,GAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAQ,OAAO,EACrC,GAAIsB,KAAKtB,OAAS+C,EAAI/C,OAAQ,OAAQ,EAGtC,IADA,IAAI6G,EAAM,EACD/D,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACzC,IAAIwC,EAAoB,EAAhBhE,KAAKE,MAAMsB,GACfyC,EAAmB,EAAfxC,EAAIvB,MAAMsB,GAElB,GAAIwC,IAAMC,EAAV,CACID,EAAIC,EACNsB,GAAO,EACEvB,EAAIC,IACbsB,EAAM,GAER,KANqB,CAOvB,CACA,OAAOA,CACT,EAEA5F,EAAGjC,UAAU+W,IAAM,SAAchT,GAC/B,OAA0B,IAAnBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUgX,GAAK,SAAajT,GAC7B,OAAyB,IAAlBzB,KAAK+B,IAAIN,EAClB,EAEA9B,EAAGjC,UAAUiX,KAAO,SAAelT,GACjC,OAAOzB,KAAKqU,KAAK5S,IAAQ,CAC3B,EAEA9B,EAAGjC,UAAUkX,IAAM,SAAcnT,GAC/B,OAAOzB,KAAK+B,IAAIN,IAAQ,CAC1B,EAEA9B,EAAGjC,UAAUmX,IAAM,SAAcpT,GAC/B,OAA2B,IAApBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUoX,GAAK,SAAarT,GAC7B,OAA0B,IAAnBzB,KAAK+B,IAAIN,EAClB,EAEA9B,EAAGjC,UAAUqX,KAAO,SAAetT,GACjC,OAAOzB,KAAKqU,KAAK5S,IAAQ,CAC3B,EAEA9B,EAAGjC,UAAUsX,IAAM,SAAcvT,GAC/B,OAAOzB,KAAK+B,IAAIN,IAAQ,CAC1B,EAEA9B,EAAGjC,UAAUuX,IAAM,SAAcxT,GAC/B,OAA0B,IAAnBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUwX,GAAK,SAAazT,GAC7B,OAAyB,IAAlBzB,KAAK+B,IAAIN,EAClB,EAMA9B,EAAGQ,IAAM,SAAcsB,GACrB,OAAO,IAAI0T,EAAI1T,EACjB,EAEA9B,EAAGjC,UAAU0X,MAAQ,SAAgBC,GAGnC,OAFA/V,GAAQU,KAAKG,IAAK,yCAClBb,EAAyB,IAAlBU,KAAKC,SAAgB,iCACrBoV,EAAIC,UAAUtV,MAAMuV,UAAUF,EACvC,EAEA1V,EAAGjC,UAAU8X,QAAU,WAErB,OADAlW,EAAOU,KAAKG,IAAK,wDACVH,KAAKG,IAAIsV,YAAYzV,KAC9B,EAEAL,EAAGjC,UAAU6X,UAAY,SAAoBF,GAE3C,OADArV,KAAKG,IAAMkV,EACJrV,IACT,EAEAL,EAAGjC,UAAUgY,SAAW,SAAmBL,GAEzC,OADA/V,GAAQU,KAAKG,IAAK,yCACXH,KAAKuV,UAAUF,EACxB,EAEA1V,EAAGjC,UAAUiY,OAAS,SAAiBlU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI6H,IAAIhI,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUkY,QAAU,SAAkBnU,GAEvC,OADAnC,EAAOU,KAAKG,IAAK,uCACVH,KAAKG,IAAI2H,KAAK9H,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAUmY,OAAS,SAAiBpU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI8H,IAAIjI,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUoY,QAAU,SAAkBrU,GAEvC,OADAnC,EAAOU,KAAKG,IAAK,uCACVH,KAAKG,IAAI4H,KAAK/H,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAUqY,OAAS,SAAiBtU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI6V,IAAIhW,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUuY,OAAS,SAAiBxU,GAGrC,OAFAnC,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAI+V,SAASlW,KAAMyB,GACjBzB,KAAKG,IAAIiB,IAAIpB,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUyY,QAAU,SAAkB1U,GAGvC,OAFAnC,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAI+V,SAASlW,KAAMyB,GACjBzB,KAAKG,IAAI+L,KAAKlM,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAU0Y,OAAS,WAGpB,OAFA9W,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIwQ,IAAI3Q,KACtB,EAEAL,EAAGjC,UAAU4Y,QAAU,WAGrB,OAFAhX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIyQ,KAAK5Q,KACvB,EAGAL,EAAGjC,UAAU6Y,QAAU,WAGrB,OAFAjX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIqW,KAAKxW,KACvB,EAEAL,EAAGjC,UAAU+Y,QAAU,WAGrB,OAFAnX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAImU,KAAKtU,KACvB,EAGAL,EAAGjC,UAAUgZ,OAAS,WAGpB,OAFApX,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIyG,IAAI5G,KACtB,EAEAL,EAAGjC,UAAUiZ,OAAS,SAAiBlV,GAGrC,OAFAnC,EAAOU,KAAKG,MAAQsB,EAAItB,IAAK,qBAC7BH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIgD,IAAInD,KAAMyB,EAC5B,EAGA,IAAImV,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMnI,GAErB/O,KAAKkX,KAAOA,EACZlX,KAAK+O,EAAI,IAAIpP,EAAGoP,EAAG,IACnB/O,KAAKwP,EAAIxP,KAAK+O,EAAEhJ,YAChB/F,KAAKoE,EAAI,IAAIzE,EAAG,GAAGmR,OAAO9Q,KAAKwP,GAAGzH,KAAK/H,KAAK+O,GAE5C/O,KAAKmX,IAAMnX,KAAKoX,MAClB,CAgDA,SAASC,IACPJ,EAAOK,KACLtX,KACA,OACA,0EACJ,CA8DA,SAASuX,IACPN,EAAOK,KACLtX,KACA,OACA,iEACJ,CAGA,SAASwX,IACPP,EAAOK,KACLtX,KACA,OACA,wDACJ,CAGA,SAASyX,IAEPR,EAAOK,KACLtX,KACA,QACA,sEACJ,CA6CA,SAASmV,EAAK1F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIiI,EAAQ/X,EAAGgY,OAAOlI,GACtBzP,KAAKyP,EAAIiI,EAAM3I,EACf/O,KAAK0X,MAAQA,CACf,MACEpY,EAAOmQ,EAAEgF,IAAI,GAAI,kCACjBzU,KAAKyP,EAAIA,EACTzP,KAAK0X,MAAQ,IAEjB,CAkOA,SAASE,EAAMnI,GACb0F,EAAImC,KAAKtX,KAAMyP,GAEfzP,KAAKoS,MAAQpS,KAAKyP,EAAE1J,YAChB/F,KAAKoS,MAAQ,IAAO,IACtBpS,KAAKoS,OAAS,GAAMpS,KAAKoS,MAAQ,IAGnCpS,KAAKe,EAAI,IAAIpB,EAAG,GAAGmR,OAAO9Q,KAAKoS,OAC/BpS,KAAKkT,GAAKlT,KAAK6X,KAAK7X,KAAKe,EAAE4P,OAC3B3Q,KAAK8X,KAAO9X,KAAKe,EAAEkT,OAAOjU,KAAKyP,GAE/BzP,KAAK+X,KAAO/X,KAAK8X,KAAK1W,IAAIpB,KAAKe,GAAGgR,MAAM,GAAGW,IAAI1S,KAAKyP,GACpDzP,KAAK+X,KAAO/X,KAAK+X,KAAKjF,KAAK9S,KAAKe,GAChCf,KAAK+X,KAAO/X,KAAKe,EAAEkH,IAAIjI,KAAK+X,KAC9B,CA/aAd,EAAOvZ,UAAU0Z,KAAO,WACtB,IAAID,EAAM,IAAIxX,EAAG,MAEjB,OADAwX,EAAIjX,MAAQ,IAAIwB,MAAMJ,KAAKiB,KAAKvC,KAAKwP,EAAI,KAClC2H,CACT,EAEAF,EAAOvZ,UAAUsa,QAAU,SAAkBvW,GAG3C,IACIwW,EADAlX,EAAIU,EAGR,GACEzB,KAAKkY,MAAMnX,EAAGf,KAAKmX,KAGnBc,GADAlX,GADAA,EAAIf,KAAKmY,MAAMpX,IACT+G,KAAK9H,KAAKmX,MACPpR,kBACFkS,EAAOjY,KAAKwP,GAErB,IAAIzN,EAAMkW,EAAOjY,KAAKwP,GAAK,EAAIzO,EAAEyT,KAAKxU,KAAK+O,GAgB3C,OAfY,IAARhN,GACFhB,EAAEb,MAAM,GAAK,EACba,EAAErC,OAAS,GACFqD,EAAM,EACfhB,EAAEgH,KAAK/H,KAAK+O,QAEI3P,IAAZ2B,EAAE4B,MAEJ5B,EAAE4B,QAGF5B,EAAEqX,SAICrX,CACT,EAEAkW,EAAOvZ,UAAUwa,MAAQ,SAAgBG,EAAOtU,GAC9CsU,EAAM3S,OAAO1F,KAAKwP,EAAG,EAAGzL,EAC1B,EAEAkT,EAAOvZ,UAAUya,MAAQ,SAAgB1W,GACvC,OAAOA,EAAIyK,KAAKlM,KAAKoE,EACvB,EAQA1E,EAAS2X,EAAMJ,GAEfI,EAAK3Z,UAAUwa,MAAQ,SAAgBG,EAAOC,GAK5C,IAHA,IAAIhH,EAAO,QAEPiH,EAASjX,KAAKC,IAAI8W,EAAM3Z,OAAQ,GAC3B8C,EAAI,EAAGA,EAAI+W,EAAQ/W,IAC1B8W,EAAOpY,MAAMsB,GAAK6W,EAAMnY,MAAMsB,GAIhC,GAFA8W,EAAO5Z,OAAS6Z,EAEZF,EAAM3Z,QAAU,EAGlB,OAFA2Z,EAAMnY,MAAM,GAAK,OACjBmY,EAAM3Z,OAAS,GAKjB,IAAI8Z,EAAOH,EAAMnY,MAAM,GAGvB,IAFAoY,EAAOpY,MAAMoY,EAAO5Z,UAAY8Z,EAAOlH,EAElC9P,EAAI,GAAIA,EAAI6W,EAAM3Z,OAAQ8C,IAAK,CAClC,IAAIiX,EAAwB,EAAjBJ,EAAMnY,MAAMsB,GACvB6W,EAAMnY,MAAMsB,EAAI,KAAQiX,EAAOnH,IAAS,EAAMkH,IAAS,GACvDA,EAAOC,CACT,CACAD,KAAU,GACVH,EAAMnY,MAAMsB,EAAI,IAAMgX,EACT,IAATA,GAAcH,EAAM3Z,OAAS,GAC/B2Z,EAAM3Z,QAAU,GAEhB2Z,EAAM3Z,QAAU,CAEpB,EAEA2Y,EAAK3Z,UAAUya,MAAQ,SAAgB1W,GAErCA,EAAIvB,MAAMuB,EAAI/C,QAAU,EACxB+C,EAAIvB,MAAMuB,EAAI/C,OAAS,GAAK,EAC5B+C,EAAI/C,QAAU,EAId,IADA,IAAIwF,EAAK,EACA1C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CACnC,IAAIiB,EAAmB,EAAfhB,EAAIvB,MAAMsB,GAClB0C,GAAU,IAAJzB,EACNhB,EAAIvB,MAAMsB,GAAU,SAAL0C,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,EACtC,CASA,OANkC,IAA9BzC,EAAIvB,MAAMuB,EAAI/C,OAAS,KACzB+C,EAAI/C,SAC8B,IAA9B+C,EAAIvB,MAAMuB,EAAI/C,OAAS,IACzB+C,EAAI/C,UAGD+C,CACT,EAQA/B,EAAS6X,EAAMN,GAQfvX,EAAS8X,EAAMP,GASfvX,EAAS+X,EAAQR,GAEjBQ,EAAO/Z,UAAUya,MAAQ,SAAgB1W,GAGvC,IADA,IAAI0C,EAAQ,EACH3C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CACnC,IAAIwE,EAA0B,IAAL,EAAfvE,EAAIvB,MAAMsB,IAAiB2C,EACjCD,EAAU,SAAL8B,EACTA,KAAQ,GAERvE,EAAIvB,MAAMsB,GAAK0C,EACfC,EAAQ6B,CACV,CAIA,OAHc,IAAV7B,IACF1C,EAAIvB,MAAMuB,EAAI/C,UAAYyF,GAErB1C,CACT,EAGA9B,EAAGgY,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAIzX,MAAM,iBAAmByX,GAFnCQ,EAAQ,IAAID,CAGd,CAGA,OAFAb,EAAOM,GAAQQ,EAERA,CACT,EAiBAvC,EAAIzX,UAAU2Y,SAAW,SAAmBrS,GAC1C1E,EAAsB,IAAf0E,EAAE/D,SAAgB,iCACzBX,EAAO0E,EAAE7D,IAAK,kCAChB,EAEAgV,EAAIzX,UAAUwY,SAAW,SAAmBlS,EAAGC,GAC7C3E,EAAqC,IAA7B0E,EAAE/D,SAAWgE,EAAEhE,UAAiB,iCACxCX,EAAO0E,EAAE7D,KAAO6D,EAAE7D,MAAQ8D,EAAE9D,IAC1B,kCACJ,EAEAgV,EAAIzX,UAAUma,KAAO,SAAe7T,GAClC,OAAIhE,KAAK0X,MAAc1X,KAAK0X,MAAMM,QAAQhU,GAAGuR,UAAUvV,OAEvD23D,EAAK3zD,EAAGA,EAAE8O,KAAK9S,KAAKyP,GAAG8F,UAAUvV,OAC1BgE,EACT,EAEAmR,EAAIzX,UAAUkJ,IAAM,SAAc5C,GAChC,OAAIA,EAAEW,SACGX,EAAEV,QAGJtD,KAAKyP,EAAExH,IAAIjE,GAAGuR,UAAUvV,KACjC,EAEAmV,EAAIzX,UAAUsK,IAAM,SAAchE,EAAGC,GACnCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEgE,IAAI/D,GAIhB,OAHIsB,EAAIxD,IAAI/B,KAAKyP,IAAM,GACrBlK,EAAIwC,KAAK/H,KAAKyP,GAETlK,EAAIgQ,UAAUvV,KACvB,EAEAmV,EAAIzX,UAAUoK,KAAO,SAAe9D,EAAGC,GACrCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE8D,KAAK7D,GAIjB,OAHIsB,EAAIxD,IAAI/B,KAAKyP,IAAM,GACrBlK,EAAIwC,KAAK/H,KAAKyP,GAETlK,CACT,EAEA4P,EAAIzX,UAAUuK,IAAM,SAAcjE,EAAGC,GACnCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEiE,IAAIhE,GAIhB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK9H,KAAKyP,GAETlK,EAAIgQ,UAAUvV,KACvB,EAEAmV,EAAIzX,UAAUqK,KAAO,SAAe/D,EAAGC,GACrCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE+D,KAAK9D,GAIjB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK9H,KAAKyP,GAETlK,CACT,EAEA4P,EAAIzX,UAAUsY,IAAM,SAAchS,EAAGvC,GAEnC,OADAzB,KAAKqW,SAASrS,GACPhE,KAAK6X,KAAK7T,EAAE0N,MAAMjQ,GAC3B,EAEA0T,EAAIzX,UAAUwO,KAAO,SAAelI,EAAGC,GAErC,OADAjE,KAAKkW,SAASlS,EAAGC,GACVjE,KAAK6X,KAAK7T,EAAEkI,KAAKjI,GAC1B,EAEAkR,EAAIzX,UAAU0D,IAAM,SAAc4C,EAAGC,GAEnC,OADAjE,KAAKkW,SAASlS,EAAGC,GACVjE,KAAK6X,KAAK7T,EAAE5C,IAAI6C,GACzB,EAEAkR,EAAIzX,UAAUkT,KAAO,SAAe5M,GAClC,OAAOhE,KAAKkM,KAAKlI,EAAGA,EAAEV,QACxB,EAEA6R,EAAIzX,UAAUiT,IAAM,SAAc3M,GAChC,OAAOhE,KAAKoB,IAAI4C,EAAGA,EACrB,EAEAmR,EAAIzX,UAAU8Y,KAAO,SAAexS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEV,QAEzB,IAAIoV,EAAO1Y,KAAKyP,EAAEhK,MAAM,GAIxB,GAHAnG,EAAOoZ,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIvV,EAAMnD,KAAKyP,EAAEzH,IAAI,IAAIrI,EAAG,IAAI+F,OAAO,GACvC,OAAO1F,KAAKmD,IAAIa,EAAGb,EACrB,CAOA,IAFA,IAAIqC,EAAIxF,KAAKyP,EAAEwC,KAAK,GAChBxD,EAAI,GACAjJ,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXpG,GAAQkG,EAAEb,UAEV,IAAIgU,EAAM,IAAIhZ,EAAG,GAAGyV,MAAMpV,MACtB4Y,EAAOD,EAAIjC,SAIXmC,EAAO7Y,KAAKyP,EAAEwC,KAAK,GAAGvM,OAAO,GAC7BoT,EAAI9Y,KAAKyP,EAAE1J,YAGf,IAFA+S,EAAI,IAAInZ,EAAG,EAAImZ,EAAIA,GAAG1D,MAAMpV,MAEW,IAAhCA,KAAKmD,IAAI2V,EAAGD,GAAM9W,IAAI6W,IAC3BE,EAAElD,QAAQgD,GAOZ,IAJA,IAAIjY,EAAIX,KAAKmD,IAAI2V,EAAGtT,GAChBzE,EAAIf,KAAKmD,IAAIa,EAAGwB,EAAEwM,KAAK,GAAGtM,OAAO,IACjCG,EAAI7F,KAAKmD,IAAIa,EAAGwB,GAChBiK,EAAIhB,EACc,IAAf5I,EAAE9D,IAAI4W,IAAY,CAEvB,IADA,IAAIxB,EAAMtR,EACDrE,EAAI,EAAoB,IAAjB2V,EAAIpV,IAAI4W,GAAYnX,IAClC2V,EAAMA,EAAIf,SAEZ9W,EAAOkC,EAAIiO,GACX,IAAIxL,EAAIjE,KAAKmD,IAAIxC,EAAG,IAAIhB,EAAG,GAAGmR,OAAOrB,EAAIjO,EAAI,IAE7CT,EAAIA,EAAEkV,OAAOhS,GACbtD,EAAIsD,EAAEmS,SACNvQ,EAAIA,EAAEoQ,OAAOtV,GACb8O,EAAIjO,CACN,CAEA,OAAOT,CACT,EAEAoU,EAAIzX,UAAU4W,KAAO,SAAetQ,GAClC,IAAI+U,EAAM/U,EAAEiQ,OAAOjU,KAAKyP,GACxB,OAAqB,IAAjBsJ,EAAI9Y,UACN8Y,EAAI9Y,SAAW,EACRD,KAAK6X,KAAKkB,GAAKrC,UAEf1W,KAAK6X,KAAKkB,EAErB,EAEA5D,EAAIzX,UAAUyF,IAAM,SAAca,EAAGvC,GACnC,GAAIA,EAAIkD,SAAU,OAAO,IAAIhF,EAAG,GAAGyV,MAAMpV,MACzC,GAAoB,IAAhByB,EAAI4S,KAAK,GAAU,OAAOrQ,EAAEV,QAEhC,IACI0V,EAAM,IAAItX,MAAM,IACpBsX,EAAI,GAAK,IAAIrZ,EAAG,GAAGyV,MAAMpV,MACzBgZ,EAAI,GAAKhV,EACT,IAAK,IAAIxC,EAAI,EAAGA,EAAIwX,EAAIta,OAAQ8C,IAC9BwX,EAAIxX,GAAKxB,KAAKoB,IAAI4X,EAAIxX,EAAI,GAAIwC,GAGhC,IAAIuB,EAAMyT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbhY,EAAQO,EAAIsE,YAAc,GAK9B,IAJc,IAAV7E,IACFA,EAAQ,IAGLM,EAAIC,EAAI/C,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIwB,EAAOvB,EAAIvB,MAAMsB,GACZgB,EAAItB,EAAQ,EAAGsB,GAAK,EAAGA,IAAK,CACnC,IAAIoF,EAAO5E,GAAQR,EAAK,EACpB+C,IAAQyT,EAAI,KACdzT,EAAMvF,KAAK2Q,IAAIpL,IAGL,IAARqC,GAAyB,IAAZqR,GAKjBA,IAAY,EACZA,GAAWrR,GA9BE,KA+BbsR,GACwC,IAAN1X,GAAiB,IAANgB,KAE7C+C,EAAMvF,KAAKoB,IAAImE,EAAKyT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYjB,CACAhY,EAAQ,EACV,CAEA,OAAOqE,CACT,EAEA4P,EAAIzX,UAAU4X,UAAY,SAAoB7T,GAC5C,IAAIV,EAAIU,EAAIqR,KAAK9S,KAAKyP,GAEtB,OAAO1O,IAAMU,EAAMV,EAAEuC,QAAUvC,CACjC,EAEAoU,EAAIzX,UAAU+X,YAAc,SAAsBhU,GAChD,IAAI8D,EAAM9D,EAAI6B,QAEd,OADAiC,EAAIpF,IAAM,KACHoF,CACT,EAMA5F,EAAGwZ,KAAO,SAAe1X,GACvB,OAAO,IAAImW,EAAKnW,EAClB,EAkBA/B,EAASkY,EAAMzC,GAEfyC,EAAKla,UAAU4X,UAAY,SAAoB7T,GAC7C,OAAOzB,KAAK6X,KAAKpW,EAAIiQ,MAAM1R,KAAKoS,OAClC,EAEAwF,EAAKla,UAAU+X,YAAc,SAAsBhU,GACjD,IAAIV,EAAIf,KAAK6X,KAAKpW,EAAIL,IAAIpB,KAAK8X,OAE/B,OADA/W,EAAEZ,IAAM,KACDY,CACT,EAEA6W,EAAKla,UAAUwO,KAAO,SAAelI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE9D,MAAM,GAAK,EACb8D,EAAEtF,OAAS,EACJsF,EAGT,IAAI6B,EAAI7B,EAAEkI,KAAKjI,GACXtD,EAAIkF,EAAEiM,MAAM9R,KAAKoS,OAAOhR,IAAIpB,KAAK+X,MAAMlG,OAAO7R,KAAKoS,OAAOhR,IAAIpB,KAAKyP,GACnE2J,EAAIvT,EAAEkC,KAAKpH,GAAG+E,OAAO1F,KAAKoS,OAC1B7M,EAAM6T,EAQV,OANIA,EAAErX,IAAI/B,KAAKyP,IAAM,EACnBlK,EAAM6T,EAAErR,KAAK/H,KAAKyP,GACT2J,EAAE/E,KAAK,GAAK,IACrB9O,EAAM6T,EAAEtR,KAAK9H,KAAKyP,IAGblK,EAAIgQ,UAAUvV,KACvB,EAEA4X,EAAKla,UAAU0D,IAAM,SAAc4C,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAIhF,EAAG,GAAG4V,UAAUvV,MAEzD,IAAI6F,EAAI7B,EAAE5C,IAAI6C,GACVtD,EAAIkF,EAAEiM,MAAM9R,KAAKoS,OAAOhR,IAAIpB,KAAK+X,MAAMlG,OAAO7R,KAAKoS,OAAOhR,IAAIpB,KAAKyP,GACnE2J,EAAIvT,EAAEkC,KAAKpH,GAAG+E,OAAO1F,KAAKoS,OAC1B7M,EAAM6T,EAOV,OANIA,EAAErX,IAAI/B,KAAKyP,IAAM,EACnBlK,EAAM6T,EAAErR,KAAK/H,KAAKyP,GACT2J,EAAE/E,KAAK,GAAK,IACrB9O,EAAM6T,EAAEtR,KAAK9H,KAAKyP,IAGblK,EAAIgQ,UAAUvV,KACvB,EAEA4X,EAAKla,UAAU4W,KAAO,SAAetQ,GAGnC,OADUhE,KAAK6X,KAAK7T,EAAEiQ,OAAOjU,KAAKyP,GAAGrO,IAAIpB,KAAKkT,KACnCqC,UAAUvV,KACvB,CACD,CA19GD,YA09G4CA,iBCz9G5C,IAAI/B,EAAS,EAAQ,GACjBC,EAASD,EAAOC,OAGpB,SAASC,EAAWC,EAAKC,GACvB,IAAK,IAAIC,KAAOF,EACdC,EAAIC,GAAOF,EAAIE,EAEnB,CASA,SAASC,EAAYC,EAAKC,EAAkBC,GAC1C,OAAOR,EAAOM,EAAKC,EAAkBC,EACvC,CAVIR,EAAOS,MAAQT,EAAOU,OAASV,EAAOW,aAAeX,EAAOY,gBAC9D7B,EAAOD,QAAUiB,GAGjBE,EAAUF,EAAQjB,GAClBA,EAAQkB,OAASK,GAOnBA,EAAWb,UAAYL,OAAOC,OAAOY,EAAOR,WAG5CS,EAAUD,EAAQK,GAElBA,EAAWI,KAAO,SAAUH,EAAKC,EAAkBC,GACjD,GAAmB,iBAARF,EACT,MAAM,IAAIO,UAAU,iCAEtB,OAAOb,EAAOM,EAAKC,EAAkBC,EACvC,EAEAH,EAAWK,MAAQ,SAAUI,EAAMC,EAAMC,GACvC,GAAoB,iBAATF,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAII,EAAMjB,EAAOc,GAUjB,YATaI,IAATH,EACsB,iBAAbC,EACTC,EAAIF,KAAKA,EAAMC,GAEfC,EAAIF,KAAKA,GAGXE,EAAIF,KAAK,GAEJE,CACT,EAEAZ,EAAWM,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOb,EAAOc,EAChB,EAEAT,EAAWO,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOd,EAAOoB,WAAWL,EAC3B,oBC9DA/B,EAAOD,QAmBP,SAAmB2qB,EAAItS,GAKnB,IAJA,IAAIuiC,EAAU,IAAIl2C,MAAM+Z,UAAU/c,OAAS,GACvC2e,EAAU,EACV3c,EAAU,EACV8vC,GAAU,EACP9vC,EAAQ+a,UAAU/c,QACrBk5C,EAAOv6B,KAAY5B,UAAU/a,KACjC,OAAO,IAAIsyB,SAAQ,SAAkBC,EAASC,GAC1C0kB,EAAOv6B,GAAU,SAAkB+V,GAC/B,GAAIod,EAEA,GADAA,GAAU,EACNpd,EACAF,EAAOE,OACN,CAGD,IAFA,IAAIwkB,EAAS,IAAIl2C,MAAM+Z,UAAU/c,OAAS,GACtC2e,EAAS,EACNA,EAASu6B,EAAOl5C,QACnBk5C,EAAOv6B,KAAY5B,UAAU4B,GACjC4V,EAAQhU,MAAM,KAAM24B,EACxB,CAER,EACA,IACIjwB,EAAG1I,MAAM5J,GAAO,KAAMuiC,EAC1B,CAAE,MAAOxkB,GACDod,IACAA,GAAU,EACVtd,EAAOE,GAEf,CACJ,GACJ,yBC1CA,SAAS/K,QAAQ8vC,YACb,IACI,IAAIp1D,IAAM6vC,KAAK,QAAQzwC,QAAQ,IAAI,MAAzBywC,CAAgCulB,YAC1C,GAAIp1D,MAAQA,IAAIrE,QAAUrB,OAAOkrB,KAAKxlB,KAAKrE,QACvC,OAAOqE,GACf,CAAE,MAAOxC,GAAI,CACb,OAAO,IACX,CAfAtD,OAAOD,QAAUqrB,gCCKPrrB,EA6BNwkC,QAAU,EAAQ,uBClCtBvkC,EAAOD,QAAU,CAAC,0BCAlBC,EAAOD,QA0BP,SAAiB+gD,GAWb,IATA,IAIOqa,EAJHnkB,EAAMlsB,EAAKE,QAAQ,CAAC,IAAK,KAAM81B,EAAM7mC,KAAO,UAAtC6Q,CACT,SADSA,CAEL,qBAKDma,EAA2B6b,EAAMnR,YAAY1yB,QAAQm+C,KAAKtwC,EAAKwB,mBAE1D/nB,EAAI,EAAGA,EAAI0gC,EAAOxjC,SAAU8C,EAAG,CACpC,IAAIsrC,EAAW5K,EAAO1gC,GAAGyxB,UACrBvyB,EAAWq9C,EAAMR,aAAa9gC,QAAQqwB,GACtC5xB,EAAW4xB,EAAMlO,wBAAwB9W,EAAO,QAAUglB,EAAM5xB,KAChEwhC,EAAWze,EAAMyC,MAAMxlB,GACvBk9C,EAAW,IAAMrwC,EAAKc,SAASikB,EAAM51B,MAGrC41B,EAAMvO,KACN0V,EACP,sCAAuCmkB,EAAKtrB,EAAM51B,KAD3C+8B,CAEH,mDAAoDmkB,EAFjDnkB,CAGC,4CAA6CnH,EAAMtjB,IAAM,EAAI,KAAO,EAAG,EAAIyU,EAAM0C,OAAOmM,EAAMkR,SAAUlR,EAAMkR,cAC9F5+C,IAAbs9C,EAAwBzI,EAC3B,oEAAqEvzC,EAAO03D,GACxEnkB,EACJ,qCAAsC,GAAKyI,EAAUxhC,EAAMk9C,GAC5DnkB,EACH,IADGA,CAEP,MAGcnH,EAAMxO,UAAY2V,EAChC,2BAA4BmkB,EAAKA,GAGtBtrB,EAAMxN,aAAiClgC,IAAvB6+B,EAAMqB,OAAOpkB,GAAuB+4B,EAE3D,uBAAwBnH,EAAMtjB,IAAM,EAAI,KAAO,EAFYyqB,CAG3D,+BAAgCmkB,EAH2BnkB,CAIvD,cAAe/4B,EAAMk9C,EAJkCnkB,CAK3D,eAGYA,EAEZ,+BAAgCmkB,QACRh5D,IAAbs9C,EACR4b,EAAerkB,EAAKnH,EAAOpsC,EAAO03D,EAAM,OAC/BnkB,EACR,0BAA2BnH,EAAMtjB,IAAM,EAAIkzB,KAAc,EAAGxhC,EAAMk9C,IAEjEnkB,EACT,OAIWnH,EAAMzO,UAAU4V,EAC3B,qCAAsCmkB,EAAKtrB,EAAM51B,WAEzB9X,IAAbs9C,EACR4b,EAAerkB,EAAKnH,EAAOpsC,EAAO03D,GACzBnkB,EACR,uBAAwBnH,EAAMtjB,IAAM,EAAIkzB,KAAc,EAAGxhC,EAAMk9C,GAGpE,CAEA,OAAOnkB,EACN,WAEL,EAhGA,IAAInsB,EAAW,EAAQ,GACnBmW,EAAW,EAAQ,IACnBlW,EAAW,EAAQ,GAWvB,SAASuwC,EAAerkB,EAAKnH,EAAOyrB,EAAYH,GAC5C,OAAOtrB,EAAMlO,aAAaye,MACpBpJ,EAAI,+CAAgDskB,EAAYH,GAAMtrB,EAAMtjB,IAAM,EAAI,KAAO,GAAIsjB,EAAMtjB,IAAM,EAAI,KAAO,GACxHyqB,EAAI,oDAAqDskB,EAAYH,GAAMtrB,EAAMtjB,IAAM,EAAI,KAAO,EAC5G,0BCnBAvsB,EAAOD,QAeP,SAAiB+gD,GAEb,IAAI9J,EAAMlsB,EAAKE,QAAQ,CAAC,IAAK,KAAM81B,EAAM7mC,KAAO,UAAtC6Q,CACT,6BADSA,CAEL,qBAFKA,CAGT,qDAAuDg2B,EAAMnR,YAAYsR,QAAO,SAASpR,GAAS,OAAOA,EAAMvO,GAAK,IAAG7/B,OAAS,KAAO,IAH9HqpB,CAIT,kBAJSA,CAKL,oBACDg2B,EAAMV,OAAOpJ,EACZ,gBADYA,CAER,SACTA,EACK,kBAGL,IADA,IAAIzyC,EAAI,EACDA,EAAsBu8C,EAAMnR,YAAYluC,SAAU8C,EAAG,CACxD,IAAIsrC,EAAQiR,EAAMR,aAAa/7C,GAAGyxB,UAC9B/X,EAAQ4xB,EAAMlO,wBAAwB9W,EAAO,QAAUglB,EAAM5xB,KAC7Dk9C,EAAQ,IAAMrwC,EAAKc,SAASikB,EAAM51B,MAAO+8B,EACxC,WAAYnH,EAAMtjB,IAGnBsjB,EAAMvO,KAAO0V,EACR,iBADQA,CAER,4BAA6BmkB,EAFrBnkB,CAGJ,QAASmkB,EAHLnkB,CAIR,WAAYnH,EAAMkR,QAJV/J,CAKR,gBAC6B70C,IAA9B6+B,EAAMU,KAAKmO,EAAMkR,cACS5+C,IAAtB6+B,EAAMyC,MAAMxlB,GAAqB+4B,EACpC,8EAAiFmkB,EAAK52D,GAClFyyC,EACJ,sDAAyDmkB,EAAKl9C,QAErC9b,IAAtB6+B,EAAMyC,MAAMxlB,GAAqB+4B,EACpC,uCAAwCmkB,EAAK52D,GACzCyyC,EACJ,eAAgBmkB,EAAKl9C,IAInB4xB,EAAMxO,UAAY2V,EAEpB,uBAAwBmkB,EAAKA,EAFTnkB,CAGhB,QAASmkB,QAGSh5D,IAAvB6+B,EAAMqB,OAAOpkB,IAAqB+4B,EACjC,iBADiCA,CAE7B,0BAF6BA,CAG7B,kBAH6BA,CAIzB,kBAAmBmkB,EAAKl9C,EAJC+4B,CAKjC,cAGqB70C,IAAtB6+B,EAAMyC,MAAMxlB,GAAqB+4B,EAAInH,EAAMlO,aAAaye,MAClD,+BACA,0CAA2C+a,EAAK52D,GACrDyyC,EACI,kBAAmBmkB,EAAKl9C,SAGJ9b,IAAtB6+B,EAAMyC,MAAMxlB,GAAqB+4B,EAAInH,EAAMlO,aAAaye,MACzD,yBACA,oCAAqC+a,EAAK52D,GAC/CyyC,EACI,YAAamkB,EAAKl9C,GAC3B+4B,EACS,QAEb,CASA,IATEA,EACO,WADPA,CAEW,kBAFXA,CAGW,QAHXA,CAKG,IALHA,CAMD,KAGIzyC,EAAI,EAAGA,EAAIu8C,EAAMR,aAAa7+C,SAAU8C,EAAG,CAC5C,IAAIg3D,EAASza,EAAMR,aAAa/7C,GAC5Bg3D,EAAOp6B,UAAU6V,EACxB,4BAA6BukB,EAAOthD,KADZ+8B,CAEpB,4CAA6CwkB,EAAQD,GAC1D,CAEA,OAAOvkB,EACN,WAEL,EAtGA,IAAInsB,EAAU,EAAQ,GAClBmW,EAAU,EAAQ,IAClBlW,EAAU,EAAQ,GAEtB,SAAS0wC,EAAQ3rB,GACb,MAAO,qBAAuBA,EAAM51B,KAAO,GAC/C,0BCRAja,EAAOD,QAwHP,SAAkB+gD,GAGd,IAAI9J,EAAMlsB,EAAKE,QAAQ,CAAC,KAAM81B,EAAM7mC,KAAO,UAAjC6Q,CACT,oCADSA,CAEL,WAAY,mBAEb2wC,EAAiB,CAAC,EADT3a,EAAMH,YAERl/C,QAAQu1C,EAClB,YAED,IAAK,IAAIzyC,EAAI,EAAGA,EAAsBu8C,EAAMnR,YAAYluC,SAAU8C,EAAG,CACjE,IAAIsrC,EAAQiR,EAAMR,aAAa/7C,GAAGyxB,UAC9BmlC,EAAQ,IAAMrwC,EAAKc,SAASikB,EAAM51B,MAMtC,GAJI41B,EAAMzO,UAAU4V,EACnB,sCAAuCmkB,EAAKtrB,EAAM51B,MAG/C41B,EAAMvO,IAAO0V,EACZ,yBAA0BmkB,EADdnkB,CAER,WAAY0kB,EAAQ7rB,EAAO,UAFnBmH,CAGZ,wBAAyBmkB,EAHbnkB,CAIZ,gCACG2kB,EAAa3kB,EAAKnH,EAAO,QACzB+rB,EAAe5kB,EAAKnH,EAAOtrC,EAAG42D,EAAM,SAApCS,CACH,UAGE,GAAI/rB,EAAMxO,SAAY2V,EACxB,yBAA0BmkB,EADFnkB,CAEpB,WAAY0kB,EAAQ7rB,EAAO,SAFPmH,CAGxB,gCAAiCmkB,GAC9BS,EAAe5kB,EAAKnH,EAAOtrC,EAAG42D,EAAM,MAApCS,CACH,SAGE,CACH,GAAI/rB,EAAMtO,OAAQ,CACd,IAAIs6B,EAAY/wC,EAAKc,SAASikB,EAAMtO,OAAOtnB,MACD,IAAtCwhD,EAAe5rB,EAAMtO,OAAOtnB,OAAa+8B,EAChD,cAAe6kB,EADiC7kB,CAE5C,WAAYnH,EAAMtO,OAAOtnB,KAAO,qBACjCwhD,EAAe5rB,EAAMtO,OAAOtnB,MAAQ,EACpC+8B,EACH,QAAS6kB,EACV,CACAD,EAAe5kB,EAAKnH,EAAOtrC,EAAG42D,EAClC,CACItrB,EAAMzO,UAAU4V,EACnB,IACL,CACA,OAAOA,EACN,cAEL,EA7KA,IAAInsB,EAAY,EAAQ,GACpBC,EAAY,EAAQ,GAExB,SAAS4wC,EAAQ7rB,EAAO7I,GACpB,OAAO6I,EAAM51B,KAAO,KAAO+sB,GAAY6I,EAAMxO,UAAyB,UAAb2F,EAAuB,KAAO6I,EAAMvO,KAAoB,WAAb0F,EAAwB,MAAM6I,EAAMkR,QAAQ,IAAM,IAAM,WAChK,CAWA,SAAS6a,EAAe5kB,EAAKnH,EAAOyrB,EAAYH,GAE5C,GAAItrB,EAAMlO,aACN,GAAIkO,EAAMlO,wBAAwB9W,EAAM,CAAEmsB,EACrC,cAAemkB,EADsBnkB,CAEjC,WAFiCA,CAG7B,WAAY0kB,EAAQ7rB,EAAO,eACpC,IAAK,IAAIvkB,EAAOlrB,OAAOkrB,KAAKukB,EAAMlO,aAAahT,QAASppB,EAAI,EAAGA,EAAI+lB,EAAK7pB,SAAU8D,EAAGyxC,EAChF,WAAYnH,EAAMlO,aAAahT,OAAOrD,EAAK/lB,KAChDyxC,EACS,QADTA,CAEC,IACL,MACIA,EACC,IADDA,CAEK,8BAA+BskB,EAAYH,EAFhDnkB,CAGK,QAHLA,CAIS,aAAcnH,EAAM51B,KAAO,IAJpC+8B,CAKC,UAGL,OAAQnH,EAAM5xB,MACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAY+4B,EACZ,0BAA2BmkB,EADfnkB,CAER,WAAY0kB,EAAQ7rB,EAAO,YAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYmH,EACZ,kFAAmFmkB,EAAKA,EAAKA,EAAKA,EADtFnkB,CAER,WAAY0kB,EAAQ7rB,EAAO,iBAChC,MACJ,IAAK,QACL,IAAK,SAAUmH,EACV,2BAA8BmkB,EADpBnkB,CAEN,WAAY0kB,EAAQ7rB,EAAO,WAChC,MACJ,IAAK,OAAQmH,EACR,4BAA+BmkB,EADvBnkB,CAEJ,WAAY0kB,EAAQ7rB,EAAO,YAChC,MACJ,IAAK,SAAUmH,EACV,yBAA0BmkB,EADhBnkB,CAEN,WAAY0kB,EAAQ7rB,EAAO,WAChC,MACJ,IAAK,QAASmH,EACT,4DAA+DmkB,EAAKA,EAAKA,EADhEnkB,CAEL,WAAY0kB,EAAQ7rB,EAAO,WAI5C,OAAOmH,CAEX,CAUA,SAAS2kB,EAAa3kB,EAAKnH,EAAOsrB,GAE9B,OAAQtrB,EAAMkR,SACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAY/J,EACZ,6BAA8BmkB,EADlBnkB,CAER,WAAY0kB,EAAQ7rB,EAAO,gBAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYmH,EACZ,6BAA8BmkB,EADlBnkB,CAER,WAAY0kB,EAAQ7rB,EAAO,qBAChC,MACJ,IAAK,OAAQmH,EACR,4BAA6BmkB,EADrBnkB,CAEJ,WAAY0kB,EAAQ7rB,EAAO,gBAGxC,OAAOmH,CAEX,0BC7GA,IAAIgJ,EAAYjgD,EAEZ8qB,EAAO,EAAQ,GACfC,EAAO,EAAQ,GAWnB,SAASgxC,EAA2B9kB,EAAKnH,EAAOyrB,EAAYzvC,GAExD,GAAIgkB,EAAMlO,aACN,GAAIkO,EAAMlO,wBAAwB9W,EAAM,CAAEmsB,EACrC,eAAgBnrB,GACjB,IAAK,IAAI8C,EAASkhB,EAAMlO,aAAahT,OAAQrD,EAAOlrB,OAAOkrB,KAAKqD,GAASpqB,EAAI,EAAGA,EAAI+mB,EAAK7pB,SAAU8C,EAC3FsrC,EAAMxO,UAAY1S,EAAOrD,EAAK/mB,MAAQsrC,EAAMrO,aAAawV,EAC5D,YACDA,EACC,UAAW1rB,EAAK/mB,GADjByyC,CAEC,WAAYroB,EAAOrD,EAAK/mB,IAFzByyC,CAGK,SAAUnrB,EAAM8C,EAAOrD,EAAK/mB,IAHjCyyC,CAIK,SACPA,EACD,IACL,MAAOA,EACF,4BAA+BnrB,EAD7BmrB,CAEE,sBAAuBnH,EAAM5M,SAAW,oBAF1C+T,CAGF,gCAAiCnrB,EAAMyvC,EAAYzvC,OACrD,CACH,IAAIkwC,GAAa,EACjB,OAAQlsB,EAAM5xB,MACV,IAAK,SACL,IAAK,QAAS+4B,EACT,kBAAmBnrB,EAAMA,GAC1B,MACJ,IAAK,SACL,IAAK,UAAWmrB,EACX,cAAenrB,EAAMA,GACtB,MACJ,IAAK,QACL,IAAK,SACL,IAAK,WAAYmrB,EACZ,YAAanrB,EAAMA,GACpB,MACJ,IAAK,SACDkwC,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAY/kB,EACZ,gBADYA,CAER,6CAA8CnrB,EAAMA,EAAMkwC,EAFlD/kB,CAGZ,iCAAoCnrB,EAHxBmrB,CAIR,uBAAwBnrB,EAAMA,EAJtBmrB,CAKZ,iCAAoCnrB,EALxBmrB,CAMR,UAAWnrB,EAAMA,EANTmrB,CAOZ,iCAAoCnrB,EAPxBmrB,CAQR,+DAAgEnrB,EAAMA,EAAMA,EAAMkwC,EAAa,OAAS,IAC7G,MACJ,IAAK,QAAS/kB,EACT,4BAA+BnrB,EADtBmrB,CAEL,wEAAyEnrB,EAAMA,EAAMA,EAFhFmrB,CAGT,sBAAuBnrB,EAHdmrB,CAIL,UAAWnrB,EAAMA,GACtB,MACJ,IAAK,SAAUmrB,EACV,kBAAmBnrB,EAAMA,GAC1B,MACJ,IAAK,OAAQmrB,EACR,mBAAoBnrB,EAAMA,GAMvC,CACA,OAAOmrB,CAEX,CAiEA,SAASglB,EAAyBhlB,EAAKnH,EAAOyrB,EAAYzvC,GAEtD,GAAIgkB,EAAMlO,aACFkO,EAAMlO,wBAAwB9W,EAAMmsB,EACnC,iDAAkDnrB,EAAMyvC,EAAYzvC,EAAMA,GAC1EmrB,EACA,gCAAiCnrB,EAAMyvC,EAAYzvC,OACrD,CACH,IAAIkwC,GAAa,EACjB,OAAQlsB,EAAM5xB,MACV,IAAK,SACL,IAAK,QAAS+4B,EACb,6CAA8CnrB,EAAMA,EAAMA,EAAMA,GAC7D,MACJ,IAAK,SACDkwC,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAY/kB,EAChB,4BAA+BnrB,EADfmrB,CAEZ,uCAAwCnrB,EAAMA,EAAMA,EAFxCmrB,CAGhB,OAHgBA,CAIZ,4IAA6InrB,EAAMA,EAAMA,EAAMA,EAAMkwC,EAAa,OAAQ,GAAIlwC,GAC/L,MACJ,IAAK,QAASmrB,EACb,gHAAiHnrB,EAAMA,EAAMA,EAAMA,EAAMA,GACtI,MACJ,QAASmrB,EACR,UAAWnrB,EAAMA,GAG1B,CACA,OAAOmrB,CAEX,CA9FAgJ,EAAU7hC,WAAa,SAAoB2iC,GAEvC,IAAI7b,EAAS6b,EAAMnR,YACfqH,EAAMlsB,EAAKE,QAAQ,CAAC,KAAM81B,EAAM7mC,KAAO,cAAjC6Q,CACT,6BADSA,CAEL,YACL,IAAKma,EAAOxjC,OAAQ,OAAOu1C,EAC1B,wBACDA,EACC,uBACD,IAAK,IAAIzyC,EAAI,EAAGA,EAAI0gC,EAAOxjC,SAAU8C,EAAG,CACpC,IAAIsrC,EAAS5K,EAAO1gC,GAAGyxB,UACnBnK,EAASf,EAAKc,SAASikB,EAAM51B,MAG7B41B,EAAMvO,KAAO0V,EACpB,WAAYnrB,EADQmrB,CAEhB,4BAA+BnrB,EAFfmrB,CAGZ,sBAAuBnH,EAAM5M,SAAW,oBAH5B+T,CAIhB,SAAUnrB,EAJMmrB,CAKhB,oDAAqDnrB,GAClDiwC,EAA2B9kB,EAAKnH,EAAwBtrC,EAAGsnB,EAAO,UAAlEiwC,CACH,IADGA,CAEP,MAGcjsB,EAAMxO,UAAY2V,EAChC,WAAYnrB,EADoBmrB,CAE5B,0BAA2BnrB,EAFCmrB,CAGxB,sBAAuBnH,EAAM5M,SAAW,mBAHhB+T,CAI5B,SAAUnrB,EAJkBmrB,CAK5B,iCAAkCnrB,GAC/BiwC,EAA2B9kB,EAAKnH,EAAwBtrC,EAAGsnB,EAAO,MAAlEiwC,CACH,IADGA,CAEP,OAIajsB,EAAMlO,wBAAwB9W,GAAOmsB,EAClD,iBAAkBnrB,GACfiwC,EAA2B9kB,EAAKnH,EAAwBtrC,EAAGsnB,GACjDgkB,EAAMlO,wBAAwB9W,GAAOmsB,EAClD,KAED,CAAE,OAAOA,EACR,WAEL,EAsDAgJ,EAAUz0B,SAAW,SAAkBu1B,GAEnC,IAAI7b,EAAS6b,EAAMnR,YAAY1yB,QAAQm+C,KAAKtwC,EAAKwB,mBACjD,IAAK2Y,EAAOxjC,OACR,OAAOqpB,EAAKE,SAALF,CAAe,aAU1B,IATA,IAAIksB,EAAMlsB,EAAKE,QAAQ,CAAC,IAAK,KAAM81B,EAAM7mC,KAAO,YAAtC6Q,CACT,SADSA,CAEL,OAFKA,CAGT,YAEGmxC,EAAiB,GACjBC,EAAY,GACZC,EAAe,GACf53D,EAAI,EACDA,EAAI0gC,EAAOxjC,SAAU8C,EACnB0gC,EAAO1gC,GAAGg9B,SACT0D,EAAO1gC,GAAGyxB,UAAUqL,SAAW46B,EAC/Bh3B,EAAO1gC,GAAG+8B,IAAM46B,EAChBC,GAAcp7C,KAAKkkB,EAAO1gC,IAEpC,GAAI03D,EAAex6D,OAAQ,CAEvB,IAFyBu1C,EAC5B,6BACQzyC,EAAI,EAAGA,EAAI03D,EAAex6D,SAAU8C,EAAGyyC,EAC3C,SAAUlsB,EAAKc,SAASqwC,EAAe13D,GAAG0V,OAC3C+8B,EACH,IACD,CAEA,GAAIklB,EAAUz6D,OAAQ,CAElB,IAFoBu1C,EACvB,8BACQzyC,EAAI,EAAGA,EAAI23D,EAAUz6D,SAAU8C,EAAGyyC,EACtC,SAAUlsB,EAAKc,SAASswC,EAAU33D,GAAG0V,OACtC+8B,EACH,IACD,CAEA,GAAImlB,EAAa16D,OAAQ,CAErB,IAFuBu1C,EAC1B,mBACQzyC,EAAI,EAAGA,EAAI43D,EAAa16D,SAAU8C,EAAG,CACtC,IAAIsrC,EAAQssB,EAAa53D,GACrBsnB,EAAQf,EAAKc,SAASikB,EAAM51B,MAChC,GAAI41B,EAAMlO,wBAAwB9W,EAAMmsB,EAC3C,6BAA8BnrB,EAAMgkB,EAAMlO,aAAa5S,WAAW8gB,EAAMrO,aAAcqO,EAAMrO,kBACpF,GAAIqO,EAAMnO,KAAMsV,EACxB,iBADwBA,CAEpB,gCAAiCnH,EAAMrO,YAAY46B,IAAKvsB,EAAMrO,YAAY66B,KAAMxsB,EAAMrO,YAAYvP,SAF9E+kB,CAGpB,oEAAqEnrB,EAHjDmrB,CAIxB,QAJwBA,CAKpB,6BAA8BnrB,EAAMgkB,EAAMrO,YAAYv8B,WAAY4qC,EAAMrO,YAAY35B,iBAChF,GAAIgoC,EAAM5rB,MAAO,CAClB,IAAIq4C,EAAe,IAAM73D,MAAMhE,UAAUwc,MAAM5C,KAAKw1B,EAAMrO,aAAavF,KAAK,KAAO,IACnF+a,EACP,6BAA8BnrB,EAAM/L,OAAOiC,aAAaC,MAAMlC,OAAQ+vB,EAAMrO,aADrEwV,CAEP,QAFOA,CAGH,SAAUnrB,EAAMywC,EAHbtlB,CAIH,6CAA8CnrB,EAAMA,EAJjDmrB,CAKP,IACG,MAAOA,EACV,SAAUnrB,EAAMgkB,EAAMrO,YACvB,CAAEwV,EACL,IACD,CACA,IAAIulB,GAAS,EACb,IAAKh4D,EAAI,EAAGA,EAAI0gC,EAAOxjC,SAAU8C,EAAG,CAC5BsrC,EAAQ5K,EAAO1gC,GAAnB,IACId,EAAQq9C,EAAMR,aAAa9gC,QAAQqwB,GACnChkB,EAAQf,EAAKc,SAASikB,EAAM51B,MAC5B41B,EAAMvO,KACDi7B,IAAUA,GAAS,EAAMvlB,EACrC,YACSA,EACT,0CAA2CnrB,EAAMA,EADxCmrB,CAEL,SAAUnrB,EAFLmrB,CAGL,kCACGglB,EAAyBhlB,EAAKnH,EAAoBpsC,EAAOooB,EAAO,WAAhEmwC,CACH,MACUnsB,EAAMxO,UAAY2V,EAChC,uBAAwBnrB,EAAMA,EADEmrB,CAE5B,SAAUnrB,EAFkBmrB,CAG5B,iCAAkCnrB,GAC/BmwC,EAAyBhlB,EAAKnH,EAAoBpsC,EAAOooB,EAAO,MAAhEmwC,CACH,OACQhlB,EACZ,uCAAwCnrB,EAAMgkB,EAAM51B,MACjD+hD,EAAyBhlB,EAAKnH,EAAoBpsC,EAAOooB,GACrDgkB,EAAMtO,QAAQyV,EACjB,eADiBA,CAEb,SAAUlsB,EAAKc,SAASikB,EAAMtO,OAAOtnB,MAAO41B,EAAM51B,OAEvD+8B,EACH,IACD,CACA,OAAOA,EACN,WAEL,0BC7RA,IAAIiJ,EAAWlgD,EAEX8/C,EAAU,EAAQ,IA6BtBI,EAAS,wBAA0B,CAE/B9hC,WAAY,SAASkN,GAGjB,GAAIA,GAAUA,EAAO,SAAU,CAC3B,IAAIpN,EAAOlb,KAAKuiC,OAAOja,EAAO,UAE9B,GAAIpN,EAAM,CAEN,IAAIu+C,EAAyC,MAA9BnxC,EAAO,SAASU,OAAO,GAClCV,EAAO,SAAS3K,OAAO,GAAK2K,EAAO,SAEvC,OAAOtoB,KAAK1C,OAAO,CACfm8D,SAAU,IAAMA,EAChB77D,MAAOsd,EAAKoP,OAAOpP,EAAKE,WAAWkN,IAASszB,UAEpD,CACJ,CAEA,OAAO57C,KAAKob,WAAWkN,EAC3B,EAEAE,SAAU,SAAS/B,EAASoF,GAGxB,GAAIA,GAAWA,EAAQM,MAAQ1F,EAAQgzC,UAAYhzC,EAAQ7oB,MAAO,CAE9D,IAAIsZ,EAAOuP,EAAQgzC,SAASvwC,UAAUzC,EAAQgzC,SAAS/8C,YAAY,KAAO,GACtExB,EAAOlb,KAAKuiC,OAAOrrB,GAEnBgE,IACAuL,EAAUvL,EAAKskB,OAAO/Y,EAAQ7oB,OACtC,CAGA,KAAM6oB,aAAmBzmB,KAAKzC,OAASkpB,aAAmBq2B,EAAS,CAC/D,IAAIx0B,EAAS7B,EAAQkD,MAAMnB,SAAS/B,EAASoF,GAE7C,OADAvD,EAAO,SAAW7B,EAAQkD,MAAMuW,SACzB5X,CACX,CAEA,OAAOtoB,KAAKwoB,SAAS/B,EAASoF,EAClC,qBChFJ5uB,EAAOD,QAAU08D,EAEjB,IAAIC,EAAiB,uBACjBC,EAAiB,kCACjBC,EAAiB,kCAEjBC,EAAe,aACfC,EAAkB,aAClBC,EAAoB,MACpBC,EAAe,KACfC,EAAa,UAEbC,EAAc,CACd,EAAK,KACL,EAAK,KACL,EAAK,KACL,EAAK,MAUT,SAASrgC,EAAS74B,GACd,OAAOA,EAAIkB,QAAQ+3D,GAAY,SAAS7wC,EAAIC,GACxC,OAAQA,GACJ,IAAK,KACL,IAAK,GACD,OAAOA,EACX,QACI,OAAO6wC,EAAY7wC,IAAO,GAEtC,GACJ,CA6DA,SAASowC,EAASvZ,EAAQia,GAEtBja,EAASA,EAAOj+C,WAEhB,IAAImb,EAAS,EACT3e,EAASyhD,EAAOzhD,OAChBypC,EAAO,EACPkyB,EAAc,KACdC,EAAc,KACdC,EAAc,EACdC,GAAmB,EAEnBh0C,EAAQ,GAERi0C,EAAc,KASlB,SAASC,EAAQC,GACb,OAAOl7D,MAAM,WAAak7D,EAAU,UAAYxyB,EAAO,IAC3D,CAyBA,SAASnf,EAAO/I,GACZ,OAAOkgC,EAAOn3B,OAAO/I,EACzB,CASA,SAAS26C,EAAW15D,EAAOC,GACvBk5D,EAAcla,EAAOn3B,OAAO9nB,KAC5Bq5D,EAAcpyB,EACdqyB,GAAmB,EAOnB,IACI75D,EADAk6D,EAAgB35D,GALhBk5D,EACW,EAEA,GAIf,GACI,KAAMS,EAAgB,GACyB,QAAtCl6D,EAAIw/C,EAAOn3B,OAAO6xC,IAA0B,CACjDL,GAAmB,EACnB,KACJ,QACW,MAAN75D,GAAmB,OAANA,GAItB,IAHA,IAAIm6D,EAAQ3a,EACPj3B,UAAUhoB,EAAOC,GACjB+W,MAAM8hD,GACFx4D,EAAI,EAAGA,EAAIs5D,EAAMp8D,SAAU8C,EAChCs5D,EAAMt5D,GAAKs5D,EAAMt5D,GACZW,QAAQi4D,EAAuBL,EAAkBD,EAAc,IAC/Dt5C,OACT85C,EAAcQ,EACT5hC,KAAK,MACL1Y,MACT,CAEA,SAASu6C,EAAyBC,GAC9B,IAAIC,EAAYC,EAAcF,GAG1BG,EAAWhb,EAAOj3B,UAAU8xC,EAAaC,GAI7C,MADgB,cAAcryC,KAAKuyC,EAEvC,CAEA,SAASD,EAAcE,GAGnB,IADA,IAAIH,EAAYG,EACTH,EAAYv8D,GAAgC,OAAtBsqB,EAAOiyC,IAChCA,IAEJ,OAAOA,CACX,CAOA,SAASxiD,IACL,GAAI+N,EAAM9nB,OAAS,EACf,OAAO8nB,EAAMpU,QACjB,GAAIqoD,EACA,OAzFR,WACI,IAAIvrD,EAAqB,MAAhBurD,EAAsBZ,EAAiBD,EAChD1qD,EAAGmsD,UAAYh+C,EAAS,EACxB,IAAIwqB,EAAQ34B,EAAGulC,KAAK0L,GACpB,IAAKtY,EACD,MAAM6yB,EAAQ,UAIlB,OAHAr9C,EAASnO,EAAGmsD,UACZr9C,EAAKy8C,GACLA,EAAc,KACP3gC,EAAS+N,EAAM,GAC1B,CA+EeyzB,GACX,IAAIC,EACA/iD,EACAgjD,EACAt6D,EACAu6D,EACJ,EAAG,CACC,GAAIp+C,IAAW3e,EACX,OAAO,KAEX,IADA68D,GAAS,EACFtB,EAAarxC,KAAK4yC,EAAOxyC,EAAO3L,KAGnC,GAFa,OAATm+C,KACErzB,IACA9qB,IAAW3e,EACb,OAAO,KAGf,GAAuB,MAAnBsqB,EAAO3L,GAAiB,CACxB,KAAMA,IAAW3e,EACb,MAAMg8D,EAAQ,WAElB,GAAuB,MAAnB1xC,EAAO3L,GACP,GAAK+8C,EAeE,CAIH,GAFAl5D,EAAQmc,EACRo+C,GAAQ,EACJV,EAAyB19C,GAAS,CAClCo+C,GAAQ,EACR,EAAG,CAEC,IADAp+C,EAAS69C,EAAc79C,MACR3e,EACX,MAEJ2e,GACJ,OAAS09C,EAAyB19C,GACtC,MACIA,EAAS/b,KAAKC,IAAI7C,EAAQw8D,EAAc79C,GAAU,GAElDo+C,GACAb,EAAW15D,EAAOmc,GAEtB8qB,IACAozB,GAAS,CACb,KApC2B,CAIvB,IAFAE,EAAuC,MAA/BzyC,EAAO9nB,EAAQmc,EAAS,GAEJ,OAArB2L,IAAS3L,IACZ,GAAIA,IAAW3e,EACX,OAAO,OAGb2e,EACEo+C,GACAb,EAAW15D,EAAOmc,EAAS,KAE7B8qB,EACFozB,GAAS,CACb,KAsBG,IAAgC,OAA3BC,EAAOxyC,EAAO3L,IAoBtB,MAAO,IAlBPnc,EAAQmc,EAAS,EACjBo+C,EAAQrB,GAA0C,MAAlBpxC,EAAO9nB,GACvC,EAAG,CAIC,GAHa,OAATs6D,KACErzB,IAEA9qB,IAAW3e,EACb,MAAMg8D,EAAQ,WAElBliD,EAAOgjD,EACPA,EAAOxyC,EAAO3L,EAClB,OAAkB,MAAT7E,GAAyB,MAATgjD,KACvBn+C,EACEo+C,GACAb,EAAW15D,EAAOmc,EAAS,GAE/Bk+C,GAAS,CAGb,CACJ,CACJ,OAASA,GAIT,IAAIp6D,EAAMkc,EAGV,GAFAs8C,EAAQ0B,UAAY,GACR1B,EAAQ/wC,KAAKI,EAAO7nB,MAE5B,KAAOA,EAAMzC,IAAWi7D,EAAQ/wC,KAAKI,EAAO7nB,OACtCA,EACV,IAAIu6D,EAAQvb,EAAOj3B,UAAU7L,EAAQA,EAASlc,GAG9C,MAFc,MAAVu6D,GAA4B,MAAVA,IAClBjB,EAAciB,GACXA,CACX,CAQA,SAAS19C,EAAK09C,GACVl1C,EAAMxI,KAAK09C,EACf,CAOA,SAASC,IACL,IAAKn1C,EAAM9nB,OAAQ,CACf,IAAIg9D,EAAQjjD,IACZ,GAAc,OAAVijD,EACA,OAAO,KACX19C,EAAK09C,EACT,CACA,OAAOl1C,EAAM,EACjB,CA8CA,OAAOnpB,OAAOqiB,eAAe,CACzBjH,KAAMA,EACNkjD,KAAMA,EACN39C,KAAMA,EACNw+B,KAxCJ,SAAcvY,EAAU5F,GACpB,IAAIrkB,EAAS2hD,IAEb,GADa3hD,IAAWiqB,EAGpB,OADAxrB,KACO,EAEX,IAAK4lB,EACD,MAAMq8B,EAAQ,UAAY1gD,EAAS,OAASiqB,EAAW,cAC3D,OAAO,CACX,EA+BI23B,KAvBJ,SAAcC,GACV,IAAI92D,EAAM,KAcV,YAbqB3F,IAAjBy8D,EACItB,IAAgBpyB,EAAO,IAAMiyB,GAAwC,MAAhBC,GAAuBG,KAC5Ez1D,EAAMu1D,IAINC,EAAcsB,GACdF,IAEApB,IAAgBsB,GAAiBrB,IAAqBJ,GAAwC,MAAhBC,IAC9Et1D,EAAMu1D,IAGPv1D,CACX,GAQG,OAAQ,CACP4a,IAAK,WAAa,OAAOwoB,CAAM,GAGvC,CArWAuxB,EAAS5/B,SAAWA,wBCrCpB,IAAI7P,EAAQjtB,EAkCZ,SAASotB,EAAMpnB,GACb,OAAoB,IAAhBA,EAAKtE,OACA,IAAMsE,EAENA,CACX,CAGA,SAASqnB,EAAM7qB,GAEb,IADA,IAAI+F,EAAM,GACD/D,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAC9B+D,GAAO6kB,EAAM5qB,EAAIgC,GAAGU,SAAS,KAC/B,OAAOqD,CACT,CAfA0kB,EAAM3nB,QA9BN,SAAiB9C,EAAKywB,GACpB,GAAIvuB,MAAMC,QAAQnC,GAChB,OAAOA,EAAI0a,QACb,IAAK1a,EACH,MAAO,GACT,IAAI+F,EAAM,GACV,GAAmB,iBAAR/F,EAAkB,CAC3B,IAAK,IAAIgC,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAC9B+D,EAAI/D,GAAc,EAAThC,EAAIgC,GACf,OAAO+D,CACT,CACA,GAAY,QAAR0qB,EAIF,KAHAzwB,EAAMA,EAAI2C,QAAQ,eAAgB,KAC1BzD,OAAS,GAAM,IACrBc,EAAM,IAAMA,GACLgC,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,GAAK,EACnC+D,EAAIyY,KAAKN,SAASle,EAAIgC,GAAKhC,EAAIgC,EAAI,GAAI,UAEzC,IAASA,EAAI,EAAGA,EAAIhC,EAAId,OAAQ8C,IAAK,CACnC,IAAIb,EAAInB,EAAIoB,WAAWY,GACnBwE,EAAKrF,GAAK,EACVuD,EAAS,IAAJvD,EACLqF,EACFT,EAAIyY,KAAKhY,EAAI9B,GAEbqB,EAAIyY,KAAK9Z,EACb,CAEF,OAAOqB,CACT,EASA0kB,EAAMG,MAAQA,EAQdH,EAAMI,MAAQA,EAEdJ,EAAMK,OAAS,SAAgB3N,EAAKsT,GAClC,MAAY,QAARA,EACK5F,EAAM1N,GAENA,CACX,0BCvDA,IAAIumB,EAAQlmC,EAEZkmC,EAAMrjC,KAAO,EAAQ,IACrBqjC,EAAMue,MAAQ,EAAQ,KACtBve,EAAM/pB,KAAO,EAAQ,KACrB+pB,EAAMwe,QAAU,EAAQ,6BCLxB,IAAIz3B,EAAQ,EAAQ,GAChB01B,EAAS,EAAQ,IACjBmc,EAAY,EAAQ,KACpBx8D,EAAS,EAAQ,GAEjBixB,EAAQtG,EAAMsG,MACdE,EAAUxG,EAAMwG,QAChBE,EAAU1G,EAAM0G,QAChBorC,EAAOD,EAAUC,KACjBC,EAAQF,EAAUE,MAClBC,EAASH,EAAUG,OACnBC,EAASJ,EAAUI,OACnBC,EAASL,EAAUK,OACnBC,EAASN,EAAUM,OAEnB7rB,EAAYoP,EAAOpP,UAEnB8rB,EAAW,CACb,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,YAGtC,SAASC,IACP,KAAMt8D,gBAAgBs8D,GACpB,OAAO,IAAIA,EAEb/rB,EAAUj5B,KAAKtX,MACfA,KAAKqR,EAAI,CACP,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,YAEtCrR,KAAKoE,EAAIi4D,EACTr8D,KAAKu8D,EAAI,IAAI76D,MAAM,GACrB,CACAuoB,EAAMvqB,SAAS48D,EAAQ/rB,GACvBtzC,EAAOD,QAAUs/D,EAEjBA,EAAO5hC,UAAY,IACnB4hC,EAAO5rB,QAAU,IACjB4rB,EAAO3rB,aAAe,IACtB2rB,EAAO1rB,UAAY,GAEnB0rB,EAAO5+D,UAAU6+B,QAAU,SAAiB/8B,EAAK0B,GAG/C,IAFA,IAAIq7D,EAAIv8D,KAAKu8D,EAEJ/6D,EAAI,EAAGA,EAAI,GAAIA,IACtB+6D,EAAE/6D,GAAKhC,EAAI0B,EAAQM,GACrB,KAAOA,EAAI+6D,EAAE79D,OAAQ8C,IACnB+6D,EAAE/6D,GAAKivB,EAAQ2rC,EAAOG,EAAE/6D,EAAI,IAAK+6D,EAAE/6D,EAAI,GAAI26D,EAAOI,EAAE/6D,EAAI,KAAM+6D,EAAE/6D,EAAI,KAEtE,IAAIwC,EAAIhE,KAAKqR,EAAE,GACXpN,EAAIjE,KAAKqR,EAAE,GACX1Q,EAAIX,KAAKqR,EAAE,GACXqf,EAAI1wB,KAAKqR,EAAE,GACX9Q,EAAIP,KAAKqR,EAAE,GACXuzB,EAAI5kC,KAAKqR,EAAE,GACXoC,EAAIzT,KAAKqR,EAAE,GACXA,EAAIrR,KAAKqR,EAAE,GAGf,IADA/R,EAAOU,KAAKoE,EAAE1F,SAAW69D,EAAE79D,QACtB8C,EAAI,EAAGA,EAAI+6D,EAAE79D,OAAQ8C,IAAK,CAC7B,IAAIg7D,EAAK7rC,EAAQtf,EAAG6qD,EAAO37D,GAAIw7D,EAAKx7D,EAAGqkC,EAAGnxB,GAAIzT,KAAKoE,EAAE5C,GAAI+6D,EAAE/6D,IACvDi7D,EAAKlsC,EAAM0rC,EAAOj4D,GAAIg4D,EAAMh4D,EAAGC,EAAGtD,IACtC0Q,EAAIoC,EACJA,EAAImxB,EACJA,EAAIrkC,EACJA,EAAIgwB,EAAMG,EAAG8rC,GACb9rC,EAAI/vB,EACJA,EAAIsD,EACJA,EAAID,EACJA,EAAIusB,EAAMisC,EAAIC,EAChB,CAEAz8D,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIrN,GAC7BhE,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIpN,GAC7BjE,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAI1Q,GAC7BX,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIqf,GAC7B1wB,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAI9Q,GAC7BP,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIuzB,GAC7B5kC,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIoC,GAC7BzT,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIA,EAC/B,EAEAirD,EAAO5+D,UAAUszC,QAAU,SAAgB/gB,GACzC,MAAY,QAARA,EACKhG,EAAMiG,QAAQlwB,KAAKqR,EAAG,OAEtB4Y,EAAMmG,QAAQpwB,KAAKqR,EAAG,MACjC,0BCtGA,IAAI4Y,EAAQ,EAAQ,GAChB01B,EAAS,EAAQ,IACjBrgD,EAAS,EAAQ,GAEjBuyB,EAAY5H,EAAM4H,UAClBC,EAAY7H,EAAM6H,UAClBC,EAAW9H,EAAM8H,SACjBC,EAAW/H,EAAM+H,SACjBpB,EAAQ3G,EAAM2G,MACdI,EAAW/G,EAAM+G,SACjBE,EAAWjH,EAAMiH,SACjBC,EAAalH,EAAMkH,WACnBK,EAAavH,EAAMuH,WACnBC,EAAaxH,EAAMwH,WACnBG,EAAa3H,EAAM2H,WAEnB2e,EAAYoP,EAAOpP,UAEnBmsB,EAAW,CACb,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGtC,SAASC,IACP,KAAM38D,gBAAgB28D,GACpB,OAAO,IAAIA,EAEbpsB,EAAUj5B,KAAKtX,MACfA,KAAKqR,EAAI,CACP,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACdrR,KAAKoE,EAAIs4D,EACT18D,KAAKu8D,EAAI,IAAI76D,MAAM,IACrB,CAwIA,SAASk7D,EAAQC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,IAAIl8D,EAAK87D,EAAKE,GAASF,EAAMI,EAG7B,OAFIl8D,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASm8D,EAAQL,EAAIC,EAAIC,EAAIC,EAAIC,EAAI1Y,GACnC,IAAIxjD,EAAK+7D,EAAKE,GAASF,EAAMvY,EAG7B,OAFIxjD,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASo8D,EAASN,EAAIC,EAAIC,EAAIC,EAAIC,GAChC,IAAIl8D,EAAK87D,EAAKE,EAAOF,EAAKI,EAAOF,EAAKE,EAGtC,OAFIl8D,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASq8D,EAASP,EAAIC,EAAIC,EAAIC,EAAIC,EAAI1Y,GACpC,IAAIxjD,EAAK+7D,EAAKE,EAAOF,EAAKvY,EAAOyY,EAAKzY,EAGtC,OAFIxjD,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASs8D,EAAUR,EAAIC,GACrB,IAII/7D,EAJQ8wB,EAAUgrC,EAAIC,EAAI,IAClBjrC,EAAUirC,EAAID,EAAI,GAClBhrC,EAAUirC,EAAID,EAAI,GAK9B,OAFI97D,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASu8D,EAAUT,EAAIC,GACrB,IAII/7D,EAJQ+wB,EAAU+qC,EAAIC,EAAI,IAClBhrC,EAAUgrC,EAAID,EAAI,GAClB/qC,EAAUgrC,EAAID,EAAI,GAK9B,OAFI97D,EAAI,IACNA,GAAK,YACAA,CACT,CAaA,SAASw8D,EAAUV,EAAIC,GACrB,IAII/7D,EAJQ+wB,EAAU+qC,EAAIC,EAAI,IAClBhrC,EAAU+qC,EAAIC,EAAI,IAClBhrC,EAAUgrC,EAAID,EAAI,GAK9B,OAFI97D,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASy8D,EAAUX,EAAIC,GACrB,IAII/7D,EAJQ8wB,EAAUgrC,EAAIC,EAAI,GAClBjrC,EAAUgrC,EAAIC,EAAI,GAClB/qC,EAAS8qC,EAAIC,EAAI,GAK7B,OAFI/7D,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS08D,EAAUZ,EAAIC,GACrB,IAII/7D,EAJQ+wB,EAAU+qC,EAAIC,EAAI,GAClBhrC,EAAU+qC,EAAIC,EAAI,GAClB9qC,EAAS6qC,EAAIC,EAAI,GAK7B,OAFI/7D,EAAI,IACNA,GAAK,YACAA,CACT,CAaA,SAAS28D,EAAUb,EAAIC,GACrB,IAII/7D,EAJQ+wB,EAAU+qC,EAAIC,EAAI,IAClBhrC,EAAUgrC,EAAID,EAAI,IAClB7qC,EAAS6qC,EAAIC,EAAI,GAK7B,OAFI/7D,EAAI,IACNA,GAAK,YACAA,CACT,CAzPAkpB,EAAMvqB,SAASi9D,EAAQpsB,GACvBtzC,EAAOD,QAAU2/D,EAEjBA,EAAOjiC,UAAY,KACnBiiC,EAAOjsB,QAAU,IACjBisB,EAAOhsB,aAAe,IACtBgsB,EAAO/rB,UAAY,IAEnB+rB,EAAOj/D,UAAUigE,cAAgB,SAAuBn+D,EAAK0B,GAI3D,IAHA,IAAIq7D,EAAIv8D,KAAKu8D,EAGJ/6D,EAAI,EAAGA,EAAI,GAAIA,IACtB+6D,EAAE/6D,GAAKhC,EAAI0B,EAAQM,GACrB,KAAOA,EAAI+6D,EAAE79D,OAAQ8C,GAAK,EAAG,CAC3B,IAAIo8D,GAsNWf,EAtNON,EAAE/6D,EAAI,GAsNTs7D,EAtNaP,EAAE/6D,EAAI,GA2NpCT,YAJQ8wB,EAAUgrC,EAAIC,EAAI,IAClBjrC,EAAUirC,EAAID,EAAI,IAClB9qC,EAAS8qC,EAAIC,EAAI,IAGrB,IACN/7D,GAAK,YACAA,GA7ND88D,EAAQH,EAAUnB,EAAE/6D,EAAI,GAAI+6D,EAAE/6D,EAAI,IAClCs8D,EAAQvB,EAAE/6D,EAAI,IACdu8D,EAAQxB,EAAE/6D,EAAI,IACdw8D,EAAQR,EAAUjB,EAAE/6D,EAAI,IAAK+6D,EAAE/6D,EAAI,KACnCy8D,EAAQR,EAAUlB,EAAE/6D,EAAI,IAAK+6D,EAAE/6D,EAAI,KACnC08D,EAAQ3B,EAAE/6D,EAAI,IACd28D,EAAQ5B,EAAE/6D,EAAI,IAElB+6D,EAAE/6D,GAAK2vB,EACLysC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,GACT5B,EAAE/6D,EAAI,GAAKgwB,EACTosC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACX,CAmMF,IAAmBtB,EAAIC,EAKjB/7D,CAvMN,EAEA47D,EAAOj/D,UAAU6+B,QAAU,SAAiB/8B,EAAK0B,GAC/ClB,KAAK29D,cAAcn+D,EAAK0B,GAExB,IAiJiB27D,EAAIC,EAKjB/7D,EAtJAw7D,EAAIv8D,KAAKu8D,EAET1rC,EAAK7wB,KAAKqR,EAAE,GACZyf,EAAK9wB,KAAKqR,EAAE,GACZ0f,EAAK/wB,KAAKqR,EAAE,GACZ4f,EAAKjxB,KAAKqR,EAAE,GACZ+f,EAAKpxB,KAAKqR,EAAE,GACZggB,EAAKrxB,KAAKqR,EAAE,GACZigB,EAAKtxB,KAAKqR,EAAE,GACZkgB,EAAKvxB,KAAKqR,EAAE,GACZqgB,EAAK1xB,KAAKqR,EAAE,GACZsgB,EAAK3xB,KAAKqR,EAAE,GACZ+sD,EAAKp+D,KAAKqR,EAAE,IACZgtD,EAAKr+D,KAAKqR,EAAE,IACZitD,EAAKt+D,KAAKqR,EAAE,IACZktD,EAAKv+D,KAAKqR,EAAE,IACZmtD,EAAKx+D,KAAKqR,EAAE,IACZszC,EAAK3kD,KAAKqR,EAAE,IAEhB/R,EAAOU,KAAKoE,EAAE1F,SAAW69D,EAAE79D,QAC3B,IAAK,IAAI8C,EAAI,EAAGA,EAAI+6D,EAAE79D,OAAQ8C,GAAK,EAAG,CACpC,IAAIo8D,EAAQY,EACRX,EAAQlZ,EACRmZ,GA+HF/8D,YAJQ8wB,EADKgrC,EA1HOnrC,EA0HHorC,EA1HOnrC,EA2HE,IAClBE,EAAUgrC,EAAIC,EAAI,IAClBjrC,EAAUirC,EAAID,EAAI,IAGtB,IACN97D,GAAK,YACAA,GAjIDg9D,EAAQR,EAAU7rC,EAAIC,GACtBqsC,EAAQpB,EAAQlrC,EAAIC,EAAIysC,EAAIC,EAAIC,GAChCL,EAAQf,EAAQxrC,EAAIC,EAAIysC,EAAIC,EAAIC,EAAIC,GACpCL,EAAQl+D,KAAKoE,EAAE5C,GACf28D,EAAQn+D,KAAKoE,EAAE5C,EAAI,GACnBi9D,EAAQlC,EAAE/6D,GACVk9D,EAAQnC,EAAE/6D,EAAI,GAEdm9D,EAAQltC,EACVmsC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPM,EAAOC,GACLE,EAAQhtC,EACVgsC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPM,EAAOC,GAETd,EAAQP,EAAUxsC,EAAIC,GACtB+sC,EAAQP,EAAUzsC,EAAIC,GACtBgtC,EAAQX,EAAStsC,EAAIC,EAAIC,EAAIE,EAAIG,GACjC2sC,EAAQX,EAASvsC,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,GAErC,IAAIwtC,EAAQ7tC,EAAS4sC,EAAOC,EAAOC,EAAOC,GACtCe,EAAQ5tC,EAAS0sC,EAAOC,EAAOC,EAAOC,GAE1CS,EAAKF,EACL3Z,EAAK4Z,EAELD,EAAKF,EACLG,EAAKF,EAELD,EAAK1sC,EACL2sC,EAAK1sC,EAELD,EAAKV,EAASM,EAAIC,EAAIotC,EAAOC,GAC7BjtC,EAAKT,EAASK,EAAIA,EAAIotC,EAAOC,GAE7BttC,EAAKF,EACLG,EAAKF,EAELD,EAAKL,EACLM,EAAKJ,EAELF,EAAKF,EACLI,EAAKH,EAELD,EAAKG,EAAS2tC,EAAOC,EAAOC,EAAOC,GACnChuC,EAAKI,EAASytC,EAAOC,EAAOC,EAAOC,EACrC,CAEAluC,EAAM5wB,KAAKqR,EAAG,EAAGwf,EAAIC,GACrBF,EAAM5wB,KAAKqR,EAAG,EAAG0f,EAAIE,GACrBL,EAAM5wB,KAAKqR,EAAG,EAAG+f,EAAIC,GACrBT,EAAM5wB,KAAKqR,EAAG,EAAGigB,EAAIC,GACrBX,EAAM5wB,KAAKqR,EAAG,EAAGqgB,EAAIC,GACrBf,EAAM5wB,KAAKqR,EAAG,GAAI+sD,EAAIC,GACtBztC,EAAM5wB,KAAKqR,EAAG,GAAIitD,EAAIC,GACtB3tC,EAAM5wB,KAAKqR,EAAG,GAAImtD,EAAI7Z,EACxB,EAEAgY,EAAOj/D,UAAUszC,QAAU,SAAgB/gB,GACzC,MAAY,QAARA,EACKhG,EAAMiG,QAAQlwB,KAAKqR,EAAG,OAEtB4Y,EAAMmG,QAAQpwB,KAAKqR,EAAG,MACjC,0BCpNA,IAAInT,EAAS,YACTy+B,EAAY,iBAShB,SAAS4lB,EAAU7nB,GACjBiC,EAAUrlB,KAAKtX,MAEfA,KAAK6gC,OAAS3iC,EAAOW,YAAY67B,GACjC16B,KAAK+gC,WAAarG,EAClB16B,KAAKmjD,aAAe,EACpBnjD,KAAKojD,QAAU,CAAC,EAAG,EAAG,EAAG,GAEzBpjD,KAAK++D,YAAa,CACpB,CAjBe,EAAQ,EAmBvBr/D,CAAS6iD,EAAU5lB,GAEnB4lB,EAAS7kD,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU+gD,GACzD,IAAIxgC,EAAQ,KACZ,IACEzf,KAAKq7B,OAAO2jC,EAAO9/D,EACrB,CAAE,MAAOk0B,GACP3T,EAAQ2T,CACV,CAEA6sB,EAASxgC,EACX,EAEA8iC,EAAS7kD,UAAUmgC,OAAS,SAAUoiB,GACpC,IAAIxgC,EAAQ,KACZ,IACEzf,KAAKge,KAAKhe,KAAKy8B,SACjB,CAAE,MAAOrJ,GACP3T,EAAQ2T,CACV,CAEA6sB,EAASxgC,EACX,EAEA8iC,EAAS7kD,UAAU29B,OAAS,SAAUlgB,EAAMjc,GAE1C,GA3CF,SAAmCK,EAAK0/D,GACtC,IAAK/gE,EAAO6c,SAASxb,IAAuB,iBAARA,EAClC,MAAM,IAAIR,UAAUkgE,oCAExB,CAsCEC,CAAyB/jD,GACrBnb,KAAK++D,WAAY,MAAM,IAAIt/D,MAAM,yBAChCvB,EAAO6c,SAASI,KAAOA,EAAOjd,EAAOS,KAAKwc,EAAMjc,IAKrD,IAFA,IAAI+hC,EAAQjhC,KAAK6gC,OACbxjB,EAAS,EACNrd,KAAKmjD,aAAehoC,EAAKzc,OAAS2e,GAAUrd,KAAK+gC,YAAY,CAClE,IAAK,IAAIv/B,EAAIxB,KAAKmjD,aAAc3hD,EAAIxB,KAAK+gC,YAAaE,EAAMz/B,KAAO2Z,EAAKkC,KACxErd,KAAKu8B,UACLv8B,KAAKmjD,aAAe,CACtB,CACA,KAAO9lC,EAASlC,EAAKzc,QAAQuiC,EAAMjhC,KAAKmjD,gBAAkBhoC,EAAKkC,KAG/D,IAAK,IAAI7a,EAAI,EAAG2B,EAAsB,EAAdgX,EAAKzc,OAAYyF,EAAQ,IAAK3B,EACpDxC,KAAKojD,QAAQ5gD,IAAM2B,GACnBA,EAASnE,KAAKojD,QAAQ5gD,GAAK,WAAgB,GAC/B,IAAGxC,KAAKojD,QAAQ5gD,IAAM,WAAe2B,GAGnD,OAAOnE,IACT,EAEAuiD,EAAS7kD,UAAU6+B,QAAU,WAC3B,MAAM,IAAI98B,MAAM,6BAClB,EAEA8iD,EAAS7kD,UAAU++B,OAAS,SAAUv9B,GACpC,GAAIc,KAAK++D,WAAY,MAAM,IAAIt/D,MAAM,yBACrCO,KAAK++D,YAAa,EAElB,IAAItiC,EAASz8B,KAAKgxC,eACD5xC,IAAbF,IAAwBu9B,EAASA,EAAOv6B,SAAShD,IAGrDc,KAAK6gC,OAAO5hC,KAAK,GACjBe,KAAKmjD,aAAe,EACpB,IAAK,IAAI3hD,EAAI,EAAGA,EAAI,IAAKA,EAAGxB,KAAKojD,QAAQ5hD,GAAK,EAE9C,OAAOi7B,CACT,EAEA8lB,EAAS7kD,UAAUszC,QAAU,WAC3B,MAAM,IAAIvxC,MAAM,6BAClB,EAEAxC,EAAOD,QAAUulD,0BCpEjB,IAAI5W,EAHJ1uC,EAAOD,QAAU4uC,EAMjBA,EAASuzB,cAAgBA,EAGhB,mBAAT,IAqBIC,EApBAC,EAAkB,SAAyBtsC,EAAS7X,GACtD,OAAO6X,EAAQsD,UAAUnb,GAAMxc,MACjC,EAIIq0D,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EASvK0lD,EAAY,EAAQ,KAGtBH,EADEG,GAAaA,EAAUh3B,SACjBg3B,EAAUh3B,SAAS,UAEnB,WAAkB,EAI5B,IAWI3L,EACA4iC,EACA7gE,EAbA8gE,EAAa,EAAQ,KACrBC,EAAc,EAAQ,IAExBC,EADa,EAAQ,IACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC84C,EAA4BvM,EAAeuM,0BAC3CC,EAA6BxM,EAAewM,2BAC5CC,EAAqCzM,EAAeyM,mCAMtD,EAAQ,EAAR,CAAoBl0B,EAAUmnB,GAC9B,IAAIgN,EAAiBL,EAAYK,eAC7BC,EAAe,CAAC,QAAS,QAAS,UAAW,QAAS,UAY1D,SAASb,EAActzC,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQs0C,oBAI7DngE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAK9EjgE,KAAK/B,OAAS,IAAIwhE,EAClBz/D,KAAKtB,OAAS,EACdsB,KAAKogE,MAAQ,KACbpgE,KAAKqgE,WAAa,EAClBrgE,KAAKsgE,QAAU,KACftgE,KAAKosC,OAAQ,EACbpsC,KAAK+jD,YAAa,EAClB/jD,KAAKugE,SAAU,EAMfvgE,KAAKkgD,MAAO,EAIZlgD,KAAKwgE,cAAe,EACpBxgE,KAAKygE,iBAAkB,EACvBzgE,KAAK0gE,mBAAoB,EACzB1gE,KAAK2gE,iBAAkB,EACvB3gE,KAAK4gE,QAAS,EAGd5gE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAKysC,WAAY,EAKjBzsC,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAGlD/gE,KAAKghE,WAAa,EAGlBhhE,KAAKihE,aAAc,EACnBjhE,KAAK+8C,QAAU,KACf/8C,KAAKd,SAAW,KACZ2sB,EAAQ3sB,WACL09B,IAAeA,EAAgB,SACpC58B,KAAK+8C,QAAU,IAAIngB,EAAc/Q,EAAQ3sB,UACzCc,KAAKd,SAAW2sB,EAAQ3sB,SAE5B,CACA,SAAS0sC,EAAS/f,GAEhB,GADA8f,EAASA,GAAU,EAAQ,MACrB3rC,gBAAgB4rC,GAAW,OAAO,IAAIA,EAAS/f,GAIrD,IAAIo0C,EAAWjgE,gBAAgB2rC,EAC/B3rC,KAAKwsC,eAAiB,IAAI2yB,EAActzC,EAAS7rB,KAAMigE,GAGvDjgE,KAAKisC,UAAW,EACZpgB,IAC0B,mBAAjBA,EAAQ7O,OAAqBhd,KAAKkhE,MAAQr1C,EAAQ7O,MAC9B,mBAApB6O,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,UAErEpO,EAAOz7C,KAAKtX,KACd,CAwDA,SAASqhE,EAAiB9d,EAAQyb,EAAO9/D,EAAUoiE,EAAYC,GAC7DnC,EAAM,mBAAoBJ,GAC1B,IAKM7oC,EALFhB,EAAQouB,EAAO/W,eACnB,GAAc,OAAVwyB,EACF7pC,EAAMorC,SAAU,EAuNpB,SAAoBhd,EAAQpuB,GAE1B,GADAiqC,EAAM,eACFjqC,EAAMiX,MAAV,CACA,GAAIjX,EAAM4nB,QAAS,CACjB,IAAIiiB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,SACjBy2B,EAAMl3B,OAAO+f,KAAKghD,GAClB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OAEjD,CACAy2B,EAAMiX,OAAQ,EACVjX,EAAM+qB,KAIRshB,EAAaje,IAGbpuB,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTtrC,EAAMsrC,iBAAkB,EACxBgB,EAAcle,IAnBK,CAsBzB,CA9OIme,CAAWne,EAAQpuB,QAInB,GADKosC,IAAgBprC,EA6CzB,SAAsBhB,EAAO6pC,GAC3B,IAAI7oC,EAjPiBrb,EAqPrB,OArPqBA,EAkPFkkD,EAjPZ9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAiPA,iBAAVN,QAAgC5/D,IAAV4/D,GAAwB7pC,EAAM+qC,aACtF/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,SAAU,cAAek4C,IAEtE7oC,CACT,CAnD8BwrC,CAAaxsC,EAAO6pC,IAC1C7oC,EACF4pC,EAAexc,EAAQptB,QAClB,GAAIhB,EAAM+qC,YAAclB,GAASA,EAAMtgE,OAAS,EAIrD,GAHqB,iBAAVsgE,GAAuB7pC,EAAM+qC,YAAc7iE,OAAO04B,eAAeipC,KAAW9gE,EAAOR,YAC5FshE,EA3MR,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CAyMgB4C,CAAoB5C,IAE1BsC,EACEnsC,EAAM4uB,WAAYgc,EAAexc,EAAQ,IAAIuc,GAA2C+B,EAASte,EAAQpuB,EAAO6pC,GAAO,QACtH,GAAI7pC,EAAMiX,MACf2zB,EAAexc,EAAQ,IAAIqc,OACtB,IAAIzqC,EAAMsX,UACf,OAAO,EAEPtX,EAAMorC,SAAU,EACZprC,EAAM4nB,UAAY79C,GACpB8/D,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,GACxB7pC,EAAM+qC,YAA+B,IAAjBlB,EAAMtgE,OAAcmjE,EAASte,EAAQpuB,EAAO6pC,GAAO,GAAY8C,EAAcve,EAAQpuB,IAE7G0sC,EAASte,EAAQpuB,EAAO6pC,GAAO,EAEnC,MACUsC,IACVnsC,EAAMorC,SAAU,EAChBuB,EAAcve,EAAQpuB,IAO1B,OAAQA,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAkC,IAAjBnX,EAAMz2B,OACtE,CACA,SAASmjE,EAASte,EAAQpuB,EAAO6pC,EAAOsC,GAClCnsC,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAiBy2B,EAAM+qB,MAChD/qB,EAAM6rC,WAAa,EACnBzd,EAAO7uB,KAAK,OAAQsqC,KAGpB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACzC4iE,EAAYnsC,EAAMl3B,OAAO02B,QAAQqqC,GAAY7pC,EAAMl3B,OAAO+f,KAAKghD,GAC/D7pC,EAAMqrC,cAAcgB,EAAaje,IAEvCue,EAAcve,EAAQpuB,EACxB,CA3GA93B,OAAOqiB,eAAeksB,EAASluC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,gBAGFxsC,KAAKwsC,eAAeC,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKwsC,iBAMVxsC,KAAKwsC,eAAeC,UAAY7uC,EAClC,IAEFguC,EAASluC,UAAUyjE,QAAUzB,EAAYyB,QACzCv1B,EAASluC,UAAUqkE,WAAarC,EAAYsC,UAC5Cp2B,EAASluC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,EAMAwY,EAASluC,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GACzC,IACIqiE,EADApsC,EAAQn1B,KAAKwsC,eAcjB,OAZKrX,EAAM+qC,WAUTqB,GAAiB,EATI,iBAAVvC,KACT9/D,EAAWA,GAAYi2B,EAAM4rC,mBACZ5rC,EAAMj2B,WACrB8/D,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,GAC3BA,EAAW,IAEbqiE,GAAiB,GAKdF,EAAiBrhE,KAAMg/D,EAAO9/D,GAAU,EAAOqiE,EACxD,EAGA31B,EAASluC,UAAUi3B,QAAU,SAAUqqC,GACrC,OAAOqC,EAAiBrhE,KAAMg/D,EAAO,MAAM,GAAM,EACnD,EA6DApzB,EAASluC,UAAUukE,SAAW,WAC5B,OAAuC,IAAhCjiE,KAAKwsC,eAAe8zB,OAC7B,EAGA10B,EAASluC,UAAUwkE,YAAc,SAAUjyC,GACpC2M,IAAeA,EAAgB,SACpC,IAAImgB,EAAU,IAAIngB,EAAc3M,GAChCjwB,KAAKwsC,eAAeuQ,QAAUA,EAE9B/8C,KAAKwsC,eAAettC,SAAWc,KAAKwsC,eAAeuQ,QAAQ79C,SAK3D,IAFA,IAAI6P,EAAI/O,KAAKwsC,eAAevuC,OAAOm8C,KAC/BqX,EAAU,GACD,OAAN1iD,GACL0iD,GAAW1U,EAAQ9iC,MAAMlL,EAAEoM,MAC3BpM,EAAIA,EAAE0J,KAKR,OAHAzY,KAAKwsC,eAAevuC,OAAOkkE,QACX,KAAZ1Q,GAAgBzxD,KAAKwsC,eAAevuC,OAAO+f,KAAKyzC,GACpDzxD,KAAKwsC,eAAe9tC,OAAS+yD,EAAQ/yD,OAC9BsB,IACT,EAGA,IAAIoiE,EAAU,WAqBd,SAASC,EAAc7yD,EAAG2lB,GACxB,OAAI3lB,GAAK,GAAsB,IAAjB2lB,EAAMz2B,QAAgBy2B,EAAMiX,MAAc,EACpDjX,EAAM+qC,WAAmB,EACzB1wD,GAAMA,EAEJ2lB,EAAMmrC,SAAWnrC,EAAMz2B,OAAey2B,EAAMl3B,OAAOm8C,KAAKj/B,KAAKzc,OAAmBy2B,EAAMz2B,QAGxF8Q,EAAI2lB,EAAMmX,gBAAenX,EAAMmX,cA5BrC,SAAiC98B,GAe/B,OAdIA,GAAK4yD,EAEP5yD,EAAI4yD,GAIJ5yD,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAEKA,CACT,CAYqD8yD,CAAwB9yD,IACvEA,GAAK2lB,EAAMz2B,OAAe8Q,EAEzB2lB,EAAMiX,MAIJjX,EAAMz2B,QAHXy2B,EAAMqrC,cAAe,EACd,GAGX,CA6HA,SAASgB,EAAaje,GACpB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,eAAgBjqC,EAAMqrC,aAAcrrC,EAAMsrC,iBAChDtrC,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTrB,EAAM,eAAgBjqC,EAAMmrC,SAC5BnrC,EAAMsrC,iBAAkB,EACxB7yC,QAAQqO,SAASwlC,EAAele,GAEpC,CACA,SAASke,EAAcle,GACrB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,gBAAiBjqC,EAAMsX,UAAWtX,EAAMz2B,OAAQy2B,EAAMiX,OACvDjX,EAAMsX,YAActX,EAAMz2B,SAAUy2B,EAAMiX,QAC7CmX,EAAO7uB,KAAK,YACZS,EAAMsrC,iBAAkB,GAS1BtrC,EAAMqrC,cAAgBrrC,EAAMmrC,UAAYnrC,EAAMiX,OAASjX,EAAMz2B,QAAUy2B,EAAMmX,cAC7Ei2B,EAAKhf,EACP,CAQA,SAASue,EAAcve,EAAQpuB,GACxBA,EAAM8rC,cACT9rC,EAAM8rC,aAAc,EACpBrzC,QAAQqO,SAASumC,EAAgBjf,EAAQpuB,GAE7C,CACA,SAASqtC,EAAejf,EAAQpuB,GAwB9B,MAAQA,EAAMorC,UAAYprC,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAiBnX,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAe,CACpH,IAAI2C,EAAM8zB,EAAMz2B,OAGhB,GAFA0gE,EAAM,wBACN7b,EAAOvmC,KAAK,GACR3b,IAAQ8zB,EAAMz2B,OAEhB,KACJ,CACAy2B,EAAM8rC,aAAc,CACtB,CAgPA,SAASwB,EAAwB3+D,GAC/B,IAAIqxB,EAAQrxB,EAAK0oC,eACjBrX,EAAMurC,kBAAoB58D,EAAK6xB,cAAc,YAAc,EACvDR,EAAMwrC,kBAAoBxrC,EAAMyrC,OAGlCzrC,EAAMmrC,SAAU,EAGPx8D,EAAK6xB,cAAc,QAAU,GACtC7xB,EAAK4+D,QAET,CACA,SAASC,EAAiB7+D,GACxBs7D,EAAM,4BACNt7D,EAAKkZ,KAAK,EACZ,CAuBA,SAAS4lD,EAAQrf,EAAQpuB,GACvBiqC,EAAM,SAAUjqC,EAAMorC,SACjBprC,EAAMorC,SACThd,EAAOvmC,KAAK,GAEdmY,EAAMwrC,iBAAkB,EACxBpd,EAAO7uB,KAAK,UACZ6tC,EAAKhf,GACDpuB,EAAMmrC,UAAYnrC,EAAMorC,SAAShd,EAAOvmC,KAAK,EACnD,CAWA,SAASulD,EAAKhf,GACZ,IAAIpuB,EAAQouB,EAAO/W,eAEnB,IADA4yB,EAAM,OAAQjqC,EAAMmrC,SACbnrC,EAAMmrC,SAA6B,OAAlB/c,EAAOvmC,SACjC,CAmHA,SAAS6lD,EAASrzD,EAAG2lB,GAEnB,OAAqB,IAAjBA,EAAMz2B,OAAqB,MAE3By2B,EAAM+qC,WAAYn7D,EAAMowB,EAAMl3B,OAAOmU,SAAkB5C,GAAKA,GAAK2lB,EAAMz2B,QAEtDqG,EAAfowB,EAAM4nB,QAAe5nB,EAAMl3B,OAAOi7B,KAAK,IAAqC,IAAxB/D,EAAMl3B,OAAOS,OAAoBy2B,EAAMl3B,OAAO+kB,QAAmBmS,EAAMl3B,OAAO8hB,OAAOoV,EAAMz2B,QACnJy2B,EAAMl3B,OAAOkkE,SAGbp9D,EAAMowB,EAAMl3B,OAAO6kE,QAAQtzD,EAAG2lB,EAAM4nB,SAE/Bh4C,GATP,IAAIA,CAUN,CACA,SAASg+D,EAAYxf,GACnB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,cAAejqC,EAAM4uB,YACtB5uB,EAAM4uB,aACT5uB,EAAMiX,OAAQ,EACdxe,QAAQqO,SAAS+mC,EAAe7tC,EAAOouB,GAE3C,CACA,SAASyf,EAAc7tC,EAAOouB,GAI5B,GAHA6b,EAAM,gBAAiBjqC,EAAM4uB,WAAY5uB,EAAMz2B,SAG1Cy2B,EAAM4uB,YAA+B,IAAjB5uB,EAAMz2B,SAC7By2B,EAAM4uB,YAAa,EACnBR,EAAOtX,UAAW,EAClBsX,EAAO7uB,KAAK,OACRS,EAAM2rC,aAAa,CAGrB,IAAImC,EAAS1f,EAAOpX,iBACf82B,GAAUA,EAAOnC,aAAemC,EAAOpf,WAC1CN,EAAO4d,SAEX,CAEJ,CASA,SAAS1kD,EAAQymD,EAAI11D,GACnB,IAAK,IAAIhM,EAAI,EAAGuM,EAAIm1D,EAAGxkE,OAAQ8C,EAAIuM,EAAGvM,IACpC,GAAI0hE,EAAG1hE,KAAOgM,EAAG,OAAOhM,EAE1B,OAAQ,CACV,CA1pBAoqC,EAASluC,UAAUsf,KAAO,SAAUxN,GAClC4vD,EAAM,OAAQ5vD,GACdA,EAAIkO,SAASlO,EAAG,IAChB,IAAI2lB,EAAQn1B,KAAKwsC,eACb22B,EAAQ3zD,EAMZ,GALU,IAANA,IAAS2lB,EAAMsrC,iBAAkB,GAK3B,IAANjxD,GAAW2lB,EAAMqrC,gBAA0C,IAAxBrrC,EAAMmX,cAAsBnX,EAAMz2B,QAAUy2B,EAAMmX,cAAgBnX,EAAMz2B,OAAS,IAAMy2B,EAAMiX,OAGlI,OAFAgzB,EAAM,qBAAsBjqC,EAAMz2B,OAAQy2B,EAAMiX,OAC3B,IAAjBjX,EAAMz2B,QAAgBy2B,EAAMiX,MAAO22B,EAAY/iE,MAAWwhE,EAAaxhE,MACpE,KAKT,GAAU,KAHVwP,EAAI6yD,EAAc7yD,EAAG2lB,KAGNA,EAAMiX,MAEnB,OADqB,IAAjBjX,EAAMz2B,QAAcqkE,EAAY/iE,MAC7B,KA0BT,IA2BI+E,EA3BAq+D,EAASjuC,EAAMqrC,aA6CnB,OA5CApB,EAAM,gBAAiBgE,IAGF,IAAjBjuC,EAAMz2B,QAAgBy2B,EAAMz2B,OAAS8Q,EAAI2lB,EAAMmX,gBAEjD8yB,EAAM,6BADNgE,GAAS,GAMPjuC,EAAMiX,OAASjX,EAAMorC,QAEvBnB,EAAM,mBADNgE,GAAS,GAEAA,IACThE,EAAM,WACNjqC,EAAMorC,SAAU,EAChBprC,EAAM+qB,MAAO,EAEQ,IAAjB/qB,EAAMz2B,SAAcy2B,EAAMqrC,cAAe,GAE7CxgE,KAAKkhE,MAAM/rC,EAAMmX,eACjBnX,EAAM+qB,MAAO,EAGR/qB,EAAMorC,UAAS/wD,EAAI6yD,EAAcc,EAAOhuC,KAInC,QADDpwB,EAAPyK,EAAI,EAASqzD,EAASrzD,EAAG2lB,GAAkB,OAE7CA,EAAMqrC,aAAerrC,EAAMz2B,QAAUy2B,EAAMmX,cAC3C98B,EAAI,IAEJ2lB,EAAMz2B,QAAU8Q,EAChB2lB,EAAM6rC,WAAa,GAEA,IAAjB7rC,EAAMz2B,SAGHy2B,EAAMiX,QAAOjX,EAAMqrC,cAAe,GAGnC2C,IAAU3zD,GAAK2lB,EAAMiX,OAAO22B,EAAY/iE,OAElC,OAAR+E,GAAc/E,KAAK00B,KAAK,OAAQ3vB,GAC7BA,CACT,EA6GA6mC,EAASluC,UAAUwjE,MAAQ,SAAU1xD,GACnCuwD,EAAe//D,KAAM,IAAI6/D,EAA2B,WACtD,EACAj0B,EAASluC,UAAU2lE,KAAO,SAAUhgE,EAAMigE,GACxC,IAAIllE,EAAM4B,KACNm1B,EAAQn1B,KAAKwsC,eACjB,OAAQrX,EAAMkrC,YACZ,KAAK,EACHlrC,EAAMirC,MAAQ/8D,EACd,MACF,KAAK,EACH8xB,EAAMirC,MAAQ,CAACjrC,EAAMirC,MAAO/8D,GAC5B,MACF,QACE8xB,EAAMirC,MAAMpiD,KAAK3a,GAGrB8xB,EAAMkrC,YAAc,EACpBjB,EAAM,wBAAyBjqC,EAAMkrC,WAAYiD,GACjD,IACIC,EADUD,IAA6B,IAAjBA,EAASniE,KAAkBkC,IAASuqB,QAAQ41C,QAAUngE,IAASuqB,QAAQ61C,OACrEC,EAARx3B,EAYpB,SAASA,IACPkzB,EAAM,SACN/7D,EAAKlC,KACP,CAdIg0B,EAAM4uB,WAAYn2B,QAAQqO,SAASsnC,GAAYnlE,EAAI00B,KAAK,MAAOywC,GACnElgE,EAAKqwB,GAAG,UACR,SAASiwC,EAAS13B,EAAU23B,GAC1BxE,EAAM,YACFnzB,IAAa7tC,GACXwlE,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EAkB5BzE,EAAM,WAEN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7B5gD,EAAKgwB,eAAe,SAAUswB,GAC9BtgD,EAAKgwB,eAAe,QAASywC,GAC7BzgE,EAAKgwB,eAAe,QAAS2wB,GAC7B3gD,EAAKgwB,eAAe,SAAUswC,GAC9BvlE,EAAIi1B,eAAe,MAAO6Y,GAC1B9tC,EAAIi1B,eAAe,MAAOqwC,GAC1BtlE,EAAIi1B,eAAe,OAAQ0wC,GAC3BC,GAAY,GAOR7uC,EAAM6rC,YAAgB39D,EAAK8oC,iBAAkB9oC,EAAK8oC,eAAe83B,WAAYH,IA/BnF,IAUA,IAAIA,EAgFN,SAAqB1lE,GACnB,OAAO,WACL,IAAI+2B,EAAQ/2B,EAAIouC,eAChB4yB,EAAM,cAAejqC,EAAM6rC,YACvB7rC,EAAM6rC,YAAY7rC,EAAM6rC,aACH,IAArB7rC,EAAM6rC,YAAoB3B,EAAgBjhE,EAAK,UACjD+2B,EAAMmrC,SAAU,EAChBiC,EAAKnkE,GAET,CACF,CA1FgB8lE,CAAY9lE,GAC1BiF,EAAKqwB,GAAG,QAASowC,GACjB,IAAIE,GAAY,EAsBhB,SAASD,EAAO/E,GACdI,EAAM,UACN,IAAIr6D,EAAM1B,EAAK4W,MAAM+kD,GACrBI,EAAM,aAAcr6D,IACR,IAARA,KAKwB,IAArBowB,EAAMkrC,YAAoBlrC,EAAMirC,QAAU/8D,GAAQ8xB,EAAMkrC,WAAa,IAAqC,IAAhC5jD,EAAQ0Y,EAAMirC,MAAO/8D,MAAkB2gE,IACpH5E,EAAM,8BAA+BjqC,EAAM6rC,YAC3C7rC,EAAM6rC,cAER5iE,EAAI+lE,QAER,CAIA,SAASngB,EAAQ7tB,GACfipC,EAAM,UAAWjpC,GACjButC,IACArgE,EAAKgwB,eAAe,QAAS2wB,GACU,IAAnCqb,EAAgBh8D,EAAM,UAAgB08D,EAAe18D,EAAM8yB,EACjE,CAMA,SAAS8tB,IACP5gD,EAAKgwB,eAAe,SAAUswB,GAC9B+f,GACF,CAEA,SAAS/f,IACPyb,EAAM,YACN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7Byf,GACF,CAEA,SAASA,IACPtE,EAAM,UACNhhE,EAAIslE,OAAOrgE,EACb,CAUA,OAvDAjF,EAAIs1B,GAAG,OAAQqwC,GAniBjB,SAAyBhxC,EAASqxC,EAAOz8C,GAGvC,GAAuC,mBAA5BoL,EAAQwD,gBAAgC,OAAOxD,EAAQwD,gBAAgB6tC,EAAOz8C,GAMpFoL,EAAQa,SAAYb,EAAQa,QAAQwwC,GAAuC1iE,MAAMC,QAAQoxB,EAAQa,QAAQwwC,IAASrxC,EAAQa,QAAQwwC,GAAOzvC,QAAQhN,GAASoL,EAAQa,QAAQwwC,GAAS,CAACz8C,EAAIoL,EAAQa,QAAQwwC,IAA5JrxC,EAAQW,GAAG0wC,EAAOz8C,EACrE,CAqjBE4O,CAAgBlzB,EAAM,QAAS2gD,GAO/B3gD,EAAKyvB,KAAK,QAASmxB,GAMnB5gD,EAAKyvB,KAAK,SAAU6wB,GAOpBtgD,EAAKqxB,KAAK,OAAQt2B,GAGb+2B,EAAMmrC,UACTlB,EAAM,eACNhhE,EAAIskE,UAECr/D,CACT,EAYAuoC,EAASluC,UAAUgmE,OAAS,SAAUrgE,GACpC,IAAI8xB,EAAQn1B,KAAKwsC,eACbo3B,EAAa,CACfC,YAAY,GAId,GAAyB,IAArB1uC,EAAMkrC,WAAkB,OAAOrgE,KAGnC,GAAyB,IAArBm1B,EAAMkrC,WAER,OAAIh9D,GAAQA,IAAS8xB,EAAMirC,QACtB/8D,IAAMA,EAAO8xB,EAAMirC,OAGxBjrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EACZj9D,GAAMA,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAPK5jE,KAa3C,IAAKqD,EAAM,CAET,IAAIghE,EAAQlvC,EAAMirC,MACd/+D,EAAM8zB,EAAMkrC,WAChBlrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EAChB,IAAK,IAAI9+D,EAAI,EAAGA,EAAIH,EAAKG,IAAK6iE,EAAM7iE,GAAGkzB,KAAK,SAAU10B,KAAM,CAC1D6jE,YAAY,IAEd,OAAO7jE,IACT,CAGA,IAAIU,EAAQ+b,EAAQ0Y,EAAMirC,MAAO/8D,GACjC,OAAe,IAAX3C,IACJy0B,EAAMirC,MAAMplC,OAAOt6B,EAAO,GAC1By0B,EAAMkrC,YAAc,EACK,IAArBlrC,EAAMkrC,aAAkBlrC,EAAMirC,MAAQjrC,EAAMirC,MAAM,IACtD/8D,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAJD5jE,IAM3B,EAIA4rC,EAASluC,UAAUg2B,GAAK,SAAU4wC,EAAI38C,GACpC,IAAIpiB,EAAMwtD,EAAOr1D,UAAUg2B,GAAGpc,KAAKtX,KAAMskE,EAAI38C,GACzCwN,EAAQn1B,KAAKwsC,eAqBjB,MApBW,SAAP83B,GAGFnvC,EAAMurC,kBAAoB1gE,KAAK21B,cAAc,YAAc,GAGrC,IAAlBR,EAAMmrC,SAAmBtgE,KAAK0iE,UAClB,aAAP4B,IACJnvC,EAAM4uB,YAAe5uB,EAAMurC,oBAC9BvrC,EAAMurC,kBAAoBvrC,EAAMqrC,cAAe,EAC/CrrC,EAAMmrC,SAAU,EAChBnrC,EAAMsrC,iBAAkB,EACxBrB,EAAM,cAAejqC,EAAMz2B,OAAQy2B,EAAMorC,SACrCprC,EAAMz2B,OACR8iE,EAAaxhE,MACHm1B,EAAMorC,SAChB3yC,QAAQqO,SAAS0mC,EAAkB3iE,QAIlCuF,CACT,EACAqmC,EAASluC,UAAU44B,YAAcsV,EAASluC,UAAUg2B,GACpDkY,EAASluC,UAAU21B,eAAiB,SAAUixC,EAAI38C,GAChD,IAAIpiB,EAAMwtD,EAAOr1D,UAAU21B,eAAe/b,KAAKtX,KAAMskE,EAAI38C,GAUzD,MATW,aAAP28C,GAOF12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EACAqmC,EAASluC,UAAUm5B,mBAAqB,SAAUytC,GAChD,IAAI/+D,EAAMwtD,EAAOr1D,UAAUm5B,mBAAmB5X,MAAMjf,KAAMyb,WAU1D,MATW,aAAP6oD,QAA4BllE,IAAPklE,GAOvB12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EAqBAqmC,EAASluC,UAAUglE,OAAS,WAC1B,IAAIvtC,EAAQn1B,KAAKwsC,eAUjB,OATKrX,EAAMmrC,UACTlB,EAAM,UAINjqC,EAAMmrC,SAAWnrC,EAAMurC,kBAM3B,SAAgBnd,EAAQpuB,GACjBA,EAAMwrC,kBACTxrC,EAAMwrC,iBAAkB,EACxB/yC,QAAQqO,SAAS2mC,EAASrf,EAAQpuB,GAEtC,CAVIutC,CAAO1iE,KAAMm1B,IAEfA,EAAMyrC,QAAS,EACR5gE,IACT,EAiBA4rC,EAASluC,UAAUymE,MAAQ,WAQzB,OAPA/E,EAAM,wBAAyBp/D,KAAKwsC,eAAe8zB,UACf,IAAhCtgE,KAAKwsC,eAAe8zB,UACtBlB,EAAM,SACNp/D,KAAKwsC,eAAe8zB,SAAU,EAC9BtgE,KAAK00B,KAAK,UAEZ10B,KAAKwsC,eAAeo0B,QAAS,EACtB5gE,IACT,EAUA4rC,EAASluC,UAAU6mE,KAAO,SAAUhhB,GAClC,IAAIgS,EAAQv1D,KACRm1B,EAAQn1B,KAAKwsC,eACbo0B,GAAS,EAwBb,IAAK,IAAIp/D,KAvBT+hD,EAAO7vB,GAAG,OAAO,WAEf,GADA0rC,EAAM,eACFjqC,EAAM4nB,UAAY5nB,EAAMiX,MAAO,CACjC,IAAI4yB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,QAAQ62D,EAAMv3C,KAAKghD,EACxC,CACAzJ,EAAMv3C,KAAK,KACb,IACAulC,EAAO7vB,GAAG,QAAQ,SAAUsrC,GAC1BI,EAAM,gBACFjqC,EAAM4nB,UAASiiB,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,IAG3C7pC,EAAM+qC,YAAc,MAAClB,IAAyD7pC,EAAM+qC,YAAgBlB,GAAUA,EAAMtgE,UAC9G62D,EAAMv3C,KAAKghD,KAEnB4B,GAAS,EACTrd,EAAO4gB,SAEX,IAIc5gB,OACInkD,IAAZY,KAAKwB,IAAyC,mBAAd+hD,EAAO/hD,KACzCxB,KAAKwB,GAAK,SAAoBuqC,GAC5B,OAAO,WACL,OAAOwX,EAAOxX,GAAQ9sB,MAAMskC,EAAQ9nC,UACtC,CACF,CAJU,CAIRja,IAKN,IAAK,IAAIgO,EAAI,EAAGA,EAAIwwD,EAAathE,OAAQ8Q,IACvC+zC,EAAO7vB,GAAGssC,EAAaxwD,GAAIxP,KAAK00B,KAAKW,KAAKr1B,KAAMggE,EAAaxwD,KAY/D,OAPAxP,KAAKkhE,MAAQ,SAAU1xD,GACrB4vD,EAAM,gBAAiB5vD,GACnBoxD,IACFA,GAAS,EACTrd,EAAOmf,SAEX,EACO1iE,IACT,EACsB,mBAAXwZ,SACToyB,EAASluC,UAAU8b,OAAOgrD,eAAiB,WAIzC,YAH0CplE,IAAtCogE,IACFA,EAAoC,EAAQ,MAEvCA,EAAkCx/D,KAC3C,GAEF3C,OAAOqiB,eAAeksB,EAASluC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAeF,aAC7B,IAEFjvC,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAevuC,MACpD,IAEFZ,OAAOqiB,eAAeksB,EAASluC,UAAW,kBAAmB,CAI3DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe8zB,OAC7B,EACApgD,IAAK,SAAaiV,GACZn1B,KAAKwsC,iBACPxsC,KAAKwsC,eAAe8zB,QAAUnrC,EAElC,IAIFyW,EAAS64B,UAAY5B,EACrBxlE,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe9tC,MAC7B,IA+CoB,mBAAX8a,SACToyB,EAASjtC,KAAO,SAAU+lE,EAAU/+B,GAIlC,YAHavmC,IAATT,IACFA,EAAO,EAAQ,MAEVA,EAAKitC,EAAU84B,EAAU/+B,EAClC,qBCx8BF,SAASg/B,EAAoB7gE,EAAMsvB,GACjCwxC,EAAY9gE,EAAMsvB,GAClByxC,EAAY/gE,EACd,CACA,SAAS+gE,EAAY/gE,GACfA,EAAKqoC,iBAAmBroC,EAAKqoC,eAAe00B,WAC5C/8D,EAAK0oC,iBAAmB1oC,EAAK0oC,eAAeq0B,WAChD/8D,EAAK4wB,KAAK,QACZ,CAkBA,SAASkwC,EAAY9gE,EAAMsvB,GACzBtvB,EAAK4wB,KAAK,QAAStB,EACrB,CAYAn2B,EAAOD,QAAU,CACfmkE,QAzFF,SAAiB/tC,EAAK2I,GACpB,IAAIw5B,EAAQv1D,KACR8kE,EAAoB9kE,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAeC,UAC/Ds4B,EAAoB/kE,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeM,UACnE,OAAIq4B,GAAqBC,GACnBhpC,EACFA,EAAG3I,GACMA,IACJpzB,KAAKmsC,eAEEnsC,KAAKmsC,eAAe64B,eAC9BhlE,KAAKmsC,eAAe64B,cAAe,EACnCp3C,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAHpCxF,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAMjCpzB,OAMLA,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,GAI9BzsC,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,GAElCzsC,KAAKohE,SAAShuC,GAAO,MAAM,SAAUA,IAC9B2I,GAAM3I,EACJmiC,EAAMppB,eAECopB,EAAMppB,eAAe64B,aAI/Bp3C,QAAQqO,SAAS4oC,EAAatP,IAH9BA,EAAMppB,eAAe64B,cAAe,EACpCp3C,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,IAH7CxF,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,GAOtC2I,GACTnO,QAAQqO,SAAS4oC,EAAatP,GAC9Bx5B,EAAG3I,IAEHxF,QAAQqO,SAAS4oC,EAAatP,EAElC,IACOv1D,KACT,EA2CEgiE,UAjCF,WACMhiE,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,EAChCzsC,KAAKwsC,eAAe+zB,SAAU,EAC9BvgE,KAAKwsC,eAAeJ,OAAQ,EAC5BpsC,KAAKwsC,eAAeuX,YAAa,GAE/B/jD,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,EAChCzsC,KAAKmsC,eAAeC,OAAQ,EAC5BpsC,KAAKmsC,eAAe84B,QAAS,EAC7BjlE,KAAKmsC,eAAe+4B,aAAc,EAClCllE,KAAKmsC,eAAeg5B,aAAc,EAClCnlE,KAAKmsC,eAAe0X,UAAW,EAC/B7jD,KAAKmsC,eAAe64B,cAAe,EAEvC,EAkBEjF,eAdF,SAAwBxc,EAAQnwB,GAO9B,IAAIgyC,EAAS7hB,EAAO/W,eAChBy2B,EAAS1f,EAAOpX,eAChBi5B,GAAUA,EAAOtE,aAAemC,GAAUA,EAAOnC,YAAavd,EAAO4d,QAAQ/tC,GAAUmwB,EAAO7uB,KAAK,QAAStB,EAClH,2BCxFA,IAAIiyC,EAAwB,8BAiB5BpoE,EAAOD,QAAU,CACf2iE,iBAdF,SAA0BxqC,EAAOtJ,EAASy5C,EAAWrF,GACnD,IAAIsF,EAJN,SAA2B15C,EAASo0C,EAAUqF,GAC5C,OAAgC,MAAzBz5C,EAAQygB,cAAwBzgB,EAAQygB,cAAgB2zB,EAAWp0C,EAAQy5C,GAAa,IACjG,CAEYE,CAAkB35C,EAASo0C,EAAUqF,GAC/C,GAAW,MAAPC,EAAa,CACf,IAAMxkD,SAASwkD,IAAQjkE,KAAKylB,MAAMw+C,KAASA,GAAQA,EAAM,EAEvD,MAAM,IAAIF,EADCpF,EAAWqF,EAAY,gBACIC,GAExC,OAAOjkE,KAAKylB,MAAMw+C,EACpB,CAGA,OAAOpwC,EAAM+qC,WAAa,GAAK,KACjC,2BCqBA,SAASuF,EAActwC,GACrB,IAAIogC,EAAQv1D,KACZA,KAAKyY,KAAO,KACZzY,KAAK0lE,MAAQ,KACb1lE,KAAK47C,OAAS,YA6iBhB,SAAwB+pB,EAASxwC,EAAO/B,GACtC,IAAIsyC,EAAQC,EAAQD,MAEpB,IADAC,EAAQD,MAAQ,KACTA,GAAO,CACZ,IAAI3pC,EAAK2pC,EAAMzlB,SACf9qB,EAAMywC,YACN7pC,EAljBA8pC,WAmjBAH,EAAQA,EAAMjtD,IAChB,CAGA0c,EAAM2wC,mBAAmBrtD,KAAOktD,CAClC,CAxjBIE,CAAetQ,EAAOpgC,EACxB,CACF,CAIA,IAAIwW,EAvBJ1uC,EAAOD,QAAU6uC,EA0BjBA,EAASk6B,cAAgBA,EAGzB,IA+JIC,EA/JAC,EAAe,CACjBjhC,UAAW,EAAQ,KAKjB+tB,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EAOvK6lD,EAAc,EAAQ,IAExBC,EADa,EAAQ,IACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC+4C,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvCC,EAAyB9S,EAAe8S,uBACxCC,EAAuB/S,EAAe+S,qBACtCC,EAAyBhT,EAAegT,uBACxCC,EAA6BjT,EAAeiT,2BAC5CC,EAAuBlT,EAAekT,qBACpCxG,EAAiBL,EAAYK,eAEjC,SAASyG,IAAO,CAChB,SAAST,EAAcl6C,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQ46C,oBAK7DzmE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAG9EjgE,KAAKklE,aAAc,EAGnBllE,KAAKikE,WAAY,EAEjBjkE,KAAKilE,QAAS,EAEdjlE,KAAKosC,OAAQ,EAEbpsC,KAAK6jD,UAAW,EAGhB7jD,KAAKysC,WAAY,EAKjB,IAAIi6B,GAAqC,IAA1B76C,EAAQ86C,cACvB3mE,KAAK2mE,eAAiBD,EAKtB1mE,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAKlD/gE,KAAKtB,OAAS,EAGdsB,KAAK4mE,SAAU,EAGf5mE,KAAK6mE,OAAS,EAMd7mE,KAAKkgD,MAAO,EAKZlgD,KAAK8mE,kBAAmB,EAGxB9mE,KAAK+mE,QAAU,SAAU5wC,IAsQ3B,SAAiBotB,EAAQptB,GACvB,IAAIhB,EAAQouB,EAAOpX,eACf+T,EAAO/qB,EAAM+qB,KACbnkB,EAAK5G,EAAM6xC,QACf,GAAkB,mBAAPjrC,EAAmB,MAAM,IAAImqC,EAExC,GAZF,SAA4B/wC,GAC1BA,EAAMyxC,SAAU,EAChBzxC,EAAM6xC,QAAU,KAChB7xC,EAAMz2B,QAAUy2B,EAAM8xC,SACtB9xC,EAAM8xC,SAAW,CACnB,CAMEC,CAAmB/xC,GACfgB,GAlCN,SAAsBotB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,KAC3C5G,EAAMywC,UACJ1lB,GAGFtyB,QAAQqO,SAASF,EAAI5F,GAGrBvI,QAAQqO,SAASkrC,EAAa5jB,EAAQpuB,GACtCouB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,KAIvB4F,EAAG5F,GACHotB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,GAGvBgxC,EAAY5jB,EAAQpuB,GAExB,CAaUiyC,CAAa7jB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,OAAS,CAErD,IAAI8nB,EAAWwjB,EAAWlyC,IAAUouB,EAAO9W,UACtCoX,GAAa1uB,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBACjEC,EAAYhkB,EAAQpuB,GAElB+qB,EACFtyB,QAAQqO,SAASurC,EAAYjkB,EAAQpuB,EAAO0uB,EAAU9nB,GAEtDyrC,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,EAExC,CACF,CAvRIgrC,CAAQxjB,EAAQptB,EAClB,EAGAn2B,KAAKgnE,QAAU,KAGfhnE,KAAKinE,SAAW,EAChBjnE,KAAKsnE,gBAAkB,KACvBtnE,KAAKynE,oBAAsB,KAI3BznE,KAAK4lE,UAAY,EAIjB5lE,KAAKmlE,aAAc,EAGnBnlE,KAAKglE,cAAe,EAGpBhlE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAK0nE,qBAAuB,EAI5B1nE,KAAK8lE,mBAAqB,IAAIL,EAAczlE,KAC9C,CAqCA,SAAS6rC,EAAShgB,GAahB,IAAIo0C,EAAWjgE,gBAZf2rC,EAASA,GAAU,EAAQ,KAa3B,IAAKs0B,IAAa+F,EAAgB1uD,KAAKu0B,EAAU7rC,MAAO,OAAO,IAAI6rC,EAAShgB,GAC5E7rB,KAAKmsC,eAAiB,IAAI45B,EAAcl6C,EAAS7rB,KAAMigE,GAGvDjgE,KAAKlC,UAAW,EACZ+tB,IAC2B,mBAAlBA,EAAQ5R,QAAsBja,KAAK2nE,OAAS97C,EAAQ5R,OACjC,mBAAnB4R,EAAQ+7C,SAAuB5nE,KAAK6nE,QAAUh8C,EAAQ+7C,QAClC,mBAApB/7C,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,SACtC,mBAAlBt1C,EAAQmR,QAAsBh9B,KAAKw8B,OAAS3Q,EAAQmR,QAEjE+1B,EAAOz7C,KAAKtX,KACd,CAgIA,SAAS8nE,EAAQvkB,EAAQpuB,EAAOyyC,EAAQvmE,EAAK29D,EAAO9/D,EAAU68B,GAC5D5G,EAAM8xC,SAAW5lE,EACjB8zB,EAAM6xC,QAAUjrC,EAChB5G,EAAMyxC,SAAU,EAChBzxC,EAAM+qB,MAAO,EACT/qB,EAAMsX,UAAWtX,EAAM4xC,QAAQ,IAAIX,EAAqB,UAAmBwB,EAAQrkB,EAAOskB,QAAQ7I,EAAO7pC,EAAM4xC,SAAcxjB,EAAOokB,OAAO3I,EAAO9/D,EAAUi2B,EAAM4xC,SACtK5xC,EAAM+qB,MAAO,CACf,CAgDA,SAASsnB,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,GACtC8nB,GASP,SAAsBN,EAAQpuB,GACP,IAAjBA,EAAMz2B,QAAgBy2B,EAAM8uC,YAC9B9uC,EAAM8uC,WAAY,EAClB1gB,EAAO7uB,KAAK,SAEhB,CAdiBqzC,CAAaxkB,EAAQpuB,GACpCA,EAAMywC,YACN7pC,IACAorC,EAAY5jB,EAAQpuB,EACtB,CAaA,SAASoyC,EAAYhkB,EAAQpuB,GAC3BA,EAAM2xC,kBAAmB,EACzB,IAAIpB,EAAQvwC,EAAMmyC,gBAClB,GAAI/jB,EAAOskB,SAAWnC,GAASA,EAAMjtD,KAAM,CAEzC,IAAI1K,EAAIonB,EAAMuyC,qBACVzpE,EAAS,IAAIyD,MAAMqM,GACnBi6D,EAAS7yC,EAAM2wC,mBACnBkC,EAAOtC,MAAQA,EAGf,IAFA,IAAI7wC,EAAQ,EACRozC,GAAa,EACVvC,GACLznE,EAAO42B,GAAS6wC,EACXA,EAAMwC,QAAOD,GAAa,GAC/BvC,EAAQA,EAAMjtD,KACdoc,GAAS,EAEX52B,EAAOgqE,WAAaA,EACpBH,EAAQvkB,EAAQpuB,GAAO,EAAMA,EAAMz2B,OAAQT,EAAQ,GAAI+pE,EAAOpsB,QAI9DzmB,EAAMywC,YACNzwC,EAAMsyC,oBAAsB,KACxBO,EAAOvvD,MACT0c,EAAM2wC,mBAAqBkC,EAAOvvD,KAClCuvD,EAAOvvD,KAAO,MAEd0c,EAAM2wC,mBAAqB,IAAIL,EAActwC,GAE/CA,EAAMuyC,qBAAuB,CAC/B,KAAO,CAEL,KAAOhC,GAAO,CACZ,IAAI1G,EAAQ0G,EAAM1G,MACd9/D,EAAWwmE,EAAMxmE,SACjB68B,EAAK2pC,EAAMzlB,SASf,GAPA6nB,EAAQvkB,EAAQpuB,GAAO,EADbA,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACJsgE,EAAO9/D,EAAU68B,GACpD2pC,EAAQA,EAAMjtD,KACd0c,EAAMuyC,uBAKFvyC,EAAMyxC,QACR,KAEJ,CACc,OAAVlB,IAAgBvwC,EAAMsyC,oBAAsB,KAClD,CACAtyC,EAAMmyC,gBAAkB5B,EACxBvwC,EAAM2xC,kBAAmB,CAC3B,CAoCA,SAASO,EAAWlyC,GAClB,OAAOA,EAAM8vC,QAA2B,IAAjB9vC,EAAMz2B,QAA0C,OAA1By2B,EAAMmyC,kBAA6BnyC,EAAM0uB,WAAa1uB,EAAMyxC,OAC3G,CACA,SAASuB,EAAU5kB,EAAQpuB,GACzBouB,EAAO/mB,QAAO,SAAUpJ,GACtB+B,EAAMywC,YACFxyC,GACF2sC,EAAexc,EAAQnwB,GAEzB+B,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,aACZyyC,EAAY5jB,EAAQpuB,EACtB,GACF,CAaA,SAASgyC,EAAY5jB,EAAQpuB,GAC3B,IAAIizC,EAAOf,EAAWlyC,GACtB,GAAIizC,IAdN,SAAmB7kB,EAAQpuB,GACpBA,EAAMgwC,aAAgBhwC,EAAM+vC,cACF,mBAAlB3hB,EAAO/mB,QAA0BrH,EAAMsX,WAKhDtX,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,eALZS,EAAMywC,YACNzwC,EAAM+vC,aAAc,EACpBt3C,QAAQqO,SAASksC,EAAW5kB,EAAQpuB,IAM1C,CAIIkzC,CAAU9kB,EAAQpuB,GACM,IAApBA,EAAMywC,YACRzwC,EAAM0uB,UAAW,EACjBN,EAAO7uB,KAAK,UACRS,EAAM2rC,cAAa,CAGrB,IAAIsE,EAAS7hB,EAAO/W,iBACf44B,GAAUA,EAAOtE,aAAesE,EAAOrhB,aAC1CR,EAAO4d,SAEX,CAGJ,OAAOiH,CACT,CAxfA,EAAQ,EAAR,CAAoBv8B,EAAUknB,GA4G9BgT,EAAcroE,UAAU6uC,UAAY,WAGlC,IAFA,IAAItzB,EAAUjZ,KAAKsnE,gBACfvjE,EAAM,GACHkV,GACLlV,EAAIia,KAAK/E,GACTA,EAAUA,EAAQR,KAEpB,OAAO1U,CACT,EACA,WACE,IACE1G,OAAOqiB,eAAeqmD,EAAcroE,UAAW,SAAU,CACvDiiB,IAAKsmD,EAAajhC,WAAU,WAC1B,OAAOhlC,KAAKusC,WACd,GAAG,6EAAmF,YAE1F,CAAE,MAAOr8B,GAAI,CACd,CARD,GAasB,mBAAXsJ,QAAyBA,OAAO8uD,aAAiE,mBAA3C/1C,SAAS70B,UAAU8b,OAAO8uD,cACzFtC,EAAkBzzC,SAAS70B,UAAU8b,OAAO8uD,aAC5CjrE,OAAOqiB,eAAemsB,EAAUryB,OAAO8uD,YAAa,CAClD1qE,MAAO,SAAe0qB,GACpB,QAAI09C,EAAgB1uD,KAAKtX,KAAMsoB,IAC3BtoB,OAAS6rC,GACNvjB,GAAUA,EAAO6jB,0BAA0B45B,CACpD,KAGFC,EAAkB,SAAyB19C,GACzC,OAAOA,aAAkBtoB,IAC3B,EA+BF6rC,EAASnuC,UAAU2lE,KAAO,WACxBtD,EAAe//D,KAAM,IAAImmE,EAC3B,EAyBAt6B,EAASnuC,UAAUuc,MAAQ,SAAU+kD,EAAO9/D,EAAU68B,GACpD,IAzNqBjhB,EAyNjBqa,EAAQn1B,KAAKmsC,eACbpnC,GAAM,EACNmjE,GAAS/yC,EAAM+qC,aA3NEplD,EA2N0BkkD,EA1NxC9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAwO9C,OAbI4I,IAAUhqE,EAAO6c,SAASikD,KAC5BA,EAhOJ,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CA8NY4C,CAAoB5C,IAEN,mBAAb9/D,IACT68B,EAAK78B,EACLA,EAAW,MAETgpE,EAAOhpE,EAAW,SAAmBA,IAAUA,EAAWi2B,EAAM4rC,iBAClD,mBAAPhlC,IAAmBA,EAAKyqC,GAC/BrxC,EAAM8vC,OArCZ,SAAuB1hB,EAAQxnB,GAC7B,IAAI5F,EAAK,IAAImwC,EAEbvG,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,EACvB,CAgCoBoyC,CAAcvoE,KAAM+7B,IAAamsC,GA3BrD,SAAoB3kB,EAAQpuB,EAAO6pC,EAAOjjC,GACxC,IAAI5F,EAMJ,OALc,OAAV6oC,EACF7oC,EAAK,IAAIkwC,EACiB,iBAAVrH,GAAuB7pC,EAAM+qC,aAC7C/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,UAAWk4C,KAE3D7oC,IACF4pC,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,IACd,EAGX,CAc8DqyC,CAAWxoE,KAAMm1B,EAAO6pC,EAAOjjC,MACzF5G,EAAMywC,YACN7gE,EAiDJ,SAAuBw+C,EAAQpuB,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,GAC5D,IAAKmsC,EAAO,CACV,IAAIO,EArBR,SAAqBtzC,EAAO6pC,EAAO9/D,GAIjC,OAHKi2B,EAAM+qC,aAAsC,IAAxB/qC,EAAMwxC,eAA4C,iBAAV3H,IAC/DA,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,IAEtB8/D,CACT,CAgBmB0J,CAAYvzC,EAAO6pC,EAAO9/D,GACrC8/D,IAAUyJ,IACZP,GAAQ,EACRhpE,EAAW,SACX8/D,EAAQyJ,EAEZ,CACA,IAAIpnE,EAAM8zB,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACvCy2B,EAAMz2B,QAAU2C,EAChB,IAAI0D,EAAMowB,EAAMz2B,OAASy2B,EAAMmX,cAG/B,GADKvnC,IAAKowB,EAAM8uC,WAAY,GACxB9uC,EAAMyxC,SAAWzxC,EAAM0xC,OAAQ,CACjC,IAAI5jD,EAAOkS,EAAMsyC,oBACjBtyC,EAAMsyC,oBAAsB,CAC1BzI,MAAOA,EACP9/D,SAAUA,EACVgpE,MAAOA,EACPjoB,SAAUlkB,EACVtjB,KAAM,MAEJwK,EACFA,EAAKxK,KAAO0c,EAAMsyC,oBAElBtyC,EAAMmyC,gBAAkBnyC,EAAMsyC,oBAEhCtyC,EAAMuyC,sBAAwB,CAChC,MACEI,EAAQvkB,EAAQpuB,GAAO,EAAO9zB,EAAK29D,EAAO9/D,EAAU68B,GAEtD,OAAOh3B,CACT,CAlFU4jE,CAAc3oE,KAAMm1B,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,IAEpDh3B,CACT,EACA8mC,EAASnuC,UAAUkrE,KAAO,WACxB5oE,KAAKmsC,eAAe06B,QACtB,EACAh7B,EAASnuC,UAAUmrE,OAAS,WAC1B,IAAI1zC,EAAQn1B,KAAKmsC,eACbhX,EAAM0xC,SACR1xC,EAAM0xC,SACD1xC,EAAMyxC,SAAYzxC,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBAAiBC,EAAYvnE,KAAMm1B,GAE/G,EACA0W,EAASnuC,UAAUorE,mBAAqB,SAA4B5pE,GAGlE,GADwB,iBAAbA,IAAuBA,EAAWA,EAAS2c,iBAChD,CAAC,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOY,SAASvd,EAAW,IAAI2c,gBAAkB,GAAI,MAAM,IAAI0qD,EAAqBrnE,GAExL,OADAc,KAAKmsC,eAAe40B,gBAAkB7hE,EAC/Bc,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAQFlvC,OAAOqiB,eAAemsB,EAASnuC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAuKFT,EAASnuC,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACrDA,EAAG,IAAI8jC,EAA2B,YACpC,EACAh0B,EAASnuC,UAAUmqE,QAAU,KAC7Bh8B,EAASnuC,UAAUyD,IAAM,SAAU69D,EAAO9/D,EAAU68B,GAClD,IAAI5G,EAAQn1B,KAAKmsC,eAmBjB,MAlBqB,mBAAV6yB,GACTjjC,EAAKijC,EACLA,EAAQ,KACR9/D,EAAW,MACkB,mBAAbA,IAChB68B,EAAK78B,EACLA,EAAW,MAET8/D,SAAuCh/D,KAAKia,MAAM+kD,EAAO9/D,GAGzDi2B,EAAM0xC,SACR1xC,EAAM0xC,OAAS,EACf7mE,KAAK6oE,UAIF1zC,EAAM8vC,QAyDb,SAAqB1hB,EAAQpuB,EAAO4G,GAClC5G,EAAM8vC,QAAS,EACfkC,EAAY5jB,EAAQpuB,GAChB4G,IACE5G,EAAM0uB,SAAUj2B,QAAQqO,SAASF,GAASwnB,EAAOzwB,KAAK,SAAUiJ,IAEtE5G,EAAMiX,OAAQ,EACdmX,EAAOzlD,UAAW,CACpB,CAjEqBirE,CAAY/oE,KAAMm1B,EAAO4G,GACrC/7B,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAqEFrB,OAAOqiB,eAAemsB,EAASnuC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKmsC,gBAGFnsC,KAAKmsC,eAAeM,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKmsC,iBAMVnsC,KAAKmsC,eAAeM,UAAY7uC,EAClC,IAEFiuC,EAASnuC,UAAUyjE,QAAUzB,EAAYyB,QACzCt1B,EAASnuC,UAAUqkE,WAAarC,EAAYsC,UAC5Cn2B,EAASnuC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,0BC/jBAn2B,EAAOD,QAAU2/B,EACjB,IAAI02B,EAAiB,QACnBwM,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvC8C,EAAqC3V,EAAe2V,mCACpDC,EAA8B5V,EAAe4V,4BAC3Ct9B,EAAS,EAAQ,IAErB,SAASu9B,EAAe/yC,EAAIhb,GAC1B,IAAIguD,EAAKnpE,KAAKopE,gBACdD,EAAGE,cAAe,EAClB,IAAIttC,EAAKotC,EAAGnC,QACZ,GAAW,OAAPjrC,EACF,OAAO/7B,KAAK00B,KAAK,QAAS,IAAIwxC,GAEhCiD,EAAGG,WAAa,KAChBH,EAAGnC,QAAU,KACD,MAAR7rD,GAEFnb,KAAKge,KAAK7C,GACZ4gB,EAAG5F,GACH,IAAIozC,EAAKvpE,KAAKwsC,eACd+8B,EAAGhJ,SAAU,GACTgJ,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBACpCtsC,KAAKkhE,MAAMqI,EAAGj9B,cAElB,CACA,SAAS3P,EAAU9Q,GACjB,KAAM7rB,gBAAgB28B,GAAY,OAAO,IAAIA,EAAU9Q,GACvD8f,EAAOr0B,KAAKtX,KAAM6rB,GAClB7rB,KAAKopE,gBAAkB,CACrBF,eAAgBA,EAAe7zC,KAAKr1B,MACpCwpE,eAAe,EACfH,cAAc,EACdrC,QAAS,KACTsC,WAAY,KACZG,cAAe,MAIjBzpE,KAAKwsC,eAAeg0B,cAAe,EAKnCxgE,KAAKwsC,eAAe0T,MAAO,EACvBr0B,IAC+B,mBAAtBA,EAAQrd,YAA0BxO,KAAK49B,WAAa/R,EAAQrd,WAC1C,mBAAlBqd,EAAQ69C,QAAsB1pE,KAAK69B,OAAShS,EAAQ69C,QAIjE1pE,KAAK0zB,GAAG,YAAa20C,EACvB,CACA,SAASA,IACP,IAAI9S,EAAQv1D,KACe,mBAAhBA,KAAK69B,QAA0B79B,KAAKwsC,eAAeC,UAK5D3O,EAAK99B,KAAM,KAAM,MAJjBA,KAAK69B,QAAO,SAAU1H,EAAIhb,GACxB2iB,EAAKy3B,EAAOp/B,EAAIhb,EAClB,GAIJ,CAiDA,SAAS2iB,EAAKylB,EAAQptB,EAAIhb,GACxB,GAAIgb,EAAI,OAAOotB,EAAO7uB,KAAK,QAASyB,GAQpC,GAPY,MAARhb,GAEFooC,EAAOvlC,KAAK7C,GAKVooC,EAAOpX,eAAeztC,OAAQ,MAAM,IAAIuqE,EAC5C,GAAI1lB,EAAO6lB,gBAAgBC,aAAc,MAAM,IAAIL,EACnD,OAAOzlB,EAAOvlC,KAAK,KACrB,CArHA,EAAQ,EAAR,CAAoB2e,EAAWgP,GAyD/BhP,EAAUj/B,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GAE1C,OADAc,KAAKopE,gBAAgBI,eAAgB,EAC9B79B,EAAOjuC,UAAUsgB,KAAK1G,KAAKtX,KAAMg/D,EAAO9/D,EACjD,EAYAy9B,EAAUj/B,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC1DA,EAAG,IAAI8jC,EAA2B,gBACpC,EACAljC,EAAUj/B,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACtD,IAAIotC,EAAKnpE,KAAKopE,gBAId,GAHAD,EAAGnC,QAAUjrC,EACbotC,EAAGG,WAAatK,EAChBmK,EAAGM,cAAgBvqE,GACdiqE,EAAGE,aAAc,CACpB,IAAIE,EAAKvpE,KAAKwsC,gBACV28B,EAAGK,eAAiBD,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBAAetsC,KAAKkhE,MAAMqI,EAAGj9B,cACzF,CACF,EAKA3P,EAAUj/B,UAAUwjE,MAAQ,SAAU1xD,GACpC,IAAI25D,EAAKnpE,KAAKopE,gBACQ,OAAlBD,EAAGG,YAAwBH,EAAGE,aAMhCF,EAAGK,eAAgB,GALnBL,EAAGE,cAAe,EAClBrpE,KAAK49B,WAAWurC,EAAGG,WAAYH,EAAGM,cAAeN,EAAGD,gBAMxD,EACAvsC,EAAUj/B,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC5C4P,EAAOjuC,UAAU0jE,SAAS9pD,KAAKtX,KAAMozB,GAAK,SAAUu2C,GAClD5tC,EAAG4tC,EACL,GACF,aCxKA,IAAIjqE,EAAW,EAAQ,GACnB28B,EAAO,EAAQ,IACfn+B,EAAS,YAET0rE,EAAI,CACN,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,YAGlCrN,EAAI,IAAI76D,MAAM,IAElB,SAASmoE,IACP7pE,KAAK6yB,OAEL7yB,KAAK8pE,GAAKvN,EAEVlgC,EAAK/kB,KAAKtX,KAAM,GAAI,GACtB,CAiBA,SAASoxB,EAAI5jB,EAAGC,EAAGqL,GACjB,OAAOA,EAAKtL,GAAKC,EAAIqL,EACvB,CAEA,SAASixD,EAAKv8D,EAAGC,EAAGqL,GAClB,OAAQtL,EAAIC,EAAMqL,GAAKtL,EAAIC,EAC7B,CAEA,SAASu8D,EAAQx8D,GACf,OAAQA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,GACvE,CAEA,SAASy8D,EAAQz8D,GACf,OAAQA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,EACvE,CAEA,SAAS08D,EAAQ18D,GACf,OAAQA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,CAC7D,CAjCA9N,EAASmqE,EAAQxtC,GAEjBwtC,EAAOnsE,UAAUm1B,KAAO,WAUtB,OATA7yB,KAAKyiD,GAAK,WACVziD,KAAK0iD,GAAK,WACV1iD,KAAK2iD,GAAK,WACV3iD,KAAK4iD,GAAK,WACV5iD,KAAK6kD,GAAK,WACV7kD,KAAKmqE,GAAK,WACVnqE,KAAKoqE,GAAK,UACVpqE,KAAKqqE,GAAK,WAEHrqE,IACT,EA0BA6pE,EAAOnsE,UAAU6+B,QAAU,SAAU2mB,GAYnC,IAXA,IALe11C,EAKX+uD,EAAIv8D,KAAK8pE,GAET9lE,EAAc,EAAVhE,KAAKyiD,GACTx+C,EAAc,EAAVjE,KAAK0iD,GACT/hD,EAAc,EAAVX,KAAK2iD,GACTjyB,EAAc,EAAV1wB,KAAK4iD,GACTriD,EAAc,EAAVP,KAAK6kD,GACTjgB,EAAc,EAAV5kC,KAAKmqE,GACT12D,EAAc,EAAVzT,KAAKoqE,GACT/4D,EAAc,EAAVrR,KAAKqqE,GAEJ7oE,EAAI,EAAGA,EAAI,KAAMA,EAAG+6D,EAAE/6D,GAAK0hD,EAAEx/B,YAAgB,EAAJliB,GAClD,KAAOA,EAAI,KAAMA,EAAG+6D,EAAE/6D,GAAqE,KAjB5EgM,EAiBoB+uD,EAAE/6D,EAAI,MAhB3B,GAAKgM,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,IAgBb+uD,EAAE/6D,EAAI,GAAK0oE,EAAO3N,EAAE/6D,EAAI,KAAO+6D,EAAE/6D,EAAI,IAEpF,IAAK,IAAIgB,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,IAAIg6D,EAAMnrD,EAAI44D,EAAO1pE,GAAK6wB,EAAG7wB,EAAGqkC,EAAGnxB,GAAKm2D,EAAEpnE,GAAK+5D,EAAE/5D,GAAM,EACnDi6D,EAAMuN,EAAOhmE,GAAK+lE,EAAI/lE,EAAGC,EAAGtD,GAAM,EAEtC0Q,EAAIoC,EACJA,EAAImxB,EACJA,EAAIrkC,EACJA,EAAKmwB,EAAI8rC,EAAM,EACf9rC,EAAI/vB,EACJA,EAAIsD,EACJA,EAAID,EACJA,EAAKw4D,EAAKC,EAAM,CAClB,CAEAz8D,KAAKyiD,GAAMz+C,EAAIhE,KAAKyiD,GAAM,EAC1BziD,KAAK0iD,GAAMz+C,EAAIjE,KAAK0iD,GAAM,EAC1B1iD,KAAK2iD,GAAMhiD,EAAIX,KAAK2iD,GAAM,EAC1B3iD,KAAK4iD,GAAMlyB,EAAI1wB,KAAK4iD,GAAM,EAC1B5iD,KAAK6kD,GAAMtkD,EAAIP,KAAK6kD,GAAM,EAC1B7kD,KAAKmqE,GAAMvlC,EAAI5kC,KAAKmqE,GAAM,EAC1BnqE,KAAKoqE,GAAM32D,EAAIzT,KAAKoqE,GAAM,EAC1BpqE,KAAKqqE,GAAMh5D,EAAIrR,KAAKqqE,GAAM,CAC5B,EAEAR,EAAOnsE,UAAU4+B,MAAQ,WACvB,IAAIguC,EAAIpsE,EAAOW,YAAY,IAW3B,OATAyrE,EAAE9kD,aAAaxlB,KAAKyiD,GAAI,GACxB6nB,EAAE9kD,aAAaxlB,KAAK0iD,GAAI,GACxB4nB,EAAE9kD,aAAaxlB,KAAK2iD,GAAI,GACxB2nB,EAAE9kD,aAAaxlB,KAAK4iD,GAAI,IACxB0nB,EAAE9kD,aAAaxlB,KAAK6kD,GAAI,IACxBylB,EAAE9kD,aAAaxlB,KAAKmqE,GAAI,IACxBG,EAAE9kD,aAAaxlB,KAAKoqE,GAAI,IACxBE,EAAE9kD,aAAaxlB,KAAKqqE,GAAI,IAEjBC,CACT,EAEArtE,EAAOD,QAAU6sE,aCtIjB,IAAInqE,EAAW,EAAQ,GACnB28B,EAAO,EAAQ,IACfn+B,EAAS,YAET0rE,EAAI,CACN,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGlCrN,EAAI,IAAI76D,MAAM,KAElB,SAAS6oE,IACPvqE,KAAK6yB,OACL7yB,KAAK8pE,GAAKvN,EAEVlgC,EAAK/kB,KAAKtX,KAAM,IAAK,IACvB,CA0BA,SAASwqE,EAAIh9D,EAAGC,EAAGqL,GACjB,OAAOA,EAAKtL,GAAKC,EAAIqL,EACvB,CAEA,SAASixD,EAAKv8D,EAAGC,EAAGqL,GAClB,OAAQtL,EAAIC,EAAMqL,GAAKtL,EAAIC,EAC7B,CAEA,SAASu8D,EAAQx8D,EAAGsvD,GAClB,OAAQtvD,IAAM,GAAKsvD,GAAM,IAAMA,IAAO,EAAItvD,GAAK,KAAOsvD,IAAO,EAAItvD,GAAK,GACxE,CAEA,SAASy8D,EAAQz8D,EAAGsvD,GAClB,OAAQtvD,IAAM,GAAKsvD,GAAM,KAAOtvD,IAAM,GAAKsvD,GAAM,KAAOA,IAAO,EAAItvD,GAAK,GAC1E,CAEA,SAASi9D,EAAQj9D,EAAGsvD,GAClB,OAAQtvD,IAAM,EAAIsvD,GAAM,KAAOtvD,IAAM,EAAIsvD,GAAM,IAAOtvD,IAAM,CAC9D,CAEA,SAASk9D,EAASl9D,EAAGsvD,GACnB,OAAQtvD,IAAM,EAAIsvD,GAAM,KAAOtvD,IAAM,EAAIsvD,GAAM,KAAOtvD,IAAM,EAAIsvD,GAAM,GACxE,CAEA,SAAS6N,EAAQn9D,EAAGsvD,GAClB,OAAQtvD,IAAM,GAAKsvD,GAAM,KAAOA,IAAO,GAAKtvD,GAAK,GAAMA,IAAM,CAC/D,CAEA,SAASo9D,EAASp9D,EAAGsvD,GACnB,OAAQtvD,IAAM,GAAKsvD,GAAM,KAAOA,IAAO,GAAKtvD,GAAK,IAAMA,IAAM,EAAIsvD,GAAM,GACzE,CAEA,SAAS+N,EAAU7mE,EAAGC,GACpB,OAAQD,IAAM,EAAMC,IAAM,EAAK,EAAI,CACrC,CA1DAvE,EAAS6qE,EAAQluC,GAEjBkuC,EAAO7sE,UAAUm1B,KAAO,WAmBtB,OAlBA7yB,KAAK8qE,IAAM,WACX9qE,KAAK+qE,IAAM,WACX/qE,KAAKgrE,IAAM,WACXhrE,KAAKirE,IAAM,WACXjrE,KAAKkrE,IAAM,WACXlrE,KAAKmrE,IAAM,WACXnrE,KAAKorE,IAAM,UACXprE,KAAKqrE,IAAM,WAEXrrE,KAAKsrE,IAAM,WACXtrE,KAAKurE,IAAM,WACXvrE,KAAKwrE,IAAM,WACXxrE,KAAKyrE,IAAM,WACXzrE,KAAK0rE,IAAM,WACX1rE,KAAK2rE,IAAM,UACX3rE,KAAK4rE,IAAM,WACX5rE,KAAK6rE,IAAM,UAEJ7rE,IACT,EAsCAuqE,EAAO7sE,UAAU6+B,QAAU,SAAU2mB,GAqBnC,IApBA,IAAIqZ,EAAIv8D,KAAK8pE,GAETj5C,EAAgB,EAAX7wB,KAAK8qE,IACV/5C,EAAgB,EAAX/wB,KAAK+qE,IACV35C,EAAgB,EAAXpxB,KAAKgrE,IACV15C,EAAgB,EAAXtxB,KAAKirE,IACVv5C,EAAgB,EAAX1xB,KAAKkrE,IACV9M,EAAgB,EAAXp+D,KAAKmrE,IACV7M,EAAgB,EAAXt+D,KAAKorE,IACV5M,EAAgB,EAAXx+D,KAAKqrE,IAEVv6C,EAAgB,EAAX9wB,KAAKsrE,IACVr6C,EAAgB,EAAXjxB,KAAKurE,IACVl6C,EAAgB,EAAXrxB,KAAKwrE,IACVj6C,EAAgB,EAAXvxB,KAAKyrE,IACV95C,EAAgB,EAAX3xB,KAAK0rE,IACVrN,EAAgB,EAAXr+D,KAAK2rE,IACVpN,EAAgB,EAAXv+D,KAAK4rE,IACVjnB,EAAgB,EAAX3kD,KAAK6rE,IAELrqE,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAC3B+6D,EAAE/6D,GAAK0hD,EAAEx/B,YAAgB,EAAJliB,GACrB+6D,EAAE/6D,EAAI,GAAK0hD,EAAEx/B,YAAgB,EAAJliB,EAAQ,GAEnC,KAAOA,EAAI,IAAKA,GAAK,EAAG,CACtB,IAAIq7D,EAAKN,EAAE/6D,EAAI,IACXs7D,EAAKP,EAAE/6D,EAAI,GAAS,GACpB0oE,EAASO,EAAO5N,EAAIC,GACpBgP,EAAUpB,EAAQ5N,EAAID,GAItBkP,EAASpB,EAFb9N,EAAKN,EAAE/6D,EAAI,GACXs7D,EAAKP,EAAE/6D,EAAI,EAAQ,IAEfwqE,EAAUpB,EAAQ9N,EAAID,GAGtBoP,EAAO1P,EAAE/6D,EAAI,IACb0qE,EAAO3P,EAAE/6D,EAAI,GAAQ,GAErB2qE,EAAQ5P,EAAE/6D,EAAI,IACd4qE,EAAQ7P,EAAE/6D,EAAI,GAAS,GAEvB6qE,EAAOP,EAAUI,EAAQ,EACzBI,EAAOpC,EAAS+B,EAAOpB,EAASwB,EAAKP,GAAY,EAIrDQ,GAFAA,EAAOA,EAAMP,EAASlB,EADtBwB,EAAOA,EAAML,EAAW,EACYA,GAAY,GAEnCG,EAAQtB,EADrBwB,EAAOA,EAAMD,EAAS,EACaA,GAAU,EAE7C7P,EAAE/6D,GAAK8qE,EACP/P,EAAE/6D,EAAI,GAAK6qE,CACb,CAEA,IAAK,IAAI7pE,EAAI,EAAGA,EAAI,IAAKA,GAAK,EAAG,CAC/B8pE,EAAM/P,EAAE/5D,GACR6pE,EAAM9P,EAAE/5D,EAAI,GAEZ,IAAI+pE,EAAOxC,EAAIl5C,EAAIE,EAAIK,GACnBo7C,EAAOzC,EAAIj5C,EAAIG,EAAII,GAEnBo7C,EAAUzC,EAAOn5C,EAAIC,GACrB47C,EAAU1C,EAAOl5C,EAAID,GACrB87C,EAAU1C,EAAOv4C,EAAIC,GACrBi7C,EAAU3C,EAAOt4C,EAAID,GAGrBm7C,EAAMjD,EAAEpnE,GACRsqE,EAAMlD,EAAEpnE,EAAI,GAEZuqE,EAAMvC,EAAG94C,EAAI0sC,EAAIE,GACjB0O,EAAMxC,EAAG74C,EAAI0sC,EAAIE,GAEjB0O,EAAOtoB,EAAKioB,EAAW,EACvBM,EAAO1O,EAAKmO,EAAU9B,EAASoC,EAAKtoB,GAAO,EAM/CuoB,GAFAA,GAFAA,EAAOA,EAAMH,EAAMlC,EADnBoC,EAAOA,EAAMD,EAAO,EACaA,GAAQ,GAE5BH,EAAMhC,EADnBoC,EAAOA,EAAMH,EAAO,EACaA,GAAQ,GAE5BR,EAAMzB,EADnBoC,EAAOA,EAAMZ,EAAO,EACaA,GAAQ,EAGzC,IAAIc,GAAOT,EAAUF,EAAQ,EACzBY,GAAOX,EAAUF,EAAO1B,EAASsC,GAAKT,GAAY,EAEtDlO,EAAKF,EACL3Z,EAAK4Z,EACLD,EAAKF,EACLG,EAAKF,EACLD,EAAK1sC,EACL2sC,EAAK1sC,EAELD,EAAMJ,EAAK47C,EAAMrC,EADjBl5C,EAAMJ,EAAK07C,EAAO,EACY17C,GAAO,EACrCD,EAAKF,EACLG,EAAKF,EACLD,EAAKL,EACLM,EAAKJ,EACLF,EAAKF,EACLI,EAAKH,EAELD,EAAMq8C,EAAME,GAAMvC,EADlB/5C,EAAMm8C,EAAME,GAAO,EACYF,GAAQ,CACzC,CAEAjtE,KAAKsrE,IAAOtrE,KAAKsrE,IAAMx6C,EAAM,EAC7B9wB,KAAKurE,IAAOvrE,KAAKurE,IAAMt6C,EAAM,EAC7BjxB,KAAKwrE,IAAOxrE,KAAKwrE,IAAMn6C,EAAM,EAC7BrxB,KAAKyrE,IAAOzrE,KAAKyrE,IAAMl6C,EAAM,EAC7BvxB,KAAK0rE,IAAO1rE,KAAK0rE,IAAM/5C,EAAM,EAC7B3xB,KAAK2rE,IAAO3rE,KAAK2rE,IAAMtN,EAAM,EAC7Br+D,KAAK4rE,IAAO5rE,KAAK4rE,IAAMrN,EAAM,EAC7Bv+D,KAAK6rE,IAAO7rE,KAAK6rE,IAAMlnB,EAAM,EAE7B3kD,KAAK8qE,IAAO9qE,KAAK8qE,IAAMj6C,EAAKg6C,EAAS7qE,KAAKsrE,IAAKx6C,GAAO,EACtD9wB,KAAK+qE,IAAO/qE,KAAK+qE,IAAMh6C,EAAK85C,EAAS7qE,KAAKurE,IAAKt6C,GAAO,EACtDjxB,KAAKgrE,IAAOhrE,KAAKgrE,IAAM55C,EAAKy5C,EAAS7qE,KAAKwrE,IAAKn6C,GAAO,EACtDrxB,KAAKirE,IAAOjrE,KAAKirE,IAAM35C,EAAKu5C,EAAS7qE,KAAKyrE,IAAKl6C,GAAO,EACtDvxB,KAAKkrE,IAAOlrE,KAAKkrE,IAAMx5C,EAAKm5C,EAAS7qE,KAAK0rE,IAAK/5C,GAAO,EACtD3xB,KAAKmrE,IAAOnrE,KAAKmrE,IAAM/M,EAAKyM,EAAS7qE,KAAK2rE,IAAKtN,GAAO,EACtDr+D,KAAKorE,IAAOprE,KAAKorE,IAAM9M,EAAKuM,EAAS7qE,KAAK4rE,IAAKrN,GAAO,EACtDv+D,KAAKqrE,IAAOrrE,KAAKqrE,IAAM7M,EAAKqM,EAAS7qE,KAAK6rE,IAAKlnB,GAAO,CACxD,EAEA4lB,EAAO7sE,UAAU4+B,MAAQ,WACvB,IAAIguC,EAAIpsE,EAAOW,YAAY,IAE3B,SAASwuE,EAAch8D,EAAGtD,EAAGsP,GAC3BitD,EAAE9kD,aAAanU,EAAGgM,GAClBitD,EAAE9kD,aAAazX,EAAGsP,EAAS,EAC7B,CAWA,OATAgwD,EAAartE,KAAK8qE,IAAK9qE,KAAKsrE,IAAK,GACjC+B,EAAartE,KAAK+qE,IAAK/qE,KAAKurE,IAAK,GACjC8B,EAAartE,KAAKgrE,IAAKhrE,KAAKwrE,IAAK,IACjC6B,EAAartE,KAAKirE,IAAKjrE,KAAKyrE,IAAK,IACjC4B,EAAartE,KAAKkrE,IAAKlrE,KAAK0rE,IAAK,IACjC2B,EAAartE,KAAKmrE,IAAKnrE,KAAK2rE,IAAK,IACjC0B,EAAartE,KAAKorE,IAAKprE,KAAK4rE,IAAK,IACjCyB,EAAartE,KAAKqrE,IAAKrrE,KAAK6rE,IAAK,IAE1BvB,CACT,EAEArtE,EAAOD,QAAUutE,0BCzOjB,IAAI5+B,EAHJ1uC,EAAOD,QAAU4uC,EAMjBA,EAASuzB,cAAgBA,EAGhB,mBAAT,IAqBIC,EApBAC,EAAkB,SAAyBtsC,EAAS7X,GACtD,OAAO6X,EAAQsD,UAAUnb,GAAMxc,MACjC,EAIIq0D,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EASvK0lD,EAAY,EAAQ,KAGtBH,EADEG,GAAaA,EAAUh3B,SACjBg3B,EAAUh3B,SAAS,UAEnB,WAAkB,EAI5B,IAWI3L,EACA4iC,EACA7gE,EAbA8gE,EAAa,EAAQ,KACrBC,EAAc,EAAQ,IAExBC,EADa,EAAQ,KACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC84C,EAA4BvM,EAAeuM,0BAC3CC,EAA6BxM,EAAewM,2BAC5CC,EAAqCzM,EAAeyM,mCAMtD,EAAQ,EAAR,CAAoBl0B,EAAUmnB,GAC9B,IAAIgN,EAAiBL,EAAYK,eAC7BC,EAAe,CAAC,QAAS,QAAS,UAAW,QAAS,UAY1D,SAASb,EAActzC,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQs0C,oBAI7DngE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAK9EjgE,KAAK/B,OAAS,IAAIwhE,EAClBz/D,KAAKtB,OAAS,EACdsB,KAAKogE,MAAQ,KACbpgE,KAAKqgE,WAAa,EAClBrgE,KAAKsgE,QAAU,KACftgE,KAAKosC,OAAQ,EACbpsC,KAAK+jD,YAAa,EAClB/jD,KAAKugE,SAAU,EAMfvgE,KAAKkgD,MAAO,EAIZlgD,KAAKwgE,cAAe,EACpBxgE,KAAKygE,iBAAkB,EACvBzgE,KAAK0gE,mBAAoB,EACzB1gE,KAAK2gE,iBAAkB,EACvB3gE,KAAK4gE,QAAS,EAGd5gE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAKysC,WAAY,EAKjBzsC,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAGlD/gE,KAAKghE,WAAa,EAGlBhhE,KAAKihE,aAAc,EACnBjhE,KAAK+8C,QAAU,KACf/8C,KAAKd,SAAW,KACZ2sB,EAAQ3sB,WACL09B,IAAeA,EAAgB,SACpC58B,KAAK+8C,QAAU,IAAIngB,EAAc/Q,EAAQ3sB,UACzCc,KAAKd,SAAW2sB,EAAQ3sB,SAE5B,CACA,SAAS0sC,EAAS/f,GAEhB,GADA8f,EAASA,GAAU,EAAQ,MACrB3rC,gBAAgB4rC,GAAW,OAAO,IAAIA,EAAS/f,GAIrD,IAAIo0C,EAAWjgE,gBAAgB2rC,EAC/B3rC,KAAKwsC,eAAiB,IAAI2yB,EAActzC,EAAS7rB,KAAMigE,GAGvDjgE,KAAKisC,UAAW,EACZpgB,IAC0B,mBAAjBA,EAAQ7O,OAAqBhd,KAAKkhE,MAAQr1C,EAAQ7O,MAC9B,mBAApB6O,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,UAErEpO,EAAOz7C,KAAKtX,KACd,CAwDA,SAASqhE,EAAiB9d,EAAQyb,EAAO9/D,EAAUoiE,EAAYC,GAC7DnC,EAAM,mBAAoBJ,GAC1B,IAKM7oC,EALFhB,EAAQouB,EAAO/W,eACnB,GAAc,OAAVwyB,EACF7pC,EAAMorC,SAAU,EAuNpB,SAAoBhd,EAAQpuB,GAE1B,GADAiqC,EAAM,eACFjqC,EAAMiX,MAAV,CACA,GAAIjX,EAAM4nB,QAAS,CACjB,IAAIiiB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,SACjBy2B,EAAMl3B,OAAO+f,KAAKghD,GAClB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OAEjD,CACAy2B,EAAMiX,OAAQ,EACVjX,EAAM+qB,KAIRshB,EAAaje,IAGbpuB,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTtrC,EAAMsrC,iBAAkB,EACxBgB,EAAcle,IAnBK,CAsBzB,CA9OIme,CAAWne,EAAQpuB,QAInB,GADKosC,IAAgBprC,EA6CzB,SAAsBhB,EAAO6pC,GAC3B,IAAI7oC,EAjPiBrb,EAqPrB,OArPqBA,EAkPFkkD,EAjPZ9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAiPA,iBAAVN,QAAgC5/D,IAAV4/D,GAAwB7pC,EAAM+qC,aACtF/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,SAAU,cAAek4C,IAEtE7oC,CACT,CAnD8BwrC,CAAaxsC,EAAO6pC,IAC1C7oC,EACF4pC,EAAexc,EAAQptB,QAClB,GAAIhB,EAAM+qC,YAAclB,GAASA,EAAMtgE,OAAS,EAIrD,GAHqB,iBAAVsgE,GAAuB7pC,EAAM+qC,YAAc7iE,OAAO04B,eAAeipC,KAAW9gE,EAAOR,YAC5FshE,EA3MR,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CAyMgB4C,CAAoB5C,IAE1BsC,EACEnsC,EAAM4uB,WAAYgc,EAAexc,EAAQ,IAAIuc,GAA2C+B,EAASte,EAAQpuB,EAAO6pC,GAAO,QACtH,GAAI7pC,EAAMiX,MACf2zB,EAAexc,EAAQ,IAAIqc,OACtB,IAAIzqC,EAAMsX,UACf,OAAO,EAEPtX,EAAMorC,SAAU,EACZprC,EAAM4nB,UAAY79C,GACpB8/D,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,GACxB7pC,EAAM+qC,YAA+B,IAAjBlB,EAAMtgE,OAAcmjE,EAASte,EAAQpuB,EAAO6pC,GAAO,GAAY8C,EAAcve,EAAQpuB,IAE7G0sC,EAASte,EAAQpuB,EAAO6pC,GAAO,EAEnC,MACUsC,IACVnsC,EAAMorC,SAAU,EAChBuB,EAAcve,EAAQpuB,IAO1B,OAAQA,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAkC,IAAjBnX,EAAMz2B,OACtE,CACA,SAASmjE,EAASte,EAAQpuB,EAAO6pC,EAAOsC,GAClCnsC,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAiBy2B,EAAM+qB,MAChD/qB,EAAM6rC,WAAa,EACnBzd,EAAO7uB,KAAK,OAAQsqC,KAGpB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACzC4iE,EAAYnsC,EAAMl3B,OAAO02B,QAAQqqC,GAAY7pC,EAAMl3B,OAAO+f,KAAKghD,GAC/D7pC,EAAMqrC,cAAcgB,EAAaje,IAEvCue,EAAcve,EAAQpuB,EACxB,CA3GA93B,OAAOqiB,eAAeksB,EAASluC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,gBAGFxsC,KAAKwsC,eAAeC,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKwsC,iBAMVxsC,KAAKwsC,eAAeC,UAAY7uC,EAClC,IAEFguC,EAASluC,UAAUyjE,QAAUzB,EAAYyB,QACzCv1B,EAASluC,UAAUqkE,WAAarC,EAAYsC,UAC5Cp2B,EAASluC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,EAMAwY,EAASluC,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GACzC,IACIqiE,EADApsC,EAAQn1B,KAAKwsC,eAcjB,OAZKrX,EAAM+qC,WAUTqB,GAAiB,EATI,iBAAVvC,KACT9/D,EAAWA,GAAYi2B,EAAM4rC,mBACZ5rC,EAAMj2B,WACrB8/D,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,GAC3BA,EAAW,IAEbqiE,GAAiB,GAKdF,EAAiBrhE,KAAMg/D,EAAO9/D,GAAU,EAAOqiE,EACxD,EAGA31B,EAASluC,UAAUi3B,QAAU,SAAUqqC,GACrC,OAAOqC,EAAiBrhE,KAAMg/D,EAAO,MAAM,GAAM,EACnD,EA6DApzB,EAASluC,UAAUukE,SAAW,WAC5B,OAAuC,IAAhCjiE,KAAKwsC,eAAe8zB,OAC7B,EAGA10B,EAASluC,UAAUwkE,YAAc,SAAUjyC,GACpC2M,IAAeA,EAAgB,SACpC,IAAImgB,EAAU,IAAIngB,EAAc3M,GAChCjwB,KAAKwsC,eAAeuQ,QAAUA,EAE9B/8C,KAAKwsC,eAAettC,SAAWc,KAAKwsC,eAAeuQ,QAAQ79C,SAK3D,IAFA,IAAI6P,EAAI/O,KAAKwsC,eAAevuC,OAAOm8C,KAC/BqX,EAAU,GACD,OAAN1iD,GACL0iD,GAAW1U,EAAQ9iC,MAAMlL,EAAEoM,MAC3BpM,EAAIA,EAAE0J,KAKR,OAHAzY,KAAKwsC,eAAevuC,OAAOkkE,QACX,KAAZ1Q,GAAgBzxD,KAAKwsC,eAAevuC,OAAO+f,KAAKyzC,GACpDzxD,KAAKwsC,eAAe9tC,OAAS+yD,EAAQ/yD,OAC9BsB,IACT,EAGA,IAAIoiE,EAAU,WAqBd,SAASC,EAAc7yD,EAAG2lB,GACxB,OAAI3lB,GAAK,GAAsB,IAAjB2lB,EAAMz2B,QAAgBy2B,EAAMiX,MAAc,EACpDjX,EAAM+qC,WAAmB,EACzB1wD,GAAMA,EAEJ2lB,EAAMmrC,SAAWnrC,EAAMz2B,OAAey2B,EAAMl3B,OAAOm8C,KAAKj/B,KAAKzc,OAAmBy2B,EAAMz2B,QAGxF8Q,EAAI2lB,EAAMmX,gBAAenX,EAAMmX,cA5BrC,SAAiC98B,GAe/B,OAdIA,GAAK4yD,EAEP5yD,EAAI4yD,GAIJ5yD,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAEKA,CACT,CAYqD8yD,CAAwB9yD,IACvEA,GAAK2lB,EAAMz2B,OAAe8Q,EAEzB2lB,EAAMiX,MAIJjX,EAAMz2B,QAHXy2B,EAAMqrC,cAAe,EACd,GAGX,CA6HA,SAASgB,EAAaje,GACpB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,eAAgBjqC,EAAMqrC,aAAcrrC,EAAMsrC,iBAChDtrC,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTrB,EAAM,eAAgBjqC,EAAMmrC,SAC5BnrC,EAAMsrC,iBAAkB,EACxB7yC,QAAQqO,SAASwlC,EAAele,GAEpC,CACA,SAASke,EAAcle,GACrB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,gBAAiBjqC,EAAMsX,UAAWtX,EAAMz2B,OAAQy2B,EAAMiX,OACvDjX,EAAMsX,YAActX,EAAMz2B,SAAUy2B,EAAMiX,QAC7CmX,EAAO7uB,KAAK,YACZS,EAAMsrC,iBAAkB,GAS1BtrC,EAAMqrC,cAAgBrrC,EAAMmrC,UAAYnrC,EAAMiX,OAASjX,EAAMz2B,QAAUy2B,EAAMmX,cAC7Ei2B,EAAKhf,EACP,CAQA,SAASue,EAAcve,EAAQpuB,GACxBA,EAAM8rC,cACT9rC,EAAM8rC,aAAc,EACpBrzC,QAAQqO,SAASumC,EAAgBjf,EAAQpuB,GAE7C,CACA,SAASqtC,EAAejf,EAAQpuB,GAwB9B,MAAQA,EAAMorC,UAAYprC,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAiBnX,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAe,CACpH,IAAI2C,EAAM8zB,EAAMz2B,OAGhB,GAFA0gE,EAAM,wBACN7b,EAAOvmC,KAAK,GACR3b,IAAQ8zB,EAAMz2B,OAEhB,KACJ,CACAy2B,EAAM8rC,aAAc,CACtB,CAgPA,SAASwB,EAAwB3+D,GAC/B,IAAIqxB,EAAQrxB,EAAK0oC,eACjBrX,EAAMurC,kBAAoB58D,EAAK6xB,cAAc,YAAc,EACvDR,EAAMwrC,kBAAoBxrC,EAAMyrC,OAGlCzrC,EAAMmrC,SAAU,EAGPx8D,EAAK6xB,cAAc,QAAU,GACtC7xB,EAAK4+D,QAET,CACA,SAASC,EAAiB7+D,GACxBs7D,EAAM,4BACNt7D,EAAKkZ,KAAK,EACZ,CAuBA,SAAS4lD,EAAQrf,EAAQpuB,GACvBiqC,EAAM,SAAUjqC,EAAMorC,SACjBprC,EAAMorC,SACThd,EAAOvmC,KAAK,GAEdmY,EAAMwrC,iBAAkB,EACxBpd,EAAO7uB,KAAK,UACZ6tC,EAAKhf,GACDpuB,EAAMmrC,UAAYnrC,EAAMorC,SAAShd,EAAOvmC,KAAK,EACnD,CAWA,SAASulD,EAAKhf,GACZ,IAAIpuB,EAAQouB,EAAO/W,eAEnB,IADA4yB,EAAM,OAAQjqC,EAAMmrC,SACbnrC,EAAMmrC,SAA6B,OAAlB/c,EAAOvmC,SACjC,CAmHA,SAAS6lD,EAASrzD,EAAG2lB,GAEnB,OAAqB,IAAjBA,EAAMz2B,OAAqB,MAE3By2B,EAAM+qC,WAAYn7D,EAAMowB,EAAMl3B,OAAOmU,SAAkB5C,GAAKA,GAAK2lB,EAAMz2B,QAEtDqG,EAAfowB,EAAM4nB,QAAe5nB,EAAMl3B,OAAOi7B,KAAK,IAAqC,IAAxB/D,EAAMl3B,OAAOS,OAAoBy2B,EAAMl3B,OAAO+kB,QAAmBmS,EAAMl3B,OAAO8hB,OAAOoV,EAAMz2B,QACnJy2B,EAAMl3B,OAAOkkE,SAGbp9D,EAAMowB,EAAMl3B,OAAO6kE,QAAQtzD,EAAG2lB,EAAM4nB,SAE/Bh4C,GATP,IAAIA,CAUN,CACA,SAASg+D,EAAYxf,GACnB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,cAAejqC,EAAM4uB,YACtB5uB,EAAM4uB,aACT5uB,EAAMiX,OAAQ,EACdxe,QAAQqO,SAAS+mC,EAAe7tC,EAAOouB,GAE3C,CACA,SAASyf,EAAc7tC,EAAOouB,GAI5B,GAHA6b,EAAM,gBAAiBjqC,EAAM4uB,WAAY5uB,EAAMz2B,SAG1Cy2B,EAAM4uB,YAA+B,IAAjB5uB,EAAMz2B,SAC7By2B,EAAM4uB,YAAa,EACnBR,EAAOtX,UAAW,EAClBsX,EAAO7uB,KAAK,OACRS,EAAM2rC,aAAa,CAGrB,IAAImC,EAAS1f,EAAOpX,iBACf82B,GAAUA,EAAOnC,aAAemC,EAAOpf,WAC1CN,EAAO4d,SAEX,CAEJ,CASA,SAAS1kD,EAAQymD,EAAI11D,GACnB,IAAK,IAAIhM,EAAI,EAAGuM,EAAIm1D,EAAGxkE,OAAQ8C,EAAIuM,EAAGvM,IACpC,GAAI0hE,EAAG1hE,KAAOgM,EAAG,OAAOhM,EAE1B,OAAQ,CACV,CA1pBAoqC,EAASluC,UAAUsf,KAAO,SAAUxN,GAClC4vD,EAAM,OAAQ5vD,GACdA,EAAIkO,SAASlO,EAAG,IAChB,IAAI2lB,EAAQn1B,KAAKwsC,eACb22B,EAAQ3zD,EAMZ,GALU,IAANA,IAAS2lB,EAAMsrC,iBAAkB,GAK3B,IAANjxD,GAAW2lB,EAAMqrC,gBAA0C,IAAxBrrC,EAAMmX,cAAsBnX,EAAMz2B,QAAUy2B,EAAMmX,cAAgBnX,EAAMz2B,OAAS,IAAMy2B,EAAMiX,OAGlI,OAFAgzB,EAAM,qBAAsBjqC,EAAMz2B,OAAQy2B,EAAMiX,OAC3B,IAAjBjX,EAAMz2B,QAAgBy2B,EAAMiX,MAAO22B,EAAY/iE,MAAWwhE,EAAaxhE,MACpE,KAKT,GAAU,KAHVwP,EAAI6yD,EAAc7yD,EAAG2lB,KAGNA,EAAMiX,MAEnB,OADqB,IAAjBjX,EAAMz2B,QAAcqkE,EAAY/iE,MAC7B,KA0BT,IA2BI+E,EA3BAq+D,EAASjuC,EAAMqrC,aA6CnB,OA5CApB,EAAM,gBAAiBgE,IAGF,IAAjBjuC,EAAMz2B,QAAgBy2B,EAAMz2B,OAAS8Q,EAAI2lB,EAAMmX,gBAEjD8yB,EAAM,6BADNgE,GAAS,GAMPjuC,EAAMiX,OAASjX,EAAMorC,QAEvBnB,EAAM,mBADNgE,GAAS,GAEAA,IACThE,EAAM,WACNjqC,EAAMorC,SAAU,EAChBprC,EAAM+qB,MAAO,EAEQ,IAAjB/qB,EAAMz2B,SAAcy2B,EAAMqrC,cAAe,GAE7CxgE,KAAKkhE,MAAM/rC,EAAMmX,eACjBnX,EAAM+qB,MAAO,EAGR/qB,EAAMorC,UAAS/wD,EAAI6yD,EAAcc,EAAOhuC,KAInC,QADDpwB,EAAPyK,EAAI,EAASqzD,EAASrzD,EAAG2lB,GAAkB,OAE7CA,EAAMqrC,aAAerrC,EAAMz2B,QAAUy2B,EAAMmX,cAC3C98B,EAAI,IAEJ2lB,EAAMz2B,QAAU8Q,EAChB2lB,EAAM6rC,WAAa,GAEA,IAAjB7rC,EAAMz2B,SAGHy2B,EAAMiX,QAAOjX,EAAMqrC,cAAe,GAGnC2C,IAAU3zD,GAAK2lB,EAAMiX,OAAO22B,EAAY/iE,OAElC,OAAR+E,GAAc/E,KAAK00B,KAAK,OAAQ3vB,GAC7BA,CACT,EA6GA6mC,EAASluC,UAAUwjE,MAAQ,SAAU1xD,GACnCuwD,EAAe//D,KAAM,IAAI6/D,EAA2B,WACtD,EACAj0B,EAASluC,UAAU2lE,KAAO,SAAUhgE,EAAMigE,GACxC,IAAIllE,EAAM4B,KACNm1B,EAAQn1B,KAAKwsC,eACjB,OAAQrX,EAAMkrC,YACZ,KAAK,EACHlrC,EAAMirC,MAAQ/8D,EACd,MACF,KAAK,EACH8xB,EAAMirC,MAAQ,CAACjrC,EAAMirC,MAAO/8D,GAC5B,MACF,QACE8xB,EAAMirC,MAAMpiD,KAAK3a,GAGrB8xB,EAAMkrC,YAAc,EACpBjB,EAAM,wBAAyBjqC,EAAMkrC,WAAYiD,GACjD,IACIC,EADUD,IAA6B,IAAjBA,EAASniE,KAAkBkC,IAASuqB,QAAQ41C,QAAUngE,IAASuqB,QAAQ61C,OACrEC,EAARx3B,EAYpB,SAASA,IACPkzB,EAAM,SACN/7D,EAAKlC,KACP,CAdIg0B,EAAM4uB,WAAYn2B,QAAQqO,SAASsnC,GAAYnlE,EAAI00B,KAAK,MAAOywC,GACnElgE,EAAKqwB,GAAG,UACR,SAASiwC,EAAS13B,EAAU23B,GAC1BxE,EAAM,YACFnzB,IAAa7tC,GACXwlE,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EAkB5BzE,EAAM,WAEN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7B5gD,EAAKgwB,eAAe,SAAUswB,GAC9BtgD,EAAKgwB,eAAe,QAASywC,GAC7BzgE,EAAKgwB,eAAe,QAAS2wB,GAC7B3gD,EAAKgwB,eAAe,SAAUswC,GAC9BvlE,EAAIi1B,eAAe,MAAO6Y,GAC1B9tC,EAAIi1B,eAAe,MAAOqwC,GAC1BtlE,EAAIi1B,eAAe,OAAQ0wC,GAC3BC,GAAY,GAOR7uC,EAAM6rC,YAAgB39D,EAAK8oC,iBAAkB9oC,EAAK8oC,eAAe83B,WAAYH,IA/BnF,IAUA,IAAIA,EAgFN,SAAqB1lE,GACnB,OAAO,WACL,IAAI+2B,EAAQ/2B,EAAIouC,eAChB4yB,EAAM,cAAejqC,EAAM6rC,YACvB7rC,EAAM6rC,YAAY7rC,EAAM6rC,aACH,IAArB7rC,EAAM6rC,YAAoB3B,EAAgBjhE,EAAK,UACjD+2B,EAAMmrC,SAAU,EAChBiC,EAAKnkE,GAET,CACF,CA1FgB8lE,CAAY9lE,GAC1BiF,EAAKqwB,GAAG,QAASowC,GACjB,IAAIE,GAAY,EAsBhB,SAASD,EAAO/E,GACdI,EAAM,UACN,IAAIr6D,EAAM1B,EAAK4W,MAAM+kD,GACrBI,EAAM,aAAcr6D,IACR,IAARA,KAKwB,IAArBowB,EAAMkrC,YAAoBlrC,EAAMirC,QAAU/8D,GAAQ8xB,EAAMkrC,WAAa,IAAqC,IAAhC5jD,EAAQ0Y,EAAMirC,MAAO/8D,MAAkB2gE,IACpH5E,EAAM,8BAA+BjqC,EAAM6rC,YAC3C7rC,EAAM6rC,cAER5iE,EAAI+lE,QAER,CAIA,SAASngB,EAAQ7tB,GACfipC,EAAM,UAAWjpC,GACjButC,IACArgE,EAAKgwB,eAAe,QAAS2wB,GACU,IAAnCqb,EAAgBh8D,EAAM,UAAgB08D,EAAe18D,EAAM8yB,EACjE,CAMA,SAAS8tB,IACP5gD,EAAKgwB,eAAe,SAAUswB,GAC9B+f,GACF,CAEA,SAAS/f,IACPyb,EAAM,YACN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7Byf,GACF,CAEA,SAASA,IACPtE,EAAM,UACNhhE,EAAIslE,OAAOrgE,EACb,CAUA,OAvDAjF,EAAIs1B,GAAG,OAAQqwC,GAniBjB,SAAyBhxC,EAASqxC,EAAOz8C,GAGvC,GAAuC,mBAA5BoL,EAAQwD,gBAAgC,OAAOxD,EAAQwD,gBAAgB6tC,EAAOz8C,GAMpFoL,EAAQa,SAAYb,EAAQa,QAAQwwC,GAAuC1iE,MAAMC,QAAQoxB,EAAQa,QAAQwwC,IAASrxC,EAAQa,QAAQwwC,GAAOzvC,QAAQhN,GAASoL,EAAQa,QAAQwwC,GAAS,CAACz8C,EAAIoL,EAAQa,QAAQwwC,IAA5JrxC,EAAQW,GAAG0wC,EAAOz8C,EACrE,CAqjBE4O,CAAgBlzB,EAAM,QAAS2gD,GAO/B3gD,EAAKyvB,KAAK,QAASmxB,GAMnB5gD,EAAKyvB,KAAK,SAAU6wB,GAOpBtgD,EAAKqxB,KAAK,OAAQt2B,GAGb+2B,EAAMmrC,UACTlB,EAAM,eACNhhE,EAAIskE,UAECr/D,CACT,EAYAuoC,EAASluC,UAAUgmE,OAAS,SAAUrgE,GACpC,IAAI8xB,EAAQn1B,KAAKwsC,eACbo3B,EAAa,CACfC,YAAY,GAId,GAAyB,IAArB1uC,EAAMkrC,WAAkB,OAAOrgE,KAGnC,GAAyB,IAArBm1B,EAAMkrC,WAER,OAAIh9D,GAAQA,IAAS8xB,EAAMirC,QACtB/8D,IAAMA,EAAO8xB,EAAMirC,OAGxBjrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EACZj9D,GAAMA,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAPK5jE,KAa3C,IAAKqD,EAAM,CAET,IAAIghE,EAAQlvC,EAAMirC,MACd/+D,EAAM8zB,EAAMkrC,WAChBlrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EAChB,IAAK,IAAI9+D,EAAI,EAAGA,EAAIH,EAAKG,IAAK6iE,EAAM7iE,GAAGkzB,KAAK,SAAU10B,KAAM,CAC1D6jE,YAAY,IAEd,OAAO7jE,IACT,CAGA,IAAIU,EAAQ+b,EAAQ0Y,EAAMirC,MAAO/8D,GACjC,OAAe,IAAX3C,IACJy0B,EAAMirC,MAAMplC,OAAOt6B,EAAO,GAC1By0B,EAAMkrC,YAAc,EACK,IAArBlrC,EAAMkrC,aAAkBlrC,EAAMirC,MAAQjrC,EAAMirC,MAAM,IACtD/8D,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAJD5jE,IAM3B,EAIA4rC,EAASluC,UAAUg2B,GAAK,SAAU4wC,EAAI38C,GACpC,IAAIpiB,EAAMwtD,EAAOr1D,UAAUg2B,GAAGpc,KAAKtX,KAAMskE,EAAI38C,GACzCwN,EAAQn1B,KAAKwsC,eAqBjB,MApBW,SAAP83B,GAGFnvC,EAAMurC,kBAAoB1gE,KAAK21B,cAAc,YAAc,GAGrC,IAAlBR,EAAMmrC,SAAmBtgE,KAAK0iE,UAClB,aAAP4B,IACJnvC,EAAM4uB,YAAe5uB,EAAMurC,oBAC9BvrC,EAAMurC,kBAAoBvrC,EAAMqrC,cAAe,EAC/CrrC,EAAMmrC,SAAU,EAChBnrC,EAAMsrC,iBAAkB,EACxBrB,EAAM,cAAejqC,EAAMz2B,OAAQy2B,EAAMorC,SACrCprC,EAAMz2B,OACR8iE,EAAaxhE,MACHm1B,EAAMorC,SAChB3yC,QAAQqO,SAAS0mC,EAAkB3iE,QAIlCuF,CACT,EACAqmC,EAASluC,UAAU44B,YAAcsV,EAASluC,UAAUg2B,GACpDkY,EAASluC,UAAU21B,eAAiB,SAAUixC,EAAI38C,GAChD,IAAIpiB,EAAMwtD,EAAOr1D,UAAU21B,eAAe/b,KAAKtX,KAAMskE,EAAI38C,GAUzD,MATW,aAAP28C,GAOF12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EACAqmC,EAASluC,UAAUm5B,mBAAqB,SAAUytC,GAChD,IAAI/+D,EAAMwtD,EAAOr1D,UAAUm5B,mBAAmB5X,MAAMjf,KAAMyb,WAU1D,MATW,aAAP6oD,QAA4BllE,IAAPklE,GAOvB12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EAqBAqmC,EAASluC,UAAUglE,OAAS,WAC1B,IAAIvtC,EAAQn1B,KAAKwsC,eAUjB,OATKrX,EAAMmrC,UACTlB,EAAM,UAINjqC,EAAMmrC,SAAWnrC,EAAMurC,kBAM3B,SAAgBnd,EAAQpuB,GACjBA,EAAMwrC,kBACTxrC,EAAMwrC,iBAAkB,EACxB/yC,QAAQqO,SAAS2mC,EAASrf,EAAQpuB,GAEtC,CAVIutC,CAAO1iE,KAAMm1B,IAEfA,EAAMyrC,QAAS,EACR5gE,IACT,EAiBA4rC,EAASluC,UAAUymE,MAAQ,WAQzB,OAPA/E,EAAM,wBAAyBp/D,KAAKwsC,eAAe8zB,UACf,IAAhCtgE,KAAKwsC,eAAe8zB,UACtBlB,EAAM,SACNp/D,KAAKwsC,eAAe8zB,SAAU,EAC9BtgE,KAAK00B,KAAK,UAEZ10B,KAAKwsC,eAAeo0B,QAAS,EACtB5gE,IACT,EAUA4rC,EAASluC,UAAU6mE,KAAO,SAAUhhB,GAClC,IAAIgS,EAAQv1D,KACRm1B,EAAQn1B,KAAKwsC,eACbo0B,GAAS,EAwBb,IAAK,IAAIp/D,KAvBT+hD,EAAO7vB,GAAG,OAAO,WAEf,GADA0rC,EAAM,eACFjqC,EAAM4nB,UAAY5nB,EAAMiX,MAAO,CACjC,IAAI4yB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,QAAQ62D,EAAMv3C,KAAKghD,EACxC,CACAzJ,EAAMv3C,KAAK,KACb,IACAulC,EAAO7vB,GAAG,QAAQ,SAAUsrC,GAC1BI,EAAM,gBACFjqC,EAAM4nB,UAASiiB,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,IAG3C7pC,EAAM+qC,YAAc,MAAClB,IAAyD7pC,EAAM+qC,YAAgBlB,GAAUA,EAAMtgE,UAC9G62D,EAAMv3C,KAAKghD,KAEnB4B,GAAS,EACTrd,EAAO4gB,SAEX,IAIc5gB,OACInkD,IAAZY,KAAKwB,IAAyC,mBAAd+hD,EAAO/hD,KACzCxB,KAAKwB,GAAK,SAAoBuqC,GAC5B,OAAO,WACL,OAAOwX,EAAOxX,GAAQ9sB,MAAMskC,EAAQ9nC,UACtC,CACF,CAJU,CAIRja,IAKN,IAAK,IAAIgO,EAAI,EAAGA,EAAIwwD,EAAathE,OAAQ8Q,IACvC+zC,EAAO7vB,GAAGssC,EAAaxwD,GAAIxP,KAAK00B,KAAKW,KAAKr1B,KAAMggE,EAAaxwD,KAY/D,OAPAxP,KAAKkhE,MAAQ,SAAU1xD,GACrB4vD,EAAM,gBAAiB5vD,GACnBoxD,IACFA,GAAS,EACTrd,EAAOmf,SAEX,EACO1iE,IACT,EACsB,mBAAXwZ,SACToyB,EAASluC,UAAU8b,OAAOgrD,eAAiB,WAIzC,YAH0CplE,IAAtCogE,IACFA,EAAoC,EAAQ,MAEvCA,EAAkCx/D,KAC3C,GAEF3C,OAAOqiB,eAAeksB,EAASluC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAeF,aAC7B,IAEFjvC,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAevuC,MACpD,IAEFZ,OAAOqiB,eAAeksB,EAASluC,UAAW,kBAAmB,CAI3DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe8zB,OAC7B,EACApgD,IAAK,SAAaiV,GACZn1B,KAAKwsC,iBACPxsC,KAAKwsC,eAAe8zB,QAAUnrC,EAElC,IAIFyW,EAAS64B,UAAY5B,EACrBxlE,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe9tC,MAC7B,IA+CoB,mBAAX8a,SACToyB,EAASjtC,KAAO,SAAU+lE,EAAU/+B,GAIlC,YAHavmC,IAATT,IACFA,EAAO,EAAQ,MAEVA,EAAKitC,EAAU84B,EAAU/+B,EAClC,qBCx8BF,SAASg/B,EAAoB7gE,EAAMsvB,GACjCwxC,EAAY9gE,EAAMsvB,GAClByxC,EAAY/gE,EACd,CACA,SAAS+gE,EAAY/gE,GACfA,EAAKqoC,iBAAmBroC,EAAKqoC,eAAe00B,WAC5C/8D,EAAK0oC,iBAAmB1oC,EAAK0oC,eAAeq0B,WAChD/8D,EAAK4wB,KAAK,QACZ,CAkBA,SAASkwC,EAAY9gE,EAAMsvB,GACzBtvB,EAAK4wB,KAAK,QAAStB,EACrB,CAYAn2B,EAAOD,QAAU,CACfmkE,QAzFF,SAAiB/tC,EAAK2I,GACpB,IAAIw5B,EAAQv1D,KACR8kE,EAAoB9kE,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAeC,UAC/Ds4B,EAAoB/kE,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeM,UACnE,OAAIq4B,GAAqBC,GACnBhpC,EACFA,EAAG3I,GACMA,IACJpzB,KAAKmsC,eAEEnsC,KAAKmsC,eAAe64B,eAC9BhlE,KAAKmsC,eAAe64B,cAAe,EACnCp3C,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAHpCxF,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAMjCpzB,OAMLA,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,GAI9BzsC,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,GAElCzsC,KAAKohE,SAAShuC,GAAO,MAAM,SAAUA,IAC9B2I,GAAM3I,EACJmiC,EAAMppB,eAECopB,EAAMppB,eAAe64B,aAI/Bp3C,QAAQqO,SAAS4oC,EAAatP,IAH9BA,EAAMppB,eAAe64B,cAAe,EACpCp3C,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,IAH7CxF,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,GAOtC2I,GACTnO,QAAQqO,SAAS4oC,EAAatP,GAC9Bx5B,EAAG3I,IAEHxF,QAAQqO,SAAS4oC,EAAatP,EAElC,IACOv1D,KACT,EA2CEgiE,UAjCF,WACMhiE,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,EAChCzsC,KAAKwsC,eAAe+zB,SAAU,EAC9BvgE,KAAKwsC,eAAeJ,OAAQ,EAC5BpsC,KAAKwsC,eAAeuX,YAAa,GAE/B/jD,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,EAChCzsC,KAAKmsC,eAAeC,OAAQ,EAC5BpsC,KAAKmsC,eAAe84B,QAAS,EAC7BjlE,KAAKmsC,eAAe+4B,aAAc,EAClCllE,KAAKmsC,eAAeg5B,aAAc,EAClCnlE,KAAKmsC,eAAe0X,UAAW,EAC/B7jD,KAAKmsC,eAAe64B,cAAe,EAEvC,EAkBEjF,eAdF,SAAwBxc,EAAQnwB,GAO9B,IAAIgyC,EAAS7hB,EAAO/W,eAChBy2B,EAAS1f,EAAOpX,eAChBi5B,GAAUA,EAAOtE,aAAemC,GAAUA,EAAOnC,YAAavd,EAAO4d,QAAQ/tC,GAAUmwB,EAAO7uB,KAAK,QAAStB,EAClH,2BCxFA,IAAIiyC,EAAwB,8BAiB5BpoE,EAAOD,QAAU,CACf2iE,iBAdF,SAA0BxqC,EAAOtJ,EAASy5C,EAAWrF,GACnD,IAAIsF,EAJN,SAA2B15C,EAASo0C,EAAUqF,GAC5C,OAAgC,MAAzBz5C,EAAQygB,cAAwBzgB,EAAQygB,cAAgB2zB,EAAWp0C,EAAQy5C,GAAa,IACjG,CAEYE,CAAkB35C,EAASo0C,EAAUqF,GAC/C,GAAW,MAAPC,EAAa,CACf,IAAMxkD,SAASwkD,IAAQjkE,KAAKylB,MAAMw+C,KAASA,GAAQA,EAAM,EAEvD,MAAM,IAAIF,EADCpF,EAAWqF,EAAY,gBACIC,GAExC,OAAOjkE,KAAKylB,MAAMw+C,EACpB,CAGA,OAAOpwC,EAAM+qC,WAAa,GAAK,KACjC,2BCqBA,SAASuF,EAActwC,GACrB,IAAIogC,EAAQv1D,KACZA,KAAKyY,KAAO,KACZzY,KAAK0lE,MAAQ,KACb1lE,KAAK47C,OAAS,YA6iBhB,SAAwB+pB,EAASxwC,EAAO/B,GACtC,IAAIsyC,EAAQC,EAAQD,MAEpB,IADAC,EAAQD,MAAQ,KACTA,GAAO,CACZ,IAAI3pC,EAAK2pC,EAAMzlB,SACf9qB,EAAMywC,YACN7pC,EAljBA8pC,WAmjBAH,EAAQA,EAAMjtD,IAChB,CAGA0c,EAAM2wC,mBAAmBrtD,KAAOktD,CAClC,CAxjBIE,CAAetQ,EAAOpgC,EACxB,CACF,CAIA,IAAIwW,EAvBJ1uC,EAAOD,QAAU6uC,EA0BjBA,EAASk6B,cAAgBA,EAGzB,IA+JIC,EA/JAC,EAAe,CACjBjhC,UAAW,EAAQ,KAKjB+tB,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EAOvK6lD,EAAc,EAAQ,IAExBC,EADa,EAAQ,KACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC+4C,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvCC,EAAyB9S,EAAe8S,uBACxCC,EAAuB/S,EAAe+S,qBACtCC,EAAyBhT,EAAegT,uBACxCC,EAA6BjT,EAAeiT,2BAC5CC,EAAuBlT,EAAekT,qBACpCxG,EAAiBL,EAAYK,eAEjC,SAASyG,IAAO,CAChB,SAAST,EAAcl6C,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQ46C,oBAK7DzmE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAG9EjgE,KAAKklE,aAAc,EAGnBllE,KAAKikE,WAAY,EAEjBjkE,KAAKilE,QAAS,EAEdjlE,KAAKosC,OAAQ,EAEbpsC,KAAK6jD,UAAW,EAGhB7jD,KAAKysC,WAAY,EAKjB,IAAIi6B,GAAqC,IAA1B76C,EAAQ86C,cACvB3mE,KAAK2mE,eAAiBD,EAKtB1mE,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAKlD/gE,KAAKtB,OAAS,EAGdsB,KAAK4mE,SAAU,EAGf5mE,KAAK6mE,OAAS,EAMd7mE,KAAKkgD,MAAO,EAKZlgD,KAAK8mE,kBAAmB,EAGxB9mE,KAAK+mE,QAAU,SAAU5wC,IAsQ3B,SAAiBotB,EAAQptB,GACvB,IAAIhB,EAAQouB,EAAOpX,eACf+T,EAAO/qB,EAAM+qB,KACbnkB,EAAK5G,EAAM6xC,QACf,GAAkB,mBAAPjrC,EAAmB,MAAM,IAAImqC,EAExC,GAZF,SAA4B/wC,GAC1BA,EAAMyxC,SAAU,EAChBzxC,EAAM6xC,QAAU,KAChB7xC,EAAMz2B,QAAUy2B,EAAM8xC,SACtB9xC,EAAM8xC,SAAW,CACnB,CAMEC,CAAmB/xC,GACfgB,GAlCN,SAAsBotB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,KAC3C5G,EAAMywC,UACJ1lB,GAGFtyB,QAAQqO,SAASF,EAAI5F,GAGrBvI,QAAQqO,SAASkrC,EAAa5jB,EAAQpuB,GACtCouB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,KAIvB4F,EAAG5F,GACHotB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,GAGvBgxC,EAAY5jB,EAAQpuB,GAExB,CAaUiyC,CAAa7jB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,OAAS,CAErD,IAAI8nB,EAAWwjB,EAAWlyC,IAAUouB,EAAO9W,UACtCoX,GAAa1uB,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBACjEC,EAAYhkB,EAAQpuB,GAElB+qB,EACFtyB,QAAQqO,SAASurC,EAAYjkB,EAAQpuB,EAAO0uB,EAAU9nB,GAEtDyrC,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,EAExC,CACF,CAvRIgrC,CAAQxjB,EAAQptB,EAClB,EAGAn2B,KAAKgnE,QAAU,KAGfhnE,KAAKinE,SAAW,EAChBjnE,KAAKsnE,gBAAkB,KACvBtnE,KAAKynE,oBAAsB,KAI3BznE,KAAK4lE,UAAY,EAIjB5lE,KAAKmlE,aAAc,EAGnBnlE,KAAKglE,cAAe,EAGpBhlE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAK0nE,qBAAuB,EAI5B1nE,KAAK8lE,mBAAqB,IAAIL,EAAczlE,KAC9C,CAqCA,SAAS6rC,EAAShgB,GAahB,IAAIo0C,EAAWjgE,gBAZf2rC,EAASA,GAAU,EAAQ,KAa3B,IAAKs0B,IAAa+F,EAAgB1uD,KAAKu0B,EAAU7rC,MAAO,OAAO,IAAI6rC,EAAShgB,GAC5E7rB,KAAKmsC,eAAiB,IAAI45B,EAAcl6C,EAAS7rB,KAAMigE,GAGvDjgE,KAAKlC,UAAW,EACZ+tB,IAC2B,mBAAlBA,EAAQ5R,QAAsBja,KAAK2nE,OAAS97C,EAAQ5R,OACjC,mBAAnB4R,EAAQ+7C,SAAuB5nE,KAAK6nE,QAAUh8C,EAAQ+7C,QAClC,mBAApB/7C,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,SACtC,mBAAlBt1C,EAAQmR,QAAsBh9B,KAAKw8B,OAAS3Q,EAAQmR,QAEjE+1B,EAAOz7C,KAAKtX,KACd,CAgIA,SAAS8nE,EAAQvkB,EAAQpuB,EAAOyyC,EAAQvmE,EAAK29D,EAAO9/D,EAAU68B,GAC5D5G,EAAM8xC,SAAW5lE,EACjB8zB,EAAM6xC,QAAUjrC,EAChB5G,EAAMyxC,SAAU,EAChBzxC,EAAM+qB,MAAO,EACT/qB,EAAMsX,UAAWtX,EAAM4xC,QAAQ,IAAIX,EAAqB,UAAmBwB,EAAQrkB,EAAOskB,QAAQ7I,EAAO7pC,EAAM4xC,SAAcxjB,EAAOokB,OAAO3I,EAAO9/D,EAAUi2B,EAAM4xC,SACtK5xC,EAAM+qB,MAAO,CACf,CAgDA,SAASsnB,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,GACtC8nB,GASP,SAAsBN,EAAQpuB,GACP,IAAjBA,EAAMz2B,QAAgBy2B,EAAM8uC,YAC9B9uC,EAAM8uC,WAAY,EAClB1gB,EAAO7uB,KAAK,SAEhB,CAdiBqzC,CAAaxkB,EAAQpuB,GACpCA,EAAMywC,YACN7pC,IACAorC,EAAY5jB,EAAQpuB,EACtB,CAaA,SAASoyC,EAAYhkB,EAAQpuB,GAC3BA,EAAM2xC,kBAAmB,EACzB,IAAIpB,EAAQvwC,EAAMmyC,gBAClB,GAAI/jB,EAAOskB,SAAWnC,GAASA,EAAMjtD,KAAM,CAEzC,IAAI1K,EAAIonB,EAAMuyC,qBACVzpE,EAAS,IAAIyD,MAAMqM,GACnBi6D,EAAS7yC,EAAM2wC,mBACnBkC,EAAOtC,MAAQA,EAGf,IAFA,IAAI7wC,EAAQ,EACRozC,GAAa,EACVvC,GACLznE,EAAO42B,GAAS6wC,EACXA,EAAMwC,QAAOD,GAAa,GAC/BvC,EAAQA,EAAMjtD,KACdoc,GAAS,EAEX52B,EAAOgqE,WAAaA,EACpBH,EAAQvkB,EAAQpuB,GAAO,EAAMA,EAAMz2B,OAAQT,EAAQ,GAAI+pE,EAAOpsB,QAI9DzmB,EAAMywC,YACNzwC,EAAMsyC,oBAAsB,KACxBO,EAAOvvD,MACT0c,EAAM2wC,mBAAqBkC,EAAOvvD,KAClCuvD,EAAOvvD,KAAO,MAEd0c,EAAM2wC,mBAAqB,IAAIL,EAActwC,GAE/CA,EAAMuyC,qBAAuB,CAC/B,KAAO,CAEL,KAAOhC,GAAO,CACZ,IAAI1G,EAAQ0G,EAAM1G,MACd9/D,EAAWwmE,EAAMxmE,SACjB68B,EAAK2pC,EAAMzlB,SASf,GAPA6nB,EAAQvkB,EAAQpuB,GAAO,EADbA,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACJsgE,EAAO9/D,EAAU68B,GACpD2pC,EAAQA,EAAMjtD,KACd0c,EAAMuyC,uBAKFvyC,EAAMyxC,QACR,KAEJ,CACc,OAAVlB,IAAgBvwC,EAAMsyC,oBAAsB,KAClD,CACAtyC,EAAMmyC,gBAAkB5B,EACxBvwC,EAAM2xC,kBAAmB,CAC3B,CAoCA,SAASO,EAAWlyC,GAClB,OAAOA,EAAM8vC,QAA2B,IAAjB9vC,EAAMz2B,QAA0C,OAA1By2B,EAAMmyC,kBAA6BnyC,EAAM0uB,WAAa1uB,EAAMyxC,OAC3G,CACA,SAASuB,EAAU5kB,EAAQpuB,GACzBouB,EAAO/mB,QAAO,SAAUpJ,GACtB+B,EAAMywC,YACFxyC,GACF2sC,EAAexc,EAAQnwB,GAEzB+B,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,aACZyyC,EAAY5jB,EAAQpuB,EACtB,GACF,CAaA,SAASgyC,EAAY5jB,EAAQpuB,GAC3B,IAAIizC,EAAOf,EAAWlyC,GACtB,GAAIizC,IAdN,SAAmB7kB,EAAQpuB,GACpBA,EAAMgwC,aAAgBhwC,EAAM+vC,cACF,mBAAlB3hB,EAAO/mB,QAA0BrH,EAAMsX,WAKhDtX,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,eALZS,EAAMywC,YACNzwC,EAAM+vC,aAAc,EACpBt3C,QAAQqO,SAASksC,EAAW5kB,EAAQpuB,IAM1C,CAIIkzC,CAAU9kB,EAAQpuB,GACM,IAApBA,EAAMywC,YACRzwC,EAAM0uB,UAAW,EACjBN,EAAO7uB,KAAK,UACRS,EAAM2rC,cAAa,CAGrB,IAAIsE,EAAS7hB,EAAO/W,iBACf44B,GAAUA,EAAOtE,aAAesE,EAAOrhB,aAC1CR,EAAO4d,SAEX,CAGJ,OAAOiH,CACT,CAxfA,EAAQ,EAAR,CAAoBv8B,EAAUknB,GA4G9BgT,EAAcroE,UAAU6uC,UAAY,WAGlC,IAFA,IAAItzB,EAAUjZ,KAAKsnE,gBACfvjE,EAAM,GACHkV,GACLlV,EAAIia,KAAK/E,GACTA,EAAUA,EAAQR,KAEpB,OAAO1U,CACT,EACA,WACE,IACE1G,OAAOqiB,eAAeqmD,EAAcroE,UAAW,SAAU,CACvDiiB,IAAKsmD,EAAajhC,WAAU,WAC1B,OAAOhlC,KAAKusC,WACd,GAAG,6EAAmF,YAE1F,CAAE,MAAOr8B,GAAI,CACd,CARD,GAasB,mBAAXsJ,QAAyBA,OAAO8uD,aAAiE,mBAA3C/1C,SAAS70B,UAAU8b,OAAO8uD,cACzFtC,EAAkBzzC,SAAS70B,UAAU8b,OAAO8uD,aAC5CjrE,OAAOqiB,eAAemsB,EAAUryB,OAAO8uD,YAAa,CAClD1qE,MAAO,SAAe0qB,GACpB,QAAI09C,EAAgB1uD,KAAKtX,KAAMsoB,IAC3BtoB,OAAS6rC,GACNvjB,GAAUA,EAAO6jB,0BAA0B45B,CACpD,KAGFC,EAAkB,SAAyB19C,GACzC,OAAOA,aAAkBtoB,IAC3B,EA+BF6rC,EAASnuC,UAAU2lE,KAAO,WACxBtD,EAAe//D,KAAM,IAAImmE,EAC3B,EAyBAt6B,EAASnuC,UAAUuc,MAAQ,SAAU+kD,EAAO9/D,EAAU68B,GACpD,IAzNqBjhB,EAyNjBqa,EAAQn1B,KAAKmsC,eACbpnC,GAAM,EACNmjE,GAAS/yC,EAAM+qC,aA3NEplD,EA2N0BkkD,EA1NxC9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAwO9C,OAbI4I,IAAUhqE,EAAO6c,SAASikD,KAC5BA,EAhOJ,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CA8NY4C,CAAoB5C,IAEN,mBAAb9/D,IACT68B,EAAK78B,EACLA,EAAW,MAETgpE,EAAOhpE,EAAW,SAAmBA,IAAUA,EAAWi2B,EAAM4rC,iBAClD,mBAAPhlC,IAAmBA,EAAKyqC,GAC/BrxC,EAAM8vC,OArCZ,SAAuB1hB,EAAQxnB,GAC7B,IAAI5F,EAAK,IAAImwC,EAEbvG,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,EACvB,CAgCoBoyC,CAAcvoE,KAAM+7B,IAAamsC,GA3BrD,SAAoB3kB,EAAQpuB,EAAO6pC,EAAOjjC,GACxC,IAAI5F,EAMJ,OALc,OAAV6oC,EACF7oC,EAAK,IAAIkwC,EACiB,iBAAVrH,GAAuB7pC,EAAM+qC,aAC7C/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,UAAWk4C,KAE3D7oC,IACF4pC,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,IACd,EAGX,CAc8DqyC,CAAWxoE,KAAMm1B,EAAO6pC,EAAOjjC,MACzF5G,EAAMywC,YACN7gE,EAiDJ,SAAuBw+C,EAAQpuB,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,GAC5D,IAAKmsC,EAAO,CACV,IAAIO,EArBR,SAAqBtzC,EAAO6pC,EAAO9/D,GAIjC,OAHKi2B,EAAM+qC,aAAsC,IAAxB/qC,EAAMwxC,eAA4C,iBAAV3H,IAC/DA,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,IAEtB8/D,CACT,CAgBmB0J,CAAYvzC,EAAO6pC,EAAO9/D,GACrC8/D,IAAUyJ,IACZP,GAAQ,EACRhpE,EAAW,SACX8/D,EAAQyJ,EAEZ,CACA,IAAIpnE,EAAM8zB,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACvCy2B,EAAMz2B,QAAU2C,EAChB,IAAI0D,EAAMowB,EAAMz2B,OAASy2B,EAAMmX,cAG/B,GADKvnC,IAAKowB,EAAM8uC,WAAY,GACxB9uC,EAAMyxC,SAAWzxC,EAAM0xC,OAAQ,CACjC,IAAI5jD,EAAOkS,EAAMsyC,oBACjBtyC,EAAMsyC,oBAAsB,CAC1BzI,MAAOA,EACP9/D,SAAUA,EACVgpE,MAAOA,EACPjoB,SAAUlkB,EACVtjB,KAAM,MAEJwK,EACFA,EAAKxK,KAAO0c,EAAMsyC,oBAElBtyC,EAAMmyC,gBAAkBnyC,EAAMsyC,oBAEhCtyC,EAAMuyC,sBAAwB,CAChC,MACEI,EAAQvkB,EAAQpuB,GAAO,EAAO9zB,EAAK29D,EAAO9/D,EAAU68B,GAEtD,OAAOh3B,CACT,CAlFU4jE,CAAc3oE,KAAMm1B,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,IAEpDh3B,CACT,EACA8mC,EAASnuC,UAAUkrE,KAAO,WACxB5oE,KAAKmsC,eAAe06B,QACtB,EACAh7B,EAASnuC,UAAUmrE,OAAS,WAC1B,IAAI1zC,EAAQn1B,KAAKmsC,eACbhX,EAAM0xC,SACR1xC,EAAM0xC,SACD1xC,EAAMyxC,SAAYzxC,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBAAiBC,EAAYvnE,KAAMm1B,GAE/G,EACA0W,EAASnuC,UAAUorE,mBAAqB,SAA4B5pE,GAGlE,GADwB,iBAAbA,IAAuBA,EAAWA,EAAS2c,iBAChD,CAAC,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOY,SAASvd,EAAW,IAAI2c,gBAAkB,GAAI,MAAM,IAAI0qD,EAAqBrnE,GAExL,OADAc,KAAKmsC,eAAe40B,gBAAkB7hE,EAC/Bc,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAQFlvC,OAAOqiB,eAAemsB,EAASnuC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAuKFT,EAASnuC,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACrDA,EAAG,IAAI8jC,EAA2B,YACpC,EACAh0B,EAASnuC,UAAUmqE,QAAU,KAC7Bh8B,EAASnuC,UAAUyD,IAAM,SAAU69D,EAAO9/D,EAAU68B,GAClD,IAAI5G,EAAQn1B,KAAKmsC,eAmBjB,MAlBqB,mBAAV6yB,GACTjjC,EAAKijC,EACLA,EAAQ,KACR9/D,EAAW,MACkB,mBAAbA,IAChB68B,EAAK78B,EACLA,EAAW,MAET8/D,SAAuCh/D,KAAKia,MAAM+kD,EAAO9/D,GAGzDi2B,EAAM0xC,SACR1xC,EAAM0xC,OAAS,EACf7mE,KAAK6oE,UAIF1zC,EAAM8vC,QAyDb,SAAqB1hB,EAAQpuB,EAAO4G,GAClC5G,EAAM8vC,QAAS,EACfkC,EAAY5jB,EAAQpuB,GAChB4G,IACE5G,EAAM0uB,SAAUj2B,QAAQqO,SAASF,GAASwnB,EAAOzwB,KAAK,SAAUiJ,IAEtE5G,EAAMiX,OAAQ,EACdmX,EAAOzlD,UAAW,CACpB,CAjEqBirE,CAAY/oE,KAAMm1B,EAAO4G,GACrC/7B,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAqEFrB,OAAOqiB,eAAemsB,EAASnuC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKmsC,gBAGFnsC,KAAKmsC,eAAeM,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKmsC,iBAMVnsC,KAAKmsC,eAAeM,UAAY7uC,EAClC,IAEFiuC,EAASnuC,UAAUyjE,QAAUzB,EAAYyB,QACzCt1B,EAASnuC,UAAUqkE,WAAarC,EAAYsC,UAC5Cn2B,EAASnuC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,0BC/jBAn2B,EAAOD,QAAU2/B,EACjB,IAAI02B,EAAiB,QACnBwM,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvC8C,EAAqC3V,EAAe2V,mCACpDC,EAA8B5V,EAAe4V,4BAC3Ct9B,EAAS,EAAQ,IAErB,SAASu9B,EAAe/yC,EAAIhb,GAC1B,IAAIguD,EAAKnpE,KAAKopE,gBACdD,EAAGE,cAAe,EAClB,IAAIttC,EAAKotC,EAAGnC,QACZ,GAAW,OAAPjrC,EACF,OAAO/7B,KAAK00B,KAAK,QAAS,IAAIwxC,GAEhCiD,EAAGG,WAAa,KAChBH,EAAGnC,QAAU,KACD,MAAR7rD,GAEFnb,KAAKge,KAAK7C,GACZ4gB,EAAG5F,GACH,IAAIozC,EAAKvpE,KAAKwsC,eACd+8B,EAAGhJ,SAAU,GACTgJ,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBACpCtsC,KAAKkhE,MAAMqI,EAAGj9B,cAElB,CACA,SAAS3P,EAAU9Q,GACjB,KAAM7rB,gBAAgB28B,GAAY,OAAO,IAAIA,EAAU9Q,GACvD8f,EAAOr0B,KAAKtX,KAAM6rB,GAClB7rB,KAAKopE,gBAAkB,CACrBF,eAAgBA,EAAe7zC,KAAKr1B,MACpCwpE,eAAe,EACfH,cAAc,EACdrC,QAAS,KACTsC,WAAY,KACZG,cAAe,MAIjBzpE,KAAKwsC,eAAeg0B,cAAe,EAKnCxgE,KAAKwsC,eAAe0T,MAAO,EACvBr0B,IAC+B,mBAAtBA,EAAQrd,YAA0BxO,KAAK49B,WAAa/R,EAAQrd,WAC1C,mBAAlBqd,EAAQ69C,QAAsB1pE,KAAK69B,OAAShS,EAAQ69C,QAIjE1pE,KAAK0zB,GAAG,YAAa20C,EACvB,CACA,SAASA,IACP,IAAI9S,EAAQv1D,KACe,mBAAhBA,KAAK69B,QAA0B79B,KAAKwsC,eAAeC,UAK5D3O,EAAK99B,KAAM,KAAM,MAJjBA,KAAK69B,QAAO,SAAU1H,EAAIhb,GACxB2iB,EAAKy3B,EAAOp/B,EAAIhb,EAClB,GAIJ,CAiDA,SAAS2iB,EAAKylB,EAAQptB,EAAIhb,GACxB,GAAIgb,EAAI,OAAOotB,EAAO7uB,KAAK,QAASyB,GAQpC,GAPY,MAARhb,GAEFooC,EAAOvlC,KAAK7C,GAKVooC,EAAOpX,eAAeztC,OAAQ,MAAM,IAAIuqE,EAC5C,GAAI1lB,EAAO6lB,gBAAgBC,aAAc,MAAM,IAAIL,EACnD,OAAOzlB,EAAOvlC,KAAK,KACrB,CArHA,EAAQ,EAAR,CAAoB2e,EAAWgP,GAyD/BhP,EAAUj/B,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GAE1C,OADAc,KAAKopE,gBAAgBI,eAAgB,EAC9B79B,EAAOjuC,UAAUsgB,KAAK1G,KAAKtX,KAAMg/D,EAAO9/D,EACjD,EAYAy9B,EAAUj/B,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC1DA,EAAG,IAAI8jC,EAA2B,gBACpC,EACAljC,EAAUj/B,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACtD,IAAIotC,EAAKnpE,KAAKopE,gBAId,GAHAD,EAAGnC,QAAUjrC,EACbotC,EAAGG,WAAatK,EAChBmK,EAAGM,cAAgBvqE,GACdiqE,EAAGE,aAAc,CACpB,IAAIE,EAAKvpE,KAAKwsC,gBACV28B,EAAGK,eAAiBD,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBAAetsC,KAAKkhE,MAAMqI,EAAGj9B,cACzF,CACF,EAKA3P,EAAUj/B,UAAUwjE,MAAQ,SAAU1xD,GACpC,IAAI25D,EAAKnpE,KAAKopE,gBACQ,OAAlBD,EAAGG,YAAwBH,EAAGE,aAMhCF,EAAGK,eAAgB,GALnBL,EAAGE,cAAe,EAClBrpE,KAAK49B,WAAWurC,EAAGG,WAAYH,EAAGM,cAAeN,EAAGD,gBAMxD,EACAvsC,EAAUj/B,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC5C4P,EAAOjuC,UAAU0jE,SAAS9pD,KAAKtX,KAAMozB,GAAK,SAAUu2C,GAClD5tC,EAAG4tC,EACL,GACF,aChLA3sE,EAAQspD,OAAS,EAAjB,KACAtpD,EAAQs7C,WAAa,EAArB,UCDA,IAAIg1B,EAAYhsE,KAAK6B,IAAI,EAAG,IAAM,EAElClG,EAAOD,QAAU,SAAU21D,EAAYta,GACrC,GAA0B,iBAAfsa,EACT,MAAM,IAAI5zD,UAAU,2BAGtB,GAAI4zD,EAAa,EACf,MAAM,IAAI5zD,UAAU,kBAGtB,GAAsB,iBAAXs5C,EACT,MAAM,IAAIt5C,UAAU,2BAGtB,GAAIs5C,EAAS,GAAKA,EAASi1B,GAAaj1B,GAAWA,EACjD,MAAM,IAAIt5C,UAAU,iBAExB,aClBA,IAAIgiE,EAGFA,EADE,EAAAttD,EAAOma,SAAW,EAAAna,EAAOma,QAAQ2/C,QACjB,QACT,EAAA95D,EAAOma,SAAW,EAAAna,EAAOma,QAAQoV,QACtBtlB,SAASkQ,QAAQoV,QAAQ9qB,MAAM,KAAK,GAAGgC,MAAM,GAAI,KAElC,EAAI,QAAU,SAE/B,QAEpBjd,EAAOD,QAAU+jE,aCXjB,IAAIyM,EAAM,EAAQ,KACdrxC,EAAY,EAAQ,IACpBC,EAAM,EAAQ,IACdl+B,EAAS,YAETuvE,EAAkB,EAAQ,KAC1B1M,EAAkB,EAAQ,KAC1B97D,EAAW,EAAQ,KAEnByoE,EAAQxvE,EAAOU,MAAM,KACrB+uE,EAAQ,CACVH,IAAK,GACLprB,KAAM,GACNC,OAAQ,GACRR,OAAQ,GACRC,OAAQ,GACRC,OAAQ,GACR6rB,OAAQ,GACRtrB,UAAW,IAGb,SAAS2D,EAAMvpB,EAAKp+B,EAAKuvE,GACvB,IAAI5+C,EAkCN,SAAoByN,GAQlB,MAAY,WAARA,GAA4B,cAARA,EAJxB,SAAqBvhB,GACnB,OAAO,IAAIghB,GAAYd,OAAOlgB,GAAMshB,QACtC,EAGY,QAARC,EAAsB8wC,EAR1B,SAAkBryD,GAChB,OAAOihB,EAAIM,GAAKrB,OAAOlgB,GAAMshB,QAC/B,CAQF,CA7CaqxC,CAAUpxC,GACjBqxC,EAAqB,WAARrxC,GAA4B,WAARA,EAAoB,IAAM,GAE3Dp+B,EAAII,OAASqvE,EACfzvE,EAAM2wB,EAAK3wB,GACFA,EAAII,OAASqvE,IACtBzvE,EAAMJ,EAAO6hB,OAAO,CAACzhB,EAAKovE,GAAQK,IAKpC,IAFA,IAAIC,EAAO9vE,EAAOW,YAAYkvE,EAAYJ,EAAMjxC,IAC5CuxC,EAAO/vE,EAAOW,YAAYkvE,EAAYJ,EAAMjxC,IACvCl7B,EAAI,EAAGA,EAAIusE,EAAWvsE,IAC7BwsE,EAAKxsE,GAAc,GAATlD,EAAIkD,GACdysE,EAAKzsE,GAAc,GAATlD,EAAIkD,GAGhB,IAAI0sE,EAAQhwE,EAAOW,YAAYkvE,EAAYF,EAAU,GACrDG,EAAK5qE,KAAK8qE,EAAO,EAAG,EAAGH,GACvB/tE,KAAKkuE,MAAQA,EACbluE,KAAKmuE,MAAQH,EACbhuE,KAAKiuE,KAAOA,EACZjuE,KAAK08B,IAAMA,EACX18B,KAAK+tE,UAAYA,EACjB/tE,KAAKivB,KAAOA,EACZjvB,KAAKhB,KAAO2uE,EAAMjxC,EACpB,CAEAupB,EAAKvoD,UAAU0wE,IAAM,SAAUjzD,EAAM6yD,GAInC,OAHA7yD,EAAK/X,KAAK4qE,EAAMhuE,KAAK+tE,WACb/tE,KAAKivB,KAAK++C,GAChB5qE,KAAKpD,KAAKiuE,KAAMjuE,KAAK+tE,WAChB/tE,KAAKivB,KAAKjvB,KAAKiuE,KACxB,EAkDAhxE,EAAOD,QAnCP,SAAiBi5C,EAAUC,EAAMyc,EAAYta,EAAQ5b,GACnDgxC,EAAgB9a,EAAYta,GAM5B,IAAI8J,EAAO,IAAI8D,EAFfxpB,EAASA,GAAU,OAHnBwZ,EAAWhxC,EAASgxC,EAAU8qB,EAAiB,aAC/C7qB,EAAOjxC,EAASixC,EAAM6qB,EAAiB,SAIIriE,QAEvC2vE,EAAKnwE,EAAOW,YAAYw5C,GACxBi2B,EAASpwE,EAAOW,YAAYq3C,EAAKx3C,OAAS,GAC9Cw3C,EAAK9yC,KAAKkrE,EAAQ,EAAG,EAAGp4B,EAAKx3C,QAM7B,IAJA,IAAI6vE,EAAU,EACVC,EAAOb,EAAMlxC,GACb1uB,EAAIzM,KAAKiB,KAAK81C,EAASm2B,GAElBhtE,EAAI,EAAGA,GAAKuM,EAAGvM,IAAK,CAC3B8sE,EAAOxpD,cAActjB,EAAG00C,EAAKx3C,QAK7B,IAHA,IAAI+vE,EAAItsB,EAAKisB,IAAIE,EAAQnsB,EAAK+rB,OAC1BQ,EAAID,EAECjsE,EAAI,EAAGA,EAAImwD,EAAYnwD,IAAK,CACnCksE,EAAIvsB,EAAKisB,IAAIM,EAAGvsB,EAAKgsB,OACrB,IAAK,IAAI/pE,EAAI,EAAGA,EAAIoqE,EAAMpqE,IAAKqqE,EAAErqE,IAAMsqE,EAAEtqE,EAC3C,CAEAqqE,EAAErrE,KAAKirE,EAAIE,GACXA,GAAWC,CACb,CAEA,OAAOH,CACT,aCtGA,IAAInyC,EAAM,EAAQ,IAElBj/B,EAAOD,QAAU,SAAUiB,GACzB,OAAO,IAAIi+B,GAAMb,OAAOp9B,GAAQw+B,QAClC,aCJA,IAAIv+B,EAAS,YAEbjB,EAAOD,QAAU,SAAUknC,EAAOhlC,EAAUgY,GAC1C,GAAIhZ,EAAO6c,SAASmpB,GAClB,OAAOA,EACF,GAAqB,iBAAVA,EAChB,OAAOhmC,EAAOS,KAAKulC,EAAOhlC,GACrB,GAAIkb,YAAYC,OAAO6pB,GAC5B,OAAOhmC,EAAOS,KAAKulC,EAAMjmC,QAEzB,MAAM,IAAIc,UAAUmY,EAAO,2DAE/B,oBCTAja,EAAOD,QAAU,WAChB,GAAsB,mBAAXwc,QAAiE,mBAAjCnc,OAAOo1B,sBAAwC,OAAO,EACjG,GAA+B,iBAApBjZ,OAAO64B,SAAyB,OAAO,EAElD,IAAIv3B,EAAM,CAAC,EACPsL,EAAM5M,OAAO,QACbm1D,EAAStxE,OAAO+oB,GACpB,GAAmB,iBAARA,EAAoB,OAAO,EAEtC,GAA4C,oBAAxC/oB,OAAOK,UAAUwE,SAASoV,KAAK8O,GAA8B,OAAO,EACxE,GAA+C,oBAA3C/oB,OAAOK,UAAUwE,SAASoV,KAAKq3D,GAAiC,OAAO,EAY3E,IAAKvoD,KADLtL,EAAIsL,GADS,GAEDtL,EAAO,OAAO,EAC1B,GAA2B,mBAAhBzd,OAAOkrB,MAAmD,IAA5BlrB,OAAOkrB,KAAKzN,GAAKpc,OAAgB,OAAO,EAEjF,GAA0C,mBAA/BrB,OAAOq1B,qBAAiF,IAA3Cr1B,OAAOq1B,oBAAoB5X,GAAKpc,OAAgB,OAAO,EAE/G,IAAIkwE,EAAOvxE,OAAOo1B,sBAAsB3X,GACxC,GAAoB,IAAhB8zD,EAAKlwE,QAAgBkwE,EAAK,KAAOxoD,EAAO,OAAO,EAEnD,IAAK/oB,OAAOK,UAAUmxE,qBAAqBv3D,KAAKwD,EAAKsL,GAAQ,OAAO,EAEpE,GAA+C,mBAApC/oB,OAAOonC,yBAAyC,CAC1D,IAAIqqC,EAAazxE,OAAOonC,yBAAyB3pB,EAAKsL,GACtD,GAdY,KAcR0oD,EAAWlxE,QAA8C,IAA1BkxE,EAAWjxE,WAAuB,OAAO,CAC7E,CAEA,OAAO,CACR,0BCvCA,IAAIkxE,EAAa,EAAQ,KAErBr5B,EAAQr4C,OAAOK,UAAUwE,SACzBgsB,EAAiB7wB,OAAOK,UAAUwwB,eAwDtCjxB,EAAOD,QAnBO,SAAiBgjB,EAAMqyB,EAAU28B,GAC3C,IAAKD,EAAW18B,GACZ,MAAM,IAAItzC,UAAU,+BAGxB,IAAIszB,EACA5W,UAAU/c,QAAU,IACpB2zB,EAAW28C,GAGU,mBAArBt5B,EAAMp+B,KAAK0I,GA7CA,SAAsBzE,EAAO82B,EAAUhgB,GACtD,IAAK,IAAI7wB,EAAI,EAAGH,EAAMka,EAAM7c,OAAQ8C,EAAIH,EAAKG,IACrC0sB,EAAe5W,KAAKiE,EAAO/Z,KACX,MAAZ6wB,EACAggB,EAAS92B,EAAM/Z,GAAIA,EAAG+Z,GAEtB82B,EAAS/6B,KAAK+a,EAAU9W,EAAM/Z,GAAIA,EAAG+Z,GAIrD,CAoCQ0zD,CAAajvD,EAAMqyB,EAAUhgB,GACN,iBAATrS,EAnCF,SAAuBvf,EAAQ4xC,EAAUhgB,GACzD,IAAK,IAAI7wB,EAAI,EAAGH,EAAMZ,EAAO/B,OAAQ8C,EAAIH,EAAKG,IAE1B,MAAZ6wB,EACAggB,EAAS5xC,EAAOuoB,OAAOxnB,GAAIA,EAAGf,GAE9B4xC,EAAS/6B,KAAK+a,EAAU5xB,EAAOuoB,OAAOxnB,GAAIA,EAAGf,EAGzD,CA2BQyuE,CAAclvD,EAAMqyB,EAAUhgB,GAzBlB,SAAuB/J,EAAQ+pB,EAAUhgB,GACzD,IAAK,IAAIjuB,KAAKkkB,EACN4F,EAAe5W,KAAKgR,EAAQlkB,KACZ,MAAZiuB,EACAggB,EAAS/pB,EAAOlkB,GAAIA,EAAGkkB,GAEvB+pB,EAAS/6B,KAAK+a,EAAU/J,EAAOlkB,GAAIA,EAAGkkB,GAItD,CAiBQ6mD,CAAcnvD,EAAMqyB,EAAUhgB,EAEtC,0BCzDA,IAAI+8C,EAAgB,CACnB,gBACA,iBACA,eACA,eACA,aACA,aACA,YACA,cACA,cACA,aACA,qBAGG37D,EAA0B,oBAAfrW,WAA6B,EAAAqW,EAASrW,WAErDH,EAAOD,QAAU,WAEhB,IADA,IAAI+G,EAAM,GACDvC,EAAI,EAAGA,EAAI4tE,EAAc1wE,OAAQ8C,IACN,mBAAxBiS,EAAE27D,EAAc5tE,MAC1BuC,EAAIA,EAAIrF,QAAU0wE,EAAc5tE,IAGlC,OAAOuC,CACR,0BCxBA,IAEI4tC,EAFe,EAAQ,GAEfsH,CAAa,qCAAqC,GAE9D,GAAItH,EACH,IACCA,EAAM,GAAI,SACX,CAAE,MAAOpxC,GAERoxC,EAAQ,IACT,CAGD10C,EAAOD,QAAU20C,0BCbjB,IAAIzK,EAAU,EAAQ,KAClBmoC,EAAuB,EAAQ,KAC/BC,EAAY,EAAQ,IAEpBC,EAAYD,EAAU,6BACtBE,EAAiB,EAAQ,GAAR,GACjBC,EAAO,EAAQ,KAEfh8D,EAA0B,oBAAfrW,WAA6B,EAAAqW,EAASrW,WACjDsyE,EAAcL,IAEd3pB,EAAW4pB,EAAU,2BAA2B,IAAS,SAAiB/zD,EAAO3d,GACpF,IAAK,IAAI4D,EAAI,EAAGA,EAAI+Z,EAAM7c,OAAQ8C,GAAK,EACtC,GAAI+Z,EAAM/Z,KAAO5D,EAChB,OAAO4D,EAGT,OAAQ,CACT,EACImuE,EAASL,EAAU,0BACnBM,EAAY,CAAC,EACb75C,EAAiB14B,OAAO04B,eACxBy5C,GAAkBC,GAAQ15C,GAC7BmR,EAAQwoC,GAAa,SAAUG,GAC9B,IAAIlzD,EAAM,IAAIlJ,EAAEo8D,GAChB,GAAIr2D,OAAO43B,eAAez0B,EAAK,CAC9B,IAAI0C,EAAQ0W,EAAepZ,GACvBmyD,EAAaW,EAAKpwD,EAAO7F,OAAO43B,aACpC,IAAK09B,EAAY,CAChB,IAAIgB,EAAa/5C,EAAe1W,GAChCyvD,EAAaW,EAAKK,EAAYt2D,OAAO43B,YACtC,CACAw+B,EAAUC,GAAcf,EAAWnvD,GACpC,CACD,IAeD1iB,EAAOD,QAAU,SAAsBY,GACtC,IAAKA,GAA0B,iBAAVA,EAAsB,OAAO,EAClD,IAAK4xE,KAAoBh2D,OAAO43B,eAAexzC,GAAQ,CACtD,IAAIu5C,EAAMw4B,EAAOJ,EAAU3xE,GAAQ,GAAI,GACvC,OAAO8nD,EAASgqB,EAAav4B,IAAQ,CACtC,CACA,QAAKs4B,GAlBe,SAA2B7xE,GAC/C,IAAImyE,GAAU,EAQd,OAPA7oC,EAAQ0oC,GAAW,SAAUI,EAAQH,GACpC,IAAKE,EACJ,IACCA,EAAUC,EAAO14D,KAAK1Z,KAAWiyE,CAClC,CAAE,MAAOtvE,GAAU,CAErB,IACOwvE,CACR,CASQE,CAAeryE,EACvB,0BCzDA,IAAIV,EAAS,EAAQ,IACjBuoD,EAAW,EAAQ,IAEnBE,EAAiB,EAAQ,KACzBuqB,EAAc,EAAQ,KACtBC,EAAO,EAAQ,KAEfC,EAAW3qB,EAASyqB,IAAe7yE,QAEvCH,EAAOkzE,EAAU,CAChBF,YAAaA,EACbvqB,eAAgBA,EAChBwqB,KAAMA,IAGPlzE,EAAOD,QAAUozE,oBCfjB,IAAI16B,EAAQr4C,OAAOK,UAAUwE,SAE7BjF,EAAOD,QAAU,SAAqBY,GACrC,IAAIqD,EAAMy0C,EAAMp+B,KAAK1Z,GACjByyE,EAAiB,uBAARpvE,EASb,OARKovE,IACJA,EAAiB,mBAARpvE,GACE,OAAVrD,GACiB,iBAAVA,GACiB,iBAAjBA,EAAMc,QACbd,EAAMc,QAAU,GACa,sBAA7Bg3C,EAAMp+B,KAAK1Z,EAAM0yE,SAEZD,CACR,oBCdA,IAAIp1D,EAAc,SAAUrd,GAC3B,OAAOA,GAAUA,CAClB,EAEAX,EAAOD,QAAU,SAAYgH,EAAGC,GAC/B,OAAU,IAAND,GAAiB,IAANC,EACP,EAAID,GAAM,EAAIC,EAElBD,IAAMC,MAGNgX,EAAYjX,KAAMiX,EAAYhX,GAInC,0BCfA,IAAI0hD,EAAiB,EAAQ,KAE7B1oD,EAAOD,QAAU,WAChB,MAA4B,mBAAdK,OAAO22D,GAAoB32D,OAAO22D,GAAKrO,CACtD,oBCFA1oD,EAAOD,QAAU,SAAeY,GAC/B,OAAOA,GAAUA,CAClB,0BCJA,IAAI+nD,EAAiB,EAAQ,KAE7B1oD,EAAOD,QAAU,WAChB,OAAIsgB,OAAOsV,OAAStV,OAAOsV,MAAM29C,OAASjzD,OAAOsV,MAAM,KAC/CtV,OAAOsV,MAER+yB,CACR,0BCRA,IAAIjmD,EAAW,EAAQ,GACnB8wE,EAAS,EAAQ,KACjBlqD,EAAO,EAAQ,IACfpoB,EAAS,YACTsvE,EAAM,EAAQ,KACdrxC,EAAY,EAAQ,IAEpBC,EAAM,EAAQ,IAEdsxC,EAAQxvE,EAAOU,MAAM,KAEzB,SAASqnD,EAAMvpB,EAAKp+B,GAClBgoB,EAAKhP,KAAKtX,KAAM,UACG,iBAAR1B,IACTA,EAAMJ,EAAOS,KAAKL,IAGpB,IAAIyvE,EAAqB,WAARrxC,GAA4B,WAARA,EAAoB,IAAM,GAE/D18B,KAAKywE,KAAO/zC,EACZ18B,KAAKyjD,KAAOnlD,EACRA,EAAII,OAASqvE,EAEfzvE,GADmB,WAARo+B,EAAmB,IAAIP,EAAcC,EAAIM,IACzCrB,OAAO/8B,GAAKm+B,SACdn+B,EAAII,OAASqvE,IACtBzvE,EAAMJ,EAAO6hB,OAAO,CAACzhB,EAAKovE,GAAQK,IAMpC,IAHA,IAAIC,EAAOhuE,KAAK0wE,MAAQxyE,EAAOW,YAAYkvE,GACvCE,EAAOjuE,KAAK2wE,MAAQzyE,EAAOW,YAAYkvE,GAElCvsE,EAAI,EAAGA,EAAIusE,EAAWvsE,IAC7BwsE,EAAKxsE,GAAc,GAATlD,EAAIkD,GACdysE,EAAKzsE,GAAc,GAATlD,EAAIkD,GAEhBxB,KAAKs8B,MAAgB,WAARI,EAAmB,IAAIP,EAAcC,EAAIM,GACtD18B,KAAKs8B,MAAMjB,OAAO2yC,EACpB,CAEAtuE,EAASumD,EAAM3/B,GAEf2/B,EAAKvoD,UAAU6+B,QAAU,SAAUphB,GACjCnb,KAAKs8B,MAAMjB,OAAOlgB,EACpB,EAEA8qC,EAAKvoD,UAAU8+B,OAAS,WACtB,IAAInrB,EAAIrR,KAAKs8B,MAAMG,SAEnB,OADyB,WAAdz8B,KAAKywE,KAAoB,IAAIt0C,EAAcC,EAAIp8B,KAAKywE,OACnDp1C,OAAOr7B,KAAK2wE,OAAOt1C,OAAOhqB,GAAGorB,QAC3C,EAEAx/B,EAAOD,QAAU,SAAqB0/B,EAAKp+B,GAEzC,MAAY,YADZo+B,EAAMA,EAAI7gB,gBACsB,cAAR6gB,EACf,IAAIupB,EAAK,SAAU3nD,GAEhB,QAARo+B,EACK,IAAI8zC,EAAOhD,EAAKlvE,GAElB,IAAI2nD,EAAKvpB,EAAKp+B,EACvB,0BC3DA,IAAIgB,EAAS,EAAQ,GACjBI,EAAW,EAAQ,GAEnBuqB,EAAQ,EAAQ,KAChBu8B,EAAS,EAAQ,IAErB,SAASoqB,IACP5wE,KAAKmX,IAAM,IAAIzV,MAAM,GACrB1B,KAAKuoB,KAAO,IACd,CAEA,SAASsoD,EAAIhlD,GACX26B,EAAOlvC,KAAKtX,KAAM6rB,GAElB,IAAIsJ,EAAQ,IAAIy7C,EAChB5wE,KAAK8wE,UAAY37C,EAEjBn1B,KAAK+wE,WAAW57C,EAAOtJ,EAAQvtB,IACjC,CACAoB,EAASmxE,EAAKrqB,GACdvpD,EAAOD,QAAU6zE,EAEjBA,EAAIvzE,OAAS,SAAgBuuB,GAC3B,OAAO,IAAIglD,EAAIhlD,EACjB,EAEA,IAAImlD,EAAa,CACf,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGvBH,EAAInzE,UAAUqzE,WAAa,SAAoB57C,EAAO72B,GACpD62B,EAAM5M,KAAO,IAAI7mB,MAAM,IAEvBpC,EAAOksB,MAAMltB,EAAII,OAAQsB,KAAK06B,UAAW,sBAEzC,IAAIu2C,EAAKhnD,EAAMrH,aAAatkB,EAAK,GAC7B4yE,EAAKjnD,EAAMrH,aAAatkB,EAAK,GAEjC2rB,EAAMknD,IAAIF,EAAIC,EAAI/7C,EAAMhe,IAAK,GAC7B85D,EAAK97C,EAAMhe,IAAI,GACf+5D,EAAK/7C,EAAMhe,IAAI,GACf,IAAK,IAAI3V,EAAI,EAAGA,EAAI2zB,EAAM5M,KAAK7pB,OAAQ8C,GAAK,EAAG,CAC7C,IAAI4Q,EAAQ4+D,EAAWxvE,IAAM,GAC7ByvE,EAAKhnD,EAAMmnD,OAAOH,EAAI7+D,GACtB8+D,EAAKjnD,EAAMmnD,OAAOF,EAAI9+D,GACtB6X,EAAMonD,IAAIJ,EAAIC,EAAI/7C,EAAM5M,KAAM/mB,EAChC,CACF,EAEAqvE,EAAInzE,UAAU6+B,QAAU,SAAiB+0C,EAAKC,EAAOxtE,EAAKytE,GACxD,IAAIr8C,EAAQn1B,KAAK8wE,UAEb/iE,EAAIkc,EAAMrH,aAAa0uD,EAAKC,GAC5BxwE,EAAIkpB,EAAMrH,aAAa0uD,EAAKC,EAAQ,GAGxCtnD,EAAMwnD,GAAG1jE,EAAGhN,EAAGo0B,EAAMhe,IAAK,GAC1BpJ,EAAIonB,EAAMhe,IAAI,GACdpW,EAAIo0B,EAAMhe,IAAI,GAEI,YAAdnX,KAAKkb,KACPlb,KAAK0xE,SAASv8C,EAAOpnB,EAAGhN,EAAGo0B,EAAMhe,IAAK,GAEtCnX,KAAK2xE,SAASx8C,EAAOpnB,EAAGhN,EAAGo0B,EAAMhe,IAAK,GAExCpJ,EAAIonB,EAAMhe,IAAI,GACdpW,EAAIo0B,EAAMhe,IAAI,GAEd8S,EAAMnF,cAAc/gB,EAAKgK,EAAGyjE,GAC5BvnD,EAAMnF,cAAc/gB,EAAKhD,EAAGywE,EAAS,EACvC,EAEAX,EAAInzE,UAAUqzC,KAAO,SAAc9yC,EAAQyE,GAEzC,IADA,IAAI9E,EAAQK,EAAOS,OAASgE,EACnBlB,EAAIkB,EAAKlB,EAAIvD,EAAOS,OAAQ8C,IACnCvD,EAAOuD,GAAK5D,EAEd,OAAO,CACT,EAEAizE,EAAInzE,UAAUorD,OAAS,SAAgB7qD,GAErC,IADA,IAAIqqC,EAAMrqC,EAAOA,EAAOS,OAAS,GACxB8C,EAAIvD,EAAOS,OAAS4pC,EAAK9mC,EAAIvD,EAAOS,OAAQ8C,IACnDlC,EAAOksB,MAAMvtB,EAAOuD,GAAI8mC,GAE1B,OAAOrqC,EAAOic,MAAM,EAAGjc,EAAOS,OAAS4pC,EACzC,EAEAuoC,EAAInzE,UAAUg0E,SAAW,SAAkBv8C,EAAOy8C,EAAQC,EAAQ9tE,EAAKrB,GAKrE,IAJA,IAAIqL,EAAI6jE,EACJ7wE,EAAI8wE,EAGCrwE,EAAI,EAAGA,EAAI2zB,EAAM5M,KAAK7pB,OAAQ8C,GAAK,EAAG,CAC7C,IAAIswE,EAAO38C,EAAM5M,KAAK/mB,GAClBuwE,EAAO58C,EAAM5M,KAAK/mB,EAAI,GAG1ByoB,EAAM+nD,OAAOjxE,EAAGo0B,EAAMhe,IAAK,GAE3B26D,GAAQ38C,EAAMhe,IAAI,GAClB46D,GAAQ58C,EAAMhe,IAAI,GAClB,IAAI1I,EAAIwb,EAAMgoD,WAAWH,EAAMC,GAG3BlsE,EAAI9E,EACRA,GAAKgN,EAHGkc,EAAM/b,QAAQO,MAGN,EAChBV,EAAIlI,CACN,CAGAokB,EAAMioD,IAAInxE,EAAGgN,EAAGhK,EAAKrB,EACvB,EAEAmuE,EAAInzE,UAAUi0E,SAAW,SAAkBx8C,EAAOy8C,EAAQC,EAAQ9tE,EAAKrB,GAKrE,IAJA,IAAIqL,EAAI8jE,EACJ9wE,EAAI6wE,EAGCpwE,EAAI2zB,EAAM5M,KAAK7pB,OAAS,EAAG8C,GAAK,EAAGA,GAAK,EAAG,CAClD,IAAIswE,EAAO38C,EAAM5M,KAAK/mB,GAClBuwE,EAAO58C,EAAM5M,KAAK/mB,EAAI,GAG1ByoB,EAAM+nD,OAAOjkE,EAAGonB,EAAMhe,IAAK,GAE3B26D,GAAQ38C,EAAMhe,IAAI,GAClB46D,GAAQ58C,EAAMhe,IAAI,GAClB,IAAI1I,EAAIwb,EAAMgoD,WAAWH,EAAMC,GAG3BlsE,EAAIkI,EACRA,GAAKhN,EAHGkpB,EAAM/b,QAAQO,MAGN,EAChB1N,EAAI8E,CACN,CAGAokB,EAAMioD,IAAInkE,EAAGhN,EAAGgD,EAAKrB,EACvB,aC7IA,IAAIm0C,EAAU,EAAQ,KAClBs7B,EAAY,EAAQ,KACpB3oB,EAAQ,EAAQ,KAMpBxsD,EAAQypD,aAAezpD,EAAQwpD,OAAS3P,EAAQ4P,aAChDzpD,EAAQ2pD,eAAiB3pD,EAAQ0pD,SAAW7P,EAAQ8P,eACpD3pD,EAAQ6pD,eAAiB7pD,EAAQ4pD,SAAWurB,EAAUtrB,eACtD7pD,EAAQu7C,iBAAmBv7C,EAAQ8pD,WAAaqrB,EAAU55B,iBAC1Dv7C,EAAQgqD,YAAchqD,EAAQ+pD,WAR9B,WACE,OAAO1pD,OAAOkrB,KAAKihC,EACrB,OCQAvsD,EAAOD,QAdP,SAAiBs5C,GAGf,IAFA,IACI8Y,EADA/tD,EAAMi1C,EAAG53C,OAEN2C,KAAO,CAEZ,GAAa,OADb+tD,EAAO9Y,EAAGj0B,UAAUhhB,IAGb,CACL+tD,IACA9Y,EAAGhyB,WAAW8qC,EAAM/tD,GACpB,KACF,CALEi1C,EAAGhyB,WAAW,EAAGjjB,EAMrB,CACF,aCbA,IAAIklD,EAAM,EAAQ,IACdroD,EAAS,YACTy+B,EAAY,EAAQ,IACpBj9B,EAAW,EAAQ,GACnB0yE,EAAQ,EAAQ,KAChB7qE,EAAM,EAAQ,IACd8qE,EAAS,EAAQ,KAqCrB,SAASC,EAAchgE,EAAMhU,EAAKg4C,EAAIyB,GACpCpb,EAAUrlB,KAAKtX,MAEf,IAAIqR,EAAInT,EAAOU,MAAM,EAAG,GAExBoB,KAAKuyE,QAAU,IAAIhsB,EAAI8E,IAAI/sD,GAC3B,IAAIk0E,EAAKxyE,KAAKuyE,QAAQrmB,aAAa76C,GACnCrR,KAAKyyE,OAAS,IAAIL,EAAMI,GACxBl8B,EA/BF,SAAiBxyC,EAAMwyC,EAAIk8B,GACzB,GAAkB,KAAdl8B,EAAG53C,OAEL,OADAoF,EAAK4uE,OAASx0E,EAAO6hB,OAAO,CAACu2B,EAAIp4C,EAAOS,KAAK,CAAC,EAAG,EAAG,EAAG,MAChDT,EAAO6hB,OAAO,CAACu2B,EAAIp4C,EAAOS,KAAK,CAAC,EAAG,EAAG,EAAG,MAElD,IAAIg0E,EAAQ,IAAIP,EAAMI,GAClBnxE,EAAMi1C,EAAG53C,OACTk0E,EAAQvxE,EAAM,GAClBsxE,EAAMt3C,OAAOib,GACTs8B,IACFA,EAAQ,GAAKA,EACbD,EAAMt3C,OAAOn9B,EAAOU,MAAMg0E,EAAO,KAEnCD,EAAMt3C,OAAOn9B,EAAOU,MAAM,EAAG,IAC7B,IAAIi0E,EAAe,EAANxxE,EACTg5C,EAAOn8C,EAAOU,MAAM,GACxBy7C,EAAKj2B,YAAYyuD,EAAQ,EAAG,GAC5BF,EAAMt3C,OAAOgf,GACbv2C,EAAK4uE,OAASC,EAAMx9C,MACpB,IAAIpxB,EAAM7F,EAAOS,KAAKmF,EAAK4uE,QAE3B,OADAL,EAAOtuE,GACAA,CACT,CASO+uE,CAAO9yE,KAAMs2C,EAAIk8B,GAEtBxyE,KAAK+yE,MAAQ70E,EAAOS,KAAK23C,GACzBt2C,KAAKgzE,OAAS90E,EAAOW,YAAY,GACjCmB,KAAKizE,UAAY/0E,EAAOW,YAAY,GACpCmB,KAAK2xE,SAAW55B,EAChB/3C,KAAKkzE,MAAQ,EACblzE,KAAKghC,KAAO,EACZhhC,KAAKmzE,MAAQ7gE,EAEbtS,KAAKozE,SAAW,KAChBpzE,KAAKqzE,SAAU,CACjB,CAEA3zE,EAAS4yE,EAAc31C,GAEvB21C,EAAa50E,UAAU6+B,QAAU,SAAUyiC,GACzC,IAAKh/D,KAAKqzE,SAAWrzE,KAAKkzE,MAAO,CAC/B,IAAII,EAAO,GAAMtzE,KAAKkzE,MAAQ,GAC1BI,EAAO,KACTA,EAAOp1E,EAAOU,MAAM00E,EAAM,GAC1BtzE,KAAKyyE,OAAOp3C,OAAOi4C,GAEvB,CAEAtzE,KAAKqzE,SAAU,EACf,IAAItvE,EAAM/D,KAAKmzE,MAAMI,QAAQvzE,KAAMg/D,GAOnC,OANIh/D,KAAK2xE,SACP3xE,KAAKyyE,OAAOp3C,OAAO2jC,GAEnBh/D,KAAKyyE,OAAOp3C,OAAOt3B,GAErB/D,KAAKghC,MAAQg+B,EAAMtgE,OACZqF,CACT,EAEAuuE,EAAa50E,UAAU8+B,OAAS,WAC9B,GAAIx8B,KAAK2xE,WAAa3xE,KAAKozE,SAAU,MAAM,IAAI3zE,MAAM,oDAErD,IAAI03C,EAAM5vC,EAAIvH,KAAKyyE,OAAOz1C,MAAmB,EAAbh9B,KAAKkzE,MAAuB,EAAZlzE,KAAKghC,MAAWhhC,KAAKuyE,QAAQrmB,aAAalsD,KAAK0yE,SAC/F,GAAI1yE,KAAK2xE,UAnFX,SAAkB3tE,EAAGC,GACnB,IAAIF,EAAM,EACNC,EAAEtF,SAAWuF,EAAEvF,QAAQqF,IAG3B,IADA,IAAI1C,EAAMC,KAAKC,IAAIyC,EAAEtF,OAAQuF,EAAEvF,QACtB8C,EAAI,EAAGA,EAAIH,IAAOG,EACzBuC,GAAQC,EAAExC,GAAKyC,EAAEzC,GAGnB,OAAOuC,CACT,CAyEuByvE,CAAQr8B,EAAKn3C,KAAKozE,UAAW,MAAM,IAAI3zE,MAAM,oDAElEO,KAAKozE,SAAWj8B,EAChBn3C,KAAKuyE,QAAQlmB,OACf,EAEAimB,EAAa50E,UAAU+/B,WAAa,WAClC,GAAIz9B,KAAK2xE,WAAazzE,EAAO6c,SAAS/a,KAAKozE,UAAW,MAAM,IAAI3zE,MAAM,mDAEtE,OAAOO,KAAKozE,QACd,EAEAd,EAAa50E,UAAUggC,WAAa,SAAqByZ,GACvD,IAAKn3C,KAAK2xE,SAAU,MAAM,IAAIlyE,MAAM,mDAEpCO,KAAKozE,SAAWj8B,CAClB,EAEAm7B,EAAa50E,UAAUigC,OAAS,SAAiBx+B,GAC/C,GAAIa,KAAKqzE,QAAS,MAAM,IAAI5zE,MAAM,8CAElCO,KAAKyyE,OAAOp3C,OAAOl8B,GACnBa,KAAKkzE,OAAS/zE,EAAIT,MACpB,EAEAzB,EAAOD,QAAUs1E,aCpHjB,IAAI/rB,EAAM,EAAQ,IACdroD,EAAS,YACTy+B,EAAY,EAAQ,IAGxB,SAAS21C,EAAchgE,EAAMhU,EAAKg4C,EAAIyB,GACpCpb,EAAUrlB,KAAKtX,MAEfA,KAAKuyE,QAAU,IAAIhsB,EAAI8E,IAAI/sD,GAC3B0B,KAAK+yE,MAAQ70E,EAAOS,KAAK23C,GACzBt2C,KAAKgzE,OAAS90E,EAAOW,YAAY,GACjCmB,KAAKizE,UAAY/0E,EAAOW,YAAY,GACpCmB,KAAK2xE,SAAW55B,EAChB/3C,KAAKmzE,MAAQ7gE,CACf,CAXe,EAAQ,EAavB5S,CAAS4yE,EAAc31C,GAEvB21C,EAAa50E,UAAU6+B,QAAU,SAAUyiC,GACzC,OAAOh/D,KAAKmzE,MAAMI,QAAQvzE,KAAMg/D,EAAOh/D,KAAK2xE,SAC9C,EAEAW,EAAa50E,UAAU8+B,OAAS,WAC9Bx8B,KAAKuyE,QAAQlmB,OACf,EAEApvD,EAAOD,QAAUs1E,aC1BjB,IAAIh7C,EAAc,EAAQ,IAC1Br6B,EAAOD,QAAUy2E,EACjBA,EAAUC,YAAcA,EACxBD,EAAUE,WAAaA,EACvB,IAAIh0E,EAAK,EAAQ,GACbi0E,EAAa,IAAIj0E,EAAG,IAEpBk0E,EAAc,IADA,EAAQ,MAEtBC,EAAM,IAAIn0E,EAAG,GACbo0E,EAAM,IAAIp0E,EAAG,GACbq0E,EAAO,IAAIr0E,EAAG,GAGds0E,GAFU,IAAIt0E,EAAG,IACT,IAAIA,EAAG,GACT,IAAIA,EAAG,KACbu0E,EAAQ,IAAIv0E,EAAG,GAEfw0E,GADQ,IAAIx0E,EAAG,GACN,IAAIA,EAAG,KAChBy0E,EAAO,IAAIz0E,EAAG,GAEdiX,GADS,IAAIjX,EAAG,IACP,MAEb,SAAS00E,IACP,GAAe,OAAXz9D,EACF,OAAOA,EAET,IACIrR,EAAM,GACVA,EAAI,GAAK,EACT,IAAK,IAAI/D,EAAI,EAAG4C,EAAI,EAAGA,EAHX,QAGsBA,GAAK,EAAG,CAExC,IADA,IAAIoS,EAAOlV,KAAKiB,KAAKjB,KAAKkV,KAAKpS,IACtB5B,EAAI,EAAGA,EAAIhB,GAAK+D,EAAI/C,IAAMgU,GAC7BpS,EAAImB,EAAI/C,IAAO,EADoBA,KAIrChB,IAAMgB,GAAK+C,EAAI/C,IAAMgU,IAGzBjR,EAAI/D,KAAO4C,EACb,CAEA,OADAwS,EAASrR,EACFA,CACT,CAEA,SAASmuE,EAAY3kE,GAGnB,IAFA,IAAI6H,EAASy9D,IAEJ7yE,EAAI,EAAGA,EAAIoV,EAAOlY,OAAQ8C,IACjC,GAA0B,IAAtBuN,EAAEnK,KAAKgS,EAAOpV,IAChB,OAA0B,IAAtBuN,EAAEsF,KAAKuC,EAAOpV,IAOtB,OAAO,CACT,CAEA,SAASmyE,EAAW5kE,GAClB,IAAI5O,EAAMR,EAAGwZ,KAAKpK,GAClB,OAA8D,IAAvDglE,EAAI3+D,MAAMjV,GAAKwW,OAAO5H,EAAEkD,KAAK,IAAIuD,UAAUnB,KAAK,EACzD,CAEA,SAASo/D,EAAU1iE,EAAMkjC,GACvB,GAAIljC,EAAO,GAET,OACS,IAAIpR,EADD,IAARs0C,GAAqB,IAARA,EACD,CAAC,IAAM,KAEP,CAAC,IAAM,KAKzB,IAAIxyC,EAAK6yE,EAET,IAJArgC,EAAM,IAAIt0C,EAAGs0C,KAIA,CAEX,IADAxyC,EAAM,IAAI9B,EAAG23B,EAAYh2B,KAAKiB,KAAKwO,EAAO,KACnCtP,EAAIsE,YAAcgL,GACvBtP,EAAI+P,MAAM,GAQZ,GANI/P,EAAIiS,UACNjS,EAAIqG,KAAKgsE,GAENryE,EAAI+E,MAAM,IACb/E,EAAIqG,KAAKisE,GAEN9/B,EAAIlyC,IAAIgyE,IAIN,IAAK9/B,EAAIlyC,IAAIiyE,GAClB,KAAOvyE,EAAIsB,IAAIkxE,GAAKlyE,IAAImyE,IACtBzyE,EAAIqG,KAAKssE,QALX,KAAO3yE,EAAIsB,IAAI6wE,GAAY7xE,IAAIoyE,IAC7B1yE,EAAIqG,KAAKssE,GAQb,GAAIV,EADJY,EAAK7yE,EAAIkQ,KAAK,KACS+hE,EAAYjyE,IACjCkyE,EAAWW,IAAOX,EAAWlyE,IAC7BoyE,EAAYjrD,KAAK0rD,IAAOT,EAAYjrD,KAAKnnB,GACzC,OAAOA,CAEX,CAEF,aCxGA,IAAI8yE,EAAK,EAAQ,GACbC,EAAU,EAAQ,IAEtB,SAASC,EAAYxxC,GACnBjjC,KAAKijC,KAAOA,GAAQ,IAAIuxC,EAAQtzB,IAClC,CACAjkD,EAAOD,QAAUy3E,EAEjBA,EAAYn3E,OAAS,SAAgB2lC,GACnC,OAAO,IAAIwxC,EAAYxxC,EACzB,EAEAwxC,EAAY/2E,UAAUg3E,WAAa,SAAoBllE,GACrD,IAAInO,EAAMmO,EAAEzJ,YACR4uE,EAAYrzE,KAAKiB,KAAKlB,EAAM,GAIhC,GACE,IAAI2C,EAAI,IAAIuwE,EAAGv0E,KAAKijC,KAAKke,SAASwzB,UAC7B3wE,EAAEjC,IAAIyN,IAAM,GAEnB,OAAOxL,CACT,EAEAywE,EAAY/2E,UAAUk3E,WAAa,SAAoB1zE,EAAO2zE,GAE5D,IAAI71E,EAAO61E,EAAK5sE,IAAI/G,GACpB,OAAOA,EAAM8G,IAAIhI,KAAK00E,WAAW11E,GACnC,EAEAy1E,EAAY/2E,UAAUkrB,KAAO,SAAcpZ,EAAGpL,EAAG23B,GAC/C,IAAI16B,EAAMmO,EAAEzJ,YACR5F,EAAMo0E,EAAGp7D,KAAK3J,GACdslE,EAAO,IAAIP,EAAG,GAAGn/D,MAAMjV,GAEtBiE,IACHA,EAAI9C,KAAKM,IAAI,EAAIP,EAAM,GAAM,IAI/B,IADA,IAAI0zE,EAAKvlE,EAAEyC,KAAK,GACPxD,EAAI,GAAIsmE,EAAGvuE,MAAMiI,GAAIA,KAM9B,IALA,IAAIiiB,EAAIlhB,EAAEmC,KAAKlD,GAEXumE,EAAMD,EAAG3/D,MAAMjV,GAGZiE,EAAI,EAAGA,IAAK,CACjB,IAAIJ,EAAIhE,KAAK40E,WAAW,IAAIL,EAAG,GAAIQ,GAC/Bh5C,GACFA,EAAG/3B,GAEL,IAAIwJ,EAAIxJ,EAAEoR,MAAMjV,GAAKwW,OAAO+Z,GAC5B,GAAoB,IAAhBljB,EAAEzL,IAAI+yE,IAA8B,IAAftnE,EAAEzL,IAAIizE,GAA/B,CAGA,IAAK,IAAIxzE,EAAI,EAAGA,EAAIiN,EAAGjN,IAAK,CAG1B,GAAoB,KAFpBgM,EAAIA,EAAE4I,UAEArU,IAAI+yE,GACR,OAAO,EACT,GAAmB,IAAftnE,EAAEzL,IAAIizE,GACR,KACJ,CAEA,GAAIxzE,IAAMiN,EACR,OAAO,CAZC,CAaZ,CAEA,OAvBY,CAwBd,EAEAgmE,EAAY/2E,UAAUu3E,WAAa,SAAoBzlE,EAAGpL,GACxD,IAAI/C,EAAMmO,EAAEzJ,YACR5F,EAAMo0E,EAAGp7D,KAAK3J,GACdslE,EAAO,IAAIP,EAAG,GAAGn/D,MAAMjV,GAEtBiE,IACHA,EAAI9C,KAAKM,IAAI,EAAIP,EAAM,GAAM,IAI/B,IADA,IAAI0zE,EAAKvlE,EAAEyC,KAAK,GACPxD,EAAI,GAAIsmE,EAAGvuE,MAAMiI,GAAIA,KAK9B,IAJA,IAAIiiB,EAAIlhB,EAAEmC,KAAKlD,GAEXumE,EAAMD,EAAG3/D,MAAMjV,GAEZiE,EAAI,EAAGA,IAAK,CACjB,IAAIJ,EAAIhE,KAAK40E,WAAW,IAAIL,EAAG,GAAIQ,GAE/BthE,EAAIjE,EAAEwE,IAAIhQ,GACd,GAAkB,IAAdyP,EAAEY,KAAK,GACT,OAAOZ,EAET,IAAIjG,EAAIxJ,EAAEoR,MAAMjV,GAAKwW,OAAO+Z,GAC5B,GAAoB,IAAhBljB,EAAEzL,IAAI+yE,IAA8B,IAAftnE,EAAEzL,IAAIizE,GAA/B,CAGA,IAAK,IAAIxzE,EAAI,EAAGA,EAAIiN,EAAGjN,IAAK,CAG1B,GAAoB,KAFpBgM,EAAIA,EAAE4I,UAEArU,IAAI+yE,GACR,OAAOtnE,EAAEgI,UAAUvD,KAAK,GAAG+B,IAAIxE,GACjC,GAAmB,IAAfhC,EAAEzL,IAAIizE,GACR,KACJ,CAEA,GAAIxzE,IAAMiN,EAER,OADAjB,EAAIA,EAAE4I,UACGZ,UAAUvD,KAAK,GAAG+B,IAAIxE,EAbvB,CAeZ,CAEA,OAAO,CACT,0BCxFA,IAAIm8B,EAHJ1uC,EAAOD,QAAU4uC,EAMjBA,EAASuzB,cAAgBA,EAGhB,mBAAT,IAqBIC,EApBAC,EAAkB,SAAyBtsC,EAAS7X,GACtD,OAAO6X,EAAQsD,UAAUnb,GAAMxc,MACjC,EAIIq0D,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EASvK0lD,EAAY,EAAQ,KAGtBH,EADEG,GAAaA,EAAUh3B,SACjBg3B,EAAUh3B,SAAS,UAEnB,WAAkB,EAI5B,IAWI3L,EACA4iC,EACA7gE,EAbA8gE,EAAa,EAAQ,KACrBC,EAAc,EAAQ,KAExBC,EADa,EAAQ,KACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC84C,EAA4BvM,EAAeuM,0BAC3CC,EAA6BxM,EAAewM,2BAC5CC,EAAqCzM,EAAeyM,mCAMtD,EAAQ,EAAR,CAAoBl0B,EAAUmnB,GAC9B,IAAIgN,EAAiBL,EAAYK,eAC7BC,EAAe,CAAC,QAAS,QAAS,UAAW,QAAS,UAY1D,SAASb,EAActzC,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQs0C,oBAI7DngE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAK9EjgE,KAAK/B,OAAS,IAAIwhE,EAClBz/D,KAAKtB,OAAS,EACdsB,KAAKogE,MAAQ,KACbpgE,KAAKqgE,WAAa,EAClBrgE,KAAKsgE,QAAU,KACftgE,KAAKosC,OAAQ,EACbpsC,KAAK+jD,YAAa,EAClB/jD,KAAKugE,SAAU,EAMfvgE,KAAKkgD,MAAO,EAIZlgD,KAAKwgE,cAAe,EACpBxgE,KAAKygE,iBAAkB,EACvBzgE,KAAK0gE,mBAAoB,EACzB1gE,KAAK2gE,iBAAkB,EACvB3gE,KAAK4gE,QAAS,EAGd5gE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAKysC,WAAY,EAKjBzsC,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAGlD/gE,KAAKghE,WAAa,EAGlBhhE,KAAKihE,aAAc,EACnBjhE,KAAK+8C,QAAU,KACf/8C,KAAKd,SAAW,KACZ2sB,EAAQ3sB,WACL09B,IAAeA,EAAgB,SACpC58B,KAAK+8C,QAAU,IAAIngB,EAAc/Q,EAAQ3sB,UACzCc,KAAKd,SAAW2sB,EAAQ3sB,SAE5B,CACA,SAAS0sC,EAAS/f,GAEhB,GADA8f,EAASA,GAAU,EAAQ,MACrB3rC,gBAAgB4rC,GAAW,OAAO,IAAIA,EAAS/f,GAIrD,IAAIo0C,EAAWjgE,gBAAgB2rC,EAC/B3rC,KAAKwsC,eAAiB,IAAI2yB,EAActzC,EAAS7rB,KAAMigE,GAGvDjgE,KAAKisC,UAAW,EACZpgB,IAC0B,mBAAjBA,EAAQ7O,OAAqBhd,KAAKkhE,MAAQr1C,EAAQ7O,MAC9B,mBAApB6O,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,UAErEpO,EAAOz7C,KAAKtX,KACd,CAwDA,SAASqhE,EAAiB9d,EAAQyb,EAAO9/D,EAAUoiE,EAAYC,GAC7DnC,EAAM,mBAAoBJ,GAC1B,IAKM7oC,EALFhB,EAAQouB,EAAO/W,eACnB,GAAc,OAAVwyB,EACF7pC,EAAMorC,SAAU,EAuNpB,SAAoBhd,EAAQpuB,GAE1B,GADAiqC,EAAM,eACFjqC,EAAMiX,MAAV,CACA,GAAIjX,EAAM4nB,QAAS,CACjB,IAAIiiB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,SACjBy2B,EAAMl3B,OAAO+f,KAAKghD,GAClB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OAEjD,CACAy2B,EAAMiX,OAAQ,EACVjX,EAAM+qB,KAIRshB,EAAaje,IAGbpuB,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTtrC,EAAMsrC,iBAAkB,EACxBgB,EAAcle,IAnBK,CAsBzB,CA9OIme,CAAWne,EAAQpuB,QAInB,GADKosC,IAAgBprC,EA6CzB,SAAsBhB,EAAO6pC,GAC3B,IAAI7oC,EAjPiBrb,EAqPrB,OArPqBA,EAkPFkkD,EAjPZ9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAiPA,iBAAVN,QAAgC5/D,IAAV4/D,GAAwB7pC,EAAM+qC,aACtF/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,SAAU,cAAek4C,IAEtE7oC,CACT,CAnD8BwrC,CAAaxsC,EAAO6pC,IAC1C7oC,EACF4pC,EAAexc,EAAQptB,QAClB,GAAIhB,EAAM+qC,YAAclB,GAASA,EAAMtgE,OAAS,EAIrD,GAHqB,iBAAVsgE,GAAuB7pC,EAAM+qC,YAAc7iE,OAAO04B,eAAeipC,KAAW9gE,EAAOR,YAC5FshE,EA3MR,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CAyMgB4C,CAAoB5C,IAE1BsC,EACEnsC,EAAM4uB,WAAYgc,EAAexc,EAAQ,IAAIuc,GAA2C+B,EAASte,EAAQpuB,EAAO6pC,GAAO,QACtH,GAAI7pC,EAAMiX,MACf2zB,EAAexc,EAAQ,IAAIqc,OACtB,IAAIzqC,EAAMsX,UACf,OAAO,EAEPtX,EAAMorC,SAAU,EACZprC,EAAM4nB,UAAY79C,GACpB8/D,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,GACxB7pC,EAAM+qC,YAA+B,IAAjBlB,EAAMtgE,OAAcmjE,EAASte,EAAQpuB,EAAO6pC,GAAO,GAAY8C,EAAcve,EAAQpuB,IAE7G0sC,EAASte,EAAQpuB,EAAO6pC,GAAO,EAEnC,MACUsC,IACVnsC,EAAMorC,SAAU,EAChBuB,EAAcve,EAAQpuB,IAO1B,OAAQA,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAkC,IAAjBnX,EAAMz2B,OACtE,CACA,SAASmjE,EAASte,EAAQpuB,EAAO6pC,EAAOsC,GAClCnsC,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAiBy2B,EAAM+qB,MAChD/qB,EAAM6rC,WAAa,EACnBzd,EAAO7uB,KAAK,OAAQsqC,KAGpB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACzC4iE,EAAYnsC,EAAMl3B,OAAO02B,QAAQqqC,GAAY7pC,EAAMl3B,OAAO+f,KAAKghD,GAC/D7pC,EAAMqrC,cAAcgB,EAAaje,IAEvCue,EAAcve,EAAQpuB,EACxB,CA3GA93B,OAAOqiB,eAAeksB,EAASluC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,gBAGFxsC,KAAKwsC,eAAeC,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKwsC,iBAMVxsC,KAAKwsC,eAAeC,UAAY7uC,EAClC,IAEFguC,EAASluC,UAAUyjE,QAAUzB,EAAYyB,QACzCv1B,EAASluC,UAAUqkE,WAAarC,EAAYsC,UAC5Cp2B,EAASluC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,EAMAwY,EAASluC,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GACzC,IACIqiE,EADApsC,EAAQn1B,KAAKwsC,eAcjB,OAZKrX,EAAM+qC,WAUTqB,GAAiB,EATI,iBAAVvC,KACT9/D,EAAWA,GAAYi2B,EAAM4rC,mBACZ5rC,EAAMj2B,WACrB8/D,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,GAC3BA,EAAW,IAEbqiE,GAAiB,GAKdF,EAAiBrhE,KAAMg/D,EAAO9/D,GAAU,EAAOqiE,EACxD,EAGA31B,EAASluC,UAAUi3B,QAAU,SAAUqqC,GACrC,OAAOqC,EAAiBrhE,KAAMg/D,EAAO,MAAM,GAAM,EACnD,EA6DApzB,EAASluC,UAAUukE,SAAW,WAC5B,OAAuC,IAAhCjiE,KAAKwsC,eAAe8zB,OAC7B,EAGA10B,EAASluC,UAAUwkE,YAAc,SAAUjyC,GACpC2M,IAAeA,EAAgB,SACpC,IAAImgB,EAAU,IAAIngB,EAAc3M,GAChCjwB,KAAKwsC,eAAeuQ,QAAUA,EAE9B/8C,KAAKwsC,eAAettC,SAAWc,KAAKwsC,eAAeuQ,QAAQ79C,SAK3D,IAFA,IAAI6P,EAAI/O,KAAKwsC,eAAevuC,OAAOm8C,KAC/BqX,EAAU,GACD,OAAN1iD,GACL0iD,GAAW1U,EAAQ9iC,MAAMlL,EAAEoM,MAC3BpM,EAAIA,EAAE0J,KAKR,OAHAzY,KAAKwsC,eAAevuC,OAAOkkE,QACX,KAAZ1Q,GAAgBzxD,KAAKwsC,eAAevuC,OAAO+f,KAAKyzC,GACpDzxD,KAAKwsC,eAAe9tC,OAAS+yD,EAAQ/yD,OAC9BsB,IACT,EAGA,IAAIoiE,EAAU,WAqBd,SAASC,EAAc7yD,EAAG2lB,GACxB,OAAI3lB,GAAK,GAAsB,IAAjB2lB,EAAMz2B,QAAgBy2B,EAAMiX,MAAc,EACpDjX,EAAM+qC,WAAmB,EACzB1wD,GAAMA,EAEJ2lB,EAAMmrC,SAAWnrC,EAAMz2B,OAAey2B,EAAMl3B,OAAOm8C,KAAKj/B,KAAKzc,OAAmBy2B,EAAMz2B,QAGxF8Q,EAAI2lB,EAAMmX,gBAAenX,EAAMmX,cA5BrC,SAAiC98B,GAe/B,OAdIA,GAAK4yD,EAEP5yD,EAAI4yD,GAIJ5yD,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAEKA,CACT,CAYqD8yD,CAAwB9yD,IACvEA,GAAK2lB,EAAMz2B,OAAe8Q,EAEzB2lB,EAAMiX,MAIJjX,EAAMz2B,QAHXy2B,EAAMqrC,cAAe,EACd,GAGX,CA6HA,SAASgB,EAAaje,GACpB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,eAAgBjqC,EAAMqrC,aAAcrrC,EAAMsrC,iBAChDtrC,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTrB,EAAM,eAAgBjqC,EAAMmrC,SAC5BnrC,EAAMsrC,iBAAkB,EACxB7yC,QAAQqO,SAASwlC,EAAele,GAEpC,CACA,SAASke,EAAcle,GACrB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,gBAAiBjqC,EAAMsX,UAAWtX,EAAMz2B,OAAQy2B,EAAMiX,OACvDjX,EAAMsX,YAActX,EAAMz2B,SAAUy2B,EAAMiX,QAC7CmX,EAAO7uB,KAAK,YACZS,EAAMsrC,iBAAkB,GAS1BtrC,EAAMqrC,cAAgBrrC,EAAMmrC,UAAYnrC,EAAMiX,OAASjX,EAAMz2B,QAAUy2B,EAAMmX,cAC7Ei2B,EAAKhf,EACP,CAQA,SAASue,EAAcve,EAAQpuB,GACxBA,EAAM8rC,cACT9rC,EAAM8rC,aAAc,EACpBrzC,QAAQqO,SAASumC,EAAgBjf,EAAQpuB,GAE7C,CACA,SAASqtC,EAAejf,EAAQpuB,GAwB9B,MAAQA,EAAMorC,UAAYprC,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAiBnX,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAe,CACpH,IAAI2C,EAAM8zB,EAAMz2B,OAGhB,GAFA0gE,EAAM,wBACN7b,EAAOvmC,KAAK,GACR3b,IAAQ8zB,EAAMz2B,OAEhB,KACJ,CACAy2B,EAAM8rC,aAAc,CACtB,CAgPA,SAASwB,EAAwB3+D,GAC/B,IAAIqxB,EAAQrxB,EAAK0oC,eACjBrX,EAAMurC,kBAAoB58D,EAAK6xB,cAAc,YAAc,EACvDR,EAAMwrC,kBAAoBxrC,EAAMyrC,OAGlCzrC,EAAMmrC,SAAU,EAGPx8D,EAAK6xB,cAAc,QAAU,GACtC7xB,EAAK4+D,QAET,CACA,SAASC,EAAiB7+D,GACxBs7D,EAAM,4BACNt7D,EAAKkZ,KAAK,EACZ,CAuBA,SAAS4lD,EAAQrf,EAAQpuB,GACvBiqC,EAAM,SAAUjqC,EAAMorC,SACjBprC,EAAMorC,SACThd,EAAOvmC,KAAK,GAEdmY,EAAMwrC,iBAAkB,EACxBpd,EAAO7uB,KAAK,UACZ6tC,EAAKhf,GACDpuB,EAAMmrC,UAAYnrC,EAAMorC,SAAShd,EAAOvmC,KAAK,EACnD,CAWA,SAASulD,EAAKhf,GACZ,IAAIpuB,EAAQouB,EAAO/W,eAEnB,IADA4yB,EAAM,OAAQjqC,EAAMmrC,SACbnrC,EAAMmrC,SAA6B,OAAlB/c,EAAOvmC,SACjC,CAmHA,SAAS6lD,EAASrzD,EAAG2lB,GAEnB,OAAqB,IAAjBA,EAAMz2B,OAAqB,MAE3By2B,EAAM+qC,WAAYn7D,EAAMowB,EAAMl3B,OAAOmU,SAAkB5C,GAAKA,GAAK2lB,EAAMz2B,QAEtDqG,EAAfowB,EAAM4nB,QAAe5nB,EAAMl3B,OAAOi7B,KAAK,IAAqC,IAAxB/D,EAAMl3B,OAAOS,OAAoBy2B,EAAMl3B,OAAO+kB,QAAmBmS,EAAMl3B,OAAO8hB,OAAOoV,EAAMz2B,QACnJy2B,EAAMl3B,OAAOkkE,SAGbp9D,EAAMowB,EAAMl3B,OAAO6kE,QAAQtzD,EAAG2lB,EAAM4nB,SAE/Bh4C,GATP,IAAIA,CAUN,CACA,SAASg+D,EAAYxf,GACnB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,cAAejqC,EAAM4uB,YACtB5uB,EAAM4uB,aACT5uB,EAAMiX,OAAQ,EACdxe,QAAQqO,SAAS+mC,EAAe7tC,EAAOouB,GAE3C,CACA,SAASyf,EAAc7tC,EAAOouB,GAI5B,GAHA6b,EAAM,gBAAiBjqC,EAAM4uB,WAAY5uB,EAAMz2B,SAG1Cy2B,EAAM4uB,YAA+B,IAAjB5uB,EAAMz2B,SAC7By2B,EAAM4uB,YAAa,EACnBR,EAAOtX,UAAW,EAClBsX,EAAO7uB,KAAK,OACRS,EAAM2rC,aAAa,CAGrB,IAAImC,EAAS1f,EAAOpX,iBACf82B,GAAUA,EAAOnC,aAAemC,EAAOpf,WAC1CN,EAAO4d,SAEX,CAEJ,CASA,SAAS1kD,EAAQymD,EAAI11D,GACnB,IAAK,IAAIhM,EAAI,EAAGuM,EAAIm1D,EAAGxkE,OAAQ8C,EAAIuM,EAAGvM,IACpC,GAAI0hE,EAAG1hE,KAAOgM,EAAG,OAAOhM,EAE1B,OAAQ,CACV,CA1pBAoqC,EAASluC,UAAUsf,KAAO,SAAUxN,GAClC4vD,EAAM,OAAQ5vD,GACdA,EAAIkO,SAASlO,EAAG,IAChB,IAAI2lB,EAAQn1B,KAAKwsC,eACb22B,EAAQ3zD,EAMZ,GALU,IAANA,IAAS2lB,EAAMsrC,iBAAkB,GAK3B,IAANjxD,GAAW2lB,EAAMqrC,gBAA0C,IAAxBrrC,EAAMmX,cAAsBnX,EAAMz2B,QAAUy2B,EAAMmX,cAAgBnX,EAAMz2B,OAAS,IAAMy2B,EAAMiX,OAGlI,OAFAgzB,EAAM,qBAAsBjqC,EAAMz2B,OAAQy2B,EAAMiX,OAC3B,IAAjBjX,EAAMz2B,QAAgBy2B,EAAMiX,MAAO22B,EAAY/iE,MAAWwhE,EAAaxhE,MACpE,KAKT,GAAU,KAHVwP,EAAI6yD,EAAc7yD,EAAG2lB,KAGNA,EAAMiX,MAEnB,OADqB,IAAjBjX,EAAMz2B,QAAcqkE,EAAY/iE,MAC7B,KA0BT,IA2BI+E,EA3BAq+D,EAASjuC,EAAMqrC,aA6CnB,OA5CApB,EAAM,gBAAiBgE,IAGF,IAAjBjuC,EAAMz2B,QAAgBy2B,EAAMz2B,OAAS8Q,EAAI2lB,EAAMmX,gBAEjD8yB,EAAM,6BADNgE,GAAS,GAMPjuC,EAAMiX,OAASjX,EAAMorC,QAEvBnB,EAAM,mBADNgE,GAAS,GAEAA,IACThE,EAAM,WACNjqC,EAAMorC,SAAU,EAChBprC,EAAM+qB,MAAO,EAEQ,IAAjB/qB,EAAMz2B,SAAcy2B,EAAMqrC,cAAe,GAE7CxgE,KAAKkhE,MAAM/rC,EAAMmX,eACjBnX,EAAM+qB,MAAO,EAGR/qB,EAAMorC,UAAS/wD,EAAI6yD,EAAcc,EAAOhuC,KAInC,QADDpwB,EAAPyK,EAAI,EAASqzD,EAASrzD,EAAG2lB,GAAkB,OAE7CA,EAAMqrC,aAAerrC,EAAMz2B,QAAUy2B,EAAMmX,cAC3C98B,EAAI,IAEJ2lB,EAAMz2B,QAAU8Q,EAChB2lB,EAAM6rC,WAAa,GAEA,IAAjB7rC,EAAMz2B,SAGHy2B,EAAMiX,QAAOjX,EAAMqrC,cAAe,GAGnC2C,IAAU3zD,GAAK2lB,EAAMiX,OAAO22B,EAAY/iE,OAElC,OAAR+E,GAAc/E,KAAK00B,KAAK,OAAQ3vB,GAC7BA,CACT,EA6GA6mC,EAASluC,UAAUwjE,MAAQ,SAAU1xD,GACnCuwD,EAAe//D,KAAM,IAAI6/D,EAA2B,WACtD,EACAj0B,EAASluC,UAAU2lE,KAAO,SAAUhgE,EAAMigE,GACxC,IAAIllE,EAAM4B,KACNm1B,EAAQn1B,KAAKwsC,eACjB,OAAQrX,EAAMkrC,YACZ,KAAK,EACHlrC,EAAMirC,MAAQ/8D,EACd,MACF,KAAK,EACH8xB,EAAMirC,MAAQ,CAACjrC,EAAMirC,MAAO/8D,GAC5B,MACF,QACE8xB,EAAMirC,MAAMpiD,KAAK3a,GAGrB8xB,EAAMkrC,YAAc,EACpBjB,EAAM,wBAAyBjqC,EAAMkrC,WAAYiD,GACjD,IACIC,EADUD,IAA6B,IAAjBA,EAASniE,KAAkBkC,IAASuqB,QAAQ41C,QAAUngE,IAASuqB,QAAQ61C,OACrEC,EAARx3B,EAYpB,SAASA,IACPkzB,EAAM,SACN/7D,EAAKlC,KACP,CAdIg0B,EAAM4uB,WAAYn2B,QAAQqO,SAASsnC,GAAYnlE,EAAI00B,KAAK,MAAOywC,GACnElgE,EAAKqwB,GAAG,UACR,SAASiwC,EAAS13B,EAAU23B,GAC1BxE,EAAM,YACFnzB,IAAa7tC,GACXwlE,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EAkB5BzE,EAAM,WAEN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7B5gD,EAAKgwB,eAAe,SAAUswB,GAC9BtgD,EAAKgwB,eAAe,QAASywC,GAC7BzgE,EAAKgwB,eAAe,QAAS2wB,GAC7B3gD,EAAKgwB,eAAe,SAAUswC,GAC9BvlE,EAAIi1B,eAAe,MAAO6Y,GAC1B9tC,EAAIi1B,eAAe,MAAOqwC,GAC1BtlE,EAAIi1B,eAAe,OAAQ0wC,GAC3BC,GAAY,GAOR7uC,EAAM6rC,YAAgB39D,EAAK8oC,iBAAkB9oC,EAAK8oC,eAAe83B,WAAYH,IA/BnF,IAUA,IAAIA,EAgFN,SAAqB1lE,GACnB,OAAO,WACL,IAAI+2B,EAAQ/2B,EAAIouC,eAChB4yB,EAAM,cAAejqC,EAAM6rC,YACvB7rC,EAAM6rC,YAAY7rC,EAAM6rC,aACH,IAArB7rC,EAAM6rC,YAAoB3B,EAAgBjhE,EAAK,UACjD+2B,EAAMmrC,SAAU,EAChBiC,EAAKnkE,GAET,CACF,CA1FgB8lE,CAAY9lE,GAC1BiF,EAAKqwB,GAAG,QAASowC,GACjB,IAAIE,GAAY,EAsBhB,SAASD,EAAO/E,GACdI,EAAM,UACN,IAAIr6D,EAAM1B,EAAK4W,MAAM+kD,GACrBI,EAAM,aAAcr6D,IACR,IAARA,KAKwB,IAArBowB,EAAMkrC,YAAoBlrC,EAAMirC,QAAU/8D,GAAQ8xB,EAAMkrC,WAAa,IAAqC,IAAhC5jD,EAAQ0Y,EAAMirC,MAAO/8D,MAAkB2gE,IACpH5E,EAAM,8BAA+BjqC,EAAM6rC,YAC3C7rC,EAAM6rC,cAER5iE,EAAI+lE,QAER,CAIA,SAASngB,EAAQ7tB,GACfipC,EAAM,UAAWjpC,GACjButC,IACArgE,EAAKgwB,eAAe,QAAS2wB,GACU,IAAnCqb,EAAgBh8D,EAAM,UAAgB08D,EAAe18D,EAAM8yB,EACjE,CAMA,SAAS8tB,IACP5gD,EAAKgwB,eAAe,SAAUswB,GAC9B+f,GACF,CAEA,SAAS/f,IACPyb,EAAM,YACN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7Byf,GACF,CAEA,SAASA,IACPtE,EAAM,UACNhhE,EAAIslE,OAAOrgE,EACb,CAUA,OAvDAjF,EAAIs1B,GAAG,OAAQqwC,GAniBjB,SAAyBhxC,EAASqxC,EAAOz8C,GAGvC,GAAuC,mBAA5BoL,EAAQwD,gBAAgC,OAAOxD,EAAQwD,gBAAgB6tC,EAAOz8C,GAMpFoL,EAAQa,SAAYb,EAAQa,QAAQwwC,GAAuC1iE,MAAMC,QAAQoxB,EAAQa,QAAQwwC,IAASrxC,EAAQa,QAAQwwC,GAAOzvC,QAAQhN,GAASoL,EAAQa,QAAQwwC,GAAS,CAACz8C,EAAIoL,EAAQa,QAAQwwC,IAA5JrxC,EAAQW,GAAG0wC,EAAOz8C,EACrE,CAqjBE4O,CAAgBlzB,EAAM,QAAS2gD,GAO/B3gD,EAAKyvB,KAAK,QAASmxB,GAMnB5gD,EAAKyvB,KAAK,SAAU6wB,GAOpBtgD,EAAKqxB,KAAK,OAAQt2B,GAGb+2B,EAAMmrC,UACTlB,EAAM,eACNhhE,EAAIskE,UAECr/D,CACT,EAYAuoC,EAASluC,UAAUgmE,OAAS,SAAUrgE,GACpC,IAAI8xB,EAAQn1B,KAAKwsC,eACbo3B,EAAa,CACfC,YAAY,GAId,GAAyB,IAArB1uC,EAAMkrC,WAAkB,OAAOrgE,KAGnC,GAAyB,IAArBm1B,EAAMkrC,WAER,OAAIh9D,GAAQA,IAAS8xB,EAAMirC,QACtB/8D,IAAMA,EAAO8xB,EAAMirC,OAGxBjrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EACZj9D,GAAMA,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAPK5jE,KAa3C,IAAKqD,EAAM,CAET,IAAIghE,EAAQlvC,EAAMirC,MACd/+D,EAAM8zB,EAAMkrC,WAChBlrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EAChB,IAAK,IAAI9+D,EAAI,EAAGA,EAAIH,EAAKG,IAAK6iE,EAAM7iE,GAAGkzB,KAAK,SAAU10B,KAAM,CAC1D6jE,YAAY,IAEd,OAAO7jE,IACT,CAGA,IAAIU,EAAQ+b,EAAQ0Y,EAAMirC,MAAO/8D,GACjC,OAAe,IAAX3C,IACJy0B,EAAMirC,MAAMplC,OAAOt6B,EAAO,GAC1By0B,EAAMkrC,YAAc,EACK,IAArBlrC,EAAMkrC,aAAkBlrC,EAAMirC,MAAQjrC,EAAMirC,MAAM,IACtD/8D,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAJD5jE,IAM3B,EAIA4rC,EAASluC,UAAUg2B,GAAK,SAAU4wC,EAAI38C,GACpC,IAAIpiB,EAAMwtD,EAAOr1D,UAAUg2B,GAAGpc,KAAKtX,KAAMskE,EAAI38C,GACzCwN,EAAQn1B,KAAKwsC,eAqBjB,MApBW,SAAP83B,GAGFnvC,EAAMurC,kBAAoB1gE,KAAK21B,cAAc,YAAc,GAGrC,IAAlBR,EAAMmrC,SAAmBtgE,KAAK0iE,UAClB,aAAP4B,IACJnvC,EAAM4uB,YAAe5uB,EAAMurC,oBAC9BvrC,EAAMurC,kBAAoBvrC,EAAMqrC,cAAe,EAC/CrrC,EAAMmrC,SAAU,EAChBnrC,EAAMsrC,iBAAkB,EACxBrB,EAAM,cAAejqC,EAAMz2B,OAAQy2B,EAAMorC,SACrCprC,EAAMz2B,OACR8iE,EAAaxhE,MACHm1B,EAAMorC,SAChB3yC,QAAQqO,SAAS0mC,EAAkB3iE,QAIlCuF,CACT,EACAqmC,EAASluC,UAAU44B,YAAcsV,EAASluC,UAAUg2B,GACpDkY,EAASluC,UAAU21B,eAAiB,SAAUixC,EAAI38C,GAChD,IAAIpiB,EAAMwtD,EAAOr1D,UAAU21B,eAAe/b,KAAKtX,KAAMskE,EAAI38C,GAUzD,MATW,aAAP28C,GAOF12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EACAqmC,EAASluC,UAAUm5B,mBAAqB,SAAUytC,GAChD,IAAI/+D,EAAMwtD,EAAOr1D,UAAUm5B,mBAAmB5X,MAAMjf,KAAMyb,WAU1D,MATW,aAAP6oD,QAA4BllE,IAAPklE,GAOvB12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EAqBAqmC,EAASluC,UAAUglE,OAAS,WAC1B,IAAIvtC,EAAQn1B,KAAKwsC,eAUjB,OATKrX,EAAMmrC,UACTlB,EAAM,UAINjqC,EAAMmrC,SAAWnrC,EAAMurC,kBAM3B,SAAgBnd,EAAQpuB,GACjBA,EAAMwrC,kBACTxrC,EAAMwrC,iBAAkB,EACxB/yC,QAAQqO,SAAS2mC,EAASrf,EAAQpuB,GAEtC,CAVIutC,CAAO1iE,KAAMm1B,IAEfA,EAAMyrC,QAAS,EACR5gE,IACT,EAiBA4rC,EAASluC,UAAUymE,MAAQ,WAQzB,OAPA/E,EAAM,wBAAyBp/D,KAAKwsC,eAAe8zB,UACf,IAAhCtgE,KAAKwsC,eAAe8zB,UACtBlB,EAAM,SACNp/D,KAAKwsC,eAAe8zB,SAAU,EAC9BtgE,KAAK00B,KAAK,UAEZ10B,KAAKwsC,eAAeo0B,QAAS,EACtB5gE,IACT,EAUA4rC,EAASluC,UAAU6mE,KAAO,SAAUhhB,GAClC,IAAIgS,EAAQv1D,KACRm1B,EAAQn1B,KAAKwsC,eACbo0B,GAAS,EAwBb,IAAK,IAAIp/D,KAvBT+hD,EAAO7vB,GAAG,OAAO,WAEf,GADA0rC,EAAM,eACFjqC,EAAM4nB,UAAY5nB,EAAMiX,MAAO,CACjC,IAAI4yB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,QAAQ62D,EAAMv3C,KAAKghD,EACxC,CACAzJ,EAAMv3C,KAAK,KACb,IACAulC,EAAO7vB,GAAG,QAAQ,SAAUsrC,GAC1BI,EAAM,gBACFjqC,EAAM4nB,UAASiiB,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,IAG3C7pC,EAAM+qC,YAAc,MAAClB,IAAyD7pC,EAAM+qC,YAAgBlB,GAAUA,EAAMtgE,UAC9G62D,EAAMv3C,KAAKghD,KAEnB4B,GAAS,EACTrd,EAAO4gB,SAEX,IAIc5gB,OACInkD,IAAZY,KAAKwB,IAAyC,mBAAd+hD,EAAO/hD,KACzCxB,KAAKwB,GAAK,SAAoBuqC,GAC5B,OAAO,WACL,OAAOwX,EAAOxX,GAAQ9sB,MAAMskC,EAAQ9nC,UACtC,CACF,CAJU,CAIRja,IAKN,IAAK,IAAIgO,EAAI,EAAGA,EAAIwwD,EAAathE,OAAQ8Q,IACvC+zC,EAAO7vB,GAAGssC,EAAaxwD,GAAIxP,KAAK00B,KAAKW,KAAKr1B,KAAMggE,EAAaxwD,KAY/D,OAPAxP,KAAKkhE,MAAQ,SAAU1xD,GACrB4vD,EAAM,gBAAiB5vD,GACnBoxD,IACFA,GAAS,EACTrd,EAAOmf,SAEX,EACO1iE,IACT,EACsB,mBAAXwZ,SACToyB,EAASluC,UAAU8b,OAAOgrD,eAAiB,WAIzC,YAH0CplE,IAAtCogE,IACFA,EAAoC,EAAQ,MAEvCA,EAAkCx/D,KAC3C,GAEF3C,OAAOqiB,eAAeksB,EAASluC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAeF,aAC7B,IAEFjvC,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAevuC,MACpD,IAEFZ,OAAOqiB,eAAeksB,EAASluC,UAAW,kBAAmB,CAI3DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe8zB,OAC7B,EACApgD,IAAK,SAAaiV,GACZn1B,KAAKwsC,iBACPxsC,KAAKwsC,eAAe8zB,QAAUnrC,EAElC,IAIFyW,EAAS64B,UAAY5B,EACrBxlE,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe9tC,MAC7B,IA+CoB,mBAAX8a,SACToyB,EAASjtC,KAAO,SAAU+lE,EAAU/+B,GAIlC,YAHavmC,IAATT,IACFA,EAAO,EAAQ,MAEVA,EAAKitC,EAAU84B,EAAU/+B,EAClC,qBCx8BF,SAASg/B,EAAoB7gE,EAAMsvB,GACjCwxC,EAAY9gE,EAAMsvB,GAClByxC,EAAY/gE,EACd,CACA,SAAS+gE,EAAY/gE,GACfA,EAAKqoC,iBAAmBroC,EAAKqoC,eAAe00B,WAC5C/8D,EAAK0oC,iBAAmB1oC,EAAK0oC,eAAeq0B,WAChD/8D,EAAK4wB,KAAK,QACZ,CAkBA,SAASkwC,EAAY9gE,EAAMsvB,GACzBtvB,EAAK4wB,KAAK,QAAStB,EACrB,CAYAn2B,EAAOD,QAAU,CACfmkE,QAzFF,SAAiB/tC,EAAK2I,GACpB,IAAIw5B,EAAQv1D,KACR8kE,EAAoB9kE,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAeC,UAC/Ds4B,EAAoB/kE,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeM,UACnE,OAAIq4B,GAAqBC,GACnBhpC,EACFA,EAAG3I,GACMA,IACJpzB,KAAKmsC,eAEEnsC,KAAKmsC,eAAe64B,eAC9BhlE,KAAKmsC,eAAe64B,cAAe,EACnCp3C,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAHpCxF,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAMjCpzB,OAMLA,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,GAI9BzsC,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,GAElCzsC,KAAKohE,SAAShuC,GAAO,MAAM,SAAUA,IAC9B2I,GAAM3I,EACJmiC,EAAMppB,eAECopB,EAAMppB,eAAe64B,aAI/Bp3C,QAAQqO,SAAS4oC,EAAatP,IAH9BA,EAAMppB,eAAe64B,cAAe,EACpCp3C,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,IAH7CxF,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,GAOtC2I,GACTnO,QAAQqO,SAAS4oC,EAAatP,GAC9Bx5B,EAAG3I,IAEHxF,QAAQqO,SAAS4oC,EAAatP,EAElC,IACOv1D,KACT,EA2CEgiE,UAjCF,WACMhiE,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,EAChCzsC,KAAKwsC,eAAe+zB,SAAU,EAC9BvgE,KAAKwsC,eAAeJ,OAAQ,EAC5BpsC,KAAKwsC,eAAeuX,YAAa,GAE/B/jD,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,EAChCzsC,KAAKmsC,eAAeC,OAAQ,EAC5BpsC,KAAKmsC,eAAe84B,QAAS,EAC7BjlE,KAAKmsC,eAAe+4B,aAAc,EAClCllE,KAAKmsC,eAAeg5B,aAAc,EAClCnlE,KAAKmsC,eAAe0X,UAAW,EAC/B7jD,KAAKmsC,eAAe64B,cAAe,EAEvC,EAkBEjF,eAdF,SAAwBxc,EAAQnwB,GAO9B,IAAIgyC,EAAS7hB,EAAO/W,eAChBy2B,EAAS1f,EAAOpX,eAChBi5B,GAAUA,EAAOtE,aAAemC,GAAUA,EAAOnC,YAAavd,EAAO4d,QAAQ/tC,GAAUmwB,EAAO7uB,KAAK,QAAStB,EAClH,2BCxFA,IAAIiyC,EAAwB,8BAiB5BpoE,EAAOD,QAAU,CACf2iE,iBAdF,SAA0BxqC,EAAOtJ,EAASy5C,EAAWrF,GACnD,IAAIsF,EAJN,SAA2B15C,EAASo0C,EAAUqF,GAC5C,OAAgC,MAAzBz5C,EAAQygB,cAAwBzgB,EAAQygB,cAAgB2zB,EAAWp0C,EAAQy5C,GAAa,IACjG,CAEYE,CAAkB35C,EAASo0C,EAAUqF,GAC/C,GAAW,MAAPC,EAAa,CACf,IAAMxkD,SAASwkD,IAAQjkE,KAAKylB,MAAMw+C,KAASA,GAAQA,EAAM,EAEvD,MAAM,IAAIF,EADCpF,EAAWqF,EAAY,gBACIC,GAExC,OAAOjkE,KAAKylB,MAAMw+C,EACpB,CAGA,OAAOpwC,EAAM+qC,WAAa,GAAK,KACjC,2BCqBA,SAASuF,EAActwC,GACrB,IAAIogC,EAAQv1D,KACZA,KAAKyY,KAAO,KACZzY,KAAK0lE,MAAQ,KACb1lE,KAAK47C,OAAS,YA6iBhB,SAAwB+pB,EAASxwC,EAAO/B,GACtC,IAAIsyC,EAAQC,EAAQD,MAEpB,IADAC,EAAQD,MAAQ,KACTA,GAAO,CACZ,IAAI3pC,EAAK2pC,EAAMzlB,SACf9qB,EAAMywC,YACN7pC,EAljBA8pC,WAmjBAH,EAAQA,EAAMjtD,IAChB,CAGA0c,EAAM2wC,mBAAmBrtD,KAAOktD,CAClC,CAxjBIE,CAAetQ,EAAOpgC,EACxB,CACF,CAIA,IAAIwW,EAvBJ1uC,EAAOD,QAAU6uC,EA0BjBA,EAASk6B,cAAgBA,EAGzB,IA+JIC,EA/JAC,EAAe,CACjBjhC,UAAW,EAAQ,KAKjB+tB,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EAOvK6lD,EAAc,EAAQ,KAExBC,EADa,EAAQ,KACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC+4C,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvCC,EAAyB9S,EAAe8S,uBACxCC,EAAuB/S,EAAe+S,qBACtCC,EAAyBhT,EAAegT,uBACxCC,EAA6BjT,EAAeiT,2BAC5CC,EAAuBlT,EAAekT,qBACpCxG,EAAiBL,EAAYK,eAEjC,SAASyG,IAAO,CAChB,SAAST,EAAcl6C,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQ46C,oBAK7DzmE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAG9EjgE,KAAKklE,aAAc,EAGnBllE,KAAKikE,WAAY,EAEjBjkE,KAAKilE,QAAS,EAEdjlE,KAAKosC,OAAQ,EAEbpsC,KAAK6jD,UAAW,EAGhB7jD,KAAKysC,WAAY,EAKjB,IAAIi6B,GAAqC,IAA1B76C,EAAQ86C,cACvB3mE,KAAK2mE,eAAiBD,EAKtB1mE,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAKlD/gE,KAAKtB,OAAS,EAGdsB,KAAK4mE,SAAU,EAGf5mE,KAAK6mE,OAAS,EAMd7mE,KAAKkgD,MAAO,EAKZlgD,KAAK8mE,kBAAmB,EAGxB9mE,KAAK+mE,QAAU,SAAU5wC,IAsQ3B,SAAiBotB,EAAQptB,GACvB,IAAIhB,EAAQouB,EAAOpX,eACf+T,EAAO/qB,EAAM+qB,KACbnkB,EAAK5G,EAAM6xC,QACf,GAAkB,mBAAPjrC,EAAmB,MAAM,IAAImqC,EAExC,GAZF,SAA4B/wC,GAC1BA,EAAMyxC,SAAU,EAChBzxC,EAAM6xC,QAAU,KAChB7xC,EAAMz2B,QAAUy2B,EAAM8xC,SACtB9xC,EAAM8xC,SAAW,CACnB,CAMEC,CAAmB/xC,GACfgB,GAlCN,SAAsBotB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,KAC3C5G,EAAMywC,UACJ1lB,GAGFtyB,QAAQqO,SAASF,EAAI5F,GAGrBvI,QAAQqO,SAASkrC,EAAa5jB,EAAQpuB,GACtCouB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,KAIvB4F,EAAG5F,GACHotB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,GAGvBgxC,EAAY5jB,EAAQpuB,GAExB,CAaUiyC,CAAa7jB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,OAAS,CAErD,IAAI8nB,EAAWwjB,EAAWlyC,IAAUouB,EAAO9W,UACtCoX,GAAa1uB,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBACjEC,EAAYhkB,EAAQpuB,GAElB+qB,EACFtyB,QAAQqO,SAASurC,EAAYjkB,EAAQpuB,EAAO0uB,EAAU9nB,GAEtDyrC,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,EAExC,CACF,CAvRIgrC,CAAQxjB,EAAQptB,EAClB,EAGAn2B,KAAKgnE,QAAU,KAGfhnE,KAAKinE,SAAW,EAChBjnE,KAAKsnE,gBAAkB,KACvBtnE,KAAKynE,oBAAsB,KAI3BznE,KAAK4lE,UAAY,EAIjB5lE,KAAKmlE,aAAc,EAGnBnlE,KAAKglE,cAAe,EAGpBhlE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAK0nE,qBAAuB,EAI5B1nE,KAAK8lE,mBAAqB,IAAIL,EAAczlE,KAC9C,CAqCA,SAAS6rC,EAAShgB,GAahB,IAAIo0C,EAAWjgE,gBAZf2rC,EAASA,GAAU,EAAQ,KAa3B,IAAKs0B,IAAa+F,EAAgB1uD,KAAKu0B,EAAU7rC,MAAO,OAAO,IAAI6rC,EAAShgB,GAC5E7rB,KAAKmsC,eAAiB,IAAI45B,EAAcl6C,EAAS7rB,KAAMigE,GAGvDjgE,KAAKlC,UAAW,EACZ+tB,IAC2B,mBAAlBA,EAAQ5R,QAAsBja,KAAK2nE,OAAS97C,EAAQ5R,OACjC,mBAAnB4R,EAAQ+7C,SAAuB5nE,KAAK6nE,QAAUh8C,EAAQ+7C,QAClC,mBAApB/7C,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,SACtC,mBAAlBt1C,EAAQmR,QAAsBh9B,KAAKw8B,OAAS3Q,EAAQmR,QAEjE+1B,EAAOz7C,KAAKtX,KACd,CAgIA,SAAS8nE,EAAQvkB,EAAQpuB,EAAOyyC,EAAQvmE,EAAK29D,EAAO9/D,EAAU68B,GAC5D5G,EAAM8xC,SAAW5lE,EACjB8zB,EAAM6xC,QAAUjrC,EAChB5G,EAAMyxC,SAAU,EAChBzxC,EAAM+qB,MAAO,EACT/qB,EAAMsX,UAAWtX,EAAM4xC,QAAQ,IAAIX,EAAqB,UAAmBwB,EAAQrkB,EAAOskB,QAAQ7I,EAAO7pC,EAAM4xC,SAAcxjB,EAAOokB,OAAO3I,EAAO9/D,EAAUi2B,EAAM4xC,SACtK5xC,EAAM+qB,MAAO,CACf,CAgDA,SAASsnB,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,GACtC8nB,GASP,SAAsBN,EAAQpuB,GACP,IAAjBA,EAAMz2B,QAAgBy2B,EAAM8uC,YAC9B9uC,EAAM8uC,WAAY,EAClB1gB,EAAO7uB,KAAK,SAEhB,CAdiBqzC,CAAaxkB,EAAQpuB,GACpCA,EAAMywC,YACN7pC,IACAorC,EAAY5jB,EAAQpuB,EACtB,CAaA,SAASoyC,EAAYhkB,EAAQpuB,GAC3BA,EAAM2xC,kBAAmB,EACzB,IAAIpB,EAAQvwC,EAAMmyC,gBAClB,GAAI/jB,EAAOskB,SAAWnC,GAASA,EAAMjtD,KAAM,CAEzC,IAAI1K,EAAIonB,EAAMuyC,qBACVzpE,EAAS,IAAIyD,MAAMqM,GACnBi6D,EAAS7yC,EAAM2wC,mBACnBkC,EAAOtC,MAAQA,EAGf,IAFA,IAAI7wC,EAAQ,EACRozC,GAAa,EACVvC,GACLznE,EAAO42B,GAAS6wC,EACXA,EAAMwC,QAAOD,GAAa,GAC/BvC,EAAQA,EAAMjtD,KACdoc,GAAS,EAEX52B,EAAOgqE,WAAaA,EACpBH,EAAQvkB,EAAQpuB,GAAO,EAAMA,EAAMz2B,OAAQT,EAAQ,GAAI+pE,EAAOpsB,QAI9DzmB,EAAMywC,YACNzwC,EAAMsyC,oBAAsB,KACxBO,EAAOvvD,MACT0c,EAAM2wC,mBAAqBkC,EAAOvvD,KAClCuvD,EAAOvvD,KAAO,MAEd0c,EAAM2wC,mBAAqB,IAAIL,EAActwC,GAE/CA,EAAMuyC,qBAAuB,CAC/B,KAAO,CAEL,KAAOhC,GAAO,CACZ,IAAI1G,EAAQ0G,EAAM1G,MACd9/D,EAAWwmE,EAAMxmE,SACjB68B,EAAK2pC,EAAMzlB,SASf,GAPA6nB,EAAQvkB,EAAQpuB,GAAO,EADbA,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACJsgE,EAAO9/D,EAAU68B,GACpD2pC,EAAQA,EAAMjtD,KACd0c,EAAMuyC,uBAKFvyC,EAAMyxC,QACR,KAEJ,CACc,OAAVlB,IAAgBvwC,EAAMsyC,oBAAsB,KAClD,CACAtyC,EAAMmyC,gBAAkB5B,EACxBvwC,EAAM2xC,kBAAmB,CAC3B,CAoCA,SAASO,EAAWlyC,GAClB,OAAOA,EAAM8vC,QAA2B,IAAjB9vC,EAAMz2B,QAA0C,OAA1By2B,EAAMmyC,kBAA6BnyC,EAAM0uB,WAAa1uB,EAAMyxC,OAC3G,CACA,SAASuB,EAAU5kB,EAAQpuB,GACzBouB,EAAO/mB,QAAO,SAAUpJ,GACtB+B,EAAMywC,YACFxyC,GACF2sC,EAAexc,EAAQnwB,GAEzB+B,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,aACZyyC,EAAY5jB,EAAQpuB,EACtB,GACF,CAaA,SAASgyC,EAAY5jB,EAAQpuB,GAC3B,IAAIizC,EAAOf,EAAWlyC,GACtB,GAAIizC,IAdN,SAAmB7kB,EAAQpuB,GACpBA,EAAMgwC,aAAgBhwC,EAAM+vC,cACF,mBAAlB3hB,EAAO/mB,QAA0BrH,EAAMsX,WAKhDtX,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,eALZS,EAAMywC,YACNzwC,EAAM+vC,aAAc,EACpBt3C,QAAQqO,SAASksC,EAAW5kB,EAAQpuB,IAM1C,CAIIkzC,CAAU9kB,EAAQpuB,GACM,IAApBA,EAAMywC,YACRzwC,EAAM0uB,UAAW,EACjBN,EAAO7uB,KAAK,UACRS,EAAM2rC,cAAa,CAGrB,IAAIsE,EAAS7hB,EAAO/W,iBACf44B,GAAUA,EAAOtE,aAAesE,EAAOrhB,aAC1CR,EAAO4d,SAEX,CAGJ,OAAOiH,CACT,CAxfA,EAAQ,EAAR,CAAoBv8B,EAAUknB,GA4G9BgT,EAAcroE,UAAU6uC,UAAY,WAGlC,IAFA,IAAItzB,EAAUjZ,KAAKsnE,gBACfvjE,EAAM,GACHkV,GACLlV,EAAIia,KAAK/E,GACTA,EAAUA,EAAQR,KAEpB,OAAO1U,CACT,EACA,WACE,IACE1G,OAAOqiB,eAAeqmD,EAAcroE,UAAW,SAAU,CACvDiiB,IAAKsmD,EAAajhC,WAAU,WAC1B,OAAOhlC,KAAKusC,WACd,GAAG,6EAAmF,YAE1F,CAAE,MAAOr8B,GAAI,CACd,CARD,GAasB,mBAAXsJ,QAAyBA,OAAO8uD,aAAiE,mBAA3C/1C,SAAS70B,UAAU8b,OAAO8uD,cACzFtC,EAAkBzzC,SAAS70B,UAAU8b,OAAO8uD,aAC5CjrE,OAAOqiB,eAAemsB,EAAUryB,OAAO8uD,YAAa,CAClD1qE,MAAO,SAAe0qB,GACpB,QAAI09C,EAAgB1uD,KAAKtX,KAAMsoB,IAC3BtoB,OAAS6rC,GACNvjB,GAAUA,EAAO6jB,0BAA0B45B,CACpD,KAGFC,EAAkB,SAAyB19C,GACzC,OAAOA,aAAkBtoB,IAC3B,EA+BF6rC,EAASnuC,UAAU2lE,KAAO,WACxBtD,EAAe//D,KAAM,IAAImmE,EAC3B,EAyBAt6B,EAASnuC,UAAUuc,MAAQ,SAAU+kD,EAAO9/D,EAAU68B,GACpD,IAzNqBjhB,EAyNjBqa,EAAQn1B,KAAKmsC,eACbpnC,GAAM,EACNmjE,GAAS/yC,EAAM+qC,aA3NEplD,EA2N0BkkD,EA1NxC9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAwO9C,OAbI4I,IAAUhqE,EAAO6c,SAASikD,KAC5BA,EAhOJ,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CA8NY4C,CAAoB5C,IAEN,mBAAb9/D,IACT68B,EAAK78B,EACLA,EAAW,MAETgpE,EAAOhpE,EAAW,SAAmBA,IAAUA,EAAWi2B,EAAM4rC,iBAClD,mBAAPhlC,IAAmBA,EAAKyqC,GAC/BrxC,EAAM8vC,OArCZ,SAAuB1hB,EAAQxnB,GAC7B,IAAI5F,EAAK,IAAImwC,EAEbvG,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,EACvB,CAgCoBoyC,CAAcvoE,KAAM+7B,IAAamsC,GA3BrD,SAAoB3kB,EAAQpuB,EAAO6pC,EAAOjjC,GACxC,IAAI5F,EAMJ,OALc,OAAV6oC,EACF7oC,EAAK,IAAIkwC,EACiB,iBAAVrH,GAAuB7pC,EAAM+qC,aAC7C/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,UAAWk4C,KAE3D7oC,IACF4pC,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,IACd,EAGX,CAc8DqyC,CAAWxoE,KAAMm1B,EAAO6pC,EAAOjjC,MACzF5G,EAAMywC,YACN7gE,EAiDJ,SAAuBw+C,EAAQpuB,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,GAC5D,IAAKmsC,EAAO,CACV,IAAIO,EArBR,SAAqBtzC,EAAO6pC,EAAO9/D,GAIjC,OAHKi2B,EAAM+qC,aAAsC,IAAxB/qC,EAAMwxC,eAA4C,iBAAV3H,IAC/DA,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,IAEtB8/D,CACT,CAgBmB0J,CAAYvzC,EAAO6pC,EAAO9/D,GACrC8/D,IAAUyJ,IACZP,GAAQ,EACRhpE,EAAW,SACX8/D,EAAQyJ,EAEZ,CACA,IAAIpnE,EAAM8zB,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACvCy2B,EAAMz2B,QAAU2C,EAChB,IAAI0D,EAAMowB,EAAMz2B,OAASy2B,EAAMmX,cAG/B,GADKvnC,IAAKowB,EAAM8uC,WAAY,GACxB9uC,EAAMyxC,SAAWzxC,EAAM0xC,OAAQ,CACjC,IAAI5jD,EAAOkS,EAAMsyC,oBACjBtyC,EAAMsyC,oBAAsB,CAC1BzI,MAAOA,EACP9/D,SAAUA,EACVgpE,MAAOA,EACPjoB,SAAUlkB,EACVtjB,KAAM,MAEJwK,EACFA,EAAKxK,KAAO0c,EAAMsyC,oBAElBtyC,EAAMmyC,gBAAkBnyC,EAAMsyC,oBAEhCtyC,EAAMuyC,sBAAwB,CAChC,MACEI,EAAQvkB,EAAQpuB,GAAO,EAAO9zB,EAAK29D,EAAO9/D,EAAU68B,GAEtD,OAAOh3B,CACT,CAlFU4jE,CAAc3oE,KAAMm1B,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,IAEpDh3B,CACT,EACA8mC,EAASnuC,UAAUkrE,KAAO,WACxB5oE,KAAKmsC,eAAe06B,QACtB,EACAh7B,EAASnuC,UAAUmrE,OAAS,WAC1B,IAAI1zC,EAAQn1B,KAAKmsC,eACbhX,EAAM0xC,SACR1xC,EAAM0xC,SACD1xC,EAAMyxC,SAAYzxC,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBAAiBC,EAAYvnE,KAAMm1B,GAE/G,EACA0W,EAASnuC,UAAUorE,mBAAqB,SAA4B5pE,GAGlE,GADwB,iBAAbA,IAAuBA,EAAWA,EAAS2c,iBAChD,CAAC,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOY,SAASvd,EAAW,IAAI2c,gBAAkB,GAAI,MAAM,IAAI0qD,EAAqBrnE,GAExL,OADAc,KAAKmsC,eAAe40B,gBAAkB7hE,EAC/Bc,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAQFlvC,OAAOqiB,eAAemsB,EAASnuC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAuKFT,EAASnuC,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACrDA,EAAG,IAAI8jC,EAA2B,YACpC,EACAh0B,EAASnuC,UAAUmqE,QAAU,KAC7Bh8B,EAASnuC,UAAUyD,IAAM,SAAU69D,EAAO9/D,EAAU68B,GAClD,IAAI5G,EAAQn1B,KAAKmsC,eAmBjB,MAlBqB,mBAAV6yB,GACTjjC,EAAKijC,EACLA,EAAQ,KACR9/D,EAAW,MACkB,mBAAbA,IAChB68B,EAAK78B,EACLA,EAAW,MAET8/D,SAAuCh/D,KAAKia,MAAM+kD,EAAO9/D,GAGzDi2B,EAAM0xC,SACR1xC,EAAM0xC,OAAS,EACf7mE,KAAK6oE,UAIF1zC,EAAM8vC,QAyDb,SAAqB1hB,EAAQpuB,EAAO4G,GAClC5G,EAAM8vC,QAAS,EACfkC,EAAY5jB,EAAQpuB,GAChB4G,IACE5G,EAAM0uB,SAAUj2B,QAAQqO,SAASF,GAASwnB,EAAOzwB,KAAK,SAAUiJ,IAEtE5G,EAAMiX,OAAQ,EACdmX,EAAOzlD,UAAW,CACpB,CAjEqBirE,CAAY/oE,KAAMm1B,EAAO4G,GACrC/7B,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAqEFrB,OAAOqiB,eAAemsB,EAASnuC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKmsC,gBAGFnsC,KAAKmsC,eAAeM,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKmsC,iBAMVnsC,KAAKmsC,eAAeM,UAAY7uC,EAClC,IAEFiuC,EAASnuC,UAAUyjE,QAAUzB,EAAYyB,QACzCt1B,EAASnuC,UAAUqkE,WAAarC,EAAYsC,UAC5Cn2B,EAASnuC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,0BC/jBAn2B,EAAOD,QAAU2/B,EACjB,IAAI02B,EAAiB,QACnBwM,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvC8C,EAAqC3V,EAAe2V,mCACpDC,EAA8B5V,EAAe4V,4BAC3Ct9B,EAAS,EAAQ,IAErB,SAASu9B,EAAe/yC,EAAIhb,GAC1B,IAAIguD,EAAKnpE,KAAKopE,gBACdD,EAAGE,cAAe,EAClB,IAAIttC,EAAKotC,EAAGnC,QACZ,GAAW,OAAPjrC,EACF,OAAO/7B,KAAK00B,KAAK,QAAS,IAAIwxC,GAEhCiD,EAAGG,WAAa,KAChBH,EAAGnC,QAAU,KACD,MAAR7rD,GAEFnb,KAAKge,KAAK7C,GACZ4gB,EAAG5F,GACH,IAAIozC,EAAKvpE,KAAKwsC,eACd+8B,EAAGhJ,SAAU,GACTgJ,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBACpCtsC,KAAKkhE,MAAMqI,EAAGj9B,cAElB,CACA,SAAS3P,EAAU9Q,GACjB,KAAM7rB,gBAAgB28B,GAAY,OAAO,IAAIA,EAAU9Q,GACvD8f,EAAOr0B,KAAKtX,KAAM6rB,GAClB7rB,KAAKopE,gBAAkB,CACrBF,eAAgBA,EAAe7zC,KAAKr1B,MACpCwpE,eAAe,EACfH,cAAc,EACdrC,QAAS,KACTsC,WAAY,KACZG,cAAe,MAIjBzpE,KAAKwsC,eAAeg0B,cAAe,EAKnCxgE,KAAKwsC,eAAe0T,MAAO,EACvBr0B,IAC+B,mBAAtBA,EAAQrd,YAA0BxO,KAAK49B,WAAa/R,EAAQrd,WAC1C,mBAAlBqd,EAAQ69C,QAAsB1pE,KAAK69B,OAAShS,EAAQ69C,QAIjE1pE,KAAK0zB,GAAG,YAAa20C,EACvB,CACA,SAASA,IACP,IAAI9S,EAAQv1D,KACe,mBAAhBA,KAAK69B,QAA0B79B,KAAKwsC,eAAeC,UAK5D3O,EAAK99B,KAAM,KAAM,MAJjBA,KAAK69B,QAAO,SAAU1H,EAAIhb,GACxB2iB,EAAKy3B,EAAOp/B,EAAIhb,EAClB,GAIJ,CAiDA,SAAS2iB,EAAKylB,EAAQptB,EAAIhb,GACxB,GAAIgb,EAAI,OAAOotB,EAAO7uB,KAAK,QAASyB,GAQpC,GAPY,MAARhb,GAEFooC,EAAOvlC,KAAK7C,GAKVooC,EAAOpX,eAAeztC,OAAQ,MAAM,IAAIuqE,EAC5C,GAAI1lB,EAAO6lB,gBAAgBC,aAAc,MAAM,IAAIL,EACnD,OAAOzlB,EAAOvlC,KAAK,KACrB,CArHA,EAAQ,EAAR,CAAoB2e,EAAWgP,GAyD/BhP,EAAUj/B,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GAE1C,OADAc,KAAKopE,gBAAgBI,eAAgB,EAC9B79B,EAAOjuC,UAAUsgB,KAAK1G,KAAKtX,KAAMg/D,EAAO9/D,EACjD,EAYAy9B,EAAUj/B,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC1DA,EAAG,IAAI8jC,EAA2B,gBACpC,EACAljC,EAAUj/B,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACtD,IAAIotC,EAAKnpE,KAAKopE,gBAId,GAHAD,EAAGnC,QAAUjrC,EACbotC,EAAGG,WAAatK,EAChBmK,EAAGM,cAAgBvqE,GACdiqE,EAAGE,aAAc,CACpB,IAAIE,EAAKvpE,KAAKwsC,gBACV28B,EAAGK,eAAiBD,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBAAetsC,KAAKkhE,MAAMqI,EAAGj9B,cACzF,CACF,EAKA3P,EAAUj/B,UAAUwjE,MAAQ,SAAU1xD,GACpC,IAAI25D,EAAKnpE,KAAKopE,gBACQ,OAAlBD,EAAGG,YAAwBH,EAAGE,aAMhCF,EAAGK,eAAgB,GALnBL,EAAGE,cAAe,EAClBrpE,KAAK49B,WAAWurC,EAAGG,WAAYH,EAAGM,cAAeN,EAAGD,gBAMxD,EACAvsC,EAAUj/B,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC5C4P,EAAOjuC,UAAU0jE,SAAS9pD,KAAKtX,KAAMozB,GAAK,SAAUu2C,GAClD5tC,EAAG4tC,EACL,GACF,0BC9KA,MAAMjzB,EAAO15C,EAEb05C,EAAKw+B,OAAS,EAAQ,GAEtBx+B,EAAKx5C,OAAS,cACdw5C,EAAK72C,KAAO,EAAQ,KACpB62C,EAAK0R,UAAY,EAAQ,KACzB1R,EAAKy+B,SAAW,EAAQ,KACxBz+B,EAAK0+B,SAAW,EAAQ,6BCRxB,MAAMA,EAAWp4E,EAEjBo4E,EAASC,IAAM,EAAQ,KACvBD,EAASE,IAAM,EAAQ,6BCHvB,MAAM51E,EAAW,EAAQ,GACnBxB,EAAS,aACTiwD,EAAO,EAAQ,IAGfknB,EAAM,EAAQ,IAEpB,SAASE,EAAWrkB,GAClBlxD,KAAKiwB,IAAM,MACXjwB,KAAKkX,KAAOg6C,EAAOh6C,KACnBlX,KAAKkxD,OAASA,EAGdlxD,KAAKw1E,KAAO,IAAIC,EAChBz1E,KAAKw1E,KAAKp1E,MAAM8wD,EAAOjC,KACzB,CASA,SAASwmB,EAAQr2C,GACf+uB,EAAK72C,KAAKtX,KAAM,MAAOo/B,EACzB,CAkHA,SAAS+N,EAAI1rC,GACX,OAAIA,EAAM,GACD,IAAMA,EAENA,CACX,CAjIAxE,EAAOD,QAAUu4E,EAEjBA,EAAW73E,UAAU4sB,OAAS,SAAgBnP,EAAMm2C,GAClD,OAAOtxD,KAAKw1E,KAAK3lC,QAAQ10B,EAAMm2C,GAAUp4B,MAC3C,EAOAx5B,EAAS+1E,EAAStnB,GAElBsnB,EAAQ/3E,UAAUm0D,iBAAmB,SAAyB1a,EAC5DtQ,EACA+qB,EACAH,GACA,MAAMikB,EA2OR,SAAmBv+B,EAAKtQ,EAAW+qB,EAAKN,GACtC,IAAI/rD,EAOJ,GALY,UAAR4xC,EACFA,EAAM,MACS,UAARA,IACPA,EAAM,OAEJk+B,EAAIx7B,UAAU3rB,eAAeipB,GAC/B5xC,EAAM8vE,EAAIx7B,UAAU1C,OACjB,IAAmB,iBAARA,IAA2B,EAANA,KAAaA,EAGhD,OAAOma,EAAS7xC,MAAM,gBAAkB03B,GAFxC5xC,EAAM4xC,CAEsC,CAE9C,OAAI5xC,GAAO,GACF+rD,EAAS7xC,MAAM,yCAEnBonB,IACHthC,GAAO,IAETA,GAAQ8vE,EAAIz7B,eAAegY,GAAO,cAAgB,EAE3CrsD,EACT,CAnQqBowE,CAAUx+B,EAAKtQ,EAAW+qB,EAAK5xD,KAAKsxD,UAGvD,GAAIG,EAAQ/yD,OAAS,IAAM,CACzB,MAAMk3E,EAAS13E,EAAOU,MAAM,GAG5B,OAFAg3E,EAAO,GAAKF,EACZE,EAAO,GAAKnkB,EAAQ/yD,OACbsB,KAAKqxD,qBAAqB,CAAEukB,EAAQnkB,GAC7C,CAIA,IAAIokB,EAAY,EAChB,IAAK,IAAIr0E,EAAIiwD,EAAQ/yD,OAAQ8C,GAAK,IAAOA,IAAM,EAC7Cq0E,IAEF,MAAMD,EAAS13E,EAAOU,MAAM,EAAQi3E,GACpCD,EAAO,GAAKF,EACZE,EAAO,GAAK,IAAOC,EAEnB,IAAK,IAAIr0E,EAAI,EAAIq0E,EAAWrzE,EAAIivD,EAAQ/yD,OAAQ8D,EAAI,EAAGhB,IAAKgB,IAAM,EAChEozE,EAAOp0E,GAAS,IAAJgB,EAEd,OAAOxC,KAAKqxD,qBAAqB,CAAEukB,EAAQnkB,GAC7C,EAEAgkB,EAAQ/3E,UAAUo0D,WAAa,SAAmB7wD,EAAKk2C,GACrD,GAAY,WAARA,EACF,OAAOn3C,KAAKqxD,qBAAqB,CAAe,EAAbpwD,EAAI60E,OAAY70E,EAAIka,OAClD,GAAY,WAARg8B,EAAkB,CAC3B,MAAMh4C,EAAMjB,EAAOU,MAAmB,EAAbqC,EAAIvC,QAC7B,IAAK,IAAI8C,EAAI,EAAGA,EAAIP,EAAIvC,OAAQ8C,IAC9BrC,EAAIulB,cAAczjB,EAAIL,WAAWY,GAAQ,EAAJA,GAEvC,OAAOxB,KAAKqxD,qBAAqBlyD,EACnC,CAAO,MAAY,WAARg4C,EACJn3C,KAAKoyD,UAAUnxD,GAIbjB,KAAKqxD,qBAAqBpwD,GAHxBjB,KAAKsxD,SAAS7xC,MAAM,kEAIZ,aAAR03B,EACJn3C,KAAKqyD,YAAYpxD,GAQfjB,KAAKqxD,qBAAqBpwD,GAPxBjB,KAAKsxD,SAAS7xC,MAAM,qNAQpB,OAAOmJ,KAAKuuB,IAEJ,YAARA,EADFn3C,KAAKqxD,qBAAqBpwD,GAI1BjB,KAAKsxD,SAAS7xC,MAAM,4BAA8B03B,EAC9B,eAE/B,EAEAs+B,EAAQ/3E,UAAUq0D,aAAe,SAAqBvoC,EAAIoC,EAAQmqD,GAChE,GAAkB,iBAAPvsD,EAAiB,CAC1B,IAAKoC,EACH,OAAO5rB,KAAKsxD,SAAS7xC,MAAM,+CAC7B,IAAKmM,EAAOsC,eAAe1E,GACzB,OAAOxpB,KAAKsxD,SAAS7xC,MAAM,iCAC7B+J,EAAKoC,EAAOpC,GAAItR,MAAM,WACtB,IAAK,IAAI1W,EAAI,EAAGA,EAAIgoB,EAAG9qB,OAAQ8C,IAC7BgoB,EAAGhoB,IAAM,CACb,MAAO,GAAIE,MAAMC,QAAQ6nB,GAAK,CAC5BA,EAAKA,EAAGtP,QACR,IAAK,IAAI1Y,EAAI,EAAGA,EAAIgoB,EAAG9qB,OAAQ8C,IAC7BgoB,EAAGhoB,IAAM,CACb,CAEA,IAAKE,MAAMC,QAAQ6nB,GACjB,OAAOxpB,KAAKsxD,SAAS7xC,MAAM,kDACUqlB,KAAKzM,UAAU7O,IAGtD,IAAKusD,EAAU,CACb,GAAIvsD,EAAG,IAAM,GACX,OAAOxpB,KAAKsxD,SAAS7xC,MAAM,+BAC7B+J,EAAGwR,OAAO,EAAG,EAAW,GAARxR,EAAG,GAAUA,EAAG,GAClC,CAGA,IAAIxqB,EAAO,EACX,IAAK,IAAIwC,EAAI,EAAGA,EAAIgoB,EAAG9qB,OAAQ8C,IAAK,CAClC,IAAIw0E,EAAQxsD,EAAGhoB,GACf,IAAKxC,IAAQg3E,GAAS,IAAMA,IAAU,EACpCh3E,GACJ,CAEA,MAAMi3E,EAAQ/3E,EAAOU,MAAMI,GAC3B,IAAIqe,EAAS44D,EAAMv3E,OAAS,EAC5B,IAAK,IAAI8C,EAAIgoB,EAAG9qB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACvC,IAAIw0E,EAAQxsD,EAAGhoB,GAEf,IADAy0E,EAAM54D,KAAoB,IAAR24D,GACVA,IAAU,GAAK,GACrBC,EAAM54D,KAAY,IAAgB,IAAR24D,CAC9B,CAEA,OAAOh2E,KAAKqxD,qBAAqB4kB,EACnC,EASAR,EAAQ/3E,UAAUs0D,YAAc,SAAoBjpB,EAAMoO,GACxD,IAAIl2C,EACJ,MAAMi1E,EAAO,IAAIzuC,KAAKsB,GA0BtB,MAxBY,YAARoO,EACFl2C,EAAM,CACJksC,EAAI+oC,EAAKC,kBACThpC,EAAI+oC,EAAKE,cAAgB,GACzBjpC,EAAI+oC,EAAKG,cACTlpC,EAAI+oC,EAAKI,eACTnpC,EAAI+oC,EAAKK,iBACTppC,EAAI+oC,EAAKM,iBACT,KACAt9C,KAAK,IACU,YAARie,EACTl2C,EAAM,CACJksC,EAAI+oC,EAAKC,iBAAmB,KAC5BhpC,EAAI+oC,EAAKE,cAAgB,GACzBjpC,EAAI+oC,EAAKG,cACTlpC,EAAI+oC,EAAKI,eACTnpC,EAAI+oC,EAAKK,iBACTppC,EAAI+oC,EAAKM,iBACT,KACAt9C,KAAK,IAEPl5B,KAAKsxD,SAAS7xC,MAAM,YAAc03B,EAAM,8BAGnCn3C,KAAK8xD,WAAW7wD,EAAK,SAC9B,EAEAw0E,EAAQ/3E,UAAUu0D,YAAc,WAC9B,OAAOjyD,KAAKqxD,qBAAqB,GACnC,EAEAokB,EAAQ/3E,UAAUw0D,WAAa,SAAmBzwD,EAAKmqB,GACrD,GAAmB,iBAARnqB,EAAkB,CAC3B,IAAKmqB,EACH,OAAO5rB,KAAKsxD,SAAS7xC,MAAM,+CAC7B,IAAKmM,EAAOsC,eAAezsB,GACzB,OAAOzB,KAAKsxD,SAAS7xC,MAAM,+BACAqlB,KAAKzM,UAAU52B,IAE5CA,EAAMmqB,EAAOnqB,EACf,CAGA,GAAmB,iBAARA,IAAqBvD,EAAO6c,SAAStZ,GAAM,CACpD,MAAMg1E,EAAWh1E,EAAIa,WAChBb,EAAI6lD,MAAsB,IAAdmvB,EAAS,IACxBA,EAAS9hD,QAAQ,GAEnBlzB,EAAMvD,EAAOS,KAAK83E,EACpB,CAEA,GAAIv4E,EAAO6c,SAAStZ,GAAM,CACxB,IAAIzC,EAAOyC,EAAI/C,OACI,IAAf+C,EAAI/C,QACNM,IAEF,MAAM+E,EAAM7F,EAAOU,MAAMI,GAIzB,OAHAyC,EAAI2B,KAAKW,GACU,IAAftC,EAAI/C,SACNqF,EAAI,GAAK,GACJ/D,KAAKqxD,qBAAqBttD,EACnC,CAEA,GAAItC,EAAM,IACR,OAAOzB,KAAKqxD,qBAAqB5vD,GAEnC,GAAIA,EAAM,IACR,OAAOzB,KAAKqxD,qBAAqB,CAAC,EAAG5vD,IAEvC,IAAIzC,EAAO,EACX,IAAK,IAAIwC,EAAIC,EAAKD,GAAK,IAAOA,IAAM,EAClCxC,IAEF,MAAM+E,EAAM,IAAIrC,MAAM1C,GACtB,IAAK,IAAIwC,EAAIuC,EAAIrF,OAAS,EAAG8C,GAAK,EAAGA,IACnCuC,EAAIvC,GAAW,IAANC,EACTA,IAAQ,EAMV,OAJY,IAATsC,EAAI,IACLA,EAAI4wB,QAAQ,GAGP30B,KAAKqxD,qBAAqBnzD,EAAOS,KAAKoF,GAC/C,EAEA0xE,EAAQ/3E,UAAUy0D,YAAc,SAAoBv0D,GAClD,OAAOoC,KAAKqxD,qBAAqBzzD,EAAQ,IAAO,EAClD,EAEA63E,EAAQ/3E,UAAUyzD,KAAO,SAAaD,EAAQp2C,GAG5C,MAFsB,mBAAXo2C,IACTA,EAASA,EAAOp2C,IACXo2C,EAAOwlB,YAAY,OAAOlB,IACnC,EAEAC,EAAQ/3E,UAAU8zD,aAAe,SAAqBmlB,EAAYrlB,EAAUlyB,GAC1E,MAAMjK,EAAQn1B,KAAKouD,WACnB,IAAI5sD,EACJ,GAAyB,OAArB2zB,EAAe,QACjB,OAAO,EAET,MAAMha,EAAOw7D,EAAWz9C,OAIxB,QAH4B95B,IAAxB+1B,EAAMyhD,gBACRzhD,EAAMyhD,cAAgB52E,KAAKuxD,aAAap8B,EAAe,QAAGm8B,EAAUlyB,GAAQlG,QAE1E/d,EAAKzc,SAAWy2B,EAAMyhD,cAAcl4E,OACtC,OAAO,EAET,IAAK8C,EAAE,EAAGA,EAAI2Z,EAAKzc,OAAQ8C,IACzB,GAAI2Z,EAAK3Z,KAAO2zB,EAAMyhD,cAAcp1E,GAClC,OAAO,EAEX,OAAO,CACT,0BCxQA,MAAM9B,EAAW,EAAQ,GAEzB,SAASquD,EAASliC,GAChB7rB,KAAKuwD,eAAiB,CACpBz1C,IAAK,KACLqN,KAAM,GACN0D,QAASA,GAAW,CAAC,EACrB3F,OAAQ,GAEZ,CA2FA,SAAS2wD,EAAc1uD,EAAM3oB,GAC3BQ,KAAKmoB,KAAOA,EACZnoB,KAAK82E,QAAQt3E,EACf,CA7FAxC,EAAQ,EAAW+wD,EAEnBA,EAASrwD,UAAU2pC,QAAU,SAAiBvsB,GAC5C,OAAOA,aAAe+7D,CACxB,EAEA9oB,EAASrwD,UAAUoyD,KAAO,WACxB,MAAM36B,EAAQn1B,KAAKuwD,eAEnB,MAAO,CAAEz1C,IAAKqa,EAAMra,IAAKi8D,QAAS5hD,EAAMhN,KAAKzpB,OAC/C,EAEAqvD,EAASrwD,UAAUuyD,QAAU,SAAiB90C,GAC5C,MAAMga,EAAQn1B,KAAKuwD,eAEnBp7B,EAAMra,IAAMK,EAAKL,IACjBqa,EAAMhN,KAAOgN,EAAMhN,KAAKjO,MAAM,EAAGiB,EAAK47D,QACxC,EAEAhpB,EAASrwD,UAAUkyD,SAAW,SAAkBtxD,GAC9C,OAAO0B,KAAKuwD,eAAepoC,KAAKnK,KAAK1f,EACvC,EAEAyvD,EAASrwD,UAAU+yD,QAAU,SAAiB/vD,GAC5C,MAAMy0B,EAAQn1B,KAAKuwD,eAEnBp7B,EAAMhN,KAAOgN,EAAMhN,KAAKjO,MAAM,EAAGxZ,EAAQ,EAC3C,EAEAqtD,EAASrwD,UAAUgzD,SAAW,SAAkBhwD,EAAOpC,EAAKV,GAC1D,MAAMu3B,EAAQn1B,KAAKuwD,eAEnBvwD,KAAKywD,QAAQ/vD,GACK,OAAdy0B,EAAMra,MACRqa,EAAMra,IAAIxc,GAAOV,EACrB,EAEAmwD,EAASrwD,UAAUyqB,KAAO,WACxB,OAAOnoB,KAAKuwD,eAAepoC,KAAK+Q,KAAK,IACvC,EAEA60B,EAASrwD,UAAUwyD,YAAc,WAC/B,MAAM/6B,EAAQn1B,KAAKuwD,eAEb/3C,EAAO2c,EAAMra,IAEnB,OADAqa,EAAMra,IAAM,CAAC,EACNtC,CACT,EAEAu1C,EAASrwD,UAAU8yD,YAAc,SAAqBh4C,GACpD,MAAM2c,EAAQn1B,KAAKuwD,eAEbymB,EAAM7hD,EAAMra,IAElB,OADAqa,EAAMra,IAAMtC,EACLw+D,CACT,EAEAjpB,EAASrwD,UAAU+hB,MAAQ,SAAejgB,GACxC,IAAI4zB,EACJ,MAAM+B,EAAQn1B,KAAKuwD,eAEbtS,EAAYz+C,aAAeq3E,EASjC,GAPEzjD,EADE6qB,EACIz+C,EAEA,IAAIq3E,EAAc1hD,EAAMhN,KAAKoW,KAAI,SAAS04C,GAC9C,MAAO,IAAMnyC,KAAKzM,UAAU4+C,GAAQ,GACtC,IAAG/9C,KAAK,IAAK15B,EAAIinB,SAAWjnB,EAAKA,EAAIgnB,QAGlC2O,EAAMtJ,QAAQqrD,QACjB,MAAM9jD,EAKR,OAHK6qB,GACH9oB,EAAMjP,OAAOlI,KAAKoV,GAEbA,CACT,EAEA26B,EAASrwD,UAAU8xD,WAAa,SAAoBva,GAClD,MAAM9f,EAAQn1B,KAAKuwD,eACnB,OAAKp7B,EAAMtJ,QAAQqrD,QAGZ,CACLjiC,OAAQj1C,KAAKqnC,QAAQ4N,GAAU,KAAOA,EACtC/uB,OAAQiP,EAAMjP,QAJP+uB,CAMX,EAMAv1C,EAASm3E,EAAep3E,OAExBo3E,EAAcn5E,UAAUo5E,QAAU,SAAiBt3E,GAKjD,GAJAQ,KAAKymB,QAAUjnB,EAAM,SAAWQ,KAAKmoB,MAAQ,aACzC1oB,MAAMutB,mBACRvtB,MAAMutB,kBAAkBhtB,KAAM62E,IAE3B72E,KAAKwmB,MACR,IAEE,MAAM,IAAI/mB,MAAMO,KAAKymB,QACvB,CAAE,MAAOlmB,GACPP,KAAKwmB,MAAQjmB,EAAEimB,KACjB,CAEF,OAAOxmB,IACT,0BCxHA,MAAMm1E,EAAWn4E,EAEjBm4E,EAASE,IAAM,EAAQ,KACvBF,EAASG,IAAM,EAAQ,6BCHvB,MAAM51E,EAAW,EAAQ,GAEnBw1E,EAAS,EAAQ,GACjBjnB,EAAgB,QAChBE,EAAO,EAAQ,IAGfknB,EAAM,EAAQ,IAEpB,SAAS8B,EAAWjmB,GAClBlxD,KAAKiwB,IAAM,MACXjwB,KAAKkX,KAAOg6C,EAAOh6C,KACnBlX,KAAKkxD,OAASA,EAGdlxD,KAAKw1E,KAAO,IAAIC,EAChBz1E,KAAKw1E,KAAKp1E,MAAM8wD,EAAOjC,KACzB,CAaA,SAASwmB,EAAQr2C,GACf+uB,EAAK72C,KAAKtX,KAAM,MAAOo/B,EACzB,CA6OA,SAASg4C,EAAaj4E,EAAKszD,GACzB,IAAItb,EAAMh4C,EAAIkjB,UAAUowC,GACxB,GAAItzD,EAAIkoC,QAAQ8P,GACd,OAAOA,EAET,MAAMya,EAAMyjB,EAAI17B,SAASxC,GAAO,GAC1BtQ,EAA6B,IAAV,GAANsQ,GAGnB,GAAqB,KAAV,GAANA,GAAsB,CACzB,IAAIkgC,EAAMlgC,EAEV,IADAA,EAAM,EACkB,MAAV,IAANkgC,IAAsB,CAE5B,GADAA,EAAMl4E,EAAIkjB,UAAUowC,GAChBtzD,EAAIkoC,QAAQgwC,GACd,OAAOA,EAETlgC,IAAQ,EACRA,GAAa,IAANkgC,CACT,CACF,MACElgC,GAAO,GAIT,MAAO,CACLya,IAAKA,EACL/qB,UAAWA,EACXsQ,IAAKA,EACLmgC,OANajC,EAAIl+B,IAAIA,GAQzB,CAEA,SAASogC,EAAap4E,EAAK0nC,EAAW4rB,GACpC,IAAIpxD,EAAMlC,EAAIkjB,UAAUowC,GACxB,GAAItzD,EAAIkoC,QAAQhmC,GACd,OAAOA,EAGT,IAAKwlC,GAAqB,MAARxlC,EAChB,OAAO,KAGT,GAAqB,IAAV,IAANA,GAEH,OAAOA,EAIT,MAAMI,EAAY,IAANJ,EACZ,GAAII,EAAM,EACR,OAAOtC,EAAIsgB,MAAM,6BAEnBpe,EAAM,EACN,IAAK,IAAIG,EAAI,EAAGA,EAAIC,EAAKD,IAAK,CAC5BH,IAAQ,EACR,MAAMmB,EAAIrD,EAAIkjB,UAAUowC,GACxB,GAAItzD,EAAIkoC,QAAQ7kC,GACd,OAAOA,EACTnB,GAAOmB,CACT,CAEA,OAAOnB,CACT,CA1TApE,EAAOD,QAAUm6E,EAEjBA,EAAWz5E,UAAU8hC,OAAS,SAAgBrkB,EAAM0Q,GAKlD,OAJKoiC,EAAcsE,gBAAgBp3C,KACjCA,EAAO,IAAI8yC,EAAc9yC,EAAM0Q,IAG1B7rB,KAAKw1E,KAAKjmB,QAAQp0C,EAAM0Q,EACjC,EAOAnsB,EAAS+1E,EAAStnB,GAElBsnB,EAAQ/3E,UAAUmyD,SAAW,SAAiB5xD,EAAQk5C,EAAKqX,GACzD,GAAIvwD,EAAOu0D,UACT,OAAO,EAET,MAAMr9B,EAAQl3B,EAAO6xD,OACf0nB,EAAaJ,EAAan5E,EAAQ,wBAA0Bk5C,EAAM,KACxE,OAAIl5C,EAAOopC,QAAQmwC,GACVA,GAETv5E,EAAOgyD,QAAQ96B,GAERqiD,EAAWrgC,MAAQA,GAAOqgC,EAAWF,SAAWngC,GACpDqgC,EAAWF,OAAS,OAAUngC,GAAOqX,EAC1C,EAEAinB,EAAQ/3E,UAAUyyD,WAAa,SAAmBlyD,EAAQk5C,EAAKqX,GAC7D,MAAMgpB,EAAaJ,EAAan5E,EAC9B,4BAA8Bk5C,EAAM,KACtC,GAAIl5C,EAAOopC,QAAQmwC,GACjB,OAAOA,EAET,IAAIn2E,EAAMk2E,EAAat5E,EACrBu5E,EAAW3wC,UACX,4BAA8BsQ,EAAM,KAGtC,GAAIl5C,EAAOopC,QAAQhmC,GACjB,OAAOA,EAET,IAAKmtD,GACDgpB,EAAWrgC,MAAQA,GACnBqgC,EAAWF,SAAWngC,GACtBqgC,EAAWF,OAAS,OAASngC,EAC/B,OAAOl5C,EAAOwhB,MAAM,yBAA2B03B,EAAM,KAGvD,GAAIqgC,EAAW3wC,WAAqB,OAARxlC,EAC1B,OAAOpD,EAAOu+C,KAAKn7C,EAAK,6BAA+B81C,EAAM,KAG/D,MAAMhiB,EAAQl3B,EAAO6xD,OACfvqD,EAAMvF,KAAKy3E,cACfx5E,EACA,2CAA6C+B,KAAKm3C,IAAM,KAC1D,OAAIl5C,EAAOopC,QAAQ9hC,GACVA,GAETlE,EAAMpD,EAAOof,OAAS8X,EAAM9X,OAC5Bpf,EAAOgyD,QAAQ96B,GACRl3B,EAAOu+C,KAAKn7C,EAAK,6BAA+B81C,EAAM,KAC/D,EAEAs+B,EAAQ/3E,UAAU+5E,cAAgB,SAAsBx5E,EAAQw0D,GAC9D,OAAS,CACP,MAAMtb,EAAMigC,EAAan5E,EAAQw0D,GACjC,GAAIx0D,EAAOopC,QAAQ8P,GACjB,OAAOA,EACT,MAAM91C,EAAMk2E,EAAat5E,EAAQk5C,EAAItQ,UAAW4rB,GAChD,GAAIx0D,EAAOopC,QAAQhmC,GACjB,OAAOA,EAET,IAAIkE,EAOJ,GALEA,EADE4xC,EAAItQ,WAAqB,OAARxlC,EACbpD,EAAOu+C,KAAKn7C,GAEZrB,KAAKy3E,cAAcx5E,EAAQw0D,GAG/Bx0D,EAAOopC,QAAQ9hC,GACjB,OAAOA,EAET,GAAmB,QAAf4xC,EAAImgC,OACN,KACJ,CACF,EAEA7B,EAAQ/3E,UAAUizD,YAAc,SAAoB1yD,EAAQk5C,EAAK4F,EAC/DlxB,GACA,MAAMopB,EAAS,GACf,MAAQh3C,EAAOu0D,WAAW,CACxB,MAAMklB,EAAc13E,KAAK6vD,SAAS5xD,EAAQ,OAC1C,GAAIA,EAAOopC,QAAQqwC,GACjB,OAAOA,EAET,MAAMnyE,EAAMw3C,EAAQvd,OAAOvhC,EAAQ,MAAO4tB,GAC1C,GAAI5tB,EAAOopC,QAAQ9hC,IAAQmyE,EACzB,MACFziC,EAAOj3B,KAAKzY,EACd,CACA,OAAO0vC,CACT,EAEAwgC,EAAQ/3E,UAAUkzD,WAAa,SAAmB3yD,EAAQk5C,GACxD,GAAY,WAARA,EAAkB,CACpB,MAAM2+B,EAAS73E,EAAOokB,YACtB,OAAIpkB,EAAOopC,QAAQyuC,GACVA,EACF,CAAEA,OAAQA,EAAQ36D,KAAMld,EAAOmyD,MACxC,CAAO,GAAY,WAARjZ,EAAkB,CAC3B,MAAMiZ,EAAMnyD,EAAOmyD,MACnB,GAAIA,EAAI1xD,OAAS,GAAM,EACrB,OAAOT,EAAOwhB,MAAM,mDAEtB,IAAIxe,EAAM,GACV,IAAK,IAAIO,EAAI,EAAGA,EAAI4uD,EAAI1xD,OAAS,EAAG8C,IAClCP,GAAO8b,OAAOiC,aAAaoxC,EAAInzC,aAAiB,EAAJzb,IAE9C,OAAOP,CACT,CAAO,GAAY,WAARk2C,EAAkB,CAC3B,MAAMwgC,EAAS15E,EAAOmyD,MAAMluD,SAAS,SACrC,OAAKlC,KAAKoyD,UAAUulB,GAIbA,EAHE15E,EAAOwhB,MAAM,yDAIxB,CAAO,GAAY,WAAR03B,EACT,OAAOl5C,EAAOmyD,MACT,GAAY,YAARjZ,EACT,OAAOl5C,EAAOmyD,MACT,GAAY,aAARjZ,EAAoB,CAC7B,MAAMygC,EAAW35E,EAAOmyD,MAAMluD,SAAS,SACvC,OAAKlC,KAAKqyD,YAAYulB,GAIfA,EAHE35E,EAAOwhB,MAAM,2DAIxB,CAAO,MAAI,OAAOmJ,KAAKuuB,GACdl5C,EAAOmyD,MAAMluD,WAEbjE,EAAOwhB,MAAM,4BAA8B03B,EAAM,eAE5D,EAEAs+B,EAAQ/3E,UAAUmzD,aAAe,SAAqB5yD,EAAQ2tB,EAAQmqD,GACpE,IAAI9gC,EACJ,MAAM4iC,EAAc,GACpB,IAAI7B,EAAQ,EACR8B,EAAW,EACf,MAAQ75E,EAAOu0D,WACbslB,EAAW75E,EAAOokB,YAClB2zD,IAAU,EACVA,GAAoB,IAAX8B,EACiB,IAAV,IAAXA,KACHD,EAAY75D,KAAKg4D,GACjBA,EAAQ,GAGG,IAAX8B,GACFD,EAAY75D,KAAKg4D,GAEnB,MAAMhzD,EAAS60D,EAAY,GAAK,GAAM,EAChCE,EAASF,EAAY,GAAK,GAOhC,GAJE5iC,EADE8gC,EACO8B,EAEA,CAAC70D,EAAO+0D,GAAQh4D,OAAO83D,EAAY39D,MAAM,IAEhD0R,EAAQ,CACV,IAAIzU,EAAMyU,EAAOqpB,EAAO/b,KAAK,WACjB95B,IAAR+X,IACFA,EAAMyU,EAAOqpB,EAAO/b,KAAK,YACf95B,IAAR+X,IACF89B,EAAS99B,EACb,CAEA,OAAO89B,CACT,EAEAwgC,EAAQ/3E,UAAUozD,YAAc,SAAoB7yD,EAAQk5C,GAC1D,MAAMl2C,EAAMhD,EAAOmyD,MAAMluD,WAEzB,IAAI81E,EACAC,EACAC,EACAC,EACA52E,EACA62E,EACJ,GAAY,YAARjhC,EACF6gC,EAAyB,EAAlB/2E,EAAIiZ,MAAM,EAAG,GACpB+9D,EAAwB,EAAlBh3E,EAAIiZ,MAAM,EAAG,GACnBg+D,EAAwB,EAAlBj3E,EAAIiZ,MAAM,EAAG,GACnBi+D,EAA0B,EAAnBl3E,EAAIiZ,MAAM,EAAG,IACpB3Y,EAA0B,EAApBN,EAAIiZ,MAAM,GAAI,IACpBk+D,EAA0B,EAApBn3E,EAAIiZ,MAAM,GAAI,QACf,IAAY,YAARi9B,EAYT,OAAOl5C,EAAOwhB,MAAM,YAAc03B,EAAM,8BAXxC6gC,EAAyB,EAAlB/2E,EAAIiZ,MAAM,EAAG,GACpB+9D,EAAwB,EAAlBh3E,EAAIiZ,MAAM,EAAG,GACnBg+D,EAAwB,EAAlBj3E,EAAIiZ,MAAM,EAAG,GACnBi+D,EAAyB,EAAlBl3E,EAAIiZ,MAAM,EAAG,GACpB3Y,EAAyB,EAAnBN,EAAIiZ,MAAM,EAAG,IACnBk+D,EAA0B,EAApBn3E,EAAIiZ,MAAM,GAAI,IAElB89D,EADEA,EAAO,GACF,IAAOA,EAEP,KAAOA,CAGlB,CAEA,OAAOvwC,KAAK4wC,IAAIL,EAAMC,EAAM,EAAGC,EAAKC,EAAM52E,EAAK62E,EAAK,EACtD,EAEA3C,EAAQ/3E,UAAUqzD,YAAc,WAC9B,OAAO,IACT,EAEA0kB,EAAQ/3E,UAAUszD,YAAc,SAAoB/yD,GAClD,MAAMsH,EAAMtH,EAAOokB,YACnB,OAAIpkB,EAAOopC,QAAQ9hC,GACVA,EAEQ,IAARA,CACX,EAEAkwE,EAAQ/3E,UAAUuzD,WAAa,SAAmBhzD,EAAQ2tB,GAExD,MAAMwkC,EAAMnyD,EAAOmyD,MACnB,IAAI7qD,EAAM,IAAI2vE,EAAO9kB,GAKrB,OAHIxkC,IACFrmB,EAAMqmB,EAAOrmB,EAAIrD,SAAS,MAAQqD,GAE7BA,CACT,EAEAkwE,EAAQ/3E,UAAUyzD,KAAO,SAAaD,EAAQp2C,GAG5C,MAFsB,mBAAXo2C,IACTA,EAASA,EAAOp2C,IACXo2C,EAAOonB,YAAY,OAAO9C,IACnC,aC3QA,IAAIzvB,EAAa,EAAQ,IACrB7nD,EAAS,YAab,SAASq6E,EAAO53E,GACd,IAAIoD,EAAM7F,EAAOW,YAAY,GAE7B,OADAkF,EAAI+gB,cAAcnkB,EAAG,GACdoD,CACT,CAfA9G,EAAOD,QAAU,SAAUw7E,EAAMn3E,GAI/B,IAHA,IAEIV,EAFAkF,EAAI3H,EAAOU,MAAM,GACjB4C,EAAI,EAEDqE,EAAEnH,OAAS2C,GAChBV,EAAI43E,EAAM/2E,KACVqE,EAAI3H,EAAO6hB,OAAO,CAACla,EAAGkgD,EAAW,QAAQ1qB,OAAOm9C,GAAMn9C,OAAO16B,GAAG87B,WAElE,OAAO52B,EAAEqU,MAAM,EAAG7Y,EACpB,OCZApE,EAAOD,QAAU,SAAcgH,EAAGC,GAGhC,IAFA,IAAI5C,EAAM2C,EAAEtF,OACR8C,GAAK,IACAA,EAAIH,GACX2C,EAAExC,IAAMyC,EAAEzC,GAEZ,OAAOwC,CACT,aCPA,IAAIrE,EAAK,EAAQ,GACbzB,EAAS,YAUbjB,EAAOD,QARP,SAAqBy7E,EAAWn6E,GAC9B,OAAOJ,EAAOS,KAAK85E,EAChBrjE,MAAMzV,EAAGwZ,KAAK7a,EAAIkuD,UAClB71C,OAAO,IAAIhX,EAAGrB,EAAIwuD,iBAClBt3C,UACAlT,UACL,aCTA,MAAM20B,EAAS,EAAQ,IACjByhD,EAAY,WA6GlB,SAASC,EAAiBC,EAAIC,EAAIC,EAAI/3E,EAAGg4E,EAAIC,EAAKxrE,GAChD,IAAIhM,EAIJ,IAFAy3E,EAAUL,EAAIC,EAAmB,IAAb,EAAI93E,EAAI,GAASg4E,EAAI,EAAG,IAEvCv3E,EAAI,EAAGA,EAAI,EAAIT,EAAGS,IACrB03E,EAASN,EAAQ,GAAJp3E,EAAQu3E,EAAI,EAAG,IAC5BI,EAAUJ,EAAIC,EAAKxrE,GACnByrE,EAAUF,EAAI,EAAGH,EAAIE,EAAU,GAAJt3E,EAAS,IAGtC,IAAKA,EAAI,EAAGA,EAAIT,EAAGS,IACjBy3E,EAAUL,EAAIE,EAAU,EAAJt3E,EAAS,GAAIo3E,EAAIC,EAAU,GAAJr3E,EAAS,IAGtD,IAAKA,EAAI,EAAGA,EAAIT,EAAGS,IACjBy3E,EAAUL,EAAIE,EAAmB,IAAT,EAAJt3E,EAAQ,GAASo3E,EAAIC,EAAe,IAATr3E,EAAIT,GAAS,GAEhE,CAEA,SAASmxB,EAAGluB,EAAGC,GACb,OAAQD,GAAKC,EAAMD,IAAO,GAAKC,CACjC,CAEA,SAASk1E,EAAW7lE,EAAG0lE,EAAKxrE,GAC1B,IAAIhM,EAEJ,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBw3E,EAAIx3E,IAAqB,IAAf8R,EAAM,EAAJ9R,EAAQ,KAAc,EAClCw3E,EAAIx3E,KAAsB,IAAf8R,EAAM,EAAJ9R,EAAQ,KAAc,EACnCw3E,EAAIx3E,KAAsB,IAAf8R,EAAM,EAAJ9R,EAAQ,KAAc,GACnCw3E,EAAIx3E,KAAsB,IAAf8R,EAAM,EAAJ9R,EAAQ,KAAc,GAMrC,IAFAy3E,EAAUD,EAAK,EAAGxrE,EAAG,EAAG,IAEnBhM,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBgM,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,IAAK,GACxBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACvBA,EAAE,KAAO0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACxBA,EAAE,IAAM0kB,EAAE1kB,EAAE,IAAMA,EAAE,GAAI,IACxBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACvBA,EAAE,KAAO0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACxBA,EAAE,IAAM0kB,EAAE1kB,EAAE,IAAMA,EAAE,GAAI,IACxBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,IAAK,IACxBA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,GAAI,GACzBA,EAAE,IAAM0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,GACzBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,IAAK,IACxBA,EAAE,KAAO0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACxBA,EAAE,IAAM0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,GACzBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,IAAK,GACxBA,EAAE,KAAO0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACxBA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,GAAI,IACzBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,GACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACvBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACvBA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,GAAI,GACzBA,EAAE,IAAM0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,GACzBA,EAAE,IAAM0kB,EAAE1kB,EAAE,GAAKA,EAAE,IAAK,IACxBA,EAAE,KAAO0kB,EAAE1kB,EAAE,GAAKA,EAAE,GAAI,IACxBA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,GAC1BA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,GAC1BA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,IAC1BA,EAAE,KAAO0kB,EAAE1kB,EAAE,IAAMA,EAAE,IAAK,IAG5B,IAAKhM,EAAI,EAAGA,EAAI,KAAMA,EAAGw3E,EAAIx3E,GAAKgM,EAAEhM,GAAKw3E,EAAIx3E,GAE7C,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACvB,IAAI43E,EAAS,EAAJ53E,EACT8R,EAAE8lE,EAAK,GAAMJ,EAAIx3E,IAAM,EAAI,IAC3B8R,EAAE8lE,EAAK,GAAMJ,EAAIx3E,IAAM,EAAI,IAC3B8R,EAAE8lE,EAAK,GAAMJ,EAAIx3E,IAAM,GAAK,IAC5B8R,EAAE8lE,EAAK,GAAMJ,EAAIx3E,IAAM,GAAK,GAE9B,CACF,CAGA,SAAS03E,EAAUG,EAAGC,EAAI9lE,EAAG+lE,EAAIl4E,GAC/B,IAAK,IAAIG,EAAI,EAAGA,EAAIH,EAAKG,IACvBgS,EAAE+lE,EAAK/3E,IAAM63E,EAAEC,EAAK93E,EAExB,CAEA,SAASy3E,EAAW76E,EAAKo7E,EAAQn2E,EAAMkrE,EAAS7vE,GAC9C,GAAIR,OAAO6c,SAAS3c,IAAQF,OAAO6c,SAAS1X,GAC1CjF,EAAIgF,KAAKC,EAAMkrE,EAASiL,EAAQA,EAAS96E,QAEzC,KAAOA,KACL2E,EAAKkrE,KAAanwE,EAAIo7E,IAG5B,CAEAv8E,EAAOD,QAAU,CACfy8E,aA/MF,SAAuBn7E,EAAK43C,EAAMpoC,EAAG/M,EAAGgO,EAAG2qE,EAAOC,GAChD,GAAU,IAAN7rE,GAA6B,IAAjBA,EAAKA,EAAI,GAAW,MAAMrO,MAAM,kCAEhD,GAAIqO,EAAI4qE,EAAY,IAAM33E,EAAG,MAAMtB,MAAM,4BACzC,GAAIsB,EAAI23E,EAAY,IAAM3pE,EAAG,MAAMtP,MAAM,4BAEzC,IAWIm6E,EAXAC,EAAK37E,OAAOU,MAAM,IAAMmC,GACxB+4E,EAAI57E,OAAOU,MAAM,IAAMmC,EAAI+M,GAG3BkrE,EAAM,IAAI7lC,WAAW,IACrB3lC,EAAI,IAAI2lC,WAAW,IACnB4lC,EAAK76E,OAAOU,MAAM,IAGlB0U,EAAI2jB,EAAOqhB,WAAWh6C,EAAK43C,EAAM,EAAO,IAAJnnC,EAAUhO,EAAG,UAGrD,GAAI44E,EAAkB,CACpB,IAAII,EAAWhrE,EAAIjB,EAAI,EACnBksE,EAAY,EAEhBJ,EAAe,aACXI,EAGEA,EAAY,KAAS,GACvBL,EAAiB,CACf1gE,QAAS+gE,EACTl3E,MAAOi3E,EACPE,QAAUD,EAAYD,EAAY,KAGxC,CACF,CACA,MAAO,CACLF,KACAC,IACAd,MACAxrE,IACAurE,KACAzlE,IACAsmE,eAEJ,EAoKEM,KAlKFC,eAAqB7mE,EAAGulE,EAAI93E,EAAG+M,EAAGgsE,EAAGD,EAAId,EAAIC,EAAKxrE,EAAGosE,EAAcQ,GACjEA,EAAkBA,GAlDa,IAmD/B,IAEI54E,EADAs3E,EAAK,IAAM/3E,EAKf,IAFAuS,EAAElQ,KAAKy2E,EAJE,EAIMhB,EAAIA,EAAKC,GAEnBt3E,EAAI,EAAGA,EAAIsM,EAAGtM,IACjBq4E,EAAGz2E,KAAK02E,EAAGt4E,EAAIs3E,EAPR,IAOqBA,GACxBt3E,EAAI44E,GAAoB,SACpB,IAAIpnD,SAAQC,GAAWonD,aAAapnD,KAE5C0lD,EAAgBkB,EAXT,EAWiBf,EAAI/3E,EAAGg4E,EAAIC,EAAKxrE,GAEpCosE,GAAcA,IAGpB,IAAKp4E,EAAI,EAAGA,EAAIsM,EAAGtM,IAAK,CACtB,IAAI6b,EAjBG,EAiByB,IAAb,EAAItc,EAAI,GAE3Bm4E,EAASY,GADDD,EAAGn3D,aAAarF,GAAWvP,EAAI,GACvBgrE,EAAIe,EAnBb,EAmBqBf,GACxBt3E,EAAI44E,GAAoB,SACpB,IAAIpnD,SAAQC,GAAWonD,aAAapnD,KAE5C0lD,EAAgBkB,EAvBT,EAuBiBf,EAAI/3E,EAAGg4E,EAAIC,EAAKxrE,GAEpCosE,GAAcA,GACpB,CAEAC,EAAGz2E,KAAKkQ,EAAGulE,EA5BF,IA4BeC,EAC1B,EAoIEwB,SAlIF,SAAmBhnE,EAAGulE,EAAI93E,EAAG+M,EAAGgsE,EAAGD,EAAId,EAAIC,EAAKxrE,EAAGosE,GACjD,IAEIp4E,EADAs3E,EAAK,IAAM/3E,EAKf,IAFAuS,EAAElQ,KAAKy2E,EAJE,EAIMhB,EAAIA,EAAKC,GAEnBt3E,EAAI,EAAGA,EAAIsM,EAAGtM,IACjBq4E,EAAGz2E,KAAK02E,EAAGt4E,EAAIs3E,EAPR,IAOqBA,GAC5BH,EAAgBkB,EART,EAQiBf,EAAI/3E,EAAGg4E,EAAIC,EAAKxrE,GAEpCosE,GAAcA,IAGpB,IAAKp4E,EAAI,EAAGA,EAAIsM,EAAGtM,IAAK,CACtB,IAAI6b,EAdG,EAcyB,IAAb,EAAItc,EAAI,GAE3Bm4E,EAASY,GADDD,EAAGn3D,aAAarF,GAAWvP,EAAI,GACvBgrE,EAAIe,EAhBb,EAgBqBf,GAC5BH,EAAgBkB,EAjBT,EAiBiBf,EAAI/3E,EAAGg4E,EAAIC,EAAKxrE,GAEpCosE,GAAcA,GACpB,CAEAC,EAAGz2E,KAAKkQ,EAAGulE,EAtBF,IAsBeC,EAC1B,2BClFA,IAAIntC,EAHJ1uC,EAAOD,QAAU4uC,EAMjBA,EAASuzB,cAAgBA,EAGhB,mBAAT,IAqBIC,EApBAC,EAAkB,SAAyBtsC,EAAS7X,GACtD,OAAO6X,EAAQsD,UAAUnb,GAAMxc,MACjC,EAIIq0D,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EASvK0lD,EAAY,EAAQ,KAGtBH,EADEG,GAAaA,EAAUh3B,SACjBg3B,EAAUh3B,SAAS,UAEnB,WAAkB,EAI5B,IAWI3L,EACA4iC,EACA7gE,EAbA8gE,EAAa,EAAQ,KACrBC,EAAc,EAAQ,KAExBC,EADa,EAAQ,KACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC84C,EAA4BvM,EAAeuM,0BAC3CC,EAA6BxM,EAAewM,2BAC5CC,EAAqCzM,EAAeyM,mCAMtD,EAAQ,EAAR,CAAoBl0B,EAAUmnB,GAC9B,IAAIgN,EAAiBL,EAAYK,eAC7BC,EAAe,CAAC,QAAS,QAAS,UAAW,QAAS,UAY1D,SAASb,EAActzC,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQs0C,oBAI7DngE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAK9EjgE,KAAK/B,OAAS,IAAIwhE,EAClBz/D,KAAKtB,OAAS,EACdsB,KAAKogE,MAAQ,KACbpgE,KAAKqgE,WAAa,EAClBrgE,KAAKsgE,QAAU,KACftgE,KAAKosC,OAAQ,EACbpsC,KAAK+jD,YAAa,EAClB/jD,KAAKugE,SAAU,EAMfvgE,KAAKkgD,MAAO,EAIZlgD,KAAKwgE,cAAe,EACpBxgE,KAAKygE,iBAAkB,EACvBzgE,KAAK0gE,mBAAoB,EACzB1gE,KAAK2gE,iBAAkB,EACvB3gE,KAAK4gE,QAAS,EAGd5gE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAKysC,WAAY,EAKjBzsC,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAGlD/gE,KAAKghE,WAAa,EAGlBhhE,KAAKihE,aAAc,EACnBjhE,KAAK+8C,QAAU,KACf/8C,KAAKd,SAAW,KACZ2sB,EAAQ3sB,WACL09B,IAAeA,EAAgB,SACpC58B,KAAK+8C,QAAU,IAAIngB,EAAc/Q,EAAQ3sB,UACzCc,KAAKd,SAAW2sB,EAAQ3sB,SAE5B,CACA,SAAS0sC,EAAS/f,GAEhB,GADA8f,EAASA,GAAU,EAAQ,MACrB3rC,gBAAgB4rC,GAAW,OAAO,IAAIA,EAAS/f,GAIrD,IAAIo0C,EAAWjgE,gBAAgB2rC,EAC/B3rC,KAAKwsC,eAAiB,IAAI2yB,EAActzC,EAAS7rB,KAAMigE,GAGvDjgE,KAAKisC,UAAW,EACZpgB,IAC0B,mBAAjBA,EAAQ7O,OAAqBhd,KAAKkhE,MAAQr1C,EAAQ7O,MAC9B,mBAApB6O,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,UAErEpO,EAAOz7C,KAAKtX,KACd,CAwDA,SAASqhE,EAAiB9d,EAAQyb,EAAO9/D,EAAUoiE,EAAYC,GAC7DnC,EAAM,mBAAoBJ,GAC1B,IAKM7oC,EALFhB,EAAQouB,EAAO/W,eACnB,GAAc,OAAVwyB,EACF7pC,EAAMorC,SAAU,EAuNpB,SAAoBhd,EAAQpuB,GAE1B,GADAiqC,EAAM,eACFjqC,EAAMiX,MAAV,CACA,GAAIjX,EAAM4nB,QAAS,CACjB,IAAIiiB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,SACjBy2B,EAAMl3B,OAAO+f,KAAKghD,GAClB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OAEjD,CACAy2B,EAAMiX,OAAQ,EACVjX,EAAM+qB,KAIRshB,EAAaje,IAGbpuB,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTtrC,EAAMsrC,iBAAkB,EACxBgB,EAAcle,IAnBK,CAsBzB,CA9OIme,CAAWne,EAAQpuB,QAInB,GADKosC,IAAgBprC,EA6CzB,SAAsBhB,EAAO6pC,GAC3B,IAAI7oC,EAjPiBrb,EAqPrB,OArPqBA,EAkPFkkD,EAjPZ9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAiPA,iBAAVN,QAAgC5/D,IAAV4/D,GAAwB7pC,EAAM+qC,aACtF/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,SAAU,cAAek4C,IAEtE7oC,CACT,CAnD8BwrC,CAAaxsC,EAAO6pC,IAC1C7oC,EACF4pC,EAAexc,EAAQptB,QAClB,GAAIhB,EAAM+qC,YAAclB,GAASA,EAAMtgE,OAAS,EAIrD,GAHqB,iBAAVsgE,GAAuB7pC,EAAM+qC,YAAc7iE,OAAO04B,eAAeipC,KAAW9gE,EAAOR,YAC5FshE,EA3MR,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CAyMgB4C,CAAoB5C,IAE1BsC,EACEnsC,EAAM4uB,WAAYgc,EAAexc,EAAQ,IAAIuc,GAA2C+B,EAASte,EAAQpuB,EAAO6pC,GAAO,QACtH,GAAI7pC,EAAMiX,MACf2zB,EAAexc,EAAQ,IAAIqc,OACtB,IAAIzqC,EAAMsX,UACf,OAAO,EAEPtX,EAAMorC,SAAU,EACZprC,EAAM4nB,UAAY79C,GACpB8/D,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,GACxB7pC,EAAM+qC,YAA+B,IAAjBlB,EAAMtgE,OAAcmjE,EAASte,EAAQpuB,EAAO6pC,GAAO,GAAY8C,EAAcve,EAAQpuB,IAE7G0sC,EAASte,EAAQpuB,EAAO6pC,GAAO,EAEnC,MACUsC,IACVnsC,EAAMorC,SAAU,EAChBuB,EAAcve,EAAQpuB,IAO1B,OAAQA,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAkC,IAAjBnX,EAAMz2B,OACtE,CACA,SAASmjE,EAASte,EAAQpuB,EAAO6pC,EAAOsC,GAClCnsC,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAiBy2B,EAAM+qB,MAChD/qB,EAAM6rC,WAAa,EACnBzd,EAAO7uB,KAAK,OAAQsqC,KAGpB7pC,EAAMz2B,QAAUy2B,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACzC4iE,EAAYnsC,EAAMl3B,OAAO02B,QAAQqqC,GAAY7pC,EAAMl3B,OAAO+f,KAAKghD,GAC/D7pC,EAAMqrC,cAAcgB,EAAaje,IAEvCue,EAAcve,EAAQpuB,EACxB,CA3GA93B,OAAOqiB,eAAeksB,EAASluC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKwsC,gBAGFxsC,KAAKwsC,eAAeC,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKwsC,iBAMVxsC,KAAKwsC,eAAeC,UAAY7uC,EAClC,IAEFguC,EAASluC,UAAUyjE,QAAUzB,EAAYyB,QACzCv1B,EAASluC,UAAUqkE,WAAarC,EAAYsC,UAC5Cp2B,EAASluC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,EAMAwY,EAASluC,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GACzC,IACIqiE,EADApsC,EAAQn1B,KAAKwsC,eAcjB,OAZKrX,EAAM+qC,WAUTqB,GAAiB,EATI,iBAAVvC,KACT9/D,EAAWA,GAAYi2B,EAAM4rC,mBACZ5rC,EAAMj2B,WACrB8/D,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,GAC3BA,EAAW,IAEbqiE,GAAiB,GAKdF,EAAiBrhE,KAAMg/D,EAAO9/D,GAAU,EAAOqiE,EACxD,EAGA31B,EAASluC,UAAUi3B,QAAU,SAAUqqC,GACrC,OAAOqC,EAAiBrhE,KAAMg/D,EAAO,MAAM,GAAM,EACnD,EA6DApzB,EAASluC,UAAUukE,SAAW,WAC5B,OAAuC,IAAhCjiE,KAAKwsC,eAAe8zB,OAC7B,EAGA10B,EAASluC,UAAUwkE,YAAc,SAAUjyC,GACpC2M,IAAeA,EAAgB,SACpC,IAAImgB,EAAU,IAAIngB,EAAc3M,GAChCjwB,KAAKwsC,eAAeuQ,QAAUA,EAE9B/8C,KAAKwsC,eAAettC,SAAWc,KAAKwsC,eAAeuQ,QAAQ79C,SAK3D,IAFA,IAAI6P,EAAI/O,KAAKwsC,eAAevuC,OAAOm8C,KAC/BqX,EAAU,GACD,OAAN1iD,GACL0iD,GAAW1U,EAAQ9iC,MAAMlL,EAAEoM,MAC3BpM,EAAIA,EAAE0J,KAKR,OAHAzY,KAAKwsC,eAAevuC,OAAOkkE,QACX,KAAZ1Q,GAAgBzxD,KAAKwsC,eAAevuC,OAAO+f,KAAKyzC,GACpDzxD,KAAKwsC,eAAe9tC,OAAS+yD,EAAQ/yD,OAC9BsB,IACT,EAGA,IAAIoiE,EAAU,WAqBd,SAASC,EAAc7yD,EAAG2lB,GACxB,OAAI3lB,GAAK,GAAsB,IAAjB2lB,EAAMz2B,QAAgBy2B,EAAMiX,MAAc,EACpDjX,EAAM+qC,WAAmB,EACzB1wD,GAAMA,EAEJ2lB,EAAMmrC,SAAWnrC,EAAMz2B,OAAey2B,EAAMl3B,OAAOm8C,KAAKj/B,KAAKzc,OAAmBy2B,EAAMz2B,QAGxF8Q,EAAI2lB,EAAMmX,gBAAenX,EAAMmX,cA5BrC,SAAiC98B,GAe/B,OAdIA,GAAK4yD,EAEP5yD,EAAI4yD,GAIJ5yD,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAEKA,CACT,CAYqD8yD,CAAwB9yD,IACvEA,GAAK2lB,EAAMz2B,OAAe8Q,EAEzB2lB,EAAMiX,MAIJjX,EAAMz2B,QAHXy2B,EAAMqrC,cAAe,EACd,GAGX,CA6HA,SAASgB,EAAaje,GACpB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,eAAgBjqC,EAAMqrC,aAAcrrC,EAAMsrC,iBAChDtrC,EAAMqrC,cAAe,EAChBrrC,EAAMsrC,kBACTrB,EAAM,eAAgBjqC,EAAMmrC,SAC5BnrC,EAAMsrC,iBAAkB,EACxB7yC,QAAQqO,SAASwlC,EAAele,GAEpC,CACA,SAASke,EAAcle,GACrB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,gBAAiBjqC,EAAMsX,UAAWtX,EAAMz2B,OAAQy2B,EAAMiX,OACvDjX,EAAMsX,YAActX,EAAMz2B,SAAUy2B,EAAMiX,QAC7CmX,EAAO7uB,KAAK,YACZS,EAAMsrC,iBAAkB,GAS1BtrC,EAAMqrC,cAAgBrrC,EAAMmrC,UAAYnrC,EAAMiX,OAASjX,EAAMz2B,QAAUy2B,EAAMmX,cAC7Ei2B,EAAKhf,EACP,CAQA,SAASue,EAAcve,EAAQpuB,GACxBA,EAAM8rC,cACT9rC,EAAM8rC,aAAc,EACpBrzC,QAAQqO,SAASumC,EAAgBjf,EAAQpuB,GAE7C,CACA,SAASqtC,EAAejf,EAAQpuB,GAwB9B,MAAQA,EAAMorC,UAAYprC,EAAMiX,QAAUjX,EAAMz2B,OAASy2B,EAAMmX,eAAiBnX,EAAMmrC,SAA4B,IAAjBnrC,EAAMz2B,SAAe,CACpH,IAAI2C,EAAM8zB,EAAMz2B,OAGhB,GAFA0gE,EAAM,wBACN7b,EAAOvmC,KAAK,GACR3b,IAAQ8zB,EAAMz2B,OAEhB,KACJ,CACAy2B,EAAM8rC,aAAc,CACtB,CAgPA,SAASwB,EAAwB3+D,GAC/B,IAAIqxB,EAAQrxB,EAAK0oC,eACjBrX,EAAMurC,kBAAoB58D,EAAK6xB,cAAc,YAAc,EACvDR,EAAMwrC,kBAAoBxrC,EAAMyrC,OAGlCzrC,EAAMmrC,SAAU,EAGPx8D,EAAK6xB,cAAc,QAAU,GACtC7xB,EAAK4+D,QAET,CACA,SAASC,EAAiB7+D,GACxBs7D,EAAM,4BACNt7D,EAAKkZ,KAAK,EACZ,CAuBA,SAAS4lD,EAAQrf,EAAQpuB,GACvBiqC,EAAM,SAAUjqC,EAAMorC,SACjBprC,EAAMorC,SACThd,EAAOvmC,KAAK,GAEdmY,EAAMwrC,iBAAkB,EACxBpd,EAAO7uB,KAAK,UACZ6tC,EAAKhf,GACDpuB,EAAMmrC,UAAYnrC,EAAMorC,SAAShd,EAAOvmC,KAAK,EACnD,CAWA,SAASulD,EAAKhf,GACZ,IAAIpuB,EAAQouB,EAAO/W,eAEnB,IADA4yB,EAAM,OAAQjqC,EAAMmrC,SACbnrC,EAAMmrC,SAA6B,OAAlB/c,EAAOvmC,SACjC,CAmHA,SAAS6lD,EAASrzD,EAAG2lB,GAEnB,OAAqB,IAAjBA,EAAMz2B,OAAqB,MAE3By2B,EAAM+qC,WAAYn7D,EAAMowB,EAAMl3B,OAAOmU,SAAkB5C,GAAKA,GAAK2lB,EAAMz2B,QAEtDqG,EAAfowB,EAAM4nB,QAAe5nB,EAAMl3B,OAAOi7B,KAAK,IAAqC,IAAxB/D,EAAMl3B,OAAOS,OAAoBy2B,EAAMl3B,OAAO+kB,QAAmBmS,EAAMl3B,OAAO8hB,OAAOoV,EAAMz2B,QACnJy2B,EAAMl3B,OAAOkkE,SAGbp9D,EAAMowB,EAAMl3B,OAAO6kE,QAAQtzD,EAAG2lB,EAAM4nB,SAE/Bh4C,GATP,IAAIA,CAUN,CACA,SAASg+D,EAAYxf,GACnB,IAAIpuB,EAAQouB,EAAO/W,eACnB4yB,EAAM,cAAejqC,EAAM4uB,YACtB5uB,EAAM4uB,aACT5uB,EAAMiX,OAAQ,EACdxe,QAAQqO,SAAS+mC,EAAe7tC,EAAOouB,GAE3C,CACA,SAASyf,EAAc7tC,EAAOouB,GAI5B,GAHA6b,EAAM,gBAAiBjqC,EAAM4uB,WAAY5uB,EAAMz2B,SAG1Cy2B,EAAM4uB,YAA+B,IAAjB5uB,EAAMz2B,SAC7By2B,EAAM4uB,YAAa,EACnBR,EAAOtX,UAAW,EAClBsX,EAAO7uB,KAAK,OACRS,EAAM2rC,aAAa,CAGrB,IAAImC,EAAS1f,EAAOpX,iBACf82B,GAAUA,EAAOnC,aAAemC,EAAOpf,WAC1CN,EAAO4d,SAEX,CAEJ,CASA,SAAS1kD,EAAQymD,EAAI11D,GACnB,IAAK,IAAIhM,EAAI,EAAGuM,EAAIm1D,EAAGxkE,OAAQ8C,EAAIuM,EAAGvM,IACpC,GAAI0hE,EAAG1hE,KAAOgM,EAAG,OAAOhM,EAE1B,OAAQ,CACV,CA1pBAoqC,EAASluC,UAAUsf,KAAO,SAAUxN,GAClC4vD,EAAM,OAAQ5vD,GACdA,EAAIkO,SAASlO,EAAG,IAChB,IAAI2lB,EAAQn1B,KAAKwsC,eACb22B,EAAQ3zD,EAMZ,GALU,IAANA,IAAS2lB,EAAMsrC,iBAAkB,GAK3B,IAANjxD,GAAW2lB,EAAMqrC,gBAA0C,IAAxBrrC,EAAMmX,cAAsBnX,EAAMz2B,QAAUy2B,EAAMmX,cAAgBnX,EAAMz2B,OAAS,IAAMy2B,EAAMiX,OAGlI,OAFAgzB,EAAM,qBAAsBjqC,EAAMz2B,OAAQy2B,EAAMiX,OAC3B,IAAjBjX,EAAMz2B,QAAgBy2B,EAAMiX,MAAO22B,EAAY/iE,MAAWwhE,EAAaxhE,MACpE,KAKT,GAAU,KAHVwP,EAAI6yD,EAAc7yD,EAAG2lB,KAGNA,EAAMiX,MAEnB,OADqB,IAAjBjX,EAAMz2B,QAAcqkE,EAAY/iE,MAC7B,KA0BT,IA2BI+E,EA3BAq+D,EAASjuC,EAAMqrC,aA6CnB,OA5CApB,EAAM,gBAAiBgE,IAGF,IAAjBjuC,EAAMz2B,QAAgBy2B,EAAMz2B,OAAS8Q,EAAI2lB,EAAMmX,gBAEjD8yB,EAAM,6BADNgE,GAAS,GAMPjuC,EAAMiX,OAASjX,EAAMorC,QAEvBnB,EAAM,mBADNgE,GAAS,GAEAA,IACThE,EAAM,WACNjqC,EAAMorC,SAAU,EAChBprC,EAAM+qB,MAAO,EAEQ,IAAjB/qB,EAAMz2B,SAAcy2B,EAAMqrC,cAAe,GAE7CxgE,KAAKkhE,MAAM/rC,EAAMmX,eACjBnX,EAAM+qB,MAAO,EAGR/qB,EAAMorC,UAAS/wD,EAAI6yD,EAAcc,EAAOhuC,KAInC,QADDpwB,EAAPyK,EAAI,EAASqzD,EAASrzD,EAAG2lB,GAAkB,OAE7CA,EAAMqrC,aAAerrC,EAAMz2B,QAAUy2B,EAAMmX,cAC3C98B,EAAI,IAEJ2lB,EAAMz2B,QAAU8Q,EAChB2lB,EAAM6rC,WAAa,GAEA,IAAjB7rC,EAAMz2B,SAGHy2B,EAAMiX,QAAOjX,EAAMqrC,cAAe,GAGnC2C,IAAU3zD,GAAK2lB,EAAMiX,OAAO22B,EAAY/iE,OAElC,OAAR+E,GAAc/E,KAAK00B,KAAK,OAAQ3vB,GAC7BA,CACT,EA6GA6mC,EAASluC,UAAUwjE,MAAQ,SAAU1xD,GACnCuwD,EAAe//D,KAAM,IAAI6/D,EAA2B,WACtD,EACAj0B,EAASluC,UAAU2lE,KAAO,SAAUhgE,EAAMigE,GACxC,IAAIllE,EAAM4B,KACNm1B,EAAQn1B,KAAKwsC,eACjB,OAAQrX,EAAMkrC,YACZ,KAAK,EACHlrC,EAAMirC,MAAQ/8D,EACd,MACF,KAAK,EACH8xB,EAAMirC,MAAQ,CAACjrC,EAAMirC,MAAO/8D,GAC5B,MACF,QACE8xB,EAAMirC,MAAMpiD,KAAK3a,GAGrB8xB,EAAMkrC,YAAc,EACpBjB,EAAM,wBAAyBjqC,EAAMkrC,WAAYiD,GACjD,IACIC,EADUD,IAA6B,IAAjBA,EAASniE,KAAkBkC,IAASuqB,QAAQ41C,QAAUngE,IAASuqB,QAAQ61C,OACrEC,EAARx3B,EAYpB,SAASA,IACPkzB,EAAM,SACN/7D,EAAKlC,KACP,CAdIg0B,EAAM4uB,WAAYn2B,QAAQqO,SAASsnC,GAAYnlE,EAAI00B,KAAK,MAAOywC,GACnElgE,EAAKqwB,GAAG,UACR,SAASiwC,EAAS13B,EAAU23B,GAC1BxE,EAAM,YACFnzB,IAAa7tC,GACXwlE,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EAkB5BzE,EAAM,WAEN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7B5gD,EAAKgwB,eAAe,SAAUswB,GAC9BtgD,EAAKgwB,eAAe,QAASywC,GAC7BzgE,EAAKgwB,eAAe,QAAS2wB,GAC7B3gD,EAAKgwB,eAAe,SAAUswC,GAC9BvlE,EAAIi1B,eAAe,MAAO6Y,GAC1B9tC,EAAIi1B,eAAe,MAAOqwC,GAC1BtlE,EAAIi1B,eAAe,OAAQ0wC,GAC3BC,GAAY,GAOR7uC,EAAM6rC,YAAgB39D,EAAK8oC,iBAAkB9oC,EAAK8oC,eAAe83B,WAAYH,IA/BnF,IAUA,IAAIA,EAgFN,SAAqB1lE,GACnB,OAAO,WACL,IAAI+2B,EAAQ/2B,EAAIouC,eAChB4yB,EAAM,cAAejqC,EAAM6rC,YACvB7rC,EAAM6rC,YAAY7rC,EAAM6rC,aACH,IAArB7rC,EAAM6rC,YAAoB3B,EAAgBjhE,EAAK,UACjD+2B,EAAMmrC,SAAU,EAChBiC,EAAKnkE,GAET,CACF,CA1FgB8lE,CAAY9lE,GAC1BiF,EAAKqwB,GAAG,QAASowC,GACjB,IAAIE,GAAY,EAsBhB,SAASD,EAAO/E,GACdI,EAAM,UACN,IAAIr6D,EAAM1B,EAAK4W,MAAM+kD,GACrBI,EAAM,aAAcr6D,IACR,IAARA,KAKwB,IAArBowB,EAAMkrC,YAAoBlrC,EAAMirC,QAAU/8D,GAAQ8xB,EAAMkrC,WAAa,IAAqC,IAAhC5jD,EAAQ0Y,EAAMirC,MAAO/8D,MAAkB2gE,IACpH5E,EAAM,8BAA+BjqC,EAAM6rC,YAC3C7rC,EAAM6rC,cAER5iE,EAAI+lE,QAER,CAIA,SAASngB,EAAQ7tB,GACfipC,EAAM,UAAWjpC,GACjButC,IACArgE,EAAKgwB,eAAe,QAAS2wB,GACU,IAAnCqb,EAAgBh8D,EAAM,UAAgB08D,EAAe18D,EAAM8yB,EACjE,CAMA,SAAS8tB,IACP5gD,EAAKgwB,eAAe,SAAUswB,GAC9B+f,GACF,CAEA,SAAS/f,IACPyb,EAAM,YACN/7D,EAAKgwB,eAAe,QAAS4wB,GAC7Byf,GACF,CAEA,SAASA,IACPtE,EAAM,UACNhhE,EAAIslE,OAAOrgE,EACb,CAUA,OAvDAjF,EAAIs1B,GAAG,OAAQqwC,GAniBjB,SAAyBhxC,EAASqxC,EAAOz8C,GAGvC,GAAuC,mBAA5BoL,EAAQwD,gBAAgC,OAAOxD,EAAQwD,gBAAgB6tC,EAAOz8C,GAMpFoL,EAAQa,SAAYb,EAAQa,QAAQwwC,GAAuC1iE,MAAMC,QAAQoxB,EAAQa,QAAQwwC,IAASrxC,EAAQa,QAAQwwC,GAAOzvC,QAAQhN,GAASoL,EAAQa,QAAQwwC,GAAS,CAACz8C,EAAIoL,EAAQa,QAAQwwC,IAA5JrxC,EAAQW,GAAG0wC,EAAOz8C,EACrE,CAqjBE4O,CAAgBlzB,EAAM,QAAS2gD,GAO/B3gD,EAAKyvB,KAAK,QAASmxB,GAMnB5gD,EAAKyvB,KAAK,SAAU6wB,GAOpBtgD,EAAKqxB,KAAK,OAAQt2B,GAGb+2B,EAAMmrC,UACTlB,EAAM,eACNhhE,EAAIskE,UAECr/D,CACT,EAYAuoC,EAASluC,UAAUgmE,OAAS,SAAUrgE,GACpC,IAAI8xB,EAAQn1B,KAAKwsC,eACbo3B,EAAa,CACfC,YAAY,GAId,GAAyB,IAArB1uC,EAAMkrC,WAAkB,OAAOrgE,KAGnC,GAAyB,IAArBm1B,EAAMkrC,WAER,OAAIh9D,GAAQA,IAAS8xB,EAAMirC,QACtB/8D,IAAMA,EAAO8xB,EAAMirC,OAGxBjrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EACZj9D,GAAMA,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAPK5jE,KAa3C,IAAKqD,EAAM,CAET,IAAIghE,EAAQlvC,EAAMirC,MACd/+D,EAAM8zB,EAAMkrC,WAChBlrC,EAAMirC,MAAQ,KACdjrC,EAAMkrC,WAAa,EACnBlrC,EAAMmrC,SAAU,EAChB,IAAK,IAAI9+D,EAAI,EAAGA,EAAIH,EAAKG,IAAK6iE,EAAM7iE,GAAGkzB,KAAK,SAAU10B,KAAM,CAC1D6jE,YAAY,IAEd,OAAO7jE,IACT,CAGA,IAAIU,EAAQ+b,EAAQ0Y,EAAMirC,MAAO/8D,GACjC,OAAe,IAAX3C,IACJy0B,EAAMirC,MAAMplC,OAAOt6B,EAAO,GAC1By0B,EAAMkrC,YAAc,EACK,IAArBlrC,EAAMkrC,aAAkBlrC,EAAMirC,MAAQjrC,EAAMirC,MAAM,IACtD/8D,EAAKqxB,KAAK,SAAU10B,KAAM4jE,IAJD5jE,IAM3B,EAIA4rC,EAASluC,UAAUg2B,GAAK,SAAU4wC,EAAI38C,GACpC,IAAIpiB,EAAMwtD,EAAOr1D,UAAUg2B,GAAGpc,KAAKtX,KAAMskE,EAAI38C,GACzCwN,EAAQn1B,KAAKwsC,eAqBjB,MApBW,SAAP83B,GAGFnvC,EAAMurC,kBAAoB1gE,KAAK21B,cAAc,YAAc,GAGrC,IAAlBR,EAAMmrC,SAAmBtgE,KAAK0iE,UAClB,aAAP4B,IACJnvC,EAAM4uB,YAAe5uB,EAAMurC,oBAC9BvrC,EAAMurC,kBAAoBvrC,EAAMqrC,cAAe,EAC/CrrC,EAAMmrC,SAAU,EAChBnrC,EAAMsrC,iBAAkB,EACxBrB,EAAM,cAAejqC,EAAMz2B,OAAQy2B,EAAMorC,SACrCprC,EAAMz2B,OACR8iE,EAAaxhE,MACHm1B,EAAMorC,SAChB3yC,QAAQqO,SAAS0mC,EAAkB3iE,QAIlCuF,CACT,EACAqmC,EAASluC,UAAU44B,YAAcsV,EAASluC,UAAUg2B,GACpDkY,EAASluC,UAAU21B,eAAiB,SAAUixC,EAAI38C,GAChD,IAAIpiB,EAAMwtD,EAAOr1D,UAAU21B,eAAe/b,KAAKtX,KAAMskE,EAAI38C,GAUzD,MATW,aAAP28C,GAOF12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EACAqmC,EAASluC,UAAUm5B,mBAAqB,SAAUytC,GAChD,IAAI/+D,EAAMwtD,EAAOr1D,UAAUm5B,mBAAmB5X,MAAMjf,KAAMyb,WAU1D,MATW,aAAP6oD,QAA4BllE,IAAPklE,GAOvB12C,QAAQqO,SAASwmC,EAAyBziE,MAErCuF,CACT,EAqBAqmC,EAASluC,UAAUglE,OAAS,WAC1B,IAAIvtC,EAAQn1B,KAAKwsC,eAUjB,OATKrX,EAAMmrC,UACTlB,EAAM,UAINjqC,EAAMmrC,SAAWnrC,EAAMurC,kBAM3B,SAAgBnd,EAAQpuB,GACjBA,EAAMwrC,kBACTxrC,EAAMwrC,iBAAkB,EACxB/yC,QAAQqO,SAAS2mC,EAASrf,EAAQpuB,GAEtC,CAVIutC,CAAO1iE,KAAMm1B,IAEfA,EAAMyrC,QAAS,EACR5gE,IACT,EAiBA4rC,EAASluC,UAAUymE,MAAQ,WAQzB,OAPA/E,EAAM,wBAAyBp/D,KAAKwsC,eAAe8zB,UACf,IAAhCtgE,KAAKwsC,eAAe8zB,UACtBlB,EAAM,SACNp/D,KAAKwsC,eAAe8zB,SAAU,EAC9BtgE,KAAK00B,KAAK,UAEZ10B,KAAKwsC,eAAeo0B,QAAS,EACtB5gE,IACT,EAUA4rC,EAASluC,UAAU6mE,KAAO,SAAUhhB,GAClC,IAAIgS,EAAQv1D,KACRm1B,EAAQn1B,KAAKwsC,eACbo0B,GAAS,EAwBb,IAAK,IAAIp/D,KAvBT+hD,EAAO7vB,GAAG,OAAO,WAEf,GADA0rC,EAAM,eACFjqC,EAAM4nB,UAAY5nB,EAAMiX,MAAO,CACjC,IAAI4yB,EAAQ7pC,EAAM4nB,QAAQ57C,MACtB69D,GAASA,EAAMtgE,QAAQ62D,EAAMv3C,KAAKghD,EACxC,CACAzJ,EAAMv3C,KAAK,KACb,IACAulC,EAAO7vB,GAAG,QAAQ,SAAUsrC,GAC1BI,EAAM,gBACFjqC,EAAM4nB,UAASiiB,EAAQ7pC,EAAM4nB,QAAQ9iC,MAAM+kD,IAG3C7pC,EAAM+qC,YAAc,MAAClB,IAAyD7pC,EAAM+qC,YAAgBlB,GAAUA,EAAMtgE,UAC9G62D,EAAMv3C,KAAKghD,KAEnB4B,GAAS,EACTrd,EAAO4gB,SAEX,IAIc5gB,OACInkD,IAAZY,KAAKwB,IAAyC,mBAAd+hD,EAAO/hD,KACzCxB,KAAKwB,GAAK,SAAoBuqC,GAC5B,OAAO,WACL,OAAOwX,EAAOxX,GAAQ9sB,MAAMskC,EAAQ9nC,UACtC,CACF,CAJU,CAIRja,IAKN,IAAK,IAAIgO,EAAI,EAAGA,EAAIwwD,EAAathE,OAAQ8Q,IACvC+zC,EAAO7vB,GAAGssC,EAAaxwD,GAAIxP,KAAK00B,KAAKW,KAAKr1B,KAAMggE,EAAaxwD,KAY/D,OAPAxP,KAAKkhE,MAAQ,SAAU1xD,GACrB4vD,EAAM,gBAAiB5vD,GACnBoxD,IACFA,GAAS,EACTrd,EAAOmf,SAEX,EACO1iE,IACT,EACsB,mBAAXwZ,SACToyB,EAASluC,UAAU8b,OAAOgrD,eAAiB,WAIzC,YAH0CplE,IAAtCogE,IACFA,EAAoC,EAAQ,MAEvCA,EAAkCx/D,KAC3C,GAEF3C,OAAOqiB,eAAeksB,EAASluC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAeF,aAC7B,IAEFjvC,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAevuC,MACpD,IAEFZ,OAAOqiB,eAAeksB,EAASluC,UAAW,kBAAmB,CAI3DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe8zB,OAC7B,EACApgD,IAAK,SAAaiV,GACZn1B,KAAKwsC,iBACPxsC,KAAKwsC,eAAe8zB,QAAUnrC,EAElC,IAIFyW,EAAS64B,UAAY5B,EACrBxlE,OAAOqiB,eAAeksB,EAASluC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKwsC,eAAe9tC,MAC7B,IA+CoB,mBAAX8a,SACToyB,EAASjtC,KAAO,SAAU+lE,EAAU/+B,GAIlC,YAHavmC,IAATT,IACFA,EAAO,EAAQ,MAEVA,EAAKitC,EAAU84B,EAAU/+B,EAClC,qBCx8BF,SAASg/B,EAAoB7gE,EAAMsvB,GACjCwxC,EAAY9gE,EAAMsvB,GAClByxC,EAAY/gE,EACd,CACA,SAAS+gE,EAAY/gE,GACfA,EAAKqoC,iBAAmBroC,EAAKqoC,eAAe00B,WAC5C/8D,EAAK0oC,iBAAmB1oC,EAAK0oC,eAAeq0B,WAChD/8D,EAAK4wB,KAAK,QACZ,CAkBA,SAASkwC,EAAY9gE,EAAMsvB,GACzBtvB,EAAK4wB,KAAK,QAAStB,EACrB,CAYAn2B,EAAOD,QAAU,CACfmkE,QAzFF,SAAiB/tC,EAAK2I,GACpB,IAAIw5B,EAAQv1D,KACR8kE,EAAoB9kE,KAAKwsC,gBAAkBxsC,KAAKwsC,eAAeC,UAC/Ds4B,EAAoB/kE,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeM,UACnE,OAAIq4B,GAAqBC,GACnBhpC,EACFA,EAAG3I,GACMA,IACJpzB,KAAKmsC,eAEEnsC,KAAKmsC,eAAe64B,eAC9BhlE,KAAKmsC,eAAe64B,cAAe,EACnCp3C,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAHpCxF,QAAQqO,SAAS2oC,EAAa5kE,KAAMozB,IAMjCpzB,OAMLA,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,GAI9BzsC,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,GAElCzsC,KAAKohE,SAAShuC,GAAO,MAAM,SAAUA,IAC9B2I,GAAM3I,EACJmiC,EAAMppB,eAECopB,EAAMppB,eAAe64B,aAI/Bp3C,QAAQqO,SAAS4oC,EAAatP,IAH9BA,EAAMppB,eAAe64B,cAAe,EACpCp3C,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,IAH7CxF,QAAQqO,SAAS0oC,EAAqBpP,EAAOniC,GAOtC2I,GACTnO,QAAQqO,SAAS4oC,EAAatP,GAC9Bx5B,EAAG3I,IAEHxF,QAAQqO,SAAS4oC,EAAatP,EAElC,IACOv1D,KACT,EA2CEgiE,UAjCF,WACMhiE,KAAKwsC,iBACPxsC,KAAKwsC,eAAeC,WAAY,EAChCzsC,KAAKwsC,eAAe+zB,SAAU,EAC9BvgE,KAAKwsC,eAAeJ,OAAQ,EAC5BpsC,KAAKwsC,eAAeuX,YAAa,GAE/B/jD,KAAKmsC,iBACPnsC,KAAKmsC,eAAeM,WAAY,EAChCzsC,KAAKmsC,eAAeC,OAAQ,EAC5BpsC,KAAKmsC,eAAe84B,QAAS,EAC7BjlE,KAAKmsC,eAAe+4B,aAAc,EAClCllE,KAAKmsC,eAAeg5B,aAAc,EAClCnlE,KAAKmsC,eAAe0X,UAAW,EAC/B7jD,KAAKmsC,eAAe64B,cAAe,EAEvC,EAkBEjF,eAdF,SAAwBxc,EAAQnwB,GAO9B,IAAIgyC,EAAS7hB,EAAO/W,eAChBy2B,EAAS1f,EAAOpX,eAChBi5B,GAAUA,EAAOtE,aAAemC,GAAUA,EAAOnC,YAAavd,EAAO4d,QAAQ/tC,GAAUmwB,EAAO7uB,KAAK,QAAStB,EAClH,2BCxFA,IAAIiyC,EAAwB,8BAiB5BpoE,EAAOD,QAAU,CACf2iE,iBAdF,SAA0BxqC,EAAOtJ,EAASy5C,EAAWrF,GACnD,IAAIsF,EAJN,SAA2B15C,EAASo0C,EAAUqF,GAC5C,OAAgC,MAAzBz5C,EAAQygB,cAAwBzgB,EAAQygB,cAAgB2zB,EAAWp0C,EAAQy5C,GAAa,IACjG,CAEYE,CAAkB35C,EAASo0C,EAAUqF,GAC/C,GAAW,MAAPC,EAAa,CACf,IAAMxkD,SAASwkD,IAAQjkE,KAAKylB,MAAMw+C,KAASA,GAAQA,EAAM,EAEvD,MAAM,IAAIF,EADCpF,EAAWqF,EAAY,gBACIC,GAExC,OAAOjkE,KAAKylB,MAAMw+C,EACpB,CAGA,OAAOpwC,EAAM+qC,WAAa,GAAK,KACjC,2BCqBA,SAASuF,EAActwC,GACrB,IAAIogC,EAAQv1D,KACZA,KAAKyY,KAAO,KACZzY,KAAK0lE,MAAQ,KACb1lE,KAAK47C,OAAS,YA6iBhB,SAAwB+pB,EAASxwC,EAAO/B,GACtC,IAAIsyC,EAAQC,EAAQD,MAEpB,IADAC,EAAQD,MAAQ,KACTA,GAAO,CACZ,IAAI3pC,EAAK2pC,EAAMzlB,SACf9qB,EAAMywC,YACN7pC,EAljBA8pC,WAmjBAH,EAAQA,EAAMjtD,IAChB,CAGA0c,EAAM2wC,mBAAmBrtD,KAAOktD,CAClC,CAxjBIE,CAAetQ,EAAOpgC,EACxB,CACF,CAIA,IAAIwW,EAvBJ1uC,EAAOD,QAAU6uC,EA0BjBA,EAASk6B,cAAgBA,EAGzB,IA+JIC,EA/JAC,EAAe,CACjBjhC,UAAW,EAAQ,KAKjB+tB,EAAS,EAAQ,KAGjB70D,EAAS,YACTohE,QAAmC,IAAX,EAAA7rD,EAAyB,EAAAA,EAA2B,oBAAXnT,OAAyBA,OAAyB,oBAATwD,KAAuBA,KAAO,CAAC,GAAG+V,YAAc,WAAa,EAOvK6lD,EAAc,EAAQ,KAExBC,EADa,EAAQ,KACOA,iBAC1BtM,EAAiB,QACnBvsC,EAAuBusC,EAAevsC,qBACtC+4C,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvCC,EAAyB9S,EAAe8S,uBACxCC,EAAuB/S,EAAe+S,qBACtCC,EAAyBhT,EAAegT,uBACxCC,EAA6BjT,EAAeiT,2BAC5CC,EAAuBlT,EAAekT,qBACpCxG,EAAiBL,EAAYK,eAEjC,SAASyG,IAAO,CAChB,SAAST,EAAcl6C,EAAS03B,EAAQ0c,GACtCt0B,EAASA,GAAU,EAAQ,IAC3B9f,EAAUA,GAAW,CAAC,EAOE,kBAAbo0C,IAAwBA,EAAW1c,aAAkB5X,GAIhE3rC,KAAKkgE,aAAer0C,EAAQq0C,WACxBD,IAAUjgE,KAAKkgE,WAAalgE,KAAKkgE,cAAgBr0C,EAAQ46C,oBAK7DzmE,KAAKssC,cAAgBqzB,EAAiB3/D,KAAM6rB,EAAS,wBAAyBo0C,GAG9EjgE,KAAKklE,aAAc,EAGnBllE,KAAKikE,WAAY,EAEjBjkE,KAAKilE,QAAS,EAEdjlE,KAAKosC,OAAQ,EAEbpsC,KAAK6jD,UAAW,EAGhB7jD,KAAKysC,WAAY,EAKjB,IAAIi6B,GAAqC,IAA1B76C,EAAQ86C,cACvB3mE,KAAK2mE,eAAiBD,EAKtB1mE,KAAK+gE,gBAAkBl1C,EAAQk1C,iBAAmB,OAKlD/gE,KAAKtB,OAAS,EAGdsB,KAAK4mE,SAAU,EAGf5mE,KAAK6mE,OAAS,EAMd7mE,KAAKkgD,MAAO,EAKZlgD,KAAK8mE,kBAAmB,EAGxB9mE,KAAK+mE,QAAU,SAAU5wC,IAsQ3B,SAAiBotB,EAAQptB,GACvB,IAAIhB,EAAQouB,EAAOpX,eACf+T,EAAO/qB,EAAM+qB,KACbnkB,EAAK5G,EAAM6xC,QACf,GAAkB,mBAAPjrC,EAAmB,MAAM,IAAImqC,EAExC,GAZF,SAA4B/wC,GAC1BA,EAAMyxC,SAAU,EAChBzxC,EAAM6xC,QAAU,KAChB7xC,EAAMz2B,QAAUy2B,EAAM8xC,SACtB9xC,EAAM8xC,SAAW,CACnB,CAMEC,CAAmB/xC,GACfgB,GAlCN,SAAsBotB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,KAC3C5G,EAAMywC,UACJ1lB,GAGFtyB,QAAQqO,SAASF,EAAI5F,GAGrBvI,QAAQqO,SAASkrC,EAAa5jB,EAAQpuB,GACtCouB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,KAIvB4F,EAAG5F,GACHotB,EAAOpX,eAAe64B,cAAe,EACrCjF,EAAexc,EAAQptB,GAGvBgxC,EAAY5jB,EAAQpuB,GAExB,CAaUiyC,CAAa7jB,EAAQpuB,EAAO+qB,EAAM/pB,EAAI4F,OAAS,CAErD,IAAI8nB,EAAWwjB,EAAWlyC,IAAUouB,EAAO9W,UACtCoX,GAAa1uB,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBACjEC,EAAYhkB,EAAQpuB,GAElB+qB,EACFtyB,QAAQqO,SAASurC,EAAYjkB,EAAQpuB,EAAO0uB,EAAU9nB,GAEtDyrC,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,EAExC,CACF,CAvRIgrC,CAAQxjB,EAAQptB,EAClB,EAGAn2B,KAAKgnE,QAAU,KAGfhnE,KAAKinE,SAAW,EAChBjnE,KAAKsnE,gBAAkB,KACvBtnE,KAAKynE,oBAAsB,KAI3BznE,KAAK4lE,UAAY,EAIjB5lE,KAAKmlE,aAAc,EAGnBnlE,KAAKglE,cAAe,EAGpBhlE,KAAK6gE,WAAkC,IAAtBh1C,EAAQg1C,UAGzB7gE,KAAK8gE,cAAgBj1C,EAAQi1C,YAG7B9gE,KAAK0nE,qBAAuB,EAI5B1nE,KAAK8lE,mBAAqB,IAAIL,EAAczlE,KAC9C,CAqCA,SAAS6rC,EAAShgB,GAahB,IAAIo0C,EAAWjgE,gBAZf2rC,EAASA,GAAU,EAAQ,KAa3B,IAAKs0B,IAAa+F,EAAgB1uD,KAAKu0B,EAAU7rC,MAAO,OAAO,IAAI6rC,EAAShgB,GAC5E7rB,KAAKmsC,eAAiB,IAAI45B,EAAcl6C,EAAS7rB,KAAMigE,GAGvDjgE,KAAKlC,UAAW,EACZ+tB,IAC2B,mBAAlBA,EAAQ5R,QAAsBja,KAAK2nE,OAAS97C,EAAQ5R,OACjC,mBAAnB4R,EAAQ+7C,SAAuB5nE,KAAK6nE,QAAUh8C,EAAQ+7C,QAClC,mBAApB/7C,EAAQs1C,UAAwBnhE,KAAKohE,SAAWv1C,EAAQs1C,SACtC,mBAAlBt1C,EAAQmR,QAAsBh9B,KAAKw8B,OAAS3Q,EAAQmR,QAEjE+1B,EAAOz7C,KAAKtX,KACd,CAgIA,SAAS8nE,EAAQvkB,EAAQpuB,EAAOyyC,EAAQvmE,EAAK29D,EAAO9/D,EAAU68B,GAC5D5G,EAAM8xC,SAAW5lE,EACjB8zB,EAAM6xC,QAAUjrC,EAChB5G,EAAMyxC,SAAU,EAChBzxC,EAAM+qB,MAAO,EACT/qB,EAAMsX,UAAWtX,EAAM4xC,QAAQ,IAAIX,EAAqB,UAAmBwB,EAAQrkB,EAAOskB,QAAQ7I,EAAO7pC,EAAM4xC,SAAcxjB,EAAOokB,OAAO3I,EAAO9/D,EAAUi2B,EAAM4xC,SACtK5xC,EAAM+qB,MAAO,CACf,CAgDA,SAASsnB,EAAWjkB,EAAQpuB,EAAO0uB,EAAU9nB,GACtC8nB,GASP,SAAsBN,EAAQpuB,GACP,IAAjBA,EAAMz2B,QAAgBy2B,EAAM8uC,YAC9B9uC,EAAM8uC,WAAY,EAClB1gB,EAAO7uB,KAAK,SAEhB,CAdiBqzC,CAAaxkB,EAAQpuB,GACpCA,EAAMywC,YACN7pC,IACAorC,EAAY5jB,EAAQpuB,EACtB,CAaA,SAASoyC,EAAYhkB,EAAQpuB,GAC3BA,EAAM2xC,kBAAmB,EACzB,IAAIpB,EAAQvwC,EAAMmyC,gBAClB,GAAI/jB,EAAOskB,SAAWnC,GAASA,EAAMjtD,KAAM,CAEzC,IAAI1K,EAAIonB,EAAMuyC,qBACVzpE,EAAS,IAAIyD,MAAMqM,GACnBi6D,EAAS7yC,EAAM2wC,mBACnBkC,EAAOtC,MAAQA,EAGf,IAFA,IAAI7wC,EAAQ,EACRozC,GAAa,EACVvC,GACLznE,EAAO42B,GAAS6wC,EACXA,EAAMwC,QAAOD,GAAa,GAC/BvC,EAAQA,EAAMjtD,KACdoc,GAAS,EAEX52B,EAAOgqE,WAAaA,EACpBH,EAAQvkB,EAAQpuB,GAAO,EAAMA,EAAMz2B,OAAQT,EAAQ,GAAI+pE,EAAOpsB,QAI9DzmB,EAAMywC,YACNzwC,EAAMsyC,oBAAsB,KACxBO,EAAOvvD,MACT0c,EAAM2wC,mBAAqBkC,EAAOvvD,KAClCuvD,EAAOvvD,KAAO,MAEd0c,EAAM2wC,mBAAqB,IAAIL,EAActwC,GAE/CA,EAAMuyC,qBAAuB,CAC/B,KAAO,CAEL,KAAOhC,GAAO,CACZ,IAAI1G,EAAQ0G,EAAM1G,MACd9/D,EAAWwmE,EAAMxmE,SACjB68B,EAAK2pC,EAAMzlB,SASf,GAPA6nB,EAAQvkB,EAAQpuB,GAAO,EADbA,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACJsgE,EAAO9/D,EAAU68B,GACpD2pC,EAAQA,EAAMjtD,KACd0c,EAAMuyC,uBAKFvyC,EAAMyxC,QACR,KAEJ,CACc,OAAVlB,IAAgBvwC,EAAMsyC,oBAAsB,KAClD,CACAtyC,EAAMmyC,gBAAkB5B,EACxBvwC,EAAM2xC,kBAAmB,CAC3B,CAoCA,SAASO,EAAWlyC,GAClB,OAAOA,EAAM8vC,QAA2B,IAAjB9vC,EAAMz2B,QAA0C,OAA1By2B,EAAMmyC,kBAA6BnyC,EAAM0uB,WAAa1uB,EAAMyxC,OAC3G,CACA,SAASuB,EAAU5kB,EAAQpuB,GACzBouB,EAAO/mB,QAAO,SAAUpJ,GACtB+B,EAAMywC,YACFxyC,GACF2sC,EAAexc,EAAQnwB,GAEzB+B,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,aACZyyC,EAAY5jB,EAAQpuB,EACtB,GACF,CAaA,SAASgyC,EAAY5jB,EAAQpuB,GAC3B,IAAIizC,EAAOf,EAAWlyC,GACtB,GAAIizC,IAdN,SAAmB7kB,EAAQpuB,GACpBA,EAAMgwC,aAAgBhwC,EAAM+vC,cACF,mBAAlB3hB,EAAO/mB,QAA0BrH,EAAMsX,WAKhDtX,EAAMgwC,aAAc,EACpB5hB,EAAO7uB,KAAK,eALZS,EAAMywC,YACNzwC,EAAM+vC,aAAc,EACpBt3C,QAAQqO,SAASksC,EAAW5kB,EAAQpuB,IAM1C,CAIIkzC,CAAU9kB,EAAQpuB,GACM,IAApBA,EAAMywC,YACRzwC,EAAM0uB,UAAW,EACjBN,EAAO7uB,KAAK,UACRS,EAAM2rC,cAAa,CAGrB,IAAIsE,EAAS7hB,EAAO/W,iBACf44B,GAAUA,EAAOtE,aAAesE,EAAOrhB,aAC1CR,EAAO4d,SAEX,CAGJ,OAAOiH,CACT,CAxfA,EAAQ,EAAR,CAAoBv8B,EAAUknB,GA4G9BgT,EAAcroE,UAAU6uC,UAAY,WAGlC,IAFA,IAAItzB,EAAUjZ,KAAKsnE,gBACfvjE,EAAM,GACHkV,GACLlV,EAAIia,KAAK/E,GACTA,EAAUA,EAAQR,KAEpB,OAAO1U,CACT,EACA,WACE,IACE1G,OAAOqiB,eAAeqmD,EAAcroE,UAAW,SAAU,CACvDiiB,IAAKsmD,EAAajhC,WAAU,WAC1B,OAAOhlC,KAAKusC,WACd,GAAG,6EAAmF,YAE1F,CAAE,MAAOr8B,GAAI,CACd,CARD,GAasB,mBAAXsJ,QAAyBA,OAAO8uD,aAAiE,mBAA3C/1C,SAAS70B,UAAU8b,OAAO8uD,cACzFtC,EAAkBzzC,SAAS70B,UAAU8b,OAAO8uD,aAC5CjrE,OAAOqiB,eAAemsB,EAAUryB,OAAO8uD,YAAa,CAClD1qE,MAAO,SAAe0qB,GACpB,QAAI09C,EAAgB1uD,KAAKtX,KAAMsoB,IAC3BtoB,OAAS6rC,GACNvjB,GAAUA,EAAO6jB,0BAA0B45B,CACpD,KAGFC,EAAkB,SAAyB19C,GACzC,OAAOA,aAAkBtoB,IAC3B,EA+BF6rC,EAASnuC,UAAU2lE,KAAO,WACxBtD,EAAe//D,KAAM,IAAImmE,EAC3B,EAyBAt6B,EAASnuC,UAAUuc,MAAQ,SAAU+kD,EAAO9/D,EAAU68B,GACpD,IAzNqBjhB,EAyNjBqa,EAAQn1B,KAAKmsC,eACbpnC,GAAM,EACNmjE,GAAS/yC,EAAM+qC,aA3NEplD,EA2N0BkkD,EA1NxC9gE,EAAO6c,SAASD,IAAQA,aAAewkD,GAwO9C,OAbI4I,IAAUhqE,EAAO6c,SAASikD,KAC5BA,EAhOJ,SAA6BA,GAC3B,OAAO9gE,EAAOS,KAAKqgE,EACrB,CA8NY4C,CAAoB5C,IAEN,mBAAb9/D,IACT68B,EAAK78B,EACLA,EAAW,MAETgpE,EAAOhpE,EAAW,SAAmBA,IAAUA,EAAWi2B,EAAM4rC,iBAClD,mBAAPhlC,IAAmBA,EAAKyqC,GAC/BrxC,EAAM8vC,OArCZ,SAAuB1hB,EAAQxnB,GAC7B,IAAI5F,EAAK,IAAImwC,EAEbvG,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,EACvB,CAgCoBoyC,CAAcvoE,KAAM+7B,IAAamsC,GA3BrD,SAAoB3kB,EAAQpuB,EAAO6pC,EAAOjjC,GACxC,IAAI5F,EAMJ,OALc,OAAV6oC,EACF7oC,EAAK,IAAIkwC,EACiB,iBAAVrH,GAAuB7pC,EAAM+qC,aAC7C/pC,EAAK,IAAIrP,EAAqB,QAAS,CAAC,SAAU,UAAWk4C,KAE3D7oC,IACF4pC,EAAexc,EAAQptB,GACvBvI,QAAQqO,SAASF,EAAI5F,IACd,EAGX,CAc8DqyC,CAAWxoE,KAAMm1B,EAAO6pC,EAAOjjC,MACzF5G,EAAMywC,YACN7gE,EAiDJ,SAAuBw+C,EAAQpuB,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,GAC5D,IAAKmsC,EAAO,CACV,IAAIO,EArBR,SAAqBtzC,EAAO6pC,EAAO9/D,GAIjC,OAHKi2B,EAAM+qC,aAAsC,IAAxB/qC,EAAMwxC,eAA4C,iBAAV3H,IAC/DA,EAAQ9gE,EAAOS,KAAKqgE,EAAO9/D,IAEtB8/D,CACT,CAgBmB0J,CAAYvzC,EAAO6pC,EAAO9/D,GACrC8/D,IAAUyJ,IACZP,GAAQ,EACRhpE,EAAW,SACX8/D,EAAQyJ,EAEZ,CACA,IAAIpnE,EAAM8zB,EAAM+qC,WAAa,EAAIlB,EAAMtgE,OACvCy2B,EAAMz2B,QAAU2C,EAChB,IAAI0D,EAAMowB,EAAMz2B,OAASy2B,EAAMmX,cAG/B,GADKvnC,IAAKowB,EAAM8uC,WAAY,GACxB9uC,EAAMyxC,SAAWzxC,EAAM0xC,OAAQ,CACjC,IAAI5jD,EAAOkS,EAAMsyC,oBACjBtyC,EAAMsyC,oBAAsB,CAC1BzI,MAAOA,EACP9/D,SAAUA,EACVgpE,MAAOA,EACPjoB,SAAUlkB,EACVtjB,KAAM,MAEJwK,EACFA,EAAKxK,KAAO0c,EAAMsyC,oBAElBtyC,EAAMmyC,gBAAkBnyC,EAAMsyC,oBAEhCtyC,EAAMuyC,sBAAwB,CAChC,MACEI,EAAQvkB,EAAQpuB,GAAO,EAAO9zB,EAAK29D,EAAO9/D,EAAU68B,GAEtD,OAAOh3B,CACT,CAlFU4jE,CAAc3oE,KAAMm1B,EAAO+yC,EAAOlJ,EAAO9/D,EAAU68B,IAEpDh3B,CACT,EACA8mC,EAASnuC,UAAUkrE,KAAO,WACxB5oE,KAAKmsC,eAAe06B,QACtB,EACAh7B,EAASnuC,UAAUmrE,OAAS,WAC1B,IAAI1zC,EAAQn1B,KAAKmsC,eACbhX,EAAM0xC,SACR1xC,EAAM0xC,SACD1xC,EAAMyxC,SAAYzxC,EAAM0xC,QAAW1xC,EAAM2xC,mBAAoB3xC,EAAMmyC,iBAAiBC,EAAYvnE,KAAMm1B,GAE/G,EACA0W,EAASnuC,UAAUorE,mBAAqB,SAA4B5pE,GAGlE,GADwB,iBAAbA,IAAuBA,EAAWA,EAAS2c,iBAChD,CAAC,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOY,SAASvd,EAAW,IAAI2c,gBAAkB,GAAI,MAAM,IAAI0qD,EAAqBrnE,GAExL,OADAc,KAAKmsC,eAAe40B,gBAAkB7hE,EAC/Bc,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,gBAAkBnsC,KAAKmsC,eAAeI,WACpD,IAQFlvC,OAAOqiB,eAAemsB,EAASnuC,UAAW,wBAAyB,CAIjEG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeG,aAC7B,IAuKFT,EAASnuC,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACrDA,EAAG,IAAI8jC,EAA2B,YACpC,EACAh0B,EAASnuC,UAAUmqE,QAAU,KAC7Bh8B,EAASnuC,UAAUyD,IAAM,SAAU69D,EAAO9/D,EAAU68B,GAClD,IAAI5G,EAAQn1B,KAAKmsC,eAmBjB,MAlBqB,mBAAV6yB,GACTjjC,EAAKijC,EACLA,EAAQ,KACR9/D,EAAW,MACkB,mBAAbA,IAChB68B,EAAK78B,EACLA,EAAW,MAET8/D,SAAuCh/D,KAAKia,MAAM+kD,EAAO9/D,GAGzDi2B,EAAM0xC,SACR1xC,EAAM0xC,OAAS,EACf7mE,KAAK6oE,UAIF1zC,EAAM8vC,QAyDb,SAAqB1hB,EAAQpuB,EAAO4G,GAClC5G,EAAM8vC,QAAS,EACfkC,EAAY5jB,EAAQpuB,GAChB4G,IACE5G,EAAM0uB,SAAUj2B,QAAQqO,SAASF,GAASwnB,EAAOzwB,KAAK,SAAUiJ,IAEtE5G,EAAMiX,OAAQ,EACdmX,EAAOzlD,UAAW,CACpB,CAjEqBirE,CAAY/oE,KAAMm1B,EAAO4G,GACrC/7B,IACT,EACA3C,OAAOqiB,eAAemsB,EAASnuC,UAAW,iBAAkB,CAI1DG,YAAY,EACZ8hB,IAAK,WACH,OAAO3f,KAAKmsC,eAAeztC,MAC7B,IAqEFrB,OAAOqiB,eAAemsB,EAASnuC,UAAW,YAAa,CAIrDG,YAAY,EACZ8hB,IAAK,WACH,YAA4BvgB,IAAxBY,KAAKmsC,gBAGFnsC,KAAKmsC,eAAeM,SAC7B,EACAvsB,IAAK,SAAatiB,GAGXoC,KAAKmsC,iBAMVnsC,KAAKmsC,eAAeM,UAAY7uC,EAClC,IAEFiuC,EAASnuC,UAAUyjE,QAAUzB,EAAYyB,QACzCt1B,EAASnuC,UAAUqkE,WAAarC,EAAYsC,UAC5Cn2B,EAASnuC,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC3CA,EAAG3I,EACL,0BC/jBAn2B,EAAOD,QAAU2/B,EACjB,IAAI02B,EAAiB,QACnBwM,EAA6BxM,EAAewM,2BAC5CqG,EAAwB7S,EAAe6S,sBACvC8C,EAAqC3V,EAAe2V,mCACpDC,EAA8B5V,EAAe4V,4BAC3Ct9B,EAAS,EAAQ,IAErB,SAASu9B,EAAe/yC,EAAIhb,GAC1B,IAAIguD,EAAKnpE,KAAKopE,gBACdD,EAAGE,cAAe,EAClB,IAAIttC,EAAKotC,EAAGnC,QACZ,GAAW,OAAPjrC,EACF,OAAO/7B,KAAK00B,KAAK,QAAS,IAAIwxC,GAEhCiD,EAAGG,WAAa,KAChBH,EAAGnC,QAAU,KACD,MAAR7rD,GAEFnb,KAAKge,KAAK7C,GACZ4gB,EAAG5F,GACH,IAAIozC,EAAKvpE,KAAKwsC,eACd+8B,EAAGhJ,SAAU,GACTgJ,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBACpCtsC,KAAKkhE,MAAMqI,EAAGj9B,cAElB,CACA,SAAS3P,EAAU9Q,GACjB,KAAM7rB,gBAAgB28B,GAAY,OAAO,IAAIA,EAAU9Q,GACvD8f,EAAOr0B,KAAKtX,KAAM6rB,GAClB7rB,KAAKopE,gBAAkB,CACrBF,eAAgBA,EAAe7zC,KAAKr1B,MACpCwpE,eAAe,EACfH,cAAc,EACdrC,QAAS,KACTsC,WAAY,KACZG,cAAe,MAIjBzpE,KAAKwsC,eAAeg0B,cAAe,EAKnCxgE,KAAKwsC,eAAe0T,MAAO,EACvBr0B,IAC+B,mBAAtBA,EAAQrd,YAA0BxO,KAAK49B,WAAa/R,EAAQrd,WAC1C,mBAAlBqd,EAAQ69C,QAAsB1pE,KAAK69B,OAAShS,EAAQ69C,QAIjE1pE,KAAK0zB,GAAG,YAAa20C,EACvB,CACA,SAASA,IACP,IAAI9S,EAAQv1D,KACe,mBAAhBA,KAAK69B,QAA0B79B,KAAKwsC,eAAeC,UAK5D3O,EAAK99B,KAAM,KAAM,MAJjBA,KAAK69B,QAAO,SAAU1H,EAAIhb,GACxB2iB,EAAKy3B,EAAOp/B,EAAIhb,EAClB,GAIJ,CAiDA,SAAS2iB,EAAKylB,EAAQptB,EAAIhb,GACxB,GAAIgb,EAAI,OAAOotB,EAAO7uB,KAAK,QAASyB,GAQpC,GAPY,MAARhb,GAEFooC,EAAOvlC,KAAK7C,GAKVooC,EAAOpX,eAAeztC,OAAQ,MAAM,IAAIuqE,EAC5C,GAAI1lB,EAAO6lB,gBAAgBC,aAAc,MAAM,IAAIL,EACnD,OAAOzlB,EAAOvlC,KAAK,KACrB,CArHA,EAAQ,EAAR,CAAoB2e,EAAWgP,GAyD/BhP,EAAUj/B,UAAUsgB,KAAO,SAAUghD,EAAO9/D,GAE1C,OADAc,KAAKopE,gBAAgBI,eAAgB,EAC9B79B,EAAOjuC,UAAUsgB,KAAK1G,KAAKtX,KAAMg/D,EAAO9/D,EACjD,EAYAy9B,EAAUj/B,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC1DA,EAAG,IAAI8jC,EAA2B,gBACpC,EACAljC,EAAUj/B,UAAUiqE,OAAS,SAAU3I,EAAO9/D,EAAU68B,GACtD,IAAIotC,EAAKnpE,KAAKopE,gBAId,GAHAD,EAAGnC,QAAUjrC,EACbotC,EAAGG,WAAatK,EAChBmK,EAAGM,cAAgBvqE,GACdiqE,EAAGE,aAAc,CACpB,IAAIE,EAAKvpE,KAAKwsC,gBACV28B,EAAGK,eAAiBD,EAAG/I,cAAgB+I,EAAG7qE,OAAS6qE,EAAGj9B,gBAAetsC,KAAKkhE,MAAMqI,EAAGj9B,cACzF,CACF,EAKA3P,EAAUj/B,UAAUwjE,MAAQ,SAAU1xD,GACpC,IAAI25D,EAAKnpE,KAAKopE,gBACQ,OAAlBD,EAAGG,YAAwBH,EAAGE,aAMhCF,EAAGK,eAAgB,GALnBL,EAAGE,cAAe,EAClBrpE,KAAK49B,WAAWurC,EAAGG,WAAYH,EAAGM,cAAeN,EAAGD,gBAMxD,EACAvsC,EAAUj/B,UAAU0jE,SAAW,SAAUhuC,EAAK2I,GAC5C4P,EAAOjuC,UAAU0jE,SAAS9pD,KAAKtX,KAAMozB,GAAK,SAAUu2C,GAClD5tC,EAAG4tC,EACL,GACF,0BC/KA,IAAI4Q,EAAY,EAAQ,KACxBt9E,EAAOD,QAAUA,EAAUu9E,EAAUzL,WAAayL,EAAUz6C,KAAK5T,SAAS,EAAQ,MAA0CqW,OAAO,oBAEnI,IAAI5W,EAAY4uD,EAAU5uD,UACtBmU,EAAYy6C,EAAUz6C,KACtBhY,EAAYyyD,EAAUzyD,KACtBD,EAAY0yD,EAAU1yD,KACtBmW,EAAYu8C,EAAUv8C,MACtB6e,EAAY09B,EAAU19B,SACtBnQ,EAAY6tC,EAAU7tC,MACtBlL,EAAY+4C,EAAU/4C,QACtBmd,EAAY47B,EAAU57B,OAiH1B,SAAS67B,EAA2BC,EAAI56B,EAAO66B,GAG3C,IAAIC,EAAO39E,EAAQ49E,oBAAoBt9E,OAAO,CAAE4Z,KAAMujE,EAAG16C,WAAa06C,EAAGv6C,SAAShX,UAAU,GAAG/mB,QAAQ,MAAO,MAAQ,QAAU,WAC5Hu4E,IACAC,EAAKD,OAASA,GACZD,aAAc36C,IAChB66C,EAAc,QAAIF,EAAGv6C,SAAShX,UAAU,IAG5C,IAAK,IAAWwY,EAAPlgC,EAAI,EAAWA,EAAIi5E,EAAG14C,YAAYrjC,SAAU8C,GAC5CkgC,EAAS+4C,EAAG94C,aAAangC,cAAeqmB,EACzC8yD,EAAKE,YAAY78D,KAAK0jB,EAAOo5C,aAAaJ,IACrCh5C,aAAkB5Z,EACvB6yD,EAAKI,SAAS/8D,KAAK0jB,EAAOo5C,gBACrBp5C,aAAkB1D,EACvB28C,EAAKK,UAAUh9D,KAAK0jB,EAAOo5C,aAAaJ,IACnCh5C,aAAkBF,EACvBm5C,EAAK77B,QAAQ9gC,KAAK0jB,EAAOo5C,gBACpBp5C,aAA8B/V,GACnC6uD,EAA2B94C,EAAQme,EAAO66B,GAGlDC,EAAK9uD,QAAUovD,EAAoBR,EAAG5uD,QAAS7uB,EAAQk+E,aAGnDP,EAAKE,YAAYn8E,OAASi8E,EAAKI,SAASr8E,OAASi8E,EAAKK,UAAUt8E,OAASi8E,EAAK77B,QAAQpgD,QACtFmhD,EAAM7hC,KAAK28D,EACnB,CAjFA76C,EAAKq7C,eAAiB,SAAwBrM,GAGT,iBAAtBA,EAAWpwE,SAClBowE,EAAa9xE,EAAQo+E,kBAAkB57C,OAAOsvC,IAElD,IAAIhyE,EAAO,IAAIgjC,EAEf,GAAIgvC,EAAW6L,KAGX,IAFA,IAAIU,EACAC,EACY95E,EAAPgB,EAAI,EAAMA,EAAIssE,EAAW6L,KAAKj8E,SAAU8D,EAAG,CAMhD,GALA84E,EAAcx+E,GACTu+E,EAAiBvM,EAAW6L,KAAKn4E,IAAa,SAAK64E,EAAwB,QAAE38E,SAC9E48E,EAAcx+E,EAAKI,OAAOm+E,EAAwB,UAClDA,EAAenkE,MAAQmkE,EAAenkE,KAAKxY,QAC3C5B,EAAK+iD,MAAM7hC,KAAKs9D,EAAYv7C,SAAWs7C,EAAenkE,MACtDmkE,EAAeR,YACf,IAAKr5E,EAAI,EAAGA,EAAI65E,EAAeR,YAAYn8E,SAAU8C,EACjD85E,EAAYtzE,IAAI6f,EAAKszD,eAAeE,EAAeR,YAAYr5E,GAAI65E,EAAeX,SAC1F,GAAIW,EAAeN,SACf,IAAKv5E,EAAI,EAAGA,EAAI65E,EAAeN,SAASr8E,SAAU8C,EAC9C85E,EAAYtzE,IAAI8f,EAAKqzD,eAAeE,EAAeN,SAASv5E,KACpE,GAAI65E,EAAeL,UACf,IAAKx5E,EAAI,EAAGA,EAAI65E,EAAeL,UAAUt8E,SAAU8C,EAC/C85E,EAAYtzE,IAAIg2B,EAAMm9C,eAAeE,EAAeL,UAAUx5E,KACtE,GAAI65E,EAAev8B,QACf,IAAKt9C,EAAI,EAAGA,EAAI65E,EAAev8B,QAAQpgD,SAAU8C,EAC7C85E,EAAYtzE,IAAIw5B,EAAQ25C,eAAeE,EAAev8B,QAAQt9C,KACtE,IAAImkC,EAAO41C,EAAsBF,EAAexvD,QAAS7uB,EAAQk+E,aACjE,GAAIv1C,EAAM,CACN,IAAI61C,EAAKn+E,OAAOkrB,KAAKod,GACrB,IAAKnkC,EAAI,EAAGA,EAAIg6E,EAAG98E,SAAU8C,EACzB85E,EAAYr8C,UAAUu8C,EAAGh6E,GAAImkC,EAAK61C,EAAGh6E,IAC7C,CACJ,CAGJ,OAAO1E,CACX,EAOAgjC,EAAKpiC,UAAUo9E,aAAe,SAAsBJ,GAChD,IAAIx6D,EAAMljB,EAAQo+E,kBAAkB99E,SAEpC,OADAk9E,EAA2Bx6E,KAAMkgB,EAAIy6D,KAAMD,GACpCx6D,CACX,EAsEA,IAAIu7D,EAAsB,EAQ1B5zD,EAAKszD,eAAiB,SAAwBrM,EAAY4L,GAGrB,iBAAtB5L,EAAWpwE,SAClBowE,EAAa9xE,EAAQ0+E,gBAAgBl8C,OAAOsvC,IAGhD,IACIttE,EADA0Z,EAAO,IAAI2M,EAAKinD,EAAW53D,KAAKxY,OAASowE,EAAW53D,KAAO,OAASukE,IAAuBF,EAAsBzM,EAAWjjD,QAAS7uB,EAAQ2+E,iBAGpI,GAAI7M,EAAW8M,UACxB,IAAKp6E,EAAI,EAAGA,EAAIstE,EAAW8M,UAAUl9E,SAAU8C,EAC3C0Z,EAAKlT,IAAI0kC,EAAMyuC,eAAerM,EAAW8M,UAAUp6E,KAC9C,GAAIstE,EAAWhiC,MACxB,IAAKtrC,EAAI,EAAGA,EAAIstE,EAAWhiC,MAAMpuC,SAAU8C,EAAG,CAC1C,IAAIsrC,EAAQ9O,EAAMm9C,eAAerM,EAAWhiC,MAAMtrC,GAAIk5E,GACtDx/D,EAAKlT,IAAI8kC,GACLgiC,EAAWhiC,MAAMtrC,GAAG0sB,eAAe,eACnChT,EAAK0iC,YAAYkxB,EAAWhiC,MAAMtrC,GAAGq6E,YAAY7zE,IAAI8kC,EAC7D,CACmB,GAAIgiC,EAAWkM,UAClC,IAAKx5E,EAAI,EAAGA,EAAIstE,EAAWkM,UAAUt8E,SAAU8C,EAC3C0Z,EAAKlT,IAAIg2B,EAAMm9C,eAAerM,EAAWkM,UAAUx5E,GAAIk5E,IAC5C,GAAI5L,EAAWgN,WAC9B,IAAKt6E,EAAI,EAAGA,EAAIstE,EAAWgN,WAAWp9E,SAAU8C,EAC5C0Z,EAAKlT,IAAI6f,EAAKszD,eAAerM,EAAWgN,WAAWt6E,GAAIk5E,IACnD5L,EAAWgN,WAAWt6E,GAAGqqB,SAAWijD,EAAWgN,WAAWt6E,GAAGqqB,QAAQkwD,UACrE7gE,EAAK+jB,UAAU,aAAa,GAErB,GAAI6vC,EAAWiM,SAC9B,IAAKv5E,EAAI,EAAGA,EAAIstE,EAAWiM,SAASr8E,SAAU8C,EAC1C0Z,EAAKlT,IAAI8f,EAAKqzD,eAAerM,EAAWiM,SAASv5E,KAClC,GAAIstE,EAAWkN,gBAAkBlN,EAAWkN,eAAet9E,OAE9E,IADAwc,EAAKkiC,WAAa,GACb57C,EAAI,EAAGA,EAAIstE,EAAWkN,eAAet9E,SAAU8C,EAChD0Z,EAAKkiC,WAAWp/B,KAAK,CAAE8wD,EAAWkN,eAAex6E,GAAGN,MAAO4tE,EAAWkN,eAAex6E,GAAGL,MAE9E,GAAI2tE,EAAWmN,eAAiBnN,EAAWmN,cAAcv9E,QAAUowE,EAAWoN,cAAgBpN,EAAWoN,aAAax9E,OAAQ,CAE/H,GADbwc,EAAK+Q,SAAW,GACC6iD,EAAWmN,cACxB,IAAKz6E,EAAI,EAAGA,EAAIstE,EAAWmN,cAAcv9E,SAAU8C,EAC/C0Z,EAAK+Q,SAASjO,KAAK,CAAE8wD,EAAWmN,cAAcz6E,GAAGN,MAAO4tE,EAAWmN,cAAcz6E,GAAGL,MAChF,GAAI2tE,EAAWoN,aACvB,IAAK16E,EAAI,EAAGA,EAAIstE,EAAWoN,aAAax9E,SAAU8C,EAC9C0Z,EAAK+Q,SAASjO,KAAK8wD,EAAWoN,aAAa16E,GACvD,CAEA,OAAO0Z,CACX,EAOA2M,EAAKnqB,UAAUo9E,aAAe,SAAsBJ,GAChD,IACIl5E,EADAstE,EAAa9xE,EAAQ0+E,gBAAgBp+E,OAAO,CAAE4Z,KAAMlX,KAAKkX,OAGhD,IAAK1V,EAAI,EAAGA,EAAIxB,KAAK4sC,YAAYluC,SAAU8C,EAAG,CACvD,IAAI26E,EAEJ,GADArN,EAAWhiC,MAAM9uB,KAAKm+D,EAAkBn8E,KAAKu9C,aAAa/7C,GAAGs5E,aAAaJ,IACtE16E,KAAKu9C,aAAa/7C,aAAcq7C,EAAU,CAC1C,IAAImB,EAAUo+B,EAAiBp8E,KAAKu9C,aAAa/7C,GAAGw8C,QAASh+C,KAAKu9C,aAAa/7C,GAAGg9C,iBAC9E69B,EAAYD,EAAiBp8E,KAAKu9C,aAAa/7C,GAAG0Z,KAAMlb,KAAKu9C,aAAa/7C,GAAGo9B,cAC7E09C,EAAyC,KAAzBD,GAAwD,KAAzBA,EACzCr8E,KAAKu9C,aAAa/7C,GAAGo9B,cAAgB29C,EAAUv8E,KAAKo/B,OAAQp/B,KAAKu9C,aAAa/7C,GAAGo9B,eAAiB5+B,KAAKu9C,aAAa/7C,GAAG0Z,UACvH9b,EACV0vE,EAAWgN,WAAW99D,KAAKhhB,EAAQ0+E,gBAAgBp+E,OAAO,CACtD4Z,KAAMilE,EAAgBzyD,SACtBojB,MAAO,CACH9vC,EAAQw/E,qBAAqBl/E,OAAO,CAAE4Z,KAAM,MAAOtX,OAAQ,EAAG68E,MAAO,EAAGvhE,KAAM8iC,IAC9EhhD,EAAQw/E,qBAAqBl/E,OAAO,CAAE4Z,KAAM,QAAStX,OAAQ,EAAG68E,MAAO,EAAGvhE,KAAMmhE,EAAW3yD,SAAU4yD,KAEzGzwD,QAAS7uB,EAAQ2+E,eAAer+E,OAAO,CAAEy+E,UAAU,MAE3D,CACJ,CACa,IAAKv6E,EAAI,EAAGA,EAAIxB,KAAK49C,YAAYl/C,SAAU8C,EACpDstE,EAAW8M,UAAU59D,KAAKhe,KAAKw9C,aAAah8C,GAAGs5E,gBACnC,IAAKt5E,EAAI,EAAGA,EAAIxB,KAAK+hC,YAAYrjC,SAAU8C,EAC5BxB,KAAK2hC,aAAangC,aAAcw8B,EACvD8wC,EAAWhiC,MAAM9uB,KAAKhe,KAAK2hC,aAAangC,GAAGs5E,aAAaJ,IACvC16E,KAAK2hC,aAAangC,aAAcqmB,EACjDinD,EAAWgN,WAAW99D,KAAKhe,KAAK2hC,aAAangC,GAAGs5E,aAAaJ,IAC5C16E,KAAK2hC,aAAangC,aAAcsmB,GACjDgnD,EAAWiM,SAAS/8D,KAAKhe,KAAK2hC,aAAangC,GAAGs5E,gBAG/B,GAAI96E,KAAKo9C,WAC5B,IAAK57C,EAAI,EAAGA,EAAIxB,KAAKo9C,WAAW1+C,SAAU8C,EACtCstE,EAAWkN,eAAeh+D,KAAKhhB,EAAQ0+E,gBAAgBgB,eAAep/E,OAAO,CAAE4D,MAAOlB,KAAKo9C,WAAW57C,GAAG,GAAIL,IAAKnB,KAAKo9C,WAAW57C,GAAG,MAC3H,GAAIxB,KAAKisB,SACvB,IAAKzqB,EAAI,EAAGA,EAAIxB,KAAKisB,SAASvtB,SAAU8C,EACQ,iBAArBxB,KAAKisB,SAASzqB,GACjCstE,EAAWoN,aAAal+D,KAAKhe,KAAKisB,SAASzqB,IAE3CstE,EAAWmN,cAAcj+D,KAAKhhB,EAAQ0+E,gBAAgBiB,cAAcr/E,OAAO,CAAE4D,MAAOlB,KAAKisB,SAASzqB,GAAG,GAAIL,IAAKnB,KAAKisB,SAASzqB,GAAG,MAI3I,OAFAstE,EAAWjjD,QAAUovD,EAAoBj7E,KAAK6rB,QAAS7uB,EAAQ2+E,gBAExD7M,CACX,EAqEA,IAAI8N,EAAW,oDAQf5+C,EAAMm9C,eAAiB,SAAwBrM,EAAY4L,GAMvD,GAHiC,iBAAtB5L,EAAWpwE,SAClBowE,EAAa9xE,EAAQ0+E,gBAAgBl8C,OAAOsvC,IAEf,iBAAtBA,EAAWlvE,OAClB,MAAMH,MAAM,oBAGhB,IAAIigC,EAOAC,EACJ,OANID,EADAovC,EAAWplD,UAAYolD,EAAWplD,SAAShrB,OAC/BowE,EAAWplD,SAuV/B,SAA4BxO,GACxB,OAAQA,GAEJ,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,QACf,KAAK,EAAG,MAAO,QACf,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,QACf,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,OACf,KAAK,EAAG,MAAO,SACf,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,SAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,SAChB,KAAK,GAAI,MAAO,SAEpB,MAAMzb,MAAM,iBAAmByb,EACnC,CAzWoB2hE,CAAmB/N,EAAW5zD,MAItC4zD,EAAW2N,OAEf,KAAK,EAAG98C,OAAYvgC,EAAW,MAC/B,KAAK,EAAGugC,EAAY,WAAY,MAChC,KAAK,EAAGA,EAAY,WAAY,MAChC,QAAS,MAAMlgC,MAAM,kBAAoBqvE,EAAW2N,OAG3D,IAAIK,EAAWhO,EAAWgO,cACE19E,IAAxB0vE,EAAWgO,WACdA,EAAWA,EAASp+E,OAASo+E,OAAW19E,GAEtC,IAAI0tC,EAAQ,IAAI9O,EACZu8C,EAAUxyD,KAAKqB,UAAU0lD,EAAW53D,KAAKxY,OAASowE,EAAW53D,KAAO,QAAU43D,EAAWlvE,QACzFkvE,EAAWlvE,OACX8/B,EACAC,EACAm9C,GAKJ,GAFAhwC,EAAMjhB,QAAU0vD,EAAsBzM,EAAWjjD,QAAS7uB,EAAQ+/E,cAE9DjO,EAAWpwC,cAAgBowC,EAAWpwC,aAAahgC,OAAQ,CAC3D,IAAIggC,EAAeowC,EAAWpwC,aAC9B,OAAQA,GACJ,IAAK,OAAQ,IAAK,OACdA,GAAe,EACf,MACJ,IAAK,QAAS,IAAK,QACfA,GAAe,EACf,MACJ,QACgBk+C,EAASnoC,KAAK/V,KAEtBA,EAAehhB,SAASghB,IAGpCoO,EAAM7N,UAAU,UAAWP,EAC/B,CAUA,OAwTJ,SAAgCxjB,GAC5B,OAAQA,GACJ,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACD,OAAO,EAEf,OAAO,CACX,CAnVQ8hE,CAAuBlO,EAAW5zD,QACnB,WAAXw/D,EACI5L,EAAWjjD,UAAYijD,EAAWjjD,QAAQyT,QAC1CwN,EAAM7N,UAAU,UAAU,GACrB6vC,EAAWjjD,SAAWijD,EAAWjjD,QAAQyT,QAClDwN,EAAM7N,UAAU,UAAU,IAG3B6N,CACX,EAOA9O,EAAMtgC,UAAUo9E,aAAe,SAAsBJ,GACjD,IAAI5L,EAAa9xE,EAAQw/E,qBAAqBl/E,OAAO,CAAE4Z,KAAMlX,KAAKkX,KAAMtX,OAAQI,KAAKwpB,KAErF,GAAIxpB,KAAKu+B,IAELuwC,EAAW5zD,KAAO,GAClB4zD,EAAWplD,SAAW6wD,EAAUxyD,KAAKgB,QAAQ/oB,KAAKkX,MAClD43D,EAAW2N,MAAQ,MAEhB,CAGH,OAAQ3N,EAAW5zD,KAAOkhE,EAAiBp8E,KAAKkb,KAAMlb,KAAKizB,UAAU2L,eACjE,KAAK,GACL,KAAK,GACL,KAAK,GACDkwC,EAAWplD,SAAW1pB,KAAK4+B,aAAe29C,EAAUv8E,KAAKo/B,OAAQp/B,KAAK4+B,cAAgB5+B,KAAKkb,KAKnG,OAAQlb,KAAKm+B,MACT,IAAK,WAAY2wC,EAAW2N,MAAQ,EAAG,MACvC,IAAK,WAAY3N,EAAW2N,MAAQ,EAAG,MACvC,QAAS3N,EAAW2N,MAAQ,EAGpC,CAMA,GAHA3N,EAAWgO,SAAW98E,KAAK6+B,eAAiB7+B,KAAK6+B,eAAeO,OAAOc,SAAWlgC,KAAK23B,OAGnF33B,KAAKw+B,SACAswC,EAAW+M,WAAa77E,KAAKo/B,OAAOwe,YAAYnhC,QAAQzc,KAAKw+B,SAAW,EACzE,MAAM/+B,MAAM,iBAcpB,OAZIO,KAAK6rB,UACLijD,EAAWjjD,QAAUovD,EAAoBj7E,KAAK6rB,QAAS7uB,EAAQ+/E,cAChC,MAA3B/8E,KAAK6rB,QAAiB,UACtBijD,EAAWpwC,aAAe3hB,OAAO/c,KAAK6rB,QAAiB,WAGhD,WAAX6uD,EACK16E,KAAKs/B,UACLwvC,EAAWjjD,UAAYijD,EAAWjjD,QAAU7uB,EAAQ+/E,aAAaz/E,WAAWgiC,QAAS,GACnFt/B,KAAKs/B,UACXwvC,EAAWjjD,UAAYijD,EAAWjjD,QAAU7uB,EAAQ+/E,aAAaz/E,WAAWgiC,QAAS,GAEnFwvC,CACX,EA2BA,IAAImO,EAAmB,EAOvBn1D,EAAKqzD,eAAiB,SAAwBrM,GAGT,iBAAtBA,EAAWpwE,SAClBowE,EAAa9xE,EAAQkgF,oBAAoB19C,OAAOsvC,IAGpD,IAAIljD,EAAS,CAAC,EACd,GAAIkjD,EAAWlxE,MACX,IAAK,IAAI4D,EAAI,EAAGA,EAAIstE,EAAWlxE,MAAMc,SAAU8C,EAAG,CAC9C,IAAI0V,EAAQ43D,EAAWlxE,MAAM4D,GAAG0V,KAC5BtZ,EAAQkxE,EAAWlxE,MAAM4D,GAAG5B,QAAU,EAC1CgsB,EAAO1U,GAAQA,EAAKxY,OAASwY,EAAO,OAAStZ,GAASA,CAC1D,CAEJ,OAAO,IAAIkqB,EACPgnD,EAAW53D,MAAQ43D,EAAW53D,KAAKxY,OAASowE,EAAW53D,KAAO,OAAS+lE,IACvErxD,EACA2vD,EAAsBzM,EAAWjjD,QAAS7uB,EAAQmgF,aAE1D,EAMAr1D,EAAKpqB,UAAUo9E,aAAe,WAI1B,IADA,IAAIlvD,EAAS,GACJpqB,EAAI,EAAGg6E,EAAKn+E,OAAOkrB,KAAKvoB,KAAK4rB,QAASpqB,EAAIg6E,EAAG98E,SAAU8C,EAC5DoqB,EAAO5N,KAAKhhB,EAAQogF,yBAAyB9/E,OAAO,CAAE4Z,KAAMskE,EAAGh6E,GAAI5B,OAAQI,KAAK4rB,OAAO4vD,EAAGh6E,OAE9F,OAAOxE,EAAQkgF,oBAAoB5/E,OAAO,CACtC4Z,KAAMlX,KAAKkX,KACXtZ,MAAOguB,EACPC,QAASovD,EAAoBj7E,KAAK6rB,QAAS7uB,EAAQmgF,cAE3D,EAWA,IAAIE,EAAoB,EAOxB3wC,EAAMyuC,eAAiB,SAAwBrM,GAM3C,MAHiC,iBAAtBA,EAAWpwE,SAClBowE,EAAa9xE,EAAQsgF,qBAAqB99C,OAAOsvC,IAE9C,IAAIpiC,EAEPoiC,EAAW53D,MAAQ43D,EAAW53D,KAAKxY,OAASowE,EAAW53D,KAAO,QAAUmmE,IAGhF,EAMA3wC,EAAMhvC,UAAUo9E,aAAe,WAC3B,OAAO99E,EAAQsgF,qBAAqBhgF,OAAO,CACvC4Z,KAAMlX,KAAKkX,MAGnB,EAkBA,IAAIqmE,EAAsB,EAO1B/7C,EAAQ25C,eAAiB,SAAwBrM,GAGZ,iBAAtBA,EAAWpwE,SAClBowE,EAAa9xE,EAAQwgF,uBAAuBh+C,OAAOsvC,IAEvD,IAAIhwB,EAAU,IAAItd,EAAQstC,EAAW53D,MAAQ43D,EAAW53D,KAAKxY,OAASowE,EAAW53D,KAAO,UAAYqmE,IAAuBhC,EAAsBzM,EAAWjjD,QAAS7uB,EAAQygF,iBAC7K,GAAI3O,EAAW/iC,OACX,IAAK,IAAIvqC,EAAI,EAAGA,EAAIstE,EAAW/iC,OAAOrtC,SAAU8C,EAC5Cs9C,EAAQ92C,IAAI22C,EAAOw8B,eAAerM,EAAW/iC,OAAOvqC,KAE5D,OAAOs9C,CACX,EAMAtd,EAAQ9jC,UAAUo9E,aAAe,WAI7B,IADA,IAAI34C,EAAU,GACL3gC,EAAI,EAAGA,EAAIxB,KAAK++C,eAAgBv9C,EACrC2gC,EAAQnkB,KAAKhe,KAAK6+C,cAAcr9C,GAAGs5E,gBAEvC,OAAO99E,EAAQwgF,uBAAuBlgF,OAAO,CACzC4Z,KAAMlX,KAAKkX,KACXirB,QAASA,EACTtW,QAASovD,EAAoBj7E,KAAK6rB,QAAS7uB,EAAQygF,iBAE3D,EAqBA,IAAIC,EAAqB,EAwFzB,SAAStB,EAAiBlhE,EAAM0jB,GAC5B,OAAQ1jB,GAEJ,IAAK,SAAU,OAAO,EACtB,IAAK,QAAS,OAAO,EACrB,IAAK,QAAS,OAAO,EACrB,IAAK,SAAU,OAAO,EACtB,IAAK,QAAS,OAAO,EACrB,IAAK,UAAW,OAAO,EACvB,IAAK,UAAW,OAAO,EACvB,IAAK,OAAQ,OAAO,EACpB,IAAK,SAAU,OAAO,EACtB,IAAK,QAAS,OAAO,GACrB,IAAK,SAAU,OAAO,GACtB,IAAK,WAAY,OAAO,GACxB,IAAK,WAAY,OAAO,GACxB,IAAK,SAAU,OAAO,GACtB,IAAK,SAAU,OAAO,GAE1B,GAAI0jB,aAAwB9W,EACxB,OAAO,GACX,GAAI8W,aAAwB/W,EACxB,OAAO+W,EAAaye,MAAQ,GAAK,GACrC,MAAM59C,MAAM,iBAAmByb,EACnC,CAGA,SAASqgE,EAAsB1vD,EAAS3Q,GACpC,GAAK2Q,EAAL,CAGA,IADA,IACgBihB,EAAOxuC,EAAKiB,EAgDZ0B,EAjDZ8C,EAAM,GACDvC,EAAI,EAAoBA,EAAI0Z,EAAK0xB,YAAYluC,SAAU8C,EACR,yBAA/ClD,GAAOwuC,EAAQ5xB,EAAKqiC,aAAa/7C,IAAI0V,OAClC2U,EAAQqC,eAAe5vB,KACvBiB,EAAMssB,EAAQvtB,GACVwuC,EAAMlO,wBAAwB9W,GAAuB,iBAARvoB,QAA2DH,IAAvC0tC,EAAMlO,aAAa5S,WAAWzsB,KAC/FA,EAAMutC,EAAMlO,aAAa5S,WAAWzsB,IACxCwE,EAAIia,MA0CA/c,EA1CgB3C,GA2CrB4qB,UAAU,EAAE,GAChBjoB,EAAIioB,UAAU,GACT/mB,QAAQ,uBAAuB,SAASknB,EAAIC,GAAM,MAAO,IAAMA,EAAGzN,aAAe,IA7CvDtc,IAEtC,OAAOwE,EAAIrF,OAAS67E,EAAUxyD,KAAKS,SAASzkB,QAAO3E,CAV/B,CAWxB,CAGA,SAAS67E,EAAoBpvD,EAAS3Q,GAClC,GAAK2Q,EAAL,CAGA,IADA,IAC2CvtB,EAAKiB,EAD5CwE,EAAM,GACDvC,EAAI,EAAGg6E,EAAKn+E,OAAOkrB,KAAKsD,GAAoBrqB,EAAIg6E,EAAG98E,SAAU8C,EAElE,GADAjC,EAAMssB,EAAQvtB,EAAMk9E,EAAGh6E,IACX,YAARlD,EAAJ,CAEA,IAAIwuC,EAAQ5xB,EAAKgnB,OAAO5jC,IACnBwuC,IAAWA,EAAQ5xB,EAAKgnB,OAAO5jC,EAAMi8E,EAAUxyD,KAAKqB,UAAU9qB,OAEnEyF,EAAIia,KAAK1f,EAAKiB,EAJF,CAMhB,OAAOwE,EAAIrF,OAASwc,EAAKE,WAAWm/D,EAAUxyD,KAAKS,SAASzkB,SAAQ3E,CAXhD,CAYxB,CAGA,SAASm9E,EAAU59E,EAAMg/E,GACrB,IAAIC,EAAWj/E,EAAKuhC,SAAShoB,MAAM,KAC/B2lE,EAASF,EAAGz9C,SAAShoB,MAAM,KAC3B1W,EAAI,EACJgB,EAAI,EACJ4B,EAAIy5E,EAAOn/E,OAAS,EACxB,KAAMC,aAAgBmhC,IAAS69C,aAAchyD,EACzC,KAAOnqB,EAAIo8E,EAASl/E,QAAU8D,EAAI4B,GAAKw5E,EAASp8E,KAAOq8E,EAAOr7E,IAAI,CAC9D,IAAIs7E,EAAQH,EAAGp7C,OAAOq7C,EAASp8E,MAAM,GACrC,GAAc,OAAVs8E,GAAkBA,IAAUH,EAC5B,QACFn7E,CACN,MAEA,KAAOhB,EAAIo8E,EAASl/E,QAAU8D,EAAI4B,GAAKw5E,EAASp8E,KAAOq8E,EAAOr7E,KAAMhB,IAAKgB,GAC7E,OAAOq7E,EAAO3jE,MAAM1X,GAAG02B,KAAK,IAChC,CA7JAylB,EAAOw8B,eAAiB,SAAwBrM,GAM5C,MAHiC,iBAAtBA,EAAWpwE,SAClBowE,EAAa9xE,EAAQ+gF,sBAAsBv+C,OAAOsvC,IAE/C,IAAInwB,EAEPmwB,EAAW53D,MAAQ43D,EAAW53D,KAAKxY,OAASowE,EAAW53D,KAAO,SAAWwmE,IACzE,MACA5O,EAAWkP,UACXlP,EAAWmP,WACX3xD,QAAQwiD,EAAWoP,iBACnB5xD,QAAQwiD,EAAWqP,iBACnB5C,EAAsBzM,EAAWjjD,QAAS7uB,EAAQohF,eAE1D,EAMAz/B,EAAOjhD,UAAUo9E,aAAe,WAC5B,OAAO99E,EAAQ+gF,sBAAsBzgF,OAAO,CACxC4Z,KAAMlX,KAAKkX,KACX8mE,UAAWh+E,KAAKq/C,oBAAsBr/C,KAAKq/C,oBAAoBnf,SAAWlgC,KAAKu/C,YAC/E0+B,WAAYj+E,KAAKs/C,qBAAuBt/C,KAAKs/C,qBAAqBpf,SAAWlgC,KAAKw/C,aAClF0+B,gBAAiBl+E,KAAKy/C,cACtB0+B,gBAAiBn+E,KAAK0/C,eACtB7zB,QAASovD,EAAoBj7E,KAAK6rB,QAAS7uB,EAAQohF,gBAE3D,0BCxtBA,MAAMC,EAAkB,EAAQ,KAC1BC,EAAkB,EAAQ,KAC1BC,EAAe,EAAQ,KACvBC,EAAe,EAAQ,KAIvBC,EAA2BjlE,OAAO,4BAgNxC,SAASklE,EAA6B9gF,GACrC,GAAqB,iBAAVA,GAAuC,IAAjBA,EAAMc,OACtC,MAAM,IAAIK,UAAU,uDAEtB,CAEA,SAASurB,EAAO1sB,EAAOiuB,GACtB,OAAIA,EAAQvB,OACJuB,EAAQ0qC,OAAS8nB,EAAgBzgF,GAASm8B,mBAAmBn8B,GAG9DA,CACR,CAEA,SAAS4hC,EAAO5hC,EAAOiuB,GACtB,OAAIA,EAAQ2T,OACJ8+C,EAAgB1gF,GAGjBA,CACR,CAEA,SAAS+gF,EAAWtmE,GACnB,OAAI3W,MAAMC,QAAQ0W,GACVA,EAAMggD,OAGO,iBAAVhgD,EACHsmE,EAAWthF,OAAOkrB,KAAKlQ,IAC5BggD,MAAK,CAACr0D,EAAGC,IAAMqZ,OAAOtZ,GAAKsZ,OAAOrZ,KAClCs6B,KAAIjgC,GAAO+Z,EAAM/Z,KAGb+Z,CACR,CAEA,SAASumE,EAAWvmE,GACnB,MAAMwmE,EAAYxmE,EAAMoE,QAAQ,KAKhC,OAJmB,IAAfoiE,IACHxmE,EAAQA,EAAM6B,MAAM,EAAG2kE,IAGjBxmE,CACR,CAYA,SAASymE,EAAQzmE,GAEhB,MAAM0mE,GADN1mE,EAAQumE,EAAWvmE,IACMoE,QAAQ,KACjC,OAAoB,IAAhBsiE,EACI,GAGD1mE,EAAM6B,MAAM6kE,EAAa,EACjC,CAEA,SAASC,EAAWphF,EAAOiuB,GAO1B,OANIA,EAAQozD,eAAiB3hE,OAAOsV,MAAMtV,OAAO1f,KAA6B,iBAAVA,GAAuC,KAAjBA,EAAM4iB,OAC/F5iB,EAAQ0f,OAAO1f,IACLiuB,EAAQqzD,eAA2B,OAAVthF,GAA2C,SAAxBA,EAAMie,eAAoD,UAAxBje,EAAMie,gBAC9Fje,EAAgC,SAAxBA,EAAMie,eAGRje,CACR,CAEA,SAASu7B,EAAMgmD,EAAOtzD,GAUrB6yD,GATA7yD,EAAUxuB,OAAOy2D,OAAO,CACvBt0B,QAAQ,EACR64B,MAAM,EACN+mB,YAAa,OACbC,qBAAsB,IACtBJ,cAAc,EACdC,eAAe,GACbrzD,IAEkCwzD,sBAErC,MAAMC,EA7LP,SAA8BzzD,GAC7B,IAAIopB,EAEJ,OAAQppB,EAAQuzD,aACf,IAAK,QACJ,MAAO,CAAC9gF,EAAKV,EAAO2hF,KACnBtqC,EAAS,aAAaR,KAAKn2C,GAE3BA,EAAMA,EAAI6D,QAAQ,WAAY,IAEzB8yC,QAKoB71C,IAArBmgF,EAAYjhF,KACfihF,EAAYjhF,GAAO,CAAC,GAGrBihF,EAAYjhF,GAAK22C,EAAO,IAAMr3C,GAR7B2hF,EAAYjhF,GAAOV,CAQe,EAGrC,IAAK,UACJ,MAAO,CAACU,EAAKV,EAAO2hF,KACnBtqC,EAAS,UAAUR,KAAKn2C,GACxBA,EAAMA,EAAI6D,QAAQ,QAAS,IAEtB8yC,OAKoB71C,IAArBmgF,EAAYjhF,GAKhBihF,EAAYjhF,GAAO,GAAGyhB,OAAOw/D,EAAYjhF,GAAMV,GAJ9C2hF,EAAYjhF,GAAO,CAACV,GALpB2hF,EAAYjhF,GAAOV,CASiC,EAGvD,IAAK,uBACJ,MAAO,CAACU,EAAKV,EAAO2hF,KACnBtqC,EAAS,WAAWR,KAAKn2C,GACzBA,EAAMA,EAAI6D,QAAQ,SAAU,IAEvB8yC,OAKoB71C,IAArBmgF,EAAYjhF,GAKhBihF,EAAYjhF,GAAO,GAAGyhB,OAAOw/D,EAAYjhF,GAAMV,GAJ9C2hF,EAAYjhF,GAAO,CAACV,GALpB2hF,EAAYjhF,GAAOV,CASiC,EAGvD,IAAK,QACL,IAAK,YACJ,MAAO,CAACU,EAAKV,EAAO2hF,KACnB,MAAM59E,EAA2B,iBAAV/D,GAAsBA,EAAMkjB,SAAS+K,EAAQwzD,sBAC9DG,EAAmC,iBAAV5hF,IAAuB+D,GAAW69B,EAAO5hC,EAAOiuB,GAAS/K,SAAS+K,EAAQwzD,sBACzGzhF,EAAQ4hF,EAAiBhgD,EAAO5hC,EAAOiuB,GAAWjuB,EAClD,MAAM6hF,EAAW99E,GAAW69E,EAAiB5hF,EAAMsa,MAAM2T,EAAQwzD,sBAAsB9gD,KAAI6wB,GAAQ5vB,EAAO4vB,EAAMvjC,KAAsB,OAAVjuB,EAAiBA,EAAQ4hC,EAAO5hC,EAAOiuB,GACnK0zD,EAAYjhF,GAAOmhF,CAAQ,EAG7B,IAAK,oBACJ,MAAO,CAACnhF,EAAKV,EAAO2hF,KACnB,MAAM59E,EAAU,UAAUinB,KAAKtqB,GAG/B,GAFAA,EAAMA,EAAI6D,QAAQ,QAAS,KAEtBR,EAEJ,YADA49E,EAAYjhF,GAAOV,EAAQ4hC,EAAO5hC,EAAOiuB,GAAWjuB,GAIrD,MAAM8hF,EAAuB,OAAV9hF,EAClB,GACAA,EAAMsa,MAAM2T,EAAQwzD,sBAAsB9gD,KAAI6wB,GAAQ5vB,EAAO4vB,EAAMvjC,UAE3CzsB,IAArBmgF,EAAYjhF,GAKhBihF,EAAYjhF,GAAO,GAAGyhB,OAAOw/D,EAAYjhF,GAAMohF,GAJ9CH,EAAYjhF,GAAOohF,CAIsC,EAG5D,QACC,MAAO,CAACphF,EAAKV,EAAO2hF,UACMngF,IAArBmgF,EAAYjhF,GAKhBihF,EAAYjhF,GAAO,GAAGyhB,OAAOw/D,EAAYjhF,GAAMV,GAJ9C2hF,EAAYjhF,GAAOV,CAIiC,EAGzD,CAyFmB+hF,CAAqB9zD,GAGjC9mB,EAAM1H,OAAOC,OAAO,MAE1B,GAAqB,iBAAV6hF,EACV,OAAOp6E,EAKR,KAFAo6E,EAAQA,EAAM3+D,OAAOre,QAAQ,SAAU,KAGtC,OAAO4C,EAGR,IAAK,MAAM66E,KAAST,EAAMjnE,MAAM,KAAM,CACrC,GAAc,KAAV0nE,EACH,SAGD,IAAKthF,EAAKV,GAAS2gF,EAAa1yD,EAAQ2T,OAASogD,EAAMz9E,QAAQ,MAAO,KAAOy9E,EAAO,KAIpFhiF,OAAkBwB,IAAVxB,EAAsB,KAAO,CAAC,QAAS,YAAa,qBAAqBkjB,SAAS+K,EAAQuzD,aAAexhF,EAAQ4hC,EAAO5hC,EAAOiuB,GACvIyzD,EAAU9/C,EAAOlhC,EAAKutB,GAAUjuB,EAAOmH,EACxC,CAEA,IAAK,MAAMzG,KAAOjB,OAAOkrB,KAAKxjB,GAAM,CACnC,MAAMnH,EAAQmH,EAAIzG,GAClB,GAAqB,iBAAVV,GAAgC,OAAVA,EAChC,IAAK,MAAMwG,KAAK/G,OAAOkrB,KAAK3qB,GAC3BA,EAAMwG,GAAK46E,EAAWphF,EAAMwG,GAAIynB,QAGjC9mB,EAAIzG,GAAO0gF,EAAWphF,EAAOiuB,EAE/B,CAEA,OAAqB,IAAjBA,EAAQwsC,KACJtzD,IAGiB,IAAjB8mB,EAAQwsC,KAAgBh7D,OAAOkrB,KAAKxjB,GAAKszD,OAASh7D,OAAOkrB,KAAKxjB,GAAKszD,KAAKxsC,EAAQwsC,OAAOtwB,QAAO,CAACkN,EAAQ32C,KAC9G,MAAMV,EAAQmH,EAAIzG,GAQlB,OAPIguB,QAAQ1uB,IAA2B,iBAAVA,IAAuB8D,MAAMC,QAAQ/D,GAEjEq3C,EAAO32C,GAAOqgF,EAAW/gF,GAEzBq3C,EAAO32C,GAAOV,EAGRq3C,CAAM,GACX53C,OAAOC,OAAO,MAClB,CAEAN,EAAQ8hF,QAAUA,EAClB9hF,EAAQm8B,MAAQA,EAEhBn8B,EAAQq7B,UAAY,CAAC/P,EAAQuD,KAC5B,IAAKvD,EACJ,MAAO,GAURo2D,GAPA7yD,EAAUxuB,OAAOy2D,OAAO,CACvBxpC,QAAQ,EACRisC,QAAQ,EACR6oB,YAAa,OACbC,qBAAsB,KACpBxzD,IAEkCwzD,sBAErC,MAAMQ,EAAevhF,GACnButB,EAAQi0D,UAnXwBliF,MAmXM0qB,EAAOhqB,IAC7CutB,EAAQk0D,iBAAmC,KAAhBz3D,EAAOhqB,GAG9BghF,EAnXP,SAA+BzzD,GAC9B,OAAQA,EAAQuzD,aACf,IAAK,QACJ,OAAO9gF,GAAO,CAAC22C,EAAQr3C,KACtB,MAAM8C,EAAQu0C,EAAOv2C,OAErB,YACWU,IAAVxB,GACCiuB,EAAQi0D,UAAsB,OAAVliF,GACpBiuB,EAAQk0D,iBAA6B,KAAVniF,EAErBq3C,EAGM,OAAVr3C,EACI,IAAIq3C,EAAQ,CAAC3qB,EAAOhsB,EAAKutB,GAAU,IAAKnrB,EAAO,KAAKw4B,KAAK,KAG1D,IACH+b,EACH,CAAC3qB,EAAOhsB,EAAKutB,GAAU,IAAKvB,EAAO5pB,EAAOmrB,GAAU,KAAMvB,EAAO1sB,EAAOiuB,IAAUqN,KAAK,IACvF,EAGH,IAAK,UACJ,OAAO56B,GAAO,CAAC22C,EAAQr3C,SAEXwB,IAAVxB,GACCiuB,EAAQi0D,UAAsB,OAAVliF,GACpBiuB,EAAQk0D,iBAA6B,KAAVniF,EAErBq3C,EAGM,OAAVr3C,EACI,IAAIq3C,EAAQ,CAAC3qB,EAAOhsB,EAAKutB,GAAU,MAAMqN,KAAK,KAG/C,IAAI+b,EAAQ,CAAC3qB,EAAOhsB,EAAKutB,GAAU,MAAOvB,EAAO1sB,EAAOiuB,IAAUqN,KAAK,KAGhF,IAAK,uBACJ,OAAO56B,GAAO,CAAC22C,EAAQr3C,SAEXwB,IAAVxB,GACCiuB,EAAQi0D,UAAsB,OAAVliF,GACpBiuB,EAAQk0D,iBAA6B,KAAVniF,EAErBq3C,EAGM,OAAVr3C,EACI,IAAIq3C,EAAQ,CAAC3qB,EAAOhsB,EAAKutB,GAAU,UAAUqN,KAAK,KAGnD,IAAI+b,EAAQ,CAAC3qB,EAAOhsB,EAAKutB,GAAU,SAAUvB,EAAO1sB,EAAOiuB,IAAUqN,KAAK,KAGnF,IAAK,QACL,IAAK,YACL,IAAK,oBAAqB,CACzB,MAAM8mD,EAAsC,sBAAxBn0D,EAAQuzD,YAC3B,MACA,IAED,OAAO9gF,GAAO,CAAC22C,EAAQr3C,SAEXwB,IAAVxB,GACCiuB,EAAQi0D,UAAsB,OAAVliF,GACpBiuB,EAAQk0D,iBAA6B,KAAVniF,EAErBq3C,GAIRr3C,EAAkB,OAAVA,EAAiB,GAAKA,EAER,IAAlBq3C,EAAOv2C,OACH,CAAC,CAAC4rB,EAAOhsB,EAAKutB,GAAUm0D,EAAa11D,EAAO1sB,EAAOiuB,IAAUqN,KAAK,KAGnE,CAAC,CAAC+b,EAAQ3qB,EAAO1sB,EAAOiuB,IAAUqN,KAAKrN,EAAQwzD,uBAExD,CAEA,QACC,OAAO/gF,GAAO,CAAC22C,EAAQr3C,SAEXwB,IAAVxB,GACCiuB,EAAQi0D,UAAsB,OAAVliF,GACpBiuB,EAAQk0D,iBAA6B,KAAVniF,EAErBq3C,EAGM,OAAVr3C,EACI,IAAIq3C,EAAQ3qB,EAAOhsB,EAAKutB,IAGzB,IAAIopB,EAAQ,CAAC3qB,EAAOhsB,EAAKutB,GAAU,IAAKvB,EAAO1sB,EAAOiuB,IAAUqN,KAAK,KAGhF,CA6QmB+mD,CAAsBp0D,GAElCq0D,EAAa,CAAC,EAEpB,IAAK,MAAM5hF,KAAOjB,OAAOkrB,KAAKD,GACxBu3D,EAAavhF,KACjB4hF,EAAW5hF,GAAOgqB,EAAOhqB,IAI3B,MAAMiqB,EAAOlrB,OAAOkrB,KAAK23D,GAMzB,OAJqB,IAAjBr0D,EAAQwsC,MACX9vC,EAAK8vC,KAAKxsC,EAAQwsC,MAGZ9vC,EAAKgW,KAAIjgC,IACf,MAAMV,EAAQ0qB,EAAOhqB,GAErB,YAAcc,IAAVxB,EACI,GAGM,OAAVA,EACI0sB,EAAOhsB,EAAKutB,GAGhBnqB,MAAMC,QAAQ/D,GACI,IAAjBA,EAAMc,QAAwC,sBAAxBmtB,EAAQuzD,YAC1B90D,EAAOhsB,EAAKutB,GAAW,KAGxBjuB,EACLmqC,OAAOu3C,EAAUhhF,GAAM,IACvB46B,KAAK,KAGD5O,EAAOhsB,EAAKutB,GAAW,IAAMvB,EAAO1sB,EAAOiuB,EAAQ,IACxDqyB,QAAO1wC,GAAKA,EAAE9O,OAAS,IAAGw6B,KAAK,IAAI,EAGvCl8B,EAAQmjF,SAAW,CAACC,EAAKv0D,KACxBA,EAAUxuB,OAAOy2D,OAAO,CACvBt0B,QAAQ,GACN3T,GAEH,MAAOw0D,EAAMpxD,GAAQsvD,EAAa6B,EAAK,KAEvC,OAAO/iF,OAAOy2D,OACb,CACCssB,IAAKC,EAAKnoE,MAAM,KAAK,IAAM,GAC3BinE,MAAOhmD,EAAM2lD,EAAQsB,GAAMv0D,IAE5BA,GAAWA,EAAQy0D,yBAA2BrxD,EAAO,CAACsxD,mBAAoB/gD,EAAOvQ,EAAMpD,IAAY,CAAC,EACpG,EAGF7uB,EAAQwjF,aAAe,CAACl4D,EAAQuD,KAC/BA,EAAUxuB,OAAOy2D,OAAO,CACvBxpC,QAAQ,EACRisC,QAAQ,EACR,CAACkoB,IAA2B,GAC1B5yD,GAEH,MAAMu0D,EAAMxB,EAAWt2D,EAAO83D,KAAKloE,MAAM,KAAK,IAAM,GAC9CuoE,EAAezjF,EAAQ8hF,QAAQx2D,EAAO83D,KACtCM,EAAqB1jF,EAAQm8B,MAAMsnD,EAAc,CAACpoB,MAAM,IAExD8mB,EAAQ9hF,OAAOy2D,OAAO4sB,EAAoBp4D,EAAO62D,OACvD,IAAIwB,EAAc3jF,EAAQq7B,UAAU8mD,EAAOtzD,GACvC80D,IACHA,EAAc,IAAIA,KAGnB,IAAI1xD,EAlML,SAAiBmxD,GAChB,IAAInxD,EAAO,GACX,MAAM4vD,EAAYuB,EAAI3jE,QAAQ,KAK9B,OAJmB,IAAfoiE,IACH5vD,EAAOmxD,EAAIlmE,MAAM2kE,IAGX5vD,CACR,CA0LY2xD,CAAQt4D,EAAO83D,KAK1B,OAJI93D,EAAOi4D,qBACVtxD,EAAO,IAAIpD,EAAQ4yD,GAA4Bn0D,EAAOhC,EAAOi4D,mBAAoB10D,GAAWvD,EAAOi4D,sBAG7F,GAAGH,IAAMO,IAAc1xD,GAAM,EAGrCjyB,EAAQ6jF,KAAO,CAACxoE,EAAO6lC,EAAQryB,KAC9BA,EAAUxuB,OAAOy2D,OAAO,CACvBwsB,yBAAyB,EACzB,CAAC7B,IAA2B,GAC1B5yD,GAEH,MAAM,IAACu0D,EAAG,MAAEjB,EAAK,mBAAEoB,GAAsBvjF,EAAQmjF,SAAS9nE,EAAOwT,GACjE,OAAO7uB,EAAQwjF,aAAa,CAC3BJ,MACAjB,MAAOX,EAAaW,EAAOjhC,GAC3BqiC,sBACE10D,EAAQ,EAGZ7uB,EAAQ8jF,QAAU,CAACzoE,EAAO6lC,EAAQryB,KACjC,MAAMk1D,EAAkBr/E,MAAMC,QAAQu8C,GAAU5/C,IAAQ4/C,EAAOp9B,SAASxiB,GAAO,CAACA,EAAKV,KAAWsgD,EAAO5/C,EAAKV,GAE5G,OAAOZ,EAAQ6jF,KAAKxoE,EAAO0oE,EAAiBl1D,EAAQ,cCherD7uB,EAAUC,EAAOD,QAAU,EAAjB,KACF+1D,OAAS/1D,EACjBA,EAAQ4uC,SAAW5uC,EACnBA,EAAQ6uC,SAAW,EAAnB,IACA7uC,EAAQ2uC,OAAS,EAAjB,IACA3uC,EAAQ2/B,UAAY,EAApB,IACA3/B,EAAQg2D,YAAc,EAAtB,KACAh2D,EAAQ6mD,SAAW,EAAnB,IACA7mD,EAAQi2D,SAAW,EAAnB,iBCRAj2D,EAAUC,EAAOD,QAAU,EAAjB,MACF+1D,OAAS/1D,EACjBA,EAAQ4uC,SAAW5uC,EACnBA,EAAQ6uC,SAAW,EAAnB,KACA7uC,EAAQ2uC,OAAS,EAAjB,IACA3uC,EAAQ2/B,UAAY,EAApB,KACA3/B,EAAQg2D,YAAc,EAAtB,KACAh2D,EAAQ6mD,SAAW,EAAnB,IACA7mD,EAAQi2D,SAAW,EAAnB,sBCRE,IAagBj8B,EAVhB/5B,EAAOD,SAUSg6B,EAVmB,EAAQ,IAAW,EAAQ,KAAiB,EAAQ,KAAU,EAAQ,IAAa,EAAQ,KAY9H,WAEG,IAAIzjB,EAAIyjB,EAEJgqD,EADQztE,EAAEmkB,IACUspD,YACpB/lD,EAAS1nB,EAAEsoB,KAGXiuB,EAAO,GACPiB,EAAW,GACXk2B,EAAY,GACZC,EAAY,GACZC,EAAY,GACZC,EAAY,GACZC,EAAgB,GAChBC,EAAgB,GAChBC,EAAgB,GAChBC,EAAgB,IAGnB,WAGG,IADA,IAAI9wD,EAAI,GACClvB,EAAI,EAAGA,EAAI,IAAKA,IAEjBkvB,EAAElvB,GADFA,EAAI,IACGA,GAAK,EAEJA,GAAK,EAAK,IAK1B,IAAIgM,EAAI,EACJy9C,EAAK,EACT,IAASzpD,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAE1B,IAAI0pD,EAAKD,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EACzDC,EAAMA,IAAO,EAAW,IAALA,EAAa,GAChCpB,EAAKt8C,GAAK09C,EACVH,EAASG,GAAM19C,EAGf,IAAI2G,EAAKuc,EAAEljB,GACP29C,EAAKz6B,EAAEvc,GACPi3C,EAAK16B,EAAEy6B,GAGPtlD,EAAa,IAAR6qB,EAAEw6B,GAAqB,SAALA,EAC3B+1B,EAAUzzE,GAAM3H,GAAK,GAAOA,IAAM,EAClCq7E,EAAU1zE,GAAM3H,GAAK,GAAOA,IAAM,GAClCs7E,EAAU3zE,GAAM3H,GAAK,EAAOA,IAAM,GAClCu7E,EAAU5zE,GAAK3H,EAGXA,EAAU,SAALulD,EAAwB,MAALD,EAAsB,IAALh3C,EAAmB,SAAJ3G,EAC5D6zE,EAAcn2B,GAAOrlD,GAAK,GAAOA,IAAM,EACvCy7E,EAAcp2B,GAAOrlD,GAAK,GAAOA,IAAM,GACvC07E,EAAcr2B,GAAOrlD,GAAK,EAAOA,IAAM,GACvC27E,EAAct2B,GAAMrlD,EAGf2H,GAGDA,EAAI2G,EAAKuc,EAAEA,EAAEA,EAAE06B,EAAKj3C,KACpB82C,GAAMv6B,EAAEA,EAAEu6B,KAHVz9C,EAAIy9C,EAAK,CAKjB,CACJ,CAhDA,GAmDA,IAAIJ,EAAO,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IAKpEQ,EAAMpwB,EAAOowB,IAAM21B,EAAYrpD,OAAO,CACtCyD,SAAU,WAIN,IAAIp7B,KAAK8rD,UAAY9rD,KAAKyhF,iBAAmBzhF,KAAKyjD,KAAlD,CAiBA,IAZA,IAAInlD,EAAM0B,KAAKyhF,eAAiBzhF,KAAKyjD,KACjC+H,EAAWltD,EAAI4B,MACfqrD,EAAUjtD,EAAI45B,SAAW,EAMzBuzB,EAAyB,IAHfzrD,KAAK8rD,SAAWP,EAAU,GAGhB,GAGpB3B,EAAc5pD,KAAK+rD,aAAe,GAC7BnB,EAAQ,EAAGA,EAAQa,EAAQb,IAC5BA,EAAQW,EACR3B,EAAYgB,GAASY,EAASZ,IAE9B/kD,EAAI+jD,EAAYgB,EAAQ,GAElBA,EAAQW,EASHA,EAAU,GAAKX,EAAQW,GAAW,IAEzC1lD,EAAKikD,EAAKjkD,IAAM,KAAO,GAAOikD,EAAMjkD,IAAM,GAAM,MAAS,GAAOikD,EAAMjkD,IAAM,EAAK,MAAS,EAAKikD,EAAS,IAAJjkD,KANpGA,EAAKikD,GAHLjkD,EAAKA,GAAK,EAAMA,IAAM,MAGN,KAAO,GAAOikD,EAAMjkD,IAAM,GAAM,MAAS,GAAOikD,EAAMjkD,IAAM,EAAK,MAAS,EAAKikD,EAAS,IAAJjkD,GAGpGA,GAAKglD,EAAMD,EAAQW,EAAW,IAAM,IAMxC3B,EAAYgB,GAAShB,EAAYgB,EAAQW,GAAW1lD,GAM5D,IADA,IAAI6lD,EAAiB1rD,KAAKgsD,gBAAkB,GACnC01B,EAAW,EAAGA,EAAWj2B,EAAQi2B,IAAY,CAGlD,GAFI92B,EAAQa,EAASi2B,EAEjBA,EAAW,EACX,IAAI77E,EAAI+jD,EAAYgB,QAEhB/kD,EAAI+jD,EAAYgB,EAAQ,GAI5Bc,EAAeg2B,GADfA,EAAW,GAAK92B,GAAS,EACE/kD,EAEAw7E,EAAcv3B,EAAKjkD,IAAM,KAAOy7E,EAAcx3B,EAAMjkD,IAAM,GAAM,MAChE07E,EAAcz3B,EAAMjkD,IAAM,EAAK,MAAS27E,EAAc13B,EAAS,IAAJjkD,GAE9F,CAxDA,CAyDJ,EAEAqmD,aAAc,SAAUhJ,EAAG7lC,GACvBrd,KAAK2hF,cAAcz+B,EAAG7lC,EAAQrd,KAAK+rD,aAAck1B,EAAWC,EAAWC,EAAWC,EAAWt3B,EACjG,EAEAqC,aAAc,SAAUjJ,EAAG7lC,GAEvB,IAAIxX,EAAIq9C,EAAE7lC,EAAS,GACnB6lC,EAAE7lC,EAAS,GAAK6lC,EAAE7lC,EAAS,GAC3B6lC,EAAE7lC,EAAS,GAAKxX,EAEhB7F,KAAK2hF,cAAcz+B,EAAG7lC,EAAQrd,KAAKgsD,gBAAiBq1B,EAAeC,EAAeC,EAAeC,EAAez2B,GAG5GllD,EAAIq9C,EAAE7lC,EAAS,GACnB6lC,EAAE7lC,EAAS,GAAK6lC,EAAE7lC,EAAS,GAC3B6lC,EAAE7lC,EAAS,GAAKxX,CACpB,EAEA87E,cAAe,SAAUz+B,EAAG7lC,EAAQusC,EAAaq3B,EAAWC,EAAWC,EAAWC,EAAWt3B,GAczF,IAZA,IAAIC,EAAU/pD,KAAK8rD,SAGftB,EAAKtH,EAAE7lC,GAAcusC,EAAY,GACjCa,EAAKvH,EAAE7lC,EAAS,GAAKusC,EAAY,GACjCc,EAAKxH,EAAE7lC,EAAS,GAAKusC,EAAY,GACjCe,EAAKzH,EAAE7lC,EAAS,GAAKusC,EAAY,GAGjCgB,EAAQ,EAGH96C,EAAQ,EAAGA,EAAQi6C,EAASj6C,IAAS,CAE1C,IAAIk6C,EAAKi3B,EAAUz2B,IAAO,IAAM02B,EAAWz2B,IAAO,GAAM,KAAQ02B,EAAWz2B,IAAO,EAAK,KAAQ02B,EAAe,IAALz2B,GAAaf,EAAYgB,KAC9HX,EAAKg3B,EAAUx2B,IAAO,IAAMy2B,EAAWx2B,IAAO,GAAM,KAAQy2B,EAAWx2B,IAAO,EAAK,KAAQy2B,EAAe,IAAL52B,GAAaZ,EAAYgB,KAC9HV,EAAK+2B,EAAUv2B,IAAO,IAAMw2B,EAAWv2B,IAAO,GAAM,KAAQw2B,EAAW32B,IAAO,EAAK,KAAQ42B,EAAe,IAAL32B,GAAab,EAAYgB,KAC9HT,EAAK82B,EAAUt2B,IAAO,IAAMu2B,EAAW12B,IAAO,GAAM,KAAQ22B,EAAW12B,IAAO,EAAK,KAAQ22B,EAAe,IAAL12B,GAAad,EAAYgB,KAGlIJ,EAAKR,EACLS,EAAKR,EACLS,EAAKR,EACLS,EAAKR,CACT,CAGIH,GAAOF,EAAKU,IAAO,KAAO,GAAOV,EAAMW,IAAO,GAAM,MAAS,GAAOX,EAAMY,IAAO,EAAK,MAAS,EAAKZ,EAAU,IAALa,IAAcf,EAAYgB,KACnIX,GAAOH,EAAKW,IAAO,KAAO,GAAOX,EAAMY,IAAO,GAAM,MAAS,GAAOZ,EAAMa,IAAO,EAAK,MAAS,EAAKb,EAAU,IAALU,IAAcZ,EAAYgB,KACnIV,GAAOJ,EAAKY,IAAO,KAAO,GAAOZ,EAAMa,IAAO,GAAM,MAAS,GAAOb,EAAMU,IAAO,EAAK,MAAS,EAAKV,EAAU,IAALW,IAAcb,EAAYgB,KACnIT,GAAOL,EAAKa,IAAO,KAAO,GAAOb,EAAMU,IAAO,GAAM,MAAS,GAAOV,EAAMW,IAAO,EAAK,MAAS,EAAKX,EAAU,IAALY,IAAcd,EAAYgB,KAGvI1H,EAAE7lC,GAAc2sC,EAChB9G,EAAE7lC,EAAS,GAAK4sC,EAChB/G,EAAE7lC,EAAS,GAAK6sC,EAChBhH,EAAE7lC,EAAS,GAAK8sC,CACpB,EAEAoB,QAAS,IAWbh4C,EAAE83C,IAAM21B,EAAYvlD,cAAc4vB,EACtC,CArNA,GAwNOr0B,EAASq0B,sBCvOf,IAagBr0B,EAITzjB,EAEA0kB,EAhBPh7B,EAAOD,SAUSg6B,EAVmB,EAAQ,IAgBpCiB,GAFA1kB,EAAIyjB,GACMU,IACQO,UACV1kB,EAAE0c,IAKK2xD,OAAS,CAcxBvpD,UAAW,SAAUC,GAEjB,IAAIp4B,EAAQo4B,EAAUp4B,MAClBg4B,EAAWI,EAAUJ,SACrBqG,EAAMv+B,KAAK6hF,KAGfvpD,EAAUK,QAIV,IADA,IAAImpD,EAAc,GACTtgF,EAAI,EAAGA,EAAI02B,EAAU12B,GAAK,EAO/B,IANA,IAIIugF,GAJS7hF,EAAMsB,IAAM,KAAc,GAAMA,EAAI,EAAK,EAAY,MAI1C,IAHXtB,EAAOsB,EAAI,IAAO,KAAQ,IAAOA,EAAI,GAAK,EAAK,EAAM,MAG1B,EAF3BtB,EAAOsB,EAAI,IAAO,KAAQ,IAAOA,EAAI,GAAK,EAAK,EAAM,IAIzDgB,EAAI,EAAIA,EAAI,GAAOhB,EAAQ,IAAJgB,EAAW01B,EAAW11B,IAClDs/E,EAAY9jE,KAAKugB,EAAIvV,OAAQ+4D,IAAa,GAAK,EAAIv/E,GAAO,KAKlE,IAAIw/E,EAAczjD,EAAIvV,OAAO,IAC7B,GAAIg5D,EACA,KAAOF,EAAYpjF,OAAS,GACxBojF,EAAY9jE,KAAKgkE,GAIzB,OAAOF,EAAY5oD,KAAK,GAC5B,EAeAC,MAAO,SAAU8oD,GAEb,IAAIC,EAAkBD,EAAUvjF,OAC5B6/B,EAAMv+B,KAAK6hF,KACXM,EAAaniF,KAAKoiF,YAEtB,IAAKD,EAAY,CACTA,EAAaniF,KAAKoiF,YAAc,GAChC,IAAK,IAAI5/E,EAAI,EAAGA,EAAI+7B,EAAI7/B,OAAQ8D,IAC5B2/E,EAAW5jD,EAAI39B,WAAW4B,IAAMA,CAE5C,CAGA,IAAIw/E,EAAczjD,EAAIvV,OAAO,IAC7B,GAAIg5D,EAAa,CACb,IAAIK,EAAeJ,EAAUxlE,QAAQulE,IACf,IAAlBK,IACAH,EAAkBG,EAE1B,CAGA,OAOR,SAAmBJ,EAAWC,EAAiBC,GAG7C,IAFA,IAAIjiF,EAAQ,GACR44B,EAAS,EACJt3B,EAAI,EAAGA,EAAI0gF,EAAiB1gF,IACjC,GAAIA,EAAI,EAAG,CACP,IAEI8gF,EAFQH,EAAWF,EAAUrhF,WAAWY,EAAI,KAASA,EAAI,EAAK,EACtD2gF,EAAWF,EAAUrhF,WAAWY,MAAS,EAAKA,EAAI,EAAK,EAEnEtB,EAAM44B,IAAW,IAAMwpD,GAAiB,GAAMxpD,EAAS,EAAK,EAC5DA,GACJ,CAEJ,OAAOb,EAAU36B,OAAO4C,EAAO44B,EACjC,CApBeypD,CAAUN,EAAWC,EAAiBC,EAEjD,EAEAN,KAAM,qEAoBP7qD,EAAS/G,IAAI2xD,yBCrInB,IAagB5qD,EAVhB/5B,EAAOD,SAUSg6B,EAVmB,EAAQ,IAY3C,SAAU11B,GAEP,IAAIiS,EAAIyjB,EACJS,EAAQlkB,EAAEmkB,IACVO,EAAYR,EAAMQ,UAClBiD,EAASzD,EAAMyD,OACfD,EAAS1nB,EAAEsoB,KAGX4yC,EAAI,IAGP,WACG,IAAK,IAAIjtE,EAAI,EAAGA,EAAI,GAAIA,IACpBitE,EAAEjtE,GAAkC,WAA5BF,EAAK8E,IAAI9E,EAAKwN,IAAItN,EAAI,IAAqB,CAE3D,CAJA,GASA,IAAI06B,EAAMjB,EAAOiB,IAAMhB,EAAOvD,OAAO,CACjCyD,SAAU,WACNp7B,KAAKs8B,MAAQ,IAAIrE,EAAUpF,KAAK,CAC5B,WAAY,WACZ,WAAY,WAEpB,EAEAkI,gBAAiB,SAAUmoB,EAAG7lC,GAE1B,IAAK,IAAI7b,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,IAAIghF,EAAWnlE,EAAS7b,EACpBihF,EAAav/B,EAAEs/B,GAEnBt/B,EAAEs/B,GACgD,UAA3CC,GAAc,EAAOA,IAAe,IACO,YAA3CA,GAAc,GAAOA,IAAe,EAE/C,CAGA,IAAInY,EAAItqE,KAAKs8B,MAAMp8B,MAEfwiF,EAAcx/B,EAAE7lC,EAAS,GACzBslE,EAAcz/B,EAAE7lC,EAAS,GACzBulE,EAAc1/B,EAAE7lC,EAAS,GACzBwlE,EAAc3/B,EAAE7lC,EAAS,GACzBylE,EAAc5/B,EAAE7lC,EAAS,GACzB0lE,EAAc7/B,EAAE7lC,EAAS,GACzB2lE,EAAc9/B,EAAE7lC,EAAS,GACzB4lE,EAAc//B,EAAE7lC,EAAS,GACzB6lE,EAAchgC,EAAE7lC,EAAS,GACzB8lE,EAAcjgC,EAAE7lC,EAAS,GACzB+lE,EAAclgC,EAAE7lC,EAAS,IACzBgmE,EAAcngC,EAAE7lC,EAAS,IACzBimE,EAAcpgC,EAAE7lC,EAAS,IACzBkmE,EAAcrgC,EAAE7lC,EAAS,IACzBmmE,EAActgC,EAAE7lC,EAAS,IACzBomE,EAAcvgC,EAAE7lC,EAAS,IAGzBrZ,EAAIsmE,EAAE,GACNrmE,EAAIqmE,EAAE,GACN3pE,EAAI2pE,EAAE,GACN55C,EAAI45C,EAAE,GAGVtmE,EAAI0/E,EAAG1/E,EAAGC,EAAGtD,EAAG+vB,EAAGgyD,EAAa,EAAIjU,EAAE,IACtC/9C,EAAIgzD,EAAGhzD,EAAG1sB,EAAGC,EAAGtD,EAAGgiF,EAAa,GAAIlU,EAAE,IACtC9tE,EAAI+iF,EAAG/iF,EAAG+vB,EAAG1sB,EAAGC,EAAG2+E,EAAa,GAAInU,EAAE,IACtCxqE,EAAIy/E,EAAGz/E,EAAGtD,EAAG+vB,EAAG1sB,EAAG6+E,EAAa,GAAIpU,EAAE,IACtCzqE,EAAI0/E,EAAG1/E,EAAGC,EAAGtD,EAAG+vB,EAAGoyD,EAAa,EAAIrU,EAAE,IACtC/9C,EAAIgzD,EAAGhzD,EAAG1sB,EAAGC,EAAGtD,EAAGoiF,EAAa,GAAItU,EAAE,IACtC9tE,EAAI+iF,EAAG/iF,EAAG+vB,EAAG1sB,EAAGC,EAAG++E,EAAa,GAAIvU,EAAE,IACtCxqE,EAAIy/E,EAAGz/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGi/E,EAAa,GAAIxU,EAAE,IACtCzqE,EAAI0/E,EAAG1/E,EAAGC,EAAGtD,EAAG+vB,EAAGwyD,EAAa,EAAIzU,EAAE,IACtC/9C,EAAIgzD,EAAGhzD,EAAG1sB,EAAGC,EAAGtD,EAAGwiF,EAAa,GAAI1U,EAAE,IACtC9tE,EAAI+iF,EAAG/iF,EAAG+vB,EAAG1sB,EAAGC,EAAGm/E,EAAa,GAAI3U,EAAE,KACtCxqE,EAAIy/E,EAAGz/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGq/E,EAAa,GAAI5U,EAAE,KACtCzqE,EAAI0/E,EAAG1/E,EAAGC,EAAGtD,EAAG+vB,EAAG4yD,EAAa,EAAI7U,EAAE,KACtC/9C,EAAIgzD,EAAGhzD,EAAG1sB,EAAGC,EAAGtD,EAAG4iF,EAAa,GAAI9U,EAAE,KACtC9tE,EAAI+iF,EAAG/iF,EAAG+vB,EAAG1sB,EAAGC,EAAGu/E,EAAa,GAAI/U,EAAE,KAGtCzqE,EAAI2/E,EAAG3/E,EAFPC,EAAIy/E,EAAGz/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGy/E,EAAa,GAAIhV,EAAE,KAEzB9tE,EAAG+vB,EAAGiyD,EAAa,EAAIlU,EAAE,KACtC/9C,EAAIizD,EAAGjzD,EAAG1sB,EAAGC,EAAGtD,EAAGqiF,EAAa,EAAIvU,EAAE,KACtC9tE,EAAIgjF,EAAGhjF,EAAG+vB,EAAG1sB,EAAGC,EAAGo/E,EAAa,GAAI5U,EAAE,KACtCxqE,EAAI0/E,EAAG1/E,EAAGtD,EAAG+vB,EAAG1sB,EAAG0+E,EAAa,GAAIjU,EAAE,KACtCzqE,EAAI2/E,EAAG3/E,EAAGC,EAAGtD,EAAG+vB,EAAGqyD,EAAa,EAAItU,EAAE,KACtC/9C,EAAIizD,EAAGjzD,EAAG1sB,EAAGC,EAAGtD,EAAGyiF,EAAa,EAAI3U,EAAE,KACtC9tE,EAAIgjF,EAAGhjF,EAAG+vB,EAAG1sB,EAAGC,EAAGw/E,EAAa,GAAIhV,EAAE,KACtCxqE,EAAI0/E,EAAG1/E,EAAGtD,EAAG+vB,EAAG1sB,EAAG8+E,EAAa,GAAIrU,EAAE,KACtCzqE,EAAI2/E,EAAG3/E,EAAGC,EAAGtD,EAAG+vB,EAAGyyD,EAAa,EAAI1U,EAAE,KACtC/9C,EAAIizD,EAAGjzD,EAAG1sB,EAAGC,EAAGtD,EAAG6iF,EAAa,EAAI/U,EAAE,KACtC9tE,EAAIgjF,EAAGhjF,EAAG+vB,EAAG1sB,EAAGC,EAAG4+E,EAAa,GAAIpU,EAAE,KACtCxqE,EAAI0/E,EAAG1/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGk/E,EAAa,GAAIzU,EAAE,KACtCzqE,EAAI2/E,EAAG3/E,EAAGC,EAAGtD,EAAG+vB,EAAG6yD,EAAa,EAAI9U,EAAE,KACtC/9C,EAAIizD,EAAGjzD,EAAG1sB,EAAGC,EAAGtD,EAAGiiF,EAAa,EAAInU,EAAE,KACtC9tE,EAAIgjF,EAAGhjF,EAAG+vB,EAAG1sB,EAAGC,EAAGg/E,EAAa,GAAIxU,EAAE,KAGtCzqE,EAAI4/E,EAAG5/E,EAFPC,EAAI0/E,EAAG1/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGs/E,EAAa,GAAI7U,EAAE,KAEzB9tE,EAAG+vB,EAAGqyD,EAAa,EAAItU,EAAE,KACtC/9C,EAAIkzD,EAAGlzD,EAAG1sB,EAAGC,EAAGtD,EAAGuiF,EAAa,GAAIzU,EAAE,KACtC9tE,EAAIijF,EAAGjjF,EAAG+vB,EAAG1sB,EAAGC,EAAGo/E,EAAa,GAAI5U,EAAE,KACtCxqE,EAAI2/E,EAAG3/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGw/E,EAAa,GAAI/U,EAAE,KACtCzqE,EAAI4/E,EAAG5/E,EAAGC,EAAGtD,EAAG+vB,EAAGiyD,EAAa,EAAIlU,EAAE,KACtC/9C,EAAIkzD,EAAGlzD,EAAG1sB,EAAGC,EAAGtD,EAAGmiF,EAAa,GAAIrU,EAAE,KACtC9tE,EAAIijF,EAAGjjF,EAAG+vB,EAAG1sB,EAAGC,EAAGg/E,EAAa,GAAIxU,EAAE,KACtCxqE,EAAI2/E,EAAG3/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGo/E,EAAa,GAAI3U,EAAE,KACtCzqE,EAAI4/E,EAAG5/E,EAAGC,EAAGtD,EAAG+vB,EAAG6yD,EAAa,EAAI9U,EAAE,KACtC/9C,EAAIkzD,EAAGlzD,EAAG1sB,EAAGC,EAAGtD,EAAG+hF,EAAa,GAAIjU,EAAE,KACtC9tE,EAAIijF,EAAGjjF,EAAG+vB,EAAG1sB,EAAGC,EAAG4+E,EAAa,GAAIpU,EAAE,KACtCxqE,EAAI2/E,EAAG3/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGg/E,EAAa,GAAIvU,EAAE,KACtCzqE,EAAI4/E,EAAG5/E,EAAGC,EAAGtD,EAAG+vB,EAAGyyD,EAAa,EAAI1U,EAAE,KACtC/9C,EAAIkzD,EAAGlzD,EAAG1sB,EAAGC,EAAGtD,EAAG2iF,EAAa,GAAI7U,EAAE,KACtC9tE,EAAIijF,EAAGjjF,EAAG+vB,EAAG1sB,EAAGC,EAAGw/E,EAAa,GAAIhV,EAAE,KAGtCzqE,EAAI6/E,EAAG7/E,EAFPC,EAAI2/E,EAAG3/E,EAAGtD,EAAG+vB,EAAG1sB,EAAG4+E,EAAa,GAAInU,EAAE,KAEzB9tE,EAAG+vB,EAAGgyD,EAAa,EAAIjU,EAAE,KACtC/9C,EAAImzD,EAAGnzD,EAAG1sB,EAAGC,EAAGtD,EAAGsiF,EAAa,GAAIxU,EAAE,KACtC9tE,EAAIkjF,EAAGljF,EAAG+vB,EAAG1sB,EAAGC,EAAGu/E,EAAa,GAAI/U,EAAE,KACtCxqE,EAAI4/E,EAAG5/E,EAAGtD,EAAG+vB,EAAG1sB,EAAG++E,EAAa,GAAItU,EAAE,KACtCzqE,EAAI6/E,EAAG7/E,EAAGC,EAAGtD,EAAG+vB,EAAG4yD,EAAa,EAAI7U,EAAE,KACtC/9C,EAAImzD,EAAGnzD,EAAG1sB,EAAGC,EAAGtD,EAAGkiF,EAAa,GAAIpU,EAAE,KACtC9tE,EAAIkjF,EAAGljF,EAAG+vB,EAAG1sB,EAAGC,EAAGm/E,EAAa,GAAI3U,EAAE,KACtCxqE,EAAI4/E,EAAG5/E,EAAGtD,EAAG+vB,EAAG1sB,EAAG2+E,EAAa,GAAIlU,EAAE,KACtCzqE,EAAI6/E,EAAG7/E,EAAGC,EAAGtD,EAAG+vB,EAAGwyD,EAAa,EAAIzU,EAAE,KACtC/9C,EAAImzD,EAAGnzD,EAAG1sB,EAAGC,EAAGtD,EAAG8iF,EAAa,GAAIhV,EAAE,KACtC9tE,EAAIkjF,EAAGljF,EAAG+vB,EAAG1sB,EAAGC,EAAG++E,EAAa,GAAIvU,EAAE,KACtCxqE,EAAI4/E,EAAG5/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGu/E,EAAa,GAAI9U,EAAE,KACtCzqE,EAAI6/E,EAAG7/E,EAAGC,EAAGtD,EAAG+vB,EAAGoyD,EAAa,EAAIrU,EAAE,KACtC/9C,EAAImzD,EAAGnzD,EAAG1sB,EAAGC,EAAGtD,EAAG0iF,EAAa,GAAI5U,EAAE,KACtC9tE,EAAIkjF,EAAGljF,EAAG+vB,EAAG1sB,EAAGC,EAAG2+E,EAAa,GAAInU,EAAE,KACtCxqE,EAAI4/E,EAAG5/E,EAAGtD,EAAG+vB,EAAG1sB,EAAGm/E,EAAa,GAAI1U,EAAE,KAGtCnE,EAAE,GAAMA,EAAE,GAAKtmE,EAAK,EACpBsmE,EAAE,GAAMA,EAAE,GAAKrmE,EAAK,EACpBqmE,EAAE,GAAMA,EAAE,GAAK3pE,EAAK,EACpB2pE,EAAE,GAAMA,EAAE,GAAK55C,EAAK,CACxB,EAEA8K,YAAa,WAET,IAAIrgB,EAAOnb,KAAKk6B,MACZM,EAAYrf,EAAKjb,MAEjB4jF,EAAgC,EAAnB9jF,KAAKm6B,YAClB4pD,EAA4B,EAAhB5oE,EAAK+c,SAGrBsC,EAAUupD,IAAc,IAAM,KAAS,GAAKA,EAAY,GAExD,IAAIC,EAAc1iF,EAAKylB,MAAM+8D,EAAa,YACtCG,EAAcH,EAClBtpD,EAA4C,IAA/BupD,EAAY,KAAQ,GAAM,IACa,UAA7CC,GAAe,EAAOA,IAAgB,IACO,YAA7CA,GAAe,GAAOA,IAAgB,GAE7CxpD,EAA4C,IAA/BupD,EAAY,KAAQ,GAAM,IACa,UAA7CE,GAAe,EAAOA,IAAgB,IACO,YAA7CA,GAAe,GAAOA,IAAgB,GAG7C9oE,EAAK+c,SAAoC,GAAxBsC,EAAU97B,OAAS,GAGpCsB,KAAKq6B,WAOL,IAJA,IAAIpL,EAAOjvB,KAAKs8B,MACZguC,EAAIr7C,EAAK/uB,MAGJsB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAExB,IAAI0iF,EAAM5Z,EAAE9oE,GAEZ8oE,EAAE9oE,GAAqC,UAA7B0iF,GAAO,EAAOA,IAAQ,IACO,YAA7BA,GAAO,GAAOA,IAAQ,EACpC,CAGA,OAAOj1D,CACX,EAEA3rB,MAAO,WACH,IAAIA,EAAQ43B,EAAO53B,MAAMgU,KAAKtX,MAG9B,OAFAsD,EAAMg5B,MAAQt8B,KAAKs8B,MAAMh5B,QAElBA,CACX,IAGJ,SAASogF,EAAG1/E,EAAGC,EAAGtD,EAAG+vB,EAAGljB,EAAGiB,EAAG5I,GAC1B,IAAI2J,EAAIxL,GAAMC,EAAItD,GAAOsD,EAAIysB,GAAMljB,EAAI3H,EACvC,OAAS2J,GAAKf,EAAMe,IAAO,GAAKf,GAAOxK,CAC3C,CAEA,SAAS0/E,EAAG3/E,EAAGC,EAAGtD,EAAG+vB,EAAGljB,EAAGiB,EAAG5I,GAC1B,IAAI2J,EAAIxL,GAAMC,EAAIysB,EAAM/vB,GAAK+vB,GAAMljB,EAAI3H,EACvC,OAAS2J,GAAKf,EAAMe,IAAO,GAAKf,GAAOxK,CAC3C,CAEA,SAAS2/E,EAAG5/E,EAAGC,EAAGtD,EAAG+vB,EAAGljB,EAAGiB,EAAG5I,GAC1B,IAAI2J,EAAIxL,GAAKC,EAAItD,EAAI+vB,GAAKljB,EAAI3H,EAC9B,OAAS2J,GAAKf,EAAMe,IAAO,GAAKf,GAAOxK,CAC3C,CAEA,SAAS4/E,EAAG7/E,EAAGC,EAAGtD,EAAG+vB,EAAGljB,EAAGiB,EAAG5I,GAC1B,IAAI2J,EAAIxL,GAAKrD,GAAKsD,GAAKysB,IAAMljB,EAAI3H,EACjC,OAAS2J,GAAKf,EAAMe,IAAO,GAAKf,GAAOxK,CAC3C,CAgBAsP,EAAE2oB,IAAMhB,EAAOO,cAAcS,GAgB7B3oB,EAAE4wE,QAAUjpD,EAAOS,kBAAkBO,EACzC,CAvPA,CAuPE56B,MAGK01B,EAASkF,sBCzQf,IAiBO3oB,EACAkkB,EACAQ,EACAiD,EACAD,EAGAshC,EAKA6nB,EAhBSptD,EAVhB/5B,EAAOD,SAeAy6B,GADAlkB,EAJSyjB,EAVmB,EAAQ,KAe1BU,IACVO,EAAYR,EAAMQ,UAClBiD,EAASzD,EAAMyD,OACfD,EAAS1nB,EAAEsoB,KAGX0gC,EAAI,GAKJ6nB,EAAOnpD,EAAOmpD,KAAOlpD,EAAOvD,OAAO,CACnCyD,SAAU,WACNp7B,KAAKs8B,MAAQ,IAAIrE,EAAUpF,KAAK,CAC5B,WAAY,WACZ,WAAY,UACZ,YAER,EAEAkI,gBAAiB,SAAUmoB,EAAG7lC,GAY1B,IAVA,IAAIitD,EAAItqE,KAAKs8B,MAAMp8B,MAGf8D,EAAIsmE,EAAE,GACNrmE,EAAIqmE,EAAE,GACN3pE,EAAI2pE,EAAE,GACN55C,EAAI45C,EAAE,GACN/pE,EAAI+pE,EAAE,GAGD9oE,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,GAAIA,EAAI,GACJ+6D,EAAE/6D,GAAqB,EAAhB0hD,EAAE7lC,EAAS7b,OACf,CACH,IAAIgO,EAAI+sD,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,IAAM+6D,EAAE/6D,EAAI,IAChD+6D,EAAE/6D,GAAMgO,GAAK,EAAMA,IAAM,EAC7B,CAEA,IAAI3J,GAAM7B,GAAK,EAAMA,IAAM,IAAOzD,EAAIg8D,EAAE/6D,GAEpCqE,GADArE,EAAI,GACwB,YAArByC,EAAItD,GAAOsD,EAAIysB,GACflvB,EAAI,GACQ,YAAbyC,EAAItD,EAAI+vB,GACPlvB,EAAI,IACJyC,EAAItD,EAAMsD,EAAIysB,EAAM/vB,EAAI+vB,GAAM,YAE/BzsB,EAAItD,EAAI+vB,GAAK,UAGvBnwB,EAAImwB,EACJA,EAAI/vB,EACJA,EAAKsD,GAAK,GAAOA,IAAM,EACvBA,EAAID,EACJA,EAAI6B,CACR,CAGAykE,EAAE,GAAMA,EAAE,GAAKtmE,EAAK,EACpBsmE,EAAE,GAAMA,EAAE,GAAKrmE,EAAK,EACpBqmE,EAAE,GAAMA,EAAE,GAAK3pE,EAAK,EACpB2pE,EAAE,GAAMA,EAAE,GAAK55C,EAAK,EACpB45C,EAAE,GAAMA,EAAE,GAAK/pE,EAAK,CACxB,EAEAi7B,YAAa,WAET,IAAIrgB,EAAOnb,KAAKk6B,MACZM,EAAYrf,EAAKjb,MAEjB4jF,EAAgC,EAAnB9jF,KAAKm6B,YAClB4pD,EAA4B,EAAhB5oE,EAAK+c,SAYrB,OATAsC,EAAUupD,IAAc,IAAM,KAAS,GAAKA,EAAY,GACxDvpD,EAA4C,IAA/BupD,EAAY,KAAQ,GAAM,IAAWziF,KAAKylB,MAAM+8D,EAAa,YAC1EtpD,EAA4C,IAA/BupD,EAAY,KAAQ,GAAM,IAAWD,EAClD3oE,EAAK+c,SAA8B,EAAnBsC,EAAU97B,OAG1BsB,KAAKq6B,WAGEr6B,KAAKs8B,KAChB,EAEAh5B,MAAO,WACH,IAAIA,EAAQ43B,EAAO53B,MAAMgU,KAAKtX,MAG9B,OAFAsD,EAAMg5B,MAAQt8B,KAAKs8B,MAAMh5B,QAElBA,CACX,IAiBJiQ,EAAE6wE,KAAOlpD,EAAOO,cAAc2oD,GAgB9B7wE,EAAE8wE,SAAWnpD,EAAOS,kBAAkByoD,GAInCptD,EAASotD,uBCnJf,IAiBO7wE,EAEA+S,EAEAoT,EAlBPz8B,EAAOD,SAgBAspB,GAFA/S,EAd4B,EAAQ,KAe1BmkB,IACGpR,KAEboT,EADQnmB,EAAE0c,IACGyJ,UACJnmB,EAAEsoB,KAKGD,KAAOtV,EAAKqR,OAAO,CAWjC9E,KAAM,SAAU6I,EAAQp9B,GAEpBo9B,EAAS17B,KAAKskF,QAAU,IAAI5oD,EAAO7I,KAGjB,iBAAPv0B,IACPA,EAAMo7B,EAAKP,MAAM76B,IAIrB,IAAIimF,EAAkB7oD,EAAOhB,UACzB8pD,EAAyC,EAAlBD,EAGvBjmF,EAAI45B,SAAWssD,IACflmF,EAAMo9B,EAAOH,SAASj9B,IAI1BA,EAAIq6B,QAWJ,IARA,IAAI8rD,EAAOzkF,KAAK0kF,MAAQpmF,EAAIgF,QACxBqhF,EAAO3kF,KAAK4kF,MAAQtmF,EAAIgF,QAGxBuhF,EAAYJ,EAAKvkF,MACjB4kF,EAAYH,EAAKzkF,MAGZsB,EAAI,EAAGA,EAAI+iF,EAAiB/iF,IACjCqjF,EAAUrjF,IAAM,WAChBsjF,EAAUtjF,IAAM,UAEpBijF,EAAKvsD,SAAWysD,EAAKzsD,SAAWssD,EAGhCxkF,KAAKi6B,OACT,EASAA,MAAO,WAEH,IAAIyB,EAAS17B,KAAKskF,QAGlB5oD,EAAOzB,QACPyB,EAAOL,OAAOr7B,KAAK4kF,MACvB,EAcAvpD,OAAQ,SAAUC,GAId,OAHAt7B,KAAKskF,QAAQjpD,OAAOC,GAGbt7B,IACX,EAgBAu7B,SAAU,SAAUD,GAEhB,IAAII,EAAS17B,KAAKskF,QAGdS,EAAYrpD,EAAOH,SAASD,GAIhC,OAHAI,EAAOzB,QACIyB,EAAOH,SAASv7B,KAAK0kF,MAAMphF,QAAQyc,OAAOglE,GAGzD,uBCzIP,IAagB/tD,EAOTzjB,EACAkkB,EACAnR,EACA2R,EACA+B,EACAjB,EAEA6oD,EAEAlvB,EAUAlM,EA+LAw+B,EAKAC,EAoDAh8B,EAkGAi8B,EA+IAC,EAoDAC,EAsEAC,EAkHAC,EAwCAC,EAjyBPtoF,EAAOD,SAUSg6B,EAVmB,EAAQ,IAAW,EAAQ,SAe/DA,EAASU,IAAI8uB,SAELjzC,EAAIyjB,EACJS,EAAQlkB,EAAEmkB,IACVpR,EAAOmR,EAAMnR,KACb2R,EAAYR,EAAMQ,UAClB+B,EAAyBvC,EAAMuC,uBAC/BjB,EAAQxlB,EAAE0c,IACH8I,EAAMW,KACbkoD,EAAS7oD,EAAM6oD,OAEflvB,EADSn/C,EAAEsoB,KACK62B,OAUhBlM,EAAS/uB,EAAM+uB,OAASxsB,EAAuBrC,OAAO,CAMtDwD,IAAK7U,EAAKqR,SAgBV6tD,gBAAiB,SAAUlnF,EAAK68B,GAC5B,OAAOn7B,KAAK1C,OAAO0C,KAAKylF,gBAAiBnnF,EAAK68B,EAClD,EAgBAuqD,gBAAiB,SAAUpnF,EAAK68B,GAC5B,OAAOn7B,KAAK1C,OAAO0C,KAAK2lF,gBAAiBrnF,EAAK68B,EAClD,EAaAtI,KAAM,SAAU+yD,EAAWtnF,EAAK68B,GAE5Bn7B,KAAKm7B,IAAMn7B,KAAKm7B,IAAIxD,OAAOwD,GAG3Bn7B,KAAK6lF,WAAaD,EAClB5lF,KAAKyjD,KAAOnlD,EAGZ0B,KAAKi6B,OACT,EASAA,MAAO,WAEHD,EAAuBC,MAAM3iB,KAAKtX,MAGlCA,KAAKo7B,UACT,EAcAxN,QAAS,SAAUk4D,GAKf,OAHA9lF,KAAKo6B,QAAQ0rD,GAGN9lF,KAAKq6B,UAChB,EAgBAkB,SAAU,SAAUuqD,GAShB,OAPIA,GACA9lF,KAAKo6B,QAAQ0rD,GAIQ9lF,KAAKw7B,aAGlC,EAEA+vB,QAAS,EAETw6B,OAAQ,EAERN,gBAAiB,EAEjBE,gBAAiB,EAejBlqD,cAAgB,WACZ,SAASuqD,EAAqB1nF,GAC1B,MAAkB,iBAAPA,EACAinF,EAEAF,CAEf,CAEA,OAAO,SAAUltC,GACb,MAAO,CACHo7B,QAAS,SAAU9sD,EAASnoB,EAAK68B,GAC7B,OAAO6qD,EAAqB1nF,GAAKi1E,QAAQp7B,EAAQ1xB,EAASnoB,EAAK68B,EACnE,EAEA4c,QAAS,SAAUkuC,EAAY3nF,EAAK68B,GAChC,OAAO6qD,EAAqB1nF,GAAKy5C,QAAQI,EAAQ8tC,EAAY3nF,EAAK68B,EACtE,EAER,CACJ,CApBe,KA4BA1D,EAAM66C,aAAe9rB,EAAO7uB,OAAO,CAClD6D,YAAa,WAIT,OAF2Bx7B,KAAKq6B,UAAS,EAG7C,EAEAK,UAAW,IAMXsqD,EAASzxE,EAAEjB,KAAO,CAAC,EAKnB2yE,EAAkBxtD,EAAMwtD,gBAAkB3+D,EAAKqR,OAAO,CAatD6tD,gBAAiB,SAAUrtC,EAAQ7B,GAC/B,OAAOt2C,KAAKkmF,UAAU5oF,OAAO66C,EAAQ7B,EACzC,EAcAovC,gBAAiB,SAAUvtC,EAAQ7B,GAC/B,OAAOt2C,KAAKmmF,UAAU7oF,OAAO66C,EAAQ7B,EACzC,EAYAzjB,KAAM,SAAUslB,EAAQ7B,GACpBt2C,KAAKuyE,QAAUp6B,EACfn4C,KAAKomF,IAAM9vC,CACf,IAMA2S,EAAM+7B,EAAO/7B,IAAO,WAIpB,IAAIA,EAAMg8B,EAAgBttD,SA6D1B,SAAS0uD,EAASnmF,EAAOmd,EAAQqd,GAC7B,IAAIuG,EAGAqV,EAAKt2C,KAAKomF,IAGV9vC,GACArV,EAAQqV,EAGRt2C,KAAKomF,SAzVE,GA2VPnlD,EAAQjhC,KAAKsmF,WAIjB,IAAK,IAAI9kF,EAAI,EAAGA,EAAIk5B,EAAWl5B,IAC3BtB,EAAMmd,EAAS7b,IAAMy/B,EAAMz/B,EAEnC,CAEA,OA9EAynD,EAAIi9B,UAAYj9B,EAAItxB,OAAO,CAWvB4uD,aAAc,SAAUrmF,EAAOmd,GAE3B,IAAI86B,EAASn4C,KAAKuyE,QACd73C,EAAYyd,EAAOzd,UAGvB2rD,EAAS/uE,KAAKtX,KAAME,EAAOmd,EAAQqd,GACnCyd,EAAO+T,aAAahsD,EAAOmd,GAG3Brd,KAAKsmF,WAAapmF,EAAMga,MAAMmD,EAAQA,EAASqd,EACnD,IAMJuuB,EAAIk9B,UAAYl9B,EAAItxB,OAAO,CAWvB4uD,aAAc,SAAUrmF,EAAOmd,GAE3B,IAAI86B,EAASn4C,KAAKuyE,QACd73C,EAAYyd,EAAOzd,UAGnB8rD,EAAYtmF,EAAMga,MAAMmD,EAAQA,EAASqd,GAG7Cyd,EAAOgU,aAAajsD,EAAOmd,GAC3BgpE,EAAS/uE,KAAKtX,KAAME,EAAOmd,EAAQqd,GAGnC16B,KAAKsmF,WAAaE,CACtB,IAyBGv9B,CACX,CAxFuB,GAkGnBi8B,GALQ3xE,EAAE+0B,IAAM,CAAC,GAKH48C,MAAQ,CAatB58C,IAAK,SAAUntB,EAAMuf,GAYjB,IAVA,IAAI+rD,EAA6B,EAAZ/rD,EAGjBgsD,EAAgBD,EAAiBtrE,EAAK+c,SAAWuuD,EAGjDE,EAAeD,GAAiB,GAAOA,GAAiB,GAAOA,GAAiB,EAAKA,EAGrFE,EAAe,GACVplF,EAAI,EAAGA,EAAIklF,EAAellF,GAAK,EACpColF,EAAa5oE,KAAK2oE,GAEtB,IAAIniF,EAAUyzB,EAAU36B,OAAOspF,EAAcF,GAG7CvrE,EAAK4E,OAAOvb,EAChB,EAaAqiF,MAAO,SAAU1rE,GAEb,IAAIurE,EAAwD,IAAxCvrE,EAAKjb,MAAOib,EAAK+c,SAAW,IAAO,GAGvD/c,EAAK+c,UAAYwuD,CACrB,GAQcjvD,EAAMupD,YAAcx6B,EAAO7uB,OAAO,CAOhDwD,IAAKqrB,EAAOrrB,IAAIxD,OAAO,CACnBrlB,KAAM22C,EACNzkD,QAAS0gF,IAGbjrD,MAAO,WACH,IAAI6sD,EAGJtgC,EAAOvsB,MAAM3iB,KAAKtX,MAGlB,IAAIm7B,EAAMn7B,KAAKm7B,IACXmb,EAAKnb,EAAImb,GACThkC,EAAO6oB,EAAI7oB,KAGXtS,KAAK6lF,YAAc7lF,KAAKylF,gBACxBqB,EAAcx0E,EAAKkzE,iBAEnBsB,EAAcx0E,EAAKozE,gBAEnB1lF,KAAK66B,eAAiB,GAGtB76B,KAAKmzE,OAASnzE,KAAKmzE,MAAM4T,WAAaD,EACtC9mF,KAAKmzE,MAAMtgD,KAAK7yB,KAAMs2C,GAAMA,EAAGp2C,QAE/BF,KAAKmzE,MAAQ2T,EAAYxvE,KAAKhF,EAAMtS,KAAMs2C,GAAMA,EAAGp2C,OACnDF,KAAKmzE,MAAM4T,UAAYD,EAE/B,EAEA/rD,gBAAiB,SAAU76B,EAAOmd,GAC9Brd,KAAKmzE,MAAMoT,aAAarmF,EAAOmd,EACnC,EAEAme,YAAa,WACT,IAAIwrD,EAGAxiF,EAAUxE,KAAKm7B,IAAI32B,QAiBvB,OAdIxE,KAAK6lF,YAAc7lF,KAAKylF,iBAExBjhF,EAAQ8jC,IAAItoC,KAAKk6B,MAAOl6B,KAAK06B,WAG7BssD,EAAuBhnF,KAAKq6B,UAAS,KAGrC2sD,EAAuBhnF,KAAKq6B,UAAS,GAGrC71B,EAAQqiF,MAAMG,IAGXA,CACX,EAEAtsD,UAAW,IAgBXyqD,EAAe1tD,EAAM0tD,aAAe7+D,EAAKqR,OAAO,CAoBhD9E,KAAM,SAAUo0D,GACZjnF,KAAK63B,MAAMovD,EACf,EAiBA/kF,SAAU,SAAUo9E,GAChB,OAAQA,GAAat/E,KAAKs/E,WAAWjnD,UAAUr4B,KACnD,IAWAolF,GALW7xE,EAAEoxB,OAAS,CAAC,GAKKuiD,QAAU,CActC7uD,UAAW,SAAU4uD,GACjB,IAGIhB,EAAagB,EAAahB,WAC1B/vC,EAAO+wC,EAAa/wC,KASxB,OANIA,EACYje,EAAU36B,OAAO,CAAC,WAAY,aAAayiB,OAAOm2B,GAAMn2B,OAAOkmE,GAE/DA,GAGC/jF,SAAS0/E,EAC9B,EAeAzoD,MAAO,SAAUguD,GACb,IAAIjxC,EAGA+vC,EAAarE,EAAOzoD,MAAMguD,GAG1BC,EAAkBnB,EAAW/lF,MAYjC,OAT0B,YAAtBknF,EAAgB,IAA0C,YAAtBA,EAAgB,KAEpDlxC,EAAOje,EAAU36B,OAAO8pF,EAAgBltE,MAAM,EAAG,IAGjDktE,EAAgBpsD,OAAO,EAAG,GAC1BirD,EAAW/tD,UAAY,IAGpBitD,EAAa7nF,OAAO,CAAE2oF,WAAYA,EAAY/vC,KAAMA,GAC/D,GAMAmvC,EAAqB5tD,EAAM4tD,mBAAqB/+D,EAAKqR,OAAO,CAM5DwD,IAAK7U,EAAKqR,OAAO,CACbgN,OAAQygD,IAqBZ7R,QAAS,SAAUp7B,EAAQ1xB,EAASnoB,EAAK68B,GAErCA,EAAMn7B,KAAKm7B,IAAIxD,OAAOwD,GAGtB,IAAIksD,EAAYlvC,EAAOqtC,gBAAgBlnF,EAAK68B,GACxC8qD,EAAaoB,EAAU9rD,SAAS9U,GAGhC6gE,EAAYD,EAAUlsD,IAG1B,OAAOgqD,EAAa7nF,OAAO,CACvB2oF,WAAYA,EACZ3nF,IAAKA,EACLg4C,GAAIgxC,EAAUhxC,GACdkB,UAAWW,EACX7lC,KAAMg1E,EAAUh1E,KAChB9N,QAAS8iF,EAAU9iF,QACnBk2B,UAAWyd,EAAOzd,UAClB4kD,UAAWnkD,EAAIwJ,QAEvB,EAmBAoT,QAAS,SAAUI,EAAQ8tC,EAAY3nF,EAAK68B,GAUxC,OARAA,EAAMn7B,KAAKm7B,IAAIxD,OAAOwD,GAGtB8qD,EAAajmF,KAAKunF,OAAOtB,EAAY9qD,EAAIwJ,QAGzBwT,EAAOutC,gBAAgBpnF,EAAK68B,GAAKI,SAAS0qD,EAAWA,WAGzE,EAiBAsB,OAAQ,SAAUtB,EAAYthD,GAC1B,MAAyB,iBAAdshD,EACAthD,EAAOxL,MAAM8sD,EAAYjmF,MAEzBimF,CAEf,IAWAX,GALQ/xE,EAAEi0E,IAAM,CAAC,GAKEN,QAAU,CAkB7BO,QAAS,SAAUxxC,EAAUsV,EAASw6B,EAAQ7vC,GAErCA,IACDA,EAAOje,EAAUY,OAAO,IAI5B,IAAIv6B,EAAMo0D,EAAOp1D,OAAO,CAAEiuD,QAASA,EAAUw6B,IAAUnzB,QAAQ3c,EAAUC,GAGrEI,EAAKre,EAAU36B,OAAOgB,EAAI4B,MAAMga,MAAMqxC,GAAmB,EAATw6B,GAIpD,OAHAznF,EAAI45B,SAAqB,EAAVqzB,EAGR45B,EAAa7nF,OAAO,CAAEgB,IAAKA,EAAKg4C,GAAIA,EAAIJ,KAAMA,GACzD,GAOAqvC,EAAsB9tD,EAAM8tD,oBAAsBF,EAAmB1tD,OAAO,CAM5EwD,IAAKkqD,EAAmBlqD,IAAIxD,OAAO,CAC/B6vD,IAAKlC,IAoBT/R,QAAS,SAAUp7B,EAAQ1xB,EAASwvB,EAAU9a,GAK1C,IAAIusD,GAHJvsD,EAAMn7B,KAAKm7B,IAAIxD,OAAOwD,IAGEqsD,IAAIC,QAAQxxC,EAAUkC,EAAOoT,QAASpT,EAAO4tC,QAGrE5qD,EAAImb,GAAKoxC,EAAcpxC,GAGvB,IAAI2vC,EAAaZ,EAAmB9R,QAAQj8D,KAAKtX,KAAMm4C,EAAQ1xB,EAASihE,EAAcppF,IAAK68B,GAK3F,OAFA8qD,EAAWpuD,MAAM6vD,GAEVzB,CACX,EAmBAluC,QAAS,SAAUI,EAAQ8tC,EAAYhwC,EAAU9a,GAE7CA,EAAMn7B,KAAKm7B,IAAIxD,OAAOwD,GAGtB8qD,EAAajmF,KAAKunF,OAAOtB,EAAY9qD,EAAIwJ,QAGzC,IAAI+iD,EAAgBvsD,EAAIqsD,IAAIC,QAAQxxC,EAAUkC,EAAOoT,QAASpT,EAAO4tC,OAAQE,EAAW/vC,MAQxF,OALA/a,EAAImb,GAAKoxC,EAAcpxC,GAGP+uC,EAAmBttC,QAAQzgC,KAAKtX,KAAMm4C,EAAQ8tC,EAAYyB,EAAcppF,IAAK68B,EAGjG,wBCj3BPl+B,EAAOD,QAA4B,EAAQ,IAY5BizB,IAAIyJ,gBCdrB,IAAIz7B,EAAS,EAAQ,GACjBC,EAASD,EAAOC,OAGpB,SAASC,EAAWC,EAAKC,GACvB,IAAK,IAAIC,KAAOF,EACdC,EAAIC,GAAOF,EAAIE,EAEnB,CASA,SAASC,EAAYC,EAAKC,EAAkBC,GAC1C,OAAOR,EAAOM,EAAKC,EAAkBC,EACvC,CAVIR,EAAOS,MAAQT,EAAOU,OAASV,EAAOW,aAAeX,EAAOY,gBAC9D7B,EAAOD,QAAUiB,GAGjBE,EAAUF,EAAQjB,GAClBA,EAAQkB,OAASK,GAOnBA,EAAWb,UAAYL,OAAOC,OAAOY,EAAOR,WAG5CS,EAAUD,EAAQK,GAElBA,EAAWI,KAAO,SAAUH,EAAKC,EAAkBC,GACjD,GAAmB,iBAARF,EACT,MAAM,IAAIO,UAAU,iCAEtB,OAAOb,EAAOM,EAAKC,EAAkBC,EACvC,EAEAH,EAAWK,MAAQ,SAAUI,EAAMC,EAAMC,GACvC,GAAoB,iBAATF,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAII,EAAMjB,EAAOc,GAUjB,YATaI,IAATH,EACsB,iBAAbC,EACTC,EAAIF,KAAKA,EAAMC,GAEfC,EAAIF,KAAKA,GAGXE,EAAIF,KAAK,GAEJE,CACT,EAEAZ,EAAWM,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOb,EAAOc,EAChB,EAEAT,EAAWO,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOd,EAAOoB,WAAWL,EAC3B,aC9DA,IAAIf,EAAS,EAAQ,GACjBC,EAASD,EAAOC,OAGpB,SAASC,EAAWC,EAAKC,GACvB,IAAK,IAAIC,KAAOF,EACdC,EAAIC,GAAOF,EAAIE,EAEnB,CASA,SAASC,EAAYC,EAAKC,EAAkBC,GAC1C,OAAOR,EAAOM,EAAKC,EAAkBC,EACvC,CAVIR,EAAOS,MAAQT,EAAOU,OAASV,EAAOW,aAAeX,EAAOY,gBAC9D7B,EAAOD,QAAUiB,GAGjBE,EAAUF,EAAQjB,GAClBA,EAAQkB,OAASK,GAOnBA,EAAWb,UAAYL,OAAOC,OAAOY,EAAOR,WAG5CS,EAAUD,EAAQK,GAElBA,EAAWI,KAAO,SAAUH,EAAKC,EAAkBC,GACjD,GAAmB,iBAARF,EACT,MAAM,IAAIO,UAAU,iCAEtB,OAAOb,EAAOM,EAAKC,EAAkBC,EACvC,EAEAH,EAAWK,MAAQ,SAAUI,EAAMC,EAAMC,GACvC,GAAoB,iBAATF,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAII,EAAMjB,EAAOc,GAUjB,YATaI,IAATH,EACsB,iBAAbC,EACTC,EAAIF,KAAKA,EAAMC,GAEfC,EAAIF,KAAKA,GAGXE,EAAIF,KAAK,GAEJE,CACT,EAEAZ,EAAWM,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOb,EAAOc,EAChB,EAEAT,EAAWO,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOd,EAAOoB,WAAWL,EAC3B,oBC/DA,SAAW/B,EAAQD,GACjB,aAGA,SAASsC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,mBACnC,CAIA,SAASE,EAAUnC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIQ,EAAW,WAAa,EAC5BA,EAASN,UAAYF,EAAUE,UAC/BH,EAAKG,UAAY,IAAIM,EACrBT,EAAKG,UAAUC,YAAcJ,CAC/B,CAIA,SAASoC,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKtB,OAAS,EAGdsB,KAAKG,IAAM,KAEI,OAAXP,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKI,MAAMR,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAElD,CAUA,IAAI5B,EATkB,iBAAXjB,EACTA,EAAOD,QAAU2C,EAEjB3C,EAAQ2C,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGU,SAAW,GAGd,IAEInC,EADoB,oBAAXoC,aAAmD,IAAlBA,OAAOpC,OACxCoC,OAAOpC,OAEP,aAEb,CAAE,MAAOqC,GACT,CA+HA,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEXrB,GAAO,EAAO,wBAA0BmB,EAE5C,CAEA,SAASI,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,CACT,CA6CA,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAInC,IAHA,IAAIL,EAAI,EACJkD,EAAI,EACJ5C,EAAMC,KAAKC,IAAIN,EAAIvC,OAAQyC,GACtBK,EAAIN,EAAOM,EAAIH,EAAKG,IAAK,CAChC,IAAIb,EAAIM,EAAIL,WAAWY,GAAK,GAE5BT,GAAKK,EAIH6C,EADEtD,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENrB,EAAOqB,GAAK,GAAKsD,EAAI7C,EAAK,qBAC1BL,GAAKkD,CACP,CACA,OAAOlD,CACT,CA2DA,SAAS42D,EAAMt0D,EAAMjF,GACnBiF,EAAKnD,MAAQ9B,EAAI8B,MACjBmD,EAAK3E,OAASN,EAAIM,OAClB2E,EAAKpD,SAAW7B,EAAI6B,SACpBoD,EAAKlD,IAAM/B,EAAI+B,GACjB,CAqCA,GA9TAR,EAAGI,KAAO,SAAe0B,GACvB,OAAIA,aAAe9B,GAIJ,OAAR8B,GAA+B,iBAARA,GAC5BA,EAAI9D,YAAY0C,WAAaV,EAAGU,UAAYqB,MAAMC,QAAQF,EAAIvB,MAClE,EAEAP,EAAGiC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAnC,EAAG4B,IAAM,SAAcM,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAnC,EAAGjC,UAAU0C,MAAQ,SAAeR,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAKgC,YAAYpC,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAKiC,WAAWrC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETP,EAAOO,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqB,EAAQ,EACM,OAFlBtB,EAASA,EAAOsC,WAAWC,QAAQ,OAAQ,KAEhC,KACTjB,IACAlB,KAAKC,SAAW,GAGdiB,EAAQtB,EAAOlB,SACJ,KAATmB,EACFG,KAAKoC,UAAUxC,EAAQsB,EAAOpB,IAE9BE,KAAKqC,WAAWzC,EAAQC,EAAMqB,GACf,OAAXpB,GACFE,KAAKiC,WAAWjC,KAAKsC,UAAWzC,EAAMC,IAI9C,EAEAH,EAAGjC,UAAUsE,YAAc,SAAsBpC,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAU,SAATN,GACdI,KAAKtB,OAAS,GACLkB,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKtB,OAAS,IAEdY,EAAOM,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKtB,OAAS,GAGD,OAAXoB,GAGJE,KAAKiC,WAAWjC,KAAKsC,UAAWzC,EAAMC,EACxC,EAEAH,EAAGjC,UAAUuE,WAAa,SAAqBrC,EAAQC,EAAMC,GAG3D,GADAR,EAAgC,iBAAlBM,EAAOlB,QACjBkB,EAAOlB,QAAU,EAGnB,OAFAsB,KAAKE,MAAQ,CAAC,GACdF,KAAKtB,OAAS,EACPsB,KAGTA,KAAKtB,OAAS4C,KAAKiB,KAAK3C,EAAOlB,OAAS,GACxCsB,KAAKE,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/BxB,KAAKE,MAAMsB,GAAK,EAGlB,IAAIgB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAX5C,EACF,IAAK0B,EAAI5B,EAAOlB,OAAS,EAAG8D,EAAI,EAAGhB,GAAK,EAAGA,GAAK,EAC9CiB,EAAI7C,EAAO4B,GAAM5B,EAAO4B,EAAI,IAAM,EAAM5B,EAAO4B,EAAI,IAAM,GACzDxB,KAAKE,MAAMsC,IAAOC,GAAKC,EAAO,SAC9B1C,KAAKE,MAAMsC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAX1C,EACT,IAAK0B,EAAI,EAAGgB,EAAI,EAAGhB,EAAI5B,EAAOlB,OAAQ8C,GAAK,EACzCiB,EAAI7C,EAAO4B,GAAM5B,EAAO4B,EAAI,IAAM,EAAM5B,EAAO4B,EAAI,IAAM,GACzDxB,KAAKE,MAAMsC,IAAOC,GAAKC,EAAO,SAC9B1C,KAAKE,MAAMsC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAOxC,KAAKoY,QACd,EA0BAzY,EAAGjC,UAAU0E,UAAY,SAAoBxC,EAAQsB,EAAOpB,GAE1DE,KAAKtB,OAAS4C,KAAKiB,MAAM3C,EAAOlB,OAASwC,GAAS,GAClDlB,KAAKE,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/BxB,KAAKE,MAAMsB,GAAK,EAIlB,IAGIiB,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAX1C,EACF,IAAK0B,EAAI5B,EAAOlB,OAAS,EAAG8C,GAAKN,EAAOM,GAAK,EAC3CiB,EAAI5B,EAAajB,EAAQsB,EAAOM,IAAMkB,EACtC1C,KAAKE,MAAMsC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLxC,KAAKE,MAAMsC,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKlB,GADa5B,EAAOlB,OAASwC,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOM,EAAI5B,EAAOlB,OAAQ8C,GAAK,EAC1EiB,EAAI5B,EAAajB,EAAQsB,EAAOM,IAAMkB,EACtC1C,KAAKE,MAAMsC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLxC,KAAKE,MAAMsC,IAAMC,IAAM,IAEvBC,GAAO,EAKb1C,KAAKoY,QACP,EA6BAzY,EAAGjC,UAAU2E,WAAa,SAAqBzC,EAAQC,EAAMqB,GAE3DlB,KAAKE,MAAQ,CAAC,GACdF,KAAKtB,OAAS,EAGd,IAAK,IAAIkE,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWhD,EAClE+C,IAEFA,IACAC,EAAWA,EAAUhD,EAAQ,EAO7B,IALA,IAAIiD,EAAQlD,EAAOlB,OAASwC,EACxB6B,EAAMD,EAAQF,EACdzB,EAAMG,KAAKC,IAAIuB,EAAOA,EAAQC,GAAO7B,EAErC8B,EAAO,EACFxB,EAAIN,EAAOM,EAAIL,EAAKK,GAAKoB,EAChCI,EAAOhC,EAAUpB,EAAQ4B,EAAGA,EAAIoB,EAAS/C,GAEzCG,KAAKiD,MAAMJ,GACP7C,KAAKE,MAAM,GAAK8C,EAAO,SACzBhD,KAAKE,MAAM,IAAM8C,EAEjBhD,KAAKkD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOhC,EAAUpB,EAAQ4B,EAAG5B,EAAOlB,OAAQmB,GAEtC2B,EAAI,EAAGA,EAAIuB,EAAKvB,IACnB2B,GAAOtD,EAGTG,KAAKiD,MAAME,GACPnD,KAAKE,MAAM,GAAK8C,EAAO,SACzBhD,KAAKE,MAAM,IAAM8C,EAEjBhD,KAAKkD,OAAOF,EAEhB,CAEAhD,KAAKoY,QACP,EAEAzY,EAAGjC,UAAU0F,KAAO,SAAeC,GACjCA,EAAKnD,MAAQ,IAAIwB,MAAM1B,KAAKtB,QAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC/B6B,EAAKnD,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAE7B6B,EAAK3E,OAASsB,KAAKtB,OACnB2E,EAAKpD,SAAWD,KAAKC,SACrBoD,EAAKlD,IAAMH,KAAKG,GAClB,EASAR,EAAGjC,UAAUk6D,MAAQ,SAAgBv0D,GACnCs0D,EAAKt0D,EAAMrD,KACb,EAEAL,EAAGjC,UAAU4F,MAAQ,WACnB,IAAIvC,EAAI,IAAIpB,EAAG,MAEf,OADAK,KAAKoD,KAAKrC,GACHA,CACT,EAEApB,EAAGjC,UAAU6F,QAAU,SAAkBvE,GACvC,KAAOgB,KAAKtB,OAASM,GACnBgB,KAAKE,MAAMF,KAAKtB,UAAY,EAE9B,OAAOsB,IACT,EAGAL,EAAGjC,UAAU0a,OAAS,WACpB,KAAOpY,KAAKtB,OAAS,GAAqC,IAAhCsB,KAAKE,MAAMF,KAAKtB,OAAS,IACjDsB,KAAKtB,SAEP,OAAOsB,KAAKwD,WACd,EAEA7D,EAAGjC,UAAU8F,UAAY,WAKvB,OAHoB,IAAhBxD,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACT,EAIsB,oBAAXwZ,QAAgD,mBAAfA,OAAOq+C,IACjD,IACEl4D,EAAGjC,UAAU8b,OAAOq+C,IAAI,+BAAiCp0D,CAC3D,CAAE,MAAOlD,GACPZ,EAAGjC,UAAU+F,QAAUA,CACzB,MAEA9D,EAAGjC,UAAU+F,QAAUA,EAGzB,SAASA,IACP,OAAQzD,KAAKG,IAAM,UAAY,SAAWH,KAAKkC,SAAS,IAAM,GAChE,CAgCA,IAAIwB,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UA4mB9D,SAASC,EAAYC,EAAMrC,EAAKsC,GAC9BA,EAAI9D,SAAWwB,EAAIxB,SAAW6D,EAAK7D,SACnC,IAAIoB,EAAOyC,EAAKpF,OAAS+C,EAAI/C,OAAU,EACvCqF,EAAIrF,OAAS2C,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAI2C,EAAoB,EAAhBF,EAAK5D,MAAM,GACf+D,EAAmB,EAAfxC,EAAIvB,MAAM,GACda,EAAIiD,EAAIC,EAERC,EAAS,SAAJnD,EACLoD,EAASpD,EAAI,SAAa,EAC9BgD,EAAI7D,MAAM,GAAKgE,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI/C,EAAK+C,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOjD,KAAKC,IAAI6C,EAAG3C,EAAI/C,OAAS,GAC3B8D,EAAIlB,KAAKM,IAAI,EAAGwC,EAAIN,EAAKpF,OAAS,GAAI8D,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIhB,EAAK4C,EAAI5B,EAAK,EAIlB6B,IADAtD,GAFAiD,EAAoB,EAAhBF,EAAK5D,MAAMsB,KACfyC,EAAmB,EAAfxC,EAAIvB,MAAMsC,IACF8B,GACG,SAAa,EAC5BA,EAAY,SAAJvD,CACV,CACAgD,EAAI7D,MAAMkE,GAAa,EAARE,EACfH,EAAiB,EAATE,CACV,CAOA,OANc,IAAVF,EACFJ,EAAI7D,MAAMkE,GAAa,EAARD,EAEfJ,EAAIrF,SAGCqF,EAAIqU,QACb,CAhpBAzY,EAAGjC,UAAUwE,SAAW,SAAmBrC,EAAM2E,GAI/C,IAAIT,EACJ,GAHAS,EAAoB,EAAVA,GAAe,EAGZ,MAJb3E,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCkE,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNyB,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIiB,EAAIzC,KAAKE,MAAMsB,GACfwB,GAA+B,UAArBP,GAAKC,EAAOyB,IAAmBjC,SAAS,IACtDiC,EAAS1B,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACPlB,KAGAuC,EADY,IAAVI,GAAe3C,IAAMxB,KAAKtB,OAAS,EAC/BgF,EAAM,EAAIV,EAAKtE,QAAUsE,EAAOe,EAEhCf,EAAOe,CAEjB,CAIA,IAHc,IAAVI,IACFJ,EAAMI,EAAMjC,SAAS,IAAM6B,GAEtBA,EAAIrF,OAAS8F,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB/D,KAAKC,WACP8D,EAAM,IAAMA,GAEPA,CACT,CAEA,GAAIlE,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI4E,EAAYd,EAAW9D,GAEvB6E,EAAYd,EAAW/D,GAC3BkE,EAAM,GACN,IAAIpD,EAAIX,KAAKsD,QAEb,IADA3C,EAAEV,SAAW,GACLU,EAAEgE,UAAU,CAClB,IAAI5D,EAAIJ,EAAEm3D,MAAMpzD,GAAWxC,SAASrC,GAMlCkE,GALFpD,EAAIA,EAAEkE,MAAMH,IAELC,SAGC5D,EAAIgD,EAFJL,EAAMe,EAAY1D,EAAErC,QAAUqC,EAAIgD,CAI5C,CAIA,IAHI/D,KAAK2E,WACPZ,EAAM,IAAMA,GAEPA,EAAIrF,OAAS8F,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB/D,KAAKC,WACP8D,EAAM,IAAMA,GAEPA,CACT,CAEAzE,GAAO,EAAO,kCAChB,EAEAK,EAAGjC,UAAUoH,SAAW,WACtB,IAAIC,EAAM/E,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKtB,OACPqG,GAAuB,SAAhB/E,KAAKE,MAAM,GACO,IAAhBF,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,GAEzC6E,GAAO,iBAAoC,SAAhB/E,KAAKE,MAAM,GAC7BF,KAAKtB,OAAS,GACvBY,GAAO,EAAO,8CAEU,IAAlBU,KAAKC,UAAmB8E,EAAMA,CACxC,EAEApF,EAAGjC,UAAUsH,OAAS,WACpB,OAAOhF,KAAKkC,SAAS,GAAI,EAC3B,EAEIhE,IACFyB,EAAGjC,UAAUuH,SAAW,SAAmBnF,EAAQpB,GACjD,OAAOsB,KAAKkF,YAAYhH,EAAQ4B,EAAQpB,EAC1C,GAGFiB,EAAGjC,UAAU4E,QAAU,SAAkBxC,EAAQpB,GAC/C,OAAOsB,KAAKkF,YAAYxD,MAAO5B,EAAQpB,EACzC,EASAiB,EAAGjC,UAAUwH,YAAc,SAAsBC,EAAWrF,EAAQpB,GAClEsB,KAAKoY,SAEL,IAAIhT,EAAapF,KAAKoF,aAClBC,EAAY3G,GAAU4C,KAAKM,IAAI,EAAGwD,GACtC9F,EAAO8F,GAAcC,EAAW,yCAChC/F,EAAO+F,EAAY,EAAG,+BAEtB,IAAIE,EAfS,SAAmBJ,EAAWnG,GAC3C,OAAImG,EAAUtG,YACLsG,EAAUtG,YAAYG,GAExB,IAAImG,EAAUnG,EACvB,CAUY+4D,CAAS5yD,EAAWE,GAG9B,OADArF,KAAK,gBADoB,OAAXF,EAAkB,KAAO,OACRyF,EAAKH,GAC7BG,CACT,EAEA5F,EAAGjC,UAAUs6D,eAAiB,SAAyBzyD,EAAKH,GAI1D,IAHA,IAAIqxB,EAAW,EACXtyB,EAAQ,EAEH3C,EAAI,EAAG4Q,EAAQ,EAAG5Q,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAC/C,IAAIwB,EAAQhD,KAAKE,MAAMsB,IAAM4Q,EAASjO,EAEtCoB,EAAIkxB,KAAqB,IAAPzzB,EACdyzB,EAAWlxB,EAAI7G,SACjB6G,EAAIkxB,KAAezzB,GAAQ,EAAK,KAE9ByzB,EAAWlxB,EAAI7G,SACjB6G,EAAIkxB,KAAezzB,GAAQ,GAAM,KAGrB,IAAVoP,GACEqkB,EAAWlxB,EAAI7G,SACjB6G,EAAIkxB,KAAezzB,GAAQ,GAAM,KAEnCmB,EAAQ,EACRiO,EAAQ,IAERjO,EAAQnB,IAAS,GACjBoP,GAAS,EAEb,CAEA,GAAIqkB,EAAWlxB,EAAI7G,OAGjB,IAFA6G,EAAIkxB,KAActyB,EAEXsyB,EAAWlxB,EAAI7G,QACpB6G,EAAIkxB,KAAc,CAGxB,EAEA92B,EAAGjC,UAAUu6D,eAAiB,SAAyB1yD,EAAKH,GAI1D,IAHA,IAAIqxB,EAAWlxB,EAAI7G,OAAS,EACxByF,EAAQ,EAEH3C,EAAI,EAAG4Q,EAAQ,EAAG5Q,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAC/C,IAAIwB,EAAQhD,KAAKE,MAAMsB,IAAM4Q,EAASjO,EAEtCoB,EAAIkxB,KAAqB,IAAPzzB,EACdyzB,GAAY,IACdlxB,EAAIkxB,KAAezzB,GAAQ,EAAK,KAE9ByzB,GAAY,IACdlxB,EAAIkxB,KAAezzB,GAAQ,GAAM,KAGrB,IAAVoP,GACEqkB,GAAY,IACdlxB,EAAIkxB,KAAezzB,GAAQ,GAAM,KAEnCmB,EAAQ,EACRiO,EAAQ,IAERjO,EAAQnB,IAAS,GACjBoP,GAAS,EAEb,CAEA,GAAIqkB,GAAY,EAGd,IAFAlxB,EAAIkxB,KAActyB,EAEXsyB,GAAY,GACjBlxB,EAAIkxB,KAAc,CAGxB,EAEIn1B,KAAKqE,MACPhG,EAAGjC,UAAUkI,WAAa,SAAqBnD,GAC7C,OAAO,GAAKnB,KAAKqE,MAAMlD,EACzB,EAEA9C,EAAGjC,UAAUkI,WAAa,SAAqBnD,GAC7C,IAAIoD,EAAIpD,EACJ1B,EAAI,EAiBR,OAhBI8E,GAAK,OACP9E,GAAK,GACL8E,KAAO,IAELA,GAAK,KACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAEF9E,EAAI8E,CACb,EAGFlG,EAAGjC,UAAUoI,UAAY,SAAoBrD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIoD,EAAIpD,EACJ1B,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ8E,KACH9E,GAAK,GACL8E,KAAO,IAEU,IAAV,IAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,GAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,IACH9E,IAEKA,CACT,EAGApB,EAAGjC,UAAUqI,UAAY,WACvB,IAAItD,EAAIzC,KAAKE,MAAMF,KAAKtB,OAAS,GAC7BsH,EAAKhG,KAAK4F,WAAWnD,GACzB,OAA2B,IAAnBzC,KAAKtB,OAAS,GAAUsH,CAClC,EAgBArG,EAAGjC,UAAUuI,SAAW,WACtB,GAAIjG,KAAK2E,SAAU,OAAO,EAG1B,IADA,IAAI5D,EAAI,EACCS,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIyC,EAAIjE,KAAK8F,UAAU9F,KAAKE,MAAMsB,IAElC,GADAT,GAAKkD,EACK,KAANA,EAAU,KAChB,CACA,OAAOlD,CACT,EAEApB,EAAGjC,UAAU0H,WAAa,WACxB,OAAO9D,KAAKiB,KAAKvC,KAAK+F,YAAc,EACtC,EAEApG,EAAGjC,UAAUwI,OAAS,SAAiBC,GACrC,OAAsB,IAAlBnG,KAAKC,SACAD,KAAKoG,MAAMC,MAAMF,GAAOG,MAAM,GAEhCtG,KAAKsD,OACd,EAEA3D,EAAGjC,UAAU6I,SAAW,SAAmBJ,GACzC,OAAInG,KAAKwG,MAAML,EAAQ,GACdnG,KAAKyG,KAAKN,GAAOG,MAAM,GAAGI,OAE5B1G,KAAKsD,OACd,EAEA3D,EAAGjC,UAAUiJ,MAAQ,WACnB,OAAyB,IAAlB3G,KAAKC,QACd,EAGAN,EAAGjC,UAAUkJ,IAAM,WACjB,OAAO5G,KAAKsD,QAAQoD,MACtB,EAEA/G,EAAGjC,UAAUgJ,KAAO,WAKlB,OAJK1G,KAAK2E,WACR3E,KAAKC,UAAY,GAGZD,IACT,EAGAL,EAAGjC,UAAUmJ,KAAO,SAAepF,GACjC,KAAOzB,KAAKtB,OAAS+C,EAAI/C,QACvBsB,KAAKE,MAAMF,KAAKtB,UAAY,EAG9B,IAAK,IAAI8C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAC9BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAAKC,EAAIvB,MAAMsB,GAG5C,OAAOxB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUoJ,IAAM,SAAcrF,GAE/B,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAK6G,KAAKpF,EACnB,EAGA9B,EAAGjC,UAAUqJ,GAAK,SAAatF,GAC7B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQwD,IAAIrF,GAC/CA,EAAI6B,QAAQwD,IAAI9G,KACzB,EAEAL,EAAGjC,UAAUsJ,IAAM,SAAcvF,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQuD,KAAKpF,GAChDA,EAAI6B,QAAQuD,KAAK7G,KAC1B,EAGAL,EAAGjC,UAAUuJ,MAAQ,SAAgBxF,GAEnC,IAAIwC,EAEFA,EADEjE,KAAKtB,OAAS+C,EAAI/C,OAChB+C,EAEAzB,KAGN,IAAK,IAAIwB,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAAKC,EAAIvB,MAAMsB,GAK5C,OAFAxB,KAAKtB,OAASuF,EAAEvF,OAETsB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUwJ,KAAO,SAAezF,GAEjC,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAKiH,MAAMxF,EACpB,EAGA9B,EAAGjC,UAAUyJ,IAAM,SAAc1F,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ4D,KAAKzF,GAChDA,EAAI6B,QAAQ4D,KAAKlH,KAC1B,EAEAL,EAAGjC,UAAU0J,KAAO,SAAe3F,GACjC,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ2D,MAAMxF,GACjDA,EAAI6B,QAAQ2D,MAAMjH,KAC3B,EAGAL,EAAGjC,UAAU2J,MAAQ,SAAgB5F,GAEnC,IAAIuC,EACAC,EACAjE,KAAKtB,OAAS+C,EAAI/C,QACpBsF,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAGN,IAAK,IAAIwB,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAAKyC,EAAE/D,MAAMsB,GAGvC,GAAIxB,OAASgE,EACX,KAAOxC,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAM5B,OAFAxB,KAAKtB,OAASsF,EAAEtF,OAETsB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU4J,KAAO,SAAe7F,GAEjC,OADAnC,EAA0C,IAAlCU,KAAKC,SAAWwB,EAAIxB,WACrBD,KAAKqH,MAAM5F,EACpB,EAGA9B,EAAGjC,UAAU6J,IAAM,SAAc9F,GAC/B,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQgE,KAAK7F,GAChDA,EAAI6B,QAAQgE,KAAKtH,KAC1B,EAEAL,EAAGjC,UAAU8J,KAAO,SAAe/F,GACjC,OAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQ+D,MAAM5F,GACjDA,EAAI6B,QAAQ+D,MAAMrH,KAC3B,EAGAL,EAAGjC,UAAU2I,MAAQ,SAAgBF,GACnC7G,EAAwB,iBAAV6G,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBnG,KAAKiB,KAAK4D,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBnG,KAAKuD,QAAQkE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIjG,EAAI,EAAGA,EAAIiG,EAAajG,IAC/BxB,KAAKE,MAAMsB,GAAsB,UAAhBxB,KAAKE,MAAMsB,GAS9B,OALIkG,EAAW,IACb1H,KAAKE,MAAMsB,IAAMxB,KAAKE,MAAMsB,GAAM,UAAc,GAAKkG,GAIhD1H,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU+I,KAAO,SAAeN,GACjC,OAAOnG,KAAKsD,QAAQ+C,MAAMF,EAC5B,EAGAxG,EAAGjC,UAAUiK,KAAO,SAAeC,EAAKrI,GACtCD,EAAsB,iBAARsI,GAAoBA,GAAO,GAEzC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA5H,KAAKuD,QAAQb,EAAM,GAGjB1C,KAAKE,MAAMwC,GADTnD,EACgBS,KAAKE,MAAMwC,GAAQ,GAAKmF,EAExB7H,KAAKE,MAAMwC,KAAS,GAAKmF,GAGtC7H,KAAKoY,QACd,EAGAzY,EAAGjC,UAAUoK,KAAO,SAAerG,GACjC,IAAIV,EAkBAiD,EAAGC,EAfP,GAAsB,IAAlBjE,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAI7B,OAHAD,KAAKC,SAAW,EAChBc,EAAIf,KAAK+H,KAAKtG,GACdzB,KAAKC,UAAY,EACVD,KAAKwD,YAGP,GAAsB,IAAlBxD,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAIpC,OAHAwB,EAAIxB,SAAW,EACfc,EAAIf,KAAK+H,KAAKtG,GACdA,EAAIxB,SAAW,EACRc,EAAEyC,YAKPxD,KAAKtB,OAAS+C,EAAI/C,QACpBsF,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAIN,IADA,IAAImE,EAAQ,EACH3C,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAC5BT,GAAkB,EAAbiD,EAAE9D,MAAMsB,KAAwB,EAAbyC,EAAE/D,MAAMsB,IAAU2C,EAC1CnE,KAAKE,MAAMsB,GAAS,SAAJT,EAChBoD,EAAQpD,IAAM,GAEhB,KAAiB,IAAVoD,GAAe3C,EAAIwC,EAAEtF,OAAQ8C,IAClCT,GAAkB,EAAbiD,EAAE9D,MAAMsB,IAAU2C,EACvBnE,KAAKE,MAAMsB,GAAS,SAAJT,EAChBoD,EAAQpD,IAAM,GAIhB,GADAf,KAAKtB,OAASsF,EAAEtF,OACF,IAAVyF,EACFnE,KAAKE,MAAMF,KAAKtB,QAAUyF,EAC1BnE,KAAKtB,cAEA,GAAIsF,IAAMhE,KACf,KAAOwB,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAI5B,OAAOxB,IACT,EAGAL,EAAGjC,UAAUsK,IAAM,SAAcvG,GAC/B,IAAI8D,EACJ,OAAqB,IAAjB9D,EAAIxB,UAAoC,IAAlBD,KAAKC,UAC7BwB,EAAIxB,SAAW,EACfsF,EAAMvF,KAAKiI,IAAIxG,GACfA,EAAIxB,UAAY,EACTsF,GACmB,IAAjB9D,EAAIxB,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChBsF,EAAM9D,EAAIwG,IAAIjI,MACdA,KAAKC,SAAW,EACTsF,GAGLvF,KAAKtB,OAAS+C,EAAI/C,OAAesB,KAAKsD,QAAQwE,KAAKrG,GAEhDA,EAAI6B,QAAQwE,KAAK9H,KAC1B,EAGAL,EAAGjC,UAAUqK,KAAO,SAAetG,GAEjC,GAAqB,IAAjBA,EAAIxB,SAAgB,CACtBwB,EAAIxB,SAAW,EACf,IAAIc,EAAIf,KAAK8H,KAAKrG,GAElB,OADAA,EAAIxB,SAAW,EACRc,EAAEyC,WAGX,CAAO,GAAsB,IAAlBxD,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAK8H,KAAKrG,GACVzB,KAAKC,SAAW,EACTD,KAAKwD,YAId,IAWIQ,EAAGC,EAXHlC,EAAM/B,KAAK+B,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHA/B,KAAKC,SAAW,EAChBD,KAAKtB,OAAS,EACdsB,KAAKE,MAAM,GAAK,EACTF,KAKL+B,EAAM,GACRiC,EAAIhE,KACJiE,EAAIxC,IAEJuC,EAAIvC,EACJwC,EAAIjE,MAIN,IADA,IAAImE,EAAQ,EACH3C,EAAI,EAAGA,EAAIyC,EAAEvF,OAAQ8C,IAE5B2C,GADApD,GAAkB,EAAbiD,EAAE9D,MAAMsB,KAAwB,EAAbyC,EAAE/D,MAAMsB,IAAU2C,IAC7B,GACbnE,KAAKE,MAAMsB,GAAS,SAAJT,EAElB,KAAiB,IAAVoD,GAAe3C,EAAIwC,EAAEtF,OAAQ8C,IAElC2C,GADApD,GAAkB,EAAbiD,EAAE9D,MAAMsB,IAAU2C,IACV,GACbnE,KAAKE,MAAMsB,GAAS,SAAJT,EAIlB,GAAc,IAAVoD,GAAe3C,EAAIwC,EAAEtF,QAAUsF,IAAMhE,KACvC,KAAOwB,EAAIwC,EAAEtF,OAAQ8C,IACnBxB,KAAKE,MAAMsB,GAAKwC,EAAE9D,MAAMsB,GAU5B,OANAxB,KAAKtB,OAAS4C,KAAKM,IAAI5B,KAAKtB,OAAQ8C,GAEhCwC,IAAMhE,OACRA,KAAKC,SAAW,GAGXD,KAAKoY,QACd,EAGAzY,EAAGjC,UAAUuK,IAAM,SAAcxG,GAC/B,OAAOzB,KAAKsD,QAAQyE,KAAKtG,EAC3B,EA8CA,IAAIyG,EAAc,SAAsBpE,EAAMrC,EAAKsC,GACjD,IAIIG,EACAiE,EACAnC,EANAhC,EAAIF,EAAK5D,MACT+D,EAAIxC,EAAIvB,MACRkI,EAAIrE,EAAI7D,MACRS,EAAI,EAIJ0H,EAAY,EAAPrE,EAAE,GACPsE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxE,EAAE,GACPyE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3E,EAAE,GACP4E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9E,EAAE,GACP+E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjF,EAAE,GACPkF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpF,EAAE,GACPqF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvF,EAAE,GACPwF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1F,EAAE,GACP2F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlG,EAAE,GACPmG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrG,EAAE,GACPsG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxG,EAAE,GACPyG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3G,EAAE,GACP4G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9G,EAAE,GACP+G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPjH,EAAE,GACPkH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpH,EAAE,GACPqH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvH,EAAE,GACPwH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1H,EAAE,GACP2H,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP7H,EAAE,GACP8H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB/H,EAAI9D,SAAW6D,EAAK7D,SAAWwB,EAAIxB,SACnC8D,EAAIrF,OAAS,GAMb,IAAIuN,IAAQtL,GAJZuD,EAAK5C,KAAK4K,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM7G,KAAK4K,KAAK5D,EAAK+B,IACR/I,KAAK4K,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDzJ,IAFAqF,EAAK1E,KAAK4K,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAK5C,KAAK4K,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKzD,EAAK4B,IACR/I,KAAK4K,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQxL,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKkC,GAAQ,GACvBlJ,KAAK4K,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrD5J,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAK5C,KAAK4K,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKtD,EAAKyB,IACR/I,KAAK4K,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKrD,EAAKwB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK+B,GAAQ,GACvBlJ,KAAK4K,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQzL,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKqC,GAAQ,GACvBrJ,KAAK4K,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD/J,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAK5C,KAAK4K,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKnD,EAAKsB,IACR/I,KAAK4K,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKlD,EAAKqB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK4B,GAAQ,GACvBlJ,KAAK4K,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKkC,GAAQ,GACvBrJ,KAAK4K,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQ1L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKwC,GAAQ,GACvBxJ,KAAK4K,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDlK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAK5C,KAAK4K,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKhD,EAAKmB,IACR/I,KAAK4K,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAK/C,EAAKkB,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKyB,GAAQ,GACvBlJ,KAAK4K,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK+B,GAAQ,GACvBrJ,KAAK4K,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK8B,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKqC,GAAQ,GACvBxJ,KAAK4K,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQ3L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK2C,IAAQ,GACvB3J,KAAK4K,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDrK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAK5C,KAAK4K,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAK7C,EAAKgB,IACR/I,KAAK4K,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAK5C,EAAKe,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKsB,GAAQ,GACvBlJ,KAAK4K,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK4B,GAAQ,GACvBrJ,KAAK4K,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK2B,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKkC,GAAQ,GACvBxJ,KAAK4K,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKiC,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKwC,IAAQ,GACvB3J,KAAK4K,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQ5L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK8C,IAAQ,GACvB9J,KAAK4K,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDxK,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAK5C,KAAK4K,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAK1C,EAAKa,IACR/I,KAAK4K,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKzC,EAAKY,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKmB,GAAQ,GACvBlJ,KAAK4K,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKyB,GAAQ,GACvBrJ,KAAK4K,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKwB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK+B,GAAQ,GACvBxJ,KAAK4K,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK8B,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKqC,IAAQ,GACvB3J,KAAK4K,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK2C,IAAQ,GACvB9J,KAAK4K,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ7L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKiD,IAAQ,GACvBjK,KAAK4K,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrD3K,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAK5C,KAAK4K,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKvC,EAAKU,IACR/I,KAAK4K,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKtC,EAAKS,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKgB,GAAQ,GACvBlJ,KAAK4K,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKsB,GAAQ,GACvBrJ,KAAK4K,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKqB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK4B,GAAQ,GACvBxJ,KAAK4K,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK2B,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKkC,IAAQ,GACvB3J,KAAK4K,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKwC,IAAQ,GACvB9J,KAAK4K,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKuC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAK8C,IAAQ,GACvBjK,KAAK4K,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ9L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKoD,IAAQ,GACvBpK,KAAK4K,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD9K,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAK5C,KAAK4K,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKpC,EAAKO,IACR/I,KAAK4K,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKnC,EAAKM,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKa,GAAQ,GACvBlJ,KAAK4K,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKY,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKmB,GAAQ,GACvBrJ,KAAK4K,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKkB,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKyB,GAAQ,GACvBxJ,KAAK4K,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKwB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK+B,IAAQ,GACvB3J,KAAK4K,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKqC,IAAQ,GACvB9J,KAAK4K,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKoC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK2C,IAAQ,GACvBjK,KAAK4K,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKiD,IAAQ,GACvBpK,KAAK4K,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ/L,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAKuD,IAAQ,GACvBvK,KAAK4K,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDjL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAK5C,KAAK4K,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKI,IACR/I,KAAK4K,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK1E,KAAK4K,KAAKhC,EAAKG,GACpBnG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKU,GAAQ,GACvBlJ,KAAK4K,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKS,GAAQ,EAClCtG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKgB,GAAQ,GACvBrJ,KAAK4K,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKe,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKsB,GAAQ,GACvBxJ,KAAK4K,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKqB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK4B,IAAQ,GACvB3J,KAAK4K,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKkC,IAAQ,GACvB9J,KAAK4K,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKiC,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKwC,IAAQ,GACvBjK,KAAK4K,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAK8C,IAAQ,GACvBpK,KAAK4K,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAK6C,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKoD,IAAQ,GACvBvK,KAAK4K,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQhM,GAJZuD,EAAMA,EAAK5C,KAAK4K,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK5D,EAAK0D,IAAQ,GACvB1K,KAAK4K,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENzI,EAAK5C,KAAK4K,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKO,IACRlJ,KAAK4K,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK1E,KAAK4K,KAAKhC,EAAKM,GACpBtG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKa,GAAQ,GACvBrJ,KAAK4K,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKY,GAAQ,EAClCzG,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKmB,GAAQ,GACvBxJ,KAAK4K,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKkB,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKyB,IAAQ,GACvB3J,KAAK4K,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK+B,IAAQ,GACvB9J,KAAK4K,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK8B,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKqC,IAAQ,GACvBjK,KAAK4K,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK2C,IAAQ,GACvBpK,KAAK4K,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK0C,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKiD,IAAQ,GACvBvK,KAAK4K,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASjM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKzD,EAAKuD,IAAQ,GACvB1K,KAAK4K,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAK5C,KAAK4K,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKU,IACRrJ,KAAK4K,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK1E,KAAK4K,KAAKhC,EAAKS,GACpBzG,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKgB,GAAQ,GACvBxJ,KAAK4K,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKe,GAAQ,EAClC5G,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKsB,IAAQ,GACvB3J,KAAK4K,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKqB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAK4B,IAAQ,GACvB9J,KAAK4K,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKkC,IAAQ,GACvBjK,KAAK4K,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAKwC,IAAQ,GACvBpK,KAAK4K,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAKuC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAK8C,IAAQ,GACvBvK,KAAK4K,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASlM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKtD,EAAKoD,IAAQ,GACvB1K,KAAK4K,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAK5C,KAAK4K,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKa,IACRxJ,KAAK4K,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK1E,KAAK4K,KAAKhC,EAAKY,GACpB5G,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKmB,IAAQ,GACvB3J,KAAK4K,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKkB,IAAQ,EAClC/G,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKyB,IAAQ,GACvB9J,KAAK4K,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKwB,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAK+B,IAAQ,GACvBjK,KAAK4K,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKqC,IAAQ,GACvBpK,KAAK4K,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKoC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK2C,IAAQ,GACvBvK,KAAK4K,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAASnM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKnD,EAAKiD,IAAQ,GACvB1K,KAAK4K,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAK5C,KAAK4K,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKgB,KACR3J,KAAK4K,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK1E,KAAK4K,KAAKhC,EAAKe,IACpB/G,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKsB,IAAQ,GACvB9J,KAAK4K,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKqB,IAAQ,EAClClH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAK4B,IAAQ,GACvBjK,KAAK4K,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAK2B,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKkC,IAAQ,GACvBpK,KAAK4K,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKiC,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAKwC,IAAQ,GACvBvK,KAAK4K,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASpM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKhD,EAAK8C,IAAQ,GACvB1K,KAAK4K,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAK5C,KAAK4K,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKmB,KACR9J,KAAK4K,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK1E,KAAK4K,KAAKhC,EAAKkB,IACpBlH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKyB,IAAQ,GACvBjK,KAAK4K,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKwB,IAAQ,EAClCrH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAK+B,IAAQ,GACvBpK,KAAK4K,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAK8B,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKqC,IAAQ,GACvBvK,KAAK4K,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASrM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK7C,EAAK2C,IAAQ,GACvB1K,KAAK4K,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAK5C,KAAK4K,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKsB,KACRjK,KAAK4K,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK1E,KAAK4K,KAAKhC,EAAKqB,IACpBrH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAK4B,IAAQ,GACvBpK,KAAK4K,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAK2B,IAAQ,EAClCxH,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKkC,IAAQ,GACvBvK,KAAK4K,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAStM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAK1C,EAAKwC,IAAQ,GACvB1K,KAAK4K,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAK5C,KAAK4K,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAKyB,KACRpK,KAAK4K,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK1E,KAAK4K,KAAKhC,EAAKwB,IACpBxH,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAK+B,IAAQ,GACvBvK,KAAK4K,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASvM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKvC,EAAKqC,IAAQ,GACvB1K,KAAK4K,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPhJ,EAAK5C,KAAK4K,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAK4B,KACRvK,KAAK4K,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK1E,KAAK4K,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASxM,GAJbuD,EAAMA,EAAK5C,KAAK4K,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM7G,KAAK4K,KAAKpC,EAAKkC,IAAQ,GACvB1K,KAAK4K,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDpL,IAFAqF,EAAMA,EAAK1E,KAAK4K,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASzM,GAJbuD,EAAK5C,KAAK4K,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM7G,KAAK4K,KAAKjC,EAAK+B,KACR1K,KAAK4K,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBApL,IAFAqF,EAAK1E,KAAK4K,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANzM,IACFyH,EAAE,IAAMzH,EACRoD,EAAIrF,UAECqF,CACT,EAOA,SAAS6J,EAAU9J,EAAMrC,EAAKsC,GAC5BA,EAAI9D,SAAWwB,EAAIxB,SAAW6D,EAAK7D,SACnC8D,EAAIrF,OAASoF,EAAKpF,OAAS+C,EAAI/C,OAI/B,IAFA,IAAIyF,EAAQ,EACRwJ,EAAU,EACLvJ,EAAI,EAAGA,EAAIL,EAAIrF,OAAS,EAAG0F,IAAK,CAGvC,IAAIC,EAASsJ,EACbA,EAAU,EAGV,IAFA,IAAIrJ,EAAgB,SAARH,EACRI,EAAOjD,KAAKC,IAAI6C,EAAG3C,EAAI/C,OAAS,GAC3B8D,EAAIlB,KAAKM,IAAI,EAAGwC,EAAIN,EAAKpF,OAAS,GAAI8D,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIhB,EAAI4C,EAAI5B,EAGRzB,GAFoB,EAAhB+C,EAAK5D,MAAMsB,KACI,EAAfC,EAAIvB,MAAMsC,IAGd0B,EAAS,SAAJnD,EAGTuD,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBqJ,IAFAtJ,GAHAA,EAAUA,GAAWtD,EAAI,SAAa,GAAM,IAGxBmD,IAAO,IAAO,KAEZ,GACtBG,GAAU,QACZ,CACAN,EAAI7D,MAAMkE,GAAKE,EACfH,EAAQE,EACRA,EAASsJ,CACX,CAOA,OANc,IAAVxJ,EACFJ,EAAI7D,MAAMkE,GAAKD,EAEfJ,EAAIrF,SAGCqF,EAAIqU,QACb,CAEA,SAAS/K,EAAYvJ,EAAMrC,EAAKsC,GAI9B,OAAO6J,EAAS9J,EAAMrC,EAAKsC,EAC7B,CAqBA,SAASuJ,EAAME,EAAGC,GAChBzN,KAAKwN,EAAIA,EACTxN,KAAKyN,EAAIA,CACX,CA1EKnM,KAAK4K,OACRhE,EAAcrE,GAmDhBlE,EAAGjC,UAAUgQ,MAAQ,SAAgBjM,EAAKsC,GACxC,IACI1C,EAAMrB,KAAKtB,OAAS+C,EAAI/C,OAW5B,OAVoB,KAAhBsB,KAAKtB,QAAgC,KAAf+C,EAAI/C,OACtBwJ,EAAYlI,KAAMyB,EAAKsC,GACpB1C,EAAM,GACTwC,EAAW7D,KAAMyB,EAAKsC,GACnB1C,EAAM,KACTuM,EAAS5N,KAAMyB,EAAKsC,GAEpBsJ,EAAWrN,KAAMyB,EAAKsC,EAIhC,EAUAuJ,EAAK5P,UAAUmQ,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAInE,MAAMoM,GACdC,EAAIpO,EAAGjC,UAAUkI,WAAWkI,GAAK,EAC5BtM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrBqE,EAAErE,GAAKxB,KAAKgO,OAAOxM,EAAGuM,EAAGD,GAG3B,OAAOjI,CACT,EAGAyH,EAAK5P,UAAUsQ,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAzM,EAAI,EAAGA,EAAIuM,EAAGvM,IACrByM,IAAW,EAAJT,IAAWO,EAAIvM,EAAI,EAC1BgM,IAAM,EAGR,OAAOS,CACT,EAIAX,EAAK5P,UAAUwQ,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAItM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrB8M,EAAK9M,GAAK4M,EAAID,EAAI3M,IAClB+M,EAAK/M,GAAK6M,EAAIF,EAAI3M,GAEtB,EAEA8L,EAAK5P,UAAU8Q,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEnO,KAAKkO,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQpN,KAAKqN,IAAI,EAAIrN,KAAKsN,GAAKb,GAC/Bc,EAAQvN,KAAKwN,IAAI,EAAIxN,KAAKsN,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJrM,EAAI,EAAGA,EAAIiM,EAAGjM,IAAK,CAC1B,IAAI0M,EAAKZ,EAAKS,EAAIvM,GACd2M,EAAKZ,EAAKQ,EAAIvM,GAEd4M,EAAKd,EAAKS,EAAIvM,EAAIiM,GAClBY,EAAKd,EAAKQ,EAAIvM,EAAIiM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAIvM,GAAK0M,EAAKE,EACnBb,EAAKQ,EAAIvM,GAAK2M,EAAKE,EAEnBf,EAAKS,EAAIvM,EAAIiM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAIvM,EAAIiM,GAAKU,EAAKE,EAGnB7M,IAAMuL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,EAEb,CAGN,EAEAhC,EAAK5P,UAAU6R,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjBxM,KAAKM,IAAI6N,EAAGD,GAChBE,EAAU,EAAJ5B,EACNtM,EAAI,EACR,IAAKsM,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BtM,IAGF,OAAO,GAAKA,EAAI,EAAIkO,CACtB,EAEApC,EAAK5P,UAAUiS,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAItM,EAAI,EAAGA,EAAIsM,EAAI,EAAGtM,IAAK,CAC9B,IAAIqE,EAAIuI,EAAI5M,GAEZ4M,EAAI5M,GAAK4M,EAAIN,EAAItM,EAAI,GACrB4M,EAAIN,EAAItM,EAAI,GAAKqE,EAEjBA,EAAIwI,EAAI7M,GAER6M,EAAI7M,IAAM6M,EAAIP,EAAItM,EAAI,GACtB6M,EAAIP,EAAItM,EAAI,IAAMqE,CACpB,CACF,EAEAyH,EAAK5P,UAAUkS,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI3J,EAAQ,EACH3C,EAAI,EAAGA,EAAIsM,EAAI,EAAGtM,IAAK,CAC9B,IAAIiB,EAAoC,KAAhCnB,KAAKwO,MAAMD,EAAG,EAAIrO,EAAI,GAAKsM,GACjCxM,KAAKwO,MAAMD,EAAG,EAAIrO,GAAKsM,GACvB3J,EAEF0L,EAAGrO,GAAS,SAAJiB,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,CAE5B,CAEA,OAAOoN,CACT,EAEAvC,EAAK5P,UAAUqS,WAAa,SAAqBF,EAAIxO,EAAK+M,EAAKN,GAE7D,IADA,IAAI3J,EAAQ,EACH3C,EAAI,EAAGA,EAAIH,EAAKG,IACvB2C,GAAyB,EAAR0L,EAAGrO,GAEpB4M,EAAI,EAAI5M,GAAa,KAAR2C,EAAgBA,KAAkB,GAC/CiK,EAAI,EAAI5M,EAAI,GAAa,KAAR2C,EAAgBA,KAAkB,GAIrD,IAAK3C,EAAI,EAAIH,EAAKG,EAAIsM,IAAKtM,EACzB4M,EAAI5M,GAAK,EAGXlC,EAAiB,IAAV6E,GACP7E,EAA6B,KAAb,KAAR6E,GACV,EAEAmJ,EAAK5P,UAAUsS,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAIvO,MAAMoM,GACVtM,EAAI,EAAGA,EAAIsM,EAAGtM,IACrByO,EAAGzO,GAAK,EAGV,OAAOyO,CACT,EAEA3C,EAAK5P,UAAU6P,KAAO,SAAeC,EAAGC,EAAG1J,GACzC,IAAI+J,EAAI,EAAI9N,KAAKuP,YAAY/B,EAAE9O,OAAQ+O,EAAE/O,QAErCyP,EAAMnO,KAAK6N,QAAQC,GAEnBoC,EAAIlQ,KAAKgQ,KAAKlC,GAEdM,EAAM,IAAI1M,MAAMoM,GAChBqC,EAAO,IAAIzO,MAAMoM,GACjBsC,EAAO,IAAI1O,MAAMoM,GAEjBuC,EAAO,IAAI3O,MAAMoM,GACjBwC,EAAQ,IAAI5O,MAAMoM,GAClByC,EAAQ,IAAI7O,MAAMoM,GAElB0C,EAAOzM,EAAI7D,MACfsQ,EAAK9R,OAASoP,EAEd9N,KAAK+P,WAAWvC,EAAEtN,MAAOsN,EAAE9O,OAAQ0P,EAAKN,GACxC9N,KAAK+P,WAAWtC,EAAEvN,MAAOuN,EAAE/O,OAAQ2R,EAAMvC,GAEzC9N,KAAKwO,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtCnO,KAAKwO,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAI3M,EAAI,EAAGA,EAAIsM,EAAGtM,IAAK,CAC1B,IAAI8N,EAAKa,EAAK3O,GAAK8O,EAAM9O,GAAK4O,EAAK5O,GAAK+O,EAAM/O,GAC9C4O,EAAK5O,GAAK2O,EAAK3O,GAAK+O,EAAM/O,GAAK4O,EAAK5O,GAAK8O,EAAM9O,GAC/C2O,EAAK3O,GAAK8N,CACZ,CASA,OAPAtP,KAAK2P,UAAUQ,EAAMC,EAAMtC,GAC3B9N,KAAKwO,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvCnO,KAAK2P,UAAUa,EAAMN,EAAGpC,GACxB9N,KAAK4P,aAAaY,EAAM1C,GAExB/J,EAAI9D,SAAWuN,EAAEvN,SAAWwN,EAAExN,SAC9B8D,EAAIrF,OAAS8O,EAAE9O,OAAS+O,EAAE/O,OACnBqF,EAAIqU,QACb,EAGAzY,EAAGjC,UAAU0D,IAAM,SAAcK,GAC/B,IAAIsC,EAAM,IAAIpE,EAAG,MAEjB,OADAoE,EAAI7D,MAAQ,IAAIwB,MAAM1B,KAAKtB,OAAS+C,EAAI/C,QACjCsB,KAAK0N,MAAMjM,EAAKsC,EACzB,EAGApE,EAAGjC,UAAU+S,KAAO,SAAehP,GACjC,IAAIsC,EAAM,IAAIpE,EAAG,MAEjB,OADAoE,EAAI7D,MAAQ,IAAIwB,MAAM1B,KAAKtB,OAAS+C,EAAI/C,QACjC2O,EAAWrN,KAAMyB,EAAKsC,EAC/B,EAGApE,EAAGjC,UAAUwO,KAAO,SAAezK,GACjC,OAAOzB,KAAKsD,QAAQoK,MAAMjM,EAAKzB,KACjC,EAEAL,EAAGjC,UAAUuF,MAAQ,SAAgBxB,GACnC,IAAIy2D,EAAWz2D,EAAM,EACjBy2D,IAAUz2D,GAAOA,GAErBnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UAIb,IADA,IAAI0C,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACpC,IAAIiB,GAAqB,EAAhBzC,KAAKE,MAAMsB,IAAUC,EAC1ByC,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChBlE,KAAKE,MAAMsB,GAAU,SAAL0C,CAClB,CAOA,OALc,IAAVC,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,UAGAw5D,EAAWl4D,KAAK0G,OAAS1G,IAClC,EAEAL,EAAGjC,UAAUgT,KAAO,SAAejP,GACjC,OAAOzB,KAAKsD,QAAQL,MAAMxB,EAC5B,EAGA9B,EAAGjC,UAAUiT,IAAM,WACjB,OAAO3Q,KAAKoB,IAAIpB,KAClB,EAGAL,EAAGjC,UAAUkT,KAAO,WAClB,OAAO5Q,KAAKkM,KAAKlM,KAAKsD,QACxB,EAGA3D,EAAGjC,UAAUyF,IAAM,SAAc1B,GAC/B,IAAIgB,EA7xCN,SAAqBhB,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAIsE,aAEb6B,EAAM,EAAGA,EAAMnF,EAAE/D,OAAQkJ,IAAO,CACvC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnF,EAAEmF,GAAQnG,EAAIvB,MAAMwC,KAASmF,EAAQ,CACvC,CAEA,OAAOpF,CACT,CAkxCUoO,CAAWpP,GACnB,GAAiB,IAAbgB,EAAE/D,OAAc,OAAO,IAAIiB,EAAG,GAIlC,IADA,IAAI4F,EAAMvF,KACDwB,EAAI,EAAGA,EAAIiB,EAAE/D,QACP,IAAT+D,EAAEjB,GADsBA,IAAK+D,EAAMA,EAAIoL,OAI7C,KAAMnP,EAAIiB,EAAE/D,OACV,IAAK,IAAI8G,EAAID,EAAIoL,MAAOnP,EAAIiB,EAAE/D,OAAQ8C,IAAKgE,EAAIA,EAAEmL,MAClC,IAATlO,EAAEjB,KAEN+D,EAAMA,EAAInE,IAAIoE,IAIlB,OAAOD,CACT,EAGA5F,EAAGjC,UAAUoT,OAAS,SAAiBC,GACrCzR,EAAuB,iBAATyR,GAAqBA,GAAQ,GAC3C,IAGIvP,EAHAT,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GACjBiQ,EAAa,WAAe,GAAKjQ,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoD,EAAQ,EAEZ,IAAK3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAAK,CAChC,IAAIyP,EAAWjR,KAAKE,MAAMsB,GAAKwP,EAC3BrQ,GAAsB,EAAhBX,KAAKE,MAAMsB,IAAUyP,GAAalQ,EAC5Cf,KAAKE,MAAMsB,GAAKb,EAAIwD,EACpBA,EAAQ8M,IAAc,GAAKlQ,CAC7B,CAEIoD,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,SAET,CAEA,GAAU,IAAN+P,EAAS,CACX,IAAKjN,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAChCxB,KAAKE,MAAMsB,EAAIiN,GAAKzO,KAAKE,MAAMsB,GAGjC,IAAKA,EAAI,EAAGA,EAAIiN,EAAGjN,IACjBxB,KAAKE,MAAMsB,GAAK,EAGlBxB,KAAKtB,QAAU+P,CACjB,CAEA,OAAOzO,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUwT,MAAQ,SAAgBH,GAGnC,OADAzR,EAAyB,IAAlBU,KAAKC,UACLD,KAAK8Q,OAAOC,EACrB,EAKApR,EAAGjC,UAAUgI,OAAS,SAAiBqL,EAAMI,EAAMC,GAEjD,IAAIC,EADJ/R,EAAuB,iBAATyR,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIpQ,EAAIgQ,EAAO,GACXtC,EAAInN,KAAKC,KAAKwP,EAAOhQ,GAAK,GAAIf,KAAKtB,QACnC4S,EAAO,SAAc,WAAcvQ,GAAMA,EACzCwQ,EAAcH,EAMlB,GAJAC,GAAK5C,EACL4C,EAAI/P,KAAKM,IAAI,EAAGyP,GAGZE,EAAa,CACf,IAAK,IAAI/P,EAAI,EAAGA,EAAIiN,EAAGjN,IACrB+P,EAAYrR,MAAMsB,GAAKxB,KAAKE,MAAMsB,GAEpC+P,EAAY7S,OAAS+P,CACvB,CAEA,GAAU,IAANA,QAEG,GAAIzO,KAAKtB,OAAS+P,EAEvB,IADAzO,KAAKtB,QAAU+P,EACVjN,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAC3BxB,KAAKE,MAAMsB,GAAKxB,KAAKE,MAAMsB,EAAIiN,QAGjCzO,KAAKE,MAAM,GAAK,EAChBF,KAAKtB,OAAS,EAGhB,IAAIyF,EAAQ,EACZ,IAAK3C,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,IAAgB,IAAV2C,GAAe3C,GAAK6P,GAAI7P,IAAK,CAChE,IAAIwB,EAAuB,EAAhBhD,KAAKE,MAAMsB,GACtBxB,KAAKE,MAAMsB,GAAM2C,GAAU,GAAKpD,EAAOiC,IAASjC,EAChDoD,EAAQnB,EAAOsO,CACjB,CAYA,OATIC,GAAyB,IAAVpN,IACjBoN,EAAYrR,MAAMqR,EAAY7S,UAAYyF,GAGxB,IAAhBnE,KAAKtB,SACPsB,KAAKE,MAAM,GAAK,EAChBF,KAAKtB,OAAS,GAGTsB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU8T,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA9R,EAAyB,IAAlBU,KAAKC,UACLD,KAAK0F,OAAOqL,EAAMI,EAAMC,EACjC,EAGAzR,EAAGjC,UAAU+T,KAAO,SAAeV,GACjC,OAAO/Q,KAAKsD,QAAQ4N,MAAMH,EAC5B,EAEApR,EAAGjC,UAAUgU,MAAQ,SAAgBX,GACnC,OAAO/Q,KAAKsD,QAAQwN,OAAOC,EAC7B,EAGApR,EAAGjC,UAAUiU,KAAO,SAAeZ,GACjC,OAAO/Q,KAAKsD,QAAQkO,MAAMT,EAC5B,EAEApR,EAAGjC,UAAUkU,MAAQ,SAAgBb,GACnC,OAAO/Q,KAAKsD,QAAQoC,OAAOqL,EAC7B,EAGApR,EAAGjC,UAAU8I,MAAQ,SAAgBoB,GACnCtI,EAAsB,iBAARsI,GAAoBA,GAAO,GACzC,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,QAAIf,KAAKtB,QAAU+P,KAGXzO,KAAKE,MAAMuO,GAELjJ,GAChB,EAGA7F,EAAGjC,UAAUmU,OAAS,SAAiBd,GACrCzR,EAAuB,iBAATyR,GAAqBA,GAAQ,GAC3C,IAAIhQ,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GAIrB,GAFAzB,EAAyB,IAAlBU,KAAKC,SAAgB,2CAExBD,KAAKtB,QAAU+P,EACjB,OAAOzO,KAQT,GALU,IAANe,GACF0N,IAEFzO,KAAKtB,OAAS4C,KAAKC,IAAIkN,EAAGzO,KAAKtB,QAErB,IAANqC,EAAS,CACX,IAAIuQ,EAAO,SAAc,WAAcvQ,GAAMA,EAC7Cf,KAAKE,MAAMF,KAAKtB,OAAS,IAAM4S,CACjC,CAEA,OAAOtR,KAAKoY,QACd,EAGAzY,EAAGjC,UAAUoU,MAAQ,SAAgBf,GACnC,OAAO/Q,KAAKsD,QAAQuO,OAAOd,EAC7B,EAGApR,EAAGjC,UAAU4I,MAAQ,SAAgB7E,GAGnC,OAFAnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UACTA,EAAM,EAAUzB,KAAK+R,OAAOtQ,GAGV,IAAlBzB,KAAKC,SACa,IAAhBD,KAAKtB,SAAiC,EAAhBsB,KAAKE,MAAM,KAAWuB,GAC9CzB,KAAKE,MAAM,GAAKuB,GAAuB,EAAhBzB,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK+R,MAAMtQ,GACXzB,KAAKC,SAAW,EACTD,MAIFA,KAAKkD,OAAOzB,EACrB,EAEA9B,EAAGjC,UAAUwF,OAAS,SAAiBzB,GACrCzB,KAAKE,MAAM,IAAMuB,EAGjB,IAAK,IAAID,EAAI,EAAGA,EAAIxB,KAAKtB,QAAUsB,KAAKE,MAAMsB,IAAM,SAAWA,IAC7DxB,KAAKE,MAAMsB,IAAM,SACbA,IAAMxB,KAAKtB,OAAS,EACtBsB,KAAKE,MAAMsB,EAAI,GAAK,EAEpBxB,KAAKE,MAAMsB,EAAI,KAKnB,OAFAxB,KAAKtB,OAAS4C,KAAKM,IAAI5B,KAAKtB,OAAQ8C,EAAI,GAEjCxB,IACT,EAGAL,EAAGjC,UAAUqU,MAAQ,SAAgBtQ,GAGnC,GAFAnC,EAAsB,iBAARmC,GACdnC,EAAOmC,EAAM,UACTA,EAAM,EAAG,OAAOzB,KAAKsG,OAAO7E,GAEhC,GAAsB,IAAlBzB,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKsG,MAAM7E,GACXzB,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAMuB,EAEG,IAAhBzB,KAAKtB,QAAgBsB,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAIuB,EAAI,EAAGA,EAAIxB,KAAKtB,QAAUsB,KAAKE,MAAMsB,GAAK,EAAGA,IACpDxB,KAAKE,MAAMsB,IAAM,SACjBxB,KAAKE,MAAMsB,EAAI,IAAM,EAIzB,OAAOxB,KAAKoY,QACd,EAEAzY,EAAGjC,UAAUsU,KAAO,SAAevQ,GACjC,OAAOzB,KAAKsD,QAAQgD,MAAM7E,EAC5B,EAEA9B,EAAGjC,UAAUuU,KAAO,SAAexQ,GACjC,OAAOzB,KAAKsD,QAAQyO,MAAMtQ,EAC5B,EAEA9B,EAAGjC,UAAUwU,KAAO,WAGlB,OAFAlS,KAAKC,SAAW,EAETD,IACT,EAEAL,EAAGjC,UAAU0I,IAAM,WACjB,OAAOpG,KAAKsD,QAAQ4O,MACtB,EAEAvS,EAAGjC,UAAUyU,aAAe,SAAuB1Q,EAAKL,EAAKgR,GAC3D,IACI5Q,EAIAiB,EALApB,EAAMI,EAAI/C,OAAS0T,EAGvBpS,KAAKuD,QAAQlC,GAGb,IAAI8C,EAAQ,EACZ,IAAK3C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CAC/BiB,GAA6B,EAAxBzC,KAAKE,MAAMsB,EAAI4Q,IAAcjO,EAClC,IAAIrC,GAAwB,EAAfL,EAAIvB,MAAMsB,IAAUJ,EAEjC+C,IADA1B,GAAa,SAARX,IACS,KAAQA,EAAQ,SAAa,GAC3C9B,KAAKE,MAAMsB,EAAI4Q,GAAa,SAAJ3P,CAC1B,CACA,KAAOjB,EAAIxB,KAAKtB,OAAS0T,EAAO5Q,IAE9B2C,GADA1B,GAA6B,EAAxBzC,KAAKE,MAAMsB,EAAI4Q,IAAcjO,IACrB,GACbnE,KAAKE,MAAMsB,EAAI4Q,GAAa,SAAJ3P,EAG1B,GAAc,IAAV0B,EAAa,OAAOnE,KAAKoY,SAK7B,IAFA9Y,GAAkB,IAAX6E,GACPA,EAAQ,EACH3C,EAAI,EAAGA,EAAIxB,KAAKtB,OAAQ8C,IAE3B2C,GADA1B,IAAsB,EAAhBzC,KAAKE,MAAMsB,IAAU2C,IACd,GACbnE,KAAKE,MAAMsB,GAAS,SAAJiB,EAIlB,OAFAzC,KAAKC,SAAW,EAETD,KAAKoY,QACd,EAEAzY,EAAGjC,UAAU2U,SAAW,SAAmB5Q,EAAK6Q,GAC9C,IAAIF,GAAQpS,KAAKtB,OAAS+C,EAAI/C,QAE1BsF,EAAIhE,KAAKsD,QACTW,EAAIxC,EAGJ8Q,EAA8B,EAAxBtO,EAAE/D,MAAM+D,EAAEvF,OAAS,GAGf,IADd0T,EAAQ,GADMpS,KAAK4F,WAAW2M,MAG5BtO,EAAIA,EAAEyN,MAAMU,GACZpO,EAAE8M,OAAOsB,GACTG,EAA8B,EAAxBtO,EAAE/D,MAAM+D,EAAEvF,OAAS,IAI3B,IACI8G,EADAiK,EAAIzL,EAAEtF,OAASuF,EAAEvF,OAGrB,GAAa,QAAT4T,EAAgB,EAClB9M,EAAI,IAAI7F,EAAG,OACTjB,OAAS+Q,EAAI,EACfjK,EAAEtF,MAAQ,IAAIwB,MAAM8D,EAAE9G,QACtB,IAAK,IAAI8C,EAAI,EAAGA,EAAIgE,EAAE9G,OAAQ8C,IAC5BgE,EAAEtF,MAAMsB,GAAK,CAEjB,CAEA,IAAIgR,EAAOxO,EAAEV,QAAQ6O,aAAalO,EAAG,EAAGwL,GAClB,IAAlB+C,EAAKvS,WACP+D,EAAIwO,EACAhN,IACFA,EAAEtF,MAAMuP,GAAK,IAIjB,IAAK,IAAIjN,EAAIiN,EAAI,EAAGjN,GAAK,EAAGA,IAAK,CAC/B,IAAIiQ,EAAmC,UAAL,EAAxBzO,EAAE9D,MAAM+D,EAAEvF,OAAS8D,KACE,EAA5BwB,EAAE9D,MAAM+D,EAAEvF,OAAS8D,EAAI,IAO1B,IAHAiQ,EAAKnR,KAAKC,IAAKkR,EAAKF,EAAO,EAAG,UAE9BvO,EAAEmO,aAAalO,EAAGwO,EAAIjQ,GACA,IAAfwB,EAAE/D,UACPwS,IACAzO,EAAE/D,SAAW,EACb+D,EAAEmO,aAAalO,EAAG,EAAGzB,GAChBwB,EAAEW,WACLX,EAAE/D,UAAY,GAGduF,IACFA,EAAEtF,MAAMsC,GAAKiQ,EAEjB,CAWA,OAVIjN,GACFA,EAAE4S,SAEJpU,EAAEoU,SAGW,QAAT9F,GAA4B,IAAVF,GACpBpO,EAAE0B,OAAO0M,GAGJ,CACLM,IAAKlN,GAAK,KACVzC,IAAKiB,EAET,EAMArE,EAAGjC,UAAUiV,OAAS,SAAiBlR,EAAK6Q,EAAMM,GAGhD,OAFAtT,GAAQmC,EAAIkD,UAER3E,KAAK2E,SACA,CACL+N,IAAK,IAAI/S,EAAG,GACZoD,IAAK,IAAIpD,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjBwB,EAAIxB,UAC7BsF,EAAMvF,KAAK4G,MAAM+L,OAAOlR,EAAK6Q,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGH,QAAT0L,IACFvP,EAAMwC,EAAIxC,IAAI6D,MACVgM,GAA6B,IAAjB7P,EAAI9C,UAClB8C,EAAI+E,KAAKrG,IAIN,CACLiR,IAAKA,EACL3P,IAAKA,IAIa,IAAlB/C,KAAKC,UAAmC,IAAjBwB,EAAIxB,UAC7BsF,EAAMvF,KAAK2S,OAAOlR,EAAImF,MAAO0L,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGT,CACL8L,IAAKA,EACL3P,IAAKwC,EAAIxC,MAI0B,IAAlC/C,KAAKC,SAAWwB,EAAIxB,WACvBsF,EAAMvF,KAAK4G,MAAM+L,OAAOlR,EAAImF,MAAO0L,GAEtB,QAATA,IACFvP,EAAMwC,EAAIxC,IAAI6D,MACVgM,GAA6B,IAAjB7P,EAAI9C,UAClB8C,EAAIgF,KAAKtG,IAIN,CACLiR,IAAKnN,EAAImN,IACT3P,IAAKA,IAOLtB,EAAI/C,OAASsB,KAAKtB,QAAUsB,KAAK+B,IAAIN,GAAO,EACvC,CACLiR,IAAK,IAAI/S,EAAG,GACZoD,IAAK/C,MAKU,IAAfyB,EAAI/C,OACO,QAAT4T,EACK,CACLI,IAAK1S,KAAK6S,KAAKpR,EAAIvB,MAAM,IACzB6C,IAAK,MAII,QAATuP,EACK,CACLI,IAAK,KACL3P,IAAK,IAAIpD,EAAGK,KAAK83D,MAAMr2D,EAAIvB,MAAM,MAI9B,CACLwS,IAAK1S,KAAK6S,KAAKpR,EAAIvB,MAAM,IACzB6C,IAAK,IAAIpD,EAAGK,KAAK83D,MAAMr2D,EAAIvB,MAAM,MAI9BF,KAAKqS,SAAS5Q,EAAK6Q,GAlF1B,IAAII,EAAK3P,EAAKwC,CAmFhB,EAGA5F,EAAGjC,UAAUgV,IAAM,SAAcjR,GAC/B,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAOiR,GACxC,EAGA/S,EAAGjC,UAAUqF,IAAM,SAActB,GAC/B,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAOsB,GACxC,EAEApD,EAAGjC,UAAUoV,KAAO,SAAerR,GACjC,OAAOzB,KAAK2S,OAAOlR,EAAK,OAAO,GAAMsB,GACvC,EAGApD,EAAGjC,UAAUqV,SAAW,SAAmBtR,GACzC,IAAIuR,EAAKhT,KAAK2S,OAAOlR,GAGrB,GAAIuR,EAAGjQ,IAAI4B,SAAU,OAAOqO,EAAGN,IAE/B,IAAI3P,EAA0B,IAApBiQ,EAAGN,IAAIzS,SAAiB+S,EAAGjQ,IAAIgF,KAAKtG,GAAOuR,EAAGjQ,IAEpDkQ,EAAOxR,EAAImQ,MAAM,GACjBsB,EAAKzR,EAAIgE,MAAM,GACf1D,EAAMgB,EAAIhB,IAAIkR,GAGlB,OAAIlR,EAAM,GAAa,IAAPmR,GAAoB,IAARnR,EAAmBiR,EAAGN,IAGvB,IAApBM,EAAGN,IAAIzS,SAAiB+S,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIpM,MAAM,EAChE,EAEA3G,EAAGjC,UAAUo6D,MAAQ,SAAgBr2D,GACnC,IAAIy2D,EAAWz2D,EAAM,EACjBy2D,IAAUz2D,GAAOA,GAErBnC,EAAOmC,GAAO,UAId,IAHA,IAAIsN,GAAK,GAAK,IAAMtN,EAEhB0R,EAAM,EACD3R,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IACpC2R,GAAOpE,EAAIoE,GAAuB,EAAhBnT,KAAKE,MAAMsB,KAAWC,EAG1C,OAAOy2D,GAAY/kD,EAAMA,CAC3B,EAGAxT,EAAGjC,UAAUkH,KAAO,SAAenD,GACjC,OAAOzB,KAAK83D,MAAMr2D,EACpB,EAGA9B,EAAGjC,UAAUmH,MAAQ,SAAgBpD,GACnC,IAAIy2D,EAAWz2D,EAAM,EACjBy2D,IAAUz2D,GAAOA,GAErBnC,EAAOmC,GAAO,UAGd,IADA,IAAI0C,EAAQ,EACH3C,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACzC,IAAIiB,GAAqB,EAAhBzC,KAAKE,MAAMsB,IAAkB,SAAR2C,EAC9BnE,KAAKE,MAAMsB,GAAMiB,EAAIhB,EAAO,EAC5B0C,EAAQ1B,EAAIhB,CACd,CAGA,OADAzB,KAAKoY,SACE8/C,EAAWl4D,KAAK0G,OAAS1G,IAClC,EAEAL,EAAGjC,UAAUmV,KAAO,SAAepR,GACjC,OAAOzB,KAAKsD,QAAQuB,MAAMpD,EAC5B,EAEA9B,EAAGjC,UAAU0V,KAAO,SAAerE,GACjCzP,EAAsB,IAAfyP,EAAE9O,UACTX,GAAQyP,EAAEpK,UAEV,IAAI6I,EAAIxN,KACJyN,EAAIsB,EAAEzL,QAGRkK,EADiB,IAAfA,EAAEvN,SACAuN,EAAEsF,KAAK/D,GAEPvB,EAAElK,QAaR,IATA,IAAI+P,EAAI,IAAI1T,EAAG,GACX2T,EAAI,IAAI3T,EAAG,GAGX4T,EAAI,IAAI5T,EAAG,GACX6T,EAAI,IAAI7T,EAAG,GAEX8T,EAAI,EAEDjG,EAAEkG,UAAYjG,EAAEiG,UACrBlG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP+N,EAMJ,IAHA,IAAIE,EAAKlG,EAAEnK,QACPsQ,EAAKpG,EAAElK,SAEHkK,EAAE7I,UAAU,CAClB,IAAK,IAAInD,EAAI,EAAGqS,EAAK,EAAyB,IAArBrG,EAAEtN,MAAM,GAAK2T,IAAarS,EAAI,KAAMA,EAAGqS,IAAO,GACvE,GAAIrS,EAAI,EAEN,IADAgM,EAAE9H,OAAOlE,GACFA,KAAM,IACP6R,EAAES,SAAWR,EAAEQ,WACjBT,EAAEvL,KAAK6L,GACPL,EAAEvL,KAAK6L,IAGTP,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIb,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArBtG,EAAEvN,MAAM,GAAK6T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAiL,EAAE/H,OAAOlD,GACFA,KAAM,IACP+Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAEzL,KAAK6L,GACPH,EAAEzL,KAAK6L,IAGTL,EAAE7N,OAAO,GACT8N,EAAE9N,OAAO,GAIT8H,EAAEzL,IAAI0L,IAAM,GACdD,EAAEzF,KAAK0F,GACP4F,EAAEtL,KAAKwL,GACPD,EAAEvL,KAAKyL,KAEP/F,EAAE1F,KAAKyF,GACP+F,EAAExL,KAAKsL,GACPG,EAAEzL,KAAKuL,GAEX,CAEA,MAAO,CACLtP,EAAGuP,EACHtP,EAAGuP,EACHQ,IAAKvG,EAAEqD,OAAO2C,GAElB,EAKA9T,EAAGjC,UAAUuW,OAAS,SAAiBlF,GACrCzP,EAAsB,IAAfyP,EAAE9O,UACTX,GAAQyP,EAAEpK,UAEV,IAAIX,EAAIhE,KACJiE,EAAI8K,EAAEzL,QAGRU,EADiB,IAAfA,EAAE/D,SACA+D,EAAE8O,KAAK/D,GAEP/K,EAAEV,QAQR,IALA,IAuCIiC,EAvCA2O,EAAK,IAAIvU,EAAG,GACZwU,EAAK,IAAIxU,EAAG,GAEZyU,EAAQnQ,EAAEX,QAEPU,EAAEqQ,KAAK,GAAK,GAAKpQ,EAAEoQ,KAAK,GAAK,GAAG,CACrC,IAAK,IAAI7S,EAAI,EAAGqS,EAAK,EAAyB,IAArB7P,EAAE9D,MAAM,GAAK2T,IAAarS,EAAI,KAAMA,EAAGqS,IAAO,GACvE,GAAIrS,EAAI,EAEN,IADAwC,EAAE0B,OAAOlE,GACFA,KAAM,GACP0S,EAAGJ,SACLI,EAAGpM,KAAKsM,GAGVF,EAAGxO,OAAO,GAId,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArB9P,EAAE/D,MAAM,GAAK6T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAyB,EAAEyB,OAAOlD,GACFA,KAAM,GACP2R,EAAGL,SACLK,EAAGrM,KAAKsM,GAGVD,EAAGzO,OAAO,GAIV1B,EAAEjC,IAAIkC,IAAM,GACdD,EAAE+D,KAAK9D,GACPiQ,EAAGnM,KAAKoM,KAERlQ,EAAE8D,KAAK/D,GACPmQ,EAAGpM,KAAKmM,GAEZ,CAaA,OATE3O,EADgB,IAAdvB,EAAEqQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB9O,EAAIuC,KAAKiH,GAGJxJ,CACT,EAEA5F,EAAGjC,UAAUsW,IAAM,SAAcvS,GAC/B,GAAIzB,KAAK2E,SAAU,OAAOlD,EAAI2E,MAC9B,GAAI3E,EAAIkD,SAAU,OAAO3E,KAAKoG,MAE9B,IAAIpC,EAAIhE,KAAKsD,QACTW,EAAIxC,EAAI6B,QACZU,EAAE/D,SAAW,EACbgE,EAAEhE,SAAW,EAGb,IAAK,IAAImS,EAAQ,EAAGpO,EAAE0P,UAAYzP,EAAEyP,SAAUtB,IAC5CpO,EAAE0B,OAAO,GACTzB,EAAEyB,OAAO,GAGX,OAAG,CACD,KAAO1B,EAAE0P,UACP1P,EAAE0B,OAAO,GAEX,KAAOzB,EAAEyP,UACPzP,EAAEyB,OAAO,GAGX,IAAI3E,EAAIiD,EAAEjC,IAAIkC,GACd,GAAIlD,EAAI,EAAG,CAET,IAAI8E,EAAI7B,EACRA,EAAIC,EACJA,EAAI4B,CACN,MAAO,GAAU,IAAN9E,GAAyB,IAAdkD,EAAEoQ,KAAK,GAC3B,MAGFrQ,EAAE+D,KAAK9D,EACT,CAEA,OAAOA,EAAE6M,OAAOsB,EAClB,EAGAzS,EAAGjC,UAAU4W,KAAO,SAAe7S,GACjC,OAAOzB,KAAKoT,KAAK3R,GAAKuC,EAAE8O,KAAKrR,EAC/B,EAEA9B,EAAGjC,UAAUgW,OAAS,WACpB,OAA+B,IAAP,EAAhB1T,KAAKE,MAAM,GACrB,EAEAP,EAAGjC,UAAUoW,MAAQ,WACnB,OAA+B,IAAP,EAAhB9T,KAAKE,MAAM,GACrB,EAGAP,EAAGjC,UAAU+H,MAAQ,SAAgBhE,GACnC,OAAOzB,KAAKE,MAAM,GAAKuB,CACzB,EAGA9B,EAAGjC,UAAU6W,MAAQ,SAAgB3M,GACnCtI,EAAsB,iBAARsI,GACd,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,GAAIf,KAAKtB,QAAU+P,EAGjB,OAFAzO,KAAKuD,QAAQkL,EAAI,GACjBzO,KAAKE,MAAMuO,IAAMjJ,EACVxF,KAKT,IADA,IAAImE,EAAQqB,EACHhE,EAAIiN,EAAa,IAAVtK,GAAe3C,EAAIxB,KAAKtB,OAAQ8C,IAAK,CACnD,IAAIiB,EAAoB,EAAhBzC,KAAKE,MAAMsB,GAEnB2C,GADA1B,GAAK0B,KACS,GACd1B,GAAK,SACLzC,KAAKE,MAAMsB,GAAKiB,CAClB,CAKA,OAJc,IAAV0B,IACFnE,KAAKE,MAAMsB,GAAK2C,EAChBnE,KAAKtB,UAEAsB,IACT,EAEAL,EAAGjC,UAAUiH,OAAS,WACpB,OAAuB,IAAhB3E,KAAKtB,QAAkC,IAAlBsB,KAAKE,MAAM,EACzC,EAEAP,EAAGjC,UAAU2W,KAAO,SAAe5S,GACjC,IAOI8D,EAPAtF,EAAWwB,EAAM,EAErB,GAAsB,IAAlBzB,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAKoY,SAGDpY,KAAKtB,OAAS,EAChB6G,EAAM,MACD,CACDtF,IACFwB,GAAOA,GAGTnC,EAAOmC,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhBzC,KAAKE,MAAM,GACnBqF,EAAM9C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,CACvC,CACA,OAAsB,IAAlBzB,KAAKC,SAA8B,GAANsF,EAC1BA,CACT,EAMA5F,EAAGjC,UAAUqE,IAAM,SAAcN,GAC/B,GAAsB,IAAlBzB,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjBwB,EAAIxB,SAAgB,OAAO,EAEtD,IAAIsF,EAAMvF,KAAKwU,KAAK/S,GACpB,OAAsB,IAAlBzB,KAAKC,SAA8B,GAANsF,EAC1BA,CACT,EAGA5F,EAAGjC,UAAU8W,KAAO,SAAe/S,GAEjC,GAAIzB,KAAKtB,OAAS+C,EAAI/C,OAAQ,OAAO,EACrC,GAAIsB,KAAKtB,OAAS+C,EAAI/C,OAAQ,OAAQ,EAGtC,IADA,IAAI6G,EAAM,EACD/D,EAAIxB,KAAKtB,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CACzC,IAAIwC,EAAoB,EAAhBhE,KAAKE,MAAMsB,GACfyC,EAAmB,EAAfxC,EAAIvB,MAAMsB,GAElB,GAAIwC,IAAMC,EAAV,CACID,EAAIC,EACNsB,GAAO,EACEvB,EAAIC,IACbsB,EAAM,GAER,KANqB,CAOvB,CACA,OAAOA,CACT,EAEA5F,EAAGjC,UAAU+W,IAAM,SAAchT,GAC/B,OAA0B,IAAnBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUgX,GAAK,SAAajT,GAC7B,OAAyB,IAAlBzB,KAAK+B,IAAIN,EAClB,EAEA9B,EAAGjC,UAAUiX,KAAO,SAAelT,GACjC,OAAOzB,KAAKqU,KAAK5S,IAAQ,CAC3B,EAEA9B,EAAGjC,UAAUkX,IAAM,SAAcnT,GAC/B,OAAOzB,KAAK+B,IAAIN,IAAQ,CAC1B,EAEA9B,EAAGjC,UAAUmX,IAAM,SAAcpT,GAC/B,OAA2B,IAApBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUoX,GAAK,SAAarT,GAC7B,OAA0B,IAAnBzB,KAAK+B,IAAIN,EAClB,EAEA9B,EAAGjC,UAAUqX,KAAO,SAAetT,GACjC,OAAOzB,KAAKqU,KAAK5S,IAAQ,CAC3B,EAEA9B,EAAGjC,UAAUsX,IAAM,SAAcvT,GAC/B,OAAOzB,KAAK+B,IAAIN,IAAQ,CAC1B,EAEA9B,EAAGjC,UAAUuX,IAAM,SAAcxT,GAC/B,OAA0B,IAAnBzB,KAAKqU,KAAK5S,EACnB,EAEA9B,EAAGjC,UAAUwX,GAAK,SAAazT,GAC7B,OAAyB,IAAlBzB,KAAK+B,IAAIN,EAClB,EAMA9B,EAAGQ,IAAM,SAAcsB,GACrB,OAAO,IAAI0T,EAAI1T,EACjB,EAEA9B,EAAGjC,UAAU0X,MAAQ,SAAgBC,GAGnC,OAFA/V,GAAQU,KAAKG,IAAK,yCAClBb,EAAyB,IAAlBU,KAAKC,SAAgB,iCACrBoV,EAAIC,UAAUtV,MAAMuV,UAAUF,EACvC,EAEA1V,EAAGjC,UAAU8X,QAAU,WAErB,OADAlW,EAAOU,KAAKG,IAAK,wDACVH,KAAKG,IAAIsV,YAAYzV,KAC9B,EAEAL,EAAGjC,UAAU6X,UAAY,SAAoBF,GAE3C,OADArV,KAAKG,IAAMkV,EACJrV,IACT,EAEAL,EAAGjC,UAAUgY,SAAW,SAAmBL,GAEzC,OADA/V,GAAQU,KAAKG,IAAK,yCACXH,KAAKuV,UAAUF,EACxB,EAEA1V,EAAGjC,UAAUiY,OAAS,SAAiBlU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI6H,IAAIhI,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUkY,QAAU,SAAkBnU,GAEvC,OADAnC,EAAOU,KAAKG,IAAK,uCACVH,KAAKG,IAAI2H,KAAK9H,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAUmY,OAAS,SAAiBpU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI8H,IAAIjI,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUoY,QAAU,SAAkBrU,GAEvC,OADAnC,EAAOU,KAAKG,IAAK,uCACVH,KAAKG,IAAI4H,KAAK/H,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAUqY,OAAS,SAAiBtU,GAErC,OADAnC,EAAOU,KAAKG,IAAK,sCACVH,KAAKG,IAAI6V,IAAIhW,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUuY,OAAS,SAAiBxU,GAGrC,OAFAnC,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAI+V,SAASlW,KAAMyB,GACjBzB,KAAKG,IAAIiB,IAAIpB,KAAMyB,EAC5B,EAEA9B,EAAGjC,UAAUyY,QAAU,SAAkB1U,GAGvC,OAFAnC,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAI+V,SAASlW,KAAMyB,GACjBzB,KAAKG,IAAI+L,KAAKlM,KAAMyB,EAC7B,EAEA9B,EAAGjC,UAAU0Y,OAAS,WAGpB,OAFA9W,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIwQ,IAAI3Q,KACtB,EAEAL,EAAGjC,UAAU4Y,QAAU,WAGrB,OAFAhX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIyQ,KAAK5Q,KACvB,EAGAL,EAAGjC,UAAU6Y,QAAU,WAGrB,OAFAjX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIqW,KAAKxW,KACvB,EAEAL,EAAGjC,UAAU+Y,QAAU,WAGrB,OAFAnX,EAAOU,KAAKG,IAAK,uCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAImU,KAAKtU,KACvB,EAGAL,EAAGjC,UAAUgZ,OAAS,WAGpB,OAFApX,EAAOU,KAAKG,IAAK,sCACjBH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIyG,IAAI5G,KACtB,EAEAL,EAAGjC,UAAUiZ,OAAS,SAAiBlV,GAGrC,OAFAnC,EAAOU,KAAKG,MAAQsB,EAAItB,IAAK,qBAC7BH,KAAKG,IAAIkW,SAASrW,MACXA,KAAKG,IAAIgD,IAAInD,KAAMyB,EAC5B,EAGA,IAAImV,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMnI,GAErB/O,KAAKkX,KAAOA,EACZlX,KAAK+O,EAAI,IAAIpP,EAAGoP,EAAG,IACnB/O,KAAKwP,EAAIxP,KAAK+O,EAAEhJ,YAChB/F,KAAKoE,EAAI,IAAIzE,EAAG,GAAGmR,OAAO9Q,KAAKwP,GAAGzH,KAAK/H,KAAK+O,GAE5C/O,KAAKmX,IAAMnX,KAAKoX,MAClB,CAgDA,SAASC,IACPJ,EAAOK,KACLtX,KACA,OACA,0EACJ,CA8DA,SAASuX,IACPN,EAAOK,KACLtX,KACA,OACA,iEACJ,CAGA,SAASwX,IACPP,EAAOK,KACLtX,KACA,OACA,wDACJ,CAGA,SAASyX,IAEPR,EAAOK,KACLtX,KACA,QACA,sEACJ,CA6CA,SAASmV,EAAK1F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIiI,EAAQ/X,EAAGgY,OAAOlI,GACtBzP,KAAKyP,EAAIiI,EAAM3I,EACf/O,KAAK0X,MAAQA,CACf,MACEpY,EAAOmQ,EAAEgF,IAAI,GAAI,kCACjBzU,KAAKyP,EAAIA,EACTzP,KAAK0X,MAAQ,IAEjB,CAkOA,SAASE,EAAMnI,GACb0F,EAAImC,KAAKtX,KAAMyP,GAEfzP,KAAKoS,MAAQpS,KAAKyP,EAAE1J,YAChB/F,KAAKoS,MAAQ,IAAO,IACtBpS,KAAKoS,OAAS,GAAMpS,KAAKoS,MAAQ,IAGnCpS,KAAKe,EAAI,IAAIpB,EAAG,GAAGmR,OAAO9Q,KAAKoS,OAC/BpS,KAAKkT,GAAKlT,KAAK6X,KAAK7X,KAAKe,EAAE4P,OAC3B3Q,KAAK8X,KAAO9X,KAAKe,EAAEkT,OAAOjU,KAAKyP,GAE/BzP,KAAK+X,KAAO/X,KAAK8X,KAAK1W,IAAIpB,KAAKe,GAAGgR,MAAM,GAAGW,IAAI1S,KAAKyP,GACpDzP,KAAK+X,KAAO/X,KAAK+X,KAAKjF,KAAK9S,KAAKe,GAChCf,KAAK+X,KAAO/X,KAAKe,EAAEkH,IAAIjI,KAAK+X,KAC9B,CA/aAd,EAAOvZ,UAAU0Z,KAAO,WACtB,IAAID,EAAM,IAAIxX,EAAG,MAEjB,OADAwX,EAAIjX,MAAQ,IAAIwB,MAAMJ,KAAKiB,KAAKvC,KAAKwP,EAAI,KAClC2H,CACT,EAEAF,EAAOvZ,UAAUsa,QAAU,SAAkBvW,GAG3C,IACIwW,EADAlX,EAAIU,EAGR,GACEzB,KAAKkY,MAAMnX,EAAGf,KAAKmX,KAGnBc,GADAlX,GADAA,EAAIf,KAAKmY,MAAMpX,IACT+G,KAAK9H,KAAKmX,MACPpR,kBACFkS,EAAOjY,KAAKwP,GAErB,IAAIzN,EAAMkW,EAAOjY,KAAKwP,GAAK,EAAIzO,EAAEyT,KAAKxU,KAAK+O,GAgB3C,OAfY,IAARhN,GACFhB,EAAEb,MAAM,GAAK,EACba,EAAErC,OAAS,GACFqD,EAAM,EACfhB,EAAEgH,KAAK/H,KAAK+O,QAEI3P,IAAZ2B,EAAE4B,MAEJ5B,EAAE4B,QAGF5B,EAAEqX,SAICrX,CACT,EAEAkW,EAAOvZ,UAAUwa,MAAQ,SAAgBG,EAAOtU,GAC9CsU,EAAM3S,OAAO1F,KAAKwP,EAAG,EAAGzL,EAC1B,EAEAkT,EAAOvZ,UAAUya,MAAQ,SAAgB1W,GACvC,OAAOA,EAAIyK,KAAKlM,KAAKoE,EACvB,EAQA1E,EAAS2X,EAAMJ,GAEfI,EAAK3Z,UAAUwa,MAAQ,SAAgBG,EAAOC,GAK5C,IAHA,IAAIhH,EAAO,QAEPiH,EAASjX,KAAKC,IAAI8W,EAAM3Z,OAAQ,GAC3B8C,EAAI,EAAGA,EAAI+W,EAAQ/W,IAC1B8W,EAAOpY,MAAMsB,GAAK6W,EAAMnY,MAAMsB,GAIhC,GAFA8W,EAAO5Z,OAAS6Z,EAEZF,EAAM3Z,QAAU,EAGlB,OAFA2Z,EAAMnY,MAAM,GAAK,OACjBmY,EAAM3Z,OAAS,GAKjB,IAAI8Z,EAAOH,EAAMnY,MAAM,GAGvB,IAFAoY,EAAOpY,MAAMoY,EAAO5Z,UAAY8Z,EAAOlH,EAElC9P,EAAI,GAAIA,EAAI6W,EAAM3Z,OAAQ8C,IAAK,CAClC,IAAIiX,EAAwB,EAAjBJ,EAAMnY,MAAMsB,GACvB6W,EAAMnY,MAAMsB,EAAI,KAAQiX,EAAOnH,IAAS,EAAMkH,IAAS,GACvDA,EAAOC,CACT,CACAD,KAAU,GACVH,EAAMnY,MAAMsB,EAAI,IAAMgX,EACT,IAATA,GAAcH,EAAM3Z,OAAS,GAC/B2Z,EAAM3Z,QAAU,GAEhB2Z,EAAM3Z,QAAU,CAEpB,EAEA2Y,EAAK3Z,UAAUya,MAAQ,SAAgB1W,GAErCA,EAAIvB,MAAMuB,EAAI/C,QAAU,EACxB+C,EAAIvB,MAAMuB,EAAI/C,OAAS,GAAK,EAC5B+C,EAAI/C,QAAU,EAId,IADA,IAAIwF,EAAK,EACA1C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CACnC,IAAIiB,EAAmB,EAAfhB,EAAIvB,MAAMsB,GAClB0C,GAAU,IAAJzB,EACNhB,EAAIvB,MAAMsB,GAAU,SAAL0C,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,EACtC,CASA,OANkC,IAA9BzC,EAAIvB,MAAMuB,EAAI/C,OAAS,KACzB+C,EAAI/C,SAC8B,IAA9B+C,EAAIvB,MAAMuB,EAAI/C,OAAS,IACzB+C,EAAI/C,UAGD+C,CACT,EAQA/B,EAAS6X,EAAMN,GAQfvX,EAAS8X,EAAMP,GASfvX,EAAS+X,EAAQR,GAEjBQ,EAAO/Z,UAAUya,MAAQ,SAAgB1W,GAGvC,IADA,IAAI0C,EAAQ,EACH3C,EAAI,EAAGA,EAAIC,EAAI/C,OAAQ8C,IAAK,CACnC,IAAIwE,EAA0B,IAAL,EAAfvE,EAAIvB,MAAMsB,IAAiB2C,EACjCD,EAAU,SAAL8B,EACTA,KAAQ,GAERvE,EAAIvB,MAAMsB,GAAK0C,EACfC,EAAQ6B,CACV,CAIA,OAHc,IAAV7B,IACF1C,EAAIvB,MAAMuB,EAAI/C,UAAYyF,GAErB1C,CACT,EAGA9B,EAAGgY,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAIzX,MAAM,iBAAmByX,GAFnCQ,EAAQ,IAAID,CAGd,CAGA,OAFAb,EAAOM,GAAQQ,EAERA,CACT,EAiBAvC,EAAIzX,UAAU2Y,SAAW,SAAmBrS,GAC1C1E,EAAsB,IAAf0E,EAAE/D,SAAgB,iCACzBX,EAAO0E,EAAE7D,IAAK,kCAChB,EAEAgV,EAAIzX,UAAUwY,SAAW,SAAmBlS,EAAGC,GAC7C3E,EAAqC,IAA7B0E,EAAE/D,SAAWgE,EAAEhE,UAAiB,iCACxCX,EAAO0E,EAAE7D,KAAO6D,EAAE7D,MAAQ8D,EAAE9D,IAC1B,kCACJ,EAEAgV,EAAIzX,UAAUma,KAAO,SAAe7T,GAClC,OAAIhE,KAAK0X,MAAc1X,KAAK0X,MAAMM,QAAQhU,GAAGuR,UAAUvV,OAEvD23D,EAAK3zD,EAAGA,EAAE8O,KAAK9S,KAAKyP,GAAG8F,UAAUvV,OAC1BgE,EACT,EAEAmR,EAAIzX,UAAUkJ,IAAM,SAAc5C,GAChC,OAAIA,EAAEW,SACGX,EAAEV,QAGJtD,KAAKyP,EAAExH,IAAIjE,GAAGuR,UAAUvV,KACjC,EAEAmV,EAAIzX,UAAUsK,IAAM,SAAchE,EAAGC,GACnCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEgE,IAAI/D,GAIhB,OAHIsB,EAAIxD,IAAI/B,KAAKyP,IAAM,GACrBlK,EAAIwC,KAAK/H,KAAKyP,GAETlK,EAAIgQ,UAAUvV,KACvB,EAEAmV,EAAIzX,UAAUoK,KAAO,SAAe9D,EAAGC,GACrCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE8D,KAAK7D,GAIjB,OAHIsB,EAAIxD,IAAI/B,KAAKyP,IAAM,GACrBlK,EAAIwC,KAAK/H,KAAKyP,GAETlK,CACT,EAEA4P,EAAIzX,UAAUuK,IAAM,SAAcjE,EAAGC,GACnCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEiE,IAAIhE,GAIhB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK9H,KAAKyP,GAETlK,EAAIgQ,UAAUvV,KACvB,EAEAmV,EAAIzX,UAAUqK,KAAO,SAAe/D,EAAGC,GACrCjE,KAAKkW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE+D,KAAK9D,GAIjB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK9H,KAAKyP,GAETlK,CACT,EAEA4P,EAAIzX,UAAUsY,IAAM,SAAchS,EAAGvC,GAEnC,OADAzB,KAAKqW,SAASrS,GACPhE,KAAK6X,KAAK7T,EAAE0N,MAAMjQ,GAC3B,EAEA0T,EAAIzX,UAAUwO,KAAO,SAAelI,EAAGC,GAErC,OADAjE,KAAKkW,SAASlS,EAAGC,GACVjE,KAAK6X,KAAK7T,EAAEkI,KAAKjI,GAC1B,EAEAkR,EAAIzX,UAAU0D,IAAM,SAAc4C,EAAGC,GAEnC,OADAjE,KAAKkW,SAASlS,EAAGC,GACVjE,KAAK6X,KAAK7T,EAAE5C,IAAI6C,GACzB,EAEAkR,EAAIzX,UAAUkT,KAAO,SAAe5M,GAClC,OAAOhE,KAAKkM,KAAKlI,EAAGA,EAAEV,QACxB,EAEA6R,EAAIzX,UAAUiT,IAAM,SAAc3M,GAChC,OAAOhE,KAAKoB,IAAI4C,EAAGA,EACrB,EAEAmR,EAAIzX,UAAU8Y,KAAO,SAAexS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEV,QAEzB,IAAIoV,EAAO1Y,KAAKyP,EAAEhK,MAAM,GAIxB,GAHAnG,EAAOoZ,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIvV,EAAMnD,KAAKyP,EAAEzH,IAAI,IAAIrI,EAAG,IAAI+F,OAAO,GACvC,OAAO1F,KAAKmD,IAAIa,EAAGb,EACrB,CAOA,IAFA,IAAIqC,EAAIxF,KAAKyP,EAAEwC,KAAK,GAChBxD,EAAI,GACAjJ,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXpG,GAAQkG,EAAEb,UAEV,IAAIgU,EAAM,IAAIhZ,EAAG,GAAGyV,MAAMpV,MACtB4Y,EAAOD,EAAIjC,SAIXmC,EAAO7Y,KAAKyP,EAAEwC,KAAK,GAAGvM,OAAO,GAC7BoT,EAAI9Y,KAAKyP,EAAE1J,YAGf,IAFA+S,EAAI,IAAInZ,EAAG,EAAImZ,EAAIA,GAAG1D,MAAMpV,MAEW,IAAhCA,KAAKmD,IAAI2V,EAAGD,GAAM9W,IAAI6W,IAC3BE,EAAElD,QAAQgD,GAOZ,IAJA,IAAIjY,EAAIX,KAAKmD,IAAI2V,EAAGtT,GAChBzE,EAAIf,KAAKmD,IAAIa,EAAGwB,EAAEwM,KAAK,GAAGtM,OAAO,IACjCG,EAAI7F,KAAKmD,IAAIa,EAAGwB,GAChBiK,EAAIhB,EACc,IAAf5I,EAAE9D,IAAI4W,IAAY,CAEvB,IADA,IAAIxB,EAAMtR,EACDrE,EAAI,EAAoB,IAAjB2V,EAAIpV,IAAI4W,GAAYnX,IAClC2V,EAAMA,EAAIf,SAEZ9W,EAAOkC,EAAIiO,GACX,IAAIxL,EAAIjE,KAAKmD,IAAIxC,EAAG,IAAIhB,EAAG,GAAGmR,OAAOrB,EAAIjO,EAAI,IAE7CT,EAAIA,EAAEkV,OAAOhS,GACbtD,EAAIsD,EAAEmS,SACNvQ,EAAIA,EAAEoQ,OAAOtV,GACb8O,EAAIjO,CACN,CAEA,OAAOT,CACT,EAEAoU,EAAIzX,UAAU4W,KAAO,SAAetQ,GAClC,IAAI+U,EAAM/U,EAAEiQ,OAAOjU,KAAKyP,GACxB,OAAqB,IAAjBsJ,EAAI9Y,UACN8Y,EAAI9Y,SAAW,EACRD,KAAK6X,KAAKkB,GAAKrC,UAEf1W,KAAK6X,KAAKkB,EAErB,EAEA5D,EAAIzX,UAAUyF,IAAM,SAAca,EAAGvC,GACnC,GAAIA,EAAIkD,SAAU,OAAO,IAAIhF,EAAG,GAAGyV,MAAMpV,MACzC,GAAoB,IAAhByB,EAAI4S,KAAK,GAAU,OAAOrQ,EAAEV,QAEhC,IACI0V,EAAM,IAAItX,MAAM,IACpBsX,EAAI,GAAK,IAAIrZ,EAAG,GAAGyV,MAAMpV,MACzBgZ,EAAI,GAAKhV,EACT,IAAK,IAAIxC,EAAI,EAAGA,EAAIwX,EAAIta,OAAQ8C,IAC9BwX,EAAIxX,GAAKxB,KAAKoB,IAAI4X,EAAIxX,EAAI,GAAIwC,GAGhC,IAAIuB,EAAMyT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbhY,EAAQO,EAAIsE,YAAc,GAK9B,IAJc,IAAV7E,IACFA,EAAQ,IAGLM,EAAIC,EAAI/C,OAAS,EAAG8C,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIwB,EAAOvB,EAAIvB,MAAMsB,GACZgB,EAAItB,EAAQ,EAAGsB,GAAK,EAAGA,IAAK,CACnC,IAAIoF,EAAO5E,GAAQR,EAAK,EACpB+C,IAAQyT,EAAI,KACdzT,EAAMvF,KAAK2Q,IAAIpL,IAGL,IAARqC,GAAyB,IAAZqR,GAKjBA,IAAY,EACZA,GAAWrR,GA9BE,KA+BbsR,GACwC,IAAN1X,GAAiB,IAANgB,KAE7C+C,EAAMvF,KAAKoB,IAAImE,EAAKyT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYjB,CACAhY,EAAQ,EACV,CAEA,OAAOqE,CACT,EAEA4P,EAAIzX,UAAU4X,UAAY,SAAoB7T,GAC5C,IAAIV,EAAIU,EAAIqR,KAAK9S,KAAKyP,GAEtB,OAAO1O,IAAMU,EAAMV,EAAEuC,QAAUvC,CACjC,EAEAoU,EAAIzX,UAAU+X,YAAc,SAAsBhU,GAChD,IAAI8D,EAAM9D,EAAI6B,QAEd,OADAiC,EAAIpF,IAAM,KACHoF,CACT,EAMA5F,EAAGwZ,KAAO,SAAe1X,GACvB,OAAO,IAAImW,EAAKnW,EAClB,EAkBA/B,EAASkY,EAAMzC,GAEfyC,EAAKla,UAAU4X,UAAY,SAAoB7T,GAC7C,OAAOzB,KAAK6X,KAAKpW,EAAIiQ,MAAM1R,KAAKoS,OAClC,EAEAwF,EAAKla,UAAU+X,YAAc,SAAsBhU,GACjD,IAAIV,EAAIf,KAAK6X,KAAKpW,EAAIL,IAAIpB,KAAK8X,OAE/B,OADA/W,EAAEZ,IAAM,KACDY,CACT,EAEA6W,EAAKla,UAAUwO,KAAO,SAAelI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE9D,MAAM,GAAK,EACb8D,EAAEtF,OAAS,EACJsF,EAGT,IAAI6B,EAAI7B,EAAEkI,KAAKjI,GACXtD,EAAIkF,EAAEiM,MAAM9R,KAAKoS,OAAOhR,IAAIpB,KAAK+X,MAAMlG,OAAO7R,KAAKoS,OAAOhR,IAAIpB,KAAKyP,GACnE2J,EAAIvT,EAAEkC,KAAKpH,GAAG+E,OAAO1F,KAAKoS,OAC1B7M,EAAM6T,EAQV,OANIA,EAAErX,IAAI/B,KAAKyP,IAAM,EACnBlK,EAAM6T,EAAErR,KAAK/H,KAAKyP,GACT2J,EAAE/E,KAAK,GAAK,IACrB9O,EAAM6T,EAAEtR,KAAK9H,KAAKyP,IAGblK,EAAIgQ,UAAUvV,KACvB,EAEA4X,EAAKla,UAAU0D,IAAM,SAAc4C,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAIhF,EAAG,GAAG4V,UAAUvV,MAEzD,IAAI6F,EAAI7B,EAAE5C,IAAI6C,GACVtD,EAAIkF,EAAEiM,MAAM9R,KAAKoS,OAAOhR,IAAIpB,KAAK+X,MAAMlG,OAAO7R,KAAKoS,OAAOhR,IAAIpB,KAAKyP,GACnE2J,EAAIvT,EAAEkC,KAAKpH,GAAG+E,OAAO1F,KAAKoS,OAC1B7M,EAAM6T,EAOV,OANIA,EAAErX,IAAI/B,KAAKyP,IAAM,EACnBlK,EAAM6T,EAAErR,KAAK/H,KAAKyP,GACT2J,EAAE/E,KAAK,GAAK,IACrB9O,EAAM6T,EAAEtR,KAAK9H,KAAKyP,IAGblK,EAAIgQ,UAAUvV,KACvB,EAEA4X,EAAKla,UAAU4W,KAAO,SAAetQ,GAGnC,OADUhE,KAAK6X,KAAK7T,EAAEiQ,OAAOjU,KAAKyP,GAAGrO,IAAIpB,KAAKkT,KACnCqC,UAAUvV,KACvB,CACD,CA19GD,YA09G4CA,iBC19G5ChD,EAAQ4qD,cAAgB,EAAxB,KACA5qD,EAAQ+qD,eAAiB,EAAzB,KAEA/qD,EAAQ6qD,eAAiB,SAAyBvpD,EAAKa,GACrD,OAAOnC,EAAQ4qD,cAActpD,EAAKa,GAAK,EACzC,EAEAnC,EAAQ8qD,cAAgB,SAAwBxpD,EAAKa,GACnD,OAAOnC,EAAQ+qD,eAAezpD,EAAKa,GAAK,EAC1C,0BCRA,IAAIwoF,EAAW1qF,EAAOD,QAAU,EAAjB,KAEf2qF,EAASC,MAAQ,QAoDjBD,EAAS3nC,KAjCT,SAAcjgB,EAAUjjC,EAAMmjD,GAM1B,MALoB,mBAATnjD,GACPmjD,EAAWnjD,EACXA,EAAO,IAAI6qF,EAAS7nD,MACZhjC,IACRA,EAAO,IAAI6qF,EAAS7nD,MACjBhjC,EAAKkjD,KAAKjgB,EAAUkgB,EAC/B,EA0CA0nC,EAAShnC,SANT,SAAkB5gB,EAAUjjC,GAGxB,OAFKA,IACDA,EAAO,IAAI6qF,EAAS7nD,MACjBhjC,EAAK6jD,SAAS5gB,EACzB,EAKA4nD,EAASxvD,QAAmB,EAAQ,IACpCwvD,EAAS5qC,QAAmB,EAAQ,IACpC4qC,EAAS3qC,SAAmB,EAAQ,IACpC2qC,EAAS1qC,UAAmB,EAAQ,IAGpC0qC,EAASl8D,iBAAmB,EAAQ,IACpCk8D,EAASh8D,UAAmB,EAAQ,IACpCg8D,EAAS7nD,KAAmB,EAAQ,IACpC6nD,EAAS7/D,KAAmB,EAAQ,GACpC6/D,EAAS9/D,KAAmB,EAAQ,IACpC8/D,EAAS3pD,MAAmB,EAAQ,IACpC2pD,EAASj7C,MAAmB,EAAQ,IACpCi7C,EAAS9qC,SAAmB,EAAQ,IACpC8qC,EAASnmD,QAAmB,EAAQ,IACpCmmD,EAAShpC,OAAmB,EAAQ,IAGpCgpC,EAAS7qC,QAAmB,EAAQ,IACpC6qC,EAASzqC,SAAmB,EAAQ,IAGpCyqC,EAAS1pD,MAAmB,EAAQ,IACpC0pD,EAAS5/D,KAAmB,EAAQ,GAGpC4/D,EAASl8D,iBAAiBoE,WAAW83D,EAAS7nD,MAC9C6nD,EAASh8D,UAAUkE,WAAW83D,EAAS9/D,KAAM8/D,EAASnmD,QAASmmD,EAAS7/D,MACxE6/D,EAAS7nD,KAAKjQ,WAAW83D,EAAS9/D,MAClC8/D,EAAS3pD,MAAMnO,WAAW83D,EAAS9/D,8BCtGnC,IAAI8/D,EAAW3qF,EA2Bf,SAAS6qF,IACLF,EAAS7rC,OAAOjsB,WAAW83D,EAAS5rC,cACpC4rC,EAAS5/D,KAAK8H,YAClB,CAtBA83D,EAASC,MAAQ,UAGjBD,EAAS7tC,OAAe,EAAQ,IAChC6tC,EAAS5tC,aAAe,EAAQ,KAChC4tC,EAAS7rC,OAAe,EAAQ,IAChC6rC,EAAS5rC,aAAe,EAAQ,KAGhC4rC,EAAS5/D,KAAe,EAAQ,GAChC4/D,EAAS/oC,IAAe,EAAQ,IAChC+oC,EAAS3/D,MAAe,EAAQ,IAChC2/D,EAASE,UAAeA,EAaxBF,EAAS7tC,OAAOjqB,WAAW83D,EAAS5tC,cACpC8tC,0BC5BA,IAAIxuE,EAASrc,EAObqc,EAAO3a,OAAS,SAAgB+B,GAC5B,IAAIsO,EAAItO,EAAO/B,OACf,IAAKqQ,EACD,OAAO,EAEX,IADA,IAAIS,EAAI,IACCT,EAAI,EAAI,GAA0B,MAArBtO,EAAOuoB,OAAOja,MAC9BS,EACN,OAAOlO,KAAKiB,KAAqB,EAAhB9B,EAAO/B,QAAc,EAAI8Q,CAC9C,EASA,IANA,IAAIs4E,EAAM,IAAIpmF,MAAM,IAGhBqmF,EAAM,IAAIrmF,MAAM,KAGXF,EAAI,EAAGA,EAAI,IAChBumF,EAAID,EAAItmF,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,EAAIA,EAAI,GAAK,IAAMA,IASrF6X,EAAOiR,OAAS,SAAgBrsB,EAAQiD,EAAOC,GAM3C,IALA,IAII0E,EAJAmvC,EAAQ,KACRgqB,EAAQ,GACRx9D,EAAI,EACJgB,EAAI,EAEDtB,EAAQC,GAAK,CAChB,IAAI8C,EAAIhG,EAAOiD,KACf,OAAQsB,GACJ,KAAK,EACDw8D,EAAMx9D,KAAOsmF,EAAI7jF,GAAK,GACtB4B,GAAS,EAAJ5B,IAAU,EACfzB,EAAI,EACJ,MACJ,KAAK,EACDw8D,EAAMx9D,KAAOsmF,EAAIjiF,EAAI5B,GAAK,GAC1B4B,GAAS,GAAJ5B,IAAW,EAChBzB,EAAI,EACJ,MACJ,KAAK,EACDw8D,EAAMx9D,KAAOsmF,EAAIjiF,EAAI5B,GAAK,GAC1B+6D,EAAMx9D,KAAOsmF,EAAQ,GAAJ7jF,GACjBzB,EAAI,EAGRhB,EAAI,QACHwzC,IAAUA,EAAQ,KAAKh3B,KAAKjB,OAAOiC,aAAaC,MAAMlC,OAAQiiD,IAC/Dx9D,EAAI,EAEZ,CAOA,OANIgB,IACAw8D,EAAMx9D,KAAOsmF,EAAIjiF,GACjBm5D,EAAMx9D,KAAO,GACH,IAANgB,IACAw8D,EAAMx9D,KAAO,KAEjBwzC,GACIxzC,GACAwzC,EAAMh3B,KAAKjB,OAAOiC,aAAaC,MAAMlC,OAAQiiD,EAAM9kD,MAAM,EAAG1Y,KACzDwzC,EAAM9b,KAAK,KAEfnc,OAAOiC,aAAaC,MAAMlC,OAAQiiD,EAAM9kD,MAAM,EAAG1Y,GAC5D,EAEA,IAAIwmF,EAAkB,mBAUtB3uE,EAAOmmB,OAAS,SAAgB/+B,EAAQxC,EAAQof,GAI5C,IAHA,IAEIxX,EAFA3E,EAAQmc,EACR7a,EAAI,EAEChB,EAAI,EAAGA,EAAIf,EAAO/B,QAAS,CAChC,IAAIiC,EAAIF,EAAOG,WAAWY,KAC1B,GAAU,KAANb,GAAY6B,EAAI,EAChB,MACJ,QAAqBpD,KAAhBuB,EAAIonF,EAAIpnF,IACT,MAAMlB,MAAMuoF,GAChB,OAAQxlF,GACJ,KAAK,EACDqD,EAAIlF,EACJ6B,EAAI,EACJ,MACJ,KAAK,EACDvE,EAAOof,KAAYxX,GAAK,GAAS,GAAJlF,IAAW,EACxCkF,EAAIlF,EACJ6B,EAAI,EACJ,MACJ,KAAK,EACDvE,EAAOof,MAAiB,GAAJxX,IAAW,GAAS,GAAJlF,IAAW,EAC/CkF,EAAIlF,EACJ6B,EAAI,EACJ,MACJ,KAAK,EACDvE,EAAOof,MAAiB,EAAJxX,IAAU,EAAIlF,EAClC6B,EAAI,EAGhB,CACA,GAAU,IAANA,EACA,MAAM/C,MAAMuoF,GAChB,OAAO3qE,EAASnc,CACpB,EAOAmY,EAAOuP,KAAO,SAAcnoB,GACxB,MAAO,mEAAmEmoB,KAAKnoB,EACnF,oBCjIA,SAASysB,IAOLltB,KAAKs1B,WAAa,CAAC,CACvB,CAhBAr4B,EAAOD,QAAUkwB,EAyBjBA,EAAaxvB,UAAUg2B,GAAK,SAAYu0D,EAAKtgE,EAAItS,GAK7C,OAJCrV,KAAKs1B,WAAW2yD,KAASjoF,KAAKs1B,WAAW2yD,GAAO,KAAKjqE,KAAK,CACvD2J,GAAMA,EACNtS,IAAMA,GAAOrV,OAEVA,IACX,EAQAktB,EAAaxvB,UAAUgF,IAAM,SAAaulF,EAAKtgE,GAC3C,QAAYvoB,IAAR6oF,EACAjoF,KAAKs1B,WAAa,CAAC,OAEnB,QAAWl2B,IAAPuoB,EACA3nB,KAAKs1B,WAAW2yD,GAAO,QAGvB,IADA,IAAI5xD,EAAYr2B,KAAKs1B,WAAW2yD,GACvBzmF,EAAI,EAAGA,EAAI60B,EAAU33B,QACtB23B,EAAU70B,GAAGmmB,KAAOA,EACpB0O,EAAU2E,OAAOx5B,EAAG,KAElBA,EAGlB,OAAOxB,IACX,EAQAktB,EAAaxvB,UAAUg3B,KAAO,SAAcuzD,GACxC,IAAI5xD,EAAYr2B,KAAKs1B,WAAW2yD,GAChC,GAAI5xD,EAAW,CAGX,IAFA,IAAI/D,EAAO,GACP9wB,EAAI,EACDA,EAAIia,UAAU/c,QACjB4zB,EAAKtU,KAAKvC,UAAUja,MACxB,IAAKA,EAAI,EAAGA,EAAI60B,EAAU33B,QACtB23B,EAAU70B,GAAGmmB,GAAG1I,MAAMoX,EAAU70B,KAAK6T,IAAKid,EAClD,CACA,OAAOtyB,IACX,oBCYA,SAASjD,EAAQC,GAwNb,MArN4B,oBAAjB81C,aAA8B,WAErC,IAAIo1C,EAAM,IAAIp1C,aAAa,EAAG,IAC1Bq1C,EAAM,IAAItuE,WAAWquE,EAAIjqF,QACzBmqF,EAAiB,MAAXD,EAAI,GAEd,SAASE,EAAmB9oF,EAAKJ,EAAK8gB,GAClCioE,EAAI,GAAK3oF,EACTJ,EAAI8gB,GAAWkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,EACvB,CAEA,SAASG,EAAmB/oF,EAAKJ,EAAK8gB,GAClCioE,EAAI,GAAK3oF,EACTJ,EAAI8gB,GAAWkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,EACvB,CAOA,SAASI,EAAkBppF,EAAK8gB,GAK5B,OAJAkoE,EAAI,GAAKhpF,EAAI8gB,GACbkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACZioE,EAAI,EACf,CAEA,SAASM,EAAkBrpF,EAAK8gB,GAK5B,OAJAkoE,EAAI,GAAKhpF,EAAI8gB,GACbkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACZioE,EAAI,EACf,CAlBAlrF,EAAQ2oB,aAAeyiE,EAAKC,EAAqBC,EAEjDtrF,EAAQ4oB,aAAewiE,EAAKE,EAAqBD,EAmBjDrrF,EAAQ6mB,YAAcukE,EAAKG,EAAoBC,EAE/CxrF,EAAQ8mB,YAAcskE,EAAKI,EAAoBD,CAGlD,CAjDwC,GAiD9B,WAEP,SAASE,EAAmBC,EAAWnpF,EAAKJ,EAAK8gB,GAC7C,IAAIqnC,EAAO/nD,EAAM,EAAI,EAAI,EAGzB,GAFI+nD,IACA/nD,GAAOA,GACC,IAARA,EACAmpF,EAAU,EAAInpF,EAAM,EAAmB,EAAqB,WAAYJ,EAAK8gB,QAC5E,GAAI2S,MAAMrzB,GACXmpF,EAAU,WAAYvpF,EAAK8gB,QAC1B,GAAI1gB,EAAM,qBACXmpF,GAAWphC,GAAQ,GAAK,cAAgB,EAAGnoD,EAAK8gB,QAC/C,GAAI1gB,EAAM,sBACXmpF,GAAWphC,GAAQ,GAAKhmD,KAAKwO,MAAMvQ,EAAM,yBAA4B,EAAGJ,EAAK8gB,OAC5E,CACD,IAAI0oE,EAAWrnF,KAAKylB,MAAMzlB,KAAKwnC,IAAIvpC,GAAO+B,KAAKsnF,KAE/CF,GAAWphC,GAAQ,GAAKqhC,EAAW,KAAO,GAD0B,QAArDrnF,KAAKwO,MAAMvQ,EAAM+B,KAAK6B,IAAI,GAAIwlF,GAAY,YACI,EAAGxpF,EAAK8gB,EACzE,CACJ,CAKA,SAAS4oE,EAAkBC,EAAU3pF,EAAK8gB,GACtC,IAAI8oE,EAAOD,EAAS3pF,EAAK8gB,GACrBqnC,EAAsB,GAAdyhC,GAAQ,IAAU,EAC1BJ,EAAWI,IAAS,GAAK,IACzBC,EAAkB,QAAPD,EACf,OAAoB,MAAbJ,EACDK,EACAzY,IACAjpB,GAAOlgC,KACM,IAAbuhE,EACO,qBAAPrhC,EAA+B0hC,EAC/B1hC,EAAOhmD,KAAK6B,IAAI,EAAGwlF,EAAW,MAAQK,EAAW,QAC3D,CAfAhsF,EAAQ2oB,aAAe8iE,EAAmBpzD,KAAK,KAAMpR,GACrDjnB,EAAQ4oB,aAAe6iE,EAAmBpzD,KAAK,KAAMlR,GAgBrDnnB,EAAQ6mB,YAAcglE,EAAkBxzD,KAAK,KAAMrT,GACnDhlB,EAAQ8mB,YAAc+kE,EAAkBxzD,KAAK,KAAMnT,EAEtD,CAzCU,GA4CiB,oBAAjB6wB,aAA8B,WAErC,IAAIk2C,EAAM,IAAIl2C,aAAa,EAAE,IACzBo1C,EAAM,IAAItuE,WAAWovE,EAAIhrF,QACzBmqF,EAAiB,MAAXD,EAAI,GAEd,SAASe,EAAoB3pF,EAAKJ,EAAK8gB,GACnCgpE,EAAI,GAAK1pF,EACTJ,EAAI8gB,GAAWkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,EACvB,CAEA,SAASgB,EAAoB5pF,EAAKJ,EAAK8gB,GACnCgpE,EAAI,GAAK1pF,EACTJ,EAAI8gB,GAAWkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,GACnBhpF,EAAI8gB,EAAM,GAAKkoE,EAAI,EACvB,CAOA,SAASiB,EAAmBjqF,EAAK8gB,GAS7B,OARAkoE,EAAI,GAAKhpF,EAAI8gB,GACbkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACZgpE,EAAI,EACf,CAEA,SAASI,EAAmBlqF,EAAK8gB,GAS7B,OARAkoE,EAAI,GAAKhpF,EAAI8gB,GACbkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACnBkoE,EAAI,GAAKhpF,EAAI8gB,EAAM,GACZgpE,EAAI,EACf,CA1BAjsF,EAAQ6oB,cAAgBuiE,EAAKc,EAAsBC,EAEnDnsF,EAAQ8oB,cAAgBsiE,EAAKe,EAAsBD,EA2BnDlsF,EAAQ+mB,aAAeqkE,EAAKgB,EAAqBC,EAEjDrsF,EAAQgnB,aAAeokE,EAAKiB,EAAqBD,CAGpD,CAjEwC,GAiE9B,WAEP,SAASE,EAAoBZ,EAAWa,EAAMC,EAAMjqF,EAAKJ,EAAK8gB,GAC1D,IAAIqnC,EAAO/nD,EAAM,EAAI,EAAI,EAGzB,GAFI+nD,IACA/nD,GAAOA,GACC,IAARA,EACAmpF,EAAU,EAAGvpF,EAAK8gB,EAAMspE,GACxBb,EAAU,EAAInpF,EAAM,EAAmB,EAAqB,WAAYJ,EAAK8gB,EAAMupE,QAChF,GAAI52D,MAAMrzB,GACbmpF,EAAU,EAAGvpF,EAAK8gB,EAAMspE,GACxBb,EAAU,WAAYvpF,EAAK8gB,EAAMupE,QAC9B,GAAIjqF,EAAM,sBACbmpF,EAAU,EAAGvpF,EAAK8gB,EAAMspE,GACxBb,GAAWphC,GAAQ,GAAK,cAAgB,EAAGnoD,EAAK8gB,EAAMupE,OACnD,CACH,IAAIR,EACJ,GAAIzpF,EAAM,uBAENmpF,GADAM,EAAWzpF,EAAM,UACM,EAAGJ,EAAK8gB,EAAMspE,GACrCb,GAAWphC,GAAQ,GAAK0hC,EAAW,cAAgB,EAAG7pF,EAAK8gB,EAAMupE,OAC9D,CACH,IAAIb,EAAWrnF,KAAKylB,MAAMzlB,KAAKwnC,IAAIvpC,GAAO+B,KAAKsnF,KAC9B,OAAbD,IACAA,EAAW,MAEfD,EAAqB,kBADrBM,EAAWzpF,EAAM+B,KAAK6B,IAAI,GAAIwlF,MACY,EAAGxpF,EAAK8gB,EAAMspE,GACxDb,GAAWphC,GAAQ,GAAKqhC,EAAW,MAAQ,GAAgB,QAAXK,EAAqB,WAAa,EAAG7pF,EAAK8gB,EAAMupE,EACpG,CACJ,CACJ,CAKA,SAASC,EAAmBX,EAAUS,EAAMC,EAAMrqF,EAAK8gB,GACnD,IAAI/b,EAAK4kF,EAAS3pF,EAAK8gB,EAAMspE,GACzBvjF,EAAK8iF,EAAS3pF,EAAK8gB,EAAMupE,GACzBliC,EAAoB,GAAZthD,GAAM,IAAU,EACxB2iF,EAAW3iF,IAAO,GAAK,KACvBgjF,EAAW,YAAmB,QAALhjF,GAAgB9B,EAC7C,OAAoB,OAAbykF,EACDK,EACAzY,IACAjpB,GAAOlgC,KACM,IAAbuhE,EACO,OAAPrhC,EAAgB0hC,EAChB1hC,EAAOhmD,KAAK6B,IAAI,EAAGwlF,EAAW,OAASK,EAAW,iBAC5D,CAhBAhsF,EAAQ6oB,cAAgByjE,EAAoBj0D,KAAK,KAAMpR,EAAa,EAAG,GACvEjnB,EAAQ8oB,cAAgBwjE,EAAoBj0D,KAAK,KAAMlR,EAAa,EAAG,GAiBvEnnB,EAAQ+mB,aAAe0lE,EAAmBp0D,KAAK,KAAMrT,EAAY,EAAG,GACpEhlB,EAAQgnB,aAAeylE,EAAmBp0D,KAAK,KAAMnT,EAAY,EAAG,EAEvE,CArDU,GAuDJllB,CACX,CAIA,SAASinB,EAAY1kB,EAAKJ,EAAK8gB,GAC3B9gB,EAAI8gB,GAAyB,IAAb1gB,EAChBJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,EAAK,IAC7BJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,GAAK,IAC7BJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,EAC5B,CAEA,SAAS4kB,EAAY5kB,EAAKJ,EAAK8gB,GAC3B9gB,EAAI8gB,GAAY1gB,IAAQ,GACxBJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,GAAK,IAC7BJ,EAAI8gB,EAAM,GAAM1gB,IAAQ,EAAK,IAC7BJ,EAAI8gB,EAAM,GAAmB,IAAb1gB,CACpB,CAEA,SAASyiB,EAAW7iB,EAAK8gB,GACrB,OAAQ9gB,EAAI8gB,GACJ9gB,EAAI8gB,EAAM,IAAM,EAChB9gB,EAAI8gB,EAAM,IAAM,GAChB9gB,EAAI8gB,EAAM,IAAM,MAAQ,CACpC,CAEA,SAASiC,EAAW/iB,EAAK8gB,GACrB,OAAQ9gB,EAAI8gB,IAAY,GAChB9gB,EAAI8gB,EAAM,IAAM,GAChB9gB,EAAI8gB,EAAM,IAAM,EAChB9gB,EAAI8gB,EAAM,MAAQ,CAC9B,CA5UAhjB,EAAOD,QAAUD,EAAQA,yBCKzB,IAAIqwB,EAAOpwB,EAOXowB,EAAK1uB,OAAS,SAAqB+B,GAG/B,IAFA,IAAIY,EAAM,EACNV,EAAI,EACCa,EAAI,EAAGA,EAAIf,EAAO/B,SAAU8C,GACjCb,EAAIF,EAAOG,WAAWY,IACd,IACJH,GAAO,EACFV,EAAI,KACTU,GAAO,EACe,QAAZ,MAAJV,IAAkE,QAAZ,MAA3BF,EAAOG,WAAWY,EAAI,OACrDA,EACFH,GAAO,GAEPA,GAAO,EAEf,OAAOA,CACX,EASA+rB,EAAKpQ,KAAO,SAAmB/e,EAAQiD,EAAOC,GAE1C,GADUA,EAAMD,EACN,EACN,MAAO,GAKX,IAJA,IAGI2E,EAHAmvC,EAAQ,KACRgqB,EAAQ,GACRx9D,EAAI,EAEDN,EAAQC,IACX0E,EAAI5H,EAAOiD,MACH,IACJ89D,EAAMx9D,KAAOqE,EACRA,EAAI,KAAOA,EAAI,IACpBm5D,EAAMx9D,MAAY,GAAJqE,IAAW,EAAsB,GAAlB5H,EAAOiD,KAC/B2E,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlB5H,EAAOiD,OAAkB,IAAwB,GAAlBjD,EAAOiD,OAAkB,EAAsB,GAAlBjD,EAAOiD,MAAiB,MAC1G89D,EAAMx9D,KAAO,OAAUqE,GAAK,IAC5Bm5D,EAAMx9D,KAAO,OAAc,KAAJqE,IAEvBm5D,EAAMx9D,MAAY,GAAJqE,IAAW,IAAwB,GAAlB5H,EAAOiD,OAAkB,EAAsB,GAAlBjD,EAAOiD,KACnEM,EAAI,QACHwzC,IAAUA,EAAQ,KAAKh3B,KAAKjB,OAAOiC,aAAaC,MAAMlC,OAAQiiD,IAC/Dx9D,EAAI,GAGZ,OAAIwzC,GACIxzC,GACAwzC,EAAMh3B,KAAKjB,OAAOiC,aAAaC,MAAMlC,OAAQiiD,EAAM9kD,MAAM,EAAG1Y,KACzDwzC,EAAM9b,KAAK,KAEfnc,OAAOiC,aAAaC,MAAMlC,OAAQiiD,EAAM9kD,MAAM,EAAG1Y,GAC5D,EASA4rB,EAAKnT,MAAQ,SAAoBxZ,EAAQxC,EAAQof,GAI7C,IAHA,IACI6vC,EACAC,EAFAjsD,EAAQmc,EAGH7b,EAAI,EAAGA,EAAIf,EAAO/B,SAAU8C,GACjC0rD,EAAKzsD,EAAOG,WAAWY,IACd,IACLvD,EAAOof,KAAY6vC,EACZA,EAAK,MACZjvD,EAAOof,KAAY6vC,GAAM,EAAU,IACnCjvD,EAAOof,KAAuB,GAAX6vC,EAAgB,KACV,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAK1sD,EAAOG,WAAWY,EAAI,MAChE0rD,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtC3rD,EACFvD,EAAOof,KAAY6vC,GAAM,GAAU,IACnCjvD,EAAOof,KAAY6vC,GAAM,GAAK,GAAK,IACnCjvD,EAAOof,KAAY6vC,GAAM,EAAK,GAAK,IACnCjvD,EAAOof,KAAuB,GAAX6vC,EAAgB,MAEnCjvD,EAAOof,KAAY6vC,GAAM,GAAU,IACnCjvD,EAAOof,KAAY6vC,GAAM,EAAK,GAAK,IACnCjvD,EAAOof,KAAuB,GAAX6vC,EAAgB,KAG3C,OAAO7vC,EAASnc,CACpB,oBCvGAjE,EAAOD,QA6BP,SAAc4B,EAAOsb,EAAOlb,GACxB,IAAI0qF,EAAS1qF,GAAQ,KACjB2qF,EAASD,IAAS,EAClBE,EAAS,KACTvsE,EAASqsE,EACb,OAAO,SAAoB1qF,GACvB,GAAIA,EAAO,GAAKA,EAAO2qF,EACnB,OAAO/qF,EAAMI,GACbqe,EAASre,EAAO0qF,IAChBE,EAAOhrF,EAAM8qF,GACbrsE,EAAS,GAEb,IAAIle,EAAM+a,EAAM5C,KAAKsyE,EAAMvsE,EAAQA,GAAUre,GAG7C,OAFa,EAATqe,IACAA,EAAwB,GAAL,EAATA,IACPle,CACX,CACJ,0BC9CAlC,EAAOD,QAAUswB,EAEjB,IAAIvF,EAAO,EAAQ,GAUnB,SAASuF,EAASppB,EAAI8B,GASlBhG,KAAKkE,GAAKA,IAAO,EAMjBlE,KAAKgG,GAAKA,IAAO,CACrB,CAOA,IAAIknC,EAAO5f,EAAS4f,KAAO,IAAI5f,EAAS,EAAG,GAE3C4f,EAAKpoC,SAAW,WAAa,OAAO,CAAG,EACvCooC,EAAKgO,SAAWhO,EAAK0P,SAAW,WAAa,OAAO58C,IAAM,EAC1DktC,EAAKxuC,OAAS,WAAa,OAAO,CAAG,EAOrC,IAAIqwB,EAAWzB,EAASyB,SAAW,mBAOnCzB,EAASiS,WAAa,SAAoB3hC,GACtC,GAAc,IAAVA,EACA,OAAOsvC,EACX,IAAIoa,EAAO1pD,EAAQ,EACf0pD,IACA1pD,GAASA,GACb,IAAIsG,EAAKtG,IAAU,EACfoI,GAAMpI,EAAQsG,GAAM,aAAe,EAUvC,OATIojD,IACAthD,GAAMA,IAAO,EACb9B,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACC8B,EAAK,aACPA,EAAK,KAGV,IAAIsnB,EAASppB,EAAI8B,EAC5B,EAOAsnB,EAAS3uB,KAAO,SAAcf,GAC1B,GAAqB,iBAAVA,EACP,OAAO0vB,EAASiS,WAAW3hC,GAC/B,GAAImqB,EAAKwE,SAAS3uB,GAAQ,CAEtB,IAAImqB,EAAKyG,KAGL,OAAOlB,EAASiS,WAAW7hB,SAAS9f,EAAO,KAF3CA,EAAQmqB,EAAKyG,KAAKrU,WAAWvc,EAGrC,CACA,OAAOA,EAAMy7D,KAAOz7D,EAAM07D,KAAO,IAAIhsC,EAAS1vB,EAAMy7D,MAAQ,EAAGz7D,EAAM07D,OAAS,GAAKpsB,CACvF,EAOA5f,EAAS5vB,UAAUoH,SAAW,SAAkBoqB,GAC5C,IAAKA,GAAYlvB,KAAKgG,KAAO,GAAI,CAC7B,IAAI9B,EAAgB,GAAVlE,KAAKkE,KAAW,EACtB8B,GAAMhG,KAAKgG,KAAW,EAG1B,OAFK9B,IACD8B,EAAKA,EAAK,IAAM,KACX9B,EAAU,WAAL8B,EAClB,CACA,OAAOhG,KAAKkE,GAAe,WAAVlE,KAAKgG,EAC1B,EAOAsnB,EAAS5vB,UAAUmsF,OAAS,SAAgB36D,GACxC,OAAOnH,EAAKyG,KACN,IAAIzG,EAAKyG,KAAe,EAAVxuB,KAAKkE,GAAkB,EAAVlE,KAAKgG,GAAQsmB,QAAQ4C,IAEhD,CAAEmqC,IAAe,EAAVr5D,KAAKkE,GAAQo1D,KAAgB,EAAVt5D,KAAKgG,GAAQkpB,SAAU5C,QAAQ4C,GACnE,EAEA,IAAItuB,EAAamc,OAAOrf,UAAUkD,WAOlC0sB,EAAS6B,SAAW,SAAkBF,GAClC,OAAIA,IAASF,EACFme,EACJ,IAAI5f,GACL1sB,EAAW0W,KAAK2X,EAAM,GACtBruB,EAAW0W,KAAK2X,EAAM,IAAM,EAC5BruB,EAAW0W,KAAK2X,EAAM,IAAM,GAC5BruB,EAAW0W,KAAK2X,EAAM,IAAM,MAAQ,GAEpCruB,EAAW0W,KAAK2X,EAAM,GACtBruB,EAAW0W,KAAK2X,EAAM,IAAM,EAC5BruB,EAAW0W,KAAK2X,EAAM,IAAM,GAC5BruB,EAAW0W,KAAK2X,EAAM,IAAM,MAAQ,EAE9C,EAMA3B,EAAS5vB,UAAUoxB,OAAS,WACxB,OAAO/R,OAAOiC,aACO,IAAjBhf,KAAKkE,GACLlE,KAAKkE,KAAO,EAAK,IACjBlE,KAAKkE,KAAO,GAAK,IACjBlE,KAAKkE,KAAO,GACK,IAAjBlE,KAAKgG,GACLhG,KAAKgG,KAAO,EAAK,IACjBhG,KAAKgG,KAAO,GAAK,IACjBhG,KAAKgG,KAAO,GAEpB,EAMAsnB,EAAS5vB,UAAUw9C,SAAW,WAC1B,IAAI5pC,EAAStR,KAAKgG,IAAM,GAGxB,OAFAhG,KAAKgG,KAAQhG,KAAKgG,IAAM,EAAIhG,KAAKkE,KAAO,IAAMoN,KAAU,EACxDtR,KAAKkE,IAAQlE,KAAKkE,IAAM,EAAsBoN,KAAU,EACjDtR,IACX,EAMAstB,EAAS5vB,UAAUk/C,SAAW,WAC1B,IAAItrC,IAAmB,EAAVtR,KAAKkE,IAGlB,OAFAlE,KAAKkE,KAAQlE,KAAKkE,KAAO,EAAIlE,KAAKgG,IAAM,IAAMsL,KAAU,EACxDtR,KAAKgG,IAAQhG,KAAKgG,KAAO,EAAqBsL,KAAU,EACjDtR,IACX,EAMAstB,EAAS5vB,UAAUgB,OAAS,WACxB,IAAIorF,EAAS9pF,KAAKkE,GACd6lF,GAAS/pF,KAAKkE,KAAO,GAAKlE,KAAKgG,IAAM,KAAO,EAC5CgkF,EAAShqF,KAAKgG,KAAO,GACzB,OAAiB,IAAVgkF,EACU,IAAVD,EACED,EAAQ,MACNA,EAAQ,IAAM,EAAI,EAClBA,EAAQ,QAAU,EAAI,EACxBC,EAAQ,MACNA,EAAQ,IAAM,EAAI,EAClBA,EAAQ,QAAU,EAAI,EAC1BC,EAAQ,IAAM,EAAI,EAC7B,0BCtMA/sF,EAAOD,QAAU+8C,EAGjB,IAAID,EAAS,EAAQ,KACpBC,EAAar8C,UAAYL,OAAOC,OAAOw8C,EAAOp8C,YAAYC,YAAco8C,EAEzE,IAAIhyB,EAAO,EAAQ,GAEf7pB,EAAS6pB,EAAK7pB,OAQlB,SAAS67C,IACLD,EAAOxiC,KAAKtX,KAChB,CAOA+5C,EAAan7C,MAAQ,SAAsBI,GACvC,OAAQ+6C,EAAan7C,MAAQmpB,EAAKsG,qBAAqBrvB,EAC3D,EAEA,IAAIirF,EAAmB/rF,GAAUA,EAAOR,qBAAqBmc,YAA4C,QAA9B3b,EAAOR,UAAUwiB,IAAIhJ,KAC1F,SAA8B3X,EAAKJ,EAAK8gB,GACtC9gB,EAAI+gB,IAAI3gB,EAAK0gB,EAEjB,EAEE,SAA+B1gB,EAAKJ,EAAK8gB,GACvC,GAAI1gB,EAAI6D,KACJ7D,EAAI6D,KAAKjE,EAAK8gB,EAAK,EAAG1gB,EAAIb,aACzB,IAAK,IAAI8C,EAAI,EAAGA,EAAIjC,EAAIb,QACzBS,EAAI8gB,KAAS1gB,EAAIiC,IACzB,EAeJ,SAAS0oF,EAAkB3qF,EAAKJ,EAAK8gB,GAC7B1gB,EAAIb,OAAS,GACbqpB,EAAKqF,KAAKnT,MAAM1a,EAAKJ,EAAK8gB,GAE1B9gB,EAAIye,UAAUre,EAAK0gB,EAC3B,CAfA85B,EAAar8C,UAAUwjB,MAAQ,SAA4BtjB,GACnDmqB,EAAKwE,SAAS3uB,KACdA,EAAQmqB,EAAKqG,aAAaxwB,EAAO,WACrC,IAAIyD,EAAMzD,EAAMc,SAAW,EAI3B,OAHAsB,KAAK46C,OAAOv5C,GACRA,GACArB,KAAK26C,MAAMsvC,EAAkB5oF,EAAKzD,GAC/BoC,IACX,EAYA+5C,EAAar8C,UAAU+C,OAAS,SAA6B7C,GACzD,IAAIyD,EAAMnD,EAAOkH,WAAWxH,GAI5B,OAHAoC,KAAK46C,OAAOv5C,GACRA,GACArB,KAAK26C,MAAMuvC,EAAmB7oF,EAAKzD,GAChCoC,IACX,0BCvEA/C,EAAOD,QAAU++C,EAGjB,IAAID,EAAS,EAAQ,KACpBC,EAAar+C,UAAYL,OAAOC,OAAOw+C,EAAOp+C,YAAYC,YAAco+C,EAEzE,IAAIh0B,EAAO,EAAQ,GASnB,SAASg0B,EAAa99C,GAClB69C,EAAOxkC,KAAKtX,KAAM/B,EAOtB,CAGI8pB,EAAK7pB,SACL69C,EAAar+C,UAAU6+C,OAASx0B,EAAK7pB,OAAOR,UAAUwc,OAK1D6hC,EAAar+C,UAAU+C,OAAS,WAC5B,IAAIY,EAAMrB,KAAK46C,SACf,OAAO56C,KAAKb,IAAI6c,UAAUhc,KAAKigB,IAAKjgB,KAAKigB,IAAM3e,KAAKC,IAAIvB,KAAKigB,IAAM5e,EAAKrB,KAAKqB,KACjF,0BCnCApE,EAAOD,QAAUwkC,EAEjB,IAAIzZ,EAAO,EAAQ,GAsCnB,SAASyZ,EAAQwd,EAASC,EAAkBC,GAExC,GAAuB,mBAAZF,EACP,MAAMjgD,UAAU,8BAEpBgpB,EAAKmF,aAAa5V,KAAKtX,MAMvBA,KAAKg/C,QAAUA,EAMfh/C,KAAKi/C,iBAAmB3yB,QAAQ2yB,GAMhCj/C,KAAKk/C,kBAAoB5yB,QAAQ4yB,EACrC,EA3DC1d,EAAQ9jC,UAAYL,OAAOC,OAAOyqB,EAAKmF,aAAaxvB,YAAYC,YAAc6jC,EAwE/EA,EAAQ9jC,UAAUysF,QAAU,SAASA,EAAQp+C,EAAQq+C,EAAaC,EAAcC,EAASrqC,GAErF,IAAKqqC,EACD,MAAMvrF,UAAU,6BAEpB,IAAI+E,EAAO9D,KACX,IAAKigD,EACD,OAAOl4B,EAAKkF,UAAUk9D,EAASrmF,EAAMioC,EAAQq+C,EAAaC,EAAcC,GAE5E,GAAKxmF,EAAKk7C,QAKV,IACI,OAAOl7C,EAAKk7C,QACRjT,EACAq+C,EAAYtmF,EAAKm7C,iBAAmB,kBAAoB,UAAUqrC,GAAS1uC,UAC3E,SAAqBxoB,EAAKm3D,GAEtB,GAAIn3D,EAEA,OADAtvB,EAAK4wB,KAAK,QAAStB,EAAK2Y,GACjBkU,EAAS7sB,GAGpB,GAAiB,OAAbm3D,EAAJ,CAKA,KAAMA,aAAoBF,GACtB,IACIE,EAAWF,EAAavmF,EAAKo7C,kBAAoB,kBAAoB,UAAUqrC,EACnF,CAAE,MAAOn3D,GAEL,OADAtvB,EAAK4wB,KAAK,QAAStB,EAAK2Y,GACjBkU,EAAS7sB,EACpB,CAIJ,OADAtvB,EAAK4wB,KAAK,OAAQ61D,EAAUx+C,GACrBkU,EAAS,KAAMsqC,EAZtB,CAFIzmF,EAAK3C,KAAqB,EAelC,GAER,CAAE,MAAOiyB,GAGL,OAFAtvB,EAAK4wB,KAAK,QAAStB,EAAK2Y,QACxB0U,YAAW,WAAaR,EAAS7sB,EAAM,GAAG,EAE9C,MArCIqtB,YAAW,WAAaR,EAASxgD,MAAM,iBAAmB,GAAG,EAsCrE,EAOA+hC,EAAQ9jC,UAAUyD,IAAM,SAAaqpF,GAOjC,OANIxqF,KAAKg/C,UACAwrC,GACDxqF,KAAKg/C,QAAQ,KAAM,KAAM,MAC7Bh/C,KAAKg/C,QAAU,KACfh/C,KAAK00B,KAAK,OAAOhyB,OAEd1C,IACX,oBCnIA,SAASioB,EAAQwiE,EAAgBC,GAGC,iBAAnBD,IACPC,EAAeD,EACfA,OAAiBrrF,GAGrB,IAAI6vD,EAAO,GAYX,SAAS07B,EAAQC,GAIb,GAAmC,iBAAxBA,EAAkC,CACzC,IAAIzqC,EAASj+C,IAIb,GAHI+lB,EAAQ4iE,SACRrrE,QAAQspB,IAAI,YAAcqX,GAC9BA,EAAS,UAAYA,EACjByqC,EAAqB,CAKrB,IAJA,IAAIE,EAAcztF,OAAOkrB,KAAKqiE,GAC1BG,EAAc,IAAIrpF,MAAMopF,EAAUpsF,OAAS,GAC3CssF,EAAc,IAAItpF,MAAMopF,EAAUpsF,QAClCusF,EAAc,EACXA,EAAcH,EAAUpsF,QAC3BqsF,EAAYE,GAAeH,EAAUG,GACrCD,EAAYC,GAAeL,EAAoBE,EAAUG,MAG7D,OADAF,EAAYE,GAAe9qC,EACpB5tB,SAAStT,MAAM,KAAM8rE,GAAa9rE,MAAM,KAAM+rE,EACzD,CACA,OAAOz4D,SAAS4tB,EAAT5tB,EACX,CAKA,IAFA,IAAI24D,EAAe,IAAIxpF,MAAM+Z,UAAU/c,OAAS,GAC5CysF,EAAe,EACZA,EAAeD,EAAaxsF,QAC/BwsF,EAAaC,GAAgB1vE,YAAY0vE,GAY7C,GAXAA,EAAe,EACfP,EAAsBA,EAAoBzoF,QAAQ,gBAAgB,SAAiBknB,EAAIC,GACnF,IAAI1rB,EAAQstF,EAAaC,KACzB,OAAQ7hE,GACJ,IAAK,IAAK,IAAK,IAAK,OAAOvM,OAAOO,OAAO1f,IACzC,IAAK,IAAK,OAAOmf,OAAOzb,KAAKylB,MAAMnpB,IACnC,IAAK,IAAK,OAAOknC,KAAKzM,UAAUz6B,GAChC,IAAK,IAAK,OAAOmf,OAAOnf,GAE5B,MAAO,GACX,IACIutF,IAAiBD,EAAaxsF,OAC9B,MAAMe,MAAM,4BAEhB,OADAwvD,EAAKjxC,KAAK4sE,GACHD,CACX,CAEA,SAASzoF,EAASkpF,GACd,MAAO,aAAeA,GAAwBV,GAAgB,IAAM,KAAOD,GAAkBA,EAAevxD,KAAK,MAAQ,IAAM,SAAW+1B,EAAK/1B,KAAK,QAAU,KAClK,CAGA,OADAyxD,EAAQzoF,SAAWA,EACZyoF,CACX,CAjFA1tF,EAAOD,QAAUirB,EAiGjBA,EAAQ4iE,SAAU,0BCjGlB5tF,EAAOD,QAAUkrB,EAEjB,IAAI+E,EAAY,EAAQ,IAGpB7E,EAFY,EAAQ,GAEfC,CAAQ,MA2BjB,SAASH,EAAM6X,EAAUlU,EAASo0B,GAO9B,MANuB,mBAAZp0B,GACPo0B,EAAWp0B,EACXA,EAAU,CAAC,GACHA,IACRA,EAAU,CAAC,GAEVo0B,GAIAp0B,EAAQw/D,KAAOjjE,GAAMA,EAAGkjE,SAClBljE,EAAGkjE,SAASvrD,GAAU,SAA+B3M,EAAKm4D,GAC7D,OAAOn4D,GAAiC,oBAAnBo4D,eACftjE,EAAMmjE,IAAItrD,EAAUlU,EAASo0B,GAC7B7sB,EACA6sB,EAAS7sB,GACT6sB,EAAS,KAAMp0B,EAAQ4/D,OAASF,EAAWA,EAASrpF,SAAS,QACvE,IAGGgmB,EAAMmjE,IAAItrD,EAAUlU,EAASo0B,GAbzBhzB,EAAU/E,EAAOloB,KAAM+/B,EAAUlU,EAchD,CAuBA3D,EAAMmjE,IAAM,SAAmBtrD,EAAUlU,EAASo0B,GAC9C,IAAIorC,EAAM,IAAIG,eACdH,EAAIK,mBAA4C,WAE5C,GAAuB,IAAnBL,EAAIM,WAAR,CAMA,GAAmB,IAAfN,EAAIO,QAA+B,MAAfP,EAAIO,OACxB,OAAO3rC,EAASxgD,MAAM,UAAY4rF,EAAIO,SAI1C,GAAI//D,EAAQ4/D,OAAQ,CAChB,IAAIxtF,EAASotF,EAAId,SACjB,IAAKtsF,EAAQ,CACTA,EAAS,GACT,IAAK,IAAIuD,EAAI,EAAGA,EAAI6pF,EAAIQ,aAAantF,SAAU8C,EAC3CvD,EAAO+f,KAAsC,IAAjCqtE,EAAIQ,aAAajrF,WAAWY,GAChD,CACA,OAAOy+C,EAAS,KAA4B,oBAAfpmC,WAA6B,IAAIA,WAAW5b,GAAUA,EACvF,CACA,OAAOgiD,EAAS,KAAMorC,EAAIQ,aAnBN,CAoBxB,EAEIhgE,EAAQ4/D,SAEJ,qBAAsBJ,GACtBA,EAAIS,iBAAiB,sCACzBT,EAAI7rC,aAAe,eAGvB6rC,EAAIU,KAAK,MAAOhsD,GAChBsrD,EAAIW,MACR,wBC3GA,IAAI7jE,EAAOnrB,EAEPivF,EAMJ9jE,EAAK8jE,WAAa,SAAoB9jE,GAClC,MAAO,eAAeS,KAAKT,EAC/B,EAEI+jE,EAMJ/jE,EAAK+jE,UAAY,SAAmB/jE,GAGhC,IAAI6sB,GAFJ7sB,EAAOA,EAAKhmB,QAAQ,MAAO,KACfA,QAAQ,UAAW,MACX+V,MAAM,KACtBi0E,EAAWF,EAAW9jE,GACtB82C,EAAW,GACXktB,IACAltB,EAASjqB,EAAM5iC,QAAU,KAC7B,IAAK,IAAI5Q,EAAI,EAAGA,EAAIwzC,EAAMt2C,QACL,OAAbs2C,EAAMxzC,GACFA,EAAI,GAAsB,OAAjBwzC,EAAMxzC,EAAI,GACnBwzC,EAAMha,SAASx5B,EAAG,GACb2qF,EACLn3C,EAAMha,OAAOx5B,EAAG,KAEdA,EACc,MAAbwzC,EAAMxzC,GACbwzC,EAAMha,OAAOx5B,EAAG,KAEdA,EAEV,OAAOy9D,EAASjqB,EAAM9b,KAAK,IAC/B,EASA/Q,EAAK8K,QAAU,SAAiBm5D,EAAYC,EAAaC,GAGrD,OAFKA,IACDD,EAAcH,EAAUG,IACxBJ,EAAWI,GACJA,GACNC,IACDF,EAAaF,EAAUE,KACnBA,EAAaA,EAAWjqF,QAAQ,iBAAkB,KAAKzD,OAASwtF,EAAUE,EAAa,IAAMC,GAAeA,EACxH,aChEA,MAAME,EAAQ,EAAQ,KAGtBtvF,EAAOD,QAAUuvF,EAFA,gFCuHjBtvF,EAAOD,QAlHP,SAAewvF,GACb,GAAIA,EAAS9tF,QAAU,IAAO,MAAM,IAAIK,UAAU,qBAElD,IADA,IAAI0tF,EAAW,IAAI5yE,WAAW,KACrBrX,EAAI,EAAGA,EAAIiqF,EAAS/tF,OAAQ8D,IACnCiqF,EAASjqF,GAAK,IAEhB,IAAK,IAAIhB,EAAI,EAAGA,EAAIgrF,EAAS9tF,OAAQ8C,IAAK,CACxC,IAAIgM,EAAIg/E,EAASxjE,OAAOxnB,GACpBkrF,EAAKl/E,EAAE5M,WAAW,GACtB,GAAqB,MAAjB6rF,EAASC,GAAe,MAAM,IAAI3tF,UAAUyO,EAAI,iBACpDi/E,EAASC,GAAMlrF,CACjB,CACA,IAAImrF,EAAOH,EAAS9tF,OAChBkuF,EAASJ,EAASxjE,OAAO,GACzB6jE,EAASvrF,KAAKwnC,IAAI6jD,GAAQrrF,KAAKwnC,IAAI,KACnCgkD,EAAUxrF,KAAKwnC,IAAI,KAAOxnC,KAAKwnC,IAAI6jD,GA8CvC,SAASI,EAAc5sC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAIphD,UAAU,mBACtD,GAAsB,IAAlBohD,EAAOzhD,OAAgB,OAAO,IAAImb,WAKtC,IAJA,IAAImzE,EAAM,EAENC,EAAS,EACTvuF,EAAS,EACNyhD,EAAO6sC,KAASJ,GACrBK,IACAD,IAMF,IAHA,IAAIhuF,GAAUmhD,EAAOzhD,OAASsuF,GAAOH,EAAU,IAAO,EAClDK,EAAO,IAAIrzE,WAAW7a,GAEnBmhD,EAAO6sC,IAAM,CAElB,IAAI7oF,EAAQsoF,EAAStsC,EAAOv/C,WAAWosF,IAEvC,GAAc,MAAV7oF,EAAiB,OAErB,IADA,IAAI3C,EAAI,EACC2rF,EAAMnuF,EAAO,GAAc,IAAVmF,GAAe3C,EAAI9C,KAAqB,IAATyuF,EAAaA,IAAO3rF,IAC3E2C,GAAUwoF,EAAOO,EAAKC,KAAU,EAChCD,EAAKC,GAAQhpF,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAI1E,MAAM,kBACnCf,EAAS8C,EACTwrF,GACF,CAGA,IADA,IAAII,EAAMpuF,EAAON,EACV0uF,IAAQpuF,GAAsB,IAAdkuF,EAAKE,IAC1BA,IAIF,IAFA,IAAIC,EAAM,IAAIxzE,WAAWozE,GAAUjuF,EAAOouF,IACtC5qF,EAAIyqF,EACDG,IAAQpuF,GACbquF,EAAI7qF,KAAO0qF,EAAKE,KAElB,OAAOC,CACT,CAMA,MAAO,CACL/iE,OA7FF,SAAiB61B,GAOf,GANIA,aAAkBtmC,aACXO,YAAYC,OAAO8lC,GAC5BA,EAAS,IAAItmC,WAAWsmC,EAAOliD,OAAQkiD,EAAO1lC,WAAY0lC,EAAO/6C,YACxD1D,MAAMC,QAAQw+C,KACvBA,EAAStmC,WAAWlb,KAAKwhD,OAErBA,aAAkBtmC,YAAe,MAAM,IAAI9a,UAAU,uBAC3D,GAAsB,IAAlBohD,EAAOzhD,OAAgB,MAAO,GAMlC,IAJA,IAAIuuF,EAAS,EACTvuF,EAAS,EACT4uF,EAAS,EACTC,EAAOptC,EAAOzhD,OACX4uF,IAAWC,GAA2B,IAAnBptC,EAAOmtC,IAC/BA,IACAL,IAMF,IAHA,IAAIjuF,GAASuuF,EAAOD,GAAUR,EAAU,IAAO,EAC3CU,EAAM,IAAI3zE,WAAW7a,GAElBsuF,IAAWC,GAAM,CAItB,IAHA,IAAIppF,EAAQg8C,EAAOmtC,GAEf9rF,EAAI,EACCisF,EAAMzuF,EAAO,GAAc,IAAVmF,GAAe3C,EAAI9C,KAAqB,IAAT+uF,EAAaA,IAAOjsF,IAC3E2C,GAAU,IAAMqpF,EAAIC,KAAU,EAC9BD,EAAIC,GAAQtpF,EAAQwoF,IAAU,EAC9BxoF,EAASA,EAAQwoF,IAAU,EAE7B,GAAc,IAAVxoF,EAAe,MAAM,IAAI1E,MAAM,kBACnCf,EAAS8C,EACT8rF,GACF,CAGA,IADA,IAAII,EAAM1uF,EAAON,EACVgvF,IAAQ1uF,GAAqB,IAAbwuF,EAAIE,IACzBA,IAIF,IADA,IAAIzsF,EAAM2rF,EAAOrxB,OAAO0xB,GACjBS,EAAM1uF,IAAQ0uF,EAAOzsF,GAAOurF,EAASxjE,OAAOwkE,EAAIE,IACvD,OAAOzsF,CACT,EAkDE8rF,aAAcA,EACdvtD,OARF,SAAiB/+B,GACf,IAAIxC,EAAS8uF,EAAatsF,GAC1B,GAAIxC,EAAU,OAAOA,EACrB,MAAM,IAAIwB,MAAM,WAAaktF,EAAO,aACtC,EAMF,0BCtHA1vF,EAAOD,QAAUm8B,EAEjBA,EAAM4G,SAAW,KACjB5G,EAAMgG,SAAW,CAAEwuD,UAAU,GAE7B,IAAIj0B,EAAY,EAAQ,IACpB55B,EAAY,EAAQ,IACpBjY,EAAY,EAAQ,IACpBmW,EAAY,EAAQ,IACpB6e,EAAY,EAAQ,IACpBnQ,EAAY,EAAQ,IACpB5kB,EAAY,EAAQ,GACpB0Z,EAAY,EAAQ,IACpBmd,EAAY,EAAQ,IACpB1gB,EAAY,EAAQ,IACpBlW,EAAY,EAAQ,GAEpB6lE,EAAc,gBACdC,EAAc,kBACdC,EAAc,qBACdC,EAAc,uBACdC,EAAc,YACdC,EAAc,cACdrR,EAAc,oDACdsR,EAAc,2BACdC,EAAc,+DACdC,EAAc,kCAkClB,SAASj1D,EAAMgnB,EAAQrjD,EAAM+uB,GAEnB/uB,aAAgBgjC,IAClBjU,EAAU/uB,EACVA,EAAO,IAAIgjC,GAEVjU,IACDA,EAAUsN,EAAMgG,UAEpB,IAQIkvD,EACAjuC,EACAC,EACAq6B,EA0lBAhf,EArmBA4yB,EAAK50B,EAASvZ,EAAQt0B,EAAQuuC,uBAAwB,GACtD3hD,EAAO61E,EAAG71E,KACVuF,EAAOswE,EAAGtwE,KACV29C,EAAO2yB,EAAG3yB,KACVnf,EAAO8xC,EAAG9xC,KACVof,EAAO0yB,EAAG1yB,KAEVxhB,GAAO,EAKPm0C,GAAW,EAEXtuD,EAAMnjC,EAEN0xF,EAAY3iE,EAAQ8hE,SAAW,SAASz2E,GAAQ,OAAOA,CAAM,EAAI6Q,EAAKqB,UAG1E,SAASsxC,EAAQgB,EAAOxkD,EAAMu3E,GAC1B,IAAI1uD,EAAW5G,EAAM4G,SAGrB,OAFK0uD,IACDt1D,EAAM4G,SAAW,MACdtgC,MAAM,YAAcyX,GAAQ,SAAW,KAAOwkD,EAAQ,OAAS37B,EAAWA,EAAW,KAAO,IAAM,QAAUuuD,EAAGnmD,KAAO,IACjI,CAEA,SAASmzB,IACL,IACII,EADA9vC,EAAS,GAEb,EAAG,CAEC,GAAyB,OAApB8vC,EAAQjjD,MAA8B,MAAVijD,EAC7B,MAAMhB,EAAQgB,GAElB9vC,EAAO5N,KAAKvF,KACZ+jC,EAAKkf,GACLA,EAAQC,GACZ,OAAmB,MAAVD,GAA4B,MAAVA,GAC3B,OAAO9vC,EAAOsN,KAAK,GACvB,CAEA,SAASw1D,EAAUC,GACf,IAAIjzB,EAAQjjD,IACZ,OAAQijD,GACJ,IAAK,IACL,IAAK,IAED,OADA19C,EAAK09C,GACEJ,IACX,IAAK,OAAQ,IAAK,OACd,OAAO,EACX,IAAK,QAAS,IAAK,QACf,OAAO,EAEf,IACI,OAuBR,SAAqBI,EAAO+yB,GACxB,IAAInnC,EAAO,EAKX,OAJwB,MAApBoU,EAAM1yC,OAAO,KACbs+B,GAAQ,EACRoU,EAAQA,EAAMxyC,UAAU,IAEpBwyC,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAOpU,GAAOlgC,KAClB,IAAK,MAAO,IAAK,MAAO,IAAK,MAAO,IAAK,MACrC,OAAOmpD,IACX,IAAK,IACD,OAAO,EAEf,GAAIqd,EAAShlE,KAAK8yC,GACd,OAAOpU,EAAO5pC,SAASg+C,EAAO,IAClC,GAAIoyB,EAASllE,KAAK8yC,GACd,OAAOpU,EAAO5pC,SAASg+C,EAAO,IAClC,GAAIsyB,EAAQplE,KAAK8yC,GACb,OAAOpU,EAAO5pC,SAASg+C,EAAO,GAGlC,GAAIkhB,EAASh0D,KAAK8yC,GACd,OAAOpU,EAAOjU,WAAWqoB,GAG7B,MAAMhB,EAAQgB,EAAO,UAjD8B,EAkDvD,CAlDekzB,CAAYlzB,EACvB,CAAE,MAAOn7D,GAGL,GAAIouF,GAAiBR,EAAUvlE,KAAK8yC,GAChC,OAAOA,EAGX,MAAMhB,EAAQgB,EAAO,QACzB,CACJ,CAEA,SAASmzB,EAAWpuE,EAAQquE,GACxB,IAAIpzB,EAAOx6D,EACX,IACQ4tF,GAAuC,OAApBpzB,EAAQC,MAA8B,MAAVD,EAG/Cj7C,EAAOzC,KAAK,CAAE9c,EAAQ6tF,EAAQt2E,KAAS+jC,EAAK,MAAM,GAAQuyC,EAAQt2E,KAAUvX,IAF5Euf,EAAOzC,KAAKs9C,WAGX9e,EAAK,KAAK,IACnBA,EAAK,IACT,CA+BA,SAASuyC,EAAQrzB,EAAOszB,GACpB,OAAQtzB,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAO,UACX,IAAK,IACD,OAAO,EAIf,IAAKszB,GAAsC,MAApBtzB,EAAM1yC,OAAO,GAChC,MAAM0xC,EAAQgB,EAAO,MAEzB,GAAImyB,EAAYjlE,KAAK8yC,GACjB,OAAOh+C,SAASg+C,EAAO,IAC3B,GAAIqyB,EAAYnlE,KAAK8yC,GACjB,OAAOh+C,SAASg+C,EAAO,IAG3B,GAAIuyB,EAAWrlE,KAAK8yC,GAChB,OAAOh+C,SAASg+C,EAAO,GAG3B,MAAMhB,EAAQgB,EAAO,KACzB,CAEA,SAASuzB,IAGL,QAAY7vF,IAARivF,EACA,MAAM3zB,EAAQ,WAKlB,GAHA2zB,EAAM51E,KAGD01E,EAAUvlE,KAAKylE,GAChB,MAAM3zB,EAAQ2zB,EAAK,QAEvBpuD,EAAMA,EAAI/iC,OAAOmxF,GACjB7xC,EAAK,IACT,CAEA,SAAS0yC,IACL,IACIC,EADAzzB,EAAQC,IAEZ,OAAQD,GACJ,IAAK,OACDyzB,EAAe9uC,IAAgBA,EAAc,IAC7C5nC,IACA,MACJ,IAAK,SACDA,IAEJ,QACI02E,EAAe/uC,IAAYA,EAAU,IAG7Csb,EAAQJ,IACR9e,EAAK,KACL2yC,EAAanxE,KAAK09C,EACtB,CAEA,SAAS0zB,IAML,GALA5yC,EAAK,KACLk+B,EAASpf,MACTizB,EAAsB,WAAX7T,IAGiB,WAAXA,EACb,MAAMhgB,EAAQggB,EAAQ,UAE1Bl+B,EAAK,IACT,CAEA,SAAS6yC,EAAYjwD,EAAQs8B,GACzB,OAAQA,GAEJ,IAAK,SAGD,OAFA4zB,EAAYlwD,EAAQs8B,GACpBlf,EAAK,MACE,EAEX,IAAK,UAED,OAqCZ,SAAmBpd,EAAQs8B,GAGvB,IAAKwyB,EAAOtlE,KAAK8yC,EAAQjjD,KACrB,MAAMiiD,EAAQgB,EAAO,aAEzB,IAAIxgD,EAAO,IAAI2M,EAAK6zC,GACpB6zB,EAAQr0E,GAAM,SAAyBwgD,GACnC,IAAI2zB,EAAYn0E,EAAMwgD,GAGtB,OAAQA,GAEJ,IAAK,OAoHjB,SAAuBt8B,GACnBod,EAAK,KACL,IAAIwB,EAAUvlC,IAGd,QAA8BrZ,IAA1B6+B,EAAM0C,OAAOqd,GACb,MAAM0c,EAAQ1c,EAAS,QAE3BxB,EAAK,KACL,IAAI6/B,EAAY5jE,IAGhB,IAAK01E,EAAUvlE,KAAKyzD,GAChB,MAAM3hB,EAAQ2hB,EAAW,QAE7B7/B,EAAK,KACL,IAAItlC,EAAOuB,IAGX,IAAKy1E,EAAOtlE,KAAK1R,GACb,MAAMwjD,EAAQxjD,EAAM,QAExBslC,EAAK,KACL,IAAI1P,EAAQ,IAAI+P,EAAS2xC,EAAUt3E,GAAO63E,EAAQt2E,KAASulC,EAASq+B,GACpEkT,EAAQziD,GAAO,SAA6B4uB,GAGxC,GAAc,WAAVA,EAIA,MAAMhB,EAAQgB,GAHd4zB,EAAYxiD,EAAO4uB,GACnBlf,EAAK,IAIb,IAAG,WACCgzC,GAAmB1iD,EACvB,IACA1N,EAAOp3B,IAAI8kC,EACf,CAxJgB2iD,CAAcv0E,GACd,MAEJ,IAAK,WACL,IAAK,WACL,IAAK,WACDw0E,EAAWx0E,EAAMwgD,GACjB,MAEJ,IAAK,SAiJjB,SAAoBt8B,EAAQs8B,GAGxB,IAAKwyB,EAAOtlE,KAAK8yC,EAAQjjD,KACrB,MAAMiiD,EAAQgB,EAAO,QAEzB,IAAI/uB,EAAQ,IAAID,EAAM8hD,EAAU9yB,IAChC6zB,EAAQ5iD,GAAO,SAA0B+uB,GACvB,WAAVA,GACA4zB,EAAY3iD,EAAO+uB,GACnBlf,EAAK,OAELx+B,EAAK09C,GACLg0B,EAAW/iD,EAAO,YAE1B,IACAvN,EAAOp3B,IAAI2kC,EACf,CAjKgBgjD,CAAWz0E,EAAMwgD,GACjB,MAEJ,IAAK,aACDmzB,EAAW3zE,EAAKkiC,aAAeliC,EAAKkiC,WAAa,KACjD,MAEJ,IAAK,WACDyxC,EAAW3zE,EAAK+Q,WAAa/Q,EAAK+Q,SAAW,KAAK,GAClD,MAEJ,QAEI,IAAKsiE,IAAaJ,EAAUvlE,KAAK8yC,GAC7B,MAAMhB,EAAQgB,GAElB19C,EAAK09C,GACLg0B,EAAWx0E,EAAM,YAG7B,IACAkkB,EAAOp3B,IAAIkT,EACf,CApFY00E,CAAUxwD,EAAQs8B,IACX,EAEX,IAAK,OAED,OA4NZ,SAAmBt8B,EAAQs8B,GAGvB,IAAKwyB,EAAOtlE,KAAK8yC,EAAQjjD,KACrB,MAAMiiD,EAAQgB,EAAO,QAEzB,IAAI1xC,EAAM,IAAIlC,EAAK4zC,GACnB6zB,EAAQvlE,GAAK,SAAyB0xC,GACpC,OAAOA,GACL,IAAK,SACH4zB,EAAYtlE,EAAK0xC,GACjBlf,EAAK,KACL,MAEF,IAAK,WACHqyC,EAAW7kE,EAAIiC,WAAajC,EAAIiC,SAAW,KAAK,GAChD,MAEF,SAOR,SAAwBmT,EAAQs8B,GAG5B,IAAKwyB,EAAOtlE,KAAK8yC,GACb,MAAMhB,EAAQgB,EAAO,QAEzBlf,EAAK,KACL,IAAI5+C,EAAQmxF,EAAQt2E,KAAQ,GACxBo3E,EAAQ,CAAC,EACbN,EAAQM,GAAO,SAA8Bn0B,GAGzC,GAAc,WAAVA,EAIA,MAAMhB,EAAQgB,GAHd4zB,EAAYO,EAAOn0B,GACnBlf,EAAK,IAIb,IAAG,WACCgzC,GAAmBK,EACvB,IACAzwD,EAAOp3B,IAAI0zD,EAAO99D,EAAOiyF,EAAM/jE,QACnC,CA5BUgkE,CAAe9lE,EAAK0xC,GAE1B,IACAt8B,EAAOp3B,IAAIgiB,EACf,CApPY+lE,CAAU3wD,EAAQs8B,IACX,EAEX,IAAK,UAED,OAoUZ,SAAsBt8B,EAAQs8B,GAG1B,IAAKwyB,EAAOtlE,KAAK8yC,EAAQjjD,KACrB,MAAMiiD,EAAQgB,EAAO,gBAEzB,IAAI5c,EAAU,IAAItd,EAAQk6B,GAC1B6zB,EAAQzwC,GAAS,SAA4B4c,GACzC,IAAI2zB,EAAYvwC,EAAS4c,GAAzB,CAIA,GAAc,QAAVA,EAGA,MAAMhB,EAAQgB,IAK1B,SAAqBt8B,EAAQs8B,GACzB,IAAIxgD,EAAOwgD,EAGX,IAAKwyB,EAAOtlE,KAAK8yC,EAAQjjD,KACrB,MAAMiiD,EAAQgB,EAAO,QAEzB,IACInc,EAAaE,EACbD,EAAcE,EAFdxoC,EAAOwkD,EASX,GALAlf,EAAK,KACDA,EAAK,UAAU,KACfiD,GAAgB,IAGf0uC,EAAUvlE,KAAK8yC,EAAQjjD,KACxB,MAAMiiD,EAAQgB,GAQlB,GANAnc,EAAcmc,EACdlf,EAAK,KAAMA,EAAK,WAAYA,EAAK,KAC7BA,EAAK,UAAU,KACfkD,GAAiB,IAGhByuC,EAAUvlE,KAAK8yC,EAAQjjD,KACxB,MAAMiiD,EAAQgB,GAElBlc,EAAekc,EACflf,EAAK,KAEL,IAAIzQ,EAAS,IAAI4S,EAAOznC,EAAMgE,EAAMqkC,EAAaC,EAAcC,EAAeC,GAC9E6vC,EAAQxjD,GAAQ,SAA2B2vB,GAGvC,GAAc,WAAVA,EAIA,MAAMhB,EAAQgB,GAHd4zB,EAAYvjD,EAAQ2vB,GACpBlf,EAAK,IAIb,IACApd,EAAOp3B,IAAI+jC,EACf,CAlDYikD,CAAYlxC,EAAS4c,EAJf,CAOd,IACAt8B,EAAOp3B,IAAI82C,EACf,CAvVYmxC,CAAa7wD,EAAQs8B,IACd,EAEX,IAAK,SAED,OAiYZ,SAAwBt8B,EAAQs8B,GAG5B,IAAKyyB,EAAUvlE,KAAK8yC,EAAQjjD,KACxB,MAAMiiD,EAAQgB,EAAO,aAEzB,IAAIw0B,EAAYx0B,EAChB6zB,EAAQ,MAAM,SAA8B7zB,GACxC,OAAQA,GAEJ,IAAK,WACL,IAAK,WACL,IAAK,WACDg0B,EAAWtwD,EAAQs8B,EAAOw0B,GAC1B,MAEJ,QAEI,IAAK3B,IAAaJ,EAAUvlE,KAAK8yC,GAC7B,MAAMhB,EAAQgB,GAClB19C,EAAK09C,GACLg0B,EAAWtwD,EAAQ,WAAY8wD,GAG3C,GACJ,CA3ZYC,CAAe/wD,EAAQs8B,IAChB,EAEf,OAAO,CACX,CAEA,SAAS6zB,EAAQz0E,EAAKs1E,EAAMC,GACxB,IAAIx0B,EAAeyyB,EAAGnmD,KAKtB,GAJIrtB,IACAA,EAAIgR,QAAU8vC,IACd9gD,EAAIilB,SAAW5G,EAAM4G,UAErByc,EAAK,KAAK,GAAO,CAEjB,IADA,IAAIkf,EACwB,OAApBA,EAAQjjD,MACZ23E,EAAK10B,GACTlf,EAAK,KAAK,EACd,MACQ6zC,GACAA,IACJ7zC,EAAK,KACD1hC,GAA8B,iBAAhBA,EAAIgR,UAClBhR,EAAIgR,QAAU8vC,EAAKC,GAE/B,CAkDA,SAAS6zB,EAAWtwD,EAAQjB,EAAMxG,GAC9B,IAAIzc,EAAOzC,IACX,GAAa,UAATyC,EAAJ,CAMA,IAAKizE,EAAUvlE,KAAK1N,GAChB,MAAMw/C,EAAQx/C,EAAM,QAExB,IAAIhE,EAAOuB,IAGX,IAAKy1E,EAAOtlE,KAAK1R,GACb,MAAMwjD,EAAQxjD,EAAM,QAExBA,EAAOs3E,EAAUt3E,GACjBslC,EAAK,KAEL,IAAI1P,EAAQ,IAAI9O,EAAM9mB,EAAM63E,EAAQt2E,KAASyC,EAAMijB,EAAMxG,GACzD43D,EAAQziD,GAAO,SAA0B4uB,GAGrC,GAAc,WAAVA,EAIA,MAAMhB,EAAQgB,GAHd4zB,EAAYxiD,EAAO4uB,GACnBlf,EAAK,IAIb,IAAG,WACCgzC,GAAmB1iD,EACvB,IACA1N,EAAOp3B,IAAI8kC,GAKNyhD,IAAYzhD,EAAMxO,eAAoCl/B,IAAvB6+B,EAAMqB,OAAOpkB,SAA6C9b,IAAtB6+B,EAAMyC,MAAMxlB,IAChF4xB,EAAM7N,UAAU,UAAU,GAAsB,EAlCpD,MAqCJ,SAAoBG,EAAQjB,GACxB,IAAIjnB,EAAOuB,IAGX,IAAKy1E,EAAOtlE,KAAK1R,GACb,MAAMwjD,EAAQxjD,EAAM,QAExB,IAAI0oB,EAAY7X,EAAKsH,QAAQnY,GACzBA,IAAS0oB,IACT1oB,EAAO6Q,EAAKgB,QAAQ7R,IACxBslC,EAAK,KACL,IAAIhzB,EAAKulE,EAAQt2E,KACbyC,EAAO,IAAI2M,EAAK3Q,GACpBgE,EAAKmiC,OAAQ,EACb,IAAIvQ,EAAQ,IAAI9O,EAAM4B,EAAWpW,EAAItS,EAAMinB,GAC3C2O,EAAM/M,SAAW5G,EAAM4G,SACvBwvD,EAAQr0E,GAAM,SAA0BwgD,GACpC,OAAQA,GAEJ,IAAK,SACD4zB,EAAYp0E,EAAMwgD,GAClBlf,EAAK,KACL,MAEJ,IAAK,WACL,IAAK,WACL,IAAK,WACDkzC,EAAWx0E,EAAMwgD,GACjB,MAGJ,QACI,MAAMhB,EAAQgB,GAE1B,IACAt8B,EAAOp3B,IAAIkT,GACJlT,IAAI8kC,EACf,CA5EQwjD,CAAWlxD,EAAQjB,EAqC3B,CAoJA,SAASmxD,EAAYlwD,EAAQs8B,GACzB,IAAI60B,EAAW/zC,EAAK,KAAK,GAGzB,IAAK2xC,EAAUvlE,KAAK8yC,EAAQjjD,KACxB,MAAMiiD,EAAQgB,EAAO,QAEzB,IAAIxkD,EAAOwkD,EACP60B,IACA/zC,EAAK,KACLtlC,EAAO,IAAMA,EAAO,IACpBwkD,EAAQC,IACJyyB,EAAYxlE,KAAK8yC,KACjBxkD,GAAQwkD,EACRjjD,MAGR+jC,EAAK,KACLg0C,EAAiBpxD,EAAQloB,EAC7B,CAEA,SAASs5E,EAAiBpxD,EAAQloB,GAC9B,GAAIslC,EAAK,KAAK,GACV,EAAG,CAEC,IAAK0xC,EAAOtlE,KAAK8yC,EAAQjjD,KACrB,MAAMiiD,EAAQgB,EAAO,QAEV,MAAXC,IACA60B,EAAiBpxD,EAAQloB,EAAO,IAAMwkD,IAEtClf,EAAK,KACU,MAAXmf,IACA60B,EAAiBpxD,EAAQloB,EAAO,IAAMwkD,GAEtCz8B,EAAUG,EAAQloB,EAAO,IAAMwkD,EAAOgzB,GAAU,KAExDlyC,EAAK,KAAK,EACd,QAAUA,EAAK,KAAK,SAEpBvd,EAAUG,EAAQloB,EAAMw3E,GAAU,GAE1C,CAEA,SAASzvD,EAAUG,EAAQloB,EAAMtZ,GACzBwhC,EAAOH,WACPG,EAAOH,UAAU/nB,EAAMtZ,EAC/B,CAEA,SAAS4xF,GAAmBpwD,GACxB,GAAIod,EAAK,KAAK,GAAO,CACjB,GACI8yC,EAAYlwD,EAAQ,gBACfod,EAAK,KAAK,IACnBA,EAAK,IACT,CACA,OAAOpd,CACX,CA+FA,KAA4B,QAApBs8B,EAAQjjD,MACZ,OAAQijD,GAEJ,IAAK,UAGD,IAAKthB,EACD,MAAMsgB,EAAQgB,GAElBuzB,IACA,MAEJ,IAAK,SAGD,IAAK70C,EACD,MAAMsgB,EAAQgB,GAElBwzB,IACA,MAEJ,IAAK,SAGD,IAAK90C,EACD,MAAMsgB,EAAQgB,GAElB0zB,IACA,MAEJ,IAAK,SAGD,IAAKh1C,EACD,MAAMsgB,EAAQgB,GAElB4zB,EAAYrvD,EAAKy7B,GACjBlf,EAAK,KACL,MAEJ,QAGI,GAAI6yC,EAAYpvD,EAAKy7B,GAAQ,CACzBthB,GAAO,EACP,QACJ,CAGA,MAAMsgB,EAAQgB,GAK1B,OADAviC,EAAM4G,SAAW,KACV,CACH,QAAgBsuD,EAChB,QAAgBjuC,EACfC,YAAeA,EACfq6B,OAAeA,EACf59E,KAAeA,EAExB,oBCxuBAG,EAAOD,QAAU2iD,EAEjB,IA+DI8wC,EA/DAC,EAAW,QAsBf,SAAS/wC,EAAOzoC,EAAMiV,GACbukE,EAAS9nE,KAAK1R,KACfA,EAAO,mBAAqBA,EAAO,SACnCiV,EAAO,CAAEuV,OAAQ,CAAEivD,OAAQ,CAAEjvD,OAAQ,CAAEimD,SAAU,CAAEjmD,OAAQvV,QAE/DwzB,EAAOzoC,GAAQiV,CACnB,CAWAwzB,EAAO,MAAO,CAUVixC,IAAK,CACD1uD,OAAQ,CACJu3B,SAAU,CACNv+C,KAAM,SACNsO,GAAI,GAER5rB,MAAO,CACHsd,KAAM,QACNsO,GAAI,OAQpBm2B,EAAO,WAAY,CAUfkxC,SAAUJ,EAAW,CACjBvuD,OAAQ,CACJ4uD,QAAS,CACL51E,KAAM,QACNsO,GAAI,GAERunE,MAAO,CACH71E,KAAM,QACNsO,GAAI,OAMpBm2B,EAAO,YAAa,CAUhBqxC,UAAWP,IAGf9wC,EAAO,QAAS,CAOZsxC,MAAO,CACH/uD,OAAQ,CAAC,KAIjByd,EAAO,SAAU,CASbuxC,OAAQ,CACJhvD,OAAQ,CACJA,OAAQ,CACJ8b,QAAS,SACT9iC,KAAM,QACNsO,GAAI,KAkBhB2nE,MAAO,CACHh0C,OAAQ,CACJi0C,KAAM,CACFzkD,MAAO,CACH,YACA,cACA,cACA,YACA,cACA,eAIZzK,OAAQ,CACJmvD,UAAW,CACPn2E,KAAM,YACNsO,GAAI,GAER8nE,YAAa,CACTp2E,KAAM,SACNsO,GAAI,GAER+nE,YAAa,CACTr2E,KAAM,SACNsO,GAAI,GAERgoE,UAAW,CACPt2E,KAAM,OACNsO,GAAI,GAERioE,YAAa,CACTv2E,KAAM,SACNsO,GAAI,GAERkoE,UAAW,CACPx2E,KAAM,YACNsO,GAAI,KAKhBmoE,UAAW,CACP/lE,OAAQ,CACJgmE,WAAY,IAWpBC,UAAW,CACP3vD,OAAQ,CACJtW,OAAQ,CACJuS,KAAM,WACNjjB,KAAM,QACNsO,GAAI,OAMpBm2B,EAAO,WAAY,CASfmyC,YAAa,CACT5vD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,SACNsO,GAAI,KAYhBuoE,WAAY,CACR7vD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,QACNsO,GAAI,KAYhBwoE,WAAY,CACR9vD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,QACNsO,GAAI,KAYhByoE,YAAa,CACT/vD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,SACNsO,GAAI,KAYhB0oE,WAAY,CACRhwD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,QACNsO,GAAI,KAYhB2oE,YAAa,CACTjwD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,SACNsO,GAAI,KAYhB4oE,UAAW,CACPlwD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,OACNsO,GAAI,KAYhB6oE,YAAa,CACTnwD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,SACNsO,GAAI,KAYhB8oE,WAAY,CACRpwD,OAAQ,CACJtkC,MAAO,CACHsd,KAAM,QACNsO,GAAI,OAMpBm2B,EAAO,aAAc,CASjB4yC,UAAW,CACPrwD,OAAQ,CACJswD,MAAO,CACHr0D,KAAM,WACNjjB,KAAM,SACNsO,GAAI,OAqBpBm2B,EAAOhgC,IAAM,SAAag7D,GACtB,OAAOh7B,EAAOg7B,IAAS,IAC3B,0BC5YA,IAAI1wD,EAAQ,EAAQ,GAChBtqB,EAAK,EAAQ,GACbD,EAAW,EAAQ,GACnB4mB,EAAO,EAAQ,IAEfhnB,EAAS2qB,EAAM3qB,OAEnB,SAASmzF,EAAWxlD,GAClB3mB,EAAKhP,KAAKtX,KAAM,QAASitC,GAEzBjtC,KAAKgE,EAAI,IAAIrE,EAAGstC,EAAKjpC,EAAG,IAAIoR,MAAMpV,KAAKG,KACvCH,KAAKiE,EAAI,IAAItE,EAAGstC,EAAKhpC,EAAG,IAAImR,MAAMpV,KAAKG,KACvCH,KAAK0yF,KAAO1yF,KAAKmtC,IAAI12B,UAErBzW,KAAK2yF,MAAqC,IAA7B3yF,KAAKgE,EAAEwR,UAAUnB,KAAK,GACnCrU,KAAK4yF,OAAmD,IAA1C5yF,KAAKgE,EAAEwR,UAAUvN,IAAIjI,KAAK+O,GAAGsF,MAAM,GAGjDrU,KAAK6yF,KAAO7yF,KAAK8yF,iBAAiB7lD,GAClCjtC,KAAK+yF,YAAc,IAAIrxF,MAAM,GAC7B1B,KAAKgzF,YAAc,IAAItxF,MAAM,EAC/B,CAmOA,SAASuxF,EAAM/vD,EAAO11B,EAAGC,EAAGylF,GAC1B5sE,EAAKwnB,UAAUx2B,KAAKtX,KAAMkjC,EAAO,UACvB,OAAN11B,GAAoB,OAANC,GAChBzN,KAAKwN,EAAI,KACTxN,KAAKyN,EAAI,KACTzN,KAAKmzF,KAAM,IAEXnzF,KAAKwN,EAAI,IAAI7N,EAAG6N,EAAG,IACnBxN,KAAKyN,EAAI,IAAI9N,EAAG8N,EAAG,IAEfylF,IACFlzF,KAAKwN,EAAEkI,SAAS1V,KAAKkjC,MAAM/iC,KAC3BH,KAAKyN,EAAEiI,SAAS1V,KAAKkjC,MAAM/iC,MAExBH,KAAKwN,EAAErN,MACVH,KAAKwN,EAAIxN,KAAKwN,EAAE4H,MAAMpV,KAAKkjC,MAAM/iC,MAC9BH,KAAKyN,EAAEtN,MACVH,KAAKyN,EAAIzN,KAAKyN,EAAE2H,MAAMpV,KAAKkjC,MAAM/iC,MACnCH,KAAKmzF,KAAM,EAEf,CA2NA,SAASC,EAAOlwD,EAAO11B,EAAGC,EAAGqL,GAC3BwN,EAAKwnB,UAAUx2B,KAAKtX,KAAMkjC,EAAO,YACvB,OAAN11B,GAAoB,OAANC,GAAoB,OAANqL,GAC9B9Y,KAAKwN,EAAIxN,KAAKkjC,MAAMvqB,IACpB3Y,KAAKyN,EAAIzN,KAAKkjC,MAAMvqB,IACpB3Y,KAAK8Y,EAAI,IAAInZ,EAAG,KAEhBK,KAAKwN,EAAI,IAAI7N,EAAG6N,EAAG,IACnBxN,KAAKyN,EAAI,IAAI9N,EAAG8N,EAAG,IACnBzN,KAAK8Y,EAAI,IAAInZ,EAAGmZ,EAAG,KAEhB9Y,KAAKwN,EAAErN,MACVH,KAAKwN,EAAIxN,KAAKwN,EAAE4H,MAAMpV,KAAKkjC,MAAM/iC,MAC9BH,KAAKyN,EAAEtN,MACVH,KAAKyN,EAAIzN,KAAKyN,EAAE2H,MAAMpV,KAAKkjC,MAAM/iC,MAC9BH,KAAK8Y,EAAE3Y,MACVH,KAAK8Y,EAAI9Y,KAAK8Y,EAAE1D,MAAMpV,KAAKkjC,MAAM/iC,MAEnCH,KAAKqzF,KAAOrzF,KAAK8Y,IAAM9Y,KAAKkjC,MAAMvqB,GACpC,CApeAjZ,EAAS+yF,EAAYnsE,GACrBrpB,EAAOD,QAAUy1F,EAEjBA,EAAW/0F,UAAUo1F,iBAAmB,SAA0B7lD,GAEhE,GAAKjtC,KAAK2yF,OAAU3yF,KAAKyT,GAAMzT,KAAKwP,GAAwB,IAAnBxP,KAAK+O,EAAEnK,KAAK,GAArD,CAIA,IAAIurC,EACA6R,EACJ,GAAI/U,EAAKkD,KACPA,EAAO,IAAIxwC,EAAGstC,EAAKkD,KAAM,IAAI/6B,MAAMpV,KAAKG,SACnC,CACL,IAAImzF,EAAQtzF,KAAKuzF,cAAcvzF,KAAK+O,GAGpCohC,GADAA,EAAOmjD,EAAM,GAAGvxF,IAAIuxF,EAAM,IAAM,EAAIA,EAAM,GAAKA,EAAM,IACzCl+E,MAAMpV,KAAKG,IACzB,CACA,GAAI8sC,EAAK+U,OACPA,EAAS,IAAIriD,EAAGstC,EAAK+U,OAAQ,QACxB,CAEL,IAAIwxC,EAAUxzF,KAAKuzF,cAAcvzF,KAAKwP,GACsB,IAAxDxP,KAAKyT,EAAErS,IAAIoyF,EAAQ,IAAIhmF,EAAEzL,IAAI/B,KAAKyT,EAAEjG,EAAEyI,OAAOk6B,IAC/C6R,EAASwxC,EAAQ,IAEjBxxC,EAASwxC,EAAQ,GACjBl0F,EAA2D,IAApDU,KAAKyT,EAAErS,IAAI4gD,GAAQx0C,EAAEzL,IAAI/B,KAAKyT,EAAEjG,EAAEyI,OAAOk6B,KAEpD,CAeA,MAAO,CACLA,KAAMA,EACN6R,OAAQA,EACRC,MAdEhV,EAAKgV,MACChV,EAAKgV,MAAM1jB,KAAI,SAASk1D,GAC9B,MAAO,CACLzvF,EAAG,IAAIrE,EAAG8zF,EAAIzvF,EAAG,IACjBC,EAAG,IAAItE,EAAG8zF,EAAIxvF,EAAG,IAErB,IAEQjE,KAAK0zF,cAAc1xC,GApCrB,CA4CV,EAEAywC,EAAW/0F,UAAU61F,cAAgB,SAAuB9xF,GAI1D,IAAItB,EAAMsB,IAAQzB,KAAK+O,EAAI/O,KAAKG,IAAMR,EAAGwZ,KAAK1X,GAC1CixF,EAAO,IAAI/yF,EAAG,GAAGyV,MAAMjV,GAAKsW,UAC5Bk9E,EAAQjB,EAAKh8E,SAEbjI,EAAI,IAAI9O,EAAG,GAAGyV,MAAMjV,GAAKuW,SAASH,UAAUN,OAAOy8E,GAIvD,MAAO,CAFEiB,EAAMh+E,OAAOlH,GAAG+G,UAChBm+E,EAAM99E,OAAOpH,GAAG+G,UAE3B,EAEAi9E,EAAW/0F,UAAUg2F,cAAgB,SAAuB1xC,GA2B1D,IAzBA,IAYI35C,EACA8B,EAEA3B,EACA8B,EAEA3B,EACA8B,EAEAmpF,EAEA7yF,EACAyM,EAxBAqmF,EAAW7zF,KAAKwP,EAAEoC,MAAMtQ,KAAKylB,MAAM/mB,KAAKwP,EAAEzJ,YAAc,IAIxDqT,EAAI4oC,EACJlW,EAAI9rC,KAAKwP,EAAElM,QACX4Q,EAAK,IAAIvU,EAAG,GACZm0F,EAAK,IAAIn0F,EAAG,GACZwU,EAAK,IAAIxU,EAAG,GACZo0F,EAAK,IAAIp0F,EAAG,GAaZ6B,EAAI,EAGa,IAAd4X,EAAE/E,KAAK,IAAU,CACtB,IAAI7O,EAAIsmC,EAAEp5B,IAAI0G,GACdrY,EAAI+qC,EAAE7jC,IAAIzC,EAAEpE,IAAIgY,IAChB5L,EAAI2G,EAAGlM,IAAIzC,EAAEpE,IAAI8S,IACjB,IAAIzG,EAAIsmF,EAAG9rF,IAAIzC,EAAEpE,IAAI0yF,IAErB,IAAKtrF,GAAMzH,EAAEgB,IAAI8xF,GAAY,EAC3BxrF,EAAKurF,EAAMhtF,MACXuD,EAAK+J,EACL1L,EAAKzH,EAAE6F,MACP0D,EAAKkD,OACA,GAAIhF,GAAc,KAANhH,EACjB,MAEFoyF,EAAQ7yF,EAER+qC,EAAI1yB,EACJA,EAAIrY,EACJoT,EAAKD,EACLA,EAAK1G,EACLumF,EAAKD,EACLA,EAAKrmF,CACP,CACA9E,EAAK5H,EAAE6F,MACP6D,EAAK+C,EAEL,IAAIwmF,EAAOxrF,EAAGmI,MAAM3I,IAAIsC,EAAGqG,OAiB3B,OAhBWhI,EAAGgI,MAAM3I,IAAIyC,EAAGkG,OAClB5O,IAAIiyF,IAAS,IACpBrrF,EAAKN,EACLoC,EAAKN,GAIH3B,EAAGvI,WACLuI,EAAKA,EAAG5B,MACR0D,EAAKA,EAAG1D,OAEN+B,EAAG1I,WACL0I,EAAKA,EAAG/B,MACR6D,EAAKA,EAAG7D,OAGH,CACL,CAAE5C,EAAGwE,EAAIvE,EAAGqG,GACZ,CAAEtG,EAAOC,EAAGwG,GAEhB,EAEAgoF,EAAW/0F,UAAUu2F,WAAa,SAAoB7vF,GACpD,IAAI69C,EAAQjiD,KAAK6yF,KAAK5wC,MAClBiyC,EAAKjyC,EAAM,GACXkyC,EAAKlyC,EAAM,GAEXiL,EAAKinC,EAAGlwF,EAAE7C,IAAIgD,GAAG2O,SAAS/S,KAAKwP,GAC/B29C,EAAK+mC,EAAGjwF,EAAE2C,MAAMxF,IAAIgD,GAAG2O,SAAS/S,KAAKwP,GAErC4kF,EAAKlnC,EAAG9rD,IAAI8yF,EAAGlwF,GACfqwF,EAAKlnC,EAAG/rD,IAAI+yF,EAAGnwF,GACfswF,EAAKpnC,EAAG9rD,IAAI8yF,EAAGjwF,GACfswF,EAAKpnC,EAAG/rD,IAAI+yF,EAAGlwF,GAKnB,MAAO,CAAEymB,GAFAtmB,EAAE6D,IAAImsF,GAAInsF,IAAIosF,GAEN1pE,GADR2pE,EAAGtsF,IAAIusF,GAAI3tF,MAEtB,EAEA6rF,EAAW/0F,UAAUiyC,WAAa,SAAoBniC,EAAGkC,IACvDlC,EAAI,IAAI7N,EAAG6N,EAAG,KACPrN,MACLqN,EAAIA,EAAE4H,MAAMpV,KAAKG,MAEnB,IAAI4zF,EAAKvmF,EAAE4I,SAASH,OAAOzI,GAAGoI,QAAQpI,EAAEyI,OAAOjW,KAAKgE,IAAI4R,QAAQ5V,KAAKiE,GACjEwJ,EAAIsmF,EAAGx9E,UACX,GAA6C,IAAzC9I,EAAE2I,SAASP,OAAOk+E,GAAIhyF,IAAI/B,KAAKktC,MACjC,MAAM,IAAIztC,MAAM,iBAIlB,IAAIqU,EAAQrG,EAAE+H,UAAU1B,QAIxB,OAHIpE,IAAQoE,IAAUpE,GAAOoE,KAC3BrG,EAAIA,EAAEiJ,UAED1W,KAAKguC,MAAMxgC,EAAGC,EACvB,EAEAglF,EAAW/0F,UAAUuwC,SAAW,SAAkBD,GAChD,GAAIA,EAAMmlD,IACR,OAAO,EAET,IAAI3lF,EAAIwgC,EAAMxgC,EACVC,EAAIugC,EAAMvgC,EAEV+mF,EAAKx0F,KAAKgE,EAAEiS,OAAOzI,GACnBinF,EAAMjnF,EAAE4I,SAASH,OAAOzI,GAAGoI,QAAQ4+E,GAAI5+E,QAAQ5V,KAAKiE,GACxD,OAA2C,IAApCwJ,EAAE2I,SAASN,QAAQ2+E,GAAKpgF,KAAK,EACtC,EAEAo+E,EAAW/0F,UAAUg3F,gBACjB,SAAyB/lD,EAAQQ,EAAQC,GAGvC,IAFA,IAAIulD,EAAU30F,KAAK+yF,YACf6B,EAAU50F,KAAKgzF,YACVxxF,EAAI,EAAGA,EAAImtC,EAAOjwC,OAAQ8C,IAAK,CACtC,IAAI0W,EAAQlY,KAAKi0F,WAAW9kD,EAAO3tC,IAC/BuN,EAAI4/B,EAAOntC,GACX2uC,EAAOphC,EAAEqhC,WAETl4B,EAAMwS,GAAGzqB,WACXiY,EAAMwS,GAAGhkB,OACTqI,EAAIA,EAAEnI,KAAI,IAERsR,EAAMyS,GAAG1qB,WACXiY,EAAMyS,GAAGjkB,OACTypC,EAAOA,EAAKvpC,KAAI,IAGlB+tF,EAAY,EAAJnzF,GAASuN,EACjB4lF,EAAY,EAAJnzF,EAAQ,GAAK2uC,EACrBykD,EAAY,EAAJpzF,GAAS0W,EAAMwS,GACvBkqE,EAAY,EAAJpzF,EAAQ,GAAK0W,EAAMyS,EAC7B,CAIA,IAHA,IAAIplB,EAAMvF,KAAKivC,YAAY,EAAG0lD,EAASC,EAAa,EAAJpzF,EAAO4tC,GAG9C5sC,EAAI,EAAGA,EAAQ,EAAJhB,EAAOgB,IACzBmyF,EAAQnyF,GAAK,KACboyF,EAAQpyF,GAAK,KAEf,OAAO+C,CACT,EAuBJ7F,EAASuzF,EAAO3sE,EAAKwnB,WAErB2kD,EAAW/0F,UAAUswC,MAAQ,SAAexgC,EAAGC,EAAGylF,GAChD,OAAO,IAAID,EAAMjzF,KAAMwN,EAAGC,EAAGylF,EAC/B,EAEAT,EAAW/0F,UAAU0vC,cAAgB,SAAuBtyB,EAAK3a,GAC/D,OAAO8yF,EAAM/mE,SAASlsB,KAAM8a,EAAK3a,EACnC,EAEA8yF,EAAMv1F,UAAU0yC,SAAW,WACzB,GAAKpwC,KAAKkjC,MAAM2vD,KAAhB,CAGA,IAAItxC,EAAMvhD,KAAK+tC,YACf,GAAIwT,GAAOA,EAAIpR,KACb,OAAOoR,EAAIpR,KAEb,IAAIA,EAAOnwC,KAAKkjC,MAAM8K,MAAMhuC,KAAKwN,EAAEyI,OAAOjW,KAAKkjC,MAAM2vD,KAAK1iD,MAAOnwC,KAAKyN,GACtE,GAAI8zC,EAAK,CACP,IAAIre,EAAQljC,KAAKkjC,MACb2xD,EAAU,SAAS9lF,GACrB,OAAOm0B,EAAM8K,MAAMj/B,EAAEvB,EAAEyI,OAAOitB,EAAM2vD,KAAK1iD,MAAOphC,EAAEtB,EACpD,EACA8zC,EAAIpR,KAAOA,EACXA,EAAKpC,YAAc,CACjBoC,KAAM,KACN3lB,IAAK+2B,EAAI/2B,KAAO,CACdxR,IAAKuoC,EAAI/2B,IAAIxR,IACb21B,OAAQ4S,EAAI/2B,IAAImkB,OAAOpQ,IAAIs2D,IAE7B1mD,QAASoT,EAAIpT,SAAW,CACtBG,KAAMiT,EAAIpT,QAAQG,KAClBK,OAAQ4S,EAAIpT,QAAQQ,OAAOpQ,IAAIs2D,IAGrC,CACA,OAAO1kD,CAzBC,CA0BV,EAEA8iD,EAAMv1F,UAAUsH,OAAS,WACvB,OAAKhF,KAAK+tC,YAGH,CAAE/tC,KAAKwN,EAAGxN,KAAKyN,EAAGzN,KAAK+tC,aAAe,CAC3CI,QAASnuC,KAAK+tC,YAAYI,SAAW,CACnCG,KAAMtuC,KAAK+tC,YAAYI,QAAQG,KAC/BK,OAAQ3uC,KAAK+tC,YAAYI,QAAQQ,OAAOz0B,MAAM,IAEhDsQ,IAAKxqB,KAAK+tC,YAAYvjB,KAAO,CAC3BxR,IAAKhZ,KAAK+tC,YAAYvjB,IAAIxR,IAC1B21B,OAAQ3uC,KAAK+tC,YAAYvjB,IAAImkB,OAAOz0B,MAAM,MATrC,CAAEla,KAAKwN,EAAGxN,KAAKyN,EAY1B,EAEAwlF,EAAM/mE,SAAW,SAAkBgX,EAAOpoB,EAAK3a,GAC1B,iBAAR2a,IACTA,EAAMgqB,KAAK3L,MAAMre,IACnB,IAAIvV,EAAM29B,EAAM8K,MAAMlzB,EAAI,GAAIA,EAAI,GAAI3a,GACtC,IAAK2a,EAAI,GACP,OAAOvV,EAET,SAASuvF,EAAUh6E,GACjB,OAAOooB,EAAM8K,MAAMlzB,EAAI,GAAIA,EAAI,GAAI3a,EACrC,CAEA,IAAIohD,EAAMzmC,EAAI,GAYd,OAXAvV,EAAIwoC,YAAc,CAChBoC,KAAM,KACNhC,QAASoT,EAAIpT,SAAW,CACtBG,KAAMiT,EAAIpT,QAAQG,KAClBK,OAAQ,CAAEppC,GAAMwa,OAAOwhC,EAAIpT,QAAQQ,OAAOpQ,IAAIu2D,KAEhDtqE,IAAK+2B,EAAI/2B,KAAO,CACdxR,IAAKuoC,EAAI/2B,IAAIxR,IACb21B,OAAQ,CAAEppC,GAAMwa,OAAOwhC,EAAI/2B,IAAImkB,OAAOpQ,IAAIu2D,MAGvCvvF,CACT,EAEA0tF,EAAMv1F,UAAU+F,QAAU,WACxB,OAAIzD,KAAK2hD,aACA,sBACF,gBAAkB3hD,KAAKwN,EAAEgI,UAAUtT,SAAS,GAAI,GACnD,OAASlC,KAAKyN,EAAE+H,UAAUtT,SAAS,GAAI,GAAK,GAClD,EAEA+wF,EAAMv1F,UAAUikD,WAAa,WAC3B,OAAO3hD,KAAKmzF,GACd,EAEAF,EAAMv1F,UAAUsK,IAAM,SAAa+G,GAEjC,GAAI/O,KAAKmzF,IACP,OAAOpkF,EAGT,GAAIA,EAAEokF,IACJ,OAAOnzF,KAGT,GAAIA,KAAKkV,GAAGnG,GACV,OAAO/O,KAAKswC,MAGd,GAAItwC,KAAK4G,MAAMsO,GAAGnG,GAChB,OAAO/O,KAAKkjC,MAAM8K,MAAM,KAAM,MAGhC,GAAwB,IAApBhuC,KAAKwN,EAAEzL,IAAIgN,EAAEvB,GACf,OAAOxN,KAAKkjC,MAAM8K,MAAM,KAAM,MAEhC,IAAIrtC,EAAIX,KAAKyN,EAAEoI,OAAO9G,EAAEtB,GACN,IAAd9M,EAAE0T,KAAK,KACT1T,EAAIA,EAAEsV,OAAOjW,KAAKwN,EAAEqI,OAAO9G,EAAEvB,GAAGiJ,YAClC,IAAIs+E,EAAKp0F,EAAEyV,SAASN,QAAQ9V,KAAKwN,GAAGsI,QAAQ/G,EAAEvB,GAC1CwnF,EAAKr0F,EAAEsV,OAAOjW,KAAKwN,EAAEqI,OAAOk/E,IAAKj/E,QAAQ9V,KAAKyN,GAClD,OAAOzN,KAAKkjC,MAAM8K,MAAM+mD,EAAIC,EAC9B,EAEA/B,EAAMv1F,UAAU4yC,IAAM,WACpB,GAAItwC,KAAKmzF,IACP,OAAOnzF,KAGT,IAAIi1F,EAAMj1F,KAAKyN,EAAEkI,OAAO3V,KAAKyN,GAC7B,GAAoB,IAAhBwnF,EAAI5gF,KAAK,GACX,OAAOrU,KAAKkjC,MAAM8K,MAAM,KAAM,MAEhC,IAAIhqC,EAAIhE,KAAKkjC,MAAMl/B,EAEfmQ,EAAKnU,KAAKwN,EAAE4I,SACZ8+E,EAAQD,EAAIx+E,UACZ9V,EAAIwT,EAAGwB,OAAOxB,GAAIyB,QAAQzB,GAAIyB,QAAQ5R,GAAGiS,OAAOi/E,GAEhDH,EAAKp0F,EAAEyV,SAASN,QAAQ9V,KAAKwN,EAAEmI,OAAO3V,KAAKwN,IAC3CwnF,EAAKr0F,EAAEsV,OAAOjW,KAAKwN,EAAEqI,OAAOk/E,IAAKj/E,QAAQ9V,KAAKyN,GAClD,OAAOzN,KAAKkjC,MAAM8K,MAAM+mD,EAAIC,EAC9B,EAEA/B,EAAMv1F,UAAUqyC,KAAO,WACrB,OAAO/vC,KAAKwN,EAAEgI,SAChB,EAEAy9E,EAAMv1F,UAAUsyC,KAAO,WACrB,OAAOhwC,KAAKyN,EAAE+H,SAChB,EAEAy9E,EAAMv1F,UAAU0D,IAAM,SAAagD,GAEjC,OADAA,EAAI,IAAIzE,EAAGyE,EAAG,IACVpE,KAAK2hD,aACA3hD,KACAA,KAAKqwC,YAAYjsC,GACjBpE,KAAKkjC,MAAMgL,aAAaluC,KAAMoE,GAC9BpE,KAAKkjC,MAAM2vD,KACX7yF,KAAKkjC,MAAMwxD,gBAAgB,CAAE10F,MAAQ,CAAEoE,IAEvCpE,KAAKkjC,MAAM2L,SAAS7uC,KAAMoE,EACrC,EAEA6uF,EAAMv1F,UAAUy3F,OAAS,SAAgBzqE,EAAI2pE,EAAI1pE,GAC/C,IAAIgkB,EAAS,CAAE3uC,KAAMq0F,GACjBllD,EAAS,CAAEzkB,EAAIC,GACnB,OAAI3qB,KAAKkjC,MAAM2vD,KACN7yF,KAAKkjC,MAAMwxD,gBAAgB/lD,EAAQQ,GAEnCnvC,KAAKkjC,MAAM+L,YAAY,EAAGN,EAAQQ,EAAQ,EACrD,EAEA8jD,EAAMv1F,UAAU03F,QAAU,SAAiB1qE,EAAI2pE,EAAI1pE,GACjD,IAAIgkB,EAAS,CAAE3uC,KAAMq0F,GACjBllD,EAAS,CAAEzkB,EAAIC,GACnB,OAAI3qB,KAAKkjC,MAAM2vD,KACN7yF,KAAKkjC,MAAMwxD,gBAAgB/lD,EAAQQ,GAAQ,GAE3CnvC,KAAKkjC,MAAM+L,YAAY,EAAGN,EAAQQ,EAAQ,GAAG,EACxD,EAEA8jD,EAAMv1F,UAAUwX,GAAK,SAAYnG,GAC/B,OAAO/O,OAAS+O,GACT/O,KAAKmzF,MAAQpkF,EAAEokF,MACVnzF,KAAKmzF,KAA2B,IAApBnzF,KAAKwN,EAAEzL,IAAIgN,EAAEvB,IAAgC,IAApBxN,KAAKyN,EAAE1L,IAAIgN,EAAEtB,GAChE,EAEAwlF,EAAMv1F,UAAUkJ,IAAM,SAAayuF,GACjC,GAAIr1F,KAAKmzF,IACP,OAAOnzF,KAET,IAAIuF,EAAMvF,KAAKkjC,MAAM8K,MAAMhuC,KAAKwN,EAAGxN,KAAKyN,EAAEiJ,UAC1C,GAAI2+E,GAAer1F,KAAK+tC,YAAa,CACnC,IAAIwT,EAAMvhD,KAAK+tC,YACXunD,EAAS,SAASvmF,GACpB,OAAOA,EAAEnI,KACX,EACArB,EAAIwoC,YAAc,CAChBvjB,IAAK+2B,EAAI/2B,KAAO,CACdxR,IAAKuoC,EAAI/2B,IAAIxR,IACb21B,OAAQ4S,EAAI/2B,IAAImkB,OAAOpQ,IAAI+2D,IAE7BnnD,QAASoT,EAAIpT,SAAW,CACtBG,KAAMiT,EAAIpT,QAAQG,KAClBK,OAAQ4S,EAAIpT,QAAQQ,OAAOpQ,IAAI+2D,IAGrC,CACA,OAAO/vF,CACT,EAEA0tF,EAAMv1F,UAAU6xC,IAAM,WACpB,OAAIvvC,KAAKmzF,IACAnzF,KAAKkjC,MAAMuL,OAAO,KAAM,KAAM,MAE7BzuC,KAAKkjC,MAAMuL,OAAOzuC,KAAKwN,EAAGxN,KAAKyN,EAAGzN,KAAKkjC,MAAMvqB,IAEzD,EAsBAjZ,EAAS0zF,EAAQ9sE,EAAKwnB,WAEtB2kD,EAAW/0F,UAAU+wC,OAAS,SAAgBjhC,EAAGC,EAAGqL,GAClD,OAAO,IAAIs6E,EAAOpzF,KAAMwN,EAAGC,EAAGqL,EAChC,EAEAs6E,EAAO11F,UAAUkxC,IAAM,WACrB,GAAI5uC,KAAK2hD,aACP,OAAO3hD,KAAKkjC,MAAM8K,MAAM,KAAM,MAEhC,IAAIunD,EAAOv1F,KAAK8Y,EAAErC,UACd++E,EAAQD,EAAKn/E,SACbo+E,EAAKx0F,KAAKwN,EAAEyI,OAAOu/E,GACnBC,EAAKz1F,KAAKyN,EAAEwI,OAAOu/E,GAAOv/E,OAAOs/E,GAErC,OAAOv1F,KAAKkjC,MAAM8K,MAAMwmD,EAAIiB,EAC9B,EAEArC,EAAO11F,UAAUkJ,IAAM,WACrB,OAAO5G,KAAKkjC,MAAMuL,OAAOzuC,KAAKwN,EAAGxN,KAAKyN,EAAEiJ,SAAU1W,KAAK8Y,EACzD,EAEAs6E,EAAO11F,UAAUsK,IAAM,SAAa+G,GAElC,GAAI/O,KAAK2hD,aACP,OAAO5yC,EAGT,GAAIA,EAAE4yC,aACJ,OAAO3hD,KAGT,IAAI01F,EAAM3mF,EAAE+J,EAAE1C,SACVu/E,EAAK31F,KAAK8Y,EAAE1C,SACZ4U,EAAKhrB,KAAKwN,EAAEyI,OAAOy/E,GACnBzqE,EAAKlc,EAAEvB,EAAEyI,OAAO0/E,GAChBlrC,EAAKzqD,KAAKyN,EAAEwI,OAAOy/E,EAAIz/E,OAAOlH,EAAE+J,IAChC4xC,EAAK37C,EAAEtB,EAAEwI,OAAO0/E,EAAG1/E,OAAOjW,KAAK8Y,IAE/BzH,EAAI2Z,EAAGnV,OAAOoV,GACdlqB,EAAI0pD,EAAG50C,OAAO60C,GAClB,GAAkB,IAAdr5C,EAAEgD,KAAK,GACT,OAAkB,IAAdtT,EAAEsT,KAAK,GACFrU,KAAKkjC,MAAMuL,OAAO,KAAM,KAAM,MAE9BzuC,KAAKswC,MAGhB,IAAIslD,EAAKvkF,EAAE+E,SACPy/E,EAAKD,EAAG3/E,OAAO5E,GACfy6B,EAAI9gB,EAAG/U,OAAO2/E,GAEdb,EAAKh0F,EAAEqV,SAASR,QAAQigF,GAAI//E,QAAQg2B,GAAGh2B,QAAQg2B,GAC/CkpD,EAAKj0F,EAAEkV,OAAO61B,EAAEh2B,QAAQi/E,IAAKj/E,QAAQ20C,EAAGx0C,OAAO4/E,IAC/CC,EAAK91F,KAAK8Y,EAAE7C,OAAOlH,EAAE+J,GAAG7C,OAAO5E,GAEnC,OAAOrR,KAAKkjC,MAAMuL,OAAOsmD,EAAIC,EAAIc,EACnC,EAEA1C,EAAO11F,UAAUgxC,SAAW,SAAkB3/B,GAE5C,GAAI/O,KAAK2hD,aACP,OAAO5yC,EAAEwgC,MAGX,GAAIxgC,EAAE4yC,aACJ,OAAO3hD,KAGT,IAAI21F,EAAK31F,KAAK8Y,EAAE1C,SACZ4U,EAAKhrB,KAAKwN,EACVyd,EAAKlc,EAAEvB,EAAEyI,OAAO0/E,GAChBlrC,EAAKzqD,KAAKyN,EACVi9C,EAAK37C,EAAEtB,EAAEwI,OAAO0/E,GAAI1/E,OAAOjW,KAAK8Y,GAEhCzH,EAAI2Z,EAAGnV,OAAOoV,GACdlqB,EAAI0pD,EAAG50C,OAAO60C,GAClB,GAAkB,IAAdr5C,EAAEgD,KAAK,GACT,OAAkB,IAAdtT,EAAEsT,KAAK,GACFrU,KAAKkjC,MAAMuL,OAAO,KAAM,KAAM,MAE9BzuC,KAAKswC,MAGhB,IAAIslD,EAAKvkF,EAAE+E,SACPy/E,EAAKD,EAAG3/E,OAAO5E,GACfy6B,EAAI9gB,EAAG/U,OAAO2/E,GAEdb,EAAKh0F,EAAEqV,SAASR,QAAQigF,GAAI//E,QAAQg2B,GAAGh2B,QAAQg2B,GAC/CkpD,EAAKj0F,EAAEkV,OAAO61B,EAAEh2B,QAAQi/E,IAAKj/E,QAAQ20C,EAAGx0C,OAAO4/E,IAC/CC,EAAK91F,KAAK8Y,EAAE7C,OAAO5E,GAEvB,OAAOrR,KAAKkjC,MAAMuL,OAAOsmD,EAAIC,EAAIc,EACnC,EAEA1C,EAAO11F,UAAUsxC,KAAO,SAAc7rC,GACpC,GAAY,IAARA,EACF,OAAOnD,KACT,GAAIA,KAAK2hD,aACP,OAAO3hD,KACT,IAAKmD,EACH,OAAOnD,KAAKswC,MAEd,IAAI9uC,EACJ,GAAIxB,KAAKkjC,MAAMyvD,OAAS3yF,KAAKkjC,MAAM0vD,OAAQ,CACzC,IAAI7xF,EAAIf,KACR,IAAKwB,EAAI,EAAGA,EAAI2B,EAAK3B,IACnBT,EAAIA,EAAEuvC,MACR,OAAOvvC,CACT,CAIA,IAAIiD,EAAIhE,KAAKkjC,MAAMl/B,EACf0uF,EAAO1yF,KAAKkjC,MAAMwvD,KAElBqD,EAAK/1F,KAAKwN,EACVwoF,EAAKh2F,KAAKyN,EACVwoF,EAAKj2F,KAAK8Y,EACVo9E,EAAMD,EAAG7/E,SAASA,SAGlB+/E,EAAMH,EAAGrgF,OAAOqgF,GACpB,IAAKx0F,EAAI,EAAGA,EAAI2B,EAAK3B,IAAK,CACxB,IAAI40F,EAAML,EAAG3/E,SACTigF,EAAOF,EAAI//E,SACXkgF,EAAOD,EAAKjgF,SACZzV,EAAIy1F,EAAIzgF,OAAOygF,GAAKxgF,QAAQwgF,GAAKxgF,QAAQ5R,EAAEiS,OAAOigF,IAElDjsC,EAAK8rC,EAAG9/E,OAAOogF,GACftB,EAAKp0F,EAAEyV,SAASN,QAAQm0C,EAAGt0C,OAAOs0C,IAClCC,EAAKD,EAAGn0C,QAAQi/E,GAChBwB,EAAM51F,EAAEsV,OAAOi0C,GACnBqsC,EAAMA,EAAI3gF,QAAQ2gF,GAAKzgF,QAAQwgF,GAC/B,IAAIR,EAAKK,EAAIlgF,OAAOggF,GAChBz0F,EAAI,EAAI2B,IACV+yF,EAAMA,EAAIjgF,OAAOqgF,IAEnBP,EAAKhB,EACLkB,EAAKH,EACLK,EAAMI,CACR,CAEA,OAAOv2F,KAAKkjC,MAAMuL,OAAOsnD,EAAII,EAAIlgF,OAAOy8E,GAAOuD,EACjD,EAEA7C,EAAO11F,UAAU4yC,IAAM,WACrB,OAAItwC,KAAK2hD,aACA3hD,KAELA,KAAKkjC,MAAMyvD,MACN3yF,KAAKw2F,WACLx2F,KAAKkjC,MAAM0vD,OACX5yF,KAAKy2F,YAELz2F,KAAK02F,MAChB,EAEAtD,EAAO11F,UAAU84F,SAAW,WAC1B,IAAIzB,EACAC,EACAc,EAEJ,GAAI91F,KAAKqzF,KAAM,CAMb,IAAIsD,EAAK32F,KAAKwN,EAAE4I,SAEZwgF,EAAK52F,KAAKyN,EAAE2I,SAEZygF,EAAOD,EAAGxgF,SAEV3H,EAAIzO,KAAKwN,EAAEmI,OAAOihF,GAAIxgF,SAASN,QAAQ6gF,GAAI7gF,QAAQ+gF,GACvDpoF,EAAIA,EAAEmH,QAAQnH,GAEd,IAAIgB,EAAIknF,EAAGhhF,OAAOghF,GAAI/gF,QAAQ+gF,GAE1B9wF,EAAI4J,EAAE2G,SAASN,QAAQrH,GAAGqH,QAAQrH,GAGlCqoF,EAAQD,EAAKjhF,QAAQihF,GAEzBC,GADAA,EAAQA,EAAMlhF,QAAQkhF,IACRlhF,QAAQkhF,GAGtB/B,EAAKlvF,EAELmvF,EAAKvlF,EAAEwG,OAAOxH,EAAEqH,QAAQjQ,IAAIiQ,QAAQghF,GAEpChB,EAAK91F,KAAKyN,EAAEkI,OAAO3V,KAAKyN,EAC1B,KAAO,CAML,IAAIzJ,EAAIhE,KAAKwN,EAAE4I,SAEXnS,EAAIjE,KAAKyN,EAAE2I,SAEXzV,EAAIsD,EAAEmS,SAENsa,EAAI1wB,KAAKwN,EAAEmI,OAAO1R,GAAGmS,SAASN,QAAQ9R,GAAG8R,QAAQnV,GACrD+vB,EAAIA,EAAE9a,QAAQ8a,GAEd,IAAInwB,EAAIyD,EAAE2R,OAAO3R,GAAG4R,QAAQ5R,GAExB4gC,EAAIrkC,EAAE6V,SAGN2gF,EAAKp2F,EAAEiV,QAAQjV,GAEnBo2F,GADAA,EAAKA,EAAGnhF,QAAQmhF,IACRnhF,QAAQmhF,GAGhBhC,EAAKnwD,EAAE9uB,QAAQ4a,GAAG5a,QAAQ4a,GAE1BskE,EAAKz0F,EAAE0V,OAAOya,EAAE5a,QAAQi/E,IAAKj/E,QAAQihF,GAGrCjB,GADAA,EAAK91F,KAAKyN,EAAEwI,OAAOjW,KAAK8Y,IAChBlD,QAAQkgF,EAClB,CAEA,OAAO91F,KAAKkjC,MAAMuL,OAAOsmD,EAAIC,EAAIc,EACnC,EAEA1C,EAAO11F,UAAU+4F,UAAY,WAC3B,IAAI1B,EACAC,EACAc,EAEJ,GAAI91F,KAAKqzF,KAAM,CAMb,IAAIsD,EAAK32F,KAAKwN,EAAE4I,SAEZwgF,EAAK52F,KAAKyN,EAAE2I,SAEZygF,EAAOD,EAAGxgF,SAEV3H,EAAIzO,KAAKwN,EAAEmI,OAAOihF,GAAIxgF,SAASN,QAAQ6gF,GAAI7gF,QAAQ+gF,GACvDpoF,EAAIA,EAAEmH,QAAQnH,GAEd,IAAIgB,EAAIknF,EAAGhhF,OAAOghF,GAAI/gF,QAAQ+gF,GAAI/gF,QAAQ5V,KAAKkjC,MAAMl/B,GAEjD6B,EAAI4J,EAAE2G,SAASN,QAAQrH,GAAGqH,QAAQrH,GAEtCsmF,EAAKlvF,EAEL,IAAIixF,EAAQD,EAAKjhF,QAAQihF,GAEzBC,GADAA,EAAQA,EAAMlhF,QAAQkhF,IACRlhF,QAAQkhF,GACtB9B,EAAKvlF,EAAEwG,OAAOxH,EAAEqH,QAAQjQ,IAAIiQ,QAAQghF,GAEpChB,EAAK91F,KAAKyN,EAAEkI,OAAO3V,KAAKyN,EAC1B,KAAO,CAKL,IAAI2G,EAAQpU,KAAK8Y,EAAE1C,SAEf4gF,EAAQh3F,KAAKyN,EAAE2I,SAEf+5B,EAAOnwC,KAAKwN,EAAEyI,OAAO+gF,GAErBC,EAAQj3F,KAAKwN,EAAEqI,OAAOzB,GAAO6B,OAAOjW,KAAKwN,EAAEmI,OAAOvB,IACtD6iF,EAAQA,EAAMthF,OAAOshF,GAAOrhF,QAAQqhF,GAEpC,IAAIC,EAAQ/mD,EAAKv6B,QAAQu6B,GAErBgnD,GADJD,EAAQA,EAAMthF,QAAQshF,IACJvhF,OAAOuhF,GACzBnC,EAAKkC,EAAM7gF,SAASN,QAAQqhF,GAE5BrB,EAAK91F,KAAKyN,EAAEkI,OAAO3V,KAAK8Y,GAAG1C,SAASN,QAAQkhF,GAAOlhF,QAAQ1B,GAE3D,IAAIgjF,EAAUJ,EAAM5gF,SAGpBghF,GADAA,GADAA,EAAUA,EAAQxhF,QAAQwhF,IACRxhF,QAAQwhF,IACRxhF,QAAQwhF,GAC1BpC,EAAKiC,EAAMhhF,OAAOihF,EAAMphF,QAAQi/E,IAAKj/E,QAAQshF,EAC/C,CAEA,OAAOp3F,KAAKkjC,MAAMuL,OAAOsmD,EAAIC,EAAIc,EACnC,EAEA1C,EAAO11F,UAAUg5F,KAAO,WACtB,IAAI1yF,EAAIhE,KAAKkjC,MAAMl/B,EAGf+xF,EAAK/1F,KAAKwN,EACVwoF,EAAKh2F,KAAKyN,EACVwoF,EAAKj2F,KAAK8Y,EACVo9E,EAAMD,EAAG7/E,SAASA,SAElBggF,EAAML,EAAG3/E,SACTihF,EAAMrB,EAAG5/E,SAETzV,EAAIy1F,EAAIzgF,OAAOygF,GAAKxgF,QAAQwgF,GAAKxgF,QAAQ5R,EAAEiS,OAAOigF,IAElDoB,EAAOvB,EAAGpgF,OAAOogF,GAEjB9rC,GADJqtC,EAAOA,EAAK1hF,QAAQ0hF,IACNrhF,OAAOohF,GACjBtC,EAAKp0F,EAAEyV,SAASN,QAAQm0C,EAAGt0C,OAAOs0C,IAClCC,EAAKD,EAAGn0C,QAAQi/E,GAEhBwC,EAAOF,EAAIjhF,SAGfmhF,GADAA,GADAA,EAAOA,EAAK3hF,QAAQ2hF,IACR3hF,QAAQ2hF,IACR3hF,QAAQ2hF,GACpB,IAAIvC,EAAKr0F,EAAEsV,OAAOi0C,GAAIp0C,QAAQyhF,GAC1BzB,EAAKE,EAAGrgF,OAAOqgF,GAAI//E,OAAOggF,GAE9B,OAAOj2F,KAAKkjC,MAAMuL,OAAOsmD,EAAIC,EAAIc,EACnC,EAEA1C,EAAO11F,UAAU85F,KAAO,WACtB,IAAKx3F,KAAKkjC,MAAMyvD,MACd,OAAO3yF,KAAKswC,MAAMtoC,IAAIhI,MAMxB,IAAI22F,EAAK32F,KAAKwN,EAAE4I,SAEZwgF,EAAK52F,KAAKyN,EAAE2I,SAEZqhF,EAAKz3F,KAAK8Y,EAAE1C,SAEZygF,EAAOD,EAAGxgF,SAEV3G,EAAIknF,EAAGhhF,OAAOghF,GAAI/gF,QAAQ+gF,GAE1Be,EAAKjoF,EAAE2G,SAEP7V,EAAIP,KAAKwN,EAAEmI,OAAOihF,GAAIxgF,SAASN,QAAQ6gF,GAAI7gF,QAAQ+gF,GAKnDc,GAFJp3F,GADAA,GADAA,EAAIA,EAAEqV,QAAQrV,IACRoV,OAAOpV,GAAGqV,QAAQrV,IAClBuV,QAAQ4hF,IAEHthF,SAEPvQ,EAAIgxF,EAAKjhF,QAAQihF,GAGrBhxF,GADAA,GADAA,EAAIA,EAAE+P,QAAQ/P,IACR+P,QAAQ/P,IACR+P,QAAQ/P,GAEd,IAAIuT,EAAI3J,EAAEmG,QAAQrV,GAAG6V,SAASN,QAAQ4hF,GAAI5hF,QAAQ6hF,GAAI7hF,QAAQjQ,GAE1D+xF,EAAOhB,EAAG3gF,OAAOmD,GAErBw+E,GADAA,EAAOA,EAAKhiF,QAAQgiF,IACRhiF,QAAQgiF,GACpB,IAAI7C,EAAK/0F,KAAKwN,EAAEyI,OAAO0hF,GAAI7hF,QAAQ8hF,GAEnC7C,GADAA,EAAKA,EAAGn/E,QAAQm/E,IACRn/E,QAAQm/E,GAEhB,IAAIC,EAAKh1F,KAAKyN,EAAEwI,OAAOmD,EAAEnD,OAAOpQ,EAAEiQ,QAAQsD,IAAItD,QAAQvV,EAAE0V,OAAO0hF,KAG/D3C,GADAA,GADAA,EAAKA,EAAGp/E,QAAQo/E,IACRp/E,QAAQo/E,IACRp/E,QAAQo/E,GAEhB,IAAIc,EAAK91F,KAAK8Y,EAAEnD,OAAOpV,GAAG6V,SAASN,QAAQ2hF,GAAI3hF,QAAQ6hF,GAEvD,OAAO33F,KAAKkjC,MAAMuL,OAAOsmD,EAAIC,EAAIc,EACnC,EAEA1C,EAAO11F,UAAU0D,IAAM,SAAagD,EAAGyzF,GAGrC,OAFAzzF,EAAI,IAAIzE,EAAGyE,EAAGyzF,GAEP73F,KAAKkjC,MAAM2L,SAAS7uC,KAAMoE,EACnC,EAEAgvF,EAAO11F,UAAUwX,GAAK,SAAYnG,GAChC,GAAe,WAAXA,EAAEmM,KACJ,OAAOlb,KAAKkV,GAAGnG,EAAEwgC,OAEnB,GAAIvvC,OAAS+O,EACX,OAAO,EAGT,IAAI4mF,EAAK31F,KAAK8Y,EAAE1C,SACZs/E,EAAM3mF,EAAE+J,EAAE1C,SACd,GAA2D,IAAvDpW,KAAKwN,EAAEyI,OAAOy/E,GAAK5/E,QAAQ/G,EAAEvB,EAAEyI,OAAO0/E,IAAKthF,KAAK,GAClD,OAAO,EAGT,IAAIyjF,EAAKnC,EAAG1/E,OAAOjW,KAAK8Y,GACpBi/E,EAAMrC,EAAIz/E,OAAOlH,EAAE+J,GACvB,OAA8D,IAAvD9Y,KAAKyN,EAAEwI,OAAO8hF,GAAKjiF,QAAQ/G,EAAEtB,EAAEwI,OAAO6hF,IAAKzjF,KAAK,EACzD,EAEA++E,EAAO11F,UAAUs6F,OAAS,SAAgBxqF,GACxC,IAAIyqF,EAAKj4F,KAAK8Y,EAAE1C,SACZ9G,EAAK9B,EAAE4H,MAAMpV,KAAKkjC,MAAM/iC,KAAK8V,OAAOgiF,GACxC,GAAuB,IAAnBj4F,KAAKwN,EAAEzL,IAAIuN,GACb,OAAO,EAIT,IAFA,IAAIo9E,EAAKl/E,EAAElK,QACPuC,EAAI7F,KAAKkjC,MAAM0K,KAAK33B,OAAOgiF,KACtB,CAEP,GADAvL,EAAG5kF,KAAK9H,KAAKkjC,MAAM1zB,GACfk9E,EAAG3qF,IAAI/B,KAAKkjC,MAAMn0B,IAAM,EAC1B,OAAO,EAGT,GADAO,EAAGsG,QAAQ/P,GACY,IAAnB7F,KAAKwN,EAAEzL,IAAIuN,GACb,OAAO,CACX,CACF,EAEA8jF,EAAO11F,UAAU+F,QAAU,WACzB,OAAIzD,KAAK2hD,aACA,uBACF,iBAAmB3hD,KAAKwN,EAAEtL,SAAS,GAAI,GAC1C,OAASlC,KAAKyN,EAAEvL,SAAS,GAAI,GAC7B,OAASlC,KAAK8Y,EAAE5W,SAAS,GAAI,GAAK,GACxC,EAEAkxF,EAAO11F,UAAUikD,WAAa,WAE5B,OAA0B,IAAnB3hD,KAAK8Y,EAAEzE,KAAK,EACrB,0BCv6BA,IAAI1U,EAAK,EAAQ,GACbD,EAAW,EAAQ,GACnB4mB,EAAO,EAAQ,IAEf2D,EAAQ,EAAQ,GAEpB,SAASiuE,EAAUjrD,GACjB3mB,EAAKhP,KAAKtX,KAAM,OAAQitC,GAExBjtC,KAAKgE,EAAI,IAAIrE,EAAGstC,EAAKjpC,EAAG,IAAIoR,MAAMpV,KAAKG,KACvCH,KAAKiE,EAAI,IAAItE,EAAGstC,EAAKhpC,EAAG,IAAImR,MAAMpV,KAAKG,KACvCH,KAAKm4F,GAAK,IAAIx4F,EAAG,GAAGyV,MAAMpV,KAAKG,KAAKsW,UACpCzW,KAAKmtC,IAAM,IAAIxtC,EAAG,GAAGyV,MAAMpV,KAAKG,KAChCH,KAAKo4F,IAAMp4F,KAAKm4F,GAAGliF,OAAOjW,KAAKgE,EAAE2R,OAAO3V,KAAKmtC,KAC/C,CAaA,SAAS8lD,EAAM/vD,EAAO11B,EAAGsL,GACvBwN,EAAKwnB,UAAUx2B,KAAKtX,KAAMkjC,EAAO,cACvB,OAAN11B,GAAoB,OAANsL,GAChB9Y,KAAKwN,EAAIxN,KAAKkjC,MAAMvqB,IACpB3Y,KAAK8Y,EAAI9Y,KAAKkjC,MAAMgK,OAEpBltC,KAAKwN,EAAI,IAAI7N,EAAG6N,EAAG,IACnBxN,KAAK8Y,EAAI,IAAInZ,EAAGmZ,EAAG,IACd9Y,KAAKwN,EAAErN,MACVH,KAAKwN,EAAIxN,KAAKwN,EAAE4H,MAAMpV,KAAKkjC,MAAM/iC,MAC9BH,KAAK8Y,EAAE3Y,MACVH,KAAK8Y,EAAI9Y,KAAK8Y,EAAE1D,MAAMpV,KAAKkjC,MAAM/iC,MAEvC,CAzBAT,EAASw4F,EAAW5xE,GACpBrpB,EAAOD,QAAUk7F,EAEjBA,EAAUx6F,UAAUuwC,SAAW,SAAkBD,GAC/C,IAAIxgC,EAAIwgC,EAAMk+C,YAAY1+E,EACtB2G,EAAK3G,EAAE4I,SACPq+E,EAAMtgF,EAAG8B,OAAOzI,GAAGmI,OAAOxB,EAAG8B,OAAOjW,KAAKgE,IAAI2R,OAAOnI,GAGxD,OAA+B,IAFvBinF,EAAIl+E,UAEHH,SAASrU,IAAI0yF,EACxB,EAgBA/0F,EAASuzF,EAAO3sE,EAAKwnB,WAErBoqD,EAAUx6F,UAAUgyC,YAAc,SAAqBxuB,EAAO+O,GAC5D,OAAOjwB,KAAKguC,MAAM/jB,EAAM3nB,QAAQ4e,EAAO+O,GAAM,EAC/C,EAEAioE,EAAUx6F,UAAUswC,MAAQ,SAAexgC,EAAGsL,GAC5C,OAAO,IAAIm6E,EAAMjzF,KAAMwN,EAAGsL,EAC5B,EAEAo/E,EAAUx6F,UAAU0vC,cAAgB,SAAuBtyB,GACzD,OAAOm4E,EAAM/mE,SAASlsB,KAAM8a,EAC9B,EAEAm4E,EAAMv1F,UAAUuyC,WAAa,WAE7B,EAEAgjD,EAAMv1F,UAAUmyC,QAAU,WACxB,OAAO7vC,KAAK+vC,OAAOztC,QAAQ,KAAMtC,KAAKkjC,MAAMn0B,EAAE3J,aAChD,EAEA6tF,EAAM/mE,SAAW,SAAkBgX,EAAOpoB,GACxC,OAAO,IAAIm4E,EAAM/vD,EAAOpoB,EAAI,GAAIA,EAAI,IAAMooB,EAAMvqB,IAClD,EAEAs6E,EAAMv1F,UAAU+F,QAAU,WACxB,OAAIzD,KAAK2hD,aACA,sBACF,gBAAkB3hD,KAAKwN,EAAEgI,UAAUtT,SAAS,GAAI,GACnD,OAASlC,KAAK8Y,EAAEtD,UAAUtT,SAAS,GAAI,GAAK,GAClD,EAEA+wF,EAAMv1F,UAAUikD,WAAa,WAE3B,OAA0B,IAAnB3hD,KAAK8Y,EAAEzE,KAAK,EACrB,EAEA4+E,EAAMv1F,UAAU4yC,IAAM,WAKpB,IAEI+nD,EAFIr4F,KAAKwN,EAAEmI,OAAO3V,KAAK8Y,GAEhB1C,SAIPkiF,EAFIt4F,KAAKwN,EAAEqI,OAAO7V,KAAK8Y,GAEhB1C,SAEPzV,EAAI03F,EAAGxiF,OAAOyiF,GAEdvD,EAAKsD,EAAGpiF,OAAOqiF,GAEfxC,EAAKn1F,EAAEsV,OAAOqiF,EAAG3iF,OAAO3V,KAAKkjC,MAAMk1D,IAAIniF,OAAOtV,KAClD,OAAOX,KAAKkjC,MAAM8K,MAAM+mD,EAAIe,EAC9B,EAEA7C,EAAMv1F,UAAUsK,IAAM,WACpB,MAAM,IAAIvI,MAAM,oCAClB,EAEAwzF,EAAMv1F,UAAU66F,QAAU,SAAiBxpF,EAAGyD,GAK5C,IAAIxO,EAAIhE,KAAKwN,EAAEmI,OAAO3V,KAAK8Y,GAEvB7U,EAAIjE,KAAKwN,EAAEqI,OAAO7V,KAAK8Y,GAEvBnY,EAAIoO,EAAEvB,EAAEmI,OAAO5G,EAAE+J,GAIjB0/E,EAFIzpF,EAAEvB,EAAEqI,OAAO9G,EAAE+J,GAEV7C,OAAOjS,GAEd+3B,EAAKp7B,EAAEsV,OAAOhS,GAEd8wF,EAAKviF,EAAKsG,EAAE7C,OAAOuiF,EAAG7iF,OAAOomB,GAAI3lB,UAEjC0/E,EAAKtjF,EAAKhF,EAAEyI,OAAOuiF,EAAG1iF,QAAQimB,GAAI3lB,UACtC,OAAOpW,KAAKkjC,MAAM8K,MAAM+mD,EAAIe,EAC9B,EAEA7C,EAAMv1F,UAAU0D,IAAM,SAAagD,GAMjC,IALA,IAAIyB,EAAIzB,EAAEd,QACNU,EAAIhE,KACJiE,EAAIjE,KAAKkjC,MAAM8K,MAAM,KAAM,MAGtBj9B,EAAO,GAAkB,IAAdlL,EAAEwO,KAAK,GAAUxO,EAAEH,OAAO,GAC5CqL,EAAKiN,KAAKnY,EAAEJ,MAAM,IAEpB,IAAK,IAAIjE,EAAIuP,EAAKrS,OAAS,EAAG8C,GAAK,EAAGA,IACpB,IAAZuP,EAAKvP,IAEPwC,EAAIA,EAAEu0F,QAAQt0F,EARVjE,MAUJiE,EAAIA,EAAEqsC,QAGNrsC,EAAID,EAAEu0F,QAAQt0F,EAbVjE,MAeJgE,EAAIA,EAAEssC,OAGV,OAAOrsC,CACT,EAEAgvF,EAAMv1F,UAAUy3F,OAAS,WACvB,MAAM,IAAI11F,MAAM,oCAClB,EAEAwzF,EAAMv1F,UAAU+6F,QAAU,WACxB,MAAM,IAAIh5F,MAAM,oCAClB,EAEAwzF,EAAMv1F,UAAUwX,GAAK,SAAY4oE,GAC/B,OAAyC,IAAlC99E,KAAK+vC,OAAOhuC,IAAI+7E,EAAM/tC,OAC/B,EAEAkjD,EAAMv1F,UAAUwuF,UAAY,WAG1B,OAFAlsF,KAAKwN,EAAIxN,KAAKwN,EAAEyI,OAAOjW,KAAK8Y,EAAErC,WAC9BzW,KAAK8Y,EAAI9Y,KAAKkjC,MAAMvqB,IACb3Y,IACT,EAEAizF,EAAMv1F,UAAUqyC,KAAO,WAIrB,OAFA/vC,KAAKksF,YAEElsF,KAAKwN,EAAEgI,SAChB,0BC/KA,IAAIyU,EAAQ,EAAQ,GAChBtqB,EAAK,EAAQ,GACbD,EAAW,EAAQ,GACnB4mB,EAAO,EAAQ,IAEfhnB,EAAS2qB,EAAM3qB,OAEnB,SAASo5F,EAAazrD,GAEpBjtC,KAAK24F,QAA2B,IAAP,EAAT1rD,EAAKjpC,GACrBhE,KAAK44F,MAAQ54F,KAAK24F,UAA6B,IAAR,EAAT1rD,EAAKjpC,GACnChE,KAAKoR,SAAWpR,KAAK44F,MAErBtyE,EAAKhP,KAAKtX,KAAM,UAAWitC,GAE3BjtC,KAAKgE,EAAI,IAAIrE,EAAGstC,EAAKjpC,EAAG,IAAI8O,KAAK9S,KAAKG,IAAIsP,GAC1CzP,KAAKgE,EAAIhE,KAAKgE,EAAEoR,MAAMpV,KAAKG,KAC3BH,KAAKW,EAAI,IAAIhB,EAAGstC,EAAKtsC,EAAG,IAAIyU,MAAMpV,KAAKG,KACvCH,KAAKmtD,GAAKntD,KAAKW,EAAEyV,SACjBpW,KAAK0wB,EAAI,IAAI/wB,EAAGstC,EAAKvc,EAAG,IAAItb,MAAMpV,KAAKG,KACvCH,KAAK64F,GAAK74F,KAAK0wB,EAAE/a,OAAO3V,KAAK0wB,GAE7BpxB,GAAQU,KAAK24F,SAAwC,IAA7B34F,KAAKW,EAAE6U,UAAUnB,KAAK,IAC9CrU,KAAK84F,KAAwB,IAAP,EAAT7rD,EAAKtsC,EACpB,CAuFA,SAASsyF,EAAM/vD,EAAO11B,EAAGC,EAAGqL,EAAGjT,GAC7BygB,EAAKwnB,UAAUx2B,KAAKtX,KAAMkjC,EAAO,cACvB,OAAN11B,GAAoB,OAANC,GAAoB,OAANqL,GAC9B9Y,KAAKwN,EAAIxN,KAAKkjC,MAAMgK,KACpBltC,KAAKyN,EAAIzN,KAAKkjC,MAAMvqB,IACpB3Y,KAAK8Y,EAAI9Y,KAAKkjC,MAAMvqB,IACpB3Y,KAAK6F,EAAI7F,KAAKkjC,MAAMgK,KACpBltC,KAAKqzF,MAAO,IAEZrzF,KAAKwN,EAAI,IAAI7N,EAAG6N,EAAG,IACnBxN,KAAKyN,EAAI,IAAI9N,EAAG8N,EAAG,IACnBzN,KAAK8Y,EAAIA,EAAI,IAAInZ,EAAGmZ,EAAG,IAAM9Y,KAAKkjC,MAAMvqB,IACxC3Y,KAAK6F,EAAIA,GAAK,IAAIlG,EAAGkG,EAAG,IACnB7F,KAAKwN,EAAErN,MACVH,KAAKwN,EAAIxN,KAAKwN,EAAE4H,MAAMpV,KAAKkjC,MAAM/iC,MAC9BH,KAAKyN,EAAEtN,MACVH,KAAKyN,EAAIzN,KAAKyN,EAAE2H,MAAMpV,KAAKkjC,MAAM/iC,MAC9BH,KAAK8Y,EAAE3Y,MACVH,KAAK8Y,EAAI9Y,KAAK8Y,EAAE1D,MAAMpV,KAAKkjC,MAAM/iC,MAC/BH,KAAK6F,IAAM7F,KAAK6F,EAAE1F,MACpBH,KAAK6F,EAAI7F,KAAK6F,EAAEuP,MAAMpV,KAAKkjC,MAAM/iC,MACnCH,KAAKqzF,KAAOrzF,KAAK8Y,IAAM9Y,KAAKkjC,MAAMvqB,IAG9B3Y,KAAKkjC,MAAM9xB,WAAapR,KAAK6F,IAC/B7F,KAAK6F,EAAI7F,KAAKwN,EAAEyI,OAAOjW,KAAKyN,GACvBzN,KAAKqzF,OACRrzF,KAAK6F,EAAI7F,KAAK6F,EAAEoQ,OAAOjW,KAAK8Y,EAAErC,aAGtC,CApHA/W,EAASg5F,EAAcpyE,GACvBrpB,EAAOD,QAAU07F,EAEjBA,EAAah7F,UAAUq7F,MAAQ,SAAet3F,GAC5C,OAAIzB,KAAK44F,MACAn3F,EAAIiV,SAEJ1W,KAAKgE,EAAEiS,OAAOxU,EACzB,EAEAi3F,EAAah7F,UAAUs7F,MAAQ,SAAev3F,GAC5C,OAAIzB,KAAK84F,KACAr3F,EAEAzB,KAAKW,EAAEsV,OAAOxU,EACzB,EAGAi3F,EAAah7F,UAAU+wC,OAAS,SAAgBjhC,EAAGC,EAAGqL,EAAGjT,GACvD,OAAO7F,KAAKguC,MAAMxgC,EAAGC,EAAGqL,EAAGjT,EAC7B,EAEA6yF,EAAah7F,UAAUiyC,WAAa,SAAoBniC,EAAGkC,IACzDlC,EAAI,IAAI7N,EAAG6N,EAAG,KACPrN,MACLqN,EAAIA,EAAE4H,MAAMpV,KAAKG,MAEnB,IAAIgU,EAAK3G,EAAE4I,SACPq+E,EAAMz0F,KAAKmtD,GAAGt3C,OAAO7V,KAAKgE,EAAEiS,OAAO9B,IACnC8kF,EAAMj5F,KAAK2Y,IAAI9C,OAAO7V,KAAKmtD,GAAGl3C,OAAOjW,KAAK0wB,GAAGza,OAAO9B,IAEpD4/E,EAAKU,EAAIx+E,OAAOgjF,EAAIxiF,WACpBhJ,EAAIsmF,EAAGx9E,UACX,GAA6C,IAAzC9I,EAAE2I,SAASP,OAAOk+E,GAAIhyF,IAAI/B,KAAKktC,MACjC,MAAM,IAAIztC,MAAM,iBAElB,IAAIqU,EAAQrG,EAAE+H,UAAU1B,QAIxB,OAHIpE,IAAQoE,IAAUpE,GAAOoE,KAC3BrG,EAAIA,EAAEiJ,UAED1W,KAAKguC,MAAMxgC,EAAGC,EACvB,EAEAirF,EAAah7F,UAAUw7F,WAAa,SAAoBzrF,EAAGiC,IACzDjC,EAAI,IAAI9N,EAAG8N,EAAG,KACPtN,MACLsN,EAAIA,EAAE2H,MAAMpV,KAAKG,MAGnB,IAAI4zF,EAAKtmF,EAAE2I,SACP6iF,EAAMlF,EAAGl+E,OAAO7V,KAAKmtD,IACrBsnC,EAAMV,EAAG99E,OAAOjW,KAAK0wB,GAAGza,OAAOjW,KAAKmtD,IAAIt3C,OAAO7V,KAAKgE,GACpDmQ,EAAK8kF,EAAIhjF,OAAOw+E,EAAIh+E,WAExB,GAA0B,IAAtBtC,EAAGpS,IAAI/B,KAAKktC,MAAa,CAC3B,GAAIx9B,EACF,MAAM,IAAIjQ,MAAM,iBAEhB,OAAOO,KAAKguC,MAAMhuC,KAAKktC,KAAMz/B,EACjC,CAEA,IAAID,EAAI2G,EAAGoC,UACX,GAA6C,IAAzC/I,EAAE4I,SAASP,OAAO1B,GAAIpS,IAAI/B,KAAKktC,MACjC,MAAM,IAAIztC,MAAM,iBAKlB,OAHI+N,EAAEgI,UAAU1B,UAAYpE,IAC1BlC,EAAIA,EAAEkJ,UAED1W,KAAKguC,MAAMxgC,EAAGC,EACvB,EAEAirF,EAAah7F,UAAUuwC,SAAW,SAAkBD,GAClD,GAAIA,EAAM2T,aACR,OAAO,EAGT3T,EAAMk+C,YAEN,IAAI/3E,EAAK65B,EAAMxgC,EAAE4I,SACb29E,EAAK/lD,EAAMvgC,EAAE2I,SACb6iF,EAAM9kF,EAAG8B,OAAOjW,KAAKgE,GAAG2R,OAAOo+E,GAC/BU,EAAMz0F,KAAKmtD,GAAGl3C,OAAOjW,KAAK2Y,IAAIhD,OAAO3V,KAAK0wB,EAAEza,OAAO9B,GAAI8B,OAAO89E,KAElE,OAAwB,IAAjBkF,EAAIl3F,IAAI0yF,EACjB,EAiCA/0F,EAASuzF,EAAO3sE,EAAKwnB,WAErB4qD,EAAah7F,UAAU0vC,cAAgB,SAAuBtyB,GAC5D,OAAOm4E,EAAM/mE,SAASlsB,KAAM8a,EAC9B,EAEA49E,EAAah7F,UAAUswC,MAAQ,SAAexgC,EAAGC,EAAGqL,EAAGjT,GACrD,OAAO,IAAIotF,EAAMjzF,KAAMwN,EAAGC,EAAGqL,EAAGjT,EAClC,EAEAotF,EAAM/mE,SAAW,SAAkBgX,EAAOpoB,GACxC,OAAO,IAAIm4E,EAAM/vD,EAAOpoB,EAAI,GAAIA,EAAI,GAAIA,EAAI,GAC9C,EAEAm4E,EAAMv1F,UAAU+F,QAAU,WACxB,OAAIzD,KAAK2hD,aACA,sBACF,gBAAkB3hD,KAAKwN,EAAEgI,UAAUtT,SAAS,GAAI,GACnD,OAASlC,KAAKyN,EAAE+H,UAAUtT,SAAS,GAAI,GACvC,OAASlC,KAAK8Y,EAAEtD,UAAUtT,SAAS,GAAI,GAAK,GAClD,EAEA+wF,EAAMv1F,UAAUikD,WAAa,WAE3B,OAA0B,IAAnB3hD,KAAKwN,EAAE6G,KAAK,KACO,IAAvBrU,KAAKyN,EAAE1L,IAAI/B,KAAK8Y,IAChB9Y,KAAKqzF,MAAqC,IAA7BrzF,KAAKyN,EAAE1L,IAAI/B,KAAKkjC,MAAMviC,GACxC,EAEAsyF,EAAMv1F,UAAUy7F,QAAU,WAMxB,IAAIn1F,EAAIhE,KAAKwN,EAAE4I,SAEXnS,EAAIjE,KAAKyN,EAAE2I,SAEXzV,EAAIX,KAAK8Y,EAAE1C,SACfzV,EAAIA,EAAEiV,QAAQjV,GAEd,IAAI+vB,EAAI1wB,KAAKkjC,MAAM61D,MAAM/0F,GAErBzD,EAAIP,KAAKwN,EAAEmI,OAAO3V,KAAKyN,GAAG2I,SAASN,QAAQ9R,GAAG8R,QAAQ7R,GAEtDwP,EAAIid,EAAE/a,OAAO1R,GAEb2gC,EAAInxB,EAAEoC,OAAOlV,GAEb0Q,EAAIqf,EAAE7a,OAAO5R,GAEb8wF,EAAKx0F,EAAE0V,OAAO2uB,GAEdowD,EAAKvhF,EAAEwC,OAAO5E,GAEd+nF,EAAK74F,EAAE0V,OAAO5E,GAEdykF,EAAKlxD,EAAE3uB,OAAOxC,GAClB,OAAOzT,KAAKkjC,MAAM8K,MAAM+mD,EAAIC,EAAIc,EAAIsD,EACtC,EAEAnG,EAAMv1F,UAAU27F,SAAW,WAQzB,IAMItE,EACAC,EACAc,EACAv1F,EACA8Q,EACA7O,EAXAyB,EAAIjE,KAAKwN,EAAEmI,OAAO3V,KAAKyN,GAAG2I,SAE1BzV,EAAIX,KAAKwN,EAAE4I,SAEXsa,EAAI1wB,KAAKyN,EAAE2I,SAQf,GAAIpW,KAAKkjC,MAAMy1D,QAAS,CAItB,IAAI/zD,GAFJrkC,EAAIP,KAAKkjC,MAAM61D,MAAMp4F,IAEXgV,OAAO+a,GACb1wB,KAAKqzF,MAEP0B,EAAK9wF,EAAE4R,OAAOlV,GAAGkV,OAAO6a,GAAGza,OAAO2uB,EAAE/uB,OAAO7V,KAAKkjC,MAAMiK,MAEtD6nD,EAAKpwD,EAAE3uB,OAAO1V,EAAEsV,OAAO6a,IAEvBolE,EAAKlxD,EAAExuB,SAASP,OAAO+uB,GAAG/uB,OAAO+uB,KAGjCvzB,EAAIrR,KAAK8Y,EAAE1C,SAEX5T,EAAIoiC,EAAE/uB,OAAOxE,GAAGyE,QAAQzE,GAExB0jF,EAAK9wF,EAAE4R,OAAOlV,GAAGmV,QAAQ4a,GAAGza,OAAOzT,GAEnCwyF,EAAKpwD,EAAE3uB,OAAO1V,EAAEsV,OAAO6a,IAEvBolE,EAAKlxD,EAAE3uB,OAAOzT,GAElB,MAEEjC,EAAII,EAAEgV,OAAO+a,GAEbrf,EAAIrR,KAAKkjC,MAAM81D,MAAMh5F,KAAK8Y,GAAG1C,SAE7B5T,EAAIjC,EAAEsV,OAAOxE,GAAGwE,OAAOxE,GAEvB0jF,EAAK/0F,KAAKkjC,MAAM81D,MAAM/0F,EAAE6R,QAAQvV,IAAI0V,OAAOzT,GAE3CwyF,EAAKh1F,KAAKkjC,MAAM81D,MAAMz4F,GAAG0V,OAAOtV,EAAEmV,QAAQ4a,IAE1ColE,EAAKv1F,EAAE0V,OAAOzT,GAEhB,OAAOxC,KAAKkjC,MAAM8K,MAAM+mD,EAAIC,EAAIc,EAClC,EAEA7C,EAAMv1F,UAAU4yC,IAAM,WACpB,OAAItwC,KAAK2hD,aACA3hD,KAGLA,KAAKkjC,MAAM9xB,SACNpR,KAAKm5F,UAELn5F,KAAKq5F,UAChB,EAEApG,EAAMv1F,UAAU47F,QAAU,SAAiBvqF,GAMzC,IAAI/K,EAAIhE,KAAKyN,EAAEoI,OAAO7V,KAAKwN,GAAGyI,OAAOlH,EAAEtB,EAAEoI,OAAO9G,EAAEvB,IAE9CvJ,EAAIjE,KAAKyN,EAAEkI,OAAO3V,KAAKwN,GAAGyI,OAAOlH,EAAEtB,EAAEkI,OAAO5G,EAAEvB,IAE9C7M,EAAIX,KAAK6F,EAAEoQ,OAAOjW,KAAKkjC,MAAM21D,IAAI5iF,OAAOlH,EAAElJ,GAE1C6qB,EAAI1wB,KAAK8Y,EAAE7C,OAAOlH,EAAE+J,EAAEnD,OAAO5G,EAAE+J,IAE/BvY,EAAI0D,EAAE4R,OAAO7R,GAEb4gC,EAAIlU,EAAE7a,OAAOlV,GAEb8S,EAAIid,EAAE/a,OAAOhV,GAEb0Q,EAAIpN,EAAE0R,OAAO3R,GAEb+wF,EAAKx0F,EAAE0V,OAAO2uB,GAEdowD,EAAKvhF,EAAEwC,OAAO5E,GAEd+nF,EAAK74F,EAAE0V,OAAO5E,GAEdykF,EAAKlxD,EAAE3uB,OAAOxC,GAClB,OAAOzT,KAAKkjC,MAAM8K,MAAM+mD,EAAIC,EAAIc,EAAIsD,EACtC,EAEAnG,EAAMv1F,UAAU67F,SAAW,SAAkBxqF,GAO3C,IAgBIimF,EACAc,EAjBA9xF,EAAIhE,KAAK8Y,EAAE7C,OAAOlH,EAAE+J,GAEpB7U,EAAID,EAAEoS,SAENzV,EAAIX,KAAKwN,EAAEyI,OAAOlH,EAAEvB,GAEpBkjB,EAAI1wB,KAAKyN,EAAEwI,OAAOlH,EAAEtB,GAEpBlN,EAAIP,KAAKkjC,MAAMxS,EAAEza,OAAOtV,GAAGsV,OAAOya,GAElCkU,EAAI3gC,EAAE4R,OAAOtV,GAEbkT,EAAIxP,EAAE0R,OAAOpV,GAEb4W,EAAMnX,KAAKwN,EAAEmI,OAAO3V,KAAKyN,GAAGwI,OAAOlH,EAAEvB,EAAEmI,OAAO5G,EAAEtB,IAAIqI,QAAQnV,GAAGmV,QAAQ4a,GACvEqkE,EAAK/wF,EAAEiS,OAAO2uB,GAAG3uB,OAAOkB,GAc5B,OAXInX,KAAKkjC,MAAMy1D,SAEb3D,EAAKhxF,EAAEiS,OAAOxC,GAAGwC,OAAOya,EAAE7a,OAAO7V,KAAKkjC,MAAM61D,MAAMp4F,KAElDm1F,EAAKlxD,EAAE3uB,OAAOxC,KAGduhF,EAAKhxF,EAAEiS,OAAOxC,GAAGwC,OAAOya,EAAE7a,OAAOlV,IAEjCm1F,EAAK91F,KAAKkjC,MAAM81D,MAAMp0D,GAAG3uB,OAAOxC,IAE3BzT,KAAKkjC,MAAM8K,MAAM+mD,EAAIC,EAAIc,EAClC,EAEA7C,EAAMv1F,UAAUsK,IAAM,SAAa+G,GACjC,OAAI/O,KAAK2hD,aACA5yC,EACLA,EAAE4yC,aACG3hD,KAELA,KAAKkjC,MAAM9xB,SACNpR,KAAKs5F,QAAQvqF,GAEb/O,KAAKu5F,SAASxqF,EACzB,EAEAkkF,EAAMv1F,UAAU0D,IAAM,SAAagD,GACjC,OAAIpE,KAAKqwC,YAAYjsC,GACZpE,KAAKkjC,MAAMgL,aAAaluC,KAAMoE,GAE9BpE,KAAKkjC,MAAM2L,SAAS7uC,KAAMoE,EACrC,EAEA6uF,EAAMv1F,UAAUy3F,OAAS,SAAgBzqE,EAAI3b,EAAG4b,GAC9C,OAAO3qB,KAAKkjC,MAAM+L,YAAY,EAAG,CAAEjvC,KAAM+O,GAAK,CAAE2b,EAAIC,GAAM,GAAG,EAC/D,EAEAsoE,EAAMv1F,UAAU03F,QAAU,SAAiB1qE,EAAI3b,EAAG4b,GAChD,OAAO3qB,KAAKkjC,MAAM+L,YAAY,EAAG,CAAEjvC,KAAM+O,GAAK,CAAE2b,EAAIC,GAAM,GAAG,EAC/D,EAEAsoE,EAAMv1F,UAAUwuF,UAAY,WAC1B,GAAIlsF,KAAKqzF,KACP,OAAOrzF,KAGT,IAAIw5F,EAAKx5F,KAAK8Y,EAAErC,UAOhB,OANAzW,KAAKwN,EAAIxN,KAAKwN,EAAEyI,OAAOujF,GACvBx5F,KAAKyN,EAAIzN,KAAKyN,EAAEwI,OAAOujF,GACnBx5F,KAAK6F,IACP7F,KAAK6F,EAAI7F,KAAK6F,EAAEoQ,OAAOujF,IACzBx5F,KAAK8Y,EAAI9Y,KAAKkjC,MAAMvqB,IACpB3Y,KAAKqzF,MAAO,EACLrzF,IACT,EAEAizF,EAAMv1F,UAAUkJ,IAAM,WACpB,OAAO5G,KAAKkjC,MAAM8K,MAAMhuC,KAAKwN,EAAEkJ,SAC7B1W,KAAKyN,EACLzN,KAAK8Y,EACL9Y,KAAK6F,GAAK7F,KAAK6F,EAAE6Q,SACrB,EAEAu8E,EAAMv1F,UAAUqyC,KAAO,WAErB,OADA/vC,KAAKksF,YACElsF,KAAKwN,EAAEgI,SAChB,EAEAy9E,EAAMv1F,UAAUsyC,KAAO,WAErB,OADAhwC,KAAKksF,YACElsF,KAAKyN,EAAE+H,SAChB,EAEAy9E,EAAMv1F,UAAUwX,GAAK,SAAY4oE,GAC/B,OAAO99E,OAAS89E,GACyB,IAAlC99E,KAAK+vC,OAAOhuC,IAAI+7E,EAAM/tC,SACY,IAAlC/vC,KAAKgwC,OAAOjuC,IAAI+7E,EAAM9tC,OAC/B,EAEAijD,EAAMv1F,UAAUs6F,OAAS,SAAgBxqF,GACvC,IAAI8B,EAAK9B,EAAE4H,MAAMpV,KAAKkjC,MAAM/iC,KAAK8V,OAAOjW,KAAK8Y,GAC7C,GAAuB,IAAnB9Y,KAAKwN,EAAEzL,IAAIuN,GACb,OAAO,EAIT,IAFA,IAAIo9E,EAAKl/E,EAAElK,QACPuC,EAAI7F,KAAKkjC,MAAM0K,KAAK33B,OAAOjW,KAAK8Y,KAC3B,CAEP,GADA4zE,EAAG5kF,KAAK9H,KAAKkjC,MAAM1zB,GACfk9E,EAAG3qF,IAAI/B,KAAKkjC,MAAMn0B,IAAM,EAC1B,OAAO,EAGT,GADAO,EAAGsG,QAAQ/P,GACY,IAAnB7F,KAAKwN,EAAEzL,IAAIuN,GACb,OAAO,CACX,CACF,EAGA2jF,EAAMv1F,UAAUkxC,IAAMqkD,EAAMv1F,UAAUwuF,UACtC+G,EAAMv1F,UAAUgxC,SAAWukD,EAAMv1F,UAAUsK,4BChb3C,IAAIiiB,EAAQ,EAAQ,GAChB01B,EAAS,EAAQ,IACjBmc,EAAY,EAAQ,KAEpBxrC,EAASrG,EAAMqG,OACfC,EAAQtG,EAAMsG,MACdI,EAAU1G,EAAM0G,QAChB8oE,EAAO39B,EAAU29B,KACjBlpD,EAAYoP,EAAOpP,UAEnBmpD,EAAS,CACX,WAAY,WACZ,WAAY,YAGd,SAAStV,IACP,KAAMpkF,gBAAgBokF,GACpB,OAAO,IAAIA,EAEb7zC,EAAUj5B,KAAKtX,MACfA,KAAKqR,EAAI,CACP,WAAY,WAAY,WACxB,UAAY,YACdrR,KAAKu8D,EAAI,IAAI76D,MAAM,GACrB,CAEAuoB,EAAMvqB,SAAS0kF,EAAM7zC,GACrBtzC,EAAOD,QAAUonF,EAEjBA,EAAK1pD,UAAY,IACjB0pD,EAAK1zC,QAAU,IACf0zC,EAAKzzC,aAAe,GACpByzC,EAAKxzC,UAAY,GAEjBwzC,EAAK1mF,UAAU6+B,QAAU,SAAiB/8B,EAAK0B,GAG7C,IAFA,IAAIq7D,EAAIv8D,KAAKu8D,EAEJ/6D,EAAI,EAAGA,EAAI,GAAIA,IACtB+6D,EAAE/6D,GAAKhC,EAAI0B,EAAQM,GAErB,KAAMA,EAAI+6D,EAAE79D,OAAQ8C,IAClB+6D,EAAE/6D,GAAK8uB,EAAOisC,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,IAAM+6D,EAAE/6D,EAAI,IAAK,GAE7D,IAAIwC,EAAIhE,KAAKqR,EAAE,GACXpN,EAAIjE,KAAKqR,EAAE,GACX1Q,EAAIX,KAAKqR,EAAE,GACXqf,EAAI1wB,KAAKqR,EAAE,GACX9Q,EAAIP,KAAKqR,EAAE,GAEf,IAAK7P,EAAI,EAAGA,EAAI+6D,EAAE79D,OAAQ8C,IAAK,CAC7B,IAAIiN,KAAOjN,EAAI,IACXqE,EAAI8qB,EAAQL,EAAOtsB,EAAG,GAAIy1F,EAAKhrF,EAAGxK,EAAGtD,EAAG+vB,GAAInwB,EAAGg8D,EAAE/6D,GAAIk4F,EAAOjrF,IAChElO,EAAImwB,EACJA,EAAI/vB,EACJA,EAAI2vB,EAAOrsB,EAAG,IACdA,EAAID,EACJA,EAAI6B,CACN,CAEA7F,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIrN,GAC7BhE,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIpN,GAC7BjE,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAI1Q,GAC7BX,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAIqf,GAC7B1wB,KAAKqR,EAAE,GAAKkf,EAAMvwB,KAAKqR,EAAE,GAAI9Q,EAC/B,EAEA6jF,EAAK1mF,UAAUszC,QAAU,SAAgB/gB,GACvC,MAAY,QAARA,EACKhG,EAAMiG,QAAQlwB,KAAKqR,EAAG,OAEtB4Y,EAAMmG,QAAQpwB,KAAKqR,EAAG,MACjC,0BCvEA,IACIgf,EADQ,EAAQ,GACDA,OAYnB,SAAS0rC,EAAKvuD,EAAGC,EAAGqL,GAClB,OAAQtL,EAAIC,GAAQD,EAAKsL,CAC3B,CAGA,SAASkjD,EAAMxuD,EAAGC,EAAGqL,GACnB,OAAQtL,EAAIC,EAAMD,EAAIsL,EAAMrL,EAAIqL,CAClC,CAGA,SAAS6gF,EAAInsF,EAAGC,EAAGqL,GACjB,OAAOtL,EAAIC,EAAIqL,CACjB,CAdA9b,EAAQy8F,KARR,SAAchrF,EAAGjB,EAAGC,EAAGqL,GACrB,OAAU,IAANrK,EACKstD,EAAKvuD,EAAGC,EAAGqL,GACV,IAANrK,GAAiB,IAANA,EACNkrF,EAAInsF,EAAGC,EAAGqL,GACT,IAANrK,EACKutD,EAAMxuD,EAAGC,EAAGqL,QADrB,CAEF,EAMA9b,EAAQ++D,KAAOA,EAKf/+D,EAAQg/D,MAAQA,EAKhBh/D,EAAQ28F,IAAMA,EAKd38F,EAAQi/D,OAHR,SAAgBzuD,GACd,OAAO6iB,EAAO7iB,EAAG,GAAK6iB,EAAO7iB,EAAG,IAAM6iB,EAAO7iB,EAAG,GAClD,EAMAxQ,EAAQk/D,OAHR,SAAgB1uD,GACd,OAAO6iB,EAAO7iB,EAAG,GAAK6iB,EAAO7iB,EAAG,IAAM6iB,EAAO7iB,EAAG,GAClD,EAMAxQ,EAAQm/D,OAHR,SAAgB3uD,GACd,OAAO6iB,EAAO7iB,EAAG,GAAK6iB,EAAO7iB,EAAG,IAAOA,IAAM,CAC/C,EAMAxQ,EAAQo/D,OAHR,SAAgB5uD,GACd,OAAO6iB,EAAO7iB,EAAG,IAAM6iB,EAAO7iB,EAAG,IAAOA,IAAM,EAChD,0BC7CA,IAAIyc,EAAQ,EAAQ,GAChBqyC,EAAS,EAAQ,IAErB,SAASs9B,IACP,KAAM55F,gBAAgB45F,GACpB,OAAO,IAAIA,EAEbt9B,EAAOhlD,KAAKtX,MACZA,KAAKqR,EAAI,CACP,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACxC,CACA4Y,EAAMvqB,SAASk6F,EAAQt9B,GACvBr/D,EAAOD,QAAU48F,EAEjBA,EAAOl/D,UAAY,IACnBk/D,EAAOlpD,QAAU,IACjBkpD,EAAOjpD,aAAe,IACtBipD,EAAOhpD,UAAY,GAEnBgpD,EAAOl8F,UAAUszC,QAAU,SAAgB/gB,GAEzC,MAAY,QAARA,EACKhG,EAAMiG,QAAQlwB,KAAKqR,EAAE6I,MAAM,EAAG,GAAI,OAElC+P,EAAMmG,QAAQpwB,KAAKqR,EAAE6I,MAAM,EAAG,GAAI,MAC7C,0BC1BA,IAAI+P,EAAQ,EAAQ,GAEhB0yC,EAAS,EAAQ,IAErB,SAASk9B,IACP,KAAM75F,gBAAgB65F,GACpB,OAAO,IAAIA,EAEbl9B,EAAOrlD,KAAKtX,MACZA,KAAKqR,EAAI,CACP,WAAY,WACZ,WAAY,UACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WAChB,CACA4Y,EAAMvqB,SAASm6F,EAAQl9B,GACvB1/D,EAAOD,QAAU68F,EAEjBA,EAAOn/D,UAAY,KACnBm/D,EAAOnpD,QAAU,IACjBmpD,EAAOlpD,aAAe,IACtBkpD,EAAOjpD,UAAY,IAEnBipD,EAAOn8F,UAAUszC,QAAU,SAAgB/gB,GACzC,MAAY,QAARA,EACKhG,EAAMiG,QAAQlwB,KAAKqR,EAAE6I,MAAM,EAAG,IAAK,OAEnC+P,EAAMmG,QAAQpwB,KAAKqR,EAAE6I,MAAM,EAAG,IAAK,MAC9C,0BChCA,IAAI+P,EAAQ,EAAQ,GAChB3qB,EAAS,EAAQ,GAErB,SAAS2mD,EAAKh3B,EAAM3wB,EAAK2xB,GACvB,KAAMjwB,gBAAgBimD,GACpB,OAAO,IAAIA,EAAKh3B,EAAM3wB,EAAK2xB,GAC7BjwB,KAAKq8B,KAAOpN,EACZjvB,KAAK06B,UAAYzL,EAAKyL,UAAY,EAClC16B,KAAK0wC,QAAUzhB,EAAKyhB,QAAU,EAC9B1wC,KAAK85F,MAAQ,KACb95F,KAAK+5F,MAAQ,KAEb/5F,KAAKI,MAAM6pB,EAAM3nB,QAAQhE,EAAK2xB,GAChC,CACAhzB,EAAOD,QAAUipD,EAEjBA,EAAKvoD,UAAU0C,MAAQ,SAAc9B,GAE/BA,EAAII,OAASsB,KAAK06B,YACpBp8B,GAAM,IAAI0B,KAAKq8B,MAAOhB,OAAO/8B,GAAKm+B,UACpCn9B,EAAOhB,EAAII,QAAUsB,KAAK06B,WAG1B,IAAK,IAAIl5B,EAAIlD,EAAII,OAAQ8C,EAAIxB,KAAK06B,UAAWl5B,IAC3ClD,EAAI0f,KAAK,GAEX,IAAKxc,EAAI,EAAGA,EAAIlD,EAAII,OAAQ8C,IAC1BlD,EAAIkD,IAAM,GAIZ,IAHAxB,KAAK85F,OAAQ,IAAI95F,KAAKq8B,MAAOhB,OAAO/8B,GAG/BkD,EAAI,EAAGA,EAAIlD,EAAII,OAAQ8C,IAC1BlD,EAAIkD,IAAM,IACZxB,KAAK+5F,OAAQ,IAAI/5F,KAAKq8B,MAAOhB,OAAO/8B,EACtC,EAEA2nD,EAAKvoD,UAAU29B,OAAS,SAAgB77B,EAAKywB,GAE3C,OADAjwB,KAAK85F,MAAMz+D,OAAO77B,EAAKywB,GAChBjwB,IACT,EAEAimD,EAAKvoD,UAAU++B,OAAS,SAAgBxM,GAEtC,OADAjwB,KAAK+5F,MAAM1+D,OAAOr7B,KAAK85F,MAAMr9D,UACtBz8B,KAAK+5F,MAAMt9D,OAAOxM,EAC3B,OC9CAhzB,EAAOD,QAAU,CACfmxC,QAAS,CACPG,KAAM,EACNK,OAAQ,CACN,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,kEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,sEAINnkB,IAAK,CACHxR,IAAK,EACL21B,OAAQ,CACN,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,iEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,+FCrwBR,IAAIhvC,EAAK,EAAQ,GACbq6F,EAAW,EAAQ,KACnB/vE,EAAQ,EAAQ,GAChBkZ,EAAS,EAAQ,IACjBF,EAAO,EAAQ,IACf3jC,EAAS2qB,EAAM3qB,OAEf26F,EAAU,EAAQ,KAClBC,EAAY,EAAQ,KAExB,SAASC,EAAGtuE,GACV,KAAM7rB,gBAAgBm6F,GACpB,OAAO,IAAIA,EAAGtuE,GAGO,iBAAZA,IACTvsB,EAAOjC,OAAOK,UAAUwwB,eAAe5W,KAAK6rB,EAAQtX,GAClD,iBAAmBA,GAErBA,EAAUsX,EAAOtX,IAIfA,aAAmBsX,EAAOqe,cAC5B31B,EAAU,CAAEqX,MAAOrX,IAErB7rB,KAAKkjC,MAAQrX,EAAQqX,MAAMA,MAC3BljC,KAAKwP,EAAIxP,KAAKkjC,MAAM1zB,EACpBxP,KAAKo6F,GAAKp6F,KAAKwP,EAAEoC,MAAM,GACvB5R,KAAKyT,EAAIzT,KAAKkjC,MAAMzvB,EAGpBzT,KAAKyT,EAAIoY,EAAQqX,MAAMzvB,EACvBzT,KAAKyT,EAAEw8B,WAAWpkB,EAAQqX,MAAM1zB,EAAEzJ,YAAc,GAGhD/F,KAAKivB,KAAOpD,EAAQoD,MAAQpD,EAAQqX,MAAMjU,IAC5C,CACAhyB,EAAOD,QAAUm9F,EAEjBA,EAAGz8F,UAAU28F,QAAU,SAAiBxuE,GACtC,OAAO,IAAIouE,EAAQj6F,KAAM6rB,EAC3B,EAEAsuE,EAAGz8F,UAAU48F,eAAiB,SAAwB/tC,EAAMt8B,GAC1D,OAAOgqE,EAAQM,YAAYv6F,KAAMusD,EAAMt8B,EACzC,EAEAkqE,EAAGz8F,UAAU88F,cAAgB,SAAuBC,EAAKxqE,GACvD,OAAOgqE,EAAQS,WAAW16F,KAAMy6F,EAAKxqE,EACvC,EAEAkqE,EAAGz8F,UAAUi9F,WAAa,SAAoB9uE,GACvCA,IACHA,EAAU,CAAC,GAcb,IAXA,IAAI+uE,EAAO,IAAIZ,EAAS,CACtB/qE,KAAMjvB,KAAKivB,KACX4rE,KAAMhvE,EAAQgvE,KACdC,QAASjvE,EAAQivE,SAAW,OAC5BC,QAASlvE,EAAQkvE,SAAW93D,EAAKjjC,KAAKivB,KAAK0hB,cAC3CqqD,WAAYnvE,EAAQkvE,SAAWlvE,EAAQmvE,YAAc,OACrDC,MAAOj7F,KAAKwP,EAAElN,YAGZ4e,EAAQlhB,KAAKwP,EAAEpK,aACf81F,EAAMl7F,KAAKwP,EAAEvH,IAAI,IAAItI,EAAG,MACnB,CACP,IAAI4sD,EAAO,IAAI5sD,EAAGi7F,EAAKz5C,SAASjgC,IAChC,KAAIqrC,EAAKxqD,IAAIm5F,GAAO,GAIpB,OADA3uC,EAAKjmD,MAAM,GACJtG,KAAKs6F,eAAe/tC,EAC7B,CACF,EAEA4tC,EAAGz8F,UAAUy9F,aAAe,SAAsB37F,EAAK47F,GACrD,IAAIhnF,EAA2B,EAAnB5U,EAAI4F,aAAmBpF,KAAKwP,EAAEzJ,YAG1C,OAFIqO,EAAQ,IACV5U,EAAMA,EAAIoS,MAAMwC,KACbgnF,GAAa57F,EAAIuC,IAAI/B,KAAKwP,IAAM,EAC5BhQ,EAAIyI,IAAIjI,KAAKwP,GAEbhQ,CACX,EAEA26F,EAAGz8F,UAAU4pD,KAAO,SAAc9nD,EAAKlB,EAAK2xB,EAAKpE,GAC5B,iBAARoE,IACTpE,EAAUoE,EACVA,EAAM,MAEHpE,IACHA,EAAU,CAAC,GAEbvtB,EAAM0B,KAAKs6F,eAAeh8F,EAAK2xB,GAC/BzwB,EAAMQ,KAAKm7F,aAAa,IAAIx7F,EAAGH,EAAK,KAqBpC,IAlBA,IAAI0hB,EAAQlhB,KAAKwP,EAAEpK,aACfi2F,EAAO/8F,EAAIg9F,aAAah5F,QAAQ,KAAM4e,GAGtC+5E,EAAQz7F,EAAI8C,QAAQ,KAAM4e,GAG1B05E,EAAO,IAAIZ,EAAS,CACtB/qE,KAAMjvB,KAAKivB,KACX8rE,QAASM,EACTJ,MAAOA,EACPJ,KAAMhvE,EAAQgvE,KACdC,QAASjvE,EAAQivE,SAAW,SAI1BS,EAAMv7F,KAAKwP,EAAEvH,IAAI,IAAItI,EAAG,IAEnB67F,EAAO,GAAKA,IAAQ,CAC3B,IAAIp3F,EAAIynB,EAAQznB,EACdynB,EAAQznB,EAAEo3F,GACV,IAAI77F,EAAGi7F,EAAKz5C,SAASnhD,KAAKwP,EAAEpK,eAE9B,MADAhB,EAAIpE,KAAKm7F,aAAa/2F,GAAG,IACnBiQ,KAAK,IAAM,GAAKjQ,EAAErC,IAAIw5F,IAAQ,GAApC,CAGA,IAAIE,EAAKz7F,KAAKyT,EAAErS,IAAIgD,GACpB,IAAIq3F,EAAG95C,aAAP,CAGA,IAAI+5C,EAAMD,EAAG1rD,OACThvC,EAAI26F,EAAI5oF,KAAK9S,KAAKwP,GACtB,GAAkB,IAAdzO,EAAEsT,KAAK,GAAX,CAGA,IAAI5F,EAAIrK,EAAEkQ,KAAKtU,KAAKwP,GAAGpO,IAAIL,EAAEK,IAAI9C,EAAIg9F,cAAcxzF,KAAKtI,IAExD,GAAkB,KADlBiP,EAAIA,EAAEqE,KAAK9S,KAAKwP,IACV6E,KAAK,GAAX,CAGA,IAAIsnF,GAAiBF,EAAGzrD,OAAOl8B,QAAU,EAAI,IACT,IAAf4nF,EAAI35F,IAAIhB,GAAW,EAAI,GAQ5C,OALI8qB,EAAQ+vE,WAAantF,EAAE1M,IAAI/B,KAAKo6F,IAAM,IACxC3rF,EAAIzO,KAAKwP,EAAEvH,IAAIwG,GACfktF,GAAiB,GAGZ,IAAIzB,EAAU,CAAEn5F,EAAGA,EAAG0N,EAAGA,EAAGktF,cAAeA,GAXxC,CALA,CALA,CAJA,CA0BZ,CACF,EAEAxB,EAAGz8F,UAAUggD,OAAS,SAAgBl+C,EAAKw5C,EAAW16C,EAAK2xB,GACzDzwB,EAAMQ,KAAKm7F,aAAa,IAAIx7F,EAAGH,EAAK,KACpClB,EAAM0B,KAAKw6F,cAAcl8F,EAAK2xB,GAI9B,IAAIlvB,GAHJi4C,EAAY,IAAIkhD,EAAUlhD,EAAW,QAGnBj4C,EACd0N,EAAIuqC,EAAUvqC,EAClB,GAAI1N,EAAEsT,KAAK,GAAK,GAAKtT,EAAEgB,IAAI/B,KAAKwP,IAAM,EACpC,OAAO,EACT,GAAIf,EAAE4F,KAAK,GAAK,GAAK5F,EAAE1M,IAAI/B,KAAKwP,IAAM,EACpC,OAAO,EAGT,IAGIT,EAHA8sF,EAAOptF,EAAE6F,KAAKtU,KAAKwP,GACnBwb,EAAK6wE,EAAKz6F,IAAI5B,GAAKsT,KAAK9S,KAAKwP,GAC7Byb,EAAK4wE,EAAKz6F,IAAIL,GAAG+R,KAAK9S,KAAKwP,GAG/B,OAAKxP,KAAKkjC,MAAM2K,gBAWhB9+B,EAAI/O,KAAKyT,EAAE2hF,QAAQpqE,EAAI1sB,EAAIw9F,YAAa7wE,IAClC02B,cAMC5yC,EAAEipF,OAAOj3F,KAjBdgO,EAAI/O,KAAKyT,EAAE0hF,OAAOnqE,EAAI1sB,EAAIw9F,YAAa7wE,IACjC02B,cAGkC,IAAjC5yC,EAAEghC,OAAOj9B,KAAK9S,KAAKwP,GAAGzN,IAAIhB,EAcrC,EAEAo5F,EAAGz8F,UAAUq+F,cAAgB,SAASv8F,EAAKw5C,EAAWx2C,EAAGytB,GACvD3wB,GAAQ,EAAIkD,KAAOA,EAAG,4CACtBw2C,EAAY,IAAIkhD,EAAUlhD,EAAW/oB,GAErC,IAAIzgB,EAAIxP,KAAKwP,EACTjP,EAAI,IAAIZ,EAAGH,GACXuB,EAAIi4C,EAAUj4C,EACd0N,EAAIuqC,EAAUvqC,EAGdutF,EAAa,EAAJx5F,EACTy5F,EAAcz5F,GAAK,EACvB,GAAIzB,EAAEgB,IAAI/B,KAAKkjC,MAAMn0B,EAAE+D,KAAK9S,KAAKkjC,MAAM1zB,KAAO,GAAKysF,EACjD,MAAM,IAAIx8F,MAAM,wCAIhBsB,EADEk7F,EACEj8F,KAAKkjC,MAAMyM,WAAW5uC,EAAEiH,IAAIhI,KAAKkjC,MAAM1zB,GAAIwsF,GAE3Ch8F,KAAKkjC,MAAMyM,WAAW5uC,EAAGi7F,GAE/B,IAAIE,EAAOljD,EAAUj4C,EAAEuT,KAAK9E,GACxBi7C,EAAKj7C,EAAEvH,IAAI1H,GAAGa,IAAI86F,GAAMppF,KAAKtD,GAC7Bk7C,EAAKj8C,EAAErN,IAAI86F,GAAMppF,KAAKtD,GAI1B,OAAOxP,KAAKyT,EAAE0hF,OAAO1qC,EAAI1pD,EAAG2pD,EAC9B,EAEAyvC,EAAGz8F,UAAUy+F,oBAAsB,SAAS57F,EAAGy4C,EAAWojD,EAAGnsE,GAE3D,GAAgC,QADhC+oB,EAAY,IAAIkhD,EAAUlhD,EAAW/oB,IACvB0rE,cACZ,OAAO3iD,EAAU2iD,cAEnB,IAAK,IAAIn6F,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAI66F,EACJ,IACEA,EAASr8F,KAAK+7F,cAAcx7F,EAAGy4C,EAAWx3C,EAC5C,CAAE,MAAOjB,GACP,QACF,CAEA,GAAI87F,EAAOnnF,GAAGknF,GACZ,OAAO56F,CACX,CACA,MAAM,IAAI/B,MAAM,uCAClB,0BChPA,IAAIwvB,EAAO,EAAQ,IACfhF,EAAQ,EAAQ,IAChB3qB,EAAS,EAAQ,GAErB,SAAS06F,EAASnuE,GAChB,KAAM7rB,gBAAgBg6F,GACpB,OAAO,IAAIA,EAASnuE,GACtB7rB,KAAKivB,KAAOpD,EAAQoD,KACpBjvB,KAAKs8F,aAAezwE,EAAQywE,WAE5Bt8F,KAAKuY,OAASvY,KAAKivB,KAAKyhB,QACxB1wC,KAAKu8F,WAAa1wE,EAAQ0wE,YAAcv8F,KAAKivB,KAAK0hB,aAElD3wC,KAAKw8F,QAAU,KACfx8F,KAAKy8F,eAAiB,KACtBz8F,KAAK4pE,EAAI,KACT5pE,KAAK85E,EAAI,KAET,IAAIihB,EAAU9wE,EAAM3nB,QAAQupB,EAAQkvE,QAASlvE,EAAQmvE,YAAc,OAC/DC,EAAQhxE,EAAM3nB,QAAQupB,EAAQovE,MAAOpvE,EAAQ6wE,UAAY,OACzD7B,EAAO5wE,EAAM3nB,QAAQupB,EAAQgvE,KAAMhvE,EAAQivE,SAAW,OAC1Dx7F,EAAOy7F,EAAQr8F,QAAWsB,KAAKu8F,WAAa,EACrC,mCAAqCv8F,KAAKu8F,WAAa,SAC9Dv8F,KAAKI,MAAM26F,EAASE,EAAOJ,EAC7B,CACA59F,EAAOD,QAAUg9F,EAEjBA,EAASt8F,UAAU0C,MAAQ,SAAc26F,EAASE,EAAOJ,GACvD,IAAIriB,EAAOuiB,EAAQh7E,OAAOk7E,GAAOl7E,OAAO86E,GAExC76F,KAAK4pE,EAAI,IAAIloE,MAAM1B,KAAKuY,OAAS,GACjCvY,KAAK85E,EAAI,IAAIp4E,MAAM1B,KAAKuY,OAAS,GACjC,IAAK,IAAI/W,EAAI,EAAGA,EAAIxB,KAAK85E,EAAEp7E,OAAQ8C,IACjCxB,KAAK4pE,EAAEpoE,GAAK,EACZxB,KAAK85E,EAAEt4E,GAAK,EAGdxB,KAAKu8B,QAAQi8C,GACbx4E,KAAKw8F,QAAU,EACfx8F,KAAKy8F,eAAiB,eACxB,EAEAzC,EAASt8F,UAAUi/F,MAAQ,WACzB,OAAO,IAAI1tE,EAAKkzB,KAAKniD,KAAKivB,KAAMjvB,KAAK4pE,EACvC,EAEAowB,EAASt8F,UAAU6+B,QAAU,SAAgBi8C,GAC3C,IAAIokB,EAAO58F,KAAK28F,QACAthE,OAAOr7B,KAAK85E,GACZz+C,OAAO,CAAE,IACrBm9C,IACFokB,EAAOA,EAAKvhE,OAAOm9C,IACrBx4E,KAAK4pE,EAAIgzB,EAAKngE,SACdz8B,KAAK85E,EAAI95E,KAAK28F,QAAQthE,OAAOr7B,KAAK85E,GAAGr9C,SAChC+7C,IAGLx4E,KAAK4pE,EAAI5pE,KAAK28F,QACAthE,OAAOr7B,KAAK85E,GACZz+C,OAAO,CAAE,IACTA,OAAOm9C,GACP/7C,SACdz8B,KAAK85E,EAAI95E,KAAK28F,QAAQthE,OAAOr7B,KAAK85E,GAAGr9C,SACvC,EAEAu9D,EAASt8F,UAAUm/F,OAAS,SAAgB9B,EAASC,EAAYhzF,EAAK80F,GAE1C,iBAAf9B,IACT8B,EAAS90F,EACTA,EAAMgzF,EACNA,EAAa,MAGfD,EAAU9wE,EAAM3nB,QAAQy4F,EAASC,GACjChzF,EAAMiiB,EAAM3nB,QAAQ0F,EAAK80F,GAEzBx9F,EAAOy7F,EAAQr8F,QAAWsB,KAAKu8F,WAAa,EACrC,mCAAqCv8F,KAAKu8F,WAAa,SAE9Dv8F,KAAKu8B,QAAQw+D,EAAQh7E,OAAO/X,GAAO,KACnChI,KAAKw8F,QAAU,CACjB,EAEAxC,EAASt8F,UAAUyjD,SAAW,SAAkB9/C,EAAK4uB,EAAKjoB,EAAK80F,GAC7D,GAAI98F,KAAKw8F,QAAUx8F,KAAKy8F,eACtB,MAAM,IAAIh9F,MAAM,sBAGC,iBAARwwB,IACT6sE,EAAS90F,EACTA,EAAMioB,EACNA,EAAM,MAIJjoB,IACFA,EAAMiiB,EAAM3nB,QAAQ0F,EAAK80F,GAAU,OACnC98F,KAAKu8B,QAAQv0B,IAIf,IADA,IAAI+0F,EAAO,GACJA,EAAKr+F,OAAS2C,GACnBrB,KAAK85E,EAAI95E,KAAK28F,QAAQthE,OAAOr7B,KAAK85E,GAAGr9C,SACrCsgE,EAAOA,EAAKh9E,OAAO/f,KAAK85E,GAG1B,IAAIv0E,EAAMw3F,EAAK7iF,MAAM,EAAG7Y,GAGxB,OAFArB,KAAKu8B,QAAQv0B,GACbhI,KAAKw8F,UACEvyE,EAAMK,OAAO/kB,EAAK0qB,EAC3B,0BC9GA,IAAItwB,EAAK,EAAQ,GAEbL,EADQ,EAAQ,GACDA,OAEnB,SAAS26F,EAAQ72D,EAAIvX,GACnB7rB,KAAKojC,GAAKA,EACVpjC,KAAKusD,KAAO,KACZvsD,KAAKy6F,IAAM,KAGP5uE,EAAQ0gC,MACVvsD,KAAKg9F,eAAenxE,EAAQ0gC,KAAM1gC,EAAQoxE,SACxCpxE,EAAQ4uE,KACVz6F,KAAKk9F,cAAcrxE,EAAQ4uE,IAAK5uE,EAAQsxE,OAC5C,CACAlgG,EAAOD,QAAUi9F,EAEjBA,EAAQS,WAAa,SAAoBt3D,EAAIq3D,EAAKxqE,GAChD,OAAIwqE,aAAeR,EACVQ,EAEF,IAAIR,EAAQ72D,EAAI,CACrBq3D,IAAKA,EACL0C,OAAQltE,GAEZ,EAEAgqE,EAAQM,YAAc,SAAqBn3D,EAAImpB,EAAMt8B,GACnD,OAAIs8B,aAAgB0tC,EACX1tC,EAEF,IAAI0tC,EAAQ72D,EAAI,CACrBmpB,KAAMA,EACN0wC,QAAShtE,GAEb,EAEAgqE,EAAQv8F,UAAUuwC,SAAW,WAC3B,IAAIwsD,EAAMz6F,KAAK87F,YAEf,OAAIrB,EAAI94C,aACC,CAAE1M,QAAQ,EAAOzL,OAAQ,sBAC7BixD,EAAIxsD,WAEJwsD,EAAIr5F,IAAIpB,KAAKojC,GAAGF,MAAM1zB,GAAGmyC,aAGvB,CAAE1M,QAAQ,EAAMzL,OAAQ,MAFtB,CAAEyL,QAAQ,EAAOzL,OAAQ,uBAFzB,CAAEyL,QAAQ,EAAOzL,OAAQ,4BAKpC,EAEAywD,EAAQv8F,UAAUo+F,UAAY,SAAmBhsD,EAAS7f,GAUxD,MARuB,iBAAZ6f,IACT7f,EAAM6f,EACNA,EAAU,MAGP9vC,KAAKy6F,MACRz6F,KAAKy6F,IAAMz6F,KAAKojC,GAAG3vB,EAAErS,IAAIpB,KAAKusD,OAE3Bt8B,EAGEjwB,KAAKy6F,IAAInwE,OAAO2F,EAAK6f,GAFnB9vC,KAAKy6F,GAGhB,EAEAR,EAAQv8F,UAAU49F,WAAa,SAAoBrrE,GACjD,MAAY,QAARA,EACKjwB,KAAKusD,KAAKrqD,SAAS,GAAI,GAEvBlC,KAAKusD,IAChB,EAEA0tC,EAAQv8F,UAAUs/F,eAAiB,SAAwB1+F,EAAK2xB,GAC9DjwB,KAAKusD,KAAO,IAAI5sD,EAAGrB,EAAK2xB,GAAO,IAI/BjwB,KAAKusD,KAAOvsD,KAAKusD,KAAKz5C,KAAK9S,KAAKojC,GAAGF,MAAM1zB,EAC3C,EAEAyqF,EAAQv8F,UAAUw/F,cAAgB,SAAuB5+F,EAAK2xB,GAC5D,GAAI3xB,EAAIkP,GAAKlP,EAAImP,EAWf,MAP2B,SAAvBzN,KAAKojC,GAAGF,MAAMhoB,KAChB5b,EAAOhB,EAAIkP,EAAG,qBACkB,UAAvBxN,KAAKojC,GAAGF,MAAMhoB,MACS,YAAvBlb,KAAKojC,GAAGF,MAAMhoB,MACvB5b,EAAOhB,EAAIkP,GAAKlP,EAAImP,EAAG,qCAEzBzN,KAAKy6F,IAAMz6F,KAAKojC,GAAGF,MAAM8K,MAAM1vC,EAAIkP,EAAGlP,EAAImP,IAG5CzN,KAAKy6F,IAAMz6F,KAAKojC,GAAGF,MAAMwM,YAAYpxC,EAAK2xB,EAC5C,EAGAgqE,EAAQv8F,UAAU0/F,OAAS,SAAgB3C,GAIzC,OAHIA,EAAIxsD,YACN3uC,EAAOm7F,EAAIxsD,WAAY,8BAElBwsD,EAAIr5F,IAAIpB,KAAKusD,MAAMxc,MAC5B,EAGAkqD,EAAQv8F,UAAU4pD,KAAO,SAAc9nD,EAAKywB,EAAKpE,GAC/C,OAAO7rB,KAAKojC,GAAGkkB,KAAK9nD,EAAKQ,KAAMiwB,EAAKpE,EACtC,EAEAouE,EAAQv8F,UAAUggD,OAAS,SAAgBl+C,EAAKw5C,GAC9C,OAAOh5C,KAAKojC,GAAGsa,OAAOl+C,EAAKw5C,EAAWh5C,KACxC,EAEAi6F,EAAQv8F,UAAU+F,QAAU,WAC1B,MAAO,eAAiBzD,KAAKusD,MAAQvsD,KAAKusD,KAAKrqD,SAAS,GAAI,IACrD,UAAYlC,KAAKy6F,KAAOz6F,KAAKy6F,IAAIh3F,WAAa,IACvD,0BCtHA,IAAI9D,EAAK,EAAQ,GAEbsqB,EAAQ,EAAQ,GAChB3qB,EAAS2qB,EAAM3qB,OAEnB,SAAS46F,EAAUruE,EAASoE,GAC1B,GAAIpE,aAAmBquE,EACrB,OAAOruE,EAEL7rB,KAAKq9F,WAAWxxE,EAASoE,KAG7B3wB,EAAOusB,EAAQ9qB,GAAK8qB,EAAQpd,EAAG,4BAC/BzO,KAAKe,EAAI,IAAIpB,EAAGksB,EAAQ9qB,EAAG,IAC3Bf,KAAKyO,EAAI,IAAI9O,EAAGksB,EAAQpd,EAAG,SACGrP,IAA1BysB,EAAQ8vE,cACV37F,KAAK27F,cAAgB,KAErB37F,KAAK27F,cAAgB9vE,EAAQ8vE,cACjC,CAGA,SAAS2B,IACPt9F,KAAKu9F,MAAQ,CACf,CAEA,SAASC,EAAUr+F,EAAK4P,GACtB,IAAI0uF,EAAUt+F,EAAI4P,EAAEwuF,SACpB,KAAgB,IAAVE,GACJ,OAAOA,EAET,IAAIC,EAAqB,GAAVD,EAGf,GAAiB,IAAbC,GAAkBA,EAAW,EAC/B,OAAO,EAIT,IADA,IAAIn+F,EAAM,EACDiC,EAAI,EAAGkB,EAAMqM,EAAEwuF,MAAO/7F,EAAIk8F,EAAUl8F,IAAKkB,IAChDnD,IAAQ,EACRA,GAAOJ,EAAIuD,GACXnD,KAAS,EAIX,QAAIA,GAAO,OAIXwP,EAAEwuF,MAAQ76F,EACHnD,EACT,CAEA,SAASo+F,EAAUx+F,GAGjB,IAFA,IAAIqC,EAAI,EACJH,EAAMlC,EAAIT,OAAS,GACfS,EAAIqC,MAAqB,IAAbrC,EAAIqC,EAAI,KAAcA,EAAIH,GAC5CG,IAEF,OAAU,IAANA,EACKrC,EAEFA,EAAI+a,MAAM1Y,EACnB,CA2DA,SAASo8F,EAAgBjhF,EAAKtb,GAC5B,GAAIA,EAAM,IACRsb,EAAIqB,KAAK3c,OADX,CAIA,IAAIw8F,EAAS,GAAKv8F,KAAKwnC,IAAIznC,GAAOC,KAAKsnF,MAAQ,GAE/C,IADAjsE,EAAIqB,KAAc,IAAT6/E,KACAA,GACPlhF,EAAIqB,KAAM3c,KAASw8F,GAAU,GAAM,KAErClhF,EAAIqB,KAAK3c,EANT,CAOF,CAlHApE,EAAOD,QAAUk9F,EA8CjBA,EAAUx8F,UAAU2/F,WAAa,SAAoBliF,EAAM8U,GACzD9U,EAAO8O,EAAM3nB,QAAQ6Y,EAAM8U,GAC3B,IAAIlhB,EAAI,IAAIuuF,EACZ,GAAwB,KAApBniF,EAAKpM,EAAEwuF,SACT,OAAO,EAET,IAAIl8F,EAAMm8F,EAAUriF,EAAMpM,GAC1B,IAAY,IAAR1N,EACF,OAAO,EAET,GAAKA,EAAM0N,EAAEwuF,QAAWpiF,EAAKzc,OAC3B,OAAO,EAET,GAAwB,IAApByc,EAAKpM,EAAEwuF,SACT,OAAO,EAET,IAAItlF,EAAOulF,EAAUriF,EAAMpM,GAC3B,IAAa,IAATkJ,EACF,OAAO,EAET,IAAIlX,EAAIoa,EAAKjB,MAAMnL,EAAEwuF,MAAOtlF,EAAOlJ,EAAEwuF,OAErC,GADAxuF,EAAEwuF,OAAStlF,EACa,IAApBkD,EAAKpM,EAAEwuF,SACT,OAAO,EAET,IAAIO,EAAON,EAAUriF,EAAMpM,GAC3B,IAAa,IAAT+uF,EACF,OAAO,EAET,GAAI3iF,EAAKzc,SAAWo/F,EAAO/uF,EAAEwuF,MAC3B,OAAO,EAET,IAAI9uF,EAAI0M,EAAKjB,MAAMnL,EAAEwuF,MAAOO,EAAO/uF,EAAEwuF,OACrC,GAAa,IAATx8F,EAAE,GAAU,CACd,KAAW,IAAPA,EAAE,IAIJ,OAAO,EAHPA,EAAIA,EAAEmZ,MAAM,EAKhB,CACA,GAAa,IAATzL,EAAE,GAAU,CACd,KAAW,IAAPA,EAAE,IAIJ,OAAO,EAHPA,EAAIA,EAAEyL,MAAM,EAKhB,CAMA,OAJAla,KAAKe,EAAI,IAAIpB,EAAGoB,GAChBf,KAAKyO,EAAI,IAAI9O,EAAG8O,GAChBzO,KAAK27F,cAAgB,MAEd,CACT,EAeAzB,EAAUx8F,UAAUqgG,MAAQ,SAAe9tE,GACzC,IAAIlvB,EAAIf,KAAKe,EAAEuB,UACXmM,EAAIzO,KAAKyO,EAAEnM,UAYf,IATW,IAAPvB,EAAE,KACJA,EAAI,CAAE,GAAIgf,OAAOhf,IAER,IAAP0N,EAAE,KACJA,EAAI,CAAE,GAAIsR,OAAOtR,IAEnB1N,EAAI48F,EAAU58F,GACd0N,EAAIkvF,EAAUlvF,KAENA,EAAE,IAAe,IAAPA,EAAE,KAClBA,EAAIA,EAAEyL,MAAM,GAEd,IAAIyC,EAAM,CAAE,GACZihF,EAAgBjhF,EAAK5b,EAAErC,SACvBie,EAAMA,EAAIoD,OAAOhf,IACbid,KAAK,GACT4/E,EAAgBjhF,EAAKlO,EAAE/P,QACvB,IAAIs/F,EAAWrhF,EAAIoD,OAAOtR,GACtBlJ,EAAM,CAAE,IAGZ,OAFAq4F,EAAgBr4F,EAAKy4F,EAASt/F,QAC9B6G,EAAMA,EAAIwa,OAAOi+E,GACV/zE,EAAMK,OAAO/kB,EAAK0qB,EAC3B,0BCnKA,IAAIhB,EAAO,EAAQ,IACfkU,EAAS,EAAQ,IACjBlZ,EAAQ,EAAQ,GAChB3qB,EAAS2qB,EAAM3qB,OACfgsB,EAAarB,EAAMqB,WACnB2uE,EAAU,EAAQ,KAClBC,EAAY,EAAQ,KAExB,SAAS+D,EAAM/6D,GAGb,GAFA5jC,EAAiB,YAAV4jC,EAAqB,qCAEtBljC,gBAAgBi+F,GACpB,OAAO,IAAIA,EAAM/6D,GAEnBA,EAAQC,EAAOD,GAAOA,MACtBljC,KAAKkjC,MAAQA,EACbljC,KAAKyT,EAAIyvB,EAAMzvB,EACfzT,KAAKyT,EAAEw8B,WAAW/M,EAAM1zB,EAAEzJ,YAAc,GAExC/F,KAAKk+F,WAAah7D,EAAM8K,QAAQrwC,YAChCqC,KAAKm+F,eAAiB78F,KAAKiB,KAAK2gC,EAAM1zB,EAAEzJ,YAAc,GACtD/F,KAAKivB,KAAOA,EAAK8yB,MACnB,CAEA9kD,EAAOD,QAAUihG,EAOjBA,EAAMvgG,UAAU4pD,KAAO,SAAc7gC,EAAS23E,GAC5C33E,EAAU6E,EAAW7E,GACrB,IAAInoB,EAAM0B,KAAKq+F,cAAcD,GACzBr9F,EAAIf,KAAKs+F,QAAQhgG,EAAIigG,gBAAiB93E,GACtCyL,EAAIlyB,KAAKyT,EAAErS,IAAIL,GACfy9F,EAAWx+F,KAAKy+F,YAAYvsE,GAC5BwsE,EAAK1+F,KAAKs+F,QAAQE,EAAUlgG,EAAIqgG,WAAYl4E,GAC7CrlB,IAAI9C,EAAIiuD,QACP8sB,EAAIt4E,EAAEiH,IAAI02F,GAAI5rF,KAAK9S,KAAKkjC,MAAM1zB,GAClC,OAAOxP,KAAK4+F,cAAc,CAAE1sE,EAAGA,EAAGmnD,EAAGA,EAAGmlB,SAAUA,GACpD,EAQAP,EAAMvgG,UAAUggD,OAAS,SAAgBj3B,EAASo4E,EAAKpE,GACrDh0E,EAAU6E,EAAW7E,GACrBo4E,EAAM7+F,KAAK4+F,cAAcC,GACzB,IAAIvgG,EAAM0B,KAAKw6F,cAAcC,GACzBppF,EAAIrR,KAAKs+F,QAAQO,EAAIL,WAAYlgG,EAAIqgG,WAAYl4E,GACjDq4E,EAAK9+F,KAAKyT,EAAErS,IAAIy9F,EAAIxlB,KAExB,OADcwlB,EAAI3sE,IAAIlqB,IAAI1J,EAAIm8F,MAAMr5F,IAAIiQ,IACzB6D,GAAG4pF,EACpB,EAEAb,EAAMvgG,UAAU4gG,QAAU,WAExB,IADA,IAAIrvE,EAAOjvB,KAAKivB,OACPztB,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IACpCytB,EAAKoM,OAAO5f,UAAUja,IACxB,OAAOyoB,EAAMsB,UAAU0D,EAAKwN,UAAU3pB,KAAK9S,KAAKkjC,MAAM1zB,EACxD,EAEAyuF,EAAMvgG,UAAU88F,cAAgB,SAAuBC,GACrD,OAAOR,EAAQS,WAAW16F,KAAMy6F,EAClC,EAEAwD,EAAMvgG,UAAU2gG,cAAgB,SAAuBD,GACrD,OAAOnE,EAAQ8E,WAAW/+F,KAAMo+F,EAClC,EAEAH,EAAMvgG,UAAUkhG,cAAgB,SAAuBC,GACrD,OAAIA,aAAe3E,EACV2E,EACF,IAAI3E,EAAUl6F,KAAM6+F,EAC7B,EAUAZ,EAAMvgG,UAAU+gG,YAAc,SAAqBzwD,GACjD,IAAI/d,EAAM+d,EAAMgC,OAAO1tC,QAAQ,KAAMtC,KAAKm+F,gBAE1C,OADAluE,EAAIjwB,KAAKm+F,eAAiB,IAAMnwD,EAAM+B,OAAOj8B,QAAU,IAAO,EACvDmc,CACT,EAEAguE,EAAMvgG,UAAUgyC,YAAc,SAAqBxuB,GAGjD,IAAI89E,GAFJ99E,EAAQ+I,EAAMqB,WAAWpK,IAENxiB,OAAS,EACxBugG,EAAS/9E,EAAMhH,MAAM,EAAG8kF,GAAQj/E,QAAuB,IAAhBmB,EAAM89E,IAC7CE,EAAoC,IAAV,IAAhBh+E,EAAM89E,IAEhBvxF,EAAIwc,EAAMsB,UAAU0zE,GACxB,OAAOj/F,KAAKkjC,MAAMg2D,WAAWzrF,EAAGyxF,EAClC,EAEAjB,EAAMvgG,UAAUyhG,UAAY,SAAmB19F,GAC7C,OAAOA,EAAIa,QAAQ,KAAMtC,KAAKm+F,eAChC,EAEAF,EAAMvgG,UAAU0hG,UAAY,SAAmBl+E,GAC7C,OAAO+I,EAAMsB,UAAUrK,EACzB,EAEA+8E,EAAMvgG,UAAU2hG,QAAU,SAAiB9/F,GACzC,OAAOA,aAAeS,KAAKk+F,UAC7B,0BCnHA,IAAIj0E,EAAQ,EAAQ,GAChB3qB,EAAS2qB,EAAM3qB,OACfgsB,EAAarB,EAAMqB,WACnBF,EAAiBnB,EAAMmB,eAW3B,SAAS6uE,EAAQ52D,EAAOuU,GACtB53C,KAAKqjC,MAAQA,EACbrjC,KAAKs/F,QAAUh0E,EAAWssB,EAAOwmD,QAC7B/6D,EAAMg8D,QAAQznD,EAAO6iD,KACvBz6F,KAAKu/F,KAAO3nD,EAAO6iD,IAEnBz6F,KAAKw/F,UAAYl0E,EAAWssB,EAAO6iD,IACvC,CAEAR,EAAQS,WAAa,SAAoBr3D,EAAOo3D,GAC9C,OAAIA,aAAeR,EACVQ,EACF,IAAIR,EAAQ52D,EAAO,CAAEo3D,IAAKA,GACnC,EAEAR,EAAQ8E,WAAa,SAAoB17D,EAAO+6D,GAC9C,OAAIA,aAAkBnE,EACbmE,EACF,IAAInE,EAAQ52D,EAAO,CAAE+6D,OAAQA,GACtC,EAEAnE,EAAQv8F,UAAU0gG,OAAS,WACzB,OAAOp+F,KAAKs/F,OACd,EAEAl0E,EAAe6uE,EAAS,YAAY,WAClC,OAAOj6F,KAAKqjC,MAAMo7D,YAAYz+F,KAAKy6F,MACrC,IAEArvE,EAAe6uE,EAAS,OAAO,WAC7B,OAAIj6F,KAAKw/F,UACAx/F,KAAKqjC,MAAMqM,YAAY1vC,KAAKw/F,WAC9Bx/F,KAAKqjC,MAAM5vB,EAAErS,IAAIpB,KAAKusD,OAC/B,IAEAnhC,EAAe6uE,EAAS,aAAa,WACnC,IAAI52D,EAAQrjC,KAAKqjC,MACbpU,EAAOjvB,KAAKivB,OACZ+vE,EAAS37D,EAAM86D,eAAiB,EAEhCn6F,EAAIirB,EAAK/U,MAAM,EAAGmpB,EAAM86D,gBAK5B,OAJAn6F,EAAE,IAAM,IACRA,EAAEg7F,IAAW,IACbh7F,EAAEg7F,IAAW,GAENh7F,CACT,IAEAonB,EAAe6uE,EAAS,QAAQ,WAC9B,OAAOj6F,KAAKqjC,MAAM+7D,UAAUp/F,KAAKy/F,YACnC,IAEAr0E,EAAe6uE,EAAS,QAAQ,WAC9B,OAAOj6F,KAAKqjC,MAAMpU,OAAOoM,OAAOr7B,KAAKo+F,UAAU3hE,QACjD,IAEArR,EAAe6uE,EAAS,iBAAiB,WACvC,OAAOj6F,KAAKivB,OAAO/U,MAAMla,KAAKqjC,MAAM86D,eACtC,IAEAlE,EAAQv8F,UAAU4pD,KAAO,SAAc7gC,GAErC,OADAnnB,EAAOU,KAAKs/F,QAAS,2BACdt/F,KAAKqjC,MAAMikB,KAAK7gC,EAASzmB,KAClC,EAEAi6F,EAAQv8F,UAAUggD,OAAS,SAAgBj3B,EAASo4E,GAClD,OAAO7+F,KAAKqjC,MAAMqa,OAAOj3B,EAASo4E,EAAK7+F,KACzC,EAEAi6F,EAAQv8F,UAAUgiG,UAAY,SAAmBzvE,GAE/C,OADA3wB,EAAOU,KAAKs/F,QAAS,0BACdr1E,EAAMK,OAAOtqB,KAAKo+F,SAAUnuE,EACrC,EAEAgqE,EAAQv8F,UAAUo+F,UAAY,SAAmB7rE,GAC/C,OAAOhG,EAAMK,OAAOtqB,KAAK2+F,WAAY1uE,EACvC,EAEAhzB,EAAOD,QAAUi9F,0BC5FjB,IAAIt6F,EAAK,EAAQ,GACbsqB,EAAQ,EAAQ,GAChB3qB,EAAS2qB,EAAM3qB,OACf8rB,EAAiBnB,EAAMmB,eACvBE,EAAarB,EAAMqB,WAUvB,SAAS4uE,EAAU72D,EAAOw7D,GACxB7+F,KAAKqjC,MAAQA,EAEM,iBAARw7D,IACTA,EAAMvzE,EAAWuzE,IAEfn9F,MAAMC,QAAQk9F,KAChBA,EAAM,CACJ3sE,EAAG2sE,EAAI3kF,MAAM,EAAGmpB,EAAM86D,gBACtB9kB,EAAGwlB,EAAI3kF,MAAMmpB,EAAM86D,kBAIvB7+F,EAAOu/F,EAAI3sE,GAAK2sE,EAAIxlB,EAAG,4BAEnBh2C,EAAMg8D,QAAQR,EAAI3sE,KACpBlyB,KAAK2/F,GAAKd,EAAI3sE,GACZ2sE,EAAIxlB,aAAa15E,IACnBK,KAAK4/F,GAAKf,EAAIxlB,GAEhBr5E,KAAK6/F,UAAYn+F,MAAMC,QAAQk9F,EAAI3sE,GAAK2sE,EAAI3sE,EAAI2sE,EAAIL,SACpDx+F,KAAK8/F,UAAYp+F,MAAMC,QAAQk9F,EAAIxlB,GAAKwlB,EAAIxlB,EAAIwlB,EAAIkB,QACtD,CAEA30E,EAAe8uE,EAAW,KAAK,WAC7B,OAAOl6F,KAAKqjC,MAAM+7D,UAAUp/F,KAAK+/F,WACnC,IAEA30E,EAAe8uE,EAAW,KAAK,WAC7B,OAAOl6F,KAAKqjC,MAAMqM,YAAY1vC,KAAKw+F,WACrC,IAEApzE,EAAe8uE,EAAW,YAAY,WACpC,OAAOl6F,KAAKqjC,MAAMo7D,YAAYz+F,KAAKkyB,IACrC,IAEA9G,EAAe8uE,EAAW,YAAY,WACpC,OAAOl6F,KAAKqjC,MAAM87D,UAAUn/F,KAAKq5E,IACnC,IAEA6gB,EAAUx8F,UAAUsiG,QAAU,WAC5B,OAAOhgG,KAAKw+F,WAAWz+E,OAAO/f,KAAK+/F,WACrC,EAEA7F,EAAUx8F,UAAU2sB,MAAQ,WAC1B,OAAOJ,EAAMK,OAAOtqB,KAAKggG,UAAW,OAAO/2E,aAC7C,EAEAhsB,EAAOD,QAAUk9F,aChEjBj9F,EAAOD,QAAU,EAAjB,yCCEA,SAASw1B,EAAQlK,EAAQ23E,GAAkB,IAAI13E,EAAOlrB,OAAOkrB,KAAKD,GAAS,GAAIjrB,OAAOo1B,sBAAuB,CAAE,IAAIytE,EAAU7iG,OAAOo1B,sBAAsBnK,GAAS23E,IAAmBC,EAAUA,EAAQhiD,QAAO,SAAU93B,GAAO,OAAO/oB,OAAOonC,yBAAyBnc,EAAQlC,GAAKvoB,UAAY,KAAK0qB,EAAKvK,KAAKiB,MAAMsJ,EAAM23E,EAAU,CAAE,OAAO33E,CAAM,CACpV,SAAS43E,EAAc1/E,GAAU,IAAK,IAAIjf,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK,CAAE,IAAI2+C,EAAS,MAAQ1kC,UAAUja,GAAKia,UAAUja,GAAK,CAAC,EAAGA,EAAI,EAAIgxB,EAAQn1B,OAAO8iD,IAAS,GAAIjZ,SAAQ,SAAU5oC,GAAO8hG,EAAgB3/E,EAAQniB,EAAK6hD,EAAO7hD,GAAO,IAAKjB,OAAOknC,0BAA4BlnC,OAAO2iC,iBAAiBvf,EAAQpjB,OAAOknC,0BAA0B4b,IAAW3tB,EAAQn1B,OAAO8iD,IAASjZ,SAAQ,SAAU5oC,GAAOjB,OAAOqiB,eAAee,EAAQniB,EAAKjB,OAAOonC,yBAAyB0b,EAAQ7hD,GAAO,GAAI,CAAE,OAAOmiB,CAAQ,CACzf,SAAS2/E,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAAM+hG,EAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAE3O,SAASwlF,EAAkB7/E,EAAQu1B,GAAS,IAAK,IAAIx0C,EAAI,EAAGA,EAAIw0C,EAAMt3C,OAAQ8C,IAAK,CAAE,IAAIstE,EAAa94B,EAAMx0C,GAAIstE,EAAWjxE,WAAaixE,EAAWjxE,aAAc,EAAOixE,EAAW/wE,cAAe,EAAU,UAAW+wE,IAAYA,EAAWhxE,UAAW,GAAMT,OAAOqiB,eAAee,EAAQ4/E,EAAevxB,EAAWxwE,KAAMwwE,EAAa,CAAE,CAE5U,SAASuxB,EAAe7hG,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CAE1H,IACEJ,EADa,EAAQ,GACHA,OAElBuF,EADc,EAAQ,KACFA,QAClBsmC,EAAStmC,GAAWA,EAAQsmC,QAAU,UAI1C9sC,EAAOD,QAAuB,WAC5B,SAASyiE,KAdX,SAAyB1nC,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAepJ02D,CAAgBz1D,KAAMy/D,GACtBz/D,KAAKo6C,KAAO,KACZp6C,KAAKq6C,KAAO,KACZr6C,KAAKtB,OAAS,CAChB,CAjBF,IAAsB82D,EAAairC,EA8KjC,OA9KoBjrC,EAkBPiK,GAlBoBghC,EAkBR,CAAC,CACxBniG,IAAK,OACLV,MAAO,SAAckuC,GACnB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAM,MAEJzY,KAAKtB,OAAS,EAAGsB,KAAKq6C,KAAK5hC,KAAOitD,EAAW1lE,KAAKo6C,KAAOsrB,EAC7D1lE,KAAKq6C,KAAOqrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,UACLV,MAAO,SAAiBkuC,GACtB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAMzY,KAAKo6C,MAEO,IAAhBp6C,KAAKtB,SAAcsB,KAAKq6C,KAAOqrB,GACnC1lE,KAAKo6C,KAAOsrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,QACLV,MAAO,WACL,GAAoB,IAAhBoC,KAAKtB,OAAT,CACA,IAAIqG,EAAM/E,KAAKo6C,KAAKj/B,KAGpB,OAFoB,IAAhBnb,KAAKtB,OAAcsB,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KAAUr6C,KAAKo6C,KAAOp6C,KAAKo6C,KAAK3hC,OAC7EzY,KAAKtB,OACAqG,CAJsB,CAK/B,GACC,CACDzG,IAAK,QACLV,MAAO,WACLoC,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KACxBr6C,KAAKtB,OAAS,CAChB,GACC,CACDJ,IAAK,OACLV,MAAO,SAAc6Q,GACnB,GAAoB,IAAhBzO,KAAKtB,OAAc,MAAO,GAG9B,IAFA,IAAIqQ,EAAI/O,KAAKo6C,KACTr1C,EAAM,GAAKgK,EAAEoM,KACVpM,EAAIA,EAAE0J,MAAM1T,GAAO0J,EAAIM,EAAEoM,KAChC,OAAOpW,CACT,GACC,CACDzG,IAAK,SACLV,MAAO,SAAgB4R,GACrB,GAAoB,IAAhBxP,KAAKtB,OAAc,OAAOR,EAAOU,MAAM,GAI3C,IAHA,IA5DcR,EAAKqiB,EAAQpD,EA4DvBtY,EAAM7G,EAAOW,YAAY2Q,IAAM,GAC/BT,EAAI/O,KAAKo6C,KACT54C,EAAI,EACDuN,GA/DO3Q,EAgED2Q,EAAEoM,KAhEIsF,EAgEE1b,EAhEMsY,EAgED7b,EA/D9BtD,EAAOR,UAAU0F,KAAKkU,KAAKlZ,EAAKqiB,EAAQpD,GAgElC7b,GAAKuN,EAAEoM,KAAKzc,OACZqQ,EAAIA,EAAE0J,KAER,OAAO1T,CACT,GAGC,CACDzG,IAAK,UACLV,MAAO,SAAiB4R,EAAGkxF,GACzB,IAAI37F,EAYJ,OAXIyK,EAAIxP,KAAKo6C,KAAKj/B,KAAKzc,QAErBqG,EAAM/E,KAAKo6C,KAAKj/B,KAAKjB,MAAM,EAAG1K,GAC9BxP,KAAKo6C,KAAKj/B,KAAOnb,KAAKo6C,KAAKj/B,KAAKjB,MAAM1K,IAGtCzK,EAFSyK,IAAMxP,KAAKo6C,KAAKj/B,KAAKzc,OAExBsB,KAAKoS,QAGLsuF,EAAa1gG,KAAK2gG,WAAWnxF,GAAKxP,KAAK4gG,WAAWpxF,GAEnDzK,CACT,GACC,CACDzG,IAAK,QACLV,MAAO,WACL,OAAOoC,KAAKo6C,KAAKj/B,IACnB,GAGC,CACD7c,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EACJoE,EAAMgK,EAAEoM,KAEZ,IADA3L,GAAKzK,EAAIrG,OACFqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAIxX,EAAM8N,EAAEoM,KACRkvB,EAAK76B,EAAIvO,EAAIvC,OAASuC,EAAIvC,OAAS8Q,EAGvC,GAFI66B,IAAOppC,EAAIvC,OAAQqG,GAAO9D,EAAS8D,GAAO9D,EAAIiZ,MAAM,EAAG1K,GAEjD,IADVA,GAAK66B,GACQ,CACPA,IAAOppC,EAAIvC,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOla,EAAIiZ,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIzK,EAAM7G,EAAOW,YAAY2Q,GACzBT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EAGR,IAFAoO,EAAEoM,KAAK/X,KAAK2B,GACZyK,GAAKT,EAAEoM,KAAKzc,OACLqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAItZ,EAAM4P,EAAEoM,KACRkvB,EAAK76B,EAAIrQ,EAAIT,OAASS,EAAIT,OAAS8Q,EAGvC,GAFArQ,EAAIiE,KAAK2B,EAAKA,EAAIrG,OAAS8Q,EAAG,EAAG66B,GAEvB,IADV76B,GAAK66B,GACQ,CACPA,IAAOlrC,EAAIT,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOhc,EAAI+a,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAKyrC,EACLnsC,MAAO,SAAesS,EAAG2b,GACvB,OAAOpoB,EAAQzD,KAAMmgG,EAAcA,EAAc,CAAC,EAAGt0E,GAAU,CAAC,EAAG,CAEjEka,MAAO,EAEPM,eAAe,IAEnB,MA5K0Ei6D,EAAkB9qC,EAAY93D,UAAW+iG,GAA2EpjG,OAAOqiB,eAAe81C,EAAa,YAAa,CAAE13D,UAAU,IA8KrP2hE,CACT,CApK8B,2BChB9B,IAAIohC,EACJ,SAAST,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAC5C,SAAwBE,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CADxE+hG,CAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAG3O,IAAI+oC,EAAW,EAAQ,IACnBi9C,EAAetnF,OAAO,eACtBunF,EAAcvnF,OAAO,cACrBwnF,EAASxnF,OAAO,SAChBynF,EAASznF,OAAO,SAChB0nF,EAAe1nF,OAAO,eACtB2nF,EAAiB3nF,OAAO,iBACxB4nF,EAAU5nF,OAAO,UACrB,SAAS6nF,EAAiBzjG,EAAOkgC,GAC/B,MAAO,CACLlgC,MAAOA,EACPkgC,KAAMA,EAEV,CACA,SAASwjE,EAAe9F,GACtB,IAAIvoE,EAAUuoE,EAAKsF,GACnB,GAAgB,OAAZ7tE,EAAkB,CACpB,IAAI9X,EAAOqgF,EAAK4F,GAASpkF,OAIZ,OAAT7B,IACFqgF,EAAK0F,GAAgB,KACrB1F,EAAKsF,GAAgB,KACrBtF,EAAKuF,GAAe,KACpB9tE,EAAQouE,EAAiBlmF,GAAM,IAEnC,CACF,CACA,SAASomF,EAAW/F,GAGlB5tE,QAAQqO,SAASqlE,EAAgB9F,EACnC,CAYA,IAAIgG,EAAyBnkG,OAAO04B,gBAAe,WAAa,IAC5D0rE,EAAuCpkG,OAAOyc,gBAmD/CsmF,EAnD+DS,EAAwB,CACpFt9C,aACF,OAAOvjD,KAAKohG,EACd,EACA3oF,KAAM,WACJ,IAAI88C,EAAQv1D,KAGRyf,EAAQzf,KAAKghG,GACjB,GAAc,OAAVvhF,EACF,OAAOuT,QAAQE,OAAOzT,GAExB,GAAIzf,KAAKihG,GACP,OAAOjuE,QAAQC,QAAQouE,OAAiBjiG,GAAW,IAErD,GAAIY,KAAKohG,GAAS30D,UAKhB,OAAO,IAAIzZ,SAAQ,SAAUC,EAASC,GACpCtF,QAAQqO,UAAS,WACXs5B,EAAMyrC,GACR9tE,EAAOqiC,EAAMyrC,IAEb/tE,EAAQouE,OAAiBjiG,GAAW,GAExC,GACF,IAOF,IACI0qC,EADA43D,EAAc1hG,KAAKkhG,GAEvB,GAAIQ,EACF53D,EAAU,IAAI9W,QAlDpB,SAAqB0uE,EAAalG,GAChC,OAAO,SAAUvoE,EAASC,GACxBwuE,EAAYv3D,MAAK,WACXqxD,EAAKyF,GACPhuE,EAAQouE,OAAiBjiG,GAAW,IAGtCo8F,EAAK2F,GAAgBluE,EAASC,EAChC,GAAGA,EACL,CACF,CAwC4ByuE,CAAYD,EAAa1hG,WAC1C,CAGL,IAAImb,EAAOnb,KAAKohG,GAASpkF,OACzB,GAAa,OAAT7B,EACF,OAAO6X,QAAQC,QAAQouE,EAAiBlmF,GAAM,IAEhD2uB,EAAU,IAAI9W,QAAQhzB,KAAKmhG,GAC7B,CAEA,OADAnhG,KAAKkhG,GAAgBp3D,EACdA,CACT,GACwCtwB,OAAOgrD,eAAe,WAC9D,OAAOxkE,IACT,IAAIogG,EAAgBS,EAAuB,UAAU,WACnD,IAAIe,EAAS5hG,KAIb,OAAO,IAAIgzB,SAAQ,SAAUC,EAASC,GACpC0uE,EAAOR,GAASjgC,QAAQ,MAAM,SAAU/tC,GAClCA,EACFF,EAAOE,GAGTH,EAAQouE,OAAiBjiG,GAAW,GACtC,GACF,GACF,IAAIyhG,GAAwBW,GA4D5BvkG,EAAOD,QA3DiC,SAA2CumD,GACjF,IAAIs+C,EACAxvD,EAAWh1C,OAAOC,OAAOmkG,GAA4DrB,EAArByB,EAAiB,CAAC,EAAmCT,EAAS,CAChIxjG,MAAO2lD,EACPzlD,UAAU,IACRsiG,EAAgByB,EAAgBf,EAAc,CAChDljG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBd,EAAa,CAC/CnjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBb,EAAQ,CAC1CpjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBZ,EAAQ,CAC1CrjG,MAAO2lD,EAAO/W,eAAeuX,WAC7BjmD,UAAU,IACRsiG,EAAgByB,EAAgBV,EAAgB,CAClDvjG,MAAO,SAAeq1B,EAASC,GAC7B,IAAI/X,EAAOk3B,EAAS+uD,GAASpkF,OACzB7B,GACFk3B,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,EAAiBlmF,GAAM,MAE/Bk3B,EAASyuD,GAAgB7tE,EACzBof,EAAS0uD,GAAe7tE,EAE5B,EACAp1B,UAAU,IACR+jG,IA0BJ,OAzBAxvD,EAAS6uD,GAAgB,KACzBr9C,EAASN,GAAQ,SAAUnwB,GACzB,GAAIA,GAAoB,+BAAbA,EAAInN,KAAuC,CACpD,IAAIiN,EAASmf,EAAS0uD,GAUtB,OAPe,OAAX7tE,IACFmf,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB7tE,EAAOE,SAETif,EAAS2uD,GAAU5tE,EAErB,CACA,IAAIH,EAAUof,EAASyuD,GACP,OAAZ7tE,IACFof,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,OAAiBjiG,GAAW,KAEtCizC,EAAS4uD,IAAU,CACrB,IACA19C,EAAO7vB,GAAG,WAAY6tE,EAAWlsE,KAAK,KAAMgd,IACrCA,CACT,OClLAp1C,EAAOD,QAAU,WACf,MAAM,IAAIyC,MAAM,gDAClB,0BCyBAxC,EAAOD,QAAUg2D,EACjB,IAAIr2B,EAAY,EAAQ,IAExB,SAASq2B,EAAYnnC,GACnB,KAAM7rB,gBAAgBgzD,GAAc,OAAO,IAAIA,EAAYnnC,GAC3D8Q,EAAUrlB,KAAKtX,KAAM6rB,EACvB,CAJA,EAAQ,EAAR,CAAoBmnC,EAAar2B,GAKjCq2B,EAAYt1D,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC5DA,EAAG,KAAMijC,EACX,0BC/BA,IAAI1b,EASA+P,EAAiB,QACnBI,EAAmBJ,EAAeI,iBAClC2S,EAAuB/S,EAAe+S,qBACxC,SAASnsB,EAAK7mB,GAEZ,GAAIA,EAAK,MAAMA,CACjB,CA+BA,SAAS9b,EAAKqQ,GACZA,GACF,CACA,SAAS07C,EAAK1kE,EAAMg/E,GAClB,OAAOh/E,EAAK0kE,KAAKsa,EACnB,CA6BA1gF,EAAOD,QAvBP,WACE,IAAK,IAAIgkC,EAAOvlB,UAAU/c,OAAQojG,EAAU,IAAIpgG,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAClFq+C,EAAQr+C,GAAQhoC,UAAUgoC,GAE5B,IAKIhkC,EALAwgC,EATN,SAAqB6hD,GACnB,OAAKA,EAAQpjG,OAC8B,mBAAhCojG,EAAQA,EAAQpjG,OAAS,GAA0Bu7C,EACvD6nD,EAAQnrE,MAFasjB,CAG9B,CAKiB8nD,CAAYD,GAE3B,GADIpgG,MAAMC,QAAQmgG,EAAQ,MAAKA,EAAUA,EAAQ,IAC7CA,EAAQpjG,OAAS,EACnB,MAAM,IAAI+0D,EAAiB,WAG7B,IAAIuuC,EAAWF,EAAQvjE,KAAI,SAAUglB,EAAQ/hD,GAC3C,IAAI++D,EAAU/+D,EAAIsgG,EAAQpjG,OAAS,EAEnC,OAnDJ,SAAmB6kD,EAAQgd,EAASqG,EAAS3mB,GAC3CA,EAnBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACDA,IACJA,GAAS,EACTvD,EAAShhC,WAAM,EAAQxD,WACzB,CACF,CAYaqX,CAAKmtB,GAChB,IAAIgiD,GAAS,EACb1+C,EAAO7vB,GAAG,SAAS,WACjBuuE,GAAS,CACX,SACY7iG,IAARkkD,IAAmBA,EAAM,EAAQ,KACrCA,EAAIC,EAAQ,CACVtX,SAAUs0B,EACVziE,SAAU8oE,IACT,SAAUxzC,GACX,GAAIA,EAAK,OAAO6sB,EAAS7sB,GACzB6uE,GAAS,EACThiD,GACF,IACA,IAAIxT,GAAY,EAChB,OAAO,SAAUrZ,GACf,IAAI6uE,IACAx1D,EAIJ,OAHAA,GAAY,EAtBhB,SAAmB8W,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuBQC,CAAUf,GAAgBA,EAAOc,QACP,mBAAnBd,EAAO4d,QAA+B5d,EAAO4d,eACxDlhB,EAAS7sB,GAAO,IAAIgzC,EAAqB,QAC3C,CACF,CAyBW87B,CAAU3+C,EAAQgd,EADX/+D,EAAI,GACyB,SAAU4xB,GAC9C3T,IAAOA,EAAQ2T,GAChBA,GAAK4uE,EAAS96D,QAAQ5vB,GACtBipD,IACJyhC,EAAS96D,QAAQ5vB,GACjB2oC,EAASxgC,GACX,GACF,IACA,OAAOqiF,EAAQ/5D,OAAOs7B,EACxB,aC5EA,IAAI3jE,EAAW,EAAQ,GACnB28B,EAAO,EAAQ,IACfn+B,EAAS,YAET0rE,EAAI,CACN,WAAY,YAAY,YAAgB,WAGtCrN,EAAI,IAAI76D,MAAM,IAElB,SAASygG,IACPniG,KAAK6yB,OACL7yB,KAAK8pE,GAAKvN,EAEVlgC,EAAK/kB,KAAKtX,KAAM,GAAI,GACtB,CAkBA,SAASoiG,EAAQ3gG,GACf,OAAQA,GAAO,GAAOA,IAAQ,CAChC,CAEA,SAAS4gG,EAAI5zF,EAAGxK,EAAGtD,EAAG+vB,GACpB,OAAU,IAANjiB,EAAiBxK,EAAItD,GAAQsD,EAAKysB,EAC5B,IAANjiB,EAAiBxK,EAAItD,EAAMsD,EAAIysB,EAAM/vB,EAAI+vB,EACtCzsB,EAAItD,EAAI+vB,CACjB,CAxBAhxB,EAASyiG,EAAK9lE,GAEd8lE,EAAIzkG,UAAUm1B,KAAO,WAOnB,OANA7yB,KAAKyiD,GAAK,WACVziD,KAAK0iD,GAAK,WACV1iD,KAAK2iD,GAAK,WACV3iD,KAAK4iD,GAAK,UACV5iD,KAAK6kD,GAAK,WAEH7kD,IACT,EAgBAmiG,EAAIzkG,UAAU6+B,QAAU,SAAU2mB,GAShC,IARA,IAfczhD,EAeV86D,EAAIv8D,KAAK8pE,GAET9lE,EAAc,EAAVhE,KAAKyiD,GACTx+C,EAAc,EAAVjE,KAAK0iD,GACT/hD,EAAc,EAAVX,KAAK2iD,GACTjyB,EAAc,EAAV1wB,KAAK4iD,GACTriD,EAAc,EAAVP,KAAK6kD,GAEJrjD,EAAI,EAAGA,EAAI,KAAMA,EAAG+6D,EAAE/6D,GAAK0hD,EAAEx/B,YAAgB,EAAJliB,GAClD,KAAOA,EAAI,KAAMA,EAAG+6D,EAAE/6D,GAAK+6D,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,IAAM+6D,EAAE/6D,EAAI,IAEnE,IAAK,IAAIgB,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,IAAIiM,KAAOjM,EAAI,IACXqD,EAAoD,IA5B5CpE,EA4BGuC,IA3BF,EAAMvC,IAAQ,IA2BP4gG,EAAG5zF,EAAGxK,EAAGtD,EAAG+vB,GAAKnwB,EAAIg8D,EAAE/5D,GAAKonE,EAAEn7D,GAElDlO,EAAImwB,EACJA,EAAI/vB,EACJA,EAAIyhG,EAAOn+F,GACXA,EAAID,EACJA,EAAI6B,CACN,CAEA7F,KAAKyiD,GAAMz+C,EAAIhE,KAAKyiD,GAAM,EAC1BziD,KAAK0iD,GAAMz+C,EAAIjE,KAAK0iD,GAAM,EAC1B1iD,KAAK2iD,GAAMhiD,EAAIX,KAAK2iD,GAAM,EAC1B3iD,KAAK4iD,GAAMlyB,EAAI1wB,KAAK4iD,GAAM,EAC1B5iD,KAAK6kD,GAAMtkD,EAAIP,KAAK6kD,GAAM,CAC5B,EAEAs9C,EAAIzkG,UAAU4+B,MAAQ,WACpB,IAAIguC,EAAIpsE,EAAOW,YAAY,IAQ3B,OANAyrE,EAAE9kD,aAAuB,EAAVxlB,KAAKyiD,GAAQ,GAC5B6nB,EAAE9kD,aAAuB,EAAVxlB,KAAK0iD,GAAQ,GAC5B4nB,EAAE9kD,aAAuB,EAAVxlB,KAAK2iD,GAAQ,GAC5B2nB,EAAE9kD,aAAuB,EAAVxlB,KAAK4iD,GAAQ,IAC5B0nB,EAAE9kD,aAAuB,EAAVxlB,KAAK6kD,GAAQ,IAErBylB,CACT,EAEArtE,EAAOD,QAAUmlG,aCpFjB,IAAIziG,EAAW,EAAQ,GACnB28B,EAAO,EAAQ,IACfn+B,EAAS,YAET0rE,EAAI,CACN,WAAY,YAAY,YAAgB,WAGtCrN,EAAI,IAAI76D,MAAM,IAElB,SAAS4gG,IACPtiG,KAAK6yB,OACL7yB,KAAK8pE,GAAKvN,EAEVlgC,EAAK/kB,KAAKtX,KAAM,GAAI,GACtB,CAkBA,SAASuiG,EAAO9gG,GACd,OAAQA,GAAO,EAAMA,IAAQ,EAC/B,CAEA,SAAS2gG,EAAQ3gG,GACf,OAAQA,GAAO,GAAOA,IAAQ,CAChC,CAEA,SAAS4gG,EAAI5zF,EAAGxK,EAAGtD,EAAG+vB,GACpB,OAAU,IAANjiB,EAAiBxK,EAAItD,GAAQsD,EAAKysB,EAC5B,IAANjiB,EAAiBxK,EAAItD,EAAMsD,EAAIysB,EAAM/vB,EAAI+vB,EACtCzsB,EAAItD,EAAI+vB,CACjB,CA5BAhxB,EAAS4iG,EAAMjmE,GAEfimE,EAAK5kG,UAAUm1B,KAAO,WAOpB,OANA7yB,KAAKyiD,GAAK,WACVziD,KAAK0iD,GAAK,WACV1iD,KAAK2iD,GAAK,WACV3iD,KAAK4iD,GAAK,UACV5iD,KAAK6kD,GAAK,WAEH7kD,IACT,EAoBAsiG,EAAK5kG,UAAU6+B,QAAU,SAAU2mB,GASjC,IARA,IAnBczhD,EAmBV86D,EAAIv8D,KAAK8pE,GAET9lE,EAAc,EAAVhE,KAAKyiD,GACTx+C,EAAc,EAAVjE,KAAK0iD,GACT/hD,EAAc,EAAVX,KAAK2iD,GACTjyB,EAAc,EAAV1wB,KAAK4iD,GACTriD,EAAc,EAAVP,KAAK6kD,GAEJrjD,EAAI,EAAGA,EAAI,KAAMA,EAAG+6D,EAAE/6D,GAAK0hD,EAAEx/B,YAAgB,EAAJliB,GAClD,KAAOA,EAAI,KAAMA,EAAG+6D,EAAE/6D,IA5BRC,EA4BmB86D,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,GAAK+6D,EAAE/6D,EAAI,IAAM+6D,EAAE/6D,EAAI,MA3B1D,EAAMC,IAAQ,GA6B7B,IAAK,IAAIe,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,IAAIiM,KAAOjM,EAAI,IACXqD,EAAK08F,EAAMv+F,GAAKq+F,EAAG5zF,EAAGxK,EAAGtD,EAAG+vB,GAAKnwB,EAAIg8D,EAAE/5D,GAAKonE,EAAEn7D,GAAM,EAExDlO,EAAImwB,EACJA,EAAI/vB,EACJA,EAAIyhG,EAAOn+F,GACXA,EAAID,EACJA,EAAI6B,CACN,CAEA7F,KAAKyiD,GAAMz+C,EAAIhE,KAAKyiD,GAAM,EAC1BziD,KAAK0iD,GAAMz+C,EAAIjE,KAAK0iD,GAAM,EAC1B1iD,KAAK2iD,GAAMhiD,EAAIX,KAAK2iD,GAAM,EAC1B3iD,KAAK4iD,GAAMlyB,EAAI1wB,KAAK4iD,GAAM,EAC1B5iD,KAAK6kD,GAAMtkD,EAAIP,KAAK6kD,GAAM,CAC5B,EAEAy9C,EAAK5kG,UAAU4+B,MAAQ,WACrB,IAAIguC,EAAIpsE,EAAOW,YAAY,IAQ3B,OANAyrE,EAAE9kD,aAAuB,EAAVxlB,KAAKyiD,GAAQ,GAC5B6nB,EAAE9kD,aAAuB,EAAVxlB,KAAK0iD,GAAQ,GAC5B4nB,EAAE9kD,aAAuB,EAAVxlB,KAAK2iD,GAAQ,GAC5B2nB,EAAE9kD,aAAuB,EAAVxlB,KAAK4iD,GAAQ,IAC5B0nB,EAAE9kD,aAAuB,EAAVxlB,KAAK6kD,GAAQ,IAErBylB,CACT,EAEArtE,EAAOD,QAAUslG,aC1FjB,IAAI5iG,EAAW,EAAQ,GACnBmqE,EAAS,EAAQ,IACjBxtC,EAAO,EAAQ,IACfn+B,EAAS,YAETq+D,EAAI,IAAI76D,MAAM,IAElB,SAAS8gG,IACPxiG,KAAK6yB,OAEL7yB,KAAK8pE,GAAKvN,EAEVlgC,EAAK/kB,KAAKtX,KAAM,GAAI,GACtB,CAEAN,EAAS8iG,EAAQ34B,GAEjB24B,EAAO9kG,UAAUm1B,KAAO,WAUtB,OATA7yB,KAAKyiD,GAAK,WACVziD,KAAK0iD,GAAK,UACV1iD,KAAK2iD,GAAK,UACV3iD,KAAK4iD,GAAK,WACV5iD,KAAK6kD,GAAK,WACV7kD,KAAKmqE,GAAK,WACVnqE,KAAKoqE,GAAK,WACVpqE,KAAKqqE,GAAK,WAEHrqE,IACT,EAEAwiG,EAAO9kG,UAAU4+B,MAAQ,WACvB,IAAIguC,EAAIpsE,EAAOW,YAAY,IAU3B,OARAyrE,EAAE9kD,aAAaxlB,KAAKyiD,GAAI,GACxB6nB,EAAE9kD,aAAaxlB,KAAK0iD,GAAI,GACxB4nB,EAAE9kD,aAAaxlB,KAAK2iD,GAAI,GACxB2nB,EAAE9kD,aAAaxlB,KAAK4iD,GAAI,IACxB0nB,EAAE9kD,aAAaxlB,KAAK6kD,GAAI,IACxBylB,EAAE9kD,aAAaxlB,KAAKmqE,GAAI,IACxBG,EAAE9kD,aAAaxlB,KAAKoqE,GAAI,IAEjBE,CACT,EAEArtE,EAAOD,QAAUwlG,aCpDjB,IAAI9iG,EAAW,EAAQ,GACnBi9D,EAAS,EAAQ,IACjBtgC,EAAO,EAAQ,IACfn+B,EAAS,YAETq+D,EAAI,IAAI76D,MAAM,KAElB,SAAS+gG,IACPziG,KAAK6yB,OACL7yB,KAAK8pE,GAAKvN,EAEVlgC,EAAK/kB,KAAKtX,KAAM,IAAK,IACvB,CAEAN,EAAS+iG,EAAQ9lC,GAEjB8lC,EAAO/kG,UAAUm1B,KAAO,WAmBtB,OAlBA7yB,KAAK8qE,IAAM,WACX9qE,KAAK+qE,IAAM,WACX/qE,KAAKgrE,IAAM,WACXhrE,KAAKirE,IAAM,UACXjrE,KAAKkrE,IAAM,WACXlrE,KAAKmrE,IAAM,WACXnrE,KAAKorE,IAAM,WACXprE,KAAKqrE,IAAM,WAEXrrE,KAAKsrE,IAAM,WACXtrE,KAAKurE,IAAM,UACXvrE,KAAKwrE,IAAM,UACXxrE,KAAKyrE,IAAM,WACXzrE,KAAK0rE,IAAM,WACX1rE,KAAK2rE,IAAM,WACX3rE,KAAK4rE,IAAM,WACX5rE,KAAK6rE,IAAM,WAEJ7rE,IACT,EAEAyiG,EAAO/kG,UAAU4+B,MAAQ,WACvB,IAAIguC,EAAIpsE,EAAOW,YAAY,IAE3B,SAASwuE,EAAch8D,EAAGtD,EAAGsP,GAC3BitD,EAAE9kD,aAAanU,EAAGgM,GAClBitD,EAAE9kD,aAAazX,EAAGsP,EAAS,EAC7B,CASA,OAPAgwD,EAAartE,KAAK8qE,IAAK9qE,KAAKsrE,IAAK,GACjC+B,EAAartE,KAAK+qE,IAAK/qE,KAAKurE,IAAK,GACjC8B,EAAartE,KAAKgrE,IAAKhrE,KAAKwrE,IAAK,IACjC6B,EAAartE,KAAKirE,IAAKjrE,KAAKyrE,IAAK,IACjC4B,EAAartE,KAAKkrE,IAAKlrE,KAAK0rE,IAAK,IACjC2B,EAAartE,KAAKmrE,IAAKnrE,KAAK2rE,IAAK,IAE1BrB,CACT,EAEArtE,EAAOD,QAAUylG,aCnCjBxlG,EAAOD,QAAU+1D,EAEjB,IAAI2vC,EAAK,mBAoBT,SAAS3vC,IACP2vC,EAAGprF,KAAKtX,KACV,CArBe,EAAQ,EAEvBN,CAASqzD,EAAQ2vC,GACjB3vC,EAAOnnB,SAAW,EAAQ,IAC1BmnB,EAAOlnB,SAAW,EAAQ,KAC1BknB,EAAOpnB,OAAS,EAAQ,IACxBonB,EAAOp2B,UAAY,EAAQ,KAC3Bo2B,EAAOC,YAAc,EAAQ,KAC7BD,EAAOlP,SAAW,EAAQ,IAC1BkP,EAAOE,SAAW,EAAQ,KAG1BF,EAAOA,OAASA,EAWhBA,EAAOr1D,UAAU2lE,KAAO,SAAShgE,EAAMwoB,GACrC,IAAIs0B,EAASngD,KAEb,SAAS+jE,EAAO/E,GACV37D,EAAKvF,WACH,IAAUuF,EAAK4W,MAAM+kD,IAAU7e,EAAOgkB,OACxChkB,EAAOgkB,OAGb,CAIA,SAASL,IACH3jB,EAAOlU,UAAYkU,EAAOuiB,QAC5BviB,EAAOuiB,QAEX,CANAviB,EAAOzsB,GAAG,OAAQqwC,GAQlB1gE,EAAKqwB,GAAG,QAASowC,GAIZzgE,EAAKs/F,UAAc92E,IAA2B,IAAhBA,EAAQ1qB,MACzCg/C,EAAOzsB,GAAG,MAAOwY,GACjBiU,EAAOzsB,GAAG,QAASuwB,IAGrB,IAAI2+C,GAAW,EACf,SAAS12D,IACH02D,IACJA,GAAW,EAEXv/F,EAAKlC,MACP,CAGA,SAAS8iD,IACH2+C,IACJA,GAAW,EAEiB,mBAAjBv/F,EAAK89D,SAAwB99D,EAAK89D,UAC/C,CAGA,SAASnd,EAAQ7tB,GAEf,GADA0sE,IACwC,IAApCH,EAAG/sE,cAAc31B,KAAM,SACzB,MAAMm2B,CAEV,CAMA,SAAS0sE,IACP1iD,EAAO9sB,eAAe,OAAQ0wC,GAC9B1gE,EAAKgwB,eAAe,QAASywC,GAE7B3jB,EAAO9sB,eAAe,MAAO6Y,GAC7BiU,EAAO9sB,eAAe,QAAS4wB,GAE/B9D,EAAO9sB,eAAe,QAAS2wB,GAC/B3gD,EAAKgwB,eAAe,QAAS2wB,GAE7B7D,EAAO9sB,eAAe,MAAOwvE,GAC7B1iD,EAAO9sB,eAAe,QAASwvE,GAE/Bx/F,EAAKgwB,eAAe,QAASwvE,EAC/B,CAUA,OA5BA1iD,EAAOzsB,GAAG,QAASswB,GACnB3gD,EAAKqwB,GAAG,QAASswB,GAmBjB7D,EAAOzsB,GAAG,MAAOmvE,GACjB1iD,EAAOzsB,GAAG,QAASmvE,GAEnBx/F,EAAKqwB,GAAG,QAASmvE,GAEjBx/F,EAAKqxB,KAAK,OAAQyrB,GAGX98C,CACT,aChIApG,EAAOD,QAAU,EAAjB,yCCEA,SAASw1B,EAAQlK,EAAQ23E,GAAkB,IAAI13E,EAAOlrB,OAAOkrB,KAAKD,GAAS,GAAIjrB,OAAOo1B,sBAAuB,CAAE,IAAIytE,EAAU7iG,OAAOo1B,sBAAsBnK,GAAS23E,IAAmBC,EAAUA,EAAQhiD,QAAO,SAAU93B,GAAO,OAAO/oB,OAAOonC,yBAAyBnc,EAAQlC,GAAKvoB,UAAY,KAAK0qB,EAAKvK,KAAKiB,MAAMsJ,EAAM23E,EAAU,CAAE,OAAO33E,CAAM,CACpV,SAAS43E,EAAc1/E,GAAU,IAAK,IAAIjf,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK,CAAE,IAAI2+C,EAAS,MAAQ1kC,UAAUja,GAAKia,UAAUja,GAAK,CAAC,EAAGA,EAAI,EAAIgxB,EAAQn1B,OAAO8iD,IAAS,GAAIjZ,SAAQ,SAAU5oC,GAAO8hG,EAAgB3/E,EAAQniB,EAAK6hD,EAAO7hD,GAAO,IAAKjB,OAAOknC,0BAA4BlnC,OAAO2iC,iBAAiBvf,EAAQpjB,OAAOknC,0BAA0B4b,IAAW3tB,EAAQn1B,OAAO8iD,IAASjZ,SAAQ,SAAU5oC,GAAOjB,OAAOqiB,eAAee,EAAQniB,EAAKjB,OAAOonC,yBAAyB0b,EAAQ7hD,GAAO,GAAI,CAAE,OAAOmiB,CAAQ,CACzf,SAAS2/E,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAAM+hG,EAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAE3O,SAASwlF,EAAkB7/E,EAAQu1B,GAAS,IAAK,IAAIx0C,EAAI,EAAGA,EAAIw0C,EAAMt3C,OAAQ8C,IAAK,CAAE,IAAIstE,EAAa94B,EAAMx0C,GAAIstE,EAAWjxE,WAAaixE,EAAWjxE,aAAc,EAAOixE,EAAW/wE,cAAe,EAAU,UAAW+wE,IAAYA,EAAWhxE,UAAW,GAAMT,OAAOqiB,eAAee,EAAQ4/E,EAAevxB,EAAWxwE,KAAMwwE,EAAa,CAAE,CAE5U,SAASuxB,EAAe7hG,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CAE1H,IACEJ,EADa,EAAQ,GACHA,OAElBuF,EADc,EAAQ,KACFA,QAClBsmC,EAAStmC,GAAWA,EAAQsmC,QAAU,UAI1C9sC,EAAOD,QAAuB,WAC5B,SAASyiE,KAdX,SAAyB1nC,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAepJ02D,CAAgBz1D,KAAMy/D,GACtBz/D,KAAKo6C,KAAO,KACZp6C,KAAKq6C,KAAO,KACZr6C,KAAKtB,OAAS,CAChB,CAjBF,IAAsB82D,EAAairC,EA8KjC,OA9KoBjrC,EAkBPiK,GAlBoBghC,EAkBR,CAAC,CACxBniG,IAAK,OACLV,MAAO,SAAckuC,GACnB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAM,MAEJzY,KAAKtB,OAAS,EAAGsB,KAAKq6C,KAAK5hC,KAAOitD,EAAW1lE,KAAKo6C,KAAOsrB,EAC7D1lE,KAAKq6C,KAAOqrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,UACLV,MAAO,SAAiBkuC,GACtB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAMzY,KAAKo6C,MAEO,IAAhBp6C,KAAKtB,SAAcsB,KAAKq6C,KAAOqrB,GACnC1lE,KAAKo6C,KAAOsrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,QACLV,MAAO,WACL,GAAoB,IAAhBoC,KAAKtB,OAAT,CACA,IAAIqG,EAAM/E,KAAKo6C,KAAKj/B,KAGpB,OAFoB,IAAhBnb,KAAKtB,OAAcsB,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KAAUr6C,KAAKo6C,KAAOp6C,KAAKo6C,KAAK3hC,OAC7EzY,KAAKtB,OACAqG,CAJsB,CAK/B,GACC,CACDzG,IAAK,QACLV,MAAO,WACLoC,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KACxBr6C,KAAKtB,OAAS,CAChB,GACC,CACDJ,IAAK,OACLV,MAAO,SAAc6Q,GACnB,GAAoB,IAAhBzO,KAAKtB,OAAc,MAAO,GAG9B,IAFA,IAAIqQ,EAAI/O,KAAKo6C,KACTr1C,EAAM,GAAKgK,EAAEoM,KACVpM,EAAIA,EAAE0J,MAAM1T,GAAO0J,EAAIM,EAAEoM,KAChC,OAAOpW,CACT,GACC,CACDzG,IAAK,SACLV,MAAO,SAAgB4R,GACrB,GAAoB,IAAhBxP,KAAKtB,OAAc,OAAOR,EAAOU,MAAM,GAI3C,IAHA,IA5DcR,EAAKqiB,EAAQpD,EA4DvBtY,EAAM7G,EAAOW,YAAY2Q,IAAM,GAC/BT,EAAI/O,KAAKo6C,KACT54C,EAAI,EACDuN,GA/DO3Q,EAgED2Q,EAAEoM,KAhEIsF,EAgEE1b,EAhEMsY,EAgED7b,EA/D9BtD,EAAOR,UAAU0F,KAAKkU,KAAKlZ,EAAKqiB,EAAQpD,GAgElC7b,GAAKuN,EAAEoM,KAAKzc,OACZqQ,EAAIA,EAAE0J,KAER,OAAO1T,CACT,GAGC,CACDzG,IAAK,UACLV,MAAO,SAAiB4R,EAAGkxF,GACzB,IAAI37F,EAYJ,OAXIyK,EAAIxP,KAAKo6C,KAAKj/B,KAAKzc,QAErBqG,EAAM/E,KAAKo6C,KAAKj/B,KAAKjB,MAAM,EAAG1K,GAC9BxP,KAAKo6C,KAAKj/B,KAAOnb,KAAKo6C,KAAKj/B,KAAKjB,MAAM1K,IAGtCzK,EAFSyK,IAAMxP,KAAKo6C,KAAKj/B,KAAKzc,OAExBsB,KAAKoS,QAGLsuF,EAAa1gG,KAAK2gG,WAAWnxF,GAAKxP,KAAK4gG,WAAWpxF,GAEnDzK,CACT,GACC,CACDzG,IAAK,QACLV,MAAO,WACL,OAAOoC,KAAKo6C,KAAKj/B,IACnB,GAGC,CACD7c,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EACJoE,EAAMgK,EAAEoM,KAEZ,IADA3L,GAAKzK,EAAIrG,OACFqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAIxX,EAAM8N,EAAEoM,KACRkvB,EAAK76B,EAAIvO,EAAIvC,OAASuC,EAAIvC,OAAS8Q,EAGvC,GAFI66B,IAAOppC,EAAIvC,OAAQqG,GAAO9D,EAAS8D,GAAO9D,EAAIiZ,MAAM,EAAG1K,GAEjD,IADVA,GAAK66B,GACQ,CACPA,IAAOppC,EAAIvC,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOla,EAAIiZ,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIzK,EAAM7G,EAAOW,YAAY2Q,GACzBT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EAGR,IAFAoO,EAAEoM,KAAK/X,KAAK2B,GACZyK,GAAKT,EAAEoM,KAAKzc,OACLqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAItZ,EAAM4P,EAAEoM,KACRkvB,EAAK76B,EAAIrQ,EAAIT,OAASS,EAAIT,OAAS8Q,EAGvC,GAFArQ,EAAIiE,KAAK2B,EAAKA,EAAIrG,OAAS8Q,EAAG,EAAG66B,GAEvB,IADV76B,GAAK66B,GACQ,CACPA,IAAOlrC,EAAIT,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOhc,EAAI+a,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAKyrC,EACLnsC,MAAO,SAAesS,EAAG2b,GACvB,OAAOpoB,EAAQzD,KAAMmgG,EAAcA,EAAc,CAAC,EAAGt0E,GAAU,CAAC,EAAG,CAEjEka,MAAO,EAEPM,eAAe,IAEnB,MA5K0Ei6D,EAAkB9qC,EAAY93D,UAAW+iG,GAA2EpjG,OAAOqiB,eAAe81C,EAAa,YAAa,CAAE13D,UAAU,IA8KrP2hE,CACT,CApK8B,2BChB9B,IAAIohC,EACJ,SAAST,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAC5C,SAAwBE,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CADxE+hG,CAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAG3O,IAAI+oC,EAAW,EAAQ,IACnBi9C,EAAetnF,OAAO,eACtBunF,EAAcvnF,OAAO,cACrBwnF,EAASxnF,OAAO,SAChBynF,EAASznF,OAAO,SAChB0nF,EAAe1nF,OAAO,eACtB2nF,EAAiB3nF,OAAO,iBACxB4nF,EAAU5nF,OAAO,UACrB,SAAS6nF,EAAiBzjG,EAAOkgC,GAC/B,MAAO,CACLlgC,MAAOA,EACPkgC,KAAMA,EAEV,CACA,SAASwjE,EAAe9F,GACtB,IAAIvoE,EAAUuoE,EAAKsF,GACnB,GAAgB,OAAZ7tE,EAAkB,CACpB,IAAI9X,EAAOqgF,EAAK4F,GAASpkF,OAIZ,OAAT7B,IACFqgF,EAAK0F,GAAgB,KACrB1F,EAAKsF,GAAgB,KACrBtF,EAAKuF,GAAe,KACpB9tE,EAAQouE,EAAiBlmF,GAAM,IAEnC,CACF,CACA,SAASomF,EAAW/F,GAGlB5tE,QAAQqO,SAASqlE,EAAgB9F,EACnC,CAYA,IAAIgG,EAAyBnkG,OAAO04B,gBAAe,WAAa,IAC5D0rE,EAAuCpkG,OAAOyc,gBAmD/CsmF,EAnD+DS,EAAwB,CACpFt9C,aACF,OAAOvjD,KAAKohG,EACd,EACA3oF,KAAM,WACJ,IAAI88C,EAAQv1D,KAGRyf,EAAQzf,KAAKghG,GACjB,GAAc,OAAVvhF,EACF,OAAOuT,QAAQE,OAAOzT,GAExB,GAAIzf,KAAKihG,GACP,OAAOjuE,QAAQC,QAAQouE,OAAiBjiG,GAAW,IAErD,GAAIY,KAAKohG,GAAS30D,UAKhB,OAAO,IAAIzZ,SAAQ,SAAUC,EAASC,GACpCtF,QAAQqO,UAAS,WACXs5B,EAAMyrC,GACR9tE,EAAOqiC,EAAMyrC,IAEb/tE,EAAQouE,OAAiBjiG,GAAW,GAExC,GACF,IAOF,IACI0qC,EADA43D,EAAc1hG,KAAKkhG,GAEvB,GAAIQ,EACF53D,EAAU,IAAI9W,QAlDpB,SAAqB0uE,EAAalG,GAChC,OAAO,SAAUvoE,EAASC,GACxBwuE,EAAYv3D,MAAK,WACXqxD,EAAKyF,GACPhuE,EAAQouE,OAAiBjiG,GAAW,IAGtCo8F,EAAK2F,GAAgBluE,EAASC,EAChC,GAAGA,EACL,CACF,CAwC4ByuE,CAAYD,EAAa1hG,WAC1C,CAGL,IAAImb,EAAOnb,KAAKohG,GAASpkF,OACzB,GAAa,OAAT7B,EACF,OAAO6X,QAAQC,QAAQouE,EAAiBlmF,GAAM,IAEhD2uB,EAAU,IAAI9W,QAAQhzB,KAAKmhG,GAC7B,CAEA,OADAnhG,KAAKkhG,GAAgBp3D,EACdA,CACT,GACwCtwB,OAAOgrD,eAAe,WAC9D,OAAOxkE,IACT,IAAIogG,EAAgBS,EAAuB,UAAU,WACnD,IAAIe,EAAS5hG,KAIb,OAAO,IAAIgzB,SAAQ,SAAUC,EAASC,GACpC0uE,EAAOR,GAASjgC,QAAQ,MAAM,SAAU/tC,GAClCA,EACFF,EAAOE,GAGTH,EAAQouE,OAAiBjiG,GAAW,GACtC,GACF,GACF,IAAIyhG,GAAwBW,GA4D5BvkG,EAAOD,QA3DiC,SAA2CumD,GACjF,IAAIs+C,EACAxvD,EAAWh1C,OAAOC,OAAOmkG,GAA4DrB,EAArByB,EAAiB,CAAC,EAAmCT,EAAS,CAChIxjG,MAAO2lD,EACPzlD,UAAU,IACRsiG,EAAgByB,EAAgBf,EAAc,CAChDljG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBd,EAAa,CAC/CnjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBb,EAAQ,CAC1CpjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBZ,EAAQ,CAC1CrjG,MAAO2lD,EAAO/W,eAAeuX,WAC7BjmD,UAAU,IACRsiG,EAAgByB,EAAgBV,EAAgB,CAClDvjG,MAAO,SAAeq1B,EAASC,GAC7B,IAAI/X,EAAOk3B,EAAS+uD,GAASpkF,OACzB7B,GACFk3B,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,EAAiBlmF,GAAM,MAE/Bk3B,EAASyuD,GAAgB7tE,EACzBof,EAAS0uD,GAAe7tE,EAE5B,EACAp1B,UAAU,IACR+jG,IA0BJ,OAzBAxvD,EAAS6uD,GAAgB,KACzBr9C,EAASN,GAAQ,SAAUnwB,GACzB,GAAIA,GAAoB,+BAAbA,EAAInN,KAAuC,CACpD,IAAIiN,EAASmf,EAAS0uD,GAUtB,OAPe,OAAX7tE,IACFmf,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB7tE,EAAOE,SAETif,EAAS2uD,GAAU5tE,EAErB,CACA,IAAIH,EAAUof,EAASyuD,GACP,OAAZ7tE,IACFof,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,OAAiBjiG,GAAW,KAEtCizC,EAAS4uD,IAAU,CACrB,IACA19C,EAAO7vB,GAAG,WAAY6tE,EAAWlsE,KAAK,KAAMgd,IACrCA,CACT,OClLAp1C,EAAOD,QAAU,WACf,MAAM,IAAIyC,MAAM,gDAClB,0BCyBAxC,EAAOD,QAAUg2D,EACjB,IAAIr2B,EAAY,EAAQ,KAExB,SAASq2B,EAAYnnC,GACnB,KAAM7rB,gBAAgBgzD,GAAc,OAAO,IAAIA,EAAYnnC,GAC3D8Q,EAAUrlB,KAAKtX,KAAM6rB,EACvB,CAJA,EAAQ,EAAR,CAAoBmnC,EAAar2B,GAKjCq2B,EAAYt1D,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC5DA,EAAG,KAAMijC,EACX,0BC/BA,IAAI1b,EASA+P,EAAiB,QACnBI,EAAmBJ,EAAeI,iBAClC2S,EAAuB/S,EAAe+S,qBACxC,SAASnsB,EAAK7mB,GAEZ,GAAIA,EAAK,MAAMA,CACjB,CA+BA,SAAS9b,EAAKqQ,GACZA,GACF,CACA,SAAS07C,EAAK1kE,EAAMg/E,GAClB,OAAOh/E,EAAK0kE,KAAKsa,EACnB,CA6BA1gF,EAAOD,QAvBP,WACE,IAAK,IAAIgkC,EAAOvlB,UAAU/c,OAAQojG,EAAU,IAAIpgG,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAClFq+C,EAAQr+C,GAAQhoC,UAAUgoC,GAE5B,IAKIhkC,EALAwgC,EATN,SAAqB6hD,GACnB,OAAKA,EAAQpjG,OAC8B,mBAAhCojG,EAAQA,EAAQpjG,OAAS,GAA0Bu7C,EACvD6nD,EAAQnrE,MAFasjB,CAG9B,CAKiB8nD,CAAYD,GAE3B,GADIpgG,MAAMC,QAAQmgG,EAAQ,MAAKA,EAAUA,EAAQ,IAC7CA,EAAQpjG,OAAS,EACnB,MAAM,IAAI+0D,EAAiB,WAG7B,IAAIuuC,EAAWF,EAAQvjE,KAAI,SAAUglB,EAAQ/hD,GAC3C,IAAI++D,EAAU/+D,EAAIsgG,EAAQpjG,OAAS,EAEnC,OAnDJ,SAAmB6kD,EAAQgd,EAASqG,EAAS3mB,GAC3CA,EAnBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACDA,IACJA,GAAS,EACTvD,EAAShhC,WAAM,EAAQxD,WACzB,CACF,CAYaqX,CAAKmtB,GAChB,IAAIgiD,GAAS,EACb1+C,EAAO7vB,GAAG,SAAS,WACjBuuE,GAAS,CACX,SACY7iG,IAARkkD,IAAmBA,EAAM,EAAQ,KACrCA,EAAIC,EAAQ,CACVtX,SAAUs0B,EACVziE,SAAU8oE,IACT,SAAUxzC,GACX,GAAIA,EAAK,OAAO6sB,EAAS7sB,GACzB6uE,GAAS,EACThiD,GACF,IACA,IAAIxT,GAAY,EAChB,OAAO,SAAUrZ,GACf,IAAI6uE,IACAx1D,EAIJ,OAHAA,GAAY,EAtBhB,SAAmB8W,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuBQC,CAAUf,GAAgBA,EAAOc,QACP,mBAAnBd,EAAO4d,QAA+B5d,EAAO4d,eACxDlhB,EAAS7sB,GAAO,IAAIgzC,EAAqB,QAC3C,CACF,CAyBW87B,CAAU3+C,EAAQgd,EADX/+D,EAAI,GACyB,SAAU4xB,GAC9C3T,IAAOA,EAAQ2T,GAChBA,GAAK4uE,EAAS96D,QAAQ5vB,GACtBipD,IACJyhC,EAAS96D,QAAQ5vB,GACjB2oC,EAASxgC,GACX,GACF,IACA,OAAOqiF,EAAQ/5D,OAAOs7B,EACxB,aCpFA,IAOIy/B,EAkCA7mE,EAzCA/9B,EAAS,YAETuvE,EAAkB,EAAQ,KAC1B1M,EAAkB,EAAQ,KAC1B7gB,EAAO,EAAQ,KACfj7C,EAAW,EAAQ,KAGnB89F,EAAS,EAAAtvF,EAAOwjB,QAAU,EAAAxjB,EAAOwjB,OAAO8rE,OACxCC,EAAY,CACd5mE,IAAK,QACL,QAAS,QACTgmB,KAAM,QACNP,OAAQ,UACR,UAAW,UACXC,OAAQ,UACR,UAAW,UACX,UAAW,UACXC,OAAQ,WAENkhD,EAAS,GAsBb,SAASC,IACP,OAAIjnE,IAIFA,EADE,EAAAxoB,EAAOma,SAAW,EAAAna,EAAOma,QAAQqO,SACxB,EAAAxoB,EAAOma,QAAQqO,SACjB,EAAAxoB,EAAO0vF,eACL,EAAA1vF,EAAO0vF,eACT,EAAA1vF,EAAO4mE,aACL,EAAA5mE,EAAO4mE,aAEP,EAAA5mE,EAAOgtC,WAGtB,CACA,SAAS2iD,EAAentD,EAAUC,EAAMyc,EAAYj0D,EAAQm9B,GAC1D,OAAOknE,EAAOM,UACZ,MAAOptD,EAAU,CAAE/+B,KAAM,WAAY,EAAO,CAAC,eAC7CizB,MAAK,SAAU7rC,GACf,OAAOykG,EAAOO,WAAW,CACvBpsF,KAAM,SACNg/B,KAAMA,EACNyc,WAAYA,EACZ1jC,KAAM,CACJ/X,KAAM2kB,IAEPv9B,EAAKI,GAAU,EACpB,IAAGyrC,MAAK,SAAU5kC,GAChB,OAAOrH,EAAOS,KAAK4G,EACrB,GACF,CAaAtI,EAAOD,QAAU,SAAUi5C,EAAUC,EAAMyc,EAAYta,EAAQ5b,EAAQwjB,GAC/C,mBAAXxjB,IACTwjB,EAAWxjB,EACXA,OAASr9B,GAIX,IAAIy8B,EAAOmnE,GADXvmE,EAASA,GAAU,QACS5gB,eAE5B,GAAKggB,GAAkC,mBAAnB,EAAApoB,EAAOuf,QAA3B,CAgBA,GAHAy6C,EAAgB9a,EAAYta,GAC5BpC,EAAWhxC,EAASgxC,EAAU8qB,EAAiB,YAC/C7qB,EAAOjxC,EAASixC,EAAM6qB,EAAiB,QACf,mBAAb9gB,EAAyB,MAAM,IAAIxgD,MAAM,mCApCtD,SAAyBqqC,EAASmW,GAChCnW,EAAQK,MAAK,SAAUpmC,GACrBm/F,KAAc,WACZjjD,EAAS,KAAMl8C,EACjB,GACF,IAAG,SAAUxD,GACX2iG,KAAc,WACZjjD,EAAS1/C,EACX,GACF,GACF,CA4BEgjG,CA3FF,SAAsB1nE,GACpB,GAAI,EAAApoB,EAAOma,UAAY,EAAAna,EAAOma,QAAQ2/C,QACpC,OAAOv6C,QAAQC,SAAQ,GAEzB,IAAK8vE,IAAWA,EAAOM,YAAcN,EAAOO,WAC1C,OAAOtwE,QAAQC,SAAQ,GAEzB,QAAqB7zB,IAAjB6jG,EAAOpnE,GACT,OAAOonE,EAAOpnE,GAGhB,IAAI2nE,EAAOJ,EADXN,EAAWA,GAAY5kG,EAAOU,MAAM,GACDkkG,EAAU,GAAI,IAAKjnE,GACnDsO,MAAK,WACJ,OAAO,CACT,IAAG4rB,OAAM,WACP,OAAO,CACT,IAEF,OADAktC,EAAOpnE,GAAQ2nE,EACRA,CACT,CAwEiBC,CAAY5nE,GAAMsO,MAAK,SAAUu5D,GAC9C,OAAIA,EAAaN,EAAcntD,EAAUC,EAAMyc,EAAYta,EAAQxc,GAE5DqkB,EAAKjK,EAAUC,EAAMyc,EAAYta,EAAQ5b,EAClD,IAAIwjB,EAXJ,MAVEijD,KAAc,WACZ,IAAIn/F,EACJ,IACEA,EAAMm8C,EAAKjK,EAAUC,EAAMyc,EAAYta,EAAQ5b,EACjD,CAAE,MAAOl8B,GACP,OAAO0/C,EAAS1/C,EAClB,CACA0/C,EAAS,KAAMl8C,EACjB,GAcJ,aCrHA,IAAIzE,EAAS,EAAQ,IACjBpB,EAAS,cACT+4B,EAAS,EAAQ,IACjB0sE,EAAY,EAAQ,KACpBC,EAAY,EAAQ,KAEpBC,EAAgB3lG,EAAOS,KAAK,eAAgB,QAC5CmlG,EAAkB,WAIlBC,EAAmB,CAACC,QAAS,SAAYC,OAAQ,UAErD,SAASC,EAAOr2E,GACd7tB,KAAK6tB,SAAWA,GAAYk2E,EAC5B/jG,KAAK+lC,MAAQ,EACb/lC,KAAKU,MAAQ,EACbV,KAAKmkG,YAAc,KACnBnkG,KAAKokG,WAAa,KAClBpkG,KAAKqkG,UAAY,KACjBrkG,KAAKskG,aAAe,EACpBtkG,KAAKukG,kBAAoB,CAC3B,CAoMA,SAASC,EAAWC,EAAOzhE,EAAS1kC,GAElC,IAAIL,EAASC,EAAOW,YApNZ,IAsNRZ,EAAO6mB,cAAcke,EAAS,GAC9B/kC,EAAOqmB,WAAWmgF,EAAM1+D,MAAO,GAE/B,IAAI2+D,EAAcD,EAAM1+D,MAAQ0+D,EAAMF,kBAAoB,EAO1D,OANAtmG,EAAO6mB,cAAc4/E,EAAa,GAClCzmG,EAAO6mB,cAAc2/E,EAAM/jG,MAAO,GAElC+jG,EAAMJ,UAAUjhG,KAAKnF,EAAQ,IAC7BK,EAAI8E,KAAKnF,EAAQ,IAEVA,CACT,CAEA,SAAS0mG,EAASxlG,GAChB,IAAIi9B,EAAMnF,EAAO8uB,WAAW,UAAU1qB,OAAOl8B,GAAKs9B,SAClD,OAAOxF,EAAO8uB,WAAW,aAAa1qB,OAAOe,GAAKK,QACpD,CAtNAp/B,OAAOqiB,eAAewkF,EAAMxmG,UAAW,cAAe,CAAEiiB,IAAK,WAAc,OAAO3f,KAAKskG,YAAa,IACpGjnG,OAAOqiB,eAAewkF,EAAMxmG,UAAW,aAAc,CAAEiiB,IAAK,WAAc,OAAO3f,KAAK4kG,WAAY,IAClGvnG,OAAOqiB,eAAewkF,EAAMxmG,UAAW,aAAc,CAAEiiB,IAAK,WAAc,OAAO3f,KAAK6kG,UAAW,IAEjGxnG,OAAOqiB,eAAewkF,EAAMxmG,UAAW,aAAc,CACnDiiB,IAAK,WACH,OAAO3f,KAAKmkG,WACd,EACAjkF,IAAK,SAAUtiB,GACb0B,EAAOksB,MAAM5tB,EAAMc,OAAQ,GAAI,iCAC/BY,GAA6C,IAAtCskG,EAAUkB,iBAAiBlnG,GAAiB,uBAEnDoC,KAAKmkG,YAAcvmG,EACnBoC,KAAKokG,WAAaR,EAAUmB,gBAAgBnnG,GAAO,GACnDoC,KAAK4kG,YAAcD,EAAQ3kG,KAAKglG,WAChChlG,KAAKskG,aAAetkG,KAAK4kG,YAAY1qF,MAAM,EAAG,GAAG0I,aAAa,EAChE,IAGFvlB,OAAOqiB,eAAewkF,EAAMxmG,UAAW,YAAa,CAClDiiB,IAAK,WACH,OAAO3f,KAAKokG,UACd,EACAlkF,IAAK,SAAUtiB,GACb0B,EAAwB,KAAjB1B,EAAMc,QAAkC,KAAjBd,EAAMc,OAAe,sCACnDY,GAA4C,IAArCskG,EAAUqB,gBAAgBrnG,GAAiB,sBAElDoC,KAAKokG,WAAaR,EAAUsB,iBAAiBtnG,GAAO,GACpDoC,KAAK4kG,YAAcD,EAAQ3kG,KAAKglG,WAChChlG,KAAKskG,aAAetkG,KAAK4kG,YAAY1qF,MAAM,EAAG,GAAG0I,aAAa,GAC9D5iB,KAAKmkG,YAAc,IACrB,IAGF9mG,OAAOqiB,eAAewkF,EAAMxmG,UAAW,qBAAsB,CAC3DiiB,IAAK,WACH,OAAI3f,KAAKmkG,YAAoBR,EAAUr5E,OAAOk6E,EAAUxkG,KAAMA,KAAK6tB,SAASm2E,QAAS9lG,EAAO6hB,OAAO,CAAC7hB,EAAOU,MAAM,EAAG,GAAIoB,KAAK24C,eACjH,IACd,IAGFt7C,OAAOqiB,eAAewkF,EAAMxmG,UAAW,oBAAqB,CAC1DiiB,IAAK,WACH,OAAOgkF,EAAUr5E,OAAOk6E,EAAUxkG,KAAMA,KAAK6tB,SAASo2E,OAAQjkG,KAAKglG,WACrE,IAGFd,EAAMxmG,UAAU0/F,OAAS,SAAUj1E,GACjC,GAAa,MAATA,GAAyB,MAATA,GAAyB,OAATA,GAA0B,OAATA,EACnD,OAAOnoB,KAGT,IAAImlG,EAAUh9E,EAAKjQ,MAAM,KACrBusF,EAAQzkG,KAeZ,OAdAmlG,EAAQj+D,SAAQ,SAAUvmC,EAAGa,GAC3B,GAAU,IAANA,EAAJ,CAKA,IAAI4jG,EAAYzkG,EAAEjC,OAAS,GAA2B,MAApBiC,EAAEA,EAAEjC,OAAS,GAC3C2mG,EAAa3nF,SAAS/c,EAAG,IAC7BrB,EAAO+lG,EAAavB,EAAiB,iBACjCsB,IAAUC,GAAcvB,GAE5BW,EAAQA,EAAMa,YAAYD,EAP1B,MAFE/lG,EAAO,WAAWspB,KAAKjoB,GAAI,kCAU/B,IAEO8jG,CACT,EAEAP,EAAMxmG,UAAU4nG,YAAc,SAAU5kG,GACtC,IAIIya,EAJAoqF,EAAa7kG,GAASojG,EACtB0B,EAActnG,EAAOW,YAAY,GAKrC,GAJA2mG,EAAY1gF,cAAcpkB,EAAO,GAI7B6kG,EAAY,CACdjmG,EAAOU,KAAK24C,WAAY,uCAExB,IAAI8sD,EAAKzlG,KAAK24C,WACV+sD,EAAKxnG,EAAOU,MAAM,EAAG,GACzB6mG,EAAKvnG,EAAO6hB,OAAO,CAAC2lF,EAAID,IAGxBtqF,EAAOjd,EAAO6hB,OAAO,CAAC0lF,EAAID,GAC5B,MAGErqF,EAAOjd,EAAO6hB,OAAO,CAAC/f,KAAKglG,UAAWQ,IAGxC,IAAIn3D,EAAIpX,EAAO+uB,WAAW,SAAUhmD,KAAKqkG,WAAWhpE,OAAOlgB,GAAMshB,SAC7DkpE,EAAKt3D,EAAEn0B,MAAM,EAAG,IAChB0rF,EAAKv3D,EAAEn0B,MAAM,IAEb2rF,EAAK,IAAI3B,EAAMlkG,KAAK6tB,UAGxB,GAAI7tB,KAAK24C,WAEP,IACEktD,EAAGltD,WAAairD,EAAUkC,mBAAmB9lG,KAAK24C,WAAYgtD,EAEhE,CAAE,MAAOvyE,GAEP,OAAOpzB,KAAKslG,YAAY5kG,EAAQ,EAClC,MAKA,IACEmlG,EAAGb,UAAYpB,EAAUmC,kBAAkB/lG,KAAKglG,UAAWW,GAAI,EAEjE,CAAE,MAAOvyE,GAEP,OAAOpzB,KAAKslG,YAAY5kG,EAAQ,EAClC,CAQF,OALAmlG,EAAGxB,UAAYuB,EACfC,EAAG9/D,MAAQ/lC,KAAK+lC,MAAQ,EACxB8/D,EAAGtB,kBAAoBvkG,KAAK0kG,YAC5BmB,EAAGnlG,MAAQA,EAEJmlG,CACT,EAEA3B,EAAMxmG,UAAU4pD,KAAO,SAAUr4B,GAC/B,OAAO20E,EAAUt8C,KAAKr4B,EAAMjvB,KAAK24C,YAAYK,SAC/C,EAEAkrD,EAAMxmG,UAAUggD,OAAS,SAAUzuB,EAAM+pB,GACvC,OAAO4qD,EAAUlmD,OAAOzuB,EAAM+pB,EAAWh5C,KAAKglG,UAChD,EAEAd,EAAMxmG,UAAUsoG,gBAAkB,WAGhC,OAFIhmG,KAAKmkG,aAAaltE,EAAOK,YAAYt3B,KAAKmkG,YAAYzlG,QAAQ0E,KAAKpD,KAAKmkG,aAC5EnkG,KAAKmkG,YAAc,KACZnkG,IACT,EAEAkkG,EAAMxmG,UAAUsH,OAAS,WACvB,MAAO,CACLihG,MAAOjmG,KAAKkmG,mBACZC,KAAMnmG,KAAKomG,kBAEf,EAEAlC,EAAMmC,eAAiB,SAAUC,EAAYz4E,GAC3C,IAAIwgB,EAAIpX,EAAO+uB,WAAW,SAAU69C,GAAexoE,OAAOirE,GAAY7pE,SAClEkpE,EAAKt3D,EAAEn0B,MAAM,EAAG,IAChB0rF,EAAKv3D,EAAEn0B,MAAM,IAEbuqF,EAAQ,IAAIP,EAAMr2E,GAItB,OAHA42E,EAAMJ,UAAYuB,EAClBnB,EAAM9rD,WAAagtD,EAEZlB,CACT,EAEAP,EAAMqC,gBAAkB,SAAUC,EAAW34E,GAG3C,IAAI42E,EAAQ,IAAIP,EADhBr2E,EAAWA,GAAYk2E,GAGnB0C,EAAY9C,EAAUnkE,OAAOgnE,GAE7BxjE,EAAUyjE,EAAU7jF,aAAa,GACrCtjB,EAAO0jC,IAAYnV,EAASm2E,SAAWhhE,IAAYnV,EAASo2E,OAAQ,sDAEpEQ,EAAM1+D,MAAQ0gE,EAAUpkF,UAAU,GAClCoiF,EAAMF,kBAAoBkC,EAAU7jF,aAAa,GACjD6hF,EAAM/jG,MAAQ+lG,EAAU7jF,aAAa,GACrC6hF,EAAMJ,UAAYoC,EAAUvsF,MAAM,GAAI,IAEtC,IAAI5b,EAAMmoG,EAAUvsF,MAAM,IAS1B,OARyB,IAArB5b,EAAI+jB,UAAU,IAChB/iB,EAAO0jC,IAAYnV,EAASm2E,QAAS,oDACrCS,EAAM9rD,WAAar6C,EAAI4b,MAAM,KAE7B5a,EAAO0jC,IAAYnV,EAASo2E,OAAQ,mDACpCQ,EAAMO,UAAY1mG,GAGbmmG,CACT,EAEAP,EAAMh4E,SAAW,SAAUpR,GACzB,OAAOopF,EAAMqC,gBAAgBzrF,EAAImrF,MACnC,EAwBA/B,EAAMJ,gBAAkBA,EACxB7mG,EAAOD,QAAUknG,0BCnOjB,SAAShxC,EAAQp4C,GAAwT,OAAtOo4C,EAArD,mBAAX15C,QAAoD,iBAApBA,OAAO64B,SAAmC,SAAiBv3B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXtB,QAAyBsB,EAAInd,cAAgB6b,QAAUsB,IAAQtB,OAAO9b,UAAY,gBAAkBod,CAAK,EAAYo4C,EAAQp4C,EAAM,CAQ9V,SAAS4rF,EAAgBt+F,GAAwJ,OAAnJs+F,EAAkBrpG,OAAOyc,eAAiBzc,OAAO04B,eAAiB,SAAyB3tB,GAAK,OAAOA,EAAE27B,WAAa1mC,OAAO04B,eAAe3tB,EAAI,EAAUs+F,EAAgBt+F,EAAI,CAI5M,SAASu+F,EAAgBv+F,EAAG2G,GAA+G,OAA1G43F,EAAkBtpG,OAAOyc,gBAAkB,SAAyB1R,EAAG2G,GAAsB,OAAjB3G,EAAE27B,UAAYh1B,EAAU3G,CAAG,EAAUu+F,EAAgBv+F,EAAG2G,EAAI,CAEzK,IAEIzP,EACAyoB,EAHAub,EAAQ,CAAC,EAKb,SAASC,EAAgBtd,EAAMQ,EAASH,GACjCA,IACHA,EAAO7mB,OAWT,IAAI+jC,EAEJ,SAAUC,GAGR,SAASD,EAAUI,EAAMC,EAAMC,GAC7B,IAAIyxB,EAMJ,OA1CN,SAAyBx9B,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAsClJ02D,CAAgBz1D,KAAMwjC,GAEtB+xB,EAtCN,SAAoCzxD,EAAMwT,GAAQ,OAAIA,GAA2B,WAAlB47C,EAAQ57C,IAAsC,mBAATA,EAEpG,SAAgCxT,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyvC,eAAe,6DAAgE,OAAOzvC,CAAM,CAFnB8iG,CAAuB9iG,GAAtCwT,CAA6C,CAsClKuvF,CAA2B7mG,KAAM0mG,EAAgBljE,GAAWlsB,KAAKtX,KAlB7E,SAAoB4jC,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZrd,EACFA,EAEAA,EAAQmd,EAAMC,EAAMC,EAE/B,CAYmFzd,CAAWud,EAAMC,EAAMC,KACtGyxB,EAAMtvC,KAAOA,EACNsvC,CACT,CAEA,OArCJ,SAAmB7xB,EAAUC,GAAc,GAA0B,mBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAI5kC,UAAU,sDAAyD2kC,EAAShmC,UAAYL,OAAOC,OAAOqmC,GAAcA,EAAWjmC,UAAW,CAAEC,YAAa,CAAEC,MAAO8lC,EAAU5lC,UAAU,EAAMC,cAAc,KAAe4lC,GAAYgjE,EAAgBjjE,EAAUC,EAAa,CAyB5XmjE,CAAUtjE,EAAWC,GAYdD,CACT,CAdA,CAcEld,GAEFgd,EAAMrd,GAAQud,CAChB,CAGA,SAASQ,EAAMC,EAAUC,GACvB,GAAIxiC,MAAMC,QAAQsiC,GAAW,CAC3B,IAAI5iC,EAAM4iC,EAASvlC,OAKnB,OAJAulC,EAAWA,EAAS1F,KAAI,SAAU/8B,GAChC,OAAOub,OAAOvb,EAChB,IAEIH,EAAM,EACD,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS/pB,MAAM,EAAG7Y,EAAM,GAAG63B,KAAK,MAAO,SAAW+K,EAAS5iC,EAAM,GAC3F,IAARA,EACF,UAAU0e,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAAI,QAAQlkB,OAAOkkB,EAAS,IAEzE,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOkkB,EAAS,GAEpD,CACE,MAAO,MAAMlkB,OAAOmkB,EAAO,KAAKnkB,OAAOhD,OAAOknB,GAElD,CA6BAV,EAAgB,yBAA0B,qCAAsCxkC,WAChFwkC,EAAgB,wBAAwB,SAAUrsB,EAAM+sB,EAAUjqB,GAIhE,IAAImqB,EA/BmBC,EAwCnB5kC,EA1BYyB,EAAaC,EA4B7B,QAde9B,IAAXE,IAAsBA,EAAS,EAAQ,KAC3CA,EAAuB,iBAAT4X,EAAmB,2BAIT,iBAAb+sB,IAjCYG,EAiCkC,OAAVH,EAhCpCtmB,OAAyB,EAAUymB,KAAmBA,IAiC/DD,EAAa,cACbF,EAAWA,EAAS9hC,QAAQ,QAAS,KAErCgiC,EAAa,UAhCjB,SAAkBljC,EAAKmjC,EAAQC,GAK7B,YAJiBjlC,IAAbilC,GAA0BA,EAAWpjC,EAAIvC,UAC3C2lC,EAAWpjC,EAAIvC,QAGVuC,EAAIioB,UAAUmb,EAAWD,EAAeC,KAAcD,CAC/D,CA+BME,CAASptB,EAAM,aAEjB1X,EAAM,OAAOugB,OAAO7I,EAAM,KAAK6I,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,aACzE,CACL,IAAI/oB,GA/Be,iBAAVha,IACTA,EAAQ,GAGNA,EAAQkjC,GALInjC,EAgCMiW,GA3BUxY,SAGS,IAAhCuC,EAAIwb,QAwBe,IAxBCvb,GAwBmB,WAAb,YACjC1B,EAAM,QAASugB,OAAO7I,EAAM,MAAO6I,OAAO7E,EAAM,KAAK6E,OAAOokB,EAAY,KAAKpkB,OAAOikB,EAAMC,EAAU,QACtG,CAIA,OADAzkC,EAAO,mBAAmBugB,OAAOmzC,EAAQl5C,GAE3C,GAAGjb,WACHwkC,EAAgB,yBAAyB,SAAUrsB,EAAMtZ,GACvD,IAAI4rC,EAAS/tB,UAAU/c,OAAS,QAAsBU,IAAjBqc,UAAU,GAAmBA,UAAU,GAAK,kBACpErc,IAAT2oB,IAAoBA,EAAO,EAAQ,KACvC,IAAIg/E,EAAYh/E,EAAKtkB,QAAQ7F,GAM7B,OAJImpG,EAAUroG,OAAS,MACrBqoG,EAAY,GAAGhnF,OAAOgnF,EAAU7sF,MAAM,EAAG,KAAM,QAG1C,iBAAiB6F,OAAO7I,EAAM,MAAM6I,OAAOypB,EAAQ,eAAezpB,OAAOgnF,EAClF,GAAGhoG,UAAW6a,YACd2pB,EAAgB,4BAA4B,SAAUlrB,EAAOnB,EAAMtZ,GACjE,IAAIsd,EAQJ,OALEA,EADEtd,GAASA,EAAMD,aAAeC,EAAMD,YAAYuZ,KAC3C,eAAe6I,OAAOniB,EAAMD,YAAYuZ,MAExC,QAAQ6I,OAAOmzC,EAAQt1D,IAGzB,YAAYmiB,OAAO1H,EAAO,8BAA+B0H,OAAO7I,EAAM,KAAQ,qBAAqB6I,OAAO7E,EAAM,IACzH,GAAGnc,WACHwkC,EAAgB,oBAAoB,WAClC,IAAK,IAAIvC,EAAOvlB,UAAU/c,OAAQ4zB,EAAO,IAAI5wB,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAC/EnxB,EAAKmxB,GAAQhoC,UAAUgoC,QAGVrkD,IAAXE,IAAsBA,EAAS,EAAQ,KAC3CA,EAAOgzB,EAAK5zB,OAAS,EAAG,0CACxB,IAAIc,EAAM,OACN6B,EAAMixB,EAAK5zB,OAKf,OAJA4zB,EAAOA,EAAKiM,KAAI,SAAUv6B,GACxB,MAAO,IAAK+b,OAAO/b,EAAG,IACxB,IAEQ3C,GACN,KAAK,EACH7B,GAAO,GAAGugB,OAAOuS,EAAK,GAAI,aAC1B,MAEF,KAAK,EACH9yB,GAAO,GAAGugB,OAAOuS,EAAK,GAAI,SAASvS,OAAOuS,EAAK,GAAI,cACnD,MAEF,QACE9yB,GAAO8yB,EAAKpY,MAAM,EAAG7Y,EAAM,GAAG63B,KAAK,MACnC15B,GAAO,SAASugB,OAAOuS,EAAKjxB,EAAM,GAAI,cAI1C,MAAO,GAAG0e,OAAOvgB,EAAK,qBACxB,GAAGT,WACH9B,EAAOD,QAAQsmC,MAAQA,0BC7LvB,IAAI0jE,EAAoB,EAAQ,KAC5BC,EAAsB,EAAQ,KAC9BC,EAAkB,EAAQ,KAC1BC,EAAe,EAAQ,KAE3B,SAASC,EAAYxiE,GACnB,OAAOA,EAAEttB,KAAK+d,KAAKuP,EACrB,CAEA,IAAIyiE,EAAoC,oBAAX7lF,OACzB8lF,EAAoC,oBAAX9tF,OAEzB+tF,EAAiBH,EAAY/pG,OAAOK,UAAUwE,UAE9CovF,EAAc8V,EAAY9pF,OAAO5f,UAAUmd,SAC3C02E,EAAc6V,EAAYrqF,OAAOrf,UAAUmd,SAC3C2sF,EAAeJ,EAAY96E,QAAQ5uB,UAAUmd,SAEjD,GAAIwsF,EACF,IAAII,EAAcL,EAAY5lF,OAAO9jB,UAAUmd,SAGjD,GAAIysF,EACF,IAAII,EAAcN,EAAY5tF,OAAO9b,UAAUmd,SAGjD,SAAS8sF,EAAoB/pG,EAAOgqG,GAClC,GAAqB,iBAAVhqG,EACT,OAAO,EAET,IAEE,OADAgqG,EAAiBhqG,IACV,CACT,CAAE,MAAM2C,GACN,OAAO,CACT,CACF,CA4FA,SAASsnG,EAAcjqG,GACrB,MAAiC,iBAA1B2pG,EAAe3pG,EACxB,CAiBA,SAASkqG,EAAclqG,GACrB,MAAiC,iBAA1B2pG,EAAe3pG,EACxB,CAgBA,SAASmqG,EAAkBnqG,GACzB,MAAiC,qBAA1B2pG,EAAe3pG,EACxB,CAgBA,SAASoqG,EAAkBpqG,GACzB,MAAiC,qBAA1B2pG,EAAe3pG,EACxB,CAUA,SAASqqG,EAAsBrqG,GAC7B,MAAiC,yBAA1B2pG,EAAe3pG,EACxB,CAKA,SAASsqG,EAActqG,GACrB,MAA2B,oBAAhBwc,cAIJ6tF,EAAsBE,QACzBF,EAAsBrqG,GACtBA,aAAiBwc,YACvB,CAGA,SAASguF,EAAmBxqG,GAC1B,MAAiC,sBAA1B2pG,EAAe3pG,EACxB,CAMA,SAASyqG,EAAWzqG,GAClB,MAAwB,oBAAb60C,WAIJ21D,EAAmBD,QACtBC,EAAmBxqG,GACnBA,aAAiB60C,SACvB,CA/LAz1C,EAAQgqG,kBAAoBA,EAC5BhqG,EAAQiqG,oBAAsBA,EAC9BjqG,EAAQmqG,aAAeA,EAkBvBnqG,EAAQ42D,UAdR,SAAmBv7C,GAClB,MAEqB,oBAAZ2a,SACP3a,aAAiB2a,SAGP,OAAV3a,GACiB,iBAAVA,GACe,mBAAfA,EAAM8xB,MACU,mBAAhB9xB,EAAM09C,KAGhB,EAaA/4D,EAAQsrG,kBAVR,SAA2B1qG,GACzB,MAA2B,oBAAhBwc,aAA+BA,YAAYC,OAC7CD,YAAYC,OAAOzc,GAI1BupG,EAAavpG,IACbyqG,EAAWzqG,EAEf,EAOAZ,EAAQurG,aAHR,SAAsB3qG,GACpB,MAAkC,eAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQwrG,oBAHR,SAA6B5qG,GAC3B,MAAkC,sBAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQyrG,cAHR,SAAuB7qG,GACrB,MAAkC,gBAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQ0rG,cAHR,SAAuB9qG,GACrB,MAAkC,gBAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQ2rG,YAHR,SAAqB/qG,GACnB,MAAkC,cAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQ4rG,aAHR,SAAsBhrG,GACpB,MAAkC,eAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQ6rG,aAHR,SAAsBjrG,GACpB,MAAkC,eAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQ8rG,eAHR,SAAwBlrG,GACtB,MAAkC,iBAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQ+rG,eAHR,SAAwBnrG,GACtB,MAAkC,iBAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQgsG,gBAHR,SAAyBprG,GACvB,MAAkC,kBAA3BspG,EAAgBtpG,EACzB,EAMAZ,EAAQisG,iBAHR,SAA0BrrG,GACxB,MAAkC,mBAA3BspG,EAAgBtpG,EACzB,EAMAiqG,EAAcM,QACG,oBAAR/0D,KACPy0D,EAAc,IAAIz0D,KAYpBp2C,EAAQksG,MATR,SAAetrG,GACb,MAAmB,oBAARw1C,MAIJy0D,EAAcM,QACjBN,EAAcjqG,GACdA,aAAiBw1C,IACvB,EAMA00D,EAAcK,QACG,oBAAR30D,KACPs0D,EAAc,IAAIt0D,KAWpBx2C,EAAQixB,MATR,SAAerwB,GACb,MAAmB,oBAAR41C,MAIJs0D,EAAcK,QACjBL,EAAclqG,GACdA,aAAiB41C,IACvB,EAMAu0D,EAAkBI,QACG,oBAAZv0D,SACPm0D,EAAkB,IAAIn0D,SAWxB52C,EAAQmsG,UATR,SAAmBvrG,GACjB,MAAuB,oBAAZg2C,UAIJm0D,EAAkBI,QACrBJ,EAAkBnqG,GAClBA,aAAiBg2C,QACvB,EAMAo0D,EAAkBG,QACG,oBAAZr0D,SACPk0D,EAAkB,IAAIl0D,SAKxB92C,EAAQosG,UAHR,SAAmBxrG,GACjB,OAAOoqG,EAAkBpqG,EAC3B,EAMAqqG,EAAsBE,QACG,oBAAhB/tF,aACP6tF,EAAsB,IAAI7tF,aAW5Bpd,EAAQkrG,cAAgBA,EAKxBE,EAAmBD,QACM,oBAAhB/tF,aACa,oBAAbq4B,UACP21D,EAAmB,IAAI31D,SAAS,IAAIr4B,YAAY,GAAI,EAAG,IAWzDpd,EAAQqrG,WAAaA,EAGrB,IAAIgB,EAAqD,oBAAtBzuF,kBAAoCA,uBAAoBxb,EAC3F,SAASkqG,EAA4B1rG,GACnC,MAAiC,+BAA1B2pG,EAAe3pG,EACxB,CACA,SAAS2rG,EAAoB3rG,GAC3B,YAAqC,IAA1ByrG,SAIwC,IAAxCC,EAA4BnB,UACrCmB,EAA4BnB,QAAUmB,EAA4B,IAAID,IAGjEC,EAA4BnB,QAC/BmB,EAA4B1rG,GAC5BA,aAAiByrG,EACvB,CA4BA,SAASG,EAAe5rG,GACtB,OAAO+pG,EAAoB/pG,EAAO0zF,EACpC,CAGA,SAASmY,EAAe7rG,GACtB,OAAO+pG,EAAoB/pG,EAAO2zF,EACpC,CAGA,SAASmY,EAAgB9rG,GACvB,OAAO+pG,EAAoB/pG,EAAO4pG,EACpC,CAGA,SAASmC,EAAe/rG,GACtB,OAAOypG,GAAmBM,EAAoB/pG,EAAO6pG,EACvD,CAGA,SAASmC,EAAehsG,GACtB,OAAO0pG,GAAmBK,EAAoB/pG,EAAO8pG,EACvD,CAjDA1qG,EAAQusG,oBAAsBA,EAK9BvsG,EAAQ6sG,gBAHR,SAAyBjsG,GACvB,MAAiC,2BAA1B2pG,EAAe3pG,EACxB,EAMAZ,EAAQ8sG,cAHR,SAAuBlsG,GACrB,MAAiC,0BAA1B2pG,EAAe3pG,EACxB,EAMAZ,EAAQ+sG,cAHR,SAAuBnsG,GACrB,MAAiC,0BAA1B2pG,EAAe3pG,EACxB,EAMAZ,EAAQgtG,kBAHR,SAA2BpsG,GACzB,MAAiC,uBAA1B2pG,EAAe3pG,EACxB,EAMAZ,EAAQitG,4BAHR,SAAqCrsG,GACnC,MAAiC,gCAA1B2pG,EAAe3pG,EACxB,EAMAZ,EAAQwsG,eAAiBA,EAKzBxsG,EAAQysG,eAAiBA,EAKzBzsG,EAAQ0sG,gBAAkBA,EAK1B1sG,EAAQ2sG,eAAiBA,EAKzB3sG,EAAQ4sG,eAAiBA,EAWzB5sG,EAAQktG,iBATR,SAA0BtsG,GACxB,OACE4rG,EAAe5rG,IACf6rG,EAAe7rG,IACf8rG,EAAgB9rG,IAChB+rG,EAAe/rG,IACfgsG,EAAehsG,EAEnB,EASAZ,EAAQmtG,iBANR,SAA0BvsG,GACxB,MAA6B,oBAAfic,aACZquF,EAActqG,IACd2rG,EAAoB3rG,GAExB,EAGA,CAAC,UAAW,aAAc,2BAA2BspC,SAAQ,SAAS6E,GACpE1uC,OAAOqiB,eAAe1iB,EAAS+uC,EAAQ,CACrCluC,YAAY,EACZD,MAAO,WACL,MAAM,IAAI6B,MAAMssC,EAAS,gCAC3B,GAEJ,4BC3UA,IAAIyjC,EAAiB,EAAQ,GAAR,GAGjBD,EAFY,EAAQ,GAERD,CAAU,6BAEtB86B,EAAsB,SAAqBxsG,GAC9C,QAAI4xE,GAAkB5xE,GAA0B,iBAAVA,GAAsB4b,OAAO43B,eAAexzC,IAGtD,uBAArB2xE,EAAU3xE,EAClB,EAEIysG,EAAoB,SAAqBzsG,GAC5C,QAAIwsG,EAAoBxsG,IAGP,OAAVA,GACW,iBAAVA,GACiB,iBAAjBA,EAAMc,QACbd,EAAMc,QAAU,GACK,mBAArB6wE,EAAU3xE,IACkB,sBAA5B2xE,EAAU3xE,EAAM0yE,OAClB,EAEIg6B,EAA6B,WAChC,OAAOF,EAAoB3uF,UAC5B,CAFgC,GAIhC2uF,EAAoBC,kBAAoBA,EAExCptG,EAAOD,QAAUstG,EAA4BF,EAAsBC,0BC9BnE,IAAIE,EAA+B,oBAAX/wF,QAA0BA,OAC9CgxF,EAAgB,EAAQ,KAE5BvtG,EAAOD,QAAU,WAChB,MAA0B,mBAAfutG,GACW,mBAAX/wF,QACsB,iBAAtB+wF,EAAW,QACO,iBAAlB/wF,OAAO,QAEXgxF,GACR,oBCRA,IACItwF,EAAQxY,MAAMhE,UAAUwc,MACxBw7B,EAAQr4C,OAAOK,UAAUwE,SAG7BjF,EAAOD,QAAU,SAAcm3B,GAC3B,IAAI1T,EAASzgB,KACb,GAAsB,mBAAXygB,GAJA,sBAIyBi1B,EAAMp+B,KAAKmJ,GAC3C,MAAM,IAAI1hB,UARE,kDAQwB0hB,GAyBxC,IAvBA,IAEIgqF,EAFAn4E,EAAOpY,EAAM5C,KAAKmE,UAAW,GAqB7BivF,EAAcppG,KAAKM,IAAI,EAAG6e,EAAO/hB,OAAS4zB,EAAK5zB,QAC/CisG,EAAY,GACPnpG,EAAI,EAAGA,EAAIkpG,EAAalpG,IAC7BmpG,EAAU3sF,KAAK,IAAMxc,GAKzB,GAFAipG,EAAQl4E,SAAS,SAAU,oBAAsBo4E,EAAUzxE,KAAK,KAAO,4CAA/D3G,EAxBK,WACT,GAAIvyB,gBAAgByqG,EAAO,CACvB,IAAIx1D,EAASx0B,EAAOxB,MAChBjf,KACAsyB,EAAKvS,OAAO7F,EAAM5C,KAAKmE,aAE3B,OAAIpe,OAAO43C,KAAYA,EACZA,EAEJj1C,IACX,CACI,OAAOygB,EAAOxB,MACVkV,EACA7B,EAAKvS,OAAO7F,EAAM5C,KAAKmE,YAGnC,IAUIgF,EAAO/iB,UAAW,CAClB,IAAIuzF,EAAQ,WAAkB,EAC9BA,EAAMvzF,UAAY+iB,EAAO/iB,UACzB+sG,EAAM/sG,UAAY,IAAIuzF,EACtBA,EAAMvzF,UAAY,IACtB,CAEA,OAAO+sG,CACX,0BCjDA,IAAIp1E,EAAO,EAAQ,IAEnBp4B,EAAOD,QAAUq4B,EAAK/d,KAAKib,SAASjb,KAAMja,OAAOK,UAAUwwB,wCCF3D,IAcI08E,EAdAl1D,EAAQr4C,OAAOK,UAAUwE,SACzB2oG,EAAUt4E,SAAS70B,UAAUwE,SAC7B4oG,EAAY,sBACZt7B,EAAiB,EAAQ,GAAR,GACjBx9B,EAAW30C,OAAO04B,eAYtB94B,EAAOD,QAAU,SAA6B2qB,GAC7C,GAAkB,mBAAPA,EACV,OAAO,EAER,GAAImjF,EAAUliF,KAAKiiF,EAAQvzF,KAAKqQ,IAC/B,OAAO,EAER,IAAK6nD,EAEJ,MAAe,+BADL95B,EAAMp+B,KAAKqQ,GAGtB,IAAKqqB,EACJ,OAAO,EAER,QAAiC,IAAtB44D,EAAmC,CAC7C,IAAIG,EA1BiB,WACtB,IAAKv7B,EACJ,OAAO,EAER,IACC,OAAOj9C,SAAS,wBAATA,EACR,CAAE,MAAOhyB,GACT,CACD,CAkBsByqG,GACpBJ,IAAoBG,GAAgB/4D,EAAS+4D,EAC9C,CACA,OAAO/4D,EAASrqB,KAAQijF,CACzB,0BCnCA,IAAI1jE,EAAU,EAAQ,KAClBmoC,EAAuB,EAAQ,KAC/BC,EAAY,EAAQ,IACpBG,EAAO,EAAQ,KAEfF,EAAYD,EAAU,6BACtBE,EAAiB,EAAQ,GAAR,GAEjB/7D,EAA0B,oBAAfrW,WAA6B,EAAAqW,EAASrW,WACjDsyE,EAAcL,IAEdM,EAASL,EAAU,0BACnBM,EAAY,CAAC,EACb75C,EAAiB14B,OAAO04B,eACxBy5C,GAAkBC,GAAQ15C,GAC7BmR,EAAQwoC,GAAa,SAAUG,GAC9B,GAA6B,mBAAlBp8D,EAAEo8D,GAA4B,CACxC,IAAIlzD,EAAM,IAAIlJ,EAAEo8D,GAChB,GAAIr2D,OAAO43B,eAAez0B,EAAK,CAC9B,IAAI0C,EAAQ0W,EAAepZ,GACvBmyD,EAAaW,EAAKpwD,EAAO7F,OAAO43B,aACpC,IAAK09B,EAAY,CAChB,IAAIgB,EAAa/5C,EAAe1W,GAChCyvD,EAAaW,EAAKK,EAAYt2D,OAAO43B,YACtC,CACAw+B,EAAUC,GAAcf,EAAWnvD,GACpC,CACD,CACD,IAGD,IAeIwnF,EAAe,EAAQ,KAE3BlqG,EAAOD,QAAU,SAAyBY,GACzC,QAAKupG,EAAavpG,KACb4xE,GAAoBh2D,OAAO43B,eAAexzC,EAnB3B,SAA2BA,GAC/C,IAAIqtG,GAAY,EAWhB,OAVA/jE,EAAQ0oC,GAAW,SAAUI,EAAQH,GACpC,IAAKo7B,EACJ,IACC,IAAI/zF,EAAO84D,EAAO14D,KAAK1Z,GACnBsZ,IAAS24D,IACZo7B,EAAY/zF,EAEd,CAAE,MAAO3W,GAAI,CAEf,IACO0qG,CACR,CAOQh7B,CAAeryE,GAD0C+xE,EAAOJ,EAAU3xE,GAAQ,GAAI,GAE9F,oBCpDA,IAEIstG,EACAC,EAHAN,EAAUt4E,SAAS70B,UAAUwE,SAC7BkpG,EAAkC,iBAAZj5E,SAAoC,OAAZA,SAAoBA,QAAQlT,MAG9E,GAA4B,mBAAjBmsF,GAAgE,mBAA1B/tG,OAAOqiB,eACvD,IACCwrF,EAAe7tG,OAAOqiB,eAAe,CAAC,EAAG,SAAU,CAClDC,IAAK,WACJ,MAAMwrF,CACP,IAEDA,EAAmB,CAAC,EAEpBC,GAAa,WAAc,MAAM,EAAI,GAAG,KAAMF,EAC/C,CAAE,MAAOh7F,GACJA,IAAMi7F,IACTC,EAAe,KAEjB,MAEAA,EAAe,KAGhB,IAAIC,EAAmB,cACnBC,EAAe,SAA4B1tG,GAC9C,IACC,IAAI2tG,EAAQV,EAAQvzF,KAAK1Z,GACzB,OAAOytG,EAAiBziF,KAAK2iF,EAC9B,CAAE,MAAOhrG,GACR,OAAO,CACR,CACD,EAEIirG,EAAoB,SAA0B5tG,GACjD,IACC,OAAI0tG,EAAa1tG,KACjBitG,EAAQvzF,KAAK1Z,IACN,EACR,CAAE,MAAO2C,GACR,OAAO,CACR,CACD,EACIm1C,EAAQr4C,OAAOK,UAAUwE,SAOzBstE,EAAmC,mBAAXh2D,UAA2BA,OAAO43B,YAE1Dq6D,IAAW,IAAK,CAAC,IAEjBC,EAAQ,WAA8B,OAAO,CAAO,EACxD,GAAwB,iBAAbC,SAAuB,CAEjC,IAAIC,EAAMD,SAASC,IACfl2D,EAAMp+B,KAAKs0F,KAASl2D,EAAMp+B,KAAKq0F,SAASC,OAC3CF,EAAQ,SAA0B9tG,GAGjC,IAAK6tG,IAAW7tG,UAA4B,IAAVA,GAA0C,iBAAVA,GACjE,IACC,IAAIqD,EAAMy0C,EAAMp+B,KAAK1Z,GACrB,OAlBU,+BAmBTqD,GAlBU,qCAmBPA,GAlBO,4BAmBPA,GAxBS,oBAyBTA,IACc,MAAbrD,EAAM,GACZ,CAAE,MAAO2C,GAAU,CAEpB,OAAO,CACR,EAEF,CAEAtD,EAAOD,QAAUouG,EACd,SAAoBxtG,GACrB,GAAI8tG,EAAM9tG,GAAU,OAAO,EAC3B,IAAKA,EAAS,OAAO,EACrB,GAAqB,mBAAVA,GAAyC,iBAAVA,EAAsB,OAAO,EACvE,IACCwtG,EAAaxtG,EAAO,KAAMstG,EAC3B,CAAE,MAAO3qG,GACR,GAAIA,IAAM4qG,EAAoB,OAAO,CACtC,CACA,OAAQG,EAAa1tG,IAAU4tG,EAAkB5tG,EAClD,EACE,SAAoBA,GACrB,GAAI8tG,EAAM9tG,GAAU,OAAO,EAC3B,IAAKA,EAAS,OAAO,EACrB,GAAqB,mBAAVA,GAAyC,iBAAVA,EAAsB,OAAO,EACvE,GAAI4xE,EAAkB,OAAOg8B,EAAkB5tG,GAC/C,GAAI0tG,EAAa1tG,GAAU,OAAO,EAClC,IAAIiuG,EAAWn2D,EAAMp+B,KAAK1Z,GAC1B,QApDY,sBAoDRiuG,GAnDS,+BAmDeA,IAA0B,iBAAmBjjF,KAAKijF,KACvEL,EAAkB5tG,EAC1B,OCpGDX,EAAOD,QAAU,SAAkBwB,GACjC,OAAOA,GAAsB,iBAARA,GACI,mBAAbA,EAAI4E,MACS,mBAAb5E,EAAIS,MACc,mBAAlBT,EAAI6jB,SAClB,0BCCA,SAAS+9E,EAAgBtlF,EAAKxc,EAAKV,GAAiK,OAApJU,KAAOwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAIhN,SAASwlF,EAAkB7/E,EAAQu1B,GAAS,IAAK,IAAIx0C,EAAI,EAAGA,EAAIw0C,EAAMt3C,OAAQ8C,IAAK,CAAE,IAAIstE,EAAa94B,EAAMx0C,GAAIstE,EAAWjxE,WAAaixE,EAAWjxE,aAAc,EAAOixE,EAAW/wE,cAAe,EAAU,UAAW+wE,IAAYA,EAAWhxE,UAAW,GAAMT,OAAOqiB,eAAee,EAAQquD,EAAWxwE,IAAKwwE,EAAa,CAAE,CAI5T,SAAS+3B,EAA2B/iG,EAAMwT,GAAQ,OAAIA,GAA2B,WAAlB47C,EAAQ57C,IAAsC,mBAATA,EAA8CsvF,EAAuB9iG,GAAtCwT,CAA6C,CAEhL,SAASsvF,EAAuB9iG,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyvC,eAAe,6DAAgE,OAAOzvC,CAAM,CAIrK,SAASgoG,EAAiBC,GAAS,IAAI/4B,EAAwB,mBAAR5/B,IAAqB,IAAIA,SAAQh0C,EAA8nB,OAAnnB0sG,EAAmB,SAA0BC,GAAS,GAAc,OAAVA,IAMlIpkF,EANuKokF,GAMjG,IAAzDx5E,SAASrwB,SAASoV,KAAKqQ,GAAIlL,QAAQ,kBAN+H,OAAOsvF,EAMjN,IAA2BpkF,EAN6L,GAAqB,mBAAVokF,EAAwB,MAAM,IAAIhtG,UAAU,sDAAyD,QAAsB,IAAXi0E,EAAwB,CAAE,GAAIA,EAAOg5B,IAAID,GAAQ,OAAO/4B,EAAOrzD,IAAIosF,GAAQ/4B,EAAO9yD,IAAI6rF,EAAOE,EAAU,CAAE,SAASA,IAAY,OAAOC,EAAWH,EAAOtwF,UAAWirF,EAAgB1mG,MAAMrC,YAAc,CAAkJ,OAAhJsuG,EAAQvuG,UAAYL,OAAOC,OAAOyuG,EAAMruG,UAAW,CAAEC,YAAa,CAAEC,MAAOquG,EAASpuG,YAAY,EAAOC,UAAU,EAAMC,cAAc,KAAkB4oG,EAAgBsF,EAASF,EAAQ,EAAUD,EAAiBC,EAAQ,CAItvB,SAASG,EAAWC,EAAQ75E,EAAMy5E,GAAoV,OAAhQG,EAFtH,WAAsC,GAAuB,oBAAZ/5E,UAA4BA,QAAQi6E,UAAW,OAAO,EAAO,GAAIj6E,QAAQi6E,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAV/4D,MAAsB,OAAO,EAAM,IAAiF,OAA3E7L,KAAK/pC,UAAUwE,SAASoV,KAAK6a,QAAQi6E,UAAU3kE,KAAM,IAAI,WAAa,MAAY,CAAM,CAAE,MAAOlnC,GAAK,OAAO,CAAO,CAAE,CAEnR+rG,GAA2Cn6E,QAAQi6E,UAAiC,SAAoBD,EAAQ75E,EAAMy5E,GAAS,IAAI/nG,EAAI,CAAC,MAAOA,EAAEga,KAAKiB,MAAMjb,EAAGsuB,GAAO,IAAsDyF,EAAW,IAA/CxF,SAAS8C,KAAKpW,MAAMktF,EAAQnoG,IAA6F,OAAnD+nG,GAAOpF,EAAgB5uE,EAAUg0E,EAAMruG,WAAmBq6B,CAAU,EAAYm0E,EAAWjtF,MAAM,KAAMxD,UAAY,CAIha,SAASkrF,EAAgBv+F,EAAG2G,GAA+G,OAA1G43F,EAAkBtpG,OAAOyc,gBAAkB,SAAyB1R,EAAG2G,GAAsB,OAAjB3G,EAAE27B,UAAYh1B,EAAU3G,CAAG,EAAUu+F,EAAgBv+F,EAAG2G,EAAI,CAEzK,SAAS23F,EAAgBt+F,GAAwJ,OAAnJs+F,EAAkBrpG,OAAOyc,eAAiBzc,OAAO04B,eAAiB,SAAyB3tB,GAAK,OAAOA,EAAE27B,WAAa1mC,OAAO04B,eAAe3tB,EAAI,EAAUs+F,EAAgBt+F,EAAI,CAE5M,SAAS8qD,EAAQp4C,GAAwT,OAAtOo4C,EAArD,mBAAX15C,QAAoD,iBAApBA,OAAO64B,SAAmC,SAAiBv3B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXtB,QAAyBsB,EAAInd,cAAgB6b,QAAUsB,IAAQtB,OAAO9b,UAAY,gBAAkBod,CAAK,EAAYo4C,EAAQp4C,EAAM,CAE9V,IACIrX,EADW,EAAQ,IACAA,QAGnBqjB,EADY,EAAQ,KACawc,MAAMxc,qBAG3C,SAASwd,EAASrjC,EAAKmjC,EAAQC,GAK7B,YAJiBjlC,IAAbilC,GAA0BA,EAAWpjC,EAAIvC,UAC3C2lC,EAAWpjC,EAAIvC,QAGVuC,EAAIioB,UAAUmb,EAAWD,EAAO1lC,OAAQ2lC,KAAcD,CAC/D,CAkBA,IAAImoE,EAAO,GACPC,EAAQ,GACRrsG,EAAM,GACNssG,EAAQ,GACRC,EAAoB,CACtBx3C,gBAAiB,6CACjBE,YAAa,wCACbu3C,kBAAmB,yDACnB33C,UAAW,4CACXxpC,MAAO,uCACP2pC,mBAAoB,sDACpBE,eAAgB,+CAChBu3C,qBAAsB,6DACtB33C,aAAc,qDACdF,SAAU,8CACV83C,aAAc,6CAMhB,SAASC,EAAU3sD,GACjB,IAAI53B,EAAOlrB,OAAOkrB,KAAK43B,GACnB1/B,EAASpjB,OAAOC,OAAOD,OAAO04B,eAAeoqB,IAOjD,OANA53B,EAAK2e,SAAQ,SAAU5oC,GACrBmiB,EAAOniB,GAAO6hD,EAAO7hD,EACvB,IACAjB,OAAOqiB,eAAee,EAAQ,UAAW,CACvC7iB,MAAOuiD,EAAO15B,UAEThG,CACT,CAEA,SAASssF,EAAaxtG,GAGpB,OAAOkE,EAAQlE,EAAK,CAClBuwC,SAAS,EACTzJ,eAAe,EACfN,MAAO,IACPinE,eAAgB5lF,IAEhB8e,YAAY,EAMZ+mE,YAAa7lF,IAEb8lF,WAAW,EACXC,QAAQ,EAERC,SAAS,GAEb,CA8NA,IAAI15C,EAEJ,SAAU25C,GAGR,SAAS35C,EAAe7nC,GACtB,IAAI0pC,EAIJ,GAxVJ,SAAyBx9B,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAsVpJ02D,CAAgBz1D,KAAM0zD,GAEG,WAArBR,EAAQrnC,IAAqC,OAAZA,EACnC,MAAM,IAAI/E,EAAqB,UAAW,SAAU+E,GAGtD,IAAIpF,EAAUoF,EAAQpF,QAClBguC,EAAW5oC,EAAQ4oC,SACnBC,EAAe7oC,EAAQ6oC,aACvB16C,EAAS6R,EAAQ7R,OACjBiqB,EAAWpY,EAAQoY,SACnB/e,EAAQzlB,MAAM6tG,gBAGlB,GAFA7tG,MAAM6tG,gBAAkB,EAET,MAAX7mF,EACF8uC,EAAQsxC,EAA2B7mG,KAAM0mG,EAAgBhzC,GAAgBp8C,KAAKtX,KAAM+c,OAAO0J,UA0B3F,GAxBImH,QAAQ61C,QAAU71C,QAAQ61C,OAAO8pC,QAG/B3/E,QAAQ61C,QAAU71C,QAAQ61C,OAAO+pC,eAAoD,IAAnC5/E,QAAQ61C,OAAO+pC,iBACnEjB,EAAO,QACPC,EAAQ,QACRC,EAAQ,QACRtsG,EAAM,UAENosG,EAAO,GACPC,EAAQ,GACRC,EAAQ,GACRtsG,EAAM,KAOc,WAApB+yD,EAAQl5C,IAAmC,OAAXA,GAAyC,WAAtBk5C,EAAQjvB,IAAuC,OAAbA,GAAqB,UAAWjqB,GAAUA,aAAkBva,OAAS,UAAWwkC,GAAYA,aAAoBxkC,QACvMua,EAAS8yF,EAAU9yF,GACnBiqB,EAAW6oE,EAAU7oE,IAGN,oBAAbwwB,GAA+C,gBAAbA,EACpCc,EAAQsxC,EAA2B7mG,KAAM0mG,EAAgBhzC,GAAgBp8C,KAAKtX,KA9QtF,SAAuBga,EAAQiqB,EAAUwwB,GACvC,IAAIqpB,EAAQ,GACRv4E,EAAM,GACNkoG,EAAU,EACVtsG,EAAM,GACNusG,GAAU,EACVC,EAAkBZ,EAAa/yF,GAC/B4zF,EAAcD,EAAgBz1F,MAAM,MACpC21F,EAAgBd,EAAa9oE,GAAU/rB,MAAM,MAC7C1W,EAAI,EACJssG,EAAY,GAShB,GANiB,gBAAbr5C,GAAkD,WAApBvB,EAAQl5C,IAA8C,WAAtBk5C,EAAQjvB,IAAqC,OAAXjqB,GAAgC,OAAbiqB,IACrHwwB,EAAW,qBAKc,IAAvBm5C,EAAYlvG,QAAyC,IAAzBmvG,EAAcnvG,QAAgBkvG,EAAY,KAAOC,EAAc,GAAI,CACjG,IAAIE,EAAcH,EAAY,GAAGlvG,OAASmvG,EAAc,GAAGnvG,OAI3D,GAAIqvG,GA9Dc,IA+DhB,KAAyB,WAApB76C,EAAQl5C,IAAmC,OAAXA,GAA2C,WAAtBk5C,EAAQjvB,IAAuC,OAAbA,GAAkC,IAAXjqB,GAA6B,IAAbiqB,GAEjI,MAAO,GAAGlkB,OAAO2sF,EAAkBj4C,GAAW,QAAU,GAAG10C,OAAO6tF,EAAY,GAAI,SAAS7tF,OAAO8tF,EAAc,GAAI,WAEjH,GAAiB,sBAAbp5C,GAMLs5C,GAFYngF,QAAQ61C,QAAU71C,QAAQ61C,OAAO8pC,MAAQ3/E,QAAQ61C,OAAOuqC,QAAU,IAErD,CAC3B,KAAOJ,EAAY,GAAGpsG,KAAOqsG,EAAc,GAAGrsG,IAC5CA,IAIEA,EAAI,IAGNssG,EAAY,OAAO/tF,OApH7B,SAAgB9e,EAAK4zB,GAEnB,GADAA,EAAQvzB,KAAKylB,MAAM8N,GACD,GAAd5zB,EAAIvC,QAAwB,GAATm2B,EAAY,MAAO,GAC1C,IAAIo5E,EAAWhtG,EAAIvC,OAASm2B,EAG5B,IAFAA,EAAQvzB,KAAKylB,MAAMzlB,KAAKwnC,IAAIjU,GAASvzB,KAAKwnC,IAAI,IAEvCjU,GACL5zB,GAAOA,EACP4zB,IAIF,OADA5zB,EAAOA,EAAIioB,UAAU,EAAG+kF,EAAWhtG,EAAIvC,OAEzC,CAuGoC68D,CAAO,IAAK/5D,GAAI,KAC1CA,EAAI,EAER,CAEJ,CAOA,IAHA,IAAIwC,EAAI4pG,EAAYA,EAAYlvG,OAAS,GACrCuF,EAAI4pG,EAAcA,EAAcnvG,OAAS,GAEtCsF,IAAMC,IACPzC,IAAM,EACRL,EAAM,OAAO4e,OAAO/b,GAAG+b,OAAO5e,GAE9B28E,EAAQ95E,EAGV4pG,EAAYj3E,MACZk3E,EAAcl3E,MACa,IAAvBi3E,EAAYlvG,QAAyC,IAAzBmvG,EAAcnvG,SAC9CsF,EAAI4pG,EAAYA,EAAYlvG,OAAS,GACrCuF,EAAI4pG,EAAcA,EAAcnvG,OAAS,GAG3C,IAAIwvG,EAAW5sG,KAAKM,IAAIgsG,EAAYlvG,OAAQmvG,EAAcnvG,QAG1D,GAAiB,IAAbwvG,EAAgB,CAElB,IAAIC,EAAeR,EAAgBz1F,MAAM,MAIzC,GAAIi2F,EAAazvG,OAAS,GAGxB,IAFAyvG,EAAa,IAAM,GAAGpuF,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GAE1C0B,EAAazvG,OAAS,IAC3ByvG,EAAax3E,MAIjB,MAAO,GAAG5W,OAAO2sF,EAAkBG,aAAc,QAAQ9sF,OAAOouF,EAAaj1E,KAAK,MAAO,KAC3F,CAEI13B,EAAI,IACNL,EAAM,KAAK4e,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GAAO1sF,OAAO5e,GACpDusG,GAAU,GAGE,KAAV5vB,IACF38E,EAAM,OAAO4e,OAAO+9D,GAAO/9D,OAAO5e,GAClC28E,EAAQ,IAGV,IAAIswB,EAAe,EACf5uG,EAAMktG,EAAkBj4C,GAAY,KAAK10C,OAAOysF,EAAO,YAAYzsF,OAAO0sF,EAAO,KAAK1sF,OAAO5f,EAAK,cAAc4f,OAAO0sF,GACvH4B,EAAa,IAAItuF,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,EAAO,kBAEvD,IAAKjrG,EAAI,EAAGA,EAAI0sG,EAAU1sG,IAAK,CAE7B,IAAIwmC,EAAMxmC,EAAIisG,EAEd,GAAIG,EAAYlvG,OAAS8C,EAAI,EAIvBwmC,EAAM,GAAKxmC,EAAI,IACbwmC,EAAM,GACRziC,GAAO,KAAKwa,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GACvCiB,GAAU,GACD1lE,EAAM,IACfziC,GAAO,OAAOwa,OAAO8tF,EAAcrsG,EAAI,IACvC4sG,KAGF7oG,GAAO,OAAOwa,OAAO8tF,EAAcrsG,EAAI,IACvC4sG,KAIFX,EAAUjsG,EAEVs8E,GAAS,KAAK/9D,OAAO5f,EAAK,KAAK4f,OAAO0sF,EAAO,KAAK1sF,OAAO8tF,EAAcrsG,IACvE4sG,SACK,GAAIP,EAAcnvG,OAAS8C,EAAI,EAIhCwmC,EAAM,GAAKxmC,EAAI,IACbwmC,EAAM,GACRziC,GAAO,KAAKwa,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GACvCiB,GAAU,GACD1lE,EAAM,IACfziC,GAAO,OAAOwa,OAAO6tF,EAAYpsG,EAAI,IACrC4sG,KAGF7oG,GAAO,OAAOwa,OAAO6tF,EAAYpsG,EAAI,IACrC4sG,KAIFX,EAAUjsG,EAEV+D,GAAO,KAAKwa,OAAOysF,EAAO,KAAKzsF,OAAO0sF,EAAO,KAAK1sF,OAAO6tF,EAAYpsG,IACrE4sG,QACK,CACL,IAAIE,EAAeT,EAAcrsG,GAC7B+sG,EAAaX,EAAYpsG,GAIzBgtG,EAAiBD,IAAeD,KAAkBhqE,EAASiqE,EAAY,MAAQA,EAAWr0F,MAAM,GAAI,KAAOo0F,GAU3GE,GAAkBlqE,EAASgqE,EAAc,MAAQA,EAAap0F,MAAM,GAAI,KAAOq0F,IACjFC,GAAiB,EACjBD,GAAc,KAGZC,GAIExmE,EAAM,GAAKxmC,EAAI,IACbwmC,EAAM,GACRziC,GAAO,KAAKwa,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GACvCiB,GAAU,GACD1lE,EAAM,IACfziC,GAAO,OAAOwa,OAAO6tF,EAAYpsG,EAAI,IACrC4sG,KAGF7oG,GAAO,OAAOwa,OAAO6tF,EAAYpsG,EAAI,IACrC4sG,KAIFX,EAAUjsG,EAGV+D,GAAO,KAAKwa,OAAOysF,EAAO,KAAKzsF,OAAO0sF,EAAO,KAAK1sF,OAAOwuF,GACzDzwB,GAAS,KAAK/9D,OAAO5f,EAAK,KAAK4f,OAAO0sF,EAAO,KAAK1sF,OAAOuuF,GACzDF,GAAgB,IAIhB7oG,GAAOu4E,EACPA,EAAQ,GAGI,IAAR91C,GAAmB,IAANxmC,IACf+D,GAAO,OAAOwa,OAAOwuF,GACrBH,KAGN,CAGA,GAAIA,EAAe,IAAM5sG,EAAI0sG,EAAW,EACtC,MAAO,GAAGnuF,OAAOvgB,GAAKugB,OAAOsuF,EAAY,MAAMtuF,OAAOxa,EAAK,MAAMwa,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GAAO1sF,OAAO+9D,EAAO,MAAQ,GAAG/9D,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,EAE3J,CAEA,MAAO,GAAG1sF,OAAOvgB,GAAKugB,OAAO2tF,EAAUW,EAAa,GAAI,MAAMtuF,OAAOxa,GAAKwa,OAAO+9D,GAAO/9D,OAAO5e,GAAK4e,OAAO+tF,EAC7G,CAoD4FW,CAAcz0F,EAAQiqB,EAAUwwB,UAC/G,GAAiB,uBAAbA,GAAkD,mBAAbA,EAA+B,CAG7E,IAAI50D,EAAO6sG,EAAkBj4C,GACzBlvD,EAAMwnG,EAAa/yF,GAAQ9B,MAAM,MAQrC,GANiB,mBAAbu8C,GAAqD,WAApBvB,EAAQl5C,IAAmC,OAAXA,IACnEna,EAAO6sG,EAAkBE,sBAKvBrnG,EAAI7G,OAAS,GAGf,IAFA6G,EAAI,IAAM,GAAGwa,OAAOwsF,EAAM,OAAOxsF,OAAO0sF,GAEjClnG,EAAI7G,OAAS,IAClB6G,EAAIoxB,MAMN4+B,EADiB,IAAfhwD,EAAI7G,OACEmoG,EAA2B7mG,KAAM0mG,EAAgBhzC,GAAgBp8C,KAAKtX,KAAM,GAAG+f,OAAOlgB,EAAM,KAAKkgB,OAAOxa,EAAI,MAE5GshG,EAA2B7mG,KAAM0mG,EAAgBhzC,GAAgBp8C,KAAKtX,KAAM,GAAG+f,OAAOlgB,EAAM,QAAQkgB,OAAOxa,EAAI2zB,KAAK,MAAO,OAEvI,KAAO,CACL,IAAIw1E,EAAO3B,EAAa/yF,GAEpB8jE,EAAQ,GACR6wB,EAAiBjC,EAAkBj4C,GAEtB,iBAAbA,GAA4C,aAAbA,GACjCi6C,EAAO,GAAG3uF,OAAO2sF,EAAkBj4C,GAAW,QAAQ10C,OAAO2uF,IAEpDhwG,OAAS,OAChBgwG,EAAO,GAAG3uF,OAAO2uF,EAAKx0F,MAAM,EAAG,MAAO,SAGxC4jE,EAAQ,GAAG/9D,OAAOgtF,EAAa9oE,IAE3ByqE,EAAKhwG,OAAS,MAChBgwG,EAAO,GAAG3uF,OAAO2uF,EAAKx0F,MAAM,EAAG,KAAM,QAGnC4jE,EAAMp/E,OAAS,MACjBo/E,EAAQ,GAAG/9D,OAAO+9D,EAAM5jE,MAAM,EAAG,KAAM,QAGxB,cAAbu6C,GAAyC,UAAbA,EAC9Bi6C,EAAO,GAAG3uF,OAAO4uF,EAAgB,QAAQ5uF,OAAO2uF,EAAM,wBAEtD5wB,EAAQ,IAAI/9D,OAAO00C,EAAU,KAAK10C,OAAO+9D,IAI7CvoB,EAAQsxC,EAA2B7mG,KAAM0mG,EAAgBhzC,GAAgBp8C,KAAKtX,KAAM,GAAG+f,OAAO2uF,GAAM3uF,OAAO+9D,IAC7G,CAyBF,OAtBAr+E,MAAM6tG,gBAAkBpoF,EACxBqwC,EAAMf,kBAAoB/tC,EAC1BppB,OAAOqiB,eAAeknF,EAAuBrxC,GAAQ,OAAQ,CAC3D33D,MAAO,iCACPC,YAAY,EACZC,UAAU,EACVC,cAAc,IAEhBw3D,EAAMtvC,KAAO,gBACbsvC,EAAMv7C,OAASA,EACfu7C,EAAMtxB,SAAWA,EACjBsxB,EAAMd,SAAWA,EAEbh1D,MAAMutB,mBAERvtB,MAAMutB,kBAAkB45E,EAAuBrxC,GAAQb,GAIzDa,EAAM/uC,MAEN+uC,EAAMr+C,KAAO,iBACN2vF,EAA2BtxC,EACpC,CAhdF,IAAsBC,EAAairC,EAqejC,OA/dF,SAAmB/8D,EAAUC,GAAc,GAA0B,mBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAI5kC,UAAU,sDAAyD2kC,EAAShmC,UAAYL,OAAOC,OAAOqmC,GAAcA,EAAWjmC,UAAW,CAAEC,YAAa,CAAEC,MAAO8lC,EAAU5lC,UAAU,EAAMC,cAAc,KAAe4lC,GAAYgjE,EAAgBjjE,EAAUC,EAAa,CAuU9XmjE,CAAUpzC,EAAgB25C,GA7UN73C,EAkdP9B,EAldoB+sC,EAkdJ,CAAC,CAC5BniG,IAAK,WACLV,MAAO,WACL,MAAO,GAAGmiB,OAAO/f,KAAKkX,KAAM,MAAM6I,OAAO/f,KAAKimB,KAAM,OAAOlG,OAAO/f,KAAKymB,QACzE,GACC,CACDnoB,IAAKmF,EAAQsmC,OACbnsC,MAAO,SAAe+oC,EAActxB,GAKlC,OAAO5R,EAAQzD,KAterB,SAAuBygB,GAAU,IAAK,IAAIjf,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK,CAAE,IAAI2+C,EAAyB,MAAhB1kC,UAAUja,GAAaia,UAAUja,GAAK,CAAC,EAAOgxB,EAAUn1B,OAAOkrB,KAAK43B,GAAqD,mBAAjC9iD,OAAOo1B,wBAAwCD,EAAUA,EAAQzS,OAAO1iB,OAAOo1B,sBAAsB0tB,GAAQjC,QAAO,SAAU93B,GAAO,OAAO/oB,OAAOonC,yBAAyB0b,EAAQ/5B,GAAKvoB,UAAY,MAAO20B,EAAQ0U,SAAQ,SAAU5oC,GAAO8hG,EAAgB3/E,EAAQniB,EAAK6hD,EAAO7hD,GAAO,GAAI,CAAE,OAAOmiB,CAAQ,CAserc0/E,CAAc,CAAC,EAAG9qF,EAAK,CAC1CgxB,eAAe,EACfN,MAAO,IAEX,IAle8D06D,GAAYH,EAAkB9qC,EAAY93D,UAAW+iG,GAqe9G/sC,CACT,CA1JA,CA0JEo4C,EAAiBrsG,QAEnBxC,EAAOD,QAAU02D,oBC7ejB,SAASI,EAAOrzC,EAAQmuF,GACtB,GAAInuF,QACF,MAAM,IAAI1hB,UAAU,2CAItB,IADA,IAAI4+E,EAAKtgF,OAAOojB,GACPjf,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK,CACzC,IAAIqtG,EAAapzF,UAAUja,GAC3B,GAAIqtG,QAKJ,IADA,IAAIC,EAAYzxG,OAAOkrB,KAAKlrB,OAAOwxG,IAC1BE,EAAY,EAAG1tG,EAAMytG,EAAUpwG,OAAQqwG,EAAY1tG,EAAK0tG,IAAa,CAC5E,IAAIC,EAAUF,EAAUC,GACpB7mE,EAAO7qC,OAAOonC,yBAAyBoqE,EAAYG,QAC1C5vG,IAAT8oC,GAAsBA,EAAKrqC,aAC7B8/E,EAAGqxB,GAAWH,EAAWG,GAE7B,CACF,CACA,OAAOrxB,CACT,CAaA1gF,EAAOD,QAAU,CACf82D,OAAQA,EACRsc,SAbF,WACO/yE,OAAOy2D,QACVz2D,OAAOqiB,eAAeriB,OAAQ,SAAU,CACtCQ,YAAY,EACZE,cAAc,EACdD,UAAU,EACVF,MAAOk2D,GAGb,2BCtCA,IAAI55C,EAAQxY,MAAMhE,UAAUwc,MACxBm2D,EAAS,EAAQ,KAEjB4+B,EAAW5xG,OAAOkrB,KAClB2mF,EAAWD,EAAW,SAAc7mG,GAAK,OAAO6mG,EAAS7mG,EAAI,EAAI,EAAQ,KAEzE+mG,EAAe9xG,OAAOkrB,KAE1B2mF,EAAS/+B,KAAO,WACf,GAAI9yE,OAAOkrB,KAAM,CAChB,IAAI6mF,EAA0B,WAE7B,IAAI98E,EAAOj1B,OAAOkrB,KAAK9M,WACvB,OAAO6W,GAAQA,EAAK5zB,SAAW+c,UAAU/c,MAC1C,CAJ6B,CAI3B,EAAG,GACA0wG,IACJ/xG,OAAOkrB,KAAO,SAAcD,GAC3B,OAAI+nD,EAAO/nD,GACH6mF,EAAaj1F,EAAM5C,KAAKgR,IAEzB6mF,EAAa7mF,EACrB,EAEF,MACCjrB,OAAOkrB,KAAO2mF,EAEf,OAAO7xG,OAAOkrB,MAAQ2mF,CACvB,EAEAjyG,EAAOD,QAAUkyG,0BC7BjB,IAAIA,EACJ,IAAK7xG,OAAOkrB,KAAM,CAEjB,IAAIyjF,EAAM3uG,OAAOK,UAAUwwB,eACvBwnB,EAAQr4C,OAAOK,UAAUwE,SACzBmuE,EAAS,EAAQ,KACjBg/B,EAAehyG,OAAOK,UAAUmxE,qBAChCygC,GAAkBD,EAAa/3F,KAAK,CAAEpV,SAAU,MAAQ,YACxDqtG,EAAkBF,EAAa/3F,MAAK,WAAa,GAAG,aACpDk4F,EAAY,CACf,WACA,iBACA,UACA,iBACA,gBACA,uBACA,eAEGC,EAA6B,SAAUrnG,GAC1C,IAAI7K,EAAO6K,EAAEzK,YACb,OAAOJ,GAAQA,EAAKG,YAAc0K,CACnC,EACIsnG,EAAe,CAClBC,mBAAmB,EACnBC,UAAU,EACVC,WAAW,EACXC,QAAQ,EACRC,eAAe,EACfC,SAAS,EACTC,cAAc,EACdC,aAAa,EACbC,wBAAwB,EACxBC,uBAAuB,EACvBC,cAAc,EACdC,aAAa,EACbC,cAAc,EACdC,cAAc,EACdC,SAAS,EACTC,aAAa,EACbC,YAAY,EACZC,UAAU,EACVC,UAAU,EACVC,OAAO,EACPC,kBAAkB,EAClBC,oBAAoB,EACpBC,SAAS,GAENC,EAA4B,WAE/B,GAAsB,oBAAX5wG,OAA0B,OAAO,EAC5C,IAAK,IAAI8D,KAAK9D,OACb,IACC,IAAKovG,EAAa,IAAMtrG,IAAM4nG,EAAI10F,KAAKhX,OAAQ8D,IAAoB,OAAd9D,OAAO8D,IAAoC,iBAAd9D,OAAO8D,GACxF,IACCqrG,EAA2BnvG,OAAO8D,GACnC,CAAE,MAAO7D,GACR,OAAO,CACR,CAEF,CAAE,MAAOA,GACR,OAAO,CACR,CAED,OAAO,CACR,CAjB+B,GA8B/B2uG,EAAW,SAAc5mF,GACxB,IAAIyF,EAAsB,OAAXzF,GAAqC,iBAAXA,EACrCse,EAAoC,sBAAvB8O,EAAMp+B,KAAKgR,GACxB6oF,EAAc9gC,EAAO/nD,GACrBiE,EAAWwB,GAAmC,oBAAvB2nB,EAAMp+B,KAAKgR,GAClC8oF,EAAU,GAEd,IAAKrjF,IAAa6Y,IAAeuqE,EAChC,MAAM,IAAIpyG,UAAU,sCAGrB,IAAIsyG,EAAY9B,GAAmB3oE,EACnC,GAAIra,GAAYjE,EAAO5pB,OAAS,IAAMstG,EAAI10F,KAAKgR,EAAQ,GACtD,IAAK,IAAI9mB,EAAI,EAAGA,EAAI8mB,EAAO5pB,SAAU8C,EACpC4vG,EAAQpzF,KAAKjB,OAAOvb,IAItB,GAAI2vG,GAAe7oF,EAAO5pB,OAAS,EAClC,IAAK,IAAI8D,EAAI,EAAGA,EAAI8lB,EAAO5pB,SAAU8D,EACpC4uG,EAAQpzF,KAAKjB,OAAOva,SAGrB,IAAK,IAAI0U,KAAQoR,EACV+oF,GAAsB,cAATn6F,IAAyB80F,EAAI10F,KAAKgR,EAAQpR,IAC5Dk6F,EAAQpzF,KAAKjB,OAAO7F,IAKvB,GAAIo4F,EAGH,IAFA,IAAIgC,EA3CqC,SAAUlpG,GAEpD,GAAsB,oBAAX9H,SAA2B4wG,EACrC,OAAOzB,EAA2BrnG,GAEnC,IACC,OAAOqnG,EAA2BrnG,EACnC,CAAE,MAAO7H,GACR,OAAO,CACR,CACD,CAiCwBgxG,CAAqCjpF,GAElDlkB,EAAI,EAAGA,EAAIorG,EAAU9wG,SAAU0F,EACjCktG,GAAoC,gBAAjB9B,EAAUprG,KAAyB4nG,EAAI10F,KAAKgR,EAAQknF,EAAUprG,KACtFgtG,EAAQpzF,KAAKwxF,EAAUprG,IAI1B,OAAOgtG,CACR,CACD,CACAn0G,EAAOD,QAAUkyG,0BCvHjB,IAEI71D,EAFe,EAAQ,GAELJ,CAAa,2BAA2B,GAE1DrD,EAAyB,WAC5B,GAAIyD,EACH,IAEC,OADAA,EAAgB,CAAC,EAAG,IAAK,CAAEz7C,MAAO,KAC3B,CACR,CAAE,MAAO2C,GAER,OAAO,CACR,CAED,OAAO,CACR,EAEAq1C,EAAuB47D,wBAA0B,WAEhD,IAAK57D,IACJ,OAAO,KAER,IACC,OAA8D,IAAvDyD,EAAgB,GAAI,SAAU,CAAEz7C,MAAO,IAAKc,MACpD,CAAE,MAAO6B,GAER,OAAO,CACR,CACD,EAEAtD,EAAOD,QAAU44C,0BC9BjB,IAAIs6B,EAAc,EAAQ,KACtBhzE,EAAS,EAAQ,IAErBD,EAAOD,QAAU,WAChB,IAAIozE,EAAWF,IAMf,OALAhzE,EAAOG,OAAQ,CAAE22D,GAAIoc,GAAY,CAChCpc,GAAI,WACH,OAAO32D,OAAO22D,KAAOoc,CACtB,IAEMA,CACR,0BCTA,SAASqhC,EAAe90F,EAAKnb,GAAK,OAMlC,SAAyBmb,GAAO,GAAIjb,MAAMC,QAAQgb,GAAM,OAAOA,CAAK,CAN3B+0F,CAAgB/0F,IAIzD,SAA+BA,EAAKnb,GAAK,IAAIwf,EAAO,GAAQ2wF,GAAK,EAAU/uD,GAAK,EAAWiC,OAAKzlD,EAAW,IAAM,IAAK,IAAiCwyG,EAA7BC,EAAKl1F,EAAInD,OAAO64B,cAAmBs/D,GAAMC,EAAKC,EAAGp5F,QAAQqlB,QAAoB9c,EAAKhD,KAAK4zF,EAAGh0G,QAAY4D,GAAKwf,EAAKtiB,SAAW8C,GAA3DmwG,GAAK,GAAkE,CAAE,MAAOv+E,GAAOwvB,GAAK,EAAMiC,EAAKzxB,CAAK,CAAE,QAAU,IAAWu+E,GAAsB,MAAhBE,EAAW,QAAWA,EAAW,QAAK,CAAE,QAAU,GAAIjvD,EAAI,MAAMiC,CAAI,CAAE,CAAE,OAAO7jC,CAAM,CAJvV8wF,CAAsBn1F,EAAKnb,IAE5F,WAA8B,MAAM,IAAIzC,UAAU,uDAAyD,CAFTgzG,EAAoB,CAQtH,SAAS7+C,EAAQp4C,GAAwT,OAAtOo4C,EAArD,mBAAX15C,QAAoD,iBAApBA,OAAO64B,SAAmC,SAAiBv3B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXtB,QAAyBsB,EAAInd,cAAgB6b,QAAUsB,IAAQtB,OAAO9b,UAAY,gBAAkBod,CAAK,EAAYo4C,EAAQp4C,EAAM,CAE9V,IAAIk3F,OAAqC5yG,IAAf,KAAKq0B,MAE3Bw+E,EAAe,SAAsB/xF,GACvC,IAAI3E,EAAQ,GAIZ,OAHA2E,EAAIgnB,SAAQ,SAAUtpC,GACpB,OAAO2d,EAAMyC,KAAKpgB,EACpB,IACO2d,CACT,EAEI22F,EAAe,SAAsB3zE,GACvC,IAAIhjB,EAAQ,GAIZ,OAHAgjB,EAAI2I,SAAQ,SAAUtpC,EAAOU,GAC3B,OAAOid,EAAMyC,KAAK,CAAC1f,EAAKV,GAC1B,IACO2d,CACT,EAEIw4C,EAAW12D,OAAO22D,GAAK32D,OAAO22D,GAAK,EAAQ,KAC3Cm+C,EAA8B90G,OAAOo1B,sBAAwBp1B,OAAOo1B,sBAAwB,WAC9F,MAAO,EACT,EACIxX,EAAcqC,OAAOsV,MAAQtV,OAAOsV,MAAQ,EAAQ,KAExD,SAASw0E,EAAYxiE,GACnB,OAAOA,EAAEttB,KAAK+d,KAAKuP,EACrB,CAEA,IAAI1W,EAAiBk5E,EAAY/pG,OAAOK,UAAUwwB,gBAC9C2gD,EAAuBu4B,EAAY/pG,OAAOK,UAAUmxE,sBACpDxmC,EAAiB++D,EAAY/pG,OAAOK,UAAUwE,UAE9CyxD,EAAiB,YACjBw2C,EAAmBx2C,EAAew2C,iBAClC7B,EAAoB30C,EAAe20C,kBACnC9gE,EAASmsB,EAAensB,OACxB0hE,EAAQv1C,EAAeu1C,MACvB3hE,EAAWosB,EAAepsB,SAC1BtZ,EAAQ0lC,EAAe1lC,MACvB0a,EAAgBgrB,EAAehrB,cAC/BuhE,EAAmBv2C,EAAeu2C,iBAClCV,EAAiB71C,EAAe61C,eAChCC,EAAiB91C,EAAe81C,eAChCC,EAAkB/1C,EAAe+1C,gBACjCC,EAAiBh2C,EAAeg2C,eAChCC,EAAiBj2C,EAAei2C,eAChCd,EAAiBn1C,EAAem1C,eAChCC,EAAiBp1C,EAAeo1C,eAEpC,SAASqJ,EAAW9zG,GAClB,GAAmB,IAAfA,EAAII,QAAgBJ,EAAII,OAAS,GAAI,OAAO,EAEhD,IAAK,IAAI8C,EAAI,EAAGA,EAAIlD,EAAII,OAAQ8C,IAAK,CACnC,IAAIykB,EAAO3nB,EAAIsC,WAAWY,GAC1B,GAAIykB,EAAO,IAAMA,EAAO,GAAI,OAAO,CACrC,CAGA,OAAsB,KAAf3nB,EAAII,QAAiBJ,GAAOgD,KAAK6B,IAAI,EAAG,GACjD,CAEA,SAASkvG,EAAyBz0G,GAChC,OAAOP,OAAOkrB,KAAK3qB,GAAOsgD,OAAOk0D,GAAYryF,OAAOoyF,EAA4Bv0G,GAAOsgD,OAAO7gD,OAAOK,UAAUmxE,qBAAqBx5C,KAAKz3B,IAC3I,CAWA,SAASkiB,EAAQ9b,EAAGC,GAClB,GAAID,IAAMC,EACR,OAAO,EAMT,IAHA,IAAIuJ,EAAIxJ,EAAEtF,OACN+O,EAAIxJ,EAAEvF,OAED8C,EAAI,EAAGH,EAAMC,KAAKC,IAAIiM,EAAGC,GAAIjM,EAAIH,IAAOG,EAC/C,GAAIwC,EAAExC,KAAOyC,EAAEzC,GAAI,CACjBgM,EAAIxJ,EAAExC,GACNiM,EAAIxJ,EAAEzC,GACN,KACF,CAGF,OAAIgM,EAAIC,GACE,EAGNA,EAAID,EACC,EAGF,CACT,CAEA,IAGI8kG,EAAc,EACdC,EAAW,EACXC,EAAS,EACTC,EAAS,EAsEb,SAASC,EAAeC,EAAMC,EAAMr8C,EAAQs8C,GAE1C,GAAIF,IAASC,EACX,OAAa,IAATD,IACGp8C,GAASxC,EAAS4+C,EAAMC,GAIjC,GAAIr8C,EAAQ,CACV,GAAsB,WAAlBrD,EAAQy/C,GACV,MAAuB,iBAATA,GAAqB13F,EAAY03F,IAAS13F,EAAY23F,GAGtE,GAAsB,WAAlB1/C,EAAQ0/C,IAA+B,OAATD,GAA0B,OAATC,EACjD,OAAO,EAGT,GAAIv1G,OAAO04B,eAAe48E,KAAUt1G,OAAO04B,eAAe68E,GACxD,OAAO,CAEX,KAAO,CACL,GAAa,OAATD,GAAmC,WAAlBz/C,EAAQy/C,GAC3B,OAAa,OAATC,GAAmC,WAAlB1/C,EAAQ0/C,KAEpBD,GAAQC,EAMnB,GAAa,OAATA,GAAmC,WAAlB1/C,EAAQ0/C,GAC3B,OAAO,CAEX,CAEA,IA7E4BE,EAAMC,EA1BT/uG,EAAGC,EAuGxB+uG,EAAU3qE,EAAesqE,GAG7B,GAAIK,IAFU3qE,EAAeuqE,GAG3B,OAAO,EAGT,GAAIlxG,MAAMC,QAAQgxG,GAAO,CAEvB,GAAIA,EAAKj0G,SAAWk0G,EAAKl0G,OACvB,OAAO,EAGT,IAAIu0G,EAAQZ,EAAyBM,GACjCO,EAAQb,EAAyBO,GAErC,OAAIK,EAAMv0G,SAAWw0G,EAAMx0G,QAIpBy0G,EAASR,EAAMC,EAAMr8C,EAAQs8C,EAAON,EAAUU,EACvD,CAKA,GAAgB,oBAAZD,KAEG9J,EAAMyJ,IAASzJ,EAAM0J,KAAU3kF,EAAM0kF,IAAS1kF,EAAM2kF,IACvD,OAAO,EAIX,GAAIprE,EAAOmrE,IACT,IAAKnrE,EAAOorE,IAASnrE,KAAK/pC,UAAU01G,QAAQ97F,KAAKq7F,KAAUlrE,KAAK/pC,UAAU01G,QAAQ97F,KAAKs7F,GACrF,OAAO,OAEJ,GAAIrrE,EAASorE,IAClB,IAAKprE,EAASqrE,KA7IS5uG,EA6ImB2uG,EA7IhB1uG,EA6IsB2uG,IA5I3CZ,EAAsBhuG,EAAEm8C,SAAWl8C,EAAEk8C,QAAUn8C,EAAEyvB,QAAUxvB,EAAEwvB,MAAQiS,OAAOhoC,UAAUwE,SAASoV,KAAKtT,KAAO0hC,OAAOhoC,UAAUwE,SAASoV,KAAKrT,KA6I7I,OAAO,OAEJ,GAAI0kC,EAAcgqE,IAASA,aAAgBlzG,OAGhD,GAAIkzG,EAAKlsF,UAAYmsF,EAAKnsF,SAAWksF,EAAKz7F,OAAS07F,EAAK17F,KACtD,OAAO,MAEJ,IAAIoxF,EAAkBqK,GAAO,CAClC,GAAKp8C,IAAWuyC,EAAe6J,KAAS5J,EAAe4J,IAIhD,IAzIX,SAA+B3uG,EAAGC,GAChC,OAAID,EAAEoB,aAAenB,EAAEmB,YAIwG,IAAxH0a,EAAQ,IAAIjG,WAAW7V,EAAE/F,OAAQ+F,EAAEyW,WAAYzW,EAAEoB,YAAa,IAAIyU,WAAW5V,EAAEhG,OAAQgG,EAAEwW,WAAYxW,EAAEmB,YAChH,CAmIgBiuG,CAAsBV,EAAMC,GACtC,OAAO,OAJP,IApJN,SAA+B5uG,EAAGC,GAChC,GAAID,EAAEoB,aAAenB,EAAEmB,WACrB,OAAO,EAGT,IAAK,IAAIiY,EAAS,EAAGA,EAASrZ,EAAEoB,WAAYiY,IAC1C,GAAIrZ,EAAEqZ,KAAYpZ,EAAEoZ,GAClB,OAAO,EAIX,OAAO,CACT,CAwIWi2F,CAAsBX,EAAMC,GAC/B,OAAO,EASX,IAAIW,EAAQlB,EAAyBM,GAEjCa,EAASnB,EAAyBO,GAEtC,OAAIW,EAAM70G,SAAW80G,EAAO90G,QAIrBy0G,EAASR,EAAMC,EAAMr8C,EAAQs8C,EAAOP,EAAaiB,EAC1D,CAAO,GAAItlF,EAAM0kF,GACf,SAAK1kF,EAAM2kF,IAASD,EAAK3zG,OAAS4zG,EAAK5zG,OAIhCm0G,EAASR,EAAMC,EAAMr8C,EAAQs8C,EAAOL,GACtC,GAAItJ,EAAMyJ,GACf,SAAKzJ,EAAM0J,IAASD,EAAK3zG,OAAS4zG,EAAK5zG,OAIhCm0G,EAASR,EAAMC,EAAMr8C,EAAQs8C,EAAOJ,GACtC,GAAItI,EAAiBwI,IAC1B,GA9JgCI,EA8JAH,GA9JNE,EA8JAH,GA7JhBvtG,aAAe2tG,EAAK3tG,YAAsE,IAAxD0a,EAAQ,IAAIjG,WAAWi5F,GAAO,IAAIj5F,WAAWk5F,IA8JvF,OAAO,OAEJ,GAAI7I,EAAiByI,KA7J9B,SAA+BA,EAAMC,GACnC,OAAIpJ,EAAemJ,GACVnJ,EAAeoJ,IAAS7+C,EAASz2C,OAAO5f,UAAUmd,QAAQvD,KAAKq7F,GAAOr1F,OAAO5f,UAAUmd,QAAQvD,KAAKs7F,IAGzGnJ,EAAekJ,GACVlJ,EAAemJ,IAAS71F,OAAOrf,UAAUmd,QAAQvD,KAAKq7F,KAAU51F,OAAOrf,UAAUmd,QAAQvD,KAAKs7F,GAGnGlJ,EAAgBiJ,GACXjJ,EAAgBkJ,IAAStmF,QAAQ5uB,UAAUmd,QAAQvD,KAAKq7F,KAAUrmF,QAAQ5uB,UAAUmd,QAAQvD,KAAKs7F,GAGtGjJ,EAAegJ,GACVhJ,EAAeiJ,IAASpxF,OAAO9jB,UAAUmd,QAAQvD,KAAKq7F,KAAUnxF,OAAO9jB,UAAUmd,QAAQvD,KAAKs7F,GAGhGhJ,EAAegJ,IAASp5F,OAAO9b,UAAUmd,QAAQvD,KAAKq7F,KAAUn5F,OAAO9b,UAAUmd,QAAQvD,KAAKs7F,EACvG,CA2IwCa,CAAsBd,EAAMC,GAChE,OAAO,CACT,CAEA,OAAOO,EAASR,EAAMC,EAAMr8C,EAAQs8C,EAAOP,EAC7C,CAEA,SAASoB,EAAen0G,EAAKgpB,GAC3B,OAAOA,EAAK21B,QAAO,SAAU95C,GAC3B,OAAOyqE,EAAqBtvE,EAAK6E,EACnC,GACF,CAEA,SAAS+uG,EAASR,EAAMC,EAAMr8C,EAAQs8C,EAAOc,EAAeC,GAQ1D,GAAyB,IAArBn4F,UAAU/c,OAAc,CAC1Bk1G,EAAQv2G,OAAOkrB,KAAKoqF,GACpB,IAAIkB,EAAQx2G,OAAOkrB,KAAKqqF,GAExB,GAAIgB,EAAMl1G,SAAWm1G,EAAMn1G,OACzB,OAAO,CAEX,CAKA,IAFA,IAAI8C,EAAI,EAEDA,EAAIoyG,EAAMl1G,OAAQ8C,IACvB,IAAK0sB,EAAe0kF,EAAMgB,EAAMpyG,IAC9B,OAAO,EAIX,GAAI+0D,GAA+B,IAArB96C,UAAU/c,OAAc,CACpC,IAAIo1G,EAAc3B,EAA4BQ,GAE9C,GAA2B,IAAvBmB,EAAYp1G,OAAc,CAC5B,IAAIm2B,EAAQ,EAEZ,IAAKrzB,EAAI,EAAGA,EAAIsyG,EAAYp1G,OAAQ8C,IAAK,CACvC,IAAIlD,EAAMw1G,EAAYtyG,GAEtB,GAAIqtE,EAAqB8jC,EAAMr0G,GAAM,CACnC,IAAKuwE,EAAqB+jC,EAAMt0G,GAC9B,OAAO,EAGTs1G,EAAM51F,KAAK1f,GACXu2B,GACF,MAAO,GAAIg6C,EAAqB+jC,EAAMt0G,GACpC,OAAO,CAEX,CAEA,IAAIy1G,EAAc5B,EAA4BS,GAE9C,GAAIkB,EAAYp1G,SAAWq1G,EAAYr1G,QAAUg1G,EAAed,EAAMmB,GAAar1G,SAAWm2B,EAC5F,OAAO,CAEX,KAAO,CACL,IAAIm/E,EAAe7B,EAA4BS,GAE/C,GAA4B,IAAxBoB,EAAat1G,QAA8D,IAA9Cg1G,EAAed,EAAMoB,GAAct1G,OAClE,OAAO,CAEX,CACF,CAEA,GAAqB,IAAjBk1G,EAAMl1G,SAAiBi1G,IAAkBrB,GAAeqB,IAAkBpB,GAA4B,IAAhBI,EAAKj0G,QAA8B,IAAdi0G,EAAK3zG,MAClH,OAAO,EAIT,QAAcI,IAAVyzG,EACFA,EAAQ,CACNF,KAAM,IAAIv/D,IACVw/D,KAAM,IAAIx/D,IACV3c,SAAU,OAEP,CAIL,IAAIw9E,EAAYpB,EAAMF,KAAKhzF,IAAIgzF,GAE/B,QAAkBvzG,IAAd60G,EAAyB,CAC3B,IAAIC,EAAYrB,EAAMD,KAAKjzF,IAAIizF,GAE/B,QAAkBxzG,IAAd80G,EACF,OAAOD,IAAcC,CAEzB,CAEArB,EAAMp8E,UACR,CAEAo8E,EAAMF,KAAKzyF,IAAIyyF,EAAME,EAAMp8E,UAC3Bo8E,EAAMD,KAAK1yF,IAAI0yF,EAAMC,EAAMp8E,UAC3B,IAAI09E,EA+MN,SAAkBnwG,EAAGC,EAAGsyD,EAAQhuC,EAAMsqF,EAAOc,GAG3C,IAAInyG,EAAI,EAER,GAAImyG,IAAkBnB,GACpB,IAxIJ,SAAkBxuG,EAAGC,EAAGsyD,EAAQ69C,GAM9B,IAHA,IAAIl0F,EAAM,KACNm0F,EAAUpC,EAAajuG,GAElBxC,EAAI,EAAGA,EAAI6yG,EAAQ31G,OAAQ8C,IAAK,CACvC,IAAIjC,EAAM80G,EAAQ7yG,GAIlB,GAAqB,WAAjB0xD,EAAQ3zD,IAA6B,OAARA,EACnB,OAAR2gB,IACFA,EAAM,IAAIszB,KAOZtzB,EAAIlY,IAAIzI,QACH,IAAK0E,EAAE+nG,IAAIzsG,GAAM,CACtB,GAAIg3D,EAAQ,OAAO,EAEnB,IAAK+9C,EAAsBtwG,EAAGC,EAAG1E,GAC/B,OAAO,EAGG,OAAR2gB,IACFA,EAAM,IAAIszB,KAGZtzB,EAAIlY,IAAIzI,EACV,CACF,CAEA,GAAY,OAAR2gB,EAAc,CAGhB,IAFA,IAAIq0F,EAAUtC,EAAahuG,GAElB4tG,EAAK,EAAGA,EAAK0C,EAAQ71G,OAAQmzG,IAAM,CAC1C,IAAI2C,EAAOD,EAAQ1C,GAGnB,GAAsB,WAAlB3+C,EAAQshD,IAA+B,OAATA,GAChC,IAAKC,EAAmBv0F,EAAKs0F,EAAMj+C,EAAQ69C,GAAO,OAAO,OACpD,IAAK79C,IAAWvyD,EAAEgoG,IAAIwI,KAAUC,EAAmBv0F,EAAKs0F,EAAMj+C,EAAQ69C,GAC3E,OAAO,CAEX,CAEA,OAAoB,IAAbl0F,EAAIlhB,IACb,CAEA,OAAO,CACT,CAkFS01G,CAAS1wG,EAAGC,EAAGsyD,EAAQs8C,GAC1B,OAAO,OAEJ,GAAIc,IAAkBlB,GAC3B,IAlEJ,SAAkBzuG,EAAGC,EAAGsyD,EAAQ69C,GAI9B,IAHA,IAAIl0F,EAAM,KACNy0F,EAAWzC,EAAaluG,GAEnBxC,EAAI,EAAGA,EAAImzG,EAASj2G,OAAQ8C,IAAK,CACxC,IAAIozG,EAAcnD,EAAekD,EAASnzG,GAAI,GAC1ClD,EAAMs2G,EAAY,GAClBC,EAAQD,EAAY,GAExB,GAAqB,WAAjB1hD,EAAQ50D,IAA6B,OAARA,EACnB,OAAR4hB,IACFA,EAAM,IAAIszB,KAGZtzB,EAAIlY,IAAI1J,OACH,CAGL,IAAIw2G,EAAQ7wG,EAAE0b,IAAIrhB,GAElB,QAAcc,IAAV01G,IAAwB7wG,EAAE+nG,IAAI1tG,KAASo0G,EAAemC,EAAOC,EAAOv+C,EAAQ69C,GAAO,CACrF,GAAI79C,EAAQ,OAAO,EAGnB,IAAKw+C,EAAsB/wG,EAAGC,EAAG3F,EAAKu2G,EAAOT,GAAO,OAAO,EAE/C,OAARl0F,IACFA,EAAM,IAAIszB,KAGZtzB,EAAIlY,IAAI1J,EACV,CACF,CACF,CAEA,GAAY,OAAR4hB,EAAc,CAGhB,IAFA,IAAI80F,EAAW9C,EAAajuG,GAEnBgxG,EAAM,EAAGA,EAAMD,EAASt2G,OAAQu2G,IAAO,CAC9C,IAAIC,EAAezD,EAAeuD,EAASC,GAAM,GAE7C7lD,GADA9wD,EAAM42G,EAAa,GACZA,EAAa,IAExB,GAAqB,WAAjBhiD,EAAQ50D,IAA6B,OAARA,GAC/B,IAAK62G,EAAiBj1F,EAAKlc,EAAG1F,EAAK8wD,EAAMmH,EAAQ69C,GAAO,OAAO,OAC1D,KAAK79C,GAAYvyD,EAAEgoG,IAAI1tG,IAASo0G,EAAe1uG,EAAE2b,IAAIrhB,GAAM8wD,GAAM,EAAOglD,IAAWe,EAAiBj1F,EAAKlc,EAAG1F,EAAK8wD,GAAM,EAAOglD,IACnI,OAAO,CAEX,CAEA,OAAoB,IAAbl0F,EAAIlhB,IACb,CAEA,OAAO,CACT,CAYSo2G,CAASpxG,EAAGC,EAAGsyD,EAAQs8C,GAC1B,OAAO,OAEJ,GAAIc,IAAkBpB,EAC3B,KAAO/wG,EAAIwC,EAAEtF,OAAQ8C,IAAK,CACxB,IAAI0sB,EAAelqB,EAAGxC,GAIf,IAAI0sB,EAAejqB,EAAGzC,GAC3B,OAAO,EAKP,IAFA,IAAI6zG,EAAQh4G,OAAOkrB,KAAKvkB,GAEjBxC,EAAI6zG,EAAM32G,OAAQ8C,IAAK,CAC5B,IAAIlD,EAAM+2G,EAAM7zG,GAEhB,IAAK0sB,EAAejqB,EAAG3F,KAASo0G,EAAe1uG,EAAE1F,GAAM2F,EAAE3F,GAAMi4D,EAAQs8C,GACrE,OAAO,CAEX,CAEA,OAAIwC,EAAM32G,SAAWrB,OAAOkrB,KAAKtkB,GAAGvF,MAKtC,CAtBE,IAAKwvB,EAAejqB,EAAGzC,KAAOkxG,EAAe1uG,EAAExC,GAAIyC,EAAEzC,GAAI+0D,EAAQs8C,GAC/D,OAAO,CAsBb,CAKF,IAAKrxG,EAAI,EAAGA,EAAI+mB,EAAK7pB,OAAQ8C,IAAK,CAChC,IAAIiiD,EAAOl7B,EAAK/mB,GAEhB,IAAKkxG,EAAe1uG,EAAEy/C,GAAOx/C,EAAEw/C,GAAO8S,EAAQs8C,GAC5C,OAAO,CAEX,CAEA,OAAO,CACT,CApQcyC,CAAS3C,EAAMC,EAAMr8C,EAAQq9C,EAAOf,EAAOc,GAGvD,OAFAd,EAAMF,KAAK4C,OAAO5C,GAClBE,EAAMD,KAAK2C,OAAO3C,GACXuB,CACT,CAEA,SAASM,EAAmBv0F,EAAKyyF,EAAMp8C,EAAQ69C,GAI7C,IAFA,IAAIoB,EAAYvD,EAAa/xF,GAEpB1e,EAAI,EAAGA,EAAIg0G,EAAU92G,OAAQ8C,IAAK,CACzC,IAAIoxG,EAAO4C,EAAUh0G,GAErB,GAAIkxG,EAAeC,EAAMC,EAAMr8C,EAAQ69C,GAGrC,OADAl0F,EAAIq1F,OAAO3C,IACJ,CAEX,CAEA,OAAO,CACT,CAMA,SAAS6C,EAA4BlV,GACnC,OAAQrtC,EAAQqtC,IACd,IAAK,YACH,OAAO,KAET,IAAK,SAEH,OAEF,IAAK,SACH,OAAO,EAET,IAAK,SACHA,GAAQA,EAKV,IAAK,SACH,GAAItlF,EAAYslF,GACd,OAAO,EAKb,OAAO,CACT,CAEA,SAAS+T,EAAsBtwG,EAAGC,EAAGs8F,GACnC,IAAImV,EAAWD,EAA4BlV,GAC3C,OAAgB,MAAZmV,EAAyBA,EACtBzxG,EAAE+nG,IAAI0J,KAAc1xG,EAAEgoG,IAAI0J,EACnC,CAEA,SAASX,EAAsB/wG,EAAGC,EAAGs8F,EAAMnxC,EAAMglD,GAC/C,IAAIsB,EAAWD,EAA4BlV,GAE3C,GAAgB,MAAZmV,EACF,OAAOA,EAGT,IAAIC,EAAO1xG,EAAE0b,IAAI+1F,GAEjB,aAAat2G,IAATu2G,IAAuB1xG,EAAE+nG,IAAI0J,KAAchD,EAAetjD,EAAMumD,GAAM,EAAOvB,MAIzEpwG,EAAEgoG,IAAI0J,IAAahD,EAAetjD,EAAMumD,GAAM,EAAOvB,EAC/D,CA0DA,SAASe,EAAiBj1F,EAAKqe,EAAKq3E,EAAMf,EAAOt+C,EAAQ69C,GAMvD,IAFA,IAAIoB,EAAYvD,EAAa/xF,GAEpB1e,EAAI,EAAGA,EAAIg0G,EAAU92G,OAAQ8C,IAAK,CACzC,IAAIq0G,EAAOL,EAAUh0G,GAErB,GAAIkxG,EAAekD,EAAMC,EAAMt/C,EAAQ69C,IAAS1B,EAAemC,EAAOt2E,EAAI5e,IAAIk2F,GAAOt/C,EAAQ69C,GAE3F,OADAl0F,EAAIq1F,OAAOM,IACJ,CAEX,CAEA,OAAO,CACT,CAyHA54G,EAAOD,QAAU,CACfm2D,YATF,SAAqBw/C,EAAMC,GACzB,OAAOF,EAAeC,EAAMC,GAhjBjB,EAijBb,EAQEx/C,kBANF,SAA2Bu/C,EAAMC,GAC/B,OAAOF,EAAeC,EAAMC,GArjBhB,EAsjBd,2BCxqBA,IAAIntD,EAAW,EAAQ,IACnBvoD,EAAS,EAAQ,IAEjByoD,EAAiB,EAAQ,KACzBuqB,EAAc,EAAQ,KACtBC,EAAO,EAAQ,KAEfC,EAAW3qB,EAASyqB,IAAe5yD,QAIvCpgB,EAAOkzE,EAAU,CAChBF,YAAaA,EACbvqB,eAAgBA,EAChBwqB,KAAMA,IAGPlzE,EAAOD,QAAUozE,0BCjBjB,IAAIlzE,EAAS,EAAQ,IACjBgzE,EAAc,EAAQ,KAI1BjzE,EAAOD,QAAU,WAChB,IAAIozE,EAAWF,IAMf,OALAhzE,EAAOogB,OAAQ,CAAEsV,MAAOw9C,GAAY,CACnCx9C,MAAO,WACN,OAAOtV,OAAOsV,QAAUw9C,CACzB,IAEMA,CACR,0BCdA,IAAI1wE,EAAW,EAAQ,GACnBxB,EAAS,YAETooB,EAAO,EAAQ,IAEfonD,EAAQxvE,EAAOU,MAAM,KACrBmvE,EAAY,GAEhB,SAAS9nB,EAAMvpB,EAAKp+B,GAClBgoB,EAAKhP,KAAKtX,KAAM,UACG,iBAAR1B,IACTA,EAAMJ,EAAOS,KAAKL,IAGpB0B,KAAKywE,KAAO/zC,EACZ18B,KAAKyjD,KAAOnlD,EAERA,EAAII,OAASqvE,EACfzvE,EAAMo+B,EAAIp+B,GACDA,EAAII,OAASqvE,IACtBzvE,EAAMJ,EAAO6hB,OAAO,CAACzhB,EAAKovE,GAAQK,IAMpC,IAHA,IAAIC,EAAOhuE,KAAK0wE,MAAQxyE,EAAOW,YAAYkvE,GACvCE,EAAOjuE,KAAK2wE,MAAQzyE,EAAOW,YAAYkvE,GAElCvsE,EAAI,EAAGA,EAAIusE,EAAWvsE,IAC7BwsE,EAAKxsE,GAAc,GAATlD,EAAIkD,GACdysE,EAAKzsE,GAAc,GAATlD,EAAIkD,GAGhBxB,KAAKs8B,MAAQ,CAAC0xC,EAChB,CAEAtuE,EAASumD,EAAM3/B,GAEf2/B,EAAKvoD,UAAU6+B,QAAU,SAAUphB,GACjCnb,KAAKs8B,MAAMte,KAAK7C,EAClB,EAEA8qC,EAAKvoD,UAAU8+B,OAAS,WACtB,IAAInrB,EAAIrR,KAAKywE,KAAKvyE,EAAO6hB,OAAO/f,KAAKs8B,QACrC,OAAOt8B,KAAKywE,KAAKvyE,EAAO6hB,OAAO,CAAC/f,KAAK2wE,MAAOt/D,IAC9C,EACApU,EAAOD,QAAUipD,unEC7CjB,IAAI4qB,EAAM,EAAQ,KACdtqB,EAAM,EAAQ,KACduvD,EAAW,EAAQ,IACnBC,EAAW,EAAQ,KACnBC,EAAO,EAAQ,IAsCnB,SAASrvD,EAAgBsvD,EAAO33G,EAAKg4C,GAEnC,GADA2/D,EAAQA,EAAMp6F,cACVi6F,EAASG,GAAQ,OAAO1vD,EAAII,eAAesvD,EAAO33G,EAAKg4C,GAC3D,GAAIy/D,EAASE,GAAQ,OAAO,IAAIplC,EAAI,CAAEvyE,IAAKA,EAAKg4C,GAAIA,EAAIhkC,KAAM2jG,IAE9D,MAAM,IAAIl3G,UAAU,qBACtB,CAEA,SAASw5C,EAAkB09D,EAAO33G,EAAKg4C,GAErC,GADA2/D,EAAQA,EAAMp6F,cACVi6F,EAASG,GAAQ,OAAO1vD,EAAIhO,iBAAiB09D,EAAO33G,EAAKg4C,GAC7D,GAAIy/D,EAASE,GAAQ,OAAO,IAAIplC,EAAI,CAAEvyE,IAAKA,EAAKg4C,GAAIA,EAAIhkC,KAAM2jG,EAAOl+D,SAAS,IAE9E,MAAM,IAAIh5C,UAAU,qBACtB,CAMA/B,EAAQypD,aAAezpD,EAAQwpD,OAxD/B,SAAuByvD,EAAOhgE,GAG5B,IAAII,EAAQD,EACZ,GAHA6/D,EAAQA,EAAMp6F,cAGVi6F,EAASG,GACX5/D,EAASy/D,EAASG,GAAO33G,IACzB83C,EAAQ0/D,EAASG,GAAO3/D,OACnB,KAAIy/D,EAASE,GAIlB,MAAM,IAAIl3G,UAAU,sBAHpBs3C,EAA+B,EAAtB0/D,EAASE,GAAO33G,IACzB83C,EAAQ2/D,EAASE,GAAO3/D,EAG1B,CAEA,IAAI/tB,EAAOytF,EAAK//D,GAAU,EAAOI,EAAQD,GACzC,OAAOuQ,EAAesvD,EAAO1tF,EAAKjqB,IAAKiqB,EAAK+tB,GAC9C,EAyCAt5C,EAAQ2pD,eAAiB3pD,EAAQ0pD,SAAWC,EAC5C3pD,EAAQ6pD,eAAiB7pD,EAAQ4pD,SAxCjC,SAAyBqvD,EAAOhgE,GAG9B,IAAII,EAAQD,EACZ,GAHA6/D,EAAQA,EAAMp6F,cAGVi6F,EAASG,GACX5/D,EAASy/D,EAASG,GAAO33G,IACzB83C,EAAQ0/D,EAASG,GAAO3/D,OACnB,KAAIy/D,EAASE,GAIlB,MAAM,IAAIl3G,UAAU,sBAHpBs3C,EAA+B,EAAtB0/D,EAASE,GAAO33G,IACzB83C,EAAQ2/D,EAASE,GAAO3/D,EAG1B,CAEA,IAAI/tB,EAAOytF,EAAK//D,GAAU,EAAOI,EAAQD,GACzC,OAAOmC,EAAiB09D,EAAO1tF,EAAKjqB,IAAKiqB,EAAK+tB,GAChD,EAyBAt5C,EAAQu7C,iBAAmBv7C,EAAQ8pD,WAAavO,EAChDv7C,EAAQgqD,YAAchqD,EAAQ+pD,WAR9B,WACE,OAAO1pD,OAAOkrB,KAAKwtF,GAAUh2F,OAAOwmC,EAAIQ,aAC1C,aC5DA,IAAIlqB,EAAa,EAAQ,IACrBq5E,EAAM,EAAQ,KACdx2G,EAAW,EAAQ,GACnBxB,EAAS,YAETsrD,EAAQ,CACV,eAAgB0sD,EAAIjtD,IAAIktD,YAAYD,EAAIE,KACxC,WAAYF,EAAIE,IAChB,cAAeF,EAAIjtD,IAAIktD,YAAYD,EAAIE,KACvC,UAAWF,EAAIE,IACf,UAAWF,EAAIjtD,IAAIktD,YAAYD,EAAIrlC,KACnC,UAAWqlC,EAAIrlC,KAMjB,SAASA,EAAKlrC,GACZ9I,EAAWvlB,KAAKtX,MAChB,IAEIkb,EAFAm7F,EAAW1wE,EAAKrzB,KAAKuJ,cACrBvJ,EAAOk3C,EAAM6sD,GAGfn7F,EADEyqB,EAAKoS,QACA,UAEA,UAET,IAAIz5C,EAAMqnC,EAAKrnC,IACVJ,EAAO6c,SAASzc,KACnBA,EAAMJ,EAAOS,KAAKL,IAEH,YAAb+3G,GAAuC,gBAAbA,IAC5B/3G,EAAMJ,EAAO6hB,OAAO,CAACzhB,EAAKA,EAAI4b,MAAM,EAAG,MAEzC,IAAIo8B,EAAK3Q,EAAK2Q,GACTp4C,EAAO6c,SAASu7B,KACnBA,EAAKp4C,EAAOS,KAAK23C,IAEnBt2C,KAAKs2G,KAAOhkG,EAAKhV,OAAO,CACtBgB,IAAKA,EACLg4C,GAAIA,EACJp7B,KAAMA,GAEV,CA9BAsuC,EAAM0sD,IAAM1sD,EAAM,WAClBA,EAAM+sD,KAAO/sD,EAAM,gBACnBvsD,EAAOD,QAAU6zE,EACjBnxE,EAASmxE,EAAKh0C,GA4Bdg0C,EAAInzE,UAAU6+B,QAAU,SAAUphB,GAChC,OAAOjd,EAAOS,KAAKqB,KAAKs2G,KAAKj7E,OAAOlgB,GACtC,EACA01D,EAAInzE,UAAU8+B,OAAS,WACrB,OAAOt+B,EAAOS,KAAKqB,KAAKs2G,KAAKt5E,QAC/B,wBC/CAhgC,EAAQ4lB,aAAe,SAAsB1B,EAAOxe,GAKlD,OAJYwe,EAAM,EAAIxe,IAAQ,GAClBwe,EAAM,EAAIxe,IAAQ,GAClBwe,EAAM,EAAIxe,IAAQ,EACnBwe,EAAM,EAAIxe,MACN,CACjB,EAEA1F,EAAQ8nB,cAAgB,SAAuB5D,EAAOtjB,EAAO8E,GAC3Dwe,EAAM,EAAIxe,GAAO9E,IAAU,GAC3BsjB,EAAM,EAAIxe,GAAQ9E,IAAU,GAAM,IAClCsjB,EAAM,EAAIxe,GAAQ9E,IAAU,EAAK,IACjCsjB,EAAM,EAAIxe,GAAe,IAAR9E,CACnB,EAEAZ,EAAQy0E,GAAK,SAAY+kC,EAAKC,EAAK1yG,EAAKrB,GAItC,IAHA,IAAIg0G,EAAO,EACPC,EAAO,EAEFn1G,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAC9B,IAAK,IAAIgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bk0G,IAAS,EACTA,GAASD,IAASj0G,EAAIhB,EAAM,EAE9B,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bk0G,IAAS,EACTA,GAASF,IAASh0G,EAAIhB,EAAM,CAEhC,CAEA,IAASA,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAC9B,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bm0G,IAAS,EACTA,GAASF,IAASj0G,EAAIhB,EAAM,EAE9B,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bm0G,IAAS,EACTA,GAASH,IAASh0G,EAAIhB,EAAM,CAEhC,CAEAuC,EAAIrB,EAAM,GAAKg0G,IAAS,EACxB3yG,EAAIrB,EAAM,GAAKi0G,IAAS,CAC1B,EAEA35G,EAAQk1E,IAAM,SAAaskC,EAAKC,EAAK1yG,EAAKrB,GAIxC,IAHA,IAAIg0G,EAAO,EACPC,EAAO,EAEFn1G,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIgB,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5Bk0G,IAAS,EACTA,GAASD,IAASj0G,EAAIhB,EAAM,EAC5Bk1G,IAAS,EACTA,GAASF,IAASh0G,EAAIhB,EAAM,EAGhC,IAASA,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAASgB,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5Bm0G,IAAS,EACTA,GAASF,IAASj0G,EAAIhB,EAAM,EAC5Bm1G,IAAS,EACTA,GAASH,IAASh0G,EAAIhB,EAAM,EAIhCuC,EAAIrB,EAAM,GAAKg0G,IAAS,EACxB3yG,EAAIrB,EAAM,GAAKi0G,IAAS,CAC1B,EAEA35G,EAAQm0E,IAAM,SAAaqlC,EAAKC,EAAK1yG,EAAKrB,GAQxC,IAPA,IAAIg0G,EAAO,EACPC,EAAO,EAMFn1G,EAAI,EAAGA,GAAK,EAAGA,IAAK,CAC3B,IAAK,IAAIgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bk0G,IAAS,EACTA,GAASD,GAAQj0G,EAAIhB,EAAM,EAE7B,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bk0G,IAAS,EACTA,GAASF,GAAQh0G,EAAIhB,EAAM,CAE/B,CACA,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bk0G,IAAS,EACTA,GAASD,GAAQj0G,EAAIhB,EAAM,EAO7B,IAASA,EAAI,EAAGA,GAAK,EAAGA,IAAK,CAC3B,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bm0G,IAAS,EACTA,GAASF,GAAQj0G,EAAIhB,EAAM,EAE7B,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bm0G,IAAS,EACTA,GAASH,GAAQh0G,EAAIhB,EAAM,CAE/B,CACA,IAASgB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5Bm0G,IAAS,EACTA,GAASH,GAAQh0G,EAAIhB,EAAM,EAG7BuC,EAAIrB,EAAM,GAAKg0G,IAAS,EACxB3yG,EAAIrB,EAAM,GAAKi0G,IAAS,CAC1B,EAEA35G,EAAQo0E,OAAS,SAAgB3vE,EAAK2Q,GACpC,OAAS3Q,GAAO2Q,EAAS,UAAc3Q,IAAS,GAAK2Q,CACvD,EAEA,IAAIwkG,EAAW,CAEb,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAC3B,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GACzB,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAGzB,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GACzB,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EACzB,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,IAG5B55G,EAAQq0E,IAAM,SAAamlC,EAAKC,EAAK1yG,EAAKrB,GAKxC,IAJA,IAAIg0G,EAAO,EACPC,EAAO,EAEPt1G,EAAMu1G,EAASl4G,SAAW,EACrB8C,EAAI,EAAGA,EAAIH,EAAKG,IACvBk1G,IAAS,EACTA,GAASF,IAAQI,EAASp1G,GAAM,EAElC,IAASA,EAAIH,EAAKG,EAAIo1G,EAASl4G,OAAQ8C,IACrCm1G,IAAS,EACTA,GAASF,IAAQG,EAASp1G,GAAM,EAGlCuC,EAAIrB,EAAM,GAAKg0G,IAAS,EACxB3yG,EAAIrB,EAAM,GAAKi0G,IAAS,CAC1B,EAEA35G,EAAQg1E,OAAS,SAAgBjxE,EAAGgD,EAAKrB,GACvC,IAAIg0G,EAAO,EACPC,EAAO,EAEXD,GAAa,EAAJ31G,IAAU,EAAMA,IAAM,GAC/B,IAAK,IAAIS,EAAI,GAAIA,GAAK,GAAIA,GAAK,EAC7Bk1G,IAAS,EACTA,GAAS31G,IAAMS,EAAK,GAEtB,IAASA,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5Bm1G,GAAS51G,IAAMS,EAAK,GACpBm1G,IAAS,EAEXA,IAAc,GAAJ51G,IAAa,EAAMA,IAAM,GAEnCgD,EAAIrB,EAAM,GAAKg0G,IAAS,EACxB3yG,EAAIrB,EAAM,GAAKi0G,IAAS,CAC1B,EAEA,IAAIE,EAAS,CACX,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EACpD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClD,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAClD,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAEnD,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACpD,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAElD,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GACjD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EACpD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EACjD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAEpD,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EACnD,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EACpD,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAEjD,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EACpD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GACnD,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAElD,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAElD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GACnD,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAClD,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACpD,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAEjD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EACnD,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGpD75G,EAAQi1E,WAAa,SAAoBukC,EAAKC,GAE5C,IADA,IAAI1yG,EAAM,EACDvC,EAAI,EAAGA,EAAI,EAAGA,IAIrBuC,IAAQ,EACRA,GAHS8yG,EAAW,GAAJr1G,GADPg1G,IAAS,GAAS,EAAJh1G,EAAU,KAMnC,IAASA,EAAI,EAAGA,EAAI,EAAGA,IAIrBuC,IAAQ,EACRA,GAHS8yG,EAAO,IAAe,GAAJr1G,GADlBi1G,IAAS,GAAS,EAAJj1G,EAAU,KAMnC,OAAOuC,IAAQ,CACjB,EAEA,IAAI+yG,EAAe,CACjB,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GACvD,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,GAG1D95G,EAAQkR,QAAU,SAAiBzM,GAEjC,IADA,IAAIsC,EAAM,EACDvC,EAAI,EAAGA,EAAIs1G,EAAap4G,OAAQ8C,IACvCuC,IAAQ,EACRA,GAAQtC,IAAQq1G,EAAat1G,GAAM,EAErC,OAAOuC,IAAQ,CACjB,EAEA/G,EAAQ+5G,SAAW,SAAkBt1G,EAAKzC,EAAMq+C,GAE9C,IADA,IAAIp8C,EAAMQ,EAAIS,SAAS,GAChBjB,EAAIvC,OAASM,GAClBiC,EAAM,IAAMA,EAGd,IADA,IAAI8C,EAAM,GACDvC,EAAI,EAAGA,EAAIxC,EAAMwC,GAAK67C,EAC7Bt5C,EAAIia,KAAK/c,EAAIiZ,MAAM1Y,EAAGA,EAAI67C,IAC5B,OAAOt5C,EAAIm1B,KAAK,IAClB,0BC7PA,IAAI55B,EAAS,EAAQ,GACjBI,EAAW,EAAQ,GAEnB8mD,EAAS,EAAQ,IACjBqqB,EAAM,EAAQ,KAElB,SAASmmC,EAAS97F,EAAM5c,GACtBgB,EAAOksB,MAAMltB,EAAII,OAAQ,GAAI,sBAE7B,IAAIgsB,EAAKpsB,EAAI4b,MAAM,EAAG,GAClByQ,EAAKrsB,EAAI4b,MAAM,EAAG,IAClB+8F,EAAK34G,EAAI4b,MAAM,GAAI,IAGrBla,KAAK62C,QADM,YAAT37B,EACa,CACb21D,EAAIvzE,OAAO,CAAE4d,KAAM,UAAW5c,IAAKosB,IACnCmmD,EAAIvzE,OAAO,CAAE4d,KAAM,UAAW5c,IAAKqsB,IACnCkmD,EAAIvzE,OAAO,CAAE4d,KAAM,UAAW5c,IAAK24G,KAGtB,CACbpmC,EAAIvzE,OAAO,CAAE4d,KAAM,UAAW5c,IAAK24G,IACnCpmC,EAAIvzE,OAAO,CAAE4d,KAAM,UAAW5c,IAAKqsB,IACnCkmD,EAAIvzE,OAAO,CAAE4d,KAAM,UAAW5c,IAAKosB,IAGzC,CAEA,SAAS0rF,EAAIvqF,GACX26B,EAAOlvC,KAAKtX,KAAM6rB,GAElB,IAAIsJ,EAAQ,IAAI6hF,EAASh3G,KAAKkb,KAAMlb,KAAK6rB,QAAQvtB,KACjD0B,KAAKk3G,UAAY/hF,CACnB,CACAz1B,EAAS02G,EAAK5vD,GAEdvpD,EAAOD,QAAUo5G,EAEjBA,EAAI94G,OAAS,SAAgBuuB,GAC3B,OAAO,IAAIuqF,EAAIvqF,EACjB,EAEAuqF,EAAI14G,UAAU6+B,QAAU,SAAiB+0C,EAAKC,EAAOxtE,EAAKytE,GACxD,IAAIr8C,EAAQn1B,KAAKk3G,UAEjB/hF,EAAM0hB,QAAQ,GAAGta,QAAQ+0C,EAAKC,EAAOxtE,EAAKytE,GAC1Cr8C,EAAM0hB,QAAQ,GAAGta,QAAQx4B,EAAKytE,EAAQztE,EAAKytE,GAC3Cr8C,EAAM0hB,QAAQ,GAAGta,QAAQx4B,EAAKytE,EAAQztE,EAAKytE,EAC7C,EAEA4kC,EAAI14G,UAAUqzC,KAAO8/B,EAAInzE,UAAUqzC,KACnCqlE,EAAI14G,UAAUorD,OAAS+nB,EAAInzE,UAAUorD,mmECrDrC,IAAI5qD,EAAS,YACTi5G,EAASj5G,EAAOU,MAAM,GAAI,GAW9B,SAASw4G,EAAWrzG,GAClB,IAAI5E,EAAMjB,EAAOW,YAAY,IAK7B,OAJAM,EAAI2lB,cAAc/gB,EAAI,KAAO,EAAG,GAChC5E,EAAI2lB,cAAc/gB,EAAI,KAAO,EAAG,GAChC5E,EAAI2lB,cAAc/gB,EAAI,KAAO,EAAG,GAChC5E,EAAI2lB,cAAc/gB,EAAI,KAAO,EAAG,IACzB5E,CACT,CAEA,SAASizE,EAAO9zE,GACd0B,KAAKqR,EAAI/S,EACT0B,KAAKm1B,MAAQj3B,EAAOU,MAAM,GAAI,GAC9BoB,KAAKq3G,MAAQn5G,EAAOW,YAAY,EAClC,CAIAuzE,EAAM10E,UAAUi1E,MAAQ,SAAU1xC,GAEhC,IADA,IAAIz/B,GAAK,IACAA,EAAIy/B,EAAMviC,QACjBsB,KAAKm1B,MAAM3zB,IAAMy/B,EAAMz/B,GAEzBxB,KAAKs3G,WACP,EAEAllC,EAAM10E,UAAU45G,UAAY,WAK1B,IAJA,IAnCgBn4G,EAqCZqD,EAAO+0G,EAFPC,EAlCG,EADSr4G,EAmCCa,KAAKqR,GAjChBuR,aAAa,GACjBzjB,EAAIyjB,aAAa,GACjBzjB,EAAIyjB,aAAa,GACjBzjB,EAAIyjB,aAAa,KA+Bf60F,EAAK,CAAC,EAAG,EAAG,EAAG,GAEfj2G,GAAK,IACAA,EAAI,KAAK,CAchB,IAbwD,IAAlDxB,KAAKm1B,SAAS3zB,EAAI,IAAO,GAAM,EAAKA,EAAI,KAG5Ci2G,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,IAIdD,EAAwB,IAAP,EAARC,EAAG,IAGPh1G,EAAI,EAAGA,EAAI,EAAGA,IACjBg1G,EAAGh1G,GAAMg1G,EAAGh1G,KAAO,GAAmB,EAAZg1G,EAAGh1G,EAAI,KAAW,GAE9Cg1G,EAAG,GAAKA,EAAG,KAAO,EAGdD,IACFC,EAAG,GAAKA,EAAG,GAAM,KAAQ,GAE7B,CACAx3G,KAAKm1B,MAAQiiF,EAAUK,EACzB,EAEArlC,EAAM10E,UAAU29B,OAAS,SAAUl8B,GAEjC,IAAI6/D,EACJ,IAFAh/D,KAAKq3G,MAAQn5G,EAAO6hB,OAAO,CAAC/f,KAAKq3G,MAAOl4G,IAEjCa,KAAKq3G,MAAM34G,QAAU,IAC1BsgE,EAAQh/D,KAAKq3G,MAAMn9F,MAAM,EAAG,IAC5Bla,KAAKq3G,MAAQr3G,KAAKq3G,MAAMn9F,MAAM,IAC9Bla,KAAK2yE,MAAM3T,EAEf,EAEAoT,EAAM10E,UAAUs/B,MAAQ,SAAU06E,EAAKzmF,GAMrC,OALIjxB,KAAKq3G,MAAM34G,QACbsB,KAAK2yE,MAAMz0E,EAAO6hB,OAAO,CAAC/f,KAAKq3G,MAAOF,GAAS,KAGjDn3G,KAAK2yE,MAAMykC,EAAU,CAAC,EAAGM,EAAK,EAAGzmF,KAC1BjxB,KAAKm1B,KACd,EAEAl4B,EAAOD,QAAUo1E,aCxFjB,IAAIzyE,EAAK,EAAQ,GAEbk0E,EAAc,IADA,EAAQ,MAEtBD,EAAa,IAAIj0E,EAAG,IACpBw0E,EAAS,IAAIx0E,EAAG,IAChBs0E,EAAM,IAAIt0E,EAAG,IACbu0E,EAAQ,IAAIv0E,EAAG,GACfg4G,EAAQ,IAAIh4G,EAAG,GACfiX,EAAS,EAAQ,KACjB0gB,EAAc,EAAQ,IAG1B,SAASsgF,EAAand,EAAKxqE,GAMzB,OALAA,EAAMA,GAAO,OACR/xB,OAAO6c,SAAS0/E,KACnBA,EAAM,IAAIv8F,OAAOu8F,EAAKxqE,IAExBjwB,KAAKu/F,KAAO,IAAI5/F,EAAG86F,GACZz6F,IACT,CAEA,SAAS63G,EAActrD,EAAMt8B,GAM3B,OALAA,EAAMA,GAAO,OACR/xB,OAAO6c,SAASwxC,KACnBA,EAAO,IAAIruD,OAAOquD,EAAMt8B,IAE1BjwB,KAAK83G,MAAQ,IAAIn4G,EAAG4sD,GACbvsD,IACT,CAlBA/C,EAAOD,QAAU+6G,EAoBjB,IAAIC,EAAa,CAAC,EAsDlB,SAASD,EAAGrgG,EAAOugG,EAAWC,GAC5Bl4G,KAAKm4G,aAAaF,GAClBj4G,KAAKo4G,QAAU,IAAIz4G,EAAG+X,GACtB1X,KAAK2X,OAAShY,EAAGwZ,KAAKnZ,KAAKo4G,SAC3Bp4G,KAAKq4G,UAAY3gG,EAAMhZ,OACvBsB,KAAKu/F,UAAOngG,EACZY,KAAK83G,WAAQ14G,EACbY,KAAKs4G,gBAAal5G,EACd84G,GACFl4G,KAAK43G,aAAeA,EACpB53G,KAAK63G,cAAgBA,GAErB73G,KAAKs4G,WAAa,CAEtB,CA0DA,SAASC,EAAkBhkC,EAAItkD,GAC7B,IAAI9wB,EAAM,IAAIjB,OAAOq2E,EAAGjyE,WACxB,OAAK2tB,EAGI9wB,EAAI+C,SAAS+tB,GAFb9wB,CAIX,CAhEA9B,OAAOqiB,eAAeq4F,EAAGr6G,UAAW,cAAe,CACjDG,YAAY,EACZ8hB,IAAK,WAIH,MAH+B,iBAApB3f,KAAKs4G,aACdt4G,KAAKs4G,WAxEX,SAAoB5gG,EAAOugG,GACzB,IAAIhkE,EAAMgkE,EAAU/1G,SAAS,OACzBs2G,EAAM,CAACvkE,EAAKv8B,EAAMxV,SAAS,KAAKg3B,KAAK,KACzC,GAAIs/E,KAAOR,EACT,OAAOA,EAAWQ,GAEpB,IAyBIn3E,EAzBA5hB,EAAQ,EAEZ,GAAI/H,EAAMhE,WACPkD,EAAO88D,cACP98D,EAAO+8D,WAAWj8D,KAClBm8D,EAAYjrD,KAAKlR,GAclB,OAZA+H,GAAS,EAKPA,GAHU,OAARw0B,GAAwB,OAARA,EAGT,EAIA,EAEX+jE,EAAWQ,GAAO/4F,EACXA,EAOT,OALKo0D,EAAYjrD,KAAKlR,EAAM/F,KAAK,MAE/B8N,GAAS,GAGHw0B,GACN,IAAK,KACCv8B,EAAM3U,IAAI6wE,GAAY7xE,IAAIoyE,KAE5B10D,GAAS,GAEX,MACF,IAAK,MACH4hB,EAAM3pB,EAAM3U,IAAIkxE,IACRlyE,IAAImyE,IAAU7yC,EAAIt/B,IAAI41G,KAE5Bl4F,GAAS,GAEX,MACF,QACEA,GAAS,EAGb,OADAu4F,EAAWQ,GAAO/4F,EACXA,CACT,CAqBwBg5F,CAAWz4G,KAAKo4G,QAASp4G,KAAK04G,QAE3C14G,KAAKs4G,UACd,IAEFP,EAAGr6G,UAAUi7G,aAAe,WAK1B,OAJK34G,KAAK83G,QACR93G,KAAK83G,MAAQ,IAAIn4G,EAAG23B,EAAYt3B,KAAKq4G,aAEvCr4G,KAAKu/F,KAAOv/F,KAAK44G,KAAKxjG,MAAMpV,KAAK2X,QAAQhB,OAAO3W,KAAK83G,OAAOtiG,UACrDxV,KAAK64G,cACd,EAEAd,EAAGr6G,UAAUo7G,cAAgB,SAAUh7B,GAGrC,IAAIsgB,GADJtgB,GADAA,EAAQ,IAAIn+E,EAAGm+E,IACD1oE,MAAMpV,KAAK2X,SACNhB,OAAO3W,KAAK83G,OAAOtiG,UAClCzR,EAAM,IAAI7F,OAAOkgG,EAAO97F,WACxBoV,EAAQ1X,KAAK+4G,WACjB,GAAIh1G,EAAIrF,OAASgZ,EAAMhZ,OAAQ,CAC7B,IAAIs6G,EAAQ,IAAI96G,OAAOwZ,EAAMhZ,OAASqF,EAAIrF,QAC1Cs6G,EAAM/5G,KAAK,GACX8E,EAAM7F,OAAO6hB,OAAO,CAACi5F,EAAOj1G,GAC9B,CACA,OAAOA,CACT,EAEAg0G,EAAGr6G,UAAUm7G,aAAe,SAAsB5oF,GAChD,OAAOsoF,EAAkBv4G,KAAKu/F,KAAMtvE,EACtC,EAEA8nF,EAAGr6G,UAAUu7G,cAAgB,SAAuBhpF,GAClD,OAAOsoF,EAAkBv4G,KAAK83G,MAAO7nF,EACvC,EAEA8nF,EAAGr6G,UAAUq7G,SAAW,SAAU9oF,GAChC,OAAOsoF,EAAkBv4G,KAAKo4G,QAASnoF,EACzC,EAEA8nF,EAAGr6G,UAAUw7G,aAAe,SAAUjpF,GACpC,OAAOsoF,EAAkBv4G,KAAK44G,KAAM3oF,EACtC,EAEA8nF,EAAGr6G,UAAUy6G,aAAe,SAAUlkE,EAAKhkB,GAOzC,OANAA,EAAMA,GAAO,OACR/xB,OAAO6c,SAASk5B,KACnBA,EAAM,IAAI/1C,OAAO+1C,EAAKhkB,IAExBjwB,KAAK04G,MAAQzkE,EACbj0C,KAAK44G,KAAO,IAAIj5G,EAAGs0C,GACZj0C,IACT,aC1JA,IAAI9B,EAAS,YACT6nD,EAAa,EAAQ,IACrBxC,EAAS,EAAQ,KACjB7jD,EAAW,EAAQ,GACnB4nD,EAAO,EAAQ,KACf5J,EAAS,EAAQ,KAEjBy7D,EAAa,EAAQ,KAMzB,SAAS3xD,EAAMhQ,GACb+L,EAAO1X,SAASv0B,KAAKtX,MAErB,IAAImb,EAAOg+F,EAAW3hE,GACtB,IAAKr8B,EAAM,MAAM,IAAI1b,MAAM,0BAE3BO,KAAKo5G,UAAYj+F,EAAK8T,KACtBjvB,KAAKs8B,MAAQypB,EAAW5qC,EAAK8T,MAC7BjvB,KAAKq5G,KAAOl+F,EAAKqO,GACjBxpB,KAAKs5G,UAAYn+F,EAAKmsC,IACxB,CAuBA,SAASI,EAAQlQ,GACf+L,EAAO1X,SAASv0B,KAAKtX,MAErB,IAAImb,EAAOg+F,EAAW3hE,GACtB,IAAKr8B,EAAM,MAAM,IAAI1b,MAAM,0BAE3BO,KAAKs8B,MAAQypB,EAAW5qC,EAAK8T,MAC7BjvB,KAAKq5G,KAAOl+F,EAAKqO,GACjBxpB,KAAKs5G,UAAYn+F,EAAKmsC,IACxB,CAuBA,SAASC,EAAY/P,GACnB,OAAO,IAAIgQ,EAAKhQ,EAClB,CAEA,SAASiQ,EAAcjQ,GACrB,OAAO,IAAIkQ,EAAOlQ,EACpB,CA5EAn6C,OAAOkrB,KAAK4wF,GAAYjyE,SAAQ,SAAU5oC,GACxC66G,EAAW76G,GAAKkrB,GAAKtrB,EAAOS,KAAKw6G,EAAW76G,GAAKkrB,GAAI,OACrD2vF,EAAW76G,EAAIud,eAAiBs9F,EAAW76G,EAC7C,IAaAoB,EAAS8nD,EAAMjE,EAAO1X,UAEtB2b,EAAK9pD,UAAUiqE,OAAS,SAAiBxsD,EAAMjL,EAAG4tB,GAChD99B,KAAKs8B,MAAMjB,OAAOlgB,GAClB2iB,GACF,EAEA0pB,EAAK9pD,UAAU29B,OAAS,SAAiBlgB,EAAM8U,GAI7C,MAHoB,iBAAT9U,IAAmBA,EAAOjd,EAAOS,KAAKwc,EAAM8U,IAEvDjwB,KAAKs8B,MAAMjB,OAAOlgB,GACXnb,IACT,EAEAwnD,EAAK9pD,UAAU4pD,KAAO,SAAqBhpD,EAAK2xB,GAC9CjwB,KAAKmB,MACL,IAAI8tB,EAAOjvB,KAAKs8B,MAAMG,SAClBoiE,EAAMv3C,EAAKr4B,EAAM3wB,EAAK0B,KAAKo5G,UAAWp5G,KAAKs5G,UAAWt5G,KAAKq5G,MAE/D,OAAOppF,EAAM4uE,EAAI38F,SAAS+tB,GAAO4uE,CACnC,EAYAn/F,EAASgoD,EAAQnE,EAAO1X,UAExB6b,EAAOhqD,UAAUiqE,OAAS,SAAiBxsD,EAAMjL,EAAG4tB,GAClD99B,KAAKs8B,MAAMjB,OAAOlgB,GAClB2iB,GACF,EAEA4pB,EAAOhqD,UAAU29B,OAAS,SAAiBlgB,EAAM8U,GAI/C,MAHoB,iBAAT9U,IAAmBA,EAAOjd,EAAOS,KAAKwc,EAAM8U,IAEvDjwB,KAAKs8B,MAAMjB,OAAOlgB,GACXnb,IACT,EAEA0nD,EAAOhqD,UAAUggD,OAAS,SAAuBp/C,EAAKugG,EAAK5uE,GACtC,iBAAR4uE,IAAkBA,EAAM3gG,EAAOS,KAAKkgG,EAAK5uE,IAEpDjwB,KAAKmB,MACL,IAAI8tB,EAAOjvB,KAAKs8B,MAAMG,SACtB,OAAOihB,EAAOmhD,EAAK5vE,EAAM3wB,EAAK0B,KAAKs5G,UAAWt5G,KAAKq5G,KACrD,EAUAp8G,EAAOD,QAAU,CACfwqD,KAAMD,EACNG,OAAQD,EACRF,WAAYA,EACZE,aAAcA,cC1FhBxqD,EAAOD,QAAU,EAAjB,yCCEA,SAASw1B,EAAQlK,EAAQ23E,GAAkB,IAAI13E,EAAOlrB,OAAOkrB,KAAKD,GAAS,GAAIjrB,OAAOo1B,sBAAuB,CAAE,IAAIytE,EAAU7iG,OAAOo1B,sBAAsBnK,GAAS23E,IAAmBC,EAAUA,EAAQhiD,QAAO,SAAU93B,GAAO,OAAO/oB,OAAOonC,yBAAyBnc,EAAQlC,GAAKvoB,UAAY,KAAK0qB,EAAKvK,KAAKiB,MAAMsJ,EAAM23E,EAAU,CAAE,OAAO33E,CAAM,CACpV,SAAS43E,EAAc1/E,GAAU,IAAK,IAAIjf,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK,CAAE,IAAI2+C,EAAS,MAAQ1kC,UAAUja,GAAKia,UAAUja,GAAK,CAAC,EAAGA,EAAI,EAAIgxB,EAAQn1B,OAAO8iD,IAAS,GAAIjZ,SAAQ,SAAU5oC,GAAO8hG,EAAgB3/E,EAAQniB,EAAK6hD,EAAO7hD,GAAO,IAAKjB,OAAOknC,0BAA4BlnC,OAAO2iC,iBAAiBvf,EAAQpjB,OAAOknC,0BAA0B4b,IAAW3tB,EAAQn1B,OAAO8iD,IAASjZ,SAAQ,SAAU5oC,GAAOjB,OAAOqiB,eAAee,EAAQniB,EAAKjB,OAAOonC,yBAAyB0b,EAAQ7hD,GAAO,GAAI,CAAE,OAAOmiB,CAAQ,CACzf,SAAS2/E,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAAM+hG,EAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAE3O,SAASwlF,EAAkB7/E,EAAQu1B,GAAS,IAAK,IAAIx0C,EAAI,EAAGA,EAAIw0C,EAAMt3C,OAAQ8C,IAAK,CAAE,IAAIstE,EAAa94B,EAAMx0C,GAAIstE,EAAWjxE,WAAaixE,EAAWjxE,aAAc,EAAOixE,EAAW/wE,cAAe,EAAU,UAAW+wE,IAAYA,EAAWhxE,UAAW,GAAMT,OAAOqiB,eAAee,EAAQ4/E,EAAevxB,EAAWxwE,KAAMwwE,EAAa,CAAE,CAE5U,SAASuxB,EAAe7hG,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CAE1H,IACEJ,EADa,EAAQ,GACHA,OAElBuF,EADc,EAAQ,KACFA,QAClBsmC,EAAStmC,GAAWA,EAAQsmC,QAAU,UAI1C9sC,EAAOD,QAAuB,WAC5B,SAASyiE,KAdX,SAAyB1nC,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAepJ02D,CAAgBz1D,KAAMy/D,GACtBz/D,KAAKo6C,KAAO,KACZp6C,KAAKq6C,KAAO,KACZr6C,KAAKtB,OAAS,CAChB,CAjBF,IAAsB82D,EAAairC,EA8KjC,OA9KoBjrC,EAkBPiK,GAlBoBghC,EAkBR,CAAC,CACxBniG,IAAK,OACLV,MAAO,SAAckuC,GACnB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAM,MAEJzY,KAAKtB,OAAS,EAAGsB,KAAKq6C,KAAK5hC,KAAOitD,EAAW1lE,KAAKo6C,KAAOsrB,EAC7D1lE,KAAKq6C,KAAOqrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,UACLV,MAAO,SAAiBkuC,GACtB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAMzY,KAAKo6C,MAEO,IAAhBp6C,KAAKtB,SAAcsB,KAAKq6C,KAAOqrB,GACnC1lE,KAAKo6C,KAAOsrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,QACLV,MAAO,WACL,GAAoB,IAAhBoC,KAAKtB,OAAT,CACA,IAAIqG,EAAM/E,KAAKo6C,KAAKj/B,KAGpB,OAFoB,IAAhBnb,KAAKtB,OAAcsB,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KAAUr6C,KAAKo6C,KAAOp6C,KAAKo6C,KAAK3hC,OAC7EzY,KAAKtB,OACAqG,CAJsB,CAK/B,GACC,CACDzG,IAAK,QACLV,MAAO,WACLoC,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KACxBr6C,KAAKtB,OAAS,CAChB,GACC,CACDJ,IAAK,OACLV,MAAO,SAAc6Q,GACnB,GAAoB,IAAhBzO,KAAKtB,OAAc,MAAO,GAG9B,IAFA,IAAIqQ,EAAI/O,KAAKo6C,KACTr1C,EAAM,GAAKgK,EAAEoM,KACVpM,EAAIA,EAAE0J,MAAM1T,GAAO0J,EAAIM,EAAEoM,KAChC,OAAOpW,CACT,GACC,CACDzG,IAAK,SACLV,MAAO,SAAgB4R,GACrB,GAAoB,IAAhBxP,KAAKtB,OAAc,OAAOR,EAAOU,MAAM,GAI3C,IAHA,IA5DcR,EAAKqiB,EAAQpD,EA4DvBtY,EAAM7G,EAAOW,YAAY2Q,IAAM,GAC/BT,EAAI/O,KAAKo6C,KACT54C,EAAI,EACDuN,GA/DO3Q,EAgED2Q,EAAEoM,KAhEIsF,EAgEE1b,EAhEMsY,EAgED7b,EA/D9BtD,EAAOR,UAAU0F,KAAKkU,KAAKlZ,EAAKqiB,EAAQpD,GAgElC7b,GAAKuN,EAAEoM,KAAKzc,OACZqQ,EAAIA,EAAE0J,KAER,OAAO1T,CACT,GAGC,CACDzG,IAAK,UACLV,MAAO,SAAiB4R,EAAGkxF,GACzB,IAAI37F,EAYJ,OAXIyK,EAAIxP,KAAKo6C,KAAKj/B,KAAKzc,QAErBqG,EAAM/E,KAAKo6C,KAAKj/B,KAAKjB,MAAM,EAAG1K,GAC9BxP,KAAKo6C,KAAKj/B,KAAOnb,KAAKo6C,KAAKj/B,KAAKjB,MAAM1K,IAGtCzK,EAFSyK,IAAMxP,KAAKo6C,KAAKj/B,KAAKzc,OAExBsB,KAAKoS,QAGLsuF,EAAa1gG,KAAK2gG,WAAWnxF,GAAKxP,KAAK4gG,WAAWpxF,GAEnDzK,CACT,GACC,CACDzG,IAAK,QACLV,MAAO,WACL,OAAOoC,KAAKo6C,KAAKj/B,IACnB,GAGC,CACD7c,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EACJoE,EAAMgK,EAAEoM,KAEZ,IADA3L,GAAKzK,EAAIrG,OACFqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAIxX,EAAM8N,EAAEoM,KACRkvB,EAAK76B,EAAIvO,EAAIvC,OAASuC,EAAIvC,OAAS8Q,EAGvC,GAFI66B,IAAOppC,EAAIvC,OAAQqG,GAAO9D,EAAS8D,GAAO9D,EAAIiZ,MAAM,EAAG1K,GAEjD,IADVA,GAAK66B,GACQ,CACPA,IAAOppC,EAAIvC,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOla,EAAIiZ,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIzK,EAAM7G,EAAOW,YAAY2Q,GACzBT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EAGR,IAFAoO,EAAEoM,KAAK/X,KAAK2B,GACZyK,GAAKT,EAAEoM,KAAKzc,OACLqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAItZ,EAAM4P,EAAEoM,KACRkvB,EAAK76B,EAAIrQ,EAAIT,OAASS,EAAIT,OAAS8Q,EAGvC,GAFArQ,EAAIiE,KAAK2B,EAAKA,EAAIrG,OAAS8Q,EAAG,EAAG66B,GAEvB,IADV76B,GAAK66B,GACQ,CACPA,IAAOlrC,EAAIT,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOhc,EAAI+a,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAKyrC,EACLnsC,MAAO,SAAesS,EAAG2b,GACvB,OAAOpoB,EAAQzD,KAAMmgG,EAAcA,EAAc,CAAC,EAAGt0E,GAAU,CAAC,EAAG,CAEjEka,MAAO,EAEPM,eAAe,IAEnB,MA5K0Ei6D,EAAkB9qC,EAAY93D,UAAW+iG,GAA2EpjG,OAAOqiB,eAAe81C,EAAa,YAAa,CAAE13D,UAAU,IA8KrP2hE,CACT,CApK8B,2BChB9B,IAAIohC,EACJ,SAAST,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAC5C,SAAwBE,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CADxE+hG,CAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAG3O,IAAI+oC,EAAW,EAAQ,IACnBi9C,EAAetnF,OAAO,eACtBunF,EAAcvnF,OAAO,cACrBwnF,EAASxnF,OAAO,SAChBynF,EAASznF,OAAO,SAChB0nF,EAAe1nF,OAAO,eACtB2nF,EAAiB3nF,OAAO,iBACxB4nF,EAAU5nF,OAAO,UACrB,SAAS6nF,EAAiBzjG,EAAOkgC,GAC/B,MAAO,CACLlgC,MAAOA,EACPkgC,KAAMA,EAEV,CACA,SAASwjE,EAAe9F,GACtB,IAAIvoE,EAAUuoE,EAAKsF,GACnB,GAAgB,OAAZ7tE,EAAkB,CACpB,IAAI9X,EAAOqgF,EAAK4F,GAASpkF,OAIZ,OAAT7B,IACFqgF,EAAK0F,GAAgB,KACrB1F,EAAKsF,GAAgB,KACrBtF,EAAKuF,GAAe,KACpB9tE,EAAQouE,EAAiBlmF,GAAM,IAEnC,CACF,CACA,SAASomF,EAAW/F,GAGlB5tE,QAAQqO,SAASqlE,EAAgB9F,EACnC,CAYA,IAAIgG,EAAyBnkG,OAAO04B,gBAAe,WAAa,IAC5D0rE,EAAuCpkG,OAAOyc,gBAmD/CsmF,EAnD+DS,EAAwB,CACpFt9C,aACF,OAAOvjD,KAAKohG,EACd,EACA3oF,KAAM,WACJ,IAAI88C,EAAQv1D,KAGRyf,EAAQzf,KAAKghG,GACjB,GAAc,OAAVvhF,EACF,OAAOuT,QAAQE,OAAOzT,GAExB,GAAIzf,KAAKihG,GACP,OAAOjuE,QAAQC,QAAQouE,OAAiBjiG,GAAW,IAErD,GAAIY,KAAKohG,GAAS30D,UAKhB,OAAO,IAAIzZ,SAAQ,SAAUC,EAASC,GACpCtF,QAAQqO,UAAS,WACXs5B,EAAMyrC,GACR9tE,EAAOqiC,EAAMyrC,IAEb/tE,EAAQouE,OAAiBjiG,GAAW,GAExC,GACF,IAOF,IACI0qC,EADA43D,EAAc1hG,KAAKkhG,GAEvB,GAAIQ,EACF53D,EAAU,IAAI9W,QAlDpB,SAAqB0uE,EAAalG,GAChC,OAAO,SAAUvoE,EAASC,GACxBwuE,EAAYv3D,MAAK,WACXqxD,EAAKyF,GACPhuE,EAAQouE,OAAiBjiG,GAAW,IAGtCo8F,EAAK2F,GAAgBluE,EAASC,EAChC,GAAGA,EACL,CACF,CAwC4ByuE,CAAYD,EAAa1hG,WAC1C,CAGL,IAAImb,EAAOnb,KAAKohG,GAASpkF,OACzB,GAAa,OAAT7B,EACF,OAAO6X,QAAQC,QAAQouE,EAAiBlmF,GAAM,IAEhD2uB,EAAU,IAAI9W,QAAQhzB,KAAKmhG,GAC7B,CAEA,OADAnhG,KAAKkhG,GAAgBp3D,EACdA,CACT,GACwCtwB,OAAOgrD,eAAe,WAC9D,OAAOxkE,IACT,IAAIogG,EAAgBS,EAAuB,UAAU,WACnD,IAAIe,EAAS5hG,KAIb,OAAO,IAAIgzB,SAAQ,SAAUC,EAASC,GACpC0uE,EAAOR,GAASjgC,QAAQ,MAAM,SAAU/tC,GAClCA,EACFF,EAAOE,GAGTH,EAAQouE,OAAiBjiG,GAAW,GACtC,GACF,GACF,IAAIyhG,GAAwBW,GA4D5BvkG,EAAOD,QA3DiC,SAA2CumD,GACjF,IAAIs+C,EACAxvD,EAAWh1C,OAAOC,OAAOmkG,GAA4DrB,EAArByB,EAAiB,CAAC,EAAmCT,EAAS,CAChIxjG,MAAO2lD,EACPzlD,UAAU,IACRsiG,EAAgByB,EAAgBf,EAAc,CAChDljG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBd,EAAa,CAC/CnjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBb,EAAQ,CAC1CpjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBZ,EAAQ,CAC1CrjG,MAAO2lD,EAAO/W,eAAeuX,WAC7BjmD,UAAU,IACRsiG,EAAgByB,EAAgBV,EAAgB,CAClDvjG,MAAO,SAAeq1B,EAASC,GAC7B,IAAI/X,EAAOk3B,EAAS+uD,GAASpkF,OACzB7B,GACFk3B,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,EAAiBlmF,GAAM,MAE/Bk3B,EAASyuD,GAAgB7tE,EACzBof,EAAS0uD,GAAe7tE,EAE5B,EACAp1B,UAAU,IACR+jG,IA0BJ,OAzBAxvD,EAAS6uD,GAAgB,KACzBr9C,EAASN,GAAQ,SAAUnwB,GACzB,GAAIA,GAAoB,+BAAbA,EAAInN,KAAuC,CACpD,IAAIiN,EAASmf,EAAS0uD,GAUtB,OAPe,OAAX7tE,IACFmf,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB7tE,EAAOE,SAETif,EAAS2uD,GAAU5tE,EAErB,CACA,IAAIH,EAAUof,EAASyuD,GACP,OAAZ7tE,IACFof,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,OAAiBjiG,GAAW,KAEtCizC,EAAS4uD,IAAU,CACrB,IACA19C,EAAO7vB,GAAG,WAAY6tE,EAAWlsE,KAAK,KAAMgd,IACrCA,CACT,OClLAp1C,EAAOD,QAAU,WACf,MAAM,IAAIyC,MAAM,gDAClB,0BCyBAxC,EAAOD,QAAUg2D,EACjB,IAAIr2B,EAAY,EAAQ,KAExB,SAASq2B,EAAYnnC,GACnB,KAAM7rB,gBAAgBgzD,GAAc,OAAO,IAAIA,EAAYnnC,GAC3D8Q,EAAUrlB,KAAKtX,KAAM6rB,EACvB,CAJA,EAAQ,EAAR,CAAoBmnC,EAAar2B,GAKjCq2B,EAAYt1D,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC5DA,EAAG,KAAMijC,EACX,0BC/BA,IAAI1b,EASA+P,EAAiB,QACnBI,EAAmBJ,EAAeI,iBAClC2S,EAAuB/S,EAAe+S,qBACxC,SAASnsB,EAAK7mB,GAEZ,GAAIA,EAAK,MAAMA,CACjB,CA+BA,SAAS9b,EAAKqQ,GACZA,GACF,CACA,SAAS07C,EAAK1kE,EAAMg/E,GAClB,OAAOh/E,EAAK0kE,KAAKsa,EACnB,CA6BA1gF,EAAOD,QAvBP,WACE,IAAK,IAAIgkC,EAAOvlB,UAAU/c,OAAQojG,EAAU,IAAIpgG,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAClFq+C,EAAQr+C,GAAQhoC,UAAUgoC,GAE5B,IAKIhkC,EALAwgC,EATN,SAAqB6hD,GACnB,OAAKA,EAAQpjG,OAC8B,mBAAhCojG,EAAQA,EAAQpjG,OAAS,GAA0Bu7C,EACvD6nD,EAAQnrE,MAFasjB,CAG9B,CAKiB8nD,CAAYD,GAE3B,GADIpgG,MAAMC,QAAQmgG,EAAQ,MAAKA,EAAUA,EAAQ,IAC7CA,EAAQpjG,OAAS,EACnB,MAAM,IAAI+0D,EAAiB,WAG7B,IAAIuuC,EAAWF,EAAQvjE,KAAI,SAAUglB,EAAQ/hD,GAC3C,IAAI++D,EAAU/+D,EAAIsgG,EAAQpjG,OAAS,EAEnC,OAnDJ,SAAmB6kD,EAAQgd,EAASqG,EAAS3mB,GAC3CA,EAnBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACDA,IACJA,GAAS,EACTvD,EAAShhC,WAAM,EAAQxD,WACzB,CACF,CAYaqX,CAAKmtB,GAChB,IAAIgiD,GAAS,EACb1+C,EAAO7vB,GAAG,SAAS,WACjBuuE,GAAS,CACX,SACY7iG,IAARkkD,IAAmBA,EAAM,EAAQ,KACrCA,EAAIC,EAAQ,CACVtX,SAAUs0B,EACVziE,SAAU8oE,IACT,SAAUxzC,GACX,GAAIA,EAAK,OAAO6sB,EAAS7sB,GACzB6uE,GAAS,EACThiD,GACF,IACA,IAAIxT,GAAY,EAChB,OAAO,SAAUrZ,GACf,IAAI6uE,IACAx1D,EAIJ,OAHAA,GAAY,EAtBhB,SAAmB8W,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuBQC,CAAUf,GAAgBA,EAAOc,QACP,mBAAnBd,EAAO4d,QAA+B5d,EAAO4d,eACxDlhB,EAAS7sB,GAAO,IAAIgzC,EAAqB,QAC3C,CACF,CAyBW87B,CAAU3+C,EAAQgd,EADX/+D,EAAI,GACyB,SAAU4xB,GAC9C3T,IAAOA,EAAQ2T,GAChBA,GAAK4uE,EAAS96D,QAAQ5vB,GACtBipD,IACJyhC,EAAS96D,QAAQ5vB,GACjB2oC,EAASxgC,GACX,GACF,IACA,OAAOqiF,EAAQ/5D,OAAOs7B,EACxB,aCnFA,IAAInlE,EAAS,YACT8nD,EAAa,EAAQ,KACrB2G,EAAM,EAAQ,IACdwtC,EAAK,SACLx6F,EAAK,EAAQ,IACbo3C,EAAY,EAAQ,IACpB5T,EAAS,EAAQ,KAyErB,SAASo2E,EAAQ/rG,EAAGhI,EAAGypB,EAAM4M,GAE3B,IADAruB,EAAItP,EAAOS,KAAK6O,EAAElL,YACZ5D,OAAS8G,EAAEJ,aAAc,CAC7B,IAAI1B,EAAQxF,EAAOU,MAAM4G,EAAEJ,aAAeoI,EAAE9O,QAC5C8O,EAAItP,EAAO6hB,OAAO,CAACrc,EAAO8J,GAC5B,CACA,IAAIgsG,EAAOvqF,EAAKvwB,OACZ+6G,EAkBN,SAAsB1oG,EAAMvL,GAE1BuL,GADAA,EAAO2oG,EAAS3oG,EAAMvL,IACVzC,IAAIyC,GAChB,IAAIzB,EAAM7F,EAAOS,KAAKoS,EAAKzO,WAC3B,GAAIyB,EAAIrF,OAAS8G,EAAEJ,aAAc,CAC/B,IAAI1B,EAAQxF,EAAOU,MAAM4G,EAAEJ,aAAerB,EAAIrF,QAC9CqF,EAAM7F,EAAO6hB,OAAO,CAACrc,EAAOK,GAC9B,CACA,OAAOA,CACT,CA3Bc41G,CAAY1qF,EAAMzpB,GAC1BsmC,EAAI5tC,EAAOU,MAAM46G,GACrB1tE,EAAE7sC,KAAK,GACP,IAAImF,EAAIlG,EAAOU,MAAM46G,GAKrB,OAJAp1G,EAAI4hD,EAAWnqB,EAAMz3B,GAAGi3B,OAAOyQ,GAAGzQ,OAAOn9B,EAAOS,KAAK,CAAC,KAAK08B,OAAO7tB,GAAG6tB,OAAOo+E,GAAOh9E,SACnFqP,EAAIka,EAAWnqB,EAAMz3B,GAAGi3B,OAAOyQ,GAAGrP,SAG3B,CAAEr4B,EAFTA,EAAI4hD,EAAWnqB,EAAMz3B,GAAGi3B,OAAOyQ,GAAGzQ,OAAOn9B,EAAOS,KAAK,CAAC,KAAK08B,OAAO7tB,GAAG6tB,OAAOo+E,GAAOh9E,SAEpEqP,EADfA,EAAIka,EAAWnqB,EAAMz3B,GAAGi3B,OAAOyQ,GAAGrP,SAEpC,CAEA,SAASi9E,EAAUE,EAAOp0G,GACxB,IAAIuL,EAAO,IAAIpR,EAAGi6G,GACdxnG,GAASwnG,EAAMl7G,QAAU,GAAK8G,EAAEO,YAEpC,OADIqM,EAAQ,GAAGrB,EAAKS,MAAMY,GACnBrB,CACT,CAaA,SAAS8oG,EAASr0G,EAAGs0G,EAAIj+E,GACvB,IAAIh2B,EACAzB,EAEJ,EAAG,CAGD,IAFAyB,EAAI3H,EAAOU,MAAM,GAEC,EAAXiH,EAAEnH,OAAa8G,EAAEO,aACtB+zG,EAAGhuE,EAAIka,EAAWnqB,EAAMi+E,EAAG11G,GAAGi3B,OAAOy+E,EAAGhuE,GAAGrP,SAC3C52B,EAAI3H,EAAO6hB,OAAO,CAACla,EAAGi0G,EAAGhuE,IAG3B1nC,EAAIs1G,EAAS7zG,EAAGL,GAChBs0G,EAAG11G,EAAI4hD,EAAWnqB,EAAMi+E,EAAG11G,GAAGi3B,OAAOy+E,EAAGhuE,GAAGzQ,OAAOn9B,EAAOS,KAAK,CAAC,KAAK89B,SACpEq9E,EAAGhuE,EAAIka,EAAWnqB,EAAMi+E,EAAG11G,GAAGi3B,OAAOy+E,EAAGhuE,GAAGrP,QAC7C,QAAuB,IAAdr4B,EAAErC,IAAIyD,IAEf,OAAOpB,CACT,CAEA,SAAS21G,EAAOtmG,EAAGrP,EAAG2K,EAAGvJ,GACvB,OAAOiO,EAAE2B,MAAMzV,EAAGwZ,KAAKpK,IAAI4H,OAAOvS,GAAGoR,UAAUzS,IAAIyC,EACrD,CAEAvI,EAAOD,QAnIP,SAAeiyB,EAAM3wB,EAAK07G,EAAUC,EAAU9iE,GAC5C,IAAIoV,EAAOxV,EAAUz4C,GACrB,GAAIiuD,EAAKrpB,MAAO,CAEd,GAAiB,UAAb+2E,GAAqC,cAAbA,EAA0B,MAAM,IAAIx6G,MAAM,0BACtE,OAmBJ,SAAiBwvB,EAAMs9B,GACrB,IAAI2tD,EAAU/2E,EAAOopB,EAAKrpB,MAAMhK,KAAK,MACrC,IAAKghF,EAAS,MAAM,IAAIz6G,MAAM,iBAAmB8sD,EAAKrpB,MAAMhK,KAAK,MAEjE,IAEIn1B,EAFQ,IAAIo2F,EAAG+f,GACH5f,eAAe/tC,EAAK5T,YACtB2O,KAAKr4B,GAEnB,OAAO/wB,EAAOS,KAAKoF,EAAIg6F,QACzB,CA5BWoc,CAAOlrF,EAAMs9B,EACtB,CAAO,GAAkB,QAAdA,EAAKrxC,KAAgB,CAC9B,GAAiB,QAAb++F,EAAoB,MAAM,IAAIx6G,MAAM,0BACxC,OA2BJ,SAAkBwvB,EAAMs9B,EAAM1wB,GAU5B,IATA,IAKIz3B,EALAoJ,EAAI++C,EAAK3U,OAAOiB,SAChB9pC,EAAIw9C,EAAK3U,OAAO7oC,EAChBvJ,EAAI+mD,EAAK3U,OAAOpyC,EAChBiO,EAAI84C,EAAK3U,OAAOnkC,EAChB1S,EAAI,IAAIpB,EAAG,GAEX2qE,EAAIovC,EAASzqF,EAAMzpB,GAAGzC,IAAIyC,GAC1BiJ,GAAI,EACJqrG,EAAKP,EAAO/rG,EAAGhI,EAAGypB,EAAM4M,IACf,IAANptB,GAEL1N,EAAIg5G,EAAMtmG,EADVrP,EAAIy1G,EAAQr0G,EAAGs0G,EAAIj+E,GACH9sB,EAAGvJ,GAED,KADlBiJ,EAAIrK,EAAEkQ,KAAK9O,GAAG0G,KAAKo+D,EAAEtiE,IAAIwF,EAAEpM,IAAIL,KAAKgC,IAAIyC,IAClC6O,KAAK,KACT5F,GAAI,EACJ1N,EAAI,IAAIpB,EAAG,IAGf,OAGF,SAAgBoB,EAAG0N,GACjB1N,EAAIA,EAAEuB,UACNmM,EAAIA,EAAEnM,UAGK,IAAPvB,EAAE,KAAWA,EAAI,CAAC,GAAGgf,OAAOhf,IACrB,IAAP0N,EAAE,KAAWA,EAAI,CAAC,GAAGsR,OAAOtR,IAEhC,IACIlJ,EAAM,CAAC,GADCxE,EAAErC,OAAS+P,EAAE/P,OAAS,EACV,EAAMqC,EAAErC,QAEhC,OADA6G,EAAMA,EAAIwa,OAAOhf,EAAG,CAAC,EAAM0N,EAAE/P,QAAS+P,GAC/BvQ,EAAOS,KAAK4G,EACrB,CAfSw4F,CAAMh9F,EAAG0N,EAClB,CA/CW2rG,CAAQnrF,EAAMs9B,EAAMytD,EAC7B,CACE,GAAiB,QAAbC,GAAmC,cAAbA,EAA0B,MAAM,IAAIx6G,MAAM,0BAEtEwvB,EAAO/wB,EAAO6hB,OAAO,CAACo3B,EAAKloB,IAG3B,IAFA,IAAI5tB,EAAMkrD,EAAKC,QAAQpnD,aACnBkjC,EAAM,CAAC,EAAG,GACPrZ,EAAKvwB,OAAS4pC,EAAI5pC,OAAS,EAAI2C,GAAKinC,EAAItqB,KAAK,KACpDsqB,EAAItqB,KAAK,GAET,IADA,IAAIxc,GAAK,IACAA,EAAIytB,EAAKvwB,QAAQ4pC,EAAItqB,KAAKiR,EAAKztB,IAGxC,OADUmrD,EAAIrkB,EAAKikB,EAErB,EA8GAtvD,EAAOD,QAAQu8G,OAASA,EACxBt8G,EAAOD,QAAQ68G,QAAUA,0BC5IzB,MAAMzkC,EAAW,EAAQ,KACnBD,EAAW,EAAQ,KACnBz1E,EAAW,EAAQ,GAQzB,SAAS26G,EAAOnjG,EAAM+3C,GACpBjvD,KAAKkX,KAAOA,EACZlX,KAAKivD,KAAOA,EAEZjvD,KAAKm1E,SAAW,CAAC,EACjBn1E,KAAKo1E,SAAW,CAAC,CACnB,CAZYp4E,EAERE,OAAS,SAAgBga,EAAM+3C,GACjC,OAAO,IAAIorD,EAAOnjG,EAAM+3C,EAC1B,EAUAorD,EAAO38G,UAAU48G,aAAe,SAAqBh0F,GACnD,MAAMpP,EAAOlX,KAAKkX,KAElB,SAASqjG,EAAUrpD,GACjBlxD,KAAKw6G,WAAWtpD,EAAQh6C,EAC1B,CAMA,OALAxX,EAAS66G,EAAWj0F,GACpBi0F,EAAU78G,UAAU88G,WAAa,SAAoBtpD,EAAQh6C,GAC3DoP,EAAKhP,KAAKtX,KAAMkxD,EAAQh6C,EAC1B,EAEO,IAAIqjG,EAAUv6G,KACvB,EAEAq6G,EAAO38G,UAAU46E,YAAc,SAAqBroD,GAKlD,OAJAA,EAAMA,GAAO,MAERjwB,KAAKm1E,SAASjnD,eAAe+B,KAChCjwB,KAAKm1E,SAASllD,GAAOjwB,KAAKs6G,aAAanlC,EAASllD,KAC3CjwB,KAAKm1E,SAASllD,EACvB,EAEAoqF,EAAO38G,UAAU8hC,OAAS,SAAgBrkB,EAAM8U,EAAKpE,GACnD,OAAO7rB,KAAKs4E,YAAYroD,GAAKuP,OAAOrkB,EAAM0Q,EAC5C,EAEAwuF,EAAO38G,UAAUg5E,YAAc,SAAqBzmD,GAKlD,OAJAA,EAAMA,GAAO,MAERjwB,KAAKo1E,SAASlnD,eAAe+B,KAChCjwB,KAAKo1E,SAASnlD,GAAOjwB,KAAKs6G,aAAallC,EAASnlD,KAC3CjwB,KAAKo1E,SAASnlD,EACvB,EAEAoqF,EAAO38G,UAAU4sB,OAAS,SAAgBnP,EAAM8U,EAAoBqhC,GAClE,OAAOtxD,KAAK02E,YAAYzmD,GAAK3F,OAAOnP,EAAMm2C,EAC5C,0BCtDA,MAAM5xD,EAAW,EAAQ,GAEnB61E,EAAa,EAAQ,KAE3B,SAASklC,EAAWvpD,GAClBqkB,EAAWj+D,KAAKtX,KAAMkxD,GACtBlxD,KAAKiwB,IAAM,KACb,CACAvwB,EAAS+6G,EAAYllC,GACrBt4E,EAAOD,QAAUy9G,EAEjBA,EAAW/8G,UAAU4sB,OAAS,SAAgBnP,EAAM0Q,GAClD,MAEM9c,EAFMwmE,EAAW73E,UAAU4sB,OAAOhT,KAAKtX,KAAMmb,GAErCjZ,SAAS,UACjB6B,EAAM,CAAE,cAAgB8nB,EAAQ4wD,MAAQ,SAC9C,IAAK,IAAIj7E,EAAI,EAAGA,EAAIuN,EAAErQ,OAAQ8C,GAAK,GACjCuC,EAAIia,KAAKjP,EAAEmL,MAAM1Y,EAAGA,EAAI,KAE1B,OADAuC,EAAIia,KAAK,YAAc6N,EAAQ4wD,MAAQ,SAChC14E,EAAIm1B,KAAK,KAClB,0BCpBA,MAAMx5B,EAAW,EAAQ,GACnBxB,EAAS,aAETi5E,EAAa,EAAQ,KAE3B,SAASujC,EAAWxpD,GAClBimB,EAAW7/D,KAAKtX,KAAMkxD,GACtBlxD,KAAKiwB,IAAM,KACb,CACAvwB,EAASg7G,EAAYvjC,GACrBl6E,EAAOD,QAAU09G,EAEjBA,EAAWh9G,UAAU8hC,OAAS,SAAgBrkB,EAAM0Q,GAClD,MAAMivC,EAAQ3/C,EAAKjZ,WAAWgW,MAAM,YAE9BukE,EAAQ5wD,EAAQ4wD,MAAMxzD,cAEtB/Z,EAAK,kCACX,IAAIhO,GAAS,EACTC,GAAO,EACX,IAAK,IAAIK,EAAI,EAAGA,EAAIs5D,EAAMp8D,OAAQ8C,IAAK,CACrC,MAAMqmC,EAAQizB,EAAMt5D,GAAGqmC,MAAM34B,GAC7B,GAAc,OAAV24B,GAGAA,EAAM,KAAO40C,EAAjB,CAGA,IAAe,IAAXv7E,EAIG,CACL,GAAiB,QAAb2mC,EAAM,GACR,MACF1mC,EAAMK,EACN,KACF,CARE,GAAiB,UAAbqmC,EAAM,GACR,MACF3mC,EAAQM,CALA,CAYZ,CACA,IAAe,IAAXN,IAAyB,IAATC,EAClB,MAAM,IAAI1B,MAAM,8BAAgCg9E,GAElD,MAAMpjE,EAASyhD,EAAM5gD,MAAMhZ,EAAQ,EAAGC,GAAK+3B,KAAK,IAEhD7f,EAAOlX,QAAQ,kBAAmB,IAElC,MAAMkW,EAAQna,EAAOS,KAAK0a,EAAQ,UAClC,OAAO89D,EAAWz5E,UAAU8hC,OAAOloB,KAAKtX,KAAMqY,EAAOwT,EACvD,0BChDA,MAAMhsB,EAAO7C,EAEb6C,EAAKkuD,SAAW,SAChBluD,EAAKouD,cAAgB,QACrBpuD,EAAKmuD,cAAgB,QACrBnuD,EAAKsuD,KAAO,EAAQ,4BCLpB,MAAM/F,EAAYprD,EAGlBorD,EAAUuyD,SAAW,SAAiBp8E,GACpC,MAAMh5B,EAAM,CAAC,EAWb,OATAlI,OAAOkrB,KAAKgW,GAAK2I,SAAQ,SAAS5oC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMV,EAAQ2gC,EAAIjgC,GAClBiH,EAAI3H,GAASU,CACf,IAEOiH,CACT,EAEA6iD,EAAUitB,IAAM,EAAQ,4BCfxB,IAAIulC,EAAM,EAAQ,KAEdC,EAAOD,EAAI19G,OAAO,QAAQ,WAC5B8C,KAAKuuD,OAAO,CACVusD,QAAS96G,KAAK+6G,UACdC,YAAah7G,KAAKi7G,WAEtB,IAEIC,EAAqBN,EAAI19G,OAAO,sBAAsB,WACxD8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,QAAQ23E,QACjBj2E,KAAK1B,IAAI,SAASkwD,MAEtB,IAEI4sD,EAAsBR,EAAI19G,OAAO,uBAAuB,WAC1D8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,aAAa23E,QACtBj2E,KAAK1B,IAAI,cAAc+/B,WACvBr+B,KAAK1B,IAAI,SAAS23E,QAAQ53C,WAE9B,IAEIg9E,EAAuBT,EAAI19G,OAAO,wBAAwB,WAC5D8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,aAAamwD,IAAI2sD,GAC1Bp7G,KAAK1B,IAAI,oBAAoBg9G,SAEjC,IAEIC,EAA4BX,EAAI19G,OAAO,6BAA6B,WACtE8C,KAAKw7G,MAAMN,EACb,IAEIO,EAAcb,EAAI19G,OAAO,eAAe,WAC1C8C,KAAK07G,MAAMH,EACb,IAEII,EAAOf,EAAI19G,OAAO,QAAQ,WAC5B8C,KAAKuuD,OAAO,CACVqtD,YAAa57G,KAAKyuD,IAAIgtD,IAE1B,IAEII,EAAWjB,EAAI19G,OAAO,YAAY,WACpC8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,aAAamwD,IAAIosD,GAC1B76G,KAAK1B,IAAI,YAAYmwD,IAAIosD,GAE7B,IAEIiB,EAAYlB,EAAI19G,OAAO,aAAa,WACtC8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,UAAU23E,QACnBj2E,KAAK1B,IAAI,YAAY68C,OAAOkU,KAAI,GAChCrvD,KAAK1B,IAAI,aAAay9G,SAE1B,IAEIC,EAAiBpB,EAAI19G,OAAO,kBAAkB,WAChD8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,WAAWqwD,SAAS,GAAGstD,MAAM59E,WACtCr+B,KAAK1B,IAAI,gBAAgB29G,MACzBj8G,KAAK1B,IAAI,aAAamwD,IAAI2sD,GAC1Bp7G,KAAK1B,IAAI,UAAUmwD,IAAIktD,GACvB37G,KAAK1B,IAAI,YAAYmwD,IAAIotD,GACzB77G,KAAK1B,IAAI,WAAWmwD,IAAIktD,GACxB37G,KAAK1B,IAAI,wBAAwBmwD,IAAI4sD,GACrCr7G,KAAK1B,IAAI,kBAAkBswD,SAAS,GAAG0sD,SAASj9E,WAChDr+B,KAAK1B,IAAI,mBAAmBswD,SAAS,GAAG0sD,SAASj9E,WACjDr+B,KAAK1B,IAAI,cAAcqwD,SAAS,GAAG+sD,MAAMI,GAAWz9E,WAExD,IAEI69E,EAAkBtB,EAAI19G,OAAO,mBAAmB,WAClD8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,kBAAkBmwD,IAAIutD,GAC/Bh8G,KAAK1B,IAAI,sBAAsBmwD,IAAI2sD,GACnCp7G,KAAK1B,IAAI,kBAAkBg9G,SAE/B,IAEAr+G,EAAOD,QAAUk/G,aCvFjB,IAAIC,EAAW,wHACXC,EAAa,8CACbC,EAAY,iFACZC,EAAM,EAAQ,IACdzlE,EAAU,EAAQ,KAClB34C,EAAS,aACbjB,EAAOD,QAAU,SAAUu/G,EAAMtmE,GAC/B,IAEIumE,EAFAl+G,EAAMi+G,EAAKr6G,WACX2lC,EAAQvpC,EAAIupC,MAAMs0E,GAEtB,GAAKt0E,EAGE,CACL,IAAIouE,EAAQ,MAAQpuE,EAAM,GACtByO,EAAKp4C,EAAOS,KAAKkpC,EAAM,GAAI,OAC3BuQ,EAAal6C,EAAOS,KAAKkpC,EAAM,GAAG1lC,QAAQ,UAAW,IAAK,UAC1Ds6G,EAAYH,EAAIrmE,EAAUK,EAAGp8B,MAAM,EAAG,GAAIwD,SAASmqB,EAAM,GAAI,KAAKvpC,IAClEyF,EAAM,GACNo0C,EAAStB,EAAQ0B,iBAAiB09D,EAAOwG,EAAWnmE,GACxDvyC,EAAIia,KAAKm6B,EAAO9c,OAAO+c,IACvBr0C,EAAIia,KAAKm6B,EAAOnb,SAChBw/E,EAAYt+G,EAAO6hB,OAAOhc,EAC5B,KAbY,CACV,IAAI24G,EAASp+G,EAAIupC,MAAMw0E,GACvBG,EAAYt+G,EAAOS,KAAK+9G,EAAO,GAAGv6G,QAAQ,UAAW,IAAK,SAC5D,CAYA,MAAO,CACLg1C,IAFQ74C,EAAIupC,MAAMu0E,GAAY,GAG9BjhG,KAAMqhG,EAEV,gNC7BA,IAAIt+G,EAAS,YACTyB,EAAK,EAAQ,IACbw6F,EAAK,SACLpjD,EAAY,EAAQ,IACpB5T,EAAS,EAAQ,KAyErB,SAASw5E,EAAY14G,EAAGuB,GACtB,GAAIvB,EAAEoQ,KAAK,IAAM,EAAG,MAAM,IAAI5U,MAAM,eACpC,GAAIwE,EAAElC,IAAIyD,IAAMA,EAAG,MAAM,IAAI/F,MAAM,cACrC,CAEAxC,EAAOD,QA5EP,SAAiB6hG,EAAK5vE,EAAM3wB,EAAK27G,EAAU9iE,GACzC,IAAIsjD,EAAM1jD,EAAUz4C,GACpB,GAAiB,OAAbm8F,EAAIv/E,KAAe,CAErB,GAAiB,UAAb++F,GAAqC,cAAbA,EAA0B,MAAM,IAAIx6G,MAAM,yBACtE,OAmCJ,SAAmBo/F,EAAK5vE,EAAMwrE,GAC5B,IAAIyf,EAAU/2E,EAAOs3D,EAAIt/E,KAAKq8B,UAAUtU,MAAMhK,KAAK,MACnD,IAAKghF,EAAS,MAAM,IAAIz6G,MAAM,iBAAmBg7F,EAAIt/E,KAAKq8B,UAAUtU,MAAMhK,KAAK,MAE/E,IAAIgK,EAAQ,IAAIi3D,EAAG+f,GACf0C,EAASniB,EAAIt/E,KAAKw8B,kBAAkBx8B,KAExC,OAAO+nB,EAAMwa,OAAOzuB,EAAM4vE,EAAK+d,EACjC,CA3CWC,CAAShe,EAAK5vE,EAAMwrE,EAC7B,CAAO,GAAiB,QAAbA,EAAIv/E,KAAgB,CAC7B,GAAiB,QAAb++F,EAAoB,MAAM,IAAIx6G,MAAM,yBACxC,OA0CJ,SAAoBo/F,EAAK5vE,EAAMwrE,GAC7B,IAAI1rF,EAAI0rF,EAAIt/E,KAAKpM,EACbvJ,EAAIi1F,EAAIt/E,KAAK3V,EACbiO,EAAIgnF,EAAIt/E,KAAK1H,EACbhG,EAAIgtF,EAAIt/E,KAAK08B,QACbilE,EAAW/lE,EAAUiC,UAAUxZ,OAAOq/D,EAAK,OAC3CpwF,EAAIquG,EAASruG,EACb1N,EAAI+7G,EAAS/7G,EACjB47G,EAAWluG,EAAGjJ,GACdm3G,EAAW57G,EAAGyE,GACd,IAAIu3G,EAAQp9G,EAAGwZ,KAAKpK,GAChBtM,EAAIgM,EAAE6F,KAAK9O,GAOf,OAAoB,IANZiO,EAAE2B,MAAM2nG,GACbpmG,OAAO,IAAIhX,EAAGsvB,GAAM7tB,IAAIqB,GAAGM,IAAIyC,IAC/BgQ,UACApU,IAAIqM,EAAE2H,MAAM2nG,GAAOpmG,OAAO5V,EAAEK,IAAIqB,GAAGM,IAAIyC,IAAIgQ,WAC3CzS,IAAIgM,GACJhM,IAAIyC,GACEzD,IAAIhB,EACf,CA7DWi8G,CAAUne,EAAK5vE,EAAMwrE,EAC9B,CACE,GAAiB,QAAbwf,GAAmC,cAAbA,EAA0B,MAAM,IAAIx6G,MAAM,yBAEtEwvB,EAAO/wB,EAAO6hB,OAAO,CAACo3B,EAAKloB,IAI3B,IAHA,IAAI5tB,EAAMo5F,EAAIjuC,QAAQpnD,aAClBkjC,EAAM,CAAC,GACP20E,EAAS,EACNhuF,EAAKvwB,OAAS4pC,EAAI5pC,OAAS,EAAI2C,GACpCinC,EAAItqB,KAAK,KACTi/F,IAEF30E,EAAItqB,KAAK,GAET,IADA,IAAIxc,GAAK,IACAA,EAAIytB,EAAKvwB,QAChB4pC,EAAItqB,KAAKiR,EAAKztB,IAEhB8mC,EAAMpqC,EAAOS,KAAK2pC,GAClB,IAAInoC,EAAMR,EAAGwZ,KAAKshF,EAAIjuC,SAGtBqyC,GAFAA,EAAM,IAAIl/F,EAAGk/F,GAAKzpF,MAAMjV,IAEdwW,OAAO,IAAIhX,EAAG86F,EAAI3tC,iBAC5B+xC,EAAM3gG,EAAOS,KAAKkgG,EAAIrpF,UAAUlT,WAChC,IAAIyB,EAAMk5G,EAAS,EAAI,EAAI,EAK3B,IAJA57G,EAAMC,KAAKC,IAAIs9F,EAAIngG,OAAQ4pC,EAAI5pC,QAC3BmgG,EAAIngG,SAAW4pC,EAAI5pC,SAAQqF,EAAM,GAErCvC,GAAK,IACIA,EAAIH,GAAK0C,GAAO86F,EAAIr9F,GAAK8mC,EAAI9mC,GACtC,OAAe,IAARuC,CACT,aC7CA,IAAIg/B,EAAW,EAAQ,IACnBpjC,EAAK,EAAQ,GAEjB1C,EAAOD,QAAU,SAAqBkmC,GACpC,OAAO,IAAIg6E,EAAKh6E,EAClB,EAEA,IAAIi6E,EAAU,CACZvZ,UAAW,CACT1sF,KAAM,YACN9R,WAAY,IAEdg4G,UAAW,CACTlmG,KAAM,OACN9R,WAAY,IAEdi4G,WAAY,CACVnmG,KAAM,OACN9R,WAAY,IAEdk4G,WAAY,CACVpmG,KAAM,OACN9R,WAAY,IAEdm4G,QAAS,CACPrmG,KAAM,UACN9R,WAAY,IAEdo4G,UAAW,CACTtmG,KAAM,OACN9R,WAAY,IAEdq4G,UAAW,CACTvmG,KAAM,OACN9R,WAAY,KAUhB,SAAS83G,EAAMh6E,GACbljC,KAAK09G,UAAYP,EAAQj6E,GACpBljC,KAAK09G,YACR19G,KAAK09G,UAAY,CACfxmG,KAAMgsB,IAGVljC,KAAKkjC,MAAQ,IAAIH,EAASK,GAAGpjC,KAAK09G,UAAUxmG,MAC5ClX,KAAKuoB,UAAO,CACd,CAuDA,SAASgwF,EAAmBhkC,EAAItkD,EAAK5uB,GAC9BK,MAAMC,QAAQ4yE,KACjBA,EAAKA,EAAGjyE,WAEV,IAAInD,EAAM,IAAIjB,OAAOq2E,GACrB,GAAIlzE,GAAOlC,EAAIT,OAAS2C,EAAK,CAC3B,IAAIqC,EAAQ,IAAIxF,OAAOmD,EAAMlC,EAAIT,QACjCgF,EAAMzE,KAAK,GACXE,EAAMjB,OAAO6hB,OAAO,CAACrc,EAAOvE,GAC9B,CACA,OAAK8wB,EAGI9wB,EAAI+C,SAAS+tB,GAFb9wB,CAIX,CArFAg+G,EAAQrmG,KAAOqmG,EAAQC,UACvBD,EAAQQ,KAAOR,EAAQS,UAAYT,EAAQE,WAC3CF,EAAQpmG,KAAOomG,EAAQU,UAAYV,EAAQG,WAC3CH,EAAQW,KAAOX,EAAQK,UACvBL,EAAQY,KAAOZ,EAAQM,UAavBP,EAAKx/G,UAAUi7G,aAAe,SAAU1oF,EAAK0U,GAE3C,OADA3kC,KAAKuoB,KAAOvoB,KAAKkjC,MAAMy3D,aAChB36F,KAAK64G,aAAa5oF,EAAK0U,EAChC,EAEAu4E,EAAKx/G,UAAUo7G,cAAgB,SAAUh7B,EAAOkgC,EAAO/tF,GAOrD,OANA+tF,EAAQA,GAAS,OACZ9/G,OAAO6c,SAAS+iE,KACnBA,EAAQ,IAAI5/E,OAAO4/E,EAAOkgC,IAIrBzF,EAFQv4G,KAAKkjC,MAAMs3D,cAAc1c,GAAOge,YAC5B16F,IAAIpB,KAAKuoB,KAAK+yE,cAAcvrD,OACjB9f,EAAKjwB,KAAK09G,UAAUt4G,WACpD,EAEA83G,EAAKx/G,UAAUm7G,aAAe,SAAU5oF,EAAK0U,GAC3C,IAAIrmC,EAAM0B,KAAKuoB,KAAKuzE,UAAqB,eAAXn3D,GAAyB,GAQvD,MAPe,WAAXA,IACErmC,EAAIA,EAAII,OAAS,GAAK,EACxBJ,EAAI,GAAK,EAETA,EAAI,GAAK,GAGNi6G,EAAkBj6G,EAAK2xB,EAChC,EAEAitF,EAAKx/G,UAAUu7G,cAAgB,SAAUhpF,GACvC,OAAOsoF,EAAkBv4G,KAAKuoB,KAAK+yE,aAAcrrE,EACnD,EAEAitF,EAAKx/G,UAAUk6G,aAAe,SAAUnd,EAAKxqE,GAM3C,OALAA,EAAMA,GAAO,OACR/xB,OAAO6c,SAAS0/E,KACnBA,EAAM,IAAIv8F,OAAOu8F,EAAKxqE,IAExBjwB,KAAKuoB,KAAK20E,cAAczC,GACjBz6F,IACT,EAEAk9G,EAAKx/G,UAAUm6G,cAAgB,SAAUtrD,EAAMt8B,GAC7CA,EAAMA,GAAO,OACR/xB,OAAO6c,SAASwxC,KACnBA,EAAO,IAAIruD,OAAOquD,EAAMt8B,IAG1B,IAAI6nF,EAAQ,IAAIn4G,EAAG4sD,GAInB,OAHAurD,EAAQA,EAAM51G,SAAS,IACvBlC,KAAKuoB,KAAOvoB,KAAKkjC,MAAMy3D,aACvB36F,KAAKuoB,KAAKy0E,eAAe8a,GAClB93G,IACT,aC1GA,IAAI+2C,EAAY,EAAQ,IACpBzf,EAAc,EAAQ,IACtByuB,EAAa,EAAQ,IACrBk4D,EAAM,EAAQ,KACd12G,EAAM,EAAQ,KACd5H,EAAK,EAAQ,GACbu+G,EAAa,EAAQ,KACrBvxD,EAAM,EAAQ,IACdzuD,EAAS,YAEbjB,EAAOD,QAAU,SAAwBgoG,EAAWxlG,EAAKk6C,GACvD,IAAIl1C,EAEFA,EADEwgG,EAAUxgG,QACFwgG,EAAUxgG,QACXk1C,EACC,EAEA,EAEZ,IACI++B,EADAn6E,EAAMy4C,EAAUiuD,GAEpB,GAAgB,IAAZxgG,EACFi0E,EAkBJ,SAAen6E,EAAKkB,GAClB,IAAI4E,EAAI9F,EAAIkuD,QAAQpnD,aAChB+4G,EAAO3+G,EAAId,OACX0/G,EAAQr4D,EAAW,QAAQ1qB,OAAOn9B,EAAOU,MAAM,IAAI69B,SACnD+xC,EAAO4vC,EAAM1/G,OACb2/G,EAAQ,EAAI7vC,EAChB,GAAI2vC,EAAO/5G,EAAIi6G,EAAQ,EACrB,MAAM,IAAI5+G,MAAM,oBAElB,IAAI6+G,EAAKpgH,EAAOU,MAAMwF,EAAI+5G,EAAOE,EAAQ,GACrCE,EAAQn6G,EAAIoqE,EAAO,EACnBgK,EAAOlhD,EAAYk3C,GACnBgwC,EAAWj3G,EAAIrJ,EAAO6hB,OAAO,CAACq+F,EAAOE,EAAIpgH,EAAOU,MAAM,EAAG,GAAIY,GAAM++G,GAAQN,EAAIzlC,EAAM+lC,IACrFE,EAAal3G,EAAIixE,EAAMylC,EAAIO,EAAUhwC,IACzC,OAAO,IAAI7uE,EAAGzB,EAAO6hB,OAAO,CAAC7hB,EAAOU,MAAM,GAAI6/G,EAAYD,GAAWp6G,GACvE,CAjCgBs6G,CAAKpgH,EAAKkB,QACjB,GAAgB,IAAZgF,EACTi0E,EAgCJ,SAAgBn6E,EAAKkB,EAAKk6C,GACxB,IAKI4kE,EALAH,EAAO3+G,EAAId,OACX0F,EAAI9F,EAAIkuD,QAAQpnD,aACpB,GAAI+4G,EAAO/5G,EAAI,GACb,MAAM,IAAI3E,MAAM,oBAQlB,OAJE6+G,EADE5kE,EACGx7C,EAAOU,MAAMwF,EAAI+5G,EAAO,EAAG,KAMpC,SAAkB98G,GAMhB,IALA,IAIII,EAJAsC,EAAM7F,EAAOW,YAAYwC,GACzBG,EAAI,EACJ61G,EAAQ//E,EAAkB,EAANj2B,GACpB2mC,EAAM,EAEHxmC,EAAIH,GACL2mC,IAAQqvE,EAAM34G,SAChB24G,EAAQ//E,EAAkB,EAANj2B,GACpB2mC,EAAM,IAERvmC,EAAM41G,EAAMrvE,QAEVjkC,EAAIvC,KAAOC,GAGf,OAAOsC,CACT,CArBS46G,CAAQv6G,EAAI+5G,EAAO,GAEnB,IAAIx+G,EAAGzB,EAAO6hB,OAAO,CAAC7hB,EAAOS,KAAK,CAAC,EAAG+6C,EAAU,EAAI,IAAK4kE,EAAIpgH,EAAOU,MAAM,GAAIY,GAAM4E,GAC7F,CA7CgBw6G,CAAMtgH,EAAKkB,EAAKk6C,OACvB,IAAgB,IAAZl1C,EAMT,MAAM,IAAI/E,MAAM,mBAJhB,IADAg5E,EAAY,IAAI94E,EAAGH,IACLuC,IAAIzD,EAAIkuD,UAAY,EAChC,MAAM,IAAI/sD,MAAM,4BAIpB,CACA,OAAIi6C,EACKiT,EAAI8rB,EAAWn6E,GAEf4/G,EAAWzlC,EAAWn6E,EAEjC,aCtCA,IAAIy4C,EAAY,EAAQ,IACpBknE,EAAM,EAAQ,KACd12G,EAAM,EAAQ,KACd5H,EAAK,EAAQ,GACbgtD,EAAM,EAAQ,IACd5G,EAAa,EAAQ,IACrBm4D,EAAa,EAAQ,KACrBhgH,EAAS,YAEbjB,EAAOD,QAAU,SAAyB27C,EAAY1oB,EAAKypB,GACzD,IAAIl1C,EAEFA,EADEm0C,EAAWn0C,QACHm0C,EAAWn0C,QACZk1C,EACC,EAEA,EAGZ,IAKIl6C,EALAlB,EAAMy4C,EAAU4B,GAChBv0C,EAAI9F,EAAIkuD,QAAQpnD,aACpB,GAAI6qB,EAAIvxB,OAAS0F,GAAK,IAAIzE,EAAGswB,GAAKluB,IAAIzD,EAAIkuD,UAAY,EACpD,MAAM,IAAI/sD,MAAM,oBAIhBD,EADEk6C,EACIwkE,EAAW,IAAIv+G,EAAGswB,GAAM3xB,GAExBquD,EAAI18B,EAAK3xB,GAEjB,IAAIugH,EAAU3gH,EAAOU,MAAMwF,EAAI5E,EAAId,QAEnC,GADAc,EAAMtB,EAAO6hB,OAAO,CAAC8+F,EAASr/G,GAAM4E,GACpB,IAAZI,EACF,OAUJ,SAAelG,EAAKkB,GAClB,IAAI4E,EAAI9F,EAAIkuD,QAAQpnD,aAChBg5G,EAAQr4D,EAAW,QAAQ1qB,OAAOn9B,EAAOU,MAAM,IAAI69B,SACnD+xC,EAAO4vC,EAAM1/G,OACjB,GAAe,IAAXc,EAAI,GACN,MAAM,IAAIC,MAAM,oBAElB,IAAIg/G,EAAaj/G,EAAI0a,MAAM,EAAGs0D,EAAO,GACjCgwC,EAAWh/G,EAAI0a,MAAMs0D,EAAO,GAC5BgK,EAAOjxE,EAAIk3G,EAAYR,EAAIO,EAAUhwC,IACrCswC,EAAKv3G,EAAIi3G,EAAUP,EAAIzlC,EAAMp0E,EAAIoqE,EAAO,IAC5C,GAoCF,SAAkBxqE,EAAGC,GACnBD,EAAI9F,EAAOS,KAAKqF,GAChBC,EAAI/F,EAAOS,KAAKsF,GAChB,IAAI86G,EAAM,EACN19G,EAAM2C,EAAEtF,OACRsF,EAAEtF,SAAWuF,EAAEvF,SACjBqgH,IACA19G,EAAMC,KAAKC,IAAIyC,EAAEtF,OAAQuF,EAAEvF,SAG7B,IADA,IAAI8C,GAAK,IACAA,EAAIH,GACX09G,GAAQ/6G,EAAExC,GAAKyC,EAAEzC,GAEnB,OAAOu9G,CACT,CAlDMj/F,CAAQs+F,EAAOU,EAAG5kG,MAAM,EAAGs0D,IAC7B,MAAM,IAAI/uE,MAAM,oBAGlB,IADA,IAAI+B,EAAIgtE,EACS,IAAVswC,EAAGt9G,IACRA,IAEF,GAAgB,IAAZs9G,EAAGt9G,KACL,MAAM,IAAI/B,MAAM,oBAElB,OAAOq/G,EAAG5kG,MAAM1Y,EAClB,CAhCWk9G,CAAKpgH,EAAKkB,GACZ,GAAgB,IAAZgF,EACT,OAgCJ,SAAgBlG,EAAKkB,EAAKk6C,GAIxB,IAHA,IAAI06C,EAAK50F,EAAI0a,MAAM,EAAG,GAClB1Y,EAAI,EACJoqF,EAAS,EACO,IAAbpsF,EAAIgC,MACT,GAAIA,GAAKhC,EAAId,OAAQ,CACnBktF,IACA,KACF,CAEF,IAAI0yB,EAAK9+G,EAAI0a,MAAM,EAAG1Y,EAAI,GAQ1B,IAN4B,SAAvB4yF,EAAGlyF,SAAS,SAAsBw3C,GAAoC,SAAvB06C,EAAGlyF,SAAS,QAAqBw3C,IACnFkyC,IAEE0yB,EAAG5/G,OAAS,GACdktF,IAEEA,EACF,MAAM,IAAInsF,MAAM,oBAElB,OAAOD,EAAI0a,MAAM1Y,EACnB,CAtDWo9G,CAAMtgH,EAAKkB,EAAKk6C,GAClB,GAAgB,IAAZl1C,EACT,OAAOhF,EAEP,MAAM,IAAIC,MAAM,kBAEpB,0BCvCA,IAAIsmD,EAAa,EAAQ,IACrBi5D,EAAgB,EAAQ,KAQ5B/hH,EAAOD,QAAUgiH,GALjB,SAAmB/gH,GACjB,IAAIkZ,EAAM4uC,EAAW,UAAU1qB,OAAOp9B,GAAQw+B,SAC9C,OAAOspB,EAAW,UAAU1qB,OAAOlkB,GAAKslB,QAC1C,4BCPA,IAAIwiF,EAAS,EAAQ,KACjB/gH,EAAS,YAEbjB,EAAOD,QAAU,SAAUkiH,GAWzB,SAASC,EAAWlhH,GAClB,IAAImhH,EAAUnhH,EAAOic,MAAM,GAAI,GAC3BmlG,EAAWphH,EAAOic,OAAO,GACzBolG,EAAcJ,EAAWE,GAE7B,KAAIC,EAAS,GAAKC,EAAY,GAC1BD,EAAS,GAAKC,EAAY,GAC1BD,EAAS,GAAKC,EAAY,GAC1BD,EAAS,GAAKC,EAAY,IAE9B,OAAOF,CACT,CAiBA,MAAO,CACL90F,OAtCF,SAAiB80F,GACf,IAAIC,EAAWH,EAAWE,GAE1B,OAAOH,EAAO30F,OAAOpsB,EAAO6hB,OAAO,CACjCq/F,EACAC,GACCD,EAAQ1gH,OAAS,GACtB,EAgCE8gC,OATF,SAAiB/+B,GACf,IACI2+G,EAAUD,EADDF,EAAOz/E,OAAO/+B,IAE3B,IAAK2+G,EAAS,MAAM,IAAI3/G,MAAM,oBAC9B,OAAO2/G,CACT,EAKEryB,aAjBF,SAAuBtsF,GACrB,IAAIxC,EAASghH,EAAOlyB,aAAatsF,GACjC,GAAKxC,EAEL,OAAOkhH,EAAUlhH,EACnB,EAcF,aCjDA,IAAIsuF,EAAQ,EAAQ,KAGpBtvF,EAAOD,QAAUuvF,EAFF,sFCMf,IAAIgzB,EAAU,YA+GdtiH,EAAOD,QA9GP,SAAewvF,GACb,GAAIA,EAAS9tF,QAAU,IAAO,MAAM,IAAIK,UAAU,qBAElD,IADA,IAAI0tF,EAAW,IAAI5yE,WAAW,KACrBrX,EAAI,EAAGA,EAAIiqF,EAAS/tF,OAAQ8D,IACnCiqF,EAASjqF,GAAK,IAEhB,IAAK,IAAIhB,EAAI,EAAGA,EAAIgrF,EAAS9tF,OAAQ8C,IAAK,CACxC,IAAIgM,EAAIg/E,EAASxjE,OAAOxnB,GACpBkrF,EAAKl/E,EAAE5M,WAAW,GACtB,GAAqB,MAAjB6rF,EAASC,GAAe,MAAM,IAAI3tF,UAAUyO,EAAI,iBACpDi/E,EAASC,GAAMlrF,CACjB,CACA,IAAImrF,EAAOH,EAAS9tF,OAChBkuF,EAASJ,EAASxjE,OAAO,GACzB6jE,EAASvrF,KAAKwnC,IAAI6jD,GAAQrrF,KAAKwnC,IAAI,KACnCgkD,EAAUxrF,KAAKwnC,IAAI,KAAOxnC,KAAKwnC,IAAI6jD,GAyCvC,SAASI,EAAc5sC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAIphD,UAAU,mBACtD,GAAsB,IAAlBohD,EAAOzhD,OAAgB,OAAO6gH,EAAQ3gH,MAAM,GAKhD,IAJA,IAAIouF,EAAM,EAENC,EAAS,EACTvuF,EAAS,EACNyhD,EAAO6sC,KAASJ,GACrBK,IACAD,IAMF,IAHA,IAAIhuF,GAAUmhD,EAAOzhD,OAASsuF,GAAOH,EAAU,IAAO,EAClDK,EAAO,IAAIrzE,WAAW7a,GAEnBmhD,EAAO6sC,IAAM,CAElB,IAAI7oF,EAAQsoF,EAAStsC,EAAOv/C,WAAWosF,IAEvC,GAAc,MAAV7oF,EAAiB,OAErB,IADA,IAAI3C,EAAI,EACC2rF,EAAMnuF,EAAO,GAAc,IAAVmF,GAAe3C,EAAI9C,KAAqB,IAATyuF,EAAaA,IAAO3rF,IAC3E2C,GAAUwoF,EAAOO,EAAKC,KAAU,EAChCD,EAAKC,GAAQhpF,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAI1E,MAAM,kBACnCf,EAAS8C,EACTwrF,GACF,CAGA,IADA,IAAII,EAAMpuF,EAAON,EACV0uF,IAAQpuF,GAAsB,IAAdkuF,EAAKE,IAC1BA,IAEF,IAAIC,EAAMkyB,EAAQ1gH,YAAYouF,GAAUjuF,EAAOouF,IAC/CC,EAAIpuF,KAAK,EAAM,EAAGguF,GAElB,IADA,IAAIzqF,EAAIyqF,EACDG,IAAQpuF,GACbquF,EAAI7qF,KAAO0qF,EAAKE,KAElB,OAAOC,CACT,CAMA,MAAO,CACL/iE,OAzFF,SAAiB61B,GAEf,IADIz+C,MAAMC,QAAQw+C,IAAWA,aAAkBtmC,cAAcsmC,EAASo/D,EAAQ5gH,KAAKwhD,KAC9Eo/D,EAAQxkG,SAASolC,GAAW,MAAM,IAAIphD,UAAU,mBACrD,GAAsB,IAAlBohD,EAAOzhD,OAAgB,MAAO,GAMlC,IAJA,IAAIuuF,EAAS,EACTvuF,EAAS,EACT4uF,EAAS,EACTC,EAAOptC,EAAOzhD,OACX4uF,IAAWC,GAA2B,IAAnBptC,EAAOmtC,IAC/BA,IACAL,IAMF,IAHA,IAAIjuF,GAASuuF,EAAOD,GAAUR,EAAU,IAAO,EAC3CU,EAAM,IAAI3zE,WAAW7a,GAElBsuF,IAAWC,GAAM,CAItB,IAHA,IAAIppF,EAAQg8C,EAAOmtC,GAEf9rF,EAAI,EACCisF,EAAMzuF,EAAO,GAAc,IAAVmF,GAAe3C,EAAI9C,KAAqB,IAAT+uF,EAAaA,IAAOjsF,IAC3E2C,GAAU,IAAMqpF,EAAIC,KAAU,EAC9BD,EAAIC,GAAQtpF,EAAQwoF,IAAU,EAC9BxoF,EAASA,EAAQwoF,IAAU,EAE7B,GAAc,IAAVxoF,EAAe,MAAM,IAAI1E,MAAM,kBACnCf,EAAS8C,EACT8rF,GACF,CAGA,IADA,IAAII,EAAM1uF,EAAON,EACVgvF,IAAQ1uF,GAAqB,IAAbwuF,EAAIE,IACzBA,IAIF,IADA,IAAIzsF,EAAM2rF,EAAOrxB,OAAO0xB,GACjBS,EAAM1uF,IAAQ0uF,EAAOzsF,GAAOurF,EAASxjE,OAAOwkE,EAAIE,IACvD,OAAOzsF,CACT,EAmDE8rF,aAAcA,EACdvtD,OARF,SAAiB/+B,GACf,IAAIxC,EAAS8uF,EAAatsF,GAC1B,GAAIxC,EAAU,OAAOA,EACrB,MAAM,IAAIwB,MAAM,WAAaktF,EAAO,aACtC,EAMF,0BCpHA1vF,EAAOD,QAAU,EAAQ,IAAR,CAAiB,EAAQ,8BCA1C,IAAIsC,EAAS,EAAQ,KACjB+1E,EAAM,EAAQ,KACdmqC,EAAW,EAAQ,KAEvB,SAASC,EAAqB7hH,EAAO8gC,GACnC,YAAct/B,IAAVxB,EAA4B8gC,GAEhCp/B,EAAO2mC,UAAUroC,EAAO4hH,EAASE,yBAC1B9hH,EACT,CAEAX,EAAOD,QAAU,SAAU4mG,GACzB,MAAO,CACLkB,iBAAkB,SAAUnsD,GAE1B,OADAr5C,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACR,KAAtBhnE,EAAWj6C,QAAiBklG,EAAUkB,iBAAiBnsD,EAChE,EAEAinE,iBAAkB,SAAUjnE,EAAYknE,GACtCvgH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAE/CF,EAAaJ,EAAoBI,GAAY,GAC7C,IAAI7a,EAAYpB,EAAUgc,iBAAiBjnE,EAAYknE,GAEvD,OAAOxqC,EAAIuqC,iBAAiBjnE,EAAYqsD,EAAW6a,EACrD,EAEAG,iBAAkB,SAAUrnE,GAI1B,GAHAr5C,EAAOyb,SAAS49B,EAAY6mE,EAASG,8BAErChnE,EAAa08B,EAAI2qC,iBAAiBrnE,KACM,KAAtBA,EAAWj6C,QAAiBklG,EAAUkB,iBAAiBnsD,GAAa,OAAOA,EAE7F,MAAM,IAAIl5C,MAAM+/G,EAASS,+BAC3B,EAEAC,iBAAkB,SAAUvnE,GAI1B,OAHAr5C,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAExCnc,EAAUsc,iBAAiBvnE,EACpC,EAEAwnE,qBAAsB,SAAUxnE,GAI9B,OAHAr5C,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAExCnc,EAAUuc,qBAAqBxnE,EACxC,EAEAmtD,mBAAoB,SAAUntD,EAAYynE,GAOxC,OANA9gH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAE/CzgH,EAAOyb,SAASqlG,EAAOZ,EAASa,oBAChC/gH,EAAOwgH,eAAeM,EAAO,GAAIZ,EAASc,sBAEnC1c,EAAUkC,mBAAmBntD,EAAYynE,EAClD,EAEAG,mBAAoB,SAAU5nE,EAAYynE,GAOxC,OANA9gH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAE/CzgH,EAAOyb,SAASqlG,EAAOZ,EAASa,oBAChC/gH,EAAOwgH,eAAeM,EAAO,GAAIZ,EAASc,sBAEnC1c,EAAU2c,mBAAmB5nE,EAAYynE,EAClD,EAEArb,gBAAiB,SAAUpsD,EAAYknE,GAMrC,OALAvgH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAE/CF,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAUmB,gBAAgBpsD,EAAYknE,EAC/C,EAEA3a,iBAAkB,SAAUF,EAAW6a,GAMrC,OALAvgH,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BACpClhH,EAAOmhH,gBAAgBzb,EAAW,GAAI,GAAIwa,EAASkB,8BAEnDb,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAUsB,iBAAiBF,EAAW6a,EAC/C,EAEA5a,gBAAiB,SAAUD,GAEzB,OADA1lG,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BAC7B5c,EAAUqB,gBAAgBD,EACnC,EAEAe,kBAAmB,SAAUf,EAAWob,EAAOP,GAS7C,OARAvgH,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BACpClhH,EAAOmhH,gBAAgBzb,EAAW,GAAI,GAAIwa,EAASkB,8BAEnDphH,EAAOyb,SAASqlG,EAAOZ,EAASa,oBAChC/gH,EAAOwgH,eAAeM,EAAO,GAAIZ,EAASc,sBAE1CT,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAUmC,kBAAkBf,EAAWob,EAAOP,EACvD,EAEAc,kBAAmB,SAAU3b,EAAWob,EAAOP,GAS7C,OARAvgH,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BACpClhH,EAAOmhH,gBAAgBzb,EAAW,GAAI,GAAIwa,EAASkB,8BAEnDphH,EAAOyb,SAASqlG,EAAOZ,EAASa,oBAChC/gH,EAAOwgH,eAAeM,EAAO,GAAIZ,EAASc,sBAE1CT,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAU+c,kBAAkB3b,EAAWob,EAAOP,EACvD,EAEAe,iBAAkB,SAAUC,EAAYhB,GACtCvgH,EAAOqC,QAAQk/G,EAAYrB,EAASsB,6BACpCxhH,EAAOyhH,eAAeF,EAAYrB,EAASwB,+BAC3C,IAAK,IAAIx/G,EAAI,EAAGA,EAAIq/G,EAAWniH,SAAU8C,EACvClC,EAAOyb,SAAS8lG,EAAWr/G,GAAIg+G,EAASgB,4BACxClhH,EAAOmhH,gBAAgBI,EAAWr/G,GAAI,GAAI,GAAIg+G,EAASkB,8BAKzD,OAFAb,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAUgd,iBAAiBC,EAAYhB,EAChD,EAEAoB,mBAAoB,SAAUjoE,GAI5B,OAHA15C,EAAOyb,SAASi+B,EAAWwmE,EAAS0B,8BACpC5hH,EAAOwgH,eAAe9mE,EAAW,GAAIwmE,EAAS2B,gCAEvCvd,EAAUqd,mBAAmBjoE,EACtC,EAEAooE,gBAAiB,SAAUpoE,GACzB15C,EAAOyb,SAASi+B,EAAWwmE,EAAS0B,8BACpC5hH,EAAOwgH,eAAe9mE,EAAW,GAAIwmE,EAAS2B,gCAE9C,IAAIE,EAASzd,EAAUwd,gBAAgBpoE,GACvC,OAAOq8B,EAAI+rC,gBAAgBC,EAC7B,EAEAC,gBAAiB,SAAUziB,GACzBv/F,EAAOyb,SAAS8jF,EAAK2gB,EAAS0B,8BAC9B5hH,EAAOyhH,eAAeliB,EAAK2gB,EAAS2B,gCAEpC,IAAIE,EAAShsC,EAAIisC,gBAAgBziB,GACjC,GAAIwiB,EAAQ,OAAOzd,EAAU0d,gBAAgBD,GAE7C,MAAM,IAAI5hH,MAAM+/G,EAAS+B,+BAC3B,EAEAC,mBAAoB,SAAU3iB,GAC5Bv/F,EAAOyb,SAAS8jF,EAAK2gB,EAAS0B,8BAC9B5hH,EAAOyhH,eAAeliB,EAAK2gB,EAAS2B,gCAEpC,IAAIE,EAAShsC,EAAImsC,mBAAmB3iB,GACpC,GAAIwiB,EAAQ,OAAOzd,EAAU0d,gBAAgBD,GAE7C,MAAM,IAAI5hH,MAAM+/G,EAAS+B,+BAC3B,EAEAj6D,KAAM,SAAU7gC,EAASkyB,EAAY9sB,GACnCvsB,EAAOyb,SAAS0L,EAAS+4F,EAASiC,oBAClCniH,EAAOwgH,eAAer5F,EAAS,GAAI+4F,EAASkC,sBAE5CpiH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAE/C,IAAI5kG,EAAO,KACPwmG,EAAU,KAgBd,YAfgBviH,IAAZysB,IACFvsB,EAAOyuB,SAASlC,EAAS2zF,EAASoC,2BAEbxiH,IAAjBysB,EAAQ1Q,OACV7b,EAAOyb,SAAS8Q,EAAQ1Q,KAAMqkG,EAASqC,2BACvCviH,EAAOwgH,eAAej0F,EAAQ1Q,KAAM,GAAIqkG,EAASsC,6BACjD3mG,EAAO0Q,EAAQ1Q,WAGO/b,IAApBysB,EAAQ81F,UACVriH,EAAOsnC,WAAW/a,EAAQ81F,QAASnC,EAASuC,8BAC5CJ,EAAU91F,EAAQ81F,UAIf/d,EAAUt8C,KAAK7gC,EAASkyB,EAAYgpE,EAASxmG,EACtD,EAEAuiC,OAAQ,SAAUj3B,EAASuyB,EAAWgsD,GAUpC,OATA1lG,EAAOyb,SAAS0L,EAAS+4F,EAASiC,oBAClCniH,EAAOwgH,eAAer5F,EAAS,GAAI+4F,EAASkC,sBAE5CpiH,EAAOyb,SAASi+B,EAAWwmE,EAAS0B,8BACpC5hH,EAAOwgH,eAAe9mE,EAAW,GAAIwmE,EAAS2B,gCAE9C7hH,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BACpClhH,EAAOmhH,gBAAgBzb,EAAW,GAAI,GAAIwa,EAASkB,8BAE5C9c,EAAUlmD,OAAOj3B,EAASuyB,EAAWgsD,EAC9C,EAEAgd,QAAS,SAAUv7F,EAASuyB,EAAWipE,EAAUpC,GAY/C,OAXAvgH,EAAOyb,SAAS0L,EAAS+4F,EAASiC,oBAClCniH,EAAOwgH,eAAer5F,EAAS,GAAI+4F,EAASkC,sBAE5CpiH,EAAOyb,SAASi+B,EAAWwmE,EAAS0B,8BACpC5hH,EAAOwgH,eAAe9mE,EAAW,GAAIwmE,EAAS2B,gCAE9C7hH,EAAOynC,SAASk7E,EAAUzC,EAAS0C,0BACnC5iH,EAAO6iH,mBAAmBF,GAAW,EAAG,EAAGzC,EAAS4C,2BAEpDvC,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAUoe,QAAQv7F,EAASuyB,EAAWipE,EAAUpC,EACzD,EAEAwC,KAAM,SAAUrd,EAAWrsD,GAOzB,OANAr5C,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BACpClhH,EAAOmhH,gBAAgBzb,EAAW,GAAI,GAAIwa,EAASkB,8BAEnDphH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAExCnc,EAAUye,KAAKrd,EAAWrsD,EACnC,EAEA2pE,WAAY,SAAUtd,EAAWrsD,EAAYknE,GAS3C,OARAvgH,EAAOyb,SAASiqF,EAAWwa,EAASgB,4BACpClhH,EAAOmhH,gBAAgBzb,EAAW,GAAI,GAAIwa,EAASkB,8BAEnDphH,EAAOyb,SAAS49B,EAAY6mE,EAASG,6BACrCrgH,EAAOwgH,eAAennE,EAAY,GAAI6mE,EAASO,+BAE/CF,EAAaJ,EAAoBI,GAAY,GAEtCjc,EAAU0e,WAAWtd,EAAWrsD,EAAYknE,EACrD,EAEJ,aChPA,IAAI3hH,EAAS,YAwGbjB,EAAOD,QAAU,CACfulH,MAvGF,SAAgBtkH,GACd,GAAIA,EAAOS,OAAS,EAAG,OAAO,EAC9B,GAAIT,EAAOS,OAAS,GAAI,OAAO,EAC/B,GAAkB,KAAdT,EAAO,GAAa,OAAO,EAC/B,GAAIA,EAAO,KAAOA,EAAOS,OAAS,EAAG,OAAO,EAC5C,GAAkB,IAAdT,EAAO,GAAa,OAAO,EAE/B,IAAIukH,EAAOvkH,EAAO,GAClB,GAAa,IAATukH,EAAY,OAAO,EACvB,GAAI,EAAIA,GAAQvkH,EAAOS,OAAQ,OAAO,EACtC,GAAyB,IAArBT,EAAO,EAAIukH,GAAgB,OAAO,EAEtC,IAAIC,EAAOxkH,EAAO,EAAIukH,GACtB,QAAa,IAATC,GACC,EAAID,EAAOC,IAAUxkH,EAAOS,QAEjB,IAAZT,EAAO,IACPukH,EAAO,GAAoB,IAAdvkH,EAAO,MAA8B,IAAZA,EAAO,KAE1B,IAAnBA,EAAOukH,EAAO,IACdC,EAAO,GAA2B,IAArBxkH,EAAOukH,EAAO,MAAqC,IAAnBvkH,EAAOukH,EAAO,IAEjE,EAkFEhjF,OAhFF,SAAiBvhC,GACf,GAAIA,EAAOS,OAAS,EAAG,MAAM,IAAIe,MAAM,oCACvC,GAAIxB,EAAOS,OAAS,GAAI,MAAM,IAAIe,MAAM,mCACxC,GAAkB,KAAdxB,EAAO,GAAa,MAAM,IAAIwB,MAAM,yBACxC,GAAIxB,EAAO,KAAOA,EAAOS,OAAS,EAAG,MAAM,IAAIe,MAAM,kCACrD,GAAkB,IAAdxB,EAAO,GAAa,MAAM,IAAIwB,MAAM,wBAExC,IAAI+iH,EAAOvkH,EAAO,GAClB,GAAa,IAATukH,EAAY,MAAM,IAAI/iH,MAAM,oBAChC,GAAI,EAAI+iH,GAAQvkH,EAAOS,OAAQ,MAAM,IAAIe,MAAM,wBAC/C,GAAyB,IAArBxB,EAAO,EAAIukH,GAAgB,MAAM,IAAI/iH,MAAM,4BAE/C,IAAIgjH,EAAOxkH,EAAO,EAAIukH,GACtB,GAAa,IAATC,EAAY,MAAM,IAAIhjH,MAAM,oBAChC,GAAK,EAAI+iH,EAAOC,IAAUxkH,EAAOS,OAAQ,MAAM,IAAIe,MAAM,uBAEzD,GAAgB,IAAZxB,EAAO,GAAW,MAAM,IAAIwB,MAAM,uBACtC,GAAI+iH,EAAO,GAAoB,IAAdvkH,EAAO,MAA8B,IAAZA,EAAO,IAAY,MAAM,IAAIwB,MAAM,8BAE7E,GAAuB,IAAnBxB,EAAOukH,EAAO,GAAW,MAAM,IAAI/iH,MAAM,uBAC7C,GAAIgjH,EAAO,GAA2B,IAArBxkH,EAAOukH,EAAO,MAAqC,IAAnBvkH,EAAOukH,EAAO,IAAY,MAAM,IAAI/iH,MAAM,8BAG3F,MAAO,CACLsB,EAAG9C,EAAOic,MAAM,EAAG,EAAIsoG,GACvB/zG,EAAGxQ,EAAOic,MAAM,EAAIsoG,GAExB,EAsDEl4F,OA9BF,SAAiBvpB,EAAG0N,GAClB,IAAI+zG,EAAOzhH,EAAErC,OACT+jH,EAAOh0G,EAAE/P,OACb,GAAa,IAAT8jH,EAAY,MAAM,IAAI/iH,MAAM,oBAChC,GAAa,IAATgjH,EAAY,MAAM,IAAIhjH,MAAM,oBAChC,GAAI+iH,EAAO,GAAI,MAAM,IAAI/iH,MAAM,wBAC/B,GAAIgjH,EAAO,GAAI,MAAM,IAAIhjH,MAAM,wBAC/B,GAAW,IAAPsB,EAAE,GAAW,MAAM,IAAItB,MAAM,uBACjC,GAAW,IAAPgP,EAAE,GAAW,MAAM,IAAIhP,MAAM,uBACjC,GAAI+iH,EAAO,GAAe,IAATzhH,EAAE,MAAyB,IAAPA,EAAE,IAAY,MAAM,IAAItB,MAAM,8BACnE,GAAIgjH,EAAO,GAAe,IAATh0G,EAAE,MAAyB,IAAPA,EAAE,IAAY,MAAM,IAAIhP,MAAM,8BAEnE,IAAIu5C,EAAY96C,EAAOW,YAAY,EAAI2jH,EAAOC,GAY9C,OATAzpE,EAAU,GAAK,GACfA,EAAU,GAAKA,EAAUt6C,OAAS,EAClCs6C,EAAU,GAAK,EACfA,EAAU,GAAKj4C,EAAErC,OACjBqC,EAAEqC,KAAK41C,EAAW,GAClBA,EAAU,EAAIwpE,GAAQ,EACtBxpE,EAAU,EAAIwpE,GAAQ/zG,EAAE/P,OACxB+P,EAAErL,KAAK41C,EAAW,EAAIwpE,GAEfxpE,CACT,8wECzGA,IAAI96C,EAAS,YACT6nD,EAAa,EAAQ,IACrBpmD,EAAK,EAAQ,GACbw6F,EAAK,SAELqlB,EAAW,EAAQ,KAEnBp8E,EAAK,IAAI+2D,EAAG,aACZuoB,EAAWt/E,EAAGF,MAoClB,SAASy/E,EAAe3d,GACtB,IAAIhiF,EAAQgiF,EAAU,GACtB,OAAQhiF,GACN,KAAK,EACL,KAAK,EACH,OAAyB,KAArBgiF,EAAUtmG,OAAsB,KAvC1C,SAAkCskB,EAAO4/F,GACvC,IAAIp1G,EAAI,IAAI7N,EAAGijH,GAGf,GAAIp1G,EAAEzL,IAAI2gH,EAAS3zG,IAAM,EAAG,OAAO,KAInC,IAAItB,GAHJD,EAAIA,EAAE4H,MAAMstG,EAASviH,MAGXiW,SAASD,QAAQ3I,GAAGoI,QAAQ8sG,EAASz+G,GAAGsS,UAGlD,OAFe,IAAVyM,IAAoBvV,EAAEqG,UAASrG,EAAIA,EAAEiJ,UAEnC0sB,EAAGi3D,QAAQ,CAAEI,IAAK,CAAEjtF,EAAGA,EAAGC,EAAGA,IACtC,CA4Bao1G,CAAwB7/F,EAAOgiF,EAAU9qF,MAAM,EAAG,KAC3D,KAAK,EACL,KAAK,EACL,KAAK,EACH,OAAyB,KAArB8qF,EAAUtmG,OAAsB,KA9B1C,SAAoCskB,EAAO4/F,EAASE,GAClD,IAAIt1G,EAAI,IAAI7N,EAAGijH,GACXn1G,EAAI,IAAI9N,EAAGmjH,GAGf,GAAIt1G,EAAEzL,IAAI2gH,EAAS3zG,IAAM,GAAKtB,EAAE1L,IAAI2gH,EAAS3zG,IAAM,EAAG,OAAO,KAM7D,GAJAvB,EAAIA,EAAE4H,MAAMstG,EAASviH,KACrBsN,EAAIA,EAAE2H,MAAMstG,EAASviH,MAGN,IAAV6iB,GAA4B,IAAVA,IAAmBvV,EAAEqG,WAAuB,IAAVkP,GAAiB,OAAO,KAGjF,IAAI+/F,EAAKv1G,EAAE4I,SAASD,QAAQ3I,GAC5B,OAAKC,EAAE2I,SAASN,QAAQitG,EAAGntG,QAAQ8sG,EAASz+G,IAAIU,SAEzCy+B,EAAGi3D,QAAQ,CAAEI,IAAK,CAAEjtF,EAAGA,EAAGC,EAAGA,KAF6B,IAGnE,CAaau1G,CAA0BhgG,EAAOgiF,EAAU9qF,MAAM,EAAG,IAAK8qF,EAAU9qF,MAAM,GAAI,KACtF,QACE,OAAO,KAEb,CAEAld,EAAQ8nG,iBAAmB,SAAUnsD,GACnC,IAAI47B,EAAK,IAAI50E,EAAGg5C,GAChB,OAAO47B,EAAGxyE,IAAI2gH,EAASlzG,GAAK,IAAM+kE,EAAG5vE,QACvC,EAEA3H,EAAQ4iH,iBAAmB,SAAUjnE,EAAYknE,GAC/C,IAAInvF,EAAI,IAAI/wB,EAAGg5C,GACf,GAAIjoB,EAAE3uB,IAAI2gH,EAASlzG,IAAM,GAAKkhB,EAAE/rB,SAAU,MAAM,IAAIlF,MAAM+/G,EAASyD,gCAEnE,OAAO/kH,EAAOS,KAAKykC,EAAGk3D,eAAe3hD,GAAYmjD,UAAU+jB,GAAY,GACzE,EAEA7iH,EAAQkjH,iBAAmB,SAAUvnE,GACnC,IAAI47B,EAAK,IAAI50E,EAAGg5C,GAChB,OAAO47B,EAAG5vE,SAAWzG,EAAOU,MAAM,IAAM8jH,EAASlzG,EAAEvH,IAAIssE,GAAIzhE,KAAK4vG,EAASlzG,GAAGtK,YAAYhH,EAAQ,KAAM,GACxG,EAEAlB,EAAQmjH,qBAAuB,SAAUxnE,GACvC,IAAI47B,EAAK,IAAI50E,EAAGg5C,GAChB,GAAI47B,EAAGxyE,IAAI2gH,EAASlzG,IAAM,GAAK+kE,EAAG5vE,SAAU,MAAM,IAAIlF,MAAM+/G,EAAS0D,8BAErE,OAAO3uC,EAAGjgE,KAAKouG,EAASlzG,GAAGtK,YAAYhH,EAAQ,KAAM,GACvD,EAEAlB,EAAQ8oG,mBAAqB,SAAUntD,EAAYynE,GACjD,IAAI7rC,EAAK,IAAI50E,EAAGygH,GAChB,GAAI7rC,EAAGxyE,IAAI2gH,EAASlzG,IAAM,EAAG,MAAM,IAAI/P,MAAM+/G,EAAS2D,+BAItD,GAFA5uC,EAAGzsE,KAAK,IAAInI,EAAGg5C,IACX47B,EAAGxyE,IAAI2gH,EAASlzG,IAAM,GAAG+kE,EAAGxsE,KAAK26G,EAASlzG,GAC1C+kE,EAAG5vE,SAAU,MAAM,IAAIlF,MAAM+/G,EAAS2D,+BAE1C,OAAO5uC,EAAGrvE,YAAYhH,EAAQ,KAAM,GACtC,EAEAlB,EAAQujH,mBAAqB,SAAU5nE,EAAYynE,GACjD,IAAI7rC,EAAK,IAAI50E,EAAGygH,GAChB,GAAI7rC,EAAGxyE,IAAI2gH,EAASlzG,IAAM,GAAK+kE,EAAG5vE,SAAU,MAAM,IAAIlF,MAAM+/G,EAAS4D,+BAKrE,OAHA7uC,EAAGroE,KAAK,IAAIvM,EAAGg5C,IACX47B,EAAGxyE,IAAI2gH,EAASlzG,KAAI+kE,EAAKA,EAAGzhE,KAAK4vG,EAASlzG,IAEvC+kE,EAAGrvE,YAAYhH,EAAQ,KAAM,GACtC,EAEAlB,EAAQ+nG,gBAAkB,SAAUpsD,EAAYknE,GAC9C,IAAInvF,EAAI,IAAI/wB,EAAGg5C,GACf,GAAIjoB,EAAE3uB,IAAI2gH,EAASlzG,IAAM,GAAKkhB,EAAE/rB,SAAU,MAAM,IAAIlF,MAAM+/G,EAAS6D,2BAEnE,OAAOnlH,EAAOS,KAAKykC,EAAGk3D,eAAe3hD,GAAYmjD,UAAU+jB,GAAY,GACzE,EAEA7iH,EAAQkoG,iBAAmB,SAAUF,EAAW6a,GAC9C,IAAIyD,EAAOX,EAAc3d,GACzB,GAAa,OAATse,EAAe,MAAM,IAAI7jH,MAAM+/G,EAAS+D,0BAE5C,OAAOrlH,EAAOS,KAAK2kH,EAAKxnB,UAAU+jB,GAAY,GAChD,EAEA7iH,EAAQioG,gBAAkB,SAAUD,GAClC,OAAoC,OAA7B2d,EAAc3d,EACvB,EAEAhoG,EAAQ+oG,kBAAoB,SAAUf,EAAWob,EAAOP,GACtD,IAAIyD,EAAOX,EAAc3d,GACzB,GAAa,OAATse,EAAe,MAAM,IAAI7jH,MAAM+/G,EAAS+D,0BAG5C,IADAnD,EAAQ,IAAIzgH,EAAGygH,IACLr+G,IAAI2gH,EAASlzG,IAAM,EAAG,MAAM,IAAI/P,MAAM+/G,EAASgE,8BAEzD,IAAIx1E,EAAQ00E,EAASjvG,EAAErS,IAAIg/G,GAAOp4G,IAAIs7G,EAAK7oB,KAC3C,GAAIzsD,EAAM2T,aAAc,MAAM,IAAIliD,MAAM+/G,EAASgE,8BAEjD,OAAOtlH,EAAOS,KAAKqvC,EAAM1jB,QAAO,EAAMu1F,GACxC,EAEA7iH,EAAQ2jH,kBAAoB,SAAU3b,EAAWob,EAAOP,GACtD,IAAIyD,EAAOX,EAAc3d,GACzB,GAAa,OAATse,EAAe,MAAM,IAAI7jH,MAAM+/G,EAAS+D,0BAG5C,IADAnD,EAAQ,IAAIzgH,EAAGygH,IACLr+G,IAAI2gH,EAASlzG,IAAM,GAAK4wG,EAAMz7G,SAAU,MAAM,IAAIlF,MAAM+/G,EAASiE,8BAE3E,OAAOvlH,EAAOS,KAAK2kH,EAAK7oB,IAAIr5F,IAAIg/G,GAAO91F,QAAO,EAAMu1F,GACtD,EAEA7iH,EAAQ4jH,iBAAmB,SAAUC,EAAYhB,GAE/C,IADA,IAAI6D,EAAQ,IAAIhiH,MAAMm/G,EAAWniH,QACxB8C,EAAI,EAAGA,EAAIq/G,EAAWniH,SAAU8C,EAEvC,GADAkiH,EAAMliH,GAAKmhH,EAAc9B,EAAWr/G,IACnB,OAAbkiH,EAAMliH,GAAa,MAAM,IAAI/B,MAAM+/G,EAAS+D,0BAIlD,IADA,IAAIv1E,EAAQ01E,EAAM,GAAGjpB,IACZj4F,EAAI,EAAGA,EAAIkhH,EAAMhlH,SAAU8D,EAAGwrC,EAAQA,EAAMhmC,IAAI07G,EAAMlhH,GAAGi4F,KAClE,GAAIzsD,EAAM2T,aAAc,MAAM,IAAIliD,MAAM+/G,EAASmE,4BAEjD,OAAOzlH,EAAOS,KAAKqvC,EAAM1jB,QAAO,EAAMu1F,GACxC,EAEA7iH,EAAQikH,mBAAqB,SAAUjoE,GACrC,IAAIj4C,EAAI,IAAIpB,EAAGq5C,EAAU9+B,MAAM,EAAG,KAC9BzL,EAAI,IAAI9O,EAAGq5C,EAAU9+B,MAAM,GAAI,KACnC,GAAInZ,EAAEgB,IAAI2gH,EAASlzG,IAAM,GAAKf,EAAE1M,IAAI2gH,EAASlzG,IAAM,EAAG,MAAM,IAAI/P,MAAM+/G,EAASoE,4BAE/E,IAAI3uE,EAAS/2C,EAAOS,KAAKq6C,GAGzB,OAFqB,IAAjBvqC,EAAE1M,IAAIqhC,EAAGg3D,KAAWsoB,EAASlzG,EAAEvH,IAAIwG,GAAGvJ,YAAYhH,EAAQ,KAAM,IAAIkF,KAAK6xC,EAAQ,IAE9EA,CACT,EAEAj4C,EAAQokH,gBAAkB,SAAUpoE,GAClC,IAAIj4C,EAAIi4C,EAAU9+B,MAAM,EAAG,IACvBzL,EAAIuqC,EAAU9+B,MAAM,GAAI,IAC5B,GAAI,IAAIva,EAAGoB,GAAGgB,IAAI2gH,EAASlzG,IAAM,GAAK,IAAI7P,EAAG8O,GAAG1M,IAAI2gH,EAASlzG,IAAM,EAAG,MAAM,IAAI/P,MAAM+/G,EAASoE,4BAE/F,MAAO,CAAE7iH,EAAGA,EAAG0N,EAAGA,EACpB,EAEAzR,EAAQskH,gBAAkB,SAAUD,GAClC,IAAItgH,EAAI,IAAIpB,EAAG0hH,EAAOtgH,GAClBA,EAAEgB,IAAI2gH,EAASlzG,IAAM,IAAGzO,EAAI,IAAIpB,EAAG,IAEvC,IAAI8O,EAAI,IAAI9O,EAAG0hH,EAAO5yG,GAGtB,OAFIA,EAAE1M,IAAI2gH,EAASlzG,IAAM,IAAGf,EAAI,IAAI9O,EAAG,IAEhCzB,EAAO6hB,OAAO,CACnBhf,EAAEmE,YAAYhH,EAAQ,KAAM,IAC5BuQ,EAAEvJ,YAAYhH,EAAQ,KAAM,KAEhC,EAEAlB,EAAQsqD,KAAO,SAAU7gC,EAASkyB,EAAYgpE,EAASxmG,GACrD,GAAuB,mBAAZwmG,EAAwB,CACjC,IAAIkC,EAAWlC,EACfA,EAAU,SAAUmC,GAClB,IAAI7oB,EAAQ4oB,EAASp9F,EAASkyB,EAAY,KAAMx9B,EAAM2oG,GACtD,IAAK5lH,EAAO6c,SAASkgF,IAA2B,KAAjBA,EAAMv8F,OAAe,MAAM,IAAIe,MAAM+/G,EAASuE,iBAE7E,OAAO,IAAIpkH,EAAGs7F,EAChB,CACF,CAEA,IAAIvqE,EAAI,IAAI/wB,EAAGg5C,GACf,GAAIjoB,EAAE3uB,IAAI2gH,EAASlzG,IAAM,GAAKkhB,EAAE/rB,SAAU,MAAM,IAAIlF,MAAM+/G,EAASuE,iBAEnE,IAAI9uE,EAAS7R,EAAGkkB,KAAK7gC,EAASkyB,EAAY,CAAEijD,WAAW,EAAMx3F,EAAGu9G,EAAS9mB,KAAM1/E,IAC/E,MAAO,CACL69B,UAAW96C,EAAO6hB,OAAO,CACvBk1B,EAAOl0C,EAAEmE,YAAYhH,EAAQ,KAAM,IACnC+2C,EAAOxmC,EAAEvJ,YAAYhH,EAAQ,KAAM,MAErC+jH,SAAUhtE,EAAO0mD,cAErB,EAEA3+F,EAAQ0gD,OAAS,SAAUj3B,EAASuyB,EAAWgsD,GAC7C,IAAIqc,EAAS,CAAEtgH,EAAGi4C,EAAU9+B,MAAM,EAAG,IAAKzL,EAAGuqC,EAAU9+B,MAAM,GAAI,KAE7D8pG,EAAO,IAAIrkH,EAAG0hH,EAAOtgH,GACrBkjH,EAAO,IAAItkH,EAAG0hH,EAAO5yG,GACzB,GAAIu1G,EAAKjiH,IAAI2gH,EAASlzG,IAAM,GAAKy0G,EAAKliH,IAAI2gH,EAASlzG,IAAM,EAAG,MAAM,IAAI/P,MAAM+/G,EAASoE,4BACrF,GAAwB,IAApBK,EAAKliH,IAAIqhC,EAAGg3D,KAAa4pB,EAAKr/G,UAAYs/G,EAAKt/G,SAAU,OAAO,EAEpE,IAAI2+G,EAAOX,EAAc3d,GACzB,GAAa,OAATse,EAAe,MAAM,IAAI7jH,MAAM+/G,EAAS+D,0BAE5C,OAAOngF,EAAGsa,OAAOj3B,EAAS46F,EAAQ,CAAE7zG,EAAG81G,EAAK7oB,IAAIjtF,EAAGC,EAAG61G,EAAK7oB,IAAIhtF,GACjE,EAEAzQ,EAAQglH,QAAU,SAAUv7F,EAASuyB,EAAWipE,EAAUpC,GACxD,IAAIwB,EAAS,CAAEtgH,EAAGi4C,EAAU9+B,MAAM,EAAG,IAAKzL,EAAGuqC,EAAU9+B,MAAM,GAAI,KAE7D8pG,EAAO,IAAIrkH,EAAG0hH,EAAOtgH,GACrBkjH,EAAO,IAAItkH,EAAG0hH,EAAO5yG,GACzB,GAAIu1G,EAAKjiH,IAAI2gH,EAASlzG,IAAM,GAAKy0G,EAAKliH,IAAI2gH,EAASlzG,IAAM,EAAG,MAAM,IAAI/P,MAAM+/G,EAASoE,4BAErF,IACE,GAAII,EAAKr/G,UAAYs/G,EAAKt/G,SAAU,MAAM,IAAIlF,MAE9C,IAAIuuC,EAAQ5K,EAAG24D,cAAct1E,EAAS46F,EAAQY,GAC9C,OAAO/jH,EAAOS,KAAKqvC,EAAM1jB,QAAO,EAAMu1F,GACxC,CAAE,MAAOzsF,GACP,MAAM,IAAI3zB,MAAM+/G,EAAS0E,mBAC3B,CACF,EAEAlnH,EAAQqlH,KAAO,SAAUrd,EAAWrsD,GAClC,IAAIwrE,EAASnnH,EAAQslH,WAAWtd,EAAWrsD,GAAY,GACvD,OAAOoN,EAAW,UAAU1qB,OAAO8oF,GAAQ1nF,QAC7C,EAEAz/B,EAAQslH,WAAa,SAAUtd,EAAWrsD,EAAYknE,GACpD,IAAIyD,EAAOX,EAAc3d,GACzB,GAAa,OAATse,EAAe,MAAM,IAAI7jH,MAAM+/G,EAAS+D,0BAE5C,IAAIa,EAAS,IAAIzkH,EAAGg5C,GACpB,GAAIyrE,EAAOriH,IAAI2gH,EAASlzG,IAAM,GAAK40G,EAAOz/G,SAAU,MAAM,IAAIlF,MAAM+/G,EAAS6E,WAE7E,OAAOnmH,EAAOS,KAAK2kH,EAAK7oB,IAAIr5F,IAAIgjH,GAAQ95F,QAAO,EAAMu1F,GACvD,aCtQA,MAAMyE,EAAS,EAAQ,KACvBA,EAAOnqC,MAAQ,EAAQ,KACvBl9E,EAAOD,QAAUsnH,aCFjB,MAAMrtF,EAAS,EAAQ,KACjB,aACJwiD,EAAY,SACZa,GACE,EAAQ,KAqBZr9E,EAAOD,QAlBP,SAAiBsB,EAAK43C,EAAMpoC,EAAG/M,EAAGgO,EAAG2qE,EAAOC,GAC1C,MAAM,GACJE,EAAE,EACFC,EAAC,IACDd,EAAG,EACHxrE,EAAC,GACDurE,EAAE,EACFzlE,EAAC,aACDsmE,GACEH,EAAan7E,EAAK43C,EAAMpoC,EAAG/M,EAAGgO,EAAG2qE,EAAOC,GAE5C,IAAK,IAAIn4E,EAAI,EAAGA,EAAIuN,EAAGvN,IACrB84E,EAAShnE,EAAO,IAAJ9R,EAAUT,EAAGA,EAAG+M,EAAGgsE,EAAGD,EAAId,EAAIC,EAAKxrE,EAAGosE,GAGpD,OAAO3iD,EAAOqhB,WAAWh6C,EAAKgV,EAAG,EAAGomE,EAAO,SAC7C,aCvBA,MAAMziD,EAAS,EAAQ,KACjB,aACJwiD,EAAY,KACZS,GACE,EAAQ,KAqBZj9E,EAAOD,QAlBPm9E,eAAuB77E,EAAK43C,EAAMpoC,EAAG/M,EAAGgO,EAAG2qE,EAAOC,EAAkBS,GAClE,MAAM,GACJP,EAAE,EACFC,EAAC,IACDd,EAAG,EACHxrE,EAAC,GACDurE,EAAE,EACFzlE,EAAC,aACDsmE,GACEH,EAAan7E,EAAK43C,EAAMpoC,EAAG/M,EAAGgO,EAAG2qE,EAAOC,GAE5C,IAAK,IAAIn4E,EAAI,EAAGA,EAAIuN,EAAGvN,UACf04E,EAAK5mE,EAAO,IAAJ9R,EAAUT,EAAGA,EAAG+M,EAAGgsE,EAAGD,EAAId,EAAIC,EAAKxrE,EAAGosE,EAAcQ,GAGpE,OAAOnjD,EAAOqhB,WAAWh6C,EAAKgV,EAAG,EAAGomE,EAAO,SAC7C,aCvBAz8E,EAAOD,QAAU,EAAQ,IAAR,CAAqB,EAAQ,iBCA9C,MAAMunH,EAAe,EAAQ,KACvBC,EAAc,EAAQ,KAE5BvnH,EAAOD,QAAU,SAAUynH,GACzB,MAAMC,EAASH,EAAaE,GACtBE,EAAQH,EAAYC,GAE1B,OAAO,SAAUjtE,EAAW3rB,GAE1B,OADkC,iBAAd2rB,EAAyBA,EAAU37B,cAAgB27B,GAErE,IAAK,YAAa,OAAO,IAAIktE,EAAO,KAAM,IAAK,KAAM,IAAK74F,GAC1D,IAAK,YAAa,OAAO,IAAI64F,EAAO,KAAM,IAAK,KAAM,IAAK74F,GAC1D,IAAK,YAAa,OAAO,IAAI64F,EAAO,IAAK,IAAK,KAAM,IAAK74F,GACzD,IAAK,YAAa,OAAO,IAAI64F,EAAO,IAAK,KAAM,KAAM,IAAK74F,GAE1D,IAAK,WAAY,OAAO,IAAI64F,EAAO,KAAM,IAAK,EAAM,IAAK74F,GACzD,IAAK,WAAY,OAAO,IAAI64F,EAAO,KAAM,IAAK,EAAM,IAAK74F,GACzD,IAAK,WAAY,OAAO,IAAI64F,EAAO,IAAK,IAAK,EAAM,IAAK74F,GACxD,IAAK,WAAY,OAAO,IAAI64F,EAAO,IAAK,KAAM,EAAM,IAAK74F,GAEzD,IAAK,WAAY,OAAO,IAAI84F,EAAM,KAAM,IAAK,GAAM94F,GACnD,IAAK,WAAY,OAAO,IAAI84F,EAAM,KAAM,IAAK,GAAM94F,GAEnD,QAAS,MAAM,IAAIpsB,MAAM,qBAAuB+3C,GAEpD,CACF,aC1BA,MAAM,UAAE7a,GAAc,EAAQ,IAE9B1/B,EAAOD,QAAWynH,GAAgB,MAAMC,UAAe/nF,EACrDh/B,YAAainH,EAAMC,EAAUC,EAAiBC,EAAel5F,GAC3DtF,MAAMsF,GAEN7rB,KAAKglH,MAAQJ,EACb5kH,KAAKilH,UAAYJ,EACjB7kH,KAAKklH,iBAAmBJ,EACxB9kH,KAAKmlH,eAAiBJ,EACtB/kH,KAAKolH,SAAWv5F,EAEhB7rB,KAAKqlH,OAAS,IAAIZ,EAClBzkH,KAAKqlH,OAAOC,WAAWV,EAAMC,GAC7B7kH,KAAK++D,YAAa,CACpB,CAEAnhC,WAAYohC,EAAO9/D,EAAU+gD,GAC3B,IAAIxgC,EAAQ,KACZ,IACEzf,KAAKq7B,OAAO2jC,EAAO9/D,EACrB,CAAE,MAAOk0B,GACP3T,EAAQ2T,CACV,CAEA6sB,EAASxgC,EACX,CAEAoe,OAAQoiB,GACN,IAAIxgC,EAAQ,KACZ,IACEzf,KAAKge,KAAKhe,KAAKy8B,SACjB,CAAE,MAAOrJ,GACP3T,EAAQ2T,CACV,CAEA6sB,EAASxgC,EACX,CAEA4b,OAAQlgB,EAAMjc,GACZ,IAAKhB,OAAO6c,SAASI,IAAyB,iBAATA,EAAmB,MAAM,IAAIpc,UAAU,qCAC5E,GAAIiB,KAAK++D,WAAY,MAAM,IAAIt/D,MAAM,yBAKrC,OAJKvB,OAAO6c,SAASI,KAAOA,EAAOjd,OAAOS,KAAKwc,EAAMjc,IAErDc,KAAKqlH,OAAOE,OAAOpqG,GAEZnb,IACT,CAEAy8B,OAAQv9B,GACN,GAAIc,KAAK++D,WAAY,MAAM,IAAIt/D,MAAM,yBACrCO,KAAK++D,YAAa,EAEd/+D,KAAKklH,kBAAkBllH,KAAKqlH,OAAOG,kBAAkBxlH,KAAKklH,kBAC9D,IAAIzoF,EAASz8B,KAAKqlH,OAAOI,QAAQzlH,KAAKmlH,eAAiB,GAKvD,YAJiB/lH,IAAbF,IAAwBu9B,EAASA,EAAOv6B,SAAShD,IAErDc,KAAK0lH,cAEEjpF,CACT,CAGAipF,cAEE,OADA1lH,KAAKqlH,OAAOC,WAAWtlH,KAAKglH,MAAOhlH,KAAKilH,WACjCjlH,IACT,CAGA2lH,SACE,MAAMriH,EAAQ,IAAIohH,EAAO1kH,KAAKglH,MAAOhlH,KAAKilH,UAAWjlH,KAAKklH,iBAAkBllH,KAAKmlH,eAAgBnlH,KAAKolH,UAItG,OAHAplH,KAAKqlH,OAAOjiH,KAAKE,EAAM+hH,QACvB/hH,EAAMy7D,WAAa/+D,KAAK++D,WAEjBz7D,CACT,cC3EFrG,EAAOD,QAAU,EAAjB,yCCEA,SAASw1B,EAAQlK,EAAQ23E,GAAkB,IAAI13E,EAAOlrB,OAAOkrB,KAAKD,GAAS,GAAIjrB,OAAOo1B,sBAAuB,CAAE,IAAIytE,EAAU7iG,OAAOo1B,sBAAsBnK,GAAS23E,IAAmBC,EAAUA,EAAQhiD,QAAO,SAAU93B,GAAO,OAAO/oB,OAAOonC,yBAAyBnc,EAAQlC,GAAKvoB,UAAY,KAAK0qB,EAAKvK,KAAKiB,MAAMsJ,EAAM23E,EAAU,CAAE,OAAO33E,CAAM,CACpV,SAAS43E,EAAc1/E,GAAU,IAAK,IAAIjf,EAAI,EAAGA,EAAIia,UAAU/c,OAAQ8C,IAAK,CAAE,IAAI2+C,EAAS,MAAQ1kC,UAAUja,GAAKia,UAAUja,GAAK,CAAC,EAAGA,EAAI,EAAIgxB,EAAQn1B,OAAO8iD,IAAS,GAAIjZ,SAAQ,SAAU5oC,GAAO8hG,EAAgB3/E,EAAQniB,EAAK6hD,EAAO7hD,GAAO,IAAKjB,OAAOknC,0BAA4BlnC,OAAO2iC,iBAAiBvf,EAAQpjB,OAAOknC,0BAA0B4b,IAAW3tB,EAAQn1B,OAAO8iD,IAASjZ,SAAQ,SAAU5oC,GAAOjB,OAAOqiB,eAAee,EAAQniB,EAAKjB,OAAOonC,yBAAyB0b,EAAQ7hD,GAAO,GAAI,CAAE,OAAOmiB,CAAQ,CACzf,SAAS2/E,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAAM+hG,EAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAE3O,SAASwlF,EAAkB7/E,EAAQu1B,GAAS,IAAK,IAAIx0C,EAAI,EAAGA,EAAIw0C,EAAMt3C,OAAQ8C,IAAK,CAAE,IAAIstE,EAAa94B,EAAMx0C,GAAIstE,EAAWjxE,WAAaixE,EAAWjxE,aAAc,EAAOixE,EAAW/wE,cAAe,EAAU,UAAW+wE,IAAYA,EAAWhxE,UAAW,GAAMT,OAAOqiB,eAAee,EAAQ4/E,EAAevxB,EAAWxwE,KAAMwwE,EAAa,CAAE,CAE5U,SAASuxB,EAAe7hG,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CAE1H,IACEJ,EADa,EAAQ,GACHA,OAElBuF,EADc,EAAQ,KACFA,QAClBsmC,EAAStmC,GAAWA,EAAQsmC,QAAU,UAI1C9sC,EAAOD,QAAuB,WAC5B,SAASyiE,KAdX,SAAyB1nC,EAAUy9B,GAAe,KAAMz9B,aAAoBy9B,GAAgB,MAAM,IAAIz2D,UAAU,oCAAwC,CAepJ02D,CAAgBz1D,KAAMy/D,GACtBz/D,KAAKo6C,KAAO,KACZp6C,KAAKq6C,KAAO,KACZr6C,KAAKtB,OAAS,CAChB,CAjBF,IAAsB82D,EAAairC,EA8KjC,OA9KoBjrC,EAkBPiK,GAlBoBghC,EAkBR,CAAC,CACxBniG,IAAK,OACLV,MAAO,SAAckuC,GACnB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAM,MAEJzY,KAAKtB,OAAS,EAAGsB,KAAKq6C,KAAK5hC,KAAOitD,EAAW1lE,KAAKo6C,KAAOsrB,EAC7D1lE,KAAKq6C,KAAOqrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,UACLV,MAAO,SAAiBkuC,GACtB,IAAI45B,EAAQ,CACVvqD,KAAM2wB,EACNrzB,KAAMzY,KAAKo6C,MAEO,IAAhBp6C,KAAKtB,SAAcsB,KAAKq6C,KAAOqrB,GACnC1lE,KAAKo6C,KAAOsrB,IACV1lE,KAAKtB,MACT,GACC,CACDJ,IAAK,QACLV,MAAO,WACL,GAAoB,IAAhBoC,KAAKtB,OAAT,CACA,IAAIqG,EAAM/E,KAAKo6C,KAAKj/B,KAGpB,OAFoB,IAAhBnb,KAAKtB,OAAcsB,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KAAUr6C,KAAKo6C,KAAOp6C,KAAKo6C,KAAK3hC,OAC7EzY,KAAKtB,OACAqG,CAJsB,CAK/B,GACC,CACDzG,IAAK,QACLV,MAAO,WACLoC,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,KACxBr6C,KAAKtB,OAAS,CAChB,GACC,CACDJ,IAAK,OACLV,MAAO,SAAc6Q,GACnB,GAAoB,IAAhBzO,KAAKtB,OAAc,MAAO,GAG9B,IAFA,IAAIqQ,EAAI/O,KAAKo6C,KACTr1C,EAAM,GAAKgK,EAAEoM,KACVpM,EAAIA,EAAE0J,MAAM1T,GAAO0J,EAAIM,EAAEoM,KAChC,OAAOpW,CACT,GACC,CACDzG,IAAK,SACLV,MAAO,SAAgB4R,GACrB,GAAoB,IAAhBxP,KAAKtB,OAAc,OAAOR,EAAOU,MAAM,GAI3C,IAHA,IA5DcR,EAAKqiB,EAAQpD,EA4DvBtY,EAAM7G,EAAOW,YAAY2Q,IAAM,GAC/BT,EAAI/O,KAAKo6C,KACT54C,EAAI,EACDuN,GA/DO3Q,EAgED2Q,EAAEoM,KAhEIsF,EAgEE1b,EAhEMsY,EAgED7b,EA/D9BtD,EAAOR,UAAU0F,KAAKkU,KAAKlZ,EAAKqiB,EAAQpD,GAgElC7b,GAAKuN,EAAEoM,KAAKzc,OACZqQ,EAAIA,EAAE0J,KAER,OAAO1T,CACT,GAGC,CACDzG,IAAK,UACLV,MAAO,SAAiB4R,EAAGkxF,GACzB,IAAI37F,EAYJ,OAXIyK,EAAIxP,KAAKo6C,KAAKj/B,KAAKzc,QAErBqG,EAAM/E,KAAKo6C,KAAKj/B,KAAKjB,MAAM,EAAG1K,GAC9BxP,KAAKo6C,KAAKj/B,KAAOnb,KAAKo6C,KAAKj/B,KAAKjB,MAAM1K,IAGtCzK,EAFSyK,IAAMxP,KAAKo6C,KAAKj/B,KAAKzc,OAExBsB,KAAKoS,QAGLsuF,EAAa1gG,KAAK2gG,WAAWnxF,GAAKxP,KAAK4gG,WAAWpxF,GAEnDzK,CACT,GACC,CACDzG,IAAK,QACLV,MAAO,WACL,OAAOoC,KAAKo6C,KAAKj/B,IACnB,GAGC,CACD7c,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EACJoE,EAAMgK,EAAEoM,KAEZ,IADA3L,GAAKzK,EAAIrG,OACFqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAIxX,EAAM8N,EAAEoM,KACRkvB,EAAK76B,EAAIvO,EAAIvC,OAASuC,EAAIvC,OAAS8Q,EAGvC,GAFI66B,IAAOppC,EAAIvC,OAAQqG,GAAO9D,EAAS8D,GAAO9D,EAAIiZ,MAAM,EAAG1K,GAEjD,IADVA,GAAK66B,GACQ,CACPA,IAAOppC,EAAIvC,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOla,EAAIiZ,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAK,aACLV,MAAO,SAAoB4R,GACzB,IAAIzK,EAAM7G,EAAOW,YAAY2Q,GACzBT,EAAI/O,KAAKo6C,KACTz5C,EAAI,EAGR,IAFAoO,EAAEoM,KAAK/X,KAAK2B,GACZyK,GAAKT,EAAEoM,KAAKzc,OACLqQ,EAAIA,EAAE0J,MAAM,CACjB,IAAItZ,EAAM4P,EAAEoM,KACRkvB,EAAK76B,EAAIrQ,EAAIT,OAASS,EAAIT,OAAS8Q,EAGvC,GAFArQ,EAAIiE,KAAK2B,EAAKA,EAAIrG,OAAS8Q,EAAG,EAAG66B,GAEvB,IADV76B,GAAK66B,GACQ,CACPA,IAAOlrC,EAAIT,UACXiC,EACEoO,EAAE0J,KAAMzY,KAAKo6C,KAAOrrC,EAAE0J,KAAUzY,KAAKo6C,KAAOp6C,KAAKq6C,KAAO,OAE5Dr6C,KAAKo6C,KAAOrrC,EACZA,EAAEoM,KAAOhc,EAAI+a,MAAMmwB,IAErB,KACF,GACE1pC,CACJ,CAEA,OADAX,KAAKtB,QAAUiC,EACRoE,CACT,GAGC,CACDzG,IAAKyrC,EACLnsC,MAAO,SAAesS,EAAG2b,GACvB,OAAOpoB,EAAQzD,KAAMmgG,EAAcA,EAAc,CAAC,EAAGt0E,GAAU,CAAC,EAAG,CAEjEka,MAAO,EAEPM,eAAe,IAEnB,MA5K0Ei6D,EAAkB9qC,EAAY93D,UAAW+iG,GAA2EpjG,OAAOqiB,eAAe81C,EAAa,YAAa,CAAE13D,UAAU,IA8KrP2hE,CACT,CApK8B,2BChB9B,IAAIohC,EACJ,SAAST,EAAgBtlF,EAAKxc,EAAKV,GAA4L,OAAnLU,EAC5C,SAAwBE,GAAO,IAAIF,EACnC,SAAsB+Z,EAAOlH,GAAQ,GAAqB,iBAAVkH,GAAgC,OAAVA,EAAgB,OAAOA,EAAO,IAAIkoF,EAAOloF,EAAMmB,OAAO6B,aAAc,QAAajc,IAATmhG,EAAoB,CAAE,IAAIh7F,EAAMg7F,EAAKjpF,KAAKe,EAAOlH,UAAoB,GAAmB,iBAAR5L,EAAkB,OAAOA,EAAK,MAAM,IAAIxG,UAAU,+CAAiD,CAAE,OAA4Bge,OAAiB1E,EAAQ,CAD/UmoF,CAAahiG,GAAgB,MAAsB,iBAARF,EAAmBA,EAAMye,OAAOze,EAAM,CADxE+hG,CAAe/hG,MAAiBwc,EAAOzd,OAAOqiB,eAAe5E,EAAKxc,EAAK,CAAEV,MAAOA,EAAOC,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBgd,EAAIxc,GAAOV,EAAgBkd,CAAK,CAG3O,IAAI+oC,EAAW,EAAQ,IACnBi9C,EAAetnF,OAAO,eACtBunF,EAAcvnF,OAAO,cACrBwnF,EAASxnF,OAAO,SAChBynF,EAASznF,OAAO,SAChB0nF,EAAe1nF,OAAO,eACtB2nF,EAAiB3nF,OAAO,iBACxB4nF,EAAU5nF,OAAO,UACrB,SAAS6nF,EAAiBzjG,EAAOkgC,GAC/B,MAAO,CACLlgC,MAAOA,EACPkgC,KAAMA,EAEV,CACA,SAASwjE,EAAe9F,GACtB,IAAIvoE,EAAUuoE,EAAKsF,GACnB,GAAgB,OAAZ7tE,EAAkB,CACpB,IAAI9X,EAAOqgF,EAAK4F,GAASpkF,OAIZ,OAAT7B,IACFqgF,EAAK0F,GAAgB,KACrB1F,EAAKsF,GAAgB,KACrBtF,EAAKuF,GAAe,KACpB9tE,EAAQouE,EAAiBlmF,GAAM,IAEnC,CACF,CACA,SAASomF,EAAW/F,GAGlB5tE,QAAQqO,SAASqlE,EAAgB9F,EACnC,CAYA,IAAIgG,EAAyBnkG,OAAO04B,gBAAe,WAAa,IAC5D0rE,EAAuCpkG,OAAOyc,gBAmD/CsmF,EAnD+DS,EAAwB,CACpFt9C,aACF,OAAOvjD,KAAKohG,EACd,EACA3oF,KAAM,WACJ,IAAI88C,EAAQv1D,KAGRyf,EAAQzf,KAAKghG,GACjB,GAAc,OAAVvhF,EACF,OAAOuT,QAAQE,OAAOzT,GAExB,GAAIzf,KAAKihG,GACP,OAAOjuE,QAAQC,QAAQouE,OAAiBjiG,GAAW,IAErD,GAAIY,KAAKohG,GAAS30D,UAKhB,OAAO,IAAIzZ,SAAQ,SAAUC,EAASC,GACpCtF,QAAQqO,UAAS,WACXs5B,EAAMyrC,GACR9tE,EAAOqiC,EAAMyrC,IAEb/tE,EAAQouE,OAAiBjiG,GAAW,GAExC,GACF,IAOF,IACI0qC,EADA43D,EAAc1hG,KAAKkhG,GAEvB,GAAIQ,EACF53D,EAAU,IAAI9W,QAlDpB,SAAqB0uE,EAAalG,GAChC,OAAO,SAAUvoE,EAASC,GACxBwuE,EAAYv3D,MAAK,WACXqxD,EAAKyF,GACPhuE,EAAQouE,OAAiBjiG,GAAW,IAGtCo8F,EAAK2F,GAAgBluE,EAASC,EAChC,GAAGA,EACL,CACF,CAwC4ByuE,CAAYD,EAAa1hG,WAC1C,CAGL,IAAImb,EAAOnb,KAAKohG,GAASpkF,OACzB,GAAa,OAAT7B,EACF,OAAO6X,QAAQC,QAAQouE,EAAiBlmF,GAAM,IAEhD2uB,EAAU,IAAI9W,QAAQhzB,KAAKmhG,GAC7B,CAEA,OADAnhG,KAAKkhG,GAAgBp3D,EACdA,CACT,GACwCtwB,OAAOgrD,eAAe,WAC9D,OAAOxkE,IACT,IAAIogG,EAAgBS,EAAuB,UAAU,WACnD,IAAIe,EAAS5hG,KAIb,OAAO,IAAIgzB,SAAQ,SAAUC,EAASC,GACpC0uE,EAAOR,GAASjgC,QAAQ,MAAM,SAAU/tC,GAClCA,EACFF,EAAOE,GAGTH,EAAQouE,OAAiBjiG,GAAW,GACtC,GACF,GACF,IAAIyhG,GAAwBW,GA4D5BvkG,EAAOD,QA3DiC,SAA2CumD,GACjF,IAAIs+C,EACAxvD,EAAWh1C,OAAOC,OAAOmkG,GAA4DrB,EAArByB,EAAiB,CAAC,EAAmCT,EAAS,CAChIxjG,MAAO2lD,EACPzlD,UAAU,IACRsiG,EAAgByB,EAAgBf,EAAc,CAChDljG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBd,EAAa,CAC/CnjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBb,EAAQ,CAC1CpjG,MAAO,KACPE,UAAU,IACRsiG,EAAgByB,EAAgBZ,EAAQ,CAC1CrjG,MAAO2lD,EAAO/W,eAAeuX,WAC7BjmD,UAAU,IACRsiG,EAAgByB,EAAgBV,EAAgB,CAClDvjG,MAAO,SAAeq1B,EAASC,GAC7B,IAAI/X,EAAOk3B,EAAS+uD,GAASpkF,OACzB7B,GACFk3B,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,EAAiBlmF,GAAM,MAE/Bk3B,EAASyuD,GAAgB7tE,EACzBof,EAAS0uD,GAAe7tE,EAE5B,EACAp1B,UAAU,IACR+jG,IA0BJ,OAzBAxvD,EAAS6uD,GAAgB,KACzBr9C,EAASN,GAAQ,SAAUnwB,GACzB,GAAIA,GAAoB,+BAAbA,EAAInN,KAAuC,CACpD,IAAIiN,EAASmf,EAAS0uD,GAUtB,OAPe,OAAX7tE,IACFmf,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB7tE,EAAOE,SAETif,EAAS2uD,GAAU5tE,EAErB,CACA,IAAIH,EAAUof,EAASyuD,GACP,OAAZ7tE,IACFof,EAAS6uD,GAAgB,KACzB7uD,EAASyuD,GAAgB,KACzBzuD,EAAS0uD,GAAe,KACxB9tE,EAAQouE,OAAiBjiG,GAAW,KAEtCizC,EAAS4uD,IAAU,CACrB,IACA19C,EAAO7vB,GAAG,WAAY6tE,EAAWlsE,KAAK,KAAMgd,IACrCA,CACT,OClLAp1C,EAAOD,QAAU,WACf,MAAM,IAAIyC,MAAM,gDAClB,0BCyBAxC,EAAOD,QAAUg2D,EACjB,IAAIr2B,EAAY,EAAQ,KAExB,SAASq2B,EAAYnnC,GACnB,KAAM7rB,gBAAgBgzD,GAAc,OAAO,IAAIA,EAAYnnC,GAC3D8Q,EAAUrlB,KAAKtX,KAAM6rB,EACvB,CAJA,EAAQ,EAAR,CAAoBmnC,EAAar2B,GAKjCq2B,EAAYt1D,UAAUkgC,WAAa,SAAUohC,EAAO9/D,EAAU68B,GAC5DA,EAAG,KAAMijC,EACX,0BC/BA,IAAI1b,EASA+P,EAAiB,QACnBI,EAAmBJ,EAAeI,iBAClC2S,EAAuB/S,EAAe+S,qBACxC,SAASnsB,EAAK7mB,GAEZ,GAAIA,EAAK,MAAMA,CACjB,CA+BA,SAAS9b,EAAKqQ,GACZA,GACF,CACA,SAAS07C,EAAK1kE,EAAMg/E,GAClB,OAAOh/E,EAAK0kE,KAAKsa,EACnB,CA6BA1gF,EAAOD,QAvBP,WACE,IAAK,IAAIgkC,EAAOvlB,UAAU/c,OAAQojG,EAAU,IAAIpgG,MAAMs/B,GAAOyiB,EAAO,EAAGA,EAAOziB,EAAMyiB,IAClFq+C,EAAQr+C,GAAQhoC,UAAUgoC,GAE5B,IAKIhkC,EALAwgC,EATN,SAAqB6hD,GACnB,OAAKA,EAAQpjG,OAC8B,mBAAhCojG,EAAQA,EAAQpjG,OAAS,GAA0Bu7C,EACvD6nD,EAAQnrE,MAFasjB,CAG9B,CAKiB8nD,CAAYD,GAE3B,GADIpgG,MAAMC,QAAQmgG,EAAQ,MAAKA,EAAUA,EAAQ,IAC7CA,EAAQpjG,OAAS,EACnB,MAAM,IAAI+0D,EAAiB,WAG7B,IAAIuuC,EAAWF,EAAQvjE,KAAI,SAAUglB,EAAQ/hD,GAC3C,IAAI++D,EAAU/+D,EAAIsgG,EAAQpjG,OAAS,EAEnC,OAnDJ,SAAmB6kD,EAAQgd,EAASqG,EAAS3mB,GAC3CA,EAnBF,SAAcA,GACZ,IAAIuD,GAAS,EACb,OAAO,WACDA,IACJA,GAAS,EACTvD,EAAShhC,WAAM,EAAQxD,WACzB,CACF,CAYaqX,CAAKmtB,GAChB,IAAIgiD,GAAS,EACb1+C,EAAO7vB,GAAG,SAAS,WACjBuuE,GAAS,CACX,SACY7iG,IAARkkD,IAAmBA,EAAM,EAAQ,KACrCA,EAAIC,EAAQ,CACVtX,SAAUs0B,EACVziE,SAAU8oE,IACT,SAAUxzC,GACX,GAAIA,EAAK,OAAO6sB,EAAS7sB,GACzB6uE,GAAS,EACThiD,GACF,IACA,IAAIxT,GAAY,EAChB,OAAO,SAAUrZ,GACf,IAAI6uE,IACAx1D,EAIJ,OAHAA,GAAY,EAtBhB,SAAmB8W,GACjB,OAAOA,EAAOa,WAAqC,mBAAjBb,EAAOc,KAC3C,CAuBQC,CAAUf,GAAgBA,EAAOc,QACP,mBAAnBd,EAAO4d,QAA+B5d,EAAO4d,eACxDlhB,EAAS7sB,GAAO,IAAIgzC,EAAqB,QAC3C,CACF,CAyBW87B,CAAU3+C,EAAQgd,EADX/+D,EAAI,GACyB,SAAU4xB,GAC9C3T,IAAOA,EAAQ2T,GAChBA,GAAK4uE,EAAS96D,QAAQ5vB,GACtBipD,IACJyhC,EAAS96D,QAAQ5vB,GACjB2oC,EAASxgC,GACX,GACF,IACA,OAAOqiF,EAAQ/5D,OAAOs7B,EACxB,aCpFA,MAAM,UAAE1mC,GAAc,EAAQ,IAE9B1/B,EAAOD,QAAWynH,GAAgB,MAAME,UAAchoF,EACpDh/B,YAAainH,EAAMC,EAAUC,EAAiBj5F,GAC5CtF,MAAMsF,GAEN7rB,KAAKglH,MAAQJ,EACb5kH,KAAKilH,UAAYJ,EACjB7kH,KAAKklH,iBAAmBJ,EACxB9kH,KAAKolH,SAAWv5F,EAEhB7rB,KAAKqlH,OAAS,IAAIZ,EAClBzkH,KAAKqlH,OAAOC,WAAWV,EAAMC,GAC7B7kH,KAAK++D,YAAa,CACpB,CAEAnhC,WAAYohC,EAAO9/D,EAAU+gD,GAC3B,IAAIxgC,EAAQ,KACZ,IACEzf,KAAKq7B,OAAO2jC,EAAO9/D,EACrB,CAAE,MAAOk0B,GACP3T,EAAQ2T,CACV,CAEA6sB,EAASxgC,EACX,CAEAoe,SAAW,CAEXqjC,MAAOliE,GACLgB,KAAKge,KAAKhe,KAAKylH,QAAQzmH,GACzB,CAEAq8B,OAAQlgB,EAAMjc,GACZ,IAAKhB,OAAO6c,SAASI,IAAyB,iBAATA,EAAmB,MAAM,IAAIpc,UAAU,qCAC5E,GAAIiB,KAAK++D,WAAY,MAAM,IAAIt/D,MAAM,0BAKrC,OAJKvB,OAAO6c,SAASI,KAAOA,EAAOjd,OAAOS,KAAKwc,EAAMjc,IAErDc,KAAKqlH,OAAOE,OAAOpqG,GAEZnb,IACT,CAEAylH,QAASG,EAAgB1mH,GAClBc,KAAK++D,aACR/+D,KAAK++D,YAAa,EAClB/+D,KAAKqlH,OAAOG,kBAAkBxlH,KAAKklH,mBAGrC,IAAI/pG,EAAOnb,KAAKqlH,OAAOI,QAAQG,GAG/B,YAFiBxmH,IAAbF,IAAwBic,EAAOA,EAAKjZ,SAAShD,IAE1Cic,CACT,CAEAuqG,cAEE,OADA1lH,KAAKqlH,OAAOC,WAAWtlH,KAAKglH,MAAOhlH,KAAKilH,WACjCjlH,IACT,CAEA2lH,SACE,MAAMriH,EAAQ,IAAIqhH,EAAM3kH,KAAKglH,MAAOhlH,KAAKilH,UAAWjlH,KAAKklH,iBAAkBllH,KAAKolH,UAIhF,OAHAplH,KAAKqlH,OAAOjiH,KAAKE,EAAM+hH,QACvB/hH,EAAMy7D,WAAa/+D,KAAK++D,WAEjBz7D,CACT,cClEF,MAAMuiH,EAAc,EAAQ,KAE5B,SAASnB,IAEP1kH,KAAKm1B,MAAQ,CACX,EAAG,EAAG,EAAG,EAAG,EACZ,EAAG,EAAG,EAAG,EAAG,EACZ,EAAG,EAAG,EAAG,EAAG,EACZ,EAAG,EAAG,EAAG,EAAG,EACZ,EAAG,EAAG,EAAG,EAAG,GAGdn1B,KAAK06B,UAAY,KACjB16B,KAAK60B,MAAQ,EACb70B,KAAK8lH,WAAY,CACnB,CAEApB,EAAOhnH,UAAU4nH,WAAa,SAAUV,EAAMC,GAC5C,IAAK,IAAIrjH,EAAI,EAAGA,EAAI,KAAMA,EAAGxB,KAAKm1B,MAAM3zB,GAAK,EAC7CxB,KAAK06B,UAAYkqF,EAAO,EACxB5kH,KAAK60B,MAAQ,EACb70B,KAAK8lH,WAAY,CACnB,EAEApB,EAAOhnH,UAAU6nH,OAAS,SAAUpqG,GAClC,IAAK,IAAI3Z,EAAI,EAAGA,EAAI2Z,EAAKzc,SAAU8C,EACjCxB,KAAKm1B,SAASn1B,KAAK60B,MAAQ,KAAO1Z,EAAK3Z,IAAYxB,KAAK60B,MAAQ,EAAlB,EAC9C70B,KAAK60B,OAAS,EACV70B,KAAK60B,QAAU70B,KAAK06B,YACtBmrF,EAAYE,MAAM/lH,KAAKm1B,OACvBn1B,KAAK60B,MAAQ,EAGnB,EAEA6vF,EAAOhnH,UAAU8nH,kBAAoB,SAAUz0G,GAC7C/Q,KAAKm1B,SAASn1B,KAAK60B,MAAQ,KAAO9jB,GAAc/Q,KAAK60B,MAAQ,EAAlB,EACrB,IAAV,IAAP9jB,IAAsB/Q,KAAK60B,QAAW70B,KAAK06B,UAAY,GAAImrF,EAAYE,MAAM/lH,KAAKm1B,OACvFn1B,KAAKm1B,UAAUn1B,KAAK06B,UAAY,GAAK,KAAO,MAAe16B,KAAK06B,UAAY,GAAK,EAA5B,EACrDmrF,EAAYE,MAAM/lH,KAAKm1B,OACvBn1B,KAAK60B,MAAQ,EACb70B,KAAK8lH,WAAY,CACnB,EAEApB,EAAOhnH,UAAU+nH,QAAU,SAAU/mH,GAC9BsB,KAAK8lH,WAAW9lH,KAAKwlH,kBAAkB,GAE5C,MAAMltG,EAASpa,OAAOU,MAAMF,GAC5B,IAAK,IAAI8C,EAAI,EAAGA,EAAI9C,IAAU8C,EAC5B8W,EAAO9W,GAAMxB,KAAKm1B,SAASn1B,KAAK60B,MAAQ,MAAc70B,KAAK60B,MAAQ,EAAlB,EAAyB,IAC1E70B,KAAK60B,OAAS,EACV70B,KAAK60B,QAAU70B,KAAK06B,YACtBmrF,EAAYE,MAAM/lH,KAAKm1B,OACvBn1B,KAAK60B,MAAQ,GAIjB,OAAOvc,CACT,EAEAosG,EAAOhnH,UAAU0F,KAAO,SAAUC,GAChC,IAAK,IAAI7B,EAAI,EAAGA,EAAI,KAAMA,EAAG6B,EAAK8xB,MAAM3zB,GAAKxB,KAAKm1B,MAAM3zB,GACxD6B,EAAKq3B,UAAY16B,KAAK06B,UACtBr3B,EAAKwxB,MAAQ70B,KAAK60B,MAClBxxB,EAAKyiH,UAAY9lH,KAAK8lH,SACxB,EAEA7oH,EAAOD,QAAU0nH,oBClEjBznH,EAAOD,QAAUiE,GAAO84B,mBAAmB94B,GAAKkB,QAAQ,YAAYqL,GAAK,IAAIA,EAAE5M,WAAW,GAAGsB,SAAS,IAAI+mB,oCCA1G,IAAIyyC,EAAQ,eACRsqD,EAAgB,IAAItgF,OAAO,IAAMg2B,EAAQ,aAAc,MACvDuqD,EAAe,IAAIvgF,OAAO,IAAMg2B,EAAQ,KAAM,MAElD,SAASwqD,EAAiBC,EAAYjuG,GACrC,IAEC,MAAO,CAACyhB,mBAAmBwsF,EAAWjtF,KAAK,KAC5C,CAAE,MAAO9F,GAET,CAEA,GAA0B,IAAtB+yF,EAAWznH,OACd,OAAOynH,EAGRjuG,EAAQA,GAAS,EAGjB,IAAIrW,EAAOskH,EAAWjsG,MAAM,EAAGhC,GAC3BpW,EAAQqkH,EAAWjsG,MAAMhC,GAE7B,OAAOxW,MAAMhE,UAAUqiB,OAAOzI,KAAK,GAAI4uG,EAAiBrkH,GAAOqkH,EAAiBpkH,GACjF,CAEA,SAAS09B,EAAOnnB,GACf,IACC,OAAOshB,mBAAmBthB,EAC3B,CAAE,MAAO+a,GAGR,IAFA,IAAIgzF,EAAS/tG,EAAMwvB,MAAMm+E,IAAkB,GAElCxkH,EAAI,EAAGA,EAAI4kH,EAAO1nH,OAAQ8C,IAGlC4kH,GAFA/tG,EAAQ6tG,EAAiBE,EAAQ5kH,GAAG03B,KAAK,KAE1B2O,MAAMm+E,IAAkB,GAGxC,OAAO3tG,CACR,CACD,CAuCApb,EAAOD,QAAU,SAAUqpH,GAC1B,GAA0B,iBAAfA,EACV,MAAM,IAAItnH,UAAU,6DAA+DsnH,EAAa,KAGjG,IAIC,OAHAA,EAAaA,EAAWlkH,QAAQ,MAAO,KAGhCw3B,mBAAmB0sF,EAC3B,CAAE,MAAOjzF,GAER,OAjDF,SAAkC/a,GAQjC,IANA,IAAIiuG,EAAa,CAChB,SAAU,KACV,SAAU,MAGPz+E,EAAQo+E,EAAaxxE,KAAKp8B,GACvBwvB,GAAO,CACb,IAECy+E,EAAWz+E,EAAM,IAAMlO,mBAAmBkO,EAAM,GACjD,CAAE,MAAOzU,GACR,IAAI6hB,EAASzV,EAAOqI,EAAM,IAEtBoN,IAAWpN,EAAM,KACpBy+E,EAAWz+E,EAAM,IAAMoN,EAEzB,CAEApN,EAAQo+E,EAAaxxE,KAAKp8B,EAC3B,CAGAiuG,EAAW,OAAS,IAIpB,IAFA,IAAInhB,EAAU9nG,OAAOkrB,KAAK+9F,GAEjB9kH,EAAI,EAAGA,EAAI2jG,EAAQzmG,OAAQ8C,IAAK,CAExC,IAAIlD,EAAM6mG,EAAQ3jG,GAClB6W,EAAQA,EAAMlW,QAAQ,IAAIujC,OAAOpnC,EAAK,KAAMgoH,EAAWhoH,GACxD,CAEA,OAAO+Z,CACR,CAcSkuG,CAAyBF,EACjC,CACD,oBC3FAppH,EAAOD,QAAU,CAACyD,EAAQ+lH,KACzB,GAAwB,iBAAX/lH,GAA4C,iBAAd+lH,EAC1C,MAAM,IAAIznH,UAAU,iDAGrB,GAAkB,KAAdynH,EACH,MAAO,CAAC/lH,GAGT,MAAMgmH,EAAiBhmH,EAAOgc,QAAQ+pG,GAEtC,OAAwB,IAApBC,EACI,CAAChmH,GAGF,CACNA,EAAOyZ,MAAM,EAAGusG,GAChBhmH,EAAOyZ,MAAMusG,EAAiBD,EAAU9nH,QACxC,oBCnBFzB,EAAOD,QAAU,SAAU8d,EAAKg7B,GAK/B,IAJA,IAAI/wC,EAAM,CAAC,EACPwjB,EAAOlrB,OAAOkrB,KAAKzN,GACnB4rG,EAAQhlH,MAAMC,QAAQm0C,GAEjBt0C,EAAI,EAAGA,EAAI+mB,EAAK7pB,OAAQ8C,IAAK,CACrC,IAAIlD,EAAMiqB,EAAK/mB,GACXjC,EAAMub,EAAIxc,IAEVooH,GAAoC,IAA5B5wE,EAAUr5B,QAAQne,GAAcw3C,EAAUx3C,EAAKiB,EAAKub,MAC/D/V,EAAIzG,GAAOiB,EAEb,CAEA,OAAOwF,CACR,0BCbA9H,EAAOD,QAAU,EAAjB,6BCFAK,OAAOqiB,eAAe1iB,EAAS,aAAc,CAAEY,OAAO,IAItD,MAAM+oH,EAAY,CAAC,EAEnB,IAAIC,EADJ5pH,EAAQ2pH,UAAYA,EAEpB3pH,EAAQ4pH,SAAWA,EACnB,IACI5pH,EAAQ4pH,SAAWA,EAAW,EAAQ,wHACtCD,EAAUE,MAAQD,CACtB,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,qIACtCD,EAAUG,mBAAqBF,CACnC,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,sIACtCD,EAAUI,oBAAsBH,CACpC,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,yHACtCD,EAAUK,OAASJ,CACvB,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,yHACtCD,EAAUM,OAASL,CACvB,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,0HACtCD,EAAUO,QAAUN,CACxB,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,0HACtCD,EAAUQ,QAAUP,CACxB,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,2HACtCD,EAAUS,SAAWR,EACrBD,EAAUU,GAAKT,CACnB,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,6HACtCD,EAAUW,WAAaV,CAC3B,CACA,MAAOxzF,GAAO,CACd,IACIp2B,EAAQ4pH,SAAWA,EAAW,EAAQ,KACtCD,EAAUY,QAAUX,EACpBD,EAAUa,GAAKZ,CACnB,CACA,MAAOxzF,GAAO,aC5Dd,IAAI7rB,EAAM,EAAQ,IACdrJ,EAAS,YACTm0E,EAAS,EAAQ,KAErB,SAASo1C,EAAU3jH,GACjB,IAAIC,EAAMD,EAAKyuE,QAAQtmB,gBAAgBnoD,EAAKivE,OAE5C,OADAV,EAAOvuE,EAAKivE,OACLhvE,CACT,CAGA/G,EAAQu2E,QAAU,SAAUzvE,EAAMk7D,GAChC,IAAI0oD,EAAWpmH,KAAKiB,KAAKy8D,EAAMtgE,OAFjB,IAGVwC,EAAQ4C,EAAKkvE,OAAOt0E,OACxBoF,EAAKkvE,OAAS90E,EAAO6hB,OAAO,CAC1Bjc,EAAKkvE,OACL90E,EAAOW,YANK,GAMO6oH,KAErB,IAAK,IAAIlmH,EAAI,EAAGA,EAAIkmH,EAAUlmH,IAAK,CACjC,IAAIuC,EAAM0jH,EAAS3jH,GACfuZ,EAASnc,EAVD,GAUSM,EACrBsC,EAAKkvE,OAAOluD,cAAc/gB,EAAI,GAAIsZ,EAAS,GAC3CvZ,EAAKkvE,OAAOluD,cAAc/gB,EAAI,GAAIsZ,EAAS,GAC3CvZ,EAAKkvE,OAAOluD,cAAc/gB,EAAI,GAAIsZ,EAAS,GAC3CvZ,EAAKkvE,OAAOluD,cAAc/gB,EAAI,GAAIsZ,EAAS,GAC7C,CACA,IAAIirB,EAAMxkC,EAAKkvE,OAAO94D,MAAM,EAAG8kD,EAAMtgE,QAErC,OADAoF,EAAKkvE,OAASlvE,EAAKkvE,OAAO94D,MAAM8kD,EAAMtgE,QAC/B6I,EAAIy3D,EAAO12B,EACpB,yBC3BAtrC,EAAQoI,WAuCR,SAAqB0iF,GACnB,IAAI6/B,EAAOC,EAAQ9/B,GACf+/B,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,CAClD,EA3CA9qH,EAAQsqB,YAiDR,SAAsBwgE,GACpB,IAAI3wE,EAcA3V,EAbAmmH,EAAOC,EAAQ9/B,GACf+/B,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBhrG,EAAM,IAAIorG,EAVhB,SAAsBjgC,EAAK+/B,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,CAClD,CAQoBE,CAAYlgC,EAAK+/B,EAAUC,IAEzCG,EAAU,EAGV5mH,EAAMymH,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKrmH,EAAI,EAAGA,EAAIH,EAAKG,GAAK,EACxB2V,EACG+wG,EAAUpgC,EAAIlnF,WAAWY,KAAO,GAChC0mH,EAAUpgC,EAAIlnF,WAAWY,EAAI,KAAO,GACpC0mH,EAAUpgC,EAAIlnF,WAAWY,EAAI,KAAO,EACrC0mH,EAAUpgC,EAAIlnF,WAAWY,EAAI,IAC/Bmb,EAAIsrG,KAAc9wG,GAAO,GAAM,IAC/BwF,EAAIsrG,KAAc9wG,GAAO,EAAK,IAC9BwF,EAAIsrG,KAAmB,IAAN9wG,EAmBnB,OAhBwB,IAApB2wG,IACF3wG,EACG+wG,EAAUpgC,EAAIlnF,WAAWY,KAAO,EAChC0mH,EAAUpgC,EAAIlnF,WAAWY,EAAI,KAAO,EACvCmb,EAAIsrG,KAAmB,IAAN9wG,GAGK,IAApB2wG,IACF3wG,EACG+wG,EAAUpgC,EAAIlnF,WAAWY,KAAO,GAChC0mH,EAAUpgC,EAAIlnF,WAAWY,EAAI,KAAO,EACpC0mH,EAAUpgC,EAAIlnF,WAAWY,EAAI,KAAO,EACvCmb,EAAIsrG,KAAc9wG,GAAO,EAAK,IAC9BwF,EAAIsrG,KAAmB,IAAN9wG,GAGZwF,CACT,EA5FA3f,EAAQshB,cAkHR,SAAwB6pG,GAQtB,IAPA,IAAIhxG,EACA9V,EAAM8mH,EAAMzpH,OACZ0pH,EAAa/mH,EAAM,EACnB2zC,EAAQ,GACRqzE,EAAiB,MAGZ7mH,EAAI,EAAG8mH,EAAOjnH,EAAM+mH,EAAY5mH,EAAI8mH,EAAM9mH,GAAK6mH,EACtDrzE,EAAMh3B,KAAKuqG,EAAYJ,EAAO3mH,EAAIA,EAAI6mH,EAAkBC,EAAOA,EAAQ9mH,EAAI6mH,IAqB7E,OAjBmB,IAAfD,GACFjxG,EAAMgxG,EAAM9mH,EAAM,GAClB2zC,EAAMh3B,KACJukB,EAAOprB,GAAO,GACdorB,EAAQprB,GAAO,EAAK,IACpB,OAEsB,IAAfixG,IACTjxG,GAAOgxG,EAAM9mH,EAAM,IAAM,GAAK8mH,EAAM9mH,EAAM,GAC1C2zC,EAAMh3B,KACJukB,EAAOprB,GAAO,IACdorB,EAAQprB,GAAO,EAAK,IACpBorB,EAAQprB,GAAO,EAAK,IACpB,MAIG69B,EAAM9b,KAAK,GACpB,EA1IA,IALA,IAAIqJ,EAAS,GACT2lF,EAAY,GACZH,EAA4B,oBAAfluG,WAA6BA,WAAanY,MAEvDukB,EAAO,mEACFzkB,EAAI,EAAsBA,EAAbykB,KAAwBzkB,EAC5C+gC,EAAO/gC,GAAKykB,EAAKzkB,GACjB0mH,EAAUjiG,EAAKrlB,WAAWY,IAAMA,EAQlC,SAASomH,EAAS9/B,GAChB,IAAIzmF,EAAMymF,EAAIppF,OAEd,GAAI2C,EAAM,EAAI,EACZ,MAAM,IAAI5B,MAAM,kDAKlB,IAAIooH,EAAW//B,EAAIrrE,QAAQ,KAO3B,OANkB,IAAdorG,IAAiBA,EAAWxmH,GAMzB,CAACwmH,EAJcA,IAAaxmH,EAC/B,EACA,EAAKwmH,EAAW,EAGtB,CAmEA,SAASU,EAAaJ,EAAOjnH,EAAOC,GAGlC,IAFA,IAAIgW,EARoB1V,EASpB6W,EAAS,GACJ9W,EAAIN,EAAOM,EAAIL,EAAKK,GAAK,EAChC2V,GACIgxG,EAAM3mH,IAAM,GAAM,WAClB2mH,EAAM3mH,EAAI,IAAM,EAAK,QACP,IAAf2mH,EAAM3mH,EAAI,IACb8W,EAAO0F,KAdFukB,GADiB9gC,EAeM0V,IAdT,GAAK,IACxBorB,EAAO9gC,GAAO,GAAK,IACnB8gC,EAAO9gC,GAAO,EAAI,IAClB8gC,EAAa,GAAN9gC,IAaT,OAAO6W,EAAO4gB,KAAK,GACrB,CAlGAgvF,EAAU,IAAItnH,WAAW,IAAM,GAC/BsnH,EAAU,IAAItnH,WAAW,IAAM,YClB/B5D,EAAQggB,KAAO,SAAU/e,EAAQof,EAAQmrG,EAAMrK,EAAMrlF,GACnD,IAAIv4B,EAAGkP,EACHg5G,EAAiB,EAAT3vF,EAAcqlF,EAAO,EAC7BuK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTpnH,EAAIgnH,EAAQ1vF,EAAS,EAAK,EAC1BpI,EAAI83F,GAAQ,EAAI,EAChB/5G,EAAIxQ,EAAOof,EAAS7b,GAOxB,IALAA,GAAKkvB,EAELnwB,EAAIkO,GAAM,IAAOm6G,GAAU,EAC3Bn6G,KAAQm6G,EACRA,GAASH,EACFG,EAAQ,EAAGroH,EAAS,IAAJA,EAAWtC,EAAOof,EAAS7b,GAAIA,GAAKkvB,EAAGk4F,GAAS,GAKvE,IAHAn5G,EAAIlP,GAAM,IAAOqoH,GAAU,EAC3BroH,KAAQqoH,EACRA,GAASzK,EACFyK,EAAQ,EAAGn5G,EAAS,IAAJA,EAAWxR,EAAOof,EAAS7b,GAAIA,GAAKkvB,EAAGk4F,GAAS,GAEvE,GAAU,IAANroH,EACFA,EAAI,EAAIooH,MACH,IAAIpoH,IAAMmoH,EACf,OAAOj5G,EAAI8gE,IAAsBnpD,KAAd3Y,GAAK,EAAI,GAE5BgB,GAAQnO,KAAK6B,IAAI,EAAGg7G,GACpB59G,GAAQooH,CACV,CACA,OAAQl6G,GAAK,EAAI,GAAKgB,EAAInO,KAAK6B,IAAI,EAAG5C,EAAI49G,EAC5C,EAEAnhH,EAAQid,MAAQ,SAAUhc,EAAQL,EAAOyf,EAAQmrG,EAAMrK,EAAMrlF,GAC3D,IAAIv4B,EAAGkP,EAAG9O,EACN8nH,EAAiB,EAAT3vF,EAAcqlF,EAAO,EAC7BuK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBG,EAAe,KAAT1K,EAAc78G,KAAK6B,IAAI,GAAI,IAAM7B,KAAK6B,IAAI,GAAI,IAAM,EAC1D3B,EAAIgnH,EAAO,EAAK1vF,EAAS,EACzBpI,EAAI83F,EAAO,GAAK,EAChB/5G,EAAI7Q,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQ0D,KAAK8E,IAAIxI,GAEbg1B,MAAMh1B,IAAUA,IAAUwpB,KAC5B3X,EAAImjB,MAAMh1B,GAAS,EAAI,EACvB2C,EAAImoH,IAEJnoH,EAAIe,KAAKylB,MAAMzlB,KAAKwnC,IAAIlrC,GAAS0D,KAAKsnF,KAClChrF,GAAS+C,EAAIW,KAAK6B,IAAI,GAAI5C,IAAM,IAClCA,IACAI,GAAK,IAGL/C,GADE2C,EAAIooH,GAAS,EACNE,EAAKloH,EAELkoH,EAAKvnH,KAAK6B,IAAI,EAAG,EAAIwlH,IAEpBhoH,GAAK,IACfJ,IACAI,GAAK,GAGHJ,EAAIooH,GAASD,GACfj5G,EAAI,EACJlP,EAAImoH,GACKnoH,EAAIooH,GAAS,GACtBl5G,GAAM7R,EAAQ+C,EAAK,GAAKW,KAAK6B,IAAI,EAAGg7G,GACpC59G,GAAQooH,IAERl5G,EAAI7R,EAAQ0D,KAAK6B,IAAI,EAAGwlH,EAAQ,GAAKrnH,KAAK6B,IAAI,EAAGg7G,GACjD59G,EAAI,IAID49G,GAAQ,EAAGlgH,EAAOof,EAAS7b,GAAS,IAAJiO,EAAUjO,GAAKkvB,EAAGjhB,GAAK,IAAK0uG,GAAQ,GAI3E,IAFA59G,EAAKA,GAAK49G,EAAQ1uG,EAClBg5G,GAAQtK,EACDsK,EAAO,EAAGxqH,EAAOof,EAAS7b,GAAS,IAAJjB,EAAUiB,GAAKkvB,EAAGnwB,GAAK,IAAKkoH,GAAQ,GAE1ExqH,EAAOof,EAAS7b,EAAIkvB,IAAU,IAAJjiB,CAC5B,0BCjFAxR,EAAOD,QAAU,EAAjB,6BCFA,IAAI2qF,EAAW1qF,EAAOD,QAAU,EAAjB,KAEf2qF,EAASC,MAAQ,OAGjBD,EAASjuB,SAAmB,EAAQ,IACpCiuB,EAASxuD,MAAmB,EAAQ,KACpCwuD,EAAShoC,OAAmB,EAAQ,KAGpCgoC,EAAS7nD,KAAKjQ,WAAW83D,EAAS9/D,KAAM8/D,EAASxuD,MAAOwuD,EAAShoC,sqOCTjE3iD,EAAQolD,KAAO,EAAf,KACAplD,EAAQqlD,OAAS,EAAjB,KACArlD,EAAQ6kD,OAAS,EAAjB,IACA7kD,EAAQ8kD,OAAS,EAAjB,KACA9kD,EAAQ+kD,OAAS,EAAjB,4BCJA,IAAI93B,EAAQ,EAAQ,GAChB01B,EAAS,EAAQ,IAEjBrvB,EAASrG,EAAMqG,OACfC,EAAQtG,EAAMsG,MACdC,EAAUvG,EAAMuG,QAChBC,EAAUxG,EAAMwG,QAChB8f,EAAYoP,EAAOpP,UAEvB,SAASpU,IACP,KAAMn8B,gBAAgBm8B,GACpB,OAAO,IAAIA,EAEboU,EAAUj5B,KAAKtX,MAEfA,KAAKqR,EAAI,CAAE,WAAY,WAAY,WAAY,UAAY,YAC3DrR,KAAKF,OAAS,QAChB,CAyDA,SAAS8kC,EAAEpiC,EAAGgL,EAAGC,EAAGqL,GAClB,OAAItW,GAAK,GACAgL,EAAIC,EAAIqL,EACRtW,GAAK,GACJgL,EAAIC,GAAQD,EAAKsL,EAClBtW,GAAK,IACJgL,GAAMC,GAAMqL,EACbtW,GAAK,GACJgL,EAAIsL,EAAMrL,GAAMqL,EAEjBtL,GAAKC,GAAMqL,EACtB,CAEA,SAAS8wD,EAAEpnE,GACT,OAAIA,GAAK,GACA,EACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,UACX,CAEA,SAASsmH,EAAGtmH,GACV,OAAIA,GAAK,GACA,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,CACX,CA7FAynB,EAAMvqB,SAASy8B,EAAWoU,GAC1BvzC,EAAQslD,UAAYnmB,EAEpBA,EAAUzB,UAAY,IACtByB,EAAUuU,QAAU,IACpBvU,EAAUwU,aAAe,IACzBxU,EAAUyU,UAAY,GAEtBzU,EAAUz+B,UAAU6+B,QAAU,SAAgB/8B,EAAK0B,GAWjD,IAVA,IAAImS,EAAIrT,KAAKqR,EAAE,GACXiC,EAAItT,KAAKqR,EAAE,GACXkC,EAAIvT,KAAKqR,EAAE,GACXmC,EAAIxT,KAAKqR,EAAE,GACX8U,EAAInmB,KAAKqR,EAAE,GACX03G,EAAK11G,EACL21G,EAAK11G,EACLk3D,EAAKj3D,EACL01G,EAAKz1G,EACL01G,EAAK/iG,EACA3jB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,IAAIisE,EAAIl+C,EACND,EACEG,EAAQpd,EAAGuxB,EAAEpiC,EAAG8Q,EAAGC,EAAGC,GAAIhU,EAAIuB,EAAEyB,GAAKtB,GAAQ0oE,EAAEpnE,IAC/CiM,EAAEjM,IACJ2jB,GACF9S,EAAI8S,EACJA,EAAI3S,EACJA,EAAI8c,EAAO/c,EAAG,IACdA,EAAID,EACJA,EAAIm7D,EACJA,EAAIl+C,EACFD,EACEG,EAAQs4F,EAAInkF,EAAE,GAAKpiC,EAAGwmH,EAAIx+C,EAAIy+C,GAAKzpH,EAAI2pH,EAAG3mH,GAAKtB,GAAQ4nH,EAAGtmH,IAC1D4mH,EAAG5mH,IACL0mH,GACFH,EAAKG,EACLA,EAAKD,EACLA,EAAK34F,EAAOk6C,EAAI,IAChBA,EAAKw+C,EACLA,EAAKv6C,CACP,CACAA,EAAIj+C,EAAQxwB,KAAKqR,EAAE,GAAIkC,EAAG01G,GAC1BjpH,KAAKqR,EAAE,GAAKmf,EAAQxwB,KAAKqR,EAAE,GAAImC,EAAG01G,GAClClpH,KAAKqR,EAAE,GAAKmf,EAAQxwB,KAAKqR,EAAE,GAAI8U,EAAG4iG,GAClC/oH,KAAKqR,EAAE,GAAKmf,EAAQxwB,KAAKqR,EAAE,GAAIgC,EAAG21G,GAClChpH,KAAKqR,EAAE,GAAKmf,EAAQxwB,KAAKqR,EAAE,GAAIiC,EAAGk3D,GAClCxqE,KAAKqR,EAAE,GAAKo9D,CACd,EAEAtyC,EAAUz+B,UAAUszC,QAAU,SAAgB/gB,GAC5C,MAAY,QAARA,EACKhG,EAAMiG,QAAQlwB,KAAKqR,EAAG,UAEtB4Y,EAAMmG,QAAQpwB,KAAKqR,EAAG,SACjC,EAyCA,IAAItQ,EAAI,CACN,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhDooH,EAAK,CACP,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhD16G,EAAI,CACN,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnD26G,EAAK,CACP,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,4BC/ItD/rH,OAAOqiB,eAAe1iB,EAAS,aAAc,CAAEY,OAAO,IACtD,MAAMmoD,EAAa,EAAQ,IACrBsjE,EAAW,EAAQ,KACnB/xF,EAAc,EAAQ,IACtBgyF,EAAe,EAAQ,KAC7B,IAAIC,EAAmBD,EAAa1C,SACpC,MAAM4C,EAAmB,mBACnBC,EAAkB,kBAElBC,EAAoB,sGAe1B,SAASx9B,EAAUjrF,GACf,OAAQA,GAAO,IAAIirF,UAAU,OACjC,CACA,SAASy9B,EAAK1oH,EAAK2oH,EAAWlrH,GAC1B,KAAOuC,EAAIvC,OAASA,GAChBuC,EAAM2oH,EAAY3oH,EAEtB,OAAOA,CACX,CACA,SAAS4oH,EAAaC,GAClB,OAAOpsG,SAASosG,EAAK,EACzB,CACA,SAASC,EAAc7oG,GACnB,OAAOA,EAAMqd,KAAK/wB,GAAMm8G,EAAKn8G,EAAEtL,SAAS,GAAI,IAAK,KAAIg3B,KAAK,GAC9D,CACA,SAAS8wF,EAAmBC,GACxB,MACMC,EAD6B,EAAvBD,EAAcvrH,OACT,GACXuwB,EAAO82B,EAAW,UACnB1qB,OAAO4uF,GACPxtF,SACL,OAAOstF,EAAcroH,MAAM/C,KAAKswB,IAAO/U,MAAM,EAAGgwG,EACpD,CACA,SAASh0E,EAAKD,GACV,MAAO,YAAcA,GAAY,GACrC,CAeA,SAASk0E,EAAkBC,EAAUC,GAEjC,KADAA,EAAWA,GAAYd,GAEnB,MAAM,IAAI9pH,MAAMiqH,GAEpB,MAAMxpH,EAAQgsF,EAAUk+B,GAAUlyG,MAAM,KACxC,GAAIhY,EAAMxB,OAAS,GAAM,EACrB,MAAM,IAAIe,MAAM+pH,GAGpB,MAAMz4G,EAAO7Q,EACRq+B,KAAKv7B,IACN,MAAMtC,EAAQ2pH,EAAS5tG,QAAQzZ,GAC/B,IAAe,IAAXtC,EACA,MAAM,IAAIjB,MAAM+pH,GAEpB,OAAOG,EAAKjpH,EAAMwB,SAAS,GAAI,IAAK,GAAG,IAEtCg3B,KAAK,IAEJoxF,EAA8C,GAA/BhpH,KAAKylB,MAAMhW,EAAKrS,OAAS,IACxC6rH,EAAcx5G,EAAKmJ,MAAM,EAAGowG,GAC5BE,EAAez5G,EAAKmJ,MAAMowG,GAE1BG,EAAeF,EAAY1iF,MAAM,aAAatJ,IAAIsrF,GACxD,GAAIY,EAAa/rH,OAAS,GACtB,MAAM,IAAIe,MAAMgqH,GAEpB,GAAIgB,EAAa/rH,OAAS,GACtB,MAAM,IAAIe,MAAMgqH,GAEpB,GAAIgB,EAAa/rH,OAAS,GAAM,EAC5B,MAAM,IAAIe,MAAMgqH,GAEpB,MAAM1uB,EAAU78F,OAAOS,KAAK8rH,GAE5B,GADoBT,EAAmBjvB,KACnByvB,EAChB,MAAM,IAAI/qH,MA7FO,6BA+FrB,OAAOs7F,EAAQ74F,SAAS,MAC5B,CAEA,SAASwoH,EAAkB3vB,EAASsvB,GAKhC,GAJKnsH,OAAO6c,SAASggF,KACjBA,EAAU78F,OAAOS,KAAKo8F,EAAS,UAEnCsvB,EAAWA,GAAYd,GAEnB,MAAM,IAAI9pH,MAAMiqH,GAGpB,GAAI3uB,EAAQr8F,OAAS,GACjB,MAAM,IAAIK,UAAU0qH,GAExB,GAAI1uB,EAAQr8F,OAAS,GACjB,MAAM,IAAIK,UAAU0qH,GAExB,GAAI1uB,EAAQr8F,OAAS,GAAM,EACvB,MAAM,IAAIK,UAAU0qH,GAExB,MAIMvpH,GAJc6pH,EAAcroH,MAAM/C,KAAKo8F,IACxBivB,EAAmBjvB,IAEpBlzD,MAAM,cACLtJ,KAAKktD,IACtB,MAAM/qF,EAAQmpH,EAAap+B,GAC3B,OAAO4+B,EAAS3pH,EAAM,IAE1B,MAAuB,WAAhB2pH,EAAS,GACVnqH,EAAMg5B,KAAK,KACXh5B,EAAMg5B,KAAK,IACrB,CAhFAl8B,EAAQ2tH,mBALR,SAA4BP,EAAUn0E,GAClC,MAAM20E,EAAiB1sH,OAAOS,KAAKutF,EAAUk+B,GAAW,QAClDS,EAAa3sH,OAAOS,KAAKu3C,EAAKg2C,EAAUj2C,IAAY,QAC1D,OAAOozE,EAAS/wE,WAAWsyE,EAAgBC,EAAY,KAAM,GAAI,SACrE,EASA7tH,EAAQ8tH,eAPR,SAAwBV,EAAUn0E,GAC9B,OAAOjjB,QAAQC,UAAUkX,MAAK,IA9ClC,SAAuB8L,EAAU80E,EAAWp4D,EAAYta,EAAQ5b,GAC5D,OAAOzJ,QAAQC,UAAUkX,MAAK,IAAM,IAAInX,SAAQ,CAACC,EAASC,KAStDm2F,EAAS/iE,OAAOrQ,EAAU80E,EAuCuB,KAAM,GAAI,UA/C1C,CAAC33F,EAAKy/B,IACfz/B,EACOF,EAAOE,GAGPH,EAAQ4/B,IAGmD,KAElF,CAqCem4D,CAFgB9sH,OAAOS,KAAKutF,EAAUk+B,GAAW,QACrClsH,OAAOS,KAAKu3C,EAAKg2C,EAAUj2C,IAAY,UAGlE,EA2CAj5C,EAAQmtH,kBAAoBA,EA+B5BntH,EAAQ0tH,kBAAoBA,EAS5B1tH,EAAQiuH,iBARR,SAA0BC,EAAUtlE,EAAKykE,GAErC,IADAa,EAAWA,GAAY,KACR,IAAO,EAClB,MAAM,IAAInsH,UAAU0qH,GAGxB,OAAOiB,GADP9kE,EAAMA,GAAOtuB,GACgB4zF,EAAW,GAAIb,EAChD,EAWArtH,EAAQmuH,iBATR,SAA0Bf,EAAUC,GAChC,IACIF,EAAkBC,EAAUC,EAChC,CACA,MAAO9pH,GACH,OAAO,CACX,CACA,OAAO,CACX,EAWAvD,EAAQouH,mBATR,SAA4BC,GACxB,MAAMp2E,EAASq0E,EAAa3C,UAAU0E,GACtC,IAAIp2E,EAIA,MAAM,IAAIx1C,MAAM,yCAA2C4rH,EAAW,KAHtE9B,EAAmBt0E,CAK3B,EAaAj4C,EAAQsuH,mBAXR,WACI,IAAK/B,EACD,MAAM,IAAI9pH,MAAM,2BAEpB,OAAOpC,OAAOkrB,KAAK+gG,EAAa3C,WAAWzoE,QAAQqtE,GAClC,OAATA,GAA0B,OAATA,GAGdjC,EAAa3C,UAAU4E,GAAMC,OAAM,CAACxoH,EAAMtC,IAAUsC,IAASumH,EAAiB7oH,OACtF,EACP,EAEA,IAAI+qH,EAAe,EAAQ,KAC3BzuH,EAAQ2pH,UAAY8E,EAAa9E,y5hBCpLjC1pH,EAAOD,QAAU,EAAjB,6BCEAA,EAAQitB,MAAQ,EAAhB,KACAjtB,EAAQwpD,OAAS,EAAjB,IACAxpD,EAAQ6zE,IAAM,EAAd,KACA7zE,EAAQisD,IAAM,EAAd,KACAjsD,EAAQo5G,IAAM,EAAd,6BCJA,IAAI92G,EAAS,EAAQ,GACjBI,EAAW,EAAQ,GAEnB2f,EAAQ,CAAC,EAEb,SAASqsG,EAASp1E,GAChBh3C,EAAOksB,MAAM8qB,EAAG53C,OAAQ,EAAG,qBAE3BsB,KAAKs2C,GAAK,IAAI50C,MAAM,GACpB,IAAK,IAAIF,EAAI,EAAGA,EAAIxB,KAAKs2C,GAAG53C,OAAQ8C,IAClCxB,KAAKs2C,GAAG90C,GAAK80C,EAAG90C,EACpB,CAsBAxE,EAAQm5G,YApBR,SAAqB7vF,GACnB,SAAS2iC,EAAIp9B,GACXvF,EAAKhP,KAAKtX,KAAM6rB,GAChB7rB,KAAK2rH,UACP,CACAjsH,EAASupD,EAAK3iC,GAGd,IADA,IAAIiC,EAAOlrB,OAAOkrB,KAAKlJ,GACd7d,EAAI,EAAGA,EAAI+mB,EAAK7pB,OAAQ8C,IAAK,CACpC,IAAIlD,EAAMiqB,EAAK/mB,GACfynD,EAAIvrD,UAAUY,GAAO+gB,EAAM/gB,EAC7B,CAMA,OAJA2qD,EAAI3rD,OAAS,SAAgBuuB,GAC3B,OAAO,IAAIo9B,EAAIp9B,EACjB,EAEOo9B,CACT,EAIA5pC,EAAMssG,SAAW,WACf,IAAIx2F,EAAQ,IAAIu2F,EAAS1rH,KAAK6rB,QAAQyqB,IACtCt2C,KAAK4rH,UAAYz2F,CACnB,EAEA9V,EAAMkd,QAAU,SAAiB+0C,EAAKC,EAAOxtE,EAAKytE,GAChD,IAAIr8C,EAAQn1B,KAAK4rH,UACb97C,EAAa9vE,KAAKrC,YAAYF,OAAOC,UAErC44C,EAAKnhB,EAAMmhB,GACf,GAAkB,YAAdt2C,KAAKkb,KAAoB,CAC3B,IAAK,IAAI1Z,EAAI,EAAGA,EAAIxB,KAAK06B,UAAWl5B,IAClC80C,EAAG90C,IAAM8vE,EAAIC,EAAQ/vE,GAIvB,IAFAsuE,EAAWvzC,QAAQjlB,KAAKtX,KAAMs2C,EAAI,EAAGvyC,EAAKytE,GAEjChwE,EAAI,EAAGA,EAAIxB,KAAK06B,UAAWl5B,IAClC80C,EAAG90C,GAAKuC,EAAIytE,EAAShwE,EACzB,KAAO,CAGL,IAFAsuE,EAAWvzC,QAAQjlB,KAAKtX,KAAMsxE,EAAKC,EAAOxtE,EAAKytE,GAEtChwE,EAAI,EAAGA,EAAIxB,KAAK06B,UAAWl5B,IAClCuC,EAAIytE,EAAShwE,IAAM80C,EAAG90C,GAExB,IAASA,EAAI,EAAGA,EAAIxB,KAAK06B,UAAWl5B,IAClC80C,EAAG90C,GAAK8vE,EAAIC,EAAQ/vE,EACxB,CACF,aChEA,IAAIqqH,EAAQ,EAAQ,IAChBC,EAAa,EAAQ,KACrB5tH,EAAS,YACTo0E,EAAe,EAAQ,KACvB31C,EAAY,EAAQ,IACpB4pB,EAAM,EAAQ,IACdyvD,EAAO,EAAQ,IAGnB,SAASxvD,EAAQl0C,EAAMhU,EAAKg4C,GAC1B3Z,EAAUrlB,KAAKtX,MAEfA,KAAKgzE,OAAS,IAAI+4C,EAClB/rH,KAAKuyE,QAAU,IAAIhsB,EAAI8E,IAAI/sD,GAC3B0B,KAAK+yE,MAAQ70E,EAAOS,KAAK23C,GACzBt2C,KAAKmzE,MAAQ7gE,EACbtS,KAAKgsH,cAAe,CACtB,CAVe,EAAQ,EAYvBtsH,CAAS8mD,EAAQ7pB,GAEjB6pB,EAAO9oD,UAAU6+B,QAAU,SAAUphB,GAEnC,IAAI6jD,EACA96B,EAFJlkC,KAAKgzE,OAAOhrE,IAAImT,GAKhB,IAFA,IAAIpX,EAAM,GAEFi7D,EAAQh/D,KAAKgzE,OAAOrzD,OAC1BukB,EAAQlkC,KAAKmzE,MAAMI,QAAQvzE,KAAMg/D,GACjCj7D,EAAIia,KAAKkmB,GAGX,OAAOhmC,EAAO6hB,OAAOhc,EACvB,EAEA,IAAIkoH,EAAU/tH,EAAOU,MAAM,GAAI,IAqB/B,SAASmtH,IACP/rH,KAAKq3G,MAAQn5G,EAAOW,YAAY,EAClC,CA2BA,SAAS8nD,EAAgBsvD,EAAOhgE,EAAUK,GACxC,IAAIrF,EAAS46E,EAAM5V,EAAMp6F,eACzB,IAAKo1B,EAAQ,MAAM,IAAIlyC,UAAU,sBAGjC,GADwB,iBAAbk3C,IAAuBA,EAAW/3C,EAAOS,KAAKs3C,IACrDA,EAASv3C,SAAWuyC,EAAO3yC,IAAM,EAAG,MAAM,IAAIS,UAAU,sBAAwBk3C,EAASv3C,QAG7F,GADkB,iBAAP43C,IAAiBA,EAAKp4C,EAAOS,KAAK23C,IACzB,QAAhBrF,EAAO3+B,MAAkBgkC,EAAG53C,SAAWuyC,EAAOqF,GAAI,MAAM,IAAIv3C,UAAU,qBAAuBu3C,EAAG53C,QAEpG,MAAoB,WAAhBuyC,EAAO/1B,KACF,IAAIo3D,EAAarhC,EAAOh0C,OAAQg5C,EAAUK,GACxB,SAAhBrF,EAAO/1B,KACT,IAAI4wG,EAAW76E,EAAOh0C,OAAQg5C,EAAUK,GAG1C,IAAIkQ,EAAOvV,EAAOh0C,OAAQg5C,EAAUK,EAC7C,CAjEAkQ,EAAO9oD,UAAU8+B,OAAS,WACxB,IAAIwiC,EAAQh/D,KAAKgzE,OAAOtJ,QACxB,GAAI1pE,KAAKgsH,aAGP,OAFAhtD,EAAQh/D,KAAKmzE,MAAMI,QAAQvzE,KAAMg/D,GACjCh/D,KAAKuyE,QAAQlmB,QACN2S,EAGT,IAAKA,EAAMz+C,OAAO0rG,GAEhB,MADAjsH,KAAKuyE,QAAQlmB,QACP,IAAI5sD,MAAM,oCAEpB,EAEA+mD,EAAO9oD,UAAU8/B,eAAiB,SAAU0uF,GAE1C,OADAlsH,KAAKgsH,eAAiBE,EACflsH,IACT,EAMA+rH,EAASruH,UAAUsK,IAAM,SAAUmT,GACjCnb,KAAKq3G,MAAQn5G,EAAO6hB,OAAO,CAAC/f,KAAKq3G,MAAOl8F,GAC1C,EAEA4wG,EAASruH,UAAUiiB,IAAM,WACvB,GAAI3f,KAAKq3G,MAAM34G,OAAS,GAAI,CAC1B,IAAIqF,EAAM/D,KAAKq3G,MAAMn9F,MAAM,EAAG,IAE9B,OADAla,KAAKq3G,MAAQr3G,KAAKq3G,MAAMn9F,MAAM,IACvBnW,CACT,CACA,OAAO,IACT,EAEAgoH,EAASruH,UAAUgsE,MAAQ,WAKzB,IAJA,IAAIroE,EAAM,GAAKrB,KAAKq3G,MAAM34G,OACtBytH,EAAUjuH,EAAOW,YAAYwC,GAE7BG,GAAK,IACAA,EAAIH,GACX8qH,EAAQ7nG,WAAWjjB,EAAKG,GAG1B,OAAOtD,EAAO6hB,OAAO,CAAC/f,KAAKq3G,MAAO8U,GACpC,EA6BAnvH,EAAQ2pD,eAAiBA,EACzB3pD,EAAQypD,aATR,SAAuBwvD,EAAOhgE,GAC5B,IAAIhF,EAAS46E,EAAM5V,EAAMp6F,eACzB,IAAKo1B,EAAQ,MAAM,IAAIlyC,UAAU,sBAEjC,IAAIwpB,EAAOytF,EAAK//D,GAAU,EAAOhF,EAAO3yC,IAAK2yC,EAAOqF,IACpD,OAAOqQ,EAAesvD,EAAO1tF,EAAKjqB,IAAKiqB,EAAK+tB,GAC9C,WC9GAt5C,EAAQu2E,QAAU,SAAUzvE,EAAMm9B,GAChC,OAAOn9B,EAAKyuE,QAAQrmB,aAAajrB,EACnC,EAEAjkC,EAAQ+6C,QAAU,SAAUj0C,EAAMm9B,GAChC,OAAOn9B,EAAKyuE,QAAQpmB,aAAalrB,EACnC,aCNA,IAAI15B,EAAM,EAAQ,IAElBvK,EAAQu2E,QAAU,SAAUzvE,EAAMm9B,GAChC,IAAI9lB,EAAO5T,EAAI05B,EAAOn9B,EAAKivE,OAG3B,OADAjvE,EAAKivE,MAAQjvE,EAAKyuE,QAAQrmB,aAAa/wC,GAChCrX,EAAKivE,KACd,EAEA/1E,EAAQ+6C,QAAU,SAAUj0C,EAAMm9B,GAChC,IAAIqH,EAAMxkC,EAAKivE,MAEfjvE,EAAKivE,MAAQ9xC,EACb,IAAIl9B,EAAMD,EAAKyuE,QAAQpmB,aAAalrB,GAEpC,OAAO15B,EAAIxD,EAAKukC,EAClB,aChBA,IAAIpqC,EAAS,YACTqJ,EAAM,EAAQ,IAElB,SAAS6kH,EAActoH,EAAMqX,EAAM48B,GACjC,IAAI12C,EAAM8Z,EAAKzc,OACXqF,EAAMwD,EAAI4T,EAAMrX,EAAKkvE,QAGzB,OAFAlvE,EAAKkvE,OAASlvE,EAAKkvE,OAAO94D,MAAM7Y,GAChCyC,EAAKivE,MAAQ70E,EAAO6hB,OAAO,CAACjc,EAAKivE,MAAOh7B,EAAU58B,EAAOpX,IAClDA,CACT,CAEA/G,EAAQu2E,QAAU,SAAUzvE,EAAMqX,EAAM48B,GAItC,IAHA,IACI12C,EADA0C,EAAM7F,EAAOW,YAAY,GAGtBsc,EAAKzc,QAAQ,CAMlB,GAL2B,IAAvBoF,EAAKkvE,OAAOt0E,SACdoF,EAAKkvE,OAASlvE,EAAKyuE,QAAQrmB,aAAapoD,EAAKivE,OAC7CjvE,EAAKivE,MAAQ70E,EAAOW,YAAY,MAG9BiF,EAAKkvE,OAAOt0E,QAAUyc,EAAKzc,QAIxB,CACLqF,EAAM7F,EAAO6hB,OAAO,CAAChc,EAAKqoH,EAAatoH,EAAMqX,EAAM48B,KACnD,KACF,CANE12C,EAAMyC,EAAKkvE,OAAOt0E,OAClBqF,EAAM7F,EAAO6hB,OAAO,CAAChc,EAAKqoH,EAAatoH,EAAMqX,EAAKjB,MAAM,EAAG7Y,GAAM02C,KACjE58B,EAAOA,EAAKjB,MAAM7Y,EAKtB,CAEA,OAAO0C,CACT,aChCA,IAAI7F,EAAS,YAEb,SAASmuH,EAAavoH,EAAMwoH,EAAWv0E,GACrC,IACIh0C,EADMD,EAAKyuE,QAAQrmB,aAAapoD,EAAKivE,OAC3B,GAAKu5C,EAOnB,OALAxoH,EAAKivE,MAAQ70E,EAAO6hB,OAAO,CACzBjc,EAAKivE,MAAM74D,MAAM,GACjBhc,EAAOS,KAAK,CAACo5C,EAAUu0E,EAAYvoH,MAG9BA,CACT,CAEA/G,EAAQu2E,QAAU,SAAUzvE,EAAMk7D,EAAOjnB,GAKvC,IAJA,IAAI12C,EAAM29D,EAAMtgE,OACZqF,EAAM7F,EAAOW,YAAYwC,GACzBG,GAAK,IAEAA,EAAIH,GACX0C,EAAIvC,GAAK6qH,EAAYvoH,EAAMk7D,EAAMx9D,GAAIu2C,GAGvC,OAAOh0C,CACT,aCxBA,IAAI7F,EAAS,YAEb,SAASmuH,EAAavoH,EAAMwoH,EAAWv0E,GAMrC,IALA,IAIInwC,EAAKhK,EAHL4D,GAAK,EAELuC,EAAM,IAEDvC,EAHC,GAKRoG,EAAO0kH,EAAa,GAAM,EAAI9qH,EAAO,IAAO,EAE5CuC,IAAiB,KADjBnG,EAFMkG,EAAKyuE,QAAQrmB,aAAapoD,EAAKivE,OAEzB,GAAKnrE,KACUpG,EAAI,EAC/BsC,EAAKivE,MAAQw5C,EAAQzoH,EAAKivE,MAAOh7B,EAAUnwC,EAAMhK,GAEnD,OAAOmG,CACT,CAEA,SAASwoH,EAAStuH,EAAQL,GACxB,IAAIyD,EAAMpD,EAAOS,OACb8C,GAAK,EACLuC,EAAM7F,EAAOW,YAAYZ,EAAOS,QAGpC,IAFAT,EAASC,EAAO6hB,OAAO,CAAC9hB,EAAQC,EAAOS,KAAK,CAACf,QAEpC4D,EAAIH,GACX0C,EAAIvC,GAAKvD,EAAOuD,IAAM,EAAIvD,EAAOuD,EAAI,IAAM,EAG7C,OAAOuC,CACT,CAEA/G,EAAQu2E,QAAU,SAAUzvE,EAAMk7D,EAAOjnB,GAKvC,IAJA,IAAI12C,EAAM29D,EAAMtgE,OACZqF,EAAM7F,EAAOW,YAAYwC,GACzBG,GAAK,IAEAA,EAAIH,GACX0C,EAAIvC,GAAK6qH,EAAYvoH,EAAMk7D,EAAMx9D,GAAIu2C,GAGvC,OAAOh0C,CACT,aCzCA,IAAIwD,EAAM,EAAQ,IAElB,SAASkgH,EAAU3jH,GAEjB,OADAA,EAAKivE,MAAQjvE,EAAKyuE,QAAQrmB,aAAapoD,EAAKivE,OACrCjvE,EAAKivE,KACd,CAEA/1E,EAAQu2E,QAAU,SAAUzvE,EAAMk7D,GAChC,KAAOl7D,EAAKkvE,OAAOt0E,OAASsgE,EAAMtgE,QAChCoF,EAAKkvE,OAAS90E,OAAO6hB,OAAO,CAACjc,EAAKkvE,OAAQy0C,EAAS3jH,KAGrD,IAAIwkC,EAAMxkC,EAAKkvE,OAAO94D,MAAM,EAAG8kD,EAAMtgE,QAErC,OADAoF,EAAKkvE,OAASlvE,EAAKkvE,OAAO94D,MAAM8kD,EAAMtgE,QAC/B6I,EAAIy3D,EAAO12B,EACpB,aCfA,IAAIwjF,EAAa,EAAQ,KACrB5tH,EAAS,YACT2tH,EAAQ,EAAQ,IAChBv5C,EAAe,EAAQ,KACvB31C,EAAY,EAAQ,IACpB4pB,EAAM,EAAQ,IACdyvD,EAAO,EAAQ,IAGnB,SAASpvD,EAAUt0C,EAAMhU,EAAKg4C,GAC5B3Z,EAAUrlB,KAAKtX,MAEfA,KAAKgzE,OAAS,IAAI+4C,EAClB/rH,KAAKwsH,WAAQ,EACbxsH,KAAKuyE,QAAU,IAAIhsB,EAAI8E,IAAI/sD,GAC3B0B,KAAK+yE,MAAQ70E,EAAOS,KAAK23C,GACzBt2C,KAAKmzE,MAAQ7gE,EACbtS,KAAKgsH,cAAe,CACtB,CA8BA,SAASD,IACP/rH,KAAKq3G,MAAQn5G,EAAOW,YAAY,EAClC,CA6CA,SAAS05C,EAAkB09D,EAAOhgE,EAAUK,GAC1C,IAAIrF,EAAS46E,EAAM5V,EAAMp6F,eACzB,IAAKo1B,EAAQ,MAAM,IAAIlyC,UAAU,sBAGjC,GADkB,iBAAPu3C,IAAiBA,EAAKp4C,EAAOS,KAAK23C,IACzB,QAAhBrF,EAAO3+B,MAAkBgkC,EAAG53C,SAAWuyC,EAAOqF,GAAI,MAAM,IAAIv3C,UAAU,qBAAuBu3C,EAAG53C,QAGpG,GADwB,iBAAbu3C,IAAuBA,EAAW/3C,EAAOS,KAAKs3C,IACrDA,EAASv3C,SAAWuyC,EAAO3yC,IAAM,EAAG,MAAM,IAAIS,UAAU,sBAAwBk3C,EAASv3C,QAE7F,MAAoB,WAAhBuyC,EAAO/1B,KACF,IAAIo3D,EAAarhC,EAAOh0C,OAAQg5C,EAAUK,GAAI,GAC5B,SAAhBrF,EAAO/1B,KACT,IAAI4wG,EAAW76E,EAAOh0C,OAAQg5C,EAAUK,GAAI,GAG9C,IAAIsQ,EAAS3V,EAAOh0C,OAAQg5C,EAAUK,EAC/C,CAzGe,EAAQ,EAavB52C,CAASknD,EAAUjqB,GAEnBiqB,EAASlpD,UAAU6+B,QAAU,SAAUphB,GAErC,IAAI6jD,EACA96B,EAFJlkC,KAAKgzE,OAAOhrE,IAAImT,GAIhB,IADA,IAAIpX,EAAM,GACFi7D,EAAQh/D,KAAKgzE,OAAOrzD,IAAI3f,KAAKgsH,eACnC9nF,EAAQlkC,KAAKmzE,MAAMp7B,QAAQ/3C,KAAMg/D,GACjCj7D,EAAIia,KAAKkmB,GAEX,OAAOhmC,EAAO6hB,OAAOhc,EACvB,EAEA6iD,EAASlpD,UAAU8+B,OAAS,WAC1B,IAAIwiC,EAAQh/D,KAAKgzE,OAAOtJ,QACxB,GAAI1pE,KAAKgsH,aACP,OA0CJ,SAAgB/oG,GACd,IAAIwpG,EAASxpG,EAAK,IAClB,GAAIwpG,EAAS,GAAKA,EAAS,GACzB,MAAM,IAAIhtH,MAAM,0BAGlB,IADA,IAAI+B,GAAK,IACAA,EAAIirH,GACX,GAAIxpG,EAAMzhB,GAAK,GAAKirH,MAAcA,EAChC,MAAM,IAAIhtH,MAAM,0BAGpB,GAAe,KAAXgtH,EAEJ,OAAOxpG,EAAK/I,MAAM,EAAG,GAAKuyG,EAC5B,CAxDW5lC,CAAM7mF,KAAKmzE,MAAMp7B,QAAQ/3C,KAAMg/D,IACjC,GAAIA,EACT,MAAM,IAAIv/D,MAAM,oCAEpB,EAEAmnD,EAASlpD,UAAU8/B,eAAiB,SAAU0uF,GAE5C,OADAlsH,KAAKgsH,eAAiBE,EACflsH,IACT,EAMA+rH,EAASruH,UAAUsK,IAAM,SAAUmT,GACjCnb,KAAKq3G,MAAQn5G,EAAO6hB,OAAO,CAAC/f,KAAKq3G,MAAOl8F,GAC1C,EAEA4wG,EAASruH,UAAUiiB,IAAM,SAAU+sG,GACjC,IAAI3oH,EACJ,GAAI2oH,GACF,GAAI1sH,KAAKq3G,MAAM34G,OAAS,GAGtB,OAFAqF,EAAM/D,KAAKq3G,MAAMn9F,MAAM,EAAG,IAC1Bla,KAAKq3G,MAAQr3G,KAAKq3G,MAAMn9F,MAAM,IACvBnW,OAGT,GAAI/D,KAAKq3G,MAAM34G,QAAU,GAGvB,OAFAqF,EAAM/D,KAAKq3G,MAAMn9F,MAAM,EAAG,IAC1Bla,KAAKq3G,MAAQr3G,KAAKq3G,MAAMn9F,MAAM,IACvBnW,EAIX,OAAO,IACT,EAEAgoH,EAASruH,UAAUgsE,MAAQ,WACzB,GAAI1pE,KAAKq3G,MAAM34G,OAAQ,OAAOsB,KAAKq3G,KACrC,EA6CAr6G,EAAQ6pD,eARR,SAAyBovD,EAAOhgE,GAC9B,IAAIhF,EAAS46E,EAAM5V,EAAMp6F,eACzB,IAAKo1B,EAAQ,MAAM,IAAIlyC,UAAU,sBAEjC,IAAIwpB,EAAOytF,EAAK//D,GAAU,EAAOhF,EAAO3yC,IAAK2yC,EAAOqF,IACpD,OAAOiC,EAAiB09D,EAAO1tF,EAAKjqB,IAAKiqB,EAAK+tB,GAChD,EAGAt5C,EAAQu7C,iBAAmBA,WC3H3Bv7C,EAAQ,WAAa,CACnBsB,IAAK,EACLg4C,GAAI,GAENt5C,EAAQ,WAAaA,EAAQk5G,IAAM,CACjC53G,IAAK,EACLg4C,GAAI,GAENt5C,EAAQ,gBAAkBA,EAAQu5G,KAAO,CACvCj4G,IAAK,GACLg4C,GAAI,GAENt5C,EAAQ,YAAc,CACpBsB,IAAK,GACLg4C,GAAI,GAENt5C,EAAQ,eAAiB,CACvBsB,IAAK,GACLg4C,GAAI,GAENt5C,EAAQ,WAAa,CACnBsB,IAAK,GACLg4C,GAAI,cCtBN,IAAIq2E,EAAgB,EAAQ,KACxB/1G,EAAS,EAAQ,KAEjBmhG,EAAK,EAAQ,KASb6U,EAAY,CACd,QAAU,EAAM,KAAO,EAAM,QAAU,GA2BzC5vH,EAAQiqD,mBAAqBjqD,EAAQkqD,yBAA2BlqD,EAAQmqD,iBAnCxE,SAA2BpkD,GACzB,IAAI2U,EAAQ,IAAIxZ,OAAO0Y,EAAO7T,GAAK2U,MAAO,OACtCu8B,EAAM,IAAI/1C,OAAO0Y,EAAO7T,GAAKkxC,IAAK,OAEtC,OAAO,IAAI8jE,EAAGrgG,EAAOu8B,EACvB,EA+BAj3C,EAAQoqD,oBAAsBpqD,EAAQqqD,cAzBtC,SAASD,EAAqB1vC,EAAOuY,EAAKgoF,EAAW4U,GACnD,OAAI3uH,OAAO6c,SAASkV,SAA2B7wB,IAAnBwtH,EAAU38F,GAC7Bm3B,EAAoB1vC,EAAO,SAAUuY,EAAKgoF,IAGnDhoF,EAAMA,GAAO,SACb48F,EAAOA,GAAQ,SACf5U,EAAYA,GAAa,IAAI/5G,OAAO,CAAC,IAEhCA,OAAO6c,SAASk9F,KACnBA,EAAY,IAAI/5G,OAAO+5G,EAAW4U,IAGf,iBAAVn1G,EACF,IAAIqgG,EAAG4U,EAAcj1G,EAAOugG,GAAYA,GAAW,IAGvD/5G,OAAO6c,SAASrD,KACnBA,EAAQ,IAAIxZ,OAAOwZ,EAAOuY,IAGrB,IAAI8nF,EAAGrgG,EAAOugG,GAAW,IAClC,u6NClCA,IAAIvhE,EAAO,EAAQ,KAEnB15C,EAAQo6C,YAAc,EAAtB,KAEA,IAAIsB,EAAgBhC,EAAKx5C,OAAO,iBAAiB,WAC/C8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,kBAAkB29G,MAC3Bj8G,KAAK1B,IAAI,mBAAmB29G,MAC5Bj8G,KAAK1B,IAAI,UAAU29G,MACnBj8G,KAAK1B,IAAI,UAAU29G,MACnBj8G,KAAK1B,IAAI,aAAa29G,MACtBj8G,KAAK1B,IAAI,aAAa29G,MACtBj8G,KAAK1B,IAAI,eAAe29G,MAE5B,IACAj/G,EAAQ07C,cAAgBA,EAExB,IAAIjB,EAAef,EAAKx5C,OAAO,gBAAgB,WAC7C8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,kBAAkB29G,MAE/B,IACAj/G,EAAQy6C,aAAeA,EAEvB,IAAIF,EAAYb,EAAKx5C,OAAO,wBAAwB,WAClD8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,aAAamwD,IAAI2sD,GAC1Bp7G,KAAK1B,IAAI,oBAAoBg9G,SAEjC,IACAt+G,EAAQu6C,UAAYA,EAEpB,IAAI6jE,EAAsB1kE,EAAKx5C,OAAO,uBAAuB,WAC3D8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,aAAa23E,QACtBj2E,KAAK1B,IAAI,QAAQwuH,QAAQzuF,WACzBr+B,KAAK1B,IAAI,SAAS23E,QAAQ53C,WAC1Br+B,KAAK1B,IAAI,UAAU68G,MAAMrgG,IACvB9a,KAAK1B,IAAI,KAAK29G,MACdj8G,KAAK1B,IAAI,KAAK29G,MACdj8G,KAAK1B,IAAI,KAAK29G,OACd59E,WAEN,IAEI0uF,EAAiBr2E,EAAKx5C,OAAO,kBAAkB,WACjD8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,aAAamwD,IAAI2sD,GAC1Bp7G,KAAK1B,IAAI,qBAAqBy9G,SAElC,IACA/+G,EAAQy7C,WAAas0E,EACrB,IAAIC,EAA0Bt2E,EAAKx5C,OAAO,2BAA2B,WACnE8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,aAAa68G,MAAMrgG,IAC1B9a,KAAK1B,IAAI,MAAM23E,QACfj2E,KAAK1B,IAAI,WAAW68G,MAAMrgG,IACxB9a,KAAK1B,IAAI,OAAO68G,MAAMrgG,IACpB9a,KAAK1B,IAAI,MAAM23E,QACfj2E,KAAK1B,IAAI,aAAa68G,MAAMrgG,IAC1B9a,KAAK1B,IAAI,QAAQy9G,SACjB/7G,KAAK1B,IAAI,SAAS29G,QAGtBj8G,KAAK1B,IAAI,UAAU68G,MAAMrgG,IACvB9a,KAAK1B,IAAI,QAAQ23E,QACjBj2E,KAAK1B,IAAI,MAAMy9G,YAIrB/7G,KAAK1B,IAAI,qBAAqBy9G,SAElC,IAEA/+G,EAAQw7C,oBAAsBw0E,EAE9B,IAAIl0E,EAAgBpC,EAAKx5C,OAAO,iBAAiB,WAC/C8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,KAAK29G,MACdj8G,KAAK1B,IAAI,KAAK29G,MACdj8G,KAAK1B,IAAI,KAAK29G,MACdj8G,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,YAAY29G,MAEzB,IACAj/G,EAAQ87C,cAAgBA,EAExB97C,EAAQ86C,SAAWpB,EAAKx5C,OAAO,YAAY,WACzC8C,KAAKi8G,KACP,IAEA,IAAIrjE,EAAelC,EAAKx5C,OAAO,gBAAgB,WAC7C8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,WAAW29G,MACpBj8G,KAAK1B,IAAI,cAAcy9G,SACvB/7G,KAAK1B,IAAI,cAAc+/B,WAAWswB,SAAS,GAAGF,IAAIw+D,GAClDjtH,KAAK1B,IAAI,aAAa+/B,WAAWswB,SAAS,GAAG2sD,SAEjD,IACAt+G,EAAQ47C,aAAeA,EAEvB,IAAIq0E,EAAev2E,EAAKx5C,OAAO,gBAAgB,WAC7C8C,KAAKuuD,OAAO,CACV2+D,WAAYltH,KAAKi2E,SAErB,IAEAj5E,EAAQg8C,UAAYtC,EAAKx5C,OAAO,aAAa,WAC3C8C,KAAKm7G,MAAMrgG,IACT9a,KAAK1B,IAAI,KAAK29G,MACdj8G,KAAK1B,IAAI,KAAK29G,MAElB,oiBCvHA,SAASkR,IACP,MAAM,IAAI1tH,MAAM,6GAClB,CACA,IAAI2tH,EAAa,EAAQ,GACrBC,EAAc,EAAQ,IACtBnvH,EAASkvH,EAAWlvH,OACpBovH,EAAmBF,EAAWjuG,WAC9B8X,EAAS,EAAAxjB,EAAOwjB,QAAU,EAAAxjB,EAAOyjB,SACjCq2F,EAAajsH,KAAK6B,IAAI,EAAG,IAAM,EACnC,SAASqqH,EAAcnwG,EAAQ3e,GAC7B,GAAsB,iBAAX2e,GAAuBA,GAAWA,EAC3C,MAAM,IAAIte,UAAU,2BAGtB,GAAIse,EAASkwG,GAAclwG,EAAS,EAClC,MAAM,IAAIte,UAAU,2BAGtB,GAAIse,EAASiwG,GAAoBjwG,EAAS3e,EACxC,MAAM,IAAIkb,WAAW,sBAEzB,CAEA,SAAS0B,EAAYtc,EAAMqe,EAAQ3e,GACjC,GAAoB,iBAATM,GAAqBA,GAASA,EACvC,MAAM,IAAID,UAAU,yBAGtB,GAAIC,EAAOuuH,GAAcvuH,EAAO,EAC9B,MAAM,IAAID,UAAU,yBAGtB,GAAIC,EAAOqe,EAAS3e,GAAUM,EAAOsuH,EACnC,MAAM,IAAI1zG,WAAW,mBAEzB,CA4BA,SAAS6zG,EAAYtuH,EAAKke,EAAQre,EAAM+8B,GACtC,GAAInO,QAAQ2/C,QAAS,CACnB,IAAImgD,EAASvuH,EAAIlB,OACb8qF,EAAO,IAAIlvE,WAAW6zG,EAAQrwG,EAAQre,GAE1C,OADAi4B,EAAOG,gBAAgB2xD,GACnBhtD,OACFnO,QAAQqO,UAAS,WACfF,EAAG,KAAM58B,EACX,IAGKA,CACT,CACA,IAAI48B,EAYJ,OAFYsxF,EAAYruH,GAClBoE,KAAKjE,EAAKke,GACTle,EAXLkuH,EAAYruH,GAAM,SAAUo0B,EAAKlS,GAC/B,GAAIkS,EACF,OAAO2I,EAAG3I,GAEZlS,EAAM9d,KAAKjE,EAAKke,GAChB0e,EAAG,KAAM58B,EACX,GAMJ,CArDK83B,GAAUA,EAAOG,kBAAqBxJ,QAAQ2/C,SACjDvwE,EAAQirD,WAMV,SAAqB9oD,EAAKke,EAAQre,EAAM+8B,GACtC,KAAK79B,EAAO6c,SAAS5b,IAAUA,aAAe,EAAAsU,EAAOoG,YACnD,MAAM,IAAI9a,UAAU,iDAGtB,GAAsB,mBAAXse,EACT0e,EAAK1e,EACLA,EAAS,EACTre,EAAOG,EAAIT,YACN,GAAoB,mBAATM,EAChB+8B,EAAK/8B,EACLA,EAAOG,EAAIT,OAAS2e,OACf,GAAkB,mBAAP0e,EAChB,MAAM,IAAIh9B,UAAU,oCAItB,OAFAyuH,EAAanwG,EAAQle,EAAIT,QACzB4c,EAAWtc,EAAMqe,EAAQle,EAAIT,QACtB+uH,EAAWtuH,EAAKke,EAAQre,EAAM+8B,EACvC,EAvBE/+B,EAAQkrD,eAoDV,SAAyB/oD,EAAKke,EAAQre,GAIpC,QAHsB,IAAXqe,IACTA,EAAS,KAENnf,EAAO6c,SAAS5b,IAAUA,aAAe,EAAAsU,EAAOoG,YACnD,MAAM,IAAI9a,UAAU,iDAStB,OANAyuH,EAAanwG,EAAQle,EAAIT,aAEZU,IAATJ,IAAoBA,EAAOG,EAAIT,OAAS2e,GAE5C/B,EAAWtc,EAAMqe,EAAQle,EAAIT,QAEtB+uH,EAAWtuH,EAAKke,EAAQre,EACjC,IAjEEhC,EAAQirD,WAAaklE,EACrBnwH,EAAQkrD,eAAiBilE,yBC1C3B,IAAIjrH,EAAW7E,OAAOK,UAAUwE,SAGhClF,EAAQ2E,QAAU,SAAU/D,EAAO6oB,GACjC,IAAK/kB,MAAMC,QAAQ/D,GAAQ,MAAMmB,UAAU0nB,EAC7C,EAEAzpB,EAAQipC,UAAY,SAAUroC,EAAO6oB,GACnC,GAA6B,qBAAzBvkB,EAASoV,KAAK1Z,GAA+B,MAAMmB,UAAU0nB,EACnE,EAEAzpB,EAAQ+d,SAAW,SAAUnd,EAAO6oB,GAClC,IAAKvoB,OAAO6c,SAASnd,GAAQ,MAAMmB,UAAU0nB,EAC/C,EAEAzpB,EAAQ4pC,WAAa,SAAUhpC,EAAO6oB,GACpC,GAA6B,sBAAzBvkB,EAASoV,KAAK1Z,GAAgC,MAAMmB,UAAU0nB,EACpE,EAEAzpB,EAAQ+pC,SAAW,SAAUnpC,EAAO6oB,GAClC,GAA6B,oBAAzBvkB,EAASoV,KAAK1Z,GAA8B,MAAMmB,UAAU0nB,EAClE,EAEAzpB,EAAQ+wB,SAAW,SAAUnwB,EAAO6oB,GAClC,GAA6B,oBAAzBvkB,EAASoV,KAAK1Z,GAA8B,MAAMmB,UAAU0nB,EAClE,EAGAzpB,EAAQ8iH,eAAiB,SAAU7hH,EAAQS,EAAQ+nB,GACjD,GAAIxoB,EAAOS,SAAWA,EAAQ,MAAMkb,WAAW6M,EACjD,EAEAzpB,EAAQyjH,gBAAkB,SAAUxiH,EAAQ0vH,EAASC,EAASnnG,GAC5D,GAAIxoB,EAAOS,SAAWivH,GAAW1vH,EAAOS,SAAWkvH,EAAS,MAAMh0G,WAAW6M,EAC/E,EAEAzpB,EAAQ+jH,eAAiB,SAAUnjH,EAAO6oB,GACxC,GAAqB,IAAjB7oB,EAAMc,OAAc,MAAMkb,WAAW6M,EAC3C,EAEAzpB,EAAQmlH,mBAAqB,SAAUviH,EAAQ4N,EAAGC,EAAGgZ,GACnD,GAAI7mB,GAAU4N,GAAK5N,GAAU6N,EAAG,MAAMmM,WAAW6M,EACnD,0BC1CA,IAAIvoB,EAAS,YACT2vH,EAAQ,EAAQ,KAEhBC,EAAmC5vH,EAAOS,KAAK,CAEjD,GAAM,IAAM,IAAM,EAAM,EAAM,EAAM,EAAM,GAE1C,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAE1F,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,EAAM,EAAM,EAAM,GAAM,GAAM,EAAM,EAAM,GAAM,IAAM,GAC1F,IAAM,GAAM,EAAM,EAAM,EAAM,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAC1F,GAAM,EAAM,EAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAC1F,GAAM,IAAM,EAAM,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAC1F,IAAM,IAAM,GAAM,GAAM,GAAM,EAAM,EAAM,EAAM,IAAM,GAAM,EAAM,GAAM,EAExE,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,IAGEovH,EAAqC7vH,EAAOS,KAAK,CAEnD,GAAM,IAAM,EAAM,GAAM,EAAM,EAAM,EAAM,EAAM,GAEhD,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAE1F,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,EAAM,EAAM,EAAM,GAAM,GAAM,EAAM,EAAM,GAAM,IAAM,GAC1F,IAAM,GAAM,EAAM,EAAM,EAAM,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAC1F,GAAM,EAAM,EAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAC1F,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAC1F,EAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAC1F,IAAM,IAAM,EAAM,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAC1F,IAAM,IAAM,GAAM,GAAM,GAAM,EAAM,EAAM,EAAM,IAAM,GAAM,EAAM,GAAM,EAExE,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,IAGF3B,EAAQ4iH,iBAAmB,SAAUjnE,EAAYqsD,EAAW6a,GAC1D,IAAI5qE,EAAS/2C,EAAOS,KAAKkhH,EAAaiO,EAAmCC,GAGzE,OAFAp1E,EAAWv1C,KAAK6xC,EAAQ4qE,EAAa,EAAI,GACzC7a,EAAU5hG,KAAK6xC,EAAQ4qE,EAAa,IAAM,KACnC5qE,CACT,EAEAj4C,EAAQgjH,iBAAmB,SAAUrnE,GACnC,IAAIj6C,EAASi6C,EAAWj6C,OAGpBgC,EAAQ,EACZ,KAAIhC,EAASgC,EAAQ,GAA2B,KAAtBi4C,EAAWj4C,OAIjChC,GAHJgC,GAAS,GAGY,IAA2B,IAApBi4C,EAAWj4C,GAAvC,CAEA,IAAIstH,EAA2B,IAApBr1E,EAAWj4C,GAEtB,GADAA,GAAS,IACLstH,EAAO,GAAKA,EAAO,GACnBtvH,EAASgC,EAAQstH,GAArB,CAGA,IAAI3sH,EAAMs3C,EAAWj4C,EAAQstH,EAAO,IAAMA,EAAO,EAAIr1E,EAAWj4C,EAAQstH,EAAO,IAAM,EAAI,GAEzF,KAAItvH,GADJgC,GAASstH,GACY3sH,GAGjB3C,EAASgC,EAAQ,GACK,IAAtBi4C,EAAWj4C,IACe,IAA1Bi4C,EAAWj4C,EAAQ,IACO,IAA1Bi4C,EAAWj4C,EAAQ,IAMnBhC,GAHJgC,GAAS,GAGY,GACK,IAAtBi4C,EAAWj4C,IACXi4C,EAAWj4C,EAAQ,GAAK,IACxBhC,EAASgC,EAAQ,EAAIi4C,EAAWj4C,EAAQ,IAI5C,OAAOi4C,EAAWz+B,MAAMxZ,EAAQ,EAAGA,EAAQ,EAAIi4C,EAAWj4C,EAAQ,GAxBvC,CAL4B,CA8BzD,EAEA1D,EAAQokH,gBAAkB,SAAUC,GAElC,IADA,IAAItgH,EAAI7C,EAAO6hB,OAAO,CAAC7hB,EAAOS,KAAK,CAAC,IAAK0iH,EAAOtgH,IACvCyhH,EAAO,GAAIyL,EAAO,EAAGzL,EAAO,GAAiB,IAAZzhH,EAAEktH,MAAkC,IAAdltH,EAAEktH,EAAO,MAAczL,IAAQyL,GAG/F,IADA,IAAIx/G,EAAIvQ,EAAO6hB,OAAO,CAAC7hB,EAAOS,KAAK,CAAC,IAAK0iH,EAAO5yG,IACvCg0G,EAAO,GAAIyL,EAAO,EAAGzL,EAAO,GAAiB,IAAZh0G,EAAEy/G,MAAkC,IAAdz/G,EAAEy/G,EAAO,MAAczL,IAAQyL,GAE/F,OAAOL,EAAMvjG,OAAOvpB,EAAEmZ,MAAM+zG,GAAOx/G,EAAEyL,MAAMg0G,GAC7C,EAEAlxH,EAAQskH,gBAAkB,SAAUziB,GAClC,IAAI99F,EAAI7C,EAAOU,MAAM,GAAI,GACrB6P,EAAIvQ,EAAOU,MAAM,GAAI,GAEzB,IACE,IAAIyiH,EAASwM,EAAMruF,OAAOq/D,GAE1B,GADwB,KAApBwiB,EAAOtgH,EAAErC,QAAiC,IAAhB2iH,EAAOtgH,EAAE,KAAasgH,EAAOtgH,EAAIsgH,EAAOtgH,EAAEmZ,MAAM,IAC1EmnG,EAAOtgH,EAAErC,OAAS,GAAI,MAAM,IAAIe,MAAM,wBAE1C,GADwB,KAApB4hH,EAAO5yG,EAAE/P,QAAiC,IAAhB2iH,EAAO5yG,EAAE,KAAa4yG,EAAO5yG,EAAI4yG,EAAO5yG,EAAEyL,MAAM,IAC1EmnG,EAAO5yG,EAAE/P,OAAS,GAAI,MAAM,IAAIe,MAAM,uBAC5C,CAAE,MAAO2zB,GACP,MACF,CAKA,OAHAiuF,EAAOtgH,EAAEqC,KAAKrC,EAAG,GAAKsgH,EAAOtgH,EAAErC,QAC/B2iH,EAAO5yG,EAAErL,KAAKqL,EAAG,GAAK4yG,EAAO5yG,EAAE/P,QAExB,CAAEqC,EAAGA,EAAG0N,EAAGA,EACpB,EAEAzR,EAAQwkH,mBAAqB,SAAU3iB,GACrC,IAAI99F,EAAI7C,EAAOU,MAAM,GAAI,GACrB6P,EAAIvQ,EAAOU,MAAM,GAAI,GAErBF,EAASmgG,EAAIngG,OACbgC,EAAQ,EAGZ,GAAqB,KAAjBm+F,EAAIn+F,KAAR,CAGA,IAAIytH,EAAUtvB,EAAIn+F,KAClB,KAAc,IAAVytH,IACFztH,GAASytH,EAAU,KACPzvH,IAIO,IAAjBmgG,EAAIn+F,KAAR,CAGA,IAAIuX,EAAO4mF,EAAIn+F,KACf,GAAW,IAAPuX,EAAa,CAEf,GAAIvX,GADJytH,EAAUl2G,EAAO,KACKvZ,EAAQ,OAC9B,KAAOyvH,EAAU,GAAoB,IAAftvB,EAAIn+F,GAAiBA,GAAS,EAAGytH,GAAW,GAClE,IAAKl2G,EAAO,EAAGk2G,EAAU,EAAGztH,GAAS,EAAGytH,GAAW,EAAGl2G,GAAQA,GAAQ,GAAK4mF,EAAIn+F,EACjF,CACA,KAAIuX,EAAOvZ,EAASgC,GAApB,CACA,IAAI0tH,EAAS1tH,EAIb,GAHAA,GAASuX,EAGY,IAAjB4mF,EAAIn+F,KAAR,CAGA,IAAIo9F,EAAOe,EAAIn+F,KACf,GAAW,IAAPo9F,EAAa,CAEf,GAAIp9F,GADJytH,EAAUrwB,EAAO,KACKp/F,EAAQ,OAC9B,KAAOyvH,EAAU,GAAoB,IAAftvB,EAAIn+F,GAAiBA,GAAS,EAAGytH,GAAW,GAClE,IAAKrwB,EAAO,EAAGqwB,EAAU,EAAGztH,GAAS,EAAGytH,GAAW,EAAGrwB,GAAQA,GAAQ,GAAKe,EAAIn+F,EACjF,CACA,KAAIo9F,EAAOp/F,EAASgC,GAApB,CACA,IAAI2tH,EAAS3tH,EAIb,IAHAA,GAASo9F,EAGF7lF,EAAO,GAAqB,IAAhB4mF,EAAIuvB,GAAkBn2G,GAAQ,EAAGm2G,GAAU,GAE9D,KAAIn2G,EAAO,IAAX,CACA,IAAIq2G,EAASzvB,EAAI3kF,MAAMk0G,EAAQA,EAASn2G,GAIxC,IAHAq2G,EAAOlrH,KAAKrC,EAAG,GAAKutH,EAAO5vH,QAGpBo/F,EAAO,GAAqB,IAAhBe,EAAIwvB,GAAkBvwB,GAAQ,EAAGuwB,GAAU,GAE9D,KAAIvwB,EAAO,IAAX,CACA,IAAIywB,EAAS1vB,EAAI3kF,MAAMm0G,EAAQA,EAASvwB,GAGxC,OAFAywB,EAAOnrH,KAAKqL,EAAG,GAAK8/G,EAAO7vH,QAEpB,CAAEqC,EAAGA,EAAG0N,EAAGA,EAJH,CAPA,CAPY,CAVA,CALA,CAVA,CAVA,CAsD7B,gCChMA,MAAM+/G,EAAwB,CAAC,EAAG,EAAG,MAAO,EAAG,MAAO,WAAY,WAAY,WAAY,MAAO,EAAG,WAAY,EAAG,WAAY,WAAY,MAAO,WAAY,IAAK,EAAG,IAAK,EAAG,WAAY,EAAG,WAAY,EAAG,WAAY,EAAG,IAAK,WAAY,MAAO,WAAY,MAAO,WAAY,MAAO,WAAY,IAAK,WAAY,MAAO,EAAG,WAAY,WAAY,WAAY,WAAY,MAAO,WAAY,WAAY,EAAG,WAAY,YAE9ZxxH,EAAQ+oH,MAAQ,SAAUt3G,GACxB,IAAK,IAAIqB,EAAQ,EAAGA,EAAQ,KAAMA,EAAO,CAEvC,MAAM2+G,EAAMhgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCigH,EAAMjgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCkgH,EAAMlgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCmgH,EAAMngH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCogH,EAAMpgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCqgH,EAAMrgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCsgH,EAAMtgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCugH,EAAMvgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCwgH,EAAMxgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACvCygH,EAAMzgH,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAE7C,IAAIvK,EAAK+qH,GAAON,GAAO,EAAIC,IAAQ,IAC/B5oH,EAAKkpH,GAAON,GAAO,EAAID,IAAQ,IACnC,MAAMQ,EAAS1gH,EAAE,GAAKvK,EAChBkrH,EAAS3gH,EAAE,GAAKzI,EAChBqpH,EAAS5gH,EAAE,IAAMvK,EACjBorH,EAAS7gH,EAAE,IAAMzI,EACjBupH,EAAU9gH,EAAE,IAAMvK,EAClBsrH,EAAU/gH,EAAE,IAAMzI,EAClBypH,EAAUhhH,EAAE,IAAMvK,EAClBwrH,EAAUjhH,EAAE,IAAMzI,EAClB2pH,EAAUlhH,EAAE,IAAMvK,EAClB0rH,EAAUnhH,EAAE,IAAMzI,EACxB9B,EAAKuqH,GAAOI,GAAO,EAAIC,IAAQ,IAC/B9oH,EAAK0oH,GAAOI,GAAO,EAAID,IAAQ,IAC/B,MAAMgB,EAASphH,EAAE,GAAKvK,EAChB4rH,EAASrhH,EAAE,GAAKzI,EAChB+pH,EAASthH,EAAE,IAAMvK,EACjB8rH,EAASvhH,EAAE,IAAMzI,EACjBiqH,EAAUxhH,EAAE,IAAMvK,EAClBgsH,EAAUzhH,EAAE,IAAMzI,EAClBmqH,EAAU1hH,EAAE,IAAMvK,EAClBksH,EAAU3hH,EAAE,IAAMzI,EAClBqqH,EAAU5hH,EAAE,IAAMvK,EAClBosH,EAAU7hH,EAAE,IAAMzI,EACxB9B,EAAKyqH,GAAOI,GAAO,EAAIC,IAAQ,IAC/BhpH,EAAK4oH,GAAOI,GAAO,EAAID,IAAQ,IAC/B,MAAMwB,EAAS9hH,EAAE,GAAKvK,EAChBssH,EAAS/hH,EAAE,GAAKzI,EAChByqH,EAAShiH,EAAE,IAAMvK,EACjBwsH,EAASjiH,EAAE,IAAMzI,EACjB2qH,EAAUliH,EAAE,IAAMvK,EAClB0sH,EAAUniH,EAAE,IAAMzI,EAClB6qH,EAAUpiH,EAAE,IAAMvK,EAClB4sH,EAAUriH,EAAE,IAAMzI,EAClB+qH,EAAUtiH,EAAE,IAAMvK,EAClB8sH,EAAUviH,EAAE,IAAMzI,EACxB9B,EAAK2qH,GAAOI,GAAO,EAAIC,IAAQ,IAC/BlpH,EAAK8oH,GAAOI,GAAO,EAAID,IAAQ,IAC/B,MAAMgC,EAASxiH,EAAE,GAAKvK,EAChBgtH,EAASziH,EAAE,GAAKzI,EAChBmrH,EAAS1iH,EAAE,IAAMvK,EACjBktH,EAAS3iH,EAAE,IAAMzI,EACjBqrH,EAAU5iH,EAAE,IAAMvK,EAClBotH,EAAU7iH,EAAE,IAAMzI,EAClBurH,EAAU9iH,EAAE,IAAMvK,EAClBstH,EAAU/iH,EAAE,IAAMzI,EAClByrH,EAAUhjH,EAAE,IAAMvK,EAClBwtH,GAAUjjH,EAAE,IAAMzI,EACxB9B,EAAK6qH,GAAON,GAAO,EAAIC,IAAQ,IAC/B1oH,EAAKgpH,GAAON,GAAO,EAAID,IAAQ,IAC/B,MAAMkD,GAASljH,EAAE,GAAKvK,EAChB0tH,GAASnjH,EAAE,GAAKzI,EAChB6rH,GAASpjH,EAAE,IAAMvK,EACjB4tH,GAASrjH,EAAE,IAAMzI,EACjB+rH,GAAUtjH,EAAE,IAAMvK,EAClB8tH,GAAUvjH,EAAE,IAAMzI,EAClBisH,GAAUxjH,EAAE,IAAMvK,EAClBguH,GAAUzjH,EAAE,IAAMzI,EAClBmsH,GAAU1jH,EAAE,IAAMvK,EAClBkuH,GAAU3jH,EAAE,IAAMzI,EAGlBqsH,GAASlD,EACTmD,GAASlD,EACTmD,GAAWjD,GAAU,EAAID,IAAW,GACpCmD,GAAWnD,GAAU,EAAIC,IAAW,GACpCmD,GAAUlD,GAAW,EAAIC,IAAY,GACrCkD,GAAUlD,GAAW,EAAID,IAAY,GACrCoD,GAAWjD,GAAW,EAAID,IAAY,GACtCmD,GAAWnD,GAAW,EAAIC,IAAY,GACtCmD,GAAWlD,GAAW,GAAKC,IAAY,GACvCkD,GAAWlD,GAAW,GAAKD,IAAY,GACvCoD,GAAWlD,GAAU,EAAIC,IAAW,GACpCkD,GAAWlD,GAAU,EAAID,IAAW,GACpCoD,GAAUjD,GAAU,GAAKD,IAAW,GACpCmD,GAAUnD,GAAU,GAAKC,IAAW,GACpCmD,GAAWlD,GAAW,GAAKC,IAAY,GACvCkD,GAAWlD,GAAW,GAAKD,IAAY,GACvCoD,GAAUjD,GAAW,GAAKD,IAAY,GACtCmD,GAAUnD,GAAW,GAAKC,IAAY,GACtCmD,GAAWlD,GAAW,EAAIC,IAAY,GACtCkD,GAAWlD,GAAW,EAAID,IAAY,GACtCoD,GAAWjD,GAAU,GAAKD,IAAW,EACrCmD,GAAWnD,GAAU,GAAKC,IAAW,EACrCmD,GAAWlD,GAAU,EAAIC,IAAW,GACpCkD,GAAWlD,GAAU,EAAID,IAAW,GACpCoD,GAAUjD,GAAW,GAAKD,IAAY,GACtCmD,GAAUnD,GAAW,GAAKC,IAAY,GACtCmD,GAAWlD,GAAW,GAAKC,IAAY,GACvCkD,GAAWlD,GAAW,GAAKD,IAAY,GACvCoD,GAAUjD,GAAW,GAAKD,IAAY,EACtCmD,GAAUnD,GAAW,GAAKC,IAAY,EACtCmD,GAAUlD,GAAU,GAAKC,IAAW,EACpCkD,GAAUlD,GAAU,GAAKD,IAAW,EACpCoD,GAAWjD,GAAU,GAAKD,IAAW,EACrCmD,GAAWnD,GAAU,GAAKC,IAAW,EACrCmD,GAAWlD,GAAW,GAAKC,IAAY,EACvCkD,GAAWlD,GAAW,GAAKD,IAAY,EACvCoD,GAAUlD,GAAW,GAAKC,IAAY,GACtCkD,GAAUlD,GAAW,GAAKD,IAAY,GACtCoD,GAAWjD,IAAW,GAAKD,IAAY,EACvCmD,GAAWnD,GAAW,GAAKC,KAAY,EACvCmD,GAAWlD,IAAU,GAAKC,KAAW,EACrCkD,GAAWlD,IAAU,GAAKD,KAAW,EACrCoD,GAAUlD,IAAU,GAAKC,KAAW,GACpCkD,GAAUlD,IAAU,GAAKD,KAAW,GACpCoD,GAAWjD,IAAW,EAAID,KAAY,GACtCmD,GAAWnD,IAAW,EAAIC,KAAY,GACtCmD,GAAWlD,IAAW,EAAIC,KAAY,GACtCkD,GAAWlD,IAAW,EAAID,KAAY,GACtCoD,GAAUlD,IAAW,GAAKC,KAAY,GACtCkD,GAAUlD,IAAW,GAAKD,KAAY,GAG5C1jH,EAAE,GAAK4jH,IAAWY,GAASY,GAC3BplH,EAAE,GAAK6jH,IAAWY,GAASY,GAC3BrlH,EAAE,IAAM0lH,IAAWY,GAAStC,GAC5BhkH,EAAE,IAAM2lH,IAAWY,GAAStC,GAC5BjkH,EAAE,IAAMskH,IAAYY,GAAUY,GAC9B9lH,EAAE,IAAMukH,IAAYY,GAAUY,GAC9B/lH,EAAE,IAAMomH,IAAYtC,GAAUY,GAC9B1kH,EAAE,IAAMqmH,IAAYtC,GAAUY,GAC9B3kH,EAAE,IAAMglH,IAAYY,GAAUY,GAC9BxmH,EAAE,IAAMilH,IAAYY,GAAUY,GAC9BzmH,EAAE,GAAKwkH,IAAWY,GAASY,GAC3BhmH,EAAE,GAAKykH,IAAWY,GAASY,GAC3BjmH,EAAE,IAAMsmH,IAAWtC,GAASY,GAC5B5kH,EAAE,IAAMumH,IAAWtC,GAASY,GAC5B7kH,EAAE,IAAMklH,IAAYY,GAAUY,GAC9B1mH,EAAE,IAAMmlH,IAAYY,GAAUY,GAC9B3mH,EAAE,IAAM8jH,IAAYY,GAAUY,GAC9BtlH,EAAE,IAAM+jH,IAAYY,GAAUY,GAC9BvlH,EAAE,IAAM4lH,IAAYY,GAAUtC,GAC9BlkH,EAAE,IAAM6lH,IAAYY,GAAUtC,GAC9BnkH,EAAE,GAAKolH,IAAWY,GAASY,GAC3B5mH,EAAE,GAAKqlH,IAAWY,GAASY,GAC3B7mH,EAAE,IAAMgkH,IAAWY,GAASY,GAC5BxlH,EAAE,IAAMikH,IAAWY,GAASY,GAC5BzlH,EAAE,IAAM8lH,IAAYY,GAAUtC,GAC9BpkH,EAAE,IAAM+lH,IAAYY,GAAUtC,GAC9BrkH,EAAE,IAAM0kH,IAAYY,GAAUY,GAC9BlmH,EAAE,IAAM2kH,IAAYY,GAAUY,GAC9BnmH,EAAE,IAAMwmH,IAAYtC,GAAUY,GAC9B9kH,EAAE,IAAMymH,IAAYtC,GAAUY,GAC9B/kH,EAAE,GAAKgmH,IAAWY,GAAShD,GAC3B5jH,EAAE,GAAKimH,IAAWY,GAAShD,GAC3B7jH,EAAE,IAAM4kH,IAAWY,GAASE,GAC5B1lH,EAAE,IAAM6kH,IAAWY,GAASE,GAC5B3lH,EAAE,IAAM0mH,IAAYtC,GAAUE,GAC9BtkH,EAAE,IAAM2mH,IAAYtC,GAAUE,GAC9BvkH,EAAE,IAAMslH,IAAYY,GAAUE,GAC9BpmH,EAAE,IAAMulH,IAAYY,GAAUE,GAC9BrmH,EAAE,IAAMkkH,IAAYY,GAAUE,GAC9BhlH,EAAE,IAAMmkH,IAAYY,GAAUE,GAC9BjlH,EAAE,GAAK4mH,IAAWhD,GAASY,GAC3BxkH,EAAE,GAAK6mH,IAAWhD,GAASY,GAC3BzkH,EAAE,IAAMwlH,IAAWE,GAASY,GAC5BtmH,EAAE,IAAMylH,IAAWE,GAASY,GAC5BvmH,EAAE,IAAMokH,IAAYE,GAAUY,GAC9BllH,EAAE,IAAMqkH,IAAYE,GAAUY,GAC9BnlH,EAAE,IAAMkmH,IAAYE,GAAUtC,GAC9B9jH,EAAE,IAAMmmH,IAAYE,GAAUtC,GAC9B/jH,EAAE,IAAM8kH,IAAYE,GAAUY,GAC9B5lH,EAAE,IAAM+kH,IAAYE,GAAUY,GAG9B7lH,EAAE,IAAM+/G,EAA8B,EAAR1+G,GAC9BrB,EAAE,IAAM+/G,EAA8B,EAAR1+G,EAAY,EAC5C,CACF,ICxLIylH,yBAA2B,CAAC,EAGhC,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeH,yBAAyBE,GAC5C,QAAqBr2H,IAAjBs2H,EACH,OAAOA,EAAa14H,QAGrB,IAAIC,EAASs4H,yBAAyBE,GAAY,CACjDjsG,GAAIisG,EACJE,QAAQ,EACR34H,QAAS,CAAC,GAUX,OANA44H,oBAAoBH,GAAUn+G,KAAKra,EAAOD,QAASC,EAAQA,EAAOD,QAASw4H,qBAG3Ev4H,EAAO04H,QAAS,EAGT14H,EAAOD,OACf,CCxBAw4H,oBAAoBhmH,EAAKvS,IACxB,IAAI+yE,EAAS/yE,GAAUA,EAAO44H,WAC7B,IAAO54H,EAAiB,QACxB,IAAM,EAEP,OADAu4H,oBAAoB9kG,EAAEs/C,EAAQ,CAAEhsE,EAAGgsE,IAC5BA,CAAM,ECLdwlD,oBAAoB9kG,EAAI,CAAC1zB,EAAS84H,KACjC,IAAI,IAAIx3H,KAAOw3H,EACXN,oBAAoBptH,EAAE0tH,EAAYx3H,KAASk3H,oBAAoBptH,EAAEpL,EAASsB,IAC5EjB,OAAOqiB,eAAe1iB,EAASsB,EAAK,CAAET,YAAY,EAAM8hB,IAAKm2G,EAAWx3H,IAE1E,ECNDk3H,oBAAoB/hH,EAAI,WACvB,GAA0B,iBAAfrW,WAAyB,OAAOA,WAC3C,IACC,OAAO4C,MAAQ,IAAIuyB,SAAS,cAAb,EAChB,CAAE,MAAOhyB,GACR,GAAsB,iBAAXD,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBk1H,oBAAoBptH,EAAI,CAAC0S,EAAKgO,IAAUzrB,OAAOK,UAAUwwB,eAAe5W,KAAKwD,EAAKgO,GCClF0sG,oBAAoBz0H,EAAK/D,IACH,oBAAXwc,QAA0BA,OAAO43B,aAC1C/zC,OAAOqiB,eAAe1iB,EAASwc,OAAO43B,YAAa,CAAExzC,MAAO,WAE7DP,OAAOqiB,eAAe1iB,EAAS,aAAc,CAAEY,OAAO,GAAO,ECL9D43H,oBAAoBO,IAAO94H,IAC1BA,EAAOu1F,MAAQ,GACVv1F,EAAOoxD,WAAUpxD,EAAOoxD,SAAW,IACjCpxD,ghFCqJqBI,OAAOC,OA0GXD,OAAOC,OAyDkB,mBAApB04H,iBAAiCA,gBCxTxD,IAAIC,EAAa,GAQbC,EAAM,IAAI7+F,YAAY,CAC7B,WACA,WACA,WACA,WACA,UACA,WACA,WACA,WACA,WACA,UACA,UACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,UACA,UACA,UACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,UACA,UACA,UACA,UACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,UACA,UACA,UACA,UACA,UACA,UACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,aAKO8+F,EAAO,CACd,WACA,WACA,WACA,WACA,WACA,WACA,UACA,YAKOC,EAAsB90H,KAAK6B,IAAI,EAAG,IAAM,ECzF/CkzH,EAA2B,WAC3B,SAASA,IACLr2H,KAAKm1B,MAAQge,WAAWx0C,KAAKw3H,GAC7Bn2H,KAAK+8F,KAAO,IAAI5pD,WAAW,IAC3BnzC,KAAK/B,OAAS,IAAI4b,WAAW,IAC7B7Z,KAAKs2H,aAAe,EACpBt2H,KAAKu2H,YAAc,EAInBv2H,KAAK6jD,UAAW,CACpB,CAsGA,OArGAwyE,EAAU34H,UAAU29B,OAAS,SAAUlgB,GACnC,GAAInb,KAAK6jD,SACL,MAAM,IAAIpkD,MAAM,iDAEpB,IAAIg3B,EAAW,EACXrxB,EAAa+V,EAAK/V,WAEtB,GADApF,KAAKu2H,aAAenxH,EACG,EAAnBpF,KAAKu2H,YAAkBH,EACvB,MAAM,IAAI32H,MAAM,uCAEpB,KAAO2F,EAAa,GAChBpF,KAAK/B,OAAO+B,KAAKs2H,gBAAkBn7G,EAAKsb,KACxCrxB,IACIpF,KAAKs2H,eAAiBL,IACtBj2H,KAAKw2H,aACLx2H,KAAKs2H,aAAe,EAGhC,EACAD,EAAU34H,UAAU++B,OAAS,WACzB,IAAKz8B,KAAK6jD,SAAU,CAChB,IAAI4yE,EAAgC,EAAnBz2H,KAAKu2H,YAClBG,EAAa,IAAIjkF,SAASzyC,KAAK/B,OAAOA,OAAQ+B,KAAK/B,OAAOwc,WAAYza,KAAK/B,OAAOmH,YAClFuxH,EAAoB32H,KAAKs2H,aAG7B,GAFAI,EAAWE,SAAS52H,KAAKs2H,eAAgB,KAErCK,EAAoBV,GAAcA,GAAgB,CAClD,IAAK,IAAIz0H,EAAIxB,KAAKs2H,aAAc90H,EAAIy0H,EAAYz0H,IAC5Ck1H,EAAWE,SAASp1H,EAAG,GAE3BxB,KAAKw2H,aACLx2H,KAAKs2H,aAAe,CACxB,CACA,IAAS90H,EAAIxB,KAAKs2H,aAAc90H,EAAIy0H,GAAgBz0H,IAChDk1H,EAAWE,SAASp1H,EAAG,GAE3Bk1H,EAAWG,UAAUZ,GAAgB30H,KAAKylB,MAAM0vG,EAAa,aAAc,GAC3EC,EAAWG,UAAUZ,GAAgBQ,GACrCz2H,KAAKw2H,aACLx2H,KAAK6jD,UAAW,CACpB,CAGA,IAAI9/C,EAAM,IAAI8V,WDpDK,ICqDnB,IAASrY,EAAI,EAAGA,EAAI,EAAGA,IACnBuC,EAAQ,EAAJvC,GAAUxB,KAAKm1B,MAAM3zB,KAAO,GAAM,IACtCuC,EAAQ,EAAJvC,EAAQ,GAAMxB,KAAKm1B,MAAM3zB,KAAO,GAAM,IAC1CuC,EAAQ,EAAJvC,EAAQ,GAAMxB,KAAKm1B,MAAM3zB,KAAO,EAAK,IACzCuC,EAAQ,EAAJvC,EAAQ,GAAMxB,KAAKm1B,MAAM3zB,KAAO,EAAK,IAE7C,OAAOuC,CACX,EACAsyH,EAAU34H,UAAU84H,WAAa,WAG7B,IAFA,IAAev4H,EAAN+B,KAAkB/B,OAAQk3B,EAA1Bn1B,KAAqCm1B,MAC1C2hG,EAAS3hG,EAAM,GAAI4hG,EAAS5hG,EAAM,GAAI6hG,EAAS7hG,EAAM,GAAI8hG,EAAS9hG,EAAM,GAAI+hG,EAAS/hG,EAAM,GAAIgiG,EAAShiG,EAAM,GAAIiiG,EAASjiG,EAAM,GAAIkiG,EAASliG,EAAM,GAC/I3zB,EAAI,EAAGA,EAAIy0H,EAAYz0H,IAAK,CACjC,GAAIA,EAAI,GACJxB,KAAK+8F,KAAKv7F,IACY,IAAhBvD,EAAW,EAAJuD,KAAkB,IACD,IAApBvD,EAAW,EAAJuD,EAAQ,KAAc,IACT,IAApBvD,EAAW,EAAJuD,EAAQ,KAAc,EACV,IAApBvD,EAAW,EAAJuD,EAAQ,OAEvB,CACD,IAAI4X,EAAIpZ,KAAK+8F,KAAKv7F,EAAI,GAClB81H,GAASl+G,IAAM,GAAOA,GAAK,KAASA,IAAM,GAAOA,GAAK,IAAQA,IAAM,GAEpEm+G,IADJn+G,EAAIpZ,KAAK+8F,KAAKv7F,EAAI,OACC,EAAM4X,GAAK,KAASA,IAAM,GAAOA,GAAK,IAAQA,IAAM,EACvEpZ,KAAK+8F,KAAKv7F,IACJ81H,EAAOt3H,KAAK+8F,KAAKv7F,EAAI,GAAM,IAAO+1H,EAAOv3H,KAAK+8F,KAAKv7F,EAAI,IAAO,EACxE,CACA,IAAIyoD,KAAWitE,IAAW,EAAMA,GAAU,KACpCA,IAAW,GAAOA,GAAU,KAC5BA,IAAW,GAAOA,GAAU,KAC5BA,EAASC,GAAYD,EAASE,GAChC,IACEC,GAAWnB,EAAI10H,GAAKxB,KAAK+8F,KAAKv7F,GAAM,GAAM,GAC5C,EACA0oD,IAAS4sE,IAAW,EAAMA,GAAU,KAClCA,IAAW,GAAOA,GAAU,KAC5BA,IAAW,GAAOA,GAAU,MAC5BA,EAASC,EAAWD,EAASE,EAAWD,EAASC,GACnD,EACJK,EAASD,EACTA,EAASD,EACTA,EAASD,EACTA,EAAUD,EAAShtE,EAAM,EACzBgtE,EAASD,EACTA,EAASD,EACTA,EAASD,EACTA,EAAU7sE,EAAKC,EAAM,CACzB,CACA/0B,EAAM,IAAM2hG,EACZ3hG,EAAM,IAAM4hG,EACZ5hG,EAAM,IAAM6hG,EACZ7hG,EAAM,IAAM8hG,EACZ9hG,EAAM,IAAM+hG,EACZ/hG,EAAM,IAAMgiG,EACZhiG,EAAM,IAAMiiG,EACZjiG,EAAM,IAAMkiG,CAChB,EACOhB,CACX,CAlH8B,GCA1B,EAA6B,oBAAXn4H,QAA0BA,OAAOS,KACjD,SAAU0Z,GAAS,OAAOna,OAAOS,KAAK0Z,EAAO,OAAS,ECLnCA,IAAU,IAAIm/G,aAAcltG,OAAOjS,GDOrD,SAASo/G,EAAgBt8G,GAE5B,OAAIA,aAAgBtB,WACTsB,EACS,iBAATA,EACA,EAASA,GAEhBf,YAAYC,OAAOc,GACZ,IAAItB,WAAWsB,EAAKld,OAAQkd,EAAKV,WAAYU,EAAK/V,WAAayU,WAAW69G,mBAE9E,IAAI79G,WAAWsB,EAC1B,CEdA,IAAI0uD,EAAwB,WACxB,SAASA,EAAOu0B,GACZp+F,KAAKo+F,OAASA,EACdp+F,KAAKivB,KAAO,IAAIonG,EAChBr2H,KAAKi6B,OACT,CA0DA,OAzDA4vC,EAAOnsE,UAAU29B,OAAS,SAAUvM,GCRjC,IAAqB3T,EDSpB,ICRgB,iBADIA,EDSJ2T,GCPO,IAAhB3T,EAAKzc,OAEW,IAApByc,EAAK/V,cDKmBpF,KAAKyf,MAGhC,IACIzf,KAAKivB,KAAKoM,OAAOo8F,EAAgB3oG,GACrC,CACA,MAAOvuB,GACHP,KAAKyf,MAAQlf,CACjB,CACJ,EAIAspE,EAAOnsE,UAAUi6H,WAAa,WAC1B,GAAI33H,KAAKyf,MACL,MAAMzf,KAAKyf,MAEf,OAAIzf,KAAK+5F,OACA/5F,KAAK+5F,MAAMl2C,UACZ7jD,KAAK+5F,MAAM1+D,OAAOr7B,KAAKivB,KAAKwN,UAEzBz8B,KAAK+5F,MAAMt9D,UAEfz8B,KAAKivB,KAAKwN,QACrB,EAMAotC,EAAOnsE,UAAU++B,OAAS,WACtB,OLwEkBuyC,EKxEDhvE,KLwEU43H,OKxEJ,ELwEmB3f,EKxEH,WACnC,OLiFL,SAAqBjpC,EAAS/f,GACnC,IAAsGrqB,EAAGn3B,EAAG5H,EAAG4N,EAA3GvD,EAAI,CAAEusE,MAAO,EAAGo7C,KAAM,WAAa,GAAW,EAAPhyH,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGiyH,KAAM,GAAIC,IAAK,IAChG,OAAOtkH,EAAI,CAAEgF,KAAMu/G,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAXx+G,SAA0B/F,EAAE+F,OAAO64B,UAAY,WAAa,OAAOryC,IAAM,GAAIyT,EACvJ,SAASukH,EAAKxoH,GAAK,OAAO,SAAUs8B,GAAK,OACzC,SAAcmsF,GACV,GAAIrzF,EAAG,MAAM,IAAI7lC,UAAU,mCAC3B,KAAO0U,IAAMA,EAAI,EAAGwkH,EAAG,KAAO/nH,EAAI,IAAKA,OACnC,GAAI00B,EAAI,EAAGn3B,IAAM5H,EAAY,EAARoyH,EAAG,GAASxqH,EAAU,OAAIwqH,EAAG,GAAKxqH,EAAS,SAAO5H,EAAI4H,EAAU,SAAM5H,EAAEyR,KAAK7J,GAAI,GAAKA,EAAEgL,SAAW5S,EAAIA,EAAEyR,KAAK7J,EAAGwqH,EAAG,KAAKn6F,KAAM,OAAOj4B,EAE3J,OADI4H,EAAI,EAAG5H,IAAGoyH,EAAK,CAAS,EAARA,EAAG,GAAQpyH,EAAEjI,QACzBq6H,EAAG,IACP,KAAK,EAAG,KAAK,EAAGpyH,EAAIoyH,EAAI,MACxB,KAAK,EAAc,OAAX/nH,EAAEusE,QAAgB,CAAE7+E,MAAOq6H,EAAG,GAAIn6F,MAAM,GAChD,KAAK,EAAG5tB,EAAEusE,QAAShvE,EAAIwqH,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK/nH,EAAE6nH,IAAIphG,MAAOzmB,EAAE4nH,KAAKnhG,MAAO,SACxC,QACI,MAAkB9wB,GAAZA,EAAIqK,EAAE4nH,MAAYp5H,OAAS,GAAKmH,EAAEA,EAAEnH,OAAS,KAAkB,IAAVu5H,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE/nH,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV+nH,EAAG,MAAcpyH,GAAMoyH,EAAG,GAAKpyH,EAAE,IAAMoyH,EAAG,GAAKpyH,EAAE,IAAM,CAAEqK,EAAEusE,MAAQw7C,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY/nH,EAAEusE,MAAQ52E,EAAE,GAAI,CAAEqK,EAAEusE,MAAQ52E,EAAE,GAAIA,EAAIoyH,EAAI,KAAO,CACpE,GAAIpyH,GAAKqK,EAAEusE,MAAQ52E,EAAE,GAAI,CAAEqK,EAAEusE,MAAQ52E,EAAE,GAAIqK,EAAE6nH,IAAI/5G,KAAKi6G,GAAK,KAAO,CAC9DpyH,EAAE,IAAIqK,EAAE6nH,IAAIphG,MAChBzmB,EAAE4nH,KAAKnhG,MAAO,SAEtBshG,EAAKhpE,EAAK33C,KAAK03D,EAAS9+D,EAC5B,CAAE,MAAO3P,GAAK03H,EAAK,CAAC,EAAG13H,GAAIkN,EAAI,CAAG,CAAE,QAAUm3B,EAAI/+B,EAAI,CAAG,CACzD,GAAY,EAARoyH,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEr6H,MAAOq6H,EAAG,GAAKA,EAAG,QAAK,EAAQn6F,MAAM,EAC9E,CAtBgDwQ,CAAK,CAAC9+B,EAAGs8B,GAAK,CAAG,CAuBnE,CK3GmBosF,CAAYl4H,MAAM,SAAUyiD,GAC/B,MAAO,CAAC,EAAcziD,KAAK23H,aAC/B,GACJ,ELsEC,KAFsCQ,OKxER,KL0EnBA,EAAInlG,WAAU,SAAUC,EAASC,GAC/C,SAASklG,EAAUx6H,GAAS,IAAM0wC,EAAK2pE,EAAUx/F,KAAK7a,GAAS,CAAE,MAAO2C,GAAK2yB,EAAO3yB,EAAI,CAAE,CAC1F,SAAS83H,EAASz6H,GAAS,IAAM0wC,EAAK2pE,EAAiB,MAAEr6G,GAAS,CAAE,MAAO2C,GAAK2yB,EAAO3yB,EAAI,CAAE,CAC7F,SAAS+tC,EAAK2G,GAJlB,IAAer3C,EAIaq3C,EAAOnX,KAAO7K,EAAQgiB,EAAOr3C,QAJ1CA,EAIyDq3C,EAAOr3C,MAJhDA,aAAiBu6H,EAAIv6H,EAAQ,IAAIu6H,GAAE,SAAUllG,GAAWA,EAAQr1B,EAAQ,KAIjBusC,KAAKiuF,EAAWC,EAAW,CAC7G/pF,GAAM2pE,EAAYA,EAAUh5F,MAAM+vD,EAAS4oD,GAAc,KAAKn/G,OAClE,IAPK,IAAmBu2D,EAAS4oD,EAAYO,EAAGlgB,CKnE9C,EACApuC,EAAOnsE,UAAUu8B,MAAQ,WAErB,GADAj6B,KAAKivB,KAAO,IAAIonG,EACZr2H,KAAKo+F,OAAQ,CACbp+F,KAAK+5F,MAAQ,IAAIs8B,EACjB,IAAIv8B,EAkBhB,SAA0BsE,GACtB,IAAI/lF,EAAQo/G,EAAgBr5B,GAC5B,GAAI/lF,EAAMjT,WAAa6wH,EAAY,CAC/B,IAAIqC,EAAa,IAAIjC,EACrBiC,EAAWj9F,OAAOhjB,GAClBA,EAAQigH,EAAW77F,QACvB,CACA,IAAIx+B,EAAS,IAAI4b,WAAWo8G,GAE5B,OADAh4H,EAAOiiB,IAAI7H,GACJpa,CACX,CA5BwBs6H,CAAiBv4H,KAAKo+F,QAC9BrE,EAAQ,IAAIlgF,WAAWo8G,GAC3Bl8B,EAAM75E,IAAI45E,GACV,IAAK,IAAIt4F,EAAI,EAAGA,EAAIy0H,EAAYz0H,IAC5Bs4F,EAAMt4F,IAAM,GACZu4F,EAAMv4F,IAAM,GAKhB,IAHAxB,KAAKivB,KAAKoM,OAAOy+D,GACjB95F,KAAK+5F,MAAM1+D,OAAO0+D,GAETv4F,EAAI,EAAGA,EAAIs4F,EAAM10F,WAAY5D,IAClCs4F,EAAMt4F,GAAK,CAEnB,CACJ,EACOqoE,CACX,CAhE2B,GEF3B,MAAMhoB,EAASjkD,IACb,MAAMw7B,EAASx7B,EACTqxB,EAAO,IAAAupG,EAAA,WACbvpG,EAAKoM,OAAOjC,GACZ,MAAMq/F,EAAiBxpG,EAAK0oG,aAC5B,OAAOz5H,OAAOS,KAAK85H,GAAgBv2H,SAAS,MAAM,EAGpD,EAAAs2H,EAAA,UAAsB,SAAAE,IAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,EAAA,cAAAC,IAAA,UAAAD,EAAA,KAAAE,EAAAH,IAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,EAAAG,oCAAA,QAAAH,CAAA,UAAAI,IAAA,IAAAC,EAAAN,IAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,IAAA,IAAAzD,EAAAmD,IAAAO,EAAAJ,IAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,IAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,EAAA,gCAAAC,EAAA,YAAAd,EAAAe,GAAA,IAAAH,EAAAF,IAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,oBAAA1vD,EAAA,oBAAAhoB,EAAA,CAAA23E,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,OAAA,EAAAz7H,CAAA,UAAA67H,EAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,IAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,EAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,EAAAz7H,EAAA,WAAA87H,EAAAH,EAAA,YAAAG,EAAAH,GAAA,IAAAH,EAAAF,WAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,IAAAH,EAAA,UAAAe,EAAArxG,GAAA,IAAA8wG,EAAAF,IAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,EAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,GAAAsB,EAAA,oBAAAtB,GAAAsB,EAAA,aAAAL,GAAAK,EAAA,UAAAL,GAAAK,EAAA,YAAAJ,GAAAI,EAAA,sBAAAJ,GAAAI,EAAA,WAAAH,EAAA,QAAAI,SAAPl4E,EAAM,SAAAm4E,EAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAANmiC,EAAM3qC,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,GAAA,aAAAA,IAAA18H,OAAA48H,aAANp4E,KAAMm4E,EAAA,UAAAxB,GAAAwB,EAAA,oBAAAxB,GAAAwB,EAAA,aAAAP,GAAAO,EAAA,UAAAP,GAAAO,EAAA,YAAAN,GAAAM,EAAA,sBAAAN,GAAAM,EAAA,WAAAL,GAAAK,EAAA,gBAAAV,8uCCsCrB,IACEY,EAAY,6CACZC,EAAW74H,KAAKiB,KAChB63H,EAAY94H,KAAKylB,MAEjBszG,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjC1tC,EAAO,KACP4tC,EAAW,GACXC,EAAmB,iBAEnBC,EAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAC7EC,EAAY,IAKZ/wC,EAAM,IAwoFR,SAASgxC,EAASnrH,GAChB,IAAIhO,EAAQ,EAAJgO,EACR,OAAOA,EAAI,GAAKA,IAAMhO,EAAIA,EAAIA,EAAI,CACpC,CAIA,SAASo5H,EAAc52H,GAMrB,IALA,IAAIyK,EAAGqK,EACLtX,EAAI,EACJgB,EAAIwB,EAAEtF,OACNqC,EAAIiD,EAAE,GAAK,GAENxC,EAAIgB,GAAI,CAGb,IAFAiM,EAAIzK,EAAExC,KAAO,GACbsX,EAAIyhH,EAAW9rH,EAAE/P,OACVoa,IAAKrK,EAAI,IAAMA,GACtB1N,GAAK0N,CACP,CAGA,IAAKjM,EAAIzB,EAAErC,OAA8B,KAAtBqC,EAAEH,aAAa4B,KAElC,OAAOzB,EAAEmZ,MAAM,EAAG1X,EAAI,GAAK,EAC7B,CAIA,SAASsd,EAAQtS,EAAGC,GAClB,IAAIzJ,EAAGC,EACLyoF,EAAKl/E,EAAE7M,EACPk6H,EAAKptH,EAAE9M,EACPa,EAAIgM,EAAEiB,EACNjM,EAAIiL,EAAEgB,EACNrK,EAAIoJ,EAAEjN,EACNwN,EAAIN,EAAElN,EAGR,IAAKiB,IAAMgB,EAAG,OAAO,KAMrB,GAJAwB,EAAI0oF,IAAOA,EAAG,GACdzoF,EAAI42H,IAAOA,EAAG,GAGV72H,GAAKC,EAAG,OAAOD,EAAIC,EAAI,GAAKzB,EAAIhB,EAGpC,GAAIA,GAAKgB,EAAG,OAAOhB,EAMnB,GAJAwC,EAAIxC,EAAI,EACRyC,EAAIG,GAAK2J,GAGJ2+E,IAAOmuC,EAAI,OAAO52H,EAAI,GAAKyoF,EAAK1oF,EAAI,GAAK,EAG9C,IAAKC,EAAG,OAAOG,EAAI2J,EAAI/J,EAAI,GAAK,EAKhC,IAHAxB,GAAK4B,EAAIsoF,EAAGhuF,SAAWqP,EAAI8sH,EAAGn8H,QAAU0F,EAAI2J,EAGvCvM,EAAI,EAAGA,EAAIgB,EAAGhB,IAAK,GAAIkrF,EAAGlrF,IAAMq5H,EAAGr5H,GAAI,OAAOkrF,EAAGlrF,GAAKq5H,EAAGr5H,GAAKwC,EAAI,GAAK,EAG5E,OAAOI,GAAK2J,EAAI,EAAI3J,EAAI2J,EAAI/J,EAAI,GAAK,CACvC,CAMA,SAAS82H,EAAStrH,EAAGjO,EAAKK,EAAKsV,GAC7B,GAAI1H,EAAIjO,GAAOiO,EAAI5N,GAAO4N,IAAM4qH,EAAU5qH,GACxC,MAAM/P,MACJ46H,GAAkBnjH,GAAQ,aAA2B,iBAAL1H,EAC7CA,EAAIjO,GAAOiO,EAAI5N,EAAM,kBAAoB,oBACzC,6BAA+Bmb,OAAOvN,GAE/C,CAIA,SAASsE,EAAMtE,GACb,IAAIpL,EAAIoL,EAAE7O,EAAEjC,OAAS,EACrB,OAAOi8H,EAASnrH,EAAEjP,EAAIg6H,IAAan2H,GAAKoL,EAAE7O,EAAEyD,GAAK,GAAK,CACxD,CAGA,SAAS22H,EAAc95H,EAAKV,GAC1B,OAAQU,EAAIvC,OAAS,EAAIuC,EAAI+nB,OAAO,GAAK,IAAM/nB,EAAIiZ,MAAM,GAAKjZ,IAC5DV,EAAI,EAAI,IAAM,MAAQA,CAC1B,CAGA,SAASy6H,EAAa/5H,EAAKV,EAAGuY,GAC5B,IAAIzX,EAAK42F,EAGT,GAAI13F,EAAI,EAAG,CAGT,IAAK03F,EAAKn/E,EAAI,MAAOvY,EAAG03F,GAAMn/E,GAC9B7X,EAAMg3F,EAAKh3F,CAGb,MAIE,KAAMV,GAHNc,EAAMJ,EAAIvC,QAGK,CACb,IAAKu5F,EAAKn/E,EAAGvY,GAAKc,IAAOd,EAAG03F,GAAMn/E,GAClC7X,GAAOg3F,CACT,MAAW13F,EAAIc,IACbJ,EAAMA,EAAIiZ,MAAM,EAAG3Z,GAAK,IAAMU,EAAIiZ,MAAM3Z,IAI5C,OAAOU,CACT,CAMO,IAAIg6H,EA9vFX,SAAS33H,EAAM43H,GACb,IAAIxoH,EAAKyoH,EAAaC,EA4kBhBC,EAMAC,EAwqBAC,EACFC,EACAC,EACAC,EACAC,EA7vCFxD,EAAI8C,EAAUv9H,UAAY,CAAEC,YAAas9H,EAAW/4H,SAAU,KAAM2Y,QAAS,MAC7Ei5D,EAAM,IAAImnD,EAAU,GAUpBW,EAAiB,GAajBC,EAAgB,EAMhBC,GAAc,EAIdC,EAAa,GAMbC,GAAW,IAKXC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACPp9D,OAAQ,GACRx6D,UAAW,EACX63H,mBAAoB,EACpBC,eAAgB,IAChBC,iBAAkB,IAClBC,kBAAmB,EACnBC,uBAAwB,IACxBC,OAAQ,IAMVnwC,EAAW,uCACXowC,GAAiC,EAgBnC,SAAS3B,EAAUnvF,EAAG7nC,GACpB,IAAIujB,EAAU7mB,EAAGk8H,EAAat8H,EAAGiB,EAAGs7H,EAAOz7H,EAAKJ,EAC9CuM,EAAIxN,KAGN,KAAMwN,aAAaytH,GAAY,OAAO,IAAIA,EAAUnvF,EAAG7nC,GAEvD,GAAS,MAALA,EAAW,CAEb,GAAI6nC,IAAwB,IAAnBA,EAAEixF,aAYT,OAXAvvH,EAAEiB,EAAIq9B,EAAEr9B,QAEHq9B,EAAEnrC,GAAKmrC,EAAEvrC,EAAI07H,EAChBzuH,EAAE7M,EAAI6M,EAAEjN,EAAI,KACHurC,EAAEvrC,EAAIy7H,EACfxuH,EAAE7M,EAAI,CAAC6M,EAAEjN,EAAI,IAEbiN,EAAEjN,EAAIurC,EAAEvrC,EACRiN,EAAE7M,EAAImrC,EAAEnrC,EAAEuZ,UAMd,IAAK4iH,EAAoB,iBAALhxF,IAAsB,EAAJA,GAAS,EAAG,CAMhD,GAHAt+B,EAAEiB,EAAI,EAAIq9B,EAAI,GAAKA,GAAKA,GAAI,GAAK,EAG7BA,MAAQA,EAAG,CACb,IAAKvrC,EAAI,EAAGiB,EAAIsqC,EAAGtqC,GAAK,GAAIA,GAAK,GAAIjB,KASrC,YAPIA,EAAI07H,EACNzuH,EAAE7M,EAAI6M,EAAEjN,EAAI,MAEZiN,EAAEjN,EAAIA,EACNiN,EAAE7M,EAAI,CAACmrC,IAIX,CAEA7qC,EAAM8b,OAAO+uB,EACf,KAAO,CAEL,IAAKouF,EAAUtxG,KAAK3nB,EAAM8b,OAAO+uB,IAAK,OAAOsvF,EAAa5tH,EAAGvM,EAAK67H,GAElEtvH,EAAEiB,EAAyB,IAArBxN,EAAIL,WAAW,IAAYK,EAAMA,EAAIiZ,MAAM,IAAK,GAAK,CAC7D,EAGK3Z,EAAIU,EAAIwb,QAAQ,OAAS,IAAGxb,EAAMA,EAAIkB,QAAQ,IAAK,MAGnDX,EAAIP,EAAImjC,OAAO,OAAS,GAGvB7jC,EAAI,IAAGA,EAAIiB,GACfjB,IAAMU,EAAIiZ,MAAM1Y,EAAI,GACpBP,EAAMA,EAAIioB,UAAU,EAAG1nB,IACdjB,EAAI,IAGbA,EAAIU,EAAIvC,OAGZ,KAAO,CAOL,GAJAo8H,EAAS72H,EAAG,EAAGuoF,EAAS9tF,OAAQ,QAIvB,IAALuF,GAAW24H,EAEb,OAAO9sH,EADPtC,EAAI,IAAIytH,EAAUnvF,GACF8vF,EAAiBpuH,EAAEjN,EAAI,EAAGs7H,GAK5C,GAFA56H,EAAM8b,OAAO+uB,GAETgxF,EAAoB,iBAALhxF,EAAe,CAGhC,GAAQ,EAAJA,GAAS,EAAG,OAAOsvF,EAAa5tH,EAAGvM,EAAK67H,EAAO74H,GAKnD,GAHAuJ,EAAEiB,EAAI,EAAIq9B,EAAI,GAAK7qC,EAAMA,EAAIiZ,MAAM,IAAK,GAAK,EAGzC+gH,EAAU+B,OAAS/7H,EAAIkB,QAAQ,YAAa,IAAIzD,OAAS,GAC3D,MAAMe,MACJ66H,EAAgBxuF,EAEtB,MACEt+B,EAAEiB,EAA0B,KAAtBxN,EAAIL,WAAW,IAAaK,EAAMA,EAAIiZ,MAAM,IAAK,GAAK,EAQ9D,IALAsN,EAAWglE,EAAStyE,MAAM,EAAGjW,GAC7B1D,EAAIiB,EAAI,EAIHH,EAAMJ,EAAIvC,OAAQ8C,EAAIH,EAAKG,IAC9B,GAAIgmB,EAAS/K,QAAQ9b,EAAIM,EAAI+nB,OAAOxnB,IAAM,EAAG,CAC3C,GAAS,KAALb,GAGF,GAAIa,EAAIjB,EAAG,CACTA,EAAIc,EACJ,QACF,OACK,IAAKw7H,IAGN57H,GAAOA,EAAIgoB,gBAAkBhoB,EAAMA,EAAI4a,gBACvC5a,GAAOA,EAAI4a,gBAAkB5a,EAAMA,EAAIgoB,gBAAgB,CACzD4zG,GAAc,EACdr7H,GAAK,EACLjB,EAAI,EACJ,QACF,CAGF,OAAO66H,EAAa5tH,EAAGuP,OAAO+uB,GAAIgxF,EAAO74H,EAC3C,CAIF64H,GAAQ,GAIHv8H,GAHLU,EAAMk6H,EAAYl6H,EAAKgD,EAAG,GAAIuJ,EAAEiB,IAGnBgO,QAAQ,OAAS,EAAGxb,EAAMA,EAAIkB,QAAQ,IAAK,IACnD5B,EAAIU,EAAIvC,MACf,CAGA,IAAK8C,EAAI,EAAyB,KAAtBP,EAAIL,WAAWY,GAAWA,KAGtC,IAAKH,EAAMJ,EAAIvC,OAAkC,KAA1BuC,EAAIL,aAAaS,KAExC,GAAIJ,EAAMA,EAAIiZ,MAAM1Y,IAAKH,GAAM,CAI7B,GAHAA,GAAOG,EAGHs7H,GAAS7B,EAAU+B,OACrB37H,EAAM,KAAOyqC,EAAI0uF,GAAoB1uF,IAAMsuF,EAAUtuF,IACnD,MAAMrsC,MACJ66H,EAAiB9sH,EAAEiB,EAAIq9B,GAI7B,IAAKvrC,EAAIA,EAAIiB,EAAI,GAAKy6H,EAGpBzuH,EAAE7M,EAAI6M,EAAEjN,EAAI,UAGP,GAAIA,EAAIy7H,EAGbxuH,EAAE7M,EAAI,CAAC6M,EAAEjN,EAAI,OACR,CAWL,GAVAiN,EAAEjN,EAAIA,EACNiN,EAAE7M,EAAI,GAMNa,GAAKjB,EAAI,GAAKg6H,EACVh6H,EAAI,IAAGiB,GAAK+4H,GAEZ/4H,EAAIH,EAAK,CAGX,IAFIG,GAAGgM,EAAE7M,EAAEqd,MAAM/c,EAAIiZ,MAAM,EAAG1Y,IAEzBH,GAAOk5H,EAAU/4H,EAAIH,GACxBmM,EAAE7M,EAAEqd,MAAM/c,EAAIiZ,MAAM1Y,EAAGA,GAAK+4H,IAG9B/4H,EAAI+4H,GAAYt5H,EAAMA,EAAIiZ,MAAM1Y,IAAI9C,MACtC,MACE8C,GAAKH,EAGP,KAAOG,IAAKP,GAAO,KACnBuM,EAAE7M,EAAEqd,MAAM/c,EACZ,CACF,MAGEuM,EAAE7M,EAAI,CAAC6M,EAAEjN,EAAI,EAEjB,CA21BA,SAASokC,EAAOn1B,EAAGhO,EAAGy7H,EAAIzzG,GACxB,IAAI0zG,EAAI38H,EAAG48H,EAAI97H,EAAKJ,EAKpB,GAHU,MAANg8H,EAAYA,EAAKpB,EAChBf,EAASmC,EAAI,EAAG,IAEhBztH,EAAE7O,EAAG,OAAO6O,EAAEtN,WAKnB,GAHAg7H,EAAK1tH,EAAE7O,EAAE,GACTw8H,EAAK3tH,EAAEjP,EAEE,MAALiB,EACFP,EAAM25H,EAAcprH,EAAE7O,GACtBM,EAAY,GAANuoB,GAAiB,GAANA,IAAY2zG,GAAMrB,GAAcqB,GAAMpB,GACpDhB,EAAc95H,EAAKk8H,GACnBnC,EAAa/5H,EAAKk8H,EAAI,UAezB,GAVA58H,GAHAiP,EAAIM,EAAM,IAAImrH,EAAUzrH,GAAIhO,EAAGy7H,IAGzB18H,EAGNc,GADAJ,EAAM25H,EAAcprH,EAAE7O,IACZjC,OAOA,GAAN8qB,GAAiB,GAANA,IAAYhoB,GAAKjB,GAAKA,GAAKu7H,GAAa,CAGrD,KAAOz6H,EAAMG,EAAGP,GAAO,IAAKI,KAC5BJ,EAAM85H,EAAc95H,EAAKV,EAG3B,MAKE,GAJAiB,GAAK27H,EACLl8H,EAAM+5H,EAAa/5H,EAAKV,EAAG,KAGvBA,EAAI,EAAIc,GACV,KAAMG,EAAI,EAAG,IAAKP,GAAO,IAAKO,IAAKP,GAAO,WAG1C,IADAO,GAAKjB,EAAIc,GACD,EAEN,IADId,EAAI,GAAKc,IAAKJ,GAAO,KAClBO,IAAKP,GAAO,KAM3B,OAAOuO,EAAEf,EAAI,GAAKyuH,EAAK,IAAMj8H,EAAMA,CACrC,CAIA,SAASm8H,EAAS9qG,EAAMyZ,GAKtB,IAJA,IAAIv8B,EACFhO,EAAI,EACJiO,EAAI,IAAIwrH,EAAU3oG,EAAK,IAElB9wB,EAAI8wB,EAAK5zB,OAAQ8C,IAAK,CAI3B,KAHAgO,EAAI,IAAIyrH,EAAU3oG,EAAK9wB,KAGhBiN,EAAG,CACRgB,EAAID,EACJ,KACF,CAAWu8B,EAAOz0B,KAAK7H,EAAGD,KACxBC,EAAID,EAER,CAEA,OAAOC,CACT,CAOA,SAAS4tH,EAAU7tH,EAAG7O,EAAGJ,GAKvB,IAJA,IAAIiB,EAAI,EACNgB,EAAI7B,EAAEjC,QAGAiC,IAAI6B,GAAI7B,EAAEg2B,OAGlB,IAAKn0B,EAAI7B,EAAE,GAAI6B,GAAK,GAAIA,GAAK,GAAIhB,KAkBjC,OAfKjB,EAAIiB,EAAIjB,EAAIg6H,EAAW,GAAK0B,EAG/BzsH,EAAE7O,EAAI6O,EAAEjP,EAAI,KAGHA,EAAIy7H,EAGbxsH,EAAE7O,EAAI,CAAC6O,EAAEjP,EAAI,IAEbiP,EAAEjP,EAAIA,EACNiP,EAAE7O,EAAIA,GAGD6O,CACT,CAyDA,SAASM,EAAMtC,EAAG8vH,EAAIL,EAAIl8H,GACxB,IAAI2vB,EAAGlvB,EAAGgB,EAAG4B,EAAGoL,EAAG+tH,EAAIC,EACrB9wC,EAAKl/E,EAAE7M,EACP88H,EAAShD,EAGX,GAAI/tC,EAAI,CAQN3oF,EAAK,CAGH,IAAK2sB,EAAI,EAAGtsB,EAAIsoF,EAAG,GAAItoF,GAAK,GAAIA,GAAK,GAAIssB,KAIzC,IAHAlvB,EAAI87H,EAAK5sG,GAGD,EACNlvB,GAAK+4H,EACL/3H,EAAI86H,EAIJE,GAHAhuH,EAAIk9E,EAAG6wC,EAAK,IAGHE,EAAO/sG,EAAIluB,EAAI,GAAK,GAAK,OAIlC,IAFA+6H,EAAKpD,GAAU34H,EAAI,GAAK+4H,KAEd7tC,EAAGhuF,OAAQ,CAEnB,IAAIqC,EASF,MAAMgD,EANN,KAAO2oF,EAAGhuF,QAAU6+H,EAAI7wC,EAAG1uE,KAAK,IAChCxO,EAAIguH,EAAK,EACT9sG,EAAI,EAEJluB,GADAhB,GAAK+4H,GACGA,EAAW,CAIvB,KAAO,CAIL,IAHA/qH,EAAIpL,EAAIsoF,EAAG6wC,GAGN7sG,EAAI,EAAGtsB,GAAK,GAAIA,GAAK,GAAIssB,KAU9B8sG,GAHAh7H,GAJAhB,GAAK+4H,GAIGA,EAAW7pG,GAGV,EAAI,EAAIlhB,EAAIiuH,EAAO/sG,EAAIluB,EAAI,GAAK,GAAK,CAChD,CAkBF,GAfAzB,EAAIA,GAAKu8H,EAAK,GAKC,MAAd5wC,EAAG6wC,EAAK,KAAe/6H,EAAI,EAAIgN,EAAIA,EAAIiuH,EAAO/sG,EAAIluB,EAAI,IAEvDzB,EAAIk8H,EAAK,GACLO,GAAMz8H,KAAa,GAANk8H,GAAWA,IAAOzvH,EAAEiB,EAAI,EAAI,EAAI,IAC9C+uH,EAAK,GAAW,GAANA,IAAkB,GAANP,GAAWl8H,GAAW,GAANk8H,IAGrCz7H,EAAI,EAAIgB,EAAI,EAAIgN,EAAIiuH,EAAO/sG,EAAIluB,GAAK,EAAIkqF,EAAG6wC,EAAK,IAAM,GAAM,GAC7DN,IAAOzvH,EAAEiB,EAAI,EAAI,EAAI,IAEpB6uH,EAAK,IAAM5wC,EAAG,GAiBhB,OAhBAA,EAAGhuF,OAAS,EAERqC,GAGFu8H,GAAM9vH,EAAEjN,EAAI,EAGZmsF,EAAG,GAAK+wC,GAAQlD,EAAW+C,EAAK/C,GAAYA,GAC5C/sH,EAAEjN,GAAK+8H,GAAM,GAIb5wC,EAAG,GAAKl/E,EAAEjN,EAAI,EAGTiN,EAkBT,GAdS,GAALhM,GACFkrF,EAAGhuF,OAAS6+H,EACZn5H,EAAI,EACJm5H,MAEA7wC,EAAGhuF,OAAS6+H,EAAK,EACjBn5H,EAAIq5H,EAAOlD,EAAW/4H,GAItBkrF,EAAG6wC,GAAM/6H,EAAI,EAAI43H,EAAU5qH,EAAIiuH,EAAO/sG,EAAIluB,GAAKi7H,EAAOj7H,IAAM4B,EAAI,GAI9DrD,EAEF,OAAU,CAGR,GAAU,GAANw8H,EAAS,CAGX,IAAK/7H,EAAI,EAAGgB,EAAIkqF,EAAG,GAAIlqF,GAAK,GAAIA,GAAK,GAAIhB,KAEzC,IADAgB,EAAIkqF,EAAG,IAAMtoF,EACRA,EAAI,EAAG5B,GAAK,GAAIA,GAAK,GAAI4B,KAG1B5C,GAAK4C,IACPoJ,EAAEjN,IACEmsF,EAAG,IAAMC,IAAMD,EAAG,GAAK,IAG7B,KACF,CAEE,GADAA,EAAG6wC,IAAOn5H,EACNsoF,EAAG6wC,IAAO5wC,EAAM,MACpBD,EAAG6wC,KAAQ,EACXn5H,EAAI,CAER,CAIF,IAAK5C,EAAIkrF,EAAGhuF,OAAoB,IAAZguF,IAAKlrF,GAAUkrF,EAAG/1D,OACxC,CAGInpB,EAAEjN,EAAI07H,EACRzuH,EAAE7M,EAAI6M,EAAEjN,EAAI,KAGHiN,EAAEjN,EAAIy7H,IACfxuH,EAAE7M,EAAI,CAAC6M,EAAEjN,EAAI,GAEjB,CAEA,OAAOiN,CACT,CAGA,SAASqN,EAAQrL,GACf,IAAIvO,EACFV,EAAIiP,EAAEjP,EAER,OAAU,OAANA,EAAmBiP,EAAEtN,YAEzBjB,EAAM25H,EAAcprH,EAAE7O,GAEtBM,EAAMV,GAAKu7H,GAAcv7H,GAAKw7H,EAC1BhB,EAAc95H,EAAKV,GACnBy6H,EAAa/5H,EAAKV,EAAG,KAElBiP,EAAEf,EAAI,EAAI,IAAMxN,EAAMA,EAC/B,CA8pCA,OAt0EAg6H,EAAU33H,MAAQA,EAElB23H,EAAUyC,SAAW,EACrBzC,EAAU0C,WAAa,EACvB1C,EAAU2C,WAAa,EACvB3C,EAAU4C,YAAc,EACxB5C,EAAU6C,cAAgB,EAC1B7C,EAAU8C,gBAAkB,EAC5B9C,EAAU+C,gBAAkB,EAC5B/C,EAAUgD,gBAAkB,EAC5BhD,EAAUiD,iBAAmB,EAC7BjD,EAAUkD,OAAS,EAqCnBlD,EAAUhqF,OAASgqF,EAAU/6G,IAAM,SAAUpF,GAC3C,IAAI/L,EAAG+8B,EAEP,GAAW,MAAPhxB,EAAa,CAEf,GAAkB,iBAAPA,EA4HT,MAAMrb,MACJ46H,EAAiB,oBAAsBv/G,GAvFzC,GAlCIA,EAAIoT,eAAenf,EAAI,oBAEzB+rH,EADAhvF,EAAIhxB,EAAI/L,GACI,EAAG46E,EAAK56E,GACpB6sH,EAAiB9vF,GAKfhxB,EAAIoT,eAAenf,EAAI,mBAEzB+rH,EADAhvF,EAAIhxB,EAAI/L,GACI,EAAG,EAAGA,GAClB8sH,EAAgB/vF,GAOdhxB,EAAIoT,eAAenf,EAAI,qBACzB+8B,EAAIhxB,EAAI/L,KACC+8B,EAAEnV,KACTmkG,EAAShvF,EAAE,IAAK69C,EAAK,EAAG56E,GACxB+rH,EAAShvF,EAAE,GAAI,EAAG69C,EAAK56E,GACvB+sH,EAAahwF,EAAE,GACfiwF,EAAajwF,EAAE,KAEfgvF,EAAShvF,GAAI69C,EAAKA,EAAK56E,GACvB+sH,IAAeC,EAAajwF,EAAI,GAAKA,EAAIA,KAOzChxB,EAAIoT,eAAenf,EAAI,SAEzB,IADA+8B,EAAIhxB,EAAI/L,KACC+8B,EAAEnV,IACTmkG,EAAShvF,EAAE,IAAK69C,GAAM,EAAG56E,GACzB+rH,EAAShvF,EAAE,GAAI,EAAG69C,EAAK56E,GACvBitH,EAAUlwF,EAAE,GACZmwF,EAAUnwF,EAAE,OACP,CAEL,GADAgvF,EAAShvF,GAAI69C,EAAKA,EAAK56E,IACnB+8B,EAGF,MAAMrsC,MACJ46H,EAAiBtrH,EAAI,oBAAsB+8B,GAH7CkwF,IAAYC,EAAUnwF,EAAI,GAAKA,EAAIA,EAKvC,CAMF,GAAIhxB,EAAIoT,eAAenf,EAAI,UAAW,CAEpC,IADA+8B,EAAIhxB,EAAI/L,QACI+8B,EAcV,MAAMrsC,MACJ46H,EAAiBtrH,EAAI,uBAAyB+8B,GAdhD,GAAIA,EAAG,CACL,GAAqB,oBAAV7U,SAAyBA,SAClCA,OAAOG,kBAAmBH,OAAOK,YAIjC,MADA4kG,GAAUpwF,EACJrsC,MACJ46H,EAAiB,sBAJnB6B,EAASpwF,CAMb,MACEowF,EAASpwF,CAMf,CAoBA,GAhBIhxB,EAAIoT,eAAenf,EAAI,iBAEzB+rH,EADAhvF,EAAIhxB,EAAI/L,GACI,EAAG,EAAGA,GAClBotH,EAAcrwF,GAKZhxB,EAAIoT,eAAenf,EAAI,mBAEzB+rH,EADAhvF,EAAIhxB,EAAI/L,GACI,EAAG46E,EAAK56E,GACpBqtH,EAAgBtwF,GAKdhxB,EAAIoT,eAAenf,EAAI,UAAW,CAEpC,GAAgB,iBADhB+8B,EAAIhxB,EAAI/L,IAEH,MAAMtP,MACT46H,EAAiBtrH,EAAI,mBAAqB+8B,GAFlBuwF,EAASvwF,CAGrC,CAIA,GAAIhxB,EAAIoT,eAAenf,EAAI,YAAa,CAKtC,GAAgB,iBAJhB+8B,EAAIhxB,EAAI/L,KAIqB,wBAAwB6Z,KAAKkjB,GAIxD,MAAMrsC,MACJ46H,EAAiBtrH,EAAI,aAAe+8B,GAJtC8wF,EAAmD,cAAlB9wF,EAAE5xB,MAAM,EAAG,IAC5CsyE,EAAW1gD,CAKf,CAQJ,CAEA,MAAO,CACL8vF,eAAgBA,EAChBC,cAAeA,EACfuC,eAAgB,CAACtC,EAAYC,GAC7BsC,MAAO,CAACrC,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACR7vC,SAAUA,EAEd,EAYAyuC,EAAUqD,YAAc,SAAUxyF,GAChC,IAAKA,IAAwB,IAAnBA,EAAEixF,aAAuB,OAAO,EAC1C,IAAK9B,EAAU+B,MAAO,OAAO,EAE7B,IAAIx7H,EAAGgO,EACL7O,EAAImrC,EAAEnrC,EACNJ,EAAIurC,EAAEvrC,EACNkO,EAAIq9B,EAAEr9B,EAER1K,EAAK,GAA2B,kBAAvB,CAAC,EAAE7B,SAASoV,KAAK3W,IAExB,IAAW,IAAN8N,IAAkB,IAAPA,IAAalO,IAAMopF,GAAOppF,GAAKopF,GAAOppF,IAAM65H,EAAU75H,GAAI,CAGxE,GAAa,IAATI,EAAE,GAAU,CACd,GAAU,IAANJ,GAAwB,IAAbI,EAAEjC,OAAc,OAAO,EACtC,MAAMqF,CACR,CAQA,IALAvC,GAAKjB,EAAI,GAAKg6H,GACN,IAAG/4H,GAAK+4H,GAIZx9G,OAAOpc,EAAE,IAAIjC,QAAU8C,EAAG,CAE5B,IAAKA,EAAI,EAAGA,EAAIb,EAAEjC,OAAQ8C,IAExB,IADAgO,EAAI7O,EAAEa,IACE,GAAKgO,GAAKm9E,GAAQn9E,IAAM4qH,EAAU5qH,GAAI,MAAMzL,EAItD,GAAU,IAANyL,EAAS,OAAO,CACtB,CACF,OAGK,GAAU,OAAN7O,GAAoB,OAANJ,IAAqB,OAANkO,GAAoB,IAANA,IAAkB,IAAPA,GAC/D,OAAO,EAGT,MAAMhP,MACH46H,EAAiB,sBAAwBvuF,EAC9C,EAQAmvF,EAAUsD,QAAUtD,EAAUr5H,IAAM,WAClC,OAAOw7H,EAAS3hH,UAAW08G,EAAErjH,GAC/B,EAQAmmH,EAAUuD,QAAUvD,EAAU15H,IAAM,WAClC,OAAO67H,EAAS3hH,UAAW08G,EAAEzjH,GAC/B,EAaAumH,EAAUpiG,QACJwiG,EAAU,iBAMVC,EAAkBh6H,KAAKu3B,SAAWwiG,EAAW,QAC9C,WAAc,OAAOjB,EAAU94H,KAAKu3B,SAAWwiG,EAAU,EACzD,WAAc,OAA2C,SAAlB,WAAhB/5H,KAAKu3B,SAAwB,IACnC,QAAhBv3B,KAAKu3B,SAAsB,EAAI,EAE5B,SAAU4lG,GACf,IAAIz6H,EAAGC,EAAG1D,EAAG6D,EAAG0nC,EACdtqC,EAAI,EACJb,EAAI,GACJsiC,EAAO,IAAIg4F,EAAUnnD,GAOvB,GALU,MAAN2qD,EAAYA,EAAK7C,EAChBd,EAAS2D,EAAI,EAAG90C,GAErBvlF,EAAI+1H,EAASsE,EAAKlE,GAEd2B,EAGF,GAAIjlG,OAAOG,gBAAiB,CAI1B,IAFApzB,EAAIizB,OAAOG,gBAAgB,IAAIC,YAAYjzB,GAAK,IAEzC5C,EAAI4C,IAQT0nC,EAAW,OAAP9nC,EAAExC,IAAgBwC,EAAExC,EAAI,KAAO,MAM1B,MACPyC,EAAIgzB,OAAOG,gBAAgB,IAAIC,YAAY,IAC3CrzB,EAAExC,GAAKyC,EAAE,GACTD,EAAExC,EAAI,GAAKyC,EAAE,KAKbtD,EAAEqd,KAAK8tB,EAAI,MACXtqC,GAAK,GAGTA,EAAI4C,EAAI,CAGV,KAAO,KAAI6yB,OAAOK,YA2BhB,MADA4kG,GAAS,EACHz8H,MACJ46H,EAAiB,sBAvBnB,IAFAr2H,EAAIizB,OAAOK,YAAYlzB,GAAK,GAErB5C,EAAI4C,IAMT0nC,EAAmB,iBAAN,GAAP9nC,EAAExC,IAA0C,cAAXwC,EAAExC,EAAI,GAC9B,WAAXwC,EAAExC,EAAI,GAAgC,SAAXwC,EAAExC,EAAI,IACjCwC,EAAExC,EAAI,IAAM,KAAOwC,EAAExC,EAAI,IAAM,GAAKwC,EAAExC,EAAI,KAErC,KACPy1B,OAAOK,YAAY,GAAGl0B,KAAKY,EAAGxC,IAI9Bb,EAAEqd,KAAK8tB,EAAI,MACXtqC,GAAK,GAGTA,EAAI4C,EAAI,CAKV,CAIF,IAAK83H,EAEH,KAAO16H,EAAI4C,IACT0nC,EAAIwvF,KACI,OAAM36H,EAAEa,KAAOsqC,EAAI,MAc/B,IAVA1nC,EAAIzD,IAAIa,GACRi9H,GAAMlE,EAGFn2H,GAAKq6H,IACP3yF,EAAI2uF,EAASF,EAAWkE,GACxB99H,EAAEa,GAAK44H,EAAUh2H,EAAI0nC,GAAKA,GAIZ,IAATnrC,EAAEa,GAAUb,EAAEg2B,MAAOn1B,KAG5B,GAAIA,EAAI,EACNb,EAAI,CAACJ,EAAI,OACJ,CAGL,IAAKA,GAAK,EAAa,IAATI,EAAE,GAAUA,EAAEq6B,OAAO,EAAG,GAAIz6B,GAAKg6H,GAG/C,IAAK/4H,EAAI,EAAGsqC,EAAInrC,EAAE,GAAImrC,GAAK,GAAIA,GAAK,GAAItqC,KAGpCA,EAAI+4H,IAAUh6H,GAAKg6H,EAAW/4H,EACpC,CAIA,OAFAyhC,EAAK1iC,EAAIA,EACT0iC,EAAKtiC,EAAIA,EACFsiC,CACT,GASFg4F,EAAUyD,IAAM,WAId,IAHA,IAAIl9H,EAAI,EACN8wB,EAAO7W,UACPijH,EAAM,IAAIzD,EAAU3oG,EAAK,IACpB9wB,EAAI8wB,EAAK5zB,QAASggI,EAAMA,EAAIC,KAAKrsG,EAAK9wB,MAC7C,OAAOk9H,CACT,EAOAvD,EAAc,WACZ,IAAIyD,EAAU,aAOd,SAASC,EAAU59H,EAAK69H,EAAQC,EAASv3G,GAOvC,IANA,IAAIhlB,EAEFw8H,EADAriH,EAAM,CAAC,GAEPnb,EAAI,EACJH,EAAMJ,EAAIvC,OAEL8C,EAAIH,GAAM,CACf,IAAK29H,EAAOriH,EAAIje,OAAQsgI,IAAQriH,EAAIqiH,IAASF,GAI7C,IAFAniH,EAAI,IAAM6K,EAAS/K,QAAQxb,EAAI+nB,OAAOxnB,MAEjCgB,EAAI,EAAGA,EAAIma,EAAIje,OAAQ8D,IAEtBma,EAAIna,GAAKu8H,EAAU,IACH,MAAdpiH,EAAIna,EAAI,KAAYma,EAAIna,EAAI,GAAK,GACrCma,EAAIna,EAAI,IAAMma,EAAIna,GAAKu8H,EAAU,EACjCpiH,EAAIna,IAAMu8H,EAGhB,CAEA,OAAOpiH,EAAI+8B,SACb,CAKA,OAAO,SAAUz4C,EAAK69H,EAAQC,EAASz3E,EAAM23E,GAC3C,IAAIz3G,EAAUkJ,EAAGnwB,EAAG6D,EAAGrD,EAAGyM,EAAGk/E,EAAIj/E,EAC/BjM,EAAIP,EAAIwb,QAAQ,KAChBgiH,EAAK7C,EACLqB,EAAKpB,EA+BP,IA5BIr6H,GAAK,IACP4C,EAAIg4H,EAGJA,EAAgB,EAChBn7H,EAAMA,EAAIkB,QAAQ,IAAK,IAEvBqL,GADAC,EAAI,IAAIwtH,EAAU6D,IACZ37H,IAAIlC,EAAIvC,OAAS8C,GACvB46H,EAAgBh4H,EAKhBqJ,EAAE9M,EAAIk+H,EAAU7D,EAAaJ,EAAcptH,EAAE7M,GAAI6M,EAAEjN,EAAG,KACrD,GAAIw+H,EAASH,GACdnxH,EAAElN,EAAIkN,EAAE9M,EAAEjC,QAUZ6B,EAAI6D,GALJsoF,EAAKmyC,EAAU59H,EAAK69H,EAAQC,EAASE,GACjCz3G,EAAWglE,EAAUoyC,IACrBp3G,EAAWo3G,EAASpyC,KAGb9tF,OAGO,GAAXguF,IAAKtoF,GAASsoF,EAAG/1D,OAGxB,IAAK+1D,EAAG,GAAI,OAAOllE,EAASwB,OAAO,GAqCnC,GAlCIxnB,EAAI,IACJjB,GAEFiN,EAAE7M,EAAI+rF,EACNl/E,EAAEjN,EAAIA,EAGNiN,EAAEiB,EAAI64C,EAENolC,GADAl/E,EAAIkF,EAAIlF,EAAGC,EAAGgxH,EAAIxB,EAAI8B,IACfp+H,EACPI,EAAIyM,EAAEzM,EACNR,EAAIiN,EAAEjN,GASRiB,EAAIkrF,EAHJh8D,EAAInwB,EAAIk+H,EAAK,GAObr6H,EAAI26H,EAAU,EACdh+H,EAAIA,GAAK2vB,EAAI,GAAkB,MAAbg8D,EAAGh8D,EAAI,GAEzB3vB,EAAIk8H,EAAK,GAAU,MAALz7H,GAAaT,KAAa,GAANk8H,GAAWA,IAAOzvH,EAAEiB,EAAI,EAAI,EAAI,IAC1DjN,EAAI4C,GAAK5C,GAAK4C,IAAW,GAAN64H,GAAWl8H,GAAW,GAANk8H,GAAuB,EAAZvwC,EAAGh8D,EAAI,IACtDusG,IAAOzvH,EAAEiB,EAAI,EAAI,EAAI,IAKxBiiB,EAAI,IAAMg8D,EAAG,GAGfzrF,EAAMF,EAAIi6H,EAAaxzG,EAASwB,OAAO,IAAKy1G,EAAIj3G,EAASwB,OAAO,IAAMxB,EAASwB,OAAO,OACjF,CAML,GAHA0jE,EAAGhuF,OAASgyB,EAGR3vB,EAGF,MAAOg+H,IAAWryC,IAAKh8D,GAAKquG,GAC1BryC,EAAGh8D,GAAK,EAEHA,MACDnwB,EACFmsF,EAAK,CAAC,GAAG3sE,OAAO2sE,IAMtB,IAAKtoF,EAAIsoF,EAAGhuF,QAASguF,IAAKtoF,KAG1B,IAAK5C,EAAI,EAAGP,EAAM,GAAIO,GAAK4C,EAAGnD,GAAOumB,EAASwB,OAAO0jE,EAAGlrF,OAGxDP,EAAM+5H,EAAa/5H,EAAKV,EAAGinB,EAASwB,OAAO,GAC7C,CAGA,OAAO/nB,CACT,CACD,CAnJa,GAuJdyR,EAAM,WAGJ,SAASwsH,EAAS1xH,EAAGpJ,EAAGvE,GACtB,IAAI4P,EAAGstF,EAAMoiC,EAAKC,EAChBj7H,EAAQ,EACR3C,EAAIgM,EAAE9O,OACN2gI,EAAMj7H,EAAIs2H,EACV4E,EAAMl7H,EAAIs2H,EAAY,EAExB,IAAKltH,EAAIA,EAAE0M,QAAS1Y,KAKlB2C,IADA44F,EAAOsiC,GAHPF,EAAM3xH,EAAEhM,GAAKk5H,IAEbjrH,EAAI6vH,EAAMH,GADVC,EAAM5xH,EAAEhM,GAAKk5H,EAAY,GACH2E,GACG3E,EAAaA,EAAav2H,GACnCtE,EAAO,IAAM4P,EAAIirH,EAAY,GAAK4E,EAAMF,EACxD5xH,EAAEhM,GAAKu7F,EAAOl9F,EAKhB,OAFIsE,IAAOqJ,EAAI,CAACrJ,GAAO4b,OAAOvS,IAEvBA,CACT,CAEA,SAASsS,EAAQ9b,EAAGC,EAAGs7H,EAAIC,GACzB,IAAIh+H,EAAGO,EAEP,GAAIw9H,GAAMC,EACRz9H,EAAMw9H,EAAKC,EAAK,GAAK,OAGrB,IAAKh+H,EAAIO,EAAM,EAAGP,EAAI+9H,EAAI/9H,IAExB,GAAIwC,EAAExC,IAAMyC,EAAEzC,GAAI,CAChBO,EAAMiC,EAAExC,GAAKyC,EAAEzC,GAAK,GAAK,EACzB,KACF,CAIJ,OAAOO,CACT,CAEA,SAAS09H,EAASz7H,EAAGC,EAAGs7H,EAAI1/H,GAI1B,IAHA,IAAI2B,EAAI,EAGD+9H,KACLv7H,EAAEu7H,IAAO/9H,EACTA,EAAIwC,EAAEu7H,GAAMt7H,EAAEs7H,GAAM,EAAI,EACxBv7H,EAAEu7H,GAAM/9H,EAAI3B,EAAOmE,EAAEu7H,GAAMt7H,EAAEs7H,GAI/B,MAAQv7H,EAAE,IAAMA,EAAEtF,OAAS,EAAGsF,EAAEg3B,OAAO,EAAG,IAC5C,CAGA,OAAO,SAAUxtB,EAAGC,EAAGgxH,EAAIxB,EAAIp9H,GAC7B,IAAIkC,EAAKxB,EAAGiB,EAAGk+H,EAAMlwH,EAAGmwH,EAAMC,EAAOp6H,EAAGq6H,EAAIx+F,EAAKy+F,EAAMC,EAAM90E,EAAI+0E,EAAIC,EACnEC,EAAIC,EACJ1xH,EAAIjB,EAAEiB,GAAKhB,EAAEgB,EAAI,GAAK,EACtBi+E,EAAKl/E,EAAE7M,EACPk6H,EAAKptH,EAAE9M,EAGT,KAAK+rF,GAAOA,EAAG,IAAOmuC,GAAOA,EAAG,IAE9B,OAAO,IAAII,EAGTztH,EAAEiB,GAAMhB,EAAEgB,IAAMi+E,GAAKmuC,GAAMnuC,EAAG,IAAMmuC,EAAG,GAAMA,GAG7CnuC,GAAe,GAATA,EAAG,KAAYmuC,EAAS,EAAJpsH,EAAQA,EAAI,EAHa8hE,KAoBvD,IAZAsvD,GADAr6H,EAAI,IAAIy1H,EAAUxsH,IACX9N,EAAI,GAEX8N,EAAIgwH,GADJl+H,EAAIiN,EAAEjN,EAAIkN,EAAElN,GACC,EAERV,IACHA,EAAO8sF,EACPpsF,EAAIo6H,EAASntH,EAAEjN,EAAIg6H,GAAYI,EAASltH,EAAElN,EAAIg6H,GAC9C9rH,EAAIA,EAAI8rH,EAAW,GAKhB/4H,EAAI,EAAGq5H,EAAGr5H,KAAOkrF,EAAGlrF,IAAM,GAAIA,KAInC,GAFIq5H,EAAGr5H,IAAMkrF,EAAGlrF,IAAM,IAAIjB,IAEtBkO,EAAI,EACNoxH,EAAG7hH,KAAK,GACR0hH,GAAO,MACF,CAwBL,IAvBAM,EAAKtzC,EAAGhuF,OACRwhI,EAAKrF,EAAGn8H,OACR8C,EAAI,EACJiN,GAAK,GAILe,EAAI4qH,EAAUv6H,GAAQg7H,EAAG,GAAK,KAItB,IACNA,EAAKqE,EAASrE,EAAIrrH,EAAG3P,GACrB6sF,EAAKwyC,EAASxyC,EAAIl9E,EAAG3P,GACrBqgI,EAAKrF,EAAGn8H,OACRshI,EAAKtzC,EAAGhuF,QAGVusD,EAAKi1E,EAELJ,GADAz+F,EAAMqrD,EAAGxyE,MAAM,EAAGgmH,IACPxhI,OAGJohI,EAAOI,EAAI7+F,EAAIy+F,KAAU,GAChCK,EAAKtF,EAAG3gH,QACRimH,EAAK,CAAC,GAAGpgH,OAAOogH,GAChBF,EAAMpF,EAAG,GACLA,EAAG,IAAMh7H,EAAO,GAAGogI,IAIvB,EAAG,CAOD,GANAzwH,EAAI,GAGJzN,EAAM+d,EAAQ+6G,EAAIx5F,EAAK6+F,EAAIJ,IAGjB,EAAG,CAqBX,GAjBAC,EAAO1+F,EAAI,GACP6+F,GAAMJ,IAAMC,EAAOA,EAAOlgI,GAAQwhC,EAAI,IAAM,KAGhD7xB,EAAI4qH,EAAU2F,EAAOE,IAab,EAcN,IAXIzwH,GAAK3P,IAAM2P,EAAI3P,EAAO,GAI1B+/H,GADAD,EAAOT,EAASrE,EAAIrrH,EAAG3P,IACVnB,OACbohI,EAAOz+F,EAAI3iC,OAM+B,GAAnCohB,EAAQ6/G,EAAMt+F,EAAKu+F,EAAOE,IAC/BtwH,IAGAiwH,EAASE,EAAMO,EAAKN,EAAQO,EAAKtF,EAAI+E,EAAO//H,GAC5C+/H,EAAQD,EAAKjhI,OACbqD,EAAM,OAQC,GAALyN,IAGFzN,EAAMyN,EAAI,GAKZowH,GADAD,EAAO9E,EAAG3gH,SACGxb,OAUf,GAPIkhI,EAAQE,IAAMH,EAAO,CAAC,GAAG5/G,OAAO4/G,IAGpCF,EAASp+F,EAAKs+F,EAAMG,EAAMjgI,GAC1BigI,EAAOz+F,EAAI3iC,QAGC,GAARqD,EAMF,KAAO+d,EAAQ+6G,EAAIx5F,EAAK6+F,EAAIJ,GAAQ,GAClCtwH,IAGAiwH,EAASp+F,EAAK6+F,EAAKJ,EAAOK,EAAKtF,EAAIiF,EAAMjgI,GACzCigI,EAAOz+F,EAAI3iC,MAGjB,MAAmB,IAARqD,IACTyN,IACA6xB,EAAM,CAAC,IAITw+F,EAAGr+H,KAAOgO,EAGN6xB,EAAI,GACNA,EAAIy+F,KAAUpzC,EAAGzhC,IAAO,GAExB5pB,EAAM,CAACqrD,EAAGzhC,IACV60E,EAAO,EAEX,QAAU70E,IAAO+0E,GAAgB,MAAV3+F,EAAI,KAAe5yB,KAE1CixH,EAAiB,MAAVr+F,EAAI,GAGNw+F,EAAG,IAAIA,EAAG7kG,OAAO,EAAG,EAC3B,CAEA,GAAIn7B,GAAQ8sF,EAAM,CAGhB,IAAKnrF,EAAI,EAAGiN,EAAIoxH,EAAG,GAAIpxH,GAAK,GAAIA,GAAK,GAAIjN,KAEzCsO,EAAMtK,EAAGi5H,GAAMj5H,EAAEjF,EAAIiB,EAAIjB,EAAIg6H,EAAW,GAAK,EAAG0C,EAAIyC,EAGtD,MACEl6H,EAAEjF,EAAIA,EACNiF,EAAEzE,GAAK2+H,EAGT,OAAOl6H,CACT,CACD,CAhQK,GAgYA+1H,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBP,EAOS,SAAU5tH,EAAGvM,EAAK67H,EAAO74H,GAC9B,IAAIpE,EACF4O,EAAIquH,EAAQ77H,EAAMA,EAAIkB,QAAQw5H,EAAkB,IAGlD,GAAID,EAAgB9yG,KAAKna,GACvBjB,EAAEiB,EAAImkB,MAAMnkB,GAAK,KAAOA,EAAI,GAAK,EAAI,MAChC,CACL,IAAKquH,IAGHruH,EAAIA,EAAEtM,QAAQo5H,GAAY,SAAU9rH,EAAG2kF,EAAIC,GAEzC,OADAx0F,EAAkC,MAA1Bw0F,EAAKA,EAAGx4E,eAAwB,GAAW,KAANw4E,EAAY,EAAI,EACrDpwF,GAAKA,GAAKpE,EAAY4P,EAAL2kF,CAC3B,IAEInwF,IACFpE,EAAOoE,EAGPwK,EAAIA,EAAEtM,QAAQq5H,EAAU,MAAMr5H,QAAQs5H,EAAW,SAG/Cx6H,GAAOwN,GAAG,OAAO,IAAIwsH,EAAUxsH,EAAG5O,GAKxC,GAAIo7H,EAAU+B,MACZ,MAAMv9H,MACH46H,EAAiB,SAAWp2H,EAAI,SAAWA,EAAI,IAAM,YAAchD,GAIxEuM,EAAEiB,EAAI,IACR,CAEAjB,EAAE7M,EAAI6M,EAAEjN,EAAI,IACd,EA4LF43H,EAAEiI,cAAgBjI,EAAE/xH,IAAM,WACxB,IAAIoH,EAAI,IAAIytH,EAAUj7H,MAEtB,OADIwN,EAAEiB,EAAI,IAAGjB,EAAEiB,EAAI,GACZjB,CACT,EAUA2qH,EAAEkI,WAAa,SAAU5yH,EAAGxJ,GAC1B,OAAO6b,EAAQ9f,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,GACxC,EAgBAk0H,EAAEmI,cAAgBnI,EAAEsG,GAAK,SAAUA,EAAIxB,GACrC,IAAIt8H,EAAG6O,EAAGs8B,EACRt+B,EAAIxN,KAEN,GAAU,MAANy+H,EAKF,OAJA3D,EAAS2D,EAAI,EAAG90C,GACN,MAANszC,EAAYA,EAAKpB,EAChBf,EAASmC,EAAI,EAAG,GAEdntH,EAAM,IAAImrH,EAAUztH,GAAIixH,EAAKjxH,EAAEjN,EAAI,EAAG08H,GAG/C,KAAMt8H,EAAI6M,EAAE7M,GAAI,OAAO,KAIvB,GAHA6O,IAAMs8B,EAAInrC,EAAEjC,OAAS,GAAKi8H,EAAS36H,KAAKO,EAAIg6H,IAAaA,EAGrDzuF,EAAInrC,EAAEmrC,GAAI,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIt8B,KAG3C,OAFIA,EAAI,IAAGA,EAAI,GAERA,CACT,EAuBA2oH,EAAEoI,UAAYpI,EAAEzlH,IAAM,SAAUjF,EAAGxJ,GACjC,OAAOyO,EAAI1S,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,GAAI23H,EAAgBC,EACxD,EAOA1D,EAAEqI,mBAAqBrI,EAAEsI,KAAO,SAAUhzH,EAAGxJ,GAC3C,OAAOyO,EAAI1S,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,GAAI,EAAG,EAC3C,EAkBAk0H,EAAEuI,gBAAkBvI,EAAEh1H,IAAM,SAAUqM,EAAGC,GACvC,IAAIwD,EAAM0tH,EAAUn/H,EAAG4C,EAASw8H,EAAQC,EAAQC,EAAQrzH,EACtDD,EAAIxN,KAKN,IAHAwP,EAAI,IAAIyrH,EAAUzrH,IAGZ7O,IAAM6O,EAAE0X,YACZ,MAAMznB,MACH46H,EAAiB,4BAA8Bx/G,EAAQrL,IAS5D,GANS,MAALC,IAAWA,EAAI,IAAIwrH,EAAUxrH,IAGjCmxH,EAASpxH,EAAEjP,EAAI,IAGViN,EAAE7M,IAAM6M,EAAE7M,EAAE,IAAgB,GAAV6M,EAAE7M,EAAE,KAAY6M,EAAEjN,GAAmB,GAAdiN,EAAE7M,EAAEjC,SAAgB8Q,EAAE7O,IAAM6O,EAAE7O,EAAE,GAK5E,OADA8M,EAAI,IAAIwtH,EAAU35H,KAAK6B,KAAK0X,EAAQrN,GAAIozH,EAASpxH,EAAEf,GAAK,EAAIqF,EAAMtE,KAAOqL,EAAQrL,KAC1EC,EAAIhC,EAAE1K,IAAI0M,GAAKhC,EAKxB,GAFAozH,EAASrxH,EAAEf,EAAI,EAEXgB,EAAG,CAGL,GAAIA,EAAE9O,GAAK8O,EAAE9O,EAAE,IAAM8O,EAAEhB,EAAG,OAAO,IAAIwsH,EAAU1qD,MAE/CowD,GAAYE,GAAUrzH,EAAE0Z,aAAezX,EAAEyX,eAE3B1Z,EAAIA,EAAEzK,IAAI0M,GAI1B,KAAO,IAAID,EAAEjP,EAAI,IAAMiN,EAAEjN,EAAI,GAAKiN,EAAEjN,GAAK,IAAa,GAAPiN,EAAEjN,EAE7CiN,EAAE7M,EAAE,GAAK,GAAKigI,GAAUpzH,EAAE7M,EAAE,IAAM,KAElC6M,EAAE7M,EAAE,GAAK,MAAQigI,GAAUpzH,EAAE7M,EAAE,IAAM,YASvC,OANAyD,EAAIoJ,EAAEiB,EAAI,GAAKqF,EAAMtE,IAAM,EAAI,EAG3BhC,EAAEjN,GAAK,IAAG6D,EAAI,EAAIA,GAGf,IAAI62H,EAAU4F,EAAS,EAAIz8H,EAAIA,GAE7Bg4H,IAKTh4H,EAAI+1H,EAASiC,EAAgB7B,EAAW,GAC1C,CAcA,IAZIqG,GACF3tH,EAAO,IAAIgoH,EAAU,IACjB4F,IAAQrxH,EAAEf,EAAI,GAClBqyH,EAAShtH,EAAMtE,IAGfsxH,GADAt/H,EAAIF,KAAK8E,KAAKyU,EAAQrL,KACT,EAGf/B,EAAI,IAAIwtH,EAAUnnD,KAGR,CAER,GAAIgtD,EAAQ,CAEV,KADArzH,EAAIA,EAAEszH,MAAMvzH,IACL7M,EAAG,MAENyD,EACEqJ,EAAE9M,EAAEjC,OAAS0F,IAAGqJ,EAAE9M,EAAEjC,OAAS0F,GACxBu8H,IACTlzH,EAAIA,EAAE1K,IAAI0M,GAEd,CAEA,GAAIjO,EAAG,CAEL,GAAU,KADVA,EAAI44H,EAAU54H,EAAI,IACL,MACbs/H,EAASt/H,EAAI,CACf,MAIE,GAFAsO,EADAN,EAAIA,EAAEuxH,MAAM9tH,GACHzD,EAAEjP,EAAI,EAAG,GAEdiP,EAAEjP,EAAI,GACRugI,EAAShtH,EAAMtE,OACV,CAEL,GAAU,IADVhO,GAAKqZ,EAAQrL,IACA,MACbsxH,EAASt/H,EAAI,CACf,CAGFgM,EAAIA,EAAEuzH,MAAMvzH,GAERpJ,EACEoJ,EAAE7M,GAAK6M,EAAE7M,EAAEjC,OAAS0F,IAAGoJ,EAAE7M,EAAEjC,OAAS0F,GAC/Bu8H,IACTnzH,EAAIA,EAAEzK,IAAI0M,GAEd,CAEA,OAAIkxH,EAAiBlzH,GACjBozH,IAAQpzH,EAAIqmE,EAAIphE,IAAIjF,IAEjBgC,EAAIhC,EAAE1K,IAAI0M,GAAKrL,EAAI0L,EAAMrC,EAAG2uH,EAAeP,OAnHxB6D,GAmH+CjyH,EAC3E,EAWA0qH,EAAE6I,aAAe,SAAU/D,GACzB,IAAIztH,EAAI,IAAIyrH,EAAUj7H,MAGtB,OAFU,MAANi9H,EAAYA,EAAKpB,EAChBf,EAASmC,EAAI,EAAG,GACdntH,EAAMN,EAAGA,EAAEjP,EAAI,EAAG08H,EAC3B,EAOA9E,EAAE8I,UAAY9I,EAAEjjH,GAAK,SAAUzH,EAAGxJ,GAChC,OAA8C,IAAvC6b,EAAQ9f,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,GACxC,EAMAk0H,EAAEp3G,SAAW,WACX,QAAS/gB,KAAKW,CAChB,EAOAw3H,EAAE+I,cAAgB/I,EAAEzjH,GAAK,SAAUjH,EAAGxJ,GACpC,OAAO6b,EAAQ9f,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,IAAM,CAC9C,EAOAk0H,EAAEgJ,uBAAyBhJ,EAAEvjH,IAAM,SAAUnH,EAAGxJ,GAC9C,OAAoD,KAA5CA,EAAI6b,EAAQ9f,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,MAAoB,IAANA,CAE3D,EAMAk0H,EAAEjxG,UAAY,WACZ,QAASlnB,KAAKW,GAAKg6H,EAAS36H,KAAKO,EAAIg6H,GAAYv6H,KAAKW,EAAEjC,OAAS,CACnE,EAOAy5H,EAAEiJ,WAAajJ,EAAErjH,GAAK,SAAUrH,EAAGxJ,GACjC,OAAO6b,EAAQ9f,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,IAAM,CAC9C,EAOAk0H,EAAEkJ,oBAAsBlJ,EAAEnjH,IAAM,SAAUvH,EAAGxJ,GAC3C,OAAqD,KAA7CA,EAAI6b,EAAQ9f,KAAM,IAAIi7H,EAAUxtH,EAAGxJ,MAAqB,IAANA,CAC5D,EAMAk0H,EAAEvlG,MAAQ,WACR,OAAQ5yB,KAAKyO,CACf,EAMA0pH,EAAEmJ,WAAa,WACb,OAAOthI,KAAKyO,EAAI,CAClB,EAMA0pH,EAAEoJ,WAAa,WACb,OAAOvhI,KAAKyO,EAAI,CAClB,EAMA0pH,EAAExzH,OAAS,WACT,QAAS3E,KAAKW,GAAkB,GAAbX,KAAKW,EAAE,EAC5B,EAuBAw3H,EAAEqJ,MAAQ,SAAU/zH,EAAGxJ,GACrB,IAAIzC,EAAGgB,EAAGqD,EAAG47H,EACXj0H,EAAIxN,KACJgE,EAAIwJ,EAAEiB,EAMR,GAHAxK,GADAwJ,EAAI,IAAIwtH,EAAUxtH,EAAGxJ,IACfwK,GAGDzK,IAAMC,EAAG,OAAO,IAAIg3H,EAAU1qD,KAGnC,GAAIvsE,GAAKC,EAEP,OADAwJ,EAAEgB,GAAKxK,EACAuJ,EAAEmxH,KAAKlxH,GAGhB,IAAIi0H,EAAKl0H,EAAEjN,EAAIg6H,EACboH,EAAKl0H,EAAElN,EAAIg6H,EACX7tC,EAAKl/E,EAAE7M,EACPk6H,EAAKptH,EAAE9M,EAET,IAAK+gI,IAAOC,EAAI,CAGd,IAAKj1C,IAAOmuC,EAAI,OAAOnuC,GAAMj/E,EAAEgB,GAAKxK,EAAGwJ,GAAK,IAAIwtH,EAAUJ,EAAKrtH,EAAI+iE,KAGnE,IAAKmc,EAAG,KAAOmuC,EAAG,GAGhB,OAAOA,EAAG,IAAMptH,EAAEgB,GAAKxK,EAAGwJ,GAAK,IAAIwtH,EAAUvuC,EAAG,GAAKl/E,EAGnC,GAAjBquH,GAAsB,EAAI,EAE/B,CAOA,GALA6F,EAAK/G,EAAS+G,GACdC,EAAKhH,EAASgH,GACdj1C,EAAKA,EAAGxyE,QAGJlW,EAAI09H,EAAKC,EAAI,CAaf,KAXIF,EAAOz9H,EAAI,IACbA,GAAKA,EACL6B,EAAI6mF,IAEJi1C,EAAKD,EACL77H,EAAIg1H,GAGNh1H,EAAE6zC,UAGGz1C,EAAID,EAAGC,IAAK4B,EAAEmY,KAAK,IACxBnY,EAAE6zC,SACJ,MAKE,IAFAl3C,GAAKi/H,GAAQz9H,EAAI0oF,EAAGhuF,SAAWuF,EAAI42H,EAAGn8H,SAAWsF,EAAIC,EAEhDD,EAAIC,EAAI,EAAGA,EAAIzB,EAAGyB,IAErB,GAAIyoF,EAAGzoF,IAAM42H,EAAG52H,GAAI,CAClBw9H,EAAO/0C,EAAGzoF,GAAK42H,EAAG52H,GAClB,KACF,CAWJ,GANIw9H,IAAM57H,EAAI6mF,EAAIA,EAAKmuC,EAAIA,EAAKh1H,EAAG4H,EAAEgB,GAAKhB,EAAEgB,IAE5CxK,GAAKzB,EAAIq4H,EAAGn8H,SAAW8C,EAAIkrF,EAAGhuF,SAItB,EAAG,KAAOuF,IAAKyoF,EAAGlrF,KAAO,GAIjC,IAHAyC,EAAI0oF,EAAO,EAGJnqF,EAAIwB,GAAI,CAEb,GAAI0oF,IAAKlqF,GAAKq4H,EAAGr4H,GAAI,CACnB,IAAKhB,EAAIgB,EAAGhB,IAAMkrF,IAAKlrF,GAAIkrF,EAAGlrF,GAAKyC,KACjCyoF,EAAGlrF,GACLkrF,EAAGlqF,IAAMmqF,CACX,CAEAD,EAAGlqF,IAAMq4H,EAAGr4H,EACd,CAGA,KAAgB,GAATkqF,EAAG,GAASA,EAAG1xD,OAAO,EAAG,KAAM2mG,GAGtC,OAAKj1C,EAAG,GAWD2wC,EAAU5vH,EAAGi/E,EAAIi1C,IAPtBl0H,EAAEgB,EAAqB,GAAjBotH,GAAsB,EAAI,EAChCpuH,EAAE9M,EAAI,CAAC8M,EAAElN,EAAI,GACNkN,EAMX,EAwBA0qH,EAAEyJ,OAASzJ,EAAEp1H,IAAM,SAAU0K,EAAGxJ,GAC9B,IAAIuB,EAAGiJ,EACLjB,EAAIxN,KAKN,OAHAyN,EAAI,IAAIwtH,EAAUxtH,EAAGxJ,IAGhBuJ,EAAE7M,IAAM8M,EAAEgB,GAAKhB,EAAE9M,IAAM8M,EAAE9M,EAAE,GACvB,IAAIs6H,EAAU1qD,MAGX9iE,EAAE9M,GAAK6M,EAAE7M,IAAM6M,EAAE7M,EAAE,GACtB,IAAIs6H,EAAUztH,IAGJ,GAAf2uH,GAIF1tH,EAAIhB,EAAEgB,EACNhB,EAAEgB,EAAI,EACNjJ,EAAIkN,EAAIlF,EAAGC,EAAG,EAAG,GACjBA,EAAEgB,EAAIA,EACNjJ,EAAEiJ,GAAKA,GAEPjJ,EAAIkN,EAAIlF,EAAGC,EAAG,EAAG0uH,IAGnB1uH,EAAID,EAAEg0H,MAAMh8H,EAAEu7H,MAAMtzH,KAGb9M,EAAE,IAAqB,GAAfw7H,IAAkB1uH,EAAEgB,EAAIjB,EAAEiB,GAElChB,EACT,EAuBA0qH,EAAE0J,aAAe1J,EAAE4I,MAAQ,SAAUtzH,EAAGxJ,GACtC,IAAItD,EAAGJ,EAAGiB,EAAGgB,EAAG4B,EAAGqL,EAAGqyH,EAAK3C,EAAKC,EAAK2C,EAAKC,EAAKC,EAAKC,EAClDriI,EAAMsiI,EACN30H,EAAIxN,KACJ0sF,EAAKl/E,EAAE7M,EACPk6H,GAAMptH,EAAI,IAAIwtH,EAAUxtH,EAAGxJ,IAAItD,EAGjC,KAAK+rF,GAAOmuC,GAAOnuC,EAAG,IAAOmuC,EAAG,IAmB9B,OAhBKrtH,EAAEiB,IAAMhB,EAAEgB,GAAKi+E,IAAOA,EAAG,KAAOmuC,GAAMA,IAAOA,EAAG,KAAOnuC,EAC1Dj/E,EAAE9M,EAAI8M,EAAElN,EAAIkN,EAAEgB,EAAI,MAElBhB,EAAEgB,GAAKjB,EAAEiB,EAGJi+E,GAAOmuC,GAKVptH,EAAE9M,EAAI,CAAC,GACP8M,EAAElN,EAAI,GALNkN,EAAE9M,EAAI8M,EAAElN,EAAI,MASTkN,EAYT,IATAlN,EAAIo6H,EAASntH,EAAEjN,EAAIg6H,GAAYI,EAASltH,EAAElN,EAAIg6H,GAC9C9sH,EAAEgB,GAAKjB,EAAEiB,GACTqzH,EAAMp1C,EAAGhuF,SACTqjI,EAAMlH,EAAGn8H,UAGMwjI,EAAKx1C,EAAIA,EAAKmuC,EAAIA,EAAKqH,EAAI1gI,EAAIsgI,EAAKA,EAAMC,EAAKA,EAAMvgI,GAG/DA,EAAIsgI,EAAMC,EAAKG,EAAK,GAAI1gI,IAAK0gI,EAAGlkH,KAAK,IAK1C,IAHAne,EAAO8sF,EACPw1C,EAAWzH,EAENl5H,EAAIugI,IAAOvgI,GAAK,GAAI,CAKvB,IAJAb,EAAI,EACJqhI,EAAMnH,EAAGr5H,GAAK2gI,EACdF,EAAMpH,EAAGr5H,GAAK2gI,EAAW,EAEX3/H,EAAIhB,GAAb4C,EAAI09H,GAAgBt/H,EAAIhB,GAK3Bb,IADAw+H,EAAM6C,GAHN7C,EAAMzyC,IAAKtoF,GAAK+9H,IAEhB1yH,EAAIwyH,EAAM9C,GADVC,EAAM1yC,EAAGtoF,GAAK+9H,EAAW,GACHH,GACEG,EAAYA,EAAYD,EAAG1/H,GAAK7B,GAC7Cd,EAAO,IAAM4P,EAAI0yH,EAAW,GAAKF,EAAM7C,EAClD8C,EAAG1/H,KAAO28H,EAAMt/H,EAGlBqiI,EAAG1/H,GAAK7B,CACV,CAQA,OANIA,IACAJ,EAEF2hI,EAAGlnG,OAAO,EAAG,GAGRqiG,EAAU5vH,EAAGy0H,EAAI3hI,EAC1B,EAOA43H,EAAEiK,QAAU,WACV,IAAI50H,EAAI,IAAIytH,EAAUj7H,MAEtB,OADAwN,EAAEiB,GAAKjB,EAAEiB,GAAK,KACPjB,CACT,EAuBA2qH,EAAEwG,KAAO,SAAUlxH,EAAGxJ,GACpB,IAAI4B,EACF2H,EAAIxN,KACJgE,EAAIwJ,EAAEiB,EAMR,GAHAxK,GADAwJ,EAAI,IAAIwtH,EAAUxtH,EAAGxJ,IACfwK,GAGDzK,IAAMC,EAAG,OAAO,IAAIg3H,EAAU1qD,KAGlC,GAAIvsE,GAAKC,EAER,OADAwJ,EAAEgB,GAAKxK,EACAuJ,EAAEg0H,MAAM/zH,GAGjB,IAAIi0H,EAAKl0H,EAAEjN,EAAIg6H,EACboH,EAAKl0H,EAAElN,EAAIg6H,EACX7tC,EAAKl/E,EAAE7M,EACPk6H,EAAKptH,EAAE9M,EAET,IAAK+gI,IAAOC,EAAI,CAGd,IAAKj1C,IAAOmuC,EAAI,OAAO,IAAII,EAAUj3H,EAAI,GAIzC,IAAK0oF,EAAG,KAAOmuC,EAAG,GAAI,OAAOA,EAAG,GAAKptH,EAAI,IAAIwtH,EAAUvuC,EAAG,GAAKl/E,EAAQ,EAAJxJ,EACrE,CAOA,GALA09H,EAAK/G,EAAS+G,GACdC,EAAKhH,EAASgH,GACdj1C,EAAKA,EAAGxyE,QAGJlW,EAAI09H,EAAKC,EAAI,CAUf,IATI39H,EAAI,GACN29H,EAAKD,EACL77H,EAAIg1H,IAEJ72H,GAAKA,EACL6B,EAAI6mF,GAGN7mF,EAAE6zC,UACK11C,IAAK6B,EAAEmY,KAAK,IACnBnY,EAAE6zC,SACJ,CASA,KAPA11C,EAAI0oF,EAAGhuF,SACPuF,EAAI42H,EAAGn8H,QAGK,IAAGmH,EAAIg1H,EAAIA,EAAKnuC,EAAIA,EAAK7mF,EAAG5B,EAAID,GAGvCA,EAAI,EAAGC,GACVD,GAAK0oF,IAAKzoF,GAAKyoF,EAAGzoF,GAAK42H,EAAG52H,GAAKD,GAAK2oF,EAAO,EAC3CD,EAAGzoF,GAAK0oF,IAASD,EAAGzoF,GAAK,EAAIyoF,EAAGzoF,GAAK0oF,EAUvC,OAPI3oF,IACF0oF,EAAK,CAAC1oF,GAAG+b,OAAO2sE,KACdi1C,GAKGtE,EAAU5vH,EAAGi/E,EAAIi1C,EAC1B,EAkBAxJ,EAAEkK,UAAYlK,EAAEmF,GAAK,SAAUA,EAAIL,GACjC,IAAIt8H,EAAG6O,EAAGs8B,EACRt+B,EAAIxN,KAEN,GAAU,MAANs9H,GAAcA,MAASA,EAKzB,OAJAxC,EAASwC,EAAI,EAAG3zC,GACN,MAANszC,EAAYA,EAAKpB,EAChBf,EAASmC,EAAI,EAAG,GAEdntH,EAAM,IAAImrH,EAAUztH,GAAI8vH,EAAIL,GAGrC,KAAMt8H,EAAI6M,EAAE7M,GAAI,OAAO,KAIvB,GAFA6O,GADAs8B,EAAInrC,EAAEjC,OAAS,GACP67H,EAAW,EAEfzuF,EAAInrC,EAAEmrC,GAAI,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIt8B,KAG7B,IAAKs8B,EAAInrC,EAAE,GAAImrC,GAAK,GAAIA,GAAK,GAAIt8B,KACnC,CAIA,OAFI8tH,GAAM9vH,EAAEjN,EAAI,EAAIiP,IAAGA,EAAIhC,EAAEjN,EAAI,GAE1BiP,CACT,EAWA2oH,EAAEmK,UAAY,SAAUl+H,GAEtB,OADA02H,EAAS12H,GAAG,iBAAmBo2H,GACxBx6H,KAAK+gI,MAAM,KAAO38H,EAC3B,EAcA+zH,EAAEoK,WAAapK,EAAE3hH,KAAO,WACtB,IAAI/G,EAAGD,EAAGzO,EAAGyhI,EAAK38H,EAChB2H,EAAIxN,KACJW,EAAI6M,EAAE7M,EACN8N,EAAIjB,EAAEiB,EACNlO,EAAIiN,EAAEjN,EACNk+H,EAAK7C,EAAiB,EACtB3oH,EAAO,IAAIgoH,EAAU,OAGvB,GAAU,IAANxsH,IAAY9N,IAAMA,EAAE,GACtB,OAAO,IAAIs6H,GAAWxsH,GAAKA,EAAI,KAAO9N,GAAKA,EAAE,IAAM4vE,IAAM5vE,EAAI6M,EAAI,KA8BnE,GAtBS,IAJTiB,EAAInN,KAAKkV,MAAMqE,EAAQrN,MAITiB,GAAK,OACjBe,EAAIorH,EAAcj6H,IACXjC,OAAS6B,GAAK,GAAK,IAAGiP,GAAK,KAClCf,EAAInN,KAAKkV,MAAMhH,GACfjP,EAAIo6H,GAAUp6H,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1CQ,EAAI,IAAIk6H,EANNzrH,EADEf,GAAK,IACH,KAAOlO,GAEXiP,EAAIf,EAAEssH,iBACA7gH,MAAM,EAAG1K,EAAEiN,QAAQ,KAAO,GAAKlc,IAKvCQ,EAAI,IAAIk6H,EAAUxsH,EAAI,IAOpB1N,EAAEJ,EAAE,GAMN,KAJA8N,GADAlO,EAAIQ,EAAER,GACEk+H,GACA,IAAGhwH,EAAI,KAOb,GAHA5I,EAAI9E,EACJA,EAAIkS,EAAK8tH,MAAMl7H,EAAE84H,KAAKjsH,EAAIlF,EAAG3H,EAAG44H,EAAI,KAEhC7D,EAAc/0H,EAAElF,GAAGuZ,MAAM,EAAGzL,MAAQe,EAAIorH,EAAc75H,EAAEJ,IAAIuZ,MAAM,EAAGzL,GAAI,CAW3E,GANI1N,EAAER,EAAIA,KAAKkO,EAMN,SALTe,EAAIA,EAAE0K,MAAMzL,EAAI,EAAGA,EAAI,MAKH+zH,GAAY,QAALhzH,GAgBpB,EAICA,KAAOA,EAAE0K,MAAM,IAAqB,KAAf1K,EAAEwZ,OAAO,MAGlClZ,EAAM/O,EAAGA,EAAER,EAAIq7H,EAAiB,EAAG,GACnCnsH,GAAK1O,EAAEggI,MAAMhgI,GAAGmU,GAAG1H,IAGrB,KACF,CAxBE,IAAKg1H,IACH1yH,EAAMjK,EAAGA,EAAEtF,EAAIq7H,EAAiB,EAAG,GAE/B/1H,EAAEk7H,MAAMl7H,GAAGqP,GAAG1H,IAAI,CACpBzM,EAAI8E,EACJ,KACF,CAGF44H,GAAM,EACNhwH,GAAK,EACL+zH,EAAM,CAcV,CAIJ,OAAO1yH,EAAM/O,EAAGA,EAAER,EAAIq7H,EAAiB,EAAGC,EAAepsH,EAC3D,EAYA0oH,EAAE4C,cAAgB,SAAU0D,EAAIxB,GAK9B,OAJU,MAANwB,IACF3D,EAAS2D,EAAI,EAAG90C,GAChB80C,KAEK95F,EAAO3kC,KAAMy+H,EAAIxB,EAAI,EAC9B,EAeA9E,EAAEsK,QAAU,SAAUhE,EAAIxB,GAKxB,OAJU,MAANwB,IACF3D,EAAS2D,EAAI,EAAG90C,GAChB80C,EAAKA,EAAKz+H,KAAKO,EAAI,GAEdokC,EAAO3kC,KAAMy+H,EAAIxB,EAC1B,EA4BA9E,EAAEuK,SAAW,SAAUjE,EAAIxB,EAAIt4F,GAC7B,IAAI1jC,EACFuM,EAAIxN,KAEN,GAAc,MAAV2kC,EACQ,MAAN85F,GAAcxB,GAAmB,iBAANA,GAC7Bt4F,EAASs4F,EACTA,EAAK,MACIwB,GAAmB,iBAANA,GACtB95F,EAAS85F,EACTA,EAAKxB,EAAK,MAEVt4F,EAAS03F,OAEN,GAAqB,iBAAV13F,EAChB,MAAMllC,MACH46H,EAAiB,2BAA6B11F,GAKnD,GAFA1jC,EAAMuM,EAAEi1H,QAAQhE,EAAIxB,GAEhBzvH,EAAE7M,EAAG,CACP,IAAIa,EACFmb,EAAM1b,EAAIiX,MAAM,KAChByqH,GAAMh+F,EAAOlgC,UACbm+H,GAAMj+F,EAAO23F,mBACbC,EAAiB53F,EAAO43F,gBAAkB,GAC1CsG,EAAUlmH,EAAI,GACdmmH,EAAenmH,EAAI,GACnBhW,EAAQ6G,EAAEiB,EAAI,EACds0H,EAAYp8H,EAAQk8H,EAAQ3oH,MAAM,GAAK2oH,EACvCxhI,EAAM0hI,EAAUrkI,OAIlB,GAFIkkI,IAAIphI,EAAImhI,EAAIA,EAAKC,EAAIA,EAAKphI,EAAGH,GAAOG,GAEpCmhI,EAAK,GAAKthI,EAAM,EAAG,CAGrB,IAFAG,EAAIH,EAAMshI,GAAMA,EAChBE,EAAUE,EAAUplH,OAAO,EAAGnc,GACvBA,EAAIH,EAAKG,GAAKmhI,EAAIE,GAAWtG,EAAiBwG,EAAUplH,OAAOnc,EAAGmhI,GACrEC,EAAK,IAAGC,GAAWtG,EAAiBwG,EAAU7oH,MAAM1Y,IACpDmF,IAAOk8H,EAAU,IAAMA,EAC7B,CAEA5hI,EAAM6hI,EACHD,GAAWl+F,EAAO63F,kBAAoB,MAAQoG,GAAMj+F,EAAO83F,mBAC1DqG,EAAa3gI,QAAQ,IAAIujC,OAAO,OAASk9F,EAAK,OAAQ,KACvD,MAAQj+F,EAAO+3F,wBAA0B,KACxCoG,GACDD,CACL,CAEA,OAAQl+F,EAAOs6B,QAAU,IAAMh+D,GAAO0jC,EAAOg4F,QAAU,GACzD,EAcAxE,EAAE6K,WAAa,SAAUC,GACvB,IAAIvyG,EAAGwyG,EAAIp4G,EAAIC,EAAIxqB,EAAG4iI,EAAK3zH,EAAG4zH,EAAIruD,EAAIvvE,EAAGzE,EAAG0N,EAC1CjB,EAAIxN,KACJ0sF,EAAKl/E,EAAE7M,EAET,GAAU,MAANsiI,MACFzzH,EAAI,IAAIyrH,EAAUgI,IAGX/7G,cAAgB1X,EAAE7O,GAAa,IAAR6O,EAAEf,IAAYe,EAAEsF,GAAGg/D,IAC/C,MAAMr0E,MACH46H,EAAiB,aACf7qH,EAAE0X,YAAc,iBAAmB,oBAAsBrM,EAAQrL,IAI1E,IAAKk9E,EAAI,OAAO,IAAIuuC,EAAUztH,GAoB9B,IAlBAkjB,EAAI,IAAIuqG,EAAUnnD,GAClBiB,EAAKmuD,EAAK,IAAIjI,EAAUnnD,GACxBhpD,EAAKs4G,EAAK,IAAInI,EAAUnnD,GACxBrlE,EAAImsH,EAAcluC,GAIlBnsF,EAAImwB,EAAEnwB,EAAIkO,EAAE/P,OAAS8O,EAAEjN,EAAI,EAC3BmwB,EAAE/vB,EAAE,GAAK85H,GAAU0I,EAAM5iI,EAAIg6H,GAAY,EAAIA,EAAW4I,EAAMA,GAC9DF,GAAMA,GAAMzzH,EAAE6wH,WAAW3vG,GAAK,EAAKnwB,EAAI,EAAImwB,EAAIqkD,EAAMvlE,EAErD2zH,EAAMlH,EACNA,EAAU,IACVzsH,EAAI,IAAIyrH,EAAUxsH,GAGlB20H,EAAGziI,EAAE,GAAK,EAGR6E,EAAIkN,EAAIlD,EAAGkhB,EAAG,EAAG,GAEQ,IADzB3F,EAAKm4G,EAAGvE,KAAKn5H,EAAEu7H,MAAMj2G,KACdu1G,WAAW4C,IAClBC,EAAKp4G,EACLA,EAAKC,EACLgqD,EAAKquD,EAAGzE,KAAKn5H,EAAEu7H,MAAMh2G,EAAKgqD,IAC1BquD,EAAKr4G,EACL2F,EAAIlhB,EAAEgyH,MAAMh8H,EAAEu7H,MAAMh2G,EAAK2F,IACzBlhB,EAAIub,EAeN,OAZAA,EAAKrY,EAAIuwH,EAAGzB,MAAM0B,GAAKp4G,EAAI,EAAG,GAC9Bs4G,EAAKA,EAAGzE,KAAK5zG,EAAGg2G,MAAMhsD,IACtBmuD,EAAKA,EAAGvE,KAAK5zG,EAAGg2G,MAAMj2G,IACtBs4G,EAAG30H,EAAIsmE,EAAGtmE,EAAIjB,EAAEiB,EAIhB1N,EAAI2R,EAAIqiE,EAAIjqD,EAHZvqB,GAAQ,EAGWs7H,GAAe2F,MAAMh0H,GAAGpH,MAAMi6H,WAC7C3tH,EAAI0wH,EAAIF,EAAI3iI,EAAGs7H,GAAe2F,MAAMh0H,GAAGpH,OAAS,EAAI,CAAC2uE,EAAIjqD,GAAM,CAACs4G,EAAIF,GAExEjH,EAAUkH,EAEHpiI,CACT,EAMAo3H,EAAErzH,SAAW,WACX,OAAQ+V,EAAQ7a,KAClB,EAcAm4H,EAAEkL,YAAc,SAAU/F,EAAIL,GAE5B,OADU,MAANK,GAAYxC,EAASwC,EAAI,EAAG3zC,GACzBhlD,EAAO3kC,KAAMs9H,EAAIL,EAAI,EAC9B,EAcA9E,EAAEj2H,SAAW,SAAU+B,GACrB,IAAIhD,EACFuO,EAAIxP,KACJyO,EAAIe,EAAEf,EACNlO,EAAIiP,EAAEjP,EA0BR,OAvBU,OAANA,EACEkO,GACFxN,EAAM,WACFwN,EAAI,IAAGxN,EAAM,IAAMA,IAEvBA,EAAM,OAGC,MAALgD,EACFhD,EAAMV,GAAKu7H,GAAcv7H,GAAKw7H,EAC3BhB,EAAcH,EAAcprH,EAAE7O,GAAIJ,GAClCy6H,EAAaJ,EAAcprH,EAAE7O,GAAIJ,EAAG,KACxB,KAAN0D,GAAY24H,EAErB37H,EAAM+5H,EAAaJ,GADnBprH,EAAIM,EAAM,IAAImrH,EAAUzrH,GAAIosH,EAAiBr7H,EAAI,EAAGs7H,IACjBl7H,GAAI6O,EAAEjP,EAAG,MAE5Cu6H,EAAS72H,EAAG,EAAGuoF,EAAS9tF,OAAQ,QAChCuC,EAAMk6H,EAAYH,EAAaJ,EAAcprH,EAAE7O,GAAIJ,EAAG,KAAM,GAAI0D,EAAGwK,GAAG,IAGpEA,EAAI,GAAKe,EAAE7O,EAAE,KAAIM,EAAM,IAAMA,IAG5BA,CACT,EAOAk3H,EAAEt9G,QAAUs9G,EAAEnzH,OAAS,WACrB,OAAO6V,EAAQ7a,KACjB,EAGAm4H,EAAE4E,cAAe,EAEjB5E,EAAE3+G,OAAO43B,aAAe,YAGxB+mF,EAAE3+G,OAAOq+C,IAAI,+BAAiCsgE,EAAEt9G,QAE5B,MAAhBqgH,GAAsBD,EAAU/6G,IAAIg7G,GAEjCD,CACT,CAqIuB33H,GAEvB,2HC7zFO,MAAMggI,GAAwBC,IACnC,IAAIC,EAAcD,EAIlB,GAHIA,GAAWA,EAAQ3lI,QACrB4lI,EAAcD,EAAQ3lI,OAEpB4lI,EAAY/mH,QAAQ,KAAO,EAAG,CAChC,MACMuD,EADQwjH,EAAYtrH,MAAM,KACbgmC,QAAOpS,IACxB,IAEE,OADA0sF,GAAA,UAAOh5F,OAAOsM,EAAG,QACV,CACT,CAAE,MAAOvrC,GACP,OAAO,CACT,KAEF,GAAoB,IAAhByf,EAAKthB,OACP,MAAM,IAAIe,MAAM,oBAEjB+jI,GAAexjH,CAClB,CACA,IACEw4G,GAAA,UAAOh5F,OAAOgkG,EAAa,MAC7B,CAAE,MAAOjjI,GACP,MAAM,IAAId,MAAM,kBAClB,CACA,OAAO+jI,CAAW,EAOPC,GAAmCxuF,IAC9C,MAAMh3C,EAASC,OAAOS,KAAKs2C,EAAQ,UACnC,OAAOujF,GAAA,cAAWp9C,kBAAkB57C,OAAOvhC,EAAO,EAClD,SAAAy6H,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,oBAAAta,GAAA,wBAAAnwC,KAAA,CAAA0qD,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,UClCW+J,GACX,mEAEWC,GAAgB,CAC3BC,eAAgB,CACd1sH,KAAM,iBACNI,KAAM,yBACNy0B,OAAQ,MACR6L,OAAQ,IAEVisF,cAAe,CACb3sH,KAAM,gBACNI,KAAM,wBACNy0B,OAAQ,MACR6L,OAAQ,CAAC,cAEXksF,6BAA8B,CAC5B5sH,KAAM,+BACNI,KAAM,uCACNy0B,OAAQ,MACR6L,OAAQ,CAAC,WACTmsF,eAAgB,CAAAvL,GAAA,0BAChBwL,gBAAexL,GAAA,qCAEjByL,eAAgB,CACd/sH,KAAM,iBACNI,KAAM,yBACNy0B,OAAQ,MACR6L,OAAQ,GACRmsF,eAAgB,IAElBtc,SAAU,CACRvwG,KAAM,WACNI,KAAM,mBACNy0B,OAAQ,MACR6L,OAAQ,CAAC,YAAa,wBAExBssF,iBAAkB,CAChBhtH,KAAM,mBACNI,KAAM,2BACNy0B,OAAQ,MACR6L,OAAQ,CAAC,cAAe,wBAE1BusF,YAAa,CACXjtH,KAAM,cACNI,KAAM,+BACNy0B,OAAQ,MACR6L,OAAQ,CAAC,iBACTmsF,eAAgB,IAElBK,aAAc,CACZltH,KAAM,eACNI,KAAM,gCACNy0B,OAAQ,MACR6L,OAAQ,CAAC,YAAa,SAAU,UAElCysF,oBAAqB,CACnBntH,KAAM,sBACNI,KAAM,uCACNy0B,OAAQ,MACR6L,OAAQ,CAAC,kBAEX0sF,yBAA0B,CACxBptH,KAAM,2BACNI,KAAM,mCACNy0B,OAAQ,MACR6L,OAAQ,IAEV2sF,gBAAiB,CACfrtH,KAAM,kBACNI,KAAM,6BACNy0B,OAAQ,OACR6L,OAAQ,CAAC,kBACTmsF,eAAgB,IAElBS,iBAAkB,CAChBttH,KAAM,mBACNI,KAAM,8BACNy0B,OAAQ,OACR6L,OAAQ,CAAC,kBACTmsF,eAAgB,IAElBU,wBAAyB,CACvBvtH,KAAM,0BACNI,KAAM,qCACNy0B,OAAQ,OACR6L,OAAQ,CAAC,kBACTmsF,eAAgB,IAElBW,aAAc,CACZxtH,KAAM,eACNI,KAAM,gCACNy0B,OAAQ,OACR6L,OAAQ,CAAC,kBACTmsF,eAAgB,IAElBY,SAAU,CACRztH,KAAM,WACNI,KAAM,YACNy0B,OAAQ,MACR6L,OAAQ,CAAC,gBAEXgtF,QAAS,CACP1tH,KAAM,UACNI,KAAM,WACNy0B,OAAQ,OACR6L,OAAQ,CAAC,WACTmsF,eAAgB,IAElBc,WAAY,CACV3tH,KAAM,aACNI,KAAM,WACNy0B,OAAQ,SACR6L,OAAQ,CAAC,WACTmsF,eAAgB,IAElBe,YAAa,CACX5tH,KAAM,cACNI,KAAM,kBACNy0B,OAAQ,MACR6L,OAAQ,GACRmsF,eAAgB,KAOPgB,GAAW,CACtBC,QAAS,IACTC,IAAK,IACLC,KAAM,OACNC,KAAM,OACNC,QAAS,OACTC,WAAY,OACZC,KAAM,UACNC,KAAM,UACNC,SAAU,UACVC,UAAW,UACXC,KAAM,aACNC,KAAM,aACNC,QAAS,aACTC,UAAW,aACXC,KAAM,aACNC,MAAO,gBACPC,WAAY,gBACZC,MAAO,gBACPC,OAAQ,mBACRC,WAAY,mBACZC,MAAO,mBACPC,MAAO,sBACPC,OAAQ,yBACRC,MAAO,yBACPC,OAAQ,4BACRC,OAAQ,+BACRC,OAAQ,mCAGGC,GAA0B,OAa1BC,IAX0BpO,GAAA,2BAWP,CAC9BqO,iBAAkB,CAChBpnH,MAAO,OACPqnH,aAAc,kBAEhBC,mBAAoB,CAClBtnH,MAAO,OACPqnH,aAAc,wBAEhBE,cAAe,CACbvnH,MAAO,OACPqnH,aAAc,4BAEhBG,wBAAyB,CACvBxnH,MAAO,OACPqnH,aAAc,wBAEhB,SAAApO,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,mCAAA+J,GAAA,8CAAAG,GAAA,qCAAAkD,GAAA,CAAAnN,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,UCjMIuN,GAAiBA,CAACtoG,EAAc1nB,OAC/B0nB,EAAa1nB,MAAQ0nB,EAAa1nB,OAASA,IAG3C0nB,EAAagO,aAAmD,IAApChO,EAAagO,YAAYluC,QAGd,UAArCkgC,EAAagO,YAAY,GAAG1xB,MAG/BisH,GAAYvoG,GAAgB45F,GAAA,iBAAAA,CAAe55F,EAAc,WAEzDwoG,GAASxoG,GAAgB45F,GAAA,iBAAAA,CAAe55F,EAAc,QAErD,SAASpwB,GAAUwvE,EAAW30C,GAA2B,IAAnBg+F,EAAY5rH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,GAC1D,MAAM6rH,GAAgBtpD,EAAUpxC,aAAe,IAAIluC,OACnD,IAAIu2C,EAAS5L,EACb,GAAqB,IAAjBi+F,EACF,OAAOj+F,EAGT,IAAK,MAAM,OAAE6U,EAAM,YAAEqpF,KAAiBF,EACpC,GAAInpF,EAAO8/B,IAAc30C,EACvB,OAAOk+F,EAAYl+F,GA+BvB,OA3BAhsC,OAAOkrB,KAAKy1D,EAAU97C,QAAQgF,SAAQ4F,IACpC,MAAM,KACJ3O,EAAI,KACJjnB,EAAI,aACJ0nB,GACEo/C,EAAU97C,OAAO4K,GACrB,GAAIlO,EACF,GAAIT,GAAiB,aAATA,EAAqB,CAC/B,IAAIvgC,EAAQyrC,EAAOnyB,GACftZ,GAAS8D,MAAMC,QAAQ/D,KACzBA,EAAQA,EACLsgD,QAAOpS,GAAKA,UACZvN,KAAI6wB,GAAQopE,GAAA,YAAAA,CAAU55F,EAAcwwB,EAAMi4E,MAE/CpyF,EAAS,IACJA,EACH,CAAC/9B,GAAOtZ,EAEZ,MACEq3C,EAAS,IACJA,EACH,CAAC/9B,GAAwB,OAAjBmyB,EAAOnyB,SAAmC9X,IAAjBiqC,EAAOnyB,GACpCshH,GAAA,YAAAA,CAAU55F,EAAcyK,EAAOnyB,GAAOmwH,GAAgBh+F,EAAOnyB,GAGvE,IAEK+9B,CACT,CAEO,SAASuyF,GAAoBxpD,EAAW30C,GAC7C,MAAMi+F,EAAetpD,EAAUpxC,YAAcoxC,EAAUpxC,YAAYluC,OAAS,EAC5E,IAAIu2C,EAAS5L,EACb,IAAKA,EACH,OAAOA,EAET,GAAqB,IAAjBi+F,GAAwC,IAAjBA,IAAuBtpD,EAAUpxC,YAAY,GAAGhO,aACzE,OAAOyK,EAMT,MAAM,OACJnH,EAAM,QACNrW,EAAU,CAAC,GACTmyD,EACJ,OAAqB,IAAjBspD,GAAsBplG,EAAOtkC,OAASskC,EAAO5jC,MAA6B,IAAtButB,EAAQ47G,UACvDpqI,OAAOkrB,KAAK8gB,GAAQ9K,KAAIjgC,IAAO,CAAGA,MAAKV,MAAOyrC,EAAO/qC,QAG9DjB,OAAOkrB,KAAKy1D,EAAU97C,QAAQgF,SAAQ4F,IACpC,MAAM,KACJ51B,EAAI,aACJ0nB,GACEo/C,EAAU97C,OAAO4K,GACrB,GAAIlO,EACF,GAAIyK,EAAOnyB,IAASxV,MAAMC,QAAQ0nC,EAAOnyB,IAAQ,CAC/C,IAAItZ,EAAQyrC,EAAOnyB,GACnBtZ,EAAQA,EAAM2gC,KAAI6wB,GAAQopE,GAAA,sBAAAA,CAAoB55F,EAAcwwB,KAC5Dna,EAAS,IACJA,EACH,CAAC/9B,GAAOtZ,EAEZ,MACEq3C,EAAS,IACJA,EACH,CAAC/9B,GAAOshH,GAAA,sBAAAA,CAAoB55F,EAAcyK,EAAOnyB,IAGvD,IAEK+9B,EACT,CAEO,SAASyyF,GAAoB1pD,EAAW30C,GAC7C,MAAMi+F,GAAgBtpD,EAAUpxC,aAAe,IAAIluC,OACnD,IAAIu2C,EAAS5L,EACb,GACmB,IAAjBi+F,GACqB,IAAjBA,IAAuBtpD,EAAUpxC,YAAY,GAAGhO,aAEpD,OAAOyK,EAMT,MAAM,OAAEnH,EAAM,QAAErW,EAAU,CAAC,GAAMmyD,EACjC,OACmB,IAAjBspD,GACGplG,EAAOtkC,OACPskC,EAAO5jC,MACe,IAAtButB,EAAQ47G,UAEJp+F,EAAOtB,QACZ,CAAC50B,EAAK24B,KAAM,IACP34B,EACH,CAAC24B,EAAExtC,KAAMwtC,EAAEluC,SAEb,CAAC,IAILP,OAAOkrB,KAAK2Z,GAAQgF,SAAQ4F,IAC1B,MAAM,KAAE51B,EAAI,aAAE0nB,GAAiBsD,EAAO4K,GACtC,GAAIlO,SAAgByK,EAClB,GAAIA,EAAOnyB,IAASxV,MAAMC,QAAQ0nC,EAAOnyB,IAAQ,CAC/C,MAAM,YACJ01B,EAAc,GACd1K,OAAQylG,EACR97G,QAAS+7G,EAAkB,CAAC,GAC1BhpG,EAEJ,GACyB,IAAvBgO,EAAYluC,QACTipI,EAAe/pI,OACf+pI,EAAerpI,MACe,IAA9BspI,EAAgBH,UAEnBxyF,EAAS,IACJA,EACH,CAAC/9B,GAAOmyB,EAAOnyB,GAAM6wB,QACnB,CAAC50B,EAAK24B,KAAM,IACP34B,EACH,CAAC24B,EAAExtC,KAAMwtC,EAAEluC,SAEb,CAAC,QAGA,CACL,IAAIA,EAAQyrC,EAAOnyB,GACnBtZ,EAAQA,EAAM2gC,KAAI6wB,GAAQopE,GAAA,sBAAAA,CAAoB55F,EAAcwwB,KAC5Dna,EAAS,IACJA,EACH,CAAC/9B,GAAOtZ,EAEZ,CACF,MACEq3C,EAAS,IACJA,EACH,CAAC/9B,GAAOshH,GAAA,sBAAAA,CAAoB55F,EAAcyK,EAAOnyB,IAGvD,IAEK+9B,EACT,CAEO,MAAM4yF,GAAqB,CAChC,CACE3pF,OAAMs6E,GAAA,aACN+O,YAAal+F,IACX,IAAI4L,EAAS5L,EAWb,MAVsB,iBAAXA,IACT4L,EAAS,CACPr3C,MAAOM,OAAOS,KAAK65H,GAAA,mBAAAA,CAAiBA,GAAA,wBAAAA,CAAsBnvF,IAAU,SAGpE3nC,MAAMC,QAAQ0nC,KAChB4L,EAAS5L,EAAO9K,KAAIltB,IAAK,CACvBzT,MAAOM,OAAOS,KAAK65H,GAAA,mBAAAA,CAAiBA,GAAA,wBAAAA,CAAsBnnH,IAAK,YAG5D4jC,CAAM,GAGjB,CACEiJ,OAAMs6E,GAAA,UACN+O,YAAal+F,IACX,IAAI4L,EAAS5L,EAWb,MAVsB,iBAAXA,IACT4L,EAAS,CACPr3C,MAAOM,OAAOS,KAAK0qC,EAAOlnC,QAAQ,KAAM,IAAK,SAG7CT,MAAMC,QAAQ0nC,KAChB4L,EAAS5L,EAAO9K,KAAIltB,IAAK,CACvBzT,MAAOM,OAAOS,KAAK0S,EAAElP,QAAQ,KAAM,IAAK,YAGrC8yC,CAAM,IAKZ,SAAS6yF,GAAc7mI,GAC5B,MAAM9B,EAAMjB,OAAOS,KAAKsC,EAAK,UAC7B,OAAOu3H,GAAA,UAAOluG,OAAOnrB,EACvB,CAEO,MAAM4oI,GAAsB,CACjC,CACE7pF,OAAMs6E,GAAA,aACN+O,YAAal+F,IACX,IAAI4L,EAAS5L,EAMb,OALI3nC,MAAMC,QAAQszC,GAChBA,EAASA,EAAO1W,KAAIltB,GAAKmnH,GAAA,gBAAAA,CAAcnnH,EAAEzT,SACd,iBAAXq3C,IAChBA,EAASujF,GAAA,gBAAAA,CAAcvjF,EAAOr3C,QAEzBq3C,CAAM,GAGjB,CACEiJ,OAAMs6E,GAAA,UACN+O,YAAal+F,IACX,IAAI4L,EAAS5L,EAMb,OALI3nC,MAAMC,QAAQszC,GAChBA,EAASA,EAAO1W,KAAIltB,GAAKnT,OAAOS,KAAK0S,EAAEzT,MAAO,UAAUsE,SAAS,SACtC,iBAAX+yC,IAChBA,EAAS/2C,OAAOS,KAAKs2C,EAAOr3C,MAAO,UAAUsE,SAAS,QAEjD+yC,CAAM,IAGjB,SAAAyjF,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,4BAAA2N,GAAA,uBAAA14H,GAAA,iCAAAg5H,GAAA,iCAAAE,GAAA,uBAAAP,GAAA,8BAAAa,GAAA,mCAAA1E,GAAA,oBAAA8D,GAAA,oBAAAnoB,GAAA,2BAAA6oB,GAAA,CAAAtO,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,gBCxOW1a,GAAS,CACpB30F,OAAOnP,GAAwB,IAAlBjc,EAAQuc,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,MAClBw5B,EAAS95B,EAIb,GAHoB,iBAATA,IACT85B,EAAS/2C,OAAOS,KAAKwc,EAAMjc,MAEvB+1C,aAAkB/2C,QACtB,MAAM,IAAIa,UAAU,+CAEtB,IAAIkwB,EAAOgmB,EAIX,OAHAhmB,EAAO/wB,OAAOS,KAAK65H,GAAA,SAAAA,CAAOvjF,GAAS,OACnChmB,EAAO/wB,OAAOS,KAAK65H,GAAA,SAAAA,CAAOvpG,GAAO,OACjCA,EAAO/wB,OAAOS,KAAKs2C,EAAO/yC,SAAS,OAAS+sB,EAAK/U,MAAM,EAAG,GAAGhY,SAAS,OAAQ,OACvEs2H,GAAA,QAAKluG,OAAO2E,EACrB,EACAuQ,OAAOv+B,EAAK/B,GACV,MAAMjB,EAASC,OAAOS,KAAK65H,GAAA,QAAKh5F,OAAOv+B,IACvC,IAAIka,EAAOld,EAAOic,MAAM,GAAI,GACxB+U,EAAO9T,EAWX,OAVA8T,EAAO/wB,OAAOS,KAAK65H,GAAA,SAAAA,CAAOvpG,GAAO,OACjCA,EAAO/wB,OAAOS,KAAK65H,GAAA,SAAAA,CAAOvpG,GAAO,OACjChxB,EAAOic,OAAO,GAAGgtB,SAAQ,CAACq7E,EAAO7hH,KAC/B,GAAI6hH,IAAUtzF,EAAKvuB,GACjB,MAAM,IAAIjB,MAAM,mBAClB,IAEEP,IACFic,EAAOA,EAAKjZ,SAAShD,IAEhBic,CACT,GAGW8sH,GAAmB,CAE9BC,gBAAgBC,GACd,MAAMC,EAAalqI,OAAOU,MAAM,GAChCwpI,EAAW7iH,aAAc,KAAI4iH,EAAQjmI,SAAS,QAAS,GACvD,MAAMgf,EAAQhjB,OAAO6hB,OAAO,CAACqoH,GAAa,GAC1C,OAAO5P,GAAA,QAAKluG,OAAOpJ,EACrB,EACAmnH,gBAAgBC,GACPpqI,OAAO6hB,OAAO,CAACy4G,GAAA,QAAKh5F,OAAO8oG,IAAgB,GAAG7kH,YAAY,IAI/D8kH,GAAmBC,GAAe9mI,MAAMhE,UAAU6gC,IAAIjnB,KAC1D,IAAIuC,WAAW2uH,IACfh5H,GAAO,IAAGA,EAAEtN,SAAS,MAAOgY,OAAO,KACnCgf,KAAK,IAEMuvG,GAAa7qI,IACxB,IAAI46G,EAAM,GAOV,OALEA,EADE56G,aAAiBM,OACbN,EAAMsE,SAAS,OAGfs2H,GAAA,mBAAAA,CAAiB56H,GAElB46G,CAAG,EAYCkwB,GAAUA,CAACjoI,EAAQkoI,EAASrhF,KACvC,MAAM5oD,EAASiqI,EAAUloI,EAAO/B,OAAS,EACzC,OAAO,IAAIgD,MAAMhD,EAAS,EAAI,EAAIA,GAAQw6B,KAAKouB,GAAQ,KAAO7mD,CAAM,EAYzDmoI,GAAWA,CAACnoI,EAAQkoI,EAASrhF,KACxC,MAAM5oD,EAASiqI,EAAUloI,EAAO/B,OAAS,EACzC,OAAO+B,EAAU,IAAIiB,MAAMhD,EAAS,EAAI,EAAIA,GAAQw6B,KAAKouB,GAAQ,IAAK,EAW3D0gF,GAAmBzE,IAC9B,GAAIA,EAAQ9mH,QAAQ,MAAQ,EAAG,CAC7B,MACMosH,EADQtF,EAAQrrH,MAAM,KACP,GACrB,OAAOsgH,GAAA,UAAOh5F,OAAOqpG,EAAQ,MAC/B,CACA,OAAOrQ,GAAA,UAAOh5F,OAAO+jG,EAAS,MAAM,EAUzBuF,GAAmBtwB,IAC9B,MAAMr5G,EAAMjB,OAAOS,KAAK65G,EAAIr2G,QAAQ,KAAM,IAAK,OAC/C,OAAOq2H,GAAA,UAAOluG,OAAOnrB,EAAK,MAAM,EAUrBm/H,GAAch2G,GAAUA,aAAMkwG,GAAA,cACrClwG,GAAUA,EAAO3qB,aAA2C,cAA5B2qB,EAAO3qB,YAAYuZ,KAS5CqV,GAAWjE,GAA4B,iBAAXA,GACjCA,GAAUA,EAAO3qB,aAA2C,WAA5B2qB,EAAO3qB,YAAYuZ,KAS9C0vB,GAAate,GAA4B,mBAAXA,EAS9ByF,GAAWzF,GAAqB,OAAXA,IAAqB5mB,MAAMC,QAAQ2mB,IAA8B,iBAAXA,EAS3E2d,GAAY3d,GAA4B,kBAAXA,EAS7BygH,GAAS9nI,IACpB,IACE,QAAS6jC,KAAK3L,MAAMl4B,EACtB,CAAE,MAAOV,GACP,OAAO,CACT,GAUWyoI,GAAcppI,IACzB,MAAM6B,EAAM7B,GAAU,EACtB,OAAI44H,GAAA,cAAAA,CAAY/2H,GACPA,GAGL+2H,GAAA,WAAAA,CAAS/2H,IAA+B,IAAtBA,EAAIgb,QAAQ,OAAsC,IAAvBhb,EAAIgb,QAAQ,OAItD,IAAA+7G,GAAA,cAAc/2H,EAAIS,SAAS,IAAK,IAH9B,IAAAs2H,GAAA,cAAc/2H,EAAIU,QAAQ,KAAM,IAAK,GAGJ,EAW/B8mI,GAAiBC,IAC5B,MAAMC,EAAY3Q,GAAA,YAAS0Q,EAAOA,EAAKrtH,cAAgB,SACvD,QAAkBzc,IAAd+pI,EAEF,MAAM,IAAI1pI,MAAO,uEAAuEqlC,KAAKzM,UAASmgG,GAAC,YAAU,KAAM,MAEzH,OAAO,IAAAA,GAAA,cAAc2Q,EAAW,GAAG,EAwBxBC,GAAUA,CAACxpI,EAAQspI,KAC9B,MAAMG,EAAc7Q,GAAA,cAAAA,CAAY54H,GAAQ2gI,UAAU/H,GAAA,iBAAAA,CAAe0Q,IAEjE,OAAO1Q,GAAA,cAAAA,CAAY54H,GAAUypI,EAAcA,EAAYnnI,SAAS,GAAG,EAwBxDonI,GAAQA,CAAC1pI,EAAQspI,KAC5B,MAAMG,EAAc7Q,GAAA,cAAAA,CAAY54H,GAAQmhI,MAAMvI,GAAA,iBAAAA,CAAe0Q,IAE7D,OAAO1Q,GAAA,cAAAA,CAAY54H,GAAUypI,EAAcA,EAAYnnI,SAAS,GAAG,EAWxDqnI,GAAmB3pI,IAC9B,MAAM4pI,EAAYhR,GAAA,cAAAA,CAAY54H,GAAQohI,eACtC,OAAIwI,EAAUpI,WAAW,GAChB,IAAA5I,GAAA,cAAAA,GAAA,oBAAgC,IAAImG,KAAK6K,GAAW7K,KAAK,GAE3D6K,CAAS,EAWLC,GAAkBC,IAC7B,IAAIjpI,EAAS,GAQb,OAPAipI,EAAWxiG,SAAQkoB,IACjB,IAAIopD,EAAMppD,EAAKltD,SAAS,IACpBs2G,EAAI95G,QAAU,IAChB85G,EAAO,IAAGA,KAEZ/3G,GAAU+3G,CAAG,IAER/3G,CAAM,EAMFw5C,GAAOA,OAeP0vF,GAAUA,CAAC7uH,EAAKqN,EAAMvqB,KACjC,MAAM40F,EAAQrqE,EAAKjQ,MAAM,KACzBs6E,EAAMzqD,QAAO,CAAC50B,EAAKpE,EAAGrO,IAChBA,IAAU8xF,EAAM9zF,OAAS,GAC3ByU,EAAIpE,GAAKnR,EACFuV,IAETA,EAAIpE,GAAK,CAAC,EACHoE,EAAIpE,KACV+L,EAAI,EAGI8uH,GAA0BC,IAA0C,IAAzC,KAAE1uH,EAAI,SAAE2uH,EAAQ,SAAE5qI,EAAW,OAAO2qI,EAC1E,MAAM5rI,EAASC,OAAOS,KAAKwc,EAAMjc,GAC3B6qI,EAAUD,EAAStqG,OAAOvhC,GAUhC,OATe6rI,EAASthH,SAASuhH,EAAS,CACxCn6G,MAAO7S,OACP4S,MAAO5S,OACPmE,MAAOnE,OACPoiB,UAAU,EACV6qG,QAAQ,EACRnlG,SAAS,EACTsY,QAAQ,GAEG,EAGR,SAAS8sF,GAAuBC,EAAOC,GAC5C,MAAM,KACJxrI,EAAI,GACJg/E,EAAE,OACF/lC,EAAM,eACNwyF,EAAc,UACdpxF,KACGqxF,GACD7R,GAAA,0BAAAA,CAAwB,CAC1Br9G,KAAM+uH,EACNJ,SAAQtR,GAAA,iBAEV,IAAI8R,EAAmB9R,GAAA,0BAAAA,CAAwB,CAC7Cr9G,KAAMy8B,EACN14C,SAAU,SACV4qI,SAAUK,IAKZ,OAHAG,EAAmB9R,GAAA,YAAAA,CAAU2R,EAAgBG,EAAgB9R,GAAA,wBAC7D8R,EAAmB9R,GAAA,sBAAAA,CAAoB2R,EAAgBG,GAEhD,CACL3rI,KAAM65H,GAAA,gBAAAA,CAAc75H,EAAKf,OACzB+/E,GAAI66C,GAAA,gBAAAA,CAAc76C,EAAG//E,OACrBg6C,OAAQ0yF,EACRF,eAAgBlsI,OAAOS,KAAKyrI,EAAgB,UAAUloI,SAAS,OAC/D82C,UAAW96C,OAAOS,KAAKq6C,EAAW,UAAU92C,SAAS,UAClDmoI,EAEP,CAWO,SAASE,GAAiBC,EAAUv0F,GAEzC,MAAQ,SADK/3C,OAAOS,KAAM,GAAE6rI,KAAYv0F,KAAY/zC,SAAS,WAE/D,CAyCA,SAAAw2H,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,oBAAA13E,EAAA,kBAAA4oF,IAAA,8BAAAlC,GAAA,oBAAAtpB,GAAA,uBAAAgc,EAAA,yBAAAqD,GAAA,sBAAA/xG,GAAA,sBAAAw4G,GAAA,yBAAAiE,GAAA,4BAAAC,GAAA,8BAAAvF,GAAA,qCAAAkG,GAAA,yBAAAc,GAAA,uBAAAl8H,GAAA,iCAAAu5H,GAAA,iCAAAL,GAAA,2BAAAI,GAAA,CAAAtO,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,gBCzbagR,GAAgBnS,GAAA,YAAS14F,KAAK5T,SAAQssG,GAAC,oBAGvC,YACXkS,GAAW,KACXruG,GAAI,QACJuuG,GAAO,sBACPC,GAAqB,qBACrBC,IACDtS,GAAA,iBAEYuS,GAAS,SAAC9oD,GAA8C,IAAnC/mE,EAAIO,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,wBACvC,IAAyE,IAArE,CAAC,uBAAwB,yBAAyBgB,QAAQvB,GAC5D,MAAM,IAAIzb,MAAM,0EAElB,MAAMqqI,EAAWtR,GAAA,iBAAct9G,GAC/B,IAAI8vH,EAAclB,EAAStqG,OAAOthC,OAAOS,KAAKsjF,EAAW,WACzD+oD,EAAclB,EAASthH,SAASwiH,EAAa,CAC3Cp7G,MAAO7S,OACP4S,MAAO5S,OACPmE,MAAOnE,OACPoiB,UAAU,EACV6qG,QAAQ,EACRnlG,SAAS,EACTsY,QAAQ,IAGV,IAAI8tF,EAAuBzS,GAAA,YAAAA,CAAUsR,EAAUkB,EAAWxS,GAAA,wBAE1D,OADAyS,EAAuBzS,GAAA,sBAAAA,CAAoBsR,EAAUmB,GAC9CA,CACT,EAEaC,GAA2BpiG,IACtC,MAAM,WACJqiG,EAAU,QACVC,EAAU,IACRtiG,EACEuiG,EAAiB,IAAKD,GAAW,IAIvC,OAHID,GACFE,EAAertH,KAAKmtH,GAEfE,EAAenyG,KAAK,GAAG,EAGnBoyG,GAAiB,WAAe,IAAdC,EAAI9vH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,GACpC,OAAK/Z,MAAMC,QAAQ4pI,IAAyB,IAAhBA,EAAK7sI,OAG1B6sI,EAAKrtF,QAAOpV,GAAoB,yBAAbA,EAAI6yE,OAC3Bp9E,KAAIuN,GAAK0sF,GAAA,SAAAA,CAAOA,GAAA,2BAAAA,CAAyB1sF,GAAI,0BAHvC,EAIX,EAEa0/F,GAAoB,WAAe,IAAdD,EAAI9vH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,GACvC,OAAK/Z,MAAMC,QAAQ4pI,IAAyB,IAAhBA,EAAK7sI,OAG1B6sI,EAAKrtF,QAAOpV,GAAoB,0BAAbA,EAAI6yE,OAC3Bp9E,KAAIuN,GAAK0sF,GAAA,SAAAA,CAAOA,GAAA,2BAAAA,CAAyB1sF,GAAI,2BAHvC,EAIX,EASay8F,GAAmBC,GAAe9mI,MAAMhE,UAAU6gC,IAAIjnB,KACjE,IAAIuC,WAAW2uH,IACfh5H,GAAO,IAAGA,EAAEtN,SAAS,MAAOgY,OAAO,KACnCgf,KAAK,IASMuyG,GAAmBlI,IAC9B,MAAM98G,EAAU+xG,GAAA,WAAQp9G,WAAWmoH,GACnC,IAAI/qB,EAAM,GAOV,OALEA,EADE/xF,EAAQ7oB,iBAAiBM,OACrBuoB,EAAQ7oB,MAAMsE,SAAS,OAGvBs2H,GAAA,mBAAAA,CAAiB/xG,EAAQ7oB,OAE1B46H,GAAA,SAAMsQ,iBAAiBtwB,EAAI,EAUvBkzB,GAAoBlJ,IAC/B,MAAMhqB,EAAMggB,GAAA,SAAMwP,iBAAiBxF,GACnC,OAAOhK,GAAA,WAAQl7H,OAAO,CACpBM,MAAOM,OAAOS,KAAK65G,EAAIr2G,QAAQ,KAAM,IAAK,QAC1C,EAUSwpI,GAA0BnJ,GAAOhK,GAAA,WAAQhwG,SAASgwG,GAAA,oBAAAA,CAAkBgK,IASpEoJ,GAAgB38G,IAC3B,MAAMxI,EAAU+xG,GAAA,WAAQp9G,WAAW6T,GACnC,IAAIupF,EAAM,GAOV,OALEA,EADE/xF,EAAQ7oB,iBAAiBM,OACrBuoB,EAAQ7oB,MAAMsE,SAAS,OAGvBs2H,GAAA,mBAAAA,CAAiB/xG,EAAQ7oB,OAE1B46G,CAAG,EAUCqzB,GAAiBrzB,GAAOggB,GAAA,QAAKl7H,OAAO,CAC/CM,MAAOM,OAAOS,KAAK65G,EAAIr2G,QAAQ,KAAM,IAAK,SAU/B2pI,GAAuBtzB,GAAOggB,GAAA,QAAKhwG,SAASgwG,GAAA,iBAAAA,CAAehgB,IAS3DuzB,GAAoBC,GAAMxT,GAAA,eAAYluG,OAAO0hH,GAAIpwF,SAYjDqwF,GAAiBA,CAACttI,EAAMg/E,EAAIv+B,EAAYxH,KACnD,MAAMs0F,EAAM,CACVvtI,KAAM65H,GAAA,oBAAAA,CAAkB75H,GACxBg/E,GAAI66C,GAAA,oBAAAA,CAAkB76C,GACtBv+B,aACAxH,UAEF,OAAO4gF,GAAA,eAAYl7H,OAAO4uI,EAAI,EAGhC,SAAAxT,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,sBAAA4S,GAAAxkD,GAAA,4BAAAykD,EAAA,2BAAAzB,GAAA,uBAAAn8H,GAAA,iCAAAu5H,GAAA,iCAAAL,GAAA,oBAAAqD,GAAA,sCAAAG,GAAA,qBAAAN,GAAA,8BAAArC,GAAA,mBAAA4D,GAAAliH,GAAA,+BAAAyhH,GAAA,kBAAArvG,GAAA,4BAAAwvG,GAAA,yBAAAnB,GAAA,CAAAlR,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,WAAAk3F,KAAA,IAAAE,EAAA5wH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,aAAApe,OAAAkrB,KAAA8jH,GAAAnuF,QAAA,SAAAlmB,GAAA,kBAAAA,GAAA,YAAAA,GAAA,cAAAA,GAAA,aAAAA,GAAA,sBAAAA,GAAA,eAAAA,GAAA,wBAAAA,GAAA,kBAAAA,CAAA,IAAA+P,QAAA,SAAAukG,EAAAt0G,GAAA,OAAAs0G,EAAAt0G,GAAAq0G,EAAAr0G,GAAAs0G,CAAA,4BAAAxS,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,gBCtLA,SAAS4S,GAAQC,GACf,OAAIA,aAAiBtuI,QAAUsuI,aAAiB3yH,WACtB,MAAjB2yH,EAAM9tI,UAOb,uBAAuBkqB,KAAK4jH,KACzB,uBAAuB5jH,KAAK4jH,GAKnC,CAMA,SAASC,GAAejuH,GACtB,GAAIA,GAAa,IAAMA,GAAa,GAElC,OAAOA,EAAY,GAGrB,GAAIA,GAAa,IAAMA,GAAa,GAElC,OAAOA,EAAY,GAGrB,GAAIA,GAAa,IAAMA,GAAa,IAElC,OAAOA,EAAY,GAGrB,MAAM,IAAI/e,MAAM,gBAClB,CAOO,SAASitI,GAAUF,EAAOv9G,GAC/B,IAAKupG,GAAA,UAAAA,CAAQgU,GACX,MAAM,IAAI/sI,MAAM,iBAElB,IAAK,IAAI+B,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAE9B,MAAMmrI,GAAWjvH,SAASuR,EAAKtR,OAAOnc,EAAG,GAAI,KAAO,GAChDkc,SAASuR,EAAKtR,OAAOnc,EAAI,EAAG,GAAI,IAChC,KAME6b,EAAS,GAAKsvH,EAAS,EAE7B,IALanU,GAAA,iBAAAA,CACXgU,EAAM5rI,WAAW4rI,EAAM9tI,OAAS,EAAI4C,KAAKylB,MAAM4lH,EAAS,KAI9CtvH,KAAYA,EACtB,OAAO,CAEX,CACA,OAAO,CACT,CAOO,SAASuvH,GAAeJ,EAAOK,GACpC,OAAOrU,GAAA,YAAAA,CAAUt6H,OAAOS,KAAK6tI,EAAO,UAAUtqI,SAAS,OAAQs2H,GAAA,SAAAA,CAAOqU,GACxE,CAEO,SAASC,GAAiBN,EAAOO,GACtC,OAAOvU,GAAA,YAAAA,CAAUt6H,OAAOS,KAAK6tI,EAAO,UAAUtqI,SAAS,OAAQs2H,GAAA,SAAAA,CAAOt6H,OAAOS,KAAKouI,EAAS,WAC7F,CAEO,SAASC,GAAiBR,EAAOjJ,GACtC,MAAM0J,EAAiBzU,GAAA,WAAQluG,OAAOkuG,GAAA,0BAAAA,CAAwB+K,IAAU3nF,SACxE,OAAO48E,GAAA,YAAAA,CAAUt6H,OAAOS,KAAK6tI,EAAO,UAAUtqI,SAAS,OAAQs2H,GAAA,SAAAA,CAAOyU,GACxE,CAAC,SAAAvU,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,qBAAAgT,GAAA,4BAAAE,GAAA,uBAAAC,GAAA,oBAAA7qF,EAAA,qBAAA+oF,GAAA,qCAAAe,GAAA,CAAAnS,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,gBC3Fc,MAAMuT,GACnBvvI,YAAWksI,GAOR,IAPS,KACV3yH,EAAI,KACJI,EAAI,OACJy0B,EAAS,MAAK,OACd6L,EAAS,GAAE,eACXmsF,EAAiB,GAAE,gBACnBC,EAAkB,MACnB6F,EACC7pI,KAAKkX,KAAOA,EACZlX,KAAKsX,KAAOA,EACZtX,KAAKmtI,cAAgBphG,EACrB/rC,KAAK43C,OAASA,EACd53C,KAAK+jI,eAAiBA,EACtB/jI,KAAKgkI,gBAAkBA,EACvBhkI,KAAKotI,eAAiB,KACtBptI,KAAKouE,IAAMpuE,KAAKouE,IAAI/4C,KAAKr1B,KAC3B,CAEAqtI,YAAY/6G,GACV,OAAKtyB,KAAK+jI,gBAAiD,IAA/B/jI,KAAK+jI,eAAerlI,OAIzC4zB,EAAKiM,KAAI,CAAC//B,EAAKkC,KACpB,MAAM4+E,EAAYt/E,KAAK+jI,eAAerjI,GACtC,OAAO4+E,EAAYA,EAAU9gF,GAAOA,CAAG,IALhC8zB,CAOX,CAEAg7G,kBAAkBC,GAChBvtI,KAAKotI,eAAiBG,CACxB,CAEAC,aAAav4F,GACX,OAAOj1C,KAAKgkI,iBAAmB/uF,EAC3Bj1C,KAAKgkI,gBAAgB/uF,GACrBA,CACN,CAEAw4F,2BAA2Bn7G,GACzB,GAAIA,EAAK5zB,OAASsB,KAAK43C,OAAOl5C,OAC5B,MAAM,IAAIe,MAAO,uCAAsCO,KAAKsX,QAE9D,MAAM29B,EAAS,CACblJ,OAAQ/rC,KAAKsX,KACb61H,cAAentI,KAAKmtI,cACpBO,QAAQ,EACRztF,SAAQu4E,GAAA,QACR5gF,OAAQ,CAAC,GAkBX,OAhBA53C,KAAKqtI,YAAY/6G,GAAM4U,SAAQ,CAAC1oC,EAAKkC,KAC/BA,EAAQV,KAAK43C,OAAOl5C,OAAS,GAE3B85H,GAAA,aAAAA,CAAWh6H,KAEby2C,EAAOgL,SAAWzhD,EAClBy2C,EAAOy4F,QAAS,GAEdlV,GAAA,YAAAA,CAAUh6H,GAAK0hD,QACjBjL,EAAOy4F,OAASlvI,EAAI0hD,OAItBjL,EAAO2C,OAAO53C,KAAK43C,OAAOl3C,IAAUlC,CACtC,IAEKy2C,CACT,CAEAm5B,MAAa,QAAAptC,EAAAvlB,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAs/B,GAAAyiB,EAAA,EAAAA,EAAAziB,EAAAyiB,IAAJnxB,EAAImxB,GAAAhoC,UAAAgoC,GACT,MAAMkqF,EAAU3tI,KAAKytI,2BAA2Bn7G,GAChD,OAAIq7G,EAAQD,OACH1tI,KAAKwtI,aAAaxtI,KAAKotI,eAAephD,KAAK2hD,IAE7C3tI,KAAKotI,eACTQ,UAAUD,GACVxjG,MAAK8K,IACJ04F,EAAQ1tF,SAAS,KAAMjgD,KAAKwtI,aAAav4F,IAClCj1C,KAAKwtI,aAAav4F,MAE1B8gB,OAAM3iC,IAEL,MADAu6G,EAAQ1tF,SAAS7sB,GACXA,CAAG,GAEf,EACD,SAAAslG,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,kBAAAt/E,GAAA,wBAAArT,GAAA,uBAAAX,GAAA,CAAAuzF,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UAtFoBmT,GAAW,SAAAlT,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAXwtH,GAAWh2H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,IAAA,aAAAA,KAAA18H,OAAA48H,aAAXiT,MAAWlT,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,KCJhC,MAAMuU,GAAiB1yH,IACrB,GAAoB,IAAhBA,EAAKzc,OAAc,MAAM,IAAIK,UAAU,oBAE1Bb,OAAO4hB,QAAQ3E,EAAK,GAAIA,EAAK,IAC/B,GACbA,EAAKu+B,UAGP,IAAIz7C,EAASC,OAAO6hB,OAAO5E,GAE3B,OADAld,EAASC,OAAOS,KAAK65H,GAAA,SAAAA,CAAOv6H,GAAS,OAC9BA,CAAM,EAGT6vI,GAAqB3yH,IACzB,GAAoB,IAAhBA,EAAKzc,OACP,OAAO,KAGLyc,EAAKzc,OAAS,GAAM,GAAKyc,EAAK6C,KAAK7C,EAAKA,EAAKzc,OAAS,IAC1D,IAAIqvI,EAAY5yH,EAAKzc,OAAS,EAC1BsvI,EAAW,EACXxsI,EAAI,EACR,KAAOA,EAAI2Z,EAAKzc,OAAS,GAAG,CAC1B,MAAMmD,EAAOsZ,EAAK3Z,KACZM,EAAQqZ,EAAK3Z,KACnB2Z,EAAK6C,KAAKw6G,GAAA,iBAAAA,CAAe,CAAC32H,EAAMC,OAC1BksI,IAAaD,IAEbA,EAAY,GAAM,GAAmB,IAAdA,IACzBA,IACA5yH,EAAK6C,KAAK7C,EAAKA,EAAKzc,OAAS,KAG/BqvI,GAAa,EACbC,EAAW,EAEf,CACA,OAAO7yH,CAAI,EAGP8yH,GAAqBA,CAACC,EAAUC,EAAW34D,KAC/C,IAAI90E,EAAQwtI,EACZ,GAAoB,IAAhB14D,EAAK92E,QAAgBgC,GAASytI,EAAW,OAAO,KAEpD,IAAIC,EAAa,EACbC,EAAWF,EACf,MAAMhmH,EAAO,GACb,KAAOznB,EAAQ80E,EAAK92E,OAAS,GAAG,CAC9B,MAAM4vI,EAAW5tI,EAAQ,GAAM,EAAIA,EAAQ,EAAIA,EAAQ,EACvDynB,EAAKnK,KAAKw3D,EAAK84D,IACfD,EAAWA,EAAW,GAAM,EAAIA,EAAWA,EAAW,EACtD,MAAMj8H,EAAQ9Q,KAAKylB,OAAOrmB,EAAQ0tI,GAAc,GAChDA,GAAcC,EACd3tI,EAAQ0tI,EAAah8H,EACrBi8H,GAAY,CACd,CACA,OAAOlmH,CAAI,EAGAomH,GAAcpzH,IACzB,MAAMqzH,EAAahW,GAAA,qBAAAA,CAAmBr9G,GACtC,OAAOqzH,EAAWA,EAAW9vI,OAAS,EAAE,EAG7B+vI,GAAgBA,CAAC/tI,EAAOya,KACnC,MAAMgzH,EAAYhzH,EAAKzc,OACjB8vI,EAAahW,GAAA,qBAAAA,CAAmBr9G,GACtC,OAAOq9G,GAAA,qBAAAA,CAAmB93H,EAAOytI,EAAWK,EAAW,EAG5C1gH,GAAO7vB,GAAUC,OAAOS,KAAK65H,GAAA,SAAAA,CAAOv6H,GAAS,OAAO,SAAAy6H,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,oBAAA13E,EAAA,4BAAAgsF,GAAA,gCAAAC,GAAA,gCAAAG,GAAA,CAAAzU,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,gaCxEjE,MAAM+U,GAAmBC,oBAAQ,KAE3BC,GAAS79H,GAAQ9P,IACrB,IAAIzB,EACJ,GAAwB,OAApByB,EAAIiZ,MAAM,EAAG,GAAa,CAC5B1a,EAAM,GACN,IAAK,IAAIgC,EAAI,EAAGuM,EAAI9M,EAAIvC,OAAQ8C,EAAIuM,EAAGvM,GAAK,EAC1ChC,EAAIwe,KAAKN,SAASzc,EAAIiZ,MAAM1Y,EAAGA,EAAI,GAAI,KAEzChC,EAAMtB,OAAOS,KAAKa,EACpB,MACEA,EAAMyB,EAGR,MAAQ,KADSu3H,GAAA,mBAAAA,CAAkB,SAAQznH,KACtBsqB,OAAO77B,GAAKi9B,OAAO,QAAQ,EAGrCoyG,GAAYrW,GAAA,SAAAA,CAAO,KAGM,SAAAE,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,cAFbi4H,GAAA,SAAAA,CAAO,KACNA,GAAA,SAAAA,CAAO,KACPA,GAAA,SAAAA,CAAO,KAAK,IAAAG,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,8BAAAmV,GAAA,oBAAAE,GAAA,CAAApV,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,UCVhCmV,GAAY,CAChB,cAAe,CACb32F,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,EACJhkC,KAAM,MACN4I,KAAM,SAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,EACJhkC,KAAM,MACN4I,KAAM,SAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,EACJhkC,KAAM,MACN4I,KAAM,SAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAGR6zH,OAAQ,CACN52F,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAGR8zH,OAAQ,CACN72F,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAGR+zH,OAAQ,CACN92F,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,eAAgB,CACdi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,OACN4I,KAAM,UAGR,eAAgB,CACdi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,OACN4I,KAAM,UAGR,eAAgB,CACdi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,OACN4I,KAAM,UAGR,eAAgB,CACdi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,OACN4I,KAAM,UAGR,eAAgB,CACdi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,OACN4I,KAAM,UAGR,eAAgB,CACdi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,OACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,UAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,QAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,QAGR,cAAe,CACbi9B,OAAQ,MACR75C,IAAK,IACLg4C,GAAI,GACJhkC,KAAM,MACN4I,KAAM,SAKJg0H,GAAiB,CACrBC,MAAO,GACP3/H,EAAG,KACHzO,EAAG,EACHgO,EAAG,EACHopC,OAAQ,eAYH,SAASi3F,GAAWvF,EAOzB5zF,GAEA,IARA,SACEm0E,EAAQ,WACRzxE,EAAU,SACV02F,EAAW,GAAE,QACb9L,EAAU,IACXsG,EAEDyF,EAAM7zH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAA+8G,GAAA,kBAEN,MAAM+W,EAAM,IACV/W,GAAA,qBACG8W,IAEC,OAAEn3F,EAAS,eAAkBo3F,EAC7BC,EAAc,MAAM5mH,KAAKuvB,GAAU,GAAK,GACxCjC,EAAOsiF,GAAA,cAAAA,CAAY,IACnBiX,GAAYjX,GAAA,aAAUrgF,EAAOt8B,gBAAkB,CAAC,GAAGy6B,GACnDA,EAAKkiF,GAAA,cAAAA,MAAyBp5H,IAAbqwI,EAAyB,GAAKA,GAC/C58E,EAAa2lE,GAAA,SAAAA,CACjBt6H,OAAOS,KAAKs3C,EAAU,QACtBC,EACAq5F,EAAI//H,EACJ+/H,EAAIxuI,EACJwuI,EAAIxgI,EACJwgI,EAAIJ,OAEAO,EAAmBlX,GAAA,iBAAAA,CAAergF,EAAQ0a,EAAW34C,MAAM,EAAGs1H,GAAcl5F,GAC5Eq5F,EAAsBzxI,OAAO6hB,OAAO,CACxC2vH,EAAiBr0G,OAAOn9B,OAAOS,KAAKg6C,EAAY,QAChD+2F,EAAiB1yG,UAEb4yG,EAAiBpX,GAAA,iBAAAA,CAAergF,EAAQ0a,EAAW34C,MAAM,EAAGs1H,GAAcl5F,GAC1Eu5F,EAAoB3xI,OAAO6hB,OAAO,CACtC6vH,EAAev0G,OAAOn9B,OAAOS,KAAKyrH,EAAU,SAC5CwlB,EAAe5yG,UAEX8yG,EAAS5xI,OAAO6hB,OAAO,CAAC8yC,EAAW34C,MAAM,IAAKy1H,IAC9CI,EAAMvX,GAAA,YAAAA,CAAUsX,GAAQ3tI,QAAQ,KAAM,IAC5C,MAAO,CACL6gC,QAAS,EACT9nB,KAAM,OACNm0H,WACA9L,UACAtsG,OAAQ,CACNkhB,SACA8tC,WAAY0pD,EAAoBztI,SAAS,OACzC8tI,aAAc,CACZ15F,GAAIA,EAAGp0C,SAAS,QAElB2tI,kBAAmBA,EAAkB3tI,SAAS,OAC9CslF,IAAK,SACLyoD,UAAW,CACTlvI,EAAGwuI,EAAIxuI,EACPyO,EAAG+/H,EAAI//H,EACPT,EAAGwgI,EAAIxgI,EACPogI,MAAOI,EAAIJ,MACXj5F,KAAMA,EAAKh0C,SAAS,QAEtB6tI,OAGN,CAUO,SAASG,GAAcC,EAM5Bl6F,GACA,IANA,OACEhf,EAAM,SACNo4G,EAAW,GAAE,QACb9L,EAAU,IACX4M,EAGG1wH,EAAQ,KACRw1B,EAAS,KACb,MAAM,UACJg7F,EAAS,IACTF,EAAG,aACHC,EAAY,kBACZH,EAAoB,GAAE,WACtB5pD,EAAU,OACV9tC,EAAS,eACPlhB,EACEu4G,EAAc,MAAM5mH,KAAKuvB,GAAU,GAAK,GACxC7B,EAAKp4C,OAAOS,KAAKqxI,EAAa15F,GAAI,OAClCuc,EAAa2lE,GAAA,SAAAA,CACjBt6H,OAAOS,KAAKs3C,GACZ/3C,OAAOS,KAAKsxI,EAAU/5F,KAAM,OAC5B+5F,EAAUzgI,EACVygI,EAAUlvI,EACVkvI,EAAUlhI,EACVkhI,EAAUd,OAASc,EAAUv2D,OAEzBo2D,EAAS5xI,OAAO6hB,OAAO,CAAC8yC,EAAW34C,MAAM,IAAKhc,OAAOS,KAAKsnF,EAAY,SAE5E,GADmBuyC,GAAA,YAAAA,CAAUsX,GAAQ3tI,QAAQ,KAAM,MAChC4tI,EAoBjB,MADAtwH,EAAQ,IAAK+4G,GAAA,oBAAiBqO,kBACxBpnH,EApBgB,CACtB,MAAM2wH,EAAqB5X,GAAA,mBAAAA,CAAiBrgF,EAAQ0a,EAAW34C,MAAM,EAAGs1H,GAAcl5F,GAChFqC,EAAaz6C,OAAO6hB,OAAO,CAC/BqwH,EAAmB/0G,OAAOn9B,OAAOS,KAAKsnF,EAAY,QAClDmqD,EAAmBpzG,UAClB96B,SAAS,OAENmuI,EAAmB7X,GAAA,mBAAAA,CAAiBrgF,EAAQ0a,EAAW34C,MAAM,EAAGs1H,GAAcl5F,GAKpFrB,EAAS,CACPo6F,WACA9L,UACAnZ,SAPelsH,OAAO6hB,OAAO,CAC7BswH,EAAiBh1G,OAAOn9B,OAAOS,KAAKkxI,EAAmB,QACvDQ,EAAiBrzG,UAChB96B,SAAS,QAKVy2C,aAEJ,CAKA,OAAO1D,CACT,CAUO,MAAMq7F,GAAgBA,CAC3BC,EACAt6F,KAEA,IAEE,QADeuiF,GAAA,iBAAAA,CAAe+X,EAAet6F,GAC7B0C,UAClB,CAAE,MAAOp4C,GACP,OAAO,CACT,GACA,SAAAm4H,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,4BAAA2V,GAAA,yBAAA53G,KAAA,uBAAAw3G,GAAA,oBAAAxqB,KAAA,4BAAA39D,GAAAA,eAAA,uBAAAkoF,GAAA,8BAAAt2F,GAAAA,iBAAA,8BAAAquF,GAAA,4BAAAsJ,GAAA,CAAA1W,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,gBCtXI6W,GAAa,IAAIhY,GAAA,YAAW,IAAC,aAiB7BiY,GAAaA,CAACp4H,EAAO49B,IAAauiF,GAAA,OAAIjlD,QAAQl7D,EAAO49B,GAAU/zC,WAgB/DwuI,GAAaA,CAACr4H,EAAO49B,IAAauiF,GAAA,OAAIzgF,QAAQ1/B,EAAO49B,GAAU/zC,SAAQs2H,GAAC,YAaxEmY,GAAuBC,IAC3B,MAAMC,EAAgBD,EAAOtmH,SACvBwmH,EAAgB5yI,OAAOS,KAAK65H,GAAA,SAAAA,CAAOqY,GAAgB,OACnD5hH,EAAOupG,GAAA,SAAAA,CAAOsY,GAAe52H,MAAM,EAAG,IAC5C,OAAOs+G,GAAA,mBAAAA,CAAiBvpG,EAAK,EAGzB8hH,GAAa,SAAC71H,EAAMtd,GAA+C,IAQnEozI,EAR2BC,EAASx1H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,qBAIvC2uG,EAAW,GACX8mB,EAAW,GACXC,EAAc,GACd92C,EAAU,GAEd,OAAQn/E,GACN,IAAK,kBACHkvG,EAAWoO,GAAA,SAAMvN,mBACjBimB,EAAW1Y,GAAA,SAAM7N,mBAAmBP,GAAUloH,SAAS,OACvD8uI,EAAWxY,GAAA,SAAMnyB,eAAe6qC,GAChCC,EAAcH,EAAS5zC,OAAO6zC,GAC9B52C,EAAUm+B,GAAA,cAAWl+B,eAAe62C,EAAYx4F,YAChD,MACF,IAAK,sBACHyxE,EAAWxsH,EACXszI,EAAW1Y,GAAA,SAAM7N,mBAAmBP,GAAUloH,SAAS,OACvD8uI,EAAWxY,GAAA,SAAMnyB,eAAe6qC,GAChCC,EAAcH,EAAS5zC,OAAO6zC,GAC9B52C,EAAUm+B,GAAA,cAAWl+B,eAAe62C,EAAYx4F,YAChD,MACF,IAAK,wBAED0hD,EADmB,iBAAVz8F,EACC46H,GAAA,cAAWl+B,eAAek+B,GAAA,UAAAA,CAAQ56H,EAAO,GAAI,MAE7C46H,GAAA,cAAWl+B,eAAe18F,GAEtC,MACF,QACE,MAAM,IAAI6B,MAAM,sBAQpB,MAAMk5C,EAAa0hD,EAAQiB,aAAap5F,SAAS,GAAI,IAC/C8iG,EAAY3K,EAAQyB,YAE1B,MAAO,CACLsuB,WACA6mB,YACAE,cACA92C,UACA1hD,aACA4qF,QAPc/K,GAAA,uBAAAA,CAAqBxzB,GASvC,EAQMosC,GAAeA,CAACC,EAAeh3C,KACnC,MAAM1hD,EAAa0hD,EAAQiB,WAAW,OAChCg2C,EAAU9Y,GAAA,SAAAA,CAAO6Y,GACjBhwB,EAASmX,GAAA,cAAWlxE,KAAKppD,OAAOS,KAAK2yI,EAAS,OAAQ34F,EAAY,MAAO,CAC7EijD,WAAW,IAEP4c,EAAM,CACV6I,EAAOtgH,EAAEmB,SAAS,MAAO,IACzBm/G,EAAO5yG,EAAEvM,SAAS,MAAO,IACxB,IAAGm/G,EAAO1lB,cAAcz5F,cACzBg3B,KAAK,IACP,OAAOh7B,OAAOS,KAAK65G,EAAK,MAAM,EAsB1B+4B,GAAkB,eAACN,EAASx1H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,qBAAuB,OAAK+8G,GAAA,aAAAA,CAAW,kBAAmB,GAAIyY,EAAU,EAcvGO,GAAsB,SAACpnB,GAAkD,IAAxC6mB,EAASx1H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,qBACjD,QAAI+8G,GAAA,SAAMrN,iBAAiBf,IAClBoO,GAAA,aAAAA,CAAW,sBAAuBpO,EAAU6mB,EAGvD,EAaMQ,GAAwB94F,GAAc6/E,GAAA,aAAAA,CAAW,wBAAyB7/E,GAmB1E+4F,GAAkBA,CAACC,EAAQt3C,KAC/B,IAAI,OAAEziD,GAAW+5F,EACK,IAAlB/5F,EAAOl5C,SACTk5C,EAAS,MAMX,MAAMg6F,EAAMpZ,GAAA,eAAYluG,OAAOqnH,GAAQ/1F,SACjCijD,EAAM25B,GAAA,eAAAA,CAAaoZ,EAAKv3C,GAC9B,MAAO,IACFs3C,EACH/5F,SACAoB,UAAW6lD,EACZ,EAoBGv3C,GAAOA,CAACuqF,EAAWx3C,KACvB,MAAMg3C,EAAgBnzI,OAAOS,KAAKkzI,EAAU1vI,QAAQ,KAAM,IAAK,OAC/D,OAAOq2H,GAAA,eAAAA,CAAa6Y,EAAeh3C,EAAQ,EAC3C,IAAAy3C,GAEa,CACbrtC,MAAK+zB,GAAA,SACLuZ,MAAKvZ,GAAA,SACLlxE,KAAIkxE,GAAA,QACJkZ,gBAAelZ,GAAA,mBACf+Y,gBAAe/Y,GAAA,mBACfgZ,oBAAmBhZ,GAAA,uBACnBiZ,sBAAqBjZ,GAAA,yBACrBmY,qBAAoBnY,GAAA,wBACpBgY,WAAUhY,GAAA,cACViY,WAAUjY,GAAA,cACVkY,WAAUlY,GAAA,cACVwZ,SAAQxZ,GAAA,aACT,qBAAAE,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,sBAAAx2F,KAAA,iBAAAsoB,KAAA,qBAAA4mF,KAAA,oBAAApwF,EAAA,8BAAAinF,GAAA,mBAAAqD,GAAA4F,IAAA,mBAAAttC,KAAA,wBAAA+rC,GAAA,qBAAA9H,GAAA,kCAAAiI,GAAA,wBAAAI,GAAA,yBAAArG,GAAA,0BAAA0G,GAAA,kBAAA9pF,GAAA,6BAAAoqF,GAAA,6BAAAH,GAAA,iCAAAC,GAAA,mCAAAC,GAAA,wBAAAhB,GAAA,wBAAAC,GAAA,sBAAAvE,GAAA6F,GAAA,CAAAxY,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UAAA+X,GAAA,SAAA9X,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAAoyH,GAAA56H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,aAAAouI,KAAA,IAAAE,EAAA5wH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,aAAApe,OAAAkrB,KAAA8jH,GAAAnuF,QAAA,SAAAlmB,GAAA,kBAAAA,GAAA,YAAAA,GAAA,cAAAA,GAAA,aAAAA,GAAA,sBAAAA,GAAA,eAAAA,GAAA,wBAAAA,GAAA,kBAAAA,CAAA,IAAA+P,QAAA,SAAAukG,EAAAt0G,GAAA,OAAAs0G,EAAAt0G,GAAAq0G,EAAAr0G,GAAAs0G,CAAA,kBAAAvS,IAAA,aAAAA,KAAA18H,OAAA48H,aAAA6X,MAAA9X,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,KCtPc,MAAM4Y,GACnBv0I,YAAYw0I,EAAOpmG,EAAQqmG,EAAiBC,GAC1CryI,KAAKsyI,OAASH,EACdnyI,KAAKuyI,QAAUxmG,EACf,MAAM,oBAAEsT,EAAmB,qBAAEC,GAAyBvT,EACtD/rC,KAAKwyI,WAAanzF,EAClBr/C,KAAKyyI,YAAcnzF,EACnBt/C,KAAK0yI,MAAQ3mG,EAAO70B,KACpBlX,KAAK2yI,iBAAmBP,EACxBpyI,KAAK4yI,QAAUP,EAEfryI,KAAKukI,gBAAkBvkI,KAAKukI,gBAAgBlvG,KAAKr1B,MACjDA,KAAK6yI,kBAAoB7yI,KAAK6yI,kBAAkBx9G,KAAKr1B,MACrDA,KAAK8yI,UAAY9yI,KAAK8yI,UAAUz9G,KAAKr1B,MACrCA,KAAK+yI,aAAe/yI,KAAK+yI,aAAa19G,KAAKr1B,MAC3CA,KAAKgzI,qBAAuBhzI,KAAKgzI,qBAAqB39G,KAAKr1B,MAC3DA,KAAKouE,IAAMpuE,KAAKouE,IAAI/4C,KAAKr1B,MACzBA,KAAKsqF,QAAUtqF,KAAKsqF,QAAQj1D,KAAKr1B,MACjCA,KAAK0kI,aAAe1kI,KAAK0kI,aAAarvG,KAAKr1B,MAC3CA,KAAKizI,YAAcjzI,KAAKizI,YAAY59G,KAAKr1B,MACzCA,KAAKkzI,SAAWlzI,KAAKkzI,SAAS79G,KAAKr1B,KACrC,CAEA8yI,UAAUz6H,GACR,IAAKA,EACH,OAAO,KAET,IAAIu/B,EAAS4gF,GAAA,sBAAAA,CAAoBx4H,KAAKwyI,WAAYn6H,GAClDu/B,EAAS4gF,GAAA,YAAAA,CAAUx4H,KAAKwyI,WAAY56F,EAAM4gF,GAAA,uBAC1C,MAAM/xG,EAAUzmB,KAAKwyI,WAAWp3H,WAAWw8B,GAC3C,OAAO53C,KAAKwyI,WAAWloH,OAAO7D,GAASm1B,QACzC,CAEAi3F,kBAAkBM,GAChB,IAAKA,EACH,OAAO,KAET,MAAMl+F,EAASujF,GAAA,0BAAAA,CAAwB,CACrCr9G,KAAMg4H,EACNrJ,SAAU9pI,KAAKwyI,aAEjB,IAAI56F,EAAS4gF,GAAA,YAAAA,CAAUx4H,KAAKwyI,WAAYv9F,EAAMujF,GAAA,wBAE9C,OADA5gF,EAAS4gF,GAAA,sBAAAA,CAAoBx4H,KAAKwyI,WAAY56F,GACvCA,CACT,CAEAm7F,aAAaz6H,GACX,IAAKA,EACH,OAAO,KAET,IAAI28B,EAASujF,GAAA,0BAAAA,CAAwB,CACnCr9G,KAAM7C,EACNwxH,SAAU9pI,KAAKyyI,cAIjB,OAFAx9F,EAASujF,GAAA,YAAAA,CAAUx4H,KAAKyyI,YAAax9F,EAAMujF,GAAA,wBAC3CvjF,EAASujF,GAAA,sBAAAA,CAAoBx4H,KAAKyyI,YAAax9F,GACxCA,CACT,CAEAm+F,WAAWn+F,GACT,IAAKA,EACH,OAAO,KAET,IAAI2C,EAAS4gF,GAAA,sBAAAA,CAAoBx4H,KAAKyyI,YAAax9F,GAEnD2C,EAAS4gF,GAAA,YAAAA,CAAUx4H,KAAKyyI,YAAa76F,EAAM4gF,GAAA,uBAE3C,MAAM/xG,EAAUzmB,KAAKyyI,YAAYr3H,WAAWw8B,GAC5C,OAAO53C,KAAKyyI,YAAYnoH,OAAO7D,GAASm1B,QAC1C,CAEAy3F,kBAAkBC,EAAQrkH,EAAMskH,GAC9B,MAAMrJ,EAAQlqI,KAAKkzI,SAASI,EAAQrkH,EAAMskH,GAE1C,IAAIvH,EAAKxT,GAAA,UAAOkZ,gBAAgBxH,EAAOlqI,KAAK4yI,QAAQv4C,SAKpD,OAHA2xC,EAAKxT,GAAA,eAAYluG,OAAO0hH,GAAIpwF,SAGxBowF,aAAc9tI,OACT8tI,EAAG9pI,SAAS,OAEds2H,GAAA,kBAAAA,CAAgBwT,EACzB,CAEAwH,uBAAuBlhH,GACrB,MAAMmhH,EAAanhH,EAAK4rB,QACtB1/C,IAAQg6H,GAAA,aAAAA,CAAWh6H,KAASg6H,GAAA,YAAAA,CAAUh6H,GAAK0hD,QAEvCqzF,EAAUvzI,KAAK8yI,UAAUW,EAAW,IAE1C,OAAOzzI,KAAKsyI,OAAO1O,iBAAiBz5F,MAAKyhD,IACvC,MAAM,gBAAE8nD,EAAe,cAAEC,GAAkB/nD,EAC3C,OAAO5rF,KAAKqzI,kBAAkBK,EAAiBC,EAAeJ,EAAQ,GAE1E,CAEAK,kBAAkBthH,GAChB,MAAMmhH,EAAanhH,EAAK4rB,QACtB1/C,IAAQg6H,GAAA,aAAAA,CAAWh6H,KAASg6H,GAAA,YAAAA,CAAUh6H,EAAI0hD,QAEtCqzF,EAAUvzI,KAAK8yI,UAAUW,EAAW,KAEpC,gBAAEC,EAAe,cAAEC,GAAkB3zI,KAAKsyI,OAAO1O,eAAe,CACpE1jF,MAAM,IAGR,OAAOlgD,KAAKqzI,kBAAkBK,EAAiBC,EAAeJ,EAChE,CAEAM,+BAA+BvhH,GAC7B,MAAMmhH,EAAanhH,EAAK4rB,QACtB1/C,IAAQg6H,GAAA,aAAAA,CAAWh6H,KAASg6H,GAAA,YAAAA,CAAUh6H,EAAI0hD,QAEtCqzF,EAAUvzI,KAAK8yI,UAAUW,EAAW,KAEpC,OAAEH,EAAM,KAAErkH,GAASwkH,EAAW,GAEpC,OAAOzzI,KAAKqzI,kBAAkBC,EAAQrkH,EAAMskH,EAC9C,CAEAhP,kBAAyB,QAAAvjG,EAAAvlB,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAs/B,GAAAyiB,EAAA,EAAAA,EAAAziB,EAAAyiB,IAAJnxB,EAAImxB,GAAAhoC,UAAAgoC,GACrB,MAAMqwF,EAAa9zI,KAAKytI,2BAA2Bn7G,GACnD,GAAIwhH,EAAWpG,OAAQ,CACrB,MAAM30F,EAAa/4C,KAAK4zI,kBAAkBthH,GAC1C,OAAOtyB,KAAKsyI,OAAO/N,gBAAgBxrF,EAAY,CAC7CmH,MAAM,GAEV,CAEA,OAAOlgD,KAAKwzI,uBAAuBlhH,GAAM6X,MAAK4O,GACrC/4C,KAAKsyI,OAAO/N,gBAAgBxrF,EAAY+6F,EAAW7zF,WAE9D,CAEAykF,eAAsB,QAAA/tE,EAAAl7C,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAi1D,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJtkC,EAAIskC,GAAAn7C,UAAAm7C,GAClB,MAAMk9E,EAAa9zI,KAAKytI,2BAA2Bn7G,GACnD,GAAIwhH,EAAWpG,OAAQ,CACrB,MAAM30F,EAAa/4C,KAAK4zI,kBAAkBthH,GAC1C,OAAOtyB,KAAK+yI,aACV/yI,KAAKsyI,OAAO5N,aAAa3rF,EAAY,CACnCmH,MAAM,IAGZ,CAEA,OAAOlgD,KAAKwzI,uBAAuBlhH,GAAM6X,MAAK4O,GACrC/4C,KAAKsyI,OACT5N,aAAa3rF,GAAY,CAACt5B,EAAOw1B,KAChC6+F,EAAW7zF,SAASxgC,EAAOzf,KAAK+yI,aAAa99F,GAAQ,IAEtD9K,KAAKnqC,KAAK+yI,eAEjB,CAEAtF,2BAA2Bn7G,GACzB,MAAM2iB,EAAS,CACbgL,SAAQu4E,GAAA,QACRkV,QAAQ,GAEV,OAAoB,IAAhBp7G,EAAK5zB,SAIL85H,GAAA,aAAAA,CAAWlmG,EAAKA,EAAK5zB,OAAS,MAChCu2C,EAAOgL,SAAW3tB,EAAKA,EAAK5zB,OAAS,IAEvC4zB,EAAK4U,SAAQ1oC,IACPg6H,GAAA,YAAAA,CAAUh6H,GAAK0hD,QACjBjL,EAAOy4F,OAASlvI,EAAI0hD,KACtB,KAROjL,CAWX,CAGAg+F,cAAqB,QAAAn8E,EAAAr7C,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAo1D,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJzkC,EAAIykC,GAAAt7C,UAAAs7C,GACjB,MAAM08E,EAAanhH,EAAK4rB,QACtB1/C,IAAQg6H,GAAA,aAAAA,CAAWh6H,KAASg6H,GAAA,YAAAA,CAAUh6H,EAAI0hD,QAG5C,GAAIuzF,EAAW,GAAI,CACjB,MAAM,OAAEH,EAAM,KAAErkH,GAASwkH,EAAW,GACpC,GAAIxkH,GAAQqkH,EACV,OAAOtzI,KAAK6zI,+BAA+BvhH,GAE7C,MAAM7yB,MAAM,mDACd,CAEA,OAAOO,KAAK4zI,kBAAkBthH,EAChC,CAEA4gH,SAASa,EAAkBC,EAAgBC,GACzC,MAAM/J,EAAQ1R,GAAA,iBAAAA,CACZx4H,KAAK4yI,QAAQrP,QACbvjI,KAAK2yI,iBACL3yI,KAAK0yI,MACLuB,GAGF/J,EAAMgK,eAAiBH,EACvB,MAAMI,EAAYH,EAAensG,MAAM,OACnCmsG,EAAe9qH,UAAU,GACzB8qH,EAEJ,OADA9J,EAAME,eAAiBlsI,OAAOS,KAAKw1I,EAAW,OAAOj6H,MAAM,EAAG,GACvDgwH,CACT,CAEA5/C,UAAiB,QAAArzB,EAAAx7C,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAu1D,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJ5kC,EAAI4kC,GAAAz7C,UAAAy7C,GACb,MAAM,SAAEjX,GAAajgD,KAAKytI,2BAA2Bn7G,GAErD,MAAO,CACLyZ,OAAQ,eACRkU,WACArI,OAJa53C,KAAK4zI,kBAAkBthH,GAKpCqS,OAAQ3kC,KAAK+yI,aAEjB,CAEA3kE,MACE,OAAOpuE,KAAKukI,mBAAgB9oH,UAC9B,CAEAu3H,qBAAqBoB,GACnB,MAAM,IAAEhmE,GAAQpuE,KAChBouE,EAAIkc,QAAUtqF,KAAKsqF,QACnBlc,EAAI92D,KAAOtX,KAAK0kI,aAChBt2D,EAAIimE,cAAgBr0I,KAAKwyI,WAAWxtI,SACpCopE,EAAI4P,UAAYh+E,KAAKwyI,WACrBpkE,EAAIkmE,eAAiBt0I,KAAKyyI,YAAYztI,SACtCopE,EAAI6P,WAAaj+E,KAAKyyI,YACtBrkE,EAAIykE,kBAAoB7yI,KAAK6yI,kBAC7BzkE,EAAI0kE,UAAY9yI,KAAK8yI,UACrB1kE,EAAIglE,WAAapzI,KAAKozI,WAAW/9G,KAAKr1B,MACtCouE,EAAIm2D,gBAAkBvkI,KAAKukI,gBAC3Bn2D,EAAI6kE,YAAcjzI,KAAKizI,YACvB7kE,EAAI8kE,SAAWlzI,KAAKkzI,SACpB9kE,EAAI2kE,aAAe/yI,KAAK+yI,aAExBqB,EAASp0I,KAAK0yI,OAAStkE,CACzB,EACD,SAAAsqD,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,iCAAAiO,GAAA,uBAAAh5H,GAAA,gCAAAq5H,GAAA,qCAAA+B,GAAA,iCAAA7B,GAAA,iCAAAL,GAAA,oBAAA6M,GAAA,yBAAA7J,GAAA,6BAAAjB,GAAA,wBAAA7iG,GAAA,uBAAAX,GAAA,kBAAAgU,GAAA,4BAAAgyF,GAAA,CAAAzS,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UAjPoBmY,GAAc,SAAAlY,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAdwyH,GAAch7H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,IAAA,aAAAA,KAAA18H,OAAA48H,aAAdiY,MAAclY,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,KCPnC,MAAMkb,GAAiChwG,IACrC,MAAM1nC,EAAO07H,GAAA,YAAS14F,KAAKq7C,eAAe32C,EAAa,UAAUlC,aACjE,OAAOkC,EAAYm2C,KAAKz8B,QAAOtZ,GAAKA,EAAEka,QAAQpgD,OAAS,IAAG6/B,KAAIqG,IAC5D,MAAM6vG,EAAK7vG,EAAEka,QAAQ,GAAG5nC,KAClBgpB,EAAW0E,EAAE8vG,QAAW,GAAE9vG,EAAE8vG,WAAWD,IAAOA,EACpD,OAAO33I,EAAK8lC,cAAc1C,EAAS,GACnC,EAGJ,MAAMy0G,GACJh3I,YAAYw0I,EAAOyC,EAAUrR,GAC3BvjI,KAAKsyI,OAASH,EACdnyI,KAAKujI,QAAUA,EACfvjI,KAAK40I,SAAWA,CAClB,CAEAC,iBAAmC,IAATC,EAAOr5H,UAAA/c,OAAA,EAAA+c,UAAA,QAAArc,EAC/B,MAAM21I,GADWt5H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,IACYyiC,QAAOpS,GAAKA,EAAE8+F,UAAY5qI,KAAKujI,SAAWuR,IAAYhpG,EAAE6vE,OACxF,OAAgC,IAA5Bo5B,EAAiBr2I,OACZ,GAEFq2I,EAAiBx2G,KAAI6wB,IAC1B,MAAM,KACJusD,EAAI,WACJwvB,EAAU,QACVC,GACEh8E,EACJ,IAAI06E,EAEJ,IAAK,MAAMhrF,KAAW9+C,KAAK40I,SACzB,IACE9K,EAAWhrF,EAAQpc,WAAWi5E,GAC9B,KACF,CAAE,MAAOp7G,GAAI,CAEf,MAAM8qI,EAAiB,IAAKD,GAAW,IACnCD,GACFE,EAAertH,KAAKmtH,GAEtB,IAAIl2F,EAASo2F,EAAetjG,QAAO,CAAC50B,EAAK24B,KACvC,IAAIk/F,EAAclB,EAAStqG,OAAOthC,OAAOS,KAAKmtC,EAAG,WAUjD,OATAk/F,EAAclB,EAASthH,SAASwiH,EAAa,CAC3Cp7G,MAAO7S,OACP4S,MAAO5S,OACPmE,MAAOnE,OACPoiB,UAAU,EACV6qG,QAAQ,EACRnlG,SAAS,EACTsY,QAAQ,IAEH,IACFhqC,KACA63H,EACJ,GACA,CAAC,GAGJ,OAFA/1F,EAASujF,GAAA,YAAAA,CAAUsR,EAAU70F,EAAMujF,GAAA,wBACnCvjF,EAASujF,GAAA,sBAAAA,CAAoBsR,EAAU70F,GAChCA,CAAM,GAEjB,EAGa,MAAM+/F,GACnBr3I,YAAYw0I,EAAO8C,EAAmBV,GACpCv0I,KAAKmyI,MAAQA,EACbnyI,KAAK40I,SAAWpc,GAAA,iCAAAA,CAA+Byc,GAC/Cj1I,KAAKu0I,OAASA,CAChB,CAEAW,6BAA6Bd,EAAUG,GACrCH,EAASQ,SAAS1tG,SAAQ4X,IACxBzhD,OAAOkrB,KAAKu2B,EAAQ3c,SAAS+E,SAAQ5oC,IACnC,MAAMytC,EAAS+S,EAAQ3c,QAAQ7jC,GAAK20B,UACb,IAAAulG,GAAA,mBAAmB4b,EAAS9B,OAAQvmG,EAAQqoG,EAAS7Q,QAASgR,GACtEvB,qBAAqBoB,EAAS,GAC7C,GAEN,CAEAe,GAAG5R,GAA0B,IAAjBtjF,EAAQxkC,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAA+8G,GAAA,QAClB,MAAM4c,EAAmB,IAAA5c,GAAA,aAAax4H,KAAKmyI,MAAOnyI,KAAK40I,SAAUrR,GAGjE,OAFA/K,GAAA,mBAAgB6c,sBAAsBD,EAAkBp1I,KAAKu0I,QAC7Dt0F,EAAS,KAAMm1F,GACRA,CACT,EACD,SAAA1c,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,sBAvBmC,eAAA8S,EAAA5wH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,aAAApe,OAAAkrB,KAAA8jH,GAAAnuF,QAAA,SAAAlmB,GAAA,kBAAAA,GAAA,YAAAA,GAAA,cAAAA,GAAA,aAAAA,GAAA,sBAAAA,GAAA,eAAAA,GAAA,wBAAAA,GAAA,kBAAAA,CAAA,IAAA+P,QAAA,SAAAukG,EAAAt0G,GAAA,OAAAs0G,EAAAt0G,GAAAq0G,EAAAr0G,GAAAs0G,CAAA,OAuBnCH,CAAAxkD,GAAA,uBAAAn5E,GAAA,iCAAAu5H,GAAA,iCAAAL,GAAA,4CAAA8M,GAAA,4BAAAtC,GAAA,kBAAAj4F,GAAA,sBAAA06F,GAAA,6BAAAK,GAAA,CAAAxb,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UAvBoBib,GAAe,SAAAhb,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAfs1H,GAAe99H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,IAAA,aAAAA,KAAA18H,OAAA48H,aAAf+a,MAAehb,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,KC5DrB,MAAMgc,GACnB33I,YAAYyvI,GACV/vI,OAAOkrB,KAAIiwG,GAAC,kBAAetxF,SAAQ5oC,IACjC,MAAMi3I,EAAe/c,GAAA,iBAAcl6H,IAC7B,KAAE4Y,GAASq+H,EACXxpG,EAAS,IAAAysF,GAAA,gBAAgB+c,GAC/BxpG,EAAOuhG,kBAAkBF,GACzB5U,GAAA,UAAAA,CAAQx4H,KAAMkX,EAAM60B,EAAOqiC,IAAI,GAEnC,CAEAq/D,2BAA2Bn7G,GACzB,MAAM2iB,EAAS,CACbgL,SAAQu4E,GAAA,QACRkV,QAAQ,GAEV,OAAoB,IAAhBp7G,EAAK5zB,SAIL85H,GAAA,aAAAA,CAAWlmG,EAAKA,EAAK5zB,OAAS,MAChCu2C,EAAOgL,SAAW3tB,EAAKA,EAAK5zB,OAAS,IAEvC4zB,EAAK4U,SAAQ1oC,IACPg6H,GAAA,YAAAA,CAAUh6H,GAAK0hD,QACjBjL,EAAOy4F,OAASlvI,EAAI0hD,KACtB,KAROjL,CAWX,CAEAugG,WAAWjS,EAASgR,GAAiB,QAAAvzG,EAAAvlB,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAs/B,EAAA,EAAAA,EAAA,KAAAyiB,EAAA,EAAAA,EAAAziB,EAAAyiB,IAAJnxB,EAAImxB,EAAA,GAAAhoC,UAAAgoC,GACjC,MAAM,SAAExD,EAAQ,OAAEytF,GAAW1tI,KAAKytI,2BAA2Bn7G,GAC7D,GAAIo7G,EAAQ,CACV,MAAM+H,EAAMz1I,KAAK8jI,6BAA6BP,EAAS,CACrDrjF,MAAM,IAER,GAAIu1F,GAAOA,EAAI96D,MAAQ86D,EAAI96D,KAAKj8E,OAAS,EAEvC,OADgB,IAAA85H,GAAA,oBAAoBx4H,KAAMy1I,EAAKlB,GAChCY,GAAG5R,GAEpB,MAAM,IAAI9jI,MAAM,mBAClB,CAEA,OAAOO,KAAK8jI,6BAA6BP,GAASp5F,MAAKsrG,IACrD,GAAIA,GAAOA,EAAI96D,MAAQ86D,EAAI96D,KAAKj8E,OAAS,EAAG,CAC1C,MACMu2C,EADU,IAAAujF,GAAA,oBAAoBx4H,KAAMy1I,EAAKlB,GACxBY,GAAG5R,GAE1B,OADAtjF,EAAS,KAAMhL,GACRA,CACT,CAGA,GAFAgL,EAAS,IAAIxgD,MAAM,qBAEK,IAApBwgD,EAASvhD,OACX,MAAM,IAAIe,MAAM,mBAClB,GAEJ,CAEAgvI,cAAciH,EAAMpC,GAAiB,QAAA38E,EAAAl7C,UAAA/c,OAAN4zB,EAAI,IAAA5wB,MAAAi1D,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJtkC,EAAIskC,EAAA,GAAAn7C,UAAAm7C,GACjC,MAAM,OAAE82E,GAAW1tI,KAAKytI,2BAA2Bn7G,GACnD,GAAIo7G,EAAQ,CACV,MAAMzsG,EAAQjhC,KAAKkkI,iBAAiBoP,GAAQ,EAAM,CAChDpzF,MAAM,KAEF,UAAE3P,EAAS,KAAEolG,GAAS10G,EACtB20G,EAAQD,EAAKE,aACbC,EAAUF,EAAMG,WAAUvsH,GAAMA,IAAOksH,IAC7C,IAAiB,IAAbI,EACF,MAAM,IAAIr2I,MACP,QAAOi2I,4DAA+DpC,KAG3E,MAGM0C,EAHYh2I,KAAKokI,aAAa7zF,EAAW,EAAGqlG,EAAMl3I,OAAQ,CAC9DwhD,MAAM,IAEgB3hB,KAAI,CAAC0W,EAAQv0C,KACnC,MAAM8oB,EAAKosH,EAAMl1I,GACXkrF,EAAS32C,EAAOghG,OAChBh4I,EAASC,OAAO6hB,OAAO,CAC3B7hB,OAAOS,KAAK6qB,EAAGrnB,QAAQ,KAAM,IAAK,OAClCjE,OAAOS,KAAKitF,EAAQ,UAEtB,OAAO4sC,GAAA,cAAW1qG,KAAK7vB,EAAO,IAEhC,OAAOu6H,GAAA,cAAWiW,cAAcqH,EAASE,EAC3C,CACA,OAAOh2I,KAAKkkI,iBAAiBoP,GAAQ,GAAMnpG,MAAKlJ,IAC9C,MAAM,UAAEsP,EAAS,KAAEolG,GAAS10G,EACtB20G,EAAQD,EAAKE,aACbC,EAAUF,EAAMG,WAAUvsH,GAAMA,IAAOksH,IAC7C,IAAiB,IAAbI,EACF,MAAM,IAAIr2I,MACP,QAAOi2I,4DAA+DpC,KAG3E,OAAOtzI,KAAKokI,aAAa7zF,EAAW,EAAGqlG,EAAMl3I,QAAQyrC,MAAK+rG,IACxD,MAAMF,EAAQE,EAAQ33G,KAAI,CAAC0W,EAAQv0C,KACjC,MAAM8oB,EAAKosH,EAAMl1I,GACXkrF,EAAS32C,EAAOghG,OAChBh4I,EAASC,OAAO6hB,OAAO,CAC3B7hB,OAAOS,KAAK6qB,EAAGrnB,QAAQ,KAAM,IAAK,OAClCjE,OAAOS,KAAKitF,EAAQ,UAEtB,OAAO4sC,GAAA,cAAW1qG,KAAK7vB,EAAO,IAEhC,OAAOu6H,GAAA,cAAWiW,cAAcqH,EAASE,EAAM,GAC/C,GAEN,EACD,SAAAtd,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,2BAAAoK,GAAA,yBAAAuJ,GAAA,qBAAAvD,GAAA,kBAAA1vF,GAAA,wBAAArT,GAAA,uBAAAX,GAAA,6BAAA+uG,GAAA,wBA9GyB,eAAA3I,EAAA5wH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,aAAApe,OAAAkrB,KAAA8jH,GAAAnuF,QAAA,SAAAlmB,GAAA,kBAAAA,GAAA,YAAAA,GAAA,cAAAA,GAAA,aAAAA,GAAA,sBAAAA,GAAA,eAAAA,GAAA,wBAAAA,GAAA,kBAAAA,CAAA,IAAA+P,QAAA,SAAAukG,EAAAt0G,GAAA,OAAAs0G,EAAAt0G,GAAAq0G,EAAAr0G,GAAAs0G,CAAA,OA8GzBH,CAAAqC,GAAA,CAAAhV,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UA9GoBub,GAAK,SAAAtb,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAL41H,GAAKp+H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,IAAA,aAAAA,KAAA18H,OAAA48H,aAALqb,MAAKtb,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,KCXX,MAAM6c,GACnBx4I,YAAYy4I,GACVp2I,KAAKo2I,SAAWA,CAClB,CAEAlB,sBAAqBrL,GAAyC,IAAxC,cAAEsD,EAAa,OAAEphG,EAAM,OAAE6L,EAAS,CAAC,GAAGiyF,EAC1D,MAAO,CACL99F,OAAQohG,EAAclkH,cACtBm3D,IAAKr0C,EACL6L,SAEJ,CAEAy+F,YAAYD,GACVp2I,KAAKo2I,SAAWA,CAClB,CAEApqD,KAAKsqD,GACH,IAAKt2I,KAAKo2I,SACR,OAAO,KAGT,MAAMh3B,EAAUoZ,GAAA,kBAAe+d,eAAeD,GAC9C,OAAOt2I,KAAKo2I,SAASpqD,KAAKozB,EAC5B,CAEAwuB,UAAU0I,GACR,IAAKt2I,KAAKo2I,SACR,OAAO,KAGT,MAAMh3B,EAAUoZ,GAAA,kBAAe+d,eAAeD,GAC9C,OAAOt2I,KAAKo2I,SAASxI,UAAUxuB,EACjC,EACD,SAAAsZ,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,sBAAAA,EAAA,OAAA4c,EAAA,CAAA3c,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UAlCoBoc,GAAc,SAAAnc,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAdy2H,GAAcj/H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,IAAA,aAAAA,KAAA18H,OAAA48H,aAAdkc,MAAcnc,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,qCCCnC,MAAMkd,GAAiB,CACrBC,OAAQ,mBACR,eAAgB,oBAGlB,IAAIC,GAAiB,CAAC,EAClBC,IAAU,EAC6B,CAIzC,MAAMC,EAAwB,iBAAT9yI,KAAoBA,KAAO,CAAC,EAC3C+yI,EAA4B,iBAAXv2I,OAAsBA,OAASs2I,OAChB,IAA3BC,EAAQrrD,gBACjBsrD,GAAA,iBAAiBD,EAAQrrD,gBACzBsrD,GAAA,WAAU,SACwB,IAAlBD,EAAQ3uH,QACxB4uH,GAAA,iBAAiBD,EAAQ3uH,OACzB4uH,GAAA,WAAU,GAEd,CAMe,MAAMC,GACnBp5I,cAIE,IAHAq5I,EAAIv7H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,wBACPw7H,EAAOx7H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAG,IACVy7H,EAAOz7H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,GAAA+8G,GAAA,kBAEPx4H,KAAKg3I,KAAOA,EAAK70I,QAAQ,MAAO,IAChCnC,KAAKi3I,QAAUA,EACfj3I,KAAKk3I,QAAU,CAAC,EACZx1I,MAAMC,QAAQu1I,IAChBA,EAAQhwG,SAAQ2iG,IAAqB,IAApB,KAAE3yH,EAAI,MAAEtZ,GAAOisI,EAC9B7pI,KAAKk3I,QAAQhgI,GAAQtZ,CAAK,IAE5BoC,KAAKk3I,QAAU,IACb1e,GAAA,qBACGx4H,KAAKk3I,UAGVl3I,KAAKk3I,QAAU,IACb1e,GAAA,qBACG0e,EAGT,CAEAhC,sBAAsB3qD,GACpB,IAAIt1C,EACJ,IACEA,EAASnQ,KAAK3L,MAAMoxD,EACtB,CAAE,MAAOhqF,GACP00C,EAASs1C,CACX,CACA,OAAOt1C,CACT,CAEAigG,0BAA0B5qD,GACxB,IAAIr1C,EACJ,IACE,MAAMkiG,EAAe7sD,EACrBr1C,EAAS,CACP22C,OAAQurD,EAAavrD,OACrBnsE,MAA+B,MAAxB03H,EAAavrD,OAAiB,EAAIurD,EAAavrD,OACtDnsF,MAAO,CACLgnB,QAAS6jE,EAAQ8sD,YAEnBA,WAAY9sD,EAAQ8sD,WAExB,CAAE,MAAO72I,GACP00C,EAASq1C,CACX,CACA,OAAOr1C,CACT,CAEAigG,sBAAsBmC,GACpB,OAAO,IAAIrkH,SAAQskH,IACjB,MAAMC,EAAM92F,YAAW,KACrB+2F,aAAaD,GAEbD,EAAS,CAAEp8H,KAAM,WAAY,GAC5Bm8H,EAAM,GAEb,CAEAI,mBAAmBC,EAAeptD,GAChC,MAAM,IACJlK,EAAG,OACHr0C,EAAS,OAAM,OACf6L,EAAS,CAAC,EAAC,OACX+/F,GACED,EACEvvH,EAAQ,QAAOi4D,IAAMj+E,QAAQ,QAAS,KAC5C,IAAIy1I,EAAO,GAAE53I,KAAKg3I,OAAO7uH,IAAOhmB,UAChC,MAAM01I,EAAY,IAAIC,QACtB,IAAI7oF,EAAOnqB,KAAKzM,UAAUuf,GAQ1B,MAP6B,QAAzB7L,EAAO9iB,eAAoD,WAAzB8iB,EAAO9iB,gBAC3C2uH,EAAMv6I,OAAOkrB,KAAKqvB,GAAQl5C,OAAS,EAAK,GAAEk5I,KAAOpf,GAAA,YAAAA,CAAU5gF,KAAYggG,EACvE3oF,OAAO7vD,GAET/B,OAAOkrB,KAAKvoB,KAAKk3I,SAAShwG,SAAQ0uC,IAChCiiE,EAAUE,OAAOniE,EAAQ51E,KAAKk3I,QAAQthE,GAAQ,IAEzC0U,EAAQstD,EAAK,CAClB7rG,OAAQA,EAAO9iB,cACfiuH,QAASW,EACT5oF,OACA0oF,UAEJ,CAEAK,iBAAiBN,GACf,MAAMptD,EAAOkuC,GAAA,mBACP,QAAEye,GAAYj3I,KACdi4I,EAAqC,mBAApBC,gBAAiC,IAAIA,gBAAoB,CAAC,EAC3EjnG,EAAS,IAAKymG,EAAeC,OAAQM,EAAQN,OAAQQ,YAAa,QAExE,OAAOnlH,QAAQolH,KAAK,CAClBp4I,KAAKy3I,mBAAmBxmG,EAAQq5C,GAChCkuC,GAAA,gBAAa6f,eAAepB,KAC3B9sG,MAAK8K,GAAU,IAAIjiB,SAAQ,CAACC,EAASC,KAGtC,IACsB,YAAhB+hB,EAAO/5B,MAEL+8H,EAAQ5zF,OAAO4zF,EAAQ5zF,QAC3BnxB,EAAO+hB,IAEPA,EACGvK,OACAP,MAAKO,IACJ,MAAMnlC,EAAMizH,GAAA,gBAAa8f,eAAe5tG,GAClB,MAAlBuK,EAAO22C,QAAmB32C,EAAOkf,GAIrClhC,EAAQ1tB,GAHN2tB,EAAO3tB,EAGG,IAEbwwD,OAAM3iC,GAAOF,EAAOE,IAE3B,CAAE,MAAO7yB,GACP2yB,EAAO3yB,EACT,MAGJ,CAEAg4I,YAAYb,EAAeptD,GAA0B,IAAjBkuD,EAAO/8H,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,IAAAA,UAAA,GACzC,MAAM,IACJ2kE,EAAG,OACHr0C,EAAS,OAAM,OACf6L,EAAS,CAAC,GACR8/F,EACEvvH,EAAQ,QAAOi4D,IAAMj+E,QAAQ,QAAS,KAC5C,IAAIy1I,EAAO,GAAE53I,KAAKg3I,OAAO7uH,IAAOhmB,UACH,QAAzB4pC,EAAO9iB,eAAoD,WAAzB8iB,EAAO9iB,gBAC3C2uH,EAAMv6I,OAAOkrB,KAAKqvB,GAAQl5C,OAAS,EAAK,GAAEk5I,KAAOpf,GAAA,YAAAA,CAAU5gF,KAAYggG,GAEzEttD,EAAQyB,KAAKhgD,EAAO9iB,cAAe2uH,EAAKY,GACxCn7I,OAAOkrB,KAAKvoB,KAAKk3I,SAAShwG,SAAQ0uC,IAChC0U,EAAQmuD,iBAAiB7iE,EAAQ51E,KAAKk3I,QAAQthE,GAAQ,IAE3B,QAAzB7pC,EAAO9iB,eAAoD,WAAzB8iB,EAAO9iB,cAC3CqhE,EAAQ0B,OAER1B,EAAQ0B,KAAKlnD,KAAKzM,UAAUuf,GAEhC,CAEAo0C,KAAK0rD,GACH,GAAAlf,GAAA,WAAa,MAAM,IAAI/4H,MAAM,yDAC7B,MAAM6qF,EAAU,IAAAkuC,GAAA,mBAChBluC,EAAQouD,iBAAkB,EAC1B14I,KAAKu4I,YAAYb,EAAeptD,GAChC,IAAIr1C,EAASq1C,EAAQuB,aAGrB,GADA52C,EAASujF,GAAA,gBAAa8f,eAAerjG,GACjCA,EAAOx1C,MACT,MAAMw1C,EAER,OAAOA,CACT,CAEA24F,UAAU8J,GACR,OAAAlf,GAAA,WAAoBx4H,KAAKg4I,iBAAiBN,GACnC13I,KAAK24I,mBAAmBjB,EACjC,CAEAiB,mBAAmBjB,GACjB,MAAMptD,EAAU,IAAAkuC,GAAA,mBAIhB,OAHAluC,EAAQouD,iBAAkB,EAC1BpuD,EAAQ2sD,QAAUj3I,KAAKi3I,QACvBj3I,KAAKu4I,YAAYb,EAAeptD,GAAS,GAClC,IAAIt3D,SAAQ,CAACC,EAASC,KAC3Bo3D,EAAQoB,mBAAqB,KAC3B,GAA2B,IAAvBpB,EAAQqB,YAAwC,IAApBrB,EAAQ2sD,QAAe,CACrD,IAAIhiG,EAASq1C,EAAQuB,aACrB,IACE52C,EAASujF,GAAA,gBAAa8f,eAAerjG,GACd,MAAnBq1C,EAAQsB,QAAkB32C,EAAOx1C,MACnCyzB,EAAO+hB,GAEPhiB,EAAQgiB,EAEZ,CAAE,MAAO10C,GAEP2yB,EAAO3yB,EACT,CACF,GAGF+pF,EAAQtmC,QAAU5wB,IAChBF,EAAOE,EAAI,EAEbk3D,EAAQsuD,UAAYxlH,IAElBF,EAAOE,EAAI,CACZ,GAEL,CAEAylH,cACE,IAKE,OAJA74I,KAAKgsF,KAAK,CACRjgD,OAAQ,MACRq0C,IAAK,4BAEA,CACT,CAAE,MAAO7/E,GACP,OAAO,CACT,CACF,CAEA45E,yBACE,IACE,aAAan6E,KAAKg4I,iBAAiB,CACjCjsG,OAAQ,MACRq0C,IAAK,0BAET,CAAE,MAAO7/E,GACP,OAAO,CACT,CACF,EACD,SAAAm4H,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,kBAAAo4H,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,4BAAAmd,GAAA,qBAAAC,GAAA,4BAAAH,GAAA,uBAAAn+G,GAAAA,UAAA,0BAAA0+G,GAAA,CAAAvd,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAAk5I,GAAAvd,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,YAAA95H,IAAAg6H,EAAAG,GAAA,SAAAA,EAAAuf,GAAA,OAAAvf,GAAA,4BAAAmd,GAAAoC,EAAA,qBAAAnC,GAAAmC,EAAA,CAAAC,CAAAxf,EAAA37H,GAAAw7H,EAAAG,GAAA37H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UA9NoBgd,GAAY,SAAA/c,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAZq3H,GAAY7/H,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,eAAAg8H,IAAA,aAAAA,KAAA18H,OAAA48H,aAAZ8c,MAAY/c,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,KC3BlB,MAAM0f,GACnBr7I,cACEqC,KAAKi5I,oBAAiB75I,CACxB,yaCSa,MAAM85I,GACnBv7I,YAAYy4I,GAAUh2C,GAAA,iBA4BV,CACV22C,aAAYve,GAAA,kBACbp4B,GAAA,gBAEU,IAAAo4B,GAAA,cAEXp4B,GAAA,eAIU,CACR+4C,IAAKvrH,kBAtCL5tB,KAAKo5I,gBAAkB,IAAA5gB,GAAA,mBAAmB4d,GAC1Cp2I,KAAKq5I,gBAAkBjD,EACvBp2I,KAAKmyI,MAAQ,IAAA3Z,GAAA,UAAUx4H,KAAKo5I,gBAC9B,CA0CAP,cACE,OAAO74I,KAAKq5I,iBAAmBr5I,KAAKq5I,gBAAgBR,aACtD,CAEAxC,YAAYD,GACVp2I,KAAKo5I,gBAAgB/C,YAAYD,GACjCp2I,KAAKq5I,gBAAkBjD,CACzB,EA3BC,SAAA1d,KAAA,OAAAnrG,oBAAAA,EAAA,OAAAA,oBAAAA,CAAA,OAAAhtB,GAAA,OAAAD,OAAA,OAAAA,MAAA,OAAAC,GAAA,cA6BH6/F,GAAAo4B,GAAA,kBAjDmB5qG,iBAAuBwyE,GAAAo4B,GAAA,oBAErB,CACjBue,aAAYve,GAAA,kBAGdp4B,GAAAo4B,GAAA,eAAAA,GAAA,aAAAp4B,GAAAo4B,GAAA,kBAAAA,GAAA,UAAAp4B,GAAAo4B,GAAA,iBAAAA,GAAA,WAAAp4B,GAAAo4B,GAAA,gBASe,IACbA,GAAA,YACAA,GAAA,SACA32E,OAAM22E,GAAA,UACNhqH,UAASgqH,GAAA,eACV,IAAAG,GAAA,cAAAC,KAAA,UAAAD,GAAA,KAAAE,EAAAH,KAAAG,EAAAC,qCAAAD,EAAAC,mCAAA,GAAAH,GAAAG,oCAAA,QAAAH,EAAA,UAAAI,KAAA,IAAAC,EAAAN,KAAA,OAAAM,EAAAC,+BAAAD,EAAAC,6BAAA57H,OAAAC,OAAA,OAAA07H,EAAAC,4BAAA,UAAAC,KAAA,IAAAzD,EAAAmD,KAAAO,EAAAJ,KAAAK,EAAAD,EAAA1D,GAAA,OAAA2D,IAAAD,EAAA1D,GAAAp4H,OAAAC,OAAA,MAAA87H,EAAAD,EAAA1D,IAAA2D,CAAA,iBAAAJ,EAAAN,KAAAM,EAAA,uBAAAA,EAAA,gCAAAA,EAAAC,6BAAA57H,OAAAC,OAAA,eAAA+7H,GAAA,gCAAAC,GAAA,YAAAd,GAAAe,GAAA,IAAAH,EAAAF,KAAA,QAAA95H,IAAAg6H,EAAAG,GAAA,gBAAAA,GAAA,OAAAA,GAAA,4BAAA4c,GAAA,mBAAAb,GAAA,0BAAAyB,GAAA,sBAAA5K,GAAAxkD,GAAA,mBAAAwkD,GAAA9sH,GAAA,oBAAAk1H,GAAA,mBAAApI,GAAAliH,GAAA,mBAAAkiH,GAAAK,GAAA,oBAAA3qF,EAAA,uBAAAsqF,GAAA39H,GAAA,sBAAAwqI,GAAA,kBAAAE,GAAA,CAAA1f,CAAAD,GAAA,IAAA37H,EAAAw7H,EAAAG,GAAA,OAAA37H,IAAAy7H,QAAA,EAAAz7H,CAAA,UAAA67H,GAAAF,EAAA37H,GAAA,IAAAw7H,EAAAF,KAAA,uBAAAK,GAAAl8H,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAkiH,EAAAliH,GAAAqiH,EAAAriH,EAAA,eAAA7Z,OAAAkrB,KAAAgxG,GAAAryF,SAAA,SAAAhwB,GAAAwiH,GAAAH,EAAA,OAAAH,EAAAG,QAAAn6H,IAAAxB,EAAAy7H,GAAAz7H,EAAA,WAAA87H,GAAAH,EAAA,YAAAG,GAAAH,GAAA,IAAAH,EAAAF,YAAAE,EAAAG,GAAA,GAAAl8H,OAAAkrB,KAAA6wG,GAAA16H,eAAAq6H,KAAAH,GAAA,UAAAe,GAAArxG,GAAA,IAAA8wG,EAAAF,KAAA,IAAAU,EAAAv8H,OAAAkrB,KAAAD,GAAAuxG,EAAA,YAAA5/F,IAAA2/F,EAAA1yF,SAAA,SAAAqyF,GAAAH,EAAAG,GAAAM,EAAAN,EAAA,oBAAAt5E,GAAA25E,EAAA1yF,SAAA,SAAAqyF,GAAAM,EAAAN,GAAAH,EAAAG,GAAAH,EAAAG,GAAAjxG,EAAAixG,EAAA,QAAAtkF,EAAAgL,IAAA,OAAAhL,GAAA,mBAAAA,EAAA9K,KAAA8K,EAAA9K,KAAAlQ,GAAA87B,MAAA97B,GAAAA,IAAAgb,CAAA,uBAAA6kF,EAAA5iH,EAAAtZ,GAAAP,OAAAqiB,eAAA45G,GAAApiH,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,IAAA+7H,EAAA,UAAAtB,IAAAsB,EAAA,oBAAAtB,IAAAsB,EAAA,aAAAL,IAAAK,EAAA,UAAAL,IAAAK,EAAA,YAAAJ,IAAAI,EAAA,sBAAAJ,IAAAI,EAAA,WAAAH,GAAA,QAAAI,UA3BkBmf,GAAI,SAAAlf,GAAA9iH,EAAAtZ,GAAAP,OAAAqiB,eAAJw5H,GAAIhiI,EAAA,CAAAtZ,MAAAA,EAAAC,YAAA,EAAAE,cAAA,aAAAouI,KAAA,IAAAE,EAAA5wH,UAAA/c,OAAA,QAAAU,IAAAqc,UAAA,GAAAA,UAAA,aAAApe,OAAAkrB,KAAA8jH,GAAAnuF,QAAA,SAAAlmB,GAAA,kBAAAA,GAAA,YAAAA,GAAA,cAAAA,GAAA,aAAAA,GAAA,sBAAAA,GAAA,eAAAA,GAAA,wBAAAA,GAAA,kBAAAA,CAAA,IAAA+P,QAAA,SAAAukG,EAAAt0G,GAAA,OAAAs0G,EAAAt0G,GAAAq0G,EAAAr0G,GAAAs0G,CAAA,kBAAAvS,IAAA,aAAAA,KAAA18H,OAAA48H,aAAJif,MAAIlf,GAAA,UAAAxB,IAAAwB,GAAA,oBAAAxB,IAAAwB,GAAA,aAAAP,IAAAO,GAAA,UAAAP,IAAAO,GAAA,YAAAN,IAAAM,GAAA,sBAAAN,IAAAM,GAAA,WAAAL,IAAAK,GAAA,gBAAAV,8E7VPzB","sources":["webpack://AElf/webpack/universalModuleDefinition","webpack://AElf/./node_modules/inherits/inherits_browser.js","webpack://AElf/./node_modules/safe-buffer/index.js","webpack://AElf/./node_modules/bn.js/lib/bn.js","webpack://AElf/./node_modules/buffer/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/util.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/utils.js","webpack://AElf/./node_modules/minimalistic-assert/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/enum.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/util/minimal.js","webpack://AElf/./node_modules/hash.js/lib/hash/utils.js","webpack://AElf/./node_modules/events/events.js","webpack://AElf/./node_modules/crypto-js/core.js","webpack://AElf/./node_modules/randombytes/browser.js","webpack://AElf/./node_modules/create-hash/browser.js","webpack://AElf/./node_modules/cipher-base/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/field.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/object.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/types.js","webpack://AElf/./node_modules/sha.js/hash.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/namespace.js","webpack://AElf/./node_modules/elliptic/lib/elliptic.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/errors-browser.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/errors-browser.js","webpack://AElf/./node_modules/buffer-xor/index.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/errors-browser.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/errors-browser.js","webpack://AElf/./node_modules/util/util.js","webpack://AElf/./node_modules/string_decoder/lib/string_decoder.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/_stream_duplex.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/_stream_duplex.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_duplex.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_duplex.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/oneof.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/base.js","webpack://AElf/./node_modules/hash.js/lib/hash/common.js","webpack://AElf/./node_modules/util-deprecate/browser.js","webpack://AElf/./node_modules/has-tostringtag/shams.js","webpack://AElf/./node_modules/get-intrinsic/index.js","webpack://AElf/./node_modules/define-properties/index.js","webpack://AElf/./node_modules/evp_bytestokey/index.js","webpack://AElf/./node_modules/parse-asn1/index.js","webpack://AElf/./node_modules/call-bind/index.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/constants/der.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/writer.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/reader.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/type.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/mapfield.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/service.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/method.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/message.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/root.js","webpack://AElf/./node_modules/brorand/index.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curves.js","webpack://AElf/./node_modules/hash.js/lib/hash.js","webpack://AElf/./node_modules/md5.js/index.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://AElf/./node_modules/ripemd160/index.js","webpack://AElf/./node_modules/sha.js/index.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://AElf/./node_modules/call-bind/callBound.js","webpack://AElf/./node_modules/function-bind/index.js","webpack://AElf/./node_modules/crypto-browserify/index.js","webpack://AElf/./node_modules/des.js/lib/des/cipher.js","webpack://AElf/./node_modules/browserify-aes/modes/index.js","webpack://AElf/./node_modules/browserify-aes/aes.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://AElf/./node_modules/browserify-rsa/index.js","webpack://AElf/./node_modules/safer-buffer/safer.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/base/node.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/base/buffer.js","webpack://AElf/./node_modules/crypto-js/evpkdf.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/readable-browser.js","webpack://AElf/./node_modules/assert/build/assert.js","webpack://AElf/./node_modules/browserify-sign/node_modules/bn.js/lib/bn.js","webpack://AElf/./node_modules/parse-asn1/node_modules/safe-buffer/index.js","webpack://AElf/./node_modules/@protobufjs/aspromise/index.js","webpack://AElf/./node_modules/@protobufjs/inquire/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/rpc.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/roots.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/encoder.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/decoder.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/verifier.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/converter.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/wrappers.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/tokenize.js","webpack://AElf/./node_modules/minimalistic-crypto-utils/lib/utils.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/index.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/256.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/512.js","webpack://AElf/./node_modules/hash-base/index.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/_stream_readable.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/state.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/_stream_writable.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/_stream_transform.js","webpack://AElf/./node_modules/sha.js/sha256.js","webpack://AElf/./node_modules/sha.js/sha512.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/_stream_readable.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/state.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/_stream_writable.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/_stream_transform.js","webpack://AElf/./node_modules/pbkdf2/browser.js","webpack://AElf/./node_modules/pbkdf2/lib/precondition.js","webpack://AElf/./node_modules/pbkdf2/lib/default-encoding.js","webpack://AElf/./node_modules/pbkdf2/lib/sync-browser.js","webpack://AElf/./node_modules/create-hash/md5.js","webpack://AElf/./node_modules/pbkdf2/lib/to-buffer.js","webpack://AElf/./node_modules/has-symbols/shams.js","webpack://AElf/./node_modules/for-each/index.js","webpack://AElf/./node_modules/available-typed-arrays/index.js","webpack://AElf/./node_modules/gopd/index.js","webpack://AElf/./node_modules/is-typed-array/index.js","webpack://AElf/./node_modules/object-is/index.js","webpack://AElf/./node_modules/object-keys/isArguments.js","webpack://AElf/./node_modules/object-is/implementation.js","webpack://AElf/./node_modules/object-is/polyfill.js","webpack://AElf/./node_modules/is-nan/implementation.js","webpack://AElf/./node_modules/is-nan/polyfill.js","webpack://AElf/./node_modules/create-hmac/browser.js","webpack://AElf/./node_modules/des.js/lib/des/des.js","webpack://AElf/./node_modules/browserify-aes/browser.js","webpack://AElf/./node_modules/browserify-aes/incr32.js","webpack://AElf/./node_modules/browserify-aes/authCipher.js","webpack://AElf/./node_modules/browserify-aes/streamCipher.js","webpack://AElf/./node_modules/diffie-hellman/lib/generatePrime.js","webpack://AElf/./node_modules/miller-rabin/lib/mr.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_readable.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/state.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_writable.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_transform.js","webpack://AElf/./node_modules/asn1.js/lib/asn1.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/encoders/index.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/encoders/der.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/base/reporter.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/decoders/index.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/decoders/der.js","webpack://AElf/./node_modules/public-encrypt/mgf.js","webpack://AElf/./node_modules/public-encrypt/xor.js","webpack://AElf/./node_modules/public-encrypt/withPublic.js","webpack://AElf/./node_modules/scryptsy/lib/utils.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_readable.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/state.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_writable.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_transform.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/ext/descriptor/index.js","webpack://AElf/./node_modules/query-string/index.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/readable-browser.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/readable-browser.js","webpack://AElf/./node_modules/crypto-js/aes.js","webpack://AElf/./node_modules/crypto-js/enc-base64.js","webpack://AElf/./node_modules/crypto-js/md5.js","webpack://AElf/./node_modules/crypto-js/sha1.js","webpack://AElf/./node_modules/crypto-js/hmac.js","webpack://AElf/./node_modules/crypto-js/cipher-core.js","webpack://AElf/./node_modules/crypto-js/enc-utf8.js","webpack://AElf/./node_modules/hdkey/node_modules/safe-buffer/index.js","webpack://AElf/./node_modules/evp_bytestokey/node_modules/safe-buffer/index.js","webpack://AElf/./node_modules/browserify-rsa/node_modules/bn.js/lib/bn.js","webpack://AElf/./node_modules/public-encrypt/browser.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/index-light.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/index-minimal.js","webpack://AElf/./node_modules/@protobufjs/base64/index.js","webpack://AElf/./node_modules/@protobufjs/eventemitter/index.js","webpack://AElf/./node_modules/@protobufjs/float/index.js","webpack://AElf/./node_modules/@protobufjs/utf8/index.js","webpack://AElf/./node_modules/@protobufjs/pool/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/util/longbits.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/writer_buffer.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/reader_buffer.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/rpc/service.js","webpack://AElf/./node_modules/@protobufjs/codegen/index.js","webpack://AElf/./node_modules/@protobufjs/fetch/index.js","webpack://AElf/./node_modules/@protobufjs/path/index.js","webpack://AElf/./node_modules/bs58/index.js","webpack://AElf/./node_modules/base-x/src/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/parse.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/common.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/short.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/mont.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/curve/edwards.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/1.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/common.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/224.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha/384.js","webpack://AElf/./node_modules/hash.js/lib/hash/hmac.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/ec/index.js","webpack://AElf/./node_modules/hmac-drbg/lib/hmac-drbg.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/ec/key.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/ec/signature.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/eddsa/index.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/eddsa/key.js","webpack://AElf/./node_modules/elliptic/lib/elliptic/eddsa/signature.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/from-browser.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/_stream_passthrough.js","webpack://AElf/./node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://AElf/./node_modules/sha.js/sha.js","webpack://AElf/./node_modules/sha.js/sha1.js","webpack://AElf/./node_modules/sha.js/sha224.js","webpack://AElf/./node_modules/sha.js/sha384.js","webpack://AElf/./node_modules/stream-browserify/index.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/from-browser.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/_stream_passthrough.js","webpack://AElf/./node_modules/stream-browserify/node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://AElf/./node_modules/pbkdf2/lib/async.js","webpack://AElf/./node_modules/hdkey/lib/hdkey.js","webpack://AElf/./node_modules/assert/build/internal/errors.js","webpack://AElf/./node_modules/util/support/types.js","webpack://AElf/./node_modules/is-arguments/index.js","webpack://AElf/./node_modules/has-symbols/index.js","webpack://AElf/./node_modules/function-bind/implementation.js","webpack://AElf/./node_modules/has/src/index.js","webpack://AElf/./node_modules/is-generator-function/index.js","webpack://AElf/./node_modules/util/node_modules/which-typed-array/index.js","webpack://AElf/./node_modules/is-callable/index.js","webpack://AElf/./node_modules/util/support/isBufferBrowser.js","webpack://AElf/./node_modules/assert/build/internal/assert/assertion_error.js","webpack://AElf/./node_modules/es6-object-assign/index.js","webpack://AElf/./node_modules/object-keys/index.js","webpack://AElf/./node_modules/object-keys/implementation.js","webpack://AElf/./node_modules/has-property-descriptors/index.js","webpack://AElf/./node_modules/object-is/shim.js","webpack://AElf/./node_modules/assert/build/internal/util/comparisons.js","webpack://AElf/./node_modules/is-nan/index.js","webpack://AElf/./node_modules/is-nan/shim.js","webpack://AElf/./node_modules/create-hmac/legacy.js","webpack://AElf/./node_modules/browserify-cipher/browser.js","webpack://AElf/./node_modules/browserify-des/index.js","webpack://AElf/./node_modules/des.js/lib/des/utils.js","webpack://AElf/./node_modules/des.js/lib/des/ede.js","webpack://AElf/./node_modules/browserify-aes/ghash.js","webpack://AElf/./node_modules/diffie-hellman/lib/dh.js","webpack://AElf/./node_modules/browserify-sign/browser/index.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/from-browser.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_passthrough.js","webpack://AElf/./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://AElf/./node_modules/browserify-sign/browser/sign.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/api.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/encoders/pem.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/decoders/pem.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/base/index.js","webpack://AElf/./node_modules/asn1.js/lib/asn1/constants/index.js","webpack://AElf/./node_modules/parse-asn1/certificate.js","webpack://AElf/./node_modules/parse-asn1/fixProc.js","webpack://AElf/./node_modules/browserify-sign/browser/verify.js","webpack://AElf/./node_modules/create-ecdh/browser.js","webpack://AElf/./node_modules/public-encrypt/publicEncrypt.js","webpack://AElf/./node_modules/public-encrypt/privateDecrypt.js","webpack://AElf/./node_modules/bs58check/index.js","webpack://AElf/./node_modules/bs58check/base.js","webpack://AElf/./node_modules/bs58check/node_modules/bs58/index.js","webpack://AElf/./node_modules/bs58check/node_modules/base-x/src/index.js","webpack://AElf/./node_modules/secp256k1/elliptic.js","webpack://AElf/./node_modules/secp256k1/lib/index.js","webpack://AElf/./node_modules/bip66/index.js","webpack://AElf/./node_modules/secp256k1/lib/elliptic/index.js","webpack://AElf/./node_modules/scryptsy/lib/index.js","webpack://AElf/./node_modules/scryptsy/lib/scryptSync.js","webpack://AElf/./node_modules/scryptsy/lib/scrypt.js","webpack://AElf/./node_modules/keccak/js.js","webpack://AElf/./node_modules/keccak/lib/api/index.js","webpack://AElf/./node_modules/keccak/lib/api/keccak.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/from-browser.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/_stream_passthrough.js","webpack://AElf/./node_modules/keccak/node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://AElf/./node_modules/keccak/lib/api/shake.js","webpack://AElf/./node_modules/keccak/lib/keccak.js","webpack://AElf/./node_modules/strict-uri-encode/index.js","webpack://AElf/./node_modules/decode-uri-component/index.js","webpack://AElf/./node_modules/split-on-first/index.js","webpack://AElf/./node_modules/filter-obj/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/light.js","webpack://AElf/./node_modules/bip39/src/_wordlists.js","webpack://AElf/./node_modules/browserify-aes/modes/ctr.js","webpack://AElf/./node_modules/base64-js/index.js","webpack://AElf/./node_modules/ieee754/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/index.js","webpack://AElf/./node_modules/@aelfqueen/protobufjs/src/index.js","webpack://AElf/./node_modules/hash.js/lib/hash/sha.js","webpack://AElf/./node_modules/hash.js/lib/hash/ripemd.js","webpack://AElf/./node_modules/bip39/src/index.js","webpack://AElf/./node_modules/browserify-sign/algos.js","webpack://AElf/./node_modules/des.js/lib/des.js","webpack://AElf/./node_modules/des.js/lib/des/cbc.js","webpack://AElf/./node_modules/browserify-aes/encrypter.js","webpack://AElf/./node_modules/browserify-aes/modes/ecb.js","webpack://AElf/./node_modules/browserify-aes/modes/cbc.js","webpack://AElf/./node_modules/browserify-aes/modes/cfb.js","webpack://AElf/./node_modules/browserify-aes/modes/cfb8.js","webpack://AElf/./node_modules/browserify-aes/modes/cfb1.js","webpack://AElf/./node_modules/browserify-aes/modes/ofb.js","webpack://AElf/./node_modules/browserify-aes/decrypter.js","webpack://AElf/./node_modules/browserify-des/modes.js","webpack://AElf/./node_modules/diffie-hellman/browser.js","webpack://AElf/./node_modules/parse-asn1/asn1.js","webpack://AElf/./node_modules/randomfill/browser.js","webpack://AElf/./node_modules/secp256k1/lib/assert.js","webpack://AElf/./node_modules/secp256k1/lib/der.js","webpack://AElf/./node_modules/keccak/lib/keccak-state-unroll.js","webpack://AElf/webpack/bootstrap","webpack://AElf/webpack/runtime/compat get default export","webpack://AElf/webpack/runtime/define property getters","webpack://AElf/webpack/runtime/global","webpack://AElf/webpack/runtime/hasOwnProperty shorthand","webpack://AElf/webpack/runtime/make namespace object","webpack://AElf/webpack/runtime/node module decorator","webpack://AElf/./node_modules/tslib/tslib.es6.mjs","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/constants.js","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/RawSha256.js","webpack://AElf/./node_modules/@aws-crypto/util/build/module/convertToBuffer.js","webpack://AElf/./node_modules/@smithy/util-utf8/dist-es/fromUtf8.browser.js","webpack://AElf/./node_modules/@aws-crypto/sha256-js/build/module/jsSha256.js","webpack://AElf/./node_modules/@aws-crypto/util/build/module/isEmptyData.js","webpack://AElf/./src/util/sha256.js","webpack://AElf/./node_modules/bignumber.js/bignumber.mjs","webpack://AElf/./src/util/formatters.js","webpack://AElf/./src/common/constants.js","webpack://AElf/./src/util/transform.js","webpack://AElf/./src/util/utils.js","webpack://AElf/./src/util/proto.js","webpack://AElf/./src/util/bloom.js","webpack://AElf/./src/chain/chainMethod.js","webpack://AElf/./src/util/merkleTree.js","webpack://AElf/./src/util/keccak.js","webpack://AElf/./src/util/keyStore.js","webpack://AElf/./src/wallet/index.js","webpack://AElf/./src/contract/contractMethod.js","webpack://AElf/./src/contract/index.js","webpack://AElf/./src/chain/index.js","webpack://AElf/./src/util/requestManage.js","webpack://AElf/./src/util/httpProvider.js","webpack://AElf/./src/util/settings.js","webpack://AElf/./src/index.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"AElf\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"AElf\"] = factory();\n\telse\n\t\troot[\"AElf\"] = factory();\n})(globalThis, () => {\nreturn ","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n })\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [ 0 ];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '0' - '9'\n } else {\n return (c - 48) & 0xf;\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this.strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\n }\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [ 0 ];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this.strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16);\n };\n\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n assert(typeof Buffer !== 'undefined');\n return this.toArrayLike(Buffer, endian, length);\n };\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\n if (!littleEndian) {\n // Assume big-endian\n for (i = 0; i < reqLength - byteLength; i++) {\n res[i] = 0;\n }\n\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[reqLength - i - 1] = b;\n }\n } else {\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[i] = b;\n }\n\n for (; i < reqLength; i++) {\n res[i] = 0;\n }\n }\n\n return res;\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this.strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this.strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this.strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this.strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this.strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n function jumboMulTo (self, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this.strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) < num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this.strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this.strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modn = function modn (num) {\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return acc;\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n return this.strip();\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is BN v4 instance\n r.strip();\n } else {\n // r is BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n return a.umod(this.m)._forceRed(this);\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.write(string, encoding)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return ''\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n let i\n if (dir) {\n let foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8'\n\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n case 'latin1':\n case 'binary':\n return asciiWrite(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\n end = this.length\n }\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","\"use strict\";\n\n/**\n * Various utility functions.\n * @namespace\n */\nvar util = module.exports = require(\"./util/minimal\");\n\nvar roots = require(\"./roots\");\n\nvar Type, // cyclic\n Enum;\n\nutil.codegen = require(\"@protobufjs/codegen\");\nutil.fetch = require(\"@protobufjs/fetch\");\nutil.path = require(\"@protobufjs/path\");\n\n/**\n * Node's fs module if available.\n * @type {Object.}\n */\nutil.fs = util.inquire(\"fs\");\n\n/**\n * Converts an object's values to an array.\n * @param {Object.} object Object to convert\n * @returns {Array.<*>} Converted array\n */\nutil.toArray = function toArray(object) {\n if (object) {\n var keys = Object.keys(object),\n array = new Array(keys.length),\n index = 0;\n while (index < keys.length)\n array[index] = object[keys[index++]];\n return array;\n }\n return [];\n};\n\n/**\n * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values.\n * @param {Array.<*>} array Array to convert\n * @returns {Object.} Converted object\n */\nutil.toObject = function toObject(array) {\n var object = {},\n index = 0;\n while (index < array.length) {\n var key = array[index++],\n val = array[index++];\n if (val !== undefined)\n object[key] = val;\n }\n return object;\n};\n\nvar safePropBackslashRe = /\\\\/g,\n safePropQuoteRe = /\"/g;\n\n/**\n * Tests whether the specified name is a reserved word in JS.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nutil.isReserved = function isReserved(name) {\n return /^(?:do|if|in|for|let|new|try|var|case|else|enum|eval|false|null|this|true|void|with|break|catch|class|const|super|throw|while|yield|delete|export|import|public|return|static|switch|typeof|default|extends|finally|package|private|continue|debugger|function|arguments|interface|protected|implements|instanceof)$/.test(name);\n};\n\n/**\n * Returns a safe property accessor for the specified property name.\n * @param {string} prop Property name\n * @returns {string} Safe accessor\n */\nutil.safeProp = function safeProp(prop) {\n if (!/^[$\\w_]+$/.test(prop) || util.isReserved(prop))\n return \"[\\\"\" + prop.replace(safePropBackslashRe, \"\\\\\\\\\").replace(safePropQuoteRe, \"\\\\\\\"\") + \"\\\"]\";\n return \".\" + prop;\n};\n\n/**\n * Converts the first character of a string to upper case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.ucFirst = function ucFirst(str) {\n return str.charAt(0).toUpperCase() + str.substring(1);\n};\n\nvar camelCaseRe = /_([a-z])/g;\n\n/**\n * Converts a string to camel case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.camelCase = function camelCase(str) {\n return str.substring(0, 1)\n + str.substring(1)\n .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); });\n};\n\n/**\n * Compares reflected fields by id.\n * @param {Field} a First field\n * @param {Field} b Second field\n * @returns {number} Comparison value\n */\nutil.compareFieldsById = function compareFieldsById(a, b) {\n return a.id - b.id;\n};\n\n/**\n * Decorator helper for types (TypeScript).\n * @param {Constructor} ctor Constructor function\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {Type} Reflected type\n * @template T extends Message\n * @property {Root} root Decorators root\n */\nutil.decorateType = function decorateType(ctor, typeName) {\n\n /* istanbul ignore if */\n if (ctor.$type) {\n if (typeName && ctor.$type.name !== typeName) {\n util.decorateRoot.remove(ctor.$type);\n ctor.$type.name = typeName;\n util.decorateRoot.add(ctor.$type);\n }\n return ctor.$type;\n }\n\n /* istanbul ignore next */\n if (!Type)\n Type = require(\"./type\");\n\n var type = new Type(typeName || ctor.name);\n util.decorateRoot.add(type);\n type.ctor = ctor; // sets up .encode, .decode etc.\n Object.defineProperty(ctor, \"$type\", { value: type, enumerable: false });\n Object.defineProperty(ctor.prototype, \"$type\", { value: type, enumerable: false });\n return type;\n};\n\nvar decorateEnumIndex = 0;\n\n/**\n * Decorator helper for enums (TypeScript).\n * @param {Object} object Enum object\n * @returns {Enum} Reflected enum\n */\nutil.decorateEnum = function decorateEnum(object) {\n\n /* istanbul ignore if */\n if (object.$type)\n return object.$type;\n\n /* istanbul ignore next */\n if (!Enum)\n Enum = require(\"./enum\");\n\n var enm = new Enum(\"Enum\" + decorateEnumIndex++, object);\n util.decorateRoot.add(enm);\n Object.defineProperty(object, \"$type\", { value: enm, enumerable: false });\n return enm;\n};\n\n/**\n * Decorator root (TypeScript).\n * @name util.decorateRoot\n * @type {Root}\n * @readonly\n */\nObject.defineProperty(util, \"decorateRoot\", {\n get: function() {\n return roots[\"decorated\"] || (roots[\"decorated\"] = new (require(\"./root\"))());\n }\n});\n","'use strict';\n\nvar utils = exports;\nvar BN = require('bn.js');\nvar minAssert = require('minimalistic-assert');\nvar minUtils = require('minimalistic-crypto-utils');\n\nutils.assert = minAssert;\nutils.toArray = minUtils.toArray;\nutils.zero2 = minUtils.zero2;\nutils.toHex = minUtils.toHex;\nutils.encode = minUtils.encode;\n\n// Represent num in a w-NAF form\nfunction getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n var jsf = [\n [],\n [],\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n var m8;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n var key = '_' + name;\n obj.prototype[name] = function cachedProperty() {\n return this[key] !== undefined ? this[key] :\n this[key] = computer.call(this);\n };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val)\n throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r)\n throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","\"use strict\";\nmodule.exports = Enum;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = \"Enum\";\n\nvar Namespace = require(\"./namespace\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new enum instance.\n * @classdesc Reflected enum.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {Object.} [values] Enum values as an object, by name\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this enum\n * @param {Object.} [comments] The value comments for this enum\n */\nfunction Enum(name, values, options, comment, comments) {\n ReflectionObject.call(this, name, options);\n\n if (values && typeof values !== \"object\")\n throw TypeError(\"values must be an object\");\n\n /**\n * Enum values by id.\n * @type {Object.}\n */\n this.valuesById = {};\n\n /**\n * Enum values by name.\n * @type {Object.}\n */\n this.values = Object.create(this.valuesById); // toJSON, marker\n\n /**\n * Enum comment text.\n * @type {string|null}\n */\n this.comment = comment;\n\n /**\n * Value comment texts, if any.\n * @type {Object.}\n */\n this.comments = comments || {};\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n // Note that values inherit valuesById on their prototype which makes them a TypeScript-\n // compatible enum. This is used by pbts to write actual enum definitions that work for\n // static and reflection code alike instead of emitting generic object definitions.\n\n if (values)\n for (var keys = Object.keys(values), i = 0; i < keys.length; ++i)\n if (typeof values[keys[i]] === \"number\") // use forward entries only\n this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i];\n}\n\n/**\n * Enum descriptor.\n * @interface IEnum\n * @property {Object.} values Enum values\n * @property {Object.} [options] Enum options\n */\n\n/**\n * Constructs an enum from an enum descriptor.\n * @param {string} name Enum name\n * @param {IEnum} json Enum descriptor\n * @returns {Enum} Created enum\n * @throws {TypeError} If arguments are invalid\n */\nEnum.fromJSON = function fromJSON(name, json) {\n var enm = new Enum(name, json.values, json.options, json.comment, json.comments);\n enm.reserved = json.reserved;\n return enm;\n};\n\n/**\n * Converts this enum to an enum descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IEnum} Enum descriptor\n */\nEnum.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , this.options,\n \"values\" , this.values,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"comment\" , keepComments ? this.comment : undefined,\n \"comments\" , keepComments ? this.comments : undefined\n ]);\n};\n\n/**\n * Adds a value to this enum.\n * @param {string} name Value name\n * @param {number} id Value id\n * @param {string} [comment] Comment, if any\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a value with this name or id\n */\nEnum.prototype.add = function add(name, id, comment) {\n // utilized by the parser but not by .fromJSON\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (!util.isInteger(id))\n throw TypeError(\"id must be an integer\");\n\n if (this.values[name] !== undefined)\n throw Error(\"duplicate name '\" + name + \"' in \" + this);\n\n if (this.isReservedId(id))\n throw Error(\"id \" + id + \" is reserved in \" + this);\n\n if (this.isReservedName(name))\n throw Error(\"name '\" + name + \"' is reserved in \" + this);\n\n if (this.valuesById[id] !== undefined) {\n if (!(this.options && this.options.allow_alias))\n throw Error(\"duplicate id \" + id + \" in \" + this);\n this.values[name] = id;\n } else\n this.valuesById[this.values[name] = id] = name;\n\n this.comments[name] = comment || null;\n return this;\n};\n\n/**\n * Removes a value from this enum\n * @param {string} name Value name\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `name` is not a name of this enum\n */\nEnum.prototype.remove = function remove(name) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n var val = this.values[name];\n if (val == null)\n throw Error(\"name '\" + name + \"' does not exist in \" + this);\n\n delete this.valuesById[val];\n delete this.values[name];\n delete this.comments[name];\n\n return this;\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\n};\n","\"use strict\";\nvar util = exports;\n\n// used to return a Promise where callback is omitted\nutil.asPromise = require(\"@protobufjs/aspromise\");\n\n// converts to / from base64 encoded strings\nutil.base64 = require(\"@protobufjs/base64\");\n\n// base class of rpc.Service\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\n\n// float handling accross browsers\nutil.float = require(\"@protobufjs/float\");\n\n// requires modules optionally and hides the call from bundlers\nutil.inquire = require(\"@protobufjs/inquire\");\n\n// converts to / from utf8 encoded strings\nutil.utf8 = require(\"@protobufjs/utf8\");\n\n// provides a node-like buffer pool in the browser\nutil.pool = require(\"@protobufjs/pool\");\n\n// utility to work with the low and high bits of a 64 bit value\nutil.LongBits = require(\"./longbits\");\n\n// global object reference\nutil.global = typeof window !== \"undefined\" && window\n || typeof global !== \"undefined\" && global\n || typeof self !== \"undefined\" && self\n || this; // eslint-disable-line no-invalid-this\n\n/**\n * An immuable empty array.\n * @memberof util\n * @type {Array.<*>}\n * @const\n */\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\n\n/**\n * An immutable empty object.\n * @type {Object}\n * @const\n */\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\n\n/**\n * Whether running within node or not.\n * @memberof util\n * @type {boolean}\n * @const\n */\nutil.isNode = Boolean(util.global.process && util.global.process.versions && util.global.process.versions.node);\n\n/**\n * Tests if the specified value is an integer.\n * @function\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is an integer\n */\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\n};\n\n/**\n * Tests if the specified value is a string.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a string\n */\nutil.isString = function isString(value) {\n return typeof value === \"string\" || value instanceof String;\n};\n\n/**\n * Tests if the specified value is a non-null object.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a non-null object\n */\nutil.isObject = function isObject(value) {\n return value && typeof value === \"object\";\n};\n\n/**\n * Checks if a property on a message is considered to be present.\n * This is an alias of {@link util.isSet}.\n * @function\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isset =\n\n/**\n * Checks if a property on a message is considered to be present.\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isSet = function isSet(obj, prop) {\n var value = obj[prop];\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\n return false;\n};\n\n/**\n * Any compatible Buffer instance.\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\n * @interface Buffer\n * @extends Uint8Array\n */\n// 纯粹为了解决问题做的\nutil.BufferTemp = require('buffer').Buffer;\n/**\n * Node's Buffer class if available.\n * @type {Constructor}\n */\nutil.Buffer = (function() {\n try {\n var Buffer = util.inquire(\"buffer\").Buffer;\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\n } catch (e) {\n /* istanbul ignore next */\n return null;\n }\n})();\n\n// Internal alias of or polyfull for Buffer.from.\nutil._Buffer_from = null;\n\n// Internal alias of or polyfill for Buffer.allocUnsafe.\nutil._Buffer_allocUnsafe = null;\n\n/**\n * Creates a new buffer of whatever type supported by the environment.\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\n * @returns {Uint8Array|Buffer} Buffer\n */\nutil.newBuffer = function newBuffer(sizeOrArray) {\n /* istanbul ignore next */\n return typeof sizeOrArray === \"number\"\n ? util.Buffer\n ? util._Buffer_allocUnsafe(sizeOrArray)\n : new util.Array(sizeOrArray)\n : util.Buffer\n ? util._Buffer_from(sizeOrArray)\n : typeof Uint8Array === \"undefined\"\n ? sizeOrArray\n : new Uint8Array(sizeOrArray);\n};\n\n/**\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\n * @type {Constructor}\n */\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\n\n/**\n * Any compatible Long instance.\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\n * @interface Long\n * @property {number} low Low bits\n * @property {number} high High bits\n * @property {boolean} unsigned Whether unsigned or not\n */\n\n/**\n * Long.js's Long class if available.\n * @type {Constructor}\n */\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\n || /* istanbul ignore next */ util.global.Long\n || util.inquire(\"long\");\n\n/**\n * Regular expression used to verify 2 bit (`bool`) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key2Re = /^true|false|0|1$/;\n\n/**\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\n\n/**\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\n\n/**\n * Converts a number or long to an 8 characters long hash string.\n * @param {Long|number} value Value to convert\n * @returns {string} Hash\n */\nutil.longToHash = function longToHash(value) {\n return value\n ? util.LongBits.from(value).toHash()\n : util.LongBits.zeroHash;\n};\n\n/**\n * Converts an 8 characters long hash string to a long or number.\n * @param {string} hash Hash\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long|number} Original value\n */\nutil.longFromHash = function longFromHash(hash, unsigned) {\n var bits = util.LongBits.fromHash(hash);\n if (util.Long)\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\n return bits.toNumber(Boolean(unsigned));\n};\n\n/**\n * Merges the properties of the source object into the destination object.\n * @memberof util\n * @param {Object.} dst Destination object\n * @param {Object.} src Source object\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\n * @returns {Object.} Destination object\n */\nfunction merge(dst, src, ifNotSet) { // used by converters\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\n if (dst[keys[i]] === undefined || !ifNotSet)\n dst[keys[i]] = src[keys[i]];\n return dst;\n}\n\nutil.merge = merge;\n\n/**\n * Converts the first character of a string to lower case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.lcFirst = function lcFirst(str) {\n return str.charAt(0).toLowerCase() + str.substring(1);\n};\n\n/**\n * Creates a custom error constructor.\n * @memberof util\n * @param {string} name Error name\n * @returns {Constructor} Custom error constructor\n */\nfunction newError(name) {\n\n function CustomError(message, properties) {\n\n if (!(this instanceof CustomError))\n return new CustomError(message, properties);\n\n // Error.call(this, message);\n // ^ just returns a new error instance because the ctor can be called as a function\n\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\n\n /* istanbul ignore next */\n if (Error.captureStackTrace) // node\n Error.captureStackTrace(this, CustomError);\n else\n Object.defineProperty(this, \"stack\", { value: (new Error()).stack || \"\" });\n\n if (properties)\n merge(this, properties);\n }\n\n (CustomError.prototype = Object.create(Error.prototype)).constructor = CustomError;\n\n Object.defineProperty(CustomError.prototype, \"name\", { get: function() { return name; } });\n\n CustomError.prototype.toString = function toString() {\n return this.name + \": \" + this.message;\n };\n\n return CustomError;\n}\n\nutil.newError = newError;\n\n/**\n * Constructs a new protocol error.\n * @classdesc Error subclass indicating a protocol specifc error.\n * @memberof util\n * @extends Error\n * @template T extends Message\n * @constructor\n * @param {string} message Error message\n * @param {Object.} [properties] Additional properties\n * @example\n * try {\n * MyMessage.decode(someBuffer); // throws if required fields are missing\n * } catch (e) {\n * if (e instanceof ProtocolError && e.instance)\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\n * }\n */\nutil.ProtocolError = newError(\"ProtocolError\");\n\n/**\n * So far decoded message instance.\n * @name util.ProtocolError#instance\n * @type {Message}\n */\n\n/**\n * A OneOf getter as returned by {@link util.oneOfGetter}.\n * @typedef OneOfGetter\n * @type {function}\n * @returns {string|undefined} Set field name, if any\n */\n\n/**\n * Builds a getter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfGetter} Unbound getter\n */\nutil.oneOfGetter = function getOneOf(fieldNames) {\n var fieldMap = {};\n for (var i = 0; i < fieldNames.length; ++i)\n fieldMap[fieldNames[i]] = 1;\n\n /**\n * @returns {string|undefined} Set field name, if any\n * @this Object\n * @ignore\n */\n return function() { // eslint-disable-line consistent-return\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\n return keys[i];\n };\n};\n\n/**\n * A OneOf setter as returned by {@link util.oneOfSetter}.\n * @typedef OneOfSetter\n * @type {function}\n * @param {string|undefined} value Field name\n * @returns {undefined}\n */\n\n/**\n * Builds a setter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfSetter} Unbound setter\n */\nutil.oneOfSetter = function setOneOf(fieldNames) {\n\n /**\n * @param {string} name Field name\n * @returns {undefined}\n * @this Object\n * @ignore\n */\n return function(name) {\n for (var i = 0; i < fieldNames.length; ++i)\n if (fieldNames[i] !== name)\n delete this[fieldNames[i]];\n };\n};\n\n/**\n * Default conversion options used for {@link Message#toJSON} implementations.\n *\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\n *\n * - Longs become strings\n * - Enums become string keys\n * - Bytes become base64 encoded strings\n * - (Sub-)Messages become plain objects\n * - Maps become plain objects with all string keys\n * - Repeated fields become arrays\n * - NaN and Infinity for float and double fields become strings\n *\n * @type {IConversionOptions}\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\n */\nutil.toJSONOptions = {\n longs: String,\n enums: String,\n bytes: String,\n json: true\n};\n\n// Sets up buffer utility according to the environment (called in index-minimal)\nutil._configure = function() {\n var Buffer = util.Buffer;\n /* istanbul ignore if */\n if (!Buffer) {\n // util._Buffer_from = util._Buffer_allocUnsafe = null;\n util._Buffer_from = null;\n util._Buffer_allocUnsafe = function Buffer_allocUnsafe(size) {\n return new util.BufferTemp(size);\n };\n return;\n }\n // because node 4.x buffers are incompatible & immutable\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\n /* istanbul ignore next */\n function Buffer_from(value, encoding) {\n return new Buffer(value, encoding);\n };\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\n /* istanbul ignore next */\n function Buffer_allocUnsafe(size) {\n return new Buffer(size);\n };\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nexports.inherits = inherits;\n\nfunction isSurrogatePair(msg, i) {\n if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {\n return false;\n }\n if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg === 'string') {\n if (!enc) {\n // Inspired by stringToUtf8ByteArray() in closure-library by Google\n // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n // Apache License 2.0\n // https://github.com/google/closure-library/blob/master/LICENSE\n var p = 0;\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n if (c < 128) {\n res[p++] = c;\n } else if (c < 2048) {\n res[p++] = (c >> 6) | 192;\n res[p++] = (c & 63) | 128;\n } else if (isSurrogatePair(msg, i)) {\n c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);\n res[p++] = (c >> 18) | 240;\n res[p++] = ((c >> 12) & 63) | 128;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n } else {\n res[p++] = (c >> 12) | 224;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n }\n }\n } else if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n }\n return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = (w >>> 24) |\n ((w >>> 8) & 0xff00) |\n ((w << 8) & 0xff0000) |\n ((w & 0xff) << 24);\n return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little')\n w = htonl(w);\n res += zero8(w.toString(16));\n }\n return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7)\n return '0' + word;\n else if (word.length === 6)\n return '00' + word;\n else if (word.length === 5)\n return '000' + word;\n else if (word.length === 4)\n return '0000' + word;\n else if (word.length === 3)\n return '00000' + word;\n else if (word.length === 2)\n return '000000' + word;\n else if (word.length === 1)\n return '0000000' + word;\n else\n return word;\n}\nexports.zero8 = zero8;\n\nfunction join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n var res = new Array(len / 4);\n for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big')\n w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n else\n w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n res[i] = w >>> 0;\n }\n return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n if (endian === 'big') {\n res[k] = m >>> 24;\n res[k + 1] = (m >>> 16) & 0xff;\n res[k + 2] = (m >>> 8) & 0xff;\n res[k + 3] = m & 0xff;\n } else {\n res[k + 3] = m >>> 24;\n res[k + 2] = (m >>> 16) & 0xff;\n res[k + 1] = (m >>> 8) & 0xff;\n res[k] = m & 0xff;\n }\n }\n return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n}\nexports.sum32_5 = sum32_5;\n\nfunction sum64(buf, pos, ah, al) {\n var bh = buf[pos];\n var bl = buf[pos + 1];\n\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n buf[pos] = hi >>> 0;\n buf[pos + 1] = lo;\n}\nexports.sum64 = sum64;\n\nfunction sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n}\nexports.sum64_lo = sum64_lo;\n\nfunction sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n}\nexports.sum64_4_hi = sum64_4_hi;\n\nfunction sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n}\nexports.sum64_4_lo = sum64_4_lo;\n\nfunction sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n lo = (lo + el) >>> 0;\n carry += lo < el ? 1 : 0;\n\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n}\nexports.sum64_5_hi = sum64_5_hi;\n\nfunction sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n\n return lo >>> 0;\n}\nexports.sum64_5_lo = sum64_5_lo;\n\nfunction rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n}\nexports.rotr64_hi = rotr64_hi;\n\nfunction rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\n}\nexports.shr64_hi = shr64_hi;\n\nfunction shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.shr64_lo = shr64_lo;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n ? R.apply\n : function ReflectApply(target, receiver, args) {\n return Function.prototype.apply.call(target, receiver, args);\n }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target)\n .concat(Object.getOwnPropertySymbols(target));\n };\n} else {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target);\n };\n}\n\nfunction ProcessEmitWarning(warning) {\n if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n return value !== value;\n}\n\nfunction EventEmitter() {\n EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n if (typeof listener !== 'function') {\n throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n enumerable: true,\n get: function() {\n return defaultMaxListeners;\n },\n set: function(arg) {\n if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n }\n defaultMaxListeners = arg;\n }\n});\n\nEventEmitter.init = function() {\n\n if (this._events === undefined ||\n this._events === Object.getPrototypeOf(this)._events) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n }\n\n this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n }\n this._maxListeners = n;\n return this;\n};\n\nfunction _getMaxListeners(that) {\n if (that._maxListeners === undefined)\n return EventEmitter.defaultMaxListeners;\n return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n var args = [];\n for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n var doError = (type === 'error');\n\n var events = this._events;\n if (events !== undefined)\n doError = (doError && events.error === undefined);\n else if (!doError)\n return false;\n\n // If there is no 'error' event listener then throw.\n if (doError) {\n var er;\n if (args.length > 0)\n er = args[0];\n if (er instanceof Error) {\n // Note: The comments on the `throw` lines are intentional, they show\n // up in Node's output if this results in an unhandled exception.\n throw er; // Unhandled 'error' event\n }\n // At least give some kind of context to the user\n var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n err.context = er;\n throw err; // Unhandled 'error' event\n }\n\n var handler = events[type];\n\n if (handler === undefined)\n return false;\n\n if (typeof handler === 'function') {\n ReflectApply(handler, this, args);\n } else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i)\n ReflectApply(listeners[i], this, args);\n }\n\n return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n var m;\n var events;\n var existing;\n\n checkListener(listener);\n\n events = target._events;\n if (events === undefined) {\n events = target._events = Object.create(null);\n target._eventsCount = 0;\n } else {\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (events.newListener !== undefined) {\n target.emit('newListener', type,\n listener.listener ? listener.listener : listener);\n\n // Re-assign `events` because a newListener handler could have caused the\n // this._events to be assigned to a new object\n events = target._events;\n }\n existing = events[type];\n }\n\n if (existing === undefined) {\n // Optimize the case of one listener. Don't need the extra array object.\n existing = events[type] = listener;\n ++target._eventsCount;\n } else {\n if (typeof existing === 'function') {\n // Adding the second element, need to change to array.\n existing = events[type] =\n prepend ? [listener, existing] : [existing, listener];\n // If we've already got an array, just append.\n } else if (prepend) {\n existing.unshift(listener);\n } else {\n existing.push(listener);\n }\n\n // Check for listener leak\n m = _getMaxListeners(target);\n if (m > 0 && existing.length > m && !existing.warned) {\n existing.warned = true;\n // No error code for this since it is a Warning\n // eslint-disable-next-line no-restricted-syntax\n var w = new Error('Possible EventEmitter memory leak detected. ' +\n existing.length + ' ' + String(type) + ' listeners ' +\n 'added. Use emitter.setMaxListeners() to ' +\n 'increase limit');\n w.name = 'MaxListenersExceededWarning';\n w.emitter = target;\n w.type = type;\n w.count = existing.length;\n ProcessEmitWarning(w);\n }\n }\n\n return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n function prependListener(type, listener) {\n return _addListener(this, type, listener, true);\n };\n\nfunction onceWrapper() {\n if (!this.fired) {\n this.target.removeListener(this.type, this.wrapFn);\n this.fired = true;\n if (arguments.length === 0)\n return this.listener.call(this.target);\n return this.listener.apply(this.target, arguments);\n }\n}\n\nfunction _onceWrap(target, type, listener) {\n var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n var wrapped = onceWrapper.bind(state);\n wrapped.listener = listener;\n state.wrapFn = wrapped;\n return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n checkListener(listener);\n this.on(type, _onceWrap(this, type, listener));\n return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n function prependOnceListener(type, listener) {\n checkListener(listener);\n this.prependListener(type, _onceWrap(this, type, listener));\n return this;\n };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n function removeListener(type, listener) {\n var list, events, position, i, originalListener;\n\n checkListener(listener);\n\n events = this._events;\n if (events === undefined)\n return this;\n\n list = events[type];\n if (list === undefined)\n return this;\n\n if (list === listener || list.listener === listener) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else {\n delete events[type];\n if (events.removeListener)\n this.emit('removeListener', type, list.listener || listener);\n }\n } else if (typeof list !== 'function') {\n position = -1;\n\n for (i = list.length - 1; i >= 0; i--) {\n if (list[i] === listener || list[i].listener === listener) {\n originalListener = list[i].listener;\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (position === 0)\n list.shift();\n else {\n spliceOne(list, position);\n }\n\n if (list.length === 1)\n events[type] = list[0];\n\n if (events.removeListener !== undefined)\n this.emit('removeListener', type, originalListener || listener);\n }\n\n return this;\n };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n function removeAllListeners(type) {\n var listeners, events, i;\n\n events = this._events;\n if (events === undefined)\n return this;\n\n // not listening for removeListener, no need to emit\n if (events.removeListener === undefined) {\n if (arguments.length === 0) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n } else if (events[type] !== undefined) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else\n delete events[type];\n }\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n var keys = Object.keys(events);\n var key;\n for (i = 0; i < keys.length; ++i) {\n key = keys[i];\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = Object.create(null);\n this._eventsCount = 0;\n return this;\n }\n\n listeners = events[type];\n\n if (typeof listeners === 'function') {\n this.removeListener(type, listeners);\n } else if (listeners !== undefined) {\n // LIFO order\n for (i = listeners.length - 1; i >= 0; i--) {\n this.removeListener(type, listeners[i]);\n }\n }\n\n return this;\n };\n\nfunction _listeners(target, type, unwrap) {\n var events = target._events;\n\n if (events === undefined)\n return [];\n\n var evlistener = events[type];\n if (evlistener === undefined)\n return [];\n\n if (typeof evlistener === 'function')\n return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n return unwrap ?\n unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n if (typeof emitter.listenerCount === 'function') {\n return emitter.listenerCount(type);\n } else {\n return listenerCount.call(emitter, type);\n }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n var events = this._events;\n\n if (events !== undefined) {\n var evlistener = events[type];\n\n if (typeof evlistener === 'function') {\n return 1;\n } else if (evlistener !== undefined) {\n return evlistener.length;\n }\n }\n\n return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n var copy = new Array(n);\n for (var i = 0; i < n; ++i)\n copy[i] = arr[i];\n return copy;\n}\n\nfunction spliceOne(list, index) {\n for (; index + 1 < list.length; index++)\n list[index] = list[index + 1];\n list.pop();\n}\n\nfunction unwrapListeners(arr) {\n var ret = new Array(arr.length);\n for (var i = 0; i < ret.length; ++i) {\n ret[i] = arr[i].listener || arr[i];\n }\n return ret;\n}\n\nfunction once(emitter, name) {\n return new Promise(function (resolve, reject) {\n function errorListener(err) {\n emitter.removeListener(name, resolver);\n reject(err);\n }\n\n function resolver() {\n if (typeof emitter.removeListener === 'function') {\n emitter.removeListener('error', errorListener);\n }\n resolve([].slice.call(arguments));\n };\n\n eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n if (name !== 'error') {\n addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n }\n });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n if (typeof emitter.on === 'function') {\n eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n if (typeof emitter.on === 'function') {\n if (flags.once) {\n emitter.once(name, listener);\n } else {\n emitter.on(name, listener);\n }\n } else if (typeof emitter.addEventListener === 'function') {\n // EventTarget does not have `error` event semantics like Node\n // EventEmitters, we do not listen for `error` events here.\n emitter.addEventListener(name, function wrapListener(arg) {\n // IE does not have builtin `{ once: true }` support so we\n // have to do it manually.\n if (flags.once) {\n emitter.removeEventListener(name, wrapListener);\n }\n listener(arg);\n });\n } else {\n throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n }\n}\n",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory();\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\troot.CryptoJS = factory();\n\t}\n}(this, function () {\n\n\t/*globals window, global, require*/\n\n\t/**\n\t * CryptoJS core components.\n\t */\n\tvar CryptoJS = CryptoJS || (function (Math, undefined) {\n\n\t var crypto;\n\n\t // Native crypto from window (Browser)\n\t if (typeof window !== 'undefined' && window.crypto) {\n\t crypto = window.crypto;\n\t }\n\n\t // Native crypto in web worker (Browser)\n\t if (typeof self !== 'undefined' && self.crypto) {\n\t crypto = self.crypto;\n\t }\n\n\t // Native crypto from worker\n\t if (typeof globalThis !== 'undefined' && globalThis.crypto) {\n\t crypto = globalThis.crypto;\n\t }\n\n\t // Native (experimental IE 11) crypto from window (Browser)\n\t if (!crypto && typeof window !== 'undefined' && window.msCrypto) {\n\t crypto = window.msCrypto;\n\t }\n\n\t // Native crypto from global (NodeJS)\n\t if (!crypto && typeof global !== 'undefined' && global.crypto) {\n\t crypto = global.crypto;\n\t }\n\n\t // Native crypto import via require (NodeJS)\n\t if (!crypto && typeof require === 'function') {\n\t try {\n\t crypto = require('crypto');\n\t } catch (err) {}\n\t }\n\n\t /*\n\t * Cryptographically secure pseudorandom number generator\n\t *\n\t * As Math.random() is cryptographically not safe to use\n\t */\n\t var cryptoSecureRandomInt = function () {\n\t if (crypto) {\n\t // Use getRandomValues method (Browser)\n\t if (typeof crypto.getRandomValues === 'function') {\n\t try {\n\t return crypto.getRandomValues(new Uint32Array(1))[0];\n\t } catch (err) {}\n\t }\n\n\t // Use randomBytes method (NodeJS)\n\t if (typeof crypto.randomBytes === 'function') {\n\t try {\n\t return crypto.randomBytes(4).readInt32LE();\n\t } catch (err) {}\n\t }\n\t }\n\n\t throw new Error('Native crypto module could not be used to get secure random number.');\n\t };\n\n\t /*\n\t * Local polyfill of Object.create\n\n\t */\n\t var create = Object.create || (function () {\n\t function F() {}\n\n\t return function (obj) {\n\t var subtype;\n\n\t F.prototype = obj;\n\n\t subtype = new F();\n\n\t F.prototype = null;\n\n\t return subtype;\n\t };\n\t }());\n\n\t /**\n\t * CryptoJS namespace.\n\t */\n\t var C = {};\n\n\t /**\n\t * Library namespace.\n\t */\n\t var C_lib = C.lib = {};\n\n\t /**\n\t * Base object for prototypal inheritance.\n\t */\n\t var Base = C_lib.Base = (function () {\n\n\n\t return {\n\t /**\n\t * Creates a new object that inherits from this object.\n\t *\n\t * @param {Object} overrides Properties to copy into the new object.\n\t *\n\t * @return {Object} The new object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var MyType = CryptoJS.lib.Base.extend({\n\t * field: 'value',\n\t *\n\t * method: function () {\n\t * }\n\t * });\n\t */\n\t extend: function (overrides) {\n\t // Spawn\n\t var subtype = create(this);\n\n\t // Augment\n\t if (overrides) {\n\t subtype.mixIn(overrides);\n\t }\n\n\t // Create default initializer\n\t if (!subtype.hasOwnProperty('init') || this.init === subtype.init) {\n\t subtype.init = function () {\n\t subtype.$super.init.apply(this, arguments);\n\t };\n\t }\n\n\t // Initializer's prototype is the subtype object\n\t subtype.init.prototype = subtype;\n\n\t // Reference supertype\n\t subtype.$super = this;\n\n\t return subtype;\n\t },\n\n\t /**\n\t * Extends this object and runs the init method.\n\t * Arguments to create() will be passed to init().\n\t *\n\t * @return {Object} The new object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var instance = MyType.create();\n\t */\n\t create: function () {\n\t var instance = this.extend();\n\t instance.init.apply(instance, arguments);\n\n\t return instance;\n\t },\n\n\t /**\n\t * Initializes a newly created object.\n\t * Override this method to add some logic when your objects are created.\n\t *\n\t * @example\n\t *\n\t * var MyType = CryptoJS.lib.Base.extend({\n\t * init: function () {\n\t * // ...\n\t * }\n\t * });\n\t */\n\t init: function () {\n\t },\n\n\t /**\n\t * Copies properties into this object.\n\t *\n\t * @param {Object} properties The properties to mix in.\n\t *\n\t * @example\n\t *\n\t * MyType.mixIn({\n\t * field: 'value'\n\t * });\n\t */\n\t mixIn: function (properties) {\n\t for (var propertyName in properties) {\n\t if (properties.hasOwnProperty(propertyName)) {\n\t this[propertyName] = properties[propertyName];\n\t }\n\t }\n\n\t // IE won't copy toString using the loop above\n\t if (properties.hasOwnProperty('toString')) {\n\t this.toString = properties.toString;\n\t }\n\t },\n\n\t /**\n\t * Creates a copy of this object.\n\t *\n\t * @return {Object} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = instance.clone();\n\t */\n\t clone: function () {\n\t return this.init.prototype.extend(this);\n\t }\n\t };\n\t }());\n\n\t /**\n\t * An array of 32-bit words.\n\t *\n\t * @property {Array} words The array of 32-bit words.\n\t * @property {number} sigBytes The number of significant bytes in this word array.\n\t */\n\t var WordArray = C_lib.WordArray = Base.extend({\n\t /**\n\t * Initializes a newly created word array.\n\t *\n\t * @param {Array} words (Optional) An array of 32-bit words.\n\t * @param {number} sigBytes (Optional) The number of significant bytes in the words.\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.lib.WordArray.create();\n\t * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);\n\t * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);\n\t */\n\t init: function (words, sigBytes) {\n\t words = this.words = words || [];\n\n\t if (sigBytes != undefined) {\n\t this.sigBytes = sigBytes;\n\t } else {\n\t this.sigBytes = words.length * 4;\n\t }\n\t },\n\n\t /**\n\t * Converts this word array to a string.\n\t *\n\t * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex\n\t *\n\t * @return {string} The stringified word array.\n\t *\n\t * @example\n\t *\n\t * var string = wordArray + '';\n\t * var string = wordArray.toString();\n\t * var string = wordArray.toString(CryptoJS.enc.Utf8);\n\t */\n\t toString: function (encoder) {\n\t return (encoder || Hex).stringify(this);\n\t },\n\n\t /**\n\t * Concatenates a word array to this word array.\n\t *\n\t * @param {WordArray} wordArray The word array to append.\n\t *\n\t * @return {WordArray} This word array.\n\t *\n\t * @example\n\t *\n\t * wordArray1.concat(wordArray2);\n\t */\n\t concat: function (wordArray) {\n\t // Shortcuts\n\t var thisWords = this.words;\n\t var thatWords = wordArray.words;\n\t var thisSigBytes = this.sigBytes;\n\t var thatSigBytes = wordArray.sigBytes;\n\n\t // Clamp excess bits\n\t this.clamp();\n\n\t // Concat\n\t if (thisSigBytes % 4) {\n\t // Copy one byte at a time\n\t for (var i = 0; i < thatSigBytes; i++) {\n\t var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8);\n\t }\n\t } else {\n\t // Copy one word at a time\n\t for (var j = 0; j < thatSigBytes; j += 4) {\n\t thisWords[(thisSigBytes + j) >>> 2] = thatWords[j >>> 2];\n\t }\n\t }\n\t this.sigBytes += thatSigBytes;\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Removes insignificant bits.\n\t *\n\t * @example\n\t *\n\t * wordArray.clamp();\n\t */\n\t clamp: function () {\n\t // Shortcuts\n\t var words = this.words;\n\t var sigBytes = this.sigBytes;\n\n\t // Clamp\n\t words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);\n\t words.length = Math.ceil(sigBytes / 4);\n\t },\n\n\t /**\n\t * Creates a copy of this word array.\n\t *\n\t * @return {WordArray} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = wordArray.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\t clone.words = this.words.slice(0);\n\n\t return clone;\n\t },\n\n\t /**\n\t * Creates a word array filled with random bytes.\n\t *\n\t * @param {number} nBytes The number of random bytes to generate.\n\t *\n\t * @return {WordArray} The random word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.lib.WordArray.random(16);\n\t */\n\t random: function (nBytes) {\n\t var words = [];\n\n\t for (var i = 0; i < nBytes; i += 4) {\n\t words.push(cryptoSecureRandomInt());\n\t }\n\n\t return new WordArray.init(words, nBytes);\n\t }\n\t });\n\n\t /**\n\t * Encoder namespace.\n\t */\n\t var C_enc = C.enc = {};\n\n\t /**\n\t * Hex encoding strategy.\n\t */\n\t var Hex = C_enc.Hex = {\n\t /**\n\t * Converts a word array to a hex string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The hex string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hexString = CryptoJS.enc.Hex.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var hexChars = [];\n\t for (var i = 0; i < sigBytes; i++) {\n\t var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t hexChars.push((bite >>> 4).toString(16));\n\t hexChars.push((bite & 0x0f).toString(16));\n\t }\n\n\t return hexChars.join('');\n\t },\n\n\t /**\n\t * Converts a hex string to a word array.\n\t *\n\t * @param {string} hexStr The hex string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Hex.parse(hexString);\n\t */\n\t parse: function (hexStr) {\n\t // Shortcut\n\t var hexStrLength = hexStr.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < hexStrLength; i += 2) {\n\t words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);\n\t }\n\n\t return new WordArray.init(words, hexStrLength / 2);\n\t }\n\t };\n\n\t /**\n\t * Latin1 encoding strategy.\n\t */\n\t var Latin1 = C_enc.Latin1 = {\n\t /**\n\t * Converts a word array to a Latin1 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The Latin1 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var latin1Chars = [];\n\t for (var i = 0; i < sigBytes; i++) {\n\t var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t latin1Chars.push(String.fromCharCode(bite));\n\t }\n\n\t return latin1Chars.join('');\n\t },\n\n\t /**\n\t * Converts a Latin1 string to a word array.\n\t *\n\t * @param {string} latin1Str The Latin1 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Latin1.parse(latin1String);\n\t */\n\t parse: function (latin1Str) {\n\t // Shortcut\n\t var latin1StrLength = latin1Str.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < latin1StrLength; i++) {\n\t words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);\n\t }\n\n\t return new WordArray.init(words, latin1StrLength);\n\t }\n\t };\n\n\t /**\n\t * UTF-8 encoding strategy.\n\t */\n\t var Utf8 = C_enc.Utf8 = {\n\t /**\n\t * Converts a word array to a UTF-8 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The UTF-8 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t try {\n\t return decodeURIComponent(escape(Latin1.stringify(wordArray)));\n\t } catch (e) {\n\t throw new Error('Malformed UTF-8 data');\n\t }\n\t },\n\n\t /**\n\t * Converts a UTF-8 string to a word array.\n\t *\n\t * @param {string} utf8Str The UTF-8 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Utf8.parse(utf8String);\n\t */\n\t parse: function (utf8Str) {\n\t return Latin1.parse(unescape(encodeURIComponent(utf8Str)));\n\t }\n\t };\n\n\t /**\n\t * Abstract buffered block algorithm template.\n\t *\n\t * The property blockSize must be implemented in a concrete subtype.\n\t *\n\t * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0\n\t */\n\t var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({\n\t /**\n\t * Resets this block algorithm's data buffer to its initial state.\n\t *\n\t * @example\n\t *\n\t * bufferedBlockAlgorithm.reset();\n\t */\n\t reset: function () {\n\t // Initial values\n\t this._data = new WordArray.init();\n\t this._nDataBytes = 0;\n\t },\n\n\t /**\n\t * Adds new data to this block algorithm's buffer.\n\t *\n\t * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.\n\t *\n\t * @example\n\t *\n\t * bufferedBlockAlgorithm._append('data');\n\t * bufferedBlockAlgorithm._append(wordArray);\n\t */\n\t _append: function (data) {\n\t // Convert string to WordArray, else assume WordArray already\n\t if (typeof data == 'string') {\n\t data = Utf8.parse(data);\n\t }\n\n\t // Append\n\t this._data.concat(data);\n\t this._nDataBytes += data.sigBytes;\n\t },\n\n\t /**\n\t * Processes available data blocks.\n\t *\n\t * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.\n\t *\n\t * @param {boolean} doFlush Whether all blocks and partial blocks should be processed.\n\t *\n\t * @return {WordArray} The processed data.\n\t *\n\t * @example\n\t *\n\t * var processedData = bufferedBlockAlgorithm._process();\n\t * var processedData = bufferedBlockAlgorithm._process(!!'flush');\n\t */\n\t _process: function (doFlush) {\n\t var processedWords;\n\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\t var dataSigBytes = data.sigBytes;\n\t var blockSize = this.blockSize;\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count blocks ready\n\t var nBlocksReady = dataSigBytes / blockSizeBytes;\n\t if (doFlush) {\n\t // Round up to include partial blocks\n\t nBlocksReady = Math.ceil(nBlocksReady);\n\t } else {\n\t // Round down to include only full blocks,\n\t // less the number of blocks that must remain in the buffer\n\t nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);\n\t }\n\n\t // Count words ready\n\t var nWordsReady = nBlocksReady * blockSize;\n\n\t // Count bytes ready\n\t var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);\n\n\t // Process blocks\n\t if (nWordsReady) {\n\t for (var offset = 0; offset < nWordsReady; offset += blockSize) {\n\t // Perform concrete-algorithm logic\n\t this._doProcessBlock(dataWords, offset);\n\t }\n\n\t // Remove processed words\n\t processedWords = dataWords.splice(0, nWordsReady);\n\t data.sigBytes -= nBytesReady;\n\t }\n\n\t // Return processed words\n\t return new WordArray.init(processedWords, nBytesReady);\n\t },\n\n\t /**\n\t * Creates a copy of this object.\n\t *\n\t * @return {Object} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = bufferedBlockAlgorithm.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\t clone._data = this._data.clone();\n\n\t return clone;\n\t },\n\n\t _minBufferSize: 0\n\t });\n\n\t /**\n\t * Abstract hasher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits)\n\t */\n\t var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({\n\t /**\n\t * Configuration options.\n\t */\n\t cfg: Base.extend(),\n\n\t /**\n\t * Initializes a newly created hasher.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for this hash computation.\n\t *\n\t * @example\n\t *\n\t * var hasher = CryptoJS.algo.SHA256.create();\n\t */\n\t init: function (cfg) {\n\t // Apply config defaults\n\t this.cfg = this.cfg.extend(cfg);\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this hasher to its initial state.\n\t *\n\t * @example\n\t *\n\t * hasher.reset();\n\t */\n\t reset: function () {\n\t // Reset data buffer\n\t BufferedBlockAlgorithm.reset.call(this);\n\n\t // Perform concrete-hasher logic\n\t this._doReset();\n\t },\n\n\t /**\n\t * Updates this hasher with a message.\n\t *\n\t * @param {WordArray|string} messageUpdate The message to append.\n\t *\n\t * @return {Hasher} This hasher.\n\t *\n\t * @example\n\t *\n\t * hasher.update('message');\n\t * hasher.update(wordArray);\n\t */\n\t update: function (messageUpdate) {\n\t // Append\n\t this._append(messageUpdate);\n\n\t // Update the hash\n\t this._process();\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Finalizes the hash computation.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} messageUpdate (Optional) A final message update.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @example\n\t *\n\t * var hash = hasher.finalize();\n\t * var hash = hasher.finalize('message');\n\t * var hash = hasher.finalize(wordArray);\n\t */\n\t finalize: function (messageUpdate) {\n\t // Final message update\n\t if (messageUpdate) {\n\t this._append(messageUpdate);\n\t }\n\n\t // Perform concrete-hasher logic\n\t var hash = this._doFinalize();\n\n\t return hash;\n\t },\n\n\t blockSize: 512/32,\n\n\t /**\n\t * Creates a shortcut function to a hasher's object interface.\n\t *\n\t * @param {Hasher} hasher The hasher to create a helper for.\n\t *\n\t * @return {Function} The shortcut function.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);\n\t */\n\t _createHelper: function (hasher) {\n\t return function (message, cfg) {\n\t return new hasher.init(cfg).finalize(message);\n\t };\n\t },\n\n\t /**\n\t * Creates a shortcut function to the HMAC's object interface.\n\t *\n\t * @param {Hasher} hasher The hasher to use in this HMAC helper.\n\t *\n\t * @return {Function} The shortcut function.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);\n\t */\n\t _createHmacHelper: function (hasher) {\n\t return function (message, key) {\n\t return new C_algo.HMAC.init(hasher, key).finalize(message);\n\t };\n\t }\n\t });\n\n\t /**\n\t * Algorithm namespace.\n\t */\n\t var C_algo = C.algo = {};\n\n\t return C;\n\t}(Math));\n\n\n\treturn CryptoJS;\n\n}));","'use strict'\n\n// limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\nvar MAX_BYTES = 65536\n\n// Node supports requesting up to this number of bytes\n// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48\nvar MAX_UINT32 = 4294967295\n\nfunction oldBrowser () {\n throw new Error('Secure random number generation is not supported by this browser.\\nUse Chrome, Firefox or Internet Explorer 11')\n}\n\nvar Buffer = require('safe-buffer').Buffer\nvar crypto = global.crypto || global.msCrypto\n\nif (crypto && crypto.getRandomValues) {\n module.exports = randomBytes\n} else {\n module.exports = oldBrowser\n}\n\nfunction randomBytes (size, cb) {\n // phantomjs needs to throw\n if (size > MAX_UINT32) throw new RangeError('requested too many random bytes')\n\n var bytes = Buffer.allocUnsafe(size)\n\n if (size > 0) { // getRandomValues fails on IE if size == 0\n if (size > MAX_BYTES) { // this is the max bytes crypto.getRandomValues\n // can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues\n for (var generated = 0; generated < size; generated += MAX_BYTES) {\n // buffer.slice automatically checks if the end is past the end of\n // the buffer so we don't have to here\n crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES))\n }\n } else {\n crypto.getRandomValues(bytes)\n }\n }\n\n if (typeof cb === 'function') {\n return process.nextTick(function () {\n cb(null, bytes)\n })\n }\n\n return bytes\n}\n","'use strict'\nvar inherits = require('inherits')\nvar MD5 = require('md5.js')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Base = require('cipher-base')\n\nfunction Hash (hash) {\n Base.call(this, 'digest')\n\n this._hash = hash\n}\n\ninherits(Hash, Base)\n\nHash.prototype._update = function (data) {\n this._hash.update(data)\n}\n\nHash.prototype._final = function () {\n return this._hash.digest()\n}\n\nmodule.exports = function createHash (alg) {\n alg = alg.toLowerCase()\n if (alg === 'md5') return new MD5()\n if (alg === 'rmd160' || alg === 'ripemd160') return new RIPEMD160()\n\n return new Hash(sha(alg))\n}\n","var Buffer = require('safe-buffer').Buffer\nvar Transform = require('stream').Transform\nvar StringDecoder = require('string_decoder').StringDecoder\nvar inherits = require('inherits')\n\nfunction CipherBase (hashMode) {\n Transform.call(this)\n this.hashMode = typeof hashMode === 'string'\n if (this.hashMode) {\n this[hashMode] = this._finalOrDigest\n } else {\n this.final = this._finalOrDigest\n }\n if (this._final) {\n this.__final = this._final\n this._final = null\n }\n this._decoder = null\n this._encoding = null\n}\ninherits(CipherBase, Transform)\n\nCipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n if (typeof data === 'string') {\n data = Buffer.from(data, inputEnc)\n }\n\n var outData = this._update(data)\n if (this.hashMode) return this\n\n if (outputEnc) {\n outData = this._toString(outData, outputEnc)\n }\n\n return outData\n}\n\nCipherBase.prototype.setAutoPadding = function () {}\nCipherBase.prototype.getAuthTag = function () {\n throw new Error('trying to get auth tag in unsupported state')\n}\n\nCipherBase.prototype.setAuthTag = function () {\n throw new Error('trying to set auth tag in unsupported state')\n}\n\nCipherBase.prototype.setAAD = function () {\n throw new Error('trying to set aad in unsupported state')\n}\n\nCipherBase.prototype._transform = function (data, _, next) {\n var err\n try {\n if (this.hashMode) {\n this._update(data)\n } else {\n this.push(this._update(data))\n }\n } catch (e) {\n err = e\n } finally {\n next(err)\n }\n}\nCipherBase.prototype._flush = function (done) {\n var err\n try {\n this.push(this.__final())\n } catch (e) {\n err = e\n }\n\n done(err)\n}\nCipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer.alloc(0)\n if (outputEnc) {\n outData = this._toString(outData, outputEnc, true)\n }\n return outData\n}\n\nCipherBase.prototype._toString = function (value, enc, fin) {\n if (!this._decoder) {\n this._decoder = new StringDecoder(enc)\n this._encoding = enc\n }\n\n if (this._encoding !== enc) throw new Error('can\\'t switch encodings')\n\n var out = this._decoder.write(value)\n if (fin) {\n out += this._decoder.end()\n }\n\n return out\n}\n\nmodule.exports = CipherBase\n","\"use strict\";\nmodule.exports = Field;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = \"Field\";\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar Type; // cyclic\n\nvar ruleRe = /^required|optional|repeated$/;\n\n/**\n * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class.\n * @name Field\n * @classdesc Reflected message field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a field from a field descriptor.\n * @param {string} name Field name\n * @param {IField} json Field descriptor\n * @returns {Field} Created field\n * @throws {TypeError} If arguments are invalid\n */\nField.fromJSON = function fromJSON(name, json) {\n return new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment);\n};\n\n/**\n * Not an actual constructor. Use {@link Field} instead.\n * @classdesc Base class of all reflected message fields. This is not an actual class but here for the sake of having consistent type definitions.\n * @exports FieldBase\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction Field(name, id, type, rule, extend, options, comment) {\n\n if (util.isObject(rule)) {\n comment = extend;\n options = rule;\n rule = extend = undefined;\n } else if (util.isObject(extend)) {\n comment = options;\n options = extend;\n extend = undefined;\n }\n\n ReflectionObject.call(this, name, options);\n\n if (!util.isInteger(id) || id < 0)\n throw TypeError(\"id must be a non-negative integer\");\n\n if (!util.isString(type))\n throw TypeError(\"type must be a string\");\n\n if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase()))\n throw TypeError(\"rule must be a string rule\");\n\n if (extend !== undefined && !util.isString(extend))\n throw TypeError(\"extend must be a string\");\n\n /**\n * Field rule, if any.\n * @type {string|undefined}\n */\n this.rule = rule && rule !== \"optional\" ? rule : undefined; // toJSON\n\n /**\n * Field type.\n * @type {string}\n */\n this.type = type; // toJSON\n\n /**\n * Unique field id.\n * @type {number}\n */\n this.id = id; // toJSON, marker\n\n /**\n * Extended type if different from parent.\n * @type {string|undefined}\n */\n this.extend = extend || undefined; // toJSON\n\n /**\n * Whether this field is required.\n * @type {boolean}\n */\n this.required = rule === \"required\";\n\n /**\n * Whether this field is optional.\n * @type {boolean}\n */\n this.optional = !this.required;\n\n /**\n * Whether this field is repeated.\n * @type {boolean}\n */\n this.repeated = rule === \"repeated\";\n\n /**\n * Whether this field is a map or not.\n * @type {boolean}\n */\n this.map = false;\n\n /**\n * Message this field belongs to.\n * @type {Type|null}\n */\n this.message = null;\n\n /**\n * OneOf this field belongs to, if any,\n * @type {OneOf|null}\n */\n this.partOf = null;\n\n /**\n * The field type's default value.\n * @type {*}\n */\n this.typeDefault = null;\n\n /**\n * The field's default value on prototypes.\n * @type {*}\n */\n this.defaultValue = null;\n\n /**\n * Whether this field's value should be treated as a long.\n * @type {boolean}\n */\n this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false;\n\n /**\n * Whether this field's value is a buffer.\n * @type {boolean}\n */\n this.bytes = type === \"bytes\";\n\n /**\n * Resolved type if not a basic type.\n * @type {Type|Enum|null}\n */\n this.resolvedType = null;\n\n /**\n * Sister-field within the extended type if a declaring extension field.\n * @type {Field|null}\n */\n this.extensionField = null;\n\n /**\n * Sister-field within the declaring namespace if an extended field.\n * @type {Field|null}\n */\n this.declaringField = null;\n\n /**\n * Internally remembers whether this field is packed.\n * @type {boolean|null}\n * @private\n */\n this._packed = null;\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Determines whether this field is packed. Only relevant when repeated and working with proto2.\n * @name Field#packed\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"packed\", {\n get: function() {\n // defaults to packed=true if not explicity set to false\n if (this._packed === null)\n this._packed = this.getOption(\"packed\") !== false;\n return this._packed;\n }\n});\n\n/**\n * @override\n */\nField.prototype.setOption = function setOption(name, value, ifNotSet) {\n if (name === \"packed\") // clear cached before setting\n this._packed = null;\n return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet);\n};\n\n/**\n * Field descriptor.\n * @interface IField\n * @property {string} [rule=\"optional\"] Field rule\n * @property {string} type Field type\n * @property {number} id Field id\n * @property {Object.} [options] Field options\n */\n\n/**\n * Extension field descriptor.\n * @interface IExtensionField\n * @extends IField\n * @property {string} extend Extended type\n */\n\n/**\n * Converts this field to a field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IField} Field descriptor\n */\nField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"rule\" , this.rule !== \"optional\" && this.rule || undefined,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Resolves this field's type references.\n * @returns {Field} `this`\n * @throws {Error} If any reference cannot be resolved\n */\nField.prototype.resolve = function resolve() {\n\n if (this.resolved)\n return this;\n\n if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it\n this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type);\n if (this.resolvedType instanceof Type)\n this.typeDefault = null;\n else // instanceof Enum\n this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined\n }\n\n // use explicitly set default value if present\n if (this.options && this.options[\"default\"] != null) {\n this.typeDefault = this.options[\"default\"];\n if (this.resolvedType instanceof Enum && typeof this.typeDefault === \"string\")\n this.typeDefault = this.resolvedType.values[this.typeDefault];\n }\n\n // remove unnecessary options\n if (this.options) {\n if (this.options.packed === true || this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum))\n delete this.options.packed;\n if (!Object.keys(this.options).length)\n this.options = undefined;\n }\n\n // convert to internal data type if necesssary\n if (this.long) {\n this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === \"u\");\n\n /* istanbul ignore else */\n if (Object.freeze)\n Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it)\n\n } else if (this.bytes && typeof this.typeDefault === \"string\") {\n var buf;\n if (util.base64.test(this.typeDefault))\n util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0);\n else\n util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0);\n this.typeDefault = buf;\n }\n\n // take special care of maps and repeated fields\n if (this.map)\n this.defaultValue = util.emptyObject;\n else if (this.repeated)\n this.defaultValue = util.emptyArray;\n else\n this.defaultValue = this.typeDefault;\n\n // ensure proper value on prototype\n if (this.parent instanceof Type)\n this.parent.ctor.prototype[this.name] = this.defaultValue;\n\n return ReflectionObject.prototype.resolve.call(this);\n};\n\n/**\n * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript).\n * @typedef FieldDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} fieldName Field name\n * @returns {undefined}\n */\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"string\"|\"bool\"|\"bytes\"|Object} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @param {T} [defaultValue] Default value\n * @returns {FieldDecorator} Decorator function\n * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[]\n */\nField.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) {\n\n // submessage: decorate the submessage and use its name as the type\n if (typeof fieldType === \"function\")\n fieldType = util.decorateType(fieldType).name;\n\n // enum reference: create a reflected copy of the enum and keep reuseing it\n else if (fieldType && typeof fieldType === \"object\")\n fieldType = util.decorateEnum(fieldType).name;\n\n return function fieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new Field(fieldName, fieldId, fieldType, fieldRule, { \"default\": defaultValue }));\n };\n};\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {Constructor|string} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @returns {FieldDecorator} Decorator function\n * @template T extends Message\n * @variation 2\n */\n// like Field.d but without a default value\n\n// Sets up cyclic dependencies (called in index-light)\nField._configure = function configure(Type_) {\n Type = Type_;\n};\n","\"use strict\";\nmodule.exports = ReflectionObject;\n\nReflectionObject.className = \"ReflectionObject\";\n\nvar util = require(\"./util\");\n\nvar Root; // cyclic\n\n/**\n * Constructs a new reflection object instance.\n * @classdesc Base class of all reflection objects.\n * @constructor\n * @param {string} name Object name\n * @param {Object.} [options] Declared options\n * @abstract\n */\nfunction ReflectionObject(name, options) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (options && !util.isObject(options))\n throw TypeError(\"options must be an object\");\n\n /**\n * Options.\n * @type {Object.|undefined}\n */\n this.options = options; // toJSON\n\n /**\n * Unique name within its namespace.\n * @type {string}\n */\n this.name = name;\n\n /**\n * Parent namespace.\n * @type {Namespace|null}\n */\n this.parent = null;\n\n /**\n * Whether already resolved or not.\n * @type {boolean}\n */\n this.resolved = false;\n\n /**\n * Comment text, if any.\n * @type {string|null}\n */\n this.comment = null;\n\n /**\n * Defining file name.\n * @type {string|null}\n */\n this.filename = null;\n}\n\nObject.defineProperties(ReflectionObject.prototype, {\n\n /**\n * Reference to the root namespace.\n * @name ReflectionObject#root\n * @type {Root}\n * @readonly\n */\n root: {\n get: function() {\n var ptr = this;\n while (ptr.parent !== null)\n ptr = ptr.parent;\n return ptr;\n }\n },\n\n /**\n * Full name including leading dot.\n * @name ReflectionObject#fullName\n * @type {string}\n * @readonly\n */\n fullName: {\n get: function() {\n var path = [ this.name ],\n ptr = this.parent;\n while (ptr) {\n path.unshift(ptr.name);\n ptr = ptr.parent;\n }\n return path.join(\".\");\n }\n }\n});\n\n/**\n * Converts this reflection object to its descriptor representation.\n * @returns {Object.} Descriptor\n * @abstract\n */\nReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() {\n throw Error(); // not implemented, shouldn't happen\n};\n\n/**\n * Called when this object is added to a parent.\n * @param {ReflectionObject} parent Parent added to\n * @returns {undefined}\n */\nReflectionObject.prototype.onAdd = function onAdd(parent) {\n if (this.parent && this.parent !== parent)\n this.parent.remove(this);\n this.parent = parent;\n this.resolved = false;\n var root = parent.root;\n if (root instanceof Root)\n root._handleAdd(this);\n};\n\n/**\n * Called when this object is removed from a parent.\n * @param {ReflectionObject} parent Parent removed from\n * @returns {undefined}\n */\nReflectionObject.prototype.onRemove = function onRemove(parent) {\n var root = parent.root;\n if (root instanceof Root)\n root._handleRemove(this);\n this.parent = null;\n this.resolved = false;\n};\n\n/**\n * Resolves this objects type references.\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n if (this.root instanceof Root)\n this.resolved = true; // only if part of a root\n return this;\n};\n\n/**\n * Gets an option value.\n * @param {string} name Option name\n * @returns {*} Option value or `undefined` if not set\n */\nReflectionObject.prototype.getOption = function getOption(name) {\n if (this.options)\n return this.options[name];\n return undefined;\n};\n\n/**\n * Sets an option.\n * @param {string} name Option name\n * @param {*} value Option value\n * @param {boolean} [ifNotSet] Sets the option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) {\n if (!ifNotSet || !this.options || this.options[name] === undefined)\n (this.options || (this.options = {}))[name] = value;\n return this;\n};\n\n/**\n * Sets multiple options.\n * @param {Object.} options Options to set\n * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) {\n if (options)\n for (var keys = Object.keys(options), i = 0; i < keys.length; ++i)\n this.setOption(keys[i], options[keys[i]], ifNotSet);\n return this;\n};\n\n/**\n * Converts this instance to its string representation.\n * @returns {string} Class name[, space, full name]\n */\nReflectionObject.prototype.toString = function toString() {\n var className = this.constructor.className,\n fullName = this.fullName;\n if (fullName.length)\n return className + \" \" + fullName;\n return className;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nReflectionObject._configure = function(Root_) {\n Root = Root_;\n};\n","\"use strict\";\n\n/**\n * Common type constants.\n * @namespace\n */\nvar types = exports;\n\nvar util = require(\"./util\");\n\nvar s = [\n \"double\", // 0\n \"float\", // 1\n \"int32\", // 2\n \"uint32\", // 3\n \"sint32\", // 4\n \"fixed32\", // 5\n \"sfixed32\", // 6\n \"int64\", // 7\n \"uint64\", // 8\n \"sint64\", // 9\n \"fixed64\", // 10\n \"sfixed64\", // 11\n \"bool\", // 12\n \"string\", // 13\n \"bytes\" // 14\n];\n\nfunction bake(values, offset) {\n var i = 0, o = {};\n offset |= 0;\n while (i < values.length) o[s[i + offset]] = values[i++];\n return o;\n}\n\n/**\n * Basic type wire types.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n * @property {number} bytes=2 Ldelim wire type\n */\ntypes.basic = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2,\n /* bytes */ 2\n]);\n\n/**\n * Basic type defaults.\n * @type {Object.}\n * @const\n * @property {number} double=0 Double default\n * @property {number} float=0 Float default\n * @property {number} int32=0 Int32 default\n * @property {number} uint32=0 Uint32 default\n * @property {number} sint32=0 Sint32 default\n * @property {number} fixed32=0 Fixed32 default\n * @property {number} sfixed32=0 Sfixed32 default\n * @property {number} int64=0 Int64 default\n * @property {number} uint64=0 Uint64 default\n * @property {number} sint64=0 Sint32 default\n * @property {number} fixed64=0 Fixed64 default\n * @property {number} sfixed64=0 Sfixed64 default\n * @property {boolean} bool=false Bool default\n * @property {string} string=\"\" String default\n * @property {Array.} bytes=Array(0) Bytes default\n * @property {null} message=null Message default\n */\ntypes.defaults = bake([\n /* double */ 0,\n /* float */ 0,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 0,\n /* sfixed32 */ 0,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 0,\n /* sfixed64 */ 0,\n /* bool */ false,\n /* string */ \"\",\n /* bytes */ util.emptyArray,\n /* message */ null\n]);\n\n/**\n * Basic long type wire types.\n * @type {Object.}\n * @const\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n */\ntypes.long = bake([\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1\n], 7);\n\n/**\n * Allowed types for map keys with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n */\ntypes.mapKey = bake([\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2\n], 2);\n\n/**\n * Allowed types for packed repeated fields with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n */\ntypes.packed = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0\n]);\n","var Buffer = require('safe-buffer').Buffer\n\n// prototype class for hash functions\nfunction Hash (blockSize, finalSize) {\n this._block = Buffer.alloc(blockSize)\n this._finalSize = finalSize\n this._blockSize = blockSize\n this._len = 0\n}\n\nHash.prototype.update = function (data, enc) {\n if (typeof data === 'string') {\n enc = enc || 'utf8'\n data = Buffer.from(data, enc)\n }\n\n var block = this._block\n var blockSize = this._blockSize\n var length = data.length\n var accum = this._len\n\n for (var offset = 0; offset < length;) {\n var assigned = accum % blockSize\n var remainder = Math.min(length - offset, blockSize - assigned)\n\n for (var i = 0; i < remainder; i++) {\n block[assigned + i] = data[offset + i]\n }\n\n accum += remainder\n offset += remainder\n\n if ((accum % blockSize) === 0) {\n this._update(block)\n }\n }\n\n this._len += length\n return this\n}\n\nHash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize\n\n this._block[rem] = 0x80\n\n // zero (rem + 1) trailing bits, where (rem + 1) is the smallest\n // non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize\n this._block.fill(0, rem + 1)\n\n if (rem >= this._finalSize) {\n this._update(this._block)\n this._block.fill(0)\n }\n\n var bits = this._len * 8\n\n // uint32\n if (bits <= 0xffffffff) {\n this._block.writeUInt32BE(bits, this._blockSize - 4)\n\n // uint64\n } else {\n var lowBits = (bits & 0xffffffff) >>> 0\n var highBits = (bits - lowBits) / 0x100000000\n\n this._block.writeUInt32BE(highBits, this._blockSize - 8)\n this._block.writeUInt32BE(lowBits, this._blockSize - 4)\n }\n\n this._update(this._block)\n var hash = this._hash()\n\n return enc ? hash.toString(enc) : hash\n}\n\nHash.prototype._update = function () {\n throw new Error('_update must be implemented by subclass')\n}\n\nmodule.exports = Hash\n","\"use strict\";\nmodule.exports = Namespace;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = \"Namespace\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\");\n\nvar Type, // cyclic\n Service,\n Enum;\n\n/**\n * Constructs a new namespace instance.\n * @name Namespace\n * @classdesc Reflected namespace.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a namespace from JSON.\n * @memberof Namespace\n * @function\n * @param {string} name Namespace name\n * @param {Object.} json JSON object\n * @returns {Namespace} Created namespace\n * @throws {TypeError} If arguments are invalid\n */\nNamespace.fromJSON = function fromJSON(name, json) {\n return new Namespace(name, json.options).addJSON(json.nested);\n};\n\n/**\n * Converts an array of reflection objects to JSON.\n * @memberof Namespace\n * @param {ReflectionObject[]} array Object array\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {Object.|undefined} JSON object or `undefined` when array is empty\n */\nfunction arrayToJSON(array, toJSONOptions) {\n if (!(array && array.length))\n return undefined;\n var obj = {};\n for (var i = 0; i < array.length; ++i)\n obj[array[i].name] = array[i].toJSON(toJSONOptions);\n return obj;\n}\n\nNamespace.arrayToJSON = arrayToJSON;\n\n/**\n * Tests if the specified id is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedId = function isReservedId(reserved, id) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (typeof reserved[i] !== \"string\" && reserved[i][0] <= id && reserved[i][1] >= id)\n return true;\n return false;\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedName = function isReservedName(reserved, name) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (reserved[i] === name)\n return true;\n return false;\n};\n\n/**\n * Not an actual constructor. Use {@link Namespace} instead.\n * @classdesc Base class of all reflection objects containing nested objects. This is not an actual class but here for the sake of having consistent type definitions.\n * @exports NamespaceBase\n * @extends ReflectionObject\n * @abstract\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n * @see {@link Namespace}\n */\nfunction Namespace(name, options) {\n ReflectionObject.call(this, name, options);\n\n /**\n * Nested objects by name.\n * @type {Object.|undefined}\n */\n this.nested = undefined; // toJSON\n\n /**\n * Cached nested objects as an array.\n * @type {ReflectionObject[]|null}\n * @private\n */\n this._nestedArray = null;\n}\n\nfunction clearCache(namespace) {\n namespace._nestedArray = null;\n return namespace;\n}\n\n/**\n * Nested objects of this namespace as an array for iteration.\n * @name NamespaceBase#nestedArray\n * @type {ReflectionObject[]}\n * @readonly\n */\nObject.defineProperty(Namespace.prototype, \"nestedArray\", {\n get: function() {\n return this._nestedArray || (this._nestedArray = util.toArray(this.nested));\n }\n});\n\n/**\n * Namespace descriptor.\n * @interface INamespace\n * @property {Object.} [options] Namespace options\n * @property {Object.} [nested] Nested object descriptors\n */\n\n/**\n * Any extension field descriptor.\n * @typedef AnyExtensionField\n * @type {IExtensionField|IExtensionMapField}\n */\n\n/**\n * Any nested object descriptor.\n * @typedef AnyNestedObject\n * @type {IEnum|IType|IService|AnyExtensionField|INamespace}\n */\n// ^ BEWARE: VSCode hangs forever when using more than 5 types (that's why AnyExtensionField exists in the first place)\n\n/**\n * Converts this namespace to a namespace descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {INamespace} Namespace descriptor\n */\nNamespace.prototype.toJSON = function toJSON(toJSONOptions) {\n return util.toObject([\n \"options\" , this.options,\n \"nested\" , arrayToJSON(this.nestedArray, toJSONOptions)\n ]);\n};\n\n/**\n * Adds nested objects to this namespace from nested object descriptors.\n * @param {Object.} nestedJson Any nested object descriptors\n * @returns {Namespace} `this`\n */\nNamespace.prototype.addJSON = function addJSON(nestedJson) {\n var ns = this;\n /* istanbul ignore else */\n if (nestedJson) {\n for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) {\n nested = nestedJson[names[i]];\n ns.add( // most to least likely\n ( nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : nested.id !== undefined\n ? Field.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n }\n return this;\n};\n\n/**\n * Gets the nested object of the specified name.\n * @param {string} name Nested object name\n * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist\n */\nNamespace.prototype.get = function get(name) {\n return this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Gets the values of the nested {@link Enum|enum} of the specified name.\n * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`.\n * @param {string} name Nested enum name\n * @returns {Object.} Enum values\n * @throws {Error} If there is no such enum\n */\nNamespace.prototype.getEnum = function getEnum(name) {\n if (this.nested && this.nested[name] instanceof Enum)\n return this.nested[name].values;\n throw Error(\"no such enum: \" + name);\n};\n\n/**\n * Adds a nested object to this namespace.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a nested object with this name\n */\nNamespace.prototype.add = function add(object) {\n\n if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof Enum || object instanceof Service || object instanceof Namespace))\n throw TypeError(\"object must be a valid nested object\");\n\n if (!this.nested)\n this.nested = {};\n else {\n var prev = this.get(object.name);\n if (prev) {\n if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) {\n // replace plain namespace but keep existing nested elements and options\n var nested = prev.nestedArray;\n for (var i = 0; i < nested.length; ++i)\n object.add(nested[i]);\n this.remove(prev);\n if (!this.nested)\n this.nested = {};\n object.setOptions(prev.options, true);\n\n } else\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n }\n }\n this.nested[object.name] = object;\n object.onAdd(this);\n return clearCache(this);\n};\n\n/**\n * Removes a nested object from this namespace.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this namespace\n */\nNamespace.prototype.remove = function remove(object) {\n\n if (!(object instanceof ReflectionObject))\n throw TypeError(\"object must be a ReflectionObject\");\n if (object.parent !== this)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.nested[object.name];\n if (!Object.keys(this.nested).length)\n this.nested = undefined;\n\n object.onRemove(this);\n return clearCache(this);\n};\n\n/**\n * Defines additial namespaces within this one if not yet existing.\n * @param {string|string[]} path Path to create\n * @param {*} [json] Nested types to create from JSON\n * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty\n */\nNamespace.prototype.define = function define(path, json) {\n\n if (util.isString(path))\n path = path.split(\".\");\n else if (!Array.isArray(path))\n throw TypeError(\"illegal path\");\n if (path && path.length && path[0] === \"\")\n throw Error(\"path must be relative\");\n\n var ptr = this;\n while (path.length > 0) {\n var part = path.shift();\n if (ptr.nested && ptr.nested[part]) {\n ptr = ptr.nested[part];\n if (!(ptr instanceof Namespace))\n throw Error(\"path conflicts with non-namespace objects\");\n } else\n ptr.add(ptr = new Namespace(part));\n }\n if (json)\n ptr.addJSON(json);\n return ptr;\n};\n\n/**\n * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost.\n * @returns {Namespace} `this`\n */\nNamespace.prototype.resolveAll = function resolveAll() {\n var nested = this.nestedArray, i = 0;\n while (i < nested.length)\n if (nested[i] instanceof Namespace)\n nested[i++].resolveAll();\n else\n nested[i++].resolve();\n return this.resolve();\n};\n\n/**\n * Recursively looks up the reflection object matching the specified path in the scope of this namespace.\n * @param {string|string[]} path Path to look up\n * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc.\n * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n */\nNamespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) {\n\n /* istanbul ignore next */\n if (typeof filterTypes === \"boolean\") {\n parentAlreadyChecked = filterTypes;\n filterTypes = undefined;\n } else if (filterTypes && !Array.isArray(filterTypes))\n filterTypes = [ filterTypes ];\n\n if (util.isString(path) && path.length) {\n if (path === \".\")\n return this.root;\n path = path.split(\".\");\n } else if (!path.length)\n return this;\n\n // Start at root if path is absolute\n if (path[0] === \"\")\n return this.root.lookup(path.slice(1), filterTypes);\n\n // Test if the first part matches any nested object, and if so, traverse if path contains more\n var found = this.get(path[0]);\n if (found) {\n if (path.length === 1) {\n if (!filterTypes || filterTypes.indexOf(found.constructor) > -1)\n return found;\n } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true)))\n return found;\n\n // Otherwise try each nested namespace\n } else\n for (var i = 0; i < this.nestedArray.length; ++i)\n if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true)))\n return found;\n\n // If there hasn't been a match, try again at the parent\n if (this.parent === null || parentAlreadyChecked)\n return null;\n return this.parent.lookup(path, filterTypes);\n};\n\n/**\n * Looks up the reflection object at the specified path, relative to this namespace.\n * @name NamespaceBase#lookup\n * @function\n * @param {string|string[]} path Path to look up\n * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n * @variation 2\n */\n// lookup(path: string, [parentAlreadyChecked: boolean])\n\n/**\n * Looks up the {@link Type|type} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type\n * @throws {Error} If `path` does not point to a type\n */\nNamespace.prototype.lookupType = function lookupType(path) {\n var found = this.lookup(path, [ Type ]);\n if (!found)\n throw Error(\"no such type: \" + path);\n return found;\n};\n\n/**\n * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Enum} Looked up enum\n * @throws {Error} If `path` does not point to an enum\n */\nNamespace.prototype.lookupEnum = function lookupEnum(path) {\n var found = this.lookup(path, [ Enum ]);\n if (!found)\n throw Error(\"no such Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type or enum\n * @throws {Error} If `path` does not point to a type or enum\n */\nNamespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) {\n var found = this.lookup(path, [ Type, Enum ]);\n if (!found)\n throw Error(\"no such Type or Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Service|service} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Service} Looked up service\n * @throws {Error} If `path` does not point to a service\n */\nNamespace.prototype.lookupService = function lookupService(path) {\n var found = this.lookup(path, [ Service ]);\n if (!found)\n throw Error(\"no such Service '\" + path + \"' in \" + this);\n return found;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nNamespace._configure = function(Type_, Service_, Enum_) {\n Type = Type_;\n Service = Service_;\n Enum = Enum_;\n};\n","'use strict';\n\nvar elliptic = exports;\n\nelliptic.version = require('../package.json').version;\nelliptic.utils = require('./elliptic/utils');\nelliptic.rand = require('brorand');\nelliptic.curve = require('./elliptic/curve');\nelliptic.curves = require('./elliptic/curves');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","module.exports = function xor (a, b) {\n var length = Math.min(a.length, b.length)\n var buffer = new Buffer(length)\n\n for (var i = 0; i < length; ++i) {\n buffer[i] = a[i] ^ b[i]\n }\n\n return buffer\n}\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n function getOwnPropertyDescriptors(obj) {\n var keys = Object.keys(obj);\n var descriptors = {};\n for (var i = 0; i < keys.length; i++) {\n descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n }\n return descriptors;\n };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n if (!isString(f)) {\n var objects = [];\n for (var i = 0; i < arguments.length; i++) {\n objects.push(inspect(arguments[i]));\n }\n return objects.join(' ');\n }\n\n var i = 1;\n var args = arguments;\n var len = args.length;\n var str = String(f).replace(formatRegExp, function(x) {\n if (x === '%%') return '%';\n if (i >= len) return x;\n switch (x) {\n case '%s': return String(args[i++]);\n case '%d': return Number(args[i++]);\n case '%j':\n try {\n return JSON.stringify(args[i++]);\n } catch (_) {\n return '[Circular]';\n }\n default:\n return x;\n }\n });\n for (var x = args[i]; i < len; x = args[++i]) {\n if (isNull(x) || !isObject(x)) {\n str += ' ' + x;\n } else {\n str += ' ' + inspect(x);\n }\n }\n return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n if (typeof process !== 'undefined' && process.noDeprecation === true) {\n return fn;\n }\n\n // Allow for deprecating things in the process of starting up.\n if (typeof process === 'undefined') {\n return function() {\n return exports.deprecate(fn, msg).apply(this, arguments);\n };\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (process.throwDeprecation) {\n throw new Error(msg);\n } else if (process.traceDeprecation) {\n console.trace(msg);\n } else {\n console.error(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnvRegex = /^$/;\n\nif (process.env.NODE_DEBUG) {\n var debugEnv = process.env.NODE_DEBUG;\n debugEnv = debugEnv.replace(/[|\\\\{}()[\\]^$+?.]/g, '\\\\$&')\n .replace(/\\*/g, '.*')\n .replace(/,/g, '$|^')\n .toUpperCase();\n debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i');\n}\nexports.debuglog = function(set) {\n set = set.toUpperCase();\n if (!debugs[set]) {\n if (debugEnvRegex.test(set)) {\n var pid = process.pid;\n debugs[set] = function() {\n var msg = exports.format.apply(exports, arguments);\n console.error('%s %d: %s', set, pid, msg);\n };\n } else {\n debugs[set] = function() {};\n }\n }\n return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n // default options\n var ctx = {\n seen: [],\n stylize: stylizeNoColor\n };\n // legacy...\n if (arguments.length >= 3) ctx.depth = arguments[2];\n if (arguments.length >= 4) ctx.colors = arguments[3];\n if (isBoolean(opts)) {\n // legacy...\n ctx.showHidden = opts;\n } else if (opts) {\n // got an \"options\" object\n exports._extend(ctx, opts);\n }\n // set default options\n if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n if (isUndefined(ctx.depth)) ctx.depth = 2;\n if (isUndefined(ctx.colors)) ctx.colors = false;\n if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n if (ctx.colors) ctx.stylize = stylizeWithColor;\n return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n 'bold' : [1, 22],\n 'italic' : [3, 23],\n 'underline' : [4, 24],\n 'inverse' : [7, 27],\n 'white' : [37, 39],\n 'grey' : [90, 39],\n 'black' : [30, 39],\n 'blue' : [34, 39],\n 'cyan' : [36, 39],\n 'green' : [32, 39],\n 'magenta' : [35, 39],\n 'red' : [31, 39],\n 'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n 'special': 'cyan',\n 'number': 'yellow',\n 'boolean': 'yellow',\n 'undefined': 'grey',\n 'null': 'bold',\n 'string': 'green',\n 'date': 'magenta',\n // \"name\": intentionally not styling\n 'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n var style = inspect.styles[styleType];\n\n if (style) {\n return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n '\\u001b[' + inspect.colors[style][1] + 'm';\n } else {\n return str;\n }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n return str;\n}\n\n\nfunction arrayToHash(array) {\n var hash = {};\n\n array.forEach(function(val, idx) {\n hash[val] = true;\n });\n\n return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n // Provide a hook for user-specified inspect functions.\n // Check that value is an object with an inspect function on it\n if (ctx.customInspect &&\n value &&\n isFunction(value.inspect) &&\n // Filter out the util module, it's inspect function is special\n value.inspect !== exports.inspect &&\n // Also filter out any prototype objects using the circular check.\n !(value.constructor && value.constructor.prototype === value)) {\n var ret = value.inspect(recurseTimes, ctx);\n if (!isString(ret)) {\n ret = formatValue(ctx, ret, recurseTimes);\n }\n return ret;\n }\n\n // Primitive types cannot have properties\n var primitive = formatPrimitive(ctx, value);\n if (primitive) {\n return primitive;\n }\n\n // Look up the keys of the object.\n var keys = Object.keys(value);\n var visibleKeys = arrayToHash(keys);\n\n if (ctx.showHidden) {\n keys = Object.getOwnPropertyNames(value);\n }\n\n // IE doesn't make error fields non-enumerable\n // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n if (isError(value)\n && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n return formatError(value);\n }\n\n // Some type of object without properties can be shortcutted.\n if (keys.length === 0) {\n if (isFunction(value)) {\n var name = value.name ? ': ' + value.name : '';\n return ctx.stylize('[Function' + name + ']', 'special');\n }\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n }\n if (isDate(value)) {\n return ctx.stylize(Date.prototype.toString.call(value), 'date');\n }\n if (isError(value)) {\n return formatError(value);\n }\n }\n\n var base = '', array = false, braces = ['{', '}'];\n\n // Make Array say that they are Array\n if (isArray(value)) {\n array = true;\n braces = ['[', ']'];\n }\n\n // Make functions say that they are functions\n if (isFunction(value)) {\n var n = value.name ? ': ' + value.name : '';\n base = ' [Function' + n + ']';\n }\n\n // Make RegExps say that they are RegExps\n if (isRegExp(value)) {\n base = ' ' + RegExp.prototype.toString.call(value);\n }\n\n // Make dates with properties first say the date\n if (isDate(value)) {\n base = ' ' + Date.prototype.toUTCString.call(value);\n }\n\n // Make error with message first say the error\n if (isError(value)) {\n base = ' ' + formatError(value);\n }\n\n if (keys.length === 0 && (!array || value.length == 0)) {\n return braces[0] + base + braces[1];\n }\n\n if (recurseTimes < 0) {\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n } else {\n return ctx.stylize('[Object]', 'special');\n }\n }\n\n ctx.seen.push(value);\n\n var output;\n if (array) {\n output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n } else {\n output = keys.map(function(key) {\n return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n });\n }\n\n ctx.seen.pop();\n\n return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n if (isUndefined(value))\n return ctx.stylize('undefined', 'undefined');\n if (isString(value)) {\n var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n .replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"') + '\\'';\n return ctx.stylize(simple, 'string');\n }\n if (isNumber(value))\n return ctx.stylize('' + value, 'number');\n if (isBoolean(value))\n return ctx.stylize('' + value, 'boolean');\n // For some reason typeof null is \"object\", so special case here.\n if (isNull(value))\n return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n var output = [];\n for (var i = 0, l = value.length; i < l; ++i) {\n if (hasOwnProperty(value, String(i))) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n String(i), true));\n } else {\n output.push('');\n }\n }\n keys.forEach(function(key) {\n if (!key.match(/^\\d+$/)) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n key, true));\n }\n });\n return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n var name, str, desc;\n desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n if (desc.get) {\n if (desc.set) {\n str = ctx.stylize('[Getter/Setter]', 'special');\n } else {\n str = ctx.stylize('[Getter]', 'special');\n }\n } else {\n if (desc.set) {\n str = ctx.stylize('[Setter]', 'special');\n }\n }\n if (!hasOwnProperty(visibleKeys, key)) {\n name = '[' + key + ']';\n }\n if (!str) {\n if (ctx.seen.indexOf(desc.value) < 0) {\n if (isNull(recurseTimes)) {\n str = formatValue(ctx, desc.value, null);\n } else {\n str = formatValue(ctx, desc.value, recurseTimes - 1);\n }\n if (str.indexOf('\\n') > -1) {\n if (array) {\n str = str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n').slice(2);\n } else {\n str = '\\n' + str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n');\n }\n }\n } else {\n str = ctx.stylize('[Circular]', 'special');\n }\n }\n if (isUndefined(name)) {\n if (array && key.match(/^\\d+$/)) {\n return str;\n }\n name = JSON.stringify('' + key);\n if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n name = name.slice(1, -1);\n name = ctx.stylize(name, 'name');\n } else {\n name = name.replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"')\n .replace(/(^\"|\"$)/g, \"'\");\n name = ctx.stylize(name, 'string');\n }\n }\n\n return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n var numLinesEst = 0;\n var length = output.reduce(function(prev, cur) {\n numLinesEst++;\n if (cur.indexOf('\\n') >= 0) numLinesEst++;\n return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n }, 0);\n\n if (length > 60) {\n return braces[0] +\n (base === '' ? '' : base + '\\n ') +\n ' ' +\n output.join(',\\n ') +\n ' ' +\n braces[1];\n }\n\n return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexports.types = require('./support/types');\n\nfunction isArray(ar) {\n return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\nexports.types.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\nexports.types.isDate = isDate;\n\nfunction isError(e) {\n return isObject(e) &&\n (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\nexports.types.isNativeError = isError;\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n return arg === null ||\n typeof arg === 'boolean' ||\n typeof arg === 'number' ||\n typeof arg === 'string' ||\n typeof arg === 'symbol' || // ES6 symbol\n typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n 'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n var d = new Date();\n var time = [pad(d.getHours()),\n pad(d.getMinutes()),\n pad(d.getSeconds())].join(':');\n return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n * prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n // Don't do anything if add isn't an object\n if (!add || !isObject(add)) return origin;\n\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n if (typeof original !== 'function')\n throw new TypeError('The \"original\" argument must be of type Function');\n\n if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n var fn = original[kCustomPromisifiedSymbol];\n if (typeof fn !== 'function') {\n throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n }\n Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n value: fn, enumerable: false, writable: false, configurable: true\n });\n return fn;\n }\n\n function fn() {\n var promiseResolve, promiseReject;\n var promise = new Promise(function (resolve, reject) {\n promiseResolve = resolve;\n promiseReject = reject;\n });\n\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args.push(arguments[i]);\n }\n args.push(function (err, value) {\n if (err) {\n promiseReject(err);\n } else {\n promiseResolve(value);\n }\n });\n\n try {\n original.apply(this, args);\n } catch (err) {\n promiseReject(err);\n }\n\n return promise;\n }\n\n Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n value: fn, enumerable: false, writable: false, configurable: true\n });\n return Object.defineProperties(\n fn,\n getOwnPropertyDescriptors(original)\n );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n // Because `null` is a special error value in callbacks which means \"no error\n // occurred\", we error-wrap so the callback consumer can distinguish between\n // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n if (!reason) {\n var newReason = new Error('Promise was rejected with a falsy value');\n newReason.reason = reason;\n reason = newReason;\n }\n return cb(reason);\n}\n\nfunction callbackify(original) {\n if (typeof original !== 'function') {\n throw new TypeError('The \"original\" argument must be of type Function');\n }\n\n // We DO NOT return the promise as it gives the user a false sense that\n // the promise is actually somehow related to the callback's execution\n // and that the callback throwing will reject the promise.\n function callbackified() {\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args.push(arguments[i]);\n }\n\n var maybeCb = args.pop();\n if (typeof maybeCb !== 'function') {\n throw new TypeError('The last argument must be of type Function');\n }\n var self = this;\n var cb = function() {\n return maybeCb.apply(self, arguments);\n };\n // In true node style we process the callback on `nextTick` with all the\n // implications (stack, `uncaughtException`, `async_hooks`)\n original.apply(this, args)\n .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) },\n function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) });\n }\n\n Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n Object.defineProperties(callbackified,\n getOwnPropertyDescriptors(original));\n return callbackified;\n}\nexports.callbackify = callbackify;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n/**/\n\nvar Buffer = require('safe-buffer').Buffer;\n/**/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return '\\ufffd';\n }\n }\n }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/**/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/**/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/**/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/**/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/**/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/**/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/**/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/**/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});","\"use strict\";\nmodule.exports = OneOf;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = \"OneOf\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new oneof instance.\n * @classdesc Reflected oneof.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Oneof name\n * @param {string[]|Object.} [fieldNames] Field names\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction OneOf(name, fieldNames, options, comment) {\n if (!Array.isArray(fieldNames)) {\n options = fieldNames;\n fieldNames = undefined;\n }\n ReflectionObject.call(this, name, options);\n\n /* istanbul ignore if */\n if (!(fieldNames === undefined || Array.isArray(fieldNames)))\n throw TypeError(\"fieldNames must be an Array\");\n\n /**\n * Field names that belong to this oneof.\n * @type {string[]}\n */\n this.oneof = fieldNames || []; // toJSON, marker\n\n /**\n * Fields that belong to this oneof as an array for iteration.\n * @type {Field[]}\n * @readonly\n */\n this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Oneof descriptor.\n * @interface IOneOf\n * @property {Array.} oneof Oneof field names\n * @property {Object.} [options] Oneof options\n */\n\n/**\n * Constructs a oneof from a oneof descriptor.\n * @param {string} name Oneof name\n * @param {IOneOf} json Oneof descriptor\n * @returns {OneOf} Created oneof\n * @throws {TypeError} If arguments are invalid\n */\nOneOf.fromJSON = function fromJSON(name, json) {\n return new OneOf(name, json.oneof, json.options, json.comment);\n};\n\n/**\n * Converts this oneof to a oneof descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IOneOf} Oneof descriptor\n */\nOneOf.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , this.options,\n \"oneof\" , this.oneof,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Adds the fields of the specified oneof to the parent if not already done so.\n * @param {OneOf} oneof The oneof\n * @returns {undefined}\n * @inner\n * @ignore\n */\nfunction addFieldsToParent(oneof) {\n if (oneof.parent)\n for (var i = 0; i < oneof.fieldsArray.length; ++i)\n if (!oneof.fieldsArray[i].parent)\n oneof.parent.add(oneof.fieldsArray[i]);\n}\n\n/**\n * Adds a field to this oneof and removes it from its current parent, if any.\n * @param {Field} field Field to add\n * @returns {OneOf} `this`\n */\nOneOf.prototype.add = function add(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n if (field.parent && field.parent !== this.parent)\n field.parent.remove(field);\n this.oneof.push(field.name);\n this.fieldsArray.push(field);\n field.partOf = this; // field.parent remains null\n addFieldsToParent(this);\n return this;\n};\n\n/**\n * Removes a field from this oneof and puts it back to the oneof's parent.\n * @param {Field} field Field to remove\n * @returns {OneOf} `this`\n */\nOneOf.prototype.remove = function remove(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n var index = this.fieldsArray.indexOf(field);\n\n /* istanbul ignore if */\n if (index < 0)\n throw Error(field + \" is not a member of \" + this);\n\n this.fieldsArray.splice(index, 1);\n index = this.oneof.indexOf(field.name);\n\n /* istanbul ignore else */\n if (index > -1) // theoretical\n this.oneof.splice(index, 1);\n\n field.partOf = null;\n return this;\n};\n\n/**\n * @override\n */\nOneOf.prototype.onAdd = function onAdd(parent) {\n ReflectionObject.prototype.onAdd.call(this, parent);\n var self = this;\n // Collect present fields\n for (var i = 0; i < this.oneof.length; ++i) {\n var field = parent.get(this.oneof[i]);\n if (field && !field.partOf) {\n field.partOf = self;\n self.fieldsArray.push(field);\n }\n }\n // Add not yet present fields\n addFieldsToParent(this);\n};\n\n/**\n * @override\n */\nOneOf.prototype.onRemove = function onRemove(parent) {\n for (var i = 0, field; i < this.fieldsArray.length; ++i)\n if ((field = this.fieldsArray[i]).parent)\n field.parent.remove(field);\n ReflectionObject.prototype.onRemove.call(this, parent);\n};\n\n/**\n * Decorator function as returned by {@link OneOf.d} (TypeScript).\n * @typedef OneOfDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} oneofName OneOf name\n * @returns {undefined}\n */\n\n/**\n * OneOf decorator (TypeScript).\n * @function\n * @param {...string} fieldNames Field names\n * @returns {OneOfDecorator} Decorator function\n * @template T extends string\n */\nOneOf.d = function decorateOneOf() {\n var fieldNames = new Array(arguments.length),\n index = 0;\n while (index < arguments.length)\n fieldNames[index] = arguments[index++];\n return function oneOfDecorator(prototype, oneofName) {\n util.decorateType(prototype.constructor)\n .add(new OneOf(oneofName, fieldNames));\n Object.defineProperty(prototype, oneofName, {\n get: util.oneOfGetter(fieldNames),\n set: util.oneOfSetter(fieldNames)\n });\n };\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar getNAF = utils.getNAF;\nvar getJSF = utils.getJSF;\nvar assert = utils.assert;\n\nfunction BaseCurve(type, conf) {\n this.type = type;\n this.p = new BN(conf.p, 16);\n\n // Use Montgomery, when there is no fast reduction for the prime\n this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n\n // Useful for many curves\n this.zero = new BN(0).toRed(this.red);\n this.one = new BN(1).toRed(this.red);\n this.two = new BN(2).toRed(this.red);\n\n // Curve configuration, optional\n this.n = conf.n && new BN(conf.n, 16);\n this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);\n\n // Temporary arrays\n this._wnafT1 = new Array(4);\n this._wnafT2 = new Array(4);\n this._wnafT3 = new Array(4);\n this._wnafT4 = new Array(4);\n\n this._bitLength = this.n ? this.n.bitLength() : 0;\n\n // Generalized Greg Maxwell's trick\n var adjustCount = this.n && this.p.div(this.n);\n if (!adjustCount || adjustCount.cmpn(100) > 0) {\n this.redN = null;\n } else {\n this._maxwellTrick = true;\n this.redN = this.n.toRed(this.red);\n }\n}\nmodule.exports = BaseCurve;\n\nBaseCurve.prototype.point = function point() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype.validate = function validate() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles();\n\n var naf = getNAF(k, 1, this._bitLength);\n var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n\n // Translate into more windowed form\n var repr = [];\n var j;\n var nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--)\n nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n\n var a = this.jpoint(null, null, null);\n var b = this.jpoint(null, null, null);\n for (var i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++) {\n nafW = repr[j];\n if (nafW === i)\n b = b.mixedAdd(doubles.points[j]);\n else if (nafW === -i)\n b = b.mixedAdd(doubles.points[j].neg());\n }\n a = a.add(b);\n }\n return a.toP();\n};\n\nBaseCurve.prototype._wnafMul = function _wnafMul(p, k) {\n var w = 4;\n\n // Precompute window\n var nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n var wnd = nafPoints.points;\n\n // Get NAF form\n var naf = getNAF(k, w, this._bitLength);\n\n // Add `this`*(N+1) for every w-NAF index\n var acc = this.jpoint(null, null, null);\n for (var i = naf.length - 1; i >= 0; i--) {\n // Count zeroes\n for (var l = 0; i >= 0 && naf[i] === 0; i--)\n l++;\n if (i >= 0)\n l++;\n acc = acc.dblp(l);\n\n if (i < 0)\n break;\n var z = naf[i];\n assert(z !== 0);\n if (p.type === 'affine') {\n // J +- P\n if (z > 0)\n acc = acc.mixedAdd(wnd[(z - 1) >> 1]);\n else\n acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());\n } else {\n // J +- J\n if (z > 0)\n acc = acc.add(wnd[(z - 1) >> 1]);\n else\n acc = acc.add(wnd[(-z - 1) >> 1].neg());\n }\n }\n return p.type === 'affine' ? acc.toP() : acc;\n};\n\nBaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,\n points,\n coeffs,\n len,\n jacobianResult) {\n var wndWidth = this._wnafT1;\n var wnd = this._wnafT2;\n var naf = this._wnafT3;\n\n // Fill all arrays\n var max = 0;\n var i;\n var j;\n var p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n wndWidth[i] = nafPoints.wnd;\n wnd[i] = nafPoints.points;\n }\n\n // Comb small window NAFs\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1;\n var b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength);\n naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength);\n max = Math.max(naf[a].length, max);\n max = Math.max(naf[b].length, max);\n continue;\n }\n\n var comb = [\n points[a], /* 1 */\n null, /* 3 */\n null, /* 5 */\n points[b], /* 7 */\n ];\n\n // Try to avoid Projective points, if possible\n if (points[a].y.cmp(points[b].y) === 0) {\n comb[1] = points[a].add(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].add(points[b].neg());\n } else {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n }\n\n var index = [\n -3, /* -1 -1 */\n -1, /* -1 0 */\n -5, /* -1 1 */\n -7, /* 0 -1 */\n 0, /* 0 0 */\n 7, /* 0 1 */\n 5, /* 1 -1 */\n 1, /* 1 0 */\n 3, /* 1 1 */\n ];\n\n var jsf = getJSF(coeffs[a], coeffs[b]);\n max = Math.max(jsf[0].length, max);\n naf[a] = new Array(max);\n naf[b] = new Array(max);\n for (j = 0; j < max; j++) {\n var ja = jsf[0][j] | 0;\n var jb = jsf[1][j] | 0;\n\n naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];\n naf[b][j] = 0;\n wnd[a] = comb;\n }\n }\n\n var acc = this.jpoint(null, null, null);\n var tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n var k = 0;\n\n while (i >= 0) {\n var zero = true;\n for (j = 0; j < len; j++) {\n tmp[j] = naf[j][i] | 0;\n if (tmp[j] !== 0)\n zero = false;\n }\n if (!zero)\n break;\n k++;\n i--;\n }\n if (i >= 0)\n k++;\n acc = acc.dblp(k);\n if (i < 0)\n break;\n\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n p;\n if (z === 0)\n continue;\n else if (z > 0)\n p = wnd[j][(z - 1) >> 1];\n else if (z < 0)\n p = wnd[j][(-z - 1) >> 1].neg();\n\n if (p.type === 'affine')\n acc = acc.mixedAdd(p);\n else\n acc = acc.add(p);\n }\n }\n // Zeroify references\n for (i = 0; i < len; i++)\n wnd[i] = null;\n\n if (jacobianResult)\n return acc;\n else\n return acc.toP();\n};\n\nfunction BasePoint(curve, type) {\n this.curve = curve;\n this.type = type;\n this.precomputed = null;\n}\nBaseCurve.BasePoint = BasePoint;\n\nBasePoint.prototype.eq = function eq(/*other*/) {\n throw new Error('Not implemented');\n};\n\nBasePoint.prototype.validate = function validate() {\n return this.curve.validate(this);\n};\n\nBaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n\n var len = this.p.byteLength();\n\n // uncompressed, hybrid-odd, hybrid-even\n if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&\n bytes.length - 1 === 2 * len) {\n if (bytes[0] === 0x06)\n assert(bytes[bytes.length - 1] % 2 === 0);\n else if (bytes[0] === 0x07)\n assert(bytes[bytes.length - 1] % 2 === 1);\n\n var res = this.point(bytes.slice(1, 1 + len),\n bytes.slice(1 + len, 1 + 2 * len));\n\n return res;\n } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&\n bytes.length - 1 === len) {\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);\n }\n throw new Error('Unknown point format');\n};\n\nBasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {\n return this.encode(enc, true);\n};\n\nBasePoint.prototype._encode = function _encode(compact) {\n var len = this.curve.p.byteLength();\n var x = this.getX().toArray('be', len);\n\n if (compact)\n return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);\n\n return [ 0x04 ].concat(x, this.getY().toArray('be', len));\n};\n\nBasePoint.prototype.encode = function encode(enc, compact) {\n return utils.encode(this._encode(compact), enc);\n};\n\nBasePoint.prototype.precompute = function precompute(power) {\n if (this.precomputed)\n return this;\n\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n precomputed.naf = this._getNAFPoints(8);\n precomputed.doubles = this._getDoubles(4, power);\n precomputed.beta = this._getBeta();\n this.precomputed = precomputed;\n\n return this;\n};\n\nBasePoint.prototype._hasDoubles = function _hasDoubles(k) {\n if (!this.precomputed)\n return false;\n\n var doubles = this.precomputed.doubles;\n if (!doubles)\n return false;\n\n return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);\n};\n\nBasePoint.prototype._getDoubles = function _getDoubles(step, power) {\n if (this.precomputed && this.precomputed.doubles)\n return this.precomputed.doubles;\n\n var doubles = [ this ];\n var acc = this;\n for (var i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++)\n acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step: step,\n points: doubles,\n };\n};\n\nBasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {\n if (this.precomputed && this.precomputed.naf)\n return this.precomputed.naf;\n\n var res = [ this ];\n var max = (1 << wnd) - 1;\n var dbl = max === 1 ? null : this.dbl();\n for (var i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd: wnd,\n points: res,\n };\n};\n\nBasePoint.prototype._getBeta = function _getBeta() {\n return null;\n};\n\nBasePoint.prototype.dblp = function dblp(k) {\n var r = this;\n for (var i = 0; i < k; i++)\n r = r.dbl();\n return r;\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n this.pending = null;\n this.pendingTotal = 0;\n this.blockSize = this.constructor.blockSize;\n this.outSize = this.constructor.outSize;\n this.hmacStrength = this.constructor.hmacStrength;\n this.padLength = this.constructor.padLength / 8;\n this.endian = 'big';\n\n this._delta8 = this.blockSize / 8;\n this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n // Convert message to array, pad it, and join into 32bit blocks\n msg = utils.toArray(msg, enc);\n if (!this.pending)\n this.pending = msg;\n else\n this.pending = this.pending.concat(msg);\n this.pendingTotal += msg.length;\n\n // Enough data, try updating\n if (this.pending.length >= this._delta8) {\n msg = this.pending;\n\n // Process pending data in blocks\n var r = msg.length % this._delta8;\n this.pending = msg.slice(msg.length - r, msg.length);\n if (this.pending.length === 0)\n this.pending = null;\n\n msg = utils.join32(msg, 0, msg.length - r, this.endian);\n for (var i = 0; i < msg.length; i += this._delta32)\n this._update(msg, i, i + this._delta32);\n }\n\n return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n this.update(this._pad());\n assert(this.pending === null);\n\n return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n var len = this.pendingTotal;\n var bytes = this._delta8;\n var k = bytes - ((len + this.padLength) % bytes);\n var res = new Array(k + this.padLength);\n res[0] = 0x80;\n for (var i = 1; i < k; i++)\n res[i] = 0;\n\n // Append length\n len <<= 3;\n if (this.endian === 'big') {\n for (var t = 8; t < this.padLength; t++)\n res[i++] = 0;\n\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = len & 0xff;\n } else {\n res[i++] = len & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n\n for (t = 8; t < this.padLength; t++)\n res[i++] = 0;\n }\n\n return res;\n};\n","\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n if (config('noDeprecation')) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config('throwDeprecation')) {\n throw new Error(msg);\n } else if (config('traceDeprecation')) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === 'true';\n}\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","'use strict';\n\nvar undefined;\n\nvar $SyntaxError = SyntaxError;\nvar $Function = Function;\nvar $TypeError = TypeError;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = Object.getPrototypeOf || function (x) { return x.__proto__; }; // eslint-disable-line no-proto\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': RangeError,\n\t'%ReferenceError%': ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\ntry {\n\tnull.error; // eslint-disable-line no-unused-expressions\n} catch (e) {\n\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\tvar errorProto = getProto(getProto(e));\n\tINTRINSICS['%Error.prototype%'] = errorProto;\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('has');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\nvar $exec = bind.call(Function.call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar keys = require('object-keys');\nvar hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';\n\nvar toStr = Object.prototype.toString;\nvar concat = Array.prototype.concat;\nvar origDefineProperty = Object.defineProperty;\n\nvar isFunction = function (fn) {\n\treturn typeof fn === 'function' && toStr.call(fn) === '[object Function]';\n};\n\nvar hasPropertyDescriptors = require('has-property-descriptors')();\n\nvar supportsDescriptors = origDefineProperty && hasPropertyDescriptors;\n\nvar defineProperty = function (object, name, value, predicate) {\n\tif (name in object) {\n\t\tif (predicate === true) {\n\t\t\tif (object[name] === value) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} else if (!isFunction(predicate) || !predicate()) {\n\t\t\treturn;\n\t\t}\n\t}\n\tif (supportsDescriptors) {\n\t\torigDefineProperty(object, name, {\n\t\t\tconfigurable: true,\n\t\t\tenumerable: false,\n\t\t\tvalue: value,\n\t\t\twritable: true\n\t\t});\n\t} else {\n\t\tobject[name] = value; // eslint-disable-line no-param-reassign\n\t}\n};\n\nvar defineProperties = function (object, map) {\n\tvar predicates = arguments.length > 2 ? arguments[2] : {};\n\tvar props = keys(map);\n\tif (hasSymbols) {\n\t\tprops = concat.call(props, Object.getOwnPropertySymbols(map));\n\t}\n\tfor (var i = 0; i < props.length; i += 1) {\n\t\tdefineProperty(object, props[i], map[props[i]], predicates[props[i]]);\n\t}\n};\n\ndefineProperties.supportsDescriptors = !!supportsDescriptors;\n\nmodule.exports = defineProperties;\n","var Buffer = require('safe-buffer').Buffer\nvar MD5 = require('md5.js')\n\n/* eslint-disable camelcase */\nfunction EVP_BytesToKey (password, salt, keyBits, ivLen) {\n if (!Buffer.isBuffer(password)) password = Buffer.from(password, 'binary')\n if (salt) {\n if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, 'binary')\n if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length')\n }\n\n var keyLen = keyBits / 8\n var key = Buffer.alloc(keyLen)\n var iv = Buffer.alloc(ivLen || 0)\n var tmp = Buffer.alloc(0)\n\n while (keyLen > 0 || ivLen > 0) {\n var hash = new MD5()\n hash.update(tmp)\n hash.update(password)\n if (salt) hash.update(salt)\n tmp = hash.digest()\n\n var used = 0\n\n if (keyLen > 0) {\n var keyStart = key.length - keyLen\n used = Math.min(keyLen, tmp.length)\n tmp.copy(key, keyStart, 0, used)\n keyLen -= used\n }\n\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen\n var length = Math.min(ivLen, tmp.length - used)\n tmp.copy(iv, ivStart, used, used + length)\n ivLen -= length\n }\n }\n\n tmp.fill(0)\n return { key: key, iv: iv }\n}\n\nmodule.exports = EVP_BytesToKey\n","var asn1 = require('./asn1')\nvar aesid = require('./aesid.json')\nvar fixProc = require('./fixProc')\nvar ciphers = require('browserify-aes')\nvar compat = require('pbkdf2')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = parseKeys\n\nfunction parseKeys (buffer) {\n var password\n if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) {\n password = buffer.passphrase\n buffer = buffer.key\n }\n if (typeof buffer === 'string') {\n buffer = Buffer.from(buffer)\n }\n\n var stripped = fixProc(buffer, password)\n\n var type = stripped.tag\n var data = stripped.data\n var subtype, ndata\n switch (type) {\n case 'CERTIFICATE':\n ndata = asn1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo\n // falls through\n case 'PUBLIC KEY':\n if (!ndata) {\n ndata = asn1.PublicKey.decode(data, 'der')\n }\n subtype = ndata.algorithm.algorithm.join('.')\n switch (subtype) {\n case '1.2.840.113549.1.1.1':\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der')\n case '1.2.840.10045.2.1':\n ndata.subjectPrivateKey = ndata.subjectPublicKey\n return {\n type: 'ec',\n data: ndata\n }\n case '1.2.840.10040.4.1':\n ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der')\n return {\n type: 'dsa',\n data: ndata.algorithm.params\n }\n default: throw new Error('unknown key id ' + subtype)\n }\n // throw new Error('unknown key type ' + type)\n case 'ENCRYPTED PRIVATE KEY':\n data = asn1.EncryptedPrivateKey.decode(data, 'der')\n data = decrypt(data, password)\n // falls through\n case 'PRIVATE KEY':\n ndata = asn1.PrivateKey.decode(data, 'der')\n subtype = ndata.algorithm.algorithm.join('.')\n switch (subtype) {\n case '1.2.840.113549.1.1.1':\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der')\n case '1.2.840.10045.2.1':\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey\n }\n case '1.2.840.10040.4.1':\n ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der')\n return {\n type: 'dsa',\n params: ndata.algorithm.params\n }\n default: throw new Error('unknown key id ' + subtype)\n }\n // throw new Error('unknown key type ' + type)\n case 'RSA PUBLIC KEY':\n return asn1.RSAPublicKey.decode(data, 'der')\n case 'RSA PRIVATE KEY':\n return asn1.RSAPrivateKey.decode(data, 'der')\n case 'DSA PRIVATE KEY':\n return {\n type: 'dsa',\n params: asn1.DSAPrivateKey.decode(data, 'der')\n }\n case 'EC PRIVATE KEY':\n data = asn1.ECPrivateKey.decode(data, 'der')\n return {\n curve: data.parameters.value,\n privateKey: data.privateKey\n }\n default: throw new Error('unknown key type ' + type)\n }\n}\nparseKeys.signature = asn1.signature\nfunction decrypt (data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt\n var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10)\n var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]\n var iv = data.algorithm.decrypt.cipher.iv\n var cipherText = data.subjectPrivateKey\n var keylen = parseInt(algo.split('-')[1], 10) / 8\n var key = compat.pbkdf2Sync(password, salt, iters, keylen, 'sha1')\n var cipher = ciphers.createDecipheriv(algo, key, iv)\n var out = []\n out.push(cipher.update(cipherText))\n out.push(cipher.final())\n return Buffer.concat(out)\n}\n","'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\nvar $max = GetIntrinsic('%Math.max%');\n\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = null;\n\t}\n}\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = $reflectApply(bind, $call, arguments);\n\tif ($gOPD && $defineProperty) {\n\t\tvar desc = $gOPD(func, 'length');\n\t\tif (desc.configurable) {\n\t\t\t// original length, plus the receiver, minus any additional arguments (after the receiver)\n\t\t\t$defineProperty(\n\t\t\t\tfunc,\n\t\t\t\t'length',\n\t\t\t\t{ value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) }\n\t\t\t);\n\t\t}\n\t}\n\treturn func;\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n const res = {};\n\n Object.keys(map).forEach(function(key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key)\n key = key | 0;\n\n const value = map[key];\n res[value] = key;\n });\n\n return res;\n}\n\nexports.tagClass = {\n 0: 'universal',\n 1: 'application',\n 2: 'context',\n 3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n 0x00: 'end',\n 0x01: 'bool',\n 0x02: 'int',\n 0x03: 'bitstr',\n 0x04: 'octstr',\n 0x05: 'null_',\n 0x06: 'objid',\n 0x07: 'objDesc',\n 0x08: 'external',\n 0x09: 'real',\n 0x0a: 'enum',\n 0x0b: 'embed',\n 0x0c: 'utf8str',\n 0x0d: 'relativeOid',\n 0x10: 'seq',\n 0x11: 'set',\n 0x12: 'numstr',\n 0x13: 'printstr',\n 0x14: 't61str',\n 0x15: 'videostr',\n 0x16: 'ia5str',\n 0x17: 'utctime',\n 0x18: 'gentime',\n 0x19: 'graphstr',\n 0x1a: 'iso646str',\n 0x1b: 'genstr',\n 0x1c: 'unistr',\n 0x1d: 'charstr',\n 0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","\"use strict\";\nmodule.exports = Writer;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferWriter; // cyclic\n\nvar LongBits = util.LongBits,\n base64 = util.base64,\n utf8 = util.utf8;\n\n/**\n * Constructs a new writer operation instance.\n * @classdesc Scheduled writer operation.\n * @constructor\n * @param {function(*, Uint8Array, number)} fn Function to call\n * @param {number} len Value byte length\n * @param {*} val Value to write\n * @ignore\n */\nfunction Op(fn, len, val) {\n\n /**\n * Function to call.\n * @type {function(Uint8Array, number, *)}\n */\n this.fn = fn;\n\n /**\n * Value byte length.\n * @type {number}\n */\n this.len = len;\n\n /**\n * Next operation.\n * @type {Writer.Op|undefined}\n */\n this.next = undefined;\n\n /**\n * Value to write.\n * @type {*}\n */\n this.val = val; // type varies\n}\n\n/* istanbul ignore next */\nfunction noop() {} // eslint-disable-line no-empty-function\n\n/**\n * Constructs a new writer state instance.\n * @classdesc Copied writer state.\n * @memberof Writer\n * @constructor\n * @param {Writer} writer Writer to copy state from\n * @ignore\n */\nfunction State(writer) {\n\n /**\n * Current head.\n * @type {Writer.Op}\n */\n this.head = writer.head;\n\n /**\n * Current tail.\n * @type {Writer.Op}\n */\n this.tail = writer.tail;\n\n /**\n * Current buffer length.\n * @type {number}\n */\n this.len = writer.len;\n\n /**\n * Next state.\n * @type {State|null}\n */\n this.next = writer.states;\n}\n\n/**\n * Constructs a new writer instance.\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n */\nfunction Writer() {\n\n /**\n * Current length.\n * @type {number}\n */\n this.len = 0;\n\n /**\n * Operations head.\n * @type {Object}\n */\n this.head = new Op(noop, 0, 0);\n\n /**\n * Operations tail\n * @type {Object}\n */\n this.tail = this.head;\n\n /**\n * Linked forked states.\n * @type {Object|null}\n */\n this.states = null;\n\n // When a value is written, the writer calculates its byte length and puts it into a linked\n // list of operations to perform when finish() is called. This both allows us to allocate\n // buffers of the exact required size and reduces the amount of work we have to do compared\n // to first calculating over objects and then encoding over objects. In our case, the encoding\n // part is just a linked list walk calling operations with already prepared values.\n}\n\n/**\n * Creates a new writer.\n * @function\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\n */\nWriter.create = util.Buffer\n ? function create_buffer_setup() {\n return (Writer.create = function create_buffer() {\n return new BufferWriter();\n })();\n }\n /* istanbul ignore next */\n : function create_array() {\n return new Writer();\n };\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Uint8Array} Buffer\n */\nWriter.alloc = function alloc(size) {\n return new util.Array(size);\n};\n\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\n/* istanbul ignore else */\nif (util.Array !== Array)\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\n\n/**\n * Pushes a new operation to the queue.\n * @param {function(Uint8Array, number, *)} fn Function to call\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @returns {Writer} `this`\n * @private\n */\nWriter.prototype._push = function push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n};\n\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\n\nfunction writeVarint32(val, buf, pos) {\n while (val > 127) {\n buf[pos++] = val & 127 | 128;\n val >>>= 7;\n }\n buf[pos] = val;\n}\n\n/**\n * Constructs a new varint writer operation instance.\n * @classdesc Scheduled varint writer operation.\n * @extends Op\n * @constructor\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @ignore\n */\nfunction VarintOp(len, val) {\n this.len = len;\n this.next = undefined;\n this.val = val;\n}\n\nVarintOp.prototype = Object.create(Op.prototype);\nVarintOp.prototype.fn = writeVarint32;\n\n/**\n * Writes an unsigned 32 bit value as a varint.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.uint32 = function write_uint32(value) {\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\n // uint32 is by far the most frequently used operation and benefits significantly from this.\n this.len += (this.tail = this.tail.next = new VarintOp(\n (value = value >>> 0)\n < 128 ? 1\n : value < 16384 ? 2\n : value < 2097152 ? 3\n : value < 268435456 ? 4\n : 5,\n value)).len;\n return this;\n};\n\n/**\n * Writes a signed 32 bit value as a varint.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.int32 = function write_int32(value) {\n return value < 0\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\n : this.uint32(value);\n};\n\n/**\n * Writes a 32 bit value as a varint, zig-zag encoded.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sint32 = function write_sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n};\n\nfunction writeVarint64(val, buf, pos) {\n while (val.hi) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\n val.hi >>>= 7;\n }\n while (val.lo > 127) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = val.lo >>> 7;\n }\n buf[pos++] = val.lo;\n}\n\n/**\n * Writes an unsigned 64 bit value as a varint.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.uint64 = function write_uint64(value) {\n var bits = LongBits.from(value);\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a signed 64 bit value as a varint.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.int64 = Writer.prototype.uint64;\n\n/**\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sint64 = function write_sint64(value) {\n var bits = LongBits.from(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a boolish value as a varint.\n * @param {boolean} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bool = function write_bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n};\n\nfunction writeFixed32(val, buf, pos) {\n buf[pos ] = val & 255;\n buf[pos + 1] = val >>> 8 & 255;\n buf[pos + 2] = val >>> 16 & 255;\n buf[pos + 3] = val >>> 24;\n}\n\n/**\n * Writes an unsigned 32 bit value as fixed 32 bits.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.fixed32 = function write_fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n};\n\n/**\n * Writes a signed 32 bit value as fixed 32 bits.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\n\n/**\n * Writes an unsigned 64 bit value as fixed 64 bits.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.fixed64 = function write_fixed64(value) {\n var bits = LongBits.from(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n};\n\n/**\n * Writes a signed 64 bit value as fixed 64 bits.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\n\n/**\n * Writes a float (32 bit).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.float = function write_float(value) {\n return this._push(util.float.writeFloatLE, 4, value);\n};\n\n/**\n * Writes a double (64 bit float).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.double = function write_double(value) {\n return this._push(util.float.writeDoubleLE, 8, value);\n};\n\nvar writeBytes = util.Array.prototype.set\n ? function writeBytes_set(val, buf, pos) {\n buf.set(val, pos); // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytes_for(val, buf, pos) {\n for (var i = 0; i < val.length; ++i)\n buf[pos + i] = val[i];\n };\n\n/**\n * Writes a sequence of bytes.\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bytes = function write_bytes(value) {\n var len = value.length >>> 0;\n if (!len)\n return this._push(writeByte, 1, 0);\n if (util.isString(value)) {\n var buf = Writer.alloc(len = base64.length(value));\n base64.decode(value, buf, 0);\n value = buf;\n }\n return this.uint32(len)._push(writeBytes, len, value);\n};\n\n/**\n * Writes a string.\n * @param {string} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.string = function write_string(value) {\n var len = utf8.length(value);\n return len\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n};\n\n/**\n * Forks this writer's state by pushing it to a stack.\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\n * @returns {Writer} `this`\n */\nWriter.prototype.fork = function fork() {\n this.states = new State(this);\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n return this;\n};\n\n/**\n * Resets this instance to the last state.\n * @returns {Writer} `this`\n */\nWriter.prototype.reset = function reset() {\n if (this.states) {\n this.head = this.states.head;\n this.tail = this.states.tail;\n this.len = this.states.len;\n this.states = this.states.next;\n } else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n};\n\n/**\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\n * @returns {Writer} `this`\n */\nWriter.prototype.ldelim = function ldelim() {\n var head = this.head,\n tail = this.tail,\n len = this.len;\n this.reset().uint32(len);\n if (len) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n};\n\n/**\n * Finishes the write operation.\n * @returns {Uint8Array} Finished buffer\n */\nWriter.prototype.finish = function finish() {\n var head = this.head.next, // skip noop\n buf = this.constructor.alloc(this.len),\n pos = 0;\n while (head) {\n head.fn(head.val, buf, pos);\n pos += head.len;\n head = head.next;\n }\n // this.head = this.tail = null;\n return buf;\n};\n\nWriter._configure = function(BufferWriter_) {\n BufferWriter = BufferWriter_;\n};\n","\"use strict\";\nmodule.exports = Reader;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferReader; // cyclic\n\nvar LongBits = util.LongBits,\n utf8 = util.utf8;\n\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\n}\n\n/**\n * Constructs a new reader instance using the specified buffer.\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n * @param {Uint8Array} buffer Buffer to read from\n */\nfunction Reader(buffer) {\n\n /**\n * Read buffer.\n * @type {Uint8Array}\n */\n this.buf = buffer;\n\n /**\n * Read buffer position.\n * @type {number}\n */\n this.pos = 0;\n\n /**\n * Read buffer length.\n * @type {number}\n */\n this.len = buffer.length;\n}\n\nvar create_array = typeof Uint8Array !== \"undefined\"\n ? function create_typed_array(buffer) {\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n }\n /* istanbul ignore next */\n : function create_array(buffer) {\n if (Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n };\n\n/**\n * Creates a new reader using the specified buffer.\n * @function\n * @param {Uint8Array|Buffer} buffer Buffer to read from\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\n * @throws {Error} If `buffer` is not a valid buffer\n */\nReader.create = util.Buffer\n ? function create_buffer_setup(buffer) {\n return (Reader.create = function create_buffer(buffer) {\n return util.Buffer.isBuffer(buffer)\n ? new BufferReader(buffer)\n /* istanbul ignore next */\n : create_array(buffer);\n })(buffer);\n }\n /* istanbul ignore next */\n : create_array;\n\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\n\n/**\n * Reads a varint as an unsigned 32 bit value.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.uint32 = (function read_uint32_setup() {\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\n return function read_uint32() {\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\n\n /* istanbul ignore if */\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n };\n})();\n\n/**\n * Reads a varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.int32 = function read_int32() {\n return this.uint32() | 0;\n};\n\n/**\n * Reads a zig-zag encoded varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.sint32 = function read_sint32() {\n var value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readLongVarint() {\n // tends to deopt with local vars for octet etc.\n var bits = new LongBits(0, 0);\n var i = 0;\n if (this.len - this.pos > 4) { // fast route (lo)\n for (; i < 4; ++i) {\n // 1st..4th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n // 5th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n i = 0;\n } else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n // 1st..3th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n // 4th\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\n return bits;\n }\n if (this.len - this.pos > 4) { // fast route (hi)\n for (; i < 5; ++i) {\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n } else {\n for (; i < 5; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n }\n /* istanbul ignore next */\n throw Error(\"invalid varint encoding\");\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads a varint as a signed 64 bit value.\n * @name Reader#int64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as an unsigned 64 bit value.\n * @name Reader#uint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a zig-zag encoded varint as a signed 64 bit value.\n * @name Reader#sint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as a boolean.\n * @returns {boolean} Value read\n */\nReader.prototype.bool = function read_bool() {\n return this.uint32() !== 0;\n};\n\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\n return (buf[end - 4]\n | buf[end - 3] << 8\n | buf[end - 2] << 16\n | buf[end - 1] << 24) >>> 0;\n}\n\n/**\n * Reads fixed 32 bits as an unsigned 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.fixed32 = function read_fixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4);\n};\n\n/**\n * Reads fixed 32 bits as a signed 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.sfixed32 = function read_sfixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readFixed64(/* this: Reader */) {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 8);\n\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads fixed 64 bits.\n * @name Reader#fixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads zig-zag encoded fixed 64 bits.\n * @name Reader#sfixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a float (32 bit) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.float = function read_float() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n};\n\n/**\n * Reads a double (64 bit float) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.double = function read_double() {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @returns {Uint8Array} Value read\n */\nReader.prototype.bytes = function read_bytes() {\n var length = this.uint32(),\n start = this.pos,\n end = this.pos + length;\n\n /* istanbul ignore if */\n if (end > this.len)\n throw indexOutOfRange(this, length);\n\n this.pos += length;\n if (Array.isArray(this.buf)) // plain array\n return this.buf.slice(start, end);\n return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\n ? new this.buf.constructor(0)\n : this._slice.call(this.buf, start, end);\n};\n\n/**\n * Reads a string preceeded by its byte length as a varint.\n * @returns {string} Value read\n */\nReader.prototype.string = function read_string() {\n var bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n};\n\n/**\n * Skips the specified number of bytes if specified, otherwise skips a varint.\n * @param {number} [length] Length if known, otherwise a varint is assumed\n * @returns {Reader} `this`\n */\nReader.prototype.skip = function skip(length) {\n if (typeof length === \"number\") {\n /* istanbul ignore if */\n if (this.pos + length > this.len)\n throw indexOutOfRange(this, length);\n this.pos += length;\n } else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n } while (this.buf[this.pos++] & 128);\n }\n return this;\n};\n\n/**\n * Skips the next element of the specified wire type.\n * @param {number} wireType Wire type received\n * @returns {Reader} `this`\n */\nReader.prototype.skipType = function(wireType) {\n switch (wireType) {\n case 0:\n this.skip();\n break;\n case 1:\n this.skip(8);\n break;\n case 2:\n this.skip(this.uint32());\n break;\n case 3:\n while ((wireType = this.uint32() & 7) !== 4) {\n this.skipType(wireType);\n }\n break;\n case 5:\n this.skip(4);\n break;\n\n /* istanbul ignore next */\n default:\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\n }\n return this;\n};\n\nReader._configure = function(BufferReader_) {\n BufferReader = BufferReader_;\n\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\n util.merge(Reader.prototype, {\n\n int64: function read_int64() {\n return readLongVarint.call(this)[fn](false);\n },\n\n uint64: function read_uint64() {\n return readLongVarint.call(this)[fn](true);\n },\n\n sint64: function read_sint64() {\n return readLongVarint.call(this).zzDecode()[fn](false);\n },\n\n fixed64: function read_fixed64() {\n return readFixed64.call(this)[fn](true);\n },\n\n sfixed64: function read_sfixed64() {\n return readFixed64.call(this)[fn](false);\n }\n\n });\n};\n","\"use strict\";\nmodule.exports = Type;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = \"Type\";\n\nvar Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n Service = require(\"./service\"),\n Message = require(\"./message\"),\n Reader = require(\"./reader\"),\n Writer = require(\"./writer\"),\n util = require(\"./util\"),\n encoder = require(\"./encoder\"),\n decoder = require(\"./decoder\"),\n verifier = require(\"./verifier\"),\n converter = require(\"./converter\"),\n wrappers = require(\"./wrappers\");\n\n/**\n * Constructs a new reflected message type instance.\n * @classdesc Reflected message type.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Message name\n * @param {Object.} [options] Declared options\n */\nfunction Type(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Message fields.\n * @type {Object.}\n */\n this.fields = {}; // toJSON, marker\n\n /**\n * Oneofs declared within this namespace, if any.\n * @type {Object.}\n */\n this.oneofs = undefined; // toJSON\n\n /**\n * Extension ranges, if any.\n * @type {number[][]}\n */\n this.extensions = undefined; // toJSON\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n /*?\n * Whether this type is a legacy group.\n * @type {boolean|undefined}\n */\n this.group = undefined; // toJSON\n\n /**\n * Cached fields by id.\n * @type {Object.|null}\n * @private\n */\n this._fieldsById = null;\n\n /**\n * Cached fields as an array.\n * @type {Field[]|null}\n * @private\n */\n this._fieldsArray = null;\n\n /**\n * Cached oneofs as an array.\n * @type {OneOf[]|null}\n * @private\n */\n this._oneofsArray = null;\n\n /**\n * Cached constructor.\n * @type {Constructor<{}>}\n * @private\n */\n this._ctor = null;\n}\n\nObject.defineProperties(Type.prototype, {\n\n /**\n * Message fields by id.\n * @name Type#fieldsById\n * @type {Object.}\n * @readonly\n */\n fieldsById: {\n get: function() {\n\n /* istanbul ignore if */\n if (this._fieldsById)\n return this._fieldsById;\n\n this._fieldsById = {};\n for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) {\n var field = this.fields[names[i]],\n id = field.id;\n\n /* istanbul ignore if */\n if (this._fieldsById[id])\n throw Error(\"duplicate id \" + id + \" in \" + this);\n\n this._fieldsById[id] = field;\n }\n return this._fieldsById;\n }\n },\n\n /**\n * Fields of this message as an array for iteration.\n * @name Type#fieldsArray\n * @type {Field[]}\n * @readonly\n */\n fieldsArray: {\n get: function() {\n return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields));\n }\n },\n\n /**\n * Oneofs of this message as an array for iteration.\n * @name Type#oneofsArray\n * @type {OneOf[]}\n * @readonly\n */\n oneofsArray: {\n get: function() {\n return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs));\n }\n },\n\n /**\n * The registered constructor, if any registered, otherwise a generic constructor.\n * Assigning a function replaces the internal constructor. If the function does not extend {@link Message} yet, its prototype will be setup accordingly and static methods will be populated. If it already extends {@link Message}, it will just replace the internal constructor.\n * @name Type#ctor\n * @type {Constructor<{}>}\n */\n ctor: {\n get: function() {\n return this._ctor || (this.ctor = Type.generateConstructor(this)());\n },\n set: function(ctor) {\n\n // Ensure proper prototype\n var prototype = ctor.prototype;\n if (!(prototype instanceof Message)) {\n (ctor.prototype = new Message()).constructor = ctor;\n util.merge(ctor.prototype, prototype);\n }\n\n // Classes and messages reference their reflected type\n ctor.$type = ctor.prototype.$type = this;\n\n // Mix in static methods\n util.merge(ctor, Message, true);\n\n this._ctor = ctor;\n\n // Messages have non-enumerable default values on their prototype\n var i = 0;\n for (; i < /* initializes */ this.fieldsArray.length; ++i)\n this._fieldsArray[i].resolve(); // ensures a proper value\n\n // Messages have non-enumerable getters and setters for each virtual oneof field\n var ctorProperties = {};\n for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i)\n ctorProperties[this._oneofsArray[i].resolve().name] = {\n get: util.oneOfGetter(this._oneofsArray[i].oneof),\n set: util.oneOfSetter(this._oneofsArray[i].oneof)\n };\n if (i)\n Object.defineProperties(ctor.prototype, ctorProperties);\n }\n }\n});\n\n/**\n * Generates a constructor function for the specified type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nType.generateConstructor = function generateConstructor(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"p\"], mtype.name);\n // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype\n for (var i = 0, field; i < mtype.fieldsArray.length; ++i)\n if ((field = mtype._fieldsArray[i]).map) gen\n (\"this%s={}\", util.safeProp(field.name));\n else if (field.repeated) gen\n (\"this%s=[]\", util.safeProp(field.name));\n return gen\n (\"if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors\n * @property {Object.} fields Field descriptors\n * @property {number[][]} [extensions] Extension ranges\n * @property {number[][]} [reserved] Reserved ranges\n * @property {boolean} [group=false] Whether a legacy group or not\n */\n\n/**\n * Creates a message type from a message type descriptor.\n * @param {string} name Message name\n * @param {IType} json Message type descriptor\n * @returns {Type} Created message type\n */\nType.fromJSON = function fromJSON(name, json) {\n var type = new Type(name, json.options);\n type.extensions = json.extensions;\n type.reserved = json.reserved;\n var names = Object.keys(json.fields),\n i = 0;\n for (; i < names.length; ++i)\n type.add(\n ( typeof json.fields[names[i]].keyType !== \"undefined\"\n ? MapField.fromJSON\n : Field.fromJSON )(names[i], json.fields[names[i]])\n );\n if (json.oneofs)\n for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i)\n type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]]));\n if (json.nested)\n for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) {\n var nested = json.nested[names[i]];\n type.add( // most to least likely\n ( nested.id !== undefined\n ? Field.fromJSON\n : nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n if (json.extensions && json.extensions.length)\n type.extensions = json.extensions;\n if (json.reserved && json.reserved.length)\n type.reserved = json.reserved;\n if (json.group)\n type.group = true;\n if (json.comment)\n type.comment = json.comment;\n return type;\n};\n\n/**\n * Converts this message type to a message type descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IType} Message type descriptor\n */\nType.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , inherited && inherited.options || undefined,\n \"oneofs\" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions),\n \"fields\" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {},\n \"extensions\" , this.extensions && this.extensions.length ? this.extensions : undefined,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"group\" , this.group || undefined,\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nType.prototype.resolveAll = function resolveAll() {\n var fields = this.fieldsArray, i = 0;\n while (i < fields.length)\n fields[i++].resolve();\n var oneofs = this.oneofsArray; i = 0;\n while (i < oneofs.length)\n oneofs[i++].resolve();\n return Namespace.prototype.resolveAll.call(this);\n};\n\n/**\n * @override\n */\nType.prototype.get = function get(name) {\n return this.fields[name]\n || this.oneofs && this.oneofs[name]\n || this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Adds a nested object to this type.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a nested object with this name or, if a field, when there is already a field with this id\n */\nType.prototype.add = function add(object) {\n\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Field && object.extend === undefined) {\n // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects.\n // The root object takes care of adding distinct sister-fields to the respective extended\n // type instead.\n\n // avoids calling the getter if not absolutely necessary because it's called quite frequently\n if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id])\n throw Error(\"duplicate id \" + object.id + \" in \" + this);\n if (this.isReservedId(object.id))\n throw Error(\"id \" + object.id + \" is reserved in \" + this);\n if (this.isReservedName(object.name))\n throw Error(\"name '\" + object.name + \"' is reserved in \" + this);\n\n if (object.parent)\n object.parent.remove(object);\n this.fields[object.name] = object;\n object.message = this;\n object.onAdd(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n if (!this.oneofs)\n this.oneofs = {};\n this.oneofs[object.name] = object;\n object.onAdd(this);\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * Removes a nested object from this type.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this type\n */\nType.prototype.remove = function remove(object) {\n if (object instanceof Field && object.extend === undefined) {\n // See Type#add for the reason why extension fields are excluded here.\n\n /* istanbul ignore if */\n if (!this.fields || this.fields[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.fields[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n\n /* istanbul ignore if */\n if (!this.oneofs || this.oneofs[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.oneofs[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\n};\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message<{}>} Message instance\n */\nType.prototype.create = function create(properties) {\n return new this.ctor(properties);\n};\n\n/**\n * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}.\n * @returns {Type} `this`\n */\nType.prototype.setup = function setup() {\n // Sets up everything at once so that the prototype chain does not have to be re-evaluated\n // multiple times (V8, soft-deopt prototype-check).\n\n var fullName = this.fullName,\n types = [];\n for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i)\n types.push(this._fieldsArray[i].resolve().resolvedType);\n\n // Replace setup methods with type-specific generated functions\n this.encode = encoder(this)({\n Writer : Writer,\n types : types,\n util : util\n });\n this.decode = decoder(this)({\n Reader : Reader,\n types : types,\n util : util\n });\n this.verify = verifier(this)({\n types : types,\n util : util\n });\n this.fromObject = converter.fromObject(this)({\n types : types,\n util : util\n });\n this.toObject = converter.toObject(this)({\n types : types,\n util : util\n });\n\n // Inject custom wrappers for common types\n var wrapper = wrappers[fullName];\n if (wrapper) {\n var originalThis = Object.create(this);\n // if (wrapper.fromObject) {\n originalThis.fromObject = this.fromObject;\n this.fromObject = wrapper.fromObject.bind(originalThis);\n // }\n // if (wrapper.toObject) {\n originalThis.toObject = this.toObject;\n this.toObject = wrapper.toObject.bind(originalThis);\n // }\n }\n\n return this;\n};\n\n/**\n * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encode = function encode_setup(message, writer) {\n return this.setup().encode(message, writer); // overrides this method\n};\n\n/**\n * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim();\n};\n\n/**\n * Decodes a message of this type.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Length of the message, if known beforehand\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError<{}>} If required fields are missing\n */\nType.prototype.decode = function decode_setup(reader, length) {\n return this.setup().decode(reader, length); // overrides this method\n};\n\n/**\n * Decodes a message of this type preceeded by its byte length as a varint.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError} If required fields are missing\n */\nType.prototype.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof Reader))\n reader = Reader.create(reader);\n return this.decode(reader, reader.uint32());\n};\n\n/**\n * Verifies that field values are valid and that required fields are present.\n * @param {Object.} message Plain object to verify\n * @returns {null|string} `null` if valid, otherwise the reason why it is not\n */\nType.prototype.verify = function verify_setup(message) {\n return this.setup().verify(message); // overrides this method\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object to convert\n * @returns {Message<{}>} Message instance\n */\nType.prototype.fromObject = function fromObject(object) {\n return this.setup().fromObject(object);\n};\n\n/**\n * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}.\n * @interface IConversionOptions\n * @property {Function} [longs] Long conversion type.\n * Valid values are `String` and `Number` (the global types).\n * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library.\n * @property {Function} [enums] Enum value conversion type.\n * Only valid value is `String` (the global type).\n * Defaults to copy the present value, which is the numeric id.\n * @property {Function} [bytes] Bytes value conversion type.\n * Valid values are `Array` and (a base64 encoded) `String` (the global types).\n * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser.\n * @property {boolean} [defaults=false] Also sets default values on the resulting object\n * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false`\n * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false`\n * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any\n * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings\n */\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n */\nType.prototype.toObject = function toObject(message, options) {\n return this.setup().toObject(message, options);\n};\n\n/**\n * Decorator function as returned by {@link Type.d} (TypeScript).\n * @typedef TypeDecorator\n * @type {function}\n * @param {Constructor} target Target constructor\n * @returns {undefined}\n * @template T extends Message\n */\n\n/**\n * Type decorator (TypeScript).\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {TypeDecorator} Decorator function\n * @template T extends Message\n */\nType.d = function decorateType(typeName) {\n return function typeDecorator(target) {\n util.decorateType(target, typeName);\n };\n};\n","\"use strict\";\nmodule.exports = MapField;\n\n// extends Field\nvar Field = require(\"./field\");\n((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = \"MapField\";\n\nvar types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new map field instance.\n * @classdesc Reflected map field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} keyType Key type\n * @param {string} type Value type\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction MapField(name, id, keyType, type, options, comment) {\n Field.call(this, name, id, type, undefined, undefined, options, comment);\n\n /* istanbul ignore if */\n if (!util.isString(keyType))\n throw TypeError(\"keyType must be a string\");\n\n /**\n * Key type.\n * @type {string}\n */\n this.keyType = keyType; // toJSON, marker\n\n /**\n * Resolved key type if not a basic type.\n * @type {ReflectionObject|null}\n */\n this.resolvedKeyType = null;\n\n // Overrides Field#map\n this.map = true;\n}\n\n/**\n * Map field descriptor.\n * @interface IMapField\n * @extends {IField}\n * @property {string} keyType Key type\n */\n\n/**\n * Extension map field descriptor.\n * @interface IExtensionMapField\n * @extends IMapField\n * @property {string} extend Extended type\n */\n\n/**\n * Constructs a map field from a map field descriptor.\n * @param {string} name Field name\n * @param {IMapField} json Map field descriptor\n * @returns {MapField} Created map field\n * @throws {TypeError} If arguments are invalid\n */\nMapField.fromJSON = function fromJSON(name, json) {\n return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment);\n};\n\n/**\n * Converts this map field to a map field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMapField} Map field descriptor\n */\nMapField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"keyType\" , this.keyType,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nMapField.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n\n // Besides a value type, map fields have a key type that may be \"any scalar type except for floating point types and bytes\"\n if (types.mapKey[this.keyType] === undefined)\n throw Error(\"invalid key type: \" + this.keyType);\n\n return Field.prototype.resolve.call(this);\n};\n\n/**\n * Map field decorator (TypeScript).\n * @name MapField.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"} fieldKeyType Field key type\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"|\"bytes\"|Object|Constructor<{}>} fieldValueType Field value type\n * @returns {FieldDecorator} Decorator function\n * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> }\n */\nMapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) {\n\n // submessage value: decorate the submessage and use its name as the type\n if (typeof fieldValueType === \"function\")\n fieldValueType = util.decorateType(fieldValueType).name;\n\n // enum reference value: create a reflected copy of the enum and keep reuseing it\n else if (fieldValueType && typeof fieldValueType === \"object\")\n fieldValueType = util.decorateEnum(fieldValueType).name;\n\n return function mapFieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType));\n };\n};\n","\"use strict\";\nmodule.exports = Service;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = \"Service\";\n\nvar Method = require(\"./method\"),\n util = require(\"./util\"),\n rpc = require(\"./rpc\");\n\n/**\n * Constructs a new service instance.\n * @classdesc Reflected service.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Service name\n * @param {Object.} [options] Service options\n * @throws {TypeError} If arguments are invalid\n */\nfunction Service(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Service methods.\n * @type {Object.}\n */\n this.methods = {}; // toJSON, marker\n\n /**\n * Cached methods as an array.\n * @type {Method[]|null}\n * @private\n */\n this._methodsArray = null;\n}\n\n/**\n * Service descriptor.\n * @interface IService\n * @extends INamespace\n * @property {Object.} methods Method descriptors\n */\n\n/**\n * Constructs a service from a service descriptor.\n * @param {string} name Service name\n * @param {IService} json Service descriptor\n * @returns {Service} Created service\n * @throws {TypeError} If arguments are invalid\n */\nService.fromJSON = function fromJSON(name, json) {\n var service = new Service(name, json.options);\n /* istanbul ignore else */\n if (json.methods)\n for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i)\n service.add(Method.fromJSON(names[i], json.methods[names[i]]));\n if (json.nested)\n service.addJSON(json.nested);\n service.comment = json.comment;\n return service;\n};\n\n/**\n * Converts this service to a service descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IService} Service descriptor\n */\nService.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , inherited && inherited.options || undefined,\n \"methods\" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {},\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Methods of this service as an array for iteration.\n * @name Service#methodsArray\n * @type {Method[]}\n * @readonly\n */\nObject.defineProperty(Service.prototype, \"methodsArray\", {\n get: function() {\n return this._methodsArray || (this._methodsArray = util.toArray(this.methods));\n }\n});\n\nfunction clearCache(service) {\n service._methodsArray = null;\n return service;\n}\n\n/**\n * @override\n */\nService.prototype.get = function get(name) {\n return this.methods[name]\n || Namespace.prototype.get.call(this, name);\n};\n\n/**\n * @override\n */\nService.prototype.resolveAll = function resolveAll() {\n var methods = this.methodsArray;\n for (var i = 0; i < methods.length; ++i)\n methods[i].resolve();\n return Namespace.prototype.resolve.call(this);\n};\n\n/**\n * @override\n */\nService.prototype.add = function add(object) {\n\n /* istanbul ignore if */\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Method) {\n this.methods[object.name] = object;\n object.parent = this;\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * @override\n */\nService.prototype.remove = function remove(object) {\n if (object instanceof Method) {\n\n /* istanbul ignore if */\n if (this.methods[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.methods[object.name];\n object.parent = null;\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Creates a runtime service using the specified rpc implementation.\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed.\n */\nService.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) {\n var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited);\n for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) {\n var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\\w_]/g, \"\");\n rpcService[methodName] = util.codegen([\"r\",\"c\"], util.isReserved(methodName) ? methodName + \"_\" : methodName)(\"return this.rpcCall(m,q,s,r,c)\")({\n m: method,\n q: method.resolvedRequestType.ctor,\n s: method.resolvedResponseType.ctor\n });\n }\n return rpcService;\n};\n","\"use strict\";\nmodule.exports = Method;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = \"Method\";\n\nvar util = require(\"./util\");\n\n/**\n * Constructs a new service method instance.\n * @classdesc Reflected service method.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Method name\n * @param {string|undefined} type Method type, usually `\"rpc\"`\n * @param {string} requestType Request message type\n * @param {string} responseType Response message type\n * @param {boolean|Object.} [requestStream] Whether the request is streamed\n * @param {boolean|Object.} [responseStream] Whether the response is streamed\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this method\n */\nfunction Method(name, type, requestType, responseType, requestStream, responseStream, options, comment) {\n\n /* istanbul ignore next */\n if (util.isObject(requestStream)) {\n options = requestStream;\n requestStream = responseStream = undefined;\n } else if (util.isObject(responseStream)) {\n options = responseStream;\n responseStream = undefined;\n }\n\n /* istanbul ignore if */\n if (!(type === undefined || util.isString(type)))\n throw TypeError(\"type must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(requestType))\n throw TypeError(\"requestType must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(responseType))\n throw TypeError(\"responseType must be a string\");\n\n ReflectionObject.call(this, name, options);\n\n /**\n * Method type.\n * @type {string}\n */\n this.type = type || \"rpc\"; // toJSON\n\n /**\n * Request type.\n * @type {string}\n */\n this.requestType = requestType; // toJSON, marker\n\n /**\n * Whether requests are streamed or not.\n * @type {boolean|undefined}\n */\n this.requestStream = requestStream ? true : undefined; // toJSON\n\n /**\n * Response type.\n * @type {string}\n */\n this.responseType = responseType; // toJSON\n\n /**\n * Whether responses are streamed or not.\n * @type {boolean|undefined}\n */\n this.responseStream = responseStream ? true : undefined; // toJSON\n\n /**\n * Resolved request type.\n * @type {Type|null}\n */\n this.resolvedRequestType = null;\n\n /**\n * Resolved response type.\n * @type {Type|null}\n */\n this.resolvedResponseType = null;\n\n /**\n * Comment for this method\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Method descriptor.\n * @interface IMethod\n * @property {string} [type=\"rpc\"] Method type\n * @property {string} requestType Request type\n * @property {string} responseType Response type\n * @property {boolean} [requestStream=false] Whether requests are streamed\n * @property {boolean} [responseStream=false] Whether responses are streamed\n * @property {Object.} [options] Method options\n */\n\n/**\n * Constructs a method from a method descriptor.\n * @param {string} name Method name\n * @param {IMethod} json Method descriptor\n * @returns {Method} Created method\n * @throws {TypeError} If arguments are invalid\n */\nMethod.fromJSON = function fromJSON(name, json) {\n return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment);\n};\n\n/**\n * Converts this method to a method descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMethod} Method descriptor\n */\nMethod.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"type\" , this.type !== \"rpc\" && /* istanbul ignore next */ this.type || undefined,\n \"requestType\" , this.requestType,\n \"requestStream\" , this.requestStream,\n \"responseType\" , this.responseType,\n \"responseStream\" , this.responseStream,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nMethod.prototype.resolve = function resolve() {\n\n /* istanbul ignore if */\n if (this.resolved)\n return this;\n\n this.resolvedRequestType = this.parent.lookupType(this.requestType);\n this.resolvedResponseType = this.parent.lookupType(this.responseType);\n\n return ReflectionObject.prototype.resolve.call(this);\n};\n","\"use strict\";\nmodule.exports = Message;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new message instance.\n * @classdesc Abstract runtime message.\n * @constructor\n * @param {Properties} [properties] Properties to set\n * @template T extends object = object\n */\nfunction Message(properties) {\n // not used internally\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n this[keys[i]] = properties[keys[i]];\n}\n\n/**\n * Reference to the reflected type.\n * @name Message.$type\n * @type {Type}\n * @readonly\n */\n\n/**\n * Reference to the reflected type.\n * @name Message#$type\n * @type {Type}\n * @readonly\n */\n\n/*eslint-disable valid-jsdoc*/\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.create = function create(properties) {\n return this.$type.create(properties);\n};\n\n/**\n * Encodes a message of this type.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encode = function encode(message, writer) {\n return this.$type.encode(message, writer);\n};\n\n/**\n * Encodes a message of this type preceeded by its length as a varint.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encodeDelimited = function encodeDelimited(message, writer) {\n return this.$type.encodeDelimited(message, writer);\n};\n\n/**\n * Decodes a message of this type.\n * @name Message.decode\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decode = function decode(reader) {\n return this.$type.decode(reader);\n};\n\n/**\n * Decodes a message of this type preceeded by its length as a varint.\n * @name Message.decodeDelimited\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decodeDelimited = function decodeDelimited(reader) {\n return this.$type.decodeDelimited(reader);\n};\n\n/**\n * Verifies a message of this type.\n * @name Message.verify\n * @function\n * @param {Object.} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\nMessage.verify = function verify(message) {\n return this.$type.verify(message);\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object\n * @returns {T} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.fromObject = function fromObject(object) {\n return this.$type.fromObject(object);\n};\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {T} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @template T extends Message\n * @this Constructor\n */\nMessage.toObject = function toObject(message, options) {\n return this.$type.toObject(message, options);\n};\n\n/**\n * Converts this message to JSON.\n * @returns {Object.} JSON object\n */\nMessage.prototype.toJSON = function toJSON() {\n return this.$type.toObject(this, util.toJSONOptions);\n};\n\n/*eslint-enable valid-jsdoc*/","\"use strict\";\nmodule.exports = Root;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = \"Root\";\n\nvar Field = require(\"./field\"),\n Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n util = require(\"./util\");\n\nvar Type, // cyclic\n parse, // might be excluded\n common; // \"\n\n/**\n * Constructs a new root namespace instance.\n * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together.\n * @extends NamespaceBase\n * @constructor\n * @param {Object.} [options] Top level options\n */\nfunction Root(options) {\n Namespace.call(this, \"\", options);\n\n /**\n * Deferred extension fields.\n * @type {Field[]}\n */\n this.deferred = [];\n\n /**\n * Resolved file names of loaded files.\n * @type {string[]}\n */\n this.files = [];\n}\n\n/**\n * Loads a namespace descriptor into a root namespace.\n * @param {INamespace} json Nameespace descriptor\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted\n * @returns {Root} Root namespace\n */\nRoot.fromJSON = function fromJSON(json, root) {\n if (!root)\n root = new Root();\n if (json.options)\n root.setOptions(json.options);\n return root.addJSON(json.nested);\n};\n\n/**\n * Resolves the path of an imported file, relative to the importing origin.\n * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories.\n * @function\n * @param {string} origin The file name of the importing file\n * @param {string} target The file name being imported\n * @returns {string|null} Resolved path to `target` or `null` to skip the file\n */\nRoot.prototype.resolvePath = util.path.resolve;\n\n// A symbol-like function to safely signal synchronous loading\n/* istanbul ignore next */\nfunction SYNC() {} // eslint-disable-line no-empty-function\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} options Parse options\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n */\nRoot.prototype.load = function load(filename, options, callback) {\n if (typeof options === \"function\") {\n callback = options;\n options = undefined;\n }\n var self = this;\n if (!callback)\n return util.asPromise(load, self, filename, options);\n\n var sync = callback === SYNC; // undocumented\n\n // Finishes loading by calling the callback (exactly once)\n function finish(err, root) {\n /* istanbul ignore if */\n if (!callback)\n return;\n var cb = callback;\n callback = null;\n if (sync)\n throw err;\n cb(err, root);\n }\n\n // Processes a single file\n function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued)\n finish(null, self); // only once anyway\n }\n\n // Fetches a single file\n function fetch(filename, weak) {\n\n // Strip path if this file references a bundled definition\n var idx = filename.lastIndexOf(\"google/protobuf/\");\n if (idx > -1) {\n var altname = filename.substring(idx);\n if (altname in common)\n filename = altname;\n }\n\n // Skip if already loaded / attempted\n if (self.files.indexOf(filename) > -1)\n return;\n self.files.push(filename);\n\n // Shortcut bundled definitions\n if (filename in common) {\n if (sync)\n process(filename, common[filename]);\n else {\n ++queued;\n setTimeout(function() {\n --queued;\n process(filename, common[filename]);\n });\n }\n return;\n }\n\n // Otherwise fetch from disk or network\n if (sync) {\n var source;\n try {\n source = util.fs.readFileSync(filename).toString(\"utf8\");\n } catch (err) {\n if (!weak)\n finish(err);\n return;\n }\n process(filename, source);\n } else {\n ++queued;\n util.fetch(filename, function(err, source) {\n --queued;\n /* istanbul ignore if */\n if (!callback)\n return; // terminated meanwhile\n if (err) {\n /* istanbul ignore else */\n if (!weak)\n finish(err);\n else if (!queued) // can't be covered reliably\n finish(null, self);\n return;\n }\n process(filename, source);\n });\n }\n }\n var queued = 0;\n\n // Assembling the root namespace doesn't require working type\n // references anymore, so we can load everything in parallel\n if (util.isString(filename))\n filename = [ filename ];\n for (var i = 0, resolved; i < filename.length; ++i)\n if (resolved = self.resolvePath(\"\", filename[i]))\n fetch(resolved);\n\n if (sync)\n return self;\n if (!queued)\n finish(null, self);\n return undefined;\n};\n// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Promise} Promise\n * @variation 3\n */\n// function load(filename:string, [options:IParseOptions]):Promise\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only).\n * @function Root#loadSync\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n */\nRoot.prototype.loadSync = function loadSync(filename, options) {\n if (!util.isNode)\n throw Error(\"not supported\");\n return this.load(filename, options, SYNC);\n};\n\n/**\n * @override\n */\nRoot.prototype.resolveAll = function resolveAll() {\n if (this.deferred.length)\n throw Error(\"unresolvable extensions: \" + this.deferred.map(function(field) {\n return \"'extend \" + field.extend + \"' in \" + field.parent.fullName;\n }).join(\", \"));\n return Namespace.prototype.resolveAll.call(this);\n};\n\n// only uppercased (and thus conflict-free) children are exposed, see below\nvar exposeRe = /^[A-Z]/;\n\n/**\n * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type.\n * @param {Root} root Root instance\n * @param {Field} field Declaring extension field witin the declaring type\n * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise\n * @inner\n * @ignore\n */\nfunction tryHandleExtension(root, field) {\n var extendedType = field.parent.lookup(field.extend);\n if (extendedType) {\n var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options);\n sisterField.declaringField = field;\n field.extensionField = sisterField;\n extendedType.add(sisterField);\n return true;\n }\n return false;\n}\n\n/**\n * Called when any object is added to this root or its sub-namespaces.\n * @param {ReflectionObject} object Object added\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleAdd = function _handleAdd(object) {\n if (object instanceof Field) {\n\n if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField)\n if (!tryHandleExtension(this, object))\n this.deferred.push(object);\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n object.parent[object.name] = object.values; // expose enum values as property of its parent\n\n } else if (!(object instanceof OneOf)) /* everything else is a namespace */ {\n\n if (object instanceof Type) // Try to handle any deferred extensions\n for (var i = 0; i < this.deferred.length;)\n if (tryHandleExtension(this, this.deferred[i]))\n this.deferred.splice(i, 1);\n else\n ++i;\n for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace\n this._handleAdd(object._nestedArray[j]);\n if (exposeRe.test(object.name))\n object.parent[object.name] = object; // expose namespace as property of its parent\n }\n\n // The above also adds uppercased (and thus conflict-free) nested types, services and enums as\n // properties of namespaces just like static code does. This allows using a .d.ts generated for\n // a static module with reflection-based solutions where the condition is met.\n};\n\n/**\n * Called when any object is removed from this root or its sub-namespaces.\n * @param {ReflectionObject} object Object removed\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleRemove = function _handleRemove(object) {\n if (object instanceof Field) {\n\n if (/* an extension field */ object.extend !== undefined) {\n if (/* already handled */ object.extensionField) { // remove its sister field\n object.extensionField.parent.remove(object.extensionField);\n object.extensionField = null;\n } else { // cancel the extension\n var index = this.deferred.indexOf(object);\n /* istanbul ignore else */\n if (index > -1)\n this.deferred.splice(index, 1);\n }\n }\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose enum values\n\n } else if (object instanceof Namespace) {\n\n for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace\n this._handleRemove(object._nestedArray[i]);\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose namespaces\n\n }\n};\n\n// Sets up cyclic dependencies (called in index-light)\nRoot._configure = function(Type_, parse_, common_) {\n Type = Type_;\n parse = parse_;\n common = common_;\n};\n","var r;\n\nmodule.exports = function rand(len) {\n if (!r)\n r = new Rand(null);\n\n return r.generate(len);\n};\n\nfunction Rand(rand) {\n this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n if (this.rand.getBytes)\n return this.rand.getBytes(n);\n\n var res = new Uint8Array(n);\n for (var i = 0; i < res.length; i++)\n res[i] = this.rand.getByte();\n return res;\n};\n\nif (typeof self === 'object') {\n if (self.crypto && self.crypto.getRandomValues) {\n // Modern browsers\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.crypto.getRandomValues(arr);\n return arr;\n };\n } else if (self.msCrypto && self.msCrypto.getRandomValues) {\n // IE\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.msCrypto.getRandomValues(arr);\n return arr;\n };\n\n // Safari's WebWorkers do not have `crypto`\n } else if (typeof window === 'object') {\n // Old junk\n Rand.prototype._rand = function() {\n throw new Error('Not implemented yet');\n };\n }\n} else {\n // Node.js or Web worker with no crypto support\n try {\n var crypto = require('crypto');\n if (typeof crypto.randomBytes !== 'function')\n throw new Error('Not supported');\n\n Rand.prototype._rand = function _rand(n) {\n return crypto.randomBytes(n);\n };\n } catch (e) {\n }\n}\n","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\nvar curve = require('./curve');\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n if (options.type === 'short')\n this.curve = new curve.short(options);\n else if (options.type === 'edwards')\n this.curve = new curve.edwards(options);\n else\n this.curve = new curve.mont(options);\n this.g = this.curve.g;\n this.n = this.curve.n;\n this.hash = options.hash;\n\n assert(this.g.validate(), 'Invalid curve');\n assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n get: function() {\n var curve = new PresetCurve(options);\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n value: curve,\n });\n return curve;\n },\n });\n}\n\ndefineCurve('p192', {\n type: 'short',\n prime: 'p192',\n p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',\n b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',\n n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',\n hash: hash.sha256,\n gRed: false,\n g: [\n '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',\n '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811',\n ],\n});\n\ndefineCurve('p224', {\n type: 'short',\n prime: 'p224',\n p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',\n b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',\n n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',\n hash: hash.sha256,\n gRed: false,\n g: [\n 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',\n 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34',\n ],\n});\n\ndefineCurve('p256', {\n type: 'short',\n prime: null,\n p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',\n a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',\n b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',\n n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',\n hash: hash.sha256,\n gRed: false,\n g: [\n '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',\n '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5',\n ],\n});\n\ndefineCurve('p384', {\n type: 'short',\n prime: null,\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 ffffffff',\n a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 fffffffc',\n b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +\n '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +\n 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n hash: hash.sha384,\n gRed: false,\n g: [\n 'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +\n '5502f25d bf55296c 3a545e38 72760ab7',\n '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +\n '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f',\n ],\n});\n\ndefineCurve('p521', {\n type: 'short',\n prime: null,\n p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff',\n a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff fffffffc',\n b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +\n '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +\n '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +\n 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n hash: hash.sha512,\n gRed: false,\n g: [\n '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +\n '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +\n 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',\n '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +\n '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +\n '3fad0761 353c7086 a272c240 88be9476 9fd16650',\n ],\n});\n\ndefineCurve('curve25519', {\n type: 'mont',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '76d06',\n b: '1',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: [\n '9',\n ],\n});\n\ndefineCurve('ed25519', {\n type: 'edwards',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '-1',\n c: '1',\n // -121665 * (121666^(-1)) (mod P)\n d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: [\n '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',\n\n // 4/5\n '6666666666666666666666666666666666666666666666666666666666666658',\n ],\n});\n\nvar pre;\ntry {\n pre = require('./precomputed/secp256k1');\n} catch (e) {\n pre = undefined;\n}\n\ndefineCurve('secp256k1', {\n type: 'short',\n prime: 'k256',\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',\n a: '0',\n b: '7',\n n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',\n h: '1',\n hash: hash.sha256,\n\n // Precomputed endomorphism\n beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n basis: [\n {\n a: '3086d221a7d46bcde86c90e49284eb15',\n b: '-e4437ed6010e88286f547fa90abfe4c3',\n },\n {\n a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n b: '3086d221a7d46bcde86c90e49284eb15',\n },\n ],\n\n gRed: false,\n g: [\n '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',\n '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',\n pre,\n ],\n});\n","var hash = exports;\n\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac');\n\n// Proxy hash functions to the main object\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;\n","'use strict'\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\nvar Buffer = require('safe-buffer').Buffer\n\nvar ARRAY16 = new Array(16)\n\nfunction MD5 () {\n HashBase.call(this, 64)\n\n // state\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n}\n\ninherits(MD5, HashBase)\n\nMD5.prototype._update = function () {\n var M = ARRAY16\n for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4)\n\n var a = this._a\n var b = this._b\n var c = this._c\n var d = this._d\n\n a = fnF(a, b, c, d, M[0], 0xd76aa478, 7)\n d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12)\n c = fnF(c, d, a, b, M[2], 0x242070db, 17)\n b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22)\n a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7)\n d = fnF(d, a, b, c, M[5], 0x4787c62a, 12)\n c = fnF(c, d, a, b, M[6], 0xa8304613, 17)\n b = fnF(b, c, d, a, M[7], 0xfd469501, 22)\n a = fnF(a, b, c, d, M[8], 0x698098d8, 7)\n d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12)\n c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17)\n b = fnF(b, c, d, a, M[11], 0x895cd7be, 22)\n a = fnF(a, b, c, d, M[12], 0x6b901122, 7)\n d = fnF(d, a, b, c, M[13], 0xfd987193, 12)\n c = fnF(c, d, a, b, M[14], 0xa679438e, 17)\n b = fnF(b, c, d, a, M[15], 0x49b40821, 22)\n\n a = fnG(a, b, c, d, M[1], 0xf61e2562, 5)\n d = fnG(d, a, b, c, M[6], 0xc040b340, 9)\n c = fnG(c, d, a, b, M[11], 0x265e5a51, 14)\n b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20)\n a = fnG(a, b, c, d, M[5], 0xd62f105d, 5)\n d = fnG(d, a, b, c, M[10], 0x02441453, 9)\n c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14)\n b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20)\n a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5)\n d = fnG(d, a, b, c, M[14], 0xc33707d6, 9)\n c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14)\n b = fnG(b, c, d, a, M[8], 0x455a14ed, 20)\n a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5)\n d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9)\n c = fnG(c, d, a, b, M[7], 0x676f02d9, 14)\n b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20)\n\n a = fnH(a, b, c, d, M[5], 0xfffa3942, 4)\n d = fnH(d, a, b, c, M[8], 0x8771f681, 11)\n c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16)\n b = fnH(b, c, d, a, M[14], 0xfde5380c, 23)\n a = fnH(a, b, c, d, M[1], 0xa4beea44, 4)\n d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11)\n c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16)\n b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23)\n a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4)\n d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11)\n c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16)\n b = fnH(b, c, d, a, M[6], 0x04881d05, 23)\n a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4)\n d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11)\n c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16)\n b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23)\n\n a = fnI(a, b, c, d, M[0], 0xf4292244, 6)\n d = fnI(d, a, b, c, M[7], 0x432aff97, 10)\n c = fnI(c, d, a, b, M[14], 0xab9423a7, 15)\n b = fnI(b, c, d, a, M[5], 0xfc93a039, 21)\n a = fnI(a, b, c, d, M[12], 0x655b59c3, 6)\n d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10)\n c = fnI(c, d, a, b, M[10], 0xffeff47d, 15)\n b = fnI(b, c, d, a, M[1], 0x85845dd1, 21)\n a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6)\n d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10)\n c = fnI(c, d, a, b, M[6], 0xa3014314, 15)\n b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21)\n a = fnI(a, b, c, d, M[4], 0xf7537e82, 6)\n d = fnI(d, a, b, c, M[11], 0xbd3af235, 10)\n c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15)\n b = fnI(b, c, d, a, M[9], 0xeb86d391, 21)\n\n this._a = (this._a + a) | 0\n this._b = (this._b + b) | 0\n this._c = (this._c + c) | 0\n this._d = (this._d + d) | 0\n}\n\nMD5.prototype._digest = function () {\n // create padding and handle blocks\n this._block[this._blockOffset++] = 0x80\n if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\n var buffer = Buffer.allocUnsafe(16)\n buffer.writeInt32LE(this._a, 0)\n buffer.writeInt32LE(this._b, 4)\n buffer.writeInt32LE(this._c, 8)\n buffer.writeInt32LE(this._d, 12)\n return buffer\n}\n\nfunction rotl (x, n) {\n return (x << n) | (x >>> (32 - n))\n}\n\nfunction fnF (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnG (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnH (a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnI (a, b, c, d, m, k, s) {\n return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0\n}\n\nmodule.exports = MD5\n","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;","'use strict'\nvar Buffer = require('buffer').Buffer\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\n\nvar ARRAY16 = new Array(16)\n\nvar zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n]\n\nvar zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n]\n\nvar sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n]\n\nvar sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n]\n\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]\n\nfunction RIPEMD160 () {\n HashBase.call(this, 64)\n\n // state\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n}\n\ninherits(RIPEMD160, HashBase)\n\nRIPEMD160.prototype._update = function () {\n var words = ARRAY16\n for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4)\n\n var al = this._a | 0\n var bl = this._b | 0\n var cl = this._c | 0\n var dl = this._d | 0\n var el = this._e | 0\n\n var ar = this._a | 0\n var br = this._b | 0\n var cr = this._c | 0\n var dr = this._d | 0\n var er = this._e | 0\n\n // computation\n for (var i = 0; i < 80; i += 1) {\n var tl\n var tr\n if (i < 16) {\n tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])\n tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])\n } else if (i < 32) {\n tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])\n tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])\n } else if (i < 48) {\n tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])\n tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])\n } else if (i < 64) {\n tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])\n tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])\n } else { // if (i<80) {\n tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])\n tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i])\n }\n\n al = el\n el = dl\n dl = rotl(cl, 10)\n cl = bl\n bl = tl\n\n ar = er\n er = dr\n dr = rotl(cr, 10)\n cr = br\n br = tr\n }\n\n // update state\n var t = (this._b + cl + dr) | 0\n this._b = (this._c + dl + er) | 0\n this._c = (this._d + el + ar) | 0\n this._d = (this._e + al + br) | 0\n this._e = (this._a + bl + cr) | 0\n this._a = t\n}\n\nRIPEMD160.prototype._digest = function () {\n // create padding and handle blocks\n this._block[this._blockOffset++] = 0x80\n if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\n var buffer = Buffer.alloc ? Buffer.alloc(20) : new Buffer(20)\n buffer.writeInt32LE(this._a, 0)\n buffer.writeInt32LE(this._b, 4)\n buffer.writeInt32LE(this._c, 8)\n buffer.writeInt32LE(this._d, 12)\n buffer.writeInt32LE(this._e, 16)\n return buffer\n}\n\nfunction rotl (x, n) {\n return (x << n) | (x >>> (32 - n))\n}\n\nfunction fn1 (a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn2 (a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn3 (a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn4 (a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn5 (a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0\n}\n\nmodule.exports = RIPEMD160\n","var exports = module.exports = function SHA (algorithm) {\n algorithm = algorithm.toLowerCase()\n\n var Algorithm = exports[algorithm]\n if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')\n\n return new Algorithm()\n}\n\nexports.sha = require('./sha')\nexports.sha1 = require('./sha1')\nexports.sha224 = require('./sha224')\nexports.sha256 = require('./sha256')\nexports.sha384 = require('./sha384')\nexports.sha512 = require('./sha512')\n","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict'\n\nexports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require('randombytes')\nexports.createHash = exports.Hash = require('create-hash')\nexports.createHmac = exports.Hmac = require('create-hmac')\n\nvar algos = require('browserify-sign/algos')\nvar algoKeys = Object.keys(algos)\nvar hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(algoKeys)\nexports.getHashes = function () {\n return hashes\n}\n\nvar p = require('pbkdf2')\nexports.pbkdf2 = p.pbkdf2\nexports.pbkdf2Sync = p.pbkdf2Sync\n\nvar aes = require('browserify-cipher')\n\nexports.Cipher = aes.Cipher\nexports.createCipher = aes.createCipher\nexports.Cipheriv = aes.Cipheriv\nexports.createCipheriv = aes.createCipheriv\nexports.Decipher = aes.Decipher\nexports.createDecipher = aes.createDecipher\nexports.Decipheriv = aes.Decipheriv\nexports.createDecipheriv = aes.createDecipheriv\nexports.getCiphers = aes.getCiphers\nexports.listCiphers = aes.listCiphers\n\nvar dh = require('diffie-hellman')\n\nexports.DiffieHellmanGroup = dh.DiffieHellmanGroup\nexports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup\nexports.getDiffieHellman = dh.getDiffieHellman\nexports.createDiffieHellman = dh.createDiffieHellman\nexports.DiffieHellman = dh.DiffieHellman\n\nvar sign = require('browserify-sign')\n\nexports.createSign = sign.createSign\nexports.Sign = sign.Sign\nexports.createVerify = sign.createVerify\nexports.Verify = sign.Verify\n\nexports.createECDH = require('create-ecdh')\n\nvar publicEncrypt = require('public-encrypt')\n\nexports.publicEncrypt = publicEncrypt.publicEncrypt\nexports.privateEncrypt = publicEncrypt.privateEncrypt\nexports.publicDecrypt = publicEncrypt.publicDecrypt\nexports.privateDecrypt = publicEncrypt.privateDecrypt\n\n// the least I can do is make error messages for the rest of the node.js/crypto api.\n// ;[\n// 'createCredentials'\n// ].forEach(function (name) {\n// exports[name] = function () {\n// throw new Error([\n// 'sorry, ' + name + ' is not implemented yet',\n// 'we accept pull requests',\n// 'https://github.com/crypto-browserify/crypto-browserify'\n// ].join('\\n'))\n// }\n// })\n\nvar rf = require('randomfill')\n\nexports.randomFill = rf.randomFill\nexports.randomFillSync = rf.randomFillSync\n\nexports.createCredentials = function () {\n throw new Error([\n 'sorry, createCredentials is not implemented yet',\n 'we accept pull requests',\n 'https://github.com/crypto-browserify/crypto-browserify'\n ].join('\\n'))\n}\n\nexports.constants = {\n 'DH_CHECK_P_NOT_SAFE_PRIME': 2,\n 'DH_CHECK_P_NOT_PRIME': 1,\n 'DH_UNABLE_TO_CHECK_GENERATOR': 4,\n 'DH_NOT_SUITABLE_GENERATOR': 8,\n 'NPN_ENABLED': 1,\n 'ALPN_ENABLED': 1,\n 'RSA_PKCS1_PADDING': 1,\n 'RSA_SSLV23_PADDING': 2,\n 'RSA_NO_PADDING': 3,\n 'RSA_PKCS1_OAEP_PADDING': 4,\n 'RSA_X931_PADDING': 5,\n 'RSA_PKCS1_PSS_PADDING': 6,\n 'POINT_CONVERSION_COMPRESSED': 2,\n 'POINT_CONVERSION_UNCOMPRESSED': 4,\n 'POINT_CONVERSION_HYBRID': 6\n}\n","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nfunction Cipher(options) {\n this.options = options;\n\n this.type = this.options.type;\n this.blockSize = 8;\n this._init();\n\n this.buffer = new Array(this.blockSize);\n this.bufferOff = 0;\n}\nmodule.exports = Cipher;\n\nCipher.prototype._init = function _init() {\n // Might be overrided\n};\n\nCipher.prototype.update = function update(data) {\n if (data.length === 0)\n return [];\n\n if (this.type === 'decrypt')\n return this._updateDecrypt(data);\n else\n return this._updateEncrypt(data);\n};\n\nCipher.prototype._buffer = function _buffer(data, off) {\n // Append data to buffer\n var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);\n for (var i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n this.bufferOff += min;\n\n // Shift next\n return min;\n};\n\nCipher.prototype._flushBuffer = function _flushBuffer(out, off) {\n this._update(this.buffer, 0, out, off);\n this.bufferOff = 0;\n return this.blockSize;\n};\n\nCipher.prototype._updateEncrypt = function _updateEncrypt(data) {\n var inputOff = 0;\n var outputOff = 0;\n\n var count = ((this.bufferOff + data.length) / this.blockSize) | 0;\n var out = new Array(count * this.blockSize);\n\n if (this.bufferOff !== 0) {\n inputOff += this._buffer(data, inputOff);\n\n if (this.bufferOff === this.buffer.length)\n outputOff += this._flushBuffer(out, outputOff);\n }\n\n // Write blocks\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n for (; inputOff < max; inputOff += this.blockSize) {\n this._update(data, inputOff, out, outputOff);\n outputOff += this.blockSize;\n }\n\n // Queue rest\n for (; inputOff < data.length; inputOff++, this.bufferOff++)\n this.buffer[this.bufferOff] = data[inputOff];\n\n return out;\n};\n\nCipher.prototype._updateDecrypt = function _updateDecrypt(data) {\n var inputOff = 0;\n var outputOff = 0;\n\n var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;\n var out = new Array(count * this.blockSize);\n\n // TODO(indutny): optimize it, this is far from optimal\n for (; count > 0; count--) {\n inputOff += this._buffer(data, inputOff);\n outputOff += this._flushBuffer(out, outputOff);\n }\n\n // Buffer rest of the input\n inputOff += this._buffer(data, inputOff);\n\n return out;\n};\n\nCipher.prototype.final = function final(buffer) {\n var first;\n if (buffer)\n first = this.update(buffer);\n\n var last;\n if (this.type === 'encrypt')\n last = this._finalEncrypt();\n else\n last = this._finalDecrypt();\n\n if (first)\n return first.concat(last);\n else\n return last;\n};\n\nCipher.prototype._pad = function _pad(buffer, off) {\n if (off === 0)\n return false;\n\n while (off < buffer.length)\n buffer[off++] = 0;\n\n return true;\n};\n\nCipher.prototype._finalEncrypt = function _finalEncrypt() {\n if (!this._pad(this.buffer, this.bufferOff))\n return [];\n\n var out = new Array(this.blockSize);\n this._update(this.buffer, 0, out, 0);\n return out;\n};\n\nCipher.prototype._unpad = function _unpad(buffer) {\n return buffer;\n};\n\nCipher.prototype._finalDecrypt = function _finalDecrypt() {\n assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');\n var out = new Array(this.blockSize);\n this._flushBuffer(out, 0);\n\n return this._unpad(out);\n};\n","var modeModules = {\n ECB: require('./ecb'),\n CBC: require('./cbc'),\n CFB: require('./cfb'),\n CFB8: require('./cfb8'),\n CFB1: require('./cfb1'),\n OFB: require('./ofb'),\n CTR: require('./ctr'),\n GCM: require('./ctr')\n}\n\nvar modes = require('./list.json')\n\nfor (var key in modes) {\n modes[key].module = modeModules[modes[key].mode]\n}\n\nmodule.exports = modes\n","// based on the aes implimentation in triple sec\n// https://github.com/keybase/triplesec\n// which is in turn based on the one from crypto-js\n// https://code.google.com/p/crypto-js/\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction asUInt32Array (buf) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n\n var len = (buf.length / 4) | 0\n var out = new Array(len)\n\n for (var i = 0; i < len; i++) {\n out[i] = buf.readUInt32BE(i * 4)\n }\n\n return out\n}\n\nfunction scrubVec (v) {\n for (var i = 0; i < v.length; v++) {\n v[i] = 0\n }\n}\n\nfunction cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) {\n var SUB_MIX0 = SUB_MIX[0]\n var SUB_MIX1 = SUB_MIX[1]\n var SUB_MIX2 = SUB_MIX[2]\n var SUB_MIX3 = SUB_MIX[3]\n\n var s0 = M[0] ^ keySchedule[0]\n var s1 = M[1] ^ keySchedule[1]\n var s2 = M[2] ^ keySchedule[2]\n var s3 = M[3] ^ keySchedule[3]\n var t0, t1, t2, t3\n var ksRow = 4\n\n for (var round = 1; round < nRounds; round++) {\n t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++]\n t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++]\n t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++]\n t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++]\n s0 = t0\n s1 = t1\n s2 = t2\n s3 = t3\n }\n\n t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]\n t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]\n t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]\n t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]\n t0 = t0 >>> 0\n t1 = t1 >>> 0\n t2 = t2 >>> 0\n t3 = t3 >>> 0\n\n return [t0, t1, t2, t3]\n}\n\n// AES constants\nvar RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]\nvar G = (function () {\n // Compute double table\n var d = new Array(256)\n for (var j = 0; j < 256; j++) {\n if (j < 128) {\n d[j] = j << 1\n } else {\n d[j] = (j << 1) ^ 0x11b\n }\n }\n\n var SBOX = []\n var INV_SBOX = []\n var SUB_MIX = [[], [], [], []]\n var INV_SUB_MIX = [[], [], [], []]\n\n // Walk GF(2^8)\n var x = 0\n var xi = 0\n for (var i = 0; i < 256; ++i) {\n // Compute sbox\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4)\n sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63\n SBOX[x] = sx\n INV_SBOX[sx] = x\n\n // Compute multiplication\n var x2 = d[x]\n var x4 = d[x2]\n var x8 = d[x4]\n\n // Compute sub bytes, mix columns tables\n var t = (d[sx] * 0x101) ^ (sx * 0x1010100)\n SUB_MIX[0][x] = (t << 24) | (t >>> 8)\n SUB_MIX[1][x] = (t << 16) | (t >>> 16)\n SUB_MIX[2][x] = (t << 8) | (t >>> 24)\n SUB_MIX[3][x] = t\n\n // Compute inv sub bytes, inv mix columns tables\n t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100)\n INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)\n INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)\n INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)\n INV_SUB_MIX[3][sx] = t\n\n if (x === 0) {\n x = xi = 1\n } else {\n x = x2 ^ d[d[d[x8 ^ x2]]]\n xi ^= d[d[xi]]\n }\n }\n\n return {\n SBOX: SBOX,\n INV_SBOX: INV_SBOX,\n SUB_MIX: SUB_MIX,\n INV_SUB_MIX: INV_SUB_MIX\n }\n})()\n\nfunction AES (key) {\n this._key = asUInt32Array(key)\n this._reset()\n}\n\nAES.blockSize = 4 * 4\nAES.keySize = 256 / 8\nAES.prototype.blockSize = AES.blockSize\nAES.prototype.keySize = AES.keySize\nAES.prototype._reset = function () {\n var keyWords = this._key\n var keySize = keyWords.length\n var nRounds = keySize + 6\n var ksRows = (nRounds + 1) * 4\n\n var keySchedule = []\n for (var k = 0; k < keySize; k++) {\n keySchedule[k] = keyWords[k]\n }\n\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1]\n\n if (k % keySize === 0) {\n t = (t << 8) | (t >>> 24)\n t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 0xff] << 16) |\n (G.SBOX[(t >>> 8) & 0xff] << 8) |\n (G.SBOX[t & 0xff])\n\n t ^= RCON[(k / keySize) | 0] << 24\n } else if (keySize > 6 && k % keySize === 4) {\n t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 0xff] << 16) |\n (G.SBOX[(t >>> 8) & 0xff] << 8) |\n (G.SBOX[t & 0xff])\n }\n\n keySchedule[k] = keySchedule[k - keySize] ^ t\n }\n\n var invKeySchedule = []\n for (var ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik\n var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)]\n\n if (ik < 4 || ksR <= 4) {\n invKeySchedule[ik] = tt\n } else {\n invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]]\n }\n }\n\n this._nRounds = nRounds\n this._keySchedule = keySchedule\n this._invKeySchedule = invKeySchedule\n}\n\nAES.prototype.encryptBlockRaw = function (M) {\n M = asUInt32Array(M)\n return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds)\n}\n\nAES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M)\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0], 0)\n buf.writeUInt32BE(out[1], 4)\n buf.writeUInt32BE(out[2], 8)\n buf.writeUInt32BE(out[3], 12)\n return buf\n}\n\nAES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M)\n\n // swap\n var m1 = M[1]\n M[1] = M[3]\n M[3] = m1\n\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds)\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0], 0)\n buf.writeUInt32BE(out[3], 4)\n buf.writeUInt32BE(out[2], 8)\n buf.writeUInt32BE(out[1], 12)\n return buf\n}\n\nAES.prototype.scrub = function () {\n scrubVec(this._keySchedule)\n scrubVec(this._invKeySchedule)\n scrubVec(this._key)\n}\n\nmodule.exports.AES = AES\n","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;","var BN = require('bn.js')\nvar randomBytes = require('randombytes')\n\nfunction blind (priv) {\n var r = getr(priv)\n var blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed()\n return { blinder: blinder, unblinder: r.invm(priv.modulus) }\n}\n\nfunction getr (priv) {\n var len = priv.modulus.byteLength()\n var r\n do {\n r = new BN(randomBytes(len))\n } while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2))\n return r\n}\n\nfunction crt (msg, priv) {\n var blinds = blind(priv)\n var len = priv.modulus.byteLength()\n var blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus)\n var c1 = blinded.toRed(BN.mont(priv.prime1))\n var c2 = blinded.toRed(BN.mont(priv.prime2))\n var qinv = priv.coefficient\n var p = priv.prime1\n var q = priv.prime2\n var m1 = c1.redPow(priv.exponent1).fromRed()\n var m2 = c2.redPow(priv.exponent2).fromRed()\n var h = m1.isub(m2).imul(qinv).umod(p).imul(q)\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, 'be', len)\n}\ncrt.getr = getr\n\nmodule.exports = crt\n","/* eslint-disable node/no-deprecated-api */\n\n'use strict'\n\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\nvar safer = {}\n\nvar key\n\nfor (key in buffer) {\n if (!buffer.hasOwnProperty(key)) continue\n if (key === 'SlowBuffer' || key === 'Buffer') continue\n safer[key] = buffer[key]\n}\n\nvar Safer = safer.Buffer = {}\nfor (key in Buffer) {\n if (!Buffer.hasOwnProperty(key)) continue\n if (key === 'allocUnsafe' || key === 'allocUnsafeSlow') continue\n Safer[key] = Buffer[key]\n}\n\nsafer.Buffer.prototype = Buffer.prototype\n\nif (!Safer.from || Safer.from === Uint8Array.from) {\n Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value === 'number') {\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value)\n }\n if (value && typeof value.length === 'undefined') {\n throw new TypeError('The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type ' + typeof value)\n }\n return Buffer(value, encodingOrOffset, length)\n }\n}\n\nif (!Safer.alloc) {\n Safer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size)\n }\n if (size < 0 || size >= 2 * (1 << 30)) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n var buf = Buffer(size)\n if (!fill || fill.length === 0) {\n buf.fill(0)\n } else if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n return buf\n }\n}\n\nif (!safer.kStringMaxLength) {\n try {\n safer.kStringMaxLength = process.binding('buffer').kStringMaxLength\n } catch (e) {\n // we can't determine kStringMaxLength in environments where process.binding\n // is unsupported, so let's not set it\n }\n}\n\nif (!safer.constants) {\n safer.constants = {\n MAX_LENGTH: safer.kMaxLength\n }\n if (safer.kStringMaxLength) {\n safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength\n }\n}\n\nmodule.exports = safer\n","'use strict';\n\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n 'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n 'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n 'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n 'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n 'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n 'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n '_peekTag', '_decodeTag', '_use',\n '_decodeStr', '_decodeObjid', '_decodeTime',\n '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n const state = {};\n this._baseState = state;\n\n state.name = name;\n state.enc = enc;\n\n state.parent = parent || null;\n state.children = null;\n\n // State\n state.tag = null;\n state.args = null;\n state.reverseArgs = null;\n state.choice = null;\n state.optional = false;\n state.any = false;\n state.obj = false;\n state.use = null;\n state.useDecoder = null;\n state.key = null;\n state['default'] = null;\n state.explicit = null;\n state.implicit = null;\n state.contains = null;\n\n // Should create new instance on each method\n if (!state.parent) {\n state.children = [];\n this._wrap();\n }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n 'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n 'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n 'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n const state = this._baseState;\n const cstate = {};\n stateProps.forEach(function(prop) {\n cstate[prop] = state[prop];\n });\n const res = new this.constructor(cstate.parent);\n res._baseState = cstate;\n return res;\n};\n\nNode.prototype._wrap = function wrap() {\n const state = this._baseState;\n methods.forEach(function(method) {\n this[method] = function _wrappedMethod() {\n const clone = new this.constructor(this);\n state.children.push(clone);\n return clone[method].apply(clone, arguments);\n };\n }, this);\n};\n\nNode.prototype._init = function init(body) {\n const state = this._baseState;\n\n assert(state.parent === null);\n body.call(this);\n\n // Filter children\n state.children = state.children.filter(function(child) {\n return child._baseState.parent === this;\n }, this);\n assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n const state = this._baseState;\n\n // Filter children and args\n const children = args.filter(function(arg) {\n return arg instanceof this.constructor;\n }, this);\n args = args.filter(function(arg) {\n return !(arg instanceof this.constructor);\n }, this);\n\n if (children.length !== 0) {\n assert(state.children === null);\n state.children = children;\n\n // Replace parent to maintain backward link\n children.forEach(function(child) {\n child._baseState.parent = this;\n }, this);\n }\n if (args.length !== 0) {\n assert(state.args === null);\n state.args = args;\n state.reverseArgs = args.map(function(arg) {\n if (typeof arg !== 'object' || arg.constructor !== Object)\n return arg;\n\n const res = {};\n Object.keys(arg).forEach(function(key) {\n if (key == (key | 0))\n key |= 0;\n const value = arg[key];\n res[value] = key;\n });\n return res;\n });\n }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n Node.prototype[method] = function _overrided() {\n const state = this._baseState;\n throw new Error(method + ' not implemented for encoding: ' + state.enc);\n };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n Node.prototype[tag] = function _tagMethod() {\n const state = this._baseState;\n const args = Array.prototype.slice.call(arguments);\n\n assert(state.tag === null);\n state.tag = tag;\n\n this._useArgs(args);\n\n return this;\n };\n});\n\nNode.prototype.use = function use(item) {\n assert(item);\n const state = this._baseState;\n\n assert(state.use === null);\n state.use = item;\n\n return this;\n};\n\nNode.prototype.optional = function optional() {\n const state = this._baseState;\n\n state.optional = true;\n\n return this;\n};\n\nNode.prototype.def = function def(val) {\n const state = this._baseState;\n\n assert(state['default'] === null);\n state['default'] = val;\n state.optional = true;\n\n return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n const state = this._baseState;\n\n assert(state.explicit === null && state.implicit === null);\n state.explicit = num;\n\n return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n const state = this._baseState;\n\n assert(state.explicit === null && state.implicit === null);\n state.implicit = num;\n\n return this;\n};\n\nNode.prototype.obj = function obj() {\n const state = this._baseState;\n const args = Array.prototype.slice.call(arguments);\n\n state.obj = true;\n\n if (args.length !== 0)\n this._useArgs(args);\n\n return this;\n};\n\nNode.prototype.key = function key(newKey) {\n const state = this._baseState;\n\n assert(state.key === null);\n state.key = newKey;\n\n return this;\n};\n\nNode.prototype.any = function any() {\n const state = this._baseState;\n\n state.any = true;\n\n return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n const state = this._baseState;\n\n assert(state.choice === null);\n state.choice = obj;\n this._useArgs(Object.keys(obj).map(function(key) {\n return obj[key];\n }));\n\n return this;\n};\n\nNode.prototype.contains = function contains(item) {\n const state = this._baseState;\n\n assert(state.use === null);\n state.contains = item;\n\n return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n const state = this._baseState;\n\n // Decode root node\n if (state.parent === null)\n return input.wrapResult(state.children[0]._decode(input, options));\n\n let result = state['default'];\n let present = true;\n\n let prevKey = null;\n if (state.key !== null)\n prevKey = input.enterKey(state.key);\n\n // Check if tag is there\n if (state.optional) {\n let tag = null;\n if (state.explicit !== null)\n tag = state.explicit;\n else if (state.implicit !== null)\n tag = state.implicit;\n else if (state.tag !== null)\n tag = state.tag;\n\n if (tag === null && !state.any) {\n // Trial and Error\n const save = input.save();\n try {\n if (state.choice === null)\n this._decodeGeneric(state.tag, input, options);\n else\n this._decodeChoice(input, options);\n present = true;\n } catch (e) {\n present = false;\n }\n input.restore(save);\n } else {\n present = this._peekTag(input, tag, state.any);\n\n if (input.isError(present))\n return present;\n }\n }\n\n // Push object on stack\n let prevObj;\n if (state.obj && present)\n prevObj = input.enterObject();\n\n if (present) {\n // Unwrap explicit values\n if (state.explicit !== null) {\n const explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit))\n return explicit;\n input = explicit;\n }\n\n const start = input.offset;\n\n // Unwrap implicit and normal values\n if (state.use === null && state.choice === null) {\n let save;\n if (state.any)\n save = input.save();\n const body = this._decodeTag(\n input,\n state.implicit !== null ? state.implicit : state.tag,\n state.any\n );\n if (input.isError(body))\n return body;\n\n if (state.any)\n result = input.raw(save);\n else\n input = body;\n }\n\n if (options && options.track && state.tag !== null)\n options.track(input.path(), start, input.length, 'tagged');\n\n if (options && options.track && state.tag !== null)\n options.track(input.path(), input.offset, input.length, 'content');\n\n // Select proper method for tag\n if (state.any) {\n // no-op\n } else if (state.choice === null) {\n result = this._decodeGeneric(state.tag, input, options);\n } else {\n result = this._decodeChoice(input, options);\n }\n\n if (input.isError(result))\n return result;\n\n // Decode children\n if (!state.any && state.choice === null && state.children !== null) {\n state.children.forEach(function decodeChildren(child) {\n // NOTE: We are ignoring errors here, to let parser continue with other\n // parts of encoded data\n child._decode(input, options);\n });\n }\n\n // Decode contained/encoded by schema, only in bit or octet strings\n if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n const data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)\n ._decode(data, options);\n }\n }\n\n // Pop object\n if (state.obj && present)\n result = input.leaveObject(prevObj);\n\n // Set key\n if (state.key !== null && (result !== null || present === true))\n input.leaveKey(prevKey, state.key, result);\n else if (prevKey !== null)\n input.exitKey(prevKey);\n\n return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n const state = this._baseState;\n\n if (tag === 'seq' || tag === 'set')\n return null;\n if (tag === 'seqof' || tag === 'setof')\n return this._decodeList(input, tag, state.args[0], options);\n else if (/str$/.test(tag))\n return this._decodeStr(input, tag, options);\n else if (tag === 'objid' && state.args)\n return this._decodeObjid(input, state.args[0], state.args[1], options);\n else if (tag === 'objid')\n return this._decodeObjid(input, null, null, options);\n else if (tag === 'gentime' || tag === 'utctime')\n return this._decodeTime(input, tag, options);\n else if (tag === 'null_')\n return this._decodeNull(input, options);\n else if (tag === 'bool')\n return this._decodeBool(input, options);\n else if (tag === 'objDesc')\n return this._decodeStr(input, tag, options);\n else if (tag === 'int' || tag === 'enum')\n return this._decodeInt(input, state.args && state.args[0], options);\n\n if (state.use !== null) {\n return this._getUse(state.use, input._reporterState.obj)\n ._decode(input, options);\n } else {\n return input.error('unknown tag: ' + tag);\n }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n const state = this._baseState;\n // Create altered use decoder if implicit is set\n state.useDecoder = this._use(entity, obj);\n assert(state.useDecoder._baseState.parent === null);\n state.useDecoder = state.useDecoder._baseState.children[0];\n if (state.implicit !== state.useDecoder._baseState.implicit) {\n state.useDecoder = state.useDecoder.clone();\n state.useDecoder._baseState.implicit = state.implicit;\n }\n return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n const state = this._baseState;\n let result = null;\n let match = false;\n\n Object.keys(state.choice).some(function(key) {\n const save = input.save();\n const node = state.choice[key];\n try {\n const value = node._decode(input, options);\n if (input.isError(value))\n return false;\n\n result = { type: key, value: value };\n match = true;\n } catch (e) {\n input.restore(save);\n return false;\n }\n return true;\n }, this);\n\n if (!match)\n return input.error('Choice not matched');\n\n return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n const state = this._baseState;\n if (state['default'] !== null && state['default'] === data)\n return;\n\n const result = this._encodeValue(data, reporter, parent);\n if (result === undefined)\n return;\n\n if (this._skipDefault(result, reporter, parent))\n return;\n\n return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n const state = this._baseState;\n\n // Decode root node\n if (state.parent === null)\n return state.children[0]._encode(data, reporter || new Reporter());\n\n let result = null;\n\n // Set reporter to share it with a child class\n this.reporter = reporter;\n\n // Check if data is there\n if (state.optional && data === undefined) {\n if (state['default'] !== null)\n data = state['default'];\n else\n return;\n }\n\n // Encode children first\n let content = null;\n let primitive = false;\n if (state.any) {\n // Anything that was given is translated to buffer\n result = this._createEncoderBuffer(data);\n } else if (state.choice) {\n result = this._encodeChoice(data, reporter);\n } else if (state.contains) {\n content = this._getUse(state.contains, parent)._encode(data, reporter);\n primitive = true;\n } else if (state.children) {\n content = state.children.map(function(child) {\n if (child._baseState.tag === 'null_')\n return child._encode(null, reporter, data);\n\n if (child._baseState.key === null)\n return reporter.error('Child should have a key');\n const prevKey = reporter.enterKey(child._baseState.key);\n\n if (typeof data !== 'object')\n return reporter.error('Child expected, but input is not object');\n\n const res = child._encode(data[child._baseState.key], reporter, data);\n reporter.leaveKey(prevKey);\n\n return res;\n }, this).filter(function(child) {\n return child;\n });\n content = this._createEncoderBuffer(content);\n } else {\n if (state.tag === 'seqof' || state.tag === 'setof') {\n // TODO(indutny): this should be thrown on DSL level\n if (!(state.args && state.args.length === 1))\n return reporter.error('Too many args for : ' + state.tag);\n\n if (!Array.isArray(data))\n return reporter.error('seqof/setof, but data is not Array');\n\n const child = this.clone();\n child._baseState.implicit = null;\n content = this._createEncoderBuffer(data.map(function(item) {\n const state = this._baseState;\n\n return this._getUse(state.args[0], data)._encode(item, reporter);\n }, child));\n } else if (state.use !== null) {\n result = this._getUse(state.use, parent)._encode(data, reporter);\n } else {\n content = this._encodePrimitive(state.tag, data);\n primitive = true;\n }\n }\n\n // Encode data itself\n if (!state.any && state.choice === null) {\n const tag = state.implicit !== null ? state.implicit : state.tag;\n const cls = state.implicit === null ? 'universal' : 'context';\n\n if (tag === null) {\n if (state.use === null)\n reporter.error('Tag could be omitted only for .use()');\n } else {\n if (state.use === null)\n result = this._encodeComposite(tag, primitive, cls, content);\n }\n }\n\n // Wrap in explicit\n if (state.explicit !== null)\n result = this._encodeComposite(state.explicit, false, 'context', result);\n\n return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n const state = this._baseState;\n\n const node = state.choice[data.type];\n if (!node) {\n assert(\n false,\n data.type + ' not found in ' +\n JSON.stringify(Object.keys(state.choice)));\n }\n return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n const state = this._baseState;\n\n if (/str$/.test(tag))\n return this._encodeStr(data, tag);\n else if (tag === 'objid' && state.args)\n return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n else if (tag === 'objid')\n return this._encodeObjid(data, null, null);\n else if (tag === 'gentime' || tag === 'utctime')\n return this._encodeTime(data, tag);\n else if (tag === 'null_')\n return this._encodeNull();\n else if (tag === 'int' || tag === 'enum')\n return this._encodeInt(data, state.args && state.reverseArgs[0]);\n else if (tag === 'bool')\n return this._encodeBool(data);\n else if (tag === 'objDesc')\n return this._encodeStr(data, tag);\n else\n throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n Reporter.call(this, options);\n if (!Buffer.isBuffer(base)) {\n this.error('Input not Buffer');\n return;\n }\n\n this.base = base;\n this.offset = 0;\n this.length = base.length;\n}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n if (data instanceof DecoderBuffer) {\n return true;\n }\n\n // Or accept compatible API\n const isCompatible = typeof data === 'object' &&\n Buffer.isBuffer(data.base) &&\n data.constructor.name === 'DecoderBuffer' &&\n typeof data.offset === 'number' &&\n typeof data.length === 'number' &&\n typeof data.save === 'function' &&\n typeof data.restore === 'function' &&\n typeof data.isEmpty === 'function' &&\n typeof data.readUInt8 === 'function' &&\n typeof data.skip === 'function' &&\n typeof data.raw === 'function';\n\n return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n // Return skipped data\n const res = new DecoderBuffer(this.base);\n res.offset = save.offset;\n res.length = this.offset;\n\n this.offset = save.offset;\n Reporter.prototype.restore.call(this, save.reporter);\n\n return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n if (this.offset + 1 <= this.length)\n return this.base.readUInt8(this.offset++, true);\n else\n return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n if (!(this.offset + bytes <= this.length))\n return this.error(fail || 'DecoderBuffer overrun');\n\n const res = new DecoderBuffer(this.base);\n\n // Share reporter state\n res._reporterState = this._reporterState;\n\n res.offset = this.offset;\n res.length = this.offset + bytes;\n this.offset += bytes;\n return res;\n};\n\nDecoderBuffer.prototype.raw = function raw(save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n};\n\nfunction EncoderBuffer(value, reporter) {\n if (Array.isArray(value)) {\n this.length = 0;\n this.value = value.map(function(item) {\n if (!EncoderBuffer.isEncoderBuffer(item))\n item = new EncoderBuffer(item, reporter);\n this.length += item.length;\n return item;\n }, this);\n } else if (typeof value === 'number') {\n if (!(0 <= value && value <= 0xff))\n return reporter.error('non-byte EncoderBuffer value');\n this.value = value;\n this.length = 1;\n } else if (typeof value === 'string') {\n this.value = value;\n this.length = Buffer.byteLength(value);\n } else if (Buffer.isBuffer(value)) {\n this.value = value;\n this.length = value.length;\n } else {\n return reporter.error('Unsupported type: ' + typeof value);\n }\n}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n if (data instanceof EncoderBuffer) {\n return true;\n }\n\n // Or accept compatible API\n const isCompatible = typeof data === 'object' &&\n data.constructor.name === 'EncoderBuffer' &&\n typeof data.length === 'number' &&\n typeof data.join === 'function';\n\n return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n if (!out)\n out = Buffer.alloc(this.length);\n if (!offset)\n offset = 0;\n\n if (this.length === 0)\n return out;\n\n if (Array.isArray(this.value)) {\n this.value.forEach(function(item) {\n item.join(out, offset);\n offset += item.length;\n });\n } else {\n if (typeof this.value === 'number')\n out[offset] = this.value;\n else if (typeof this.value === 'string')\n out.write(this.value, offset);\n else if (Buffer.isBuffer(this.value))\n this.value.copy(out, offset);\n offset += this.length;\n }\n\n return out;\n};\n",";(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"), require(\"./sha1\"), require(\"./hmac\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./sha1\", \"./hmac\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var C_algo = C.algo;\n\t var MD5 = C_algo.MD5;\n\n\t /**\n\t * This key derivation function is meant to conform with EVP_BytesToKey.\n\t * www.openssl.org/docs/crypto/EVP_BytesToKey.html\n\t */\n\t var EvpKDF = C_algo.EvpKDF = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)\n\t * @property {Hasher} hasher The hash algorithm to use. Default: MD5\n\t * @property {number} iterations The number of iterations to perform. Default: 1\n\t */\n\t cfg: Base.extend({\n\t keySize: 128/32,\n\t hasher: MD5,\n\t iterations: 1\n\t }),\n\n\t /**\n\t * Initializes a newly created key derivation function.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for the derivation.\n\t *\n\t * @example\n\t *\n\t * var kdf = CryptoJS.algo.EvpKDF.create();\n\t * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 });\n\t * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 });\n\t */\n\t init: function (cfg) {\n\t this.cfg = this.cfg.extend(cfg);\n\t },\n\n\t /**\n\t * Derives a key from a password.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @example\n\t *\n\t * var key = kdf.compute(password, salt);\n\t */\n\t compute: function (password, salt) {\n\t var block;\n\n\t // Shortcut\n\t var cfg = this.cfg;\n\n\t // Init hasher\n\t var hasher = cfg.hasher.create();\n\n\t // Initial values\n\t var derivedKey = WordArray.create();\n\n\t // Shortcuts\n\t var derivedKeyWords = derivedKey.words;\n\t var keySize = cfg.keySize;\n\t var iterations = cfg.iterations;\n\n\t // Generate key\n\t while (derivedKeyWords.length < keySize) {\n\t if (block) {\n\t hasher.update(block);\n\t }\n\t block = hasher.update(password).finalize(salt);\n\t hasher.reset();\n\n\t // Iterations\n\t for (var i = 1; i < iterations; i++) {\n\t block = hasher.finalize(block);\n\t hasher.reset();\n\t }\n\n\t derivedKey.concat(block);\n\t }\n\t derivedKey.sigBytes = keySize * 4;\n\n\t return derivedKey;\n\t }\n\t });\n\n\t /**\n\t * Derives a key from a password.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t * @param {Object} cfg (Optional) The configuration options to use for this computation.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var key = CryptoJS.EvpKDF(password, salt);\n\t * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8 });\n\t * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8, iterations: 1000 });\n\t */\n\t C.EvpKDF = function (password, salt, cfg) {\n\t return EvpKDF.create(cfg).compute(password, salt);\n\t };\n\t}());\n\n\n\treturn CryptoJS.EvpKDF;\n\n}));","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n","// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a51ae424a513ec9a6aa3466baa0cc1d55dd4f3b\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nvar _require = require('./internal/errors'),\n _require$codes = _require.codes,\n ERR_AMBIGUOUS_ARGUMENT = _require$codes.ERR_AMBIGUOUS_ARGUMENT,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_INVALID_ARG_VALUE = _require$codes.ERR_INVALID_ARG_VALUE,\n ERR_INVALID_RETURN_VALUE = _require$codes.ERR_INVALID_RETURN_VALUE,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS;\n\nvar AssertionError = require('./internal/assert/assertion_error');\n\nvar _require2 = require('util/'),\n inspect = _require2.inspect;\n\nvar _require$types = require('util/').types,\n isPromise = _require$types.isPromise,\n isRegExp = _require$types.isRegExp;\n\nvar objectAssign = Object.assign ? Object.assign : require('es6-object-assign').assign;\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar errorCache = new Map();\nvar isDeepEqual;\nvar isDeepStrictEqual;\nvar parseExpressionAt;\nvar findNodeAround;\nvar decoder;\n\nfunction lazyLoadComparison() {\n var comparison = require('./internal/util/comparisons');\n\n isDeepEqual = comparison.isDeepEqual;\n isDeepStrictEqual = comparison.isDeepStrictEqual;\n} // Escape control characters but not \\n and \\t to keep the line breaks and\n// indentation intact.\n// eslint-disable-next-line no-control-regex\n\n\nvar escapeSequencesRegExp = /[\\x00-\\x08\\x0b\\x0c\\x0e-\\x1f]/g;\nvar meta = [\"\\\\u0000\", \"\\\\u0001\", \"\\\\u0002\", \"\\\\u0003\", \"\\\\u0004\", \"\\\\u0005\", \"\\\\u0006\", \"\\\\u0007\", '\\\\b', '', '', \"\\\\u000b\", '\\\\f', '', \"\\\\u000e\", \"\\\\u000f\", \"\\\\u0010\", \"\\\\u0011\", \"\\\\u0012\", \"\\\\u0013\", \"\\\\u0014\", \"\\\\u0015\", \"\\\\u0016\", \"\\\\u0017\", \"\\\\u0018\", \"\\\\u0019\", \"\\\\u001a\", \"\\\\u001b\", \"\\\\u001c\", \"\\\\u001d\", \"\\\\u001e\", \"\\\\u001f\"];\n\nvar escapeFn = function escapeFn(str) {\n return meta[str.charCodeAt(0)];\n};\n\nvar warned = false; // The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\nvar NO_EXCEPTION_SENTINEL = {}; // All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided. All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction innerFail(obj) {\n if (obj.message instanceof Error) throw obj.message;\n throw new AssertionError(obj);\n}\n\nfunction fail(actual, expected, message, operator, stackStartFn) {\n var argsLen = arguments.length;\n var internalMessage;\n\n if (argsLen === 0) {\n internalMessage = 'Failed';\n } else if (argsLen === 1) {\n message = actual;\n actual = undefined;\n } else {\n if (warned === false) {\n warned = true;\n var warn = process.emitWarning ? process.emitWarning : console.warn.bind(console);\n warn('assert.fail() with more than one argument is deprecated. ' + 'Please use assert.strictEqual() instead or only pass a message.', 'DeprecationWarning', 'DEP0094');\n }\n\n if (argsLen === 2) operator = '!=';\n }\n\n if (message instanceof Error) throw message;\n var errArgs = {\n actual: actual,\n expected: expected,\n operator: operator === undefined ? 'fail' : operator,\n stackStartFn: stackStartFn || fail\n };\n\n if (message !== undefined) {\n errArgs.message = message;\n }\n\n var err = new AssertionError(errArgs);\n\n if (internalMessage) {\n err.message = internalMessage;\n err.generatedMessage = true;\n }\n\n throw err;\n}\n\nassert.fail = fail; // The AssertionError is defined in internal/error.\n\nassert.AssertionError = AssertionError;\n\nfunction innerOk(fn, argLen, value, message) {\n if (!value) {\n var generatedMessage = false;\n\n if (argLen === 0) {\n generatedMessage = true;\n message = 'No value argument passed to `assert.ok()`';\n } else if (message instanceof Error) {\n throw message;\n }\n\n var err = new AssertionError({\n actual: value,\n expected: true,\n message: message,\n operator: '==',\n stackStartFn: fn\n });\n err.generatedMessage = generatedMessage;\n throw err;\n }\n} // Pure assertion tests whether a value is truthy, as determined\n// by !!value.\n\n\nfunction ok() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n innerOk.apply(void 0, [ok, args.length].concat(args));\n}\n\nassert.ok = ok; // The equality assertion tests shallow, coercive equality with ==.\n\n/* eslint-disable no-restricted-properties */\n\nassert.equal = function equal(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n } // eslint-disable-next-line eqeqeq\n\n\n if (actual != expected) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: '==',\n stackStartFn: equal\n });\n }\n}; // The non-equality assertion tests for whether two objects are not\n// equal with !=.\n\n\nassert.notEqual = function notEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n } // eslint-disable-next-line eqeqeq\n\n\n if (actual == expected) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: '!=',\n stackStartFn: notEqual\n });\n }\n}; // The equivalence assertion tests a deep equality relation.\n\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (!isDeepEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'deepEqual',\n stackStartFn: deepEqual\n });\n }\n}; // The non-equivalence assertion tests for any deep inequality.\n\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (isDeepEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notDeepEqual',\n stackStartFn: notDeepEqual\n });\n }\n};\n/* eslint-enable */\n\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (!isDeepStrictEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'deepStrictEqual',\n stackStartFn: deepStrictEqual\n });\n }\n};\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\n\nfunction notDeepStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (isDeepStrictEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notDeepStrictEqual',\n stackStartFn: notDeepStrictEqual\n });\n }\n}\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (!objectIs(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'strictEqual',\n stackStartFn: strictEqual\n });\n }\n};\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (objectIs(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notStrictEqual',\n stackStartFn: notStrictEqual\n });\n }\n};\n\nvar Comparison = function Comparison(obj, keys, actual) {\n var _this = this;\n\n _classCallCheck(this, Comparison);\n\n keys.forEach(function (key) {\n if (key in obj) {\n if (actual !== undefined && typeof actual[key] === 'string' && isRegExp(obj[key]) && obj[key].test(actual[key])) {\n _this[key] = actual[key];\n } else {\n _this[key] = obj[key];\n }\n }\n });\n};\n\nfunction compareExceptionKey(actual, expected, key, message, keys, fn) {\n if (!(key in actual) || !isDeepStrictEqual(actual[key], expected[key])) {\n if (!message) {\n // Create placeholder objects to create a nice output.\n var a = new Comparison(actual, keys);\n var b = new Comparison(expected, keys, actual);\n var err = new AssertionError({\n actual: a,\n expected: b,\n operator: 'deepStrictEqual',\n stackStartFn: fn\n });\n err.actual = actual;\n err.expected = expected;\n err.operator = fn.name;\n throw err;\n }\n\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: fn.name,\n stackStartFn: fn\n });\n }\n}\n\nfunction expectedException(actual, expected, msg, fn) {\n if (typeof expected !== 'function') {\n if (isRegExp(expected)) return expected.test(actual); // assert.doesNotThrow does not accept objects.\n\n if (arguments.length === 2) {\n throw new ERR_INVALID_ARG_TYPE('expected', ['Function', 'RegExp'], expected);\n } // Handle primitives properly.\n\n\n if (_typeof(actual) !== 'object' || actual === null) {\n var err = new AssertionError({\n actual: actual,\n expected: expected,\n message: msg,\n operator: 'deepStrictEqual',\n stackStartFn: fn\n });\n err.operator = fn.name;\n throw err;\n }\n\n var keys = Object.keys(expected); // Special handle errors to make sure the name and the message are compared\n // as well.\n\n if (expected instanceof Error) {\n keys.push('name', 'message');\n } else if (keys.length === 0) {\n throw new ERR_INVALID_ARG_VALUE('error', expected, 'may not be an empty object');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n keys.forEach(function (key) {\n if (typeof actual[key] === 'string' && isRegExp(expected[key]) && expected[key].test(actual[key])) {\n return;\n }\n\n compareExceptionKey(actual, expected, key, msg, keys, fn);\n });\n return true;\n } // Guard instanceof against arrow functions as they don't have a prototype.\n\n\n if (expected.prototype !== undefined && actual instanceof expected) {\n return true;\n }\n\n if (Error.isPrototypeOf(expected)) {\n return false;\n }\n\n return expected.call({}, actual) === true;\n}\n\nfunction getActual(fn) {\n if (typeof fn !== 'function') {\n throw new ERR_INVALID_ARG_TYPE('fn', 'Function', fn);\n }\n\n try {\n fn();\n } catch (e) {\n return e;\n }\n\n return NO_EXCEPTION_SENTINEL;\n}\n\nfunction checkIsPromise(obj) {\n // Accept native ES6 promises and promises that are implemented in a similar\n // way. Do not accept thenables that use a function as `obj` and that have no\n // `catch` handler.\n // TODO: thenables are checked up until they have the correct methods,\n // but according to documentation, the `then` method should receive\n // the `fulfill` and `reject` arguments as well or it may be never resolved.\n return isPromise(obj) || obj !== null && _typeof(obj) === 'object' && typeof obj.then === 'function' && typeof obj.catch === 'function';\n}\n\nfunction waitForActual(promiseFn) {\n return Promise.resolve().then(function () {\n var resultPromise;\n\n if (typeof promiseFn === 'function') {\n // Return a rejected promise if `promiseFn` throws synchronously.\n resultPromise = promiseFn(); // Fail in case no promise is returned.\n\n if (!checkIsPromise(resultPromise)) {\n throw new ERR_INVALID_RETURN_VALUE('instance of Promise', 'promiseFn', resultPromise);\n }\n } else if (checkIsPromise(promiseFn)) {\n resultPromise = promiseFn;\n } else {\n throw new ERR_INVALID_ARG_TYPE('promiseFn', ['Function', 'Promise'], promiseFn);\n }\n\n return Promise.resolve().then(function () {\n return resultPromise;\n }).then(function () {\n return NO_EXCEPTION_SENTINEL;\n }).catch(function (e) {\n return e;\n });\n });\n}\n\nfunction expectsError(stackStartFn, actual, error, message) {\n if (typeof error === 'string') {\n if (arguments.length === 4) {\n throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n }\n\n if (_typeof(actual) === 'object' && actual !== null) {\n if (actual.message === error) {\n throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error message \\\"\".concat(actual.message, \"\\\" is identical to the message.\"));\n }\n } else if (actual === error) {\n throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error \\\"\".concat(actual, \"\\\" is identical to the message.\"));\n }\n\n message = error;\n error = undefined;\n } else if (error != null && _typeof(error) !== 'object' && typeof error !== 'function') {\n throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n }\n\n if (actual === NO_EXCEPTION_SENTINEL) {\n var details = '';\n\n if (error && error.name) {\n details += \" (\".concat(error.name, \")\");\n }\n\n details += message ? \": \".concat(message) : '.';\n var fnType = stackStartFn.name === 'rejects' ? 'rejection' : 'exception';\n innerFail({\n actual: undefined,\n expected: error,\n operator: stackStartFn.name,\n message: \"Missing expected \".concat(fnType).concat(details),\n stackStartFn: stackStartFn\n });\n }\n\n if (error && !expectedException(actual, error, message, stackStartFn)) {\n throw actual;\n }\n}\n\nfunction expectsNoError(stackStartFn, actual, error, message) {\n if (actual === NO_EXCEPTION_SENTINEL) return;\n\n if (typeof error === 'string') {\n message = error;\n error = undefined;\n }\n\n if (!error || expectedException(actual, error)) {\n var details = message ? \": \".concat(message) : '.';\n var fnType = stackStartFn.name === 'doesNotReject' ? 'rejection' : 'exception';\n innerFail({\n actual: actual,\n expected: error,\n operator: stackStartFn.name,\n message: \"Got unwanted \".concat(fnType).concat(details, \"\\n\") + \"Actual message: \\\"\".concat(actual && actual.message, \"\\\"\"),\n stackStartFn: stackStartFn\n });\n }\n\n throw actual;\n}\n\nassert.throws = function throws(promiseFn) {\n for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n args[_key2 - 1] = arguments[_key2];\n }\n\n expectsError.apply(void 0, [throws, getActual(promiseFn)].concat(args));\n};\n\nassert.rejects = function rejects(promiseFn) {\n for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {\n args[_key3 - 1] = arguments[_key3];\n }\n\n return waitForActual(promiseFn).then(function (result) {\n return expectsError.apply(void 0, [rejects, result].concat(args));\n });\n};\n\nassert.doesNotThrow = function doesNotThrow(fn) {\n for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {\n args[_key4 - 1] = arguments[_key4];\n }\n\n expectsNoError.apply(void 0, [doesNotThrow, getActual(fn)].concat(args));\n};\n\nassert.doesNotReject = function doesNotReject(fn) {\n for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {\n args[_key5 - 1] = arguments[_key5];\n }\n\n return waitForActual(fn).then(function (result) {\n return expectsNoError.apply(void 0, [doesNotReject, result].concat(args));\n });\n};\n\nassert.ifError = function ifError(err) {\n if (err !== null && err !== undefined) {\n var message = 'ifError got unwanted exception: ';\n\n if (_typeof(err) === 'object' && typeof err.message === 'string') {\n if (err.message.length === 0 && err.constructor) {\n message += err.constructor.name;\n } else {\n message += err.message;\n }\n } else {\n message += inspect(err);\n }\n\n var newErr = new AssertionError({\n actual: err,\n expected: null,\n operator: 'ifError',\n message: message,\n stackStartFn: ifError\n }); // Make sure we actually have a stack trace!\n\n var origStack = err.stack;\n\n if (typeof origStack === 'string') {\n // This will remove any duplicated frames from the error frames taken\n // from within `ifError` and add the original error frames to the newly\n // created ones.\n var tmp2 = origStack.split('\\n');\n tmp2.shift(); // Filter all frames existing in err.stack.\n\n var tmp1 = newErr.stack.split('\\n');\n\n for (var i = 0; i < tmp2.length; i++) {\n // Find the first occurrence of the frame.\n var pos = tmp1.indexOf(tmp2[i]);\n\n if (pos !== -1) {\n // Only keep new frames.\n tmp1 = tmp1.slice(0, pos);\n break;\n }\n }\n\n newErr.stack = \"\".concat(tmp1.join('\\n'), \"\\n\").concat(tmp2.join('\\n'));\n }\n\n throw newErr;\n }\n}; // Expose a strict only variant of assert\n\n\nfunction strict() {\n for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n args[_key6] = arguments[_key6];\n }\n\n innerOk.apply(void 0, [strict, args.length].concat(args));\n}\n\nassert.strict = objectAssign(strict, assert, {\n equal: assert.strictEqual,\n deepEqual: assert.deepStrictEqual,\n notEqual: assert.notStrictEqual,\n notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [0];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this._strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // '0' - '9'\n if (c >= 48 && c <= 57) {\n return c - 48;\n // 'A' - 'F'\n } else if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n } else {\n assert(false, 'Invalid character in ' + string);\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this._strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var b = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n b = c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n b = c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n b = c;\n }\n assert(c >= 0 && b < mul, 'Invalid character');\n r += b;\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [0];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this._strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n function move (dest, src) {\n dest.words = src.words;\n dest.length = src.length;\n dest.negative = src.negative;\n dest.red = src.red;\n }\n\n BN.prototype._move = function _move (dest) {\n move(dest, this);\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype._strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n // Check Symbol.for because not everywhere where Symbol defined\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n try {\n BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n } catch (e) {\n BN.prototype.inspect = inspect;\n }\n } else {\n BN.prototype.inspect = inspect;\n }\n\n function inspect () {\n return (this.red ? '';\n }\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modrn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16, 2);\n };\n\n if (Buffer) {\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n return this.toArrayLike(Buffer, endian, length);\n };\n }\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n var allocate = function allocate (ArrayType, size) {\n if (ArrayType.allocUnsafe) {\n return ArrayType.allocUnsafe(size);\n }\n return new ArrayType(size);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n this._strip();\n\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n var res = allocate(ArrayType, reqLength);\n var postfix = endian === 'le' ? 'LE' : 'BE';\n this['_toArrayLike' + postfix](res, byteLength);\n return res;\n };\n\n BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n var position = 0;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position++] = word & 0xff;\n if (position < res.length) {\n res[position++] = (word >> 8) & 0xff;\n }\n if (position < res.length) {\n res[position++] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position < res.length) {\n res[position++] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position < res.length) {\n res[position++] = carry;\n\n while (position < res.length) {\n res[position++] = 0;\n }\n }\n };\n\n BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n var position = res.length - 1;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position--] = word & 0xff;\n if (position >= 0) {\n res[position--] = (word >> 8) & 0xff;\n }\n if (position >= 0) {\n res[position--] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position >= 0) {\n res[position--] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position >= 0) {\n res[position--] = carry;\n\n while (position >= 0) {\n res[position--] = 0;\n }\n }\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] >>> wbit) & 0x01;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this._strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this._strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this._strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this._strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this._strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this._strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n function jumboMulTo (self, num, out) {\n // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n // var fftm = new FFTM();\n // return fftm.mulp(self, num, out);\n return bigMulTo(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out._strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this._strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) <= num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this._strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this._strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this._strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q._strip();\n }\n a._strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modrn = function modrn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return isNegNum ? -acc : acc;\n };\n\n // WARNING: DEPRECATED\n BN.prototype.modn = function modn (num) {\n return this.modrn(num);\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n this._strip();\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this._strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is a BN v4 instance\n r.strip();\n } else {\n // r is a BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n move(a, a.umod(this.m)._forceRed(this));\n return a;\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","\"use strict\";\r\nmodule.exports = asPromise;\r\n\r\n/**\r\n * Callback as used by {@link util.asPromise}.\r\n * @typedef asPromiseCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {...*} params Additional arguments\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Returns a promise from a node-style callback function.\r\n * @memberof util\r\n * @param {asPromiseCallback} fn Function to call\r\n * @param {*} ctx Function context\r\n * @param {...*} params Function arguments\r\n * @returns {Promise<*>} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0,\r\n index = 2,\r\n pending = true;\r\n while (index < arguments.length)\r\n params[offset++] = arguments[index++];\r\n return new Promise(function executor(resolve, reject) {\r\n params[offset] = function callback(err/*, varargs */) {\r\n if (pending) {\r\n pending = false;\r\n if (err)\r\n reject(err);\r\n else {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0;\r\n while (offset < params.length)\r\n params[offset++] = arguments[offset];\r\n resolve.apply(null, params);\r\n }\r\n }\r\n };\r\n try {\r\n fn.apply(ctx || null, params);\r\n } catch (err) {\r\n if (pending) {\r\n pending = false;\r\n reject(err);\r\n }\r\n }\r\n });\r\n}\r\n","\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n try {\r\n var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n if (mod && (mod.length || Object.keys(mod).length))\r\n return mod;\r\n } catch (e) {} // eslint-disable-line no-empty\r\n return null;\r\n}\r\n","\"use strict\";\n\n/**\n * Streaming RPC helpers.\n * @namespace\n */\nvar rpc = exports;\n\n/**\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\n * @typedef RPCImpl\n * @type {function}\n * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called\n * @param {Uint8Array} requestData Request data\n * @param {RPCImplCallback} callback Callback function\n * @returns {undefined}\n * @example\n * function rpcImpl(method, requestData, callback) {\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\n * throw Error(\"no such method\");\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\n * callback(err, responseData);\n * });\n * }\n */\n\n/**\n * Node-style callback as used by {@link RPCImpl}.\n * @typedef RPCImplCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\n * @returns {undefined}\n */\n\nrpc.Service = require(\"./rpc/service\");\n","\"use strict\";\nmodule.exports = {};\n\n/**\n * Named roots.\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\n * Can also be used manually to make roots available accross modules.\n * @name roots\n * @type {Object.}\n * @example\n * // pbjs -r myroot -o compiled.js ...\n *\n * // in another module:\n * require(\"./compiled.js\");\n *\n * // in any subsequent module:\n * var root = protobuf.roots[\"myroot\"];\n */\n","\"use strict\";\nmodule.exports = encoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Generates a partial message type encoder.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genTypePartial(gen, field, fieldIndex, ref) {\n return field.resolvedType.group\n ? gen(\"types[%i].encode(%s,w.uint32(%i)).uint32(%i)\", fieldIndex, ref, (field.id << 3 | 3) >>> 0, (field.id << 3 | 4) >>> 0)\n : gen(\"types[%i].encode(%s,w.uint32(%i).fork()).ldelim()\", fieldIndex, ref, (field.id << 3 | 2) >>> 0);\n}\n\n/**\n * Generates an encoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction encoder(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var gen = util.codegen([\"m\", \"w\"], mtype.name + \"$encode\")\n (\"if(!w)\")\n (\"w=Writer.create()\");\n\n var i, ref;\n\n // \"when a message is serialized its known fields should be written sequentially by field number\"\n var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById);\n\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n index = mtype._fieldsArray.indexOf(field),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n wireType = types.basic[type];\n ref = \"m\" + util.safeProp(field.name);\n\n // Map fields\n if (field.map) {\n gen\n (\"if(%s!=null&&m.hasOwnProperty(%j)){\", ref, field.name) // !== undefined && !== null\n (\"for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType);\n if (wireType === undefined) gen\n (\"types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()\", index, ref); // can't be groups\n else gen\n (\".uint32(%i).%s(%s[ks[i]]).ldelim()\", 16 | wireType, type, ref);\n gen\n (\"}\")\n (\"}\");\n\n // Repeated fields\n } else if (field.repeated) { gen\n (\"if(%s!=null&&%s.length){\", ref, ref); // !== undefined && !== null\n\n // Packed repeated\n if (field.packed && types.packed[type] !== undefined) { gen\n\n (\"w.uint32(%i).fork()\", (field.id << 3 | 2) >>> 0)\n (\"for(var i=0;i<%s.length;++i)\", ref)\n (\"w.%s(%s[i])\", type, ref)\n (\"w.ldelim()\");\n\n // Non-packed\n } else { gen\n\n (\"for(var i=0;i<%s.length;++i)\", ref);\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref + \"[i]\");\n else gen\n (\"w.uint32(%i).%s(%s[i])\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n } gen\n (\"}\");\n\n // Non-repeated\n } else {\n if (field.optional) gen\n (\"if(%s!=null&&m.hasOwnProperty(%j))\", ref, field.name); // !== undefined && !== null\n\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref);\n else gen\n (\"w.uint32(%i).%s(%s)\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n }\n }\n\n return gen\n (\"return w\");\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}","\"use strict\";\nmodule.exports = decoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nfunction missing(field) {\n return \"missing required '\" + field.name + \"'\";\n}\n\n/**\n * Generates a decoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction decoder(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"r\", \"l\"], mtype.name + \"$decode\")\n (\"if(!(r instanceof Reader))\")\n (\"r=Reader.create(r)\")\n (\"var c=l===undefined?r.len:r.pos+l,m=new this.ctor\" + (mtype.fieldsArray.filter(function(field) { return field.map; }).length ? \",k\" : \"\"))\n (\"while(r.pos>>3){\");\n\n var i = 0;\n for (; i < /* initializes */ mtype.fieldsArray.length; ++i) {\n var field = mtype._fieldsArray[i].resolve(),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n ref = \"m\" + util.safeProp(field.name); gen\n (\"case %i:\", field.id);\n\n // Map fields\n if (field.map) { gen\n (\"r.skip().pos++\") // assumes id 1 + key wireType\n (\"if(%s===util.emptyObject)\", ref)\n (\"%s={}\", ref)\n (\"k=r.%s()\", field.keyType)\n (\"r.pos++\"); // assumes id 2 + value wireType\n if (types.long[field.keyType] !== undefined) {\n if (types.basic[type] === undefined) gen\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=types[%i].decode(r,r.uint32())\", ref, i); // can't be groups\n else gen\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=r.%s()\", ref, type);\n } else {\n if (types.basic[type] === undefined) gen\n (\"%s[k]=types[%i].decode(r,r.uint32())\", ref, i); // can't be groups\n else gen\n (\"%s[k]=r.%s()\", ref, type);\n }\n\n // Repeated fields\n } else if (field.repeated) { gen\n\n (\"if(!(%s&&%s.length))\", ref, ref)\n (\"%s=[]\", ref);\n\n // Packable (always check for forward and backward compatiblity)\n if (types.packed[type] !== undefined) gen\n (\"if((t&7)===2){\")\n (\"var c2=r.uint32()+r.pos\")\n (\"while(r.pos>>0\", prop, prop);\n break;\n case \"int32\":\n case \"sint32\":\n case \"sfixed32\": gen\n (\"m%s=d%s|0\", prop, prop);\n break;\n case \"uint64\":\n isUnsigned = true;\n // eslint-disable-line no-fallthrough\n case \"int64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(util.Long)\")\n (\"(m%s=util.Long.fromValue(d%s)).unsigned=%j\", prop, prop, isUnsigned)\n (\"else if(typeof d%s===\\\"string\\\")\", prop)\n (\"m%s=parseInt(d%s,10)\", prop, prop)\n (\"else if(typeof d%s===\\\"number\\\")\", prop)\n (\"m%s=d%s\", prop, prop)\n (\"else if(typeof d%s===\\\"object\\\")\", prop)\n (\"m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)\", prop, prop, prop, isUnsigned ? \"true\" : \"\");\n break;\n case \"bytes\": gen\n (\"if(typeof d%s===\\\"string\\\")\", prop)\n (\"util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)\", prop, prop, prop)\n (\"else if(d%s.length)\", prop)\n (\"m%s=d%s\", prop, prop);\n break;\n case \"string\": gen\n (\"m%s=String(d%s)\", prop, prop);\n break;\n case \"bool\": gen\n (\"m%s=Boolean(d%s)\", prop, prop);\n break;\n /* default: gen\n (\"m%s=d%s\", prop, prop);\n break; */\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a plain object to runtime message converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.fromObject = function fromObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray;\n var gen = util.codegen([\"d\"], mtype.name + \"$fromObject\")\n (\"if(d instanceof this.ctor)\")\n (\"return d\");\n if (!fields.length) return gen\n (\"return new this.ctor\");\n gen\n (\"var m=new this.ctor\");\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n prop = util.safeProp(field.name);\n\n // Map fields\n if (field.map) { gen\n (\"if(d%s){\", prop)\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\n (\"m%s={}\", prop)\n (\"for(var ks=Object.keys(d%s),i=0;i>>0,m%s.high>>>0).toNumber(%s):m%s\", prop, prop, prop, prop, isUnsigned ? \"true\": \"\", prop);\n break;\n case \"bytes\": gen\n (\"d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s\", prop, prop, prop, prop, prop);\n break;\n default: gen\n (\"d%s=m%s\", prop, prop);\n break;\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a runtime message to plain object converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.toObject = function toObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById);\n if (!fields.length)\n return util.codegen()(\"return {}\");\n var gen = util.codegen([\"m\", \"o\"], mtype.name + \"$toObject\")\n (\"if(!o)\")\n (\"o={}\")\n (\"var d={}\");\n\n var repeatedFields = [],\n mapFields = [],\n normalFields = [],\n i = 0;\n for (; i < fields.length; ++i)\n if (!fields[i].partOf)\n ( fields[i].resolve().repeated ? repeatedFields\n : fields[i].map ? mapFields\n : normalFields).push(fields[i]);\n\n if (repeatedFields.length) { gen\n (\"if(o.arrays||o.defaults){\");\n for (i = 0; i < repeatedFields.length; ++i) gen\n (\"d%s=[]\", util.safeProp(repeatedFields[i].name));\n gen\n (\"}\");\n }\n\n if (mapFields.length) { gen\n (\"if(o.objects||o.defaults){\");\n for (i = 0; i < mapFields.length; ++i) gen\n (\"d%s={}\", util.safeProp(mapFields[i].name));\n gen\n (\"}\");\n }\n\n if (normalFields.length) { gen\n (\"if(o.defaults){\");\n for (i = 0; i < normalFields.length; ++i) {\n var field = normalFields[i],\n prop = util.safeProp(field.name);\n if (field.resolvedType instanceof Enum) gen\n (\"d%s=o.enums===String?%j:%j\", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault);\n else if (field.long) gen\n (\"if(util.Long){\")\n (\"var n=new util.Long(%i,%i,%j)\", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned)\n (\"d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n\", prop)\n (\"}else\")\n (\"d%s=o.longs===String?%j:%i\", prop, field.typeDefault.toString(), field.typeDefault.toNumber());\n else if (field.bytes) {\n var arrayDefault = \"[\" + Array.prototype.slice.call(field.typeDefault).join(\",\") + \"]\";\n gen\n (\"if(o.bytes===String)d%s=%j\", prop, String.fromCharCode.apply(String, field.typeDefault))\n (\"else{\")\n (\"d%s=%s\", prop, arrayDefault)\n (\"if(o.bytes!==Array)d%s=util.newBuffer(d%s)\", prop, prop)\n (\"}\");\n } else gen\n (\"d%s=%j\", prop, field.typeDefault); // also messages (=null)\n } gen\n (\"}\");\n }\n var hasKs2 = false;\n for (i = 0; i < fields.length; ++i) {\n var field = fields[i],\n index = mtype._fieldsArray.indexOf(field),\n prop = util.safeProp(field.name);\n if (field.map) {\n if (!hasKs2) { hasKs2 = true; gen\n (\"var ks2\");\n } gen\n (\"if(m%s&&(ks2=Object.keys(m%s)).length){\", prop, prop)\n (\"d%s={}\", prop)\n (\"for(var j=0;j}\n * @const\n */\nvar wrappers = exports;\n\nvar Message = require(\"./message\");\n\n/**\n * From object converter part of an {@link IWrapper}.\n * @typedef WrapperFromObjectConverter\n * @type {function}\n * @param {Object.} object Plain object\n * @returns {Message<{}>} Message instance\n * @this Type\n */\n\n/**\n * To object converter part of an {@link IWrapper}.\n * @typedef WrapperToObjectConverter\n * @type {function}\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @this Type\n */\n\n/**\n * Common type wrapper part of {@link wrappers}.\n * @interface IWrapper\n * @property {WrapperFromObjectConverter} [fromObject] From object converter\n * @property {WrapperToObjectConverter} [toObject] To object converter\n */\n\n// Custom wrapper for Any\nwrappers[\".google.protobuf.Any\"] = {\n\n fromObject: function(object) {\n\n // unwrap value type if mapped\n if (object && object[\"@type\"]) {\n var type = this.lookup(object[\"@type\"]);\n /* istanbul ignore else */\n if (type) {\n // type_url does not accept leading \".\"\n var type_url = object[\"@type\"].charAt(0) === \".\" ?\n object[\"@type\"].substr(1) : object[\"@type\"];\n // type_url prefix is optional, but path seperator is required\n return this.create({\n type_url: \"/\" + type_url,\n value: type.encode(type.fromObject(object)).finish()\n });\n }\n }\n\n return this.fromObject(object);\n },\n\n toObject: function(message, options) {\n\n // decode value if requested and unmapped\n if (options && options.json && message.type_url && message.value) {\n // Only use fully qualified type name after the last '/'\n var name = message.type_url.substring(message.type_url.lastIndexOf(\"/\") + 1);\n var type = this.lookup(name);\n /* istanbul ignore else */\n if (type)\n message = type.decode(message.value);\n }\n\n // wrap value if unmapped\n if (!(message instanceof this.ctor) && message instanceof Message) {\n var object = message.$type.toObject(message, options);\n object[\"@type\"] = message.$type.fullName;\n return object;\n }\n\n return this.toObject(message, options);\n }\n};\n","\"use strict\";\nmodule.exports = tokenize;\n\nvar delimRe = /[\\s{}=;:[\\],'\"()<>]/g,\n stringDoubleRe = /(?:\"([^\"\\\\]*(?:\\\\.[^\"\\\\]*)*)\")/g,\n stringSingleRe = /(?:'([^'\\\\]*(?:\\\\.[^'\\\\]*)*)')/g;\n\nvar setCommentRe = /^ *[*/]+ */,\n setCommentAltRe = /^\\s*\\*?\\/*/,\n setCommentSplitRe = /\\n/g,\n whitespaceRe = /\\s/,\n unescapeRe = /\\\\(.?)/g;\n\nvar unescapeMap = {\n \"0\": \"\\0\",\n \"r\": \"\\r\",\n \"n\": \"\\n\",\n \"t\": \"\\t\"\n};\n\n/**\n * Unescapes a string.\n * @param {string} str String to unescape\n * @returns {string} Unescaped string\n * @property {Object.} map Special characters map\n * @memberof tokenize\n */\nfunction unescape(str) {\n return str.replace(unescapeRe, function($0, $1) {\n switch ($1) {\n case \"\\\\\":\n case \"\":\n return $1;\n default:\n return unescapeMap[$1] || \"\";\n }\n });\n}\n\ntokenize.unescape = unescape;\n\n/**\n * Gets the next token and advances.\n * @typedef TokenizerHandleNext\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Peeks for the next token.\n * @typedef TokenizerHandlePeek\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Pushes a token back to the stack.\n * @typedef TokenizerHandlePush\n * @type {function}\n * @param {string} token Token\n * @returns {undefined}\n */\n\n/**\n * Skips the next token.\n * @typedef TokenizerHandleSkip\n * @type {function}\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] If optional\n * @returns {boolean} Whether the token matched\n * @throws {Error} If the token didn't match and is not optional\n */\n\n/**\n * Gets the comment on the previous line or, alternatively, the line comment on the specified line.\n * @typedef TokenizerHandleCmnt\n * @type {function}\n * @param {number} [line] Line number\n * @returns {string|null} Comment text or `null` if none\n */\n\n/**\n * Handle object returned from {@link tokenize}.\n * @interface ITokenizerHandle\n * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof)\n * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof)\n * @property {TokenizerHandlePush} push Pushes a token back to the stack\n * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws\n * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any\n * @property {number} line Current line number\n */\n\n/**\n * Tokenizes the given .proto source and returns an object with useful utility functions.\n * @param {string} source Source contents\n * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode.\n * @returns {ITokenizerHandle} Tokenizer handle\n */\nfunction tokenize(source, alternateCommentMode) {\n /* eslint-disable callback-return */\n source = source.toString();\n\n var offset = 0,\n length = source.length,\n line = 1,\n commentType = null,\n commentText = null,\n commentLine = 0,\n commentLineEmpty = false;\n\n var stack = [];\n\n var stringDelim = null;\n\n /* istanbul ignore next */\n /**\n * Creates an error for illegal syntax.\n * @param {string} subject Subject\n * @returns {Error} Error created\n * @inner\n */\n function illegal(subject) {\n return Error(\"illegal \" + subject + \" (line \" + line + \")\");\n }\n\n /**\n * Reads a string till its end.\n * @returns {string} String read\n * @inner\n */\n function readString() {\n var re = stringDelim === \"'\" ? stringSingleRe : stringDoubleRe;\n re.lastIndex = offset - 1;\n var match = re.exec(source);\n if (!match)\n throw illegal(\"string\");\n offset = re.lastIndex;\n push(stringDelim);\n stringDelim = null;\n return unescape(match[1]);\n }\n\n /**\n * Gets the character at `pos` within the source.\n * @param {number} pos Position\n * @returns {string} Character\n * @inner\n */\n function charAt(pos) {\n return source.charAt(pos);\n }\n\n /**\n * Sets the current comment text.\n * @param {number} start Start offset\n * @param {number} end End offset\n * @returns {undefined}\n * @inner\n */\n function setComment(start, end) {\n commentType = source.charAt(start++);\n commentLine = line;\n commentLineEmpty = false;\n var lookback;\n if (alternateCommentMode) {\n lookback = 2; // alternate comment parsing: \"//\" or \"/*\"\n } else {\n lookback = 3; // \"///\" or \"/**\"\n }\n var commentOffset = start - lookback,\n c;\n do {\n if (--commentOffset < 0 ||\n (c = source.charAt(commentOffset)) === \"\\n\") {\n commentLineEmpty = true;\n break;\n }\n } while (c === \" \" || c === \"\\t\");\n var lines = source\n .substring(start, end)\n .split(setCommentSplitRe);\n for (var i = 0; i < lines.length; ++i)\n lines[i] = lines[i]\n .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, \"\")\n .trim();\n commentText = lines\n .join(\"\\n\")\n .trim();\n }\n\n function isDoubleSlashCommentLine(startOffset) {\n var endOffset = findEndOfLine(startOffset);\n\n // see if remaining line matches comment pattern\n var lineText = source.substring(startOffset, endOffset);\n // look for 1 or 2 slashes since startOffset would already point past\n // the first slash that started the comment.\n var isComment = /^\\s*\\/{1,2}/.test(lineText);\n return isComment;\n }\n\n function findEndOfLine(cursor) {\n // find end of cursor's line\n var endOffset = cursor;\n while (endOffset < length && charAt(endOffset) !== \"\\n\") {\n endOffset++;\n }\n return endOffset;\n }\n\n /**\n * Obtains the next token.\n * @returns {string|null} Next token or `null` on eof\n * @inner\n */\n function next() {\n if (stack.length > 0)\n return stack.shift();\n if (stringDelim)\n return readString();\n var repeat,\n prev,\n curr,\n start,\n isDoc;\n do {\n if (offset === length)\n return null;\n repeat = false;\n while (whitespaceRe.test(curr = charAt(offset))) {\n if (curr === \"\\n\")\n ++line;\n if (++offset === length)\n return null;\n }\n\n if (charAt(offset) === \"/\") {\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n if (charAt(offset) === \"/\") { // Line\n if (!alternateCommentMode) {\n // check for triple-slash comment\n isDoc = charAt(start = offset + 1) === \"/\";\n\n while (charAt(++offset) !== \"\\n\") {\n if (offset === length) {\n return null;\n }\n }\n ++offset;\n if (isDoc) {\n setComment(start, offset - 1);\n }\n ++line;\n repeat = true;\n } else {\n // check for double-slash comments, consolidating consecutive lines\n start = offset;\n isDoc = false;\n if (isDoubleSlashCommentLine(offset)) {\n isDoc = true;\n do {\n offset = findEndOfLine(offset);\n if (offset === length) {\n break;\n }\n offset++;\n } while (isDoubleSlashCommentLine(offset));\n } else {\n offset = Math.min(length, findEndOfLine(offset) + 1);\n }\n if (isDoc) {\n setComment(start, offset);\n }\n line++;\n repeat = true;\n }\n } else if ((curr = charAt(offset)) === \"*\") { /* Block */\n // check for /** (regular comment mode) or /* (alternate comment mode)\n start = offset + 1;\n isDoc = alternateCommentMode || charAt(start) === \"*\";\n do {\n if (curr === \"\\n\") {\n ++line;\n }\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n prev = curr;\n curr = charAt(offset);\n } while (prev !== \"*\" || curr !== \"/\");\n ++offset;\n if (isDoc) {\n setComment(start, offset - 2);\n }\n repeat = true;\n } else {\n return \"/\";\n }\n }\n } while (repeat);\n\n // offset !== length if we got here\n\n var end = offset;\n delimRe.lastIndex = 0;\n var delim = delimRe.test(charAt(end++));\n if (!delim)\n while (end < length && !delimRe.test(charAt(end)))\n ++end;\n var token = source.substring(offset, offset = end);\n if (token === \"\\\"\" || token === \"'\")\n stringDelim = token;\n return token;\n }\n\n /**\n * Pushes a token back to the stack.\n * @param {string} token Token\n * @returns {undefined}\n * @inner\n */\n function push(token) {\n stack.push(token);\n }\n\n /**\n * Peeks for the next token.\n * @returns {string|null} Token or `null` on eof\n * @inner\n */\n function peek() {\n if (!stack.length) {\n var token = next();\n if (token === null)\n return null;\n push(token);\n }\n return stack[0];\n }\n\n /**\n * Skips a token.\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] Whether the token is optional\n * @returns {boolean} `true` when skipped, `false` if not\n * @throws {Error} When a required token is not present\n * @inner\n */\n function skip(expected, optional) {\n var actual = peek(),\n equals = actual === expected;\n if (equals) {\n next();\n return true;\n }\n if (!optional)\n throw illegal(\"token '\" + actual + \"', '\" + expected + \"' expected\");\n return false;\n }\n\n /**\n * Gets a comment.\n * @param {number} [trailingLine] Line number if looking for a trailing comment\n * @returns {string|null} Comment text\n * @inner\n */\n function cmnt(trailingLine) {\n var ret = null;\n if (trailingLine === undefined) {\n if (commentLine === line - 1 && (alternateCommentMode || commentType === \"*\" || commentLineEmpty)) {\n ret = commentText;\n }\n } else {\n /* istanbul ignore else */\n if (commentLine < trailingLine) {\n peek();\n }\n if (commentLine === trailingLine && !commentLineEmpty && (alternateCommentMode || commentType === \"/\")) {\n ret = commentText;\n }\n }\n return ret;\n }\n\n return Object.defineProperty({\n next: next,\n peek: peek,\n push: push,\n skip: skip,\n cmnt: cmnt\n }, \"line\", {\n get: function() { return line; }\n });\n /* eslint-enable callback-return */\n}\n","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg !== 'string') {\n for (var i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n return res;\n }\n if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (var i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else {\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n var hi = c >> 8;\n var lo = c & 0xff;\n if (hi)\n res.push(hi, lo);\n else\n res.push(lo);\n }\n }\n return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n if (enc === 'hex')\n return toHex(arr);\n else\n return arr;\n};\n","'use strict';\n\nvar curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\nvar assert = require('minimalistic-assert');\n\nvar sum32 = utils.sum32;\nvar sum32_4 = utils.sum32_4;\nvar sum32_5 = utils.sum32_5;\nvar ch32 = shaCommon.ch32;\nvar maj32 = shaCommon.maj32;\nvar s0_256 = shaCommon.s0_256;\nvar s1_256 = shaCommon.s1_256;\nvar g0_256 = shaCommon.g0_256;\nvar g1_256 = shaCommon.g1_256;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_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\nfunction SHA256() {\n if (!(this instanceof SHA256))\n return new SHA256();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n ];\n this.k = sha256_K;\n this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\nSHA256.blockSize = 512;\nSHA256.outSize = 256;\nSHA256.hmacStrength = 192;\nSHA256.padLength = 64;\n\nSHA256.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i++)\n W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n var f = this.h[5];\n var g = this.h[6];\n var h = this.h[7];\n\n assert(this.k.length === W.length);\n for (i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);\n var T2 = sum32(s0_256(a), maj32(a, b, c));\n h = g;\n g = f;\n f = e;\n e = sum32(d, T1);\n d = c;\n c = b;\n b = a;\n a = sum32(T1, T2);\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n this.h[5] = sum32(this.h[5], f);\n this.h[6] = sum32(this.h[6], g);\n this.h[7] = sum32(this.h[7], h);\n};\n\nSHA256.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar assert = require('minimalistic-assert');\n\nvar rotr64_hi = utils.rotr64_hi;\nvar rotr64_lo = utils.rotr64_lo;\nvar shr64_hi = utils.shr64_hi;\nvar shr64_lo = utils.shr64_lo;\nvar sum64 = utils.sum64;\nvar sum64_hi = utils.sum64_hi;\nvar sum64_lo = utils.sum64_lo;\nvar sum64_4_hi = utils.sum64_4_hi;\nvar sum64_4_lo = utils.sum64_4_lo;\nvar sum64_5_hi = utils.sum64_5_hi;\nvar sum64_5_lo = utils.sum64_5_lo;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n if (!(this instanceof SHA512))\n return new SHA512();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xf3bcc908,\n 0xbb67ae85, 0x84caa73b,\n 0x3c6ef372, 0xfe94f82b,\n 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1,\n 0x9b05688c, 0x2b3e6c1f,\n 0x1f83d9ab, 0xfb41bd6b,\n 0x5be0cd19, 0x137e2179 ];\n this.k = sha512_K;\n this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\nSHA512.blockSize = 1024;\nSHA512.outSize = 512;\nSHA512.hmacStrength = 192;\nSHA512.padLength = 128;\n\nSHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {\n var W = this.W;\n\n // 32 x 32bit words\n for (var i = 0; i < 32; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n var c3_lo = W[i - 31];\n\n W[i] = sum64_4_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n }\n};\n\nSHA512.prototype._update = function _update(msg, start) {\n this._prepareBlock(msg, start);\n\n var W = this.W;\n\n var ah = this.h[0];\n var al = this.h[1];\n var bh = this.h[2];\n var bl = this.h[3];\n var ch = this.h[4];\n var cl = this.h[5];\n var dh = this.h[6];\n var dl = this.h[7];\n var eh = this.h[8];\n var el = this.h[9];\n var fh = this.h[10];\n var fl = this.h[11];\n var gh = this.h[12];\n var gl = this.h[13];\n var hh = this.h[14];\n var hl = this.h[15];\n\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh;\n var c0_lo = hl;\n var c1_hi = s1_512_hi(eh, el);\n var c1_lo = s1_512_lo(eh, el);\n var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);\n var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);\n var c3_hi = this.k[i];\n var c3_lo = this.k[i + 1];\n var c4_hi = W[i];\n var c4_lo = W[i + 1];\n\n var T1_hi = sum64_5_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n\n c0_hi = s0_512_hi(ah, al);\n c0_lo = s0_512_lo(ah, al);\n c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);\n c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);\n\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);\n var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n\n hh = gh;\n hl = gl;\n\n gh = fh;\n gl = fl;\n\n fh = eh;\n fl = el;\n\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n dh = ch;\n dl = cl;\n\n ch = bh;\n cl = bl;\n\n bh = ah;\n bl = al;\n\n ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);\n al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);\n }\n\n sum64(this.h, 0, ah, al);\n sum64(this.h, 2, bh, bl);\n sum64(this.h, 4, ch, cl);\n sum64(this.h, 6, dh, dl);\n sum64(this.h, 8, eh, el);\n sum64(this.h, 10, fh, fl);\n sum64(this.h, 12, gh, gl);\n sum64(this.h, 14, hh, hl);\n};\n\nSHA512.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n\nfunction ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ ((~xh) & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ ((~xl) & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28);\n var c1_hi = rotr64_hi(xl, xh, 2); // 34\n var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28);\n var c1_lo = rotr64_lo(xl, xh, 2); // 34\n var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14);\n var c1_hi = rotr64_hi(xh, xl, 18);\n var c2_hi = rotr64_hi(xl, xh, 9); // 41\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14);\n var c1_lo = rotr64_lo(xh, xl, 18);\n var c2_lo = rotr64_lo(xl, xh, 9); // 41\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1);\n var c1_hi = rotr64_hi(xh, xl, 8);\n var c2_hi = shr64_hi(xh, xl, 7);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1);\n var c1_lo = rotr64_lo(xh, xl, 8);\n var c2_lo = shr64_lo(xh, xl, 7);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19);\n var c1_hi = rotr64_hi(xl, xh, 29); // 61\n var c2_hi = shr64_hi(xh, xl, 6);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19);\n var c1_lo = rotr64_lo(xl, xh, 29); // 61\n var c2_lo = shr64_lo(xh, xl, 6);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('readable-stream').Transform\nvar inherits = require('inherits')\n\nfunction throwIfNotStringOrBuffer (val, prefix) {\n if (!Buffer.isBuffer(val) && typeof val !== 'string') {\n throw new TypeError(prefix + ' must be a string or a buffer')\n }\n}\n\nfunction HashBase (blockSize) {\n Transform.call(this)\n\n this._block = Buffer.allocUnsafe(blockSize)\n this._blockSize = blockSize\n this._blockOffset = 0\n this._length = [0, 0, 0, 0]\n\n this._finalized = false\n}\n\ninherits(HashBase, Transform)\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n var error = null\n try {\n this.update(chunk, encoding)\n } catch (err) {\n error = err\n }\n\n callback(error)\n}\n\nHashBase.prototype._flush = function (callback) {\n var error = null\n try {\n this.push(this.digest())\n } catch (err) {\n error = err\n }\n\n callback(error)\n}\n\nHashBase.prototype.update = function (data, encoding) {\n throwIfNotStringOrBuffer(data, 'Data')\n if (this._finalized) throw new Error('Digest already called')\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n // consume data\n var block = this._block\n var offset = 0\n while (this._blockOffset + data.length - offset >= this._blockSize) {\n for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\n this._update()\n this._blockOffset = 0\n }\n while (offset < data.length) block[this._blockOffset++] = data[offset++]\n\n // update length\n for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\n this._length[j] += carry\n carry = (this._length[j] / 0x0100000000) | 0\n if (carry > 0) this._length[j] -= 0x0100000000 * carry\n }\n\n return this\n}\n\nHashBase.prototype._update = function () {\n throw new Error('_update is not implemented')\n}\n\nHashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error('Digest already called')\n this._finalized = true\n\n var digest = this._digest()\n if (encoding !== undefined) digest = digest.toString(encoding)\n\n // reset state\n this._block.fill(0)\n this._blockOffset = 0\n for (var i = 0; i < 4; ++i) this._length[i] = 0\n\n return digest\n}\n\nHashBase.prototype._digest = function () {\n throw new Error('_digest is not implemented')\n}\n\nmodule.exports = HashBase\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nmodule.exports = Readable;\n\n/**/\nvar Duplex;\n/**/\n\nReadable.ReadableState = ReadableState;\n\n/**/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/**/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/**/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* */\n\n/**/\nvar Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n\n/**/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\n}","/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar 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\nvar W = new Array(64)\n\nfunction Sha256 () {\n this.init()\n\n this._w = W // new Array(64)\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha256, Hash)\n\nSha256.prototype.init = function () {\n this._a = 0x6a09e667\n this._b = 0xbb67ae85\n this._c = 0x3c6ef372\n this._d = 0xa54ff53a\n this._e = 0x510e527f\n this._f = 0x9b05688c\n this._g = 0x1f83d9ab\n this._h = 0x5be0cd19\n\n return this\n}\n\nfunction ch (x, y, z) {\n return z ^ (x & (y ^ z))\n}\n\nfunction maj (x, y, z) {\n return (x & y) | (z & (x | y))\n}\n\nfunction sigma0 (x) {\n return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10)\n}\n\nfunction sigma1 (x) {\n return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7)\n}\n\nfunction gamma0 (x) {\n return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3)\n}\n\nfunction gamma1 (x) {\n return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10)\n}\n\nSha256.prototype._update = function (M) {\n var W = this._w\n\n var a = this._a | 0\n var b = this._b | 0\n var c = this._c | 0\n var d = this._d | 0\n var e = this._e | 0\n var f = this._f | 0\n var g = this._g | 0\n var h = this._h | 0\n\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0\n\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W[j]) | 0\n var T2 = (sigma0(a) + maj(a, b, c)) | 0\n\n h = g\n g = f\n f = e\n e = (d + T1) | 0\n d = c\n c = b\n b = a\n a = (T1 + T2) | 0\n }\n\n this._a = (a + this._a) | 0\n this._b = (b + this._b) | 0\n this._c = (c + this._c) | 0\n this._d = (d + this._d) | 0\n this._e = (e + this._e) | 0\n this._f = (f + this._f) | 0\n this._g = (g + this._g) | 0\n this._h = (h + this._h) | 0\n}\n\nSha256.prototype._hash = function () {\n var H = Buffer.allocUnsafe(32)\n\n H.writeInt32BE(this._a, 0)\n H.writeInt32BE(this._b, 4)\n H.writeInt32BE(this._c, 8)\n H.writeInt32BE(this._d, 12)\n H.writeInt32BE(this._e, 16)\n H.writeInt32BE(this._f, 20)\n H.writeInt32BE(this._g, 24)\n H.writeInt32BE(this._h, 28)\n\n return H\n}\n\nmodule.exports = Sha256\n","var inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n]\n\nvar W = new Array(160)\n\nfunction Sha512 () {\n this.init()\n this._w = W\n\n Hash.call(this, 128, 112)\n}\n\ninherits(Sha512, Hash)\n\nSha512.prototype.init = function () {\n this._ah = 0x6a09e667\n this._bh = 0xbb67ae85\n this._ch = 0x3c6ef372\n this._dh = 0xa54ff53a\n this._eh = 0x510e527f\n this._fh = 0x9b05688c\n this._gh = 0x1f83d9ab\n this._hh = 0x5be0cd19\n\n this._al = 0xf3bcc908\n this._bl = 0x84caa73b\n this._cl = 0xfe94f82b\n this._dl = 0x5f1d36f1\n this._el = 0xade682d1\n this._fl = 0x2b3e6c1f\n this._gl = 0xfb41bd6b\n this._hl = 0x137e2179\n\n return this\n}\n\nfunction Ch (x, y, z) {\n return z ^ (x & (y ^ z))\n}\n\nfunction maj (x, y, z) {\n return (x & y) | (z & (x | y))\n}\n\nfunction sigma0 (x, xl) {\n return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25)\n}\n\nfunction sigma1 (x, xl) {\n return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23)\n}\n\nfunction Gamma0 (x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7)\n}\n\nfunction Gamma0l (x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25)\n}\n\nfunction Gamma1 (x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6)\n}\n\nfunction Gamma1l (x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26)\n}\n\nfunction getCarry (a, b) {\n return (a >>> 0) < (b >>> 0) ? 1 : 0\n}\n\nSha512.prototype._update = function (M) {\n var W = this._w\n\n var ah = this._ah | 0\n var bh = this._bh | 0\n var ch = this._ch | 0\n var dh = this._dh | 0\n var eh = this._eh | 0\n var fh = this._fh | 0\n var gh = this._gh | 0\n var hh = this._hh | 0\n\n var al = this._al | 0\n var bl = this._bl | 0\n var cl = this._cl | 0\n var dl = this._dl | 0\n var el = this._el | 0\n var fl = this._fl | 0\n var gl = this._gl | 0\n var hl = this._hl | 0\n\n for (var i = 0; i < 32; i += 2) {\n W[i] = M.readInt32BE(i * 4)\n W[i + 1] = M.readInt32BE(i * 4 + 4)\n }\n for (; i < 160; i += 2) {\n var xh = W[i - 15 * 2]\n var xl = W[i - 15 * 2 + 1]\n var gamma0 = Gamma0(xh, xl)\n var gamma0l = Gamma0l(xl, xh)\n\n xh = W[i - 2 * 2]\n xl = W[i - 2 * 2 + 1]\n var gamma1 = Gamma1(xh, xl)\n var gamma1l = Gamma1l(xl, xh)\n\n // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n var Wi7h = W[i - 7 * 2]\n var Wi7l = W[i - 7 * 2 + 1]\n\n var Wi16h = W[i - 16 * 2]\n var Wi16l = W[i - 16 * 2 + 1]\n\n var Wil = (gamma0l + Wi7l) | 0\n var Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0\n Wil = (Wil + gamma1l) | 0\n Wih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0\n Wil = (Wil + Wi16l) | 0\n Wih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0\n\n W[i] = Wih\n W[i + 1] = Wil\n }\n\n for (var j = 0; j < 160; j += 2) {\n Wih = W[j]\n Wil = W[j + 1]\n\n var majh = maj(ah, bh, ch)\n var majl = maj(al, bl, cl)\n\n var sigma0h = sigma0(ah, al)\n var sigma0l = sigma0(al, ah)\n var sigma1h = sigma1(eh, el)\n var sigma1l = sigma1(el, eh)\n\n // t1 = h + sigma1 + ch + K[j] + W[j]\n var Kih = K[j]\n var Kil = K[j + 1]\n\n var chh = Ch(eh, fh, gh)\n var chl = Ch(el, fl, gl)\n\n var t1l = (hl + sigma1l) | 0\n var t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0\n t1l = (t1l + chl) | 0\n t1h = (t1h + chh + getCarry(t1l, chl)) | 0\n t1l = (t1l + Kil) | 0\n t1h = (t1h + Kih + getCarry(t1l, Kil)) | 0\n t1l = (t1l + Wil) | 0\n t1h = (t1h + Wih + getCarry(t1l, Wil)) | 0\n\n // t2 = sigma0 + maj\n var t2l = (sigma0l + majl) | 0\n var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0\n\n hh = gh\n hl = gl\n gh = fh\n gl = fl\n fh = eh\n fl = el\n el = (dl + t1l) | 0\n eh = (dh + t1h + getCarry(el, dl)) | 0\n dh = ch\n dl = cl\n ch = bh\n cl = bl\n bh = ah\n bl = al\n al = (t1l + t2l) | 0\n ah = (t1h + t2h + getCarry(al, t1l)) | 0\n }\n\n this._al = (this._al + al) | 0\n this._bl = (this._bl + bl) | 0\n this._cl = (this._cl + cl) | 0\n this._dl = (this._dl + dl) | 0\n this._el = (this._el + el) | 0\n this._fl = (this._fl + fl) | 0\n this._gl = (this._gl + gl) | 0\n this._hl = (this._hl + hl) | 0\n\n this._ah = (this._ah + ah + getCarry(this._al, al)) | 0\n this._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0\n this._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0\n this._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0\n this._eh = (this._eh + eh + getCarry(this._el, el)) | 0\n this._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0\n this._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0\n this._hh = (this._hh + hh + getCarry(this._hl, hl)) | 0\n}\n\nSha512.prototype._hash = function () {\n var H = Buffer.allocUnsafe(64)\n\n function writeInt64BE (h, l, offset) {\n H.writeInt32BE(h, offset)\n H.writeInt32BE(l, offset + 4)\n }\n\n writeInt64BE(this._ah, this._al, 0)\n writeInt64BE(this._bh, this._bl, 8)\n writeInt64BE(this._ch, this._cl, 16)\n writeInt64BE(this._dh, this._dl, 24)\n writeInt64BE(this._eh, this._el, 32)\n writeInt64BE(this._fh, this._fl, 40)\n writeInt64BE(this._gh, this._gl, 48)\n writeInt64BE(this._hh, this._hl, 56)\n\n return H\n}\n\nmodule.exports = Sha512\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nmodule.exports = Readable;\n\n/**/\nvar Duplex;\n/**/\n\nReadable.ReadableState = ReadableState;\n\n/**/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/**/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/**/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* */\n\n/**/\nvar Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n\n/**/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\n}","exports.pbkdf2 = require('./lib/async')\nexports.pbkdf2Sync = require('./lib/sync')\n","var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs\n\nmodule.exports = function (iterations, keylen) {\n if (typeof iterations !== 'number') {\n throw new TypeError('Iterations not a number')\n }\n\n if (iterations < 0) {\n throw new TypeError('Bad iterations')\n }\n\n if (typeof keylen !== 'number') {\n throw new TypeError('Key length not a number')\n }\n\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */\n throw new TypeError('Bad key length')\n }\n}\n","var defaultEncoding\n/* istanbul ignore next */\nif (global.process && global.process.browser) {\n defaultEncoding = 'utf-8'\n} else if (global.process && global.process.version) {\n var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10)\n\n defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary'\n} else {\n defaultEncoding = 'utf-8'\n}\nmodule.exports = defaultEncoding\n","var md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar toBuffer = require('./to-buffer')\n\nvar ZEROS = Buffer.alloc(128)\nvar sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20\n}\n\nfunction Hmac (alg, key, saltLen) {\n var hash = getDigest(alg)\n var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n if (key.length > blocksize) {\n key = hash(key)\n } else if (key.length < blocksize) {\n key = Buffer.concat([key, ZEROS], blocksize)\n }\n\n var ipad = Buffer.allocUnsafe(blocksize + sizes[alg])\n var opad = Buffer.allocUnsafe(blocksize + sizes[alg])\n for (var i = 0; i < blocksize; i++) {\n ipad[i] = key[i] ^ 0x36\n opad[i] = key[i] ^ 0x5C\n }\n\n var ipad1 = Buffer.allocUnsafe(blocksize + saltLen + 4)\n ipad.copy(ipad1, 0, 0, blocksize)\n this.ipad1 = ipad1\n this.ipad2 = ipad\n this.opad = opad\n this.alg = alg\n this.blocksize = blocksize\n this.hash = hash\n this.size = sizes[alg]\n}\n\nHmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize)\n var h = this.hash(ipad)\n h.copy(this.opad, this.blocksize)\n return this.hash(this.opad)\n}\n\nfunction getDigest (alg) {\n function shaFunc (data) {\n return sha(alg).update(data).digest()\n }\n function rmd160Func (data) {\n return new RIPEMD160().update(data).digest()\n }\n\n if (alg === 'rmd160' || alg === 'ripemd160') return rmd160Func\n if (alg === 'md5') return md5\n return shaFunc\n}\n\nfunction pbkdf2 (password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n\n digest = digest || 'sha1'\n\n var hmac = new Hmac(digest, password, salt.length)\n\n var DK = Buffer.allocUnsafe(keylen)\n var block1 = Buffer.allocUnsafe(salt.length + 4)\n salt.copy(block1, 0, 0, salt.length)\n\n var destPos = 0\n var hLen = sizes[digest]\n var l = Math.ceil(keylen / hLen)\n\n for (var i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length)\n\n var T = hmac.run(block1, hmac.ipad1)\n var U = T\n\n for (var j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2)\n for (var k = 0; k < hLen; k++) T[k] ^= U[k]\n }\n\n T.copy(DK, destPos)\n destPos += hLen\n }\n\n return DK\n}\n\nmodule.exports = pbkdf2\n","var MD5 = require('md5.js')\n\nmodule.exports = function (buffer) {\n return new MD5().update(buffer).digest()\n}\n","var Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (thing, encoding, name) {\n if (Buffer.isBuffer(thing)) {\n return thing\n } else if (typeof thing === 'string') {\n return Buffer.from(thing, encoding)\n } else if (ArrayBuffer.isView(thing)) {\n return Buffer.from(thing.buffer)\n } else {\n throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView')\n }\n}\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar isCallable = require('is-callable');\n\nvar toStr = Object.prototype.toString;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar forEachArray = function forEachArray(array, iterator, receiver) {\n for (var i = 0, len = array.length; i < len; i++) {\n if (hasOwnProperty.call(array, i)) {\n if (receiver == null) {\n iterator(array[i], i, array);\n } else {\n iterator.call(receiver, array[i], i, array);\n }\n }\n }\n};\n\nvar forEachString = function forEachString(string, iterator, receiver) {\n for (var i = 0, len = string.length; i < len; i++) {\n // no such thing as a sparse string.\n if (receiver == null) {\n iterator(string.charAt(i), i, string);\n } else {\n iterator.call(receiver, string.charAt(i), i, string);\n }\n }\n};\n\nvar forEachObject = function forEachObject(object, iterator, receiver) {\n for (var k in object) {\n if (hasOwnProperty.call(object, k)) {\n if (receiver == null) {\n iterator(object[k], k, object);\n } else {\n iterator.call(receiver, object[k], k, object);\n }\n }\n }\n};\n\nvar forEach = function forEach(list, iterator, thisArg) {\n if (!isCallable(iterator)) {\n throw new TypeError('iterator must be a function');\n }\n\n var receiver;\n if (arguments.length >= 3) {\n receiver = thisArg;\n }\n\n if (toStr.call(list) === '[object Array]') {\n forEachArray(list, iterator, receiver);\n } else if (typeof list === 'string') {\n forEachString(list, iterator, receiver);\n } else {\n forEachObject(list, iterator, receiver);\n }\n};\n\nmodule.exports = forEach;\n","'use strict';\n\nvar possibleNames = [\n\t'BigInt64Array',\n\t'BigUint64Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Int8Array',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray'\n];\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\n\nmodule.exports = function availableTypedArrays() {\n\tvar out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\n\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","'use strict';\n\nvar forEach = require('for-each');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar gOPD = require('gopd');\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr) {\n\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor) {\n\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\ttoStrTags[typedArray] = descriptor.get;\n\t\t}\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar anyTrue = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!anyTrue) {\n\t\t\ttry {\n\t\t\t\tanyTrue = getter.call(value) === typedArray;\n\t\t\t} catch (e) { /**/ }\n\t\t}\n\t});\n\treturn anyTrue;\n};\n\nmodule.exports = function isTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag || !(Symbol.toStringTag in value)) {\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\treturn $indexOf(typedArrays, tag) > -1;\n\t}\n\tif (!gOPD) { return false; }\n\treturn tryTypedArrays(value);\n};\n","'use strict';\n\nvar define = require('define-properties');\nvar callBind = require('call-bind');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Object);\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n","'use strict';\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n","'use strict';\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function isNaN(value) {\n\treturn value !== value;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\tif (Number.isNaN && Number.isNaN(NaN) && !Number.isNaN('a')) {\n\t\treturn Number.isNaN;\n\t}\n\treturn implementation;\n};\n","'use strict'\nvar inherits = require('inherits')\nvar Legacy = require('./legacy')\nvar Base = require('cipher-base')\nvar Buffer = require('safe-buffer').Buffer\nvar md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\n\nvar sha = require('sha.js')\n\nvar ZEROS = Buffer.alloc(128)\n\nfunction Hmac (alg, key) {\n Base.call(this, 'digest')\n if (typeof key === 'string') {\n key = Buffer.from(key)\n }\n\n var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n this._alg = alg\n this._key = key\n if (key.length > blocksize) {\n var hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\n key = hash.update(key).digest()\n } else if (key.length < blocksize) {\n key = Buffer.concat([key, ZEROS], blocksize)\n }\n\n var ipad = this._ipad = Buffer.allocUnsafe(blocksize)\n var opad = this._opad = Buffer.allocUnsafe(blocksize)\n\n for (var i = 0; i < blocksize; i++) {\n ipad[i] = key[i] ^ 0x36\n opad[i] = key[i] ^ 0x5C\n }\n this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\n this._hash.update(ipad)\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n this._hash.update(data)\n}\n\nHmac.prototype._final = function () {\n var h = this._hash.digest()\n var hash = this._alg === 'rmd160' ? new RIPEMD160() : sha(this._alg)\n return hash.update(this._opad).update(h).digest()\n}\n\nmodule.exports = function createHmac (alg, key) {\n alg = alg.toLowerCase()\n if (alg === 'rmd160' || alg === 'ripemd160') {\n return new Hmac('rmd160', key)\n }\n if (alg === 'md5') {\n return new Legacy(md5, key)\n }\n return new Hmac(alg, key)\n}\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar utils = require('./utils');\nvar Cipher = require('./cipher');\n\nfunction DESState() {\n this.tmp = new Array(2);\n this.keys = null;\n}\n\nfunction DES(options) {\n Cipher.call(this, options);\n\n var state = new DESState();\n this._desState = state;\n\n this.deriveKeys(state, options.key);\n}\ninherits(DES, Cipher);\nmodule.exports = DES;\n\nDES.create = function create(options) {\n return new DES(options);\n};\n\nvar shiftTable = [\n 1, 1, 2, 2, 2, 2, 2, 2,\n 1, 2, 2, 2, 2, 2, 2, 1\n];\n\nDES.prototype.deriveKeys = function deriveKeys(state, key) {\n state.keys = new Array(16 * 2);\n\n assert.equal(key.length, this.blockSize, 'Invalid key length');\n\n var kL = utils.readUInt32BE(key, 0);\n var kR = utils.readUInt32BE(key, 4);\n\n utils.pc1(kL, kR, state.tmp, 0);\n kL = state.tmp[0];\n kR = state.tmp[1];\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n kL = utils.r28shl(kL, shift);\n kR = utils.r28shl(kR, shift);\n utils.pc2(kL, kR, state.keys, i);\n }\n};\n\nDES.prototype._update = function _update(inp, inOff, out, outOff) {\n var state = this._desState;\n\n var l = utils.readUInt32BE(inp, inOff);\n var r = utils.readUInt32BE(inp, inOff + 4);\n\n // Initial Permutation\n utils.ip(l, r, state.tmp, 0);\n l = state.tmp[0];\n r = state.tmp[1];\n\n if (this.type === 'encrypt')\n this._encrypt(state, l, r, state.tmp, 0);\n else\n this._decrypt(state, l, r, state.tmp, 0);\n\n l = state.tmp[0];\n r = state.tmp[1];\n\n utils.writeUInt32BE(out, l, outOff);\n utils.writeUInt32BE(out, r, outOff + 4);\n};\n\nDES.prototype._pad = function _pad(buffer, off) {\n var value = buffer.length - off;\n for (var i = off; i < buffer.length; i++)\n buffer[i] = value;\n\n return true;\n};\n\nDES.prototype._unpad = function _unpad(buffer) {\n var pad = buffer[buffer.length - 1];\n for (var i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n\n return buffer.slice(0, buffer.length - pad);\n};\n\nDES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {\n var l = lStart;\n var r = rStart;\n\n // Apply f() x16 times\n for (var i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i];\n var keyR = state.keys[i + 1];\n\n // f(r, k)\n utils.expand(r, state.tmp, 0);\n\n keyL ^= state.tmp[0];\n keyR ^= state.tmp[1];\n var s = utils.substitute(keyL, keyR);\n var f = utils.permute(s);\n\n var t = r;\n r = (l ^ f) >>> 0;\n l = t;\n }\n\n // Reverse Initial Permutation\n utils.rip(r, l, out, off);\n};\n\nDES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {\n var l = rStart;\n var r = lStart;\n\n // Apply f() x16 times\n for (var i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i];\n var keyR = state.keys[i + 1];\n\n // f(r, k)\n utils.expand(l, state.tmp, 0);\n\n keyL ^= state.tmp[0];\n keyR ^= state.tmp[1];\n var s = utils.substitute(keyL, keyR);\n var f = utils.permute(s);\n\n var t = l;\n l = (r ^ f) >>> 0;\n r = t;\n }\n\n // Reverse Initial Permutation\n utils.rip(l, r, out, off);\n};\n","var ciphers = require('./encrypter')\nvar deciphers = require('./decrypter')\nvar modes = require('./modes/list.json')\n\nfunction getCiphers () {\n return Object.keys(modes)\n}\n\nexports.createCipher = exports.Cipher = ciphers.createCipher\nexports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv\nexports.createDecipher = exports.Decipher = deciphers.createDecipher\nexports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","function incr32 (iv) {\n var len = iv.length\n var item\n while (len--) {\n item = iv.readUInt8(len)\n if (item === 255) {\n iv.writeUInt8(0, len)\n } else {\n item++\n iv.writeUInt8(item, len)\n break\n }\n }\n}\nmodule.exports = incr32\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\nvar GHASH = require('./ghash')\nvar xor = require('buffer-xor')\nvar incr32 = require('./incr32')\n\nfunction xorTest (a, b) {\n var out = 0\n if (a.length !== b.length) out++\n\n var len = Math.min(a.length, b.length)\n for (var i = 0; i < len; ++i) {\n out += (a[i] ^ b[i])\n }\n\n return out\n}\n\nfunction calcIv (self, iv, ck) {\n if (iv.length === 12) {\n self._finID = Buffer.concat([iv, Buffer.from([0, 0, 0, 1])])\n return Buffer.concat([iv, Buffer.from([0, 0, 0, 2])])\n }\n var ghash = new GHASH(ck)\n var len = iv.length\n var toPad = len % 16\n ghash.update(iv)\n if (toPad) {\n toPad = 16 - toPad\n ghash.update(Buffer.alloc(toPad, 0))\n }\n ghash.update(Buffer.alloc(8, 0))\n var ivBits = len * 8\n var tail = Buffer.alloc(8)\n tail.writeUIntBE(ivBits, 0, 8)\n ghash.update(tail)\n self._finID = ghash.state\n var out = Buffer.from(self._finID)\n incr32(out)\n return out\n}\nfunction StreamCipher (mode, key, iv, decrypt) {\n Transform.call(this)\n\n var h = Buffer.alloc(4, 0)\n\n this._cipher = new aes.AES(key)\n var ck = this._cipher.encryptBlock(h)\n this._ghash = new GHASH(ck)\n iv = calcIv(this, iv, ck)\n\n this._prev = Buffer.from(iv)\n this._cache = Buffer.allocUnsafe(0)\n this._secCache = Buffer.allocUnsafe(0)\n this._decrypt = decrypt\n this._alen = 0\n this._len = 0\n this._mode = mode\n\n this._authTag = null\n this._called = false\n}\n\ninherits(StreamCipher, Transform)\n\nStreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16)\n if (rump < 16) {\n rump = Buffer.alloc(rump, 0)\n this._ghash.update(rump)\n }\n }\n\n this._called = true\n var out = this._mode.encrypt(this, chunk)\n if (this._decrypt) {\n this._ghash.update(chunk)\n } else {\n this._ghash.update(out)\n }\n this._len += chunk.length\n return out\n}\n\nStreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error('Unsupported state or unable to authenticate data')\n\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID))\n if (this._decrypt && xorTest(tag, this._authTag)) throw new Error('Unsupported state or unable to authenticate data')\n\n this._authTag = tag\n this._cipher.scrub()\n}\n\nStreamCipher.prototype.getAuthTag = function getAuthTag () {\n if (this._decrypt || !Buffer.isBuffer(this._authTag)) throw new Error('Attempting to get auth tag in unsupported state')\n\n return this._authTag\n}\n\nStreamCipher.prototype.setAuthTag = function setAuthTag (tag) {\n if (!this._decrypt) throw new Error('Attempting to set auth tag in unsupported state')\n\n this._authTag = tag\n}\n\nStreamCipher.prototype.setAAD = function setAAD (buf) {\n if (this._called) throw new Error('Attempting to set AAD in unsupported state')\n\n this._ghash.update(buf)\n this._alen += buf.length\n}\n\nmodule.exports = StreamCipher\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\n\nfunction StreamCipher (mode, key, iv, decrypt) {\n Transform.call(this)\n\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._cache = Buffer.allocUnsafe(0)\n this._secCache = Buffer.allocUnsafe(0)\n this._decrypt = decrypt\n this._mode = mode\n}\n\ninherits(StreamCipher, Transform)\n\nStreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt)\n}\n\nStreamCipher.prototype._final = function () {\n this._cipher.scrub()\n}\n\nmodule.exports = StreamCipher\n","var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar ONE = new BN(1);\nvar TWO = new BN(2);\nvar FIVE = new BN(5);\nvar SIXTEEN = new BN(16);\nvar EIGHT = new BN(8);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar ELEVEN = new BN(11);\nvar FOUR = new BN(4);\nvar TWELVE = new BN(12);\nvar primes = null;\n\nfunction _getPrimes() {\n if (primes !== null)\n return primes;\n\n var limit = 0x100000;\n var res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n var sqrt = Math.ceil(Math.sqrt(k));\n for (var j = 0; j < i && res[j] <= sqrt; j++)\n if (k % res[j] === 0)\n break;\n\n if (i !== j && res[j] <= sqrt)\n continue;\n\n res[i++] = k;\n }\n primes = res;\n return res;\n}\n\nfunction simpleSieve(p) {\n var primes = _getPrimes();\n\n for (var i = 0; i < primes.length; i++)\n if (p.modn(primes[i]) === 0) {\n if (p.cmpn(primes[i]) === 0) {\n return true;\n } else {\n return false;\n }\n }\n\n return true;\n}\n\nfunction fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n}\n\nfunction findPrime(bits, gen) {\n if (bits < 16) {\n // this is what openssl does\n if (gen === 2 || gen === 5) {\n return new BN([0x8c, 0x7b]);\n } else {\n return new BN([0x8c, 0x27]);\n }\n }\n gen = new BN(gen);\n\n var num, n2;\n\n while (true) {\n num = new BN(randomBytes(Math.ceil(bits / 8)));\n while (num.bitLength() > bits) {\n num.ishrn(1);\n }\n if (num.isEven()) {\n num.iadd(ONE);\n }\n if (!num.testn(1)) {\n num.iadd(TWO);\n }\n if (!gen.cmp(TWO)) {\n while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {\n num.iadd(FOUR);\n }\n } else if (!gen.cmp(FIVE)) {\n while (num.mod(TEN).cmp(THREE)) {\n num.iadd(FOUR);\n }\n }\n n2 = num.shrn(1);\n if (simpleSieve(n2) && simpleSieve(num) &&\n fermatTest(n2) && fermatTest(num) &&\n millerRabin.test(n2) && millerRabin.test(num)) {\n return num;\n }\n }\n\n}\n","var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n}\nmodule.exports = MillerRabin;\n\nMillerRabin.create = function create(rand) {\n return new MillerRabin(rand);\n};\n\nMillerRabin.prototype._randbelow = function _randbelow(n) {\n var len = n.bitLength();\n var min_bytes = Math.ceil(len / 8);\n\n // Generage random bytes until a number less than n is found.\n // This ensures that 0..n-1 have an equal probability of being selected.\n do\n var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n\n return a;\n};\n\nMillerRabin.prototype._randrange = function _randrange(start, stop) {\n // Generate a random number greater than or equal to start and less than stop.\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n};\n\nMillerRabin.prototype.test = function test(n, k, cb) {\n var len = n.bitLength();\n var red = bn.mont(n);\n var rone = new bn(1).toRed(red);\n\n if (!k)\n k = Math.max(1, (len / 48) | 0);\n\n // Find d and s, (n - 1) = (2 ^ s) * d;\n var n1 = n.subn(1);\n for (var s = 0; !n1.testn(s); s++) {}\n var d = n.shrn(s);\n\n var rn1 = n1.toRed(red);\n\n var prime = true;\n for (; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n if (cb)\n cb(a);\n\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n\n if (x.cmp(rone) === 0)\n return false;\n if (x.cmp(rn1) === 0)\n break;\n }\n\n if (i === s)\n return false;\n }\n\n return prime;\n};\n\nMillerRabin.prototype.getDivisor = function getDivisor(n, k) {\n var len = n.bitLength();\n var red = bn.mont(n);\n var rone = new bn(1).toRed(red);\n\n if (!k)\n k = Math.max(1, (len / 48) | 0);\n\n // Find d and s, (n - 1) = (2 ^ s) * d;\n var n1 = n.subn(1);\n for (var s = 0; !n1.testn(s); s++) {}\n var d = n.shrn(s);\n\n var rn1 = n1.toRed(red);\n\n for (; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n\n var g = n.gcd(a);\n if (g.cmpn(1) !== 0)\n return g;\n\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n\n if (x.cmp(rone) === 0)\n return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0)\n break;\n }\n\n if (i === s) {\n x = x.redSqr();\n return x.fromRed().subn(1).gcd(n);\n }\n }\n\n return false;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nmodule.exports = Readable;\n\n/**/\nvar Duplex;\n/**/\n\nReadable.ReadableState = ReadableState;\n\n/**/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/**/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/**/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* */\n\n/**/\nvar Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n\n/**/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\n}","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity;\n\n // Construct base tree\n this.tree = new DERNode();\n this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n primitive,\n cls,\n content) {\n const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n // Short form\n if (content.length < 0x80) {\n const header = Buffer.alloc(2);\n header[0] = encodedTag;\n header[1] = content.length;\n return this._createEncoderBuffer([ header, content ]);\n }\n\n // Long form\n // Count octets required to store length\n let lenOctets = 1;\n for (let i = content.length; i >= 0x100; i >>= 8)\n lenOctets++;\n\n const header = Buffer.alloc(1 + 1 + lenOctets);\n header[0] = encodedTag;\n header[1] = 0x80 | lenOctets;\n\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n header[i] = j & 0xff;\n\n return this._createEncoderBuffer([ header, content ]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n if (tag === 'bitstr') {\n return this._createEncoderBuffer([ str.unused | 0, str.data ]);\n } else if (tag === 'bmpstr') {\n const buf = Buffer.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) {\n buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n }\n return this._createEncoderBuffer(buf);\n } else if (tag === 'numstr') {\n if (!this._isNumstr(str)) {\n return this.reporter.error('Encoding of string type: numstr supports ' +\n 'only digits and space');\n }\n return this._createEncoderBuffer(str);\n } else if (tag === 'printstr') {\n if (!this._isPrintstr(str)) {\n return this.reporter.error('Encoding of string type: printstr supports ' +\n 'only latin upper and lower case letters, ' +\n 'digits, space, apostrophe, left and rigth ' +\n 'parenthesis, plus sign, comma, hyphen, ' +\n 'dot, slash, colon, equal sign, ' +\n 'question mark');\n }\n return this._createEncoderBuffer(str);\n } else if (/str$/.test(tag)) {\n return this._createEncoderBuffer(str);\n } else if (tag === 'objDesc') {\n return this._createEncoderBuffer(str);\n } else {\n return this.reporter.error('Encoding of string type: ' + tag +\n ' unsupported');\n }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n if (typeof id === 'string') {\n if (!values)\n return this.reporter.error('string objid given, but no values map found');\n if (!values.hasOwnProperty(id))\n return this.reporter.error('objid not found in values map');\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++)\n id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++)\n id[i] |= 0;\n }\n\n if (!Array.isArray(id)) {\n return this.reporter.error('objid() should be either array or string, ' +\n 'got: ' + JSON.stringify(id));\n }\n\n if (!relative) {\n if (id[1] >= 40)\n return this.reporter.error('Second objid identifier OOB');\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n\n // Count number of octets\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 0x80; ident >>= 7)\n size++;\n }\n\n const objid = Buffer.alloc(size);\n let offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n objid[offset--] = ident & 0x7f;\n while ((ident >>= 7) > 0)\n objid[offset--] = 0x80 | (ident & 0x7f);\n }\n\n return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n if (num < 10)\n return '0' + num;\n else\n return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n let str;\n const date = new Date(time);\n\n if (tag === 'gentime') {\n str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n 'Z'\n ].join('');\n } else if (tag === 'utctime') {\n str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n 'Z'\n ].join('');\n } else {\n this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n }\n\n return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n if (typeof num === 'string') {\n if (!values)\n return this.reporter.error('String int or enum given, but no values map');\n if (!values.hasOwnProperty(num)) {\n return this.reporter.error('Values map doesn\\'t contain: ' +\n JSON.stringify(num));\n }\n num = values[num];\n }\n\n // Bignum, assume big endian\n if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n const numArray = num.toArray();\n if (!num.sign && numArray[0] & 0x80) {\n numArray.unshift(0);\n }\n num = Buffer.from(numArray);\n }\n\n if (Buffer.isBuffer(num)) {\n let size = num.length;\n if (num.length === 0)\n size++;\n\n const out = Buffer.alloc(size);\n num.copy(out);\n if (num.length === 0)\n out[0] = 0;\n return this._createEncoderBuffer(out);\n }\n\n if (num < 0x80)\n return this._createEncoderBuffer(num);\n\n if (num < 0x100)\n return this._createEncoderBuffer([0, num]);\n\n let size = 1;\n for (let i = num; i >= 0x100; i >>= 8)\n size++;\n\n const out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) {\n out[i] = num & 0xff;\n num >>= 8;\n }\n if(out[0] & 0x80) {\n out.unshift(0);\n }\n\n return this._createEncoderBuffer(Buffer.from(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n if (typeof entity === 'function')\n entity = entity(obj);\n return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n const state = this._baseState;\n let i;\n if (state['default'] === null)\n return false;\n\n const data = dataBuffer.join();\n if (state.defaultBuffer === undefined)\n state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n if (data.length !== state.defaultBuffer.length)\n return false;\n\n for (i=0; i < data.length; i++)\n if (data[i] !== state.defaultBuffer[i])\n return false;\n\n return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n let res;\n\n if (tag === 'seqof')\n tag = 'seq';\n else if (tag === 'setof')\n tag = 'set';\n\n if (der.tagByName.hasOwnProperty(tag))\n res = der.tagByName[tag];\n else if (typeof tag === 'number' && (tag | 0) === tag)\n res = tag;\n else\n return reporter.error('Unknown tag: ' + tag);\n\n if (res >= 0x1f)\n return reporter.error('Multi-octet tag encoding unsupported');\n\n if (!primitive)\n res |= 0x20;\n\n res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n return res;\n}\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: []\n };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n const state = this._reporterState;\n\n return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n const state = this._reporterState;\n\n state.obj = data.obj;\n state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n const state = this._reporterState;\n\n state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n const state = this._reporterState;\n\n this.exitKey(index);\n if (state.obj !== null)\n state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n const state = this._reporterState;\n\n const prev = state.obj;\n state.obj = {};\n return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n const state = this._reporterState;\n\n const now = state.obj;\n state.obj = prev;\n return now;\n};\n\nReporter.prototype.error = function error(msg) {\n let err;\n const state = this._reporterState;\n\n const inherited = msg instanceof ReporterError;\n if (inherited) {\n err = msg;\n } else {\n err = new ReporterError(state.path.map(function(elem) {\n return '[' + JSON.stringify(elem) + ']';\n }).join(''), msg.message || msg, msg.stack);\n }\n\n if (!state.options.partial)\n throw err;\n\n if (!inherited)\n state.errors.push(err);\n\n return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n const state = this._reporterState;\n if (!state.options.partial)\n return result;\n\n return {\n result: this.isError(result) ? null : result,\n errors: state.errors\n };\n};\n\nfunction ReporterError(path, msg) {\n this.path = path;\n this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n this.message = msg + ' at: ' + (this.path || '(shallow)');\n if (Error.captureStackTrace)\n Error.captureStackTrace(this, ReporterError);\n\n if (!this.stack) {\n try {\n // IE only adds stack when thrown\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n }\n return this;\n};\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity;\n\n // Construct base tree\n this.tree = new DERNode();\n this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n if (!DecoderBuffer.isDecoderBuffer(data)) {\n data = new DecoderBuffer(data, options);\n }\n\n return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n if (buffer.isEmpty())\n return false;\n\n const state = buffer.save();\n const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n if (buffer.isError(decodedTag))\n return decodedTag;\n\n buffer.restore(state);\n\n return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n const decodedTag = derDecodeTag(buffer,\n 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag))\n return decodedTag;\n\n let len = derDecodeLen(buffer,\n decodedTag.primitive,\n 'Failed to get length of \"' + tag + '\"');\n\n // Failure\n if (buffer.isError(len))\n return len;\n\n if (!any &&\n decodedTag.tag !== tag &&\n decodedTag.tagStr !== tag &&\n decodedTag.tagStr + 'of' !== tag) {\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n }\n\n if (decodedTag.primitive || len !== null)\n return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n // Indefinite length... find END tag\n const state = buffer.save();\n const res = this._skipUntilEnd(\n buffer,\n 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n if (buffer.isError(res))\n return res;\n\n len = buffer.offset - state.offset;\n buffer.restore(state);\n return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n for (;;) {\n const tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag))\n return tag;\n const len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len))\n return len;\n\n let res;\n if (tag.primitive || len !== null)\n res = buffer.skip(len);\n else\n res = this._skipUntilEnd(buffer, fail);\n\n // Failure\n if (buffer.isError(res))\n return res;\n\n if (tag.tagStr === 'end')\n break;\n }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n options) {\n const result = [];\n while (!buffer.isEmpty()) {\n const possibleEnd = this._peekTag(buffer, 'end');\n if (buffer.isError(possibleEnd))\n return possibleEnd;\n\n const res = decoder.decode(buffer, 'der', options);\n if (buffer.isError(res) && possibleEnd)\n break;\n result.push(res);\n }\n return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n if (tag === 'bitstr') {\n const unused = buffer.readUInt8();\n if (buffer.isError(unused))\n return unused;\n return { unused: unused, data: buffer.raw() };\n } else if (tag === 'bmpstr') {\n const raw = buffer.raw();\n if (raw.length % 2 === 1)\n return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n let str = '';\n for (let i = 0; i < raw.length / 2; i++) {\n str += String.fromCharCode(raw.readUInt16BE(i * 2));\n }\n return str;\n } else if (tag === 'numstr') {\n const numstr = buffer.raw().toString('ascii');\n if (!this._isNumstr(numstr)) {\n return buffer.error('Decoding of string type: ' +\n 'numstr unsupported characters');\n }\n return numstr;\n } else if (tag === 'octstr') {\n return buffer.raw();\n } else if (tag === 'objDesc') {\n return buffer.raw();\n } else if (tag === 'printstr') {\n const printstr = buffer.raw().toString('ascii');\n if (!this._isPrintstr(printstr)) {\n return buffer.error('Decoding of string type: ' +\n 'printstr unsupported characters');\n }\n return printstr;\n } else if (/str$/.test(tag)) {\n return buffer.raw().toString();\n } else {\n return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n let result;\n const identifiers = [];\n let ident = 0;\n let subident = 0;\n while (!buffer.isEmpty()) {\n subident = buffer.readUInt8();\n ident <<= 7;\n ident |= subident & 0x7f;\n if ((subident & 0x80) === 0) {\n identifiers.push(ident);\n ident = 0;\n }\n }\n if (subident & 0x80)\n identifiers.push(ident);\n\n const first = (identifiers[0] / 40) | 0;\n const second = identifiers[0] % 40;\n\n if (relative)\n result = identifiers;\n else\n result = [first, second].concat(identifiers.slice(1));\n\n if (values) {\n let tmp = values[result.join(' ')];\n if (tmp === undefined)\n tmp = values[result.join('.')];\n if (tmp !== undefined)\n result = tmp;\n }\n\n return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n const str = buffer.raw().toString();\n\n let year;\n let mon;\n let day;\n let hour;\n let min;\n let sec;\n if (tag === 'gentime') {\n year = str.slice(0, 4) | 0;\n mon = str.slice(4, 6) | 0;\n day = str.slice(6, 8) | 0;\n hour = str.slice(8, 10) | 0;\n min = str.slice(10, 12) | 0;\n sec = str.slice(12, 14) | 0;\n } else if (tag === 'utctime') {\n year = str.slice(0, 2) | 0;\n mon = str.slice(2, 4) | 0;\n day = str.slice(4, 6) | 0;\n hour = str.slice(6, 8) | 0;\n min = str.slice(8, 10) | 0;\n sec = str.slice(10, 12) | 0;\n if (year < 70)\n year = 2000 + year;\n else\n year = 1900 + year;\n } else {\n return buffer.error('Decoding ' + tag + ' time is not supported yet');\n }\n\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull() {\n return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n const res = buffer.readUInt8();\n if (buffer.isError(res))\n return res;\n else\n return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n // Bigint, return as it is (assume big endian)\n const raw = buffer.raw();\n let res = new bignum(raw);\n\n if (values)\n res = values[res.toString(10)] || res;\n\n return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n if (typeof entity === 'function')\n entity = entity(obj);\n return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag))\n return tag;\n\n const cls = der.tagClass[tag >> 6];\n const primitive = (tag & 0x20) === 0;\n\n // Multi-octet tag - load\n if ((tag & 0x1f) === 0x1f) {\n let oct = tag;\n tag = 0;\n while ((oct & 0x80) === 0x80) {\n oct = buf.readUInt8(fail);\n if (buf.isError(oct))\n return oct;\n\n tag <<= 7;\n tag |= oct & 0x7f;\n }\n } else {\n tag &= 0x1f;\n }\n const tagStr = der.tag[tag];\n\n return {\n cls: cls,\n primitive: primitive,\n tag: tag,\n tagStr: tagStr\n };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len))\n return len;\n\n // Indefinite form\n if (!primitive && len === 0x80)\n return null;\n\n // Definite form\n if ((len & 0x80) === 0) {\n // Short form\n return len;\n }\n\n // Long form\n const num = len & 0x7f;\n if (num > 4)\n return buf.error('length octect is too long');\n\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n const j = buf.readUInt8(fail);\n if (buf.isError(j))\n return j;\n len |= j;\n }\n\n return len;\n}\n","var createHash = require('create-hash')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (seed, len) {\n var t = Buffer.alloc(0)\n var i = 0\n var c\n while (t.length < len) {\n c = i2ops(i++)\n t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()])\n }\n return t.slice(0, len)\n}\n\nfunction i2ops (c) {\n var out = Buffer.allocUnsafe(4)\n out.writeUInt32BE(c, 0)\n return out\n}\n","module.exports = function xor (a, b) {\n var len = a.length\n var i = -1\n while (++i < len) {\n a[i] ^= b[i]\n }\n return a\n}\n","var BN = require('bn.js')\nvar Buffer = require('safe-buffer').Buffer\n\nfunction withPublic (paddedMsg, key) {\n return Buffer.from(paddedMsg\n .toRed(BN.mont(key.modulus))\n .redPow(new BN(key.publicExponent))\n .fromRed()\n .toArray())\n}\n\nmodule.exports = withPublic\n","const crypto = require('crypto')\nconst MAX_VALUE = 0x7fffffff\nconst DEFAULT_PROMISE_INTERVAL = 5000\n/* eslint-disable camelcase */\n\nfunction checkAndInit (key, salt, N, r, p, dkLen, progressCallback) {\n if (N === 0 || (N & (N - 1)) !== 0) throw Error('N must be > 0 and a power of 2')\n\n if (N > MAX_VALUE / 128 / r) throw Error('Parameter N is too large')\n if (r > MAX_VALUE / 128 / p) throw Error('Parameter r is too large')\n\n let XY = Buffer.alloc(256 * r)\n let V = Buffer.alloc(128 * r * N)\n\n // pseudo global\n let B32 = new Int32Array(16) // salsa20_8\n let x = new Int32Array(16) // salsa20_8\n let _X = Buffer.alloc(64) // blockmix_salsa8\n\n // pseudo global\n let B = crypto.pbkdf2Sync(key, salt, 1, p * 128 * r, 'sha256')\n\n let tickCallback\n if (progressCallback) {\n let totalOps = p * N * 2\n let currentOp = 0\n\n tickCallback = function () {\n ++currentOp\n\n // send progress notifications once every 1,000 ops\n if (currentOp % 1000 === 0) {\n progressCallback({\n current: currentOp,\n total: totalOps,\n percent: (currentOp / totalOps) * 100.0\n })\n }\n }\n }\n return {\n XY,\n V,\n B32,\n x,\n _X,\n B,\n tickCallback\n }\n}\n\nasync function smix (B, Bi, r, N, V, XY, _X, B32, x, tickCallback, promiseInterval) {\n promiseInterval = promiseInterval || DEFAULT_PROMISE_INTERVAL\n let Xi = 0\n let Yi = 128 * r\n let i\n\n B.copy(XY, Xi, Bi, Bi + Yi)\n\n for (i = 0; i < N; i++) {\n XY.copy(V, i * Yi, Xi, Xi + Yi)\n if (i % promiseInterval === 0) {\n await new Promise(resolve => setImmediate(resolve))\n }\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n for (i = 0; i < N; i++) {\n let offset = Xi + (2 * r - 1) * 64\n let j = XY.readUInt32LE(offset) & (N - 1)\n blockxor(V, j * Yi, XY, Xi, Yi)\n if (i % promiseInterval === 0) {\n await new Promise(resolve => setImmediate(resolve))\n }\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n XY.copy(B, Bi, Xi, Xi + Yi)\n}\n\nfunction smixSync (B, Bi, r, N, V, XY, _X, B32, x, tickCallback) {\n let Xi = 0\n let Yi = 128 * r\n let i\n\n B.copy(XY, Xi, Bi, Bi + Yi)\n\n for (i = 0; i < N; i++) {\n XY.copy(V, i * Yi, Xi, Xi + Yi)\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n for (i = 0; i < N; i++) {\n let offset = Xi + (2 * r - 1) * 64\n let j = XY.readUInt32LE(offset) & (N - 1)\n blockxor(V, j * Yi, XY, Xi, Yi)\n blockmix_salsa8(XY, Xi, Yi, r, _X, B32, x)\n\n if (tickCallback) tickCallback()\n }\n\n XY.copy(B, Bi, Xi, Xi + Yi)\n}\n\nfunction blockmix_salsa8 (BY, Bi, Yi, r, _X, B32, x) {\n let i\n\n arraycopy(BY, Bi + (2 * r - 1) * 64, _X, 0, 64)\n\n for (i = 0; i < 2 * r; i++) {\n blockxor(BY, i * 64, _X, 0, 64)\n salsa20_8(_X, B32, x)\n arraycopy(_X, 0, BY, Yi + (i * 64), 64)\n }\n\n for (i = 0; i < r; i++) {\n arraycopy(BY, Yi + (i * 2) * 64, BY, Bi + (i * 64), 64)\n }\n\n for (i = 0; i < r; i++) {\n arraycopy(BY, Yi + (i * 2 + 1) * 64, BY, Bi + (i + r) * 64, 64)\n }\n}\n\nfunction R (a, b) {\n return (a << b) | (a >>> (32 - b))\n}\n\nfunction salsa20_8 (B, B32, x) {\n let i\n\n for (i = 0; i < 16; i++) {\n B32[i] = (B[i * 4 + 0] & 0xff) << 0\n B32[i] |= (B[i * 4 + 1] & 0xff) << 8\n B32[i] |= (B[i * 4 + 2] & 0xff) << 16\n B32[i] |= (B[i * 4 + 3] & 0xff) << 24\n // B32[i] = B.readUInt32LE(i*4) <--- this is signficantly slower even in Node.js\n }\n\n arraycopy(B32, 0, x, 0, 16)\n\n for (i = 8; i > 0; i -= 2) {\n x[4] ^= R(x[0] + x[12], 7)\n x[8] ^= R(x[4] + x[0], 9)\n x[12] ^= R(x[8] + x[4], 13)\n x[0] ^= R(x[12] + x[8], 18)\n x[9] ^= R(x[5] + x[1], 7)\n x[13] ^= R(x[9] + x[5], 9)\n x[1] ^= R(x[13] + x[9], 13)\n x[5] ^= R(x[1] + x[13], 18)\n x[14] ^= R(x[10] + x[6], 7)\n x[2] ^= R(x[14] + x[10], 9)\n x[6] ^= R(x[2] + x[14], 13)\n x[10] ^= R(x[6] + x[2], 18)\n x[3] ^= R(x[15] + x[11], 7)\n x[7] ^= R(x[3] + x[15], 9)\n x[11] ^= R(x[7] + x[3], 13)\n x[15] ^= R(x[11] + x[7], 18)\n x[1] ^= R(x[0] + x[3], 7)\n x[2] ^= R(x[1] + x[0], 9)\n x[3] ^= R(x[2] + x[1], 13)\n x[0] ^= R(x[3] + x[2], 18)\n x[6] ^= R(x[5] + x[4], 7)\n x[7] ^= R(x[6] + x[5], 9)\n x[4] ^= R(x[7] + x[6], 13)\n x[5] ^= R(x[4] + x[7], 18)\n x[11] ^= R(x[10] + x[9], 7)\n x[8] ^= R(x[11] + x[10], 9)\n x[9] ^= R(x[8] + x[11], 13)\n x[10] ^= R(x[9] + x[8], 18)\n x[12] ^= R(x[15] + x[14], 7)\n x[13] ^= R(x[12] + x[15], 9)\n x[14] ^= R(x[13] + x[12], 13)\n x[15] ^= R(x[14] + x[13], 18)\n }\n\n for (i = 0; i < 16; ++i) B32[i] = x[i] + B32[i]\n\n for (i = 0; i < 16; i++) {\n let bi = i * 4\n B[bi + 0] = (B32[i] >> 0 & 0xff)\n B[bi + 1] = (B32[i] >> 8 & 0xff)\n B[bi + 2] = (B32[i] >> 16 & 0xff)\n B[bi + 3] = (B32[i] >> 24 & 0xff)\n // B.writeInt32LE(B32[i], i*4) //<--- this is signficantly slower even in Node.js\n }\n}\n\n// naive approach... going back to loop unrolling may yield additional performance\nfunction blockxor (S, Si, D, Di, len) {\n for (let i = 0; i < len; i++) {\n D[Di + i] ^= S[Si + i]\n }\n}\n\nfunction arraycopy (src, srcPos, dest, destPos, length) {\n if (Buffer.isBuffer(src) && Buffer.isBuffer(dest)) {\n src.copy(dest, destPos, srcPos, srcPos + length)\n } else {\n while (length--) {\n dest[destPos++] = src[srcPos++]\n }\n }\n}\n\nmodule.exports = {\n checkAndInit,\n smix,\n smixSync\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nmodule.exports = Readable;\n\n/**/\nvar Duplex;\n/**/\n\nReadable.ReadableState = ReadableState;\n\n/**/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/**/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/**/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* */\n\n/**/\nvar Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n\n/**/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\nvar Stream = require('./internal/streams/stream');\n/**/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\n}","\"use strict\";\nvar $protobuf = require(\"../..\");\nmodule.exports = exports = $protobuf.descriptor = $protobuf.Root.fromJSON(require(\"../../google/protobuf/descriptor.json\")).lookup(\".google.protobuf\");\n\nvar Namespace = $protobuf.Namespace,\n Root = $protobuf.Root,\n Enum = $protobuf.Enum,\n Type = $protobuf.Type,\n Field = $protobuf.Field,\n MapField = $protobuf.MapField,\n OneOf = $protobuf.OneOf,\n Service = $protobuf.Service,\n Method = $protobuf.Method;\n\n// --- Root ---\n\n/**\n * Properties of a FileDescriptorSet message.\n * @interface IFileDescriptorSet\n * @property {IFileDescriptorProto[]} file Files\n */\n\n/**\n * Properties of a FileDescriptorProto message.\n * @interface IFileDescriptorProto\n * @property {string} [name] File name\n * @property {string} [package] Package\n * @property {*} [dependency] Not supported\n * @property {*} [publicDependency] Not supported\n * @property {*} [weakDependency] Not supported\n * @property {IDescriptorProto[]} [messageType] Nested message types\n * @property {IEnumDescriptorProto[]} [enumType] Nested enums\n * @property {IServiceDescriptorProto[]} [service] Nested services\n * @property {IFieldDescriptorProto[]} [extension] Nested extension fields\n * @property {IFileOptions} [options] Options\n * @property {*} [sourceCodeInfo] Not supported\n * @property {string} [syntax=\"proto2\"] Syntax\n */\n\n/**\n * Properties of a FileOptions message.\n * @interface IFileOptions\n * @property {string} [javaPackage]\n * @property {string} [javaOuterClassname]\n * @property {boolean} [javaMultipleFiles]\n * @property {boolean} [javaGenerateEqualsAndHash]\n * @property {boolean} [javaStringCheckUtf8]\n * @property {IFileOptionsOptimizeMode} [optimizeFor=1]\n * @property {string} [goPackage]\n * @property {boolean} [ccGenericServices]\n * @property {boolean} [javaGenericServices]\n * @property {boolean} [pyGenericServices]\n * @property {boolean} [deprecated]\n * @property {boolean} [ccEnableArenas]\n * @property {string} [objcClassPrefix]\n * @property {string} [csharpNamespace]\n */\n\n/**\n * Values of he FileOptions.OptimizeMode enum.\n * @typedef IFileOptionsOptimizeMode\n * @type {number}\n * @property {number} SPEED=1\n * @property {number} CODE_SIZE=2\n * @property {number} LITE_RUNTIME=3\n */\n\n/**\n * Creates a root from a descriptor set.\n * @param {IFileDescriptorSet|Reader|Uint8Array} descriptor Descriptor\n * @returns {Root} Root instance\n */\nRoot.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.FileDescriptorSet.decode(descriptor);\n\n var root = new Root();\n\n if (descriptor.file) {\n var fileDescriptor,\n filePackage;\n for (var j = 0, i; j < descriptor.file.length; ++j) {\n filePackage = root;\n if ((fileDescriptor = descriptor.file[j])[\"package\"] && fileDescriptor[\"package\"].length)\n filePackage = root.define(fileDescriptor[\"package\"]);\n if (fileDescriptor.name && fileDescriptor.name.length)\n root.files.push(filePackage.filename = fileDescriptor.name);\n if (fileDescriptor.messageType)\n for (i = 0; i < fileDescriptor.messageType.length; ++i)\n filePackage.add(Type.fromDescriptor(fileDescriptor.messageType[i], fileDescriptor.syntax));\n if (fileDescriptor.enumType)\n for (i = 0; i < fileDescriptor.enumType.length; ++i)\n filePackage.add(Enum.fromDescriptor(fileDescriptor.enumType[i]));\n if (fileDescriptor.extension)\n for (i = 0; i < fileDescriptor.extension.length; ++i)\n filePackage.add(Field.fromDescriptor(fileDescriptor.extension[i]));\n if (fileDescriptor.service)\n for (i = 0; i < fileDescriptor.service.length; ++i)\n filePackage.add(Service.fromDescriptor(fileDescriptor.service[i]));\n var opts = fromDescriptorOptions(fileDescriptor.options, exports.FileOptions);\n if (opts) {\n var ks = Object.keys(opts);\n for (i = 0; i < ks.length; ++i)\n filePackage.setOption(ks[i], opts[ks[i]]);\n }\n }\n }\n\n return root;\n};\n\n/**\n * Converts a root to a descriptor set.\n * @returns {Message} Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n */\nRoot.prototype.toDescriptor = function toDescriptor(syntax) {\n var set = exports.FileDescriptorSet.create();\n Root_toDescriptorRecursive(this, set.file, syntax);\n return set;\n};\n\n// Traverses a namespace and assembles the descriptor set\nfunction Root_toDescriptorRecursive(ns, files, syntax) {\n\n // Create a new file\n var file = exports.FileDescriptorProto.create({ name: ns.filename || (ns.fullName.substring(1).replace(/\\./g, \"_\") || \"root\") + \".proto\" });\n if (syntax)\n file.syntax = syntax;\n if (!(ns instanceof Root))\n file[\"package\"] = ns.fullName.substring(1);\n\n // Add nested types\n for (var i = 0, nested; i < ns.nestedArray.length; ++i)\n if ((nested = ns._nestedArray[i]) instanceof Type)\n file.messageType.push(nested.toDescriptor(syntax));\n else if (nested instanceof Enum)\n file.enumType.push(nested.toDescriptor());\n else if (nested instanceof Field)\n file.extension.push(nested.toDescriptor(syntax));\n else if (nested instanceof Service)\n file.service.push(nested.toDescriptor());\n else if (nested instanceof /* plain */ Namespace)\n Root_toDescriptorRecursive(nested, files, syntax); // requires new file\n\n // Keep package-level options\n file.options = toDescriptorOptions(ns.options, exports.FileOptions);\n\n // And keep the file only if there is at least one nested object\n if (file.messageType.length + file.enumType.length + file.extension.length + file.service.length)\n files.push(file);\n}\n\n// --- Type ---\n\n/**\n * Properties of a DescriptorProto message.\n * @interface IDescriptorProto\n * @property {string} [name] Message type name\n * @property {IFieldDescriptorProto[]} [field] Fields\n * @property {IFieldDescriptorProto[]} [extension] Extension fields\n * @property {IDescriptorProto[]} [nestedType] Nested message types\n * @property {IEnumDescriptorProto[]} [enumType] Nested enums\n * @property {IDescriptorProtoExtensionRange[]} [extensionRange] Extension ranges\n * @property {IOneofDescriptorProto[]} [oneofDecl] Oneofs\n * @property {IMessageOptions} [options] Not supported\n * @property {IDescriptorProtoReservedRange[]} [reservedRange] Reserved ranges\n * @property {string[]} [reservedName] Reserved names\n */\n\n/**\n * Properties of a MessageOptions message.\n * @interface IMessageOptions\n * @property {boolean} [mapEntry=false] Whether this message is a map entry\n */\n\n/**\n * Properties of an ExtensionRange message.\n * @interface IDescriptorProtoExtensionRange\n * @property {number} [start] Start field id\n * @property {number} [end] End field id\n */\n\n/**\n * Properties of a ReservedRange message.\n * @interface IDescriptorProtoReservedRange\n * @property {number} [start] Start field id\n * @property {number} [end] End field id\n */\n\nvar unnamedMessageIndex = 0;\n\n/**\n * Creates a type from a descriptor.\n * @param {IDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n * @returns {Type} Type instance\n */\nType.fromDescriptor = function fromDescriptor(descriptor, syntax) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.DescriptorProto.decode(descriptor);\n\n // Create the message type\n var type = new Type(descriptor.name.length ? descriptor.name : \"Type\" + unnamedMessageIndex++, fromDescriptorOptions(descriptor.options, exports.MessageOptions)),\n i;\n\n /* Oneofs */ if (descriptor.oneofDecl)\n for (i = 0; i < descriptor.oneofDecl.length; ++i)\n type.add(OneOf.fromDescriptor(descriptor.oneofDecl[i]));\n /* Fields */ if (descriptor.field)\n for (i = 0; i < descriptor.field.length; ++i) {\n var field = Field.fromDescriptor(descriptor.field[i], syntax);\n type.add(field);\n if (descriptor.field[i].hasOwnProperty(\"oneofIndex\")) // eslint-disable-line no-prototype-builtins\n type.oneofsArray[descriptor.field[i].oneofIndex].add(field);\n }\n /* Extension fields */ if (descriptor.extension)\n for (i = 0; i < descriptor.extension.length; ++i)\n type.add(Field.fromDescriptor(descriptor.extension[i], syntax));\n /* Nested types */ if (descriptor.nestedType)\n for (i = 0; i < descriptor.nestedType.length; ++i) {\n type.add(Type.fromDescriptor(descriptor.nestedType[i], syntax));\n if (descriptor.nestedType[i].options && descriptor.nestedType[i].options.mapEntry)\n type.setOption(\"map_entry\", true);\n }\n /* Nested enums */ if (descriptor.enumType)\n for (i = 0; i < descriptor.enumType.length; ++i)\n type.add(Enum.fromDescriptor(descriptor.enumType[i]));\n /* Extension ranges */ if (descriptor.extensionRange && descriptor.extensionRange.length) {\n type.extensions = [];\n for (i = 0; i < descriptor.extensionRange.length; ++i)\n type.extensions.push([ descriptor.extensionRange[i].start, descriptor.extensionRange[i].end ]);\n }\n /* Reserved... */ if (descriptor.reservedRange && descriptor.reservedRange.length || descriptor.reservedName && descriptor.reservedName.length) {\n type.reserved = [];\n /* Ranges */ if (descriptor.reservedRange)\n for (i = 0; i < descriptor.reservedRange.length; ++i)\n type.reserved.push([ descriptor.reservedRange[i].start, descriptor.reservedRange[i].end ]);\n /* Names */ if (descriptor.reservedName)\n for (i = 0; i < descriptor.reservedName.length; ++i)\n type.reserved.push(descriptor.reservedName[i]);\n }\n\n return type;\n};\n\n/**\n * Converts a type to a descriptor.\n * @returns {Message} Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n */\nType.prototype.toDescriptor = function toDescriptor(syntax) {\n var descriptor = exports.DescriptorProto.create({ name: this.name }),\n i;\n\n /* Fields */ for (i = 0; i < this.fieldsArray.length; ++i) {\n var fieldDescriptor;\n descriptor.field.push(fieldDescriptor = this._fieldsArray[i].toDescriptor(syntax));\n if (this._fieldsArray[i] instanceof MapField) { // map fields are repeated FieldNameEntry\n var keyType = toDescriptorType(this._fieldsArray[i].keyType, this._fieldsArray[i].resolvedKeyType),\n valueType = toDescriptorType(this._fieldsArray[i].type, this._fieldsArray[i].resolvedType),\n valueTypeName = valueType === /* type */ 11 || valueType === /* enum */ 14\n ? this._fieldsArray[i].resolvedType && shortname(this.parent, this._fieldsArray[i].resolvedType) || this._fieldsArray[i].type\n : undefined;\n descriptor.nestedType.push(exports.DescriptorProto.create({\n name: fieldDescriptor.typeName,\n field: [\n exports.FieldDescriptorProto.create({ name: \"key\", number: 1, label: 1, type: keyType }), // can't reference a type or enum\n exports.FieldDescriptorProto.create({ name: \"value\", number: 2, label: 1, type: valueType, typeName: valueTypeName })\n ],\n options: exports.MessageOptions.create({ mapEntry: true })\n }));\n }\n }\n /* Oneofs */ for (i = 0; i < this.oneofsArray.length; ++i)\n descriptor.oneofDecl.push(this._oneofsArray[i].toDescriptor());\n /* Nested... */ for (i = 0; i < this.nestedArray.length; ++i) {\n /* Extension fields */ if (this._nestedArray[i] instanceof Field)\n descriptor.field.push(this._nestedArray[i].toDescriptor(syntax));\n /* Types */ else if (this._nestedArray[i] instanceof Type)\n descriptor.nestedType.push(this._nestedArray[i].toDescriptor(syntax));\n /* Enums */ else if (this._nestedArray[i] instanceof Enum)\n descriptor.enumType.push(this._nestedArray[i].toDescriptor());\n // plain nested namespaces become packages instead in Root#toDescriptor\n }\n /* Extension ranges */ if (this.extensions)\n for (i = 0; i < this.extensions.length; ++i)\n descriptor.extensionRange.push(exports.DescriptorProto.ExtensionRange.create({ start: this.extensions[i][0], end: this.extensions[i][1] }));\n /* Reserved... */ if (this.reserved)\n for (i = 0; i < this.reserved.length; ++i)\n /* Names */ if (typeof this.reserved[i] === \"string\")\n descriptor.reservedName.push(this.reserved[i]);\n /* Ranges */ else\n descriptor.reservedRange.push(exports.DescriptorProto.ReservedRange.create({ start: this.reserved[i][0], end: this.reserved[i][1] }));\n\n descriptor.options = toDescriptorOptions(this.options, exports.MessageOptions);\n\n return descriptor;\n};\n\n// --- Field ---\n\n/**\n * Properties of a FieldDescriptorProto message.\n * @interface IFieldDescriptorProto\n * @property {string} [name] Field name\n * @property {number} [number] Field id\n * @property {IFieldDescriptorProtoLabel} [label] Field rule\n * @property {IFieldDescriptorProtoType} [type] Field basic type\n * @property {string} [typeName] Field type name\n * @property {string} [extendee] Extended type name\n * @property {string} [defaultValue] Literal default value\n * @property {number} [oneofIndex] Oneof index if part of a oneof\n * @property {*} [jsonName] Not supported\n * @property {IFieldOptions} [options] Field options\n */\n\n/**\n * Values of the FieldDescriptorProto.Label enum.\n * @typedef IFieldDescriptorProtoLabel\n * @type {number}\n * @property {number} LABEL_OPTIONAL=1\n * @property {number} LABEL_REQUIRED=2\n * @property {number} LABEL_REPEATED=3\n */\n\n/**\n * Values of the FieldDescriptorProto.Type enum.\n * @typedef IFieldDescriptorProtoType\n * @type {number}\n * @property {number} TYPE_DOUBLE=1\n * @property {number} TYPE_FLOAT=2\n * @property {number} TYPE_INT64=3\n * @property {number} TYPE_UINT64=4\n * @property {number} TYPE_INT32=5\n * @property {number} TYPE_FIXED64=6\n * @property {number} TYPE_FIXED32=7\n * @property {number} TYPE_BOOL=8\n * @property {number} TYPE_STRING=9\n * @property {number} TYPE_GROUP=10\n * @property {number} TYPE_MESSAGE=11\n * @property {number} TYPE_BYTES=12\n * @property {number} TYPE_UINT32=13\n * @property {number} TYPE_ENUM=14\n * @property {number} TYPE_SFIXED32=15\n * @property {number} TYPE_SFIXED64=16\n * @property {number} TYPE_SINT32=17\n * @property {number} TYPE_SINT64=18\n */\n\n/**\n * Properties of a FieldOptions message.\n * @interface IFieldOptions\n * @property {boolean} [packed] Whether packed or not (defaults to `false` for proto2 and `true` for proto3)\n * @property {IFieldOptionsJSType} [jstype] JavaScript value type (not used by protobuf.js)\n */\n\n/**\n * Values of the FieldOptions.JSType enum.\n * @typedef IFieldOptionsJSType\n * @type {number}\n * @property {number} JS_NORMAL=0\n * @property {number} JS_STRING=1\n * @property {number} JS_NUMBER=2\n */\n\n// copied here from parse.js\nvar numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/;\n\n/**\n * Creates a field from a descriptor.\n * @param {IFieldDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n * @returns {Field} Field instance\n */\nField.fromDescriptor = function fromDescriptor(descriptor, syntax) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.DescriptorProto.decode(descriptor);\n\n if (typeof descriptor.number !== \"number\")\n throw Error(\"missing field id\");\n\n // Rewire field type\n var fieldType;\n if (descriptor.typeName && descriptor.typeName.length)\n fieldType = descriptor.typeName;\n else\n fieldType = fromDescriptorType(descriptor.type);\n\n // Rewire field rule\n var fieldRule;\n switch (descriptor.label) {\n // 0 is reserved for errors\n case 1: fieldRule = undefined; break;\n case 2: fieldRule = \"required\"; break;\n case 3: fieldRule = \"repeated\"; break;\n default: throw Error(\"illegal label: \" + descriptor.label);\n }\n\n\tvar extendee = descriptor.extendee;\n\tif (descriptor.extendee !== undefined) {\n\t\textendee = extendee.length ? extendee : undefined;\n\t}\n var field = new Field(\n $protobuf.util.camelCase(descriptor.name.length ? descriptor.name : \"field\" + descriptor.number),\n descriptor.number,\n fieldType,\n fieldRule,\n extendee\n );\n\n field.options = fromDescriptorOptions(descriptor.options, exports.FieldOptions);\n\n if (descriptor.defaultValue && descriptor.defaultValue.length) {\n var defaultValue = descriptor.defaultValue;\n switch (defaultValue) {\n case \"true\": case \"TRUE\":\n defaultValue = true;\n break;\n case \"false\": case \"FALSE\":\n defaultValue = false;\n break;\n default:\n var match = numberRe.exec(defaultValue);\n if (match)\n defaultValue = parseInt(defaultValue); // eslint-disable-line radix\n break;\n }\n field.setOption(\"default\", defaultValue);\n }\n\n if (packableDescriptorType(descriptor.type)) {\n if (syntax === \"proto3\") { // defaults to packed=true (internal preset is packed=true)\n if (descriptor.options && !descriptor.options.packed)\n field.setOption(\"packed\", false);\n } else if (!(descriptor.options && descriptor.options.packed)) // defaults to packed=false\n field.setOption(\"packed\", false);\n }\n\n return field;\n};\n\n/**\n * Converts a field to a descriptor.\n * @returns {Message} Descriptor\n * @param {string} [syntax=\"proto2\"] Syntax\n */\nField.prototype.toDescriptor = function toDescriptor(syntax) {\n var descriptor = exports.FieldDescriptorProto.create({ name: this.name, number: this.id });\n\n if (this.map) {\n\n descriptor.type = 11; // message\n descriptor.typeName = $protobuf.util.ucFirst(this.name); // fieldName -> FieldNameEntry (built in Type#toDescriptor)\n descriptor.label = 3; // repeated\n\n } else {\n\n // Rewire field type\n switch (descriptor.type = toDescriptorType(this.type, this.resolve().resolvedType)) {\n case 10: // group\n case 11: // type\n case 14: // enum\n descriptor.typeName = this.resolvedType ? shortname(this.parent, this.resolvedType) : this.type;\n break;\n }\n\n // Rewire field rule\n switch (this.rule) {\n case \"repeated\": descriptor.label = 3; break;\n case \"required\": descriptor.label = 2; break;\n default: descriptor.label = 1; break;\n }\n\n }\n\n // Handle extension field\n descriptor.extendee = this.extensionField ? this.extensionField.parent.fullName : this.extend;\n\n // Handle part of oneof\n if (this.partOf)\n if ((descriptor.oneofIndex = this.parent.oneofsArray.indexOf(this.partOf)) < 0)\n throw Error(\"missing oneof\");\n\n if (this.options) {\n descriptor.options = toDescriptorOptions(this.options, exports.FieldOptions);\n if (this.options[\"default\"] != null)\n descriptor.defaultValue = String(this.options[\"default\"]);\n }\n\n if (syntax === \"proto3\") { // defaults to packed=true\n if (!this.packed)\n (descriptor.options || (descriptor.options = exports.FieldOptions.create())).packed = false;\n } else if (this.packed) // defaults to packed=false\n (descriptor.options || (descriptor.options = exports.FieldOptions.create())).packed = true;\n\n return descriptor;\n};\n\n// --- Enum ---\n\n/**\n * Properties of an EnumDescriptorProto message.\n * @interface IEnumDescriptorProto\n * @property {string} [name] Enum name\n * @property {IEnumValueDescriptorProto[]} [value] Enum values\n * @property {IEnumOptions} [options] Enum options\n */\n\n/**\n * Properties of an EnumValueDescriptorProto message.\n * @interface IEnumValueDescriptorProto\n * @property {string} [name] Name\n * @property {number} [number] Value\n * @property {*} [options] Not supported\n */\n\n/**\n * Properties of an EnumOptions message.\n * @interface IEnumOptions\n * @property {boolean} [allowAlias] Whether aliases are allowed\n * @property {boolean} [deprecated]\n */\n\nvar unnamedEnumIndex = 0;\n\n/**\n * Creates an enum from a descriptor.\n * @param {IEnumDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {Enum} Enum instance\n */\nEnum.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.EnumDescriptorProto.decode(descriptor);\n\n // Construct values object\n var values = {};\n if (descriptor.value)\n for (var i = 0; i < descriptor.value.length; ++i) {\n var name = descriptor.value[i].name,\n value = descriptor.value[i].number || 0;\n values[name && name.length ? name : \"NAME\" + value] = value;\n }\n\n return new Enum(\n descriptor.name && descriptor.name.length ? descriptor.name : \"Enum\" + unnamedEnumIndex++,\n values,\n fromDescriptorOptions(descriptor.options, exports.EnumOptions)\n );\n};\n\n/**\n * Converts an enum to a descriptor.\n * @returns {Message} Descriptor\n */\nEnum.prototype.toDescriptor = function toDescriptor() {\n\n // Values\n var values = [];\n for (var i = 0, ks = Object.keys(this.values); i < ks.length; ++i)\n values.push(exports.EnumValueDescriptorProto.create({ name: ks[i], number: this.values[ks[i]] }));\n\n return exports.EnumDescriptorProto.create({\n name: this.name,\n value: values,\n options: toDescriptorOptions(this.options, exports.EnumOptions)\n });\n};\n\n// --- OneOf ---\n\n/**\n * Properties of a OneofDescriptorProto message.\n * @interface IOneofDescriptorProto\n * @property {string} [name] Oneof name\n * @property {*} [options] Not supported\n */\n\nvar unnamedOneofIndex = 0;\n\n/**\n * Creates a oneof from a descriptor.\n * @param {IOneofDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {OneOf} OneOf instance\n */\nOneOf.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.OneofDescriptorProto.decode(descriptor);\n\n return new OneOf(\n // unnamedOneOfIndex is global, not per type, because we have no ref to a type here\n descriptor.name && descriptor.name.length ? descriptor.name : \"oneof\" + unnamedOneofIndex++\n // fromDescriptorOptions(descriptor.options, exports.OneofOptions) - only uninterpreted_option\n );\n};\n\n/**\n * Converts a oneof to a descriptor.\n * @returns {Message} Descriptor\n */\nOneOf.prototype.toDescriptor = function toDescriptor() {\n return exports.OneofDescriptorProto.create({\n name: this.name\n // options: toDescriptorOptions(this.options, exports.OneofOptions) - only uninterpreted_option\n });\n};\n\n// --- Service ---\n\n/**\n * Properties of a ServiceDescriptorProto message.\n * @interface IServiceDescriptorProto\n * @property {string} [name] Service name\n * @property {IMethodDescriptorProto[]} [method] Methods\n * @property {IServiceOptions} [options] Options\n */\n\n/**\n * Properties of a ServiceOptions message.\n * @interface IServiceOptions\n * @property {boolean} [deprecated]\n */\n\nvar unnamedServiceIndex = 0;\n\n/**\n * Creates a service from a descriptor.\n * @param {IServiceDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {Service} Service instance\n */\nService.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.ServiceDescriptorProto.decode(descriptor);\n\n var service = new Service(descriptor.name && descriptor.name.length ? descriptor.name : \"Service\" + unnamedServiceIndex++, fromDescriptorOptions(descriptor.options, exports.ServiceOptions));\n if (descriptor.method)\n for (var i = 0; i < descriptor.method.length; ++i)\n service.add(Method.fromDescriptor(descriptor.method[i]));\n\n return service;\n};\n\n/**\n * Converts a service to a descriptor.\n * @returns {Message} Descriptor\n */\nService.prototype.toDescriptor = function toDescriptor() {\n\n // Methods\n var methods = [];\n for (var i = 0; i < this.methodsArray; ++i)\n methods.push(this._methodsArray[i].toDescriptor());\n\n return exports.ServiceDescriptorProto.create({\n name: this.name,\n methods: methods,\n options: toDescriptorOptions(this.options, exports.ServiceOptions)\n });\n};\n\n// --- Method ---\n\n/**\n * Properties of a MethodDescriptorProto message.\n * @interface IMethodDescriptorProto\n * @property {string} [name] Method name\n * @property {string} [inputType] Request type name\n * @property {string} [outputType] Response type name\n * @property {IMethodOptions} [options] Not supported\n * @property {boolean} [clientStreaming=false] Whether requests are streamed\n * @property {boolean} [serverStreaming=false] Whether responses are streamed\n */\n\n/**\n * Properties of a MethodOptions message.\n * @interface IMethodOptions\n * @property {boolean} [deprecated]\n */\n\nvar unnamedMethodIndex = 0;\n\n/**\n * Creates a method from a descriptor.\n * @param {IMethodDescriptorProto|Reader|Uint8Array} descriptor Descriptor\n * @returns {Method} Reflected method instance\n */\nMethod.fromDescriptor = function fromDescriptor(descriptor) {\n\n // Decode the descriptor message if specified as a buffer:\n if (typeof descriptor.length === \"number\")\n descriptor = exports.MethodDescriptorProto.decode(descriptor);\n\n return new Method(\n // unnamedMethodIndex is global, not per service, because we have no ref to a service here\n descriptor.name && descriptor.name.length ? descriptor.name : \"Method\" + unnamedMethodIndex++,\n \"rpc\",\n descriptor.inputType,\n descriptor.outputType,\n Boolean(descriptor.clientStreaming),\n Boolean(descriptor.serverStreaming),\n fromDescriptorOptions(descriptor.options, exports.MethodOptions)\n );\n};\n\n/**\n * Converts a method to a descriptor.\n * @returns {Message} Descriptor\n */\nMethod.prototype.toDescriptor = function toDescriptor() {\n return exports.MethodDescriptorProto.create({\n name: this.name,\n inputType: this.resolvedRequestType ? this.resolvedRequestType.fullName : this.requestType,\n outputType: this.resolvedResponseType ? this.resolvedResponseType.fullName : this.responseType,\n clientStreaming: this.requestStream,\n serverStreaming: this.responseStream,\n options: toDescriptorOptions(this.options, exports.MethodOptions)\n });\n};\n\n// --- utility ---\n\n// Converts a descriptor type to a protobuf.js basic type\nfunction fromDescriptorType(type) {\n switch (type) {\n // 0 is reserved for errors\n case 1: return \"double\";\n case 2: return \"float\";\n case 3: return \"int64\";\n case 4: return \"uint64\";\n case 5: return \"int32\";\n case 6: return \"fixed64\";\n case 7: return \"fixed32\";\n case 8: return \"bool\";\n case 9: return \"string\";\n case 12: return \"bytes\";\n case 13: return \"uint32\";\n case 15: return \"sfixed32\";\n case 16: return \"sfixed64\";\n case 17: return \"sint32\";\n case 18: return \"sint64\";\n }\n throw Error(\"illegal type: \" + type);\n}\n\n// Tests if a descriptor type is packable\nfunction packableDescriptorType(type) {\n switch (type) {\n case 1: // double\n case 2: // float\n case 3: // int64\n case 4: // uint64\n case 5: // int32\n case 6: // fixed64\n case 7: // fixed32\n case 8: // bool\n case 13: // uint32\n case 14: // enum (!)\n case 15: // sfixed32\n case 16: // sfixed64\n case 17: // sint32\n case 18: // sint64\n return true;\n }\n return false;\n}\n\n// Converts a protobuf.js basic type to a descriptor type\nfunction toDescriptorType(type, resolvedType) {\n switch (type) {\n // 0 is reserved for errors\n case \"double\": return 1;\n case \"float\": return 2;\n case \"int64\": return 3;\n case \"uint64\": return 4;\n case \"int32\": return 5;\n case \"fixed64\": return 6;\n case \"fixed32\": return 7;\n case \"bool\": return 8;\n case \"string\": return 9;\n case \"bytes\": return 12;\n case \"uint32\": return 13;\n case \"sfixed32\": return 15;\n case \"sfixed64\": return 16;\n case \"sint32\": return 17;\n case \"sint64\": return 18;\n }\n if (resolvedType instanceof Enum)\n return 14;\n if (resolvedType instanceof Type)\n return resolvedType.group ? 10 : 11;\n throw Error(\"illegal type: \" + type);\n}\n\n// Converts descriptor options to an options object\nfunction fromDescriptorOptions(options, type) {\n if (!options)\n return undefined;\n var out = [];\n for (var i = 0, field, key, val; i < type.fieldsArray.length; ++i)\n if ((key = (field = type._fieldsArray[i]).name) !== \"uninterpretedOption\")\n if (options.hasOwnProperty(key)) { // eslint-disable-line no-prototype-builtins\n val = options[key];\n if (field.resolvedType instanceof Enum && typeof val === \"number\" && field.resolvedType.valuesById[val] !== undefined)\n val = field.resolvedType.valuesById[val];\n out.push(underScore(key), val);\n }\n return out.length ? $protobuf.util.toObject(out) : undefined;\n}\n\n// Converts an options object to descriptor options\nfunction toDescriptorOptions(options, type) {\n if (!options)\n return undefined;\n var out = [];\n for (var i = 0, ks = Object.keys(options), key, val; i < ks.length; ++i) {\n val = options[key = ks[i]];\n if (key === \"default\")\n continue;\n var field = type.fields[key];\n if (!field && !(field = type.fields[key = $protobuf.util.camelCase(key)]))\n continue;\n out.push(key, val);\n }\n return out.length ? type.fromObject($protobuf.util.toObject(out)) : undefined;\n}\n\n// Calculates the shortest relative path from `from` to `to`.\nfunction shortname(from, to) {\n var fromPath = from.fullName.split(\".\"),\n toPath = to.fullName.split(\".\"),\n i = 0,\n j = 0,\n k = toPath.length - 1;\n if (!(from instanceof Root) && to instanceof Namespace)\n while (i < fromPath.length && j < k && fromPath[i] === toPath[j]) {\n var other = to.lookup(fromPath[i++], true);\n if (other !== null && other !== to)\n break;\n ++j;\n }\n else\n for (; i < fromPath.length && j < k && fromPath[i] === toPath[j]; ++i, ++j);\n return toPath.slice(j).join(\".\");\n}\n\n// copied here from cli/targets/proto.js\nfunction underScore(str) {\n return str.substring(0,1)\n + str.substring(1)\n .replace(/([A-Z])(?=[a-z]|$)/g, function($0, $1) { return \"_\" + $1.toLowerCase(); });\n}\n\n// --- exports ---\n\n/**\n * Reflected file descriptor set.\n * @name FileDescriptorSet\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected file descriptor proto.\n * @name FileDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected descriptor proto.\n * @name DescriptorProto\n * @type {Type}\n * @property {Type} ExtensionRange\n * @property {Type} ReservedRange\n * @const\n * @tstype $protobuf.Type & {\n * ExtensionRange: $protobuf.Type,\n * ReservedRange: $protobuf.Type\n * }\n */\n\n/**\n * Reflected field descriptor proto.\n * @name FieldDescriptorProto\n * @type {Type}\n * @property {Enum} Label\n * @property {Enum} Type\n * @const\n * @tstype $protobuf.Type & {\n * Label: $protobuf.Enum,\n * Type: $protobuf.Enum\n * }\n */\n\n/**\n * Reflected oneof descriptor proto.\n * @name OneofDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum descriptor proto.\n * @name EnumDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected service descriptor proto.\n * @name ServiceDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum value descriptor proto.\n * @name EnumValueDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected method descriptor proto.\n * @name MethodDescriptorProto\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected file options.\n * @name FileOptions\n * @type {Type}\n * @property {Enum} OptimizeMode\n * @const\n * @tstype $protobuf.Type & {\n * OptimizeMode: $protobuf.Enum\n * }\n */\n\n/**\n * Reflected message options.\n * @name MessageOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected field options.\n * @name FieldOptions\n * @type {Type}\n * @property {Enum} CType\n * @property {Enum} JSType\n * @const\n * @tstype $protobuf.Type & {\n * CType: $protobuf.Enum,\n * JSType: $protobuf.Enum\n * }\n */\n\n/**\n * Reflected oneof options.\n * @name OneofOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum options.\n * @name EnumOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected enum value options.\n * @name EnumValueOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected service options.\n * @name ServiceOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected method options.\n * @name MethodOptions\n * @type {Type}\n * @const\n * @tstype $protobuf.Type\n */\n\n/**\n * Reflected uninterpretet option.\n * @name UninterpretedOption\n * @type {Type}\n * @property {Type} NamePart\n * @const\n * @tstype $protobuf.Type & {\n * NamePart: $protobuf.Type\n * }\n */\n\n/**\n * Reflected source code info.\n * @name SourceCodeInfo\n * @type {Type}\n * @property {Type} Location\n * @const\n * @tstype $protobuf.Type & {\n * Location: $protobuf.Type\n * }\n */\n\n/**\n * Reflected generated code info.\n * @name GeneratedCodeInfo\n * @type {Type}\n * @property {Type} Annotation\n * @const\n * @tstype $protobuf.Type & {\n * Annotation: $protobuf.Type\n * }\n */\n","'use strict';\nconst strictUriEncode = require('strict-uri-encode');\nconst decodeComponent = require('decode-uri-component');\nconst splitOnFirst = require('split-on-first');\nconst filterObject = require('filter-obj');\n\nconst isNullOrUndefined = value => value === null || value === undefined;\n\nconst encodeFragmentIdentifier = Symbol('encodeFragmentIdentifier');\n\nfunction encoderForArrayFormat(options) {\n\tswitch (options.arrayFormat) {\n\t\tcase 'index':\n\t\t\treturn key => (result, value) => {\n\t\t\t\tconst index = result.length;\n\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, [encode(key, options), '[', index, ']'].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [\n\t\t\t\t\t...result,\n\t\t\t\t\t[encode(key, options), '[', encode(index, options), ']=', encode(value, options)].join('')\n\t\t\t\t];\n\t\t\t};\n\n\t\tcase 'bracket':\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, [encode(key, options), '[]'].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [...result, [encode(key, options), '[]=', encode(value, options)].join('')];\n\t\t\t};\n\n\t\tcase 'colon-list-separator':\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, [encode(key, options), ':list='].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [...result, [encode(key, options), ':list=', encode(value, options)].join('')];\n\t\t\t};\n\n\t\tcase 'comma':\n\t\tcase 'separator':\n\t\tcase 'bracket-separator': {\n\t\t\tconst keyValueSep = options.arrayFormat === 'bracket-separator' ?\n\t\t\t\t'[]=' :\n\t\t\t\t'=';\n\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\t// Translate null to an empty string so that it doesn't serialize as 'null'\n\t\t\t\tvalue = value === null ? '' : value;\n\n\t\t\t\tif (result.length === 0) {\n\t\t\t\t\treturn [[encode(key, options), keyValueSep, encode(value, options)].join('')];\n\t\t\t\t}\n\n\t\t\t\treturn [[result, encode(value, options)].join(options.arrayFormatSeparator)];\n\t\t\t};\n\t\t}\n\n\t\tdefault:\n\t\t\treturn key => (result, value) => {\n\t\t\t\tif (\n\t\t\t\t\tvalue === undefined ||\n\t\t\t\t\t(options.skipNull && value === null) ||\n\t\t\t\t\t(options.skipEmptyString && value === '')\n\t\t\t\t) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tif (value === null) {\n\t\t\t\t\treturn [...result, encode(key, options)];\n\t\t\t\t}\n\n\t\t\t\treturn [...result, [encode(key, options), '=', encode(value, options)].join('')];\n\t\t\t};\n\t}\n}\n\nfunction parserForArrayFormat(options) {\n\tlet result;\n\n\tswitch (options.arrayFormat) {\n\t\tcase 'index':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tresult = /\\[(\\d*)\\]$/.exec(key);\n\n\t\t\t\tkey = key.replace(/\\[\\d*\\]$/, '');\n\n\t\t\t\tif (!result) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = {};\n\t\t\t\t}\n\n\t\t\t\taccumulator[key][result[1]] = value;\n\t\t\t};\n\n\t\tcase 'bracket':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tresult = /(\\[\\])$/.exec(key);\n\t\t\t\tkey = key.replace(/\\[\\]$/, '');\n\n\t\t\t\tif (!result) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = [value];\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], value);\n\t\t\t};\n\n\t\tcase 'colon-list-separator':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tresult = /(:list)$/.exec(key);\n\t\t\t\tkey = key.replace(/:list$/, '');\n\n\t\t\t\tif (!result) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = [value];\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], value);\n\t\t\t};\n\n\t\tcase 'comma':\n\t\tcase 'separator':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tconst isArray = typeof value === 'string' && value.includes(options.arrayFormatSeparator);\n\t\t\t\tconst isEncodedArray = (typeof value === 'string' && !isArray && decode(value, options).includes(options.arrayFormatSeparator));\n\t\t\t\tvalue = isEncodedArray ? decode(value, options) : value;\n\t\t\t\tconst newValue = isArray || isEncodedArray ? value.split(options.arrayFormatSeparator).map(item => decode(item, options)) : value === null ? value : decode(value, options);\n\t\t\t\taccumulator[key] = newValue;\n\t\t\t};\n\n\t\tcase 'bracket-separator':\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tconst isArray = /(\\[\\])$/.test(key);\n\t\t\t\tkey = key.replace(/\\[\\]$/, '');\n\n\t\t\t\tif (!isArray) {\n\t\t\t\t\taccumulator[key] = value ? decode(value, options) : value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst arrayValue = value === null ?\n\t\t\t\t\t[] :\n\t\t\t\t\tvalue.split(options.arrayFormatSeparator).map(item => decode(item, options));\n\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = arrayValue;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], arrayValue);\n\t\t\t};\n\n\t\tdefault:\n\t\t\treturn (key, value, accumulator) => {\n\t\t\t\tif (accumulator[key] === undefined) {\n\t\t\t\t\taccumulator[key] = value;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\taccumulator[key] = [].concat(accumulator[key], value);\n\t\t\t};\n\t}\n}\n\nfunction validateArrayFormatSeparator(value) {\n\tif (typeof value !== 'string' || value.length !== 1) {\n\t\tthrow new TypeError('arrayFormatSeparator must be single character string');\n\t}\n}\n\nfunction encode(value, options) {\n\tif (options.encode) {\n\t\treturn options.strict ? strictUriEncode(value) : encodeURIComponent(value);\n\t}\n\n\treturn value;\n}\n\nfunction decode(value, options) {\n\tif (options.decode) {\n\t\treturn decodeComponent(value);\n\t}\n\n\treturn value;\n}\n\nfunction keysSorter(input) {\n\tif (Array.isArray(input)) {\n\t\treturn input.sort();\n\t}\n\n\tif (typeof input === 'object') {\n\t\treturn keysSorter(Object.keys(input))\n\t\t\t.sort((a, b) => Number(a) - Number(b))\n\t\t\t.map(key => input[key]);\n\t}\n\n\treturn input;\n}\n\nfunction removeHash(input) {\n\tconst hashStart = input.indexOf('#');\n\tif (hashStart !== -1) {\n\t\tinput = input.slice(0, hashStart);\n\t}\n\n\treturn input;\n}\n\nfunction getHash(url) {\n\tlet hash = '';\n\tconst hashStart = url.indexOf('#');\n\tif (hashStart !== -1) {\n\t\thash = url.slice(hashStart);\n\t}\n\n\treturn hash;\n}\n\nfunction extract(input) {\n\tinput = removeHash(input);\n\tconst queryStart = input.indexOf('?');\n\tif (queryStart === -1) {\n\t\treturn '';\n\t}\n\n\treturn input.slice(queryStart + 1);\n}\n\nfunction parseValue(value, options) {\n\tif (options.parseNumbers && !Number.isNaN(Number(value)) && (typeof value === 'string' && value.trim() !== '')) {\n\t\tvalue = Number(value);\n\t} else if (options.parseBooleans && value !== null && (value.toLowerCase() === 'true' || value.toLowerCase() === 'false')) {\n\t\tvalue = value.toLowerCase() === 'true';\n\t}\n\n\treturn value;\n}\n\nfunction parse(query, options) {\n\toptions = Object.assign({\n\t\tdecode: true,\n\t\tsort: true,\n\t\tarrayFormat: 'none',\n\t\tarrayFormatSeparator: ',',\n\t\tparseNumbers: false,\n\t\tparseBooleans: false\n\t}, options);\n\n\tvalidateArrayFormatSeparator(options.arrayFormatSeparator);\n\n\tconst formatter = parserForArrayFormat(options);\n\n\t// Create an object with no prototype\n\tconst ret = Object.create(null);\n\n\tif (typeof query !== 'string') {\n\t\treturn ret;\n\t}\n\n\tquery = query.trim().replace(/^[?#&]/, '');\n\n\tif (!query) {\n\t\treturn ret;\n\t}\n\n\tfor (const param of query.split('&')) {\n\t\tif (param === '') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet [key, value] = splitOnFirst(options.decode ? param.replace(/\\+/g, ' ') : param, '=');\n\n\t\t// Missing `=` should be `null`:\n\t\t// http://w3.org/TR/2012/WD-url-20120524/#collect-url-parameters\n\t\tvalue = value === undefined ? null : ['comma', 'separator', 'bracket-separator'].includes(options.arrayFormat) ? value : decode(value, options);\n\t\tformatter(decode(key, options), value, ret);\n\t}\n\n\tfor (const key of Object.keys(ret)) {\n\t\tconst value = ret[key];\n\t\tif (typeof value === 'object' && value !== null) {\n\t\t\tfor (const k of Object.keys(value)) {\n\t\t\t\tvalue[k] = parseValue(value[k], options);\n\t\t\t}\n\t\t} else {\n\t\t\tret[key] = parseValue(value, options);\n\t\t}\n\t}\n\n\tif (options.sort === false) {\n\t\treturn ret;\n\t}\n\n\treturn (options.sort === true ? Object.keys(ret).sort() : Object.keys(ret).sort(options.sort)).reduce((result, key) => {\n\t\tconst value = ret[key];\n\t\tif (Boolean(value) && typeof value === 'object' && !Array.isArray(value)) {\n\t\t\t// Sort object keys, not values\n\t\t\tresult[key] = keysSorter(value);\n\t\t} else {\n\t\t\tresult[key] = value;\n\t\t}\n\n\t\treturn result;\n\t}, Object.create(null));\n}\n\nexports.extract = extract;\nexports.parse = parse;\n\nexports.stringify = (object, options) => {\n\tif (!object) {\n\t\treturn '';\n\t}\n\n\toptions = Object.assign({\n\t\tencode: true,\n\t\tstrict: true,\n\t\tarrayFormat: 'none',\n\t\tarrayFormatSeparator: ','\n\t}, options);\n\n\tvalidateArrayFormatSeparator(options.arrayFormatSeparator);\n\n\tconst shouldFilter = key => (\n\t\t(options.skipNull && isNullOrUndefined(object[key])) ||\n\t\t(options.skipEmptyString && object[key] === '')\n\t);\n\n\tconst formatter = encoderForArrayFormat(options);\n\n\tconst objectCopy = {};\n\n\tfor (const key of Object.keys(object)) {\n\t\tif (!shouldFilter(key)) {\n\t\t\tobjectCopy[key] = object[key];\n\t\t}\n\t}\n\n\tconst keys = Object.keys(objectCopy);\n\n\tif (options.sort !== false) {\n\t\tkeys.sort(options.sort);\n\t}\n\n\treturn keys.map(key => {\n\t\tconst value = object[key];\n\n\t\tif (value === undefined) {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (value === null) {\n\t\t\treturn encode(key, options);\n\t\t}\n\n\t\tif (Array.isArray(value)) {\n\t\t\tif (value.length === 0 && options.arrayFormat === 'bracket-separator') {\n\t\t\t\treturn encode(key, options) + '[]';\n\t\t\t}\n\n\t\t\treturn value\n\t\t\t\t.reduce(formatter(key), [])\n\t\t\t\t.join('&');\n\t\t}\n\n\t\treturn encode(key, options) + '=' + encode(value, options);\n\t}).filter(x => x.length > 0).join('&');\n};\n\nexports.parseUrl = (url, options) => {\n\toptions = Object.assign({\n\t\tdecode: true\n\t}, options);\n\n\tconst [url_, hash] = splitOnFirst(url, '#');\n\n\treturn Object.assign(\n\t\t{\n\t\t\turl: url_.split('?')[0] || '',\n\t\t\tquery: parse(extract(url), options)\n\t\t},\n\t\toptions && options.parseFragmentIdentifier && hash ? {fragmentIdentifier: decode(hash, options)} : {}\n\t);\n};\n\nexports.stringifyUrl = (object, options) => {\n\toptions = Object.assign({\n\t\tencode: true,\n\t\tstrict: true,\n\t\t[encodeFragmentIdentifier]: true\n\t}, options);\n\n\tconst url = removeHash(object.url).split('?')[0] || '';\n\tconst queryFromUrl = exports.extract(object.url);\n\tconst parsedQueryFromUrl = exports.parse(queryFromUrl, {sort: false});\n\n\tconst query = Object.assign(parsedQueryFromUrl, object.query);\n\tlet queryString = exports.stringify(query, options);\n\tif (queryString) {\n\t\tqueryString = `?${queryString}`;\n\t}\n\n\tlet hash = getHash(object.url);\n\tif (object.fragmentIdentifier) {\n\t\thash = `#${options[encodeFragmentIdentifier] ? encode(object.fragmentIdentifier, options) : object.fragmentIdentifier}`;\n\t}\n\n\treturn `${url}${queryString}${hash}`;\n};\n\nexports.pick = (input, filter, options) => {\n\toptions = Object.assign({\n\t\tparseFragmentIdentifier: true,\n\t\t[encodeFragmentIdentifier]: false\n\t}, options);\n\n\tconst {url, query, fragmentIdentifier} = exports.parseUrl(input, options);\n\treturn exports.stringifyUrl({\n\t\turl,\n\t\tquery: filterObject(query, filter),\n\t\tfragmentIdentifier\n\t}, options);\n};\n\nexports.exclude = (input, filter, options) => {\n\tconst exclusionFilter = Array.isArray(filter) ? key => !filter.includes(key) : (key, value) => !filter(key, value);\n\n\treturn exports.pick(input, exclusionFilter, options);\n};\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n",";(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"), require(\"./enc-base64\"), require(\"./md5\"), require(\"./evpkdf\"), require(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var BlockCipher = C_lib.BlockCipher;\n\t var C_algo = C.algo;\n\n\t // Lookup tables\n\t var SBOX = [];\n\t var INV_SBOX = [];\n\t var SUB_MIX_0 = [];\n\t var SUB_MIX_1 = [];\n\t var SUB_MIX_2 = [];\n\t var SUB_MIX_3 = [];\n\t var INV_SUB_MIX_0 = [];\n\t var INV_SUB_MIX_1 = [];\n\t var INV_SUB_MIX_2 = [];\n\t var INV_SUB_MIX_3 = [];\n\n\t // Compute lookup tables\n\t (function () {\n\t // Compute double table\n\t var d = [];\n\t for (var i = 0; i < 256; i++) {\n\t if (i < 128) {\n\t d[i] = i << 1;\n\t } else {\n\t d[i] = (i << 1) ^ 0x11b;\n\t }\n\t }\n\n\t // Walk GF(2^8)\n\t var x = 0;\n\t var xi = 0;\n\t for (var i = 0; i < 256; i++) {\n\t // Compute sbox\n\t var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n\t sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;\n\t SBOX[x] = sx;\n\t INV_SBOX[sx] = x;\n\n\t // Compute multiplication\n\t var x2 = d[x];\n\t var x4 = d[x2];\n\t var x8 = d[x4];\n\n\t // Compute sub bytes, mix columns tables\n\t var t = (d[sx] * 0x101) ^ (sx * 0x1010100);\n\t SUB_MIX_0[x] = (t << 24) | (t >>> 8);\n\t SUB_MIX_1[x] = (t << 16) | (t >>> 16);\n\t SUB_MIX_2[x] = (t << 8) | (t >>> 24);\n\t SUB_MIX_3[x] = t;\n\n\t // Compute inv sub bytes, inv mix columns tables\n\t var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);\n\t INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8);\n\t INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16);\n\t INV_SUB_MIX_2[sx] = (t << 8) | (t >>> 24);\n\t INV_SUB_MIX_3[sx] = t;\n\n\t // Compute next counter\n\t if (!x) {\n\t x = xi = 1;\n\t } else {\n\t x = x2 ^ d[d[d[x8 ^ x2]]];\n\t xi ^= d[d[xi]];\n\t }\n\t }\n\t }());\n\n\t // Precomputed Rcon lookup\n\t var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];\n\n\t /**\n\t * AES block cipher algorithm.\n\t */\n\t var AES = C_algo.AES = BlockCipher.extend({\n\t _doReset: function () {\n\t var t;\n\n\t // Skip reset of nRounds has been set before and key did not change\n\t if (this._nRounds && this._keyPriorReset === this._key) {\n\t return;\n\t }\n\n\t // Shortcuts\n\t var key = this._keyPriorReset = this._key;\n\t var keyWords = key.words;\n\t var keySize = key.sigBytes / 4;\n\n\t // Compute number of rounds\n\t var nRounds = this._nRounds = keySize + 6;\n\n\t // Compute number of key schedule rows\n\t var ksRows = (nRounds + 1) * 4;\n\n\t // Compute key schedule\n\t var keySchedule = this._keySchedule = [];\n\t for (var ksRow = 0; ksRow < ksRows; ksRow++) {\n\t if (ksRow < keySize) {\n\t keySchedule[ksRow] = keyWords[ksRow];\n\t } else {\n\t t = keySchedule[ksRow - 1];\n\n\t if (!(ksRow % keySize)) {\n\t // Rot word\n\t t = (t << 8) | (t >>> 24);\n\n\t // Sub word\n\t t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];\n\n\t // Mix Rcon\n\t t ^= RCON[(ksRow / keySize) | 0] << 24;\n\t } else if (keySize > 6 && ksRow % keySize == 4) {\n\t // Sub word\n\t t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];\n\t }\n\n\t keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t;\n\t }\n\t }\n\n\t // Compute inv key schedule\n\t var invKeySchedule = this._invKeySchedule = [];\n\t for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) {\n\t var ksRow = ksRows - invKsRow;\n\n\t if (invKsRow % 4) {\n\t var t = keySchedule[ksRow];\n\t } else {\n\t var t = keySchedule[ksRow - 4];\n\t }\n\n\t if (invKsRow < 4 || ksRow <= 4) {\n\t invKeySchedule[invKsRow] = t;\n\t } else {\n\t invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^\n\t INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]];\n\t }\n\t }\n\t },\n\n\t encryptBlock: function (M, offset) {\n\t this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX);\n\t },\n\n\t decryptBlock: function (M, offset) {\n\t // Swap 2nd and 4th rows\n\t var t = M[offset + 1];\n\t M[offset + 1] = M[offset + 3];\n\t M[offset + 3] = t;\n\n\t this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX);\n\n\t // Inv swap 2nd and 4th rows\n\t var t = M[offset + 1];\n\t M[offset + 1] = M[offset + 3];\n\t M[offset + 3] = t;\n\t },\n\n\t _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) {\n\t // Shortcut\n\t var nRounds = this._nRounds;\n\n\t // Get input, add round key\n\t var s0 = M[offset] ^ keySchedule[0];\n\t var s1 = M[offset + 1] ^ keySchedule[1];\n\t var s2 = M[offset + 2] ^ keySchedule[2];\n\t var s3 = M[offset + 3] ^ keySchedule[3];\n\n\t // Key schedule row counter\n\t var ksRow = 4;\n\n\t // Rounds\n\t for (var round = 1; round < nRounds; round++) {\n\t // Shift rows, sub bytes, mix columns, add round key\n\t var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++];\n\t var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++];\n\t var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++];\n\t var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++];\n\n\t // Update state\n\t s0 = t0;\n\t s1 = t1;\n\t s2 = t2;\n\t s3 = t3;\n\t }\n\n\t // Shift rows, sub bytes, add round key\n\t var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];\n\t var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];\n\t var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];\n\t var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];\n\n\t // Set output\n\t M[offset] = t0;\n\t M[offset + 1] = t1;\n\t M[offset + 2] = t2;\n\t M[offset + 3] = t3;\n\t },\n\n\t keySize: 256/32\n\t });\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.AES.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.AES.decrypt(ciphertext, key, cfg);\n\t */\n\t C.AES = BlockCipher._createHelper(AES);\n\t}());\n\n\n\treturn CryptoJS.AES;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var C_enc = C.enc;\n\n\t /**\n\t * Base64 encoding strategy.\n\t */\n\t var Base64 = C_enc.Base64 = {\n\t /**\n\t * Converts a word array to a Base64 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The Base64 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var base64String = CryptoJS.enc.Base64.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\t var map = this._map;\n\n\t // Clamp excess bits\n\t wordArray.clamp();\n\n\t // Convert\n\t var base64Chars = [];\n\t for (var i = 0; i < sigBytes; i += 3) {\n\t var byte1 = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;\n\t var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;\n\n\t var triplet = (byte1 << 16) | (byte2 << 8) | byte3;\n\n\t for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {\n\t base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));\n\t }\n\t }\n\n\t // Add padding\n\t var paddingChar = map.charAt(64);\n\t if (paddingChar) {\n\t while (base64Chars.length % 4) {\n\t base64Chars.push(paddingChar);\n\t }\n\t }\n\n\t return base64Chars.join('');\n\t },\n\n\t /**\n\t * Converts a Base64 string to a word array.\n\t *\n\t * @param {string} base64Str The Base64 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Base64.parse(base64String);\n\t */\n\t parse: function (base64Str) {\n\t // Shortcuts\n\t var base64StrLength = base64Str.length;\n\t var map = this._map;\n\t var reverseMap = this._reverseMap;\n\n\t if (!reverseMap) {\n\t reverseMap = this._reverseMap = [];\n\t for (var j = 0; j < map.length; j++) {\n\t reverseMap[map.charCodeAt(j)] = j;\n\t }\n\t }\n\n\t // Ignore padding\n\t var paddingChar = map.charAt(64);\n\t if (paddingChar) {\n\t var paddingIndex = base64Str.indexOf(paddingChar);\n\t if (paddingIndex !== -1) {\n\t base64StrLength = paddingIndex;\n\t }\n\t }\n\n\t // Convert\n\t return parseLoop(base64Str, base64StrLength, reverseMap);\n\n\t },\n\n\t _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='\n\t };\n\n\t function parseLoop(base64Str, base64StrLength, reverseMap) {\n\t var words = [];\n\t var nBytes = 0;\n\t for (var i = 0; i < base64StrLength; i++) {\n\t if (i % 4) {\n\t var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << ((i % 4) * 2);\n\t var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> (6 - (i % 4) * 2);\n\t var bitsCombined = bits1 | bits2;\n\t words[nBytes >>> 2] |= bitsCombined << (24 - (nBytes % 4) * 8);\n\t nBytes++;\n\t }\n\t }\n\t return WordArray.create(words, nBytes);\n\t }\n\t}());\n\n\n\treturn CryptoJS.enc.Base64;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (Math) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Constants table\n\t var T = [];\n\n\t // Compute constants\n\t (function () {\n\t for (var i = 0; i < 64; i++) {\n\t T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;\n\t }\n\t }());\n\n\t /**\n\t * MD5 hash algorithm.\n\t */\n\t var MD5 = C_algo.MD5 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0x67452301, 0xefcdab89,\n\t 0x98badcfe, 0x10325476\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Swap endian\n\t for (var i = 0; i < 16; i++) {\n\t // Shortcuts\n\t var offset_i = offset + i;\n\t var M_offset_i = M[offset_i];\n\n\t M[offset_i] = (\n\t (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |\n\t (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)\n\t );\n\t }\n\n\t // Shortcuts\n\t var H = this._hash.words;\n\n\t var M_offset_0 = M[offset + 0];\n\t var M_offset_1 = M[offset + 1];\n\t var M_offset_2 = M[offset + 2];\n\t var M_offset_3 = M[offset + 3];\n\t var M_offset_4 = M[offset + 4];\n\t var M_offset_5 = M[offset + 5];\n\t var M_offset_6 = M[offset + 6];\n\t var M_offset_7 = M[offset + 7];\n\t var M_offset_8 = M[offset + 8];\n\t var M_offset_9 = M[offset + 9];\n\t var M_offset_10 = M[offset + 10];\n\t var M_offset_11 = M[offset + 11];\n\t var M_offset_12 = M[offset + 12];\n\t var M_offset_13 = M[offset + 13];\n\t var M_offset_14 = M[offset + 14];\n\t var M_offset_15 = M[offset + 15];\n\n\t // Working varialbes\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\n\t // Computation\n\t a = FF(a, b, c, d, M_offset_0, 7, T[0]);\n\t d = FF(d, a, b, c, M_offset_1, 12, T[1]);\n\t c = FF(c, d, a, b, M_offset_2, 17, T[2]);\n\t b = FF(b, c, d, a, M_offset_3, 22, T[3]);\n\t a = FF(a, b, c, d, M_offset_4, 7, T[4]);\n\t d = FF(d, a, b, c, M_offset_5, 12, T[5]);\n\t c = FF(c, d, a, b, M_offset_6, 17, T[6]);\n\t b = FF(b, c, d, a, M_offset_7, 22, T[7]);\n\t a = FF(a, b, c, d, M_offset_8, 7, T[8]);\n\t d = FF(d, a, b, c, M_offset_9, 12, T[9]);\n\t c = FF(c, d, a, b, M_offset_10, 17, T[10]);\n\t b = FF(b, c, d, a, M_offset_11, 22, T[11]);\n\t a = FF(a, b, c, d, M_offset_12, 7, T[12]);\n\t d = FF(d, a, b, c, M_offset_13, 12, T[13]);\n\t c = FF(c, d, a, b, M_offset_14, 17, T[14]);\n\t b = FF(b, c, d, a, M_offset_15, 22, T[15]);\n\n\t a = GG(a, b, c, d, M_offset_1, 5, T[16]);\n\t d = GG(d, a, b, c, M_offset_6, 9, T[17]);\n\t c = GG(c, d, a, b, M_offset_11, 14, T[18]);\n\t b = GG(b, c, d, a, M_offset_0, 20, T[19]);\n\t a = GG(a, b, c, d, M_offset_5, 5, T[20]);\n\t d = GG(d, a, b, c, M_offset_10, 9, T[21]);\n\t c = GG(c, d, a, b, M_offset_15, 14, T[22]);\n\t b = GG(b, c, d, a, M_offset_4, 20, T[23]);\n\t a = GG(a, b, c, d, M_offset_9, 5, T[24]);\n\t d = GG(d, a, b, c, M_offset_14, 9, T[25]);\n\t c = GG(c, d, a, b, M_offset_3, 14, T[26]);\n\t b = GG(b, c, d, a, M_offset_8, 20, T[27]);\n\t a = GG(a, b, c, d, M_offset_13, 5, T[28]);\n\t d = GG(d, a, b, c, M_offset_2, 9, T[29]);\n\t c = GG(c, d, a, b, M_offset_7, 14, T[30]);\n\t b = GG(b, c, d, a, M_offset_12, 20, T[31]);\n\n\t a = HH(a, b, c, d, M_offset_5, 4, T[32]);\n\t d = HH(d, a, b, c, M_offset_8, 11, T[33]);\n\t c = HH(c, d, a, b, M_offset_11, 16, T[34]);\n\t b = HH(b, c, d, a, M_offset_14, 23, T[35]);\n\t a = HH(a, b, c, d, M_offset_1, 4, T[36]);\n\t d = HH(d, a, b, c, M_offset_4, 11, T[37]);\n\t c = HH(c, d, a, b, M_offset_7, 16, T[38]);\n\t b = HH(b, c, d, a, M_offset_10, 23, T[39]);\n\t a = HH(a, b, c, d, M_offset_13, 4, T[40]);\n\t d = HH(d, a, b, c, M_offset_0, 11, T[41]);\n\t c = HH(c, d, a, b, M_offset_3, 16, T[42]);\n\t b = HH(b, c, d, a, M_offset_6, 23, T[43]);\n\t a = HH(a, b, c, d, M_offset_9, 4, T[44]);\n\t d = HH(d, a, b, c, M_offset_12, 11, T[45]);\n\t c = HH(c, d, a, b, M_offset_15, 16, T[46]);\n\t b = HH(b, c, d, a, M_offset_2, 23, T[47]);\n\n\t a = II(a, b, c, d, M_offset_0, 6, T[48]);\n\t d = II(d, a, b, c, M_offset_7, 10, T[49]);\n\t c = II(c, d, a, b, M_offset_14, 15, T[50]);\n\t b = II(b, c, d, a, M_offset_5, 21, T[51]);\n\t a = II(a, b, c, d, M_offset_12, 6, T[52]);\n\t d = II(d, a, b, c, M_offset_3, 10, T[53]);\n\t c = II(c, d, a, b, M_offset_10, 15, T[54]);\n\t b = II(b, c, d, a, M_offset_1, 21, T[55]);\n\t a = II(a, b, c, d, M_offset_8, 6, T[56]);\n\t d = II(d, a, b, c, M_offset_15, 10, T[57]);\n\t c = II(c, d, a, b, M_offset_6, 15, T[58]);\n\t b = II(b, c, d, a, M_offset_13, 21, T[59]);\n\t a = II(a, b, c, d, M_offset_4, 6, T[60]);\n\t d = II(d, a, b, c, M_offset_11, 10, T[61]);\n\t c = II(c, d, a, b, M_offset_2, 15, T[62]);\n\t b = II(b, c, d, a, M_offset_9, 21, T[63]);\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\n\t var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000);\n\t var nBitsTotalL = nBitsTotal;\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (\n\t (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00)\n\t );\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (\n\t (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00)\n\t );\n\n\t data.sigBytes = (dataWords.length + 1) * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Shortcuts\n\t var hash = this._hash;\n\t var H = hash.words;\n\n\t // Swap endian\n\t for (var i = 0; i < 4; i++) {\n\t // Shortcut\n\t var H_i = H[i];\n\n\t H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |\n\t (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);\n\t }\n\n\t // Return final computed hash\n\t return hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t function FF(a, b, c, d, x, s, t) {\n\t var n = a + ((b & c) | (~b & d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function GG(a, b, c, d, x, s, t) {\n\t var n = a + ((b & d) | (c & ~d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function HH(a, b, c, d, x, s, t) {\n\t var n = a + (b ^ c ^ d) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function II(a, b, c, d, x, s, t) {\n\t var n = a + (c ^ (b | ~d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.MD5('message');\n\t * var hash = CryptoJS.MD5(wordArray);\n\t */\n\t C.MD5 = Hasher._createHelper(MD5);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacMD5(message, key);\n\t */\n\t C.HmacMD5 = Hasher._createHmacHelper(MD5);\n\t}(Math));\n\n\n\treturn CryptoJS.MD5;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Reusable object\n\t var W = [];\n\n\t /**\n\t * SHA-1 hash algorithm.\n\t */\n\t var SHA1 = C_algo.SHA1 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0x67452301, 0xefcdab89,\n\t 0x98badcfe, 0x10325476,\n\t 0xc3d2e1f0\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcut\n\t var H = this._hash.words;\n\n\t // Working variables\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\t var e = H[4];\n\n\t // Computation\n\t for (var i = 0; i < 80; i++) {\n\t if (i < 16) {\n\t W[i] = M[offset + i] | 0;\n\t } else {\n\t var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n\t W[i] = (n << 1) | (n >>> 31);\n\t }\n\n\t var t = ((a << 5) | (a >>> 27)) + e + W[i];\n\t if (i < 20) {\n\t t += ((b & c) | (~b & d)) + 0x5a827999;\n\t } else if (i < 40) {\n\t t += (b ^ c ^ d) + 0x6ed9eba1;\n\t } else if (i < 60) {\n\t t += ((b & c) | (b & d) | (c & d)) - 0x70e44324;\n\t } else /* if (i < 80) */ {\n\t t += (b ^ c ^ d) - 0x359d3e2a;\n\t }\n\n\t e = d;\n\t d = c;\n\t c = (b << 30) | (b >>> 2);\n\t b = a;\n\t a = t;\n\t }\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t H[4] = (H[4] + e) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;\n\t data.sigBytes = dataWords.length * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Return final computed hash\n\t return this._hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA1('message');\n\t * var hash = CryptoJS.SHA1(wordArray);\n\t */\n\t C.SHA1 = Hasher._createHelper(SHA1);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA1(message, key);\n\t */\n\t C.HmacSHA1 = Hasher._createHmacHelper(SHA1);\n\t}());\n\n\n\treturn CryptoJS.SHA1;\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var C_enc = C.enc;\n\t var Utf8 = C_enc.Utf8;\n\t var C_algo = C.algo;\n\n\t /**\n\t * HMAC algorithm.\n\t */\n\t var HMAC = C_algo.HMAC = Base.extend({\n\t /**\n\t * Initializes a newly created HMAC.\n\t *\n\t * @param {Hasher} hasher The hash algorithm to use.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @example\n\t *\n\t * var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);\n\t */\n\t init: function (hasher, key) {\n\t // Init hasher\n\t hasher = this._hasher = new hasher.init();\n\n\t // Convert string to WordArray, else assume WordArray already\n\t if (typeof key == 'string') {\n\t key = Utf8.parse(key);\n\t }\n\n\t // Shortcuts\n\t var hasherBlockSize = hasher.blockSize;\n\t var hasherBlockSizeBytes = hasherBlockSize * 4;\n\n\t // Allow arbitrary length keys\n\t if (key.sigBytes > hasherBlockSizeBytes) {\n\t key = hasher.finalize(key);\n\t }\n\n\t // Clamp excess bits\n\t key.clamp();\n\n\t // Clone key for inner and outer pads\n\t var oKey = this._oKey = key.clone();\n\t var iKey = this._iKey = key.clone();\n\n\t // Shortcuts\n\t var oKeyWords = oKey.words;\n\t var iKeyWords = iKey.words;\n\n\t // XOR keys with pad constants\n\t for (var i = 0; i < hasherBlockSize; i++) {\n\t oKeyWords[i] ^= 0x5c5c5c5c;\n\t iKeyWords[i] ^= 0x36363636;\n\t }\n\t oKey.sigBytes = iKey.sigBytes = hasherBlockSizeBytes;\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this HMAC to its initial state.\n\t *\n\t * @example\n\t *\n\t * hmacHasher.reset();\n\t */\n\t reset: function () {\n\t // Shortcut\n\t var hasher = this._hasher;\n\n\t // Reset\n\t hasher.reset();\n\t hasher.update(this._iKey);\n\t },\n\n\t /**\n\t * Updates this HMAC with a message.\n\t *\n\t * @param {WordArray|string} messageUpdate The message to append.\n\t *\n\t * @return {HMAC} This HMAC instance.\n\t *\n\t * @example\n\t *\n\t * hmacHasher.update('message');\n\t * hmacHasher.update(wordArray);\n\t */\n\t update: function (messageUpdate) {\n\t this._hasher.update(messageUpdate);\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Finalizes the HMAC computation.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} messageUpdate (Optional) A final message update.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @example\n\t *\n\t * var hmac = hmacHasher.finalize();\n\t * var hmac = hmacHasher.finalize('message');\n\t * var hmac = hmacHasher.finalize(wordArray);\n\t */\n\t finalize: function (messageUpdate) {\n\t // Shortcut\n\t var hasher = this._hasher;\n\n\t // Compute HMAC\n\t var innerHash = hasher.finalize(messageUpdate);\n\t hasher.reset();\n\t var hmac = hasher.finalize(this._oKey.clone().concat(innerHash));\n\n\t return hmac;\n\t }\n\t });\n\t}());\n\n\n}));",";(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"), require(\"./evpkdf\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./evpkdf\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Cipher core components.\n\t */\n\tCryptoJS.lib.Cipher || (function (undefined) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm;\n\t var C_enc = C.enc;\n\t var Utf8 = C_enc.Utf8;\n\t var Base64 = C_enc.Base64;\n\t var C_algo = C.algo;\n\t var EvpKDF = C_algo.EvpKDF;\n\n\t /**\n\t * Abstract base cipher template.\n\t *\n\t * @property {number} keySize This cipher's key size. Default: 4 (128 bits)\n\t * @property {number} ivSize This cipher's IV size. Default: 4 (128 bits)\n\t * @property {number} _ENC_XFORM_MODE A constant representing encryption mode.\n\t * @property {number} _DEC_XFORM_MODE A constant representing decryption mode.\n\t */\n\t var Cipher = C_lib.Cipher = BufferedBlockAlgorithm.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {WordArray} iv The IV to use for this operation.\n\t */\n\t cfg: Base.extend(),\n\n\t /**\n\t * Creates this cipher in encryption mode.\n\t *\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {Cipher} A cipher instance.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });\n\t */\n\t createEncryptor: function (key, cfg) {\n\t return this.create(this._ENC_XFORM_MODE, key, cfg);\n\t },\n\n\t /**\n\t * Creates this cipher in decryption mode.\n\t *\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {Cipher} A cipher instance.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });\n\t */\n\t createDecryptor: function (key, cfg) {\n\t return this.create(this._DEC_XFORM_MODE, key, cfg);\n\t },\n\n\t /**\n\t * Initializes a newly created cipher.\n\t *\n\t * @param {number} xformMode Either the encryption or decryption transormation mode constant.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });\n\t */\n\t init: function (xformMode, key, cfg) {\n\t // Apply config defaults\n\t this.cfg = this.cfg.extend(cfg);\n\n\t // Store transform mode and key\n\t this._xformMode = xformMode;\n\t this._key = key;\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this cipher to its initial state.\n\t *\n\t * @example\n\t *\n\t * cipher.reset();\n\t */\n\t reset: function () {\n\t // Reset data buffer\n\t BufferedBlockAlgorithm.reset.call(this);\n\n\t // Perform concrete-cipher logic\n\t this._doReset();\n\t },\n\n\t /**\n\t * Adds data to be encrypted or decrypted.\n\t *\n\t * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.\n\t *\n\t * @return {WordArray} The data after processing.\n\t *\n\t * @example\n\t *\n\t * var encrypted = cipher.process('data');\n\t * var encrypted = cipher.process(wordArray);\n\t */\n\t process: function (dataUpdate) {\n\t // Append\n\t this._append(dataUpdate);\n\n\t // Process available blocks\n\t return this._process();\n\t },\n\n\t /**\n\t * Finalizes the encryption or decryption process.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.\n\t *\n\t * @return {WordArray} The data after final processing.\n\t *\n\t * @example\n\t *\n\t * var encrypted = cipher.finalize();\n\t * var encrypted = cipher.finalize('data');\n\t * var encrypted = cipher.finalize(wordArray);\n\t */\n\t finalize: function (dataUpdate) {\n\t // Final data update\n\t if (dataUpdate) {\n\t this._append(dataUpdate);\n\t }\n\n\t // Perform concrete-cipher logic\n\t var finalProcessedData = this._doFinalize();\n\n\t return finalProcessedData;\n\t },\n\n\t keySize: 128/32,\n\n\t ivSize: 128/32,\n\n\t _ENC_XFORM_MODE: 1,\n\n\t _DEC_XFORM_MODE: 2,\n\n\t /**\n\t * Creates shortcut functions to a cipher's object interface.\n\t *\n\t * @param {Cipher} cipher The cipher to create a helper for.\n\t *\n\t * @return {Object} An object with encrypt and decrypt shortcut functions.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);\n\t */\n\t _createHelper: (function () {\n\t function selectCipherStrategy(key) {\n\t if (typeof key == 'string') {\n\t return PasswordBasedCipher;\n\t } else {\n\t return SerializableCipher;\n\t }\n\t }\n\n\t return function (cipher) {\n\t return {\n\t encrypt: function (message, key, cfg) {\n\t return selectCipherStrategy(key).encrypt(cipher, message, key, cfg);\n\t },\n\n\t decrypt: function (ciphertext, key, cfg) {\n\t return selectCipherStrategy(key).decrypt(cipher, ciphertext, key, cfg);\n\t }\n\t };\n\t };\n\t }())\n\t });\n\n\t /**\n\t * Abstract base stream cipher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 1 (32 bits)\n\t */\n\t var StreamCipher = C_lib.StreamCipher = Cipher.extend({\n\t _doFinalize: function () {\n\t // Process partial blocks\n\t var finalProcessedBlocks = this._process(!!'flush');\n\n\t return finalProcessedBlocks;\n\t },\n\n\t blockSize: 1\n\t });\n\n\t /**\n\t * Mode namespace.\n\t */\n\t var C_mode = C.mode = {};\n\n\t /**\n\t * Abstract base block cipher mode template.\n\t */\n\t var BlockCipherMode = C_lib.BlockCipherMode = Base.extend({\n\t /**\n\t * Creates this mode for encryption.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);\n\t */\n\t createEncryptor: function (cipher, iv) {\n\t return this.Encryptor.create(cipher, iv);\n\t },\n\n\t /**\n\t * Creates this mode for decryption.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);\n\t */\n\t createDecryptor: function (cipher, iv) {\n\t return this.Decryptor.create(cipher, iv);\n\t },\n\n\t /**\n\t * Initializes a newly created mode.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);\n\t */\n\t init: function (cipher, iv) {\n\t this._cipher = cipher;\n\t this._iv = iv;\n\t }\n\t });\n\n\t /**\n\t * Cipher Block Chaining mode.\n\t */\n\t var CBC = C_mode.CBC = (function () {\n\t /**\n\t * Abstract base CBC mode.\n\t */\n\t var CBC = BlockCipherMode.extend();\n\n\t /**\n\t * CBC encryptor.\n\t */\n\t CBC.Encryptor = CBC.extend({\n\t /**\n\t * Processes the data block at offset.\n\t *\n\t * @param {Array} words The data words to operate on.\n\t * @param {number} offset The offset where the block starts.\n\t *\n\t * @example\n\t *\n\t * mode.processBlock(data.words, offset);\n\t */\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // XOR and encrypt\n\t xorBlock.call(this, words, offset, blockSize);\n\t cipher.encryptBlock(words, offset);\n\n\t // Remember this block to use with next block\n\t this._prevBlock = words.slice(offset, offset + blockSize);\n\t }\n\t });\n\n\t /**\n\t * CBC decryptor.\n\t */\n\t CBC.Decryptor = CBC.extend({\n\t /**\n\t * Processes the data block at offset.\n\t *\n\t * @param {Array} words The data words to operate on.\n\t * @param {number} offset The offset where the block starts.\n\t *\n\t * @example\n\t *\n\t * mode.processBlock(data.words, offset);\n\t */\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // Remember this block to use with next block\n\t var thisBlock = words.slice(offset, offset + blockSize);\n\n\t // Decrypt and XOR\n\t cipher.decryptBlock(words, offset);\n\t xorBlock.call(this, words, offset, blockSize);\n\n\t // This block becomes the previous block\n\t this._prevBlock = thisBlock;\n\t }\n\t });\n\n\t function xorBlock(words, offset, blockSize) {\n\t var block;\n\n\t // Shortcut\n\t var iv = this._iv;\n\n\t // Choose mixing block\n\t if (iv) {\n\t block = iv;\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t } else {\n\t block = this._prevBlock;\n\t }\n\n\t // XOR blocks\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= block[i];\n\t }\n\t }\n\n\t return CBC;\n\t }());\n\n\t /**\n\t * Padding namespace.\n\t */\n\t var C_pad = C.pad = {};\n\n\t /**\n\t * PKCS #5/7 padding strategy.\n\t */\n\t var Pkcs7 = C_pad.Pkcs7 = {\n\t /**\n\t * Pads data using the algorithm defined in PKCS #5/7.\n\t *\n\t * @param {WordArray} data The data to pad.\n\t * @param {number} blockSize The multiple that the data should be padded to.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * CryptoJS.pad.Pkcs7.pad(wordArray, 4);\n\t */\n\t pad: function (data, blockSize) {\n\t // Shortcut\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count padding bytes\n\t var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;\n\n\t // Create padding word\n\t var paddingWord = (nPaddingBytes << 24) | (nPaddingBytes << 16) | (nPaddingBytes << 8) | nPaddingBytes;\n\n\t // Create padding\n\t var paddingWords = [];\n\t for (var i = 0; i < nPaddingBytes; i += 4) {\n\t paddingWords.push(paddingWord);\n\t }\n\t var padding = WordArray.create(paddingWords, nPaddingBytes);\n\n\t // Add padding\n\t data.concat(padding);\n\t },\n\n\t /**\n\t * Unpads data that had been padded using the algorithm defined in PKCS #5/7.\n\t *\n\t * @param {WordArray} data The data to unpad.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * CryptoJS.pad.Pkcs7.unpad(wordArray);\n\t */\n\t unpad: function (data) {\n\t // Get number of padding bytes from last byte\n\t var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;\n\n\t // Remove padding\n\t data.sigBytes -= nPaddingBytes;\n\t }\n\t };\n\n\t /**\n\t * Abstract base block cipher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 4 (128 bits)\n\t */\n\t var BlockCipher = C_lib.BlockCipher = Cipher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {Mode} mode The block mode to use. Default: CBC\n\t * @property {Padding} padding The padding strategy to use. Default: Pkcs7\n\t */\n\t cfg: Cipher.cfg.extend({\n\t mode: CBC,\n\t padding: Pkcs7\n\t }),\n\n\t reset: function () {\n\t var modeCreator;\n\n\t // Reset cipher\n\t Cipher.reset.call(this);\n\n\t // Shortcuts\n\t var cfg = this.cfg;\n\t var iv = cfg.iv;\n\t var mode = cfg.mode;\n\n\t // Reset block mode\n\t if (this._xformMode == this._ENC_XFORM_MODE) {\n\t modeCreator = mode.createEncryptor;\n\t } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {\n\t modeCreator = mode.createDecryptor;\n\t // Keep at least one block in the buffer for unpadding\n\t this._minBufferSize = 1;\n\t }\n\n\t if (this._mode && this._mode.__creator == modeCreator) {\n\t this._mode.init(this, iv && iv.words);\n\t } else {\n\t this._mode = modeCreator.call(mode, this, iv && iv.words);\n\t this._mode.__creator = modeCreator;\n\t }\n\t },\n\n\t _doProcessBlock: function (words, offset) {\n\t this._mode.processBlock(words, offset);\n\t },\n\n\t _doFinalize: function () {\n\t var finalProcessedBlocks;\n\n\t // Shortcut\n\t var padding = this.cfg.padding;\n\n\t // Finalize\n\t if (this._xformMode == this._ENC_XFORM_MODE) {\n\t // Pad data\n\t padding.pad(this._data, this.blockSize);\n\n\t // Process final blocks\n\t finalProcessedBlocks = this._process(!!'flush');\n\t } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {\n\t // Process final blocks\n\t finalProcessedBlocks = this._process(!!'flush');\n\n\t // Unpad data\n\t padding.unpad(finalProcessedBlocks);\n\t }\n\n\t return finalProcessedBlocks;\n\t },\n\n\t blockSize: 128/32\n\t });\n\n\t /**\n\t * A collection of cipher parameters.\n\t *\n\t * @property {WordArray} ciphertext The raw ciphertext.\n\t * @property {WordArray} key The key to this ciphertext.\n\t * @property {WordArray} iv The IV used in the ciphering operation.\n\t * @property {WordArray} salt The salt used with a key derivation function.\n\t * @property {Cipher} algorithm The cipher algorithm.\n\t * @property {Mode} mode The block mode used in the ciphering operation.\n\t * @property {Padding} padding The padding scheme used in the ciphering operation.\n\t * @property {number} blockSize The block size of the cipher.\n\t * @property {Format} formatter The default formatting strategy to convert this cipher params object to a string.\n\t */\n\t var CipherParams = C_lib.CipherParams = Base.extend({\n\t /**\n\t * Initializes a newly created cipher params object.\n\t *\n\t * @param {Object} cipherParams An object with any of the possible cipher parameters.\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.lib.CipherParams.create({\n\t * ciphertext: ciphertextWordArray,\n\t * key: keyWordArray,\n\t * iv: ivWordArray,\n\t * salt: saltWordArray,\n\t * algorithm: CryptoJS.algo.AES,\n\t * mode: CryptoJS.mode.CBC,\n\t * padding: CryptoJS.pad.PKCS7,\n\t * blockSize: 4,\n\t * formatter: CryptoJS.format.OpenSSL\n\t * });\n\t */\n\t init: function (cipherParams) {\n\t this.mixIn(cipherParams);\n\t },\n\n\t /**\n\t * Converts this cipher params object to a string.\n\t *\n\t * @param {Format} formatter (Optional) The formatting strategy to use.\n\t *\n\t * @return {string} The stringified cipher params.\n\t *\n\t * @throws Error If neither the formatter nor the default formatter is set.\n\t *\n\t * @example\n\t *\n\t * var string = cipherParams + '';\n\t * var string = cipherParams.toString();\n\t * var string = cipherParams.toString(CryptoJS.format.OpenSSL);\n\t */\n\t toString: function (formatter) {\n\t return (formatter || this.formatter).stringify(this);\n\t }\n\t });\n\n\t /**\n\t * Format namespace.\n\t */\n\t var C_format = C.format = {};\n\n\t /**\n\t * OpenSSL formatting strategy.\n\t */\n\t var OpenSSLFormatter = C_format.OpenSSL = {\n\t /**\n\t * Converts a cipher params object to an OpenSSL-compatible string.\n\t *\n\t * @param {CipherParams} cipherParams The cipher params object.\n\t *\n\t * @return {string} The OpenSSL-compatible string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);\n\t */\n\t stringify: function (cipherParams) {\n\t var wordArray;\n\n\t // Shortcuts\n\t var ciphertext = cipherParams.ciphertext;\n\t var salt = cipherParams.salt;\n\n\t // Format\n\t if (salt) {\n\t wordArray = WordArray.create([0x53616c74, 0x65645f5f]).concat(salt).concat(ciphertext);\n\t } else {\n\t wordArray = ciphertext;\n\t }\n\n\t return wordArray.toString(Base64);\n\t },\n\n\t /**\n\t * Converts an OpenSSL-compatible string to a cipher params object.\n\t *\n\t * @param {string} openSSLStr The OpenSSL-compatible string.\n\t *\n\t * @return {CipherParams} The cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);\n\t */\n\t parse: function (openSSLStr) {\n\t var salt;\n\n\t // Parse base64\n\t var ciphertext = Base64.parse(openSSLStr);\n\n\t // Shortcut\n\t var ciphertextWords = ciphertext.words;\n\n\t // Test for salt\n\t if (ciphertextWords[0] == 0x53616c74 && ciphertextWords[1] == 0x65645f5f) {\n\t // Extract salt\n\t salt = WordArray.create(ciphertextWords.slice(2, 4));\n\n\t // Remove salt from ciphertext\n\t ciphertextWords.splice(0, 4);\n\t ciphertext.sigBytes -= 16;\n\t }\n\n\t return CipherParams.create({ ciphertext: ciphertext, salt: salt });\n\t }\n\t };\n\n\t /**\n\t * A cipher wrapper that returns ciphertext as a serializable cipher params object.\n\t */\n\t var SerializableCipher = C_lib.SerializableCipher = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL\n\t */\n\t cfg: Base.extend({\n\t format: OpenSSLFormatter\n\t }),\n\n\t /**\n\t * Encrypts a message.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {WordArray|string} message The message to encrypt.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {CipherParams} A cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t */\n\t encrypt: function (cipher, message, key, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Encrypt\n\t var encryptor = cipher.createEncryptor(key, cfg);\n\t var ciphertext = encryptor.finalize(message);\n\n\t // Shortcut\n\t var cipherCfg = encryptor.cfg;\n\n\t // Create and return serializable cipher params\n\t return CipherParams.create({\n\t ciphertext: ciphertext,\n\t key: key,\n\t iv: cipherCfg.iv,\n\t algorithm: cipher,\n\t mode: cipherCfg.mode,\n\t padding: cipherCfg.padding,\n\t blockSize: cipher.blockSize,\n\t formatter: cfg.format\n\t });\n\t },\n\n\t /**\n\t * Decrypts serialized ciphertext.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {CipherParams|string} ciphertext The ciphertext to decrypt.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {WordArray} The plaintext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t */\n\t decrypt: function (cipher, ciphertext, key, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Convert string to CipherParams\n\t ciphertext = this._parse(ciphertext, cfg.format);\n\n\t // Decrypt\n\t var plaintext = cipher.createDecryptor(key, cfg).finalize(ciphertext.ciphertext);\n\n\t return plaintext;\n\t },\n\n\t /**\n\t * Converts serialized ciphertext to CipherParams,\n\t * else assumed CipherParams already and returns ciphertext unchanged.\n\t *\n\t * @param {CipherParams|string} ciphertext The ciphertext.\n\t * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.\n\t *\n\t * @return {CipherParams} The unserialized ciphertext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);\n\t */\n\t _parse: function (ciphertext, format) {\n\t if (typeof ciphertext == 'string') {\n\t return format.parse(ciphertext, this);\n\t } else {\n\t return ciphertext;\n\t }\n\t }\n\t });\n\n\t /**\n\t * Key derivation function namespace.\n\t */\n\t var C_kdf = C.kdf = {};\n\n\t /**\n\t * OpenSSL key derivation function.\n\t */\n\t var OpenSSLKdf = C_kdf.OpenSSL = {\n\t /**\n\t * Derives a key and IV from a password.\n\t *\n\t * @param {string} password The password to derive from.\n\t * @param {number} keySize The size in words of the key to generate.\n\t * @param {number} ivSize The size in words of the IV to generate.\n\t * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.\n\t *\n\t * @return {CipherParams} A cipher params object with the key, IV, and salt.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);\n\t * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');\n\t */\n\t execute: function (password, keySize, ivSize, salt) {\n\t // Generate random salt\n\t if (!salt) {\n\t salt = WordArray.random(64/8);\n\t }\n\n\t // Derive key and IV\n\t var key = EvpKDF.create({ keySize: keySize + ivSize }).compute(password, salt);\n\n\t // Separate key and IV\n\t var iv = WordArray.create(key.words.slice(keySize), ivSize * 4);\n\t key.sigBytes = keySize * 4;\n\n\t // Return params\n\t return CipherParams.create({ key: key, iv: iv, salt: salt });\n\t }\n\t };\n\n\t /**\n\t * A serializable cipher wrapper that derives the key from a password,\n\t * and returns ciphertext as a serializable cipher params object.\n\t */\n\t var PasswordBasedCipher = C_lib.PasswordBasedCipher = SerializableCipher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL\n\t */\n\t cfg: SerializableCipher.cfg.extend({\n\t kdf: OpenSSLKdf\n\t }),\n\n\t /**\n\t * Encrypts a message using a password.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {WordArray|string} message The message to encrypt.\n\t * @param {string} password The password.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {CipherParams} A cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');\n\t * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });\n\t */\n\t encrypt: function (cipher, message, password, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Derive key and other params\n\t var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize);\n\n\t // Add IV to config\n\t cfg.iv = derivedParams.iv;\n\n\t // Encrypt\n\t var ciphertext = SerializableCipher.encrypt.call(this, cipher, message, derivedParams.key, cfg);\n\n\t // Mix in derived params\n\t ciphertext.mixIn(derivedParams);\n\n\t return ciphertext;\n\t },\n\n\t /**\n\t * Decrypts serialized ciphertext using a password.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {CipherParams|string} ciphertext The ciphertext to decrypt.\n\t * @param {string} password The password.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {WordArray} The plaintext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });\n\t * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });\n\t */\n\t decrypt: function (cipher, ciphertext, password, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Convert string to CipherParams\n\t ciphertext = this._parse(ciphertext, cfg.format);\n\n\t // Derive key and other params\n\t var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize, ciphertext.salt);\n\n\t // Add IV to config\n\t cfg.iv = derivedParams.iv;\n\n\t // Decrypt\n\t var plaintext = SerializableCipher.decrypt.call(this, cipher, ciphertext, derivedParams.key, cfg);\n\n\t return plaintext;\n\t }\n\t });\n\t}());\n\n\n}));",";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\treturn CryptoJS.enc.Utf8;\n\n}));","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [0];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this._strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // '0' - '9'\n if (c >= 48 && c <= 57) {\n return c - 48;\n // 'A' - 'F'\n } else if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n } else {\n assert(false, 'Invalid character in ' + string);\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this._strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var b = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n b = c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n b = c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n b = c;\n }\n assert(c >= 0 && b < mul, 'Invalid character');\n r += b;\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [0];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this._strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n function move (dest, src) {\n dest.words = src.words;\n dest.length = src.length;\n dest.negative = src.negative;\n dest.red = src.red;\n }\n\n BN.prototype._move = function _move (dest) {\n move(dest, this);\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype._strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n // Check Symbol.for because not everywhere where Symbol defined\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n try {\n BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n } catch (e) {\n BN.prototype.inspect = inspect;\n }\n } else {\n BN.prototype.inspect = inspect;\n }\n\n function inspect () {\n return (this.red ? '';\n }\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modrn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16, 2);\n };\n\n if (Buffer) {\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n return this.toArrayLike(Buffer, endian, length);\n };\n }\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n var allocate = function allocate (ArrayType, size) {\n if (ArrayType.allocUnsafe) {\n return ArrayType.allocUnsafe(size);\n }\n return new ArrayType(size);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n this._strip();\n\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n var res = allocate(ArrayType, reqLength);\n var postfix = endian === 'le' ? 'LE' : 'BE';\n this['_toArrayLike' + postfix](res, byteLength);\n return res;\n };\n\n BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n var position = 0;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position++] = word & 0xff;\n if (position < res.length) {\n res[position++] = (word >> 8) & 0xff;\n }\n if (position < res.length) {\n res[position++] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position < res.length) {\n res[position++] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position < res.length) {\n res[position++] = carry;\n\n while (position < res.length) {\n res[position++] = 0;\n }\n }\n };\n\n BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n var position = res.length - 1;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position--] = word & 0xff;\n if (position >= 0) {\n res[position--] = (word >> 8) & 0xff;\n }\n if (position >= 0) {\n res[position--] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position >= 0) {\n res[position--] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position >= 0) {\n res[position--] = carry;\n\n while (position >= 0) {\n res[position--] = 0;\n }\n }\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] >>> wbit) & 0x01;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this._strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this._strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this._strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this._strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this._strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this._strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n function jumboMulTo (self, num, out) {\n // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n // var fftm = new FFTM();\n // return fftm.mulp(self, num, out);\n return bigMulTo(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out._strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this._strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) <= num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this._strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this._strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this._strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q._strip();\n }\n a._strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modrn = function modrn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return isNegNum ? -acc : acc;\n };\n\n // WARNING: DEPRECATED\n BN.prototype.modn = function modn (num) {\n return this.modrn(num);\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n this._strip();\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this._strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is a BN v4 instance\n r.strip();\n } else {\n // r is a BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n move(a, a.umod(this.m)._forceRed(this));\n return a;\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n","exports.publicEncrypt = require('./publicEncrypt')\nexports.privateDecrypt = require('./privateDecrypt')\n\nexports.privateEncrypt = function privateEncrypt (key, buf) {\n return exports.publicEncrypt(key, buf, true)\n}\n\nexports.publicDecrypt = function publicDecrypt (key, buf) {\n return exports.privateDecrypt(key, buf, true)\n}\n","\"use strict\";\nvar protobuf = module.exports = require(\"./index-minimal\");\n\nprotobuf.build = \"light\";\n\n/**\n * A node-style callback as used by {@link load} and {@link Root#load}.\n * @typedef LoadCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Root} [root] Root, if there hasn't been an error\n * @returns {undefined}\n */\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} root Root namespace, defaults to create a new one if omitted.\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n */\nfunction load(filename, root, callback) {\n if (typeof root === \"function\") {\n callback = root;\n root = new protobuf.Root();\n } else if (!root)\n root = new protobuf.Root();\n return root.load(filename, callback);\n}\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Promise} Promise\n * @see {@link Root#load}\n * @variation 3\n */\n// function load(filename:string, [root:Root]):Promise\n\nprotobuf.load = load;\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only).\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n * @see {@link Root#loadSync}\n */\nfunction loadSync(filename, root) {\n if (!root)\n root = new protobuf.Root();\n return root.loadSync(filename);\n}\n\nprotobuf.loadSync = loadSync;\n\n// Serialization\nprotobuf.encoder = require(\"./encoder\");\nprotobuf.decoder = require(\"./decoder\");\nprotobuf.verifier = require(\"./verifier\");\nprotobuf.converter = require(\"./converter\");\n\n// Reflection\nprotobuf.ReflectionObject = require(\"./object\");\nprotobuf.Namespace = require(\"./namespace\");\nprotobuf.Root = require(\"./root\");\nprotobuf.Enum = require(\"./enum\");\nprotobuf.Type = require(\"./type\");\nprotobuf.Field = require(\"./field\");\nprotobuf.OneOf = require(\"./oneof\");\nprotobuf.MapField = require(\"./mapfield\");\nprotobuf.Service = require(\"./service\");\nprotobuf.Method = require(\"./method\");\n\n// Runtime\nprotobuf.Message = require(\"./message\");\nprotobuf.wrappers = require(\"./wrappers\");\n\n// Utility\nprotobuf.types = require(\"./types\");\nprotobuf.util = require(\"./util\");\n\n// Set up possibly cyclic reflection dependencies\nprotobuf.ReflectionObject._configure(protobuf.Root);\nprotobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum);\nprotobuf.Root._configure(protobuf.Type);\nprotobuf.Field._configure(protobuf.Type);\n","\"use strict\";\nvar protobuf = exports;\n\n/**\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\n * @name build\n * @type {string}\n * @const\n */\nprotobuf.build = \"minimal\";\n\n// Serialization\nprotobuf.Writer = require(\"./writer\");\nprotobuf.BufferWriter = require(\"./writer_buffer\");\nprotobuf.Reader = require(\"./reader\");\nprotobuf.BufferReader = require(\"./reader_buffer\");\n\n// Utility\nprotobuf.util = require(\"./util/minimal\");\nprotobuf.rpc = require(\"./rpc\");\nprotobuf.roots = require(\"./roots\");\nprotobuf.configure = configure;\n\n/* istanbul ignore next */\n/**\n * Reconfigures the library according to the environment.\n * @returns {undefined}\n */\nfunction configure() {\n protobuf.Reader._configure(protobuf.BufferReader);\n protobuf.util._configure();\n}\n\n// Set up buffer utility according to the environment\nprotobuf.Writer._configure(protobuf.BufferWriter);\nconfigure();\n","\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n var p = string.length;\r\n if (!p)\r\n return 0;\r\n var n = 0;\r\n while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n ++n;\r\n return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n var parts = null,\r\n chunk = [];\r\n var i = 0, // output index\r\n j = 0, // goto index\r\n t; // temporary\r\n while (start < end) {\r\n var b = buffer[start++];\r\n switch (j) {\r\n case 0:\r\n chunk[i++] = b64[b >> 2];\r\n t = (b & 3) << 4;\r\n j = 1;\r\n break;\r\n case 1:\r\n chunk[i++] = b64[t | b >> 4];\r\n t = (b & 15) << 2;\r\n j = 2;\r\n break;\r\n case 2:\r\n chunk[i++] = b64[t | b >> 6];\r\n chunk[i++] = b64[b & 63];\r\n j = 0;\r\n break;\r\n }\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (j) {\r\n chunk[i++] = b64[t];\r\n chunk[i++] = 61;\r\n if (j === 1)\r\n chunk[i++] = 61;\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n var start = offset;\r\n var j = 0, // goto index\r\n t; // temporary\r\n for (var i = 0; i < string.length;) {\r\n var c = string.charCodeAt(i++);\r\n if (c === 61 && j > 1)\r\n break;\r\n if ((c = s64[c]) === undefined)\r\n throw Error(invalidEncoding);\r\n switch (j) {\r\n case 0:\r\n t = c;\r\n j = 1;\r\n break;\r\n case 1:\r\n buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n t = c;\r\n j = 2;\r\n break;\r\n case 2:\r\n buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n t = c;\r\n j = 3;\r\n break;\r\n case 3:\r\n buffer[offset++] = (t & 3) << 6 | c;\r\n j = 0;\r\n break;\r\n }\r\n }\r\n if (j === 1)\r\n throw Error(invalidEncoding);\r\n return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n","\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n /**\r\n * Registered listeners.\r\n * @type {Object.}\r\n * @private\r\n */\r\n this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n fn : fn,\r\n ctx : ctx || this\r\n });\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n if (evt === undefined)\r\n this._listeners = {};\r\n else {\r\n if (fn === undefined)\r\n this._listeners[evt] = [];\r\n else {\r\n var listeners = this._listeners[evt];\r\n for (var i = 0; i < listeners.length;)\r\n if (listeners[i].fn === fn)\r\n listeners.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n var listeners = this._listeners[evt];\r\n if (listeners) {\r\n var args = [],\r\n i = 1;\r\n for (; i < arguments.length;)\r\n args.push(arguments[i++]);\r\n for (i = 0; i < listeners.length;)\r\n listeners[i].fn.apply(listeners[i++].ctx, args);\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n // float: typed array\r\n if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n var f32 = new Float32Array([ -0 ]),\r\n f8b = new Uint8Array(f32.buffer),\r\n le = f8b[3] === 128;\r\n\r\n function writeFloat_f32_cpy(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n }\r\n\r\n function writeFloat_f32_rev(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[3];\r\n buf[pos + 1] = f8b[2];\r\n buf[pos + 2] = f8b[1];\r\n buf[pos + 3] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n function readFloat_f32_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n function readFloat_f32_rev(buf, pos) {\r\n f8b[3] = buf[pos ];\r\n f8b[2] = buf[pos + 1];\r\n f8b[1] = buf[pos + 2];\r\n f8b[0] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n // float: ieee754\r\n })(); else (function() {\r\n\r\n function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0)\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n else if (isNaN(val))\r\n writeUint(2143289344, buf, pos);\r\n else if (val > 3.4028234663852886e+38) // +-Infinity\r\n writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n else if (val < 1.1754943508222875e-38) // denormal\r\n writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n }\r\n }\r\n\r\n exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n function readFloat_ieee754(readUint, buf, pos) {\r\n var uint = readUint(buf, pos),\r\n sign = (uint >> 31) * 2 + 1,\r\n exponent = uint >>> 23 & 255,\r\n mantissa = uint & 8388607;\r\n return exponent === 255\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 1.401298464324817e-45 * mantissa\r\n : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n }\r\n\r\n exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n })();\r\n\r\n // double: typed array\r\n if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n var f64 = new Float64Array([-0]),\r\n f8b = new Uint8Array(f64.buffer),\r\n le = f8b[7] === 128;\r\n\r\n function writeDouble_f64_cpy(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n buf[pos + 4] = f8b[4];\r\n buf[pos + 5] = f8b[5];\r\n buf[pos + 6] = f8b[6];\r\n buf[pos + 7] = f8b[7];\r\n }\r\n\r\n function writeDouble_f64_rev(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[7];\r\n buf[pos + 1] = f8b[6];\r\n buf[pos + 2] = f8b[5];\r\n buf[pos + 3] = f8b[4];\r\n buf[pos + 4] = f8b[3];\r\n buf[pos + 5] = f8b[2];\r\n buf[pos + 6] = f8b[1];\r\n buf[pos + 7] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n function readDouble_f64_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n f8b[4] = buf[pos + 4];\r\n f8b[5] = buf[pos + 5];\r\n f8b[6] = buf[pos + 6];\r\n f8b[7] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n function readDouble_f64_rev(buf, pos) {\r\n f8b[7] = buf[pos ];\r\n f8b[6] = buf[pos + 1];\r\n f8b[5] = buf[pos + 2];\r\n f8b[4] = buf[pos + 3];\r\n f8b[3] = buf[pos + 4];\r\n f8b[2] = buf[pos + 5];\r\n f8b[1] = buf[pos + 6];\r\n f8b[0] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n // double: ieee754\r\n })(); else (function() {\r\n\r\n function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n } else if (isNaN(val)) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(2146959360, buf, pos + off1);\r\n } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n writeUint(0, buf, pos + off0);\r\n writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n } else {\r\n var mantissa;\r\n if (val < 2.2250738585072014e-308) { // denormal\r\n mantissa = val / 5e-324;\r\n writeUint(mantissa >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n } else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n if (exponent === 1024)\r\n exponent = 1023;\r\n mantissa = val * Math.pow(2, -exponent);\r\n writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n }\r\n }\r\n }\r\n\r\n exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n var lo = readUint(buf, pos + off0),\r\n hi = readUint(buf, pos + off1);\r\n var sign = (hi >> 31) * 2 + 1,\r\n exponent = hi >>> 20 & 2047,\r\n mantissa = 4294967296 * (hi & 1048575) + lo;\r\n return exponent === 2047\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 5e-324 * mantissa\r\n : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n }\r\n\r\n exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n })();\r\n\r\n return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n buf[pos ] = val >>> 24;\r\n buf[pos + 1] = val >>> 16 & 255;\r\n buf[pos + 2] = val >>> 8 & 255;\r\n buf[pos + 3] = val & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n return (buf[pos ]\r\n | buf[pos + 1] << 8\r\n | buf[pos + 2] << 16\r\n | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n return (buf[pos ] << 24\r\n | buf[pos + 1] << 16\r\n | buf[pos + 2] << 8\r\n | buf[pos + 3]) >>> 0;\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n var len = 0,\r\n c = 0;\r\n for (var i = 0; i < string.length; ++i) {\r\n c = string.charCodeAt(i);\r\n if (c < 128)\r\n len += 1;\r\n else if (c < 2048)\r\n len += 2;\r\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n ++i;\r\n len += 4;\r\n } else\r\n len += 3;\r\n }\r\n return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n var len = end - start;\r\n if (len < 1)\r\n return \"\";\r\n var parts = null,\r\n chunk = [],\r\n i = 0, // char offset\r\n t; // temporary\r\n while (start < end) {\r\n t = buffer[start++];\r\n if (t < 128)\r\n chunk[i++] = t;\r\n else if (t > 191 && t < 224)\r\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n else if (t > 239 && t < 365) {\r\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n chunk[i++] = 0xD800 + (t >> 10);\r\n chunk[i++] = 0xDC00 + (t & 1023);\r\n } else\r\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n var start = offset,\r\n c1, // character 1\r\n c2; // character 2\r\n for (var i = 0; i < string.length; ++i) {\r\n c1 = string.charCodeAt(i);\r\n if (c1 < 128) {\r\n buffer[offset++] = c1;\r\n } else if (c1 < 2048) {\r\n buffer[offset++] = c1 >> 6 | 192;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n ++i;\r\n buffer[offset++] = c1 >> 18 | 240;\r\n buffer[offset++] = c1 >> 12 & 63 | 128;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else {\r\n buffer[offset++] = c1 >> 12 | 224;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n }\r\n }\r\n return offset - start;\r\n};\r\n","\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n var SIZE = size || 8192;\r\n var MAX = SIZE >>> 1;\r\n var slab = null;\r\n var offset = SIZE;\r\n return function pool_alloc(size) {\r\n if (size < 1 || size > MAX)\r\n return alloc(size);\r\n if (offset + size > SIZE) {\r\n slab = alloc(SIZE);\r\n offset = 0;\r\n }\r\n var buf = slice.call(slab, offset, offset += size);\r\n if (offset & 7) // align to 32 bit\r\n offset = (offset | 7) + 1;\r\n return buf;\r\n };\r\n}\r\n","\"use strict\";\nmodule.exports = LongBits;\n\nvar util = require(\"../util/minimal\");\n\n/**\n * Constructs new long bits.\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @constructor\n * @param {number} lo Low 32 bits, unsigned\n * @param {number} hi High 32 bits, unsigned\n */\nfunction LongBits(lo, hi) {\n\n // note that the casts below are theoretically unnecessary as of today, but older statically\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\n\n /**\n * Low bits.\n * @type {number}\n */\n this.lo = lo >>> 0;\n\n /**\n * High bits.\n * @type {number}\n */\n this.hi = hi >>> 0;\n}\n\n/**\n * Zero bits.\n * @memberof util.LongBits\n * @type {util.LongBits}\n */\nvar zero = LongBits.zero = new LongBits(0, 0);\n\nzero.toNumber = function() { return 0; };\nzero.zzEncode = zero.zzDecode = function() { return this; };\nzero.length = function() { return 1; };\n\n/**\n * Zero hash.\n * @memberof util.LongBits\n * @type {string}\n */\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\n\n/**\n * Constructs new long bits from the specified number.\n * @param {number} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.fromNumber = function fromNumber(value) {\n if (value === 0)\n return zero;\n var sign = value < 0;\n if (sign)\n value = -value;\n var lo = value >>> 0,\n hi = (value - lo) / 4294967296 >>> 0;\n if (sign) {\n hi = ~hi >>> 0;\n lo = ~lo >>> 0;\n if (++lo > 4294967295) {\n lo = 0;\n if (++hi > 4294967295)\n hi = 0;\n }\n }\n return new LongBits(lo, hi);\n};\n\n/**\n * Constructs new long bits from a number, long or string.\n * @param {Long|number|string} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.from = function from(value) {\n if (typeof value === \"number\")\n return LongBits.fromNumber(value);\n if (util.isString(value)) {\n /* istanbul ignore else */\n if (util.Long)\n value = util.Long.fromString(value);\n else\n return LongBits.fromNumber(parseInt(value, 10));\n }\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n};\n\n/**\n * Converts this long bits to a possibly unsafe JavaScript number.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {number} Possibly unsafe number\n */\nLongBits.prototype.toNumber = function toNumber(unsigned) {\n if (!unsigned && this.hi >>> 31) {\n var lo = ~this.lo + 1 >>> 0,\n hi = ~this.hi >>> 0;\n if (!lo)\n hi = hi + 1 >>> 0;\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n};\n\n/**\n * Converts this long bits to a long.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long} Long\n */\nLongBits.prototype.toLong = function toLong(unsigned) {\n return util.Long\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\n /* istanbul ignore next */\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\n};\n\nvar charCodeAt = String.prototype.charCodeAt;\n\n/**\n * Constructs new long bits from the specified 8 characters long hash.\n * @param {string} hash Hash\n * @returns {util.LongBits} Bits\n */\nLongBits.fromHash = function fromHash(hash) {\n if (hash === zeroHash)\n return zero;\n return new LongBits(\n ( charCodeAt.call(hash, 0)\n | charCodeAt.call(hash, 1) << 8\n | charCodeAt.call(hash, 2) << 16\n | charCodeAt.call(hash, 3) << 24) >>> 0\n ,\n ( charCodeAt.call(hash, 4)\n | charCodeAt.call(hash, 5) << 8\n | charCodeAt.call(hash, 6) << 16\n | charCodeAt.call(hash, 7) << 24) >>> 0\n );\n};\n\n/**\n * Converts this long bits to a 8 characters long hash.\n * @returns {string} Hash\n */\nLongBits.prototype.toHash = function toHash() {\n return String.fromCharCode(\n this.lo & 255,\n this.lo >>> 8 & 255,\n this.lo >>> 16 & 255,\n this.lo >>> 24 ,\n this.hi & 255,\n this.hi >>> 8 & 255,\n this.hi >>> 16 & 255,\n this.hi >>> 24\n );\n};\n\n/**\n * Zig-zag encodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzEncode = function zzEncode() {\n var mask = this.hi >> 31;\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\n this.lo = ( this.lo << 1 ^ mask) >>> 0;\n return this;\n};\n\n/**\n * Zig-zag decodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzDecode = function zzDecode() {\n var mask = -(this.lo & 1);\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\n this.hi = ( this.hi >>> 1 ^ mask) >>> 0;\n return this;\n};\n\n/**\n * Calculates the length of this longbits when encoded as a varint.\n * @returns {number} Length\n */\nLongBits.prototype.length = function length() {\n var part0 = this.lo,\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\n part2 = this.hi >>> 24;\n return part2 === 0\n ? part1 === 0\n ? part0 < 16384\n ? part0 < 128 ? 1 : 2\n : part0 < 2097152 ? 3 : 4\n : part1 < 16384\n ? part1 < 128 ? 5 : 6\n : part1 < 2097152 ? 7 : 8\n : part2 < 128 ? 9 : 10;\n};\n","\"use strict\";\nmodule.exports = BufferWriter;\n\n// extends Writer\nvar Writer = require(\"./writer\");\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\n\nvar util = require(\"./util/minimal\");\n\nvar Buffer = util.Buffer;\n\n/**\n * Constructs a new buffer writer instance.\n * @classdesc Wire format writer using node buffers.\n * @extends Writer\n * @constructor\n */\nfunction BufferWriter() {\n Writer.call(this);\n}\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Buffer} Buffer\n */\nBufferWriter.alloc = function alloc_buffer(size) {\n return (BufferWriter.alloc = util._Buffer_allocUnsafe)(size);\n};\n\nvar writeBytesBuffer = Buffer && Buffer.prototype instanceof Uint8Array && Buffer.prototype.set.name === \"set\"\n ? function writeBytesBuffer_set(val, buf, pos) {\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytesBuffer_copy(val, buf, pos) {\n if (val.copy) // Buffer values\n val.copy(buf, pos, 0, val.length);\n else for (var i = 0; i < val.length;) // plain array values\n buf[pos++] = val[i++];\n };\n\n/**\n * @override\n */\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\n if (util.isString(value))\n value = util._Buffer_from(value, \"base64\");\n var len = value.length >>> 0;\n this.uint32(len);\n if (len)\n this._push(writeBytesBuffer, len, value);\n return this;\n};\n\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\n util.utf8.write(val, buf, pos);\n else\n buf.utf8Write(val, pos);\n}\n\n/**\n * @override\n */\nBufferWriter.prototype.string = function write_string_buffer(value) {\n var len = Buffer.byteLength(value);\n this.uint32(len);\n if (len)\n this._push(writeStringBuffer, len, value);\n return this;\n};\n\n\n/**\n * Finishes the write operation.\n * @name BufferWriter#finish\n * @function\n * @returns {Buffer} Finished buffer\n */\n","\"use strict\";\nmodule.exports = BufferReader;\n\n// extends Reader\nvar Reader = require(\"./reader\");\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer reader instance.\n * @classdesc Wire format reader using node buffers.\n * @extends Reader\n * @constructor\n * @param {Buffer} buffer Buffer to read from\n */\nfunction BufferReader(buffer) {\n Reader.call(this, buffer);\n\n /**\n * Read buffer.\n * @name BufferReader#buf\n * @type {Buffer}\n */\n}\n\n/* istanbul ignore else */\nif (util.Buffer)\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\n\n/**\n * @override\n */\nBufferReader.prototype.string = function read_string_buffer() {\n var len = this.uint32(); // modifies pos\n return this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len));\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @name BufferReader#bytes\n * @function\n * @returns {Buffer} Value read\n */\n","\"use strict\";\nmodule.exports = Service;\n\nvar util = require(\"../util/minimal\");\n\n// Extends EventEmitter\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\n\n/**\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\n *\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\n * @typedef rpc.ServiceMethodCallback\n * @template TRes extends Message\n * @type {function}\n * @param {Error|null} error Error, if any\n * @param {TRes} [response] Response message\n * @returns {undefined}\n */\n\n/**\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\n * @typedef rpc.ServiceMethod\n * @template TReq extends Message\n * @template TRes extends Message\n * @type {function}\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message\n * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined`\n */\n\n/**\n * Constructs a new RPC service instance.\n * @classdesc An RPC service as returned by {@link Service#create}.\n * @exports rpc.Service\n * @extends util.EventEmitter\n * @constructor\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n */\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\n\n if (typeof rpcImpl !== \"function\")\n throw TypeError(\"rpcImpl must be a function\");\n\n util.EventEmitter.call(this);\n\n /**\n * RPC implementation. Becomes `null` once the service is ended.\n * @type {RPCImpl|null}\n */\n this.rpcImpl = rpcImpl;\n\n /**\n * Whether requests are length-delimited.\n * @type {boolean}\n */\n this.requestDelimited = Boolean(requestDelimited);\n\n /**\n * Whether responses are length-delimited.\n * @type {boolean}\n */\n this.responseDelimited = Boolean(responseDelimited);\n}\n\n/**\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\n * @param {Method|rpc.ServiceMethod} method Reflected or static method\n * @param {Constructor} requestCtor Request constructor\n * @param {Constructor} responseCtor Response constructor\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} callback Service callback\n * @returns {undefined}\n * @template TReq extends Message\n * @template TRes extends Message\n */\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\n\n if (!request)\n throw TypeError(\"request must be specified\");\n\n var self = this;\n if (!callback)\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\n\n if (!self.rpcImpl) {\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\n return undefined;\n }\n\n try {\n return self.rpcImpl(\n method,\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\n function rpcCallback(err, response) {\n\n if (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n\n if (response === null) {\n self.end(/* endedByRPC */ true);\n return undefined;\n }\n\n if (!(response instanceof responseCtor)) {\n try {\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\n } catch (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n }\n\n self.emit(\"data\", response, method);\n return callback(null, response);\n }\n );\n } catch (err) {\n self.emit(\"error\", err, method);\n setTimeout(function() { callback(err); }, 0);\n return undefined;\n }\n};\n\n/**\n * Ends this service and emits the `end` event.\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\n * @returns {rpc.Service} `this`\n */\nService.prototype.end = function end(endedByRPC) {\n if (this.rpcImpl) {\n if (!endedByRPC) // signal end to rpcImpl\n this.rpcImpl(null, null, null);\n this.rpcImpl = null;\n this.emit(\"end\").off();\n }\n return this;\n};\n","\"use strict\";\r\nmodule.exports = codegen;\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @param {string[]} functionParams Function parameter names\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n */\r\nfunction codegen(functionParams, functionName) {\r\n\r\n /* istanbul ignore if */\r\n if (typeof functionParams === \"string\") {\r\n functionName = functionParams;\r\n functionParams = undefined;\r\n }\r\n\r\n var body = [];\r\n\r\n /**\r\n * Appends code to the function's body or finishes generation.\r\n * @typedef Codegen\r\n * @type {function}\r\n * @param {string|Object.} [formatStringOrScope] Format string or, to finish the function, an object of additional scope variables, if any\r\n * @param {...*} [formatParams] Format parameters\r\n * @returns {Codegen|Function} Itself or the generated function if finished\r\n * @throws {Error} If format parameter counts do not match\r\n */\r\n\r\n function Codegen(formatStringOrScope) {\r\n // note that explicit array handling below makes this ~50% faster\r\n\r\n // finish the function\r\n if (typeof formatStringOrScope !== \"string\") {\r\n var source = toString();\r\n if (codegen.verbose)\r\n console.log(\"codegen: \" + source); // eslint-disable-line no-console\r\n source = \"return \" + source;\r\n if (formatStringOrScope) {\r\n var scopeKeys = Object.keys(formatStringOrScope),\r\n scopeParams = new Array(scopeKeys.length + 1),\r\n scopeValues = new Array(scopeKeys.length),\r\n scopeOffset = 0;\r\n while (scopeOffset < scopeKeys.length) {\r\n scopeParams[scopeOffset] = scopeKeys[scopeOffset];\r\n scopeValues[scopeOffset] = formatStringOrScope[scopeKeys[scopeOffset++]];\r\n }\r\n scopeParams[scopeOffset] = source;\r\n return Function.apply(null, scopeParams).apply(null, scopeValues); // eslint-disable-line no-new-func\r\n }\r\n return Function(source)(); // eslint-disable-line no-new-func\r\n }\r\n\r\n // otherwise append to body\r\n var formatParams = new Array(arguments.length - 1),\r\n formatOffset = 0;\r\n while (formatOffset < formatParams.length)\r\n formatParams[formatOffset] = arguments[++formatOffset];\r\n formatOffset = 0;\r\n formatStringOrScope = formatStringOrScope.replace(/%([%dfijs])/g, function replace($0, $1) {\r\n var value = formatParams[formatOffset++];\r\n switch ($1) {\r\n case \"d\": case \"f\": return String(Number(value));\r\n case \"i\": return String(Math.floor(value));\r\n case \"j\": return JSON.stringify(value);\r\n case \"s\": return String(value);\r\n }\r\n return \"%\";\r\n });\r\n if (formatOffset !== formatParams.length)\r\n throw Error(\"parameter count mismatch\");\r\n body.push(formatStringOrScope);\r\n return Codegen;\r\n }\r\n\r\n function toString(functionNameOverride) {\r\n return \"function \" + (functionNameOverride || functionName || \"\") + \"(\" + (functionParams && functionParams.join(\",\") || \"\") + \"){\\n \" + body.join(\"\\n \") + \"\\n}\";\r\n }\r\n\r\n Codegen.toString = toString;\r\n return Codegen;\r\n}\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @function codegen\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * When set to `true`, codegen will log generated code to console. Useful for debugging.\r\n * @name util.codegen.verbose\r\n * @type {boolean}\r\n */\r\ncodegen.verbose = false;\r\n","\"use strict\";\r\nmodule.exports = fetch;\r\n\r\nvar asPromise = require(\"@protobufjs/aspromise\"),\r\n inquire = require(\"@protobufjs/inquire\");\r\n\r\nvar fs = inquire(\"fs\");\r\n\r\n/**\r\n * Node-style callback as used by {@link util.fetch}.\r\n * @typedef FetchCallback\r\n * @type {function}\r\n * @param {?Error} error Error, if any, otherwise `null`\r\n * @param {string} [contents] File contents, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Options as used by {@link util.fetch}.\r\n * @typedef FetchOptions\r\n * @type {Object}\r\n * @property {boolean} [binary=false] Whether expecting a binary response\r\n * @property {boolean} [xhr=false] If `true`, forces the use of XMLHttpRequest\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @memberof util\r\n * @param {string} filename File path or url\r\n * @param {FetchOptions} options Fetch options\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nfunction fetch(filename, options, callback) {\r\n if (typeof options === \"function\") {\r\n callback = options;\r\n options = {};\r\n } else if (!options)\r\n options = {};\r\n\r\n if (!callback)\r\n return asPromise(fetch, this, filename, options); // eslint-disable-line no-invalid-this\r\n\r\n // if a node-like filesystem is present, try it first but fall back to XHR if nothing is found.\r\n if (!options.xhr && fs && fs.readFile)\r\n return fs.readFile(filename, function fetchReadFileCallback(err, contents) {\r\n return err && typeof XMLHttpRequest !== \"undefined\"\r\n ? fetch.xhr(filename, options, callback)\r\n : err\r\n ? callback(err)\r\n : callback(null, options.binary ? contents : contents.toString(\"utf8\"));\r\n });\r\n\r\n // use the XHR version otherwise.\r\n return fetch.xhr(filename, options, callback);\r\n}\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchOptions} [options] Fetch options\r\n * @returns {Promise} Promise\r\n * @variation 3\r\n */\r\n\r\n/**/\r\nfetch.xhr = function fetch_xhr(filename, options, callback) {\r\n var xhr = new XMLHttpRequest();\r\n xhr.onreadystatechange /* works everywhere */ = function fetchOnReadyStateChange() {\r\n\r\n if (xhr.readyState !== 4)\r\n return undefined;\r\n\r\n // local cors security errors return status 0 / empty string, too. afaik this cannot be\r\n // reliably distinguished from an actually empty file for security reasons. feel free\r\n // to send a pull request if you are aware of a solution.\r\n if (xhr.status !== 0 && xhr.status !== 200)\r\n return callback(Error(\"status \" + xhr.status));\r\n\r\n // if binary data is expected, make sure that some sort of array is returned, even if\r\n // ArrayBuffers are not supported. the binary string fallback, however, is unsafe.\r\n if (options.binary) {\r\n var buffer = xhr.response;\r\n if (!buffer) {\r\n buffer = [];\r\n for (var i = 0; i < xhr.responseText.length; ++i)\r\n buffer.push(xhr.responseText.charCodeAt(i) & 255);\r\n }\r\n return callback(null, typeof Uint8Array !== \"undefined\" ? new Uint8Array(buffer) : buffer);\r\n }\r\n return callback(null, xhr.responseText);\r\n };\r\n\r\n if (options.binary) {\r\n // ref: https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Sending_and_Receiving_Binary_Data#Receiving_binary_data_in_older_browsers\r\n if (\"overrideMimeType\" in xhr)\r\n xhr.overrideMimeType(\"text/plain; charset=x-user-defined\");\r\n xhr.responseType = \"arraybuffer\";\r\n }\r\n\r\n xhr.open(\"GET\", filename);\r\n xhr.send();\r\n};\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal path module to resolve Unix, Windows and URL paths alike.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar path = exports;\r\n\r\nvar isAbsolute =\r\n/**\r\n * Tests if the specified path is absolute.\r\n * @param {string} path Path to test\r\n * @returns {boolean} `true` if path is absolute\r\n */\r\npath.isAbsolute = function isAbsolute(path) {\r\n return /^(?:\\/|\\w+:)/.test(path);\r\n};\r\n\r\nvar normalize =\r\n/**\r\n * Normalizes the specified path.\r\n * @param {string} path Path to normalize\r\n * @returns {string} Normalized path\r\n */\r\npath.normalize = function normalize(path) {\r\n path = path.replace(/\\\\/g, \"/\")\r\n .replace(/\\/{2,}/g, \"/\");\r\n var parts = path.split(\"/\"),\r\n absolute = isAbsolute(path),\r\n prefix = \"\";\r\n if (absolute)\r\n prefix = parts.shift() + \"/\";\r\n for (var i = 0; i < parts.length;) {\r\n if (parts[i] === \"..\") {\r\n if (i > 0 && parts[i - 1] !== \"..\")\r\n parts.splice(--i, 2);\r\n else if (absolute)\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n } else if (parts[i] === \".\")\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n return prefix + parts.join(\"/\");\r\n};\r\n\r\n/**\r\n * Resolves the specified include path against the specified origin path.\r\n * @param {string} originPath Path to the origin file\r\n * @param {string} includePath Include path relative to origin path\r\n * @param {boolean} [alreadyNormalized=false] `true` if both paths are already known to be normalized\r\n * @returns {string} Path to the include file\r\n */\r\npath.resolve = function resolve(originPath, includePath, alreadyNormalized) {\r\n if (!alreadyNormalized)\r\n includePath = normalize(includePath);\r\n if (isAbsolute(includePath))\r\n return includePath;\r\n if (!alreadyNormalized)\r\n originPath = normalize(originPath);\r\n return (originPath = originPath.replace(/(?:\\/|^)[^/]+$/, \"\")).length ? normalize(originPath + \"/\" + includePath) : includePath;\r\n};\r\n","const basex = require('base-x')\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (source instanceof Uint8Array) {\n } else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source)\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = new Uint8Array(zeroes + (size - it4))\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","\"use strict\";\nmodule.exports = parse;\n\nparse.filename = null;\nparse.defaults = { keepCase: false };\n\nvar tokenize = require(\"./tokenize\"),\n Root = require(\"./root\"),\n Type = require(\"./type\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n OneOf = require(\"./oneof\"),\n Enum = require(\"./enum\"),\n Service = require(\"./service\"),\n Method = require(\"./method\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar base10Re = /^[1-9][0-9]*$/,\n base10NegRe = /^-?[1-9][0-9]*$/,\n base16Re = /^0[x][0-9a-fA-F]+$/,\n base16NegRe = /^-?0[x][0-9a-fA-F]+$/,\n base8Re = /^0[0-7]+$/,\n base8NegRe = /^-?0[0-7]+$/,\n numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,\n nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/,\n typeRefRe = /^(?:\\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,\n fqTypeRefRe = /^(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;\n\n/**\n * Result object returned from {@link parse}.\n * @interface IParserResult\n * @property {string|undefined} package Package name, if declared\n * @property {string[]|undefined} imports Imports, if any\n * @property {string[]|undefined} weakImports Weak imports, if any\n * @property {string|undefined} syntax Syntax, if specified (either `\"proto2\"` or `\"proto3\"`)\n * @property {Root} root Populated root instance\n */\n\n/**\n * Options modifying the behavior of {@link parse}.\n * @interface IParseOptions\n * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case\n * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments.\n */\n\n/**\n * Options modifying the behavior of JSON serialization.\n * @interface IToJSONOptions\n * @property {boolean} [keepComments=false] Serializes comments.\n */\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @param {string} source Source contents\n * @param {Root} root Root to populate\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n */\nfunction parse(source, root, options) {\n /* eslint-disable callback-return */\n if (!(root instanceof Root)) {\n options = root;\n root = new Root();\n }\n if (!options)\n options = parse.defaults;\n\n var tn = tokenize(source, options.alternateCommentMode || false),\n next = tn.next,\n push = tn.push,\n peek = tn.peek,\n skip = tn.skip,\n cmnt = tn.cmnt;\n\n var head = true,\n pkg,\n imports,\n weakImports,\n syntax,\n isProto3 = false;\n\n var ptr = root;\n\n var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase;\n\n /* istanbul ignore next */\n function illegal(token, name, insideTryCatch) {\n var filename = parse.filename;\n if (!insideTryCatch)\n parse.filename = null;\n return Error(\"illegal \" + (name || \"token\") + \" '\" + token + \"' (\" + (filename ? filename + \", \" : \"\") + \"line \" + tn.line + \")\");\n }\n\n function readString() {\n var values = [],\n token;\n do {\n /* istanbul ignore if */\n if ((token = next()) !== \"\\\"\" && token !== \"'\")\n throw illegal(token);\n\n values.push(next());\n skip(token);\n token = peek();\n } while (token === \"\\\"\" || token === \"'\");\n return values.join(\"\");\n }\n\n function readValue(acceptTypeRef) {\n var token = next();\n switch (token) {\n case \"'\":\n case \"\\\"\":\n push(token);\n return readString();\n case \"true\": case \"TRUE\":\n return true;\n case \"false\": case \"FALSE\":\n return false;\n }\n try {\n return parseNumber(token, /* insideTryCatch */ true);\n } catch (e) {\n\n /* istanbul ignore else */\n if (acceptTypeRef && typeRefRe.test(token))\n return token;\n\n /* istanbul ignore next */\n throw illegal(token, \"value\");\n }\n }\n\n function readRanges(target, acceptStrings) {\n var token, start;\n do {\n if (acceptStrings && ((token = peek()) === \"\\\"\" || token === \"'\"))\n target.push(readString());\n else\n target.push([ start = parseId(next()), skip(\"to\", true) ? parseId(next()) : start ]);\n } while (skip(\",\", true));\n skip(\";\");\n }\n\n function parseNumber(token, insideTryCatch) {\n var sign = 1;\n if (token.charAt(0) === \"-\") {\n sign = -1;\n token = token.substring(1);\n }\n switch (token) {\n case \"inf\": case \"INF\": case \"Inf\":\n return sign * Infinity;\n case \"nan\": case \"NAN\": case \"Nan\": case \"NaN\":\n return NaN;\n case \"0\":\n return 0;\n }\n if (base10Re.test(token))\n return sign * parseInt(token, 10);\n if (base16Re.test(token))\n return sign * parseInt(token, 16);\n if (base8Re.test(token))\n return sign * parseInt(token, 8);\n\n /* istanbul ignore else */\n if (numberRe.test(token))\n return sign * parseFloat(token);\n\n /* istanbul ignore next */\n throw illegal(token, \"number\", insideTryCatch);\n }\n\n function parseId(token, acceptNegative) {\n switch (token) {\n case \"max\": case \"MAX\": case \"Max\":\n return 536870911;\n case \"0\":\n return 0;\n }\n\n /* istanbul ignore if */\n if (!acceptNegative && token.charAt(0) === \"-\")\n throw illegal(token, \"id\");\n\n if (base10NegRe.test(token))\n return parseInt(token, 10);\n if (base16NegRe.test(token))\n return parseInt(token, 16);\n\n /* istanbul ignore else */\n if (base8NegRe.test(token))\n return parseInt(token, 8);\n\n /* istanbul ignore next */\n throw illegal(token, \"id\");\n }\n\n function parsePackage() {\n\n /* istanbul ignore if */\n if (pkg !== undefined)\n throw illegal(\"package\");\n\n pkg = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(pkg))\n throw illegal(pkg, \"name\");\n\n ptr = ptr.define(pkg);\n skip(\";\");\n }\n\n function parseImport() {\n var token = peek();\n var whichImports;\n switch (token) {\n case \"weak\":\n whichImports = weakImports || (weakImports = []);\n next();\n break;\n case \"public\":\n next();\n // eslint-disable-line no-fallthrough\n default:\n whichImports = imports || (imports = []);\n break;\n }\n token = readString();\n skip(\";\");\n whichImports.push(token);\n }\n\n function parseSyntax() {\n skip(\"=\");\n syntax = readString();\n isProto3 = syntax === \"proto3\";\n\n /* istanbul ignore if */\n if (!isProto3 && syntax !== \"proto2\")\n throw illegal(syntax, \"syntax\");\n\n skip(\";\");\n }\n\n function parseCommon(parent, token) {\n switch (token) {\n\n case \"option\":\n parseOption(parent, token);\n skip(\";\");\n return true;\n\n case \"message\":\n parseType(parent, token);\n return true;\n\n case \"enum\":\n parseEnum(parent, token);\n return true;\n\n case \"service\":\n parseService(parent, token);\n return true;\n\n case \"extend\":\n parseExtension(parent, token);\n return true;\n }\n return false;\n }\n\n function ifBlock(obj, fnIf, fnElse) {\n var trailingLine = tn.line;\n if (obj) {\n obj.comment = cmnt(); // try block-type comment\n obj.filename = parse.filename;\n }\n if (skip(\"{\", true)) {\n var token;\n while ((token = next()) !== \"}\")\n fnIf(token);\n skip(\";\", true);\n } else {\n if (fnElse)\n fnElse();\n skip(\";\");\n if (obj && typeof obj.comment !== \"string\")\n obj.comment = cmnt(trailingLine); // try line-type comment if no block\n }\n }\n\n function parseType(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"type name\");\n\n var type = new Type(token);\n ifBlock(type, function parseType_block(token) {\n if (parseCommon(type, token))\n return;\n\n switch (token) {\n\n case \"map\":\n parseMapField(type, token);\n break;\n\n case \"required\":\n case \"optional\":\n case \"repeated\":\n parseField(type, token);\n break;\n\n case \"oneof\":\n parseOneOf(type, token);\n break;\n\n case \"extensions\":\n readRanges(type.extensions || (type.extensions = []));\n break;\n\n case \"reserved\":\n readRanges(type.reserved || (type.reserved = []), true);\n break;\n\n default:\n /* istanbul ignore if */\n if (!isProto3 || !typeRefRe.test(token))\n throw illegal(token);\n\n push(token);\n parseField(type, \"optional\");\n break;\n }\n });\n parent.add(type);\n }\n\n function parseField(parent, rule, extend) {\n var type = next();\n if (type === \"group\") {\n parseGroup(parent, rule);\n return;\n }\n\n /* istanbul ignore if */\n if (!typeRefRe.test(type))\n throw illegal(type, \"type\");\n\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n name = applyCase(name);\n skip(\"=\");\n\n var field = new Field(name, parseId(next()), type, rule, extend);\n ifBlock(field, function parseField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseField_line() {\n parseInlineOptions(field);\n });\n parent.add(field);\n\n // JSON defaults to packed=true if not set so we have to set packed=false explicity when\n // parsing proto2 descriptors without the option, where applicable. This must be done for\n // all known packable types and anything that could be an enum (= is not a basic type).\n if (!isProto3 && field.repeated && (types.packed[type] !== undefined || types.basic[type] === undefined))\n field.setOption(\"packed\", false, /* ifNotSet */ true);\n }\n\n function parseGroup(parent, rule) {\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n var fieldName = util.lcFirst(name);\n if (name === fieldName)\n name = util.ucFirst(name);\n skip(\"=\");\n var id = parseId(next());\n var type = new Type(name);\n type.group = true;\n var field = new Field(fieldName, id, name, rule);\n field.filename = parse.filename;\n ifBlock(type, function parseGroup_block(token) {\n switch (token) {\n\n case \"option\":\n parseOption(type, token);\n skip(\";\");\n break;\n\n case \"required\":\n case \"optional\":\n case \"repeated\":\n parseField(type, token);\n break;\n\n /* istanbul ignore next */\n default:\n throw illegal(token); // there are no groups with proto3 semantics\n }\n });\n parent.add(type)\n .add(field);\n }\n\n function parseMapField(parent) {\n skip(\"<\");\n var keyType = next();\n\n /* istanbul ignore if */\n if (types.mapKey[keyType] === undefined)\n throw illegal(keyType, \"type\");\n\n skip(\",\");\n var valueType = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(valueType))\n throw illegal(valueType, \"type\");\n\n skip(\">\");\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n skip(\"=\");\n var field = new MapField(applyCase(name), parseId(next()), keyType, valueType);\n ifBlock(field, function parseMapField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseMapField_line() {\n parseInlineOptions(field);\n });\n parent.add(field);\n }\n\n function parseOneOf(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var oneof = new OneOf(applyCase(token));\n ifBlock(oneof, function parseOneOf_block(token) {\n if (token === \"option\") {\n parseOption(oneof, token);\n skip(\";\");\n } else {\n push(token);\n parseField(oneof, \"optional\");\n }\n });\n parent.add(oneof);\n }\n\n function parseEnum(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var enm = new Enum(token);\n ifBlock(enm, function parseEnum_block(token) {\n switch(token) {\n case \"option\":\n parseOption(enm, token);\n skip(\";\");\n break;\n\n case \"reserved\":\n readRanges(enm.reserved || (enm.reserved = []), true);\n break;\n\n default:\n parseEnumValue(enm, token);\n }\n });\n parent.add(enm);\n }\n\n function parseEnumValue(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token))\n throw illegal(token, \"name\");\n\n skip(\"=\");\n var value = parseId(next(), true),\n dummy = {};\n ifBlock(dummy, function parseEnumValue_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(dummy, token); // skip\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseEnumValue_line() {\n parseInlineOptions(dummy); // skip\n });\n parent.add(token, value, dummy.comment);\n }\n\n function parseOption(parent, token) {\n var isCustom = skip(\"(\", true);\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var name = token;\n if (isCustom) {\n skip(\")\");\n name = \"(\" + name + \")\";\n token = peek();\n if (fqTypeRefRe.test(token)) {\n name += token;\n next();\n }\n }\n skip(\"=\");\n parseOptionValue(parent, name);\n }\n\n function parseOptionValue(parent, name) {\n if (skip(\"{\", true)) { // { a: \"foo\" b { c: \"bar\" } }\n do {\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n if (peek() === \"{\")\n parseOptionValue(parent, name + \".\" + token);\n else {\n skip(\":\");\n if (peek() === \"{\")\n parseOptionValue(parent, name + \".\" + token);\n else\n setOption(parent, name + \".\" + token, readValue(true));\n }\n skip(\",\", true);\n } while (!skip(\"}\", true));\n } else\n setOption(parent, name, readValue(true));\n // Does not enforce a delimiter to be universal\n }\n\n function setOption(parent, name, value) {\n if (parent.setOption)\n parent.setOption(name, value);\n }\n\n function parseInlineOptions(parent) {\n if (skip(\"[\", true)) {\n do {\n parseOption(parent, \"option\");\n } while (skip(\",\", true));\n skip(\"]\");\n }\n return parent;\n }\n\n function parseService(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"service name\");\n\n var service = new Service(token);\n ifBlock(service, function parseService_block(token) {\n if (parseCommon(service, token))\n return;\n\n /* istanbul ignore else */\n if (token === \"rpc\")\n parseMethod(service, token);\n else\n throw illegal(token);\n });\n parent.add(service);\n }\n\n function parseMethod(parent, token) {\n var type = token;\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var name = token,\n requestType, requestStream,\n responseType, responseStream;\n\n skip(\"(\");\n if (skip(\"stream\", true))\n requestStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n requestType = token;\n skip(\")\"); skip(\"returns\"); skip(\"(\");\n if (skip(\"stream\", true))\n responseStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n responseType = token;\n skip(\")\");\n\n var method = new Method(name, type, requestType, responseType, requestStream, responseStream);\n ifBlock(method, function parseMethod_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(method, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n });\n parent.add(method);\n }\n\n function parseExtension(parent, token) {\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token, \"reference\");\n\n var reference = token;\n ifBlock(null, function parseExtension_block(token) {\n switch (token) {\n\n case \"required\":\n case \"repeated\":\n case \"optional\":\n parseField(parent, token, reference);\n break;\n\n default:\n /* istanbul ignore if */\n if (!isProto3 || !typeRefRe.test(token))\n throw illegal(token);\n push(token);\n parseField(parent, \"optional\", reference);\n break;\n }\n });\n }\n\n var token;\n while ((token = next()) !== null) {\n switch (token) {\n\n case \"package\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parsePackage();\n break;\n\n case \"import\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseImport();\n break;\n\n case \"syntax\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseSyntax();\n break;\n\n case \"option\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseOption(ptr, token);\n skip(\";\");\n break;\n\n default:\n\n /* istanbul ignore else */\n if (parseCommon(ptr, token)) {\n head = false;\n continue;\n }\n\n /* istanbul ignore next */\n throw illegal(token);\n }\n }\n\n parse.filename = null;\n return {\n \"package\" : pkg,\n \"imports\" : imports,\n weakImports : weakImports,\n syntax : syntax,\n root : root\n };\n}\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @name parse\n * @function\n * @param {string} source Source contents\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n * @variation 2\n */\n","\"use strict\";\nmodule.exports = common;\n\nvar commonRe = /\\/|\\./;\n\n/**\n * Provides common type definitions.\n * Can also be used to provide additional google types or your own custom types.\n * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name\n * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition\n * @returns {undefined}\n * @property {INamespace} google/protobuf/any.proto Any\n * @property {INamespace} google/protobuf/duration.proto Duration\n * @property {INamespace} google/protobuf/empty.proto Empty\n * @property {INamespace} google/protobuf/field_mask.proto FieldMask\n * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue\n * @property {INamespace} google/protobuf/timestamp.proto Timestamp\n * @property {INamespace} google/protobuf/wrappers.proto Wrappers\n * @example\n * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension)\n * protobuf.common(\"descriptor\", descriptorJson);\n *\n * // manually provides a custom definition (uses my.foo namespace)\n * protobuf.common(\"my/foo/bar.proto\", myFooBarJson);\n */\nfunction common(name, json) {\n if (!commonRe.test(name)) {\n name = \"google/protobuf/\" + name + \".proto\";\n json = { nested: { google: { nested: { protobuf: { nested: json } } } } };\n }\n common[name] = json;\n}\n\n// Not provided because of limited use (feel free to discuss or to provide yourself):\n//\n// google/protobuf/descriptor.proto\n// google/protobuf/source_context.proto\n// google/protobuf/type.proto\n//\n// Stripped and pre-parsed versions of these non-bundled files are instead available as part of\n// the repository or package within the google/protobuf directory.\n\ncommon(\"any\", {\n\n /**\n * Properties of a google.protobuf.Any message.\n * @interface IAny\n * @type {Object}\n * @property {string} [typeUrl]\n * @property {Uint8Array} [bytes]\n * @memberof common\n */\n Any: {\n fields: {\n type_url: {\n type: \"string\",\n id: 1\n },\n value: {\n type: \"bytes\",\n id: 2\n }\n }\n }\n});\n\nvar timeType;\n\ncommon(\"duration\", {\n\n /**\n * Properties of a google.protobuf.Duration message.\n * @interface IDuration\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Duration: timeType = {\n fields: {\n seconds: {\n type: \"int64\",\n id: 1\n },\n nanos: {\n type: \"int32\",\n id: 2\n }\n }\n }\n});\n\ncommon(\"timestamp\", {\n\n /**\n * Properties of a google.protobuf.Timestamp message.\n * @interface ITimestamp\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Timestamp: timeType\n});\n\ncommon(\"empty\", {\n\n /**\n * Properties of a google.protobuf.Empty message.\n * @interface IEmpty\n * @memberof common\n */\n Empty: {\n fields: {}\n }\n});\n\ncommon(\"struct\", {\n\n /**\n * Properties of a google.protobuf.Struct message.\n * @interface IStruct\n * @type {Object}\n * @property {Object.} [fields]\n * @memberof common\n */\n Struct: {\n fields: {\n fields: {\n keyType: \"string\",\n type: \"Value\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Value message.\n * @interface IValue\n * @type {Object}\n * @property {string} [kind]\n * @property {0} [nullValue]\n * @property {number} [numberValue]\n * @property {string} [stringValue]\n * @property {boolean} [boolValue]\n * @property {IStruct} [structValue]\n * @property {IListValue} [listValue]\n * @memberof common\n */\n Value: {\n oneofs: {\n kind: {\n oneof: [\n \"nullValue\",\n \"numberValue\",\n \"stringValue\",\n \"boolValue\",\n \"structValue\",\n \"listValue\"\n ]\n }\n },\n fields: {\n nullValue: {\n type: \"NullValue\",\n id: 1\n },\n numberValue: {\n type: \"double\",\n id: 2\n },\n stringValue: {\n type: \"string\",\n id: 3\n },\n boolValue: {\n type: \"bool\",\n id: 4\n },\n structValue: {\n type: \"Struct\",\n id: 5\n },\n listValue: {\n type: \"ListValue\",\n id: 6\n }\n }\n },\n\n NullValue: {\n values: {\n NULL_VALUE: 0\n }\n },\n\n /**\n * Properties of a google.protobuf.ListValue message.\n * @interface IListValue\n * @type {Object}\n * @property {Array.} [values]\n * @memberof common\n */\n ListValue: {\n fields: {\n values: {\n rule: \"repeated\",\n type: \"Value\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"wrappers\", {\n\n /**\n * Properties of a google.protobuf.DoubleValue message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n DoubleValue: {\n fields: {\n value: {\n type: \"double\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.FloatValue message.\n * @interface IFloatValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FloatValue: {\n fields: {\n value: {\n type: \"float\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int64Value message.\n * @interface IInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n Int64Value: {\n fields: {\n value: {\n type: \"int64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt64Value message.\n * @interface IUInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n UInt64Value: {\n fields: {\n value: {\n type: \"uint64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int32Value message.\n * @interface IInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n Int32Value: {\n fields: {\n value: {\n type: \"int32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt32Value message.\n * @interface IUInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n UInt32Value: {\n fields: {\n value: {\n type: \"uint32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BoolValue message.\n * @interface IBoolValue\n * @type {Object}\n * @property {boolean} [value]\n * @memberof common\n */\n BoolValue: {\n fields: {\n value: {\n type: \"bool\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.StringValue message.\n * @interface IStringValue\n * @type {Object}\n * @property {string} [value]\n * @memberof common\n */\n StringValue: {\n fields: {\n value: {\n type: \"string\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BytesValue message.\n * @interface IBytesValue\n * @type {Object}\n * @property {Uint8Array} [value]\n * @memberof common\n */\n BytesValue: {\n fields: {\n value: {\n type: \"bytes\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"field_mask\", {\n\n /**\n * Properties of a google.protobuf.FieldMask message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FieldMask: {\n fields: {\n paths: {\n rule: \"repeated\",\n type: \"string\",\n id: 1\n }\n }\n }\n});\n\n/**\n * Gets the root definition of the specified common proto file.\n *\n * Bundled definitions are:\n * - google/protobuf/any.proto\n * - google/protobuf/duration.proto\n * - google/protobuf/empty.proto\n * - google/protobuf/field_mask.proto\n * - google/protobuf/struct.proto\n * - google/protobuf/timestamp.proto\n * - google/protobuf/wrappers.proto\n *\n * @param {string} file Proto file name\n * @returns {INamespace|null} Root definition or `null` if not defined\n */\ncommon.get = function get(file) {\n return common[file] || null;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction ShortCurve(conf) {\n Base.call(this, 'short', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.tinv = this.two.redInvm();\n\n this.zeroA = this.a.fromRed().cmpn(0) === 0;\n this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;\n\n // If the curve is endomorphic, precalculate beta and lambda\n this.endo = this._getEndomorphism(conf);\n this._endoWnafT1 = new Array(4);\n this._endoWnafT2 = new Array(4);\n}\ninherits(ShortCurve, Base);\nmodule.exports = ShortCurve;\n\nShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {\n // No efficient endomorphism\n if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)\n return;\n\n // Compute beta and lambda, that lambda * P = (beta * Px; Py)\n var beta;\n var lambda;\n if (conf.beta) {\n beta = new BN(conf.beta, 16).toRed(this.red);\n } else {\n var betas = this._getEndoRoots(this.p);\n // Choose the smallest beta\n beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];\n beta = beta.toRed(this.red);\n }\n if (conf.lambda) {\n lambda = new BN(conf.lambda, 16);\n } else {\n // Choose the lambda that is matching selected beta\n var lambdas = this._getEndoRoots(this.n);\n if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {\n lambda = lambdas[0];\n } else {\n lambda = lambdas[1];\n assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);\n }\n }\n\n // Get basis vectors, used for balanced length-two representation\n var basis;\n if (conf.basis) {\n basis = conf.basis.map(function(vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n });\n } else {\n basis = this._getEndoBasis(lambda);\n }\n\n return {\n beta: beta,\n lambda: lambda,\n basis: basis,\n };\n};\n\nShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {\n // Find roots of for x^2 + x + 1 in F\n // Root = (-1 +- Sqrt(-3)) / 2\n //\n var red = num === this.p ? this.red : BN.mont(num);\n var tinv = new BN(2).toRed(red).redInvm();\n var ntinv = tinv.redNeg();\n\n var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);\n\n var l1 = ntinv.redAdd(s).fromRed();\n var l2 = ntinv.redSub(s).fromRed();\n return [ l1, l2 ];\n};\n\nShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {\n // aprxSqrt >= sqrt(this.n)\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));\n\n // 3.74\n // Run EGCD, until r(L + 1) < aprxSqrt\n var u = lambda;\n var v = this.n.clone();\n var x1 = new BN(1);\n var y1 = new BN(0);\n var x2 = new BN(0);\n var y2 = new BN(1);\n\n // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)\n var a0;\n var b0;\n // First vector\n var a1;\n var b1;\n // Second vector\n var a2;\n var b2;\n\n var prevR;\n var i = 0;\n var r;\n var x;\n while (u.cmpn(0) !== 0) {\n var q = v.div(u);\n r = v.sub(q.mul(u));\n x = x2.sub(q.mul(x1));\n var y = y2.sub(q.mul(y1));\n\n if (!a1 && r.cmp(aprxSqrt) < 0) {\n a0 = prevR.neg();\n b0 = x1;\n a1 = r.neg();\n b1 = x;\n } else if (a1 && ++i === 2) {\n break;\n }\n prevR = r;\n\n v = u;\n u = r;\n x2 = x1;\n x1 = x;\n y2 = y1;\n y1 = y;\n }\n a2 = r.neg();\n b2 = x;\n\n var len1 = a1.sqr().add(b1.sqr());\n var len2 = a2.sqr().add(b2.sqr());\n if (len2.cmp(len1) >= 0) {\n a2 = a0;\n b2 = b0;\n }\n\n // Normalize signs\n if (a1.negative) {\n a1 = a1.neg();\n b1 = b1.neg();\n }\n if (a2.negative) {\n a2 = a2.neg();\n b2 = b2.neg();\n }\n\n return [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ];\n};\n\nShortCurve.prototype._endoSplit = function _endoSplit(k) {\n var basis = this.endo.basis;\n var v1 = basis[0];\n var v2 = basis[1];\n\n var c1 = v2.b.mul(k).divRound(this.n);\n var c2 = v1.b.neg().mul(k).divRound(this.n);\n\n var p1 = c1.mul(v1.a);\n var p2 = c2.mul(v2.a);\n var q1 = c1.mul(v1.b);\n var q2 = c2.mul(v2.b);\n\n // Calculate answer\n var k1 = k.sub(p1).sub(p2);\n var k2 = q1.add(q2).neg();\n return { k1: k1, k2: k2 };\n};\n\nShortCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n // XXX Is there any way to tell if the number is odd without converting it\n // to non-red form?\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nShortCurve.prototype.validate = function validate(point) {\n if (point.inf)\n return true;\n\n var x = point.x;\n var y = point.y;\n\n var ax = this.a.redMul(x);\n var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n};\n\nShortCurve.prototype._endoWnafMulAdd =\n function _endoWnafMulAdd(points, coeffs, jacobianResult) {\n var npoints = this._endoWnafT1;\n var ncoeffs = this._endoWnafT2;\n for (var i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]);\n var p = points[i];\n var beta = p._getBeta();\n\n if (split.k1.negative) {\n split.k1.ineg();\n p = p.neg(true);\n }\n if (split.k2.negative) {\n split.k2.ineg();\n beta = beta.neg(true);\n }\n\n npoints[i * 2] = p;\n npoints[i * 2 + 1] = beta;\n ncoeffs[i * 2] = split.k1;\n ncoeffs[i * 2 + 1] = split.k2;\n }\n var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);\n\n // Clean-up references to points and coefficients\n for (var j = 0; j < i * 2; j++) {\n npoints[j] = null;\n ncoeffs[j] = null;\n }\n return res;\n };\n\nfunction Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, 'affine');\n if (x === null && y === null) {\n this.x = null;\n this.y = null;\n this.inf = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n // Force redgomery representation when loading from JSON\n if (isRed) {\n this.x.forceRed(this.curve.red);\n this.y.forceRed(this.curve.red);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n this.inf = false;\n }\n}\ninherits(Point, Base.BasePoint);\n\nShortCurve.prototype.point = function point(x, y, isRed) {\n return new Point(this, x, y, isRed);\n};\n\nShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {\n return Point.fromJSON(this, obj, red);\n};\n\nPoint.prototype._getBeta = function _getBeta() {\n if (!this.curve.endo)\n return;\n\n var pre = this.precomputed;\n if (pre && pre.beta)\n return pre.beta;\n\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve;\n var endoMul = function(p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n pre.beta = beta;\n beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n };\n }\n return beta;\n};\n\nPoint.prototype.toJSON = function toJSON() {\n if (!this.precomputed)\n return [ this.x, this.y ];\n\n return [ this.x, this.y, this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n } ];\n};\n\nPoint.fromJSON = function fromJSON(curve, obj, red) {\n if (typeof obj === 'string')\n obj = JSON.parse(obj);\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2])\n return res;\n\n function obj2point(obj) {\n return curve.point(obj[0], obj[1], red);\n }\n\n var pre = obj[2];\n res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [ res ].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [ res ].concat(pre.naf.points.map(obj2point)),\n },\n };\n return res;\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n return this.inf;\n};\n\nPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.inf)\n return p;\n\n // P + O = P\n if (p.inf)\n return this;\n\n // P + P = 2P\n if (this.eq(p))\n return this.dbl();\n\n // P + (-P) = O\n if (this.neg().eq(p))\n return this.curve.point(null, null);\n\n // P + Q = O\n if (this.x.cmp(p.x) === 0)\n return this.curve.point(null, null);\n\n var c = this.y.redSub(p.y);\n if (c.cmpn(0) !== 0)\n c = c.redMul(this.x.redSub(p.x).redInvm());\n var nx = c.redSqr().redISub(this.x).redISub(p.x);\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.inf)\n return this;\n\n // 2P = O\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0)\n return this.curve.point(null, null);\n\n var a = this.curve.a;\n\n var x2 = this.x.redSqr();\n var dyinv = ys1.redInvm();\n var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);\n\n var nx = c.redSqr().redISub(this.x.redAdd(this.x));\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.getX = function getX() {\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n return this.y.fromRed();\n};\n\nPoint.prototype.mul = function mul(k) {\n k = new BN(k, 16);\n if (this.isInfinity())\n return this;\n else if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else if (this.curve.endo)\n return this.curve._endoWnafMulAdd([ this ], [ k ]);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs, true);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2, true);\n};\n\nPoint.prototype.eq = function eq(p) {\n return this === p ||\n this.inf === p.inf &&\n (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);\n};\n\nPoint.prototype.neg = function neg(_precompute) {\n if (this.inf)\n return this;\n\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed;\n var negate = function(p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n};\n\nPoint.prototype.toJ = function toJ() {\n if (this.inf)\n return this.curve.jpoint(null, null, null);\n\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n};\n\nfunction JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, 'jacobian');\n if (x === null && y === null && z === null) {\n this.x = this.curve.one;\n this.y = this.curve.one;\n this.z = new BN(0);\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = new BN(z, 16);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n\n this.zOne = this.z === this.curve.one;\n}\ninherits(JPoint, Base.BasePoint);\n\nShortCurve.prototype.jpoint = function jpoint(x, y, z) {\n return new JPoint(this, x, y, z);\n};\n\nJPoint.prototype.toP = function toP() {\n if (this.isInfinity())\n return this.curve.point(null, null);\n\n var zinv = this.z.redInvm();\n var zinv2 = zinv.redSqr();\n var ax = this.x.redMul(zinv2);\n var ay = this.y.redMul(zinv2).redMul(zinv);\n\n return this.curve.point(ax, ay);\n};\n\nJPoint.prototype.neg = function neg() {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n};\n\nJPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.isInfinity())\n return p;\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 12M + 4S + 7A\n var pz2 = p.z.redSqr();\n var z2 = this.z.redSqr();\n var u1 = this.x.redMul(pz2);\n var u2 = p.x.redMul(z2);\n var s1 = this.y.redMul(pz2.redMul(p.z));\n var s2 = p.y.redMul(z2.redMul(this.z));\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(p.z).redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mixedAdd = function mixedAdd(p) {\n // O + P = P\n if (this.isInfinity())\n return p.toJ();\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 8M + 3S + 7A\n var z2 = this.z.redSqr();\n var u1 = this.x;\n var u2 = p.x.redMul(z2);\n var s1 = this.y;\n var s2 = p.y.redMul(z2).redMul(this.z);\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.dblp = function dblp(pow) {\n if (pow === 0)\n return this;\n if (this.isInfinity())\n return this;\n if (!pow)\n return this.dbl();\n\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++)\n r = r.dbl();\n return r;\n }\n\n // 1M + 2S + 1A + N * (4S + 5M + 8A)\n // N = 1 => 6M + 6S + 9A\n var a = this.curve.a;\n var tinv = this.curve.tinv;\n\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n // Reuse results\n var jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr();\n var jyd2 = jyd.redSqr();\n var jyd4 = jyd2.redSqr();\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var t1 = jx.redMul(jyd2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n var dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n if (i + 1 < pow)\n jz4 = jz4.redMul(jyd4);\n\n jx = nx;\n jz = nz;\n jyd = dny;\n }\n\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n};\n\nJPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n if (this.curve.zeroA)\n return this._zeroDbl();\n else if (this.curve.threeA)\n return this._threeDbl();\n else\n return this._dbl();\n};\n\nJPoint.prototype._zeroDbl = function _zeroDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 14A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // T = M ^ 2 - 2*S\n var t = m.redSqr().redISub(s).redISub(s);\n\n // 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2*Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-dbl-2009-l\n // 2M + 5S + 13A\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = B^2\n var c = b.redSqr();\n // D = 2 * ((X1 + B)^2 - A - C)\n var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n // E = 3 * A\n var e = a.redAdd(a).redIAdd(a);\n // F = E^2\n var f = e.redSqr();\n\n // 8 * C\n var c8 = c.redIAdd(c);\n c8 = c8.redIAdd(c8);\n c8 = c8.redIAdd(c8);\n\n // X3 = F - 2 * D\n nx = f.redISub(d).redISub(d);\n // Y3 = E * (D - X3) - 8 * C\n ny = e.redMul(d.redISub(nx)).redISub(c8);\n // Z3 = 2 * Y1 * Z1\n nz = this.y.redMul(this.z);\n nz = nz.redIAdd(nz);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._threeDbl = function _threeDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 15A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);\n // T = M^2 - 2 * S\n var t = m.redSqr().redISub(s).redISub(s);\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2 * Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n // 3M + 5S\n\n // delta = Z1^2\n var delta = this.z.redSqr();\n // gamma = Y1^2\n var gamma = this.y.redSqr();\n // beta = X1 * gamma\n var beta = this.x.redMul(gamma);\n // alpha = 3 * (X1 - delta) * (X1 + delta)\n var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n // X3 = alpha^2 - 8 * beta\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n nx = alpha.redSqr().redISub(beta8);\n // Z3 = (Y1 + Z1)^2 - gamma - delta\n nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n var ggamma8 = gamma.redSqr();\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._dbl = function _dbl() {\n var a = this.curve.a;\n\n // 4M + 6S + 10A\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n var jx2 = jx.redSqr();\n var jy2 = jy.redSqr();\n\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n\n var jyd8 = jy2.redSqr();\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n var ny = c.redMul(t2).redISub(jyd8);\n var nz = jy.redAdd(jy).redMul(jz);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.trpl = function trpl() {\n if (!this.curve.zeroA)\n return this.dbl().add(this);\n\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl\n // 5M + 10S + ...\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // ZZ = Z1^2\n var zz = this.z.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // M = 3 * XX + a * ZZ2; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // MM = M^2\n var mm = m.redSqr();\n // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM\n var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n e = e.redIAdd(e);\n e = e.redAdd(e).redIAdd(e);\n e = e.redISub(mm);\n // EE = E^2\n var ee = e.redSqr();\n // T = 16*YYYY\n var t = yyyy.redIAdd(yyyy);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n // U = (M + E)^2 - MM - EE - T\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);\n // X3 = 4 * (X1 * EE - 4 * YY * U)\n var yyu4 = yy.redMul(u);\n yyu4 = yyu4.redIAdd(yyu4);\n yyu4 = yyu4.redIAdd(yyu4);\n var nx = this.x.redMul(ee).redISub(yyu4);\n nx = nx.redIAdd(nx);\n nx = nx.redIAdd(nx);\n // Y3 = 8 * Y1 * (U * (T - U) - E * EE)\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n // Z3 = (Z1 + E)^2 - ZZ - EE\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mul = function mul(k, kbase) {\n k = new BN(k, kbase);\n\n return this.curve._wnafMul(this, k);\n};\n\nJPoint.prototype.eq = function eq(p) {\n if (p.type === 'affine')\n return this.eq(p.toJ());\n\n if (this === p)\n return true;\n\n // x1 * z2^2 == x2 * z1^2\n var z2 = this.z.redSqr();\n var pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)\n return false;\n\n // y1 * z2^3 == y2 * z1^3\n var z3 = z2.redMul(this.z);\n var pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n};\n\nJPoint.prototype.eqXToP = function eqXToP(x) {\n var zs = this.z.redSqr();\n var rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(zs);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\nJPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nJPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar utils = require('../utils');\n\nfunction MontCurve(conf) {\n Base.call(this, 'mont', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.i4 = new BN(4).toRed(this.red).redInvm();\n this.two = new BN(2).toRed(this.red);\n this.a24 = this.i4.redMul(this.a.redAdd(this.two));\n}\ninherits(MontCurve, Base);\nmodule.exports = MontCurve;\n\nMontCurve.prototype.validate = function validate(point) {\n var x = point.normalize().x;\n var x2 = x.redSqr();\n var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);\n var y = rhs.redSqrt();\n\n return y.redSqr().cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, z) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && z === null) {\n this.x = this.curve.one;\n this.z = this.curve.zero;\n } else {\n this.x = new BN(x, 16);\n this.z = new BN(z, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n }\n}\ninherits(Point, Base.BasePoint);\n\nMontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n};\n\nMontCurve.prototype.point = function point(x, z) {\n return new Point(this, x, z);\n};\n\nMontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nPoint.prototype.precompute = function precompute() {\n // No-op\n};\n\nPoint.prototype._encode = function _encode() {\n return this.getX().toArray('be', this.curve.p.byteLength());\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n\nPoint.prototype.dbl = function dbl() {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n // 2M + 2S + 4A\n\n // A = X1 + Z1\n var a = this.x.redAdd(this.z);\n // AA = A^2\n var aa = a.redSqr();\n // B = X1 - Z1\n var b = this.x.redSub(this.z);\n // BB = B^2\n var bb = b.redSqr();\n // C = AA - BB\n var c = aa.redSub(bb);\n // X3 = AA * BB\n var nx = aa.redMul(bb);\n // Z3 = C * (BB + A24 * C)\n var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.add = function add() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.diffAdd = function diffAdd(p, diff) {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3\n // 4M + 2S + 6A\n\n // A = X2 + Z2\n var a = this.x.redAdd(this.z);\n // B = X2 - Z2\n var b = this.x.redSub(this.z);\n // C = X3 + Z3\n var c = p.x.redAdd(p.z);\n // D = X3 - Z3\n var d = p.x.redSub(p.z);\n // DA = D * A\n var da = d.redMul(a);\n // CB = C * B\n var cb = c.redMul(b);\n // X5 = Z1 * (DA + CB)^2\n var nx = diff.z.redMul(da.redAdd(cb).redSqr());\n // Z5 = X1 * (DA - CB)^2\n var nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.mul = function mul(k) {\n var t = k.clone();\n var a = this; // (N / 2) * Q + Q\n var b = this.curve.point(null, null); // (N / 2) * Q\n var c = this; // Q\n\n for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))\n bits.push(t.andln(1));\n\n for (var i = bits.length - 1; i >= 0; i--) {\n if (bits[i] === 0) {\n // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q\n a = a.diffAdd(b, c);\n // N * Q = 2 * ((N / 2) * Q + Q))\n b = b.dbl();\n } else {\n // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)\n b = a.diffAdd(b, c);\n // N * Q + Q = 2 * ((N / 2) * Q + Q)\n a = a.dbl();\n }\n }\n return b;\n};\n\nPoint.prototype.mulAdd = function mulAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.jumlAdd = function jumlAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.eq = function eq(other) {\n return this.getX().cmp(other.getX()) === 0;\n};\n\nPoint.prototype.normalize = function normalize() {\n this.x = this.x.redMul(this.z.redInvm());\n this.z = this.curve.one;\n return this;\n};\n\nPoint.prototype.getX = function getX() {\n // Normalize coordinates\n this.normalize();\n\n return this.x.fromRed();\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction EdwardsCurve(conf) {\n // NOTE: Important as we are creating point in Base.call()\n this.twisted = (conf.a | 0) !== 1;\n this.mOneA = this.twisted && (conf.a | 0) === -1;\n this.extended = this.mOneA;\n\n Base.call(this, 'edwards', conf);\n\n this.a = new BN(conf.a, 16).umod(this.red.m);\n this.a = this.a.toRed(this.red);\n this.c = new BN(conf.c, 16).toRed(this.red);\n this.c2 = this.c.redSqr();\n this.d = new BN(conf.d, 16).toRed(this.red);\n this.dd = this.d.redAdd(this.d);\n\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);\n this.oneC = (conf.c | 0) === 1;\n}\ninherits(EdwardsCurve, Base);\nmodule.exports = EdwardsCurve;\n\nEdwardsCurve.prototype._mulA = function _mulA(num) {\n if (this.mOneA)\n return num.redNeg();\n else\n return this.a.redMul(num);\n};\n\nEdwardsCurve.prototype._mulC = function _mulC(num) {\n if (this.oneC)\n return num;\n else\n return this.c.redMul(num);\n};\n\n// Just for compatibility with Short curve\nEdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {\n return this.point(x, y, z, t);\n};\n\nEdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var x2 = x.redSqr();\n var rhs = this.c2.redSub(this.a.redMul(x2));\n var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));\n\n var y2 = rhs.redMul(lhs.redInvm());\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {\n y = new BN(y, 16);\n if (!y.red)\n y = y.toRed(this.red);\n\n // x^2 = (y^2 - c^2) / (c^2 d y^2 - a)\n var y2 = y.redSqr();\n var lhs = y2.redSub(this.c2);\n var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);\n var x2 = lhs.redMul(rhs.redInvm());\n\n if (x2.cmp(this.zero) === 0) {\n if (odd)\n throw new Error('invalid point');\n else\n return this.point(this.zero, y);\n }\n\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n if (x.fromRed().isOdd() !== odd)\n x = x.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.validate = function validate(point) {\n if (point.isInfinity())\n return true;\n\n // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)\n point.normalize();\n\n var x2 = point.x.redSqr();\n var y2 = point.y.redSqr();\n var lhs = x2.redMul(this.a).redAdd(y2);\n var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n\n return lhs.cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && y === null && z === null) {\n this.x = this.curve.zero;\n this.y = this.curve.one;\n this.z = this.curve.one;\n this.t = this.curve.zero;\n this.zOne = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = z ? new BN(z, 16) : this.curve.one;\n this.t = t && new BN(t, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n if (this.t && !this.t.red)\n this.t = this.t.toRed(this.curve.red);\n this.zOne = this.z === this.curve.one;\n\n // Use extended coordinates\n if (this.curve.extended && !this.t) {\n this.t = this.x.redMul(this.y);\n if (!this.zOne)\n this.t = this.t.redMul(this.z.redInvm());\n }\n }\n}\ninherits(Point, Base.BasePoint);\n\nEdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nEdwardsCurve.prototype.point = function point(x, y, z, t) {\n return new Point(this, x, y, z, t);\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.x.cmpn(0) === 0 &&\n (this.y.cmp(this.z) === 0 ||\n (this.zOne && this.y.cmp(this.curve.c) === 0));\n};\n\nPoint.prototype._extDbl = function _extDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #doubling-dbl-2008-hwcd\n // 4M + 4S\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = 2 * Z1^2\n var c = this.z.redSqr();\n c = c.redIAdd(c);\n // D = a * A\n var d = this.curve._mulA(a);\n // E = (X1 + Y1)^2 - A - B\n var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n // G = D + B\n var g = d.redAdd(b);\n // F = G - C\n var f = g.redSub(c);\n // H = D - B\n var h = d.redSub(b);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projDbl = function _projDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #doubling-dbl-2008-bbjlp\n // #doubling-dbl-2007-bl\n // and others\n // Generally 3M + 4S or 2M + 4S\n\n // B = (X1 + Y1)^2\n var b = this.x.redAdd(this.y).redSqr();\n // C = X1^2\n var c = this.x.redSqr();\n // D = Y1^2\n var d = this.y.redSqr();\n\n var nx;\n var ny;\n var nz;\n var e;\n var h;\n var j;\n if (this.curve.twisted) {\n // E = a * C\n e = this.curve._mulA(c);\n // F = E + D\n var f = e.redAdd(d);\n if (this.zOne) {\n // X3 = (B - C - D) * (F - 2)\n nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F^2 - 2 * F\n nz = f.redSqr().redSub(f).redSub(f);\n } else {\n // H = Z1^2\n h = this.z.redSqr();\n // J = F - 2 * H\n j = f.redSub(h).redISub(h);\n // X3 = (B-C-D)*J\n nx = b.redSub(c).redISub(d).redMul(j);\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F * J\n nz = f.redMul(j);\n }\n } else {\n // E = C + D\n e = c.redAdd(d);\n // H = (c * Z1)^2\n h = this.curve._mulC(this.z).redSqr();\n // J = E - 2 * H\n j = e.redSub(h).redSub(h);\n // X3 = c * (B - E) * J\n nx = this.curve._mulC(b.redISub(e)).redMul(j);\n // Y3 = c * E * (C - D)\n ny = this.curve._mulC(e).redMul(c.redISub(d));\n // Z3 = E * J\n nz = e.redMul(j);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n // Double in extended coordinates\n if (this.curve.extended)\n return this._extDbl();\n else\n return this._projDbl();\n};\n\nPoint.prototype._extAdd = function _extAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #addition-add-2008-hwcd-3\n // 8M\n\n // A = (Y1 - X1) * (Y2 - X2)\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n // B = (Y1 + X1) * (Y2 + X2)\n var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n // C = T1 * k * T2\n var c = this.t.redMul(this.curve.dd).redMul(p.t);\n // D = Z1 * 2 * Z2\n var d = this.z.redMul(p.z.redAdd(p.z));\n // E = B - A\n var e = b.redSub(a);\n // F = D - C\n var f = d.redSub(c);\n // G = D + C\n var g = d.redAdd(c);\n // H = B + A\n var h = b.redAdd(a);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projAdd = function _projAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #addition-add-2008-bbjlp\n // #addition-add-2007-bl\n // 10M + 1S\n\n // A = Z1 * Z2\n var a = this.z.redMul(p.z);\n // B = A^2\n var b = a.redSqr();\n // C = X1 * X2\n var c = this.x.redMul(p.x);\n // D = Y1 * Y2\n var d = this.y.redMul(p.y);\n // E = d * C * D\n var e = this.curve.d.redMul(c).redMul(d);\n // F = B - E\n var f = b.redSub(e);\n // G = B + E\n var g = b.redAdd(e);\n // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)\n var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);\n var nx = a.redMul(f).redMul(tmp);\n var ny;\n var nz;\n if (this.curve.twisted) {\n // Y3 = A * G * (D - a * C)\n ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));\n // Z3 = F * G\n nz = f.redMul(g);\n } else {\n // Y3 = A * G * (D - C)\n ny = a.redMul(g).redMul(d.redSub(c));\n // Z3 = c * F * G\n nz = this.curve._mulC(f).redMul(g);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.add = function add(p) {\n if (this.isInfinity())\n return p;\n if (p.isInfinity())\n return this;\n\n if (this.curve.extended)\n return this._extAdd(p);\n else\n return this._projAdd(p);\n};\n\nPoint.prototype.mul = function mul(k) {\n if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);\n};\n\nPoint.prototype.normalize = function normalize() {\n if (this.zOne)\n return this;\n\n // Normalize coordinates\n var zi = this.z.redInvm();\n this.x = this.x.redMul(zi);\n this.y = this.y.redMul(zi);\n if (this.t)\n this.t = this.t.redMul(zi);\n this.z = this.curve.one;\n this.zOne = true;\n return this;\n};\n\nPoint.prototype.neg = function neg() {\n return this.curve.point(this.x.redNeg(),\n this.y,\n this.z,\n this.t && this.t.redNeg());\n};\n\nPoint.prototype.getX = function getX() {\n this.normalize();\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n this.normalize();\n return this.y.fromRed();\n};\n\nPoint.prototype.eq = function eq(other) {\n return this === other ||\n this.getX().cmp(other.getX()) === 0 &&\n this.getY().cmp(other.getY()) === 0;\n};\n\nPoint.prototype.eqXToP = function eqXToP(x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(this.z);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\n// Compatibility with BaseCurve\nPoint.prototype.toP = Point.prototype.normalize;\nPoint.prototype.mixedAdd = Point.prototype.add;\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n 0x5A827999, 0x6ED9EBA1,\n 0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n if (!(this instanceof SHA1))\n return new SHA1();\n\n BlockHash.call(this);\n this.h = [\n 0x67452301, 0xefcdab89, 0x98badcfe,\n 0x10325476, 0xc3d2e1f0 ];\n this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n\n for(; i < W.length; i++)\n W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20);\n var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n e = d;\n d = c;\n c = rotl32(b, 30);\n b = a;\n a = t;\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n};\n\nSHA1.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0)\n return ch32(x, y, z);\n if (s === 1 || s === 3)\n return p32(x, y, z);\n if (s === 2)\n return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n if (!(this instanceof SHA224))\n return new SHA224();\n\n SHA256.call(this);\n this.h = [\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n // Just truncate output\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 7), 'big');\n else\n return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n if (!(this instanceof SHA384))\n return new SHA384();\n\n SHA512.call(this);\n this.h = [\n 0xcbbb9d5d, 0xc1059ed8,\n 0x629a292a, 0x367cd507,\n 0x9159015a, 0x3070dd17,\n 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31,\n 0x8eb44a87, 0x68581511,\n 0xdb0c2e0d, 0x64f98fa7,\n 0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 12), 'big');\n else\n return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n if (!(this instanceof Hmac))\n return new Hmac(hash, key, enc);\n this.Hash = hash;\n this.blockSize = hash.blockSize / 8;\n this.outSize = hash.outSize / 8;\n this.inner = null;\n this.outer = null;\n\n this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n // Shorten key, if needed\n if (key.length > this.blockSize)\n key = new this.Hash().update(key).digest();\n assert(key.length <= this.blockSize);\n\n // Add padding to key\n for (var i = key.length; i < this.blockSize; i++)\n key.push(0);\n\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x36;\n this.inner = new this.Hash().update(key);\n\n // 0x36 ^ 0x5c = 0x6a\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x6a;\n this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n this.inner.update(msg, enc);\n return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n this.outer.update(this.inner.digest());\n return this.outer.digest(enc);\n};\n","module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',\n 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821',\n ],\n [\n '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',\n '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf',\n ],\n [\n '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',\n 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695',\n ],\n [\n '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',\n '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9',\n ],\n [\n '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',\n '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36',\n ],\n [\n '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',\n '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f',\n ],\n [\n 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',\n '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999',\n ],\n [\n '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',\n 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09',\n ],\n [\n 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',\n '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d',\n ],\n [\n 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',\n 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088',\n ],\n [\n 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',\n '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d',\n ],\n [\n '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',\n '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8',\n ],\n [\n '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',\n '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a',\n ],\n [\n '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',\n '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453',\n ],\n [\n '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',\n '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160',\n ],\n [\n '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',\n '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0',\n ],\n [\n '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',\n '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6',\n ],\n [\n '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',\n '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589',\n ],\n [\n '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',\n 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17',\n ],\n [\n 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',\n '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda',\n ],\n [\n 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',\n '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd',\n ],\n [\n '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',\n '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2',\n ],\n [\n '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',\n '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6',\n ],\n [\n 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',\n '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f',\n ],\n [\n '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',\n 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01',\n ],\n [\n 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',\n '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3',\n ],\n [\n 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',\n 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f',\n ],\n [\n 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',\n '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7',\n ],\n [\n 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',\n 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78',\n ],\n [\n 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',\n '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1',\n ],\n [\n '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',\n 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150',\n ],\n [\n '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',\n '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82',\n ],\n [\n 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',\n '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc',\n ],\n [\n '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',\n 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b',\n ],\n [\n 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',\n '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51',\n ],\n [\n 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',\n '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45',\n ],\n [\n 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',\n 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120',\n ],\n [\n '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',\n '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84',\n ],\n [\n '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',\n '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d',\n ],\n [\n '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',\n 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d',\n ],\n [\n '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',\n '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8',\n ],\n [\n 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',\n '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8',\n ],\n [\n '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',\n '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac',\n ],\n [\n '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',\n 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f',\n ],\n [\n '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',\n '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962',\n ],\n [\n 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',\n '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907',\n ],\n [\n '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',\n 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec',\n ],\n [\n 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',\n 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d',\n ],\n [\n 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',\n '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414',\n ],\n [\n '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',\n 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd',\n ],\n [\n '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',\n 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0',\n ],\n [\n 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',\n '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811',\n ],\n [\n 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',\n '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1',\n ],\n [\n 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',\n '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c',\n ],\n [\n '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',\n 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73',\n ],\n [\n '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',\n '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd',\n ],\n [\n 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',\n 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405',\n ],\n [\n '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',\n 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589',\n ],\n [\n '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',\n '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e',\n ],\n [\n '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',\n '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27',\n ],\n [\n 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',\n 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1',\n ],\n [\n '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',\n '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482',\n ],\n [\n '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',\n '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945',\n ],\n [\n 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',\n '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573',\n ],\n [\n 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',\n 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82',\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',\n '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672',\n ],\n [\n '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',\n 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6',\n ],\n [\n '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',\n '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da',\n ],\n [\n 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',\n 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37',\n ],\n [\n '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',\n 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b',\n ],\n [\n 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',\n 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81',\n ],\n [\n 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',\n '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58',\n ],\n [\n 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',\n '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77',\n ],\n [\n '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',\n '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a',\n ],\n [\n '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',\n '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c',\n ],\n [\n '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',\n '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67',\n ],\n [\n '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',\n '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402',\n ],\n [\n 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',\n 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55',\n ],\n [\n 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',\n '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482',\n ],\n [\n '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',\n 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82',\n ],\n [\n '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',\n 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396',\n ],\n [\n '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',\n '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49',\n ],\n [\n '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',\n '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf',\n ],\n [\n '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',\n '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a',\n ],\n [\n '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',\n 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7',\n ],\n [\n 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',\n 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933',\n ],\n [\n '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',\n '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a',\n ],\n [\n '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',\n '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6',\n ],\n [\n 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',\n 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37',\n ],\n [\n '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',\n '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e',\n ],\n [\n 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',\n 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6',\n ],\n [\n 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',\n 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476',\n ],\n [\n '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',\n '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40',\n ],\n [\n '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',\n '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61',\n ],\n [\n '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',\n '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683',\n ],\n [\n 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',\n '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5',\n ],\n [\n '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',\n '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b',\n ],\n [\n 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',\n '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417',\n ],\n [\n '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',\n 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868',\n ],\n [\n '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',\n 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a',\n ],\n [\n 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',\n 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6',\n ],\n [\n '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',\n '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996',\n ],\n [\n '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',\n 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e',\n ],\n [\n 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',\n 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d',\n ],\n [\n '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',\n '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2',\n ],\n [\n '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',\n 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e',\n ],\n [\n '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',\n '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437',\n ],\n [\n '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',\n 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311',\n ],\n [\n 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',\n '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4',\n ],\n [\n '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',\n '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575',\n ],\n [\n '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',\n 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d',\n ],\n [\n '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',\n 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d',\n ],\n [\n 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',\n 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629',\n ],\n [\n 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',\n 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06',\n ],\n [\n '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',\n '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374',\n ],\n [\n '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',\n '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee',\n ],\n [\n 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',\n '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1',\n ],\n [\n 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',\n 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b',\n ],\n [\n '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',\n '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661',\n ],\n [\n '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',\n '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6',\n ],\n [\n 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',\n '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e',\n ],\n [\n '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',\n '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d',\n ],\n [\n 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',\n 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc',\n ],\n [\n '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',\n 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4',\n ],\n [\n '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',\n '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c',\n ],\n [\n 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',\n '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b',\n ],\n [\n 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',\n '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913',\n ],\n [\n '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',\n '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154',\n ],\n [\n '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',\n '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865',\n ],\n [\n '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',\n 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc',\n ],\n [\n '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',\n 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224',\n ],\n [\n '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',\n '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e',\n ],\n [\n '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',\n '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6',\n ],\n [\n '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',\n '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511',\n ],\n [\n '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',\n 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b',\n ],\n [\n 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',\n 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2',\n ],\n [\n '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',\n 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c',\n ],\n [\n 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',\n '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3',\n ],\n [\n 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',\n '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d',\n ],\n [\n 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',\n '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700',\n ],\n [\n 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',\n '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4',\n ],\n [\n '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',\n 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196',\n ],\n [\n '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',\n '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4',\n ],\n [\n '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',\n 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257',\n ],\n [\n 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',\n 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13',\n ],\n [\n 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',\n '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096',\n ],\n [\n 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',\n 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38',\n ],\n [\n 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',\n '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f',\n ],\n [\n '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',\n '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448',\n ],\n [\n 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',\n '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a',\n ],\n [\n 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',\n '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4',\n ],\n [\n '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',\n '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437',\n ],\n [\n '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',\n 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7',\n ],\n [\n 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',\n '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d',\n ],\n [\n 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',\n '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a',\n ],\n [\n 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',\n '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54',\n ],\n [\n '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',\n '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77',\n ],\n [\n 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',\n 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517',\n ],\n [\n '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',\n 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10',\n ],\n [\n 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',\n 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125',\n ],\n [\n 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',\n '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e',\n ],\n [\n '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',\n 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1',\n ],\n [\n 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',\n '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2',\n ],\n [\n 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',\n '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423',\n ],\n [\n 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',\n '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8',\n ],\n [\n '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',\n 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758',\n ],\n [\n '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',\n 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375',\n ],\n [\n 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',\n '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d',\n ],\n [\n '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',\n 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec',\n ],\n [\n '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',\n '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0',\n ],\n [\n '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',\n 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c',\n ],\n [\n 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',\n 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4',\n ],\n [\n '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',\n 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f',\n ],\n [\n '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',\n '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649',\n ],\n [\n '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',\n 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826',\n ],\n [\n '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',\n '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5',\n ],\n [\n 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',\n 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87',\n ],\n [\n '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',\n '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b',\n ],\n [\n 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',\n '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc',\n ],\n [\n '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',\n '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c',\n ],\n [\n 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',\n 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f',\n ],\n [\n 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',\n '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a',\n ],\n [\n 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',\n 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46',\n ],\n [\n '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',\n 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f',\n ],\n [\n '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',\n '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03',\n ],\n [\n '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',\n 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08',\n ],\n [\n '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',\n '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8',\n ],\n [\n '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',\n '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373',\n ],\n [\n '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',\n 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3',\n ],\n [\n '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',\n '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8',\n ],\n [\n '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',\n '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1',\n ],\n [\n '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',\n '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9',\n ],\n ],\n },\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n if (!(this instanceof EC))\n return new EC(options);\n\n // Shortcut `elliptic.ec(curve-name)`\n if (typeof options === 'string') {\n assert(Object.prototype.hasOwnProperty.call(curves, options),\n 'Unknown curve ' + options);\n\n options = curves[options];\n }\n\n // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n if (options instanceof curves.PresetCurve)\n options = { curve: options };\n\n this.curve = options.curve.curve;\n this.n = this.curve.n;\n this.nh = this.n.ushrn(1);\n this.g = this.curve.g;\n\n // Point on curve\n this.g = options.curve.g;\n this.g.precompute(options.curve.n.bitLength() + 1);\n\n // Hash for function for DRBG\n this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n if (!options)\n options = {};\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n nonce: this.n.toArray(),\n });\n\n var bytes = this.n.byteLength();\n var ns2 = this.n.sub(new BN(2));\n for (;;) {\n var priv = new BN(drbg.generate(bytes));\n if (priv.cmp(ns2) > 0)\n continue;\n\n priv.iaddn(1);\n return this.keyFromPrivate(priv);\n }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n if (delta > 0)\n msg = msg.ushrn(delta);\n if (!truncOnly && msg.cmp(this.n) >= 0)\n return msg.sub(this.n);\n else\n return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n if (typeof enc === 'object') {\n options = enc;\n enc = null;\n }\n if (!options)\n options = {};\n\n key = this.keyFromPrivate(key, enc);\n msg = this._truncateToN(new BN(msg, 16));\n\n // Zero-extend key to provide enough entropy\n var bytes = this.n.byteLength();\n var bkey = key.getPrivate().toArray('be', bytes);\n\n // Zero-extend nonce to have the same byte size as N\n var nonce = msg.toArray('be', bytes);\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce: nonce,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n });\n\n // Number of bytes to generate\n var ns1 = this.n.sub(new BN(1));\n\n for (var iter = 0; ; iter++) {\n var k = options.k ?\n options.k(iter) :\n new BN(drbg.generate(this.n.byteLength()));\n k = this._truncateToN(k, true);\n if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n continue;\n\n var kp = this.g.mul(k);\n if (kp.isInfinity())\n continue;\n\n var kpX = kp.getX();\n var r = kpX.umod(this.n);\n if (r.cmpn(0) === 0)\n continue;\n\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n s = s.umod(this.n);\n if (s.cmpn(0) === 0)\n continue;\n\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n (kpX.cmp(r) !== 0 ? 2 : 0);\n\n // Use complement of `s`, if it is > `n / 2`\n if (options.canonical && s.cmp(this.nh) > 0) {\n s = this.n.sub(s);\n recoveryParam ^= 1;\n }\n\n return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc) {\n msg = this._truncateToN(new BN(msg, 16));\n key = this.keyFromPublic(key, enc);\n signature = new Signature(signature, 'hex');\n\n // Perform primitive values validation\n var r = signature.r;\n var s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n return false;\n if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n return false;\n\n // Validate signature\n var sinv = s.invm(this.n);\n var u1 = sinv.mul(msg).umod(this.n);\n var u2 = sinv.mul(r).umod(this.n);\n var p;\n\n if (!this.curve._maxwellTrick) {\n p = this.g.mulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n return p.getX().umod(this.n).cmp(r) === 0;\n }\n\n // NOTE: Greg Maxwell's trick, inspired by:\n // https://git.io/vad3K\n\n p = this.g.jmulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n // Compare `p.x` of Jacobian point with `r`,\n // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n // inverse of `p.z^2`\n return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n assert((3 & j) === j, 'The recovery param is more than two bits');\n signature = new Signature(signature, enc);\n\n var n = this.n;\n var e = new BN(msg);\n var r = signature.r;\n var s = signature.s;\n\n // A set LSB signifies that the y-coordinate is odd\n var isYOdd = j & 1;\n var isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error('Unable to find sencond key candinate');\n\n // 1.1. Let x = r + jn.\n if (isSecondKey)\n r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n else\n r = this.curve.pointFromX(r, isYOdd);\n\n var rInv = signature.r.invm(n);\n var s1 = n.sub(e).mul(rInv).umod(n);\n var s2 = s.mul(rInv).umod(n);\n\n // 1.6.1 Compute Q = r^-1 (sR - eG)\n // Q = r^-1 (sR + -eG)\n return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n signature = new Signature(signature, enc);\n if (signature.recoveryParam !== null)\n return signature.recoveryParam;\n\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch (e) {\n continue;\n }\n\n if (Qprime.eq(Q))\n return i;\n }\n throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar utils = require('minimalistic-crypto-utils');\nvar assert = require('minimalistic-assert');\n\nfunction HmacDRBG(options) {\n if (!(this instanceof HmacDRBG))\n return new HmacDRBG(options);\n this.hash = options.hash;\n this.predResist = !!options.predResist;\n\n this.outLen = this.hash.outSize;\n this.minEntropy = options.minEntropy || this.hash.hmacStrength;\n\n this._reseed = null;\n this.reseedInterval = null;\n this.K = null;\n this.V = null;\n\n var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex');\n var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex');\n var pers = utils.toArray(options.pers, options.persEnc || 'hex');\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n this._init(entropy, nonce, pers);\n}\nmodule.exports = HmacDRBG;\n\nHmacDRBG.prototype._init = function init(entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n\n this.K = new Array(this.outLen / 8);\n this.V = new Array(this.outLen / 8);\n for (var i = 0; i < this.V.length; i++) {\n this.K[i] = 0x00;\n this.V[i] = 0x01;\n }\n\n this._update(seed);\n this._reseed = 1;\n this.reseedInterval = 0x1000000000000; // 2^48\n};\n\nHmacDRBG.prototype._hmac = function hmac() {\n return new hash.hmac(this.hash, this.K);\n};\n\nHmacDRBG.prototype._update = function update(seed) {\n var kmac = this._hmac()\n .update(this.V)\n .update([ 0x00 ]);\n if (seed)\n kmac = kmac.update(seed);\n this.K = kmac.digest();\n this.V = this._hmac().update(this.V).digest();\n if (!seed)\n return;\n\n this.K = this._hmac()\n .update(this.V)\n .update([ 0x01 ])\n .update(seed)\n .digest();\n this.V = this._hmac().update(this.V).digest();\n};\n\nHmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {\n // Optional entropy enc\n if (typeof entropyEnc !== 'string') {\n addEnc = add;\n add = entropyEnc;\n entropyEnc = null;\n }\n\n entropy = utils.toArray(entropy, entropyEnc);\n add = utils.toArray(add, addEnc);\n\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n\n this._update(entropy.concat(add || []));\n this._reseed = 1;\n};\n\nHmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval)\n throw new Error('Reseed is required');\n\n // Optional encoding\n if (typeof enc !== 'string') {\n addEnc = add;\n add = enc;\n enc = null;\n }\n\n // Optional additional data\n if (add) {\n add = utils.toArray(add, addEnc || 'hex');\n this._update(add);\n }\n\n var temp = [];\n while (temp.length < len) {\n this.V = this._hmac().update(this.V).digest();\n temp = temp.concat(this.V);\n }\n\n var res = temp.slice(0, len);\n this._update(add);\n this._reseed++;\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction KeyPair(ec, options) {\n this.ec = ec;\n this.priv = null;\n this.pub = null;\n\n // KeyPair(ec, { priv: ..., pub: ... })\n if (options.priv)\n this._importPrivate(options.priv, options.privEnc);\n if (options.pub)\n this._importPublic(options.pub, options.pubEnc);\n}\nmodule.exports = KeyPair;\n\nKeyPair.fromPublic = function fromPublic(ec, pub, enc) {\n if (pub instanceof KeyPair)\n return pub;\n\n return new KeyPair(ec, {\n pub: pub,\n pubEnc: enc,\n });\n};\n\nKeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {\n if (priv instanceof KeyPair)\n return priv;\n\n return new KeyPair(ec, {\n priv: priv,\n privEnc: enc,\n });\n};\n\nKeyPair.prototype.validate = function validate() {\n var pub = this.getPublic();\n\n if (pub.isInfinity())\n return { result: false, reason: 'Invalid public key' };\n if (!pub.validate())\n return { result: false, reason: 'Public key is not a point' };\n if (!pub.mul(this.ec.curve.n).isInfinity())\n return { result: false, reason: 'Public key * N != O' };\n\n return { result: true, reason: null };\n};\n\nKeyPair.prototype.getPublic = function getPublic(compact, enc) {\n // compact is optional argument\n if (typeof compact === 'string') {\n enc = compact;\n compact = null;\n }\n\n if (!this.pub)\n this.pub = this.ec.g.mul(this.priv);\n\n if (!enc)\n return this.pub;\n\n return this.pub.encode(enc, compact);\n};\n\nKeyPair.prototype.getPrivate = function getPrivate(enc) {\n if (enc === 'hex')\n return this.priv.toString(16, 2);\n else\n return this.priv;\n};\n\nKeyPair.prototype._importPrivate = function _importPrivate(key, enc) {\n this.priv = new BN(key, enc || 16);\n\n // Ensure that the priv won't be bigger than n, otherwise we may fail\n // in fixed multiplication method\n this.priv = this.priv.umod(this.ec.curve.n);\n};\n\nKeyPair.prototype._importPublic = function _importPublic(key, enc) {\n if (key.x || key.y) {\n // Montgomery points only have an `x` coordinate.\n // Weierstrass/Edwards points on the other hand have both `x` and\n // `y` coordinates.\n if (this.ec.curve.type === 'mont') {\n assert(key.x, 'Need x coordinate');\n } else if (this.ec.curve.type === 'short' ||\n this.ec.curve.type === 'edwards') {\n assert(key.x && key.y, 'Need both x and y coordinate');\n }\n this.pub = this.ec.curve.point(key.x, key.y);\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n};\n\n// ECDH\nKeyPair.prototype.derive = function derive(pub) {\n if(!pub.validate()) {\n assert(pub.validate(), 'public point not validated');\n }\n return pub.mul(this.priv).getX();\n};\n\n// ECDSA\nKeyPair.prototype.sign = function sign(msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n};\n\nKeyPair.prototype.verify = function verify(msg, signature) {\n return this.ec.verify(msg, signature, this);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n return '';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n if (options instanceof Signature)\n return options;\n\n if (this._importDER(options, enc))\n return;\n\n assert(options.r && options.s, 'Signature without r or s');\n this.r = new BN(options.r, 16);\n this.s = new BN(options.s, 16);\n if (options.recoveryParam === undefined)\n this.recoveryParam = null;\n else\n this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n this.place = 0;\n}\n\nfunction getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 0x80)) {\n return initial;\n }\n var octetLen = initial & 0xf;\n\n // Indefinite length or overflow\n if (octetLen === 0 || octetLen > 4) {\n return false;\n }\n\n var val = 0;\n for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n val <<= 8;\n val |= buf[off];\n val >>>= 0;\n }\n\n // Leading zeroes\n if (val <= 0x7f) {\n return false;\n }\n\n p.place = off;\n return val;\n}\n\nfunction rmPadding(buf) {\n var i = 0;\n var len = buf.length - 1;\n while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n i++;\n }\n if (i === 0) {\n return buf;\n }\n return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 0x30) {\n return false;\n }\n var len = getLength(data, p);\n if (len === false) {\n return false;\n }\n if ((len + p.place) !== data.length) {\n return false;\n }\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var rlen = getLength(data, p);\n if (rlen === false) {\n return false;\n }\n var r = data.slice(p.place, rlen + p.place);\n p.place += rlen;\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var slen = getLength(data, p);\n if (slen === false) {\n return false;\n }\n if (data.length !== slen + p.place) {\n return false;\n }\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0) {\n if (r[1] & 0x80) {\n r = r.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n if (s[0] === 0) {\n if (s[1] & 0x80) {\n s = s.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n\n this.r = new BN(r);\n this.s = new BN(s);\n this.recoveryParam = null;\n\n return true;\n};\n\nfunction constructLength(arr, len) {\n if (len < 0x80) {\n arr.push(len);\n return;\n }\n var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n arr.push(octets | 0x80);\n while (--octets) {\n arr.push((len >>> (octets << 3)) & 0xff);\n }\n arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n var r = this.r.toArray();\n var s = this.s.toArray();\n\n // Pad values\n if (r[0] & 0x80)\n r = [ 0 ].concat(r);\n // Pad values\n if (s[0] & 0x80)\n s = [ 0 ].concat(s);\n\n r = rmPadding(r);\n s = rmPadding(s);\n\n while (!s[0] && !(s[1] & 0x80)) {\n s = s.slice(1);\n }\n var arr = [ 0x02 ];\n constructLength(arr, r.length);\n arr = arr.concat(r);\n arr.push(0x02);\n constructLength(arr, s.length);\n var backHalf = arr.concat(s);\n var res = [ 0x30 ];\n constructLength(res, backHalf.length);\n res = res.concat(backHalf);\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n if (!(this instanceof EDDSA))\n return new EDDSA(curve);\n\n curve = curves[curve].curve;\n this.curve = curve;\n this.g = curve.g;\n this.g.precompute(curve.n.bitLength() + 1);\n\n this.pointClass = curve.point().constructor;\n this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret);\n var r = this.hashInt(key.messagePrefix(), message);\n var R = this.g.mul(r);\n var Rencoded = this.encodePoint(R);\n var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n .mul(key.priv());\n var S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n message = parseBytes(message);\n sig = this.makeSignature(sig);\n var key = this.keyFromPublic(pub);\n var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n var SG = this.g.mul(sig.S());\n var RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n var hash = this.hash();\n for (var i = 0; i < arguments.length; i++)\n hash.update(arguments[i]);\n return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n if (sig instanceof Signature)\n return sig;\n return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n var enc = point.getY().toArray('le', this.encodingLength);\n enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n bytes = utils.parseBytes(bytes);\n\n var lastIx = bytes.length - 1;\n var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n var y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n this.eddsa = eddsa;\n this._secret = parseBytes(params.secret);\n if (eddsa.isPoint(params.pub))\n this._pub = params.pub;\n else\n this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n if (pub instanceof KeyPair)\n return pub;\n return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n if (secret instanceof KeyPair)\n return secret;\n return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n if (this._pubBytes)\n return this.eddsa.decodePoint(this._pubBytes);\n return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n var eddsa = this.eddsa;\n var hash = this.hash();\n var lastIx = eddsa.encodingLength - 1;\n\n var a = hash.slice(0, eddsa.encodingLength);\n a[0] &= 248;\n a[lastIx] &= 127;\n a[lastIx] |= 64;\n\n return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n assert(this._secret, 'KeyPair can only verify');\n return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n assert(this._secret, 'KeyPair is public only');\n return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array|Object} sig -\n* @param {Array|Point} [sig.R] - R point as Point or bytes\n* @param {Array|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array} [sig.Rencoded] - R point encoded\n* @param {Array} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n this.eddsa = eddsa;\n\n if (typeof sig !== 'object')\n sig = parseBytes(sig);\n\n if (Array.isArray(sig)) {\n sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n };\n }\n\n assert(sig.R && sig.S, 'Signature without R or S');\n\n if (eddsa.isPoint(sig.R))\n this._R = sig.R;\n if (sig.S instanceof BN)\n this._S = sig.S;\n\n this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","module.exports = require('events').EventEmitter;\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined\n * in FIPS PUB 180-1\n * This source code is derived from sha1.js of the same repository.\n * The difference between SHA-0 and SHA-1 is just a bitwise rotate left\n * operation was added.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha () {\n this.init()\n this._w = W\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha, Hash)\n\nSha.prototype.init = function () {\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n\n return this\n}\n\nfunction rotl5 (num) {\n return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n if (s === 0) return (b & c) | ((~b) & d)\n if (s === 2) return (b & c) | (b & d) | (c & d)\n return b ^ c ^ d\n}\n\nSha.prototype._update = function (M) {\n var W = this._w\n\n var a = this._a | 0\n var b = this._b | 0\n var c = this._c | 0\n var d = this._d | 0\n var e = this._e | 0\n\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]\n\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20)\n var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n e = d\n d = c\n c = rotl30(b)\n b = a\n a = t\n }\n\n this._a = (a + this._a) | 0\n this._b = (b + this._b) | 0\n this._c = (c + this._c) | 0\n this._d = (d + this._d) | 0\n this._e = (e + this._e) | 0\n}\n\nSha.prototype._hash = function () {\n var H = Buffer.allocUnsafe(20)\n\n H.writeInt32BE(this._a | 0, 0)\n H.writeInt32BE(this._b | 0, 4)\n H.writeInt32BE(this._c | 0, 8)\n H.writeInt32BE(this._d | 0, 12)\n H.writeInt32BE(this._e | 0, 16)\n\n return H\n}\n\nmodule.exports = Sha\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha1 () {\n this.init()\n this._w = W\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha1, Hash)\n\nSha1.prototype.init = function () {\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n\n return this\n}\n\nfunction rotl1 (num) {\n return (num << 1) | (num >>> 31)\n}\n\nfunction rotl5 (num) {\n return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n if (s === 0) return (b & c) | ((~b) & d)\n if (s === 2) return (b & c) | (b & d) | (c & d)\n return b ^ c ^ d\n}\n\nSha1.prototype._update = function (M) {\n var W = this._w\n\n var a = this._a | 0\n var b = this._b | 0\n var c = this._c | 0\n var d = this._d | 0\n var e = this._e | 0\n\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16])\n\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20)\n var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n e = d\n d = c\n c = rotl30(b)\n b = a\n a = t\n }\n\n this._a = (a + this._a) | 0\n this._b = (b + this._b) | 0\n this._c = (c + this._c) | 0\n this._d = (d + this._d) | 0\n this._e = (e + this._e) | 0\n}\n\nSha1.prototype._hash = function () {\n var H = Buffer.allocUnsafe(20)\n\n H.writeInt32BE(this._a | 0, 0)\n H.writeInt32BE(this._b | 0, 4)\n H.writeInt32BE(this._c | 0, 8)\n H.writeInt32BE(this._d | 0, 12)\n H.writeInt32BE(this._e | 0, 16)\n\n return H\n}\n\nmodule.exports = Sha1\n","/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\n\nvar inherits = require('inherits')\nvar Sha256 = require('./sha256')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(64)\n\nfunction Sha224 () {\n this.init()\n\n this._w = W // new Array(64)\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha224, Sha256)\n\nSha224.prototype.init = function () {\n this._a = 0xc1059ed8\n this._b = 0x367cd507\n this._c = 0x3070dd17\n this._d = 0xf70e5939\n this._e = 0xffc00b31\n this._f = 0x68581511\n this._g = 0x64f98fa7\n this._h = 0xbefa4fa4\n\n return this\n}\n\nSha224.prototype._hash = function () {\n var H = Buffer.allocUnsafe(28)\n\n H.writeInt32BE(this._a, 0)\n H.writeInt32BE(this._b, 4)\n H.writeInt32BE(this._c, 8)\n H.writeInt32BE(this._d, 12)\n H.writeInt32BE(this._e, 16)\n H.writeInt32BE(this._f, 20)\n H.writeInt32BE(this._g, 24)\n\n return H\n}\n\nmodule.exports = Sha224\n","var inherits = require('inherits')\nvar SHA512 = require('./sha512')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(160)\n\nfunction Sha384 () {\n this.init()\n this._w = W\n\n Hash.call(this, 128, 112)\n}\n\ninherits(Sha384, SHA512)\n\nSha384.prototype.init = function () {\n this._ah = 0xcbbb9d5d\n this._bh = 0x629a292a\n this._ch = 0x9159015a\n this._dh = 0x152fecd8\n this._eh = 0x67332667\n this._fh = 0x8eb44a87\n this._gh = 0xdb0c2e0d\n this._hh = 0x47b5481d\n\n this._al = 0xc1059ed8\n this._bl = 0x367cd507\n this._cl = 0x3070dd17\n this._dl = 0xf70e5939\n this._el = 0xffc00b31\n this._fl = 0x68581511\n this._gl = 0x64f98fa7\n this._hl = 0xbefa4fa4\n\n return this\n}\n\nSha384.prototype._hash = function () {\n var H = Buffer.allocUnsafe(48)\n\n function writeInt64BE (h, l, offset) {\n H.writeInt32BE(h, offset)\n H.writeInt32BE(l, offset + 4)\n }\n\n writeInt64BE(this._ah, this._al, 0)\n writeInt64BE(this._bh, this._bl, 8)\n writeInt64BE(this._ch, this._cl, 16)\n writeInt64BE(this._dh, this._dl, 24)\n writeInt64BE(this._eh, this._el, 32)\n writeInt64BE(this._fh, this._fl, 40)\n\n return H\n}\n\nmodule.exports = Sha384\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nmodule.exports = Stream;\n\nvar EE = require('events').EventEmitter;\nvar inherits = require('inherits');\n\ninherits(Stream, EE);\nStream.Readable = require('readable-stream/lib/_stream_readable.js');\nStream.Writable = require('readable-stream/lib/_stream_writable.js');\nStream.Duplex = require('readable-stream/lib/_stream_duplex.js');\nStream.Transform = require('readable-stream/lib/_stream_transform.js');\nStream.PassThrough = require('readable-stream/lib/_stream_passthrough.js');\nStream.finished = require('readable-stream/lib/internal/streams/end-of-stream.js')\nStream.pipeline = require('readable-stream/lib/internal/streams/pipeline.js')\n\n// Backwards-compat with node 0.4.x\nStream.Stream = Stream;\n\n\n\n// old-style streams. Note that the pipe method (the only relevant\n// part of this class) is overridden in the Readable class.\n\nfunction Stream() {\n EE.call(this);\n}\n\nStream.prototype.pipe = function(dest, options) {\n var source = this;\n\n function ondata(chunk) {\n if (dest.writable) {\n if (false === dest.write(chunk) && source.pause) {\n source.pause();\n }\n }\n }\n\n source.on('data', ondata);\n\n function ondrain() {\n if (source.readable && source.resume) {\n source.resume();\n }\n }\n\n dest.on('drain', ondrain);\n\n // If the 'end' option is not supplied, dest.end() will be called when\n // source gets the 'end' or 'close' events. Only dest.end() once.\n if (!dest._isStdio && (!options || options.end !== false)) {\n source.on('end', onend);\n source.on('close', onclose);\n }\n\n var didOnEnd = false;\n function onend() {\n if (didOnEnd) return;\n didOnEnd = true;\n\n dest.end();\n }\n\n\n function onclose() {\n if (didOnEnd) return;\n didOnEnd = true;\n\n if (typeof dest.destroy === 'function') dest.destroy();\n }\n\n // don't leave dangling pipes when there are errors.\n function onerror(er) {\n cleanup();\n if (EE.listenerCount(this, 'error') === 0) {\n throw er; // Unhandled stream error in pipe.\n }\n }\n\n source.on('error', onerror);\n dest.on('error', onerror);\n\n // remove all the event listeners that were added.\n function cleanup() {\n source.removeListener('data', ondata);\n dest.removeListener('drain', ondrain);\n\n source.removeListener('end', onend);\n source.removeListener('close', onclose);\n\n source.removeListener('error', onerror);\n dest.removeListener('error', onerror);\n\n source.removeListener('end', cleanup);\n source.removeListener('close', cleanup);\n\n dest.removeListener('close', cleanup);\n }\n\n source.on('end', cleanup);\n source.on('close', cleanup);\n\n dest.on('close', cleanup);\n\n dest.emit('pipe', source);\n\n // Allow for unix-like usage: A.pipe(B).pipe(C)\n return dest;\n};\n","module.exports = require('events').EventEmitter;\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","var Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar sync = require('./sync')\nvar toBuffer = require('./to-buffer')\n\nvar ZERO_BUF\nvar subtle = global.crypto && global.crypto.subtle\nvar toBrowser = {\n sha: 'SHA-1',\n 'sha-1': 'SHA-1',\n sha1: 'SHA-1',\n sha256: 'SHA-256',\n 'sha-256': 'SHA-256',\n sha384: 'SHA-384',\n 'sha-384': 'SHA-384',\n 'sha-512': 'SHA-512',\n sha512: 'SHA-512'\n}\nvar checks = []\nfunction checkNative (algo) {\n if (global.process && !global.process.browser) {\n return Promise.resolve(false)\n }\n if (!subtle || !subtle.importKey || !subtle.deriveBits) {\n return Promise.resolve(false)\n }\n if (checks[algo] !== undefined) {\n return checks[algo]\n }\n ZERO_BUF = ZERO_BUF || Buffer.alloc(8)\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return true\n }).catch(function () {\n return false\n })\n checks[algo] = prom\n return prom\n}\nvar nextTick\nfunction getNextTick () {\n if (nextTick) {\n return nextTick\n }\n if (global.process && global.process.nextTick) {\n nextTick = global.process.nextTick\n } else if (global.queueMicrotask) {\n nextTick = global.queueMicrotask\n } else if (global.setImmediate) {\n nextTick = global.setImmediate\n } else {\n nextTick = global.setTimeout\n }\n return nextTick\n}\nfunction browserPbkdf2 (password, salt, iterations, length, algo) {\n return subtle.importKey(\n 'raw', password, { name: 'PBKDF2' }, false, ['deriveBits']\n ).then(function (key) {\n return subtle.deriveBits({\n name: 'PBKDF2',\n salt: salt,\n iterations: iterations,\n hash: {\n name: algo\n }\n }, key, length << 3)\n }).then(function (res) {\n return Buffer.from(res)\n })\n}\n\nfunction resolvePromise (promise, callback) {\n promise.then(function (out) {\n getNextTick()(function () {\n callback(null, out)\n })\n }, function (e) {\n getNextTick()(function () {\n callback(e)\n })\n })\n}\nmodule.exports = function (password, salt, iterations, keylen, digest, callback) {\n if (typeof digest === 'function') {\n callback = digest\n digest = undefined\n }\n\n digest = digest || 'sha1'\n var algo = toBrowser[digest.toLowerCase()]\n\n if (!algo || typeof global.Promise !== 'function') {\n getNextTick()(function () {\n var out\n try {\n out = sync(password, salt, iterations, keylen, digest)\n } catch (e) {\n return callback(e)\n }\n callback(null, out)\n })\n return\n }\n\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')\n\n resolvePromise(checkNative(algo).then(function (resp) {\n if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo)\n\n return sync(password, salt, iterations, keylen, digest)\n }), callback)\n}\n","var assert = require('assert')\nvar Buffer = require('safe-buffer').Buffer\nvar crypto = require('crypto')\nvar bs58check = require('bs58check')\nvar secp256k1 = require('secp256k1')\n\nvar MASTER_SECRET = Buffer.from('Bitcoin seed', 'utf8')\nvar HARDENED_OFFSET = 0x80000000\nvar LEN = 78\n\n// Bitcoin hardcoded by default, can use package `coininfo` for others\nvar BITCOIN_VERSIONS = {private: 0x0488ADE4, public: 0x0488B21E}\n\nfunction HDKey (versions) {\n this.versions = versions || BITCOIN_VERSIONS\n this.depth = 0\n this.index = 0\n this._privateKey = null\n this._publicKey = null\n this.chainCode = null\n this._fingerprint = 0\n this.parentFingerprint = 0\n}\n\nObject.defineProperty(HDKey.prototype, 'fingerprint', { get: function () { return this._fingerprint } })\nObject.defineProperty(HDKey.prototype, 'identifier', { get: function () { return this._identifier } })\nObject.defineProperty(HDKey.prototype, 'pubKeyHash', { get: function () { return this.identifier } })\n\nObject.defineProperty(HDKey.prototype, 'privateKey', {\n get: function () {\n return this._privateKey\n },\n set: function (value) {\n assert.equal(value.length, 32, 'Private key must be 32 bytes.')\n assert(secp256k1.privateKeyVerify(value) === true, 'Invalid private key')\n\n this._privateKey = value\n this._publicKey = secp256k1.publicKeyCreate(value, true)\n this._identifier = hash160(this.publicKey)\n this._fingerprint = this._identifier.slice(0, 4).readUInt32BE(0)\n }\n})\n\nObject.defineProperty(HDKey.prototype, 'publicKey', {\n get: function () {\n return this._publicKey\n },\n set: function (value) {\n assert(value.length === 33 || value.length === 65, 'Public key must be 33 or 65 bytes.')\n assert(secp256k1.publicKeyVerify(value) === true, 'Invalid public key')\n\n this._publicKey = secp256k1.publicKeyConvert(value, true) // force compressed point\n this._identifier = hash160(this.publicKey)\n this._fingerprint = this._identifier.slice(0, 4).readUInt32BE(0)\n this._privateKey = null\n }\n})\n\nObject.defineProperty(HDKey.prototype, 'privateExtendedKey', {\n get: function () {\n if (this._privateKey) return bs58check.encode(serialize(this, this.versions.private, Buffer.concat([Buffer.alloc(1, 0), this.privateKey])))\n else return null\n }\n})\n\nObject.defineProperty(HDKey.prototype, 'publicExtendedKey', {\n get: function () {\n return bs58check.encode(serialize(this, this.versions.public, this.publicKey))\n }\n})\n\nHDKey.prototype.derive = function (path) {\n if (path === 'm' || path === 'M' || path === \"m'\" || path === \"M'\") {\n return this\n }\n\n var entries = path.split('/')\n var hdkey = this\n entries.forEach(function (c, i) {\n if (i === 0) {\n assert(/^[mM]{1}/.test(c), 'Path must start with \"m\" or \"M\"')\n return\n }\n\n var hardened = (c.length > 1) && (c[c.length - 1] === \"'\")\n var childIndex = parseInt(c, 10) // & (HARDENED_OFFSET - 1)\n assert(childIndex < HARDENED_OFFSET, 'Invalid index')\n if (hardened) childIndex += HARDENED_OFFSET\n\n hdkey = hdkey.deriveChild(childIndex)\n })\n\n return hdkey\n}\n\nHDKey.prototype.deriveChild = function (index) {\n var isHardened = index >= HARDENED_OFFSET\n var indexBuffer = Buffer.allocUnsafe(4)\n indexBuffer.writeUInt32BE(index, 0)\n\n var data\n\n if (isHardened) { // Hardened child\n assert(this.privateKey, 'Could not derive hardened child key')\n\n var pk = this.privateKey\n var zb = Buffer.alloc(1, 0)\n pk = Buffer.concat([zb, pk])\n\n // data = 0x00 || ser256(kpar) || ser32(index)\n data = Buffer.concat([pk, indexBuffer])\n } else { // Normal child\n // data = serP(point(kpar)) || ser32(index)\n // = serP(Kpar) || ser32(index)\n data = Buffer.concat([this.publicKey, indexBuffer])\n }\n\n var I = crypto.createHmac('sha512', this.chainCode).update(data).digest()\n var IL = I.slice(0, 32)\n var IR = I.slice(32)\n\n var hd = new HDKey(this.versions)\n\n // Private parent key -> private child key\n if (this.privateKey) {\n // ki = parse256(IL) + kpar (mod n)\n try {\n hd.privateKey = secp256k1.privateKeyTweakAdd(this.privateKey, IL)\n // throw if IL >= n || (privateKey + IL) === 0\n } catch (err) {\n // In case parse256(IL) >= n or ki == 0, one should proceed with the next value for i\n return this.deriveChild(index + 1)\n }\n // Public parent key -> public child key\n } else {\n // Ki = point(parse256(IL)) + Kpar\n // = G*IL + Kpar\n try {\n hd.publicKey = secp256k1.publicKeyTweakAdd(this.publicKey, IL, true)\n // throw if IL >= n || (g**IL + publicKey) is infinity\n } catch (err) {\n // In case parse256(IL) >= n or Ki is the point at infinity, one should proceed with the next value for i\n return this.deriveChild(index + 1)\n }\n }\n\n hd.chainCode = IR\n hd.depth = this.depth + 1\n hd.parentFingerprint = this.fingerprint// .readUInt32BE(0)\n hd.index = index\n\n return hd\n}\n\nHDKey.prototype.sign = function (hash) {\n return secp256k1.sign(hash, this.privateKey).signature\n}\n\nHDKey.prototype.verify = function (hash, signature) {\n return secp256k1.verify(hash, signature, this.publicKey)\n}\n\nHDKey.prototype.wipePrivateData = function () {\n if (this._privateKey) crypto.randomBytes(this._privateKey.length).copy(this._privateKey)\n this._privateKey = null\n return this\n}\n\nHDKey.prototype.toJSON = function () {\n return {\n xpriv: this.privateExtendedKey,\n xpub: this.publicExtendedKey\n }\n}\n\nHDKey.fromMasterSeed = function (seedBuffer, versions) {\n var I = crypto.createHmac('sha512', MASTER_SECRET).update(seedBuffer).digest()\n var IL = I.slice(0, 32)\n var IR = I.slice(32)\n\n var hdkey = new HDKey(versions)\n hdkey.chainCode = IR\n hdkey.privateKey = IL\n\n return hdkey\n}\n\nHDKey.fromExtendedKey = function (base58key, versions) {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n versions = versions || BITCOIN_VERSIONS\n var hdkey = new HDKey(versions)\n\n var keyBuffer = bs58check.decode(base58key)\n\n var version = keyBuffer.readUInt32BE(0)\n assert(version === versions.private || version === versions.public, 'Version mismatch: does not match private or public')\n\n hdkey.depth = keyBuffer.readUInt8(4)\n hdkey.parentFingerprint = keyBuffer.readUInt32BE(5)\n hdkey.index = keyBuffer.readUInt32BE(9)\n hdkey.chainCode = keyBuffer.slice(13, 45)\n\n var key = keyBuffer.slice(45)\n if (key.readUInt8(0) === 0) { // private\n assert(version === versions.private, 'Version mismatch: version does not match private')\n hdkey.privateKey = key.slice(1) // cut off first 0x0 byte\n } else {\n assert(version === versions.public, 'Version mismatch: version does not match public')\n hdkey.publicKey = key\n }\n\n return hdkey\n}\n\nHDKey.fromJSON = function (obj) {\n return HDKey.fromExtendedKey(obj.xpriv)\n}\n\nfunction serialize (hdkey, version, key) {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n var buffer = Buffer.allocUnsafe(LEN)\n\n buffer.writeUInt32BE(version, 0)\n buffer.writeUInt8(hdkey.depth, 4)\n\n var fingerprint = hdkey.depth ? hdkey.parentFingerprint : 0x00000000\n buffer.writeUInt32BE(fingerprint, 5)\n buffer.writeUInt32BE(hdkey.index, 9)\n\n hdkey.chainCode.copy(buffer, 13)\n key.copy(buffer, 45)\n\n return buffer\n}\n\nfunction hash160 (buf) {\n var sha = crypto.createHash('sha256').update(buf).digest()\n return crypto.createHash('ripemd160').update(sha).digest()\n}\n\nHDKey.HARDENED_OFFSET = HARDENED_OFFSET\nmodule.exports = HDKey\n","// Currently in sync with Node.js lib/internal/errors.js\n// https://github.com/nodejs/node/commit/3b044962c48fe313905877a96b5d0894a5404f6f\n\n/* eslint node-core/documented-errors: \"error\" */\n\n/* eslint node-core/alphabetize-errors: \"error\" */\n\n/* eslint node-core/prefer-util-format-errors: \"error\" */\n'use strict'; // The whole point behind this internal module is to allow Node.js to no\n// longer be forced to treat every error message change as a semver-major\n// change. The NodeError classes here all expose a `code` property whose\n// value statically and permanently identifies the error. While the error\n// message may change, the code should not.\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nvar codes = {}; // Lazy loaded\n\nvar assert;\nvar util;\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inherits(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n var _this;\n\n _classCallCheck(this, NodeError);\n\n _this = _possibleConstructorReturn(this, _getPrototypeOf(NodeError).call(this, getMessage(arg1, arg2, arg3)));\n _this.code = code;\n return _this;\n }\n\n return NodeError;\n }(Base);\n\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_AMBIGUOUS_ARGUMENT', 'The \"%s\" argument is ambiguous. %s', TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n if (assert === undefined) assert = require('../assert');\n assert(typeof name === 'string', \"'name' must be a string\"); // determiner: 'must be' or 'must not be'\n\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } // TODO(BridgeAR): Improve the output by showing `null` and similar.\n\n\n msg += \". Received type \".concat(_typeof(actual));\n return msg;\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_VALUE', function (name, value) {\n var reason = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'is invalid';\n if (util === undefined) util = require('util/');\n var inspected = util.inspect(value);\n\n if (inspected.length > 128) {\n inspected = \"\".concat(inspected.slice(0, 128), \"...\");\n }\n\n return \"The argument '\".concat(name, \"' \").concat(reason, \". Received \").concat(inspected);\n}, TypeError, RangeError);\ncreateErrorType('ERR_INVALID_RETURN_VALUE', function (input, name, value) {\n var type;\n\n if (value && value.constructor && value.constructor.name) {\n type = \"instance of \".concat(value.constructor.name);\n } else {\n type = \"type \".concat(_typeof(value));\n }\n\n return \"Expected \".concat(input, \" to be returned from the \\\"\").concat(name, \"\\\"\") + \" function but got \".concat(type, \".\");\n}, TypeError);\ncreateErrorType('ERR_MISSING_ARGS', function () {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n if (assert === undefined) assert = require('../assert');\n assert(args.length > 0, 'At least one arg needs to be specified');\n var msg = 'The ';\n var len = args.length;\n args = args.map(function (a) {\n return \"\\\"\".concat(a, \"\\\"\");\n });\n\n switch (len) {\n case 1:\n msg += \"\".concat(args[0], \" argument\");\n break;\n\n case 2:\n msg += \"\".concat(args[0], \" and \").concat(args[1], \" arguments\");\n break;\n\n default:\n msg += args.slice(0, len - 1).join(', ');\n msg += \", and \".concat(args[len - 1], \" arguments\");\n break;\n }\n\n return \"\".concat(msg, \" must be specified\");\n}, TypeError);\nmodule.exports.codes = codes;","// Currently in sync with Node.js lib/internal/util/types.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n'use strict';\n\nvar isArgumentsObject = require('is-arguments');\nvar isGeneratorFunction = require('is-generator-function');\nvar whichTypedArray = require('which-typed-array');\nvar isTypedArray = require('is-typed-array');\n\nfunction uncurryThis(f) {\n return f.call.bind(f);\n}\n\nvar BigIntSupported = typeof BigInt !== 'undefined';\nvar SymbolSupported = typeof Symbol !== 'undefined';\n\nvar ObjectToString = uncurryThis(Object.prototype.toString);\n\nvar numberValue = uncurryThis(Number.prototype.valueOf);\nvar stringValue = uncurryThis(String.prototype.valueOf);\nvar booleanValue = uncurryThis(Boolean.prototype.valueOf);\n\nif (BigIntSupported) {\n var bigIntValue = uncurryThis(BigInt.prototype.valueOf);\n}\n\nif (SymbolSupported) {\n var symbolValue = uncurryThis(Symbol.prototype.valueOf);\n}\n\nfunction checkBoxedPrimitive(value, prototypeValueOf) {\n if (typeof value !== 'object') {\n return false;\n }\n try {\n prototypeValueOf(value);\n return true;\n } catch(e) {\n return false;\n }\n}\n\nexports.isArgumentsObject = isArgumentsObject;\nexports.isGeneratorFunction = isGeneratorFunction;\nexports.isTypedArray = isTypedArray;\n\n// Taken from here and modified for better browser support\n// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js\nfunction isPromise(input) {\n\treturn (\n\t\t(\n\t\t\ttypeof Promise !== 'undefined' &&\n\t\t\tinput instanceof Promise\n\t\t) ||\n\t\t(\n\t\t\tinput !== null &&\n\t\t\ttypeof input === 'object' &&\n\t\t\ttypeof input.then === 'function' &&\n\t\t\ttypeof input.catch === 'function'\n\t\t)\n\t);\n}\nexports.isPromise = isPromise;\n\nfunction isArrayBufferView(value) {\n if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n return ArrayBuffer.isView(value);\n }\n\n return (\n isTypedArray(value) ||\n isDataView(value)\n );\n}\nexports.isArrayBufferView = isArrayBufferView;\n\n\nfunction isUint8Array(value) {\n return whichTypedArray(value) === 'Uint8Array';\n}\nexports.isUint8Array = isUint8Array;\n\nfunction isUint8ClampedArray(value) {\n return whichTypedArray(value) === 'Uint8ClampedArray';\n}\nexports.isUint8ClampedArray = isUint8ClampedArray;\n\nfunction isUint16Array(value) {\n return whichTypedArray(value) === 'Uint16Array';\n}\nexports.isUint16Array = isUint16Array;\n\nfunction isUint32Array(value) {\n return whichTypedArray(value) === 'Uint32Array';\n}\nexports.isUint32Array = isUint32Array;\n\nfunction isInt8Array(value) {\n return whichTypedArray(value) === 'Int8Array';\n}\nexports.isInt8Array = isInt8Array;\n\nfunction isInt16Array(value) {\n return whichTypedArray(value) === 'Int16Array';\n}\nexports.isInt16Array = isInt16Array;\n\nfunction isInt32Array(value) {\n return whichTypedArray(value) === 'Int32Array';\n}\nexports.isInt32Array = isInt32Array;\n\nfunction isFloat32Array(value) {\n return whichTypedArray(value) === 'Float32Array';\n}\nexports.isFloat32Array = isFloat32Array;\n\nfunction isFloat64Array(value) {\n return whichTypedArray(value) === 'Float64Array';\n}\nexports.isFloat64Array = isFloat64Array;\n\nfunction isBigInt64Array(value) {\n return whichTypedArray(value) === 'BigInt64Array';\n}\nexports.isBigInt64Array = isBigInt64Array;\n\nfunction isBigUint64Array(value) {\n return whichTypedArray(value) === 'BigUint64Array';\n}\nexports.isBigUint64Array = isBigUint64Array;\n\nfunction isMapToString(value) {\n return ObjectToString(value) === '[object Map]';\n}\nisMapToString.working = (\n typeof Map !== 'undefined' &&\n isMapToString(new Map())\n);\n\nfunction isMap(value) {\n if (typeof Map === 'undefined') {\n return false;\n }\n\n return isMapToString.working\n ? isMapToString(value)\n : value instanceof Map;\n}\nexports.isMap = isMap;\n\nfunction isSetToString(value) {\n return ObjectToString(value) === '[object Set]';\n}\nisSetToString.working = (\n typeof Set !== 'undefined' &&\n isSetToString(new Set())\n);\nfunction isSet(value) {\n if (typeof Set === 'undefined') {\n return false;\n }\n\n return isSetToString.working\n ? isSetToString(value)\n : value instanceof Set;\n}\nexports.isSet = isSet;\n\nfunction isWeakMapToString(value) {\n return ObjectToString(value) === '[object WeakMap]';\n}\nisWeakMapToString.working = (\n typeof WeakMap !== 'undefined' &&\n isWeakMapToString(new WeakMap())\n);\nfunction isWeakMap(value) {\n if (typeof WeakMap === 'undefined') {\n return false;\n }\n\n return isWeakMapToString.working\n ? isWeakMapToString(value)\n : value instanceof WeakMap;\n}\nexports.isWeakMap = isWeakMap;\n\nfunction isWeakSetToString(value) {\n return ObjectToString(value) === '[object WeakSet]';\n}\nisWeakSetToString.working = (\n typeof WeakSet !== 'undefined' &&\n isWeakSetToString(new WeakSet())\n);\nfunction isWeakSet(value) {\n return isWeakSetToString(value);\n}\nexports.isWeakSet = isWeakSet;\n\nfunction isArrayBufferToString(value) {\n return ObjectToString(value) === '[object ArrayBuffer]';\n}\nisArrayBufferToString.working = (\n typeof ArrayBuffer !== 'undefined' &&\n isArrayBufferToString(new ArrayBuffer())\n);\nfunction isArrayBuffer(value) {\n if (typeof ArrayBuffer === 'undefined') {\n return false;\n }\n\n return isArrayBufferToString.working\n ? isArrayBufferToString(value)\n : value instanceof ArrayBuffer;\n}\nexports.isArrayBuffer = isArrayBuffer;\n\nfunction isDataViewToString(value) {\n return ObjectToString(value) === '[object DataView]';\n}\nisDataViewToString.working = (\n typeof ArrayBuffer !== 'undefined' &&\n typeof DataView !== 'undefined' &&\n isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1))\n);\nfunction isDataView(value) {\n if (typeof DataView === 'undefined') {\n return false;\n }\n\n return isDataViewToString.working\n ? isDataViewToString(value)\n : value instanceof DataView;\n}\nexports.isDataView = isDataView;\n\n// Store a copy of SharedArrayBuffer in case it's deleted elsewhere\nvar SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined;\nfunction isSharedArrayBufferToString(value) {\n return ObjectToString(value) === '[object SharedArrayBuffer]';\n}\nfunction isSharedArrayBuffer(value) {\n if (typeof SharedArrayBufferCopy === 'undefined') {\n return false;\n }\n\n if (typeof isSharedArrayBufferToString.working === 'undefined') {\n isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy());\n }\n\n return isSharedArrayBufferToString.working\n ? isSharedArrayBufferToString(value)\n : value instanceof SharedArrayBufferCopy;\n}\nexports.isSharedArrayBuffer = isSharedArrayBuffer;\n\nfunction isAsyncFunction(value) {\n return ObjectToString(value) === '[object AsyncFunction]';\n}\nexports.isAsyncFunction = isAsyncFunction;\n\nfunction isMapIterator(value) {\n return ObjectToString(value) === '[object Map Iterator]';\n}\nexports.isMapIterator = isMapIterator;\n\nfunction isSetIterator(value) {\n return ObjectToString(value) === '[object Set Iterator]';\n}\nexports.isSetIterator = isSetIterator;\n\nfunction isGeneratorObject(value) {\n return ObjectToString(value) === '[object Generator]';\n}\nexports.isGeneratorObject = isGeneratorObject;\n\nfunction isWebAssemblyCompiledModule(value) {\n return ObjectToString(value) === '[object WebAssembly.Module]';\n}\nexports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule;\n\nfunction isNumberObject(value) {\n return checkBoxedPrimitive(value, numberValue);\n}\nexports.isNumberObject = isNumberObject;\n\nfunction isStringObject(value) {\n return checkBoxedPrimitive(value, stringValue);\n}\nexports.isStringObject = isStringObject;\n\nfunction isBooleanObject(value) {\n return checkBoxedPrimitive(value, booleanValue);\n}\nexports.isBooleanObject = isBooleanObject;\n\nfunction isBigIntObject(value) {\n return BigIntSupported && checkBoxedPrimitive(value, bigIntValue);\n}\nexports.isBigIntObject = isBigIntObject;\n\nfunction isSymbolObject(value) {\n return SymbolSupported && checkBoxedPrimitive(value, symbolValue);\n}\nexports.isSymbolObject = isSymbolObject;\n\nfunction isBoxedPrimitive(value) {\n return (\n isNumberObject(value) ||\n isStringObject(value) ||\n isBooleanObject(value) ||\n isBigIntObject(value) ||\n isSymbolObject(value)\n );\n}\nexports.isBoxedPrimitive = isBoxedPrimitive;\n\nfunction isAnyArrayBuffer(value) {\n return typeof Uint8Array !== 'undefined' && (\n isArrayBuffer(value) ||\n isSharedArrayBuffer(value)\n );\n}\nexports.isAnyArrayBuffer = isAnyArrayBuffer;\n\n['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) {\n Object.defineProperty(exports, method, {\n enumerable: false,\n value: function() {\n throw new Error(method + ' is not supported in userland');\n }\n });\n});\n","'use strict';\n\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\n\nvar isStandardArguments = function isArguments(value) {\n\tif (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) {\n\t\treturn false;\n\t}\n\treturn $toString(value) === '[object Arguments]';\n};\n\nvar isLegacyArguments = function isArguments(value) {\n\tif (isStandardArguments(value)) {\n\t\treturn true;\n\t}\n\treturn value !== null &&\n\t\ttypeof value === 'object' &&\n\t\ttypeof value.length === 'number' &&\n\t\tvalue.length >= 0 &&\n\t\t$toString(value) !== '[object Array]' &&\n\t\t$toString(value.callee) === '[object Function]';\n};\n\nvar supportsStandardArguments = (function () {\n\treturn isStandardArguments(arguments);\n}());\n\nisStandardArguments.isLegacyArguments = isLegacyArguments; // for tests\n\nmodule.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments;\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slice.call(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n args.concat(slice.call(arguments))\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n } else {\n return target.apply(\n that,\n args.concat(slice.call(arguments))\n );\n }\n };\n\n var boundLength = Math.max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs.push('$' + i);\n }\n\n bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\n","'use strict';\n\nvar toStr = Object.prototype.toString;\nvar fnToStr = Function.prototype.toString;\nvar isFnRegex = /^\\s*(?:function)?\\*/;\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar getProto = Object.getPrototypeOf;\nvar getGeneratorFunc = function () { // eslint-disable-line consistent-return\n\tif (!hasToStringTag) {\n\t\treturn false;\n\t}\n\ttry {\n\t\treturn Function('return function*() {}')();\n\t} catch (e) {\n\t}\n};\nvar GeneratorFunction;\n\nmodule.exports = function isGeneratorFunction(fn) {\n\tif (typeof fn !== 'function') {\n\t\treturn false;\n\t}\n\tif (isFnRegex.test(fnToStr.call(fn))) {\n\t\treturn true;\n\t}\n\tif (!hasToStringTag) {\n\t\tvar str = toStr.call(fn);\n\t\treturn str === '[object GeneratorFunction]';\n\t}\n\tif (!getProto) {\n\t\treturn false;\n\t}\n\tif (typeof GeneratorFunction === 'undefined') {\n\t\tvar generatorFunc = getGeneratorFunc();\n\t\tGeneratorFunction = generatorFunc ? getProto(generatorFunc) : false;\n\t}\n\treturn getProto(fn) === GeneratorFunction;\n};\n","'use strict';\n\nvar forEach = require('for-each');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\nvar gOPD = require('gopd');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tif (typeof g[typedArray] === 'function') {\n\t\t\tvar arr = new g[typedArray]();\n\t\t\tif (Symbol.toStringTag in arr) {\n\t\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\t\tif (!descriptor) {\n\t\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t\t}\n\t\t\t\ttoStrTags[typedArray] = descriptor.get;\n\t\t\t}\n\t\t}\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar foundName = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!foundName) {\n\t\t\ttry {\n\t\t\t\tvar name = getter.call(value);\n\t\t\t\tif (name === typedArray) {\n\t\t\t\t\tfoundName = name;\n\t\t\t\t}\n\t\t\t} catch (e) {}\n\t\t}\n\t});\n\treturn foundName;\n};\n\nvar isTypedArray = require('is-typed-array');\n\nmodule.exports = function whichTypedArray(value) {\n\tif (!isTypedArray(value)) { return false; }\n\tif (!hasToStringTag || !(Symbol.toStringTag in value)) { return $slice($toString(value), 8, -1); }\n\treturn tryTypedArrays(value);\n};\n","'use strict';\n\nvar fnToStr = Function.prototype.toString;\nvar reflectApply = typeof Reflect === 'object' && Reflect !== null && Reflect.apply;\nvar badArrayLike;\nvar isCallableMarker;\nif (typeof reflectApply === 'function' && typeof Object.defineProperty === 'function') {\n\ttry {\n\t\tbadArrayLike = Object.defineProperty({}, 'length', {\n\t\t\tget: function () {\n\t\t\t\tthrow isCallableMarker;\n\t\t\t}\n\t\t});\n\t\tisCallableMarker = {};\n\t\t// eslint-disable-next-line no-throw-literal\n\t\treflectApply(function () { throw 42; }, null, badArrayLike);\n\t} catch (_) {\n\t\tif (_ !== isCallableMarker) {\n\t\t\treflectApply = null;\n\t\t}\n\t}\n} else {\n\treflectApply = null;\n}\n\nvar constructorRegex = /^\\s*class\\b/;\nvar isES6ClassFn = function isES6ClassFunction(value) {\n\ttry {\n\t\tvar fnStr = fnToStr.call(value);\n\t\treturn constructorRegex.test(fnStr);\n\t} catch (e) {\n\t\treturn false; // not a function\n\t}\n};\n\nvar tryFunctionObject = function tryFunctionToStr(value) {\n\ttry {\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tfnToStr.call(value);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\nvar toStr = Object.prototype.toString;\nvar objectClass = '[object Object]';\nvar fnClass = '[object Function]';\nvar genClass = '[object GeneratorFunction]';\nvar ddaClass = '[object HTMLAllCollection]'; // IE 11\nvar ddaClass2 = '[object HTML document.all class]';\nvar ddaClass3 = '[object HTMLCollection]'; // IE 9-10\nvar hasToStringTag = typeof Symbol === 'function' && !!Symbol.toStringTag; // better: use `has-tostringtag`\n\nvar isIE68 = !(0 in [,]); // eslint-disable-line no-sparse-arrays, comma-spacing\n\nvar isDDA = function isDocumentDotAll() { return false; };\nif (typeof document === 'object') {\n\t// Firefox 3 canonicalizes DDA to undefined when it's not accessed directly\n\tvar all = document.all;\n\tif (toStr.call(all) === toStr.call(document.all)) {\n\t\tisDDA = function isDocumentDotAll(value) {\n\t\t\t/* globals document: false */\n\t\t\t// in IE 6-8, typeof document.all is \"object\" and it's truthy\n\t\t\tif ((isIE68 || !value) && (typeof value === 'undefined' || typeof value === 'object')) {\n\t\t\t\ttry {\n\t\t\t\t\tvar str = toStr.call(value);\n\t\t\t\t\treturn (\n\t\t\t\t\t\tstr === ddaClass\n\t\t\t\t\t\t|| str === ddaClass2\n\t\t\t\t\t\t|| str === ddaClass3 // opera 12.16\n\t\t\t\t\t\t|| str === objectClass // IE 6-8\n\t\t\t\t\t) && value('') == null; // eslint-disable-line eqeqeq\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t}\n}\n\nmodule.exports = reflectApply\n\t? function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\ttry {\n\t\t\treflectApply(value, null, badArrayLike);\n\t\t} catch (e) {\n\t\t\tif (e !== isCallableMarker) { return false; }\n\t\t}\n\t\treturn !isES6ClassFn(value) && tryFunctionObject(value);\n\t}\n\t: function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\tif (hasToStringTag) { return tryFunctionObject(value); }\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tvar strClass = toStr.call(value);\n\t\tif (strClass !== fnClass && strClass !== genClass && !(/^\\[object HTML/).test(strClass)) { return false; }\n\t\treturn tryFunctionObject(value);\n\t};\n","module.exports = function isBuffer(arg) {\n return arg && typeof arg === 'object'\n && typeof arg.copy === 'function'\n && typeof arg.fill === 'function'\n && typeof arg.readUInt8 === 'function';\n}","// Currently in sync with Node.js lib/internal/assert/assertion_error.js\n// https://github.com/nodejs/node/commit/0817840f775032169ddd70c85ac059f18ffcc81c\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\n\nfunction isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _construct(Parent, args, Class) { if (isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\n\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar _require = require('util/'),\n inspect = _require.inspect;\n\nvar _require2 = require('../errors'),\n ERR_INVALID_ARG_TYPE = _require2.codes.ERR_INVALID_ARG_TYPE; // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat\n\n\nfunction repeat(str, count) {\n count = Math.floor(count);\n if (str.length == 0 || count == 0) return '';\n var maxCount = str.length * count;\n count = Math.floor(Math.log(count) / Math.log(2));\n\n while (count) {\n str += str;\n count--;\n }\n\n str += str.substring(0, maxCount - str.length);\n return str;\n}\n\nvar blue = '';\nvar green = '';\nvar red = '';\nvar white = '';\nvar kReadableOperator = {\n deepStrictEqual: 'Expected values to be strictly deep-equal:',\n strictEqual: 'Expected values to be strictly equal:',\n strictEqualObject: 'Expected \"actual\" to be reference-equal to \"expected\":',\n deepEqual: 'Expected values to be loosely deep-equal:',\n equal: 'Expected values to be loosely equal:',\n notDeepStrictEqual: 'Expected \"actual\" not to be strictly deep-equal to:',\n notStrictEqual: 'Expected \"actual\" to be strictly unequal to:',\n notStrictEqualObject: 'Expected \"actual\" not to be reference-equal to \"expected\":',\n notDeepEqual: 'Expected \"actual\" not to be loosely deep-equal to:',\n notEqual: 'Expected \"actual\" to be loosely unequal to:',\n notIdentical: 'Values identical but not reference-equal:'\n}; // Comparing short primitives should just show === / !== instead of using the\n// diff.\n\nvar kMaxShortLength = 10;\n\nfunction copyError(source) {\n var keys = Object.keys(source);\n var target = Object.create(Object.getPrototypeOf(source));\n keys.forEach(function (key) {\n target[key] = source[key];\n });\n Object.defineProperty(target, 'message', {\n value: source.message\n });\n return target;\n}\n\nfunction inspectValue(val) {\n // The util.inspect default values could be changed. This makes sure the\n // error messages contain the necessary information nevertheless.\n return inspect(val, {\n compact: false,\n customInspect: false,\n depth: 1000,\n maxArrayLength: Infinity,\n // Assert compares only enumerable properties (with a few exceptions).\n showHidden: false,\n // Having a long line as error is better than wrapping the line for\n // comparison for now.\n // TODO(BridgeAR): `breakLength` should be limited as soon as soon as we\n // have meta information about the inspected properties (i.e., know where\n // in what line the property starts and ends).\n breakLength: Infinity,\n // Assert does not detect proxies currently.\n showProxy: false,\n sorted: true,\n // Inspect getters as we also check them when comparing entries.\n getters: true\n });\n}\n\nfunction createErrDiff(actual, expected, operator) {\n var other = '';\n var res = '';\n var lastPos = 0;\n var end = '';\n var skipped = false;\n var actualInspected = inspectValue(actual);\n var actualLines = actualInspected.split('\\n');\n var expectedLines = inspectValue(expected).split('\\n');\n var i = 0;\n var indicator = ''; // In case both values are objects explicitly mark them as not reference equal\n // for the `strictEqual` operator.\n\n if (operator === 'strictEqual' && _typeof(actual) === 'object' && _typeof(expected) === 'object' && actual !== null && expected !== null) {\n operator = 'strictEqualObject';\n } // If \"actual\" and \"expected\" fit on a single line and they are not strictly\n // equal, check further special handling.\n\n\n if (actualLines.length === 1 && expectedLines.length === 1 && actualLines[0] !== expectedLines[0]) {\n var inputLength = actualLines[0].length + expectedLines[0].length; // If the character length of \"actual\" and \"expected\" together is less than\n // kMaxShortLength and if neither is an object and at least one of them is\n // not `zero`, use the strict equal comparison to visualize the output.\n\n if (inputLength <= kMaxShortLength) {\n if ((_typeof(actual) !== 'object' || actual === null) && (_typeof(expected) !== 'object' || expected === null) && (actual !== 0 || expected !== 0)) {\n // -0 === +0\n return \"\".concat(kReadableOperator[operator], \"\\n\\n\") + \"\".concat(actualLines[0], \" !== \").concat(expectedLines[0], \"\\n\");\n }\n } else if (operator !== 'strictEqualObject') {\n // If the stderr is a tty and the input length is lower than the current\n // columns per line, add a mismatch indicator below the output. If it is\n // not a tty, use a default value of 80 characters.\n var maxLength = process.stderr && process.stderr.isTTY ? process.stderr.columns : 80;\n\n if (inputLength < maxLength) {\n while (actualLines[0][i] === expectedLines[0][i]) {\n i++;\n } // Ignore the first characters.\n\n\n if (i > 2) {\n // Add position indicator for the first mismatch in case it is a\n // single line and the input length is less than the column length.\n indicator = \"\\n \".concat(repeat(' ', i), \"^\");\n i = 0;\n }\n }\n }\n } // Remove all ending lines that match (this optimizes the output for\n // readability by reducing the number of total changed lines).\n\n\n var a = actualLines[actualLines.length - 1];\n var b = expectedLines[expectedLines.length - 1];\n\n while (a === b) {\n if (i++ < 2) {\n end = \"\\n \".concat(a).concat(end);\n } else {\n other = a;\n }\n\n actualLines.pop();\n expectedLines.pop();\n if (actualLines.length === 0 || expectedLines.length === 0) break;\n a = actualLines[actualLines.length - 1];\n b = expectedLines[expectedLines.length - 1];\n }\n\n var maxLines = Math.max(actualLines.length, expectedLines.length); // Strict equal with identical objects that are not identical by reference.\n // E.g., assert.deepStrictEqual({ a: Symbol() }, { a: Symbol() })\n\n if (maxLines === 0) {\n // We have to get the result again. The lines were all removed before.\n var _actualLines = actualInspected.split('\\n'); // Only remove lines in case it makes sense to collapse those.\n // TODO: Accept env to always show the full error.\n\n\n if (_actualLines.length > 30) {\n _actualLines[26] = \"\".concat(blue, \"...\").concat(white);\n\n while (_actualLines.length > 27) {\n _actualLines.pop();\n }\n }\n\n return \"\".concat(kReadableOperator.notIdentical, \"\\n\\n\").concat(_actualLines.join('\\n'), \"\\n\");\n }\n\n if (i > 3) {\n end = \"\\n\".concat(blue, \"...\").concat(white).concat(end);\n skipped = true;\n }\n\n if (other !== '') {\n end = \"\\n \".concat(other).concat(end);\n other = '';\n }\n\n var printedLines = 0;\n var msg = kReadableOperator[operator] + \"\\n\".concat(green, \"+ actual\").concat(white, \" \").concat(red, \"- expected\").concat(white);\n var skippedMsg = \" \".concat(blue, \"...\").concat(white, \" Lines skipped\");\n\n for (i = 0; i < maxLines; i++) {\n // Only extra expected lines exist\n var cur = i - lastPos;\n\n if (actualLines.length < i + 1) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(expectedLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(expectedLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the expected line to the cache.\n\n other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLines[i]);\n printedLines++; // Only extra actual lines exist\n } else if (expectedLines.length < i + 1) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(actualLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(actualLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the actual line to the result.\n\n res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLines[i]);\n printedLines++; // Lines diverge\n } else {\n var expectedLine = expectedLines[i];\n var actualLine = actualLines[i]; // If the lines diverge, specifically check for lines that only diverge by\n // a trailing comma. In that case it is actually identical and we should\n // mark it as such.\n\n var divergingLines = actualLine !== expectedLine && (!endsWith(actualLine, ',') || actualLine.slice(0, -1) !== expectedLine); // If the expected line has a trailing comma but is otherwise identical,\n // add a comma at the end of the actual line. Otherwise the output could\n // look weird as in:\n //\n // [\n // 1 // No comma at the end!\n // + 2\n // ]\n //\n\n if (divergingLines && endsWith(expectedLine, ',') && expectedLine.slice(0, -1) === actualLine) {\n divergingLines = false;\n actualLine += ',';\n }\n\n if (divergingLines) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(actualLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(actualLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the actual line to the result and cache the expected diverging\n // line so consecutive diverging lines show up as +++--- and not +-+-+-.\n\n res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLine);\n other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLine);\n printedLines += 2; // Lines are identical\n } else {\n // Add all cached information to the result before adding other things\n // and reset the cache.\n res += other;\n other = ''; // If the last diverging line is exactly one line above or if it is the\n // very first line, add the line to the result.\n\n if (cur === 1 || i === 0) {\n res += \"\\n \".concat(actualLine);\n printedLines++;\n }\n }\n } // Inspected object to big (Show ~20 rows max)\n\n\n if (printedLines > 20 && i < maxLines - 2) {\n return \"\".concat(msg).concat(skippedMsg, \"\\n\").concat(res, \"\\n\").concat(blue, \"...\").concat(white).concat(other, \"\\n\") + \"\".concat(blue, \"...\").concat(white);\n }\n }\n\n return \"\".concat(msg).concat(skipped ? skippedMsg : '', \"\\n\").concat(res).concat(other).concat(end).concat(indicator);\n}\n\nvar AssertionError =\n/*#__PURE__*/\nfunction (_Error) {\n _inherits(AssertionError, _Error);\n\n function AssertionError(options) {\n var _this;\n\n _classCallCheck(this, AssertionError);\n\n if (_typeof(options) !== 'object' || options === null) {\n throw new ERR_INVALID_ARG_TYPE('options', 'Object', options);\n }\n\n var message = options.message,\n operator = options.operator,\n stackStartFn = options.stackStartFn;\n var actual = options.actual,\n expected = options.expected;\n var limit = Error.stackTraceLimit;\n Error.stackTraceLimit = 0;\n\n if (message != null) {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, String(message)));\n } else {\n if (process.stderr && process.stderr.isTTY) {\n // Reset on each call to make sure we handle dynamically set environment\n // variables correct.\n if (process.stderr && process.stderr.getColorDepth && process.stderr.getColorDepth() !== 1) {\n blue = \"\\x1B[34m\";\n green = \"\\x1B[32m\";\n white = \"\\x1B[39m\";\n red = \"\\x1B[31m\";\n } else {\n blue = '';\n green = '';\n white = '';\n red = '';\n }\n } // Prevent the error stack from being visible by duplicating the error\n // in a very close way to the original in case both sides are actually\n // instances of Error.\n\n\n if (_typeof(actual) === 'object' && actual !== null && _typeof(expected) === 'object' && expected !== null && 'stack' in actual && actual instanceof Error && 'stack' in expected && expected instanceof Error) {\n actual = copyError(actual);\n expected = copyError(expected);\n }\n\n if (operator === 'deepStrictEqual' || operator === 'strictEqual') {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, createErrDiff(actual, expected, operator)));\n } else if (operator === 'notDeepStrictEqual' || operator === 'notStrictEqual') {\n // In case the objects are equal but the operator requires unequal, show\n // the first object and say A equals B\n var base = kReadableOperator[operator];\n var res = inspectValue(actual).split('\\n'); // In case \"actual\" is an object, it should not be reference equal.\n\n if (operator === 'notStrictEqual' && _typeof(actual) === 'object' && actual !== null) {\n base = kReadableOperator.notStrictEqualObject;\n } // Only remove lines in case it makes sense to collapse those.\n // TODO: Accept env to always show the full error.\n\n\n if (res.length > 30) {\n res[26] = \"\".concat(blue, \"...\").concat(white);\n\n while (res.length > 27) {\n res.pop();\n }\n } // Only print a single input.\n\n\n if (res.length === 1) {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(base, \" \").concat(res[0])));\n } else {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(base, \"\\n\\n\").concat(res.join('\\n'), \"\\n\")));\n }\n } else {\n var _res = inspectValue(actual);\n\n var other = '';\n var knownOperators = kReadableOperator[operator];\n\n if (operator === 'notDeepEqual' || operator === 'notEqual') {\n _res = \"\".concat(kReadableOperator[operator], \"\\n\\n\").concat(_res);\n\n if (_res.length > 1024) {\n _res = \"\".concat(_res.slice(0, 1021), \"...\");\n }\n } else {\n other = \"\".concat(inspectValue(expected));\n\n if (_res.length > 512) {\n _res = \"\".concat(_res.slice(0, 509), \"...\");\n }\n\n if (other.length > 512) {\n other = \"\".concat(other.slice(0, 509), \"...\");\n }\n\n if (operator === 'deepEqual' || operator === 'equal') {\n _res = \"\".concat(knownOperators, \"\\n\\n\").concat(_res, \"\\n\\nshould equal\\n\\n\");\n } else {\n other = \" \".concat(operator, \" \").concat(other);\n }\n }\n\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(_res).concat(other)));\n }\n }\n\n Error.stackTraceLimit = limit;\n _this.generatedMessage = !message;\n Object.defineProperty(_assertThisInitialized(_this), 'name', {\n value: 'AssertionError [ERR_ASSERTION]',\n enumerable: false,\n writable: true,\n configurable: true\n });\n _this.code = 'ERR_ASSERTION';\n _this.actual = actual;\n _this.expected = expected;\n _this.operator = operator;\n\n if (Error.captureStackTrace) {\n // eslint-disable-next-line no-restricted-syntax\n Error.captureStackTrace(_assertThisInitialized(_this), stackStartFn);\n } // Create error message including the error code in the name.\n\n\n _this.stack; // Reset the name.\n\n _this.name = 'AssertionError';\n return _possibleConstructorReturn(_this);\n }\n\n _createClass(AssertionError, [{\n key: \"toString\",\n value: function toString() {\n return \"\".concat(this.name, \" [\").concat(this.code, \"]: \").concat(this.message);\n }\n }, {\n key: inspect.custom,\n value: function value(recurseTimes, ctx) {\n // This limits the `actual` and `expected` property default inspection to\n // the minimum depth. Otherwise those values would be too verbose compared\n // to the actual error message which contains a combined view of these two\n // input values.\n return inspect(this, _objectSpread({}, ctx, {\n customInspect: false,\n depth: 0\n }));\n }\n }]);\n\n return AssertionError;\n}(_wrapNativeSuper(Error));\n\nmodule.exports = AssertionError;","/**\n * Code refactored from Mozilla Developer Network:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\n */\n\n'use strict';\n\nfunction assign(target, firstSource) {\n if (target === undefined || target === null) {\n throw new TypeError('Cannot convert first argument to object');\n }\n\n var to = Object(target);\n for (var i = 1; i < arguments.length; i++) {\n var nextSource = arguments[i];\n if (nextSource === undefined || nextSource === null) {\n continue;\n }\n\n var keysArray = Object.keys(Object(nextSource));\n for (var nextIndex = 0, len = keysArray.length; nextIndex < len; nextIndex++) {\n var nextKey = keysArray[nextIndex];\n var desc = Object.getOwnPropertyDescriptor(nextSource, nextKey);\n if (desc !== undefined && desc.enumerable) {\n to[nextKey] = nextSource[nextKey];\n }\n }\n }\n return to;\n}\n\nfunction polyfill() {\n if (!Object.assign) {\n Object.defineProperty(Object, 'assign', {\n enumerable: false,\n configurable: true,\n writable: true,\n value: assign\n });\n }\n}\n\nmodule.exports = {\n assign: assign,\n polyfill: polyfill\n};\n","'use strict';\n\nvar slice = Array.prototype.slice;\nvar isArgs = require('./isArguments');\n\nvar origKeys = Object.keys;\nvar keysShim = origKeys ? function keys(o) { return origKeys(o); } : require('./implementation');\n\nvar originalKeys = Object.keys;\n\nkeysShim.shim = function shimObjectKeys() {\n\tif (Object.keys) {\n\t\tvar keysWorksWithArguments = (function () {\n\t\t\t// Safari 5.0 bug\n\t\t\tvar args = Object.keys(arguments);\n\t\t\treturn args && args.length === arguments.length;\n\t\t}(1, 2));\n\t\tif (!keysWorksWithArguments) {\n\t\t\tObject.keys = function keys(object) { // eslint-disable-line func-name-matching\n\t\t\t\tif (isArgs(object)) {\n\t\t\t\t\treturn originalKeys(slice.call(object));\n\t\t\t\t}\n\t\t\t\treturn originalKeys(object);\n\t\t\t};\n\t\t}\n\t} else {\n\t\tObject.keys = keysShim;\n\t}\n\treturn Object.keys || keysShim;\n};\n\nmodule.exports = keysShim;\n","'use strict';\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = require('./isArguments'); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\n\nvar hasPropertyDescriptors = function hasPropertyDescriptors() {\n\tif ($defineProperty) {\n\t\ttry {\n\t\t\t$defineProperty({}, 'a', { value: 1 });\n\t\t\treturn true;\n\t\t} catch (e) {\n\t\t\t// IE 8 has a broken defineProperty\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn false;\n};\n\nhasPropertyDescriptors.hasArrayLengthDefineBug = function hasArrayLengthDefineBug() {\n\t// node v0.6 has a bug where array lengths can be Set but not Defined\n\tif (!hasPropertyDescriptors()) {\n\t\treturn null;\n\t}\n\ttry {\n\t\treturn $defineProperty([], 'length', { value: 1 }).length !== 1;\n\t} catch (e) {\n\t\t// In Firefox 4-22, defining length on an array throws an exception.\n\t\treturn true;\n\t}\n};\n\nmodule.exports = hasPropertyDescriptors;\n","'use strict';\n\nvar getPolyfill = require('./polyfill');\nvar define = require('define-properties');\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","// Currently in sync with Node.js lib/internal/util/comparisons.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n'use strict';\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar regexFlagsSupported = /a/g.flags !== undefined;\n\nvar arrayFromSet = function arrayFromSet(set) {\n var array = [];\n set.forEach(function (value) {\n return array.push(value);\n });\n return array;\n};\n\nvar arrayFromMap = function arrayFromMap(map) {\n var array = [];\n map.forEach(function (value, key) {\n return array.push([key, value]);\n });\n return array;\n};\n\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar objectGetOwnPropertySymbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols : function () {\n return [];\n};\nvar numberIsNaN = Number.isNaN ? Number.isNaN : require('is-nan');\n\nfunction uncurryThis(f) {\n return f.call.bind(f);\n}\n\nvar hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty);\nvar propertyIsEnumerable = uncurryThis(Object.prototype.propertyIsEnumerable);\nvar objectToString = uncurryThis(Object.prototype.toString);\n\nvar _require$types = require('util/').types,\n isAnyArrayBuffer = _require$types.isAnyArrayBuffer,\n isArrayBufferView = _require$types.isArrayBufferView,\n isDate = _require$types.isDate,\n isMap = _require$types.isMap,\n isRegExp = _require$types.isRegExp,\n isSet = _require$types.isSet,\n isNativeError = _require$types.isNativeError,\n isBoxedPrimitive = _require$types.isBoxedPrimitive,\n isNumberObject = _require$types.isNumberObject,\n isStringObject = _require$types.isStringObject,\n isBooleanObject = _require$types.isBooleanObject,\n isBigIntObject = _require$types.isBigIntObject,\n isSymbolObject = _require$types.isSymbolObject,\n isFloat32Array = _require$types.isFloat32Array,\n isFloat64Array = _require$types.isFloat64Array;\n\nfunction isNonIndex(key) {\n if (key.length === 0 || key.length > 10) return true;\n\n for (var i = 0; i < key.length; i++) {\n var code = key.charCodeAt(i);\n if (code < 48 || code > 57) return true;\n } // The maximum size for an array is 2 ** 32 -1.\n\n\n return key.length === 10 && key >= Math.pow(2, 32);\n}\n\nfunction getOwnNonIndexProperties(value) {\n return Object.keys(value).filter(isNonIndex).concat(objectGetOwnPropertySymbols(value).filter(Object.prototype.propertyIsEnumerable.bind(value)));\n} // Taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n\n\nfunction compare(a, b) {\n if (a === b) {\n return 0;\n }\n\n var x = a.length;\n var y = b.length;\n\n for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i];\n y = b[i];\n break;\n }\n }\n\n if (x < y) {\n return -1;\n }\n\n if (y < x) {\n return 1;\n }\n\n return 0;\n}\n\nvar ONLY_ENUMERABLE = undefined;\nvar kStrict = true;\nvar kLoose = false;\nvar kNoIterator = 0;\nvar kIsArray = 1;\nvar kIsSet = 2;\nvar kIsMap = 3; // Check if they have the same source and flags\n\nfunction areSimilarRegExps(a, b) {\n return regexFlagsSupported ? a.source === b.source && a.flags === b.flags : RegExp.prototype.toString.call(a) === RegExp.prototype.toString.call(b);\n}\n\nfunction areSimilarFloatArrays(a, b) {\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n\n for (var offset = 0; offset < a.byteLength; offset++) {\n if (a[offset] !== b[offset]) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction areSimilarTypedArrays(a, b) {\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n\n return compare(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)) === 0;\n}\n\nfunction areEqualArrayBuffers(buf1, buf2) {\n return buf1.byteLength === buf2.byteLength && compare(new Uint8Array(buf1), new Uint8Array(buf2)) === 0;\n}\n\nfunction isEqualBoxedPrimitive(val1, val2) {\n if (isNumberObject(val1)) {\n return isNumberObject(val2) && objectIs(Number.prototype.valueOf.call(val1), Number.prototype.valueOf.call(val2));\n }\n\n if (isStringObject(val1)) {\n return isStringObject(val2) && String.prototype.valueOf.call(val1) === String.prototype.valueOf.call(val2);\n }\n\n if (isBooleanObject(val1)) {\n return isBooleanObject(val2) && Boolean.prototype.valueOf.call(val1) === Boolean.prototype.valueOf.call(val2);\n }\n\n if (isBigIntObject(val1)) {\n return isBigIntObject(val2) && BigInt.prototype.valueOf.call(val1) === BigInt.prototype.valueOf.call(val2);\n }\n\n return isSymbolObject(val2) && Symbol.prototype.valueOf.call(val1) === Symbol.prototype.valueOf.call(val2);\n} // Notes: Type tags are historical [[Class]] properties that can be set by\n// FunctionTemplate::SetClassName() in C++ or Symbol.toStringTag in JS\n// and retrieved using Object.prototype.toString.call(obj) in JS\n// See https://tc39.github.io/ecma262/#sec-object.prototype.tostring\n// for a list of tags pre-defined in the spec.\n// There are some unspecified tags in the wild too (e.g. typed array tags).\n// Since tags can be altered, they only serve fast failures\n//\n// Typed arrays and buffers are checked by comparing the content in their\n// underlying ArrayBuffer. This optimization requires that it's\n// reasonable to interpret their underlying memory in the same way,\n// which is checked by comparing their type tags.\n// (e.g. a Uint8Array and a Uint16Array with the same memory content\n// could still be different because they will be interpreted differently).\n//\n// For strict comparison, objects should have\n// a) The same built-in type tags\n// b) The same prototypes.\n\n\nfunction innerDeepEqual(val1, val2, strict, memos) {\n // All identical values are equivalent, as determined by ===.\n if (val1 === val2) {\n if (val1 !== 0) return true;\n return strict ? objectIs(val1, val2) : true;\n } // Check more closely if val1 and val2 are equal.\n\n\n if (strict) {\n if (_typeof(val1) !== 'object') {\n return typeof val1 === 'number' && numberIsNaN(val1) && numberIsNaN(val2);\n }\n\n if (_typeof(val2) !== 'object' || val1 === null || val2 === null) {\n return false;\n }\n\n if (Object.getPrototypeOf(val1) !== Object.getPrototypeOf(val2)) {\n return false;\n }\n } else {\n if (val1 === null || _typeof(val1) !== 'object') {\n if (val2 === null || _typeof(val2) !== 'object') {\n // eslint-disable-next-line eqeqeq\n return val1 == val2;\n }\n\n return false;\n }\n\n if (val2 === null || _typeof(val2) !== 'object') {\n return false;\n }\n }\n\n var val1Tag = objectToString(val1);\n var val2Tag = objectToString(val2);\n\n if (val1Tag !== val2Tag) {\n return false;\n }\n\n if (Array.isArray(val1)) {\n // Check for sparse arrays and general fast path\n if (val1.length !== val2.length) {\n return false;\n }\n\n var keys1 = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n var keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n\n if (keys1.length !== keys2.length) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsArray, keys1);\n } // [browserify] This triggers on certain types in IE (Map/Set) so we don't\n // wan't to early return out of the rest of the checks. However we can check\n // if the second value is one of these values and the first isn't.\n\n\n if (val1Tag === '[object Object]') {\n // return keyCheck(val1, val2, strict, memos, kNoIterator);\n if (!isMap(val1) && isMap(val2) || !isSet(val1) && isSet(val2)) {\n return false;\n }\n }\n\n if (isDate(val1)) {\n if (!isDate(val2) || Date.prototype.getTime.call(val1) !== Date.prototype.getTime.call(val2)) {\n return false;\n }\n } else if (isRegExp(val1)) {\n if (!isRegExp(val2) || !areSimilarRegExps(val1, val2)) {\n return false;\n }\n } else if (isNativeError(val1) || val1 instanceof Error) {\n // Do not compare the stack as it might differ even though the error itself\n // is otherwise identical.\n if (val1.message !== val2.message || val1.name !== val2.name) {\n return false;\n }\n } else if (isArrayBufferView(val1)) {\n if (!strict && (isFloat32Array(val1) || isFloat64Array(val1))) {\n if (!areSimilarFloatArrays(val1, val2)) {\n return false;\n }\n } else if (!areSimilarTypedArrays(val1, val2)) {\n return false;\n } // Buffer.compare returns true, so val1.length === val2.length. If they both\n // only contain numeric keys, we don't need to exam further than checking\n // the symbols.\n\n\n var _keys = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n\n var _keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n\n if (_keys.length !== _keys2.length) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kNoIterator, _keys);\n } else if (isSet(val1)) {\n if (!isSet(val2) || val1.size !== val2.size) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsSet);\n } else if (isMap(val1)) {\n if (!isMap(val2) || val1.size !== val2.size) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsMap);\n } else if (isAnyArrayBuffer(val1)) {\n if (!areEqualArrayBuffers(val1, val2)) {\n return false;\n }\n } else if (isBoxedPrimitive(val1) && !isEqualBoxedPrimitive(val1, val2)) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kNoIterator);\n}\n\nfunction getEnumerables(val, keys) {\n return keys.filter(function (k) {\n return propertyIsEnumerable(val, k);\n });\n}\n\nfunction keyCheck(val1, val2, strict, memos, iterationType, aKeys) {\n // For all remaining Object pairs, including Array, objects and Maps,\n // equivalence is determined by having:\n // a) The same number of owned enumerable properties\n // b) The same set of keys/indexes (although not necessarily the same order)\n // c) Equivalent values for every corresponding key/index\n // d) For Sets and Maps, equal contents\n // Note: this accounts for both named and indexed properties on Arrays.\n if (arguments.length === 5) {\n aKeys = Object.keys(val1);\n var bKeys = Object.keys(val2); // The pair must have the same number of owned properties.\n\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n } // Cheap key test\n\n\n var i = 0;\n\n for (; i < aKeys.length; i++) {\n if (!hasOwnProperty(val2, aKeys[i])) {\n return false;\n }\n }\n\n if (strict && arguments.length === 5) {\n var symbolKeysA = objectGetOwnPropertySymbols(val1);\n\n if (symbolKeysA.length !== 0) {\n var count = 0;\n\n for (i = 0; i < symbolKeysA.length; i++) {\n var key = symbolKeysA[i];\n\n if (propertyIsEnumerable(val1, key)) {\n if (!propertyIsEnumerable(val2, key)) {\n return false;\n }\n\n aKeys.push(key);\n count++;\n } else if (propertyIsEnumerable(val2, key)) {\n return false;\n }\n }\n\n var symbolKeysB = objectGetOwnPropertySymbols(val2);\n\n if (symbolKeysA.length !== symbolKeysB.length && getEnumerables(val2, symbolKeysB).length !== count) {\n return false;\n }\n } else {\n var _symbolKeysB = objectGetOwnPropertySymbols(val2);\n\n if (_symbolKeysB.length !== 0 && getEnumerables(val2, _symbolKeysB).length !== 0) {\n return false;\n }\n }\n }\n\n if (aKeys.length === 0 && (iterationType === kNoIterator || iterationType === kIsArray && val1.length === 0 || val1.size === 0)) {\n return true;\n } // Use memos to handle cycles.\n\n\n if (memos === undefined) {\n memos = {\n val1: new Map(),\n val2: new Map(),\n position: 0\n };\n } else {\n // We prevent up to two map.has(x) calls by directly retrieving the value\n // and checking for undefined. The map can only contain numbers, so it is\n // safe to check for undefined only.\n var val2MemoA = memos.val1.get(val1);\n\n if (val2MemoA !== undefined) {\n var val2MemoB = memos.val2.get(val2);\n\n if (val2MemoB !== undefined) {\n return val2MemoA === val2MemoB;\n }\n }\n\n memos.position++;\n }\n\n memos.val1.set(val1, memos.position);\n memos.val2.set(val2, memos.position);\n var areEq = objEquiv(val1, val2, strict, aKeys, memos, iterationType);\n memos.val1.delete(val1);\n memos.val2.delete(val2);\n return areEq;\n}\n\nfunction setHasEqualElement(set, val1, strict, memo) {\n // Go looking.\n var setValues = arrayFromSet(set);\n\n for (var i = 0; i < setValues.length; i++) {\n var val2 = setValues[i];\n\n if (innerDeepEqual(val1, val2, strict, memo)) {\n // Remove the matching element to make sure we do not check that again.\n set.delete(val2);\n return true;\n }\n }\n\n return false;\n} // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Equality_comparisons_and_sameness#Loose_equality_using\n// Sadly it is not possible to detect corresponding values properly in case the\n// type is a string, number, bigint or boolean. The reason is that those values\n// can match lots of different string values (e.g., 1n == '+00001').\n\n\nfunction findLooseMatchingPrimitives(prim) {\n switch (_typeof(prim)) {\n case 'undefined':\n return null;\n\n case 'object':\n // Only pass in null as object!\n return undefined;\n\n case 'symbol':\n return false;\n\n case 'string':\n prim = +prim;\n // Loose equal entries exist only if the string is possible to convert to\n // a regular number and not NaN.\n // Fall through\n\n case 'number':\n if (numberIsNaN(prim)) {\n return false;\n }\n\n }\n\n return true;\n}\n\nfunction setMightHaveLoosePrim(a, b, prim) {\n var altValue = findLooseMatchingPrimitives(prim);\n if (altValue != null) return altValue;\n return b.has(altValue) && !a.has(altValue);\n}\n\nfunction mapMightHaveLoosePrim(a, b, prim, item, memo) {\n var altValue = findLooseMatchingPrimitives(prim);\n\n if (altValue != null) {\n return altValue;\n }\n\n var curB = b.get(altValue);\n\n if (curB === undefined && !b.has(altValue) || !innerDeepEqual(item, curB, false, memo)) {\n return false;\n }\n\n return !a.has(altValue) && innerDeepEqual(item, curB, false, memo);\n}\n\nfunction setEquiv(a, b, strict, memo) {\n // This is a lazily initiated Set of entries which have to be compared\n // pairwise.\n var set = null;\n var aValues = arrayFromSet(a);\n\n for (var i = 0; i < aValues.length; i++) {\n var val = aValues[i]; // Note: Checking for the objects first improves the performance for object\n // heavy sets but it is a minor slow down for primitives. As they are fast\n // to check this improves the worst case scenario instead.\n\n if (_typeof(val) === 'object' && val !== null) {\n if (set === null) {\n set = new Set();\n } // If the specified value doesn't exist in the second set its an not null\n // object (or non strict only: a not matching primitive) we'll need to go\n // hunting for something thats deep-(strict-)equal to it. To make this\n // O(n log n) complexity we have to copy these values in a new set first.\n\n\n set.add(val);\n } else if (!b.has(val)) {\n if (strict) return false; // Fast path to detect missing string, symbol, undefined and null values.\n\n if (!setMightHaveLoosePrim(a, b, val)) {\n return false;\n }\n\n if (set === null) {\n set = new Set();\n }\n\n set.add(val);\n }\n }\n\n if (set !== null) {\n var bValues = arrayFromSet(b);\n\n for (var _i = 0; _i < bValues.length; _i++) {\n var _val = bValues[_i]; // We have to check if a primitive value is already\n // matching and only if it's not, go hunting for it.\n\n if (_typeof(_val) === 'object' && _val !== null) {\n if (!setHasEqualElement(set, _val, strict, memo)) return false;\n } else if (!strict && !a.has(_val) && !setHasEqualElement(set, _val, strict, memo)) {\n return false;\n }\n }\n\n return set.size === 0;\n }\n\n return true;\n}\n\nfunction mapHasEqualEntry(set, map, key1, item1, strict, memo) {\n // To be able to handle cases like:\n // Map([[{}, 'a'], [{}, 'b']]) vs Map([[{}, 'b'], [{}, 'a']])\n // ... we need to consider *all* matching keys, not just the first we find.\n var setValues = arrayFromSet(set);\n\n for (var i = 0; i < setValues.length; i++) {\n var key2 = setValues[i];\n\n if (innerDeepEqual(key1, key2, strict, memo) && innerDeepEqual(item1, map.get(key2), strict, memo)) {\n set.delete(key2);\n return true;\n }\n }\n\n return false;\n}\n\nfunction mapEquiv(a, b, strict, memo) {\n var set = null;\n var aEntries = arrayFromMap(a);\n\n for (var i = 0; i < aEntries.length; i++) {\n var _aEntries$i = _slicedToArray(aEntries[i], 2),\n key = _aEntries$i[0],\n item1 = _aEntries$i[1];\n\n if (_typeof(key) === 'object' && key !== null) {\n if (set === null) {\n set = new Set();\n }\n\n set.add(key);\n } else {\n // By directly retrieving the value we prevent another b.has(key) check in\n // almost all possible cases.\n var item2 = b.get(key);\n\n if (item2 === undefined && !b.has(key) || !innerDeepEqual(item1, item2, strict, memo)) {\n if (strict) return false; // Fast path to detect missing string, symbol, undefined and null\n // keys.\n\n if (!mapMightHaveLoosePrim(a, b, key, item1, memo)) return false;\n\n if (set === null) {\n set = new Set();\n }\n\n set.add(key);\n }\n }\n }\n\n if (set !== null) {\n var bEntries = arrayFromMap(b);\n\n for (var _i2 = 0; _i2 < bEntries.length; _i2++) {\n var _bEntries$_i = _slicedToArray(bEntries[_i2], 2),\n key = _bEntries$_i[0],\n item = _bEntries$_i[1];\n\n if (_typeof(key) === 'object' && key !== null) {\n if (!mapHasEqualEntry(set, a, key, item, strict, memo)) return false;\n } else if (!strict && (!a.has(key) || !innerDeepEqual(a.get(key), item, false, memo)) && !mapHasEqualEntry(set, a, key, item, false, memo)) {\n return false;\n }\n }\n\n return set.size === 0;\n }\n\n return true;\n}\n\nfunction objEquiv(a, b, strict, keys, memos, iterationType) {\n // Sets and maps don't have their entries accessible via normal object\n // properties.\n var i = 0;\n\n if (iterationType === kIsSet) {\n if (!setEquiv(a, b, strict, memos)) {\n return false;\n }\n } else if (iterationType === kIsMap) {\n if (!mapEquiv(a, b, strict, memos)) {\n return false;\n }\n } else if (iterationType === kIsArray) {\n for (; i < a.length; i++) {\n if (hasOwnProperty(a, i)) {\n if (!hasOwnProperty(b, i) || !innerDeepEqual(a[i], b[i], strict, memos)) {\n return false;\n }\n } else if (hasOwnProperty(b, i)) {\n return false;\n } else {\n // Array is sparse.\n var keysA = Object.keys(a);\n\n for (; i < keysA.length; i++) {\n var key = keysA[i];\n\n if (!hasOwnProperty(b, key) || !innerDeepEqual(a[key], b[key], strict, memos)) {\n return false;\n }\n }\n\n if (keysA.length !== Object.keys(b).length) {\n return false;\n }\n\n return true;\n }\n }\n } // The pair must have equivalent values for every corresponding key.\n // Possibly expensive deep test:\n\n\n for (i = 0; i < keys.length; i++) {\n var _key = keys[i];\n\n if (!innerDeepEqual(a[_key], b[_key], strict, memos)) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction isDeepEqual(val1, val2) {\n return innerDeepEqual(val1, val2, kLoose);\n}\n\nfunction isDeepStrictEqual(val1, val2) {\n return innerDeepEqual(val1, val2, kStrict);\n}\n\nmodule.exports = {\n isDeepEqual: isDeepEqual,\n isDeepStrictEqual: isDeepStrictEqual\n};","'use strict';\n\nvar callBind = require('call-bind');\nvar define = require('define-properties');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Number);\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar define = require('define-properties');\nvar getPolyfill = require('./polyfill');\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function shimNumberIsNaN() {\n\tvar polyfill = getPolyfill();\n\tdefine(Number, { isNaN: polyfill }, {\n\t\tisNaN: function testIsNaN() {\n\t\t\treturn Number.isNaN !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict'\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar Base = require('cipher-base')\n\nvar ZEROS = Buffer.alloc(128)\nvar blocksize = 64\n\nfunction Hmac (alg, key) {\n Base.call(this, 'digest')\n if (typeof key === 'string') {\n key = Buffer.from(key)\n }\n\n this._alg = alg\n this._key = key\n\n if (key.length > blocksize) {\n key = alg(key)\n } else if (key.length < blocksize) {\n key = Buffer.concat([key, ZEROS], blocksize)\n }\n\n var ipad = this._ipad = Buffer.allocUnsafe(blocksize)\n var opad = this._opad = Buffer.allocUnsafe(blocksize)\n\n for (var i = 0; i < blocksize; i++) {\n ipad[i] = key[i] ^ 0x36\n opad[i] = key[i] ^ 0x5C\n }\n\n this._hash = [ipad]\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n this._hash.push(data)\n}\n\nHmac.prototype._final = function () {\n var h = this._alg(Buffer.concat(this._hash))\n return this._alg(Buffer.concat([this._opad, h]))\n}\nmodule.exports = Hmac\n","var DES = require('browserify-des')\nvar aes = require('browserify-aes/browser')\nvar aesModes = require('browserify-aes/modes')\nvar desModes = require('browserify-des/modes')\nvar ebtk = require('evp_bytestokey')\n\nfunction createCipher (suite, password) {\n suite = suite.toLowerCase()\n\n var keyLen, ivLen\n if (aesModes[suite]) {\n keyLen = aesModes[suite].key\n ivLen = aesModes[suite].iv\n } else if (desModes[suite]) {\n keyLen = desModes[suite].key * 8\n ivLen = desModes[suite].iv\n } else {\n throw new TypeError('invalid suite type')\n }\n\n var keys = ebtk(password, false, keyLen, ivLen)\n return createCipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createDecipher (suite, password) {\n suite = suite.toLowerCase()\n\n var keyLen, ivLen\n if (aesModes[suite]) {\n keyLen = aesModes[suite].key\n ivLen = aesModes[suite].iv\n } else if (desModes[suite]) {\n keyLen = desModes[suite].key * 8\n ivLen = desModes[suite].iv\n } else {\n throw new TypeError('invalid suite type')\n }\n\n var keys = ebtk(password, false, keyLen, ivLen)\n return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createCipheriv (suite, key, iv) {\n suite = suite.toLowerCase()\n if (aesModes[suite]) return aes.createCipheriv(suite, key, iv)\n if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite })\n\n throw new TypeError('invalid suite type')\n}\n\nfunction createDecipheriv (suite, key, iv) {\n suite = suite.toLowerCase()\n if (aesModes[suite]) return aes.createDecipheriv(suite, key, iv)\n if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite, decrypt: true })\n\n throw new TypeError('invalid suite type')\n}\n\nfunction getCiphers () {\n return Object.keys(desModes).concat(aes.getCiphers())\n}\n\nexports.createCipher = exports.Cipher = createCipher\nexports.createCipheriv = exports.Cipheriv = createCipheriv\nexports.createDecipher = exports.Decipher = createDecipher\nexports.createDecipheriv = exports.Decipheriv = createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","var CipherBase = require('cipher-base')\nvar des = require('des.js')\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar modes = {\n 'des-ede3-cbc': des.CBC.instantiate(des.EDE),\n 'des-ede3': des.EDE,\n 'des-ede-cbc': des.CBC.instantiate(des.EDE),\n 'des-ede': des.EDE,\n 'des-cbc': des.CBC.instantiate(des.DES),\n 'des-ecb': des.DES\n}\nmodes.des = modes['des-cbc']\nmodes.des3 = modes['des-ede3-cbc']\nmodule.exports = DES\ninherits(DES, CipherBase)\nfunction DES (opts) {\n CipherBase.call(this)\n var modeName = opts.mode.toLowerCase()\n var mode = modes[modeName]\n var type\n if (opts.decrypt) {\n type = 'decrypt'\n } else {\n type = 'encrypt'\n }\n var key = opts.key\n if (!Buffer.isBuffer(key)) {\n key = Buffer.from(key)\n }\n if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {\n key = Buffer.concat([key, key.slice(0, 8)])\n }\n var iv = opts.iv\n if (!Buffer.isBuffer(iv)) {\n iv = Buffer.from(iv)\n }\n this._des = mode.create({\n key: key,\n iv: iv,\n type: type\n })\n}\nDES.prototype._update = function (data) {\n return Buffer.from(this._des.update(data))\n}\nDES.prototype._final = function () {\n return Buffer.from(this._des.final())\n}\n","'use strict';\n\nexports.readUInt32BE = function readUInt32BE(bytes, off) {\n var res = (bytes[0 + off] << 24) |\n (bytes[1 + off] << 16) |\n (bytes[2 + off] << 8) |\n bytes[3 + off];\n return res >>> 0;\n};\n\nexports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {\n bytes[0 + off] = value >>> 24;\n bytes[1 + off] = (value >>> 16) & 0xff;\n bytes[2 + off] = (value >>> 8) & 0xff;\n bytes[3 + off] = value & 0xff;\n};\n\nexports.ip = function ip(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >>> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inL >>> (j + i)) & 1;\n }\n }\n\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) {\n outR <<= 1;\n outR |= (inR >>> (j + i)) & 1;\n }\n for (var j = 1; j <= 25; j += 8) {\n outR <<= 1;\n outR |= (inL >>> (j + i)) & 1;\n }\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.rip = function rip(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n for (var i = 0; i < 4; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n outL <<= 1;\n outL |= (inR >>> (j + i)) & 1;\n outL <<= 1;\n outL |= (inL >>> (j + i)) & 1;\n }\n }\n for (var i = 4; i < 8; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n outR <<= 1;\n outR |= (inR >>> (j + i)) & 1;\n outR <<= 1;\n outR |= (inL >>> (j + i)) & 1;\n }\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.pc1 = function pc1(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n // 7, 15, 23, 31, 39, 47, 55, 63\n // 6, 14, 22, 30, 39, 47, 55, 63\n // 5, 13, 21, 29, 39, 47, 55, 63\n // 4, 12, 20, 28\n for (var i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inL >> (j + i)) & 1;\n }\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >> (j + i)) & 1;\n }\n\n // 1, 9, 17, 25, 33, 41, 49, 57\n // 2, 10, 18, 26, 34, 42, 50, 58\n // 3, 11, 19, 27, 35, 43, 51, 59\n // 36, 44, 52, 60\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inR >> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inL >> (j + i)) & 1;\n }\n }\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inL >> (j + i)) & 1;\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.r28shl = function r28shl(num, shift) {\n return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));\n};\n\nvar pc2table = [\n // inL => outL\n 14, 11, 17, 4, 27, 23, 25, 0,\n 13, 22, 7, 18, 5, 9, 16, 24,\n 2, 20, 12, 21, 1, 8, 15, 26,\n\n // inR => outR\n 15, 4, 25, 19, 9, 1, 26, 16,\n 5, 11, 23, 8, 12, 7, 17, 0,\n 22, 3, 10, 14, 6, 20, 27, 24\n];\n\nexports.pc2 = function pc2(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n var len = pc2table.length >>> 1;\n for (var i = 0; i < len; i++) {\n outL <<= 1;\n outL |= (inL >>> pc2table[i]) & 0x1;\n }\n for (var i = len; i < pc2table.length; i++) {\n outR <<= 1;\n outR |= (inR >>> pc2table[i]) & 0x1;\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.expand = function expand(r, out, off) {\n var outL = 0;\n var outR = 0;\n\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) {\n outL <<= 6;\n outL |= (r >>> i) & 0x3f;\n }\n for (var i = 11; i >= 3; i -= 4) {\n outR |= (r >>> i) & 0x3f;\n outR <<= 6;\n }\n outR |= ((r & 0x1f) << 1) | (r >>> 31);\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nvar sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,\n 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,\n 4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,\n 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,\n\n 15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,\n 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,\n 0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,\n 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,\n\n 10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,\n 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,\n 13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,\n 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,\n\n 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,\n 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,\n 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,\n 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,\n\n 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,\n 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,\n 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,\n\n 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,\n 0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,\n 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,\n 7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,\n\n 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,\n 3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,\n 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,\n 10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,\n\n 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,\n 10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,\n 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,\n 0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11\n];\n\nexports.substitute = function substitute(inL, inR) {\n var out = 0;\n for (var i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 0x3f;\n var sb = sTable[i * 0x40 + b];\n\n out <<= 4;\n out |= sb;\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 0x3f;\n var sb = sTable[4 * 0x40 + i * 0x40 + b];\n\n out <<= 4;\n out |= sb;\n }\n return out >>> 0;\n};\n\nvar permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,\n 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7\n];\n\nexports.permute = function permute(num) {\n var out = 0;\n for (var i = 0; i < permuteTable.length; i++) {\n out <<= 1;\n out |= (num >>> permuteTable[i]) & 0x1;\n }\n return out >>> 0;\n};\n\nexports.padSplit = function padSplit(num, size, group) {\n var str = num.toString(2);\n while (str.length < size)\n str = '0' + str;\n\n var out = [];\n for (var i = 0; i < size; i += group)\n out.push(str.slice(i, i + group));\n return out.join(' ');\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar Cipher = require('./cipher');\nvar DES = require('./des');\n\nfunction EDEState(type, key) {\n assert.equal(key.length, 24, 'Invalid key length');\n\n var k1 = key.slice(0, 8);\n var k2 = key.slice(8, 16);\n var k3 = key.slice(16, 24);\n\n if (type === 'encrypt') {\n this.ciphers = [\n DES.create({ type: 'encrypt', key: k1 }),\n DES.create({ type: 'decrypt', key: k2 }),\n DES.create({ type: 'encrypt', key: k3 })\n ];\n } else {\n this.ciphers = [\n DES.create({ type: 'decrypt', key: k3 }),\n DES.create({ type: 'encrypt', key: k2 }),\n DES.create({ type: 'decrypt', key: k1 })\n ];\n }\n}\n\nfunction EDE(options) {\n Cipher.call(this, options);\n\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n}\ninherits(EDE, Cipher);\n\nmodule.exports = EDE;\n\nEDE.create = function create(options) {\n return new EDE(options);\n};\n\nEDE.prototype._update = function _update(inp, inOff, out, outOff) {\n var state = this._edeState;\n\n state.ciphers[0]._update(inp, inOff, out, outOff);\n state.ciphers[1]._update(out, outOff, out, outOff);\n state.ciphers[2]._update(out, outOff, out, outOff);\n};\n\nEDE.prototype._pad = DES.prototype._pad;\nEDE.prototype._unpad = DES.prototype._unpad;\n","var Buffer = require('safe-buffer').Buffer\nvar ZEROES = Buffer.alloc(16, 0)\n\nfunction toArray (buf) {\n return [\n buf.readUInt32BE(0),\n buf.readUInt32BE(4),\n buf.readUInt32BE(8),\n buf.readUInt32BE(12)\n ]\n}\n\nfunction fromArray (out) {\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0] >>> 0, 0)\n buf.writeUInt32BE(out[1] >>> 0, 4)\n buf.writeUInt32BE(out[2] >>> 0, 8)\n buf.writeUInt32BE(out[3] >>> 0, 12)\n return buf\n}\n\nfunction GHASH (key) {\n this.h = key\n this.state = Buffer.alloc(16, 0)\n this.cache = Buffer.allocUnsafe(0)\n}\n\n// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html\n// by Juho Vähä-Herttua\nGHASH.prototype.ghash = function (block) {\n var i = -1\n while (++i < block.length) {\n this.state[i] ^= block[i]\n }\n this._multiply()\n}\n\nGHASH.prototype._multiply = function () {\n var Vi = toArray(this.h)\n var Zi = [0, 0, 0, 0]\n var j, xi, lsbVi\n var i = -1\n while (++i < 128) {\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0\n if (xi) {\n // Z_i+1 = Z_i ^ V_i\n Zi[0] ^= Vi[0]\n Zi[1] ^= Vi[1]\n Zi[2] ^= Vi[2]\n Zi[3] ^= Vi[3]\n }\n\n // Store the value of LSB(V_i)\n lsbVi = (Vi[3] & 1) !== 0\n\n // V_i+1 = V_i >> 1\n for (j = 3; j > 0; j--) {\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31)\n }\n Vi[0] = Vi[0] >>> 1\n\n // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R\n if (lsbVi) {\n Vi[0] = Vi[0] ^ (0xe1 << 24)\n }\n }\n this.state = fromArray(Zi)\n}\n\nGHASH.prototype.update = function (buf) {\n this.cache = Buffer.concat([this.cache, buf])\n var chunk\n while (this.cache.length >= 16) {\n chunk = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n this.ghash(chunk)\n }\n}\n\nGHASH.prototype.final = function (abl, bl) {\n if (this.cache.length) {\n this.ghash(Buffer.concat([this.cache, ZEROES], 16))\n }\n\n this.ghash(fromArray([0, abl, 0, bl]))\n return this.state\n}\n\nmodule.exports = GHASH\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(pub)) {\n pub = new Buffer(pub, enc);\n }\n this._pub = new BN(pub);\n return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(priv)) {\n priv = new Buffer(priv, enc);\n }\n this._priv = new BN(priv);\n return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n var gen = generator.toString('hex');\n var hex = [gen, prime.toString(16)].join('_');\n if (hex in primeCache) {\n return primeCache[hex];\n }\n var error = 0;\n\n if (prime.isEven() ||\n !primes.simpleSieve ||\n !primes.fermatTest(prime) ||\n !millerRabin.test(prime)) {\n //not a prime so +1\n error += 1;\n\n if (gen === '02' || gen === '05') {\n // we'd be able to check the generator\n // it would fail so +8\n error += 8;\n } else {\n //we wouldn't be able to test the generator\n // so +4\n error += 4;\n }\n primeCache[hex] = error;\n return error;\n }\n if (!millerRabin.test(prime.shrn(1))) {\n //not a safe prime\n error += 2;\n }\n var rem;\n switch (gen) {\n case '02':\n if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n // unsuidable generator\n error += 8;\n }\n break;\n case '05':\n rem = prime.mod(TEN);\n if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n // prime mod 10 needs to equal 3 or 7\n error += 8;\n }\n break;\n default:\n error += 4;\n }\n primeCache[hex] = error;\n return error;\n}\n\nfunction DH(prime, generator, malleable) {\n this.setGenerator(generator);\n this.__prime = new BN(prime);\n this._prime = BN.mont(this.__prime);\n this._primeLen = prime.length;\n this._pub = undefined;\n this._priv = undefined;\n this._primeCode = undefined;\n if (malleable) {\n this.setPublicKey = setPublicKey;\n this.setPrivateKey = setPrivateKey;\n } else {\n this._primeCode = 8;\n }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n enumerable: true,\n get: function () {\n if (typeof this._primeCode !== 'number') {\n this._primeCode = checkPrime(this.__prime, this.__gen);\n }\n return this._primeCode;\n }\n});\nDH.prototype.generateKeys = function () {\n if (!this._priv) {\n this._priv = new BN(randomBytes(this._primeLen));\n }\n this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n other = new BN(other);\n other = other.toRed(this._prime);\n var secret = other.redPow(this._priv).fromRed();\n var out = new Buffer(secret.toArray());\n var prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0);\n out = Buffer.concat([front, out]);\n }\n return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(gen)) {\n gen = new Buffer(gen, enc);\n }\n this.__gen = gen;\n this._gen = new BN(gen);\n return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n if (!enc) {\n return buf;\n } else {\n return buf.toString(enc);\n }\n}\n","var Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar stream = require('readable-stream')\nvar inherits = require('inherits')\nvar sign = require('./sign')\nvar verify = require('./verify')\n\nvar algorithms = require('./algorithms.json')\nObject.keys(algorithms).forEach(function (key) {\n algorithms[key].id = Buffer.from(algorithms[key].id, 'hex')\n algorithms[key.toLowerCase()] = algorithms[key]\n})\n\nfunction Sign (algorithm) {\n stream.Writable.call(this)\n\n var data = algorithms[algorithm]\n if (!data) throw new Error('Unknown message digest')\n\n this._hashType = data.hash\n this._hash = createHash(data.hash)\n this._tag = data.id\n this._signType = data.sign\n}\ninherits(Sign, stream.Writable)\n\nSign.prototype._write = function _write (data, _, done) {\n this._hash.update(data)\n done()\n}\n\nSign.prototype.update = function update (data, enc) {\n if (typeof data === 'string') data = Buffer.from(data, enc)\n\n this._hash.update(data)\n return this\n}\n\nSign.prototype.sign = function signMethod (key, enc) {\n this.end()\n var hash = this._hash.digest()\n var sig = sign(hash, key, this._hashType, this._signType, this._tag)\n\n return enc ? sig.toString(enc) : sig\n}\n\nfunction Verify (algorithm) {\n stream.Writable.call(this)\n\n var data = algorithms[algorithm]\n if (!data) throw new Error('Unknown message digest')\n\n this._hash = createHash(data.hash)\n this._tag = data.id\n this._signType = data.sign\n}\ninherits(Verify, stream.Writable)\n\nVerify.prototype._write = function _write (data, _, done) {\n this._hash.update(data)\n done()\n}\n\nVerify.prototype.update = function update (data, enc) {\n if (typeof data === 'string') data = Buffer.from(data, enc)\n\n this._hash.update(data)\n return this\n}\n\nVerify.prototype.verify = function verifyMethod (key, sig, enc) {\n if (typeof sig === 'string') sig = Buffer.from(sig, enc)\n\n this.end()\n var hash = this._hash.digest()\n return verify(sig, hash, key, this._signType, this._tag)\n}\n\nfunction createSign (algorithm) {\n return new Sign(algorithm)\n}\n\nfunction createVerify (algorithm) {\n return new Verify(algorithm)\n}\n\nmodule.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign: createSign,\n createVerify: createVerify\n}\n","module.exports = require('events').EventEmitter;\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar createHmac = require('create-hmac')\nvar crt = require('browserify-rsa')\nvar EC = require('elliptic').ec\nvar BN = require('bn.js')\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction sign (hash, key, hashType, signType, tag) {\n var priv = parseKeys(key)\n if (priv.curve) {\n // rsa keys can be interpreted as ecdsa ones in openssl\n if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n return ecSign(hash, priv)\n } else if (priv.type === 'dsa') {\n if (signType !== 'dsa') throw new Error('wrong private key type')\n return dsaSign(hash, priv, hashType)\n } else {\n if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n }\n hash = Buffer.concat([tag, hash])\n var len = priv.modulus.byteLength()\n var pad = [0, 1]\n while (hash.length + pad.length + 1 < len) pad.push(0xff)\n pad.push(0x00)\n var i = -1\n while (++i < hash.length) pad.push(hash[i])\n\n var out = crt(pad, priv)\n return out\n}\n\nfunction ecSign (hash, priv) {\n var curveId = curves[priv.curve.join('.')]\n if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))\n\n var curve = new EC(curveId)\n var key = curve.keyFromPrivate(priv.privateKey)\n var out = key.sign(hash)\n\n return Buffer.from(out.toDER())\n}\n\nfunction dsaSign (hash, priv, algo) {\n var x = priv.params.priv_key\n var p = priv.params.p\n var q = priv.params.q\n var g = priv.params.g\n var r = new BN(0)\n var k\n var H = bits2int(hash, q).mod(q)\n var s = false\n var kv = getKey(x, q, hash, algo)\n while (s === false) {\n k = makeKey(q, kv, algo)\n r = makeR(g, k, p, q)\n s = k.invm(q).imul(H.add(x.mul(r))).mod(q)\n if (s.cmpn(0) === 0) {\n s = false\n r = new BN(0)\n }\n }\n return toDER(r, s)\n}\n\nfunction toDER (r, s) {\n r = r.toArray()\n s = s.toArray()\n\n // Pad values\n if (r[0] & 0x80) r = [0].concat(r)\n if (s[0] & 0x80) s = [0].concat(s)\n\n var total = r.length + s.length + 4\n var res = [0x30, total, 0x02, r.length]\n res = res.concat(r, [0x02, s.length], s)\n return Buffer.from(res)\n}\n\nfunction getKey (x, q, hash, algo) {\n x = Buffer.from(x.toArray())\n if (x.length < q.byteLength()) {\n var zeros = Buffer.alloc(q.byteLength() - x.length)\n x = Buffer.concat([zeros, x])\n }\n var hlen = hash.length\n var hbits = bits2octets(hash, q)\n var v = Buffer.alloc(hlen)\n v.fill(1)\n var k = Buffer.alloc(hlen)\n k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest()\n v = createHmac(algo, k).update(v).digest()\n k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest()\n v = createHmac(algo, k).update(v).digest()\n return { k: k, v: v }\n}\n\nfunction bits2int (obits, q) {\n var bits = new BN(obits)\n var shift = (obits.length << 3) - q.bitLength()\n if (shift > 0) bits.ishrn(shift)\n return bits\n}\n\nfunction bits2octets (bits, q) {\n bits = bits2int(bits, q)\n bits = bits.mod(q)\n var out = Buffer.from(bits.toArray())\n if (out.length < q.byteLength()) {\n var zeros = Buffer.alloc(q.byteLength() - out.length)\n out = Buffer.concat([zeros, out])\n }\n return out\n}\n\nfunction makeKey (q, kv, algo) {\n var t\n var k\n\n do {\n t = Buffer.alloc(0)\n\n while (t.length * 8 < q.bitLength()) {\n kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n t = Buffer.concat([t, kv.v])\n }\n\n k = bits2int(t, q)\n kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest()\n kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n } while (k.cmp(q) !== -1)\n\n return k\n}\n\nfunction makeR (g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q)\n}\n\nmodule.exports = sign\nmodule.exports.getKey = getKey\nmodule.exports.makeKey = makeKey\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n this.name = name;\n this.body = body;\n\n this.decoders = {};\n this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n const name = this.name;\n\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n inherits(Generated, Base);\n Generated.prototype._initNamed = function _initNamed(entity, name) {\n Base.call(this, entity, name);\n };\n\n return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n enc = enc || 'der';\n // Lazily create decoder\n if (!this.decoders.hasOwnProperty(enc))\n this.decoders[enc] = this._createNamed(decoders[enc]);\n return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n enc = enc || 'der';\n // Lazily create encoder\n if (!this.encoders.hasOwnProperty(enc))\n this.encoders[enc] = this._createNamed(encoders[enc]);\n return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n};\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n DEREncoder.call(this, entity);\n this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n const buf = DEREncoder.prototype.encode.call(this, data);\n\n const p = buf.toString('base64');\n const out = [ '-----BEGIN ' + options.label + '-----' ];\n for (let i = 0; i < p.length; i += 64)\n out.push(p.slice(i, i + 64));\n out.push('-----END ' + options.label + '-----');\n return out.join('\\n');\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n DERDecoder.call(this, entity);\n this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n const lines = data.toString().split(/[\\r\\n]+/g);\n\n const label = options.label.toUpperCase();\n\n const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n let start = -1;\n let end = -1;\n for (let i = 0; i < lines.length; i++) {\n const match = lines[i].match(re);\n if (match === null)\n continue;\n\n if (match[2] !== label)\n continue;\n\n if (start === -1) {\n if (match[1] !== 'BEGIN')\n break;\n start = i;\n } else {\n if (match[1] !== 'END')\n break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1)\n throw new Error('PEM section not found for: ' + label);\n\n const base64 = lines.slice(start + 1, end).join('');\n // Remove excessive symbols\n base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n const input = Buffer.from(base64, 'base64');\n return DERDecoder.prototype.decode.call(this, input, options);\n};\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n const res = {};\n\n Object.keys(map).forEach(function(key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key)\n key = key | 0;\n\n const value = map[key];\n res[value] = key;\n });\n\n return res;\n};\n\nconstants.der = require('./der');\n","// from https://github.com/Rantanen/node-dtls/blob/25a7dc861bda38cfeac93a723500eea4f0ac2e86/Certificate.js\n// thanks to @Rantanen\n\n'use strict'\n\nvar asn = require('asn1.js')\n\nvar Time = asn.define('Time', function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime()\n })\n})\n\nvar AttributeTypeValue = asn.define('AttributeTypeValue', function () {\n this.seq().obj(\n this.key('type').objid(),\n this.key('value').any()\n )\n})\n\nvar AlgorithmIdentifier = asn.define('AlgorithmIdentifier', function () {\n this.seq().obj(\n this.key('algorithm').objid(),\n this.key('parameters').optional(),\n this.key('curve').objid().optional()\n )\n})\n\nvar SubjectPublicKeyInfo = asn.define('SubjectPublicKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPublicKey').bitstr()\n )\n})\n\nvar RelativeDistinguishedName = asn.define('RelativeDistinguishedName', function () {\n this.setof(AttributeTypeValue)\n})\n\nvar RDNSequence = asn.define('RDNSequence', function () {\n this.seqof(RelativeDistinguishedName)\n})\n\nvar Name = asn.define('Name', function () {\n this.choice({\n rdnSequence: this.use(RDNSequence)\n })\n})\n\nvar Validity = asn.define('Validity', function () {\n this.seq().obj(\n this.key('notBefore').use(Time),\n this.key('notAfter').use(Time)\n )\n})\n\nvar Extension = asn.define('Extension', function () {\n this.seq().obj(\n this.key('extnID').objid(),\n this.key('critical').bool().def(false),\n this.key('extnValue').octstr()\n )\n})\n\nvar TBSCertificate = asn.define('TBSCertificate', function () {\n this.seq().obj(\n this.key('version').explicit(0).int().optional(),\n this.key('serialNumber').int(),\n this.key('signature').use(AlgorithmIdentifier),\n this.key('issuer').use(Name),\n this.key('validity').use(Validity),\n this.key('subject').use(Name),\n this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo),\n this.key('issuerUniqueID').implicit(1).bitstr().optional(),\n this.key('subjectUniqueID').implicit(2).bitstr().optional(),\n this.key('extensions').explicit(3).seqof(Extension).optional()\n )\n})\n\nvar X509Certificate = asn.define('X509Certificate', function () {\n this.seq().obj(\n this.key('tbsCertificate').use(TBSCertificate),\n this.key('signatureAlgorithm').use(AlgorithmIdentifier),\n this.key('signatureValue').bitstr()\n )\n})\n\nmodule.exports = X509Certificate\n","// adapted from https://github.com/apatil/pemstrip\nvar findProc = /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m\nvar startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m\nvar fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m\nvar evp = require('evp_bytestokey')\nvar ciphers = require('browserify-aes')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = function (okey, password) {\n var key = okey.toString()\n var match = key.match(findProc)\n var decrypted\n if (!match) {\n var match2 = key.match(fullRegex)\n decrypted = Buffer.from(match2[2].replace(/[\\r\\n]/g, ''), 'base64')\n } else {\n var suite = 'aes' + match[1]\n var iv = Buffer.from(match[2], 'hex')\n var cipherText = Buffer.from(match[3].replace(/[\\r\\n]/g, ''), 'base64')\n var cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key\n var out = []\n var cipher = ciphers.createDecipheriv(suite, cipherKey, iv)\n out.push(cipher.update(cipherText))\n out.push(cipher.final())\n decrypted = Buffer.concat(out)\n }\n var tag = key.match(startRegex)[1]\n return {\n tag: tag,\n data: decrypted\n }\n}\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction verify (sig, hash, key, signType, tag) {\n var pub = parseKeys(key)\n if (pub.type === 'ec') {\n // rsa keys can be interpreted as ecdsa ones in openssl\n if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n return ecVerify(sig, hash, pub)\n } else if (pub.type === 'dsa') {\n if (signType !== 'dsa') throw new Error('wrong public key type')\n return dsaVerify(sig, hash, pub)\n } else {\n if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n }\n hash = Buffer.concat([tag, hash])\n var len = pub.modulus.byteLength()\n var pad = [1]\n var padNum = 0\n while (hash.length + pad.length + 2 < len) {\n pad.push(0xff)\n padNum++\n }\n pad.push(0x00)\n var i = -1\n while (++i < hash.length) {\n pad.push(hash[i])\n }\n pad = Buffer.from(pad)\n var red = BN.mont(pub.modulus)\n sig = new BN(sig).toRed(red)\n\n sig = sig.redPow(new BN(pub.publicExponent))\n sig = Buffer.from(sig.fromRed().toArray())\n var out = padNum < 8 ? 1 : 0\n len = Math.min(sig.length, pad.length)\n if (sig.length !== pad.length) out = 1\n\n i = -1\n while (++i < len) out |= sig[i] ^ pad[i]\n return out === 0\n}\n\nfunction ecVerify (sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join('.')]\n if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))\n\n var curve = new EC(curveId)\n var pubkey = pub.data.subjectPrivateKey.data\n\n return curve.verify(hash, sig, pubkey)\n}\n\nfunction dsaVerify (sig, hash, pub) {\n var p = pub.data.p\n var q = pub.data.q\n var g = pub.data.g\n var y = pub.data.pub_key\n var unpacked = parseKeys.signature.decode(sig, 'der')\n var s = unpacked.s\n var r = unpacked.r\n checkValue(s, q)\n checkValue(r, q)\n var montp = BN.mont(p)\n var w = s.invm(q)\n var v = g.toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q)\n return v.cmp(r) === 0\n}\n\nfunction checkValue (b, q) {\n if (b.cmpn(0) <= 0) throw new Error('invalid sig')\n if (b.cmp(q) >= q) throw new Error('invalid sig')\n}\n\nmodule.exports = verify\n","var elliptic = require('elliptic')\nvar BN = require('bn.js')\n\nmodule.exports = function createECDH (curve) {\n return new ECDH(curve)\n}\n\nvar aliases = {\n secp256k1: {\n name: 'secp256k1',\n byteLength: 32\n },\n secp224r1: {\n name: 'p224',\n byteLength: 28\n },\n prime256v1: {\n name: 'p256',\n byteLength: 32\n },\n prime192v1: {\n name: 'p192',\n byteLength: 24\n },\n ed25519: {\n name: 'ed25519',\n byteLength: 32\n },\n secp384r1: {\n name: 'p384',\n byteLength: 48\n },\n secp521r1: {\n name: 'p521',\n byteLength: 66\n }\n}\n\naliases.p224 = aliases.secp224r1\naliases.p256 = aliases.secp256r1 = aliases.prime256v1\naliases.p192 = aliases.secp192r1 = aliases.prime192v1\naliases.p384 = aliases.secp384r1\naliases.p521 = aliases.secp521r1\n\nfunction ECDH (curve) {\n this.curveType = aliases[curve]\n if (!this.curveType) {\n this.curveType = {\n name: curve\n }\n }\n this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap\n this.keys = void 0\n}\n\nECDH.prototype.generateKeys = function (enc, format) {\n this.keys = this.curve.genKeyPair()\n return this.getPublicKey(enc, format)\n}\n\nECDH.prototype.computeSecret = function (other, inenc, enc) {\n inenc = inenc || 'utf8'\n if (!Buffer.isBuffer(other)) {\n other = new Buffer(other, inenc)\n }\n var otherPub = this.curve.keyFromPublic(other).getPublic()\n var out = otherPub.mul(this.keys.getPrivate()).getX()\n return formatReturnValue(out, enc, this.curveType.byteLength)\n}\n\nECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === 'compressed', true)\n if (format === 'hybrid') {\n if (key[key.length - 1] % 2) {\n key[0] = 7\n } else {\n key[0] = 6\n }\n }\n return formatReturnValue(key, enc)\n}\n\nECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc)\n}\n\nECDH.prototype.setPublicKey = function (pub, enc) {\n enc = enc || 'utf8'\n if (!Buffer.isBuffer(pub)) {\n pub = new Buffer(pub, enc)\n }\n this.keys._importPublic(pub)\n return this\n}\n\nECDH.prototype.setPrivateKey = function (priv, enc) {\n enc = enc || 'utf8'\n if (!Buffer.isBuffer(priv)) {\n priv = new Buffer(priv, enc)\n }\n\n var _priv = new BN(priv)\n _priv = _priv.toString(16)\n this.keys = this.curve.genKeyPair()\n this.keys._importPrivate(_priv)\n return this\n}\n\nfunction formatReturnValue (bn, enc, len) {\n if (!Array.isArray(bn)) {\n bn = bn.toArray()\n }\n var buf = new Buffer(bn)\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length)\n zeros.fill(0)\n buf = Buffer.concat([zeros, buf])\n }\n if (!enc) {\n return buf\n } else {\n return buf.toString(enc)\n }\n}\n","var parseKeys = require('parse-asn1')\nvar randomBytes = require('randombytes')\nvar createHash = require('create-hash')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar withPublic = require('./withPublic')\nvar crt = require('browserify-rsa')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function publicEncrypt (publicKey, msg, reverse) {\n var padding\n if (publicKey.padding) {\n padding = publicKey.padding\n } else if (reverse) {\n padding = 1\n } else {\n padding = 4\n }\n var key = parseKeys(publicKey)\n var paddedMsg\n if (padding === 4) {\n paddedMsg = oaep(key, msg)\n } else if (padding === 1) {\n paddedMsg = pkcs1(key, msg, reverse)\n } else if (padding === 3) {\n paddedMsg = new BN(msg)\n if (paddedMsg.cmp(key.modulus) >= 0) {\n throw new Error('data too long for modulus')\n }\n } else {\n throw new Error('unknown padding')\n }\n if (reverse) {\n return crt(paddedMsg, key)\n } else {\n return withPublic(paddedMsg, key)\n }\n}\n\nfunction oaep (key, msg) {\n var k = key.modulus.byteLength()\n var mLen = msg.length\n var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n var hLen = iHash.length\n var hLen2 = 2 * hLen\n if (mLen > k - hLen2 - 2) {\n throw new Error('message too long')\n }\n var ps = Buffer.alloc(k - mLen - hLen2 - 2)\n var dblen = k - hLen - 1\n var seed = randomBytes(hLen)\n var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen))\n var maskedSeed = xor(seed, mgf(maskedDb, hLen))\n return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k))\n}\nfunction pkcs1 (key, msg, reverse) {\n var mLen = msg.length\n var k = key.modulus.byteLength()\n if (mLen > k - 11) {\n throw new Error('message too long')\n }\n var ps\n if (reverse) {\n ps = Buffer.alloc(k - mLen - 3, 0xff)\n } else {\n ps = nonZero(k - mLen - 3)\n }\n return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k))\n}\nfunction nonZero (len) {\n var out = Buffer.allocUnsafe(len)\n var i = 0\n var cache = randomBytes(len * 2)\n var cur = 0\n var num\n while (i < len) {\n if (cur === cache.length) {\n cache = randomBytes(len * 2)\n cur = 0\n }\n num = cache[cur++]\n if (num) {\n out[i++] = num\n }\n }\n return out\n}\n","var parseKeys = require('parse-asn1')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar crt = require('browserify-rsa')\nvar createHash = require('create-hash')\nvar withPublic = require('./withPublic')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function privateDecrypt (privateKey, enc, reverse) {\n var padding\n if (privateKey.padding) {\n padding = privateKey.padding\n } else if (reverse) {\n padding = 1\n } else {\n padding = 4\n }\n\n var key = parseKeys(privateKey)\n var k = key.modulus.byteLength()\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) {\n throw new Error('decryption error')\n }\n var msg\n if (reverse) {\n msg = withPublic(new BN(enc), key)\n } else {\n msg = crt(enc, key)\n }\n var zBuffer = Buffer.alloc(k - msg.length)\n msg = Buffer.concat([zBuffer, msg], k)\n if (padding === 4) {\n return oaep(key, msg)\n } else if (padding === 1) {\n return pkcs1(key, msg, reverse)\n } else if (padding === 3) {\n return msg\n } else {\n throw new Error('unknown padding')\n }\n}\n\nfunction oaep (key, msg) {\n var k = key.modulus.byteLength()\n var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n var hLen = iHash.length\n if (msg[0] !== 0) {\n throw new Error('decryption error')\n }\n var maskedSeed = msg.slice(1, hLen + 1)\n var maskedDb = msg.slice(hLen + 1)\n var seed = xor(maskedSeed, mgf(maskedDb, hLen))\n var db = xor(maskedDb, mgf(seed, k - hLen - 1))\n if (compare(iHash, db.slice(0, hLen))) {\n throw new Error('decryption error')\n }\n var i = hLen\n while (db[i] === 0) {\n i++\n }\n if (db[i++] !== 1) {\n throw new Error('decryption error')\n }\n return db.slice(i)\n}\n\nfunction pkcs1 (key, msg, reverse) {\n var p1 = msg.slice(0, 2)\n var i = 2\n var status = 0\n while (msg[i++] !== 0) {\n if (i >= msg.length) {\n status++\n break\n }\n }\n var ps = msg.slice(2, i - 1)\n\n if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {\n status++\n }\n if (ps.length < 8) {\n status++\n }\n if (status) {\n throw new Error('decryption error')\n }\n return msg.slice(i)\n}\nfunction compare (a, b) {\n a = Buffer.from(a)\n b = Buffer.from(b)\n var dif = 0\n var len = a.length\n if (a.length !== b.length) {\n dif++\n len = Math.min(a.length, b.length)\n }\n var i = -1\n while (++i < len) {\n dif += (a[i] ^ b[i])\n }\n return dif\n}\n","'use strict'\n\nvar createHash = require('create-hash')\nvar bs58checkBase = require('./base')\n\n// SHA256(SHA256(buffer))\nfunction sha256x2 (buffer) {\n var tmp = createHash('sha256').update(buffer).digest()\n return createHash('sha256').update(tmp).digest()\n}\n\nmodule.exports = bs58checkBase(sha256x2)\n","'use strict'\n\nvar base58 = require('bs58')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (checksumFn) {\n // Encode a buffer as a base58-check encoded string\n function encode (payload) {\n var checksum = checksumFn(payload)\n\n return base58.encode(Buffer.concat([\n payload,\n checksum\n ], payload.length + 4))\n }\n\n function decodeRaw (buffer) {\n var payload = buffer.slice(0, -4)\n var checksum = buffer.slice(-4)\n var newChecksum = checksumFn(payload)\n\n if (checksum[0] ^ newChecksum[0] |\n checksum[1] ^ newChecksum[1] |\n checksum[2] ^ newChecksum[2] |\n checksum[3] ^ newChecksum[3]) return\n\n return payload\n }\n\n // Decode a base58-check encoded string to a buffer, no result if checksum is wrong\n function decodeUnsafe (string) {\n var buffer = base58.decodeUnsafe(string)\n if (!buffer) return\n\n return decodeRaw(buffer)\n }\n\n function decode (string) {\n var buffer = base58.decode(string)\n var payload = decodeRaw(buffer, checksumFn)\n if (!payload) throw new Error('Invalid checksum')\n return payload\n }\n\n return {\n encode: encode,\n decode: decode,\n decodeUnsafe: decodeUnsafe\n }\n}\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = require('safe-buffer').Buffer\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return _Buffer.alloc(0) }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n vch.fill(0x00, 0, zeroes)\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","'use strict'\nmodule.exports = require('./lib')(require('./lib/elliptic'))\n","'use strict'\nvar assert = require('./assert')\nvar der = require('./der')\nvar messages = require('./messages.json')\n\nfunction initCompressedValue (value, defaultValue) {\n if (value === undefined) return defaultValue\n\n assert.isBoolean(value, messages.COMPRESSED_TYPE_INVALID)\n return value\n}\n\nmodule.exports = function (secp256k1) {\n return {\n privateKeyVerify: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n return privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)\n },\n\n privateKeyExport: function (privateKey, compressed) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n var publicKey = secp256k1.privateKeyExport(privateKey, compressed)\n\n return der.privateKeyExport(privateKey, publicKey, compressed)\n },\n\n privateKeyImport: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n\n privateKey = der.privateKeyImport(privateKey)\n if (privateKey && privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)) return privateKey\n\n throw new Error(messages.EC_PRIVATE_KEY_IMPORT_DER_FAIL)\n },\n\n privateKeyNegate: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.privateKeyNegate(privateKey)\n },\n\n privateKeyModInverse: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.privateKeyModInverse(privateKey)\n },\n\n privateKeyTweakAdd: function (privateKey, tweak) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n return secp256k1.privateKeyTweakAdd(privateKey, tweak)\n },\n\n privateKeyTweakMul: function (privateKey, tweak) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n return secp256k1.privateKeyTweakMul(privateKey, tweak)\n },\n\n publicKeyCreate: function (privateKey, compressed) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyCreate(privateKey, compressed)\n },\n\n publicKeyConvert: function (publicKey, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyConvert(publicKey, compressed)\n },\n\n publicKeyVerify: function (publicKey) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n return secp256k1.publicKeyVerify(publicKey)\n },\n\n publicKeyTweakAdd: function (publicKey, tweak, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyTweakAdd(publicKey, tweak, compressed)\n },\n\n publicKeyTweakMul: function (publicKey, tweak, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyTweakMul(publicKey, tweak, compressed)\n },\n\n publicKeyCombine: function (publicKeys, compressed) {\n assert.isArray(publicKeys, messages.EC_PUBLIC_KEYS_TYPE_INVALID)\n assert.isLengthGTZero(publicKeys, messages.EC_PUBLIC_KEYS_LENGTH_INVALID)\n for (var i = 0; i < publicKeys.length; ++i) {\n assert.isBuffer(publicKeys[i], messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKeys[i], 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n }\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyCombine(publicKeys, compressed)\n },\n\n signatureNormalize: function (signature) {\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n return secp256k1.signatureNormalize(signature)\n },\n\n signatureExport: function (signature) {\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = secp256k1.signatureExport(signature)\n return der.signatureExport(sigObj)\n },\n\n signatureImport: function (sig) {\n assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = der.signatureImport(sig)\n if (sigObj) return secp256k1.signatureImport(sigObj)\n\n throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL)\n },\n\n signatureImportLax: function (sig) {\n assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = der.signatureImportLax(sig)\n if (sigObj) return secp256k1.signatureImport(sigObj)\n\n throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL)\n },\n\n sign: function (message, privateKey, options) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n var data = null\n var noncefn = null\n if (options !== undefined) {\n assert.isObject(options, messages.OPTIONS_TYPE_INVALID)\n\n if (options.data !== undefined) {\n assert.isBuffer(options.data, messages.OPTIONS_DATA_TYPE_INVALID)\n assert.isBufferLength(options.data, 32, messages.OPTIONS_DATA_LENGTH_INVALID)\n data = options.data\n }\n\n if (options.noncefn !== undefined) {\n assert.isFunction(options.noncefn, messages.OPTIONS_NONCEFN_TYPE_INVALID)\n noncefn = options.noncefn\n }\n }\n\n return secp256k1.sign(message, privateKey, noncefn, data)\n },\n\n verify: function (message, signature, publicKey) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n return secp256k1.verify(message, signature, publicKey)\n },\n\n recover: function (message, signature, recovery, compressed) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n assert.isNumber(recovery, messages.RECOVERY_ID_TYPE_INVALID)\n assert.isNumberInInterval(recovery, -1, 4, messages.RECOVERY_ID_VALUE_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.recover(message, signature, recovery, compressed)\n },\n\n ecdh: function (publicKey, privateKey) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.ecdh(publicKey, privateKey)\n },\n\n ecdhUnsafe: function (publicKey, privateKey, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.ecdhUnsafe(publicKey, privateKey, compressed)\n }\n }\n}\n","// Reference https://github.com/bitcoin/bips/blob/master/bip-0066.mediawiki\n// Format: 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n// NOTE: SIGHASH byte ignored AND restricted, truncate before use\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction check (buffer) {\n if (buffer.length < 8) return false\n if (buffer.length > 72) return false\n if (buffer[0] !== 0x30) return false\n if (buffer[1] !== buffer.length - 2) return false\n if (buffer[2] !== 0x02) return false\n\n var lenR = buffer[3]\n if (lenR === 0) return false\n if (5 + lenR >= buffer.length) return false\n if (buffer[4 + lenR] !== 0x02) return false\n\n var lenS = buffer[5 + lenR]\n if (lenS === 0) return false\n if ((6 + lenR + lenS) !== buffer.length) return false\n\n if (buffer[4] & 0x80) return false\n if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) return false\n\n if (buffer[lenR + 6] & 0x80) return false\n if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) return false\n return true\n}\n\nfunction decode (buffer) {\n if (buffer.length < 8) throw new Error('DER sequence length is too short')\n if (buffer.length > 72) throw new Error('DER sequence length is too long')\n if (buffer[0] !== 0x30) throw new Error('Expected DER sequence')\n if (buffer[1] !== buffer.length - 2) throw new Error('DER sequence length is invalid')\n if (buffer[2] !== 0x02) throw new Error('Expected DER integer')\n\n var lenR = buffer[3]\n if (lenR === 0) throw new Error('R length is zero')\n if (5 + lenR >= buffer.length) throw new Error('R length is too long')\n if (buffer[4 + lenR] !== 0x02) throw new Error('Expected DER integer (2)')\n\n var lenS = buffer[5 + lenR]\n if (lenS === 0) throw new Error('S length is zero')\n if ((6 + lenR + lenS) !== buffer.length) throw new Error('S length is invalid')\n\n if (buffer[4] & 0x80) throw new Error('R value is negative')\n if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) throw new Error('R value excessively padded')\n\n if (buffer[lenR + 6] & 0x80) throw new Error('S value is negative')\n if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) throw new Error('S value excessively padded')\n\n // non-BIP66 - extract R, S values\n return {\n r: buffer.slice(4, 4 + lenR),\n s: buffer.slice(6 + lenR)\n }\n}\n\n/*\n * Expects r and s to be positive DER integers.\n *\n * The DER format uses the most significant bit as a sign bit (& 0x80).\n * If the significant bit is set AND the integer is positive, a 0x00 is prepended.\n *\n * Examples:\n *\n * 0 => 0x00\n * 1 => 0x01\n * -1 => 0xff\n * 127 => 0x7f\n * -127 => 0x81\n * 128 => 0x0080\n * -128 => 0x80\n * 255 => 0x00ff\n * -255 => 0xff01\n * 16300 => 0x3fac\n * -16300 => 0xc054\n * 62300 => 0x00f35c\n * -62300 => 0xff0ca4\n*/\nfunction encode (r, s) {\n var lenR = r.length\n var lenS = s.length\n if (lenR === 0) throw new Error('R length is zero')\n if (lenS === 0) throw new Error('S length is zero')\n if (lenR > 33) throw new Error('R length is too long')\n if (lenS > 33) throw new Error('S length is too long')\n if (r[0] & 0x80) throw new Error('R value is negative')\n if (s[0] & 0x80) throw new Error('S value is negative')\n if (lenR > 1 && (r[0] === 0x00) && !(r[1] & 0x80)) throw new Error('R value excessively padded')\n if (lenS > 1 && (s[0] === 0x00) && !(s[1] & 0x80)) throw new Error('S value excessively padded')\n\n var signature = Buffer.allocUnsafe(6 + lenR + lenS)\n\n // 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n signature[0] = 0x30\n signature[1] = signature.length - 2\n signature[2] = 0x02\n signature[3] = r.length\n r.copy(signature, 4)\n signature[4 + lenR] = 0x02\n signature[5 + lenR] = s.length\n s.copy(signature, 6 + lenR)\n\n return signature\n}\n\nmodule.exports = {\n check: check,\n decode: decode,\n encode: encode\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\n\nvar messages = require('../messages.json')\n\nvar ec = new EC('secp256k1')\nvar ecparams = ec.curve\n\nfunction loadCompressedPublicKey (first, xBuffer) {\n var x = new BN(xBuffer)\n\n // overflow\n if (x.cmp(ecparams.p) >= 0) return null\n x = x.toRed(ecparams.red)\n\n // compute corresponding Y\n var y = x.redSqr().redIMul(x).redIAdd(ecparams.b).redSqrt()\n if ((first === 0x03) !== y.isOdd()) y = y.redNeg()\n\n return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadUncompressedPublicKey (first, xBuffer, yBuffer) {\n var x = new BN(xBuffer)\n var y = new BN(yBuffer)\n\n // overflow\n if (x.cmp(ecparams.p) >= 0 || y.cmp(ecparams.p) >= 0) return null\n\n x = x.toRed(ecparams.red)\n y = y.toRed(ecparams.red)\n\n // is odd flag\n if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null\n\n // x*x*x + b = y*y\n var x3 = x.redSqr().redIMul(x)\n if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null\n\n return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadPublicKey (publicKey) {\n var first = publicKey[0]\n switch (first) {\n case 0x02:\n case 0x03:\n if (publicKey.length !== 33) return null\n return loadCompressedPublicKey(first, publicKey.slice(1, 33))\n case 0x04:\n case 0x06:\n case 0x07:\n if (publicKey.length !== 65) return null\n return loadUncompressedPublicKey(first, publicKey.slice(1, 33), publicKey.slice(33, 65))\n default:\n return null\n }\n}\n\nexports.privateKeyVerify = function (privateKey) {\n var bn = new BN(privateKey)\n return bn.cmp(ecparams.n) < 0 && !bn.isZero()\n}\n\nexports.privateKeyExport = function (privateKey, compressed) {\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PRIVATE_KEY_EXPORT_DER_FAIL)\n\n return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true))\n}\n\nexports.privateKeyNegate = function (privateKey) {\n var bn = new BN(privateKey)\n return bn.isZero() ? Buffer.alloc(32) : ecparams.n.sub(bn).umod(ecparams.n).toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyModInverse = function (privateKey) {\n var bn = new BN(privateKey)\n if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_RANGE_INVALID)\n\n return bn.invm(ecparams.n).toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyTweakAdd = function (privateKey, tweak) {\n var bn = new BN(tweak)\n if (bn.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL)\n\n bn.iadd(new BN(privateKey))\n if (bn.cmp(ecparams.n) >= 0) bn.isub(ecparams.n)\n if (bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL)\n\n return bn.toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyTweakMul = function (privateKey, tweak) {\n var bn = new BN(tweak)\n if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_MUL_FAIL)\n\n bn.imul(new BN(privateKey))\n if (bn.cmp(ecparams.n)) bn = bn.umod(ecparams.n)\n\n return bn.toArrayLike(Buffer, 'be', 32)\n}\n\nexports.publicKeyCreate = function (privateKey, compressed) {\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PUBLIC_KEY_CREATE_FAIL)\n\n return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true))\n}\n\nexports.publicKeyConvert = function (publicKey, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n return Buffer.from(pair.getPublic(compressed, true))\n}\n\nexports.publicKeyVerify = function (publicKey) {\n return loadPublicKey(publicKey) !== null\n}\n\nexports.publicKeyTweakAdd = function (publicKey, tweak, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n tweak = new BN(tweak)\n if (tweak.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL)\n\n var point = ecparams.g.mul(tweak).add(pair.pub)\n if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL)\n\n return Buffer.from(point.encode(true, compressed))\n}\n\nexports.publicKeyTweakMul = function (publicKey, tweak, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n tweak = new BN(tweak)\n if (tweak.cmp(ecparams.n) >= 0 || tweak.isZero()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_MUL_FAIL)\n\n return Buffer.from(pair.pub.mul(tweak).encode(true, compressed))\n}\n\nexports.publicKeyCombine = function (publicKeys, compressed) {\n var pairs = new Array(publicKeys.length)\n for (var i = 0; i < publicKeys.length; ++i) {\n pairs[i] = loadPublicKey(publicKeys[i])\n if (pairs[i] === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n }\n\n var point = pairs[0].pub\n for (var j = 1; j < pairs.length; ++j) point = point.add(pairs[j].pub)\n if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_COMBINE_FAIL)\n\n return Buffer.from(point.encode(true, compressed))\n}\n\nexports.signatureNormalize = function (signature) {\n var r = new BN(signature.slice(0, 32))\n var s = new BN(signature.slice(32, 64))\n if (r.cmp(ecparams.n) >= 0 || s.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n var result = Buffer.from(signature)\n if (s.cmp(ec.nh) === 1) ecparams.n.sub(s).toArrayLike(Buffer, 'be', 32).copy(result, 32)\n\n return result\n}\n\nexports.signatureExport = function (signature) {\n var r = signature.slice(0, 32)\n var s = signature.slice(32, 64)\n if (new BN(r).cmp(ecparams.n) >= 0 || new BN(s).cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n return { r: r, s: s }\n}\n\nexports.signatureImport = function (sigObj) {\n var r = new BN(sigObj.r)\n if (r.cmp(ecparams.n) >= 0) r = new BN(0)\n\n var s = new BN(sigObj.s)\n if (s.cmp(ecparams.n) >= 0) s = new BN(0)\n\n return Buffer.concat([\n r.toArrayLike(Buffer, 'be', 32),\n s.toArrayLike(Buffer, 'be', 32)\n ])\n}\n\nexports.sign = function (message, privateKey, noncefn, data) {\n if (typeof noncefn === 'function') {\n var getNonce = noncefn\n noncefn = function (counter) {\n var nonce = getNonce(message, privateKey, null, data, counter)\n if (!Buffer.isBuffer(nonce) || nonce.length !== 32) throw new Error(messages.ECDSA_SIGN_FAIL)\n\n return new BN(nonce)\n }\n }\n\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.ECDSA_SIGN_FAIL)\n\n var result = ec.sign(message, privateKey, { canonical: true, k: noncefn, pers: data })\n return {\n signature: Buffer.concat([\n result.r.toArrayLike(Buffer, 'be', 32),\n result.s.toArrayLike(Buffer, 'be', 32)\n ]),\n recovery: result.recoveryParam\n }\n}\n\nexports.verify = function (message, signature, publicKey) {\n var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) }\n\n var sigr = new BN(sigObj.r)\n var sigs = new BN(sigObj.s)\n if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n if (sigs.cmp(ec.nh) === 1 || sigr.isZero() || sigs.isZero()) return false\n\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n return ec.verify(message, sigObj, { x: pair.pub.x, y: pair.pub.y })\n}\n\nexports.recover = function (message, signature, recovery, compressed) {\n var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) }\n\n var sigr = new BN(sigObj.r)\n var sigs = new BN(sigObj.s)\n if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n try {\n if (sigr.isZero() || sigs.isZero()) throw new Error()\n\n var point = ec.recoverPubKey(message, sigObj, recovery)\n return Buffer.from(point.encode(true, compressed))\n } catch (err) {\n throw new Error(messages.ECDSA_RECOVER_FAIL)\n }\n}\n\nexports.ecdh = function (publicKey, privateKey) {\n var shared = exports.ecdhUnsafe(publicKey, privateKey, true)\n return createHash('sha256').update(shared).digest()\n}\n\nexports.ecdhUnsafe = function (publicKey, privateKey, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n var scalar = new BN(privateKey)\n if (scalar.cmp(ecparams.n) >= 0 || scalar.isZero()) throw new Error(messages.ECDH_FAIL)\n\n return Buffer.from(pair.pub.mul(scalar).encode(true, compressed))\n}\n","const scrypt = require('./scryptSync')\nscrypt.async = require('./scrypt')\nmodule.exports = scrypt\n","const crypto = require('crypto')\nconst {\n checkAndInit,\n smixSync\n} = require('./utils')\n\n// N = Cpu cost, r = Memory cost, p = parallelization cost\nfunction scrypt (key, salt, N, r, p, dkLen, progressCallback) {\n const {\n XY,\n V,\n B32,\n x,\n _X,\n B,\n tickCallback\n } = checkAndInit(key, salt, N, r, p, dkLen, progressCallback)\n\n for (var i = 0; i < p; i++) {\n smixSync(B, i * 128 * r, r, N, V, XY, _X, B32, x, tickCallback)\n }\n\n return crypto.pbkdf2Sync(key, B, 1, dkLen, 'sha256')\n}\n\nmodule.exports = scrypt\n","const crypto = require('crypto')\nconst {\n checkAndInit,\n smix\n} = require('./utils')\n\n// N = Cpu cost, r = Memory cost, p = parallelization cost\nasync function scrypt (key, salt, N, r, p, dkLen, progressCallback, promiseInterval) {\n const {\n XY,\n V,\n B32,\n x,\n _X,\n B,\n tickCallback\n } = checkAndInit(key, salt, N, r, p, dkLen, progressCallback)\n\n for (var i = 0; i < p; i++) {\n await smix(B, i * 128 * r, r, N, V, XY, _X, B32, x, tickCallback, promiseInterval)\n }\n\n return crypto.pbkdf2Sync(key, B, 1, dkLen, 'sha256')\n}\n\nmodule.exports = scrypt\n","module.exports = require('./lib/api')(require('./lib/keccak'))\n","const createKeccak = require('./keccak')\nconst createShake = require('./shake')\n\nmodule.exports = function (KeccakState) {\n const Keccak = createKeccak(KeccakState)\n const Shake = createShake(KeccakState)\n\n return function (algorithm, options) {\n const hash = typeof algorithm === 'string' ? algorithm.toLowerCase() : algorithm\n switch (hash) {\n case 'keccak224': return new Keccak(1152, 448, null, 224, options)\n case 'keccak256': return new Keccak(1088, 512, null, 256, options)\n case 'keccak384': return new Keccak(832, 768, null, 384, options)\n case 'keccak512': return new Keccak(576, 1024, null, 512, options)\n\n case 'sha3-224': return new Keccak(1152, 448, 0x06, 224, options)\n case 'sha3-256': return new Keccak(1088, 512, 0x06, 256, options)\n case 'sha3-384': return new Keccak(832, 768, 0x06, 384, options)\n case 'sha3-512': return new Keccak(576, 1024, 0x06, 512, options)\n\n case 'shake128': return new Shake(1344, 256, 0x1f, options)\n case 'shake256': return new Shake(1088, 512, 0x1f, options)\n\n default: throw new Error('Invald algorithm: ' + algorithm)\n }\n }\n}\n","const { Transform } = require('readable-stream')\n\nmodule.exports = (KeccakState) => class Keccak extends Transform {\n constructor (rate, capacity, delimitedSuffix, hashBitLength, options) {\n super(options)\n\n this._rate = rate\n this._capacity = capacity\n this._delimitedSuffix = delimitedSuffix\n this._hashBitLength = hashBitLength\n this._options = options\n\n this._state = new KeccakState()\n this._state.initialize(rate, capacity)\n this._finalized = false\n }\n\n _transform (chunk, encoding, callback) {\n let error = null\n try {\n this.update(chunk, encoding)\n } catch (err) {\n error = err\n }\n\n callback(error)\n }\n\n _flush (callback) {\n let error = null\n try {\n this.push(this.digest())\n } catch (err) {\n error = err\n }\n\n callback(error)\n }\n\n update (data, encoding) {\n if (!Buffer.isBuffer(data) && typeof data !== 'string') throw new TypeError('Data must be a string or a buffer')\n if (this._finalized) throw new Error('Digest already called')\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n this._state.absorb(data)\n\n return this\n }\n\n digest (encoding) {\n if (this._finalized) throw new Error('Digest already called')\n this._finalized = true\n\n if (this._delimitedSuffix) this._state.absorbLastFewBits(this._delimitedSuffix)\n let digest = this._state.squeeze(this._hashBitLength / 8)\n if (encoding !== undefined) digest = digest.toString(encoding)\n\n this._resetState()\n\n return digest\n }\n\n // remove result from memory\n _resetState () {\n this._state.initialize(this._rate, this._capacity)\n return this\n }\n\n // because sometimes we need hash right now and little later\n _clone () {\n const clone = new Keccak(this._rate, this._capacity, this._delimitedSuffix, this._hashBitLength, this._options)\n this._state.copy(clone._state)\n clone._finalized = this._finalized\n\n return clone\n }\n}\n","module.exports = require('events').EventEmitter;\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","const { Transform } = require('readable-stream')\n\nmodule.exports = (KeccakState) => class Shake extends Transform {\n constructor (rate, capacity, delimitedSuffix, options) {\n super(options)\n\n this._rate = rate\n this._capacity = capacity\n this._delimitedSuffix = delimitedSuffix\n this._options = options\n\n this._state = new KeccakState()\n this._state.initialize(rate, capacity)\n this._finalized = false\n }\n\n _transform (chunk, encoding, callback) {\n let error = null\n try {\n this.update(chunk, encoding)\n } catch (err) {\n error = err\n }\n\n callback(error)\n }\n\n _flush () {}\n\n _read (size) {\n this.push(this.squeeze(size))\n }\n\n update (data, encoding) {\n if (!Buffer.isBuffer(data) && typeof data !== 'string') throw new TypeError('Data must be a string or a buffer')\n if (this._finalized) throw new Error('Squeeze already called')\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n this._state.absorb(data)\n\n return this\n }\n\n squeeze (dataByteLength, encoding) {\n if (!this._finalized) {\n this._finalized = true\n this._state.absorbLastFewBits(this._delimitedSuffix)\n }\n\n let data = this._state.squeeze(dataByteLength)\n if (encoding !== undefined) data = data.toString(encoding)\n\n return data\n }\n\n _resetState () {\n this._state.initialize(this._rate, this._capacity)\n return this\n }\n\n _clone () {\n const clone = new Shake(this._rate, this._capacity, this._delimitedSuffix, this._options)\n this._state.copy(clone._state)\n clone._finalized = this._finalized\n\n return clone\n }\n}\n","const keccakState = require('./keccak-state-unroll')\n\nfunction Keccak () {\n // much faster than `new Array(50)`\n this.state = [\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0\n ]\n\n this.blockSize = null\n this.count = 0\n this.squeezing = false\n}\n\nKeccak.prototype.initialize = function (rate, capacity) {\n for (let i = 0; i < 50; ++i) this.state[i] = 0\n this.blockSize = rate / 8\n this.count = 0\n this.squeezing = false\n}\n\nKeccak.prototype.absorb = function (data) {\n for (let i = 0; i < data.length; ++i) {\n this.state[~~(this.count / 4)] ^= data[i] << (8 * (this.count % 4))\n this.count += 1\n if (this.count === this.blockSize) {\n keccakState.p1600(this.state)\n this.count = 0\n }\n }\n}\n\nKeccak.prototype.absorbLastFewBits = function (bits) {\n this.state[~~(this.count / 4)] ^= bits << (8 * (this.count % 4))\n if ((bits & 0x80) !== 0 && this.count === (this.blockSize - 1)) keccakState.p1600(this.state)\n this.state[~~((this.blockSize - 1) / 4)] ^= 0x80 << (8 * ((this.blockSize - 1) % 4))\n keccakState.p1600(this.state)\n this.count = 0\n this.squeezing = true\n}\n\nKeccak.prototype.squeeze = function (length) {\n if (!this.squeezing) this.absorbLastFewBits(0x01)\n\n const output = Buffer.alloc(length)\n for (let i = 0; i < length; ++i) {\n output[i] = (this.state[~~(this.count / 4)] >>> (8 * (this.count % 4))) & 0xff\n this.count += 1\n if (this.count === this.blockSize) {\n keccakState.p1600(this.state)\n this.count = 0\n }\n }\n\n return output\n}\n\nKeccak.prototype.copy = function (dest) {\n for (let i = 0; i < 50; ++i) dest.state[i] = this.state[i]\n dest.blockSize = this.blockSize\n dest.count = this.count\n dest.squeezing = this.squeezing\n}\n\nmodule.exports = Keccak\n","'use strict';\nmodule.exports = str => encodeURIComponent(str).replace(/[!'()*]/g, x => `%${x.charCodeAt(0).toString(16).toUpperCase()}`);\n","'use strict';\nvar token = '%[a-f0-9]{2}';\nvar singleMatcher = new RegExp('(' + token + ')|([^%]+?)', 'gi');\nvar multiMatcher = new RegExp('(' + token + ')+', 'gi');\n\nfunction decodeComponents(components, split) {\n\ttry {\n\t\t// Try to decode the entire string first\n\t\treturn [decodeURIComponent(components.join(''))];\n\t} catch (err) {\n\t\t// Do nothing\n\t}\n\n\tif (components.length === 1) {\n\t\treturn components;\n\t}\n\n\tsplit = split || 1;\n\n\t// Split the array in 2 parts\n\tvar left = components.slice(0, split);\n\tvar right = components.slice(split);\n\n\treturn Array.prototype.concat.call([], decodeComponents(left), decodeComponents(right));\n}\n\nfunction decode(input) {\n\ttry {\n\t\treturn decodeURIComponent(input);\n\t} catch (err) {\n\t\tvar tokens = input.match(singleMatcher) || [];\n\n\t\tfor (var i = 1; i < tokens.length; i++) {\n\t\t\tinput = decodeComponents(tokens, i).join('');\n\n\t\t\ttokens = input.match(singleMatcher) || [];\n\t\t}\n\n\t\treturn input;\n\t}\n}\n\nfunction customDecodeURIComponent(input) {\n\t// Keep track of all the replacements and prefill the map with the `BOM`\n\tvar replaceMap = {\n\t\t'%FE%FF': '\\uFFFD\\uFFFD',\n\t\t'%FF%FE': '\\uFFFD\\uFFFD'\n\t};\n\n\tvar match = multiMatcher.exec(input);\n\twhile (match) {\n\t\ttry {\n\t\t\t// Decode as big chunks as possible\n\t\t\treplaceMap[match[0]] = decodeURIComponent(match[0]);\n\t\t} catch (err) {\n\t\t\tvar result = decode(match[0]);\n\n\t\t\tif (result !== match[0]) {\n\t\t\t\treplaceMap[match[0]] = result;\n\t\t\t}\n\t\t}\n\n\t\tmatch = multiMatcher.exec(input);\n\t}\n\n\t// Add `%C2` at the end of the map to make sure it does not replace the combinator before everything else\n\treplaceMap['%C2'] = '\\uFFFD';\n\n\tvar entries = Object.keys(replaceMap);\n\n\tfor (var i = 0; i < entries.length; i++) {\n\t\t// Replace all decoded components\n\t\tvar key = entries[i];\n\t\tinput = input.replace(new RegExp(key, 'g'), replaceMap[key]);\n\t}\n\n\treturn input;\n}\n\nmodule.exports = function (encodedURI) {\n\tif (typeof encodedURI !== 'string') {\n\t\tthrow new TypeError('Expected `encodedURI` to be of type `string`, got `' + typeof encodedURI + '`');\n\t}\n\n\ttry {\n\t\tencodedURI = encodedURI.replace(/\\+/g, ' ');\n\n\t\t// Try the built in decoder first\n\t\treturn decodeURIComponent(encodedURI);\n\t} catch (err) {\n\t\t// Fallback to a more advanced decoder\n\t\treturn customDecodeURIComponent(encodedURI);\n\t}\n};\n","'use strict';\n\nmodule.exports = (string, separator) => {\n\tif (!(typeof string === 'string' && typeof separator === 'string')) {\n\t\tthrow new TypeError('Expected the arguments to be of type `string`');\n\t}\n\n\tif (separator === '') {\n\t\treturn [string];\n\t}\n\n\tconst separatorIndex = string.indexOf(separator);\n\n\tif (separatorIndex === -1) {\n\t\treturn [string];\n\t}\n\n\treturn [\n\t\tstring.slice(0, separatorIndex),\n\t\tstring.slice(separatorIndex + separator.length)\n\t];\n};\n","'use strict';\nmodule.exports = function (obj, predicate) {\n\tvar ret = {};\n\tvar keys = Object.keys(obj);\n\tvar isArr = Array.isArray(predicate);\n\n\tfor (var i = 0; i < keys.length; i++) {\n\t\tvar key = keys[i];\n\t\tvar val = obj[key];\n\n\t\tif (isArr ? predicate.indexOf(key) !== -1 : predicate(key, val, obj)) {\n\t\t\tret[key] = val;\n\t\t}\n\t}\n\n\treturn ret;\n};\n","// light library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index-light\");","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// browserify by default only pulls in files that are hard coded in requires\n// In order of last to first in this file, the default wordlist will be chosen\n// based on what is present. (Bundles may remove wordlists they don't need)\nconst wordlists = {};\nexports.wordlists = wordlists;\nlet _default;\nexports._default = _default;\ntry {\n exports._default = _default = require('./wordlists/czech.json');\n wordlists.czech = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/chinese_simplified.json');\n wordlists.chinese_simplified = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/chinese_traditional.json');\n wordlists.chinese_traditional = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/korean.json');\n wordlists.korean = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/french.json');\n wordlists.french = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/italian.json');\n wordlists.italian = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/spanish.json');\n wordlists.spanish = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/japanese.json');\n wordlists.japanese = _default;\n wordlists.JA = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/portuguese.json');\n wordlists.portuguese = _default;\n}\ncatch (err) { }\ntry {\n exports._default = _default = require('./wordlists/english.json');\n wordlists.english = _default;\n wordlists.EN = _default;\n}\ncatch (err) { }\n","var xor = require('buffer-xor')\nvar Buffer = require('safe-buffer').Buffer\nvar incr32 = require('../incr32')\n\nfunction getBlock (self) {\n var out = self._cipher.encryptBlockRaw(self._prev)\n incr32(self._prev)\n return out\n}\n\nvar blockSize = 16\nexports.encrypt = function (self, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize)\n var start = self._cache.length\n self._cache = Buffer.concat([\n self._cache,\n Buffer.allocUnsafe(chunkNum * blockSize)\n ])\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self)\n var offset = start + i * blockSize\n self._cache.writeUInt32BE(out[0], offset + 0)\n self._cache.writeUInt32BE(out[1], offset + 4)\n self._cache.writeUInt32BE(out[2], offset + 8)\n self._cache.writeUInt32BE(out[3], offset + 12)\n }\n var pad = self._cache.slice(0, chunk.length)\n self._cache = self._cache.slice(chunk.length)\n return xor(chunk, pad)\n}\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","// full library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index\");\n","\"use strict\";\nvar protobuf = module.exports = require(\"./index-light\");\n\nprotobuf.build = \"full\";\n\n// Parser\nprotobuf.tokenize = require(\"./tokenize\");\nprotobuf.parse = require(\"./parse\");\nprotobuf.common = require(\"./common\");\n\n// Configure parser\nprotobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common);\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n if (!(this instanceof RIPEMD160))\n return new RIPEMD160();\n\n BlockHash.call(this);\n\n this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\n var A = this.h[0];\n var B = this.h[1];\n var C = this.h[2];\n var D = this.h[3];\n var E = this.h[4];\n var Ah = A;\n var Bh = B;\n var Ch = C;\n var Dh = D;\n var Eh = E;\n for (var j = 0; j < 80; j++) {\n var T = sum32(\n rotl32(\n sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n s[j]),\n E);\n A = E;\n E = D;\n D = rotl32(C, 10);\n C = B;\n B = T;\n T = sum32(\n rotl32(\n sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n sh[j]),\n Eh);\n Ah = Eh;\n Eh = Dh;\n Dh = rotl32(Ch, 10);\n Ch = Bh;\n Bh = T;\n }\n T = sum32_3(this.h[1], C, Dh);\n this.h[1] = sum32_3(this.h[2], D, Eh);\n this.h[2] = sum32_3(this.h[3], E, Ah);\n this.h[3] = sum32_3(this.h[4], A, Bh);\n this.h[4] = sum32_3(this.h[0], B, Ch);\n this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'little');\n else\n return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n if (j <= 15)\n return x ^ y ^ z;\n else if (j <= 31)\n return (x & y) | ((~x) & z);\n else if (j <= 47)\n return (x | (~y)) ^ z;\n else if (j <= 63)\n return (x & z) | (y & (~z));\n else\n return x ^ (y | (~z));\n}\n\nfunction K(j) {\n if (j <= 15)\n return 0x00000000;\n else if (j <= 31)\n return 0x5a827999;\n else if (j <= 47)\n return 0x6ed9eba1;\n else if (j <= 63)\n return 0x8f1bbcdc;\n else\n return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n if (j <= 15)\n return 0x50a28be6;\n else if (j <= 31)\n return 0x5c4dd124;\n else if (j <= 47)\n return 0x6d703ef3;\n else if (j <= 63)\n return 0x7a6d76e9;\n else\n return 0x00000000;\n}\n\nvar r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst createHash = require(\"create-hash\");\nconst pbkdf2_1 = require(\"pbkdf2\");\nconst randomBytes = require(\"randombytes\");\nconst _wordlists_1 = require(\"./_wordlists\");\nlet DEFAULT_WORDLIST = _wordlists_1._default;\nconst INVALID_MNEMONIC = 'Invalid mnemonic';\nconst INVALID_ENTROPY = 'Invalid entropy';\nconst INVALID_CHECKSUM = 'Invalid mnemonic checksum';\nconst WORDLIST_REQUIRED = 'A wordlist is required but a default could not be found.\\n' +\n 'Please pass a 2048 word array explicitly.';\nfunction pbkdf2Promise(password, saltMixin, iterations, keylen, digest) {\n return Promise.resolve().then(() => new Promise((resolve, reject) => {\n const callback = (err, derivedKey) => {\n if (err) {\n return reject(err);\n }\n else {\n return resolve(derivedKey);\n }\n };\n pbkdf2_1.pbkdf2(password, saltMixin, iterations, keylen, digest, callback);\n }));\n}\nfunction normalize(str) {\n return (str || '').normalize('NFKD');\n}\nfunction lpad(str, padString, length) {\n while (str.length < length) {\n str = padString + str;\n }\n return str;\n}\nfunction binaryToByte(bin) {\n return parseInt(bin, 2);\n}\nfunction bytesToBinary(bytes) {\n return bytes.map((x) => lpad(x.toString(2), '0', 8)).join('');\n}\nfunction deriveChecksumBits(entropyBuffer) {\n const ENT = entropyBuffer.length * 8;\n const CS = ENT / 32;\n const hash = createHash('sha256')\n .update(entropyBuffer)\n .digest();\n return bytesToBinary(Array.from(hash)).slice(0, CS);\n}\nfunction salt(password) {\n return 'mnemonic' + (password || '');\n}\nfunction mnemonicToSeedSync(mnemonic, password) {\n const mnemonicBuffer = Buffer.from(normalize(mnemonic), 'utf8');\n const saltBuffer = Buffer.from(salt(normalize(password)), 'utf8');\n return pbkdf2_1.pbkdf2Sync(mnemonicBuffer, saltBuffer, 2048, 64, 'sha512');\n}\nexports.mnemonicToSeedSync = mnemonicToSeedSync;\nfunction mnemonicToSeed(mnemonic, password) {\n return Promise.resolve().then(() => {\n const mnemonicBuffer = Buffer.from(normalize(mnemonic), 'utf8');\n const saltBuffer = Buffer.from(salt(normalize(password)), 'utf8');\n return pbkdf2Promise(mnemonicBuffer, saltBuffer, 2048, 64, 'sha512');\n });\n}\nexports.mnemonicToSeed = mnemonicToSeed;\nfunction mnemonicToEntropy(mnemonic, wordlist) {\n wordlist = wordlist || DEFAULT_WORDLIST;\n if (!wordlist) {\n throw new Error(WORDLIST_REQUIRED);\n }\n const words = normalize(mnemonic).split(' ');\n if (words.length % 3 !== 0) {\n throw new Error(INVALID_MNEMONIC);\n }\n // convert word indices to 11 bit binary strings\n const bits = words\n .map((word) => {\n const index = wordlist.indexOf(word);\n if (index === -1) {\n throw new Error(INVALID_MNEMONIC);\n }\n return lpad(index.toString(2), '0', 11);\n })\n .join('');\n // split the binary string into ENT/CS\n const dividerIndex = Math.floor(bits.length / 33) * 32;\n const entropyBits = bits.slice(0, dividerIndex);\n const checksumBits = bits.slice(dividerIndex);\n // calculate the checksum and compare\n const entropyBytes = entropyBits.match(/(.{1,8})/g).map(binaryToByte);\n if (entropyBytes.length < 16) {\n throw new Error(INVALID_ENTROPY);\n }\n if (entropyBytes.length > 32) {\n throw new Error(INVALID_ENTROPY);\n }\n if (entropyBytes.length % 4 !== 0) {\n throw new Error(INVALID_ENTROPY);\n }\n const entropy = Buffer.from(entropyBytes);\n const newChecksum = deriveChecksumBits(entropy);\n if (newChecksum !== checksumBits) {\n throw new Error(INVALID_CHECKSUM);\n }\n return entropy.toString('hex');\n}\nexports.mnemonicToEntropy = mnemonicToEntropy;\nfunction entropyToMnemonic(entropy, wordlist) {\n if (!Buffer.isBuffer(entropy)) {\n entropy = Buffer.from(entropy, 'hex');\n }\n wordlist = wordlist || DEFAULT_WORDLIST;\n if (!wordlist) {\n throw new Error(WORDLIST_REQUIRED);\n }\n // 128 <= ENT <= 256\n if (entropy.length < 16) {\n throw new TypeError(INVALID_ENTROPY);\n }\n if (entropy.length > 32) {\n throw new TypeError(INVALID_ENTROPY);\n }\n if (entropy.length % 4 !== 0) {\n throw new TypeError(INVALID_ENTROPY);\n }\n const entropyBits = bytesToBinary(Array.from(entropy));\n const checksumBits = deriveChecksumBits(entropy);\n const bits = entropyBits + checksumBits;\n const chunks = bits.match(/(.{1,11})/g);\n const words = chunks.map((binary) => {\n const index = binaryToByte(binary);\n return wordlist[index];\n });\n return wordlist[0] === '\\u3042\\u3044\\u3053\\u304f\\u3057\\u3093' // Japanese wordlist\n ? words.join('\\u3000')\n : words.join(' ');\n}\nexports.entropyToMnemonic = entropyToMnemonic;\nfunction generateMnemonic(strength, rng, wordlist) {\n strength = strength || 128;\n if (strength % 32 !== 0) {\n throw new TypeError(INVALID_ENTROPY);\n }\n rng = rng || randomBytes;\n return entropyToMnemonic(rng(strength / 8), wordlist);\n}\nexports.generateMnemonic = generateMnemonic;\nfunction validateMnemonic(mnemonic, wordlist) {\n try {\n mnemonicToEntropy(mnemonic, wordlist);\n }\n catch (e) {\n return false;\n }\n return true;\n}\nexports.validateMnemonic = validateMnemonic;\nfunction setDefaultWordlist(language) {\n const result = _wordlists_1.wordlists[language];\n if (result) {\n DEFAULT_WORDLIST = result;\n }\n else {\n throw new Error('Could not find wordlist for language \"' + language + '\"');\n }\n}\nexports.setDefaultWordlist = setDefaultWordlist;\nfunction getDefaultWordlist() {\n if (!DEFAULT_WORDLIST) {\n throw new Error('No Default Wordlist set');\n }\n return Object.keys(_wordlists_1.wordlists).filter((lang) => {\n if (lang === 'JA' || lang === 'EN') {\n return false;\n }\n return _wordlists_1.wordlists[lang].every((word, index) => word === DEFAULT_WORDLIST[index]);\n })[0];\n}\nexports.getDefaultWordlist = getDefaultWordlist;\nvar _wordlists_2 = require(\"./_wordlists\");\nexports.wordlists = _wordlists_2.wordlists;\n","module.exports = require('./browser/algorithms.json')\n","'use strict';\n\nexports.utils = require('./des/utils');\nexports.Cipher = require('./des/cipher');\nexports.DES = require('./des/des');\nexports.CBC = require('./des/cbc');\nexports.EDE = require('./des/ede');\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar proto = {};\n\nfunction CBCState(iv) {\n assert.equal(iv.length, 8, 'Invalid IV length');\n\n this.iv = new Array(8);\n for (var i = 0; i < this.iv.length; i++)\n this.iv[i] = iv[i];\n}\n\nfunction instantiate(Base) {\n function CBC(options) {\n Base.call(this, options);\n this._cbcInit();\n }\n inherits(CBC, Base);\n\n var keys = Object.keys(proto);\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n\n CBC.create = function create(options) {\n return new CBC(options);\n };\n\n return CBC;\n}\n\nexports.instantiate = instantiate;\n\nproto._cbcInit = function _cbcInit() {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n};\n\nproto._update = function _update(inp, inOff, out, outOff) {\n var state = this._cbcState;\n var superProto = this.constructor.super_.prototype;\n\n var iv = state.iv;\n if (this.type === 'encrypt') {\n for (var i = 0; i < this.blockSize; i++)\n iv[i] ^= inp[inOff + i];\n\n superProto._update.call(this, iv, 0, out, outOff);\n\n for (var i = 0; i < this.blockSize; i++)\n iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n\n for (var i = 0; i < this.blockSize; i++)\n out[outOff + i] ^= iv[i];\n\n for (var i = 0; i < this.blockSize; i++)\n iv[i] = inp[inOff + i];\n }\n};\n","var MODES = require('./modes')\nvar AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Cipher (mode, key, iv) {\n Transform.call(this)\n\n this._cache = new Splitter()\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._mode = mode\n this._autopadding = true\n}\n\ninherits(Cipher, Transform)\n\nCipher.prototype._update = function (data) {\n this._cache.add(data)\n var chunk\n var thing\n var out = []\n\n while ((chunk = this._cache.get())) {\n thing = this._mode.encrypt(this, chunk)\n out.push(thing)\n }\n\n return Buffer.concat(out)\n}\n\nvar PADDING = Buffer.alloc(16, 0x10)\n\nCipher.prototype._final = function () {\n var chunk = this._cache.flush()\n if (this._autopadding) {\n chunk = this._mode.encrypt(this, chunk)\n this._cipher.scrub()\n return chunk\n }\n\n if (!chunk.equals(PADDING)) {\n this._cipher.scrub()\n throw new Error('data not multiple of block length')\n }\n}\n\nCipher.prototype.setAutoPadding = function (setTo) {\n this._autopadding = !!setTo\n return this\n}\n\nfunction Splitter () {\n this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n return null\n}\n\nSplitter.prototype.flush = function () {\n var len = 16 - this.cache.length\n var padBuff = Buffer.allocUnsafe(len)\n\n var i = -1\n while (++i < len) {\n padBuff.writeUInt8(len, i)\n }\n\n return Buffer.concat([this.cache, padBuff])\n}\n\nfunction createCipheriv (suite, password, iv) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n if (typeof password === 'string') password = Buffer.from(password)\n if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n if (typeof iv === 'string') iv = Buffer.from(iv)\n if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n if (config.type === 'stream') {\n return new StreamCipher(config.module, password, iv)\n } else if (config.type === 'auth') {\n return new AuthCipher(config.module, password, iv)\n }\n\n return new Cipher(config.module, password, iv)\n}\n\nfunction createCipher (suite, password) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n var keys = ebtk(password, false, config.key, config.iv)\n return createCipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createCipheriv = createCipheriv\nexports.createCipher = createCipher\n","exports.encrypt = function (self, block) {\n return self._cipher.encryptBlock(block)\n}\n\nexports.decrypt = function (self, block) {\n return self._cipher.decryptBlock(block)\n}\n","var xor = require('buffer-xor')\n\nexports.encrypt = function (self, block) {\n var data = xor(block, self._prev)\n\n self._prev = self._cipher.encryptBlock(data)\n return self._prev\n}\n\nexports.decrypt = function (self, block) {\n var pad = self._prev\n\n self._prev = block\n var out = self._cipher.decryptBlock(block)\n\n return xor(out, pad)\n}\n","var Buffer = require('safe-buffer').Buffer\nvar xor = require('buffer-xor')\n\nfunction encryptStart (self, data, decrypt) {\n var len = data.length\n var out = xor(data, self._cache)\n self._cache = self._cache.slice(len)\n self._prev = Buffer.concat([self._prev, decrypt ? data : out])\n return out\n}\n\nexports.encrypt = function (self, data, decrypt) {\n var out = Buffer.allocUnsafe(0)\n var len\n\n while (data.length) {\n if (self._cache.length === 0) {\n self._cache = self._cipher.encryptBlock(self._prev)\n self._prev = Buffer.allocUnsafe(0)\n }\n\n if (self._cache.length <= data.length) {\n len = self._cache.length\n out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)])\n data = data.slice(len)\n } else {\n out = Buffer.concat([out, encryptStart(self, data, decrypt)])\n break\n }\n }\n\n return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n var pad = self._cipher.encryptBlock(self._prev)\n var out = pad[0] ^ byteParam\n\n self._prev = Buffer.concat([\n self._prev.slice(1),\n Buffer.from([decrypt ? byteParam : out])\n ])\n\n return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n var len = chunk.length\n var out = Buffer.allocUnsafe(len)\n var i = -1\n\n while (++i < len) {\n out[i] = encryptByte(self, chunk[i], decrypt)\n }\n\n return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n var pad\n var i = -1\n var len = 8\n var out = 0\n var bit, value\n while (++i < len) {\n pad = self._cipher.encryptBlock(self._prev)\n bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0\n value = pad[0] ^ bit\n out += ((value & 0x80) >> (i % 8))\n self._prev = shiftIn(self._prev, decrypt ? bit : value)\n }\n return out\n}\n\nfunction shiftIn (buffer, value) {\n var len = buffer.length\n var i = -1\n var out = Buffer.allocUnsafe(buffer.length)\n buffer = Buffer.concat([buffer, Buffer.from([value])])\n\n while (++i < len) {\n out[i] = buffer[i] << 1 | buffer[i + 1] >> (7)\n }\n\n return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n var len = chunk.length\n var out = Buffer.allocUnsafe(len)\n var i = -1\n\n while (++i < len) {\n out[i] = encryptByte(self, chunk[i], decrypt)\n }\n\n return out\n}\n","var xor = require('buffer-xor')\n\nfunction getBlock (self) {\n self._prev = self._cipher.encryptBlock(self._prev)\n return self._prev\n}\n\nexports.encrypt = function (self, chunk) {\n while (self._cache.length < chunk.length) {\n self._cache = Buffer.concat([self._cache, getBlock(self)])\n }\n\n var pad = self._cache.slice(0, chunk.length)\n self._cache = self._cache.slice(chunk.length)\n return xor(chunk, pad)\n}\n","var AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar MODES = require('./modes')\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Decipher (mode, key, iv) {\n Transform.call(this)\n\n this._cache = new Splitter()\n this._last = void 0\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._mode = mode\n this._autopadding = true\n}\n\ninherits(Decipher, Transform)\n\nDecipher.prototype._update = function (data) {\n this._cache.add(data)\n var chunk\n var thing\n var out = []\n while ((chunk = this._cache.get(this._autopadding))) {\n thing = this._mode.decrypt(this, chunk)\n out.push(thing)\n }\n return Buffer.concat(out)\n}\n\nDecipher.prototype._final = function () {\n var chunk = this._cache.flush()\n if (this._autopadding) {\n return unpad(this._mode.decrypt(this, chunk))\n } else if (chunk) {\n throw new Error('data not multiple of block length')\n }\n}\n\nDecipher.prototype.setAutoPadding = function (setTo) {\n this._autopadding = !!setTo\n return this\n}\n\nfunction Splitter () {\n this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function (autoPadding) {\n var out\n if (autoPadding) {\n if (this.cache.length > 16) {\n out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n } else {\n if (this.cache.length >= 16) {\n out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n }\n\n return null\n}\n\nSplitter.prototype.flush = function () {\n if (this.cache.length) return this.cache\n}\n\nfunction unpad (last) {\n var padded = last[15]\n if (padded < 1 || padded > 16) {\n throw new Error('unable to decrypt data')\n }\n var i = -1\n while (++i < padded) {\n if (last[(i + (16 - padded))] !== padded) {\n throw new Error('unable to decrypt data')\n }\n }\n if (padded === 16) return\n\n return last.slice(0, 16 - padded)\n}\n\nfunction createDecipheriv (suite, password, iv) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n if (typeof iv === 'string') iv = Buffer.from(iv)\n if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n if (typeof password === 'string') password = Buffer.from(password)\n if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n if (config.type === 'stream') {\n return new StreamCipher(config.module, password, iv, true)\n } else if (config.type === 'auth') {\n return new AuthCipher(config.module, password, iv, true)\n }\n\n return new Decipher(config.module, password, iv)\n}\n\nfunction createDecipher (suite, password) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n var keys = ebtk(password, false, config.key, config.iv)\n return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createDecipher = createDecipher\nexports.createDecipheriv = createDecipheriv\n","exports['des-ecb'] = {\n key: 8,\n iv: 0\n}\nexports['des-cbc'] = exports.des = {\n key: 8,\n iv: 8\n}\nexports['des-ede3-cbc'] = exports.des3 = {\n key: 24,\n iv: 8\n}\nexports['des-ede3'] = {\n key: 24,\n iv: 0\n}\nexports['des-ede-cbc'] = {\n key: 16,\n iv: 8\n}\nexports['des-ede'] = {\n key: 16,\n iv: 0\n}\n","var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n var prime = new Buffer(primes[mod].prime, 'hex')\n var gen = new Buffer(primes[mod].gen, 'hex')\n\n return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n 'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n return createDiffieHellman(prime, 'binary', enc, generator)\n }\n\n enc = enc || 'binary'\n genc = genc || 'binary'\n generator = generator || new Buffer([2])\n\n if (!Buffer.isBuffer(generator)) {\n generator = new Buffer(generator, genc)\n }\n\n if (typeof prime === 'number') {\n return new DH(generatePrime(prime, generator), generator, true)\n }\n\n if (!Buffer.isBuffer(prime)) {\n prime = new Buffer(prime, enc)\n }\n\n return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js\n// Fedor, you are amazing.\n'use strict'\n\nvar asn1 = require('asn1.js')\n\nexports.certificate = require('./certificate')\n\nvar RSAPrivateKey = asn1.define('RSAPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('modulus').int(),\n this.key('publicExponent').int(),\n this.key('privateExponent').int(),\n this.key('prime1').int(),\n this.key('prime2').int(),\n this.key('exponent1').int(),\n this.key('exponent2').int(),\n this.key('coefficient').int()\n )\n})\nexports.RSAPrivateKey = RSAPrivateKey\n\nvar RSAPublicKey = asn1.define('RSAPublicKey', function () {\n this.seq().obj(\n this.key('modulus').int(),\n this.key('publicExponent').int()\n )\n})\nexports.RSAPublicKey = RSAPublicKey\n\nvar PublicKey = asn1.define('SubjectPublicKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPublicKey').bitstr()\n )\n})\nexports.PublicKey = PublicKey\n\nvar AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () {\n this.seq().obj(\n this.key('algorithm').objid(),\n this.key('none').null_().optional(),\n this.key('curve').objid().optional(),\n this.key('params').seq().obj(\n this.key('p').int(),\n this.key('q').int(),\n this.key('g').int()\n ).optional()\n )\n})\n\nvar PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPrivateKey').octstr()\n )\n})\nexports.PrivateKey = PrivateKeyInfo\nvar EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').seq().obj(\n this.key('id').objid(),\n this.key('decrypt').seq().obj(\n this.key('kde').seq().obj(\n this.key('id').objid(),\n this.key('kdeparams').seq().obj(\n this.key('salt').octstr(),\n this.key('iters').int()\n )\n ),\n this.key('cipher').seq().obj(\n this.key('algo').objid(),\n this.key('iv').octstr()\n )\n )\n ),\n this.key('subjectPrivateKey').octstr()\n )\n})\n\nexports.EncryptedPrivateKey = EncryptedPrivateKeyInfo\n\nvar DSAPrivateKey = asn1.define('DSAPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('p').int(),\n this.key('q').int(),\n this.key('g').int(),\n this.key('pub_key').int(),\n this.key('priv_key').int()\n )\n})\nexports.DSAPrivateKey = DSAPrivateKey\n\nexports.DSAparam = asn1.define('DSAparam', function () {\n this.int()\n})\n\nvar ECPrivateKey = asn1.define('ECPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('privateKey').octstr(),\n this.key('parameters').optional().explicit(0).use(ECParameters),\n this.key('publicKey').optional().explicit(1).bitstr()\n )\n})\nexports.ECPrivateKey = ECPrivateKey\n\nvar ECParameters = asn1.define('ECParameters', function () {\n this.choice({\n namedCurve: this.objid()\n })\n})\n\nexports.signature = asn1.define('signature', function () {\n this.seq().obj(\n this.key('r').int(),\n this.key('s').int()\n )\n})\n","'use strict'\n\nfunction oldBrowser () {\n throw new Error('secure random number generation not supported by this browser\\nuse chrome, FireFox or Internet Explorer 11')\n}\nvar safeBuffer = require('safe-buffer')\nvar randombytes = require('randombytes')\nvar Buffer = safeBuffer.Buffer\nvar kBufferMaxLength = safeBuffer.kMaxLength\nvar crypto = global.crypto || global.msCrypto\nvar kMaxUint32 = Math.pow(2, 32) - 1\nfunction assertOffset (offset, length) {\n if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare\n throw new TypeError('offset must be a number')\n }\n\n if (offset > kMaxUint32 || offset < 0) {\n throw new TypeError('offset must be a uint32')\n }\n\n if (offset > kBufferMaxLength || offset > length) {\n throw new RangeError('offset out of range')\n }\n}\n\nfunction assertSize (size, offset, length) {\n if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare\n throw new TypeError('size must be a number')\n }\n\n if (size > kMaxUint32 || size < 0) {\n throw new TypeError('size must be a uint32')\n }\n\n if (size + offset > length || size > kBufferMaxLength) {\n throw new RangeError('buffer too small')\n }\n}\nif ((crypto && crypto.getRandomValues) || !process.browser) {\n exports.randomFill = randomFill\n exports.randomFillSync = randomFillSync\n} else {\n exports.randomFill = oldBrowser\n exports.randomFillSync = oldBrowser\n}\nfunction randomFill (buf, offset, size, cb) {\n if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n }\n\n if (typeof offset === 'function') {\n cb = offset\n offset = 0\n size = buf.length\n } else if (typeof size === 'function') {\n cb = size\n size = buf.length - offset\n } else if (typeof cb !== 'function') {\n throw new TypeError('\"cb\" argument must be a function')\n }\n assertOffset(offset, buf.length)\n assertSize(size, offset, buf.length)\n return actualFill(buf, offset, size, cb)\n}\n\nfunction actualFill (buf, offset, size, cb) {\n if (process.browser) {\n var ourBuf = buf.buffer\n var uint = new Uint8Array(ourBuf, offset, size)\n crypto.getRandomValues(uint)\n if (cb) {\n process.nextTick(function () {\n cb(null, buf)\n })\n return\n }\n return buf\n }\n if (cb) {\n randombytes(size, function (err, bytes) {\n if (err) {\n return cb(err)\n }\n bytes.copy(buf, offset)\n cb(null, buf)\n })\n return\n }\n var bytes = randombytes(size)\n bytes.copy(buf, offset)\n return buf\n}\nfunction randomFillSync (buf, offset, size) {\n if (typeof offset === 'undefined') {\n offset = 0\n }\n if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n }\n\n assertOffset(offset, buf.length)\n\n if (size === undefined) size = buf.length - offset\n\n assertSize(size, offset, buf.length)\n\n return actualFill(buf, offset, size)\n}\n","'use strict'\nvar toString = Object.prototype.toString\n\n// TypeError\nexports.isArray = function (value, message) {\n if (!Array.isArray(value)) throw TypeError(message)\n}\n\nexports.isBoolean = function (value, message) {\n if (toString.call(value) !== '[object Boolean]') throw TypeError(message)\n}\n\nexports.isBuffer = function (value, message) {\n if (!Buffer.isBuffer(value)) throw TypeError(message)\n}\n\nexports.isFunction = function (value, message) {\n if (toString.call(value) !== '[object Function]') throw TypeError(message)\n}\n\nexports.isNumber = function (value, message) {\n if (toString.call(value) !== '[object Number]') throw TypeError(message)\n}\n\nexports.isObject = function (value, message) {\n if (toString.call(value) !== '[object Object]') throw TypeError(message)\n}\n\n// RangeError\nexports.isBufferLength = function (buffer, length, message) {\n if (buffer.length !== length) throw RangeError(message)\n}\n\nexports.isBufferLength2 = function (buffer, length1, length2, message) {\n if (buffer.length !== length1 && buffer.length !== length2) throw RangeError(message)\n}\n\nexports.isLengthGTZero = function (value, message) {\n if (value.length === 0) throw RangeError(message)\n}\n\nexports.isNumberInInterval = function (number, x, y, message) {\n if (number <= x || number >= y) throw RangeError(message)\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar bip66 = require('bip66')\n\nvar EC_PRIVKEY_EXPORT_DER_COMPRESSED = Buffer.from([\n // begin\n 0x30, 0x81, 0xd3, 0x02, 0x01, 0x01, 0x04, 0x20,\n // private key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n // middle\n 0xa0, 0x81, 0x85, 0x30, 0x81, 0x82, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48,\n 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04,\n 0x21, 0x02, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87,\n 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8,\n 0x17, 0x98, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E,\n 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x24, 0x03, 0x22, 0x00,\n // public key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00\n])\n\nvar EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED = Buffer.from([\n // begin\n 0x30, 0x82, 0x01, 0x13, 0x02, 0x01, 0x01, 0x04, 0x20,\n // private key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n // middle\n 0xa0, 0x81, 0xa5, 0x30, 0x81, 0xa2, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48,\n 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04,\n 0x41, 0x04, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87,\n 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8,\n 0x17, 0x98, 0x48, 0x3a, 0xda, 0x77, 0x26, 0xa3, 0xc4, 0x65, 0x5d, 0xa4, 0xfb, 0xfc, 0x0E, 0x11,\n 0x08, 0xa8, 0xfd, 0x17, 0xb4, 0x48, 0xa6, 0x85, 0x54, 0x19, 0x9c, 0x47, 0xd0, 0x8f, 0xfb, 0x10,\n 0xd4, 0xb8, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E,\n 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x44, 0x03, 0x42, 0x00,\n // public key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00\n])\n\nexports.privateKeyExport = function (privateKey, publicKey, compressed) {\n var result = Buffer.from(compressed ? EC_PRIVKEY_EXPORT_DER_COMPRESSED : EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED)\n privateKey.copy(result, compressed ? 8 : 9)\n publicKey.copy(result, compressed ? 181 : 214)\n return result\n}\n\nexports.privateKeyImport = function (privateKey) {\n var length = privateKey.length\n\n // sequence header\n var index = 0\n if (length < index + 1 || privateKey[index] !== 0x30) return\n index += 1\n\n // sequence length constructor\n if (length < index + 1 || !(privateKey[index] & 0x80)) return\n\n var lenb = privateKey[index] & 0x7f\n index += 1\n if (lenb < 1 || lenb > 2) return\n if (length < index + lenb) return\n\n // sequence length\n var len = privateKey[index + lenb - 1] | (lenb > 1 ? privateKey[index + lenb - 2] << 8 : 0)\n index += lenb\n if (length < index + len) return\n\n // sequence element 0: version number (=1)\n if (length < index + 3 ||\n privateKey[index] !== 0x02 ||\n privateKey[index + 1] !== 0x01 ||\n privateKey[index + 2] !== 0x01) {\n return\n }\n index += 3\n\n // sequence element 1: octet string, up to 32 bytes\n if (length < index + 2 ||\n privateKey[index] !== 0x04 ||\n privateKey[index + 1] > 0x20 ||\n length < index + 2 + privateKey[index + 1]) {\n return\n }\n\n return privateKey.slice(index + 2, index + 2 + privateKey[index + 1])\n}\n\nexports.signatureExport = function (sigObj) {\n var r = Buffer.concat([Buffer.from([0]), sigObj.r])\n for (var lenR = 33, posR = 0; lenR > 1 && r[posR] === 0x00 && !(r[posR + 1] & 0x80); --lenR, ++posR);\n\n var s = Buffer.concat([Buffer.from([0]), sigObj.s])\n for (var lenS = 33, posS = 0; lenS > 1 && s[posS] === 0x00 && !(s[posS + 1] & 0x80); --lenS, ++posS);\n\n return bip66.encode(r.slice(posR), s.slice(posS))\n}\n\nexports.signatureImport = function (sig) {\n var r = Buffer.alloc(32, 0)\n var s = Buffer.alloc(32, 0)\n\n try {\n var sigObj = bip66.decode(sig)\n if (sigObj.r.length === 33 && sigObj.r[0] === 0x00) sigObj.r = sigObj.r.slice(1)\n if (sigObj.r.length > 32) throw new Error('R length is too long')\n if (sigObj.s.length === 33 && sigObj.s[0] === 0x00) sigObj.s = sigObj.s.slice(1)\n if (sigObj.s.length > 32) throw new Error('S length is too long')\n } catch (err) {\n return\n }\n\n sigObj.r.copy(r, 32 - sigObj.r.length)\n sigObj.s.copy(s, 32 - sigObj.s.length)\n\n return { r: r, s: s }\n}\n\nexports.signatureImportLax = function (sig) {\n var r = Buffer.alloc(32, 0)\n var s = Buffer.alloc(32, 0)\n\n var length = sig.length\n var index = 0\n\n // sequence tag byte\n if (sig[index++] !== 0x30) return\n\n // sequence length byte\n var lenbyte = sig[index++]\n if (lenbyte & 0x80) {\n index += lenbyte - 0x80\n if (index > length) return\n }\n\n // sequence tag byte for r\n if (sig[index++] !== 0x02) return\n\n // length for r\n var rlen = sig[index++]\n if (rlen & 0x80) {\n lenbyte = rlen - 0x80\n if (index + lenbyte > length) return\n for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1);\n for (rlen = 0; lenbyte > 0; index += 1, lenbyte -= 1) rlen = (rlen << 8) + sig[index]\n }\n if (rlen > length - index) return\n var rindex = index\n index += rlen\n\n // sequence tag byte for s\n if (sig[index++] !== 0x02) return\n\n // length for s\n var slen = sig[index++]\n if (slen & 0x80) {\n lenbyte = slen - 0x80\n if (index + lenbyte > length) return\n for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1);\n for (slen = 0; lenbyte > 0; index += 1, lenbyte -= 1) slen = (slen << 8) + sig[index]\n }\n if (slen > length - index) return\n var sindex = index\n index += slen\n\n // ignore leading zeros in r\n for (; rlen > 0 && sig[rindex] === 0x00; rlen -= 1, rindex += 1);\n // copy r value\n if (rlen > 32) return\n var rvalue = sig.slice(rindex, rindex + rlen)\n rvalue.copy(r, 32 - rvalue.length)\n\n // ignore leading zeros in s\n for (; slen > 0 && sig[sindex] === 0x00; slen -= 1, sindex += 1);\n // copy s value\n if (slen > 32) return\n var svalue = sig.slice(sindex, sindex + slen)\n svalue.copy(s, 32 - svalue.length)\n\n return { r: r, s: s }\n}\n","const P1600_ROUND_CONSTANTS = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649, 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0, 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771, 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648, 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648]\n\nexports.p1600 = function (s) {\n for (let round = 0; round < 24; ++round) {\n // theta\n const lo0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40]\n const hi0 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41]\n const lo1 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42]\n const hi1 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43]\n const lo2 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44]\n const hi2 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45]\n const lo3 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46]\n const hi3 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47]\n const lo4 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48]\n const hi4 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49]\n\n let lo = lo4 ^ (lo1 << 1 | hi1 >>> 31)\n let hi = hi4 ^ (hi1 << 1 | lo1 >>> 31)\n const t1slo0 = s[0] ^ lo\n const t1shi0 = s[1] ^ hi\n const t1slo5 = s[10] ^ lo\n const t1shi5 = s[11] ^ hi\n const t1slo10 = s[20] ^ lo\n const t1shi10 = s[21] ^ hi\n const t1slo15 = s[30] ^ lo\n const t1shi15 = s[31] ^ hi\n const t1slo20 = s[40] ^ lo\n const t1shi20 = s[41] ^ hi\n lo = lo0 ^ (lo2 << 1 | hi2 >>> 31)\n hi = hi0 ^ (hi2 << 1 | lo2 >>> 31)\n const t1slo1 = s[2] ^ lo\n const t1shi1 = s[3] ^ hi\n const t1slo6 = s[12] ^ lo\n const t1shi6 = s[13] ^ hi\n const t1slo11 = s[22] ^ lo\n const t1shi11 = s[23] ^ hi\n const t1slo16 = s[32] ^ lo\n const t1shi16 = s[33] ^ hi\n const t1slo21 = s[42] ^ lo\n const t1shi21 = s[43] ^ hi\n lo = lo1 ^ (lo3 << 1 | hi3 >>> 31)\n hi = hi1 ^ (hi3 << 1 | lo3 >>> 31)\n const t1slo2 = s[4] ^ lo\n const t1shi2 = s[5] ^ hi\n const t1slo7 = s[14] ^ lo\n const t1shi7 = s[15] ^ hi\n const t1slo12 = s[24] ^ lo\n const t1shi12 = s[25] ^ hi\n const t1slo17 = s[34] ^ lo\n const t1shi17 = s[35] ^ hi\n const t1slo22 = s[44] ^ lo\n const t1shi22 = s[45] ^ hi\n lo = lo2 ^ (lo4 << 1 | hi4 >>> 31)\n hi = hi2 ^ (hi4 << 1 | lo4 >>> 31)\n const t1slo3 = s[6] ^ lo\n const t1shi3 = s[7] ^ hi\n const t1slo8 = s[16] ^ lo\n const t1shi8 = s[17] ^ hi\n const t1slo13 = s[26] ^ lo\n const t1shi13 = s[27] ^ hi\n const t1slo18 = s[36] ^ lo\n const t1shi18 = s[37] ^ hi\n const t1slo23 = s[46] ^ lo\n const t1shi23 = s[47] ^ hi\n lo = lo3 ^ (lo0 << 1 | hi0 >>> 31)\n hi = hi3 ^ (hi0 << 1 | lo0 >>> 31)\n const t1slo4 = s[8] ^ lo\n const t1shi4 = s[9] ^ hi\n const t1slo9 = s[18] ^ lo\n const t1shi9 = s[19] ^ hi\n const t1slo14 = s[28] ^ lo\n const t1shi14 = s[29] ^ hi\n const t1slo19 = s[38] ^ lo\n const t1shi19 = s[39] ^ hi\n const t1slo24 = s[48] ^ lo\n const t1shi24 = s[49] ^ hi\n\n // rho & pi\n const t2slo0 = t1slo0\n const t2shi0 = t1shi0\n const t2slo16 = (t1shi5 << 4 | t1slo5 >>> 28)\n const t2shi16 = (t1slo5 << 4 | t1shi5 >>> 28)\n const t2slo7 = (t1slo10 << 3 | t1shi10 >>> 29)\n const t2shi7 = (t1shi10 << 3 | t1slo10 >>> 29)\n const t2slo23 = (t1shi15 << 9 | t1slo15 >>> 23)\n const t2shi23 = (t1slo15 << 9 | t1shi15 >>> 23)\n const t2slo14 = (t1slo20 << 18 | t1shi20 >>> 14)\n const t2shi14 = (t1shi20 << 18 | t1slo20 >>> 14)\n const t2slo10 = (t1slo1 << 1 | t1shi1 >>> 31)\n const t2shi10 = (t1shi1 << 1 | t1slo1 >>> 31)\n const t2slo1 = (t1shi6 << 12 | t1slo6 >>> 20)\n const t2shi1 = (t1slo6 << 12 | t1shi6 >>> 20)\n const t2slo17 = (t1slo11 << 10 | t1shi11 >>> 22)\n const t2shi17 = (t1shi11 << 10 | t1slo11 >>> 22)\n const t2slo8 = (t1shi16 << 13 | t1slo16 >>> 19)\n const t2shi8 = (t1slo16 << 13 | t1shi16 >>> 19)\n const t2slo24 = (t1slo21 << 2 | t1shi21 >>> 30)\n const t2shi24 = (t1shi21 << 2 | t1slo21 >>> 30)\n const t2slo20 = (t1shi2 << 30 | t1slo2 >>> 2)\n const t2shi20 = (t1slo2 << 30 | t1shi2 >>> 2)\n const t2slo11 = (t1slo7 << 6 | t1shi7 >>> 26)\n const t2shi11 = (t1shi7 << 6 | t1slo7 >>> 26)\n const t2slo2 = (t1shi12 << 11 | t1slo12 >>> 21)\n const t2shi2 = (t1slo12 << 11 | t1shi12 >>> 21)\n const t2slo18 = (t1slo17 << 15 | t1shi17 >>> 17)\n const t2shi18 = (t1shi17 << 15 | t1slo17 >>> 17)\n const t2slo9 = (t1shi22 << 29 | t1slo22 >>> 3)\n const t2shi9 = (t1slo22 << 29 | t1shi22 >>> 3)\n const t2slo5 = (t1slo3 << 28 | t1shi3 >>> 4)\n const t2shi5 = (t1shi3 << 28 | t1slo3 >>> 4)\n const t2slo21 = (t1shi8 << 23 | t1slo8 >>> 9)\n const t2shi21 = (t1slo8 << 23 | t1shi8 >>> 9)\n const t2slo12 = (t1slo13 << 25 | t1shi13 >>> 7)\n const t2shi12 = (t1shi13 << 25 | t1slo13 >>> 7)\n const t2slo3 = (t1slo18 << 21 | t1shi18 >>> 11)\n const t2shi3 = (t1shi18 << 21 | t1slo18 >>> 11)\n const t2slo19 = (t1shi23 << 24 | t1slo23 >>> 8)\n const t2shi19 = (t1slo23 << 24 | t1shi23 >>> 8)\n const t2slo15 = (t1slo4 << 27 | t1shi4 >>> 5)\n const t2shi15 = (t1shi4 << 27 | t1slo4 >>> 5)\n const t2slo6 = (t1slo9 << 20 | t1shi9 >>> 12)\n const t2shi6 = (t1shi9 << 20 | t1slo9 >>> 12)\n const t2slo22 = (t1shi14 << 7 | t1slo14 >>> 25)\n const t2shi22 = (t1slo14 << 7 | t1shi14 >>> 25)\n const t2slo13 = (t1slo19 << 8 | t1shi19 >>> 24)\n const t2shi13 = (t1shi19 << 8 | t1slo19 >>> 24)\n const t2slo4 = (t1slo24 << 14 | t1shi24 >>> 18)\n const t2shi4 = (t1shi24 << 14 | t1slo24 >>> 18)\n\n // chi\n s[0] = t2slo0 ^ (~t2slo1 & t2slo2)\n s[1] = t2shi0 ^ (~t2shi1 & t2shi2)\n s[10] = t2slo5 ^ (~t2slo6 & t2slo7)\n s[11] = t2shi5 ^ (~t2shi6 & t2shi7)\n s[20] = t2slo10 ^ (~t2slo11 & t2slo12)\n s[21] = t2shi10 ^ (~t2shi11 & t2shi12)\n s[30] = t2slo15 ^ (~t2slo16 & t2slo17)\n s[31] = t2shi15 ^ (~t2shi16 & t2shi17)\n s[40] = t2slo20 ^ (~t2slo21 & t2slo22)\n s[41] = t2shi20 ^ (~t2shi21 & t2shi22)\n s[2] = t2slo1 ^ (~t2slo2 & t2slo3)\n s[3] = t2shi1 ^ (~t2shi2 & t2shi3)\n s[12] = t2slo6 ^ (~t2slo7 & t2slo8)\n s[13] = t2shi6 ^ (~t2shi7 & t2shi8)\n s[22] = t2slo11 ^ (~t2slo12 & t2slo13)\n s[23] = t2shi11 ^ (~t2shi12 & t2shi13)\n s[32] = t2slo16 ^ (~t2slo17 & t2slo18)\n s[33] = t2shi16 ^ (~t2shi17 & t2shi18)\n s[42] = t2slo21 ^ (~t2slo22 & t2slo23)\n s[43] = t2shi21 ^ (~t2shi22 & t2shi23)\n s[4] = t2slo2 ^ (~t2slo3 & t2slo4)\n s[5] = t2shi2 ^ (~t2shi3 & t2shi4)\n s[14] = t2slo7 ^ (~t2slo8 & t2slo9)\n s[15] = t2shi7 ^ (~t2shi8 & t2shi9)\n s[24] = t2slo12 ^ (~t2slo13 & t2slo14)\n s[25] = t2shi12 ^ (~t2shi13 & t2shi14)\n s[34] = t2slo17 ^ (~t2slo18 & t2slo19)\n s[35] = t2shi17 ^ (~t2shi18 & t2shi19)\n s[44] = t2slo22 ^ (~t2slo23 & t2slo24)\n s[45] = t2shi22 ^ (~t2shi23 & t2shi24)\n s[6] = t2slo3 ^ (~t2slo4 & t2slo0)\n s[7] = t2shi3 ^ (~t2shi4 & t2shi0)\n s[16] = t2slo8 ^ (~t2slo9 & t2slo5)\n s[17] = t2shi8 ^ (~t2shi9 & t2shi5)\n s[26] = t2slo13 ^ (~t2slo14 & t2slo10)\n s[27] = t2shi13 ^ (~t2shi14 & t2shi10)\n s[36] = t2slo18 ^ (~t2slo19 & t2slo15)\n s[37] = t2shi18 ^ (~t2shi19 & t2shi15)\n s[46] = t2slo23 ^ (~t2slo24 & t2slo20)\n s[47] = t2shi23 ^ (~t2shi24 & t2shi20)\n s[8] = t2slo4 ^ (~t2slo0 & t2slo1)\n s[9] = t2shi4 ^ (~t2shi0 & t2shi1)\n s[18] = t2slo9 ^ (~t2slo5 & t2slo6)\n s[19] = t2shi9 ^ (~t2shi5 & t2shi6)\n s[28] = t2slo14 ^ (~t2slo10 & t2slo11)\n s[29] = t2shi14 ^ (~t2shi10 & t2shi11)\n s[38] = t2slo19 ^ (~t2slo15 & t2slo16)\n s[39] = t2shi19 ^ (~t2shi15 & t2shi16)\n s[48] = t2slo24 ^ (~t2slo20 & t2slo21)\n s[49] = t2shi24 ^ (~t2shi20 & t2shi21)\n\n // iota\n s[0] ^= P1600_ROUND_CONSTANTS[round * 2]\n s[1] ^= P1600_ROUND_CONSTANTS[round * 2 + 1]\n }\n}\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n __assign = Object.assign || function __assign(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n }\n return t;\n }\n return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n var t = {};\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n t[p] = s[p];\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n t[p[i]] = s[p[i]];\n }\n return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n var _, done = false;\n for (var i = decorators.length - 1; i >= 0; i--) {\n var context = {};\n for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n if (kind === \"accessor\") {\n if (result === void 0) continue;\n if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n if (_ = accept(result.get)) descriptor.get = _;\n if (_ = accept(result.set)) descriptor.set = _;\n if (_ = accept(result.init)) initializers.unshift(_);\n }\n else if (_ = accept(result)) {\n if (kind === \"field\") initializers.unshift(_);\n else descriptor[key] = _;\n }\n }\n if (target) Object.defineProperty(target, contextIn.name, descriptor);\n done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n var useValue = arguments.length > 2;\n for (var i = 0; i < initializers.length; i++) {\n value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n }\n return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n}\n\nexport function __generator(thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n for (var ar = [], i = 0; i < arguments.length; i++)\n ar = ar.concat(__read(arguments[i]));\n return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n r[k] = a[j];\n return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n function fulfill(value) { resume(\"next\", value); }\n function reject(value) { resume(\"throw\", value); }\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n var i, p;\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var m = o[Symbol.asyncIterator], i;\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n __setModuleDefault(result, mod);\n return result;\n}\n\nexport function __importDefault(mod) {\n return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n if (value !== null && value !== void 0) {\n if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n var dispose;\n if (async) {\n if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n dispose = value[Symbol.asyncDispose];\n }\n if (dispose === void 0) {\n if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n dispose = value[Symbol.dispose];\n }\n if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n env.stack.push({ value: value, dispose: dispose, async: async });\n }\n else if (async) {\n env.stack.push({ async: true });\n }\n return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n var e = new Error(message);\n return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n function fail(e) {\n env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n env.hasError = true;\n }\n function next() {\n while (env.stack.length) {\n var rec = env.stack.pop();\n try {\n var result = rec.dispose && rec.dispose.call(rec.value);\n if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n }\n catch (e) {\n fail(e);\n }\n }\n if (env.hasError) throw env.error;\n }\n return next();\n}\n\nexport default {\n __extends,\n __assign,\n __rest,\n __decorate,\n __param,\n __metadata,\n __awaiter,\n __generator,\n __createBinding,\n __exportStar,\n __values,\n __read,\n __spread,\n __spreadArrays,\n __spreadArray,\n __await,\n __asyncGenerator,\n __asyncDelegator,\n __asyncValues,\n __makeTemplateObject,\n __importStar,\n __importDefault,\n __classPrivateFieldGet,\n __classPrivateFieldSet,\n __classPrivateFieldIn,\n __addDisposableResource,\n __disposeResources,\n};\n","/**\n * @internal\n */\nexport var BLOCK_SIZE = 64;\n/**\n * @internal\n */\nexport var DIGEST_LENGTH = 32;\n/**\n * @internal\n */\nexport var KEY = new Uint32Array([\n 0x428a2f98,\n 0x71374491,\n 0xb5c0fbcf,\n 0xe9b5dba5,\n 0x3956c25b,\n 0x59f111f1,\n 0x923f82a4,\n 0xab1c5ed5,\n 0xd807aa98,\n 0x12835b01,\n 0x243185be,\n 0x550c7dc3,\n 0x72be5d74,\n 0x80deb1fe,\n 0x9bdc06a7,\n 0xc19bf174,\n 0xe49b69c1,\n 0xefbe4786,\n 0x0fc19dc6,\n 0x240ca1cc,\n 0x2de92c6f,\n 0x4a7484aa,\n 0x5cb0a9dc,\n 0x76f988da,\n 0x983e5152,\n 0xa831c66d,\n 0xb00327c8,\n 0xbf597fc7,\n 0xc6e00bf3,\n 0xd5a79147,\n 0x06ca6351,\n 0x14292967,\n 0x27b70a85,\n 0x2e1b2138,\n 0x4d2c6dfc,\n 0x53380d13,\n 0x650a7354,\n 0x766a0abb,\n 0x81c2c92e,\n 0x92722c85,\n 0xa2bfe8a1,\n 0xa81a664b,\n 0xc24b8b70,\n 0xc76c51a3,\n 0xd192e819,\n 0xd6990624,\n 0xf40e3585,\n 0x106aa070,\n 0x19a4c116,\n 0x1e376c08,\n 0x2748774c,\n 0x34b0bcb5,\n 0x391c0cb3,\n 0x4ed8aa4a,\n 0x5b9cca4f,\n 0x682e6ff3,\n 0x748f82ee,\n 0x78a5636f,\n 0x84c87814,\n 0x8cc70208,\n 0x90befffa,\n 0xa4506ceb,\n 0xbef9a3f7,\n 0xc67178f2\n]);\n/**\n * @internal\n */\nexport var INIT = [\n 0x6a09e667,\n 0xbb67ae85,\n 0x3c6ef372,\n 0xa54ff53a,\n 0x510e527f,\n 0x9b05688c,\n 0x1f83d9ab,\n 0x5be0cd19\n];\n/**\n * @internal\n */\nexport var MAX_HASHABLE_LENGTH = Math.pow(2, 53) - 1;\n//# sourceMappingURL=constants.js.map","import { BLOCK_SIZE, DIGEST_LENGTH, INIT, KEY, MAX_HASHABLE_LENGTH } from \"./constants\";\n/**\n * @internal\n */\nvar RawSha256 = /** @class */ (function () {\n function RawSha256() {\n this.state = Int32Array.from(INIT);\n this.temp = new Int32Array(64);\n this.buffer = new Uint8Array(64);\n this.bufferLength = 0;\n this.bytesHashed = 0;\n /**\n * @internal\n */\n this.finished = false;\n }\n RawSha256.prototype.update = function (data) {\n if (this.finished) {\n throw new Error(\"Attempted to update an already finished hash.\");\n }\n var position = 0;\n var byteLength = data.byteLength;\n this.bytesHashed += byteLength;\n if (this.bytesHashed * 8 > MAX_HASHABLE_LENGTH) {\n throw new Error(\"Cannot hash more than 2^53 - 1 bits\");\n }\n while (byteLength > 0) {\n this.buffer[this.bufferLength++] = data[position++];\n byteLength--;\n if (this.bufferLength === BLOCK_SIZE) {\n this.hashBuffer();\n this.bufferLength = 0;\n }\n }\n };\n RawSha256.prototype.digest = function () {\n if (!this.finished) {\n var bitsHashed = this.bytesHashed * 8;\n var bufferView = new DataView(this.buffer.buffer, this.buffer.byteOffset, this.buffer.byteLength);\n var undecoratedLength = this.bufferLength;\n bufferView.setUint8(this.bufferLength++, 0x80);\n // Ensure the final block has enough room for the hashed length\n if (undecoratedLength % BLOCK_SIZE >= BLOCK_SIZE - 8) {\n for (var i = this.bufferLength; i < BLOCK_SIZE; i++) {\n bufferView.setUint8(i, 0);\n }\n this.hashBuffer();\n this.bufferLength = 0;\n }\n for (var i = this.bufferLength; i < BLOCK_SIZE - 8; i++) {\n bufferView.setUint8(i, 0);\n }\n bufferView.setUint32(BLOCK_SIZE - 8, Math.floor(bitsHashed / 0x100000000), true);\n bufferView.setUint32(BLOCK_SIZE - 4, bitsHashed);\n this.hashBuffer();\n this.finished = true;\n }\n // The value in state is little-endian rather than big-endian, so flip\n // each word into a new Uint8Array\n var out = new Uint8Array(DIGEST_LENGTH);\n for (var i = 0; i < 8; i++) {\n out[i * 4] = (this.state[i] >>> 24) & 0xff;\n out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;\n out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;\n out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;\n }\n return out;\n };\n RawSha256.prototype.hashBuffer = function () {\n var _a = this, buffer = _a.buffer, state = _a.state;\n var state0 = state[0], state1 = state[1], state2 = state[2], state3 = state[3], state4 = state[4], state5 = state[5], state6 = state[6], state7 = state[7];\n for (var i = 0; i < BLOCK_SIZE; i++) {\n if (i < 16) {\n this.temp[i] =\n ((buffer[i * 4] & 0xff) << 24) |\n ((buffer[i * 4 + 1] & 0xff) << 16) |\n ((buffer[i * 4 + 2] & 0xff) << 8) |\n (buffer[i * 4 + 3] & 0xff);\n }\n else {\n var u = this.temp[i - 2];\n var t1_1 = ((u >>> 17) | (u << 15)) ^ ((u >>> 19) | (u << 13)) ^ (u >>> 10);\n u = this.temp[i - 15];\n var t2_1 = ((u >>> 7) | (u << 25)) ^ ((u >>> 18) | (u << 14)) ^ (u >>> 3);\n this.temp[i] =\n ((t1_1 + this.temp[i - 7]) | 0) + ((t2_1 + this.temp[i - 16]) | 0);\n }\n var t1 = ((((((state4 >>> 6) | (state4 << 26)) ^\n ((state4 >>> 11) | (state4 << 21)) ^\n ((state4 >>> 25) | (state4 << 7))) +\n ((state4 & state5) ^ (~state4 & state6))) |\n 0) +\n ((state7 + ((KEY[i] + this.temp[i]) | 0)) | 0)) |\n 0;\n var t2 = ((((state0 >>> 2) | (state0 << 30)) ^\n ((state0 >>> 13) | (state0 << 19)) ^\n ((state0 >>> 22) | (state0 << 10))) +\n ((state0 & state1) ^ (state0 & state2) ^ (state1 & state2))) |\n 0;\n state7 = state6;\n state6 = state5;\n state5 = state4;\n state4 = (state3 + t1) | 0;\n state3 = state2;\n state2 = state1;\n state1 = state0;\n state0 = (t1 + t2) | 0;\n }\n state[0] += state0;\n state[1] += state1;\n state[2] += state2;\n state[3] += state3;\n state[4] += state4;\n state[5] += state5;\n state[6] += state6;\n state[7] += state7;\n };\n return RawSha256;\n}());\nexport { RawSha256 };\n//# sourceMappingURL=RawSha256.js.map","// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.\n// SPDX-License-Identifier: Apache-2.0\nimport { fromUtf8 as fromUtf8Browser } from \"@smithy/util-utf8\";\n// Quick polyfill\nvar fromUtf8 = typeof Buffer !== \"undefined\" && Buffer.from\n ? function (input) { return Buffer.from(input, \"utf8\"); }\n : fromUtf8Browser;\nexport function convertToBuffer(data) {\n // Already a Uint8, do nothing\n if (data instanceof Uint8Array)\n return data;\n if (typeof data === \"string\") {\n return fromUtf8(data);\n }\n if (ArrayBuffer.isView(data)) {\n return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);\n }\n return new Uint8Array(data);\n}\n//# sourceMappingURL=convertToBuffer.js.map","export const fromUtf8 = (input) => new TextEncoder().encode(input);\n","import { __awaiter, __generator } from \"tslib\";\nimport { BLOCK_SIZE } from \"./constants\";\nimport { RawSha256 } from \"./RawSha256\";\nimport { isEmptyData, convertToBuffer } from \"@aws-crypto/util\";\nvar Sha256 = /** @class */ (function () {\n function Sha256(secret) {\n this.secret = secret;\n this.hash = new RawSha256();\n this.reset();\n }\n Sha256.prototype.update = function (toHash) {\n if (isEmptyData(toHash) || this.error) {\n return;\n }\n try {\n this.hash.update(convertToBuffer(toHash));\n }\n catch (e) {\n this.error = e;\n }\n };\n /* This synchronous method keeps compatibility\n * with the v2 aws-sdk.\n */\n Sha256.prototype.digestSync = function () {\n if (this.error) {\n throw this.error;\n }\n if (this.outer) {\n if (!this.outer.finished) {\n this.outer.update(this.hash.digest());\n }\n return this.outer.digest();\n }\n return this.hash.digest();\n };\n /* The underlying digest method here is synchronous.\n * To keep the same interface with the other hash functions\n * the default is to expose this as an async method.\n * However, it can sometimes be useful to have a sync method.\n */\n Sha256.prototype.digest = function () {\n return __awaiter(this, void 0, void 0, function () {\n return __generator(this, function (_a) {\n return [2 /*return*/, this.digestSync()];\n });\n });\n };\n Sha256.prototype.reset = function () {\n this.hash = new RawSha256();\n if (this.secret) {\n this.outer = new RawSha256();\n var inner = bufferFromSecret(this.secret);\n var outer = new Uint8Array(BLOCK_SIZE);\n outer.set(inner);\n for (var i = 0; i < BLOCK_SIZE; i++) {\n inner[i] ^= 0x36;\n outer[i] ^= 0x5c;\n }\n this.hash.update(inner);\n this.outer.update(outer);\n // overwrite the copied key in memory\n for (var i = 0; i < inner.byteLength; i++) {\n inner[i] = 0;\n }\n }\n };\n return Sha256;\n}());\nexport { Sha256 };\nfunction bufferFromSecret(secret) {\n var input = convertToBuffer(secret);\n if (input.byteLength > BLOCK_SIZE) {\n var bufferHash = new RawSha256();\n bufferHash.update(input);\n input = bufferHash.digest();\n }\n var buffer = new Uint8Array(BLOCK_SIZE);\n buffer.set(input);\n return buffer;\n}\n//# sourceMappingURL=jsSha256.js.map","// Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.\n// SPDX-License-Identifier: Apache-2.0\nexport function isEmptyData(data) {\n if (typeof data === \"string\") {\n return data.length === 0;\n }\n return data.byteLength === 0;\n}\n//# sourceMappingURL=isEmptyData.js.map","import { Sha256 } from '@aws-crypto/sha256-js';\n\nconst sha256 = value => {\n const hexStr = value;\n const hash = new Sha256();\n hash.update(hexStr);\n const hashUint8Array = hash.digestSync();\n return Buffer.from(hashUint8Array).toString('hex');\n};\n\nexport default sha256;\n","/*\r\n * bignumber.js v9.1.1\r\n * A JavaScript library for arbitrary-precision arithmetic.\r\n * https://github.com/MikeMcl/bignumber.js\r\n * Copyright (c) 2022 Michael Mclaughlin \r\n * MIT Licensed.\r\n *\r\n * BigNumber.prototype methods | BigNumber methods\r\n * |\r\n * absoluteValue abs | clone\r\n * comparedTo | config set\r\n * decimalPlaces dp | DECIMAL_PLACES\r\n * dividedBy div | ROUNDING_MODE\r\n * dividedToIntegerBy idiv | EXPONENTIAL_AT\r\n * exponentiatedBy pow | RANGE\r\n * integerValue | CRYPTO\r\n * isEqualTo eq | MODULO_MODE\r\n * isFinite | POW_PRECISION\r\n * isGreaterThan gt | FORMAT\r\n * isGreaterThanOrEqualTo gte | ALPHABET\r\n * isInteger | isBigNumber\r\n * isLessThan lt | maximum max\r\n * isLessThanOrEqualTo lte | minimum min\r\n * isNaN | random\r\n * isNegative | sum\r\n * isPositive |\r\n * isZero |\r\n * minus |\r\n * modulo mod |\r\n * multipliedBy times |\r\n * negated |\r\n * plus |\r\n * precision sd |\r\n * shiftedBy |\r\n * squareRoot sqrt |\r\n * toExponential |\r\n * toFixed |\r\n * toFormat |\r\n * toFraction |\r\n * toJSON |\r\n * toNumber |\r\n * toPrecision |\r\n * toString |\r\n * valueOf |\r\n *\r\n */\r\n\r\n\r\nvar\r\n isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n mathceil = Math.ceil,\r\n mathfloor = Math.floor,\r\n\r\n bignumberError = '[BigNumber Error] ',\r\n tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n BASE = 1e14,\r\n LOG_BASE = 14,\r\n MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1\r\n // MAX_INT32 = 0x7fffffff, // 2^31 - 1\r\n POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n SQRT_BASE = 1e7,\r\n\r\n // EDITABLE\r\n // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n MAX = 1E9; // 0 to MAX_INT32\r\n\r\n\r\n/*\r\n * Create and return a BigNumber constructor.\r\n */\r\nfunction clone(configObject) {\r\n var div, convertBase, parseNumeric,\r\n P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n ONE = new BigNumber(1),\r\n\r\n\r\n //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n // The default values below must be integers within the inclusive ranges stated.\r\n // The values can also be changed at run-time using BigNumber.set.\r\n\r\n // The maximum number of decimal places for operations involving division.\r\n DECIMAL_PLACES = 20, // 0 to MAX\r\n\r\n // The rounding mode used when rounding to the above decimal places, and when using\r\n // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n // UP 0 Away from zero.\r\n // DOWN 1 Towards zero.\r\n // CEIL 2 Towards +Infinity.\r\n // FLOOR 3 Towards -Infinity.\r\n // HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n ROUNDING_MODE = 4, // 0 to 8\r\n\r\n // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n // The exponent value at and beneath which toString returns exponential notation.\r\n // Number type: -7\r\n TO_EXP_NEG = -7, // 0 to -MAX\r\n\r\n // The exponent value at and above which toString returns exponential notation.\r\n // Number type: 21\r\n TO_EXP_POS = 21, // 0 to MAX\r\n\r\n // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // Number type: -324 (5e-324)\r\n MIN_EXP = -1e7, // -1 to -MAX\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // Number type: 308 (1.7976931348623157e+308)\r\n // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n MAX_EXP = 1e7, // 1 to MAX\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n CRYPTO = false, // true or false\r\n\r\n // The modulo mode used when calculating the modulus: a mod n.\r\n // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n // The remainder (r) is calculated as: r = a - n * q.\r\n //\r\n // UP 0 The remainder is positive if the dividend is negative, else is negative.\r\n // DOWN 1 The remainder has the same sign as the dividend.\r\n // This modulo mode is commonly known as 'truncated division' and is\r\n // equivalent to (a % n) in JavaScript.\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n // The remainder is always positive.\r\n //\r\n // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n // modes are commonly used for the modulus operation.\r\n // Although the other rounding modes can also be used, they may not give useful results.\r\n MODULO_MODE = 1, // 0 to 9\r\n\r\n // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n POW_PRECISION = 0, // 0 to MAX\r\n\r\n // The format specification used by the BigNumber.prototype.toFormat method.\r\n FORMAT = {\r\n prefix: '',\r\n groupSize: 3,\r\n secondaryGroupSize: 0,\r\n groupSeparator: ',',\r\n decimalSeparator: '.',\r\n fractionGroupSize: 0,\r\n fractionGroupSeparator: '\\xA0', // non-breaking space\r\n suffix: ''\r\n },\r\n\r\n // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n // '-', '.', whitespace, or repeated character.\r\n // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n //------------------------------------------------------------------------------------------\r\n\r\n\r\n // CONSTRUCTOR\r\n\r\n\r\n /*\r\n * The BigNumber constructor and exported function.\r\n * Create and return a new instance of a BigNumber object.\r\n *\r\n * v {number|string|BigNumber} A numeric value.\r\n * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n */\r\n function BigNumber(v, b) {\r\n var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n x = this;\r\n\r\n // Enable constructor call without `new`.\r\n if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n if (b == null) {\r\n\r\n if (v && v._isBigNumber === true) {\r\n x.s = v.s;\r\n\r\n if (!v.c || v.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else if (v.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = v.e;\r\n x.c = v.c.slice();\r\n }\r\n\r\n return;\r\n }\r\n\r\n if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n // Use `1 / n` to handle minus zero also.\r\n x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n // Fast path for integers, where n < 2147483648 (2**31).\r\n if (v === ~~v) {\r\n for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n if (e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else {\r\n x.e = e;\r\n x.c = [v];\r\n }\r\n\r\n return;\r\n }\r\n\r\n str = String(v);\r\n } else {\r\n\r\n if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = str.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +str.slice(i + 1);\r\n str = str.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = str.length;\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n // Allow exponential notation to be used with base 10 argument, while\r\n // also rounding to DECIMAL_PLACES as with other bases.\r\n if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n x = new BigNumber(v);\r\n return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n }\r\n\r\n str = String(v);\r\n\r\n if (isNum = typeof v == 'number') {\r\n\r\n // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n throw Error\r\n (tooManyDigits + v);\r\n }\r\n } else {\r\n x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n alphabet = ALPHABET.slice(0, b);\r\n e = i = 0;\r\n\r\n // Check that str is a valid base b number.\r\n // Don't use RegExp, so alphabet can contain special characters.\r\n for (len = str.length; i < len; i++) {\r\n if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n if (c == '.') {\r\n\r\n // If '.' is not the first character and it has not be found before.\r\n if (i > e) {\r\n e = len;\r\n continue;\r\n }\r\n } else if (!caseChanged) {\r\n\r\n // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n caseChanged = true;\r\n i = -1;\r\n e = 0;\r\n continue;\r\n }\r\n }\r\n\r\n return parseNumeric(x, String(v), isNum, b);\r\n }\r\n }\r\n\r\n // Prevent later check for length on converted number.\r\n isNum = false;\r\n str = convertBase(str, b, 10, x.s);\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n else e = str.length;\r\n }\r\n\r\n // Determine leading zeros.\r\n for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n // Determine trailing zeros.\r\n for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n if (str = str.slice(i, ++len)) {\r\n len -= i;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (isNum && BigNumber.DEBUG &&\r\n len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n throw Error\r\n (tooManyDigits + (x.s * v));\r\n }\r\n\r\n // Overflow?\r\n if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n x.c = x.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = e;\r\n x.c = [];\r\n\r\n // Transform base\r\n\r\n // e is the base 10 exponent.\r\n // i is where to slice str to get the first element of the coefficient array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE; // i < 1\r\n\r\n if (i < len) {\r\n if (i) x.c.push(+str.slice(0, i));\r\n\r\n for (len -= LOG_BASE; i < len;) {\r\n x.c.push(+str.slice(i, i += LOG_BASE));\r\n }\r\n\r\n i = LOG_BASE - (str = str.slice(i)).length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--; str += '0');\r\n x.c.push(+str);\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n\r\n // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n BigNumber.clone = clone;\r\n\r\n BigNumber.ROUND_UP = 0;\r\n BigNumber.ROUND_DOWN = 1;\r\n BigNumber.ROUND_CEIL = 2;\r\n BigNumber.ROUND_FLOOR = 3;\r\n BigNumber.ROUND_HALF_UP = 4;\r\n BigNumber.ROUND_HALF_DOWN = 5;\r\n BigNumber.ROUND_HALF_EVEN = 6;\r\n BigNumber.ROUND_HALF_CEIL = 7;\r\n BigNumber.ROUND_HALF_FLOOR = 8;\r\n BigNumber.EUCLID = 9;\r\n\r\n\r\n /*\r\n * Configure infrequently-changing library-wide settings.\r\n *\r\n * Accept an object with the following optional properties (if the value of a property is\r\n * a number, it must be an integer within the inclusive range stated):\r\n *\r\n * DECIMAL_PLACES {number} 0 to MAX\r\n * ROUNDING_MODE {number} 0 to 8\r\n * EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]\r\n * RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]\r\n * CRYPTO {boolean} true or false\r\n * MODULO_MODE {number} 0 to 9\r\n * POW_PRECISION {number} 0 to MAX\r\n * ALPHABET {string} A string of two or more unique characters which does\r\n * not contain '.'.\r\n * FORMAT {object} An object with some of the following properties:\r\n * prefix {string}\r\n * groupSize {number}\r\n * secondaryGroupSize {number}\r\n * groupSeparator {string}\r\n * decimalSeparator {string}\r\n * fractionGroupSize {number}\r\n * fractionGroupSeparator {string}\r\n * suffix {string}\r\n *\r\n * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n *\r\n * E.g.\r\n * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n *\r\n * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n *\r\n * Return an object with the properties current values.\r\n */\r\n BigNumber.config = BigNumber.set = function (obj) {\r\n var p, v;\r\n\r\n if (obj != null) {\r\n\r\n if (typeof obj == 'object') {\r\n\r\n // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n DECIMAL_PLACES = v;\r\n }\r\n\r\n // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 8, p);\r\n ROUNDING_MODE = v;\r\n }\r\n\r\n // EXPONENTIAL_AT {number|number[]}\r\n // Integer, -MAX to MAX inclusive or\r\n // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, 0, p);\r\n intCheck(v[1], 0, MAX, p);\r\n TO_EXP_NEG = v[0];\r\n TO_EXP_POS = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n }\r\n }\r\n\r\n // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n if (obj.hasOwnProperty(p = 'RANGE')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, -1, p);\r\n intCheck(v[1], 1, MAX, p);\r\n MIN_EXP = v[0];\r\n MAX_EXP = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n if (v) {\r\n MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' cannot be zero: ' + v);\r\n }\r\n }\r\n }\r\n\r\n // CRYPTO {boolean} true or false.\r\n // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n // '[BigNumber Error] crypto unavailable'\r\n if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n v = obj[p];\r\n if (v === !!v) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues || crypto.randomBytes)) {\r\n CRYPTO = v;\r\n } else {\r\n CRYPTO = !v;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n } else {\r\n CRYPTO = v;\r\n }\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' not true or false: ' + v);\r\n }\r\n }\r\n\r\n // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 9, p);\r\n MODULO_MODE = v;\r\n }\r\n\r\n // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n POW_PRECISION = v;\r\n }\r\n\r\n // FORMAT {object}\r\n // '[BigNumber Error] FORMAT not an object: {v}'\r\n if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n v = obj[p];\r\n if (typeof v == 'object') FORMAT = v;\r\n else throw Error\r\n (bignumberError + p + ' not an object: ' + v);\r\n }\r\n\r\n // ALPHABET {string}\r\n // '[BigNumber Error] ALPHABET invalid: {v}'\r\n if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n v = obj[p];\r\n\r\n // Disallow if less than two characters,\r\n // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n ALPHABET = v;\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' invalid: ' + v);\r\n }\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Object expected: {v}'\r\n throw Error\r\n (bignumberError + 'Object expected: ' + obj);\r\n }\r\n }\r\n\r\n return {\r\n DECIMAL_PLACES: DECIMAL_PLACES,\r\n ROUNDING_MODE: ROUNDING_MODE,\r\n EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n RANGE: [MIN_EXP, MAX_EXP],\r\n CRYPTO: CRYPTO,\r\n MODULO_MODE: MODULO_MODE,\r\n POW_PRECISION: POW_PRECISION,\r\n FORMAT: FORMAT,\r\n ALPHABET: ALPHABET\r\n };\r\n };\r\n\r\n\r\n /*\r\n * Return true if v is a BigNumber instance, otherwise return false.\r\n *\r\n * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n *\r\n * v {any}\r\n *\r\n * '[BigNumber Error] Invalid BigNumber: {v}'\r\n */\r\n BigNumber.isBigNumber = function (v) {\r\n if (!v || v._isBigNumber !== true) return false;\r\n if (!BigNumber.DEBUG) return true;\r\n\r\n var i, n,\r\n c = v.c,\r\n e = v.e,\r\n s = v.s;\r\n\r\n out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n // If the first element is zero, the BigNumber value must be zero.\r\n if (c[0] === 0) {\r\n if (e === 0 && c.length === 1) return true;\r\n break out;\r\n }\r\n\r\n // Calculate number of digits that c[0] should have, based on the exponent.\r\n i = (e + 1) % LOG_BASE;\r\n if (i < 1) i += LOG_BASE;\r\n\r\n // Calculate number of digits of c[0].\r\n //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n if (String(c[0]).length == i) {\r\n\r\n for (i = 0; i < c.length; i++) {\r\n n = c[i];\r\n if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n }\r\n\r\n // Last element cannot be zero, unless it is the only element.\r\n if (n !== 0) return true;\r\n }\r\n }\r\n\r\n // Infinity/NaN\r\n } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n return true;\r\n }\r\n\r\n throw Error\r\n (bignumberError + 'Invalid BigNumber: ' + v);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.maximum = BigNumber.max = function () {\r\n return maxOrMin(arguments, P.lt);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.minimum = BigNumber.min = function () {\r\n return maxOrMin(arguments, P.gt);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n * zeros are produced).\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n * '[BigNumber Error] crypto unavailable'\r\n */\r\n BigNumber.random = (function () {\r\n var pow2_53 = 0x20000000000000;\r\n\r\n // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n // Check if Math.random() produces more than 32 bits of randomness.\r\n // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n ? function () { return mathfloor(Math.random() * pow2_53); }\r\n : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n (Math.random() * 0x800000 | 0); };\r\n\r\n return function (dp) {\r\n var a, b, e, k, v,\r\n i = 0,\r\n c = [],\r\n rand = new BigNumber(ONE);\r\n\r\n if (dp == null) dp = DECIMAL_PLACES;\r\n else intCheck(dp, 0, MAX);\r\n\r\n k = mathceil(dp / LOG_BASE);\r\n\r\n if (CRYPTO) {\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n if (crypto.getRandomValues) {\r\n\r\n a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n for (; i < k;) {\r\n\r\n // 53 bits:\r\n // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n // 11111 11111111 11111111\r\n // 0x20000 is 2^21.\r\n v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n // Rejection sampling:\r\n // 0 <= v < 9007199254740992\r\n // Probability that v >= 9e15, is\r\n // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n if (v >= 9e15) {\r\n b = crypto.getRandomValues(new Uint32Array(2));\r\n a[i] = b[0];\r\n a[i + 1] = b[1];\r\n } else {\r\n\r\n // 0 <= v <= 8999999999999999\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 2;\r\n }\r\n }\r\n i = k / 2;\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n a = crypto.randomBytes(k *= 7);\r\n\r\n for (; i < k;) {\r\n\r\n // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n // 0 <= v < 9007199254740992\r\n v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n if (v >= 9e15) {\r\n crypto.randomBytes(7).copy(a, i);\r\n } else {\r\n\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 7;\r\n }\r\n }\r\n i = k / 7;\r\n } else {\r\n CRYPTO = false;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n }\r\n\r\n // Use Math.random.\r\n if (!CRYPTO) {\r\n\r\n for (; i < k;) {\r\n v = random53bitInt();\r\n if (v < 9e15) c[i++] = v % 1e14;\r\n }\r\n }\r\n\r\n k = c[--i];\r\n dp %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to dp.\r\n if (k && dp) {\r\n v = POWS_TEN[LOG_BASE - dp];\r\n c[i] = mathfloor(k / v) * v;\r\n }\r\n\r\n // Remove trailing elements which are zero.\r\n for (; c[i] === 0; c.pop(), i--);\r\n\r\n // Zero?\r\n if (i < 0) {\r\n c = [e = 0];\r\n } else {\r\n\r\n // Remove leading elements which are zero and adjust exponent accordingly.\r\n for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n // Count the digits of the first element of c to determine leading zeros, and...\r\n for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n // adjust the exponent accordingly.\r\n if (i < LOG_BASE) e -= LOG_BASE - i;\r\n }\r\n\r\n rand.e = e;\r\n rand.c = c;\r\n return rand;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a BigNumber whose value is the sum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.sum = function () {\r\n var i = 1,\r\n args = arguments,\r\n sum = new BigNumber(args[0]);\r\n for (; i < args.length;) sum = sum.plus(args[i++]);\r\n return sum;\r\n };\r\n\r\n\r\n // PRIVATE FUNCTIONS\r\n\r\n\r\n // Called by BigNumber and BigNumber.prototype.toString.\r\n convertBase = (function () {\r\n var decimal = '0123456789';\r\n\r\n /*\r\n * Convert string of baseIn to an array of numbers of baseOut.\r\n * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n */\r\n function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n len = str.length;\r\n\r\n for (; i < len;) {\r\n for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n for (j = 0; j < arr.length; j++) {\r\n\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] == null) arr[j + 1] = 0;\r\n arr[j + 1] += arr[j] / baseOut | 0;\r\n arr[j] %= baseOut;\r\n }\r\n }\r\n }\r\n\r\n return arr.reverse();\r\n }\r\n\r\n // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n // If the caller is toString, we are converting from base 10 to baseOut.\r\n // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n var alphabet, d, e, k, r, x, xc, y,\r\n i = str.indexOf('.'),\r\n dp = DECIMAL_PLACES,\r\n rm = ROUNDING_MODE;\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n k = POW_PRECISION;\r\n\r\n // Unlimited precision.\r\n POW_PRECISION = 0;\r\n str = str.replace('.', '');\r\n y = new BigNumber(baseIn);\r\n x = y.pow(str.length - i);\r\n POW_PRECISION = k;\r\n\r\n // Convert str as if an integer, then restore the fraction part by dividing the\r\n // result by its base raised to a power.\r\n\r\n y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n 10, baseOut, decimal);\r\n y.e = y.c.length;\r\n }\r\n\r\n // Convert the number as integer.\r\n\r\n xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n ? (alphabet = ALPHABET, decimal)\r\n : (alphabet = decimal, ALPHABET));\r\n\r\n // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n e = k = xc.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--k] == 0; xc.pop());\r\n\r\n // Zero?\r\n if (!xc[0]) return alphabet.charAt(0);\r\n\r\n // Does str represent an integer? If so, no need for the division.\r\n if (i < 0) {\r\n --e;\r\n } else {\r\n x.c = xc;\r\n x.e = e;\r\n\r\n // The sign is needed for correct rounding.\r\n x.s = sign;\r\n x = div(x, y, dp, rm, baseOut);\r\n xc = x.c;\r\n r = x.r;\r\n e = x.e;\r\n }\r\n\r\n // xc now represents str converted to baseOut.\r\n\r\n // THe index of the rounding digit.\r\n d = e + dp + 1;\r\n\r\n // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n i = xc[d];\r\n\r\n // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n k = baseOut / 2;\r\n r = r || d < 0 || xc[d + 1] != null;\r\n\r\n r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n // If the index of the rounding digit is not greater than zero, or xc represents\r\n // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n // such as 0.00001.\r\n if (d < 1 || !xc[0]) {\r\n\r\n // 1^-dp or 0\r\n str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n } else {\r\n\r\n // Truncate xc to the required number of decimal places.\r\n xc.length = d;\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (--baseOut; ++xc[--d] > baseOut;) {\r\n xc[d] = 0;\r\n\r\n if (!d) {\r\n ++e;\r\n xc = [1].concat(xc);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (k = xc.length; !xc[--k];);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n // Add leading zeros, decimal point and trailing zeros as required.\r\n str = toFixedPoint(str, e, alphabet.charAt(0));\r\n }\r\n\r\n // The caller will add the sign.\r\n return str;\r\n };\r\n })();\r\n\r\n\r\n // Perform division in the specified base. Called by div and convertBase.\r\n div = (function () {\r\n\r\n // Assume non-zero x and k.\r\n function multiply(x, k, base) {\r\n var m, temp, xlo, xhi,\r\n carry = 0,\r\n i = x.length,\r\n klo = k % SQRT_BASE,\r\n khi = k / SQRT_BASE | 0;\r\n\r\n for (x = x.slice(); i--;) {\r\n xlo = x[i] % SQRT_BASE;\r\n xhi = x[i] / SQRT_BASE | 0;\r\n m = khi * xlo + xhi * klo;\r\n temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n x[i] = temp % base;\r\n }\r\n\r\n if (carry) x = [carry].concat(x);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, cmp;\r\n\r\n if (aL != bL) {\r\n cmp = aL > bL ? 1 : -1;\r\n } else {\r\n\r\n for (i = cmp = 0; i < aL; i++) {\r\n\r\n if (a[i] != b[i]) {\r\n cmp = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return cmp;\r\n }\r\n\r\n function subtract(a, b, aL, base) {\r\n var i = 0;\r\n\r\n // Subtract b from a.\r\n for (; aL--;) {\r\n a[aL] -= i;\r\n i = a[aL] < b[aL] ? 1 : 0;\r\n a[aL] = i * base + a[aL] - b[aL];\r\n }\r\n\r\n // Remove leading zeros.\r\n for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n }\r\n\r\n // x: dividend, y: divisor.\r\n return function (x, y, dp, rm, base) {\r\n var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n yL, yz,\r\n s = x.s == y.s ? 1 : -1,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n return new BigNumber(\r\n\r\n // Return NaN if either NaN, or both Infinity or 0.\r\n !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n );\r\n }\r\n\r\n q = new BigNumber(s);\r\n qc = q.c = [];\r\n e = x.e - y.e;\r\n s = dp + e + 1;\r\n\r\n if (!base) {\r\n base = BASE;\r\n e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n s = s / LOG_BASE | 0;\r\n }\r\n\r\n // Result exponent may be one less then the current value of e.\r\n // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n if (s < 0) {\r\n qc.push(1);\r\n more = true;\r\n } else {\r\n xL = xc.length;\r\n yL = yc.length;\r\n i = 0;\r\n s += 2;\r\n\r\n // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n n = mathfloor(base / (yc[0] + 1));\r\n\r\n // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n if (n > 1) {\r\n yc = multiply(yc, n, base);\r\n xc = multiply(xc, n, base);\r\n yL = yc.length;\r\n xL = xc.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xc.slice(0, yL);\r\n remL = rem.length;\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; remL < yL; rem[remL++] = 0);\r\n yz = yc.slice();\r\n yz = [0].concat(yz);\r\n yc0 = yc[0];\r\n if (yc[1] >= base / 2) yc0++;\r\n // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n do {\r\n n = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yc, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, n.\r\n\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n // n is how many times the divisor goes into the current remainder.\r\n n = mathfloor(rem0 / yc0);\r\n\r\n // Algorithm:\r\n // product = divisor multiplied by trial digit (n).\r\n // Compare product and remainder.\r\n // If product is greater than remainder:\r\n // Subtract divisor from product, decrement trial digit.\r\n // Subtract product from remainder.\r\n // If product was less than remainder at the last compare:\r\n // Compare new remainder and divisor.\r\n // If remainder is greater than divisor:\r\n // Subtract divisor from remainder, increment trial digit.\r\n\r\n if (n > 1) {\r\n\r\n // n may be > base only when base is 3.\r\n if (n >= base) n = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiply(yc, n, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n // If product > remainder then trial digit n too high.\r\n // n is 1 too high about 5% of the time, and is not known to have\r\n // ever been more than 1 too high.\r\n while (compare(prod, rem, prodL, remL) == 1) {\r\n n--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n prodL = prod.length;\r\n cmp = 1;\r\n }\r\n } else {\r\n\r\n // n is 0 or 1, cmp is -1.\r\n // If n is 0, there is no need to compare yc and rem again below,\r\n // so change cmp to 1 to avoid it.\r\n // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n if (n == 0) {\r\n\r\n // divisor < remainder, so n must be at least 1.\r\n cmp = n = 1;\r\n }\r\n\r\n // product = divisor\r\n prod = yc.slice();\r\n prodL = prod.length;\r\n }\r\n\r\n if (prodL < remL) prod = [0].concat(prod);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n remL = rem.length;\r\n\r\n // If product was < remainder.\r\n if (cmp == -1) {\r\n\r\n // Compare divisor and new remainder.\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n // Trial digit n too low.\r\n // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n while (compare(yc, rem, yL, remL) < 1) {\r\n n++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yc, remL, base);\r\n remL = rem.length;\r\n }\r\n }\r\n } else if (cmp === 0) {\r\n n++;\r\n rem = [0];\r\n } // else cmp === 1 and n will be 0\r\n\r\n // Add the next digit, n, to the result array.\r\n qc[i++] = n;\r\n\r\n // Update the remainder.\r\n if (rem[0]) {\r\n rem[remL++] = xc[xi] || 0;\r\n } else {\r\n rem = [xc[xi]];\r\n remL = 1;\r\n }\r\n } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n more = rem[0] != null;\r\n\r\n // Leading zero?\r\n if (!qc[0]) qc.splice(0, 1);\r\n }\r\n\r\n if (base == BASE) {\r\n\r\n // To calculate q.e, first get the number of digits of qc[0].\r\n for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n // Caller is convertBase.\r\n } else {\r\n q.e = e;\r\n q.r = +more;\r\n }\r\n\r\n return q;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n * notation rounded to the specified decimal places or significant digits.\r\n *\r\n * n: a BigNumber.\r\n * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n * rm: the rounding mode.\r\n * id: 1 (toExponential) or 2 (toPrecision).\r\n */\r\n function format(n, i, rm, id) {\r\n var c0, e, ne, len, str;\r\n\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n if (!n.c) return n.toString();\r\n\r\n c0 = n.c[0];\r\n ne = n.e;\r\n\r\n if (i == null) {\r\n str = coeffToString(n.c);\r\n str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n ? toExponential(str, ne)\r\n : toFixedPoint(str, ne, '0');\r\n } else {\r\n n = round(new BigNumber(n), i, rm);\r\n\r\n // n.e may have changed if the value was rounded up.\r\n e = n.e;\r\n\r\n str = coeffToString(n.c);\r\n len = str.length;\r\n\r\n // toPrecision returns exponential notation if the number of significant digits\r\n // specified is less than the number of digits necessary to represent the integer\r\n // part of the value in fixed-point notation.\r\n\r\n // Exponential notation.\r\n if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n // Append zeros?\r\n for (; len < i; str += '0', len++);\r\n str = toExponential(str, e);\r\n\r\n // Fixed-point notation.\r\n } else {\r\n i -= ne;\r\n str = toFixedPoint(str, e, '0');\r\n\r\n // Append zeros?\r\n if (e + 1 > len) {\r\n if (--i > 0) for (str += '.'; i--; str += '0');\r\n } else {\r\n i += e - len;\r\n if (i > 0) {\r\n if (e + 1 == len) str += '.';\r\n for (; i--; str += '0');\r\n }\r\n }\r\n }\r\n }\r\n\r\n return n.s < 0 && c0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Handle BigNumber.max and BigNumber.min.\r\n function maxOrMin(args, method) {\r\n var n,\r\n i = 1,\r\n m = new BigNumber(args[0]);\r\n\r\n for (; i < args.length; i++) {\r\n n = new BigNumber(args[i]);\r\n\r\n // If any number is NaN, return NaN.\r\n if (!n.s) {\r\n m = n;\r\n break;\r\n } else if (method.call(m, n)) {\r\n m = n;\r\n }\r\n }\r\n\r\n return m;\r\n }\r\n\r\n\r\n /*\r\n * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n * Called by minus, plus and times.\r\n */\r\n function normalise(n, c, e) {\r\n var i = 1,\r\n j = c.length;\r\n\r\n // Remove trailing zeros.\r\n for (; !c[--j]; c.pop());\r\n\r\n // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n // Overflow?\r\n if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n n.c = n.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n n.c = [n.e = 0];\r\n } else {\r\n n.e = e;\r\n n.c = c;\r\n }\r\n\r\n return n;\r\n }\r\n\r\n\r\n // Handle values that fail the validity test in BigNumber.\r\n parseNumeric = (function () {\r\n var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n dotAfter = /^([^.]+)\\.$/,\r\n dotBefore = /^\\.([^.]+)$/,\r\n isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n return function (x, str, isNum, b) {\r\n var base,\r\n s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n // No exception on ±Infinity or NaN.\r\n if (isInfinityOrNaN.test(s)) {\r\n x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n } else {\r\n if (!isNum) {\r\n\r\n // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n s = s.replace(basePrefix, function (m, p1, p2) {\r\n base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n return !b || b == base ? p1 : m;\r\n });\r\n\r\n if (b) {\r\n base = b;\r\n\r\n // E.g. '1.' to '1', '.1' to '0.1'\r\n s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n }\r\n\r\n if (str != s) return new BigNumber(s, base);\r\n }\r\n\r\n // '[BigNumber Error] Not a number: {n}'\r\n // '[BigNumber Error] Not a base {b} number: {n}'\r\n if (BigNumber.DEBUG) {\r\n throw Error\r\n (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n }\r\n\r\n // NaN\r\n x.s = null;\r\n }\r\n\r\n x.c = x.e = null;\r\n }\r\n })();\r\n\r\n\r\n /*\r\n * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n * If r is truthy, it is known that there are more digits after the rounding digit.\r\n */\r\n function round(x, sd, rm, r) {\r\n var d, i, j, k, n, ni, rd,\r\n xc = x.c,\r\n pows10 = POWS_TEN;\r\n\r\n // if x is not Infinity or NaN...\r\n if (xc) {\r\n\r\n // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n // ni is the index of n within x.c.\r\n // d is the number of digits of n.\r\n // i is the index of rd within n including leading zeros.\r\n // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n out: {\r\n\r\n // Get the number of digits of the first element of xc.\r\n for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n i = sd - d;\r\n\r\n // If the rounding digit is in the first element of xc...\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n n = xc[ni = 0];\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = n / pows10[d - j - 1] % 10 | 0;\r\n } else {\r\n ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n if (ni >= xc.length) {\r\n\r\n if (r) {\r\n\r\n // Needed by sqrt.\r\n for (; xc.length <= ni; xc.push(0));\r\n n = rd = 0;\r\n d = 1;\r\n i %= LOG_BASE;\r\n j = i - LOG_BASE + 1;\r\n } else {\r\n break out;\r\n }\r\n } else {\r\n n = k = xc[ni];\r\n\r\n // Get the number of digits of n.\r\n for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n // Get the index of rd within n.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within n, adjusted for leading zeros.\r\n // The number of leading zeros of n is given by LOG_BASE - d.\r\n j = i - LOG_BASE + d;\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n }\r\n }\r\n\r\n r = r || sd < 0 ||\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n // The expression n % pows10[d - j - 1] returns all digits of n to the right\r\n // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n r = rm < 4\r\n ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n // Check whether the digit to the left of the rounding digit is odd.\r\n ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 || !xc[0]) {\r\n xc.length = 0;\r\n\r\n if (r) {\r\n\r\n // Convert sd to decimal places.\r\n sd -= x.e + 1;\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n x.e = -sd || 0;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n // Remove excess digits.\r\n if (i == 0) {\r\n xc.length = ni;\r\n k = 1;\r\n ni--;\r\n } else {\r\n xc.length = ni + 1;\r\n k = pows10[LOG_BASE - i];\r\n\r\n // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n // j > 0 means i > number of leading zeros of n.\r\n xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n }\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n for (; ;) {\r\n\r\n // If the digit to be rounded up is in the first element of xc...\r\n if (ni == 0) {\r\n\r\n // i will be the length of xc[0] before k is added.\r\n for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n j = xc[0] += k;\r\n for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n // if i != k the length has increased.\r\n if (i != k) {\r\n x.e++;\r\n if (xc[0] == BASE) xc[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xc[ni] += k;\r\n if (xc[ni] != BASE) break;\r\n xc[ni--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xc.length; xc[--i] === 0; xc.pop());\r\n }\r\n\r\n // Overflow? Infinity.\r\n if (x.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n\r\n // Underflow? Zero.\r\n } else if (x.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function valueOf(n) {\r\n var str,\r\n e = n.e;\r\n\r\n if (e === null) return n.toString();\r\n\r\n str = coeffToString(n.c);\r\n\r\n str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n ? toExponential(str, e)\r\n : toFixedPoint(str, e, '0');\r\n\r\n return n.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n */\r\n P.absoluteValue = P.abs = function () {\r\n var x = new BigNumber(this);\r\n if (x.s < 0) x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return\r\n * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * 0 if they have the same value,\r\n * or null if the value of either is NaN.\r\n */\r\n P.comparedTo = function (y, b) {\r\n return compare(this, new BigNumber(y, b));\r\n };\r\n\r\n\r\n /*\r\n * If dp is undefined or null or true or false, return the number of decimal places of the\r\n * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n *\r\n * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n *\r\n * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.decimalPlaces = P.dp = function (dp, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), dp + x.e + 1, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last number.\r\n if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n if (n < 0) n = 0;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * n / 0 = I\r\n * n / N = N\r\n * n / I = 0\r\n * 0 / n = 0\r\n * 0 / 0 = N\r\n * 0 / N = N\r\n * 0 / I = 0\r\n * N / n = N\r\n * N / 0 = N\r\n * N / N = N\r\n * N / I = N\r\n * I / n = I\r\n * I / 0 = I\r\n * I / N = N\r\n * I / I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n */\r\n P.dividedBy = P.div = function (y, b) {\r\n return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n * BigNumber by the value of BigNumber(y, b).\r\n */\r\n P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n return div(this, new BigNumber(y, b), 0, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n *\r\n * If m is present, return the result modulo m.\r\n * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n *\r\n * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n *\r\n * n {number|string|BigNumber} The exponent. An integer.\r\n * [m] {number|string|BigNumber} The modulus.\r\n *\r\n * '[BigNumber Error] Exponent not an integer: {n}'\r\n */\r\n P.exponentiatedBy = P.pow = function (n, m) {\r\n var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n x = this;\r\n\r\n n = new BigNumber(n);\r\n\r\n // Allow NaN and ±Infinity, but not other non-integers.\r\n if (n.c && !n.isInteger()) {\r\n throw Error\r\n (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n }\r\n\r\n if (m != null) m = new BigNumber(m);\r\n\r\n // Exponent of MAX_SAFE_INTEGER is 15.\r\n nIsBig = n.e > 14;\r\n\r\n // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n // The sign of the result of pow when x is negative depends on the evenness of n.\r\n // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n return m ? y.mod(m) : y;\r\n }\r\n\r\n nIsNeg = n.s < 0;\r\n\r\n if (m) {\r\n\r\n // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n if (isModExp) x = x.mod(m);\r\n\r\n // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n // [1, 240000000]\r\n ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n // [80000000000000] [99999750000000]\r\n : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n // If x is negative and n is odd, k = -0, else k = 0.\r\n k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n // If x >= 1, k = ±Infinity.\r\n if (x.e > -1) k = 1 / k;\r\n\r\n // If n is negative return ±0, else return ±Infinity.\r\n return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n } else if (POW_PRECISION) {\r\n\r\n // Truncating each coefficient array to a length of k after each multiplication\r\n // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n // i.e. there will be a minimum of 28 guard digits retained.\r\n k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n }\r\n\r\n if (nIsBig) {\r\n half = new BigNumber(0.5);\r\n if (nIsNeg) n.s = 1;\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = Math.abs(+valueOf(n));\r\n nIsOdd = i % 2;\r\n }\r\n\r\n y = new BigNumber(ONE);\r\n\r\n // Performs 54 loop iterations for n of 9007199254740991.\r\n for (; ;) {\r\n\r\n if (nIsOdd) {\r\n y = y.times(x);\r\n if (!y.c) break;\r\n\r\n if (k) {\r\n if (y.c.length > k) y.c.length = k;\r\n } else if (isModExp) {\r\n y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (i) {\r\n i = mathfloor(i / 2);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n } else {\r\n n = n.times(half);\r\n round(n, n.e + 1, 1);\r\n\r\n if (n.e > 14) {\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = +valueOf(n);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n }\r\n }\r\n\r\n x = x.times(x);\r\n\r\n if (k) {\r\n if (x.c && x.c.length > k) x.c.length = k;\r\n } else if (isModExp) {\r\n x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (isModExp) return y;\r\n if (nIsNeg) y = ONE.div(y);\r\n\r\n return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n *\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n */\r\n P.integerValue = function (rm) {\r\n var n = new BigNumber(this);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n return round(n, n.e + 1, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isEqualTo = P.eq = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n */\r\n P.isFinite = function () {\r\n return !!this.c;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isGreaterThan = P.gt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is greater than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n */\r\n P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n */\r\n P.isInteger = function () {\r\n return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isLessThan = P.lt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is less than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n */\r\n P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n */\r\n P.isNaN = function () {\r\n return !this.s;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is negative, otherwise return false.\r\n */\r\n P.isNegative = function () {\r\n return this.s < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is positive, otherwise return false.\r\n */\r\n P.isPositive = function () {\r\n return this.s > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n */\r\n P.isZero = function () {\r\n return !!this.c && this.c[0] == 0;\r\n };\r\n\r\n\r\n /*\r\n * n - 0 = n\r\n * n - N = N\r\n * n - I = -I\r\n * 0 - n = -n\r\n * 0 - 0 = 0\r\n * 0 - N = N\r\n * 0 - I = -I\r\n * N - n = N\r\n * N - 0 = N\r\n * N - N = N\r\n * N - I = N\r\n * I - n = I\r\n * I - 0 = I\r\n * I - N = N\r\n * I - I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n * BigNumber(y, b).\r\n */\r\n P.minus = function (y, b) {\r\n var i, j, t, xLTy,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a || !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe || !ye) {\r\n\r\n // Either Infinity?\r\n if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n ROUNDING_MODE == 3 ? -0 : 0);\r\n }\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Determine which is the bigger number.\r\n if (a = xe - ye) {\r\n\r\n if (xLTy = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n\r\n // Prepend zeros to equalise exponents.\r\n for (b = a; b--; t.push(0));\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n\r\n if (xc[b] != yc[b]) {\r\n xLTy = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n b = (j = yc.length) - (i = xc.length);\r\n\r\n // Append zeros to xc if shorter.\r\n // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n if (b > 0) for (; b--; xc[i++] = 0);\r\n b = BASE - 1;\r\n\r\n // Subtract yc from xc.\r\n for (; j > a;) {\r\n\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i]; xc[i] = b);\r\n --xc[i];\r\n xc[j] += BASE;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n // Zero?\r\n if (!xc[0]) {\r\n\r\n // Following IEEE 754 (2008) 6.3,\r\n // n - n = +0 but n - n = -0 when rounding towards -Infinity.\r\n y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n // for finite x and y.\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /*\r\n * n % 0 = N\r\n * n % N = N\r\n * n % I = n\r\n * 0 % n = 0\r\n * -0 % n = -0\r\n * 0 % 0 = N\r\n * 0 % N = N\r\n * 0 % I = 0\r\n * N % n = N\r\n * N % 0 = N\r\n * N % N = N\r\n * N % I = N\r\n * I % n = N\r\n * I % 0 = N\r\n * I % N = N\r\n * I % I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n */\r\n P.modulo = P.mod = function (y, b) {\r\n var q, s,\r\n x = this;\r\n\r\n y = new BigNumber(y, b);\r\n\r\n // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n if (!x.c || !y.s || y.c && !y.c[0]) {\r\n return new BigNumber(NaN);\r\n\r\n // Return x if y is Infinity or x is zero.\r\n } else if (!y.c || x.c && !x.c[0]) {\r\n return new BigNumber(x);\r\n }\r\n\r\n if (MODULO_MODE == 9) {\r\n\r\n // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n // r = x - qy where 0 <= r < abs(y)\r\n s = y.s;\r\n y.s = 1;\r\n q = div(x, y, 0, 3);\r\n y.s = s;\r\n q.s *= s;\r\n } else {\r\n q = div(x, y, 0, MODULO_MODE);\r\n }\r\n\r\n y = x.minus(q.times(y));\r\n\r\n // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * n * 0 = 0\r\n * n * N = N\r\n * n * I = I\r\n * 0 * n = 0\r\n * 0 * 0 = 0\r\n * 0 * N = N\r\n * 0 * I = N\r\n * N * n = N\r\n * N * 0 = N\r\n * N * N = N\r\n * N * I = N\r\n * I * n = I\r\n * I * 0 = N\r\n * I * N = N\r\n * I * I = I\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n * of BigNumber(y, b).\r\n */\r\n P.multipliedBy = P.times = function (y, b) {\r\n var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n base, sqrtBase,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new BigNumber(y, b)).c;\r\n\r\n // Either NaN, ±Infinity or ±0?\r\n if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n y.c = y.e = y.s = null;\r\n } else {\r\n y.s *= x.s;\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n if (!xc || !yc) {\r\n y.c = y.e = null;\r\n\r\n // Return ±0 if either is ±0.\r\n } else {\r\n y.c = [0];\r\n y.e = 0;\r\n }\r\n }\r\n\r\n return y;\r\n }\r\n\r\n e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n y.s *= x.s;\r\n xcL = xc.length;\r\n ycL = yc.length;\r\n\r\n // Ensure xc points to longer array and xcL to its length.\r\n if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n // Initialise the result array with zeros.\r\n for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n base = BASE;\r\n sqrtBase = SQRT_BASE;\r\n\r\n for (i = ycL; --i >= 0;) {\r\n c = 0;\r\n ylo = yc[i] % sqrtBase;\r\n yhi = yc[i] / sqrtBase | 0;\r\n\r\n for (k = xcL, j = i + k; j > i;) {\r\n xlo = xc[--k] % sqrtBase;\r\n xhi = xc[k] / sqrtBase | 0;\r\n m = yhi * xlo + xhi * ylo;\r\n xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n zc[j--] = xlo % base;\r\n }\r\n\r\n zc[j] = c;\r\n }\r\n\r\n if (c) {\r\n ++e;\r\n } else {\r\n zc.splice(0, 1);\r\n }\r\n\r\n return normalise(y, zc, e);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n * i.e. multiplied by -1.\r\n */\r\n P.negated = function () {\r\n var x = new BigNumber(this);\r\n x.s = -x.s || null;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * n + 0 = n\r\n * n + N = N\r\n * n + I = I\r\n * 0 + n = n\r\n * 0 + 0 = 0\r\n * 0 + N = N\r\n * 0 + I = I\r\n * N + n = N\r\n * N + 0 = N\r\n * N + N = N\r\n * N + I = N\r\n * I + n = I\r\n * I + 0 = I\r\n * I + N = N\r\n * I + I = I\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n * BigNumber(y, b).\r\n */\r\n P.plus = function (y, b) {\r\n var t,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a || !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe || !ye) {\r\n\r\n // Return ±Infinity if either ±Infinity.\r\n if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n // Either zero?\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n if (a = xe - ye) {\r\n if (a > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n a = -a;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; a--; t.push(0));\r\n t.reverse();\r\n }\r\n\r\n a = xc.length;\r\n b = yc.length;\r\n\r\n // Point xc to the longer array, and b to the shorter length.\r\n if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n for (a = 0; b;) {\r\n a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n }\r\n\r\n if (a) {\r\n xc = [a].concat(xc);\r\n ++ye;\r\n }\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n // ye = MAX_EXP + 1 possible\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /*\r\n * If sd is undefined or null or true or false, return the number of significant digits of\r\n * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n * If sd is true include integer-part trailing zeros in the count.\r\n *\r\n * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n *\r\n * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n * boolean: whether to count integer-part trailing zeros: true or false.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n */\r\n P.precision = P.sd = function (sd, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (sd != null && sd !== !!sd) {\r\n intCheck(sd, 1, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), sd, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n v = c.length - 1;\r\n n = v * LOG_BASE + 1;\r\n\r\n if (v = c[v]) {\r\n\r\n // Subtract the number of trailing zeros of the last element.\r\n for (; v % 10 == 0; v /= 10, n--);\r\n\r\n // Add the number of digits of the first element.\r\n for (v = c[0]; v >= 10; v /= 10, n++);\r\n }\r\n\r\n if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n *\r\n * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n */\r\n P.shiftedBy = function (k) {\r\n intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n return this.times('1e' + k);\r\n };\r\n\r\n\r\n /*\r\n * sqrt(-n) = N\r\n * sqrt(N) = N\r\n * sqrt(-I) = N\r\n * sqrt(I) = I\r\n * sqrt(0) = 0\r\n * sqrt(-0) = -0\r\n *\r\n * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n */\r\n P.squareRoot = P.sqrt = function () {\r\n var m, n, r, rep, t,\r\n x = this,\r\n c = x.c,\r\n s = x.s,\r\n e = x.e,\r\n dp = DECIMAL_PLACES + 4,\r\n half = new BigNumber('0.5');\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 || !c || !c[0]) {\r\n return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n }\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+valueOf(x));\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n if (s == 0 || s == 1 / 0) {\r\n n = coeffToString(c);\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(+n);\r\n e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new BigNumber(n);\r\n } else {\r\n r = new BigNumber(s + '');\r\n }\r\n\r\n // Check for zero.\r\n // r could be zero if MIN_EXP is changed after the this value was created.\r\n // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n // coeffToString to throw.\r\n if (r.c[0]) {\r\n e = r.e;\r\n s = e + dp;\r\n if (s < 3) s = 0;\r\n\r\n // Newton-Raphson iteration.\r\n for (; ;) {\r\n t = r;\r\n r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n // The exponent of r may here be one less than the final result exponent,\r\n // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n // are indexed correctly.\r\n if (r.e < e) --s;\r\n n = n.slice(s - 3, s + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n // iteration.\r\n if (n == '9999' || !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the\r\n // exact result as the nines may infinitely repeat.\r\n if (!rep) {\r\n round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n dp += 4;\r\n s += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n // result. If not, then there are further digits and m will be truthy.\r\n if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n m = !r.times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in exponential notation and\r\n * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.toExponential = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp++;\r\n }\r\n return format(this, dp, rm, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n *\r\n * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.toFixed = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp = dp + this.e + 1;\r\n }\r\n return format(this, dp, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n * of the format or FORMAT object (see BigNumber.set).\r\n *\r\n * The formatting object may contain some or all of the properties shown below.\r\n *\r\n * FORMAT = {\r\n * prefix: '',\r\n * groupSize: 3,\r\n * secondaryGroupSize: 0,\r\n * groupSeparator: ',',\r\n * decimalSeparator: '.',\r\n * fractionGroupSize: 0,\r\n * fractionGroupSeparator: '\\xA0', // non-breaking space\r\n * suffix: ''\r\n * };\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n * [format] {object} Formatting options. See FORMAT pbject above.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n * '[BigNumber Error] Argument not an object: {format}'\r\n */\r\n P.toFormat = function (dp, rm, format) {\r\n var str,\r\n x = this;\r\n\r\n if (format == null) {\r\n if (dp != null && rm && typeof rm == 'object') {\r\n format = rm;\r\n rm = null;\r\n } else if (dp && typeof dp == 'object') {\r\n format = dp;\r\n dp = rm = null;\r\n } else {\r\n format = FORMAT;\r\n }\r\n } else if (typeof format != 'object') {\r\n throw Error\r\n (bignumberError + 'Argument not an object: ' + format);\r\n }\r\n\r\n str = x.toFixed(dp, rm);\r\n\r\n if (x.c) {\r\n var i,\r\n arr = str.split('.'),\r\n g1 = +format.groupSize,\r\n g2 = +format.secondaryGroupSize,\r\n groupSeparator = format.groupSeparator || '',\r\n intPart = arr[0],\r\n fractionPart = arr[1],\r\n isNeg = x.s < 0,\r\n intDigits = isNeg ? intPart.slice(1) : intPart,\r\n len = intDigits.length;\r\n\r\n if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n if (g1 > 0 && len > 0) {\r\n i = len % g1 || g1;\r\n intPart = intDigits.substr(0, i);\r\n for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n if (isNeg) intPart = '-' + intPart;\r\n }\r\n\r\n str = fractionPart\r\n ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n '$&' + (format.fractionGroupSeparator || ''))\r\n : fractionPart)\r\n : intPart;\r\n }\r\n\r\n return (format.prefix || '') + str + (format.suffix || '');\r\n };\r\n\r\n\r\n /*\r\n * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n * fraction with an integer numerator and an integer denominator.\r\n * The denominator will be a positive non-zero value less than or equal to the specified\r\n * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n * the lowest value necessary to represent the number exactly.\r\n *\r\n * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n *\r\n * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n */\r\n P.toFraction = function (md) {\r\n var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n x = this,\r\n xc = x.c;\r\n\r\n if (md != null) {\r\n n = new BigNumber(md);\r\n\r\n // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n throw Error\r\n (bignumberError + 'Argument ' +\r\n (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n }\r\n }\r\n\r\n if (!xc) return new BigNumber(x);\r\n\r\n d = new BigNumber(ONE);\r\n n1 = d0 = new BigNumber(ONE);\r\n d1 = n0 = new BigNumber(ONE);\r\n s = coeffToString(xc);\r\n\r\n // Determine initial denominator.\r\n // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n e = d.e = s.length - x.e - 1;\r\n d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n exp = MAX_EXP;\r\n MAX_EXP = 1 / 0;\r\n n = new BigNumber(s);\r\n\r\n // n0 = d1 = 0\r\n n0.c[0] = 0;\r\n\r\n for (; ;) {\r\n q = div(n, d, 0, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.comparedTo(md) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n n1 = n0.plus(q.times(d2 = n1));\r\n n0 = d2;\r\n d = n.minus(q.times(d2 = d));\r\n n = d2;\r\n }\r\n\r\n d2 = div(md.minus(d0), d1, 0, 1);\r\n n0 = n0.plus(d2.times(n1));\r\n d0 = d0.plus(d2.times(d1));\r\n n0.s = n1.s = x.s;\r\n e = e * 2;\r\n\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n MAX_EXP = exp;\r\n\r\n return r;\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this BigNumber converted to a number primitive.\r\n */\r\n P.toNumber = function () {\r\n return +valueOf(this);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n * necessary to represent the integer part of the value in fixed-point notation, then use\r\n * exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n */\r\n P.toPrecision = function (sd, rm) {\r\n if (sd != null) intCheck(sd, 1, MAX);\r\n return format(this, sd, rm, 2);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n * TO_EXP_NEG, return exponential notation.\r\n *\r\n * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n *\r\n * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n */\r\n P.toString = function (b) {\r\n var str,\r\n n = this,\r\n s = n.s,\r\n e = n.e;\r\n\r\n // Infinity or NaN?\r\n if (e === null) {\r\n if (s) {\r\n str = 'Infinity';\r\n if (s < 0) str = '-' + str;\r\n } else {\r\n str = 'NaN';\r\n }\r\n } else {\r\n if (b == null) {\r\n str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n ? toExponential(coeffToString(n.c), e)\r\n : toFixedPoint(coeffToString(n.c), e, '0');\r\n } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n } else {\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n }\r\n\r\n if (s < 0 && n.c[0]) str = '-' + str;\r\n }\r\n\r\n return str;\r\n };\r\n\r\n\r\n /*\r\n * Return as toString, but do not accept a base argument, and include the minus sign for\r\n * negative zero.\r\n */\r\n P.valueOf = P.toJSON = function () {\r\n return valueOf(this);\r\n };\r\n\r\n\r\n P._isBigNumber = true;\r\n\r\n P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n // Node.js v10.12.0+\r\n P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n if (configObject != null) BigNumber.set(configObject);\r\n\r\n return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n var i = n | 0;\r\n return n > 0 || n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n var s, z,\r\n i = 1,\r\n j = a.length,\r\n r = a[0] + '';\r\n\r\n for (; i < j;) {\r\n s = a[i++] + '';\r\n z = LOG_BASE - s.length;\r\n for (; z--; s = '0' + s);\r\n r += s;\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n return r.slice(0, j + 1 || 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n var a, b,\r\n xc = x.c,\r\n yc = y.c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either NaN?\r\n if (!i || !j) return null;\r\n\r\n a = xc && !xc[0];\r\n b = yc && !yc[0];\r\n\r\n // Either zero?\r\n if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n a = i < 0;\r\n b = k == l;\r\n\r\n // Either Infinity?\r\n if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n // Compare exponents.\r\n if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/*\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n */\r\nfunction intCheck(n, min, max, name) {\r\n if (n < min || n > max || n !== mathfloor(n)) {\r\n throw Error\r\n (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n : ' not a primitive number: ') + String(n));\r\n }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n var k = n.c.length - 1;\r\n return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n var len, zs;\r\n\r\n // Negative exponent?\r\n if (e < 0) {\r\n\r\n // Prepend zeros.\r\n for (zs = z + '.'; ++e; zs += z);\r\n str = zs + str;\r\n\r\n // Positive exponent\r\n } else {\r\n len = str.length;\r\n\r\n // Append zeros.\r\n if (++e > len) {\r\n for (zs = z, e -= len; --e; zs += z);\r\n str += zs;\r\n } else if (e < len) {\r\n str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","/**\n * @file formatters.js\n * @author Marek Kotewicz \n * @author Fabian Vogelsteller \n * @date 2015\n */\nimport descriptor from '@aelfqueen/protobufjs/ext/descriptor';\nimport {\n base58\n} from './utils';\n\nexport const inputAddressFormatter = address => {\n let realAddress = address;\n if (address && address.value) {\n realAddress = address.value;\n }\n if (realAddress.indexOf('_') > 0) {\n const parts = realAddress.split('_');\n const list = parts.filter(v => {\n try {\n base58.decode(v, 'hex');\n return true;\n } catch (e) {\n return false;\n }\n });\n if (list.length === 0) {\n throw new Error('Invalid address');\n }\n [realAddress] = list;\n }\n try {\n base58.decode(realAddress, 'hex');\n } catch (e) {\n throw new Error('Invalid address');\n }\n return realAddress;\n};\n\n/**\n * @param {String} result base64 representation of serialized FileDescriptorSet\n * @returns {FileDescriptorSet} decoded FileDescriptorSet message\n */\nexport const outputFileDescriptorSetFormatter = result => {\n const buffer = Buffer.from(result, 'base64');\n return descriptor.FileDescriptorSet.decode(buffer);\n};\n","/**\n * @file AElf-sdk constants\n * @author atom-yang\n */\nimport {\n inputAddressFormatter,\n outputFileDescriptorSetFormatter,\n} from '../util/formatters';\n\n/**\n * unsigned 256 int\n */\nexport const UNSIGNED_256_INT =\n 'ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff';\n\nexport const CHAIN_METHODS = {\n getChainStatus: {\n name: 'getChainStatus',\n call: 'blockChain/chainStatus',\n method: 'GET',\n params: [],\n },\n getChainState: {\n name: 'getChainState',\n call: 'blockChain/blockState',\n method: 'GET',\n params: ['blockHash'],\n },\n getContractFileDescriptorSet: {\n name: 'getContractFileDescriptorSet',\n call: 'blockChain/contractFileDescriptorSet',\n method: 'GET',\n params: ['address'],\n inputFormatter: [inputAddressFormatter],\n outputFormatter: outputFileDescriptorSetFormatter,\n },\n getBlockHeight: {\n name: 'getBlockHeight',\n call: 'blockChain/blockHeight',\n method: 'GET',\n params: [],\n inputFormatter: [],\n },\n getBlock: {\n name: 'getBlock',\n call: 'blockChain/block',\n method: 'GET',\n params: ['blockHash', 'includeTransactions'],\n },\n getBlockByHeight: {\n name: 'getBlockByHeight',\n call: 'blockChain/blockByHeight',\n method: 'GET',\n params: ['blockHeight', 'includeTransactions'],\n },\n getTxResult: {\n name: 'getTxResult',\n call: 'blockChain/transactionResult',\n method: 'GET',\n params: ['transactionId'],\n inputFormatter: [],\n },\n getTxResults: {\n name: 'getTxResults',\n call: 'blockChain/transactionResults',\n method: 'GET',\n params: ['blockHash', 'offset', 'limit'],\n },\n getMerklePathByTxId: {\n name: 'getMerklePathByTxId',\n call: 'blockChain/merklePathByTransactionId',\n method: 'GET',\n params: ['transactionId'],\n },\n getTransactionPoolStatus: {\n name: 'getTransactionPoolStatus',\n call: 'blockChain/transactionPoolStatus',\n method: 'GET',\n params: [],\n },\n sendTransaction: {\n name: 'sendTransaction',\n call: 'blockChain/sendTransaction',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n sendTransactions: {\n name: 'sendTransactions',\n call: 'blockChain/sendTransactions',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n calculateTransactionFee: {\n name: 'calculateTransactionFee',\n call: 'blockChain/calculateTransactionFee',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n callReadOnly: {\n name: 'callReadOnly',\n call: 'blockChain/executeTransaction',\n method: 'POST',\n params: ['rawTransaction'],\n inputFormatter: [],\n },\n getPeers: {\n name: 'getPeers',\n call: 'net/peers',\n method: 'GET',\n params: ['withMetrics'],\n },\n addPeer: {\n name: 'addPeer',\n call: 'net/peer',\n method: 'POST',\n params: ['address'],\n inputFormatter: [],\n },\n removePeer: {\n name: 'removePeer',\n call: 'net/peer',\n method: 'DELETE',\n params: ['address'],\n inputFormatter: [],\n },\n networkInfo: {\n name: 'networkInfo',\n call: 'net/networkInfo',\n method: 'GET',\n params: [],\n inputFormatter: [],\n },\n};\n\n/**\n * unit map\n */\nexport const UNIT_MAP = {\n noether: '0',\n wei: '1',\n kwei: '1000',\n Kwei: '1000',\n babbage: '1000',\n femtoether: '1000',\n mwei: '1000000',\n Mwei: '1000000',\n lovelace: '1000000',\n picoether: '1000000',\n gwei: '1000000000',\n Gwei: '1000000000',\n shannon: '1000000000',\n nanoether: '1000000000',\n nano: '1000000000',\n szabo: '1000000000000',\n microether: '1000000000000',\n micro: '1000000000000',\n finney: '1000000000000000',\n milliether: '1000000000000000',\n milli: '1000000000000000',\n ether: '1000000000000000000',\n kether: '1000000000000000000000',\n grand: '1000000000000000000000',\n mether: '1000000000000000000000000',\n gether: '1000000000000000000000000000',\n tether: '1000000000000000000000000000000',\n};\n\nexport const TO_STRING_UTF8_ENCODING = 'utf8';\n\nexport const DEFAULT_TO_STRING_ENCODING = TO_STRING_UTF8_ENCODING;\n\nexport const CONGIG = {\n AELF_POLLING_TIMEOUT: 1000 / 2,\n chainId: 'AELF',\n contractZeroAddress: 'AELF',\n contractZeroAbi: 'AELF',\n contractZero: 'AELF',\n defaultAccount: '0x04bb9c6c297ea90b1bc3e6af2c87d416583e',\n};\n\nexport const KEY_STORE_ERRORS = {\n INVALID_PASSWORD: {\n error: 200001,\n errorMessage: 'Password Error',\n },\n NOT_AELF_KEY_STORE: {\n error: 200002,\n errorMessage: 'Not a aelf key store',\n },\n WRONG_VERSION: {\n error: 200004,\n errorMessage: 'The version is incorrect',\n },\n WRONG_KEY_STORE_VERSION: {\n error: 200005,\n errorMessage: 'Not a V1 key store',\n },\n};\n","/**\n * @file transform protobuf\n * @author atom-yang\n */\nimport { base58, decodeAddressRep } from './utils';\nimport { inputAddressFormatter } from './formatters';\n\nconst isWrappedBytes = (resolvedType, name) => {\n if (!resolvedType.name || resolvedType.name !== name) {\n return false;\n }\n if (!resolvedType.fieldsArray || resolvedType.fieldsArray.length !== 1) {\n return false;\n }\n return resolvedType.fieldsArray[0].type === 'bytes';\n};\n\nconst isAddress = resolvedType => isWrappedBytes(resolvedType, 'Address');\n\nconst isHash = resolvedType => isWrappedBytes(resolvedType, 'Hash');\n\nexport function transform(inputType, origin, transformers = []) {\n const fieldsLength = (inputType.fieldsArray || []).length;\n let result = origin;\n if (fieldsLength === 0) {\n return origin;\n }\n // eslint-disable-next-line no-restricted-syntax\n for (const { filter, transformer } of transformers) {\n if (filter(inputType) && origin) {\n return transformer(origin);\n }\n }\n // eslint-disable-next-line no-restricted-syntax\n Object.keys(inputType.fields).forEach(field => {\n const {\n rule,\n name,\n resolvedType\n } = inputType.fields[field];\n if (resolvedType) {\n if (rule && rule === 'repeated') {\n let value = origin[name];\n if (value && Array.isArray(value)) {\n value = value\n .filter(v => v !== null && v !== undefined)\n .map(item => transform(resolvedType, item, transformers));\n }\n result = {\n ...result,\n [name]: value\n };\n } else {\n result = {\n ...result,\n [name]: origin[name] !== null && origin[name] !== undefined\n ? transform(resolvedType, origin[name], transformers) : origin[name]\n };\n }\n }\n });\n return result;\n}\n\nexport function transformMapToArray(inputType, origin) {\n const fieldsLength = inputType.fieldsArray ? inputType.fieldsArray.length : 0;\n let result = origin;\n if (!origin) {\n return origin;\n }\n if (fieldsLength === 0 || (fieldsLength === 1 && !inputType.fieldsArray[0].resolvedType)) {\n return origin;\n }\n // Params which satisfy address or hash format satisfy above first.\n // if (isAddress(inputType) || isHash(inputType)) {\n // return origin;\n // }\n const {\n fields,\n options = {}\n } = inputType;\n if (fieldsLength === 2 && fields.value && fields.key && options.map_entry === true) {\n return Object.keys(origin).map(key => ({ key, value: origin[key] }));\n }\n // eslint-disable-next-line no-restricted-syntax\n Object.keys(inputType.fields).forEach(field => {\n const {\n name,\n resolvedType\n } = inputType.fields[field];\n if (resolvedType) {\n if (origin[name] && Array.isArray(origin[name])) {\n let value = origin[name];\n value = value.map(item => transformMapToArray(resolvedType, item));\n result = {\n ...result,\n [name]: value\n };\n } else {\n result = {\n ...result,\n [name]: transformMapToArray(resolvedType, origin[name])\n };\n }\n }\n });\n return result;\n}\n\nexport function transformArrayToMap(inputType, origin) {\n const fieldsLength = (inputType.fieldsArray || []).length;\n let result = origin;\n if (\n fieldsLength === 0\n || (fieldsLength === 1 && !inputType.fieldsArray[0].resolvedType)\n ) {\n return origin;\n }\n // Params which satisfy address or hash format satisfy above first.\n // if (isAddress(inputType) || isHash(inputType)) {\n // return origin;\n // }\n const { fields, options = {} } = inputType;\n if (\n fieldsLength === 2\n && fields.value\n && fields.key\n && options.map_entry === true\n ) {\n return origin.reduce(\n (acc, v) => ({\n ...acc,\n [v.key]: v.value,\n }),\n {}\n );\n }\n // eslint-disable-next-line no-restricted-syntax\n Object.keys(fields).forEach(field => {\n const { name, resolvedType } = fields[field];\n if (resolvedType && origin !== null && origin !== undefined) {\n if (origin[name] && Array.isArray(origin[name])) {\n const {\n fieldsArray = [],\n fields: resolvedFields,\n options: resolvedOptions = {},\n } = resolvedType;\n // eslint-disable-next-line max-len\n if (\n fieldsArray.length === 2\n && resolvedFields.value\n && resolvedFields.key\n && resolvedOptions.map_entry === true\n ) {\n result = {\n ...result,\n [name]: origin[name].reduce(\n (acc, v) => ({\n ...acc,\n [v.key]: v.value,\n }),\n {}\n ),\n };\n } else {\n let value = origin[name];\n value = value.map(item => transformArrayToMap(resolvedType, item));\n result = {\n ...result,\n [name]: value,\n };\n }\n } else {\n result = {\n ...result,\n [name]: transformArrayToMap(resolvedType, origin[name]),\n };\n }\n }\n });\n return result;\n}\n\nexport const INPUT_TRANSFORMERS = [\n {\n filter: isAddress,\n transformer: origin => {\n let result = origin;\n if (typeof origin === 'string') {\n result = {\n value: Buffer.from(decodeAddressRep(inputAddressFormatter(origin)), 'hex')\n };\n }\n if (Array.isArray(origin)) {\n result = origin.map(h => ({\n value: Buffer.from(decodeAddressRep(inputAddressFormatter(h)), 'hex')\n }));\n }\n return result;\n }\n },\n {\n filter: isHash,\n transformer: origin => {\n let result = origin;\n if (typeof origin === 'string') {\n result = {\n value: Buffer.from(origin.replace('0x', ''), 'hex')\n };\n }\n if (Array.isArray(origin)) {\n result = origin.map(h => ({\n value: Buffer.from(h.replace('0x', ''), 'hex')\n }));\n }\n return result;\n }\n },\n];\n\nexport function encodeAddress(str) {\n const buf = Buffer.from(str, 'base64');\n return base58.encode(buf);\n}\n\nexport const OUTPUT_TRANSFORMERS = [\n {\n filter: isAddress,\n transformer: origin => {\n let result = origin;\n if (Array.isArray(result)) {\n result = result.map(h => encodeAddress(h.value));\n } else if (typeof result !== 'string') {\n result = encodeAddress(result.value);\n }\n return result;\n }\n },\n {\n filter: isHash,\n transformer: origin => {\n let result = origin;\n if (Array.isArray(result)) {\n result = result.map(h => Buffer.from(h.value, 'base64').toString('hex'));\n } else if (typeof result !== 'string') {\n result = Buffer.from(result.value, 'base64').toString('hex');\n }\n return result;\n }\n },\n];\n","/**\n * @file common utils\n * @author atom-yang\n */\n\nimport BigNumber from 'bignumber.js';\nimport bs58 from 'bs58';\nimport { UNIT_MAP, UNSIGNED_256_INT } from '../common/constants';\nimport { Transaction } from './proto';\nimport {\n OUTPUT_TRANSFORMERS,\n encodeAddress,\n transform,\n transformArrayToMap\n} from './transform';\nimport sha256 from './sha256';\n\n\nexport const base58 = {\n encode(data, encoding = 'hex') {\n let result = data;\n if (typeof data === 'string') {\n result = Buffer.from(data, encoding);\n }\n if (!(result instanceof Buffer)) {\n throw new TypeError('\"data\" argument must be an Array of Buffers');\n }\n let hash = result;\n hash = Buffer.from(sha256(result), 'hex');\n hash = Buffer.from(sha256(hash), 'hex');\n hash = Buffer.from(result.toString('hex') + hash.slice(0, 4).toString('hex'), 'hex');\n return bs58.encode(hash);\n },\n decode(str, encoding) {\n const buffer = Buffer.from(bs58.decode(str));\n let data = buffer.slice(0, -4);\n let hash = data;\n hash = Buffer.from(sha256(hash), 'hex');\n hash = Buffer.from(sha256(hash), 'hex');\n buffer.slice(-4).forEach((check, index) => {\n if (check !== hash[index]) {\n throw new Error('Invalid checksum');\n }\n });\n if (encoding) {\n data = data.toString(encoding);\n }\n return data;\n }\n};\n\nexport const chainIdConvertor = {\n // chainIdToBase58 (int32 chainId)\n chainIdToBase58(chainId) {\n const bufferTemp = Buffer.alloc(4);\n bufferTemp.writeInt32LE(`0x${chainId.toString('16')}`, 0);\n const bytes = Buffer.concat([bufferTemp], 3);\n return bs58.encode(bytes);\n },\n base58ToChainId(base58String) {\n return Buffer.concat([bs58.decode(base58String)], 4).readInt32LE(0);\n }\n};\n\nconst arrayBufferToHex = arrayBuffer => Array.prototype.map.call(\n new Uint8Array(arrayBuffer),\n n => (`0${n.toString(16)}`).slice(-2)\n).join('');\n\nexport const arrayToHex = value => {\n let hex = '';\n if (value instanceof Buffer) {\n hex = value.toString('hex');\n } else {\n // Uint8Array\n hex = arrayBufferToHex(value);\n }\n return hex;\n};\n\n/**\n * Should be called to pad string to expected length\n *\n * @method padLeft\n * @param {String} string to be padded\n * @param {Number} charLen that result string should have\n * @param {String} sign, by default 0\n * @returns {String} right aligned string\n */\nexport const padLeft = (string, charLen, sign) => {\n const length = charLen - string.length + 1;\n return new Array(length < 0 ? 0 : length).join(sign || '0') + string;\n};\n\n/**\n * Should be called to pad string to expected length\n *\n * @method padRight\n * @param {String} string to be padded\n * @param {Number} charLen that result string should have\n * @param {String} sign, by default 0\n * @returns {String} right aligned string\n */\nexport const padRight = (string, charLen, sign) => {\n const length = charLen - string.length + 1;\n return string + (new Array(length < 0 ? 0 : length).join(sign || '0'));\n};\n\n\n/**\n * Returns a hex rep from the encoded address\n *\n * @method decodeAddressRep\n * @param {String} address\n * @return {String}\n */\nexport const decodeAddressRep = address => {\n if (address.indexOf('_') > -1) {\n const parts = address.split('_');\n const b58rep = parts[1];\n return base58.decode(b58rep, 'hex');\n }\n return base58.decode(address, 'hex');\n};\n\n/**\n * Returns a encoded address from the hex rep\n *\n * @method encodeAddressRep\n * @param {String} hex\n * @return {String}\n */\nexport const encodeAddressRep = hex => {\n const buf = Buffer.from(hex.replace('0x', ''), 'hex');\n return base58.encode(buf, 'hex');\n};\n\n/**\n * Returns true if object is BigNumber, otherwise false\n *\n * @method isBigNumber\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isBigNumber = object => object instanceof BigNumber\n || (object && object.constructor && object.constructor.name === 'BigNumber');\n\n/**\n * Returns true if object is string, otherwise false\n *\n * @method isString\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isString = object => typeof object === 'string'\n || (object && object.constructor && object.constructor.name === 'String');\n\n/**\n * Returns true if object is function, otherwise false\n *\n * @method isFunction\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isFunction = object => typeof object === 'function';\n\n/**\n * Returns true if object is Object, otherwise false\n *\n * @method isObject\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isObject = object => object !== null && !(Array.isArray(object)) && typeof object === 'object';\n\n/**\n * Returns true if object is boolean, otherwise false\n *\n * @method isBoolean\n * @param {Object} object\n * @return {Boolean}\n */\nexport const isBoolean = object => typeof object === 'boolean';\n\n/**\n * Returns true if given string is valid json object\n *\n * @method isJson\n * @param {String} str\n * @return {Boolean}\n */\nexport const isJson = str => {\n try {\n return !!JSON.parse(str);\n } catch (e) {\n return false;\n }\n};\n\n/**\n * Takes an input and transforms it into an bignumber\n *\n * @method toBigNumber\n * @param {Number|String|BigNumber} number, a number, string, HEX string or BigNumber\n * @return {BigNumber} BigNumber\n */\nexport const toBigNumber = number => {\n const num = number || 0;\n if (isBigNumber(num)) {\n return num;\n }\n\n if (isString(num) && (num.indexOf('0x') === 0 || num.indexOf('-0x') === 0)) {\n return new BigNumber(num.replace('0x', ''), 16);\n }\n\n return new BigNumber(num.toString(10), 10);\n};\n\n/**\n * Returns value of unit in Wei\n *\n * @method getValueOfUnit\n * @param {String} unit the unit to convert to, default ether\n * @returns {BigNumber} value of the unit (in Wei)\n * @throws error if the unit is not correct:w\n */\nexport const getValueOfUnit = unit => {\n const unitValue = UNIT_MAP[unit ? unit.toLowerCase() : 'ether'];\n if (unitValue === undefined) {\n // eslint-disable-next-line max-len\n throw new Error(`This unit doesn\\'t exists, please use the one of the following units ${JSON.stringify(UNIT_MAP, null, 2)}`);\n }\n return new BigNumber(unitValue, 10);\n};\n\n/**\n * Takes a number of wei and converts it to any other ether unit.\n *\n * Possible units are:\n * SI Short SI Full Effigy Other\n * - kwei femtoether babbage\n * - mwei picoether lovelace\n * - gwei nanoether shannon nano\n * - -- microether szabo micro\n * - -- milliether finney milli\n * - ether -- --\n * - kether -- grand\n * - mether\n * - gether\n * - tether\n *\n * @method fromWei\n * @param {Number|String} number can be a number, number string or a HEX of a decimal\n * @param {String} unit the unit to convert to, default ether\n * @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number\n */\nexport const fromWei = (number, unit) => {\n const returnValue = toBigNumber(number).dividedBy(getValueOfUnit(unit));\n\n return isBigNumber(number) ? returnValue : returnValue.toString(10);\n};\n\n/**\n * Takes a number of a unit and converts it to wei.\n *\n * Possible units are:\n * SI Short SI Full Effigy Other\n * - kwei femtoether babbage\n * - mwei picoether lovelace\n * - gwei nanoether shannon nano\n * - -- microether szabo micro\n * - -- milliether finney milli\n * - ether -- --\n * - kether -- grand\n * - mether\n * - gether\n * - tether\n *\n * @method toWei\n * @param {Number|String|BigNumber} number can be a number, number string or a HEX of a decimal\n * @param {String} unit the unit to convert from, default ether\n * @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number\n */\nexport const toWei = (number, unit) => {\n const returnValue = toBigNumber(number).times(getValueOfUnit(unit));\n\n return isBigNumber(number) ? returnValue : returnValue.toString(10);\n};\n\n/**\n * Takes and input transforms it into bignumber and if it is negative value, into two's complement\n * bignumber.js get rid of round + floor in 6.0 https://github.com/MikeMcl/bignumber.js/issues/139\n * the method lessThan was named isLessThan after 6.0 https://github.com/MikeMcl/bignumber.js/issues/152\n * @method toTwosComplement\n * @param {Number|String|BigNumber} number\n * @return {BigNumber}\n */\nexport const toTwosComplement = number => {\n const bigNumber = toBigNumber(number).integerValue();\n if (bigNumber.isLessThan(0)) {\n return new BigNumber(UNSIGNED_256_INT, 16).plus(bigNumber).plus(1);\n }\n return bigNumber;\n};\n\n\n/**\n * Returns hex\n *\n * @method uint8ArrayToHex\n * @param {Array} uint8Array\n * @return {String}\n */\nexport const uint8ArrayToHex = uint8Array => {\n let string = '';\n uint8Array.forEach(item => {\n let hex = item.toString(16);\n if (hex.length <= 1) {\n hex = `0${hex}`;\n }\n string += hex;\n });\n return string;\n};\n\n/**\n * empty function\n */\nexport const noop = () => {};\n\n/**\n *\n * @param {object} obj The object to modify\n * @param {string} path The path of the property to set\n * @param {*} value The value to set\n * @example\n *\n * const object = { 'a': [{ 'b': { 'c': 3 } }] }\n *\n * set(object, 'test.b.c', 4)\n * console.log(object.test.b.c)\n * // => 4\n */\nexport const setPath = (obj, path, value) => {\n const paths = path.split('.');\n paths.reduce((acc, p, index) => {\n if (index === paths.length - 1) {\n acc[p] = value;\n return acc;\n }\n acc[p] = {};\n return acc[p];\n }, obj);\n};\n\nexport const unpackSpecifiedTypeData = ({ data, dataType, encoding = 'hex' }) => {\n const buffer = Buffer.from(data, encoding);\n const decoded = dataType.decode(buffer);\n const result = dataType.toObject(decoded, {\n enums: String, // enums as string names\n longs: String, // longs as strings (requires long.js)\n bytes: String, // bytes as base64 encoded strings\n defaults: true, // includes default values\n arrays: true, // populates empty arrays (repeated fields) even if defaults=false\n objects: true, // populates empty objects (map fields) even if defaults=false\n oneofs: true // includes virtual oneof fields set to the present field's name\n });\n return result;\n};\n\nexport function deserializeTransaction(rawTx, paramsDataType) {\n const {\n from,\n to,\n params,\n refBlockPrefix,\n signature,\n ...rest\n } = unpackSpecifiedTypeData({\n data: rawTx,\n dataType: Transaction\n });\n let methodParameters = unpackSpecifiedTypeData({\n data: params,\n encoding: 'base64',\n dataType: paramsDataType\n });\n methodParameters = transform(paramsDataType, methodParameters, OUTPUT_TRANSFORMERS);\n methodParameters = transformArrayToMap(paramsDataType, methodParameters);\n\n return {\n from: encodeAddress(from.value),\n to: encodeAddress(to.value),\n params: methodParameters,\n refBlockPrefix: Buffer.from(refBlockPrefix, 'base64').toString('hex'),\n signature: Buffer.from(signature, 'base64').toString('hex'),\n ...rest\n };\n}\n/**\n *\n * @param {String} userName Username\n * @param {String} password Password\n * @return {any} Authorization information\n *\n * const authorization = getAuthorization('test','pass')\n * console.log(authorization)\n * // => Basic dGVzdDpwYXNz\n */\nexport function getAuthorization(userName, password) {\n const base = Buffer.from(`${userName}:${password}`).toString('base64');\n return `Basic ${base}`;\n}\n\n// /**\n// * Converts value to it's hex representation\n// *\n// * @method fromDecimal\n// * @param {String|Number|BigNumber}\n// * @return {String}\n// */\n// export const fromDecimal = value => {\n// const number = toBigNumber(value);\n// const result = number.toString(16);\n//\n// return number.lessThan(0) ? `-0x${result.substr(1)}` : `0x${result}`;\n// };\n//\n// /**\n// * Should be called to get hex representation (prefixed by 0x) of utf8 string\n// *\n// * @method fromUtf8\n// * @param {String} string\n// * @param {Boolean} allowZero to convert code point zero to 00 instead of end of string\n// * @returns {String} hex representation of input string\n// */\n// export const fromUtf8 = (str, allowZero) => {\n// const encodeStr = utf8.encode(str);\n// let hex = '';\n// for (let i = 0; i < encodeStr.length; i++) {\n// const code = encodeStr.charCodeAt(i);\n// if (code === 0) {\n// if (allowZero) {\n// hex += '00';\n// } else {\n// break;\n// }\n// } else {\n// const n = code.toString(16);\n// hex += n.length < 2 ? `0${n}` : n;\n// }\n// }\n// return `0x${hex}`;\n// };\n","/**\n * @file proto utils\n * @author atom-yang\n */\nimport * as protobuf from '@aelfqueen/protobufjs/light';\nimport coreDescriptor from '../../proto/core.proto.json';\nimport * as utils from './utils';\nimport {\n transform,\n OUTPUT_TRANSFORMERS,\n transformArrayToMap\n} from './transform';\n\nexport const coreRootProto = protobuf.Root.fromJSON(coreDescriptor);\n/* eslint-disable no-unused-vars */\n\nexport const {\n Transaction,\n Hash,\n Address,\n TransactionFeeCharged,\n ResourceTokenCharged\n} = coreRootProto;\n\nexport const getFee = (base64Str, type = 'TransactionFeeCharged') => {\n if (['ResourceTokenCharged', 'TransactionFeeCharged'].indexOf(type) === -1) {\n throw new Error('type needs to be one of ResourceTokenCharged and TransactionFeeCharged');\n }\n const dataType = coreRootProto[type];\n let deserialize = dataType.decode(Buffer.from(base64Str, 'base64'));\n deserialize = dataType.toObject(deserialize, {\n enums: String, // enums as string names\n longs: String, // longs as strings (requires long.js)\n bytes: String, // bytes as base64 encoded strings\n defaults: true, // includes default values\n arrays: true, // populates empty arrays (repeated fields) even if defaults=false\n objects: true, // populates empty objects (map fields) even if defaults=false\n oneofs: true // includes virtual oneof fields set to the present field's name\n });\n // eslint-disable-next-line max-len\n let deserializeLogResult = transform(dataType, deserialize, OUTPUT_TRANSFORMERS);\n deserializeLogResult = transformArrayToMap(dataType, deserializeLogResult);\n return deserializeLogResult;\n};\n\nexport const getSerializedDataFromLog = log => {\n const {\n NonIndexed,\n Indexed = []\n } = log;\n const serializedData = [...(Indexed || [])];\n if (NonIndexed) {\n serializedData.push(NonIndexed);\n }\n return serializedData.join('');\n};\n\nexport const getResourceFee = (Logs = []) => {\n if (!Array.isArray(Logs) || Logs.length === 0) {\n return [];\n }\n return Logs.filter(log => log.Name === 'ResourceTokenCharged')\n .map(v => getFee(getSerializedDataFromLog(v), 'ResourceTokenCharged'));\n};\n\nexport const getTransactionFee = (Logs = []) => {\n if (!Array.isArray(Logs) || Logs.length === 0) {\n return [];\n }\n return Logs.filter(log => log.Name === 'TransactionFeeCharged')\n .map(v => getFee(getSerializedDataFromLog(v), 'TransactionFeeCharged'));\n};\n\n/**\n * arrayBuffer To Hex\n *\n * @alias module:AElf/pbUtils\n * @param {Buffer} arrayBuffer arrayBuffer\n * @return {string} hex string\n */\nexport const arrayBufferToHex = arrayBuffer => Array.prototype.map.call(\n new Uint8Array(arrayBuffer),\n n => (`0${n.toString(16)}`).slice(-2)\n).join('');\n\n/**\n * get hex rep From Address\n *\n * @alias module:AElf/pbUtils\n * @param {protobuf} address kernel.Address\n * @return {string} hex rep of address\n */\nexport const getRepForAddress = address => {\n const message = Address.fromObject(address);\n let hex = '';\n if (message.value instanceof Buffer) {\n hex = message.value.toString('hex');\n } else {\n // Uint8Array\n hex = arrayBufferToHex(message.value);\n }\n return utils.encodeAddressRep(hex);\n};\n\n/**\n * get address From hex rep\n *\n * @alias module:AElf/pbUtils\n * @param {string} rep address\n * @return {protobuf} address kernel.Address\n */\nexport const getAddressFromRep = rep => {\n const hex = utils.decodeAddressRep(rep);\n return Address.create({\n value: Buffer.from(hex.replace('0x', ''), 'hex')\n });\n};\n\n/**\n * get address From hex rep\n *\n * @alias module:AElf/pbUtils\n * @param {string} rep address\n * @return {protobuf} address kernel.Address\n */\nexport const getAddressObjectFromRep = rep => Address.toObject(getAddressFromRep(rep));\n\n/**\n * get hex rep From hash\n *\n * @alias module:AElf/pbUtils\n * @param {protobuf} hash kernel.Hash\n * @return {string} hex rep\n */\nexport const getRepForHash = hash => {\n const message = Address.fromObject(hash);\n let hex = '';\n if (message.value instanceof Buffer) {\n hex = message.value.toString('hex');\n } else {\n // Uint8Array\n hex = arrayBufferToHex(message.value);\n }\n return hex;\n};\n\n/**\n * get Hash From Hex\n *\n * @alias module:AElf/pbUtils\n * @param {string} hex string\n * @return {protobuf} kernel.Hash\n */\nexport const getHashFromHex = hex => Hash.create({\n value: Buffer.from(hex.replace('0x', ''), 'hex')\n});\n\n/**\n * get Hash Object From Hex\n *\n * @alias module:AElf/pbUtils\n * @param {string} hex string\n * @return {Object} kernel.Hash Hash ot Object\n */\nexport const getHashObjectFromHex = hex => Hash.toObject(getHashFromHex(hex));\n\n/**\n * encode Transaction to protobuf type\n *\n * @alias module:AElf/pbUtils\n * @param {Object} tx object\n * @return {protobuf} kernel.Transaction\n */\nexport const encodeTransaction = tx => Transaction.encode(tx).finish();\n\n/**\n * get Transaction\n *\n * @alias module:AElf/pbUtils\n * @param {string} from\n * @param {string} to\n * @param {string} methodName\n * @param {string} params\n * @return {protobuf} kernel.Transaction\n */\nexport const getTransaction = (from, to, methodName, params) => {\n const txn = {\n from: getAddressFromRep(from),\n to: getAddressFromRep(to),\n methodName,\n params\n };\n return Transaction.create(txn);\n};\n\n/* eslint-enable */\n","/**\n * @file bloom\n * @author joshstevens19\n * @link https://github.com/joshstevens19/ethereum-bloom-filters\n */\nimport sha256 from './sha256';\nimport {\n Address,\n getAddressObjectFromRep\n} from './proto';\n/**\n * @deprecated Use the new Bloom instead\n */\nfunction isBloom(bloom) {\n if (bloom instanceof Buffer || bloom instanceof Uint8Array) {\n return bloom.length === 256;\n }\n // if (!/^(0x)?[0-9a-f]{512}$/i.test(bloom)) {\n // return false;\n // }\n\n if (\n /^(0x)?[0-9a-f]{512}$/.test(bloom)\n || /^(0x)?[0-9A-F]{512}$/.test(bloom)\n ) {\n return true;\n }\n return false;\n}\n\n/**\n * @param codePoint\n * @return {number}\n */\nfunction codePointToInt(codePoint) {\n if (codePoint >= 48 && codePoint <= 57) {\n /* ['0'..'9'] -> [0..9] */\n return codePoint - 48;\n }\n\n if (codePoint >= 65 && codePoint <= 70) {\n /* ['A'..'F'] -> [10..15] */\n return codePoint - 55;\n }\n\n if (codePoint >= 97 && codePoint <= 102) {\n /* ['a'..'f'] -> [10..15] */\n return codePoint - 87;\n }\n\n throw new Error('invalid bloom');\n}\n\n/**\n * @param {string} bloom hex string\n * @param {string} hash hex string\n * @return {boolean}\n */\nexport function isInBloom(bloom, hash) {\n if (!isBloom(bloom)) {\n throw new Error('Invalid Bloom');\n }\n for (let i = 0; i < 12; i += 4) {\n // calculate bit position in bloom filter that must be active\n const bitpos = ((parseInt(hash.substr(i, 2), 16) << 8)\n + parseInt(hash.substr(i + 2, 2), 16))\n & 2047;\n\n // test if bitpos in bloom is active\n const code = codePointToInt(\n bloom.charCodeAt(bloom.length - 1 - Math.floor(bitpos / 4)),\n );\n const offset = 1 << bitpos % 4;\n\n if ((code & offset) !== offset) {\n return false;\n }\n }\n return true;\n}\n\n/**\n * @param {string} bloom base64 string\n * @param {string} eventName utf-8 string, such as `Transferred`\n * @return {boolean}\n */\nexport function isEventInBloom(bloom, eventName) {\n return isInBloom(Buffer.from(bloom, 'base64').toString('hex'), sha256(eventName));\n}\n\nexport function isIndexedInBloom(bloom, indexed) {\n return isInBloom(Buffer.from(bloom, 'base64').toString('hex'), sha256(Buffer.from(indexed, 'base64')));\n}\n\nexport function isAddressInBloom(bloom, address) {\n const encodedAddress = Address.encode(getAddressObjectFromRep(address)).finish();\n return isInBloom(Buffer.from(bloom, 'base64').toString('hex'), sha256(encodedAddress));\n}\n","/**\n * @file method on chain\n * @author atom-yang\n */\nimport { isFunction, noop, isBoolean } from '../util/utils';\n\nexport default class ChainMethod {\n constructor({\n name,\n call,\n method = 'GET',\n params = [],\n inputFormatter = [],\n outputFormatter = null,\n }) {\n this.name = name;\n this.call = call;\n this.requestMethod = method;\n this.params = params;\n this.inputFormatter = inputFormatter;\n this.outputFormatter = outputFormatter;\n this.requestManager = null;\n this.run = this.run.bind(this);\n }\n\n formatInput(args) {\n if (!this.inputFormatter || this.inputFormatter.length === 0) {\n return args;\n }\n\n return args.map((arg, index) => {\n const formatter = this.inputFormatter[index];\n return formatter ? formatter(arg) : arg;\n });\n }\n\n setRequestManager(manager) {\n this.requestManager = manager;\n }\n\n formatOutput(result) {\n return this.outputFormatter && result\n ? this.outputFormatter(result)\n : result;\n }\n\n extractArgumentsIntoObject(args) {\n if (args.length < this.params.length) {\n throw new Error(`should supply enough parameters for ${this.call}`);\n }\n const result = {\n method: this.call,\n requestMethod: this.requestMethod,\n isSync: false,\n callback: noop,\n params: {},\n };\n this.formatInput(args).forEach((arg, index) => {\n if (index > this.params.length - 1) {\n // if index is greater than params.length, that means arg is an extra argument\n if (isFunction(arg)) {\n // if there is a callback, user want to be in async mode, set isSync to false\n result.callback = arg;\n result.isSync = false;\n }\n if (isBoolean(arg?.sync)) {\n result.isSync = arg.sync;\n }\n } else {\n // if index is less than or equal to params.length, that means arg is one of the params\n result.params[this.params[index]] = arg;\n }\n });\n return result;\n }\n\n run(...args) {\n const argsObj = this.extractArgumentsIntoObject(args);\n if (argsObj.isSync) {\n return this.formatOutput(this.requestManager.send(argsObj));\n }\n return this.requestManager\n .sendAsync(argsObj)\n .then(result => {\n argsObj.callback(null, this.formatOutput(result));\n return this.formatOutput(result);\n })\n .catch(err => {\n argsObj.callback(err);\n throw err;\n });\n }\n}\n","import sha256 from './sha256';\n\nconst fromTwoBuffers = data => {\n if (data.length !== 2) throw new TypeError('Wrong data size.');\n\n const compared = Buffer.compare(data[0], data[1]);\n if (compared > 0) {\n data.reverse();\n }\n\n let buffer = Buffer.concat(data);\n buffer = Buffer.from(sha256(buffer), 'hex');\n return buffer;\n};\n\nconst generateMerkleTree = data => {\n if (data.length === 0) {\n return null;\n }\n\n if (data.length % 2 === 1) { data.push(data[data.length - 1]); }\n let nodeToAdd = data.length / 2;\n let newAdded = 0;\n let i = 0;\n while (i < data.length - 1) {\n const left = data[i++];\n const right = data[i++];\n data.push(fromTwoBuffers([left, right]));\n if (++newAdded === nodeToAdd) {\n // complete this row\n if (nodeToAdd % 2 === 1 && nodeToAdd !== 1) {\n nodeToAdd++;\n data.push(data[data.length - 1]);\n }\n // start a new row\n nodeToAdd /= 2;\n newAdded = 0;\n }\n }\n return data;\n};\n\nconst generateMerklePath = (indexArg, leafCount, tree) => {\n let index = indexArg;\n if (tree.length === 0 || index >= leafCount) return null;\n\n let firstInRow = 0;\n let rowcount = leafCount;\n const path = [];\n while (index < tree.length - 1) {\n const neighbor = index % 2 === 0 ? index + 1 : index - 1;\n path.push(tree[neighbor]);\n rowcount = rowcount % 2 === 0 ? rowcount : rowcount + 1;\n const shift = Math.floor((index - firstInRow) / 2);\n firstInRow += rowcount;\n index = firstInRow + shift;\n rowcount /= 2;\n }\n return path;\n};\n\nexport const computeRoot = data => {\n const merkleTree = generateMerkleTree(data);\n return merkleTree[merkleTree.length - 1];\n};\n\nexport const getMerklePath = (index, data) => {\n const leafCount = data.length;\n const merkleTree = generateMerkleTree(data);\n return generateMerklePath(index, leafCount, merkleTree);\n};\n\nexport const node = buffer => Buffer.from(sha256(buffer), 'hex');\n","const createKeccakHash = require('keccak');\n\nconst keccak = bits => str => {\n let msg;\n if (str.slice(0, 2) === '0x') {\n msg = [];\n for (let i = 2, l = str.length; i < l; i += 2) {\n msg.push(parseInt(str.slice(i, i + 2), 16));\n }\n msg = Buffer.from(msg);\n } else {\n msg = str;\n }\n const instance = createKeccakHash(`keccak${bits}`);\n return `0x${instance.update(msg).digest('hex')}`;\n};\n\nexport const keccak256 = keccak(256);\nexport const keccak512 = keccak(512);\nexport const keccak256s = keccak(256);\nexport const keccak512s = keccak(512);\n","/**\n * @file AElf keyStore tools\n * @author atom-yang\n */\nimport scrypt from 'scryptsy';\nimport { createCipheriv, createDecipheriv } from 'browserify-cipher';\nimport randomBytes from 'randombytes';\nimport { keccak256 } from './keccak';\nimport { KEY_STORE_ERRORS } from '../common/constants';\n\nconst AES_MODES = {\n 'aes-128-ecb': {\n cipher: 'AES',\n key: 128,\n iv: 0,\n mode: 'ECB',\n type: 'block',\n\n },\n 'aes-192-ecb': {\n cipher: 'AES',\n key: 192,\n iv: 0,\n mode: 'ECB',\n type: 'block',\n\n },\n 'aes-256-ecb': {\n cipher: 'AES',\n key: 256,\n iv: 0,\n mode: 'ECB',\n type: 'block',\n\n },\n 'aes-128-cbc': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n 'aes-192-cbc': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n 'aes-256-cbc': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n aes128: {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n aes192: {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n aes256: {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CBC',\n type: 'block',\n\n },\n 'aes-128-cfb': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CFB',\n type: 'stream',\n\n },\n 'aes-192-cfb': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CFB',\n type: 'stream',\n\n },\n 'aes-256-cfb': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CFB',\n type: 'stream',\n\n },\n 'aes-128-cfb8': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CFB8',\n type: 'stream',\n\n },\n 'aes-192-cfb8': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CFB8',\n type: 'stream',\n\n },\n 'aes-256-cfb8': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CFB8',\n type: 'stream',\n\n },\n 'aes-128-cfb1': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CFB1',\n type: 'stream',\n\n },\n 'aes-192-cfb1': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CFB1',\n type: 'stream',\n\n },\n 'aes-256-cfb1': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CFB1',\n type: 'stream',\n\n },\n 'aes-128-ofb': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'OFB',\n type: 'stream',\n\n },\n 'aes-192-ofb': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'OFB',\n type: 'stream',\n\n },\n 'aes-256-ofb': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'OFB',\n type: 'stream',\n\n },\n 'aes-128-ctr': {\n cipher: 'AES',\n key: 128,\n iv: 16,\n mode: 'CTR',\n type: 'stream',\n\n },\n 'aes-192-ctr': {\n cipher: 'AES',\n key: 192,\n iv: 16,\n mode: 'CTR',\n type: 'stream',\n\n },\n 'aes-256-ctr': {\n cipher: 'AES',\n key: 256,\n iv: 16,\n mode: 'CTR',\n type: 'stream',\n\n },\n 'aes-128-gcm': {\n cipher: 'AES',\n key: 128,\n iv: 12,\n mode: 'GCM',\n type: 'auth',\n\n },\n 'aes-192-gcm': {\n cipher: 'AES',\n key: 192,\n iv: 12,\n mode: 'GCM',\n type: 'auth',\n\n },\n 'aes-256-gcm': {\n cipher: 'AES',\n key: 256,\n iv: 12,\n mode: 'GCM',\n type: 'auth',\n\n }\n};\n\nconst defaultOptions = {\n dklen: 32,\n n: 8192, // 2048 4096 8192 16384\n r: 8,\n p: 1,\n cipher: 'aes-128-ctr'\n};\n\n/**\n * getKeyStore\n *\n * @method getKeyStore\n * @param {Object} walletInfoInput walletInfo\n * @param {string} password password\n * @param {Object} option option\n * @return {Object} keyStore\n */\nexport function getKeystore(\n {\n mnemonic,\n privateKey,\n nickName = '',\n address = ''\n },\n password,\n option = defaultOptions\n) {\n const opt = {\n ...defaultOptions,\n ...option\n };\n const { cipher = 'aes-128-ctr' } = opt;\n const sliceLength = /128/.test(cipher) ? 16 : 32;\n const salt = randomBytes(32); // instance of Buffer\n const ivLength = (AES_MODES[cipher.toLowerCase()] || {}).iv;\n const iv = randomBytes(ivLength === undefined ? 16 : ivLength); // instance of Buffer\n const derivedKey = scrypt(\n Buffer.from(password, 'utf8'),\n salt,\n opt.n,\n opt.r,\n opt.p,\n opt.dklen\n ); // instance of Buffer\n const privateKeyCipher = createCipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const privateKeyEncrypted = Buffer.concat([\n privateKeyCipher.update(Buffer.from(privateKey, 'hex')),\n privateKeyCipher.final()\n ]);\n const mnemonicCipher = createCipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const mnemonicEncrypted = Buffer.concat([\n mnemonicCipher.update(Buffer.from(mnemonic, 'utf8')),\n mnemonicCipher.final()\n ]);\n const rawMac = Buffer.concat([derivedKey.slice(16), privateKeyEncrypted]);\n const mac = keccak256(rawMac).replace('0x', '');\n return {\n version: 1,\n type: 'aelf',\n nickName,\n address,\n crypto: {\n cipher,\n ciphertext: privateKeyEncrypted.toString('hex'),\n cipherparams: {\n iv: iv.toString('hex')\n },\n mnemonicEncrypted: mnemonicEncrypted.toString('hex'),\n kdf: 'scrypt',\n kdfparams: {\n r: opt.r,\n n: opt.n,\n p: opt.p,\n dklen: opt.dklen,\n salt: salt.toString('hex')\n },\n mac\n }\n };\n}\n\n/**\n * unlock AElf key store\n *\n * @method unlockKeystore\n * @param {Object} keyStoreInput key store input\n * @param {string} password password\n * @return {Object} walletInfo\n */\nexport function unlockKeystore(\n {\n crypto,\n nickName = '',\n address = ''\n },\n password\n) {\n let error = null;\n let result = null;\n const {\n kdfparams,\n mac,\n cipherparams,\n mnemonicEncrypted = '',\n ciphertext,\n cipher = 'aes-128-ctr'\n } = crypto;\n const sliceLength = /128/.test(cipher) ? 16 : 32;\n const iv = Buffer.from(cipherparams.iv, 'hex');\n const derivedKey = scrypt(\n Buffer.from(password),\n Buffer.from(kdfparams.salt, 'hex'),\n kdfparams.n,\n kdfparams.r,\n kdfparams.p,\n kdfparams.dklen || kdfparams.dkLen\n );\n const rawMac = Buffer.concat([derivedKey.slice(16), Buffer.from(ciphertext, 'hex')]);\n const currentMac = keccak256(rawMac).replace('0x', '');\n if (currentMac === mac) {\n const privateKeyDeCipher = createDecipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const privateKey = Buffer.concat([\n privateKeyDeCipher.update(Buffer.from(ciphertext, 'hex')),\n privateKeyDeCipher.final()\n ]).toString('hex');\n\n const mnemonicDeCipher = createDecipheriv(cipher, derivedKey.slice(0, sliceLength), iv);\n const mnemonic = Buffer.concat([\n mnemonicDeCipher.update(Buffer.from(mnemonicEncrypted, 'hex')),\n mnemonicDeCipher.final()\n ]).toString('utf8');\n result = {\n nickName,\n address,\n mnemonic,\n privateKey\n };\n } else {\n error = { ...KEY_STORE_ERRORS.INVALID_PASSWORD };\n throw error;\n }\n\n return result;\n}\n\n/**\n * checkPassword\n *\n * @method checkPassword\n * @param {Object} keyStoreInput keyStoreInput\n * @param {string} password password\n * @return {boolean} true or false\n */\nexport const checkPassword = (\n keyStoreInput,\n password\n) => {\n try {\n const result = unlockKeystore(keyStoreInput, password);\n return !!result.privateKey;\n } catch (e) {\n return false;\n }\n};\n","/**\n * @file wallet\n * @author atom-yang\n */\nimport elliptic from 'elliptic';\nimport * as bip39 from 'bip39';\nimport hdkey from 'hdkey';\nimport AES from 'crypto-js/aes';\nimport encUTF8 from 'crypto-js/enc-utf8';\nimport sha256 from '../util/sha256';\nimport * as keyStore from '../util/keyStore';\nimport {\n encodeAddressRep,\n padLeft\n} from '../util/utils';\nimport { Transaction } from '../util/proto';\n\n// eslint-disable-next-line new-cap\nconst ellipticEc = new elliptic.ec('secp256k1');\n\n/**\n * Advanced Encryption Standard need crypto-js\n *\n * @alias module:AElf/wallet\n * @param {string} input anything you want to encrypt\n * @param {string} password password\n * @return {string} using base64 encoding way\n *\n * @Example\n * const AESEncryptPrivateKey = aelf.wallet.AESEncrypt('123', '123');\n * // AESEncryptPrivateKey = \"U2FsdGVkX1+RYovrVJVEEl8eiIUA3vx4GrNR+3sqOow=\"\n * const AESEncryptMnemonic = alef.wallet.AESEncrypt('hello world', '123');\n * // AESEncryptMnemonic = U2FsdGVkX19gCjHzYmoY5FGZA1ArXG+eGZIR77dK2GE=\n *\n */\nconst AESEncrypt = (input, password) => AES.encrypt(input, password).toString();\n\n/**\n * Decrypt any encrypted information you want to decrypt\n *\n * @alias module:AElf/wallet\n * @param {string} input anything you want to decrypt\n * @param {string} password password\n * @return {string} decrypted input, using utf8 decoding way\n *\n * @Example\n * const AESDecryptPrivateKey = aelf.wallet.AESDecrypt('U2FsdGVkX18+tvF7t4rhGOi5cbUvdTH2U5a6Tbu4Ojg=', '123');\n * // AESDecryptPrivateKey = \"123\"\n * const AESDecryptMnemonic = aelf.wallet.AESDecrypt('U2FsdGVkX19gCjHzYmoY5FGZA1ArXG+eGZIR77dK2GE=', '123');\n * // AESDecryptMnemonic = \"hello world\"\n */\nconst AESDecrypt = (input, password) => AES.decrypt(input, password).toString(encUTF8);\n\n/**\n * the same as in C#\n *\n * @alias module:AElf/wallet\n * @param {Object} pubKey get the pubKey you want through keyPair\n * @return {string} address encoded address\n *\n * @Example\n * const pubKey = wallet.keyPair.getPublic();\n * const address = aelf.wallet.getAddressFromPubKey(pubKey);\n */\nconst getAddressFromPubKey = pubKey => {\n const pubKeyEncoded = pubKey.encode();\n const onceSHAResult = Buffer.from(sha256(pubKeyEncoded), 'hex');\n const hash = sha256(onceSHAResult).slice(0, 64);\n return encodeAddressRep(hash);\n};\n\nconst _getWallet = (type, value, BIP44Path = 'm/44\\'/1616\\'/0\\'/0/0') => {\n // m/purpose'/coin_type'/account'/change/address_index\n // \"m/44'/1616'/0'/0/0\"\n\n let mnemonic = '';\n let rootSeed = '';\n let childWallet = '';\n let keyPair = '';\n let hdWallet;\n switch (type) {\n case 'createNewWallet':\n mnemonic = bip39.generateMnemonic();\n rootSeed = bip39.mnemonicToSeedSync(mnemonic).toString('hex');\n hdWallet = hdkey.fromMasterSeed(rootSeed);\n childWallet = hdWallet.derive(BIP44Path);\n keyPair = ellipticEc.keyFromPrivate(childWallet.privateKey);\n break;\n case 'getWalletByMnemonic':\n mnemonic = value;\n rootSeed = bip39.mnemonicToSeedSync(mnemonic).toString('hex');\n hdWallet = hdkey.fromMasterSeed(rootSeed);\n childWallet = hdWallet.derive(BIP44Path);\n keyPair = ellipticEc.keyFromPrivate(childWallet.privateKey);\n break;\n case 'getWalletByPrivateKey':\n if (typeof value === 'string') {\n keyPair = ellipticEc.keyFromPrivate(padLeft(value, 64, '0'));\n } else {\n keyPair = ellipticEc.keyFromPrivate(value);\n }\n break;\n default:\n throw new Error('not a valid method');\n }\n // let mnemonic = bip39.generateMnemonic();\n // let rootSeed = bip39.mnemonicToSeedHex(mnemonic);\n // let hdWallet = hdkey.fromMasterSeed(rootSeed);\n // let keyPair = ec.keyFromPrivate(xPrivateKey);\n // TODO 1.将私钥加密保存,用密码解密才能使用。\n // TODO 2.将助记词机密保存,用密码解密才能获取。\n const privateKey = keyPair.getPrivate().toString(16, 64);\n const publicKey = keyPair.getPublic();\n const address = getAddressFromPubKey(publicKey);\n return {\n mnemonic,\n BIP44Path,\n childWallet,\n keyPair,\n privateKey,\n address\n };\n};\n\n/**\n * get signature\n * @param bytesToBeSign\n * @param keyPair\n * @returns {Buffer}\n */\nconst getSignature = (bytesToBeSign, keyPair) => {\n const privateKey = keyPair.getPrivate('hex');\n const msgHash = sha256(bytesToBeSign);\n const sigObj = ellipticEc.sign(Buffer.from(msgHash, 'hex'), privateKey, 'hex', {\n canonical: true\n });\n const hex = [\n sigObj.r.toString('hex', 32),\n sigObj.s.toString('hex', 32),\n `0${sigObj.recoveryParam.toString()}`\n ].join('');\n return Buffer.from(hex, 'hex');\n};\n\n/**\n * create a wallet\n *\n * @alias module:AElf/wallet\n * @param {string} BIP44Path\n * @return {Object} wallet\n *\n * @Example\n * const wallet = aelf.wallet.createNewWallet();\n * // The format returned is similar to this\n * // wallet = {\n * // mnemonic: \"hello world\",\n * // BIP44Path: 'm/44\\'/1616\\'/0\\'/0/0',\n * // childWallet: {},\n * // keyPair: KeyPair {ec: EC, priv: BN, pub: Point}\n * // privateKey: \"123f7c123\"\n * // address: \"5uhk3434242424\"\n * // }\n */\nconst createNewWallet = (BIP44Path = 'm/44\\'/1616\\'/0\\'/0/0') => _getWallet('createNewWallet', '', BIP44Path);\n\n/**\n * create a wallet by mnemonic\n *\n * @alias module:AElf/wallet\n * @param {string} mnemonic base on bip39\n * @param {string} BIP44Path\n * @return {Object} wallet\n *\n * @Example\n *\n * const mnemonicWallet = aelf.wallet.getWalletByMnemonic('hello world');\n */\nconst getWalletByMnemonic = (mnemonic, BIP44Path = 'm/44\\'/1616\\'/0\\'/0/0') => {\n if (bip39.validateMnemonic(mnemonic)) {\n return _getWallet('getWalletByMnemonic', mnemonic, BIP44Path);\n }\n return false;\n};\n\n/**\n * create a wallet by private key\n *\n * @alias module:AElf/wallet\n * @param {string} privateKey privateKey\n * @return {Object} wallet\n *\n * @Example\n * const privateKeyWallet = aelf.wallet.getWalletByPrivateKey('123');\n *\n */\nconst getWalletByPrivateKey = privateKey => _getWallet('getWalletByPrivateKey', privateKey);\n\n/**\n * sign a transaction\n *\n * @alias module:AElf/wallet\n * @param {Object} rawTxn rawTxn\n * @param {Object} keyPair Any standard key pair\n * @return {Object} wallet\n *\n * @Example\n * const rawTxn = proto.getTransaction(\n * 'ELF_65dDNxzcd35jESiidFXN5JV8Z7pCwaFnepuYQToNefSgqk9',\n * 'ELF_65dDNxzcd35jESiidFXN5JV8Z7pCwaFnepuYQToNefSgqk9',\n * 'test',\n * []\n * );\n * const signWallet = aelf.wallet.signTransaction(rawTxn, wallet.keyPair);\n */\nconst signTransaction = (rawTxn, keyPair) => {\n let { params } = rawTxn;\n if (params.length === 0) {\n params = null;\n }\n // proto in proto.Transaction use proto2, but C# use proto3\n // proto3 will remove the default value key.\n // The differences between proto2 and proto3:\n // https://blog.csdn.net/huanggang982/article/details/77944174\n const ser = Transaction.encode(rawTxn).finish();\n const sig = getSignature(ser, keyPair);\n return {\n ...rawTxn,\n params,\n signature: sig\n };\n};\n\n/**\n * Encryption Using Elliptic Curve Algorithms（Use ECDSA)\n * Please see https://www.npmjs.com/package/elliptic#incentive\n *\n * @alias module:AElf/wallet\n * @param {string} hexString hex string\n * @param {Object} keyPair Any standard key pair\n * @return {Buffer} Buffer.from(hex, 'hex')\n *\n * @Example\n * const buffer = aelf.wallet.sign('68656c6c6f20776f726c64', wallet.keyPair);\n * buffer = [65, 246, 49, 108, 122, 252, 66, 187, 240, 7, 14, 48, 89,\n * 38, 103, 42, 58, 0, 46, 182, 180, 194, 200, 208, 141, 15, 95, 67,\n * 234, 248, 31, 199, 73, 151, 2, 133, 233, 84, 180, 216, 116, 9, 153,\n * 208, 254, 175, 96, 123, 76, 184, 224, 87, 69, 220, 172, 170, 239, 232,\n * 188, 123, 168, 163, 244, 151, 1]\n */\nconst sign = (hexString, keyPair) => {\n const bytesToBeSign = Buffer.from(hexString.replace('0x', ''), 'hex');\n return getSignature(bytesToBeSign, keyPair);\n};\n\nexport default {\n hdkey,\n bip39,\n sign,\n signTransaction,\n createNewWallet,\n getWalletByMnemonic,\n getWalletByPrivateKey,\n getAddressFromPubKey,\n ellipticEc,\n AESEncrypt,\n AESDecrypt,\n keyStore\n};\n","/**\n * @file contract method\n * @author atom-yang\n */\nimport { getTransaction, Transaction } from '../util/proto';\nimport {\n transformArrayToMap,\n transformMapToArray,\n transform,\n INPUT_TRANSFORMERS,\n OUTPUT_TRANSFORMERS,\n} from '../util/transform';\nimport {\n isBoolean,\n isFunction,\n noop,\n uint8ArrayToHex,\n unpackSpecifiedTypeData,\n} from '../util/utils';\nimport wallet from '../wallet';\n\nexport default class ContractMethod {\n constructor(chain, method, contractAddress, walletInstance) {\n this._chain = chain;\n this._method = method;\n const { resolvedRequestType, resolvedResponseType } = method;\n this._inputType = resolvedRequestType;\n this._outputType = resolvedResponseType;\n this._name = method.name;\n this._contractAddress = contractAddress;\n this._wallet = walletInstance;\n\n this.sendTransaction = this.sendTransaction.bind(this);\n this.unpackPackedInput = this.unpackPackedInput.bind(this);\n this.packInput = this.packInput.bind(this);\n this.unpackOutput = this.unpackOutput.bind(this);\n this.bindMethodToContract = this.bindMethodToContract.bind(this);\n this.run = this.run.bind(this);\n this.request = this.request.bind(this);\n this.callReadOnly = this.callReadOnly.bind(this);\n this.getSignedTx = this.getSignedTx.bind(this);\n this.getRawTx = this.getRawTx.bind(this);\n }\n\n packInput(input) {\n if (!input) {\n return null;\n }\n let params = transformMapToArray(this._inputType, input);\n params = transform(this._inputType, params, INPUT_TRANSFORMERS);\n const message = this._inputType.fromObject(params);\n return this._inputType.encode(message).finish();\n }\n\n unpackPackedInput(inputPacked) {\n if (!inputPacked) {\n return null;\n }\n const result = unpackSpecifiedTypeData({\n data: inputPacked,\n dataType: this._inputType,\n });\n let params = transform(this._inputType, result, OUTPUT_TRANSFORMERS);\n params = transformArrayToMap(this._inputType, params);\n return params;\n }\n\n unpackOutput(output) {\n if (!output) {\n return null;\n }\n let result = unpackSpecifiedTypeData({\n data: output,\n dataType: this._outputType,\n });\n result = transform(this._outputType, result, OUTPUT_TRANSFORMERS);\n result = transformArrayToMap(this._outputType, result);\n return result;\n }\n\n packOutput(result) {\n if (!result) {\n return null;\n }\n let params = transformMapToArray(this._outputType, result);\n\n params = transform(this._outputType, params, INPUT_TRANSFORMERS);\n\n const message = this._outputType.fromObject(params);\n return this._outputType.encode(message).finish();\n }\n\n handleTransaction(height, hash, encoded) {\n const rawTx = this.getRawTx(height, hash, encoded);\n\n let tx = wallet.signTransaction(rawTx, this._wallet.keyPair);\n\n tx = Transaction.encode(tx).finish();\n // jest environment just go into Buffer branch\n // we have test in browser example handly\n if (tx instanceof Buffer) {\n return tx.toString('hex');\n }\n return uint8ArrayToHex(tx);\n }\n\n prepareParametersAsync(args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg?.sync)\n );\n const encoded = this.packInput(filterArgs[0]);\n\n return this._chain.getChainStatus().then(status => {\n const { BestChainHeight, BestChainHash } = status;\n return this.handleTransaction(BestChainHeight, BestChainHash, encoded);\n });\n }\n\n prepareParameters(args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg.sync)\n );\n const encoded = this.packInput(filterArgs[0]);\n\n const { BestChainHeight, BestChainHash } = this._chain.getChainStatus({\n sync: true,\n });\n\n return this.handleTransaction(BestChainHeight, BestChainHash, encoded);\n }\n\n prepareParametersWithBlockInfo(args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg.sync)\n );\n const encoded = this.packInput(filterArgs[0]);\n\n const { height, hash } = filterArgs[1]; // blockInfo\n\n return this.handleTransaction(height, hash, encoded);\n }\n\n sendTransaction(...args) {\n const argsObject = this.extractArgumentsIntoObject(args);\n if (argsObject.isSync) {\n const parameters = this.prepareParameters(args);\n return this._chain.sendTransaction(parameters, {\n sync: true,\n });\n }\n // eslint-disable-next-line arrow-body-style\n return this.prepareParametersAsync(args).then(parameters => {\n return this._chain.sendTransaction(parameters, argsObject.callback);\n });\n }\n\n callReadOnly(...args) {\n const argsObject = this.extractArgumentsIntoObject(args);\n if (argsObject.isSync) {\n const parameters = this.prepareParameters(args);\n return this.unpackOutput(\n this._chain.callReadOnly(parameters, {\n sync: true,\n })\n );\n }\n // eslint-disable-next-line arrow-body-style\n return this.prepareParametersAsync(args).then(parameters => {\n return this._chain\n .callReadOnly(parameters, (error, result) => {\n argsObject.callback(error, this.unpackOutput(result));\n })\n .then(this.unpackOutput);\n });\n }\n\n extractArgumentsIntoObject(args) {\n const result = {\n callback: noop,\n isSync: false,\n };\n if (args.length === 0) {\n // has no callback, default to be async mode\n return result;\n }\n if (isFunction(args[args.length - 1])) {\n result.callback = args[args.length - 1];\n }\n args.forEach(arg => {\n if (isBoolean(arg?.sync)) {\n result.isSync = arg.sync;\n }\n });\n return result;\n }\n\n // getData(...args) {\n getSignedTx(...args) {\n const filterArgs = args.filter(\n arg => !isFunction(arg) && !isBoolean(arg.sync)\n );\n\n if (filterArgs[1]) {\n const { height, hash } = filterArgs[1]; // blockInfo\n if (hash && height) {\n return this.prepareParametersWithBlockInfo(args);\n }\n throw Error('The second param is the height & hash of a block');\n }\n\n return this.prepareParameters(args);\n }\n\n getRawTx(blockHeightInput, blockHashInput, packedInput) {\n const rawTx = getTransaction(\n this._wallet.address,\n this._contractAddress,\n this._name,\n packedInput\n );\n\n rawTx.refBlockNumber = blockHeightInput;\n const blockHash = blockHashInput.match(/^0x/)\n ? blockHashInput.substring(2)\n : blockHashInput;\n rawTx.refBlockPrefix = Buffer.from(blockHash, 'hex').slice(0, 4);\n return rawTx;\n }\n\n request(...args) {\n const { callback } = this.extractArgumentsIntoObject(args);\n const params = this.prepareParameters(args);\n return {\n method: 'broadcast_tx',\n callback,\n params,\n format: this.unpackOutput,\n };\n }\n\n run(...args) {\n return this.sendTransaction(...args);\n }\n\n bindMethodToContract(contract) {\n const { run } = this;\n run.request = this.request;\n run.call = this.callReadOnly;\n run.inputTypeInfo = this._inputType.toJSON();\n run.inputType = this._inputType;\n run.outputTypeInfo = this._outputType.toJSON();\n run.outputType = this._outputType;\n run.unpackPackedInput = this.unpackPackedInput;\n run.packInput = this.packInput;\n run.packOutput = this.packOutput.bind(this);\n run.sendTransaction = this.sendTransaction;\n run.getSignedTx = this.getSignedTx;\n run.getRawTx = this.getRawTx;\n run.unpackOutput = this.unpackOutput;\n // eslint-disable-next-line no-param-reassign\n contract[this._name] = run;\n }\n}\n","/**\n * @file contract\n * @author atom-yang\n */\n// eslint-disable-next-line max-classes-per-file\nimport * as protobuf from '@aelfqueen/protobufjs/light';\nimport {\n transform,\n transformArrayToMap,\n OUTPUT_TRANSFORMERS\n} from '../util/transform';\nimport ContractMethod from './contractMethod';\nimport { noop } from '../util/utils';\n\nconst getServicesFromFileDescriptors = descriptors => {\n const root = protobuf.Root.fromDescriptor(descriptors, 'proto3').resolveAll();\n return descriptors.file.filter(f => f.service.length > 0).map(f => {\n const sn = f.service[0].name;\n const fullName = f.package ? `${f.package}.${sn}` : sn;\n return root.lookupService(fullName);\n });\n};\n\nclass Contract {\n constructor(chain, services, address) {\n this._chain = chain;\n this.address = address;\n this.services = services;\n }\n\n deserializeLog(logs = [], logName) {\n const logInThisAddress = (logs).filter(v => v.Address === this.address && logName === v.Name);\n if (logInThisAddress.length === 0) {\n return [];\n }\n return logInThisAddress.map(item => {\n const {\n Name,\n NonIndexed,\n Indexed\n } = item;\n let dataType;\n // eslint-disable-next-line no-restricted-syntax\n for (const service of this.services) {\n try {\n dataType = service.lookupType(Name);\n break;\n } catch (e) {}\n }\n const serializedData = [...(Indexed || [])];\n if (NonIndexed) {\n serializedData.push(NonIndexed);\n }\n let result = serializedData.reduce((acc, v) => {\n let deserialize = dataType.decode(Buffer.from(v, 'base64'));\n deserialize = dataType.toObject(deserialize, {\n enums: String, // enums as string names\n longs: String, // longs as strings (requires long.js)\n bytes: String, // bytes as base64 encoded strings\n defaults: false, // includes default values\n arrays: true, // populates empty arrays (repeated fields) even if defaults=false\n objects: true, // populates empty objects (map fields) even if defaults=false\n oneofs: true // includes virtual oneof fields set to the present field's name\n });\n return {\n ...acc,\n ...deserialize\n };\n }, {});\n result = transform(dataType, result, OUTPUT_TRANSFORMERS);\n result = transformArrayToMap(dataType, result);\n return result;\n });\n }\n}\n\nexport default class ContractFactory {\n constructor(chain, fileDescriptorSet, wallet) {\n this.chain = chain;\n this.services = getServicesFromFileDescriptors(fileDescriptorSet);\n this.wallet = wallet;\n }\n\n static bindMethodsToContract(contract, wallet) {\n contract.services.forEach(service => {\n Object.keys(service.methods).forEach(key => {\n const method = service.methods[key].resolve();\n const contractMethod = new ContractMethod(contract._chain, method, contract.address, wallet);\n contractMethod.bindMethodToContract(contract);\n });\n });\n }\n\n at(address, callback = noop) {\n const contractInstance = new Contract(this.chain, this.services, address);\n ContractFactory.bindMethodsToContract(contractInstance, this.wallet);\n callback(null, contractInstance);\n return contractInstance;\n }\n}\n","/**\n * @file chain\n * @author atom-yang\n */\nimport {\n isBoolean,\n isFunction,\n noop,\n setPath\n} from '../util/utils';\nimport { CHAIN_METHODS } from '../common/constants';\nimport ChainMethod from './chainMethod';\nimport * as merkleTree from '../util/merkleTree';\n\nimport ContractFactory from '../contract';\n\nexport default class Chain {\n constructor(requestManager) {\n Object.keys(CHAIN_METHODS).forEach(key => {\n const methodConfig = CHAIN_METHODS[key];\n const { name } = methodConfig;\n const method = new ChainMethod(methodConfig);\n method.setRequestManager(requestManager);\n setPath(this, name, method.run);\n });\n }\n\n extractArgumentsIntoObject(args) {\n const result = {\n callback: noop,\n isSync: false,\n };\n if (args.length === 0) {\n // has no callback, default to be async mode\n return result;\n }\n if (isFunction(args[args.length - 1])) {\n result.callback = args[args.length - 1];\n }\n args.forEach(arg => {\n if (isBoolean(arg?.sync)) {\n result.isSync = arg.sync;\n }\n });\n return result;\n }\n\n contractAt(address, wallet, ...args) {\n const { callback, isSync } = this.extractArgumentsIntoObject(args);\n if (isSync) {\n const fds = this.getContractFileDescriptorSet(address, {\n sync: true,\n });\n if (fds && fds.file && fds.file.length > 0) {\n const factory = new ContractFactory(this, fds, wallet);\n return factory.at(address);\n }\n throw new Error('no such contract');\n }\n // eslint-disable-next-line consistent-return\n return this.getContractFileDescriptorSet(address).then(fds => {\n if (fds && fds.file && fds.file.length > 0) {\n const factory = new ContractFactory(this, fds, wallet);\n const result = factory.at(address);\n callback(null, result);\n return result;\n }\n callback(new Error('no such contract'));\n // if callback is noop, throw error\n if (callback.length === 0) {\n throw new Error('no such contract');\n }\n });\n }\n\n getMerklePath(txId, height, ...args) {\n const { isSync } = this.extractArgumentsIntoObject(args);\n if (isSync) {\n const block = this.getBlockByHeight(height, true, {\n sync: true,\n });\n const { BlockHash, Body } = block;\n const txIds = Body.Transactions;\n const txIndex = txIds.findIndex(id => id === txId);\n if (txIndex === -1) {\n throw new Error(\n `txId ${txId} has no correspond transaction in the block with height ${height}`\n );\n }\n const txResults = this.getTxResults(BlockHash, 0, txIds.length, {\n sync: true,\n });\n const nodes = txResults.map((result, index) => {\n const id = txIds[index];\n const status = result.Status;\n const buffer = Buffer.concat([\n Buffer.from(id.replace('0x', ''), 'hex'),\n Buffer.from(status, 'utf8'),\n ]);\n return merkleTree.node(buffer);\n });\n return merkleTree.getMerklePath(txIndex, nodes);\n }\n return this.getBlockByHeight(height, true).then(block => {\n const { BlockHash, Body } = block;\n const txIds = Body.Transactions;\n const txIndex = txIds.findIndex(id => id === txId);\n if (txIndex === -1) {\n throw new Error(\n `txId ${txId} has no correspond transaction in the block with height ${height}`\n );\n }\n return this.getTxResults(BlockHash, 0, txIds.length).then(results => {\n const nodes = results.map((result, index) => {\n const id = txIds[index];\n const status = result.Status;\n const buffer = Buffer.concat([\n Buffer.from(id.replace('0x', ''), 'hex'),\n Buffer.from(status, 'utf8'),\n ]);\n return merkleTree.node(buffer);\n });\n return merkleTree.getMerklePath(txIndex, nodes);\n });\n });\n }\n}\n","/**\n * @file request methods, connected to rpc node\n * @author atom-yang\n */\n\nexport default class RequestManager {\n constructor(provider) {\n this.provider = provider;\n }\n\n static prepareRequest({ requestMethod, method, params = {} }) {\n return {\n method: requestMethod.toUpperCase(),\n url: method,\n params\n };\n }\n\n setProvider(provider) {\n this.provider = provider;\n }\n\n send(requestBody) {\n if (!this.provider) {\n return null;\n }\n\n const payload = RequestManager.prepareRequest(requestBody);\n return this.provider.send(payload);\n }\n\n sendAsync(requestBody) {\n if (!this.provider) {\n return null;\n }\n\n const payload = RequestManager.prepareRequest(requestBody);\n return this.provider.sendAsync(payload);\n }\n}\n","/**\n * @file rpc connection built with http\n * @author atom-yang\n */\nimport { stringify } from 'query-string';\n\nconst defaultHeaders = {\n Accept: 'text/plain;v=1.0',\n 'Content-Type': 'application/json'\n};\n\nlet RequestLibrary = {};\nlet isFetch = false;\nif (process.env.RUNTIME_ENV === 'browser') {\n // For browsers use DOM Api XMLHttpRequest\n // serviceworker without window and document, only with self\n // eslint-disable-next-line no-restricted-globals\n const _self = typeof self === 'object' ? self : {};\n const _window = typeof window === 'object' ? window : _self;\n if (typeof _window.XMLHttpRequest !== 'undefined') {\n RequestLibrary = _window.XMLHttpRequest;\n isFetch = false;\n } else if (typeof _window.fetch !== 'undefined') {\n RequestLibrary = _window.fetch;\n isFetch = true;\n }\n} else {\n // For node use xmlhttprequest\n // eslint-disable-next-line global-require\n RequestLibrary = require('xmlhttprequest').XMLHttpRequest;\n}\n\nexport default class HttpProvider {\n constructor(\n host = 'http://localhost:8545',\n timeout = 8000,\n headers = defaultHeaders\n ) {\n this.host = host.replace(/\\/$/, '');\n this.timeout = timeout;\n this.headers = {};\n if (Array.isArray(headers)) {\n headers.forEach(({ name, value }) => {\n this.headers[name] = value;\n });\n this.headers = {\n ...defaultHeaders,\n ...this.headers\n };\n } else {\n this.headers = {\n ...defaultHeaders,\n ...headers,\n };\n }\n }\n\n static formatResponse(response) {\n let result;\n try {\n result = JSON.parse(response);\n } catch (e) {\n result = response;\n }\n return result;\n }\n\n static formatResponseText(request) {\n let result;\n try {\n const parseRequest = request;\n result = {\n status: parseRequest.status,\n error: parseRequest.status === 200 ? 0 : parseRequest.status,\n Error: {\n message: request.statusText,\n },\n statusText: request.statusText,\n };\n } catch (e) {\n result = request;\n }\n return result;\n }\n\n static timeoutPromise(delay) {\n return new Promise(_resolve => {\n const ids = setTimeout(() => {\n clearTimeout(ids);\n // eslint-disable-next-line prefer-promise-reject-errors\n _resolve({ type: 'timeout' });\n }, delay);\n });\n }\n\n requestSendByFetch(requestConfig, request) {\n const {\n url,\n method = 'POST',\n params = {},\n signal\n } = requestConfig;\n const path = `/api/${url}`.replace(/\\/\\//g, '\\/');\n let uri = `${this.host}${path}`.replace();\n const myHeaders = new Headers();\n let body = JSON.stringify(params);\n if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') {\n uri = Object.keys(params).length > 0 ? `${uri}?${stringify(params)}` : uri;\n body = undefined;\n }\n Object.keys(this.headers).forEach(header => {\n myHeaders.append(header, this.headers[header]);\n });\n return request(uri, {\n method: method.toUpperCase(),\n headers: myHeaders,\n body,\n signal\n });\n }\n\n sendAsyncByFetch(requestConfig) {\n const request = RequestLibrary;\n const { timeout } = this;\n const control = typeof AbortController === 'function' ? new AbortController() : {};\n const config = { ...requestConfig, signal: control.signal, credentials: 'omit' };\n // Simulation timeout\n return Promise.race([\n this.requestSendByFetch(config, request),\n HttpProvider.timeoutPromise(timeout)\n ]).then(result => new Promise((resolve, reject) => {\n // @deprecated unuse timeout=1\n // if (timeout !== 1) {\n try {\n if (result.type === 'timeout') {\n // Cancel timeout request\n if (control.abort) control.abort();\n reject(result);\n } else {\n result\n .text()\n .then(text => {\n const res = HttpProvider.formatResponse(text);\n if (result.status !== 200 || !result.ok) {\n reject(res);\n return;\n }\n resolve(res);\n })\n .catch(err => reject(err));\n }\n } catch (e) {\n reject(e);\n }\n // }\n }));\n }\n\n requestSend(requestConfig, request, isAsync = false) {\n const {\n url,\n method = 'POST',\n params = {}\n } = requestConfig;\n const path = `/api/${url}`.replace(/\\/\\//g, '\\/');\n let uri = `${this.host}${path}`.replace();\n if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') {\n uri = Object.keys(params).length > 0 ? `${uri}?${stringify(params)}` : uri;\n }\n request.open(method.toUpperCase(), uri, isAsync);\n Object.keys(this.headers).forEach(header => {\n request.setRequestHeader(header, this.headers[header]);\n });\n if (method.toUpperCase() === 'GET' || method.toUpperCase() === 'DELETE') {\n request.send();\n } else {\n request.send(JSON.stringify(params));\n }\n }\n\n send(requestConfig) {\n if (isFetch) throw new Error(\"Can not get XMLHttpRequest, invalid parameter: 'sync'\");\n const request = new RequestLibrary();\n request.withCredentials = false;\n this.requestSend(requestConfig, request);\n let result = request.responseText;\n\n result = HttpProvider.formatResponse(result);\n if (result.Error) {\n throw result;\n }\n return result;\n }\n\n sendAsync(requestConfig) {\n if (isFetch) return this.sendAsyncByFetch(requestConfig);\n return this.sendAsyncByXMLHttp(requestConfig);\n }\n\n sendAsyncByXMLHttp(requestConfig) {\n const request = new RequestLibrary();\n request.withCredentials = false;\n request.timeout = this.timeout;\n this.requestSend(requestConfig, request, true);\n return new Promise((resolve, reject) => {\n request.onreadystatechange = () => {\n if (request.readyState === 4 && request.timeout !== 1) {\n let result = request.responseText;\n try {\n result = HttpProvider.formatResponse(result);\n if (request.status !== 200 || result.Error) {\n reject(result);\n } else {\n resolve(result);\n }\n } catch (e) {\n // todo: error handle\n reject(e);\n }\n }\n };\n\n request.onerror = err => {\n reject(err);\n };\n request.ontimeout = err => {\n // todo: timeout error\n reject(err);\n };\n });\n }\n\n isConnected() {\n try {\n this.send({\n method: 'GET',\n url: 'blockChain/chainStatus'\n });\n return true;\n } catch (e) {\n return false;\n }\n }\n\n async isConnectedAsync() {\n try {\n return await this.sendAsyncByFetch({\n method: 'GET',\n url: 'blockChain/chainStatus'\n });\n } catch (e) {\n return false;\n }\n }\n}\n","/**\n * @file settings\n * @author atom-yang\n */\n\nexport default class Settings {\n constructor() {\n this.defaultAccount = undefined;\n }\n}\n","/**\n * @file AElf-sdk index export\n * @author atom-yang\n */\nimport * as protobuf from '@aelfqueen/protobufjs/light';\nimport * as bloom from './util/bloom';\nimport Chain from './chain';\nimport RequestManager from './util/requestManage';\nimport HttpProvider from './util/httpProvider';\nimport wallet from './wallet';\nimport * as utils from './util/utils';\nimport * as proto from './util/proto';\nimport * as transform from './util/transform';\nimport Settings from './util/settings';\nimport sha256 from './util/sha256';\n\n/* eslint-disable no-underscore-dangle */\nexport default class AElf {\n constructor(provider) {\n this._requestManager = new RequestManager(provider);\n this.currentProvider = provider;\n this.chain = new Chain(this._requestManager);\n }\n\n static version = process.env.SDK_VERSION;\n\n static providers = {\n HttpProvider,\n };\n\n /**\n * @type {protobuf} export protobufjs for developers\n */\n static pbjs = protobuf;\n\n static pbUtils = proto;\n\n static wallet = wallet;\n\n static utils = {\n ...utils,\n ...bloom,\n sha256,\n transform,\n };\n\n providers = {\n HttpProvider,\n };\n\n settings = new Settings();\n\n /**\n * AElf-sdk version\n * @type {{api: string}}\n */\n version = {\n api: process.env.SDK_VERSION,\n };\n\n /**\n * check the rpc node is work or not.\n * @returns {boolean} whether can connect to the rpc.\n */\n isConnected() {\n return this.currentProvider && this.currentProvider.isConnected();\n }\n\n setProvider(provider) {\n this._requestManager.setProvider(provider);\n this.currentProvider = provider;\n }\n}\n/* eslint-enable */\n"],"names":["root","factory","exports","module","define","amd","globalThis","Object","create","ctor","superCtor","super_","prototype","constructor","value","enumerable","writable","configurable","TempCtor","buffer","Buffer","copyProps","src","dst","key","SafeBuffer","arg","encodingOrOffset","length","from","alloc","allocUnsafe","allocUnsafeSlow","TypeError","size","fill","encoding","buf","undefined","SlowBuffer","assert","val","msg","Error","inherits","BN","number","base","endian","isBN","this","negative","words","red","_init","wordSize","window","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","start","end","mul","len","Math","min","i","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","ceil","j","w","off","strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","dest","clone","_expand","_normSign","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","res","q","andln","iushrn","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","jumboMulTo","FFTM","mulp","x","y","mulTo","hncarry","bigMulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","_strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","base64","ieee754","customInspectSymbol","Symbol","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","RangeError","Uint8Array","setPrototypeOf","isEncoding","actual","write","slice","fromString","ArrayBuffer","isView","arrayView","isInstance","fromArrayBuffer","byteOffset","fromArrayLike","fromArrayView","SharedArrayBuffer","valueOf","obj","isBuffer","checked","numberIsNaN","type","data","fromObject","toPrimitive","assertSize","array","mustMatch","arguments","loweredCase","utf8ToBytes","base64ToBytes","toLowerCase","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","dir","arrayIndexOf","indexOf","lastIndexOf","arr","indexSize","arrLength","valLength","String","read","readUInt16BE","foundIndex","found","hexWrite","offset","Number","remaining","strLen","parsed","parseInt","substr","utf8Write","blitBuffer","asciiWrite","byteArray","push","asciiToBytes","base64Write","ucs2Write","units","utf16leToBytes","fromByteArray","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","codePoints","MAX_ARGUMENTS_LENGTH","fromCharCode","apply","decodeCodePointsArray","kMaxLength","TYPED_ARRAY_SUPPORT","proto","foo","typedArraySupport","console","error","defineProperty","get","poolSize","_isBuffer","compare","concat","list","pos","set","swap16","swap32","swap64","toLocaleString","equals","trim","target","thisStart","thisEnd","thisCopy","targetCopy","includes","isFinite","_arr","hexSliceLookupTable","bytes","checkOffset","ext","checkInt","wrtBigUInt64LE","checkIntBI","BigInt","wrtBigUInt64BE","checkIEEE754","writeFloat","noAssert","writeDouble","newBuf","subarray","readUintLE","readUIntLE","readUintBE","readUIntBE","readUint8","readUInt8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUInt32LE","readUint32BE","readUInt32BE","readBigUInt64LE","defineBigIntMethod","validateNumber","first","last","boundsError","readBigUInt64BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readBigInt64LE","readBigInt64BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUintLE","writeUIntLE","writeUintBE","writeUIntBE","writeUint8","writeUInt8","writeUint16LE","writeUInt16LE","writeUint16BE","writeUInt16BE","writeUint32LE","writeUInt32LE","writeUint32BE","writeUInt32BE","writeBigUInt64LE","writeBigUInt64BE","writeIntLE","limit","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","writeBigInt64LE","writeBigInt64BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","copyWithin","code","errors","E","sym","getMessage","Base","super","stack","message","addNumericalSeparator","range","ERR_OUT_OF_RANGE","checkBounds","ERR_INVALID_ARG_TYPE","floor","ERR_BUFFER_OUT_OF_BOUNDS","received","isInteger","INVALID_BASE64_RE","Infinity","leadSurrogate","toByteArray","base64clean","alphabet","table","i16","fn","BufferBigIntNotDefined","Type","Enum","util","roots","codegen","fetch","path","fs","inquire","object","keys","toObject","safePropBackslashRe","safePropQuoteRe","isReserved","test","safeProp","prop","ucFirst","charAt","toUpperCase","substring","camelCaseRe","camelCase","$0","$1","compareFieldsById","id","decorateType","typeName","$type","decorateRoot","remove","decorateEnumIndex","decorateEnum","enm","utils","minAssert","minUtils","zero2","toHex","encode","getNAF","naf","getJSF","k1","k2","jsf","m8","d1","d2","u1","u2","m14","m24","cachedProperty","computer","parseBytes","intFromLE","equal","ReflectionObject","className","Namespace","values","options","comment","comments","valuesById","reserved","fromJSON","json","toJSONOptions","keepComments","Boolean","isString","isReservedId","isReservedName","allow_alias","merge","ifNotSet","newError","CustomError","properties","captureStackTrace","asPromise","EventEmitter","float","utf8","pool","LongBits","global","emptyArray","freeze","emptyObject","isNode","process","versions","node","isObject","isset","isSet","hasOwnProperty","BufferTemp","_Buffer_from","_Buffer_allocUnsafe","newBuffer","sizeOrArray","Long","dcodeIO","key2Re","key32Re","key64Re","longToHash","toHash","zeroHash","longFromHash","hash","unsigned","fromHash","fromBits","lcFirst","ProtocolError","oneOfGetter","fieldNames","fieldMap","oneOfSetter","longs","enums","_configure","isSurrogatePair","htonl","zero8","enc","toHex32","join32","split32","rotr32","rotl32","sum32","sum32_3","sum32_4","d","sum32_5","sum64","ah","al","bh","sum64_hi","bl","sum64_lo","sum64_4_hi","ch","cl","dh","dl","sum64_4_lo","sum64_5_hi","eh","el","sum64_5_lo","rotr64_hi","rotr64_lo","shr64_hi","shr64_lo","ReflectOwnKeys","R","Reflect","ReflectApply","receiver","args","Function","ownKeys","getOwnPropertySymbols","getOwnPropertyNames","NumberIsNaN","isNaN","init","once","emitter","Promise","resolve","reject","errorListener","err","removeListener","resolver","eventTargetAgnosticAddListener","handler","flags","on","addErrorHandlerIfEventEmitter","_events","_eventsCount","_maxListeners","defaultMaxListeners","checkListener","listener","_getMaxListeners","that","_addListener","prepend","events","existing","warning","newListener","emit","unshift","warned","count","warn","onceWrapper","fired","wrapFn","_onceWrap","state","wrapped","bind","_listeners","unwrap","evlistener","unwrapListeners","arrayClone","listenerCount","addEventListener","wrapListener","removeEventListener","getPrototypeOf","setMaxListeners","getMaxListeners","doError","er","context","listeners","addListener","prependListener","prependOnceListener","position","originalListener","pop","spliceOne","removeAllListeners","rawListeners","eventNames","CryptoJS","crypto","msCrypto","cryptoSecureRandomInt","getRandomValues","Uint32Array","randomBytes","F","subtype","C_lib","lib","extend","overrides","mixIn","$super","instance","propertyName","WordArray","sigBytes","encoder","Hex","stringify","wordArray","thisWords","thatWords","thisSigBytes","thatSigBytes","clamp","thatByte","random","nBytes","C_enc","hexChars","bite","join","parse","hexStr","hexStrLength","Latin1","latin1Chars","latin1Str","latin1StrLength","Utf8","decodeURIComponent","escape","utf8Str","unescape","encodeURIComponent","BufferedBlockAlgorithm","reset","_data","_nDataBytes","_append","_process","doFlush","processedWords","dataWords","dataSigBytes","blockSize","nBlocksReady","nWordsReady","_minBufferSize","nBytesReady","_doProcessBlock","splice","C_algo","Hasher","cfg","_doReset","update","messageUpdate","finalize","_doFinalize","_createHelper","hasher","_createHmacHelper","HMAC","algo","MAX_BYTES","cb","generated","nextTick","MD5","RIPEMD160","sha","Hash","_hash","_update","_final","digest","alg","Transform","StringDecoder","CipherBase","hashMode","_finalOrDigest","final","__final","_decoder","_encoding","inputEnc","outputEnc","outData","_toString","setAutoPadding","getAuthTag","setAuthTag","setAAD","_transform","_flush","done","fin","Field","types","ruleRe","rule","required","optional","repeated","map","partOf","typeDefault","defaultValue","long","resolvedType","extensionField","declaringField","_packed","getOption","setOption","resolved","defaults","parent","lookupTypeOrEnum","packed","fromNumber","decode","fieldId","fieldType","fieldRule","fieldName","Type_","Root","filename","defineProperties","ptr","fullName","onAdd","_handleAdd","onRemove","_handleRemove","setOptions","Root_","bake","basic","mapKey","finalSize","_block","_finalSize","_blockSize","_len","block","accum","assigned","remainder","rem","lowBits","highBits","Service","arrayToJSON","nested","_nestedArray","clearCache","namespace","addJSON","nestedArray","nestedJson","names","fields","methods","getEnum","part","resolveAll","lookup","filterTypes","parentAlreadyChecked","lookupType","lookupEnum","lookupService","Service_","Enum_","elliptic","version","rand","curve","curves","ec","eddsa","codes","createErrorType","NodeError","_Base","subClass","superClass","arg1","arg2","arg3","__proto__","oneOf","expected","thing","determiner","search","this_len","endsWith","getOwnPropertyDescriptors","descriptors","getOwnPropertyDescriptor","formatRegExp","format","f","objects","JSON","isNull","deprecate","noDeprecation","throwDeprecation","traceDeprecation","trace","debugs","debugEnvRegex","env","NODE_DEBUG","debugEnv","RegExp","opts","seen","stylize","stylizeNoColor","depth","colors","isBoolean","showHidden","_extend","isUndefined","customInspect","stylizeWithColor","formatValue","styleType","style","styles","recurseTimes","isFunction","primitive","simple","isNumber","formatPrimitive","visibleKeys","forEach","idx","arrayToHash","isError","formatError","isRegExp","isDate","Date","braces","toUTCString","formatProperty","match","formatArray","reduce","cur","reduceToSingleString","desc","line","ar","objectToString","pad","debuglog","pid","isNullOrUndefined","isSymbol","isNativeError","isPrimitive","months","log","time","getHours","getMinutes","getSeconds","getDate","getMonth","origin","kCustomPromisifiedSymbol","callbackifyOnRejected","reason","newReason","promisify","original","promiseResolve","promiseReject","promise","custom","callbackify","callbackified","maybeCb","then","rej","nb","nenc","retried","_normalizeEncoding","normalizeEncoding","text","utf16Text","utf16End","fillLast","utf8FillLast","base64Text","base64End","simpleWrite","simpleEnd","lastNeed","lastTotal","lastChar","utf8CheckByte","byte","utf8CheckExtraBytes","utf8CheckIncomplete","objectKeys","Duplex","Readable","Writable","v","method","allowHalfOpen","readable","onend","_writableState","ended","onEndNT","highWaterMark","getBuffer","_readableState","destroyed","OneOf","oneof","fieldsArray","addFieldsToParent","field","oneofName","BaseCurve","conf","zero","two","pointFromJSON","gRed","_wnafT1","_wnafT2","_wnafT3","_wnafT4","_bitLength","adjustCount","redN","_maxwellTrick","BasePoint","precomputed","point","validate","_fixedNafMul","doubles","_getDoubles","I","step","nafW","repr","jpoint","mixedAdd","points","toP","_wnafMul","nafPoints","_getNAFPoints","dblp","_wnafMulAdd","defW","coeffs","jacobianResult","wndWidth","comb","toJ","ja","jb","decodePoint","pointFromX","encodeCompressed","_encode","compact","getX","getY","precompute","power","beta","_getBeta","_hasDoubles","dbl","BlockHash","pending","pendingTotal","outSize","hmacStrength","padLength","_delta8","_delta32","_pad","_digest","config","localStorage","hasSymbols","toStringTag","$SyntaxError","SyntaxError","$Function","$TypeError","getEvalledConstructor","expressionSyntax","$gOPD","throwTypeError","ThrowTypeError","calleeThrows","gOPDthrows","getProto","needsEval","TypedArray","INTRINSICS","AggregateError","iterator","Atomics","BigInt64Array","BigUint64Array","DataView","decodeURI","encodeURI","eval","EvalError","Float32Array","Float64Array","FinalizationRegistry","Int8Array","Int16Array","Int32Array","Map","parseFloat","Proxy","ReferenceError","Set","Uint8ClampedArray","Uint16Array","URIError","WeakMap","WeakRef","WeakSet","errorProto","doEval","gen","LEGACY_ALIASES","hasOwn","$concat","$spliceApply","$replace","$strSlice","$exec","exec","rePropName","reEscapeChar","getBaseIntrinsic","allowMissing","alias","intrinsicName","parts","result","quote","subString","stringToPath","intrinsicBaseName","intrinsic","intrinsicRealName","skipFurtherCaching","isOwn","toStr","origDefineProperty","hasPropertyDescriptors","supportsDescriptors","predicate","predicates","props","password","salt","keyBits","ivLen","keyLen","iv","used","keyStart","ivStart","asn1","aesid","fixProc","ciphers","compat","parseKeys","passphrase","ndata","stripped","tag","certificate","tbsCertificate","subjectPublicKeyInfo","PublicKey","algorithm","RSAPublicKey","subjectPublicKey","subjectPrivateKey","params","pub_key","DSAparam","decrypt","kde","kdeparams","iters","cipher","cipherText","keylen","pbkdf2Sync","createDecipheriv","EncryptedPrivateKey","PrivateKey","RSAPrivateKey","privateKey","ECPrivateKey","priv_key","DSAPrivateKey","parameters","signature","GetIntrinsic","$apply","$call","$reflectApply","$defineProperty","$max","originalFunction","func","applyBind","reverse","tagClass","tagClassByName","tagByName","Writer","BufferWriter","Op","noop","State","writer","head","tail","states","writeByte","VarintOp","writeVarint64","writeFixed32","_push","uint32","int32","sint32","uint64","int64","sint64","zzEncode","bool","fixed32","sfixed32","fixed64","sfixed64","double","writeBytes","fork","ldelim","finish","BufferWriter_","Reader","BufferReader","indexOutOfRange","reader","writeLength","create_array","readLongVarint","readFixed32_end","readFixed64","_slice","skip","skipType","wireType","BufferReader_","zzDecode","MapField","Message","decoder","verifier","converter","wrappers","oneofs","extensions","group","_fieldsById","_fieldsArray","_oneofsArray","_ctor","verify","fieldsById","oneofsArray","generateConstructor","ctorProperties","mtype","keyType","inherited","filter","setup","wrapper","originalThis","encodeDelimited","decodeDelimited","resolvedKeyType","fieldKeyType","fieldValueType","Method","rpc","_methodsArray","service","methodsArray","rpcImpl","requestDelimited","responseDelimited","rpcService","methodName","resolvedRequestType","resolvedResponseType","requestType","responseType","requestStream","responseStream","common","deferred","files","SYNC","resolvePath","load","callback","sync","source","imports","weakImports","queued","weak","altname","setTimeout","readFileSync","loadSync","exposeRe","tryHandleExtension","extendedType","sisterField","parse_","common_","Rand","generate","_rand","getBytes","getByte","pre","PresetCurve","short","edwards","isInfinity","defineCurve","sha256","sha384","sha512","lambda","basis","ripemd","hmac","sha1","sha224","ripemd160","HashBase","ARRAY16","_a","_b","_c","_d","rotl","fnF","fnG","fnH","fnI","M","_blockOffset","_length","ERR_STREAM_PREMATURE_CLOSE","eos","stream","called","_key","onlegacyfinish","onfinish","writableEnded","finished","readableEnded","endEmitted","onerror","onclose","onrequest","req","setHeader","abort","isRequest","zl","zr","sl","sr","hl","hr","_e","fn1","fn2","fn3","fn4","fn5","br","cr","dr","tl","tr","Algorithm","callBind","$indexOf","implementation","rng","pseudoRandomBytes","prng","createHash","createHmac","Hmac","algos","algoKeys","hashes","getHashes","pbkdf2","aes","Cipher","createCipher","Cipheriv","createCipheriv","Decipher","createDecipher","Decipheriv","getCiphers","listCiphers","DiffieHellmanGroup","createDiffieHellmanGroup","getDiffieHellman","createDiffieHellman","DiffieHellman","sign","createSign","Sign","createVerify","Verify","createECDH","publicEncrypt","privateEncrypt","publicDecrypt","privateDecrypt","rf","randomFill","randomFillSync","createCredentials","constants","bufferOff","_updateDecrypt","_updateEncrypt","_buffer","_flushBuffer","inputOff","outputOff","_finalEncrypt","_finalDecrypt","_unpad","modeModules","ECB","CBC","CFB","CFB8","CFB1","OFB","CTR","GCM","modes","asUInt32Array","scrubVec","cryptBlock","keySchedule","SUB_MIX","SBOX","nRounds","t0","t1","t2","t3","SUB_MIX0","SUB_MIX1","SUB_MIX2","SUB_MIX3","s0","s1","s2","s3","ksRow","RCON","G","INV_SBOX","INV_SUB_MIX","xi","sx","x4","x8","AES","_reset","keySize","keyWords","ksRows","invKeySchedule","ik","ksR","tt","_nRounds","_keySchedule","_invKeySchedule","encryptBlockRaw","encryptBlock","decryptBlock","m1","scrub","getr","priv","modulus","prime1","prime2","crt","blinds","blinder","publicExponent","unblinder","blind","blinded","c1","c2","qinv","coefficient","exponent1","m2","exponent2","safer","Safer","kStringMaxLength","binding","MAX_LENGTH","MAX_STRING_LENGTH","Reporter","EncoderBuffer","DecoderBuffer","tags","Node","_baseState","children","reverseArgs","choice","any","use","useDecoder","explicit","implicit","contains","_wrap","stateProps","cstate","body","child","_useArgs","item","def","newKey","_decode","wrapResult","prevObj","present","prevKey","enterKey","_peekTag","save","_decodeGeneric","_decodeChoice","restore","enterObject","_decodeTag","raw","track","_getUse","_reporterState","leaveObject","exitKey","leaveKey","_decodeList","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeBool","_decodeInt","entity","_use","some","_createEncoderBuffer","reporter","_encodeValue","_skipDefault","content","_encodeChoice","_encodePrimitive","cls","_encodeComposite","_encodeStr","_encodeObjid","_encodeTime","_encodeNull","_encodeInt","_encodeBool","_isNumstr","_isPrintstr","isEncoderBuffer","isDecoderBuffer","isEmpty","fail","EvpKDF","iterations","compute","derivedKey","derivedKeyWords","Stream","PassThrough","pipeline","_typeof","isDeepEqual","isDeepStrictEqual","_require$codes","ERR_AMBIGUOUS_ARGUMENT","ERR_INVALID_ARG_VALUE","ERR_INVALID_RETURN_VALUE","ERR_MISSING_ARGS","AssertionError","_require$types","isPromise","objectAssign","assign","objectIs","is","lazyLoadComparison","comparison","ok","NO_EXCEPTION_SENTINEL","innerFail","innerOk","argLen","generatedMessage","operator","stackStartFn","internalMessage","argsLen","emitWarning","errArgs","notEqual","deepEqual","notDeepEqual","deepStrictEqual","notDeepStrictEqual","strictEqual","notStrictEqual","Comparison","_this","Constructor","_classCallCheck","expectedException","compareExceptionKey","isPrototypeOf","getActual","checkIsPromise","catch","waitForActual","promiseFn","resultPromise","expectsError","details","fnType","expectsNoError","strict","_len6","_key6","throws","_len2","_key2","rejects","_len3","_key3","doesNotThrow","_len4","_key4","doesNotReject","_len5","_key5","ifError","newErr","origStack","tmp2","tmp1","move","_move","for","modrn","allocate","_toArrayLikeLE","_toArrayLikeBE","isNegNum","moduleName","ref","sort","genTypePartial","fieldIndex","rfield","missing","seenFirstField","invalid","genVerifyKey","genVerifyValue","oneofProp","genValuePartial_fromObject","isUnsigned","genValuePartial_toObject","repeatedFields","mapFields","normalFields","low","high","arrayDefault","hasKs2","type_url","tokenize","delimRe","stringDoubleRe","stringSingleRe","setCommentRe","setCommentAltRe","setCommentSplitRe","whitespaceRe","unescapeRe","unescapeMap","alternateCommentMode","commentType","commentText","commentLine","commentLineEmpty","stringDelim","illegal","subject","setComment","commentOffset","lines","isDoubleSlashCommentLine","startOffset","endOffset","findEndOfLine","lineText","cursor","lastIndex","readString","repeat","curr","isDoc","token","peek","cmnt","trailingLine","shaCommon","ch32","maj32","s0_256","s1_256","g0_256","g1_256","sha256_K","SHA256","W","T1","T2","sha512_K","SHA512","ch64_hi","xh","xl","yh","yl","zh","ch64_lo","maj64_hi","maj64_lo","s0_512_hi","s0_512_lo","s1_512_lo","g0_512_hi","g0_512_lo","g1_512_lo","_prepareBlock","c0_hi","c0_lo","c1_hi","c1_lo","c2_hi","c2_lo","c3_hi","c3_lo","fh","fl","gh","gl","hh","c4_hi","c4_lo","T1_hi","T1_lo","T2_hi","T2_lo","_finalized","chunk","prefix","throwIfNotStringOrBuffer","ReadableState","debug","EElistenerCount","OurUint8Array","debugUtil","createReadableStreamAsyncIterator","BufferList","destroyImpl","getHighWaterMark","ERR_STREAM_PUSH_AFTER_EOF","ERR_METHOD_NOT_IMPLEMENTED","ERR_STREAM_UNSHIFT_AFTER_END_EVENT","errorOrDestroy","kProxyEvents","isDuplex","objectMode","readableObjectMode","pipes","pipesCount","flowing","reading","needReadable","emittedReadable","readableListening","resumeScheduled","paused","emitClose","autoDestroy","defaultEncoding","awaitDrain","readingMore","_read","destroy","_destroy","readableAddChunk","addToFront","skipChunkCheck","emitReadable","emitReadable_","onEofChunk","chunkInvalid","_uint8ArrayToBuffer","addChunk","maybeReadMore","_undestroy","undestroy","isPaused","setEncoding","clear","MAX_HWM","howMuchToRead","computeNewHighWaterMark","flow","maybeReadMore_","updateReadableListening","resume","nReadingNextTick","resume_","fromList","consume","endReadable","endReadableNT","wState","xs","nOrig","doRead","pipe","pipeOpts","endFn","stdout","stderr","unpipe","onunpipe","unpipeInfo","hasUnpiped","ondrain","ondata","cleanedUp","needDrain","pipeOnDrain","pause","event","dests","ev","wrap","asyncIterator","_fromList","iterable","emitErrorAndCloseNT","emitErrorNT","emitCloseNT","readableDestroyed","writableDestroyed","errorEmitted","ending","finalCalled","prefinished","rState","ERR_INVALID_OPT_VALUE","duplexKey","hwm","highWaterMarkFrom","CorkedRequest","entry","corkReq","pendingcb","onCorkedFinish","corkedRequestsFree","WritableState","realHasInstance","internalUtil","ERR_MULTIPLE_CALLBACK","ERR_STREAM_CANNOT_PIPE","ERR_STREAM_DESTROYED","ERR_STREAM_NULL_VALUES","ERR_STREAM_WRITE_AFTER_END","ERR_UNKNOWN_ENCODING","nop","writableObjectMode","noDecode","decodeStrings","writing","corked","bufferProcessing","onwrite","writecb","writelen","onwriteStateUpdate","finishMaybe","onwriteError","needFinish","bufferedRequest","clearBuffer","afterWrite","lastBufferedRequest","bufferedRequestCount","_write","writev","_writev","doWrite","onwriteDrain","holder","allBuffers","isBuf","callFinal","need","prefinish","hasInstance","writeAfterEnd","validChunk","newChunk","decodeChunk","writeOrBuffer","cork","uncork","setDefaultEncoding","endWritable","ERR_TRANSFORM_ALREADY_TRANSFORMING","ERR_TRANSFORM_WITH_LENGTH_0","afterTransform","ts","_transformState","transforming","writechunk","rs","needTransform","writeencoding","flush","err2","K","Sha256","_w","maj","sigma0","sigma1","gamma0","_f","_g","_h","H","Sha512","Ch","Gamma0","Gamma0l","Gamma1","Gamma1l","getCarry","_ah","_bh","_ch","_dh","_eh","_fh","_gh","_hh","_al","_bl","_cl","_dl","_el","_fl","_gl","_hl","gamma0l","gamma1","gamma1l","Wi7h","Wi7l","Wi16h","Wi16l","Wil","Wih","majh","majl","sigma0h","sigma0l","sigma1h","sigma1l","Kih","Kil","chh","chl","t1l","t1h","t2l","t2h","writeInt64BE","MAX_ALLOC","browser","md5","checkParameters","ZEROS","sizes","rmd160","saltLen","getDigest","blocksize","ipad","opad","ipad1","ipad2","run","DK","block1","destPos","hLen","T","U","symObj","syms","propertyIsEnumerable","descriptor","isCallable","thisArg","forEachArray","forEachString","forEachObject","possibleNames","availableTypedArrays","callBound","$toString","hasToStringTag","gOPD","typedArrays","$slice","toStrTags","typedArray","superProto","anyTrue","getter","tryTypedArrays","getPolyfill","shim","polyfill","isArgs","callee","NaN","Legacy","_alg","_ipad","_opad","DESState","DES","_desState","deriveKeys","shiftTable","kL","kR","pc1","r28shl","pc2","inp","inOff","outOff","ip","_encrypt","_decrypt","lStart","rStart","keyL","keyR","expand","substitute","rip","deciphers","GHASH","incr32","StreamCipher","_cipher","ck","_ghash","_finID","ghash","toPad","ivBits","calcIv","_prev","_cache","_secCache","_alen","_mode","_authTag","_called","rump","encrypt","xorTest","findPrime","simpleSieve","fermatTest","TWENTYFOUR","millerRabin","ONE","TWO","FIVE","TEN","THREE","ELEVEN","FOUR","_getPrimes","n2","bn","brorand","MillerRabin","_randbelow","min_bytes","_randrange","stop","rone","n1","rn1","getDivisor","bignum","decoders","encoders","der","pem","DEREncoder","tree","DERNode","encodedTag","encodeTag","header","lenOctets","unused","relative","ident","objid","date","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","numArray","_getEncoder","dataBuffer","defaultBuffer","ReporterError","rethrow","pathLen","now","elem","partial","DERDecoder","derDecodeTag","oct","tagStr","derDecodeLen","decodedTag","_skipUntilEnd","possibleEnd","numstr","printstr","identifiers","subident","second","year","mon","day","hour","sec","UTC","_getDecoder","i2ops","seed","paddedMsg","MAX_VALUE","blockmix_salsa8","BY","Bi","Yi","_X","B32","arraycopy","blockxor","salsa20_8","bi","S","Si","Di","srcPos","checkAndInit","dkLen","progressCallback","tickCallback","XY","V","totalOps","currentOp","percent","smix","async","promiseInterval","setImmediate","smixSync","$protobuf","Root_toDescriptorRecursive","ns","syntax","file","FileDescriptorProto","messageType","toDescriptor","enumType","extension","toDescriptorOptions","FileOptions","fromDescriptor","FileDescriptorSet","fileDescriptor","filePackage","fromDescriptorOptions","ks","unnamedMessageIndex","DescriptorProto","MessageOptions","oneofDecl","oneofIndex","nestedType","mapEntry","extensionRange","reservedRange","reservedName","fieldDescriptor","toDescriptorType","valueType","valueTypeName","shortname","FieldDescriptorProto","label","ExtensionRange","ReservedRange","numberRe","fromDescriptorType","extendee","FieldOptions","packableDescriptorType","unnamedEnumIndex","EnumDescriptorProto","EnumOptions","EnumValueDescriptorProto","unnamedOneofIndex","OneofDescriptorProto","unnamedServiceIndex","ServiceDescriptorProto","ServiceOptions","unnamedMethodIndex","to","fromPath","toPath","other","MethodDescriptorProto","inputType","outputType","clientStreaming","serverStreaming","MethodOptions","strictUriEncode","decodeComponent","splitOnFirst","filterObject","encodeFragmentIdentifier","validateArrayFormatSeparator","keysSorter","removeHash","hashStart","extract","queryStart","parseValue","parseNumbers","parseBooleans","query","arrayFormat","arrayFormatSeparator","formatter","accumulator","isEncodedArray","newValue","arrayValue","parserForArrayFormat","param","shouldFilter","skipNull","skipEmptyString","keyValueSep","encoderForArrayFormat","objectCopy","parseUrl","url","url_","parseFragmentIdentifier","fragmentIdentifier","stringifyUrl","queryFromUrl","parsedQueryFromUrl","queryString","getHash","pick","exclude","exclusionFilter","BlockCipher","SUB_MIX_0","SUB_MIX_1","SUB_MIX_2","SUB_MIX_3","INV_SUB_MIX_0","INV_SUB_MIX_1","INV_SUB_MIX_2","INV_SUB_MIX_3","_keyPriorReset","invKsRow","_doCryptBlock","Base64","_map","base64Chars","triplet","paddingChar","base64Str","base64StrLength","reverseMap","_reverseMap","paddingIndex","bitsCombined","parseLoop","offset_i","M_offset_i","M_offset_0","M_offset_1","M_offset_2","M_offset_3","M_offset_4","M_offset_5","M_offset_6","M_offset_7","M_offset_8","M_offset_9","M_offset_10","M_offset_11","M_offset_12","M_offset_13","M_offset_14","M_offset_15","FF","GG","HH","II","nBitsTotal","nBitsLeft","nBitsTotalH","nBitsTotalL","H_i","HmacMD5","SHA1","HmacSHA1","_hasher","hasherBlockSize","hasherBlockSizeBytes","oKey","_oKey","iKey","_iKey","oKeyWords","iKeyWords","innerHash","C_mode","BlockCipherMode","Pkcs7","CipherParams","OpenSSLFormatter","SerializableCipher","OpenSSLKdf","PasswordBasedCipher","createEncryptor","_ENC_XFORM_MODE","createDecryptor","_DEC_XFORM_MODE","xformMode","_xformMode","dataUpdate","ivSize","selectCipherStrategy","ciphertext","Encryptor","Decryptor","_iv","xorBlock","_prevBlock","processBlock","thisBlock","blockSizeBytes","nPaddingBytes","paddingWord","paddingWords","unpad","modeCreator","__creator","finalProcessedBlocks","cipherParams","OpenSSL","openSSLStr","ciphertextWords","encryptor","cipherCfg","_parse","kdf","execute","derivedParams","protobuf","build","configure","b64","s64","invalidEncoding","evt","f32","f8b","le","writeFloat_f32_cpy","writeFloat_f32_rev","readFloat_f32_cpy","readFloat_f32_rev","writeFloat_ieee754","writeUint","exponent","LN2","readFloat_ieee754","readUint","uint","mantissa","f64","writeDouble_f64_cpy","writeDouble_f64_rev","readDouble_f64_cpy","readDouble_f64_rev","writeDouble_ieee754","off0","off1","readDouble_ieee754","SIZE","MAX","slab","toLong","part0","part1","part2","writeBytesBuffer","writeStringBuffer","rpcCall","requestCtor","responseCtor","request","response","endedByRPC","functionParams","functionName","Codegen","formatStringOrScope","verbose","scopeKeys","scopeParams","scopeValues","scopeOffset","formatParams","formatOffset","functionNameOverride","xhr","readFile","contents","XMLHttpRequest","binary","onreadystatechange","readyState","status","responseText","overrideMimeType","open","send","isAbsolute","normalize","absolute","originPath","includePath","alreadyNormalized","basex","ALPHABET","BASE_MAP","xc","BASE","LEADER","FACTOR","iFACTOR","decodeUnsafe","psz","zeroes","b256","it3","it4","vch","pbegin","pend","b58","it1","it2","keepCase","base10Re","base10NegRe","base16Re","base16NegRe","base8Re","base8NegRe","nameRe","typeRefRe","fqTypeRefRe","pkg","tn","isProto3","applyCase","insideTryCatch","readValue","acceptTypeRef","parseNumber","readRanges","acceptStrings","parseId","acceptNegative","parsePackage","parseImport","whichImports","parseSyntax","parseCommon","parseOption","ifBlock","parseInlineOptions","parseMapField","parseField","parseOneOf","parseType","dummy","parseEnumValue","parseEnum","parseMethod","parseService","reference","parseExtension","fnIf","fnElse","parseGroup","isCustom","parseOptionValue","timeType","commonRe","google","Any","Duration","seconds","nanos","Timestamp","Empty","Struct","Value","kind","nullValue","numberValue","stringValue","boolValue","structValue","listValue","NullValue","NULL_VALUE","ListValue","DoubleValue","FloatValue","Int64Value","UInt64Value","Int32Value","UInt32Value","BoolValue","StringValue","BytesValue","FieldMask","paths","ShortCurve","tinv","zeroA","threeA","endo","_getEndomorphism","_endoWnafT1","_endoWnafT2","Point","isRed","inf","JPoint","zOne","betas","_getEndoRoots","lambdas","vec","_getEndoBasis","ntinv","prevR","aprxSqrt","y1","y2","len1","_endoSplit","v1","v2","p1","p2","q1","q2","ax","rhs","_endoWnafMulAdd","npoints","ncoeffs","endoMul","obj2point","nx","ny","ys1","dyinv","mulAdd","jmulAdd","_precompute","negate","zinv","zinv2","ay","pz2","z2","h2","h3","nz","jx","jy","jz","jz4","jyd","jx2","jyd2","jyd4","dny","_zeroDbl","_threeDbl","_dbl","xx","yy","yyyy","yyyy8","c8","gamma","alpha","beta4","beta8","ggamma8","jy2","jxd4","jyd8","trpl","zz","mm","ee","yyu4","kbase","z3","pz3","eqXToP","zs","MontCurve","i4","a24","aa","bb","diffAdd","da","jumlAdd","EdwardsCurve","twisted","mOneA","dd","oneC","_mulA","_mulC","lhs","pointFromY","_extDbl","nt","_projDbl","_extAdd","_projAdd","zi","ft_1","sha1_K","p32","SHA224","SHA384","inner","outer","HmacDRBG","KeyPair","Signature","EC","nh","keyPair","keyFromPrivate","fromPrivate","keyFromPublic","pub","fromPublic","genKeyPair","drbg","pers","persEnc","entropy","entropyEnc","nonce","ns2","_truncateToN","truncOnly","bkey","getPrivate","ns1","iter","kp","kpX","recoveryParam","canonical","sinv","getPublic","recoverPubKey","isYOdd","isSecondKey","rInv","getKeyRecoveryParam","Q","Qprime","predResist","minEntropy","_reseed","reseedInterval","nonceEnc","_hmac","kmac","reseed","addEnc","temp","_importPrivate","privEnc","_importPublic","pubEnc","derive","_importDER","Position","place","getLength","initial","octetLen","rmPadding","constructLength","octets","slen","toDER","backHalf","EDDSA","pointClass","encodingLength","secret","keyFromSecret","hashInt","messagePrefix","Rencoded","encodePoint","s_","pubBytes","makeSignature","sig","SG","fromSecret","lastIx","normed","xIsOdd","encodeInt","decodeInt","isPoint","_secret","_pub","_pubBytes","privBytes","getSecret","_R","_S","_Rencoded","_Sencoded","Sencoded","toBytes","enumerableOnly","symbols","_objectSpread","_defineProperty","_toPropertyKey","_defineProperties","prim","_toPrimitive","protoProps","hasStrings","_getString","_getBuffer","_Object$setPrototypeO","kLastResolve","kLastReject","kError","kEnded","kLastPromise","kHandlePromise","kStream","createIterResult","readAndResolve","onReadable","AsyncIteratorPrototype","ReadableStreamAsyncIteratorPrototype","lastPromise","wrapForNext","_this2","_Object$create","streams","popCallback","destroys","closed","destroyer","Sha","rotl30","ft","Sha1","rotl5","Sha224","Sha384","EE","_isStdio","didOnEnd","cleanup","ZERO_BUF","subtle","toBrowser","checks","getNextTick","queueMicrotask","browserPbkdf2","importKey","deriveBits","resolvePromise","prom","checkNative","resp","bs58check","secp256k1","MASTER_SECRET","HARDENED_OFFSET","BITCOIN_VERSIONS","private","public","HDKey","_privateKey","_publicKey","chainCode","_fingerprint","parentFingerprint","serialize","hdkey","fingerprint","hash160","_identifier","identifier","privateKeyVerify","publicKeyCreate","publicKey","publicKeyVerify","publicKeyConvert","entries","hardened","childIndex","deriveChild","isHardened","indexBuffer","pk","zb","IL","IR","hd","privateKeyTweakAdd","publicKeyTweakAdd","wipePrivateData","xpriv","privateExtendedKey","xpub","publicExtendedKey","fromMasterSeed","seedBuffer","fromExtendedKey","base58key","keyBuffer","_getPrototypeOf","_setPrototypeOf","_assertThisInitialized","_possibleConstructorReturn","_inherits","inspected","isArgumentsObject","isGeneratorFunction","whichTypedArray","isTypedArray","uncurryThis","BigIntSupported","SymbolSupported","ObjectToString","booleanValue","bigIntValue","symbolValue","checkBoxedPrimitive","prototypeValueOf","isMapToString","isSetToString","isWeakMapToString","isWeakSetToString","isArrayBufferToString","isArrayBuffer","working","isDataViewToString","isDataView","isArrayBufferView","isUint8Array","isUint8ClampedArray","isUint16Array","isUint32Array","isInt8Array","isInt16Array","isInt32Array","isFloat32Array","isFloat64Array","isBigInt64Array","isBigUint64Array","isMap","isWeakMap","isWeakSet","SharedArrayBufferCopy","isSharedArrayBufferToString","isSharedArrayBuffer","isNumberObject","isStringObject","isBooleanObject","isBigIntObject","isSymbolObject","isAsyncFunction","isMapIterator","isSetIterator","isGeneratorObject","isWebAssemblyCompiledModule","isBoxedPrimitive","isAnyArrayBuffer","isStandardArguments","isLegacyArguments","supportsStandardArguments","origSymbol","hasSymbolSham","bound","boundLength","boundArgs","GeneratorFunction","fnToStr","isFnRegex","generatorFunc","getGeneratorFunc","foundName","badArrayLike","isCallableMarker","reflectApply","constructorRegex","isES6ClassFn","fnStr","tryFunctionObject","isIE68","isDDA","document","all","strClass","_wrapNativeSuper","Class","has","Wrapper","_construct","Parent","construct","sham","isNativeReflectConstruct","blue","green","white","kReadableOperator","strictEqualObject","notStrictEqualObject","notIdentical","copyError","inspectValue","maxArrayLength","breakLength","showProxy","sorted","getters","_Error","stackTraceLimit","isTTY","getColorDepth","lastPos","skipped","actualInspected","actualLines","expectedLines","indicator","inputLength","columns","maxCount","maxLines","_actualLines","printedLines","skippedMsg","expectedLine","actualLine","divergingLines","createErrDiff","_res","knownOperators","firstSource","nextSource","keysArray","nextIndex","nextKey","origKeys","keysShim","originalKeys","keysWorksWithArguments","isEnumerable","hasDontEnumBug","hasProtoEnumBug","dontEnums","equalsConstructorPrototype","excludedKeys","$applicationCache","$console","$external","$frame","$frameElement","$frames","$innerHeight","$innerWidth","$onmozfullscreenchange","$onmozfullscreenerror","$outerHeight","$outerWidth","$pageXOffset","$pageYOffset","$parent","$scrollLeft","$scrollTop","$scrollX","$scrollY","$self","$webkitIndexedDB","$webkitStorageInfo","$window","hasAutomationEqualityBug","isArguments","theKeys","skipProto","skipConstructor","equalsConstructorPrototypeIfNotBuggy","hasArrayLengthDefineBug","_slicedToArray","_arrayWithHoles","_n","_s","_i","_iterableToArrayLimit","_nonIterableRest","regexFlagsSupported","arrayFromSet","arrayFromMap","objectGetOwnPropertySymbols","isNonIndex","getOwnNonIndexProperties","kNoIterator","kIsArray","kIsSet","kIsMap","innerDeepEqual","val1","val2","memos","buf1","buf2","val1Tag","keys1","keys2","keyCheck","getTime","areSimilarTypedArrays","areSimilarFloatArrays","_keys","_keys2","isEqualBoxedPrimitive","getEnumerables","iterationType","aKeys","bKeys","symbolKeysA","symbolKeysB","_symbolKeysB","val2MemoA","val2MemoB","areEq","memo","aValues","setMightHaveLoosePrim","bValues","_val","setHasEqualElement","setEquiv","aEntries","_aEntries$i","item1","item2","mapMightHaveLoosePrim","bEntries","_i2","_bEntries$_i","mapHasEqualEntry","mapEquiv","keysA","objEquiv","delete","setValues","findLooseMatchingPrimitives","altValue","curB","key1","key2","aesModes","desModes","ebtk","suite","des","instantiate","EDE","modeName","_des","des3","inL","inR","outL","outR","pc2table","sTable","permuteTable","padSplit","EDEState","k3","_edeState","ZEROES","fromArray","cache","_multiply","lsbVi","Vi","Zi","abl","SEVEN","setPublicKey","setPrivateKey","_priv","DH","primeCache","generator","malleable","setGenerator","__prime","_primeLen","_primeCode","formatReturnValue","hex","checkPrime","__gen","generateKeys","_gen","getPublicKey","computeSecret","getPrime","front","getPrivateKey","getGenerator","algorithms","_hashType","_tag","_signType","getKey","hlen","hbits","bits2int","bits2octets","obits","makeKey","kv","makeR","hashType","signType","curveId","ecSign","dsaSign","Entity","_createNamed","Generated","_initNamed","PEMEncoder","PEMDecoder","_reverse","asn","Time","utcTime","utctime","generalTime","gentime","AttributeTypeValue","seq","AlgorithmIdentifier","SubjectPublicKeyInfo","bitstr","RelativeDistinguishedName","setof","RDNSequence","seqof","Name","rdnSequence","Validity","Extension","octstr","TBSCertificate","int","X509Certificate","findProc","startRegex","fullRegex","evp","okey","decrypted","cipherKey","match2","checkValue","pubkey","ecVerify","unpacked","montp","dsaVerify","padNum","ECDH","aliases","secp224r1","prime256v1","prime192v1","ed25519","secp384r1","secp521r1","curveType","p256","secp256r1","secp192r1","p384","p521","inenc","mgf","withPublic","mLen","iHash","hLen2","ps","dblen","maskedDb","maskedSeed","oaep","nonZero","pkcs1","zBuffer","db","dif","bs58checkBase","base58","checksumFn","decodeRaw","payload","checksum","newChecksum","_Buffer","messages","initCompressedValue","COMPRESSED_TYPE_INVALID","EC_PRIVATE_KEY_TYPE_INVALID","privateKeyExport","compressed","isBufferLength","EC_PRIVATE_KEY_LENGTH_INVALID","privateKeyImport","EC_PRIVATE_KEY_IMPORT_DER_FAIL","privateKeyNegate","privateKeyModInverse","tweak","TWEAK_TYPE_INVALID","TWEAK_LENGTH_INVALID","privateKeyTweakMul","EC_PUBLIC_KEY_TYPE_INVALID","isBufferLength2","EC_PUBLIC_KEY_LENGTH_INVALID","publicKeyTweakMul","publicKeyCombine","publicKeys","EC_PUBLIC_KEYS_TYPE_INVALID","isLengthGTZero","EC_PUBLIC_KEYS_LENGTH_INVALID","signatureNormalize","ECDSA_SIGNATURE_TYPE_INVALID","ECDSA_SIGNATURE_LENGTH_INVALID","signatureExport","sigObj","signatureImport","ECDSA_SIGNATURE_PARSE_DER_FAIL","signatureImportLax","MSG32_TYPE_INVALID","MSG32_LENGTH_INVALID","noncefn","OPTIONS_TYPE_INVALID","OPTIONS_DATA_TYPE_INVALID","OPTIONS_DATA_LENGTH_INVALID","OPTIONS_NONCEFN_TYPE_INVALID","recover","recovery","RECOVERY_ID_TYPE_INVALID","isNumberInInterval","RECOVERY_ID_VALUE_INVALID","ecdh","ecdhUnsafe","check","lenR","lenS","ecparams","loadPublicKey","xBuffer","loadCompressedPublicKey","yBuffer","x3","loadUncompressedPublicKey","EC_PRIVATE_KEY_EXPORT_DER_FAIL","EC_PRIVATE_KEY_RANGE_INVALID","EC_PRIVATE_KEY_TWEAK_ADD_FAIL","EC_PRIVATE_KEY_TWEAK_MUL_FAIL","EC_PUBLIC_KEY_CREATE_FAIL","pair","EC_PUBLIC_KEY_PARSE_FAIL","EC_PUBLIC_KEY_TWEAK_ADD_FAIL","EC_PUBLIC_KEY_TWEAK_MUL_FAIL","pairs","EC_PUBLIC_KEY_COMBINE_FAIL","ECDSA_SIGNATURE_PARSE_FAIL","getNonce","counter","ECDSA_SIGN_FAIL","sigr","sigs","ECDSA_RECOVER_FAIL","shared","scalar","ECDH_FAIL","scrypt","createKeccak","createShake","KeccakState","Keccak","Shake","rate","capacity","delimitedSuffix","hashBitLength","_rate","_capacity","_delimitedSuffix","_hashBitLength","_options","_state","initialize","absorb","absorbLastFewBits","squeeze","_resetState","_clone","dataByteLength","keccakState","squeezing","p1600","singleMatcher","multiMatcher","decodeComponents","components","tokens","encodedURI","replaceMap","customDecodeURIComponent","separator","separatorIndex","isArr","wordlists","_default","czech","chinese_simplified","chinese_traditional","korean","french","italian","spanish","japanese","JA","portuguese","english","EN","getBlock","chunkNum","lens","getLens","validLen","placeHoldersLen","Arr","_byteLength","curByte","revLookup","uint8","extraBytes","maxChunkLength","len2","encodeChunk","isLE","eLen","eMax","eBias","nBits","rt","Kh","Ah","Bh","Dh","Eh","rh","sh","pbkdf2_1","_wordlists_1","DEFAULT_WORDLIST","INVALID_MNEMONIC","INVALID_ENTROPY","WORDLIST_REQUIRED","lpad","padString","binaryToByte","bin","bytesToBinary","deriveChecksumBits","entropyBuffer","CS","mnemonicToEntropy","mnemonic","wordlist","dividerIndex","entropyBits","checksumBits","entropyBytes","entropyToMnemonic","mnemonicToSeedSync","mnemonicBuffer","saltBuffer","mnemonicToSeed","saltMixin","pbkdf2Promise","generateMnemonic","strength","validateMnemonic","setDefaultWordlist","language","getDefaultWordlist","lang","every","_wordlists_2","CBCState","_cbcInit","_cbcState","MODES","AuthCipher","Splitter","_autopadding","PADDING","setTo","padBuff","encryptStart","encryptByte","byteParam","shiftIn","_last","padded","autoPadding","generatePrime","ENCODINGS","genc","null_","PrivateKeyInfo","EncryptedPrivateKeyInfo","ECParameters","namedCurve","oldBrowser","safeBuffer","randombytes","kBufferMaxLength","kMaxUint32","assertOffset","actualFill","ourBuf","length1","length2","bip66","EC_PRIVKEY_EXPORT_DER_COMPRESSED","EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED","lenb","posR","posS","lenbyte","rindex","sindex","rvalue","svalue","P1600_ROUND_CONSTANTS","lo0","hi0","lo1","hi1","lo2","hi2","lo3","hi3","lo4","hi4","t1slo0","t1shi0","t1slo5","t1shi5","t1slo10","t1shi10","t1slo15","t1shi15","t1slo20","t1shi20","t1slo1","t1shi1","t1slo6","t1shi6","t1slo11","t1shi11","t1slo16","t1shi16","t1slo21","t1shi21","t1slo2","t1shi2","t1slo7","t1shi7","t1slo12","t1shi12","t1slo17","t1shi17","t1slo22","t1shi22","t1slo3","t1shi3","t1slo8","t1shi8","t1slo13","t1shi13","t1slo18","t1shi18","t1slo23","t1shi23","t1slo4","t1shi4","t1slo9","t1shi9","t1slo14","t1shi14","t1slo19","t1shi19","t1slo24","t1shi24","t2slo0","t2shi0","t2slo16","t2shi16","t2slo7","t2shi7","t2slo23","t2shi23","t2slo14","t2shi14","t2slo10","t2shi10","t2slo1","t2shi1","t2slo17","t2shi17","t2slo8","t2shi8","t2slo24","t2shi24","t2slo20","t2shi20","t2slo11","t2shi11","t2slo2","t2shi2","t2slo18","t2shi18","t2slo9","t2shi9","t2slo5","t2shi5","t2slo21","t2shi21","t2slo12","t2shi12","t2slo3","t2shi3","t2slo19","t2shi19","t2slo15","t2shi15","t2slo6","t2shi6","t2slo22","t2shi22","t2slo13","t2shi13","t2slo4","t2shi4","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","__esModule","definition","nmd","SuppressedError","BLOCK_SIZE","KEY","INIT","MAX_HASHABLE_LENGTH","RawSha256","bufferLength","bytesHashed","hashBuffer","bitsHashed","bufferView","undecoratedLength","setUint8","setUint32","state0","state1","state2","state3","state4","state5","state6","state7","t1_1","t2_1","TextEncoder","convertToBuffer","BYTES_PER_ELEMENT","digestSync","_arguments","sent","trys","ops","verb","op","__generator","P","fulfilled","rejected","bufferHash","bufferFromSecret","_get__","hashUint8Array","_getGlobalObject","_RewireModuleId__","_getRewireModuleId__","globalVariable","__$$GLOBAL_REWIRE_NEXT_MODULE_ID__","_getRewireRegistry__","theGlobalVariable","__$$GLOBAL_REWIRE_REGISTRY__","_getRewiredData__","registry","rewireData","INTENTIONAL_UNDEFINED","_RewireAPI__","variableName","_get_original__","_set__","_reset__","_with__","rewiredVariableNames","previousValues","addPropertyToAPIObject","_typeOfOriginalExport","addNonEnumerableProperty","isExtensible","isNumeric","mathceil","mathfloor","bignumberError","tooManyDigits","LOG_BASE","MAX_SAFE_INTEGER","POWS_TEN","SQRT_BASE","bitFloor","coeffToString","yc","intCheck","toExponential","toFixedPoint","BigNumber","configObject","convertBase","parseNumeric","pow2_53","random53bitInt","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","secondaryGroupSize","groupSeparator","decimalSeparator","fractionGroupSize","fractionGroupSeparator","suffix","alphabetHasNormalDecimalDigits","caseChanged","isNum","_isBigNumber","DEBUG","rm","c0","ne","maxOrMin","normalise","sd","ni","rd","pows10","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","EXPONENTIAL_AT","RANGE","isBigNumber","maximum","minimum","dp","sum","plus","decimal","toBaseOut","baseIn","baseOut","arrL","callerIsToString","multiply","xlo","xhi","klo","khi","aL","bL","subtract","more","prod","prodL","qc","remL","rem0","xL","yc0","yL","yz","absoluteValue","comparedTo","decimalPlaces","dividedBy","dividedToIntegerBy","idiv","exponentiatedBy","isModExp","nIsBig","nIsNeg","nIsOdd","times","integerValue","isEqualTo","isGreaterThan","isGreaterThanOrEqualTo","isLessThan","isLessThanOrEqualTo","isNegative","isPositive","minus","xLTy","xe","ye","modulo","multipliedBy","xcL","ycL","ylo","yhi","zc","sqrtBase","negated","precision","shiftedBy","squareRoot","rep","toFixed","toFormat","g1","g2","intPart","fractionPart","intDigits","toFraction","md","d0","exp","n0","toPrecision","inputAddressFormatter","address","realAddress","outputFileDescriptorSetFormatter","UNSIGNED_256_INT","CHAIN_METHODS","getChainStatus","getChainState","getContractFileDescriptorSet","inputFormatter","outputFormatter","getBlockHeight","getBlockByHeight","getTxResult","getTxResults","getMerklePathByTxId","getTransactionPoolStatus","sendTransaction","sendTransactions","calculateTransactionFee","callReadOnly","getPeers","addPeer","removePeer","networkInfo","UNIT_MAP","noether","wei","kwei","Kwei","babbage","femtoether","mwei","Mwei","lovelace","picoether","gwei","Gwei","shannon","nanoether","nano","szabo","microether","micro","finney","milliether","milli","ether","kether","grand","mether","gether","tether","TO_STRING_UTF8_ENCODING","KEY_STORE_ERRORS","INVALID_PASSWORD","errorMessage","NOT_AELF_KEY_STORE","WRONG_VERSION","WRONG_KEY_STORE_VERSION","isWrappedBytes","isAddress","isHash","transformers","fieldsLength","transformer","transformMapToArray","map_entry","transformArrayToMap","resolvedFields","resolvedOptions","INPUT_TRANSFORMERS","encodeAddress","OUTPUT_TRANSFORMERS","decodeAddressRep","chainIdConvertor","chainIdToBase58","chainId","bufferTemp","base58ToChainId","base58String","arrayBufferToHex","arrayBuffer","arrayToHex","padLeft","charLen","padRight","b58rep","encodeAddressRep","isJson","toBigNumber","getValueOfUnit","unit","unitValue","fromWei","returnValue","toWei","toTwosComplement","bigNumber","uint8ArrayToHex","uint8Array","setPath","unpackSpecifiedTypeData","_ref","dataType","decoded","arrays","deserializeTransaction","rawTx","paramsDataType","refBlockPrefix","rest","methodParameters","getAuthorization","userName","bs58","Transaction","coreRootProto","Address","TransactionFeeCharged","ResourceTokenCharged","getFee","deserialize","deserializeLogResult","getSerializedDataFromLog","NonIndexed","Indexed","serializedData","getResourceFee","Logs","getTransactionFee","getRepForAddress","getAddressFromRep","getAddressObjectFromRep","getRepForHash","getHashFromHex","getHashObjectFromHex","encodeTransaction","tx","getTransaction","txn","_filterWildcardImport__","coreDescriptor","wildcardImport","filteredWildcardImport","isBloom","bloom","codePointToInt","isInBloom","bitpos","isEventInBloom","eventName","isIndexedInBloom","indexed","isAddressInBloom","encodedAddress","ChainMethod","requestMethod","requestManager","formatInput","setRequestManager","manager","formatOutput","extractArgumentsIntoObject","isSync","argsObj","sendAsync","fromTwoBuffers","generateMerkleTree","nodeToAdd","newAdded","generateMerklePath","indexArg","leafCount","firstInRow","rowcount","neighbor","computeRoot","merkleTree","getMerklePath","createKeccakHash","require","keccak","keccak256","AES_MODES","aes128","aes192","aes256","defaultOptions","dklen","getKeystore","nickName","option","opt","sliceLength","ivLength","privateKeyCipher","privateKeyEncrypted","mnemonicCipher","mnemonicEncrypted","rawMac","mac","cipherparams","kdfparams","unlockKeystore","_ref2","privateKeyDeCipher","mnemonicDeCipher","checkPassword","keyStoreInput","ellipticEc","AESEncrypt","AESDecrypt","getAddressFromPubKey","pubKey","pubKeyEncoded","onceSHAResult","_getWallet","hdWallet","BIP44Path","rootSeed","childWallet","getSignature","bytesToBeSign","msgHash","createNewWallet","getWalletByMnemonic","getWalletByPrivateKey","signTransaction","rawTxn","ser","hexString","_DefaultExportValue","bip39","keyStore","encUTF8","ContractMethod","chain","contractAddress","walletInstance","_chain","_method","_inputType","_outputType","_name","_contractAddress","_wallet","unpackPackedInput","packInput","unpackOutput","bindMethodToContract","getSignedTx","getRawTx","inputPacked","packOutput","handleTransaction","height","encoded","prepareParametersAsync","filterArgs","BestChainHeight","BestChainHash","prepareParameters","prepareParametersWithBlockInfo","argsObject","blockHeightInput","blockHashInput","packedInput","refBlockNumber","blockHash","contract","inputTypeInfo","outputTypeInfo","wallet","getServicesFromFileDescriptors","sn","package","Contract","services","deserializeLog","logName","logInThisAddress","ContractFactory","fileDescriptorSet","static","at","contractInstance","bindMethodsToContract","Chain","methodConfig","contractAt","fds","txId","Body","txIds","Transactions","txIndex","findIndex","nodes","Status","results","RequestManager","provider","setProvider","requestBody","prepareRequest","defaultHeaders","Accept","RequestLibrary","isFetch","_self","_window","_assign__","HttpProvider","host","timeout","headers","parseRequest","statusText","delay","_resolve","ids","clearTimeout","requestSendByFetch","requestConfig","signal","uri","myHeaders","Headers","append","sendAsyncByFetch","control","AbortController","credentials","race","timeoutPromise","formatResponse","requestSend","isAsync","setRequestHeader","withCredentials","sendAsyncByXMLHttp","ontimeout","isConnected","_value","_set_original__","Settings","defaultAccount","AElf","api","_requestManager","currentProvider"],"sourceRoot":""} \ No newline at end of file