npm - @animaapp/anima-sdk - Versions diffs - 0.21.0 → 0.23.0 - Mend

@animaapp/anima-sdk 0.21.0 → 0.23.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (6) hide show

package/dist/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.cjs","sources":["../../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../src/errors.ts","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/core.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/util.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/errors.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/parse.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/regexes.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/checks.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/doc.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/versions.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/schemas.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/registries.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/api.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/to-json-schema.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/json-schema-processors.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/iso.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/errors.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/parse.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/schemas.js","../src/settings.ts","../src/figma/utils.ts","../src/utils/isNodeCodegenCompatible.ts","../../node_modules/.pnpm/type-detect@4.1.0/node_modules/type-detect/type-detect.js","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/buffer.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/detector.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/collection.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/global.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/copy_map.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/copier.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/index.mjs","../src/FigmaRestApi.ts","../src/anima.ts","../src/utils/figma.ts","../src/utils/files.ts","../src/dataStream.ts"],"sourcesContent":["\n/! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) /\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops /\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\n\n//const Z_FILTERED = 1;\n//const Z_HUFFMAN_ONLY = 2;\n//const Z_RLE = 3;\nconst Z_FIXED$1 = 4;\n//const Z_DEFAULT_STRATEGY = 0;\n\n/ Possible values of the data_type field (though see inflate()) /\nconst Z_BINARY = 0;\nconst Z_TEXT = 1;\n//const Z_ASCII = 1; // = Z_TEXT\nconst Z_UNKNOWN$1 = 2;\n\n/============================================================================/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n/ The three kinds of block type /\n\nconst MIN_MATCH$1 = 3;\nconst MAX_MATCH$1 = 258;\n/ The minimum and maximum match lengths /\n\n// From deflate.h\n/ ===========================================================================\n * Internal compression state.\n /\n\nconst LENGTH_CODES$1 = 29;\n/ number of length codes, not counting the special END_BLOCK code /\n\nconst LITERALS$1 = 256;\n/ number of literal bytes 0..255 /\n\nconst L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1;\n/ number of Literal or Length codes, including the END_BLOCK code /\n\nconst D_CODES$1 = 30;\n/ number of distance codes /\n\nconst BL_CODES$1 = 19;\n/ number of codes used to transfer the bit lengths /\n\nconst HEAP_SIZE$1 = 2 L_CODES$1 + 1;\n/* maximum heap size /\n\nconst MAX_BITS$1 = 15;\n/ All codes must not exceed MAX_BITS bits /\n\nconst Buf_size = 16;\n/ size of bit buffer in bi_buf /\n\n\n/ ===========================================================================\n * Constants\n /\n\nconst MAX_BL_BITS = 7;\n/ Bit length codes must not exceed MAX_BL_BITS bits /\n\nconst END_BLOCK = 256;\n/ end of block literal code /\n\nconst REP_3_6 = 16;\n/ repeat previous bit length 3-6 times (2 bits of repeat count) /\n\nconst REPZ_3_10 = 17;\n/ repeat a zero length 3-10 times (3 bits of repeat count) /\n\nconst REPZ_11_138 = 18;\n/ repeat a zero length 11-138 times (7 bits of repeat count) /\n\n/ eslint-disable comma-spacing,array-bracket-spacing /\nconst extra_lbits = / extra bits for each length code /\n new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits = / extra bits for each distance code /\n new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits = / extra bits for each bit length code /\n new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/ eslint-enable comma-spacing,array-bracket-spacing /\n\n/ The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n /\n\n/ ===========================================================================\n * Local data. These are initialized only once.\n /\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; / see definition of array dist_code below /\n\n// !!!! Use flat array instead of structure, Freq = i2, Len = i2+1\nconst static_ltree = new Array((L_CODES$1 + 2) 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n /\n\nconst static_dtree = new Array(D_CODES$1 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n /\n\nconst _dist_code = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/ Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n /\n\nconst _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/ length code for each normalized match length (0 == MIN_MATCH) /\n\nconst base_length = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/ First normalized length for each code (0 = MIN_MATCH) /\n\nconst base_dist = new Array(D_CODES$1);\nzero$1(base_dist);\n/ First normalized distance for each code (0 = distance of 1) /\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; / static tree or NULL /\n this.extra_bits = extra_bits; / extra bits for each code or NULL /\n this.extra_base = extra_base; / base index for extra_bits /\n this.elems = elems; / max number of elements in the tree /\n this.max_length = max_length; / max bit length for the codes /\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; / the dynamic tree /\n this.max_code = 0; / largest code with non zero frequency /\n this.stat_desc = stat_desc; / the corresponding static tree /\n}\n\n\n\nconst d_code = (dist) => {\n\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/ ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n /\nconst put_short = (s, w) => {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/ ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n /\nconst send_bits = (s, value, length) => {\n\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf \|= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf \|= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n send_bits(s, tree[c 2]/.Code/, tree[c * 2 + 1]/.Len/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n /\nconst bi_reverse = (code, len) => {\n\n let res = 0;\n do {\n res \|= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n};\n\n\n/ ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n /\nconst bi_flush = (s) => {\n\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n};\n\n\n/ ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n /\nconst gen_bitlen = (s, desc) => {\n// deflate_state s;\n// tree_desc desc; / the tree descriptor /\n\n const tree = desc.dyn_tree;\n const max_code = desc.max_code;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const extra = desc.stat_desc.extra_bits;\n const base = desc.stat_desc.extra_base;\n const max_length = desc.stat_desc.max_length;\n let h; / heap index /\n let n, m; / iterate over the tree elements /\n let bits; / bit length /\n let xbits; / extra bits /\n let f; / frequency /\n let overflow = 0; / number of elements with bit length too large /\n\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n s.bl_count[bits] = 0;\n }\n\n / In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n /\n tree[s.heap[s.heap_max] 2 + 1]/.Len/ = 0; /* root of the heap /\n\n for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n n = s.heap[h];\n bits = tree[tree[n 2 + 1]/.Dad/ * 2 + 1]/.Len/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/.Len/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed /\n\n if (n > max_code) { continue; } / not a leaf node /\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n 2]/.Freq/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/.Len/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Tracev((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus /\n\n / Find the first bit length which could increase: /\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; / move one leaf down the tree /\n s.bl_count[bits + 1] += 2; / move one overflow item as its brother /\n s.bl_count[max_length]--;\n / The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n /\n overflow -= 2;\n } while (overflow > 0);\n\n / Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n /\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m 2 + 1]/.Len/ !== bits) {\n // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/.Len/) * tree[m * 2]/.Freq/;\n tree[m * 2 + 1]/.Len/ = bits;\n }\n n--;\n }\n }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n /\nconst gen_codes = (tree, max_code, bl_count) => {\n// ct_data tree; /* the tree to decorate /\n// int max_code; / largest code with non zero frequency /\n// ushf bl_count; /* number of codes at each bit length /\n\n const next_code = new Array(MAX_BITS$1 + 1); / next code value for each bit length /\n let code = 0; / running code value /\n let bits; / bit index /\n let n; / code index /\n\n / The distribution counts are first used to generate the code values\n * without bit reversal.\n /\n for (bits = 1; bits <= MAX_BITS$1; bits++) {\n code = (code + bl_count[bits - 1]) << 1;\n next_code[bits] = code;\n }\n / Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n /\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n let len = tree[n 2 + 1]/.Len/;\n if (len === 0) { continue; }\n /* Now reverse the bits /\n tree[n 2]/.Code/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n /\nconst tr_static_init = () => {\n\n let n; / iterates over tree elements /\n let bits; / bit counter /\n let length; / length value /\n let code; / code value /\n let dist; / distance index /\n const bl_count = new Array(MAX_BITS$1 + 1);\n / number of codes at each bit length for an optimal tree /\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n / For some embedded targets, global variables are not initialized: /\n/#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif/\n\n / Initialize the mapping length (0..255) -> length code (0..28) /\n length = 0;\n for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n / Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n /\n _length_code[length - 1] = code;\n\n / Initialize the mapping dist (0..32K) -> dist code (0..29) /\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; / from now on, all distances are divided by 128 /\n for (; code < D_CODES$1; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n / Construct the codes of the static literal tree /\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n 2 + 1]/.Len/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/.Len/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/.Len/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/.Len/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n /\n gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n / The static distance tree is trivial: /\n for (n = 0; n < D_CODES$1; n++) {\n static_dtree[n 2 + 1]/.Len/ = 5;\n static_dtree[n * 2]/.Code/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS);\n\n //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n /\nconst init_block = (s) => {\n\n let n; / iterates over tree elements /\n\n / Initialize the trees. /\n for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n 2]/.Freq/ = 0; }\n for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/.Freq/ = 0; }\n for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/.Freq/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/.Freq/ = 1;\n s.opt_len = s.static_len = 0;\n s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n /\nconst bi_windup = (s) =>\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n};\n\n/ ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n /\nconst smaller = (tree, n, m, depth) => {\n\n const _n2 = n 2;\n const _m2 = m * 2;\n return (tree[_n2]/.Freq/ < tree[_m2]/.Freq/ \|\|\n (tree[_n2]/.Freq/ === tree[_m2]/.Freq/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n /\nconst pqdownheap = (s, tree, k) => {\n// deflate_state s;\n// ct_data tree; / the tree to restore /\n// int k; / node to move down /\n\n const v = s.heap[k];\n let j = k << 1; / left son of k /\n while (j <= s.heap_len) {\n / Set j to the smallest of the two sons: /\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n / Exit if v is smaller than both sons /\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n / Exchange v with the smallest son /\n s.heap[k] = s.heap[j];\n k = j;\n\n / And continue down the tree, setting j to the left son of k /\n j <<= 1;\n }\n s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/ ===========================================================================\n * Send the block data compressed using the given Huffman trees\n /\nconst compress_block = (s, ltree, dtree) => {\n// deflate_state s;\n// const ct_data ltree; / literal tree /\n// const ct_data dtree; /* distance tree /\n\n let dist; / distance of matched string /\n let lc; / match length or unmatched char (if dist == 0) /\n let sx = 0; / running index in sym_buf /\n let code; / the code to send /\n let extra; / number of extra bits to send /\n\n if (s.sym_next !== 0) {\n do {\n dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n lc = s.pending_buf[s.sym_buf + sx++];\n if (dist === 0) {\n send_code(s, lc, ltree); / send a literal byte /\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n / Here, lc is the match length - MIN_MATCH /\n code = _length_code[lc];\n send_code(s, code + LITERALS$1 + 1, ltree); / send the length code /\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); / send the extra length bits /\n }\n dist--; / dist is now the match distance - 1 /\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); / send the distance code /\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); / send the extra distance bits /\n }\n } / literal or match pair ? /\n\n / Check that the overlay between pending_buf and sym_buf is ok: /\n //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n } while (sx < s.sym_next);\n }\n\n send_code(s, END_BLOCK, ltree);\n};\n\n\n/ ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n /\nconst build_tree = (s, desc) => {\n// deflate_state s;\n// tree_desc desc; / the tree descriptor /\n\n const tree = desc.dyn_tree;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const elems = desc.stat_desc.elems;\n let n, m; / iterate over heap elements /\n let max_code = -1; / largest code with non zero frequency /\n let node; / new node being created /\n\n / Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2n] and heap[2n+1].\n * heap[0] is not used.\n /\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE$1;\n\n for (n = 0; n < elems; n++) {\n if (tree[n 2]/.Freq/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/.Len/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n /\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node 2]/.Freq/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/.Len/;\n }\n /* node is 0 or 1 so it does not have extra bits /\n }\n desc.max_code = max_code;\n\n / The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n /\n for (n = (s.heap_len >> 1/int /2/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n / Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n /\n node = elems; / next internal node of the tree /\n do {\n //pqremove(s, tree, n); / n = node of least frequency /\n / pqremove /\n n = s.heap[1/SMALLEST/];\n s.heap[1/SMALLEST/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/SMALLEST/);\n /*/\n\n m = s.heap[1/SMALLEST/]; / m = node of next least frequency /\n\n s.heap[--s.heap_max] = n; / keep the nodes sorted by frequency /\n s.heap[--s.heap_max] = m;\n\n / Create a new node father of n and m /\n tree[node 2]/.Freq/ = tree[n * 2]/.Freq/ + tree[m * 2]/.Freq/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/.Dad/ = tree[m * 2 + 1]/.Dad/ = node;\n\n /* and insert the new node in the heap /\n s.heap[1/SMALLEST/] = node++;\n pqdownheap(s, tree, 1/SMALLEST/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/SMALLEST/];\n\n / At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n /\n gen_bitlen(s, desc);\n\n / The field len is now set, we can generate the bit codes /\n gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/ ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n /\nconst scan_tree = (s, tree, max_code) => {\n// deflate_state s;\n// ct_data tree; / the tree to be scanned /\n// int max_code; / and its largest code of non zero frequency /\n\n let n; / iterates over all tree elements /\n let prevlen = -1; / last emitted length /\n let curlen; / length of current code /\n\n let nextlen = tree[0 2 + 1]/.Len/; /* length of next code /\n\n let count = 0; / repeat count of the current code /\n let max_count = 7; / max repeat count /\n let min_count = 4; / min repeat count /\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) 2 + 1]/.Len/ = 0xffff; /* guard /\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) 2 + 1]/.Len/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/.Freq/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/.Freq/++; }\n s.bl_tree[REP_3_6 * 2]/.Freq/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/.Freq/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/.Freq/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n /\nconst send_tree = (s, tree, max_code) => {\n// deflate_state s;\n// ct_data tree; / the tree to be scanned /\n// int max_code; / and its largest code of non zero frequency /\n\n let n; / iterates over all tree elements /\n let prevlen = -1; / last emitted length /\n let curlen; / length of current code /\n\n let nextlen = tree[0 2 + 1]/.Len/; /* length of next code /\n\n let count = 0; / repeat count of the current code /\n let max_count = 7; / max repeat count /\n let min_count = 4; / min repeat count /\n\n / tree[max_code+1].Len = -1; / / guard already set /\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) 2 + 1]/.Len/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n /\nconst build_bl_tree = (s) => {\n\n let max_blindex; / index of last bit length code of non zero freq /\n\n / Determine the bit length frequencies for literal and distance trees /\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n / Build the bit length tree: /\n build_tree(s, s.bl_desc);\n / opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n /\n\n / Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n /\n for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] 2 + 1]/.Len/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts /\n s.opt_len += 3 (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n /\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n// deflate_state s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree /\n\n let rank; / index in bl_order /\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); / not +255 as stated in appnote.txt /\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); / not -3 as stated in appnote.txt /\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] 2 + 1]/.Len/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree /\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); / distance tree /\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/ ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"block list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n /\nconst detect_data_type = (s) => {\n / block_mask is the bit mask of block-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n /\n let block_mask = 0xf3ffc07f;\n let n;\n\n / Check for non-textual (\"block-listed\") bytes. /\n for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n if ((block_mask & 1) && (s.dyn_ltree[n 2]/.Freq/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"allow-listed\") bytes. /\n if (s.dyn_ltree[9 2]/.Freq/ !== 0 \|\| s.dyn_ltree[10 * 2]/.Freq/ !== 0 \|\|\n s.dyn_ltree[13 * 2]/.Freq/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS$1; n++) {\n if (s.dyn_ltree[n * 2]/.Freq/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"block-listed\" or \"allow-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n /\n return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/ ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n /\nconst _tr_init$1 = (s) =>\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n / Initialize the first block of the first file: /\n init_block(s);\n};\n\n\n/ ===========================================================================\n * Send a stored block\n /\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState s;\n//charf buf; / input block /\n//ulg stored_len; / length of input block /\n//int last; / one if this is the last block for a file /\n\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); / send block type /\n bi_windup(s); / align on byte boundary /\n put_short(s, stored_len);\n put_short(s, ~stored_len);\n if (stored_len) {\n s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n }\n s.pending += stored_len;\n};\n\n\n/ ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n /\nconst _tr_align$1 = (s) => {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n};\n\n\n/ ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n /\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState s;\n//charf buf; / input block, or NULL if too old /\n//ulg stored_len; / length of input block /\n//int last; / one if this is the last block for a file /\n\n let opt_lenb, static_lenb; / opt_len and static_len in bytes /\n let max_blindex = 0; / index of last bit length code of non zero freq /\n\n / Build the Huffman trees unless a stored block is forced /\n if (s.level > 0) {\n\n / Check if the file is binary or text /\n if (s.strm.data_type === Z_UNKNOWN$1) {\n s.strm.data_type = detect_data_type(s);\n }\n\n / Construct the literal and distance trees /\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n / At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n /\n\n / Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n /\n max_blindex = build_bl_tree(s);\n\n / Determine the best encoding. Compute the block lengths in bytes. /\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->sym_next / 3));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block /\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n / 4: two words for the lengths /\n\n / The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n /\n _tr_stored_block$1(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 \|\| static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n / The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n /\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n /\nconst _tr_tally$1 = (s, dist, lc) => {\n// deflate_state s;\n// unsigned dist; /* distance of matched string /\n// unsigned lc; / match length-MIN_MATCH or unmatched char (if dist==0) /\n\n s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n if (dist === 0) {\n / lc is the unmatched char /\n s.dyn_ltree[lc 2]/.Freq/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH /\n dist--; / dist = match distance - 1 /\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) 2]/.Freq/++;\n s.dyn_dtree[d_code(dist) * 2]/.Freq/++;\n }\n\n return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1 = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1 = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n let s1 = (adler & 0xffff) \|0,\n s2 = ((adler >>> 16) & 0xffff) \|0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) \|0;\n s2 = (s2 + s1) \|0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 \| (s2 << 16)) \|0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n let c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n const t = crcTable;\n const end = pos + len;\n\n crc ^= -1;\n\n for (let i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 /\n 1: 'stream end', / Z_STREAM_END 1 /\n 0: '', / Z_OK 0 /\n '-1': 'file error', / Z_ERRNO (-1) /\n '-2': 'stream error', / Z_STREAM_ERROR (-2) /\n '-3': 'data error', / Z_DATA_ERROR (-3) /\n '-4': 'insufficient memory', / Z_MEM_ERROR (-4) /\n '-5': 'buffer error', / Z_BUF_ERROR (-5) /\n '-6': 'incompatible version' / Z_VERSION_ERROR (-6) /\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n / Allowed flush values; see deflate() and inflate() below for details /\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n / Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n /\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n / compression levels /\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n / Possible values of the data_type field (though see inflate()) /\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n / The deflate compression method /\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n Z_UNKNOWN,\n Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/============================================================================/\n\n\nconst MAX_MEM_LEVEL = 9;\n/ Maximum value for memLevel in deflateInit2 /\nconst MAX_WBITS$1 = 15;\n/ 32K LZ77 window /\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES = 29;\n/ number of length codes, not counting the special END_BLOCK code /\nconst LITERALS = 256;\n/ number of literal bytes 0..255 /\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/ number of Literal or Length codes, including the END_BLOCK code /\nconst D_CODES = 30;\n/ number of distance codes /\nconst BL_CODES = 19;\n/ number of codes used to transfer the bit lengths /\nconst HEAP_SIZE = 2 L_CODES + 1;\n/* maximum heap size /\nconst MAX_BITS = 15;\n/ All codes must not exceed MAX_BITS bits /\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42; / zlib header -> BUSY_STATE /\n//#ifdef GZIP\nconst GZIP_STATE = 57; / gzip header -> BUSY_STATE \| EXTRA_STATE /\n//#endif\nconst EXTRA_STATE = 69; / gzip extra block -> NAME_STATE /\nconst NAME_STATE = 73; / gzip file name -> COMMENT_STATE /\nconst COMMENT_STATE = 91; / gzip comment -> HCRC_STATE /\nconst HCRC_STATE = 103; / gzip header CRC -> BUSY_STATE /\nconst BUSY_STATE = 113; / deflate -> FINISH_STATE /\nconst FINISH_STATE = 666; / stream complete /\n\nconst BS_NEED_MORE = 1; / block not completed, need more input or more output /\nconst BS_BLOCK_DONE = 2; / block flush performed /\nconst BS_FINISH_STARTED = 3; / finish started, need only more output at next deflate /\nconst BS_FINISH_DONE = 4; / finish done, accept no more input or output /\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n strm.msg = messages[errorCode];\n return errorCode;\n};\n\nconst rank = (f) => {\n return ((f) 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n /\nconst slide_hash = (s) => {\n let n, m;\n let p;\n let wsize = s.w_size;\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= wsize ? m - wsize : 0);\n } while (--n);\n n = wsize;\n//#ifndef FASTEST\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= wsize ? m - wsize : 0);\n / If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n /\n } while (--n);\n//#endif\n};\n\n/ eslint-disable new-cap /\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/ =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n /\nconst flush_pending = (strm) => {\n const s = strm.state;\n\n //_tr_flush_bits(s);\n let len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n};\n\n\nconst flush_block_only = (s, last) => {\n _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n s.pending_buf[s.pending++] = b;\n};\n\n\n/ =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n /\nconst putShortMSB = (s, b) => {\n\n // put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/ ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n /\nconst read_buf = (strm, buf, start, size) => {\n\n let len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32_1(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32_1(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n};\n\n\n/ ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n /\nconst longest_match = (s, cur_match) => {\n\n let chain_length = s.max_chain_length; / max hash chain length /\n let scan = s.strstart; / current string /\n let match; / matched string /\n let len; / length of current match /\n let best_len = s.prev_length; / best match length so far /\n let nice_match = s.nice_match; / stop if match long enough /\n const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/NIL/;\n\n const _win = s.window; // shortcut\n\n const wmask = s.w_mask;\n const prev = s.prev;\n\n / Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n /\n\n const strend = s.strstart + MAX_MATCH;\n let scan_end1 = _win[scan + best_len - 1];\n let scan_end = _win[scan + best_len];\n\n / The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n /\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n / Do not waste too much time if we already have a good match: /\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n / Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n /\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n / Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n /\n\n if (_win[match + best_len] !== scan_end \|\|\n _win[match + best_len - 1] !== scan_end1 \|\|\n _win[match] !== _win[scan] \|\|\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n / The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n /\n scan += 2;\n match++;\n // Assert(scan == match, \"match[2]?\");\n\n / We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n /\n do {\n /jshint noempty:false/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n};\n\n\n/ ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n \n IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n /\nconst fill_window = (s) => {\n\n const _w_size = s.w_size;\n let n, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n / Deal with !@#$% 64K limit: /\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // / Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // /\n // more--;\n // }\n //}\n\n\n / If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n /\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n / we now have strstart >= MAX_DIST /\n s.block_start -= _w_size;\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n slide_hash(s);\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n / If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2WSIZE + 2\n In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2WSIZE so more >= 2.\n If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n /\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n / Initialize the hash value now that we have some input: /\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n / UPDATE_HASH(s, s->ins_h, s->window[str + 1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n / UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n / If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n /\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n / If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n /\n// if (s.high_water < s.window_size) {\n// const curr = s.strstart + s.lookahead;\n// let init = 0;\n//\n// if (s.high_water < curr) {\n// / Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// /\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// / High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// /\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n};\n\n/ ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n \n In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n \n deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n /\nconst deflate_stored = (s, flush) => {\n\n / Smallest worthy block size when not flushing or finishing. By default\n * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n * large input and output buffers, the stored block size will be larger.\n /\n let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n / Copy as many min_block or larger stored blocks directly to next_out as\n * possible. If flushing, copy the remaining available input to next_out as\n * stored blocks, if there is enough space.\n /\n let len, left, have, last = 0;\n let used = s.strm.avail_in;\n do {\n / Set len to the maximum size block that we can copy directly with the\n * available input data and output space. Set left to how much of that\n * would be copied from what's left in the window.\n /\n len = 65535/ MAX_STORED /; / maximum deflate stored block length /\n have = (s.bi_valid + 42) >> 3; / number of header bytes /\n if (s.strm.avail_out < have) { / need room for header /\n break;\n }\n / maximum stored block length that will fit in avail_out: /\n have = s.strm.avail_out - have;\n left = s.strstart - s.block_start; / bytes left in window /\n if (len > left + s.strm.avail_in) {\n len = left + s.strm.avail_in; / limit len to the input /\n }\n if (len > have) {\n len = have; / limit len to the output /\n }\n\n / If the stored block would be less than min_block in length, or if\n * unable to copy all of the available input when flushing, then try\n * copying to the window and the pending buffer instead. Also don't\n * write an empty block when flushing -- deflate() does that.\n /\n if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) \|\|\n flush === Z_NO_FLUSH$2 \|\|\n len !== left + s.strm.avail_in)) {\n break;\n }\n\n / Make a dummy stored block in pending to get the header bytes,\n * including any pending bits. This also updates the debugging counts.\n /\n last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n _tr_stored_block(s, 0, 0, last);\n\n / Replace the lengths in the dummy stored block with len. /\n s.pending_buf[s.pending - 4] = len;\n s.pending_buf[s.pending - 3] = len >> 8;\n s.pending_buf[s.pending - 2] = ~len;\n s.pending_buf[s.pending - 1] = ~len >> 8;\n\n / Write the stored block header bytes. /\n flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n// / Update debugging counts for the data about to be copied. /\n// s->compressed_len += len << 3;\n// s->bits_sent += len << 3;\n//#endif\n\n / Copy uncompressed bytes from the window to next_out. /\n if (left) {\n if (left > len) {\n left = len;\n }\n //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n s.strm.next_out += left;\n s.strm.avail_out -= left;\n s.strm.total_out += left;\n s.block_start += left;\n len -= left;\n }\n\n / Copy uncompressed bytes directly from next_in to next_out, updating\n * the check value.\n /\n if (len) {\n read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n s.strm.next_out += len;\n s.strm.avail_out -= len;\n s.strm.total_out += len;\n }\n } while (last === 0);\n\n / Update the sliding window with the last s->w_size bytes of the copied\n * data, or append all of the copied data to the existing window if less\n * than s->w_size bytes were copied. Also update the number of bytes to\n * insert in the hash tables, in the event that deflateParams() switches to\n * a non-zero compression level.\n /\n used -= s.strm.avail_in; / number of input bytes directly copied /\n if (used) {\n / If any input was used, then no unused input remains in the window,\n * therefore s->block_start == s->strstart.\n /\n if (used >= s.w_size) { / supplant the previous history /\n s.matches = 2; / clear hash /\n //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n s.strstart = s.w_size;\n s.insert = s.strstart;\n }\n else {\n if (s.window_size - s.strstart <= used) {\n / Slide the window down. /\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; / add a pending slide_hash() /\n }\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n s.strstart += used;\n s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n }\n s.block_start = s.strstart;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n / If the last block was written to next_out, then done. /\n if (last) {\n return BS_FINISH_DONE;\n }\n\n / If flushing and all input has been consumed, then done. /\n if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n s.strm.avail_in === 0 && s.strstart === s.block_start) {\n return BS_BLOCK_DONE;\n }\n\n / Fill the window with any remaining input. /\n have = s.window_size - s.strstart;\n if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n / Slide the window down. /\n s.block_start -= s.w_size;\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; / add a pending slide_hash() /\n }\n have += s.w_size; / more space now /\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n if (have > s.strm.avail_in) {\n have = s.strm.avail_in;\n }\n if (have) {\n read_buf(s.strm, s.window, s.strstart, have);\n s.strstart += have;\n s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n / There was not enough avail_out to write a complete worthy or flushed\n * stored block to next_out. Write a stored block to pending instead, if we\n * have enough input for a worthy block, or if flushing and there is enough\n * room for the remaining input as a stored block in the pending buffer.\n /\n have = (s.bi_valid + 42) >> 3; / number of header bytes /\n / maximum stored block length that will fit in pending: /\n have = s.pending_buf_size - have > 65535/ MAX_STORED / ? 65535/ MAX_STORED / : s.pending_buf_size - have;\n min_block = have > s.w_size ? s.w_size : have;\n left = s.strstart - s.block_start;\n if (left >= min_block \|\|\n ((left \|\| flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n s.strm.avail_in === 0 && left <= have)) {\n len = left > have ? have : left;\n last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n len === left ? 1 : 0;\n _tr_stored_block(s, s.block_start, len, last);\n s.block_start += len;\n flush_pending(s.strm);\n }\n\n / We've done all we can with the available input and output. /\n return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/ ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n /\nconst deflate_fast = (s, flush) => {\n\n let hash_head; / head of the hash chain /\n let bflush; / set if current block must be flushed /\n\n for (;;) {\n / Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n /\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; / flush the current block /\n }\n }\n\n / Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n /\n hash_head = 0/NIL/;\n if (s.lookahead >= MIN_MATCH) {\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /*/\n }\n\n / Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n /\n if (hash_head !== 0/NIL/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n / To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n /\n s.match_length = longest_match(s, hash_head);\n / longest_match() sets match_start /\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n / _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); /\n bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n / Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n /\n if (s.match_length <= s.max_lazy_match/max_insert_length/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; / string at strstart already in table /\n do {\n s.strstart++;\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /*/\n / strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n /\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n / UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n / If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n /\n }\n } else {\n / No match, output a literal byte /\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n / _tr_tally_lit(s, s.window[s.strstart], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH$3) {\n /* FLUSH_BLOCK(s, 1); */\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /*/\n }\n return BS_BLOCK_DONE;\n};\n\n/ ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n /\nconst deflate_slow = (s, flush) => {\n\n let hash_head; / head of hash chain /\n let bflush; / set if current block must be flushed /\n\n let max_insert;\n\n / Process the input block. /\n for (;;) {\n / Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n /\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } / flush the current block /\n }\n\n / Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n /\n hash_head = 0/NIL/;\n if (s.lookahead >= MIN_MATCH) {\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /*/\n }\n\n / Find the longest match, discarding those <= prev_length.\n /\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/NIL/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/MAX_DIST(s)/) {\n / To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n /\n s.match_length = longest_match(s, hash_head);\n / longest_match() sets match_start /\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED \|\| (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/TOO_FAR/))) {\n\n / If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n /\n s.match_length = MIN_MATCH - 1;\n }\n }\n / If there was a match at the previous step and the current\n * match is not better, output the previous match:\n /\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n / Do not insert strings in hash table beyond this. /\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);/\n bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n / Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n /\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n //\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /* FLUSH_BLOCK(s, 0); */\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n\n } else if (s.match_available) {\n / If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n /\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n / _tr_tally_lit(s, s.window[s.strstart-1], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n / FLUSH_BLOCK_ONLY(s, 0) /\n flush_block_only(s, false);\n /*/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n / There is no previous match to compare with, wait for\n * the next step to decide.\n /\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n / _tr_tally_lit(s, s.window[s.strstart-1], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH$3) {\n / FLUSH_BLOCK(s, 1); /\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /* FLUSH_BLOCK(s, 0); */\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n\n return BS_BLOCK_DONE;\n};\n\n\n/ ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n /\nconst deflate_rle = (s, flush) => {\n\n let bflush; / set if current block must be flushed /\n let prev; / byte at distance one to match /\n let scan, strend; / scan goes up to strend for length of run /\n\n const _win = s.window;\n\n for (;;) {\n / Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n /\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } / flush the current block /\n }\n\n / See how many times the previous byte repeats /\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /jshint noempty:false/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n / Emit match if have run of MIN_MATCH or longer, else emit literal /\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n / _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); /\n bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n / No match, output a literal byte /\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n / _tr_tally_lit(s, s.window[s.strstart], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /* FLUSH_BLOCK(s, 1); */\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /*/\n }\n return BS_BLOCK_DONE;\n};\n\n/ ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n /\nconst deflate_huff = (s, flush) => {\n\n let bflush; / set if current block must be flushed /\n\n for (;;) {\n / Make sure that we have a literal to write. /\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n break; / flush the current block /\n }\n }\n\n / Output a literal byte /\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n / _tr_tally_lit(s, s.window[s.strstart], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /* FLUSH_BLOCK(s, 1); */\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /*/\n }\n return BS_BLOCK_DONE;\n};\n\n/ Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n /\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nconst configuration_table = [\n / good lazy nice chain /\n new Config(0, 0, 0, 0, deflate_stored), / 0 store only /\n new Config(4, 4, 8, 4, deflate_fast), / 1 max speed, no lazy matches /\n new Config(4, 5, 16, 8, deflate_fast), / 2 /\n new Config(4, 6, 32, 32, deflate_fast), / 3 /\n\n new Config(4, 4, 16, 16, deflate_slow), / 4 lazy matches /\n new Config(8, 16, 32, 32, deflate_slow), / 5 /\n new Config(8, 16, 128, 128, deflate_slow), / 6 /\n new Config(8, 32, 128, 256, deflate_slow), / 7 /\n new Config(32, 128, 258, 1024, deflate_slow), / 8 /\n new Config(32, 258, 258, 4096, deflate_slow) / 9 max compression /\n];\n\n\n/ ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n /\nconst lm_init = (s) => {\n\n s.window_size = 2 s.w_size;\n\n /* CLEAR_HASH(s); /\n zero(s.head); // Fill with NIL (= 0);\n\n / Set the default configuration parameters:\n /\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n this.strm = null; / pointer back to this zlib stream /\n this.status = 0; / as the name implies /\n this.pending_buf = null; / output still pending /\n this.pending_buf_size = 0; / size of pending_buf /\n this.pending_out = 0; / next pending byte to output to the stream /\n this.pending = 0; / nb of bytes in the pending buffer /\n this.wrap = 0; / bit 0 true for zlib, bit 1 true for gzip /\n this.gzhead = null; / gzip header information to write /\n this.gzindex = 0; / where in extra, name, or comment /\n this.method = Z_DEFLATED$2; / can only be DEFLATED /\n this.last_flush = -1; / value of flush param for previous deflate call /\n\n this.w_size = 0; / LZ77 window size (32K by default) /\n this.w_bits = 0; / log2(w_size) (8..16) /\n this.w_mask = 0; / w_size - 1 /\n\n this.window = null;\n / Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n /\n\n this.window_size = 0;\n / Actual size of window: 2wSize, except when the user input buffer\n is directly used as sliding window.\n /\n\n this.prev = null;\n / Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n /\n\n this.head = null; / Heads of the hash chains or NIL. /\n\n this.ins_h = 0; / hash index of string to be inserted /\n this.hash_size = 0; / number of elements in hash table /\n this.hash_bits = 0; / log2(hash_size) /\n this.hash_mask = 0; / hash_size-1 /\n\n this.hash_shift = 0;\n / Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n /\n\n this.block_start = 0;\n / Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n /\n\n this.match_length = 0; / length of best match /\n this.prev_match = 0; / previous match /\n this.match_available = 0; / set if previous match exists /\n this.strstart = 0; / start of string to insert /\n this.match_start = 0; / start of matching string /\n this.lookahead = 0; / number of valid bytes ahead in window /\n\n this.prev_length = 0;\n / Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n /\n\n this.max_chain_length = 0;\n / To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n /\n\n this.max_lazy_match = 0;\n / Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n /\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n / Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n /\n\n this.level = 0; / compression level (1..9) /\n this.strategy = 0; / favor or force Huffman coding/\n\n this.good_match = 0;\n / Use a faster search when the previous match is longer than this /\n\n this.nice_match = 0; / Stop searching when current match exceeds this /\n\n / used by trees.c: /\n\n / Didn't use ct_data typedef below to suppress compiler warning /\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; / literal and length tree /\n // struct ct_data_s dyn_dtree[2D_CODES+1]; /* distance tree /\n // struct ct_data_s bl_tree[2BL_CODES+1]; /* Huffman tree for bit lengths /\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new Uint16Array(HEAP_SIZE 2);\n this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2);\n this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree /\n this.d_desc = null; / desc. for distance tree /\n this.bl_desc = null; / desc. for bit length tree /\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new Uint16Array(MAX_BITS + 1);\n / number of codes at each bit length for an optimal tree /\n\n //int heap[2L_CODES+1]; /* heap used to build the Huffman trees /\n this.heap = new Uint16Array(2 L_CODES + 1); /* heap used to build the Huffman trees /\n zero(this.heap);\n\n this.heap_len = 0; / number of elements in the heap /\n this.heap_max = 0; / element of largest frequency /\n / The sons of heap[n] are heap[2n] and heap[2n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n /\n\n this.depth = new Uint16Array(2 L_CODES + 1); //uch depth[2L_CODES+1];\n zero(this.depth);\n / Depth of each subtree used as tie breaker for trees of equal frequency\n /\n\n this.sym_buf = 0; / buffer for distances and literals/lengths /\n\n this.lit_bufsize = 0;\n / Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n /\n\n this.sym_next = 0; / running index in sym_buf /\n this.sym_end = 0; / symbol table full when sym_next reaches this /\n\n this.opt_len = 0; / bit length of current block with optimal trees /\n this.static_len = 0; / bit length of current block with static trees /\n this.matches = 0; / number of string matches in current block /\n this.insert = 0; / bytes at end of window left to insert /\n\n\n this.bi_buf = 0;\n / Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n /\n this.bi_valid = 0;\n / Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n /\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n / High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n /\n}\n\n\n/ =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n /\nconst deflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const s = strm.state;\n if (!s \|\| s.strm !== strm \|\| (s.status !== INIT_STATE &&\n//#ifdef GZIP\n s.status !== GZIP_STATE &&\n//#endif\n s.status !== EXTRA_STATE &&\n s.status !== NAME_STATE &&\n s.status !== COMMENT_STATE &&\n s.status !== HCRC_STATE &&\n s.status !== BUSY_STATE &&\n s.status !== FINISH_STATE)) {\n return 1;\n }\n return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n const s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n / was made negative by deflate(..., Z_FINISH); /\n }\n s.status =\n//#ifdef GZIP\n s.wrap === 2 ? GZIP_STATE :\n//#endif\n s.wrap ? INIT_STATE : BUSY_STATE;\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = -2;\n _tr_init(s);\n return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n const ret = deflateResetKeep(strm);\n if (ret === Z_OK$3) {\n lm_init(strm.state);\n }\n return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n if (deflateStateCheck(strm) \|\| strm.state.wrap !== 2) {\n return Z_STREAM_ERROR$2;\n }\n strm.state.gzhead = head;\n return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR$2;\n }\n let wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION$1) {\n level = 6;\n }\n\n if (windowBits < 0) { / suppress zlib wrapper /\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; / write gzip wrapper instead /\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 \|\| memLevel > MAX_MEM_LEVEL \|\| method !== Z_DEFLATED$2 \|\|\n windowBits < 8 \|\| windowBits > 15 \|\| level < 0 \|\| level > 9 \|\|\n strategy < 0 \|\| strategy > Z_FIXED \|\| (windowBits === 8 && wrap !== 1)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n / until 256-byte window bug fixed /\n\n const s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n s.status = INIT_STATE; / to pass state test in deflateReset() /\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new Uint8Array(s.w_size 2);\n s.head = new Uint16Array(s.hash_size);\n s.prev = new Uint16Array(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet /\n\n s.lit_bufsize = 1 << (memLevel + 6); / 16K elements by default /\n\n / We overlay pending_buf and sym_buf. This works since the average size\n * for length/distance pairs over any compressed block is assured to be 31\n * bits or less.\n \n Analysis: The longest fixed codes are a length code of 8 bits plus 5\n * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n * possible fixed-codes length/distance pair is then 31 bits total.\n \n sym_buf starts one-fourth of the way into pending_buf. So there are\n * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n * in sym_buf is three bytes -- two for the distance and one for the\n * literal/length. As each symbol is consumed, the pointer to the next\n * sym_buf value to read moves forward three bytes. From that symbol, up to\n * 31 bits are written to pending_buf. The closest the written pending_buf\n * bits gets to the next sym_buf symbol to read is just before the last\n * code is written. At that time, 31(n-2) bits have been written, just\n after 24(n-2) bits have been consumed from sym_buf. sym_buf starts at\n 8n bits into pending_buf. (Note that the symbol buffer fills when n-1\n symbols are written.) The closest the writing gets to what is unread is\n * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n * can range from 128 to 32768.\n \n Therefore, at a minimum, there are 142 bits of space between what is\n * written and what is read in the overlain buffers, so the symbols cannot\n * be overwritten by the compressed data. That space is actually 139 bits,\n * due to the three-bit fixed-code block header.\n \n That covers the case where either Z_FIXED is specified, forcing fixed\n * codes, or when the use of fixed codes is chosen, because that choice\n * results in a smaller compressed block than dynamic codes. That latter\n * condition then assures that the above analysis also covers all dynamic\n * blocks. A dynamic-code block will only be chosen to be emitted if it has\n * fewer bits than a fixed-code block would for the same set of symbols.\n * Therefore its average symbol length is assured to be less than 31. So\n * the compressed data for a dynamic block also cannot overwrite the\n * symbols from which it is being constructed.\n /\n\n s.pending_buf_size = s.lit_bufsize 4;\n s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->sym_buf = s->pending_buf + s->lit_bufsize;\n s.sym_buf = s.lit_bufsize;\n\n //s->sym_end = (s->lit_bufsize - 1) * 3;\n s.sym_end = (s.lit_bufsize - 1) * 3;\n /* We avoid equality with lit_bufsize3 because of wraparound at 64K\n on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n /\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/ ========================================================================= /\nconst deflate$2 = (strm, flush) => {\n\n if (deflateStateCheck(strm) \|\| flush > Z_BLOCK$1 \|\| flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n\n if (!strm.output \|\|\n (strm.avail_in !== 0 && !strm.input) \|\|\n (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n }\n\n const old_flush = s.last_flush;\n s.last_flush = flush;\n\n / Flush as much pending output as possible /\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n / Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n /\n s.last_flush = -1;\n return Z_OK$3;\n }\n\n / Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n /\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH$3) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n / User must not provide more input after the first FINISH: /\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n / Write the header /\n if (s.status === INIT_STATE && s.wrap === 0) {\n s.status = BUSY_STATE;\n }\n if (s.status === INIT_STATE) {\n / zlib header /\n let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n let level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY \|\| s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header \|= (level_flags << 6);\n if (s.strstart !== 0) { header \|= PRESET_DICT; }\n header += 31 - (header % 31);\n\n putShortMSB(s, header);\n\n / Save the adler32 of the preset dictionary: /\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n\n / Compression must start with an empty pending buffer /\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#ifdef GZIP\n if (s.status === GZIP_STATE) {\n / gzip header /\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY \|\| s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n\n / Compression must start with an empty pending buffer /\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY \|\| s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/ != Z_NULL/) {\n let beg = s.pending; / start of bytes to update crc /\n let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n while (s.pending + left > s.pending_buf_size) {\n let copy = s.pending_buf_size - s.pending;\n // zmemcpy(s.pending_buf + s.pending,\n // s.gzhead.extra + s.gzindex, copy);\n s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n s.pending = s.pending_buf_size;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex += copy;\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n left -= copy;\n }\n // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n // TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n let gzhead_extra = new Uint8Array(s.gzhead.extra);\n // zmemcpy(s->pending_buf + s->pending,\n // s->gzhead->extra + s->gzindex, left);\n s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n s.pending += left;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = NAME_STATE;\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/ != Z_NULL/) {\n let beg = s.pending; / start of bytes to update crc /\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = COMMENT_STATE;\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/ != Z_NULL/) {\n let beg = s.pending; / start of bytes to update crc /\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n }\n s.status = HCRC_STATE;\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n }\n s.status = BUSY_STATE;\n\n / Compression must start with an empty pending buffer /\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#endif\n\n / Start a new block or continue the current one.\n /\n if (strm.avail_in !== 0 \|\| s.lookahead !== 0 \|\|\n (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n let bstate = s.level === 0 ? deflate_stored(s, flush) :\n s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush);\n\n if (bstate === BS_FINISH_STARTED \|\| bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE \|\| bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n / avoid BUF_ERROR next call, see above /\n }\n return Z_OK$3;\n / If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n /\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n _tr_align(s);\n }\n else if (flush !== Z_BLOCK$1) { / FULL_FLUSH or SYNC_FLUSH /\n\n _tr_stored_block(s, 0, 0, false);\n / For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n /\n if (flush === Z_FULL_FLUSH$1) {\n / CLEAR_HASH(s); / / forget history /\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; / avoid BUF_ERROR at next call, see above /\n return Z_OK$3;\n }\n }\n }\n\n if (flush !== Z_FINISH$3) { return Z_OK$3; }\n if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n / Write the trailer /\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n / If avail_out is zero, the application will call deflate again\n * to flush the rest.\n /\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n / write the trailer only once! /\n return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const status = strm.state.status;\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/ =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n /\nconst deflateSetDictionary = (strm, dictionary) => {\n\n let dictLength = dictionary.length;\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n const wrap = s.wrap;\n\n if (wrap === 2 \|\| (wrap === 1 && s.status !== INIT_STATE) \|\| s.lookahead) {\n return Z_STREAM_ERROR$2;\n }\n\n / when using zlib wrappers, compute Adler-32 for provided dictionary /\n if (wrap === 1) {\n / adler32(strm->adler, dictionary, dictLength); /\n strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; / avoid computing Adler-32 in read_buf /\n\n / if dictionary would fill window, just replace the history /\n if (dictLength >= s.w_size) {\n if (wrap === 0) { / already empty otherwise /\n / CLEAR_HASH(s); /\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n / use the tail /\n // dictionary = dictionary.slice(dictLength - s.w_size);\n let tmpDict = new Uint8Array(s.w_size);\n tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n / insert dictionary into window and hash /\n const avail = strm.avail_in;\n const next = strm.next_in;\n const input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n let str = s.strstart;\n let n = s.lookahead - (MIN_MATCH - 1);\n do {\n / UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/ Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /from1, from2, from3, .../) {\n const sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n const source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (const p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n // calculate data length\n let len = 0;\n\n for (let i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n const result = new Uint8Array(len);\n\n for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n let chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n return new TextEncoder().encode(str);\n }\n\n let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new Uint8Array(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n / one byte /\n buf[i++] = c;\n } else if (c < 0x800) {\n / two bytes /\n buf[i++] = 0xC0 \| (c >>> 6);\n buf[i++] = 0x80 \| (c & 0x3f);\n } else if (c < 0x10000) {\n / three bytes /\n buf[i++] = 0xE0 \| (c >>> 12);\n buf[i++] = 0x80 \| (c >>> 6 & 0x3f);\n buf[i++] = 0x80 \| (c & 0x3f);\n } else {\n / four bytes /\n buf[i++] = 0xf0 \| (c >>> 18);\n buf[i++] = 0x80 \| (c >>> 12 & 0x3f);\n buf[i++] = 0x80 \| (c >>> 6 & 0x3f);\n buf[i++] = 0x80 \| (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if (buf.subarray && STR_APPLY_UIA_OK) {\n return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n }\n }\n\n let result = '';\n for (let i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n const len = max \|\| buf.length;\n\n if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n return new TextDecoder().decode(buf.subarray(0, max));\n }\n\n let i, out;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n const utf16buf = new Array(len 2);\n\n for (out = 0, i = 0; i < len;) {\n let c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n let c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) \| (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 \| ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 \| (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n max = max \|\| buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n let pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte /\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n / number of bytes available at input /\n this.avail_in = 0;\n / total number of input bytes read so far /\n this.total_in = 0;\n / next output byte should be put there /\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n / remaining free space at output /\n this.avail_out = 0;\n / total number of bytes output so far /\n this.total_out = 0;\n / last error message, NULL if no error /\n this.msg = ''/Z_NULL/;\n / not visible by applications /\n this.state = null;\n / best guess about the data type: binary or text /\n this.data_type = 2/Z_UNKNOWN/;\n / adler32 value of the uncompressed data /\n this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n Z_DEFAULT_COMPRESSION,\n Z_DEFAULT_STRATEGY,\n Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/ ===========================================================================/\n\n\n/\n class Deflate\n \n Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n */\n\n/ internal\n * Deflate.chunks -> Array\n \n Chunks of output data, if [[Deflate#onData]] not overridden.\n /\n\n/\n * Deflate.result -> Uint8Array\n \n Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n /\n\n/\n * Deflate.err -> Number\n \n Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n /\n\n/\n * Deflate.msg -> String\n \n Error message, if [[Deflate.err]] != 0\n /\n\n\n/\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n \n Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n \n - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n \n Additional options, for internal needs:\n \n - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n \n ##### Example:\n \n ```javascript\n * const pako = require('pako')\n * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n \n const deflate = new pako.Deflate({ level: 3});\n \n deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n \n if (deflate.err) { throw new Error(deflate.err); }\n \n console.log(deflate.result);\n * ```\n /\nfunction Deflate$1(options) {\n this.options = common.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED$1,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY\n }, options \|\| {});\n\n let opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = deflate_1$2.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n if (opt.header) {\n deflate_1$2.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n let dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array\|ArrayBuffer\|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - flush_mode (Number\|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n \n Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n \n On fail call [[Deflate#onEnd]] with error code and return false.\n \n ##### Example\n \n ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n /\nDeflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n let status, _flush_mode;\n\n if (this.ended) { return false; }\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n // Make sure avail_out > 6 to avoid repeating markers\n if ((_flush_mode === Z_SYNC_FLUSH \|\| _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n status = deflate_1$2.deflate(strm, _flush_mode);\n\n // Ended => flush and finish\n if (status === Z_STREAM_END$2) {\n if (strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n }\n status = deflate_1$2.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK$2;\n }\n\n // Flush if out buffer full\n if (strm.avail_out === 0) {\n this.onData(strm.output);\n continue;\n }\n\n // Flush if requested and has data\n if (_flush_mode > 0 && strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n \n By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n /\nDeflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n \n Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n /\nDeflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK$2) {\n this.result = common.flattenChunks(this.chunks);\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array\|ArrayBuffer\|String): input data to compress.\n * - options (Object): zlib deflate options.\n \n Compress `data` with deflate algorithm and `options`.\n \n Supported options are:\n \n - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n \n Sugar (options):\n \n - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n \n ##### Example:\n \n ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n \n console.log(pako.deflate(data));\n * ```\n /\nfunction deflate$1(input, options) {\n const deflator = new Deflate$1(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg \|\| messages[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array\|ArrayBuffer\|String): input data to compress.\n * - options (Object): zlib deflate options.\n \n The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n /\nfunction deflateRaw$1(input, options) {\n options = options \|\| {};\n options.raw = true;\n return deflate$1(input, options);\n}\n\n\n/\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array\|ArrayBuffer\|String): input data to compress.\n * - options (Object): zlib deflate options.\n \n The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n */\nfunction gzip$1(input, options) {\n options = options \|\| {};\n options.gzip = true;\n return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209; / got a data error -- remain here until reset /\nconst TYPE$1 = 16191; / i: waiting for type bits, including last-flag bit /\n\n/\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n /\nvar inffast = function inflate_fast(strm, start) {\n let _in; / local strm.input /\n let last; / have enough input while in < last /\n let _out; / local strm.output /\n let beg; / inflate()'s initial strm.output /\n let end; / while out < end, enough space available /\n//#ifdef INFLATE_STRICT\n let dmax; / maximum distance from zlib header /\n//#endif\n let wsize; / window size or zero if not using window /\n let whave; / valid bytes in the window /\n let wnext; / window write index /\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n let s_window; / allocated sliding window, if wsize != 0 /\n let hold; / local strm.hold /\n let bits; / local strm.bits /\n let lcode; / local strm.lencode /\n let dcode; / local strm.distcode /\n let lmask; / mask for first level of length codes /\n let dmask; / mask for first level of distance codes /\n let here; / retrieved table entry /\n let op; / code bits, operation, extra bits, or /\n / window position, window bytes to copy /\n let len; / match length, unused bytes /\n let dist; / match distance /\n let from; / where to copy match from /\n let from_source;\n\n\n let input, output; // JS specific, because we have no pointers\n\n / copy state to local variables /\n const state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n / decode literals and length/distances until end-of-block or not enough\n input data or output space /\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/here.bits/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/here.op/;\n if (op === 0) { / literal /\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/here.val/;\n }\n else if (op & 16) { / length base /\n len = here & 0xffff/here.val/;\n op &= 15; / number of extra bits /\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/here.bits/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/here.op/;\n\n if (op & 16) { / distance base /\n dist = here & 0xffff/here.val/;\n op &= 15; / number of extra bits /\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; / max distance in output /\n if (dist > op) { / see if copy from window /\n op = dist - op; / distance back in window /\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { / very common case /\n from += wsize - op;\n if (op < len) { / some from window /\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; / rest from output /\n from_source = output;\n }\n }\n else if (wnext < op) { / wrap around window /\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { / some from end of window /\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { / some from start of window /\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; / rest from output /\n from_source = output;\n }\n }\n }\n else { / contiguous in window /\n from += wnext - op;\n if (op < len) { / some from window /\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; / rest from output /\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; / copy direct from output /\n do { / minimum length is three /\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { / 2nd level distance code /\n here = dcode[(here & 0xffff)/here.val/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { / 2nd level length code /\n here = lcode[(here & 0xffff)/here.val/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { / end-of-block /\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE$1;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n / return unused bytes (on entry, bits < 8, so in won't go too far back) /\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n / update state and return /\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ / Length codes 257..285 base /\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ / Length codes 257..285 extra /\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ / Distance codes 0..29 base /\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ / Distance codes 0..29 extra /\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n const bits = opts.bits;\n //here = opts.here; / table entry for duplication /\n\n let len = 0; / a code's length in bits /\n let sym = 0; / index of code symbols /\n let min = 0, max = 0; / minimum and maximum code lengths /\n let root = 0; / number of index bits for root table /\n let curr = 0; / number of index bits for current table /\n let drop = 0; / code bits to drop for sub-table /\n let left = 0; / number of prefix codes available /\n let used = 0; / code entries in table used /\n let huff = 0; / Huffman code /\n let incr; / for incrementing code, index /\n let fill; / index for replicating entries /\n let low; / low bits for current root entry /\n let mask; / mask for low root bits /\n let next; / next available space in table /\n let base = null; / base value table to use /\n// let shoextra; / extra bits table to use /\n let match; / use base and extra for symbol >= match /\n const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; / number of codes of each length /\n const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; / offsets in table for each length /\n let extra = null;\n\n let here_bits, here_op, here_val;\n\n /\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n /\n\n / accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) /\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n / bound code lengths, force root to be within code lengths /\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { / no symbols to code at all /\n //table.op[opts.table_index] = 64; //here.op = (var char)64; / invalid code marker /\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) \| (64 << 16) \| 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) \| (64 << 16) \| 0;\n\n opts.bits = 1;\n return 0; / no symbols, but wait for decoding to report error /\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n / check for an over-subscribed or incomplete set of lengths /\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } / over-subscribed /\n }\n if (left > 0 && (type === CODES$1 \|\| max !== 1)) {\n return -1; / incomplete set /\n }\n\n / generate offsets into symbol table for each length for sorting /\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n / sort symbols by length, by symbol order within each length /\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n /\n\n /* set up for code type /\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES$1) {\n base = extra = work; / dummy value--not used /\n match = 20;\n\n } else if (type === LENS$1) {\n base = lbase;\n extra = lext;\n match = 257;\n\n } else { / DISTS /\n base = dbase;\n extra = dext;\n match = 0;\n }\n\n / initialize opts for loop /\n huff = 0; / starting code /\n sym = 0; / starting code symbol /\n len = min; / starting code length /\n next = table_index; / current table to fill in /\n curr = root; / current table index bits /\n drop = 0; / current bits to drop from code for index /\n low = -1; / trigger new sub-table when len > root /\n used = 1 << root; / use root table entries /\n mask = used - 1; / mask for comparing low /\n\n / check available table space /\n if ((type === LENS$1 && used > ENOUGH_LENS$1) \|\|\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n / process all codes and make table entries /\n for (;;) {\n / create table entry /\n here_bits = len - drop;\n if (work[sym] + 1 < match) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] >= match) {\n here_op = extra[work[sym] - match];\n here_val = base[work[sym] - match];\n }\n else {\n here_op = 32 + 64; / end of block /\n here_val = 0;\n }\n\n / replicate for those indices with low len bits equal to huff /\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; / save offset to next table /\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) \| (here_op << 16) \| here_val \|0;\n } while (fill !== 0);\n\n / backwards increment the len-bit code huff /\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n / go to next symbol, update count, len /\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n / create new sub-table if needed /\n if (len > root && (huff & mask) !== low) {\n / if first time, transition to sub-tables /\n if (drop === 0) {\n drop = root;\n }\n\n / increment past last table /\n next += min; / here min is 1 << curr /\n\n / determine length of next table /\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n / check for enough space /\n used += 1 << curr;\n if ((type === LENS$1 && used > ENOUGH_LENS$1) \|\|\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n / point entry in root table to sub-table /\n low = huff & mask;\n /table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;/\n table[low] = (root << 24) \| (curr << 16) \| (next - table_index) \|0;\n }\n }\n\n / fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) /\n if (huff !== 0) {\n //table.op[next + huff] = 64; / invalid code marker /\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) \| (64 << 16) \|0;\n }\n\n / set return parameters /\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n Z_DEFLATED\n} = constants$2;\n\n\n/ STATES ====================================================================/\n/ ===========================================================================/\n\n\nconst HEAD = 16180; / i: waiting for magic header /\nconst FLAGS = 16181; / i: waiting for method and flags (gzip) /\nconst TIME = 16182; / i: waiting for modification time (gzip) /\nconst OS = 16183; / i: waiting for extra flags and operating system (gzip) /\nconst EXLEN = 16184; / i: waiting for extra length (gzip) /\nconst EXTRA = 16185; / i: waiting for extra bytes (gzip) /\nconst NAME = 16186; / i: waiting for end of file name (gzip) /\nconst COMMENT = 16187; / i: waiting for end of comment (gzip) /\nconst HCRC = 16188; / i: waiting for header crc (gzip) /\nconst DICTID = 16189; / i: waiting for dictionary check value /\nconst DICT = 16190; / waiting for inflateSetDictionary() call /\nconst TYPE = 16191; / i: waiting for type bits, including last-flag bit /\nconst TYPEDO = 16192; / i: same, but skip check to exit inflate on new block /\nconst STORED = 16193; / i: waiting for stored size (length and complement) /\nconst COPY_ = 16194; / i/o: same as COPY below, but only first time in /\nconst COPY = 16195; / i/o: waiting for input or output to copy stored block /\nconst TABLE = 16196; / i: waiting for dynamic block table lengths /\nconst LENLENS = 16197; / i: waiting for code length code lengths /\nconst CODELENS = 16198; / i: waiting for length/lit and distance code lengths /\nconst LEN_ = 16199; / i: same as LEN below, but only first time in /\nconst LEN = 16200; / i: waiting for length/lit/eob code /\nconst LENEXT = 16201; / i: waiting for length extra bits /\nconst DIST = 16202; / i: waiting for distance code /\nconst DISTEXT = 16203; / i: waiting for distance extra bits /\nconst MATCH = 16204; / o: waiting for output space to copy string /\nconst LIT = 16205; / o: waiting for output space to write literal /\nconst CHECK = 16206; / i: waiting for 32-bit check value /\nconst LENGTH = 16207; / i: waiting for 32-bit length (gzip) /\nconst DONE = 16208; / finished check, done -- remain here until reset /\nconst BAD = 16209; / got a data error -- remain here until reset /\nconst MEM = 16210; / got an inflate() memory error -- remain here until reset /\nconst SYNC = 16211; / looking for synchronization bytes to restart inflate() /\n\n/ ===========================================================================/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/ 32K LZ77 window /\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n this.strm = null; / pointer back to this zlib stream /\n this.mode = 0; / current inflate mode /\n this.last = false; / true if processing last block /\n this.wrap = 0; / bit 0 true for zlib, bit 1 true for gzip,\n bit 2 true to validate check value /\n this.havedict = false; / true if dictionary provided /\n this.flags = 0; / gzip header method and flags (0 if zlib), or\n -1 if raw or no header yet /\n this.dmax = 0; / zlib header max distance (INFLATE_STRICT) /\n this.check = 0; / protected copy of check value /\n this.total = 0; / protected copy of output count /\n // TODO: may be {}\n this.head = null; / where to save gzip header information /\n\n / sliding window /\n this.wbits = 0; / log base 2 of requested window size /\n this.wsize = 0; / window size or zero if not using window /\n this.whave = 0; / valid bytes in the window /\n this.wnext = 0; / window write index /\n this.window = null; / allocated sliding window, if needed /\n\n / bit accumulator /\n this.hold = 0; / input bit accumulator /\n this.bits = 0; / number of bits in \"in\" /\n\n / for string and stored block copying /\n this.length = 0; / literal or length of data to copy /\n this.offset = 0; / distance back to copy string from /\n\n / for table and code decoding /\n this.extra = 0; / extra bits needed /\n\n / fixed and dynamic code tables /\n this.lencode = null; / starting table for length/literal codes /\n this.distcode = null; / starting table for distance codes /\n this.lenbits = 0; / index bits for lencode /\n this.distbits = 0; / index bits for distcode /\n\n / dynamic table building /\n this.ncode = 0; / number of code length code lengths /\n this.nlen = 0; / number of length code lengths /\n this.ndist = 0; / number of distance code lengths /\n this.have = 0; / number of code lengths in lens[] /\n this.next = null; / next available space in codes[] /\n\n this.lens = new Uint16Array(320); / temporary storage for code lengths /\n this.work = new Uint16Array(288); / work area for code table building /\n\n /\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n /\n //this.codes = new Int32Array(ENOUGH); / space for code tables /\n this.lendyn = null; / dynamic table for length/literal codes (JS specific) /\n this.distdyn = null; / dynamic table for distance codes (JS specific) /\n this.sane = 0; / if false, allow invalid distance too far /\n this.back = 0; / bits back of last unprocessed length/lit /\n this.was = 0; / initial length of match /\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const state = strm.state;\n if (!state \|\| state.strm !== strm \|\|\n state.mode < HEAD \|\| state.mode > SYNC) {\n return 1;\n }\n return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /Z_NULL/\n if (state.wrap) { / to support ill-conceived Java test suite /\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.flags = -1;\n state.dmax = 32768;\n state.head = null/Z_NULL/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n let wrap;\n\n / get the state /\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n\n / extract wrap request from windowBits parameter /\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 5;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n / set number of window bits, free window if different /\n if (windowBits && (windowBits < 8 \|\| windowBits > 15)) {\n return Z_STREAM_ERROR$1;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n / update state and reset the rest of it /\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n if (!strm) { return Z_STREAM_ERROR$1; }\n //strm.msg = Z_NULL; / in case we return an error /\n\n const state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.strm = strm;\n state.window = null/Z_NULL/;\n state.mode = HEAD; / to pass state test in inflateReset2() /\n const ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK$1) {\n strm.state = null/Z_NULL/;\n }\n return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n /\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n / build fixed huffman tables if first call (may not be thread safe) /\n if (virgin) {\n lenfix = new Int32Array(512);\n distfix = new Int32Array(32);\n\n / literal/length table /\n let sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n / distance table /\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n / do this just once /\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n};\n\n\n/\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n /\nconst updatewindow = (strm, src, end, copy) => {\n\n let dist;\n const state = strm.state;\n\n / if it hasn't been done already, allocate space for the window /\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new Uint8Array(state.wsize);\n }\n\n / copy state->wsize or less output bytes into the circular window /\n if (copy >= state.wsize) {\n state.window.set(src.subarray(end - state.wsize, end), 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n state.window.set(src.subarray(end - copy, end), 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n let state;\n let input, output; // input/output buffers\n let next; / next input INDEX /\n let put; / next output INDEX /\n let have, left; / available input and output /\n let hold; / bit buffer /\n let bits; / bits in bit buffer /\n let _in, _out; / save starting available input and output /\n let copy; / number of stored or match bytes to copy /\n let from; / where to copy match bytes from /\n let from_source;\n let here = 0; / current decoding table entry /\n let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //let last; / parent table entry /\n let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n let len; / length to copy for repeats, bits to drop /\n let ret; / return code /\n const hbuf = new Uint8Array(4); / buffer for gzip header crc calculation /\n let opts;\n\n let n; // temporary variable for NEED_BITS\n\n const order = / permutation of code lengths /\n new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n if (inflateStateCheck(strm) \|\| !strm.output \|\|\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR$1;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } / skip check /\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK$1;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { / gzip header /\n if (state.wbits === 0) {\n state.wbits = 15;\n }\n state.check = 0/crc32(0L, Z_NULL, 0)/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) \|\| / check if zlib header allowed /\n (((hold & 0xff)/BITS(8)/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/BITS(4)/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/BITS(4)/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n if (len > 15 \|\| len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n // !!! pako patch. Force use `options.windowBits` if passed.\n // Required to always use max window size by default.\n state.dmax = 1 << state.wbits;\n //state.dmax = 1 << len;\n\n state.flags = 0; / indicate zlib header /\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/adler32(0L, Z_NULL, 0)/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through /\n case TIME:\n //=== NEEDBITS(32); /\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32_1(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through /\n case OS:\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through /\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/Z_NULL/;\n }\n state.mode = EXTRA;\n /* falls through /\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Uint8Array(state.head.extra_len);\n }\n state.head.extra.set(\n input.subarray(\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n next + copy\n ),\n /len + copy > state.head.extra_max - len ? state.head.extra_max : copy,/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n / falls through /\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n / use constant limit because in js we should not preallocate memory /\n if (state.head && len &&\n (state.length < 65536 /state.head.name_max/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n / falls through /\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n / use constant limit because in js we should not preallocate memory /\n if (state.head && len &&\n (state.length < 65536 /state.head.comm_max/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n / falls through /\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); /\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n / falls through /\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT$1;\n }\n strm.adler = state.check = 1/adler32(0L, Z_NULL, 0)/;\n state.mode = TYPE;\n / falls through /\n case TYPE:\n if (flush === Z_BLOCK \|\| flush === Z_TREES) { break inf_leave; }\n / falls through /\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); /\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/BITS(1)/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/BITS(2)/) {\n case 0: /* stored block /\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: / fixed block /\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; / decode codes /\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: / dynamic block /\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// / go to byte boundary /\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); /\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through /\n case COPY_:\n state.mode = COPY;\n / falls through /\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n output.set(input.subarray(next, next + copy), put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); /\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/BITS(5)/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/BITS(5)/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/BITS(4)/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 \|\| state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through /\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n / falls through /\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/BITS(state.lenbits)/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n / handle error breaks in while /\n if (state.mode === BAD) { break; }\n\n / check for end-of-block code (better have one) /\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n / build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values /\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n / falls through /\n case LEN_:\n state.mode = LEN;\n / falls through /\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inffast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /BITS(state.lenbits)/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/BITS(last.bits + last.op)/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n / falls through /\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/BITS(state.extra)/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n / falls through /\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/BITS(state.distbits)/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/BITS(last.bits + last.op)/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n / falls through /\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/BITS(state.extra)/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n / falls through /\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { / copy from window /\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { / copy from output /\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '\|' instead of '+' to make sure that result is signed\n hold \|= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check =\n /UPDATE_CHECK(state.check, put - _out, _out);/\n (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n / falls through /\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n / falls through /\n case DONE:\n ret = Z_STREAM_END$1;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR$1;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR$1;\n case SYNC:\n / falls through /\n default:\n return Z_STREAM_ERROR$1;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n /\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize \|\| (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK \|\| flush !== Z_FINISH$1))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check = /UPDATE_CHECK(state.check, strm.next_out - _out, _out);/\n (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ \|\| state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) \|\| flush === Z_FINISH$1) && ret === Z_OK$1) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n if (inflateStateCheck(strm)) {\n return Z_STREAM_ERROR$1;\n }\n\n let state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n / check state /\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n / save header structure /\n state.head = head;\n head.done = false;\n return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n const dictLength = dictionary.length;\n\n let state;\n let dictid;\n let ret;\n\n / check state /\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR$1;\n }\n\n / check for correct dictionary identifier /\n if (state.mode === DICT) {\n dictid = 1; / adler32(0, null, 0)/\n / dictid = adler32(dictid, dictionary, dictLength); /\n dictid = adler32_1(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR$1;\n }\n }\n / copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate /\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR$1;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/ Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n / true if compressed data believed to be text /\n this.text = 0;\n / modification time /\n this.time = 0;\n / extra flags (not used when writing a gzip file) /\n this.xflags = 0;\n / operating system /\n this.os = 0;\n / pointer to extra field or Z_NULL if none /\n this.extra = null;\n / extra field length (valid if extra != Z_NULL) /\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n / space at extra (only when reading header) /\n // this.extra_max = 0;\n / pointer to zero-terminated file name or Z_NULL /\n this.name = '';\n / space at name (only when reading header) /\n // this.name_max = 0;\n / pointer to zero-terminated comment or Z_NULL /\n this.comment = '';\n / space at comment (only when reading header) /\n // this.comm_max = 0;\n / true if there was or will be a header crc /\n this.hcrc = 0;\n / true when done reading gzip header (not used when writing a gzip file) /\n this.done = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_NO_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/ ===========================================================================/\n\n\n/\n class Inflate\n \n Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n */\n\n/ internal\n * inflate.chunks -> Array\n \n Chunks of output data, if [[Inflate#onData]] not overridden.\n /\n\n/\n * Inflate.result -> Uint8Array\|String\n \n Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n /\n\n/\n * Inflate.err -> Number\n \n Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n /\n\n/\n * Inflate.msg -> String\n \n Error message, if [[Inflate.err]] != 0\n /\n\n\n/\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n \n Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n \n - `windowBits`\n * - `dictionary`\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n \n Additional options, for internal needs:\n \n - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n \n By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n \n ##### Example:\n \n ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n \n const inflate = new pako.Inflate({ level: 3});\n \n inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n \n if (inflate.err) { throw new Error(inflate.err); }\n \n console.log(inflate.result);\n * ```\n */\nfunction Inflate$1(options) {\n this.options = common.assign({\n chunkSize: 1024 64,\n windowBits: 15,\n to: ''\n }, options \|\| {});\n\n const opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits \|= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = inflate_1$2.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n\n this.header = new gzheader();\n\n inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n }\n }\n}\n\n/*\n Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array\|ArrayBuffer): input data\n * - flush_mode (Number\|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n * `true` means Z_FINISH.\n \n Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n \n `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n \n On fail call [[Inflate#onEnd]] with error code and return false.\n \n ##### Example\n \n ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n /\nInflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n const dictionary = this.options.dictionary;\n let status, _flush_mode, last_avail_out;\n\n if (this.ended) return false;\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = inflate_1$2.inflate(strm, _flush_mode);\n\n if (status === Z_NEED_DICT && dictionary) {\n status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n if (status === Z_OK) {\n status = inflate_1$2.inflate(strm, _flush_mode);\n } else if (status === Z_DATA_ERROR) {\n // Replace code with more verbose\n status = Z_NEED_DICT;\n }\n }\n\n // Skip snyc markers if more data follows and not raw mode\n while (strm.avail_in > 0 &&\n status === Z_STREAM_END &&\n strm.state.wrap > 0 &&\n data[strm.next_in] !== 0)\n {\n inflate_1$2.inflateReset(strm);\n status = inflate_1$2.inflate(strm, _flush_mode);\n }\n\n switch (status) {\n case Z_STREAM_ERROR:\n case Z_DATA_ERROR:\n case Z_NEED_DICT:\n case Z_MEM_ERROR:\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n // Remember real `avail_out` value, because we may patch out buffer content\n // to align utf8 strings boundaries.\n last_avail_out = strm.avail_out;\n\n if (strm.next_out) {\n if (strm.avail_out === 0 \|\| status === Z_STREAM_END) {\n\n if (this.options.to === 'string') {\n\n let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n let tail = strm.next_out - next_out_utf8;\n let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail & realign counters\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n this.onData(utf8str);\n\n } else {\n this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n }\n }\n }\n\n // Must repeat iteration if out buffer is full\n if (status === Z_OK && last_avail_out === 0) continue;\n\n // Finalize if end of stream reached.\n if (status === Z_STREAM_END) {\n status = inflate_1$2.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return true;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array\|String): output data. When string output requested,\n * each chunk will be string.\n \n By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n /\nInflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n \n Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n /\nInflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = common.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/\n * inflate(data[, options]) -> Uint8Array\|String\n * - data (Uint8Array\|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n \n Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n \n Supported options are:\n \n - windowBits\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n \n Sugar (options):\n \n - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n \n \n * ##### Example:\n \n ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n \n try {\n * output = pako.inflate(input);\n * } catch (err) {\n * console.log(err);\n * }\n * ```\n /\nfunction inflate$1(input, options) {\n const inflator = new Inflate$1(options);\n\n inflator.push(input);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) throw inflator.msg \|\| messages[inflator.err];\n\n return inflator.result;\n}\n\n\n/\n * inflateRaw(data[, options]) -> Uint8Array\|String\n * - data (Uint8Array\|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n \n The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n /\nfunction inflateRaw$1(input, options) {\n options = options \|\| {};\n options.raw = true;\n return inflate$1(input, options);\n}\n\n\n/\n * ungzip(data[, options]) -> Uint8Array\|String\n * - data (Uint8Array\|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n \n Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n /\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","/\n * Errors from Anima API, common across multiple routes.\n /\nexport type CommonApiError =\n \| \"Missing Authorization header\"\n \| \"Invalid Authorization header\"\n \| \"Missing teamId\"\n \| \"Internal server error\"\n \| \"Forbidden, no team access\"\n \| \"Requested Usage Exceeds Limit\"\n \| \"Too many concurrent jobs\"\n \| \"Invalid Anima token\"\n \| \"Job not found\";\n\n/\n Codegen errors from the worker\n /\nexport type GetCodeFromFigmaErrorReason =\n \| \"Selected node type is not supported\"\n \| \"Invisible group nodes are unsupported\"\n \| \"Selected node is a page with multiple children\"\n \| \"Selected node is a page with no valid children\"\n \| \"There is no node with the given id\"\n \| \"Invalid Figma token\"\n \| \"Anima API connection error\"\n \| \"Figma token expired\"\n \| \"Invalid user token\"\n \| \"Figma file not found\"\n \| \"Figma rate limit exceeded\"\n \| \"Figma selection too large\"\n \| \"Invalid responsive page node type\"\n \| \"Unknown\";\n\n/\n Codegen errors from the \"/codegen\" route\n /\nexport type CodegenRouteErrorReason =\n \| \"Not all frames id from responsive pages are mentioned on the nodes id list\"\n \| \"Too many screens to import\";\n\n/\n Errors from the SDK\n /\nexport type SDKErrorReason =\n \| \"Invalid body payload\"\n \| \"Connection closed before the 'done' message\"\n \| \"Response body is null\";\n\n/\n Errors from the Website To Code Flow\n /\nexport type GetCodeFromWebsiteErrorReason = \"Scraping is blocked\" \| \"Unknown\";\n\n/\n Errors from the Prompt To Code Flow\n /\nexport type GetCodeFromPromptErrorReason =\n \| \"Invalid prompt\"\n \| \"Generation failed\"\n \| \"Unknown\";\n\nexport class CodegenError extends Error {\n status?: number;\n detail?: unknown;\n\n constructor({\n name,\n reason,\n status,\n detail,\n }: {\n name: string;\n reason:\n \| CommonApiError\n \| GetCodeFromFigmaErrorReason\n \| CodegenRouteErrorReason\n \| SDKErrorReason\n \| GetCodeFromWebsiteErrorReason\n \| GetCodeFromPromptErrorReason;\n status?: number;\n detail?: unknown;\n }) {\n super();\n this.name = name;\n this.message = reason;\n this.detail = detail;\n this.status = status;\n }\n}\n\n/\n Figma REST API Errors\n /\n\nexport class MalformattedFigmaToken extends Error {\n constructor() {\n super(\"Malformatted Figma Token\");\n }\n}\n\nexport class MissingFigmaToken extends Error {\n constructor() {\n super(\"Missing Figma Token\");\n }\n}\n\nexport class NeedsReauthFigmaToken extends Error {\n constructor() {\n super(\"Needs Reauth Figma Token\");\n }\n}\n\nexport class ExpiredFigmaToken extends Error {\n constructor() {\n super(\"Expired Figma Token\");\n }\n}\n\nexport class FileNotExportable extends Error {\n constructor() {\n super(\"File Not Exportable\");\n }\n}\n\nexport class UnknownForbiddenFigmaError extends Error {\n reason: string \| null;\n\n constructor({ reason }: { reason: string \| null }) {\n super(\"Unknown Forbidden Figma Error\");\n\n this.reason = reason;\n }\n}\n\nconst notFoundErrorMessage = \"Not Found\";\nexport class NotFound extends Error {\n constructor({ cause }: { cause?: unknown }) {\n super(notFoundErrorMessage);\n\n this.cause = cause;\n }\n}\nexport const isNotFound = (error: Error) => {\n return error.message === notFoundErrorMessage;\n};\n\nconst unknownFigmaApiExceptionMessage = \"Unknown Figma API Exception\";\nexport class UnknownFigmaApiException extends Error {\n constructor({ cause }: { cause: unknown }) {\n super(unknownFigmaApiExceptionMessage);\n\n this.cause = cause;\n }\n}\nexport const isUnknownFigmaApiException = (error: Error) => {\n return error.message === unknownFigmaApiExceptionMessage;\n};\n\nconst rateLimitExceededErrorMessage = \"Rate Limit Exceeded\";\nexport class RateLimitExceeded extends Error {\n constructor({ cause }: { cause?: unknown }) {\n super(rateLimitExceededErrorMessage);\n\n this.cause = cause;\n }\n}\nexport const isRateLimitExceeded = (error: Error) => {\n return error.message === rateLimitExceededErrorMessage;\n};\n\nconst requestTooLargeMessage = \"Request Too Large\";\nexport class RequestTooLarge extends Error {\n constructor({ cause }: { cause?: unknown }) {\n super(requestTooLargeMessage);\n\n this.cause = cause;\n }\n}\nexport const isRequestTooLarge = (error: Error) => {\n return error.message === requestTooLargeMessage;\n};\n","/* A special constant with type `never` /\nexport const NEVER = Object.freeze({\n status: \"aborted\",\n});\nexport /@__NO_SIDE_EFFECTS__/ function $constructor(name, initializer, params) {\n function init(inst, def) {\n if (!inst._zod) {\n Object.defineProperty(inst, \"_zod\", {\n value: {\n def,\n constr: _,\n traits: new Set(),\n },\n enumerable: false,\n });\n }\n if (inst._zod.traits.has(name)) {\n return;\n }\n inst._zod.traits.add(name);\n initializer(inst, def);\n // support prototype modifications\n const proto = _.prototype;\n const keys = Object.keys(proto);\n for (let i = 0; i < keys.length; i++) {\n const k = keys[i];\n if (!(k in inst)) {\n inst[k] = proto[k].bind(inst);\n }\n }\n }\n // doesn't work if Parent has a constructor with arguments\n const Parent = params?.Parent ?? Object;\n class Definition extends Parent {\n }\n Object.defineProperty(Definition, \"name\", { value: name });\n function _(def) {\n var _a;\n const inst = params?.Parent ? new Definition() : this;\n init(inst, def);\n (_a = inst._zod).deferred ?? (_a.deferred = []);\n for (const fn of inst._zod.deferred) {\n fn();\n }\n return inst;\n }\n Object.defineProperty(_, \"init\", { value: init });\n Object.defineProperty(_, Symbol.hasInstance, {\n value: (inst) => {\n if (params?.Parent && inst instanceof params.Parent)\n return true;\n return inst?._zod?.traits?.has(name);\n },\n });\n Object.defineProperty(_, \"name\", { value: name });\n return _;\n}\n////////////////////////////// UTILITIES ///////////////////////////////////////\nexport const $brand = Symbol(\"zod_brand\");\nexport class $ZodAsyncError extends Error {\n constructor() {\n super(`Encountered Promise during synchronous parse. Use .parseAsync() instead.`);\n }\n}\nexport class $ZodEncodeError extends Error {\n constructor(name) {\n super(`Encountered unidirectional transform during encode: ${name}`);\n this.name = \"ZodEncodeError\";\n }\n}\nexport const globalConfig = {};\nexport function config(newConfig) {\n if (newConfig)\n Object.assign(globalConfig, newConfig);\n return globalConfig;\n}\n","// functions\nexport function assertEqual(val) {\n return val;\n}\nexport function assertNotEqual(val) {\n return val;\n}\nexport function assertIs(_arg) { }\nexport function assertNever(_x) {\n throw new Error(\"Unexpected value in exhaustive check\");\n}\nexport function assert(_) { }\nexport function getEnumValues(entries) {\n const numericValues = Object.values(entries).filter((v) => typeof v === \"number\");\n const values = Object.entries(entries)\n .filter(([k, _]) => numericValues.indexOf(+k) === -1)\n .map(([_, v]) => v);\n return values;\n}\nexport function joinValues(array, separator = \"\|\") {\n return array.map((val) => stringifyPrimitive(val)).join(separator);\n}\nexport function jsonStringifyReplacer(_, value) {\n if (typeof value === \"bigint\")\n return value.toString();\n return value;\n}\nexport function cached(getter) {\n const set = false;\n return {\n get value() {\n if (!set) {\n const value = getter();\n Object.defineProperty(this, \"value\", { value });\n return value;\n }\n throw new Error(\"cached value already set\");\n },\n };\n}\nexport function nullish(input) {\n return input === null \|\| input === undefined;\n}\nexport function cleanRegex(source) {\n const start = source.startsWith(\"^\") ? 1 : 0;\n const end = source.endsWith(\"$\") ? source.length - 1 : source.length;\n return source.slice(start, end);\n}\nexport function floatSafeRemainder(val, step) {\n const valDecCount = (val.toString().split(\".\")[1] \|\| \"\").length;\n const stepString = step.toString();\n let stepDecCount = (stepString.split(\".\")[1] \|\| \"\").length;\n if (stepDecCount === 0 && /\\d?e-\\d?/.test(stepString)) {\n const match = stepString.match(/\\d?e-(\\d?)/);\n if (match?.[1]) {\n stepDecCount = Number.parseInt(match[1]);\n }\n }\n const decCount = valDecCount > stepDecCount ? valDecCount : stepDecCount;\n const valInt = Number.parseInt(val.toFixed(decCount).replace(\".\", \"\"));\n const stepInt = Number.parseInt(step.toFixed(decCount).replace(\".\", \"\"));\n return (valInt % stepInt) / 10 * decCount;\n}\nconst EVALUATING = Symbol(\"evaluating\");\nexport function defineLazy(object, key, getter) {\n let value = undefined;\n Object.defineProperty(object, key, {\n get() {\n if (value === EVALUATING) {\n // Circular reference detected, return undefined to break the cycle\n return undefined;\n }\n if (value === undefined) {\n value = EVALUATING;\n value = getter();\n }\n return value;\n },\n set(v) {\n Object.defineProperty(object, key, {\n value: v,\n // configurable: true,\n });\n // object[key] = v;\n },\n configurable: true,\n });\n}\nexport function objectClone(obj) {\n return Object.create(Object.getPrototypeOf(obj), Object.getOwnPropertyDescriptors(obj));\n}\nexport function assignProp(target, prop, value) {\n Object.defineProperty(target, prop, {\n value,\n writable: true,\n enumerable: true,\n configurable: true,\n });\n}\nexport function mergeDefs(...defs) {\n const mergedDescriptors = {};\n for (const def of defs) {\n const descriptors = Object.getOwnPropertyDescriptors(def);\n Object.assign(mergedDescriptors, descriptors);\n }\n return Object.defineProperties({}, mergedDescriptors);\n}\nexport function cloneDef(schema) {\n return mergeDefs(schema._zod.def);\n}\nexport function getElementAtPath(obj, path) {\n if (!path)\n return obj;\n return path.reduce((acc, key) => acc?.[key], obj);\n}\nexport function promiseAllObject(promisesObj) {\n const keys = Object.keys(promisesObj);\n const promises = keys.map((key) => promisesObj[key]);\n return Promise.all(promises).then((results) => {\n const resolvedObj = {};\n for (let i = 0; i < keys.length; i++) {\n resolvedObj[keys[i]] = results[i];\n }\n return resolvedObj;\n });\n}\nexport function randomString(length = 10) {\n const chars = \"abcdefghijklmnopqrstuvwxyz\";\n let str = \"\";\n for (let i = 0; i < length; i++) {\n str += chars[Math.floor(Math.random() * chars.length)];\n }\n return str;\n}\nexport function esc(str) {\n return JSON.stringify(str);\n}\nexport function slugify(input) {\n return input\n .toLowerCase()\n .trim()\n .replace(/[^\\w\\s-]/g, \"\")\n .replace(/[\\s_-]+/g, \"-\")\n .replace(/^-+\|-+$/g, \"\");\n}\nexport const captureStackTrace = (\"captureStackTrace\" in Error ? Error.captureStackTrace : (..._args) => { });\nexport function isObject(data) {\n return typeof data === \"object\" && data !== null && !Array.isArray(data);\n}\nexport const allowsEval = cached(() => {\n // @ts-ignore\n if (typeof navigator !== \"undefined\" && navigator?.userAgent?.includes(\"Cloudflare\")) {\n return false;\n }\n try {\n const F = Function;\n new F(\"\");\n return true;\n }\n catch (_) {\n return false;\n }\n});\nexport function isPlainObject(o) {\n if (isObject(o) === false)\n return false;\n // modified constructor\n const ctor = o.constructor;\n if (ctor === undefined)\n return true;\n if (typeof ctor !== \"function\")\n return true;\n // modified prototype\n const prot = ctor.prototype;\n if (isObject(prot) === false)\n return false;\n // ctor doesn't have static `isPrototypeOf`\n if (Object.prototype.hasOwnProperty.call(prot, \"isPrototypeOf\") === false) {\n return false;\n }\n return true;\n}\nexport function shallowClone(o) {\n if (isPlainObject(o))\n return { ...o };\n if (Array.isArray(o))\n return [...o];\n return o;\n}\nexport function numKeys(data) {\n let keyCount = 0;\n for (const key in data) {\n if (Object.prototype.hasOwnProperty.call(data, key)) {\n keyCount++;\n }\n }\n return keyCount;\n}\nexport const getParsedType = (data) => {\n const t = typeof data;\n switch (t) {\n case \"undefined\":\n return \"undefined\";\n case \"string\":\n return \"string\";\n case \"number\":\n return Number.isNaN(data) ? \"nan\" : \"number\";\n case \"boolean\":\n return \"boolean\";\n case \"function\":\n return \"function\";\n case \"bigint\":\n return \"bigint\";\n case \"symbol\":\n return \"symbol\";\n case \"object\":\n if (Array.isArray(data)) {\n return \"array\";\n }\n if (data === null) {\n return \"null\";\n }\n if (data.then && typeof data.then === \"function\" && data.catch && typeof data.catch === \"function\") {\n return \"promise\";\n }\n if (typeof Map !== \"undefined\" && data instanceof Map) {\n return \"map\";\n }\n if (typeof Set !== \"undefined\" && data instanceof Set) {\n return \"set\";\n }\n if (typeof Date !== \"undefined\" && data instanceof Date) {\n return \"date\";\n }\n // @ts-ignore\n if (typeof File !== \"undefined\" && data instanceof File) {\n return \"file\";\n }\n return \"object\";\n default:\n throw new Error(`Unknown data type: ${t}`);\n }\n};\nexport const propertyKeyTypes = new Set([\"string\", \"number\", \"symbol\"]);\nexport const primitiveTypes = new Set([\"string\", \"number\", \"bigint\", \"boolean\", \"symbol\", \"undefined\"]);\nexport function escapeRegex(str) {\n return str.replace(/[.+?^${}()\|[\\]\\\\]/g, \"\\\\$&\");\n}\n// zod-specific utils\nexport function clone(inst, def, params) {\n const cl = new inst._zod.constr(def ?? inst._zod.def);\n if (!def \|\| params?.parent)\n cl._zod.parent = inst;\n return cl;\n}\nexport function normalizeParams(_params) {\n const params = _params;\n if (!params)\n return {};\n if (typeof params === \"string\")\n return { error: () => params };\n if (params?.message !== undefined) {\n if (params?.error !== undefined)\n throw new Error(\"Cannot specify both `message` and `error` params\");\n params.error = params.message;\n }\n delete params.message;\n if (typeof params.error === \"string\")\n return { ...params, error: () => params.error };\n return params;\n}\nexport function createTransparentProxy(getter) {\n let target;\n return new Proxy({}, {\n get(_, prop, receiver) {\n target ?? (target = getter());\n return Reflect.get(target, prop, receiver);\n },\n set(_, prop, value, receiver) {\n target ?? (target = getter());\n return Reflect.set(target, prop, value, receiver);\n },\n has(_, prop) {\n target ?? (target = getter());\n return Reflect.has(target, prop);\n },\n deleteProperty(_, prop) {\n target ?? (target = getter());\n return Reflect.deleteProperty(target, prop);\n },\n ownKeys(_) {\n target ?? (target = getter());\n return Reflect.ownKeys(target);\n },\n getOwnPropertyDescriptor(_, prop) {\n target ?? (target = getter());\n return Reflect.getOwnPropertyDescriptor(target, prop);\n },\n defineProperty(_, prop, descriptor) {\n target ?? (target = getter());\n return Reflect.defineProperty(target, prop, descriptor);\n },\n });\n}\nexport function stringifyPrimitive(value) {\n if (typeof value === \"bigint\")\n return value.toString() + \"n\";\n if (typeof value === \"string\")\n return `\"${value}\"`;\n return `${value}`;\n}\nexport function optionalKeys(shape) {\n return Object.keys(shape).filter((k) => {\n return shape[k]._zod.optin === \"optional\" && shape[k]._zod.optout === \"optional\";\n });\n}\nexport const NUMBER_FORMAT_RANGES = {\n safeint: [Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER],\n int32: [-2147483648, 2147483647],\n uint32: [0, 4294967295],\n float32: [-3.4028234663852886e38, 3.4028234663852886e38],\n float64: [-Number.MAX_VALUE, Number.MAX_VALUE],\n};\nexport const BIGINT_FORMAT_RANGES = {\n int64: [/ @__PURE__/ BigInt(\"-9223372036854775808\"), / @__PURE__/ BigInt(\"9223372036854775807\")],\n uint64: [/ @__PURE__/ BigInt(0), / @__PURE__/ BigInt(\"18446744073709551615\")],\n};\nexport function pick(schema, mask) {\n const currDef = schema._zod.def;\n const checks = currDef.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n throw new Error(\".pick() cannot be used on object schemas containing refinements\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const newShape = {};\n for (const key in mask) {\n if (!(key in currDef.shape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n newShape[key] = currDef.shape[key];\n }\n assignProp(this, \"shape\", newShape); // self-caching\n return newShape;\n },\n checks: [],\n });\n return clone(schema, def);\n}\nexport function omit(schema, mask) {\n const currDef = schema._zod.def;\n const checks = currDef.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n throw new Error(\".omit() cannot be used on object schemas containing refinements\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const newShape = { ...schema._zod.def.shape };\n for (const key in mask) {\n if (!(key in currDef.shape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n delete newShape[key];\n }\n assignProp(this, \"shape\", newShape); // self-caching\n return newShape;\n },\n checks: [],\n });\n return clone(schema, def);\n}\nexport function extend(schema, shape) {\n if (!isPlainObject(shape)) {\n throw new Error(\"Invalid input to extend: expected a plain object\");\n }\n const checks = schema._zod.def.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n // Only throw if new shape overlaps with existing shape\n // Use getOwnPropertyDescriptor to check key existence without accessing values\n const existingShape = schema._zod.def.shape;\n for (const key in shape) {\n if (Object.getOwnPropertyDescriptor(existingShape, key) !== undefined) {\n throw new Error(\"Cannot overwrite keys on object schemas containing refinements. Use `.safeExtend()` instead.\");\n }\n }\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const _shape = { ...schema._zod.def.shape, ...shape };\n assignProp(this, \"shape\", _shape); // self-caching\n return _shape;\n },\n });\n return clone(schema, def);\n}\nexport function safeExtend(schema, shape) {\n if (!isPlainObject(shape)) {\n throw new Error(\"Invalid input to safeExtend: expected a plain object\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const _shape = { ...schema._zod.def.shape, ...shape };\n assignProp(this, \"shape\", _shape); // self-caching\n return _shape;\n },\n });\n return clone(schema, def);\n}\nexport function merge(a, b) {\n const def = mergeDefs(a._zod.def, {\n get shape() {\n const _shape = { ...a._zod.def.shape, ...b._zod.def.shape };\n assignProp(this, \"shape\", _shape); // self-caching\n return _shape;\n },\n get catchall() {\n return b._zod.def.catchall;\n },\n checks: [], // delete existing checks\n });\n return clone(a, def);\n}\nexport function partial(Class, schema, mask) {\n const currDef = schema._zod.def;\n const checks = currDef.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n throw new Error(\".partial() cannot be used on object schemas containing refinements\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const oldShape = schema._zod.def.shape;\n const shape = { ...oldShape };\n if (mask) {\n for (const key in mask) {\n if (!(key in oldShape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n // if (oldShape[key]!._zod.optin === \"optional\") continue;\n shape[key] = Class\n ? new Class({\n type: \"optional\",\n innerType: oldShape[key],\n })\n : oldShape[key];\n }\n }\n else {\n for (const key in oldShape) {\n // if (oldShape[key]!._zod.optin === \"optional\") continue;\n shape[key] = Class\n ? new Class({\n type: \"optional\",\n innerType: oldShape[key],\n })\n : oldShape[key];\n }\n }\n assignProp(this, \"shape\", shape); // self-caching\n return shape;\n },\n checks: [],\n });\n return clone(schema, def);\n}\nexport function required(Class, schema, mask) {\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const oldShape = schema._zod.def.shape;\n const shape = { ...oldShape };\n if (mask) {\n for (const key in mask) {\n if (!(key in shape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n // overwrite with non-optional\n shape[key] = new Class({\n type: \"nonoptional\",\n innerType: oldShape[key],\n });\n }\n }\n else {\n for (const key in oldShape) {\n // overwrite with non-optional\n shape[key] = new Class({\n type: \"nonoptional\",\n innerType: oldShape[key],\n });\n }\n }\n assignProp(this, \"shape\", shape); // self-caching\n return shape;\n },\n });\n return clone(schema, def);\n}\n// invalid_type \| too_big \| too_small \| invalid_format \| not_multiple_of \| unrecognized_keys \| invalid_union \| invalid_key \| invalid_element \| invalid_value \| custom\nexport function aborted(x, startIndex = 0) {\n if (x.aborted === true)\n return true;\n for (let i = startIndex; i < x.issues.length; i++) {\n if (x.issues[i]?.continue !== true) {\n return true;\n }\n }\n return false;\n}\nexport function prefixIssues(path, issues) {\n return issues.map((iss) => {\n var _a;\n (_a = iss).path ?? (_a.path = []);\n iss.path.unshift(path);\n return iss;\n });\n}\nexport function unwrapMessage(message) {\n return typeof message === \"string\" ? message : message?.message;\n}\nexport function finalizeIssue(iss, ctx, config) {\n const full = { ...iss, path: iss.path ?? [] };\n // for backwards compatibility\n if (!iss.message) {\n const message = unwrapMessage(iss.inst?._zod.def?.error?.(iss)) ??\n unwrapMessage(ctx?.error?.(iss)) ??\n unwrapMessage(config.customError?.(iss)) ??\n unwrapMessage(config.localeError?.(iss)) ??\n \"Invalid input\";\n full.message = message;\n }\n // delete (full as any).def;\n delete full.inst;\n delete full.continue;\n if (!ctx?.reportInput) {\n delete full.input;\n }\n return full;\n}\nexport function getSizableOrigin(input) {\n if (input instanceof Set)\n return \"set\";\n if (input instanceof Map)\n return \"map\";\n // @ts-ignore\n if (input instanceof File)\n return \"file\";\n return \"unknown\";\n}\nexport function getLengthableOrigin(input) {\n if (Array.isArray(input))\n return \"array\";\n if (typeof input === \"string\")\n return \"string\";\n return \"unknown\";\n}\nexport function parsedType(data) {\n const t = typeof data;\n switch (t) {\n case \"number\": {\n return Number.isNaN(data) ? \"nan\" : \"number\";\n }\n case \"object\": {\n if (data === null) {\n return \"null\";\n }\n if (Array.isArray(data)) {\n return \"array\";\n }\n const obj = data;\n if (obj && Object.getPrototypeOf(obj) !== Object.prototype && \"constructor\" in obj && obj.constructor) {\n return obj.constructor.name;\n }\n }\n }\n return t;\n}\nexport function issue(...args) {\n const [iss, input, inst] = args;\n if (typeof iss === \"string\") {\n return {\n message: iss,\n code: \"custom\",\n input,\n inst,\n };\n }\n return { ...iss };\n}\nexport function cleanEnum(obj) {\n return Object.entries(obj)\n .filter(([k, _]) => {\n // return true if NaN, meaning it's not a number, thus a string key\n return Number.isNaN(Number.parseInt(k, 10));\n })\n .map((el) => el[1]);\n}\n// Codec utility functions\nexport function base64ToUint8Array(base64) {\n const binaryString = atob(base64);\n const bytes = new Uint8Array(binaryString.length);\n for (let i = 0; i < binaryString.length; i++) {\n bytes[i] = binaryString.charCodeAt(i);\n }\n return bytes;\n}\nexport function uint8ArrayToBase64(bytes) {\n let binaryString = \"\";\n for (let i = 0; i < bytes.length; i++) {\n binaryString += String.fromCharCode(bytes[i]);\n }\n return btoa(binaryString);\n}\nexport function base64urlToUint8Array(base64url) {\n const base64 = base64url.replace(/-/g, \"+\").replace(/_/g, \"/\");\n const padding = \"=\".repeat((4 - (base64.length % 4)) % 4);\n return base64ToUint8Array(base64 + padding);\n}\nexport function uint8ArrayToBase64url(bytes) {\n return uint8ArrayToBase64(bytes).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/=/g, \"\");\n}\nexport function hexToUint8Array(hex) {\n const cleanHex = hex.replace(/^0x/, \"\");\n if (cleanHex.length % 2 !== 0) {\n throw new Error(\"Invalid hex string length\");\n }\n const bytes = new Uint8Array(cleanHex.length / 2);\n for (let i = 0; i < cleanHex.length; i += 2) {\n bytes[i / 2] = Number.parseInt(cleanHex.slice(i, i + 2), 16);\n }\n return bytes;\n}\nexport function uint8ArrayToHex(bytes) {\n return Array.from(bytes)\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\");\n}\n// instanceof\nexport class Class {\n constructor(..._args) { }\n}\n","import { $constructor } from \"./core.js\";\nimport as util from \"./util.js\";\nconst initializer = (inst, def) => {\n inst.name = \"$ZodError\";\n Object.defineProperty(inst, \"_zod\", {\n value: inst._zod,\n enumerable: false,\n });\n Object.defineProperty(inst, \"issues\", {\n value: def,\n enumerable: false,\n });\n inst.message = JSON.stringify(def, util.jsonStringifyReplacer, 2);\n Object.defineProperty(inst, \"toString\", {\n value: () => inst.message,\n enumerable: false,\n });\n};\nexport const $ZodError = $constructor(\"$ZodError\", initializer);\nexport const $ZodRealError = $constructor(\"$ZodError\", initializer, { Parent: Error });\nexport function flattenError(error, mapper = (issue) => issue.message) {\n const fieldErrors = {};\n const formErrors = [];\n for (const sub of error.issues) {\n if (sub.path.length > 0) {\n fieldErrors[sub.path[0]] = fieldErrors[sub.path[0]] \|\| [];\n fieldErrors[sub.path[0]].push(mapper(sub));\n }\n else {\n formErrors.push(mapper(sub));\n }\n }\n return { formErrors, fieldErrors };\n}\nexport function formatError(error, mapper = (issue) => issue.message) {\n const fieldErrors = { _errors: [] };\n const processError = (error) => {\n for (const issue of error.issues) {\n if (issue.code === \"invalid_union\" && issue.errors.length) {\n issue.errors.map((issues) => processError({ issues }));\n }\n else if (issue.code === \"invalid_key\") {\n processError({ issues: issue.issues });\n }\n else if (issue.code === \"invalid_element\") {\n processError({ issues: issue.issues });\n }\n else if (issue.path.length === 0) {\n fieldErrors._errors.push(mapper(issue));\n }\n else {\n let curr = fieldErrors;\n let i = 0;\n while (i < issue.path.length) {\n const el = issue.path[i];\n const terminal = i === issue.path.length - 1;\n if (!terminal) {\n curr[el] = curr[el] \|\| { _errors: [] };\n }\n else {\n curr[el] = curr[el] \|\| { _errors: [] };\n curr[el]._errors.push(mapper(issue));\n }\n curr = curr[el];\n i++;\n }\n }\n }\n };\n processError(error);\n return fieldErrors;\n}\nexport function treeifyError(error, mapper = (issue) => issue.message) {\n const result = { errors: [] };\n const processError = (error, path = []) => {\n var _a, _b;\n for (const issue of error.issues) {\n if (issue.code === \"invalid_union\" && issue.errors.length) {\n // regular union error\n issue.errors.map((issues) => processError({ issues }, issue.path));\n }\n else if (issue.code === \"invalid_key\") {\n processError({ issues: issue.issues }, issue.path);\n }\n else if (issue.code === \"invalid_element\") {\n processError({ issues: issue.issues }, issue.path);\n }\n else {\n const fullpath = [...path, ...issue.path];\n if (fullpath.length === 0) {\n result.errors.push(mapper(issue));\n continue;\n }\n let curr = result;\n let i = 0;\n while (i < fullpath.length) {\n const el = fullpath[i];\n const terminal = i === fullpath.length - 1;\n if (typeof el === \"string\") {\n curr.properties ?? (curr.properties = {});\n (_a = curr.properties)[el] ?? (_a[el] = { errors: [] });\n curr = curr.properties[el];\n }\n else {\n curr.items ?? (curr.items = []);\n (_b = curr.items)[el] ?? (_b[el] = { errors: [] });\n curr = curr.items[el];\n }\n if (terminal) {\n curr.errors.push(mapper(issue));\n }\n i++;\n }\n }\n }\n };\n processError(error);\n return result;\n}\n/** Format a ZodError as a human-readable string in the following form.\n \n From\n \n ```ts\n * ZodError {\n * issues: [\n * {\n * expected: 'string',\n * code: 'invalid_type',\n * path: [ 'username' ],\n * message: 'Invalid input: expected string'\n * },\n * {\n * expected: 'number',\n * code: 'invalid_type',\n * path: [ 'favoriteNumbers', 1 ],\n * message: 'Invalid input: expected number'\n * }\n * ];\n * }\n * ```\n \n to\n \n ```\n * username\n * ✖ Expected number, received string at \"username\n * favoriteNumbers[0]\n * ✖ Invalid input: expected number\n * ```\n /\nexport function toDotPath(_path) {\n const segs = [];\n const path = _path.map((seg) => (typeof seg === \"object\" ? seg.key : seg));\n for (const seg of path) {\n if (typeof seg === \"number\")\n segs.push(`[${seg}]`);\n else if (typeof seg === \"symbol\")\n segs.push(`[${JSON.stringify(String(seg))}]`);\n else if (/[^\\w$]/.test(seg))\n segs.push(`[${JSON.stringify(seg)}]`);\n else {\n if (segs.length)\n segs.push(\".\");\n segs.push(seg);\n }\n }\n return segs.join(\"\");\n}\nexport function prettifyError(error) {\n const lines = [];\n // sort by path length\n const issues = [...error.issues].sort((a, b) => (a.path ?? []).length - (b.path ?? []).length);\n // Process each issue\n for (const issue of issues) {\n lines.push(`✖ ${issue.message}`);\n if (issue.path?.length)\n lines.push(` → at ${toDotPath(issue.path)}`);\n }\n // Convert Map to formatted string\n return lines.join(\"\\n\");\n}\n","import as core from \"./core.js\";\nimport * as errors from \"./errors.js\";\nimport * as util from \"./util.js\";\nexport const _parse = (_Err) => (schema, value, _ctx, _params) => {\n const ctx = _ctx ? Object.assign(_ctx, { async: false }) : { async: false };\n const result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise) {\n throw new core.$ZodAsyncError();\n }\n if (result.issues.length) {\n const e = new (_params?.Err ?? _Err)(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())));\n util.captureStackTrace(e, _params?.callee);\n throw e;\n }\n return result.value;\n};\nexport const parse = /* @__PURE__/ _parse(errors.$ZodRealError);\nexport const _parseAsync = (_Err) => async (schema, value, _ctx, params) => {\n const ctx = _ctx ? Object.assign(_ctx, { async: true }) : { async: true };\n let result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise)\n result = await result;\n if (result.issues.length) {\n const e = new (params?.Err ?? _Err)(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())));\n util.captureStackTrace(e, params?.callee);\n throw e;\n }\n return result.value;\n};\nexport const parseAsync = / @__PURE__/ _parseAsync(errors.$ZodRealError);\nexport const _safeParse = (_Err) => (schema, value, _ctx) => {\n const ctx = _ctx ? { ..._ctx, async: false } : { async: false };\n const result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise) {\n throw new core.$ZodAsyncError();\n }\n return result.issues.length\n ? {\n success: false,\n error: new (_Err ?? errors.$ZodError)(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n }\n : { success: true, data: result.value };\n};\nexport const safeParse = / @__PURE__/ _safeParse(errors.$ZodRealError);\nexport const _safeParseAsync = (_Err) => async (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { async: true }) : { async: true };\n let result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise)\n result = await result;\n return result.issues.length\n ? {\n success: false,\n error: new _Err(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n }\n : { success: true, data: result.value };\n};\nexport const safeParseAsync = / @__PURE__/ _safeParseAsync(errors.$ZodRealError);\nexport const _encode = (_Err) => (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _parse(_Err)(schema, value, ctx);\n};\nexport const encode = / @__PURE__/ _encode(errors.$ZodRealError);\nexport const _decode = (_Err) => (schema, value, _ctx) => {\n return _parse(_Err)(schema, value, _ctx);\n};\nexport const decode = / @__PURE__/ _decode(errors.$ZodRealError);\nexport const _encodeAsync = (_Err) => async (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _parseAsync(_Err)(schema, value, ctx);\n};\nexport const encodeAsync = / @__PURE__/ _encodeAsync(errors.$ZodRealError);\nexport const _decodeAsync = (_Err) => async (schema, value, _ctx) => {\n return _parseAsync(_Err)(schema, value, _ctx);\n};\nexport const decodeAsync = / @__PURE__/ _decodeAsync(errors.$ZodRealError);\nexport const _safeEncode = (_Err) => (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _safeParse(_Err)(schema, value, ctx);\n};\nexport const safeEncode = / @__PURE__/ _safeEncode(errors.$ZodRealError);\nexport const _safeDecode = (_Err) => (schema, value, _ctx) => {\n return _safeParse(_Err)(schema, value, _ctx);\n};\nexport const safeDecode = / @__PURE__/ _safeDecode(errors.$ZodRealError);\nexport const _safeEncodeAsync = (_Err) => async (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _safeParseAsync(_Err)(schema, value, ctx);\n};\nexport const safeEncodeAsync = / @__PURE__/ _safeEncodeAsync(errors.$ZodRealError);\nexport const _safeDecodeAsync = (_Err) => async (schema, value, _ctx) => {\n return _safeParseAsync(_Err)(schema, value, _ctx);\n};\nexport const safeDecodeAsync = / @__PURE__/ _safeDecodeAsync(errors.$ZodRealError);\n","import as util from \"./util.js\";\nexport const cuid = /^[cC][^\\s-]{8,}$/;\nexport const cuid2 = /^[0-9a-z]+$/;\nexport const ulid = /^[0-9A-HJKMNP-TV-Za-hjkmnp-tv-z]{26}$/;\nexport const xid = /^[0-9a-vA-V]{20}$/;\nexport const ksuid = /^[A-Za-z0-9]{27}$/;\nexport const nanoid = /^[a-zA-Z0-9_-]{21}$/;\n/** ISO 8601-1 duration regex. Does not support the 8601-2 extensions like negative durations or fractional/negative components. /\nexport const duration = /^P(?:(\\d+W)\|(?!.W)(?=\\d\|T\\d)(\\d+Y)?(\\d+M)?(\\d+D)?(T(?=\\d)(\\d+H)?(\\d+M)?(\\d+([.,]\\d+)?S)?)?)$/;\n/** Implements ISO 8601-2 extensions like explicit +- prefixes, mixing weeks with other units, and fractional/negative components. /\nexport const extendedDuration = /^[-+]?P(?!$)(?:(?:[-+]?\\d+Y)\|(?:[-+]?\\d+[.,]\\d+Y$))?(?:(?:[-+]?\\d+M)\|(?:[-+]?\\d+[.,]\\d+M$))?(?:(?:[-+]?\\d+W)\|(?:[-+]?\\d+[.,]\\d+W$))?(?:(?:[-+]?\\d+D)\|(?:[-+]?\\d+[.,]\\d+D$))?(?:T(?=[\\d+-])(?:(?:[-+]?\\d+H)\|(?:[-+]?\\d+[.,]\\d+H$))?(?:(?:[-+]?\\d+M)\|(?:[-+]?\\d+[.,]\\d+M$))?(?:[-+]?\\d+(?:[.,]\\d+)?S)?)??$/;\n/* A regex for any UUID-like identifier: 8-4-4-4-12 hex pattern /\nexport const guid = /^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12})$/;\n/* Returns a regex for validating an RFC 9562/4122 UUID.\n \n @param version Optionally specify a version 1-8. If no version is specified, all versions are supported. /\nexport const uuid = (version) => {\n if (!version)\n return /^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-8][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}\|00000000-0000-0000-0000-000000000000\|ffffffff-ffff-ffff-ffff-ffffffffffff)$/;\n return new RegExp(`^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-${version}[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12})$`);\n};\nexport const uuid4 = /@__PURE__/ uuid(4);\nexport const uuid6 = /@__PURE__/ uuid(6);\nexport const uuid7 = /@__PURE__/ uuid(7);\n/* Practical email validation /\nexport const email = /^(?!\\.)(?!.\\.\\.)([A-Za-z0-9_'+\\-\\.])[A-Za-z0-9_+-]@([A-Za-z0-9][A-Za-z0-9\\-]\\.)+[A-Za-z]{2,}$/;\n/** Equivalent to the HTML5 input[type=email] validation implemented by browsers. Source: https://developer.mozilla.org/en-US/docs/Web/HTML/Element/input/email /\nexport const html5Email = /^[a-zA-Z0-9.!#$%&'+/=?^_`{\|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)$/;\n/* The classic emailregex.com regex for RFC 5322-compliant emails /\nexport const rfc5322Email = /^(([^<>()\\[\\]\\\\.,;:\\s@\"]+(\\.[^<>()\\[\\]\\\\.,;:\\s@\"]+))\|(\".+\"))@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}])\|(([a-zA-Z\\-0-9]+\\.)+[a-zA-Z]{2,}))$/;\n/** A loose regex that allows Unicode characters, enforces length limits, and that's about it. /\nexport const unicodeEmail = /^[^\\s@\"]{1,64}@[^\\s@]{1,255}$/u;\nexport const idnEmail = unicodeEmail;\nexport const browserEmail = /^[a-zA-Z0-9.!#$%&'+/=?^_`{\|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)$/;\n// from https://thekevinscott.com/emojis-in-javascript/#writing-a-regular-expression\nconst _emoji = `^(\\\\p{Extended_Pictographic}\|\\\\p{Emoji_Component})+$`;\nexport function emoji() {\n return new RegExp(_emoji, \"u\");\n}\nexport const ipv4 = /^(?:(?:25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])\\.){3}(?:25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])$/;\nexport const ipv6 = /^(([0-9a-fA-F]{1,4}:){7}[0-9a-fA-F]{1,4}\|([0-9a-fA-F]{1,4}:){1,7}:\|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}\|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}\|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}\|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}\|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}\|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})\|:((:[0-9a-fA-F]{1,4}){1,7}\|:))$/;\nexport const mac = (delimiter) => {\n const escapedDelim = util.escapeRegex(delimiter ?? \":\");\n return new RegExp(`^(?:[0-9A-F]{2}${escapedDelim}){5}[0-9A-F]{2}$\|^(?:[0-9a-f]{2}${escapedDelim}){5}[0-9a-f]{2}$`);\n};\nexport const cidrv4 = /^((25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])\\.){3}(25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])\\/([0-9]\|[1-2][0-9]\|3[0-2])$/;\nexport const cidrv6 = /^(([0-9a-fA-F]{1,4}:){7}[0-9a-fA-F]{1,4}\|::\|([0-9a-fA-F]{1,4})?::([0-9a-fA-F]{1,4}:?){0,6})\\/(12[0-8]\|1[01][0-9]\|[1-9]?[0-9])$/;\n// https://stackoverflow.com/questions/7860392/determine-if-string-is-in-base64-using-javascript\nexport const base64 = /^$\|^(?:[0-9a-zA-Z+/]{4})(?:(?:[0-9a-zA-Z+/]{2}==)\|(?:[0-9a-zA-Z+/]{3}=))?$/;\nexport const base64url = /^[A-Za-z0-9_-]$/;\n// based on https://stackoverflow.com/questions/106179/regular-expression-to-match-dns-hostname-or-ip-address\n// export const hostname: RegExp = /^([a-zA-Z0-9-]+\\.)[a-zA-Z0-9-]+$/;\nexport const hostname = /^(?=.{1,253}\\.?$)[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[-0-9a-zA-Z]{0,61}[0-9a-zA-Z])?)\\.?$/;\nexport const domain = /^([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?\\.)+[a-zA-Z]{2,}$/;\n// https://blog.stevenlevithan.com/archives/validate-phone-number#r4-3 (regex sans spaces)\n// E.164: leading digit must be 1-9; total digits (excluding '+') between 7-15\nexport const e164 = /^\\+[1-9]\\d{6,14}$/;\n// const dateSource = `((\\\\d\\\\d[2468][048]\|\\\\d\\\\d[13579][26]\|\\\\d\\\\d0[48]\|[02468][048]00\|[13579][26]00)-02-29\|\\\\d{4}-((0[13578]\|1[02])-(0[1-9]\|[12]\\\\d\|3[01])\|(0[469]\|11)-(0[1-9]\|[12]\\\\d\|30)\|(02)-(0[1-9]\|1\\\\d\|2[0-8])))`;\nconst dateSource = `(?:(?:\\\\d\\\\d[2468][048]\|\\\\d\\\\d[13579][26]\|\\\\d\\\\d0[48]\|[02468][048]00\|[13579][26]00)-02-29\|\\\\d{4}-(?:(?:0[13578]\|1[02])-(?:0[1-9]\|[12]\\\\d\|3[01])\|(?:0[469]\|11)-(?:0[1-9]\|[12]\\\\d\|30)\|(?:02)-(?:0[1-9]\|1\\\\d\|2[0-8])))`;\nexport const date = /@__PURE__/ new RegExp(`^${dateSource}$`);\nfunction timeSource(args) {\n const hhmm = `(?:[01]\\\\d\|2[0-3]):[0-5]\\\\d`;\n const regex = typeof args.precision === \"number\"\n ? args.precision === -1\n ? `${hhmm}`\n : args.precision === 0\n ? `${hhmm}:[0-5]\\\\d`\n : `${hhmm}:[0-5]\\\\d\\\\.\\\\d{${args.precision}}`\n : `${hhmm}(?::[0-5]\\\\d(?:\\\\.\\\\d+)?)?`;\n return regex;\n}\nexport function time(args) {\n return new RegExp(`^${timeSource(args)}$`);\n}\n// Adapted from https://stackoverflow.com/a/3143231\nexport function datetime(args) {\n const time = timeSource({ precision: args.precision });\n const opts = [\"Z\"];\n if (args.local)\n opts.push(\"\");\n // if (args.offset) opts.push(`([+-]\\\\d{2}:\\\\d{2})`);\n if (args.offset)\n opts.push(`([+-](?:[01]\\\\d\|2[0-3]):[0-5]\\\\d)`);\n const timeRegex = `${time}(?:${opts.join(\"\|\")})`;\n return new RegExp(`^${dateSource}T(?:${timeRegex})$`);\n}\nexport const string = (params) => {\n const regex = params ? `[\\\\s\\\\S]{${params?.minimum ?? 0},${params?.maximum ?? \"\"}}` : `[\\\\s\\\\S]`;\n return new RegExp(`^${regex}$`);\n};\nexport const bigint = /^-?\\d+n?$/;\nexport const integer = /^-?\\d+$/;\nexport const number = /^-?\\d+(?:\\.\\d+)?$/;\nexport const boolean = /^(?:true\|false)$/i;\nconst _null = /^null$/i;\nexport { _null as null };\nconst _undefined = /^undefined$/i;\nexport { _undefined as undefined };\n// regex for string with no uppercase letters\nexport const lowercase = /^[^A-Z]$/;\n// regex for string with no lowercase letters\nexport const uppercase = /^[^a-z]$/;\n// regex for hexadecimal strings (any length)\nexport const hex = /^[0-9a-fA-F]$/;\n// Hash regexes for different algorithms and encodings\n// Helper function to create base64 regex with exact length and padding\nfunction fixedBase64(bodyLength, padding) {\n return new RegExp(`^[A-Za-z0-9+/]{${bodyLength}}${padding}$`);\n}\n// Helper function to create base64url regex with exact length (no padding)\nfunction fixedBase64url(length) {\n return new RegExp(`^[A-Za-z0-9_-]{${length}}$`);\n}\n// MD5 (16 bytes): base64 = 24 chars total (22 + \"==\")\nexport const md5_hex = /^[0-9a-fA-F]{32}$/;\nexport const md5_base64 = /@__PURE__/ fixedBase64(22, \"==\");\nexport const md5_base64url = /@__PURE__/ fixedBase64url(22);\n// SHA1 (20 bytes): base64 = 28 chars total (27 + \"=\")\nexport const sha1_hex = /^[0-9a-fA-F]{40}$/;\nexport const sha1_base64 = /@__PURE__/ fixedBase64(27, \"=\");\nexport const sha1_base64url = /@__PURE__/ fixedBase64url(27);\n// SHA256 (32 bytes): base64 = 44 chars total (43 + \"=\")\nexport const sha256_hex = /^[0-9a-fA-F]{64}$/;\nexport const sha256_base64 = /@__PURE__/ fixedBase64(43, \"=\");\nexport const sha256_base64url = /@__PURE__/ fixedBase64url(43);\n// SHA384 (48 bytes): base64 = 64 chars total (no padding)\nexport const sha384_hex = /^[0-9a-fA-F]{96}$/;\nexport const sha384_base64 = /@__PURE__/ fixedBase64(64, \"\");\nexport const sha384_base64url = /@__PURE__/ fixedBase64url(64);\n// SHA512 (64 bytes): base64 = 88 chars total (86 + \"==\")\nexport const sha512_hex = /^[0-9a-fA-F]{128}$/;\nexport const sha512_base64 = /@__PURE__/ fixedBase64(86, \"==\");\nexport const sha512_base64url = /@__PURE__/ fixedBase64url(86);\n","// import { $ZodType } from \"./schemas.js\";\nimport as core from \"./core.js\";\nimport * as regexes from \"./regexes.js\";\nimport * as util from \"./util.js\";\nexport const $ZodCheck = /@__PURE__/ core.$constructor(\"$ZodCheck\", (inst, def) => {\n var _a;\n inst._zod ?? (inst._zod = {});\n inst._zod.def = def;\n (_a = inst._zod).onattach ?? (_a.onattach = []);\n});\nconst numericOriginMap = {\n number: \"number\",\n bigint: \"bigint\",\n object: \"date\",\n};\nexport const $ZodCheckLessThan = /@__PURE__/ core.$constructor(\"$ZodCheckLessThan\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const origin = numericOriginMap[typeof def.value];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n const curr = (def.inclusive ? bag.maximum : bag.exclusiveMaximum) ?? Number.POSITIVE_INFINITY;\n if (def.value < curr) {\n if (def.inclusive)\n bag.maximum = def.value;\n else\n bag.exclusiveMaximum = def.value;\n }\n });\n inst._zod.check = (payload) => {\n if (def.inclusive ? payload.value <= def.value : payload.value < def.value) {\n return;\n }\n payload.issues.push({\n origin,\n code: \"too_big\",\n maximum: typeof def.value === \"object\" ? def.value.getTime() : def.value,\n input: payload.value,\n inclusive: def.inclusive,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckGreaterThan = /@__PURE__/ core.$constructor(\"$ZodCheckGreaterThan\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const origin = numericOriginMap[typeof def.value];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n const curr = (def.inclusive ? bag.minimum : bag.exclusiveMinimum) ?? Number.NEGATIVE_INFINITY;\n if (def.value > curr) {\n if (def.inclusive)\n bag.minimum = def.value;\n else\n bag.exclusiveMinimum = def.value;\n }\n });\n inst._zod.check = (payload) => {\n if (def.inclusive ? payload.value >= def.value : payload.value > def.value) {\n return;\n }\n payload.issues.push({\n origin,\n code: \"too_small\",\n minimum: typeof def.value === \"object\" ? def.value.getTime() : def.value,\n input: payload.value,\n inclusive: def.inclusive,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMultipleOf = \n/@__PURE__/ core.$constructor(\"$ZodCheckMultipleOf\", (inst, def) => {\n $ZodCheck.init(inst, def);\n inst._zod.onattach.push((inst) => {\n var _a;\n (_a = inst._zod.bag).multipleOf ?? (_a.multipleOf = def.value);\n });\n inst._zod.check = (payload) => {\n if (typeof payload.value !== typeof def.value)\n throw new Error(\"Cannot mix number and bigint in multiple_of check.\");\n const isMultiple = typeof payload.value === \"bigint\"\n ? payload.value % def.value === BigInt(0)\n : util.floatSafeRemainder(payload.value, def.value) === 0;\n if (isMultiple)\n return;\n payload.issues.push({\n origin: typeof payload.value,\n code: \"not_multiple_of\",\n divisor: def.value,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckNumberFormat = /@__PURE__/ core.$constructor(\"$ZodCheckNumberFormat\", (inst, def) => {\n $ZodCheck.init(inst, def); // no format checks\n def.format = def.format \|\| \"float64\";\n const isInt = def.format?.includes(\"int\");\n const origin = isInt ? \"int\" : \"number\";\n const [minimum, maximum] = util.NUMBER_FORMAT_RANGES[def.format];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.format = def.format;\n bag.minimum = minimum;\n bag.maximum = maximum;\n if (isInt)\n bag.pattern = regexes.integer;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n if (isInt) {\n if (!Number.isInteger(input)) {\n // invalid_format issue\n // payload.issues.push({\n // expected: def.format,\n // format: def.format,\n // code: \"invalid_format\",\n // input,\n // inst,\n // });\n // invalid_type issue\n payload.issues.push({\n expected: origin,\n format: def.format,\n code: \"invalid_type\",\n continue: false,\n input,\n inst,\n });\n return;\n // not_multiple_of issue\n // payload.issues.push({\n // code: \"not_multiple_of\",\n // origin: \"number\",\n // input,\n // inst,\n // divisor: 1,\n // });\n }\n if (!Number.isSafeInteger(input)) {\n if (input > 0) {\n // too_big\n payload.issues.push({\n input,\n code: \"too_big\",\n maximum: Number.MAX_SAFE_INTEGER,\n note: \"Integers must be within the safe integer range.\",\n inst,\n origin,\n inclusive: true,\n continue: !def.abort,\n });\n }\n else {\n // too_small\n payload.issues.push({\n input,\n code: \"too_small\",\n minimum: Number.MIN_SAFE_INTEGER,\n note: \"Integers must be within the safe integer range.\",\n inst,\n origin,\n inclusive: true,\n continue: !def.abort,\n });\n }\n return;\n }\n }\n if (input < minimum) {\n payload.issues.push({\n origin: \"number\",\n input,\n code: \"too_small\",\n minimum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n if (input > maximum) {\n payload.issues.push({\n origin: \"number\",\n input,\n code: \"too_big\",\n maximum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodCheckBigIntFormat = /@__PURE__/ core.$constructor(\"$ZodCheckBigIntFormat\", (inst, def) => {\n $ZodCheck.init(inst, def); // no format checks\n const [minimum, maximum] = util.BIGINT_FORMAT_RANGES[def.format];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.format = def.format;\n bag.minimum = minimum;\n bag.maximum = maximum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n if (input < minimum) {\n payload.issues.push({\n origin: \"bigint\",\n input,\n code: \"too_small\",\n minimum: minimum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n if (input > maximum) {\n payload.issues.push({\n origin: \"bigint\",\n input,\n code: \"too_big\",\n maximum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodCheckMaxSize = /@__PURE__/ core.$constructor(\"$ZodCheckMaxSize\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.size !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.maximum ?? Number.POSITIVE_INFINITY);\n if (def.maximum < curr)\n inst._zod.bag.maximum = def.maximum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const size = input.size;\n if (size <= def.maximum)\n return;\n payload.issues.push({\n origin: util.getSizableOrigin(input),\n code: \"too_big\",\n maximum: def.maximum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMinSize = /@__PURE__/ core.$constructor(\"$ZodCheckMinSize\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.size !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.minimum ?? Number.NEGATIVE_INFINITY);\n if (def.minimum > curr)\n inst._zod.bag.minimum = def.minimum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const size = input.size;\n if (size >= def.minimum)\n return;\n payload.issues.push({\n origin: util.getSizableOrigin(input),\n code: \"too_small\",\n minimum: def.minimum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckSizeEquals = /@__PURE__/ core.$constructor(\"$ZodCheckSizeEquals\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.size !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.minimum = def.size;\n bag.maximum = def.size;\n bag.size = def.size;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const size = input.size;\n if (size === def.size)\n return;\n const tooBig = size > def.size;\n payload.issues.push({\n origin: util.getSizableOrigin(input),\n ...(tooBig ? { code: \"too_big\", maximum: def.size } : { code: \"too_small\", minimum: def.size }),\n inclusive: true,\n exact: true,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMaxLength = /@__PURE__/ core.$constructor(\"$ZodCheckMaxLength\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.length !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.maximum ?? Number.POSITIVE_INFINITY);\n if (def.maximum < curr)\n inst._zod.bag.maximum = def.maximum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const length = input.length;\n if (length <= def.maximum)\n return;\n const origin = util.getLengthableOrigin(input);\n payload.issues.push({\n origin,\n code: \"too_big\",\n maximum: def.maximum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMinLength = /@__PURE__/ core.$constructor(\"$ZodCheckMinLength\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.length !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.minimum ?? Number.NEGATIVE_INFINITY);\n if (def.minimum > curr)\n inst._zod.bag.minimum = def.minimum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const length = input.length;\n if (length >= def.minimum)\n return;\n const origin = util.getLengthableOrigin(input);\n payload.issues.push({\n origin,\n code: \"too_small\",\n minimum: def.minimum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckLengthEquals = /@__PURE__/ core.$constructor(\"$ZodCheckLengthEquals\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.length !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.minimum = def.length;\n bag.maximum = def.length;\n bag.length = def.length;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const length = input.length;\n if (length === def.length)\n return;\n const origin = util.getLengthableOrigin(input);\n const tooBig = length > def.length;\n payload.issues.push({\n origin,\n ...(tooBig ? { code: \"too_big\", maximum: def.length } : { code: \"too_small\", minimum: def.length }),\n inclusive: true,\n exact: true,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckStringFormat = /@__PURE__/ core.$constructor(\"$ZodCheckStringFormat\", (inst, def) => {\n var _a, _b;\n $ZodCheck.init(inst, def);\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.format = def.format;\n if (def.pattern) {\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(def.pattern);\n }\n });\n if (def.pattern)\n (_a = inst._zod).check ?? (_a.check = (payload) => {\n def.pattern.lastIndex = 0;\n if (def.pattern.test(payload.value))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: def.format,\n input: payload.value,\n ...(def.pattern ? { pattern: def.pattern.toString() } : {}),\n inst,\n continue: !def.abort,\n });\n });\n else\n (_b = inst._zod).check ?? (_b.check = () => { });\n});\nexport const $ZodCheckRegex = /@__PURE__/ core.$constructor(\"$ZodCheckRegex\", (inst, def) => {\n $ZodCheckStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n def.pattern.lastIndex = 0;\n if (def.pattern.test(payload.value))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"regex\",\n input: payload.value,\n pattern: def.pattern.toString(),\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckLowerCase = /@__PURE__/ core.$constructor(\"$ZodCheckLowerCase\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.lowercase);\n $ZodCheckStringFormat.init(inst, def);\n});\nexport const $ZodCheckUpperCase = /@__PURE__/ core.$constructor(\"$ZodCheckUpperCase\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.uppercase);\n $ZodCheckStringFormat.init(inst, def);\n});\nexport const $ZodCheckIncludes = /@__PURE__/ core.$constructor(\"$ZodCheckIncludes\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const escapedRegex = util.escapeRegex(def.includes);\n const pattern = new RegExp(typeof def.position === \"number\" ? `^.{${def.position}}${escapedRegex}` : escapedRegex);\n def.pattern = pattern;\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(pattern);\n });\n inst._zod.check = (payload) => {\n if (payload.value.includes(def.includes, def.position))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"includes\",\n includes: def.includes,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckStartsWith = /@__PURE__/ core.$constructor(\"$ZodCheckStartsWith\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const pattern = new RegExp(`^${util.escapeRegex(def.prefix)}.`);\n def.pattern ?? (def.pattern = pattern);\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(pattern);\n });\n inst._zod.check = (payload) => {\n if (payload.value.startsWith(def.prefix))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"starts_with\",\n prefix: def.prefix,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckEndsWith = /@__PURE__/ core.$constructor(\"$ZodCheckEndsWith\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const pattern = new RegExp(`.${util.escapeRegex(def.suffix)}$`);\n def.pattern ?? (def.pattern = pattern);\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(pattern);\n });\n inst._zod.check = (payload) => {\n if (payload.value.endsWith(def.suffix))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"ends_with\",\n suffix: def.suffix,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\n///////////////////////////////////\n///// $ZodCheckProperty /////\n///////////////////////////////////\nfunction handleCheckPropertyResult(result, payload, property) {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(property, result.issues));\n }\n}\nexport const $ZodCheckProperty = /@__PURE__/ core.$constructor(\"$ZodCheckProperty\", (inst, def) => {\n $ZodCheck.init(inst, def);\n inst._zod.check = (payload) => {\n const result = def.schema._zod.run({\n value: payload.value[def.property],\n issues: [],\n }, {});\n if (result instanceof Promise) {\n return result.then((result) => handleCheckPropertyResult(result, payload, def.property));\n }\n handleCheckPropertyResult(result, payload, def.property);\n return;\n };\n});\nexport const $ZodCheckMimeType = /@__PURE__/ core.$constructor(\"$ZodCheckMimeType\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const mimeSet = new Set(def.mime);\n inst._zod.onattach.push((inst) => {\n inst._zod.bag.mime = def.mime;\n });\n inst._zod.check = (payload) => {\n if (mimeSet.has(payload.value.type))\n return;\n payload.issues.push({\n code: \"invalid_value\",\n values: def.mime,\n input: payload.value.type,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckOverwrite = /@__PURE__/ core.$constructor(\"$ZodCheckOverwrite\", (inst, def) => {\n $ZodCheck.init(inst, def);\n inst._zod.check = (payload) => {\n payload.value = def.tx(payload.value);\n };\n});\n","export class Doc {\n constructor(args = []) {\n this.content = [];\n this.indent = 0;\n if (this)\n this.args = args;\n }\n indented(fn) {\n this.indent += 1;\n fn(this);\n this.indent -= 1;\n }\n write(arg) {\n if (typeof arg === \"function\") {\n arg(this, { execution: \"sync\" });\n arg(this, { execution: \"async\" });\n return;\n }\n const content = arg;\n const lines = content.split(\"\\n\").filter((x) => x);\n const minIndent = Math.min(...lines.map((x) => x.length - x.trimStart().length));\n const dedented = lines.map((x) => x.slice(minIndent)).map((x) => \" \".repeat(this.indent * 2) + x);\n for (const line of dedented) {\n this.content.push(line);\n }\n }\n compile() {\n const F = Function;\n const args = this?.args;\n const content = this?.content ?? [``];\n const lines = [...content.map((x) => ` ${x}`)];\n // console.log(lines.join(\"\\n\"));\n return new F(...args, lines.join(\"\\n\"));\n }\n}\n","export const version = {\n major: 4,\n minor: 3,\n patch: 6,\n};\n","import * as checks from \"./checks.js\";\nimport * as core from \"./core.js\";\nimport { Doc } from \"./doc.js\";\nimport { parse, parseAsync, safeParse, safeParseAsync } from \"./parse.js\";\nimport * as regexes from \"./regexes.js\";\nimport * as util from \"./util.js\";\nimport { version } from \"./versions.js\";\nexport const $ZodType = /@__PURE__/ core.$constructor(\"$ZodType\", (inst, def) => {\n var _a;\n inst ?? (inst = {});\n inst._zod.def = def; // set _def property\n inst._zod.bag = inst._zod.bag \|\| {}; // initialize _bag object\n inst._zod.version = version;\n const checks = [...(inst._zod.def.checks ?? [])];\n // if inst is itself a checks.$ZodCheck, run it as a check\n if (inst._zod.traits.has(\"$ZodCheck\")) {\n checks.unshift(inst);\n }\n for (const ch of checks) {\n for (const fn of ch._zod.onattach) {\n fn(inst);\n }\n }\n if (checks.length === 0) {\n // deferred initializer\n // inst._zod.parse is not yet defined\n (_a = inst._zod).deferred ?? (_a.deferred = []);\n inst._zod.deferred?.push(() => {\n inst._zod.run = inst._zod.parse;\n });\n }\n else {\n const runChecks = (payload, checks, ctx) => {\n let isAborted = util.aborted(payload);\n let asyncResult;\n for (const ch of checks) {\n if (ch._zod.def.when) {\n const shouldRun = ch._zod.def.when(payload);\n if (!shouldRun)\n continue;\n }\n else if (isAborted) {\n continue;\n }\n const currLen = payload.issues.length;\n const _ = ch._zod.check(payload);\n if (_ instanceof Promise && ctx?.async === false) {\n throw new core.$ZodAsyncError();\n }\n if (asyncResult \|\| _ instanceof Promise) {\n asyncResult = (asyncResult ?? Promise.resolve()).then(async () => {\n await _;\n const nextLen = payload.issues.length;\n if (nextLen === currLen)\n return;\n if (!isAborted)\n isAborted = util.aborted(payload, currLen);\n });\n }\n else {\n const nextLen = payload.issues.length;\n if (nextLen === currLen)\n continue;\n if (!isAborted)\n isAborted = util.aborted(payload, currLen);\n }\n }\n if (asyncResult) {\n return asyncResult.then(() => {\n return payload;\n });\n }\n return payload;\n };\n const handleCanaryResult = (canary, payload, ctx) => {\n // abort if the canary is aborted\n if (util.aborted(canary)) {\n canary.aborted = true;\n return canary;\n }\n // run checks first, then\n const checkResult = runChecks(payload, checks, ctx);\n if (checkResult instanceof Promise) {\n if (ctx.async === false)\n throw new core.$ZodAsyncError();\n return checkResult.then((checkResult) => inst._zod.parse(checkResult, ctx));\n }\n return inst._zod.parse(checkResult, ctx);\n };\n inst._zod.run = (payload, ctx) => {\n if (ctx.skipChecks) {\n return inst._zod.parse(payload, ctx);\n }\n if (ctx.direction === \"backward\") {\n // run canary\n // initial pass (no checks)\n const canary = inst._zod.parse({ value: payload.value, issues: [] }, { ...ctx, skipChecks: true });\n if (canary instanceof Promise) {\n return canary.then((canary) => {\n return handleCanaryResult(canary, payload, ctx);\n });\n }\n return handleCanaryResult(canary, payload, ctx);\n }\n // forward\n const result = inst._zod.parse(payload, ctx);\n if (result instanceof Promise) {\n if (ctx.async === false)\n throw new core.$ZodAsyncError();\n return result.then((result) => runChecks(result, checks, ctx));\n }\n return runChecks(result, checks, ctx);\n };\n }\n // Lazy initialize ~standard to avoid creating objects for every schema\n util.defineLazy(inst, \"~standard\", () => ({\n validate: (value) => {\n try {\n const r = safeParse(inst, value);\n return r.success ? { value: r.data } : { issues: r.error?.issues };\n }\n catch (_) {\n return safeParseAsync(inst, value).then((r) => (r.success ? { value: r.data } : { issues: r.error?.issues }));\n }\n },\n vendor: \"zod\",\n version: 1,\n }));\n});\nexport { clone } from \"./util.js\";\nexport const $ZodString = /@__PURE__/ core.$constructor(\"$ZodString\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = [...(inst?._zod.bag?.patterns ?? [])].pop() ?? regexes.string(inst._zod.bag);\n inst._zod.parse = (payload, _) => {\n if (def.coerce)\n try {\n payload.value = String(payload.value);\n }\n catch (_) { }\n if (typeof payload.value === \"string\")\n return payload;\n payload.issues.push({\n expected: \"string\",\n code: \"invalid_type\",\n input: payload.value,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodStringFormat = /@__PURE__/ core.$constructor(\"$ZodStringFormat\", (inst, def) => {\n // check initialization must come first\n checks.$ZodCheckStringFormat.init(inst, def);\n $ZodString.init(inst, def);\n});\nexport const $ZodGUID = /@__PURE__/ core.$constructor(\"$ZodGUID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.guid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodUUID = /@__PURE__/ core.$constructor(\"$ZodUUID\", (inst, def) => {\n if (def.version) {\n const versionMap = {\n v1: 1,\n v2: 2,\n v3: 3,\n v4: 4,\n v5: 5,\n v6: 6,\n v7: 7,\n v8: 8,\n };\n const v = versionMap[def.version];\n if (v === undefined)\n throw new Error(`Invalid UUID version: \"${def.version}\"`);\n def.pattern ?? (def.pattern = regexes.uuid(v));\n }\n else\n def.pattern ?? (def.pattern = regexes.uuid());\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodEmail = /@__PURE__/ core.$constructor(\"$ZodEmail\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.email);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodURL = /@__PURE__/ core.$constructor(\"$ZodURL\", (inst, def) => {\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n try {\n // Trim whitespace from input\n const trimmed = payload.value.trim();\n // @ts-ignore\n const url = new URL(trimmed);\n if (def.hostname) {\n def.hostname.lastIndex = 0;\n if (!def.hostname.test(url.hostname)) {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"url\",\n note: \"Invalid hostname\",\n pattern: def.hostname.source,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n }\n if (def.protocol) {\n def.protocol.lastIndex = 0;\n if (!def.protocol.test(url.protocol.endsWith(\":\") ? url.protocol.slice(0, -1) : url.protocol)) {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"url\",\n note: \"Invalid protocol\",\n pattern: def.protocol.source,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n }\n // Set the output value based on normalize flag\n if (def.normalize) {\n // Use normalized URL\n payload.value = url.href;\n }\n else {\n // Preserve the original input (trimmed)\n payload.value = trimmed;\n }\n return;\n }\n catch (_) {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"url\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodEmoji = /@__PURE__/ core.$constructor(\"$ZodEmoji\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.emoji());\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodNanoID = /@__PURE__/ core.$constructor(\"$ZodNanoID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.nanoid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodCUID = /@__PURE__/ core.$constructor(\"$ZodCUID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cuid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodCUID2 = /@__PURE__/ core.$constructor(\"$ZodCUID2\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cuid2);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodULID = /@__PURE__/ core.$constructor(\"$ZodULID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ulid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodXID = /@__PURE__/ core.$constructor(\"$ZodXID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.xid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodKSUID = /@__PURE__/ core.$constructor(\"$ZodKSUID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ksuid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISODateTime = /@__PURE__/ core.$constructor(\"$ZodISODateTime\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.datetime(def));\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISODate = /@__PURE__/ core.$constructor(\"$ZodISODate\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.date);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISOTime = /@__PURE__/ core.$constructor(\"$ZodISOTime\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.time(def));\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISODuration = /@__PURE__/ core.$constructor(\"$ZodISODuration\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.duration);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodIPv4 = /@__PURE__/ core.$constructor(\"$ZodIPv4\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ipv4);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.format = `ipv4`;\n});\nexport const $ZodIPv6 = /@__PURE__/ core.$constructor(\"$ZodIPv6\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ipv6);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.format = `ipv6`;\n inst._zod.check = (payload) => {\n try {\n // @ts-ignore\n new URL(`http://[${payload.value}]`);\n // return;\n }\n catch {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"ipv6\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodMAC = /@__PURE__/ core.$constructor(\"$ZodMAC\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.mac(def.delimiter));\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.format = `mac`;\n});\nexport const $ZodCIDRv4 = /@__PURE__/ core.$constructor(\"$ZodCIDRv4\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cidrv4);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodCIDRv6 = /@__PURE__/ core.$constructor(\"$ZodCIDRv6\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cidrv6); // not used for validation\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n const parts = payload.value.split(\"/\");\n try {\n if (parts.length !== 2)\n throw new Error();\n const [address, prefix] = parts;\n if (!prefix)\n throw new Error();\n const prefixNum = Number(prefix);\n if (`${prefixNum}` !== prefix)\n throw new Error();\n if (prefixNum < 0 \|\| prefixNum > 128)\n throw new Error();\n // @ts-ignore\n new URL(`http://[${address}]`);\n }\n catch {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"cidrv6\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\n////////////////////////////// ZodBase64 //////////////////////////////\nexport function isValidBase64(data) {\n if (data === \"\")\n return true;\n if (data.length % 4 !== 0)\n return false;\n try {\n // @ts-ignore\n atob(data);\n return true;\n }\n catch {\n return false;\n }\n}\nexport const $ZodBase64 = /@__PURE__/ core.$constructor(\"$ZodBase64\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.base64);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.contentEncoding = \"base64\";\n inst._zod.check = (payload) => {\n if (isValidBase64(payload.value))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: \"base64\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\n////////////////////////////// ZodBase64 //////////////////////////////\nexport function isValidBase64URL(data) {\n if (!regexes.base64url.test(data))\n return false;\n const base64 = data.replace(/[-_]/g, (c) => (c === \"-\" ? \"+\" : \"/\"));\n const padded = base64.padEnd(Math.ceil(base64.length / 4) * 4, \"=\");\n return isValidBase64(padded);\n}\nexport const $ZodBase64URL = /@__PURE__/ core.$constructor(\"$ZodBase64URL\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.base64url);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.contentEncoding = \"base64url\";\n inst._zod.check = (payload) => {\n if (isValidBase64URL(payload.value))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: \"base64url\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodE164 = /@__PURE__/ core.$constructor(\"$ZodE164\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.e164);\n $ZodStringFormat.init(inst, def);\n});\n////////////////////////////// ZodJWT //////////////////////////////\nexport function isValidJWT(token, algorithm = null) {\n try {\n const tokensParts = token.split(\".\");\n if (tokensParts.length !== 3)\n return false;\n const [header] = tokensParts;\n if (!header)\n return false;\n // @ts-ignore\n const parsedHeader = JSON.parse(atob(header));\n if (\"typ\" in parsedHeader && parsedHeader?.typ !== \"JWT\")\n return false;\n if (!parsedHeader.alg)\n return false;\n if (algorithm && (!(\"alg\" in parsedHeader) \|\| parsedHeader.alg !== algorithm))\n return false;\n return true;\n }\n catch {\n return false;\n }\n}\nexport const $ZodJWT = /@__PURE__/ core.$constructor(\"$ZodJWT\", (inst, def) => {\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n if (isValidJWT(payload.value, def.alg))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: \"jwt\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCustomStringFormat = /@__PURE__/ core.$constructor(\"$ZodCustomStringFormat\", (inst, def) => {\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n if (def.fn(payload.value))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: def.format,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodNumber = /@__PURE__/ core.$constructor(\"$ZodNumber\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = inst._zod.bag.pattern ?? regexes.number;\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce)\n try {\n payload.value = Number(payload.value);\n }\n catch (_) { }\n const input = payload.value;\n if (typeof input === \"number\" && !Number.isNaN(input) && Number.isFinite(input)) {\n return payload;\n }\n const received = typeof input === \"number\"\n ? Number.isNaN(input)\n ? \"NaN\"\n : !Number.isFinite(input)\n ? \"Infinity\"\n : undefined\n : undefined;\n payload.issues.push({\n expected: \"number\",\n code: \"invalid_type\",\n input,\n inst,\n ...(received ? { received } : {}),\n });\n return payload;\n };\n});\nexport const $ZodNumberFormat = /@__PURE__/ core.$constructor(\"$ZodNumberFormat\", (inst, def) => {\n checks.$ZodCheckNumberFormat.init(inst, def);\n $ZodNumber.init(inst, def); // no format checks\n});\nexport const $ZodBoolean = /@__PURE__/ core.$constructor(\"$ZodBoolean\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.boolean;\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce)\n try {\n payload.value = Boolean(payload.value);\n }\n catch (_) { }\n const input = payload.value;\n if (typeof input === \"boolean\")\n return payload;\n payload.issues.push({\n expected: \"boolean\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodBigInt = /@__PURE__/ core.$constructor(\"$ZodBigInt\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.bigint;\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce)\n try {\n payload.value = BigInt(payload.value);\n }\n catch (_) { }\n if (typeof payload.value === \"bigint\")\n return payload;\n payload.issues.push({\n expected: \"bigint\",\n code: \"invalid_type\",\n input: payload.value,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodBigIntFormat = /@__PURE__/ core.$constructor(\"$ZodBigIntFormat\", (inst, def) => {\n checks.$ZodCheckBigIntFormat.init(inst, def);\n $ZodBigInt.init(inst, def); // no format checks\n});\nexport const $ZodSymbol = /@__PURE__/ core.$constructor(\"$ZodSymbol\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (typeof input === \"symbol\")\n return payload;\n payload.issues.push({\n expected: \"symbol\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodUndefined = /@__PURE__/ core.$constructor(\"$ZodUndefined\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.undefined;\n inst._zod.values = new Set([undefined]);\n inst._zod.optin = \"optional\";\n inst._zod.optout = \"optional\";\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (typeof input === \"undefined\")\n return payload;\n payload.issues.push({\n expected: \"undefined\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodNull = /@__PURE__/ core.$constructor(\"$ZodNull\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.null;\n inst._zod.values = new Set([null]);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (input === null)\n return payload;\n payload.issues.push({\n expected: \"null\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodAny = /@__PURE__/ core.$constructor(\"$ZodAny\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload) => payload;\n});\nexport const $ZodUnknown = /@__PURE__/ core.$constructor(\"$ZodUnknown\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload) => payload;\n});\nexport const $ZodNever = /@__PURE__/ core.$constructor(\"$ZodNever\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n payload.issues.push({\n expected: \"never\",\n code: \"invalid_type\",\n input: payload.value,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodVoid = /@__PURE__/ core.$constructor(\"$ZodVoid\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (typeof input === \"undefined\")\n return payload;\n payload.issues.push({\n expected: \"void\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodDate = /@__PURE__/ core.$constructor(\"$ZodDate\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce) {\n try {\n payload.value = new Date(payload.value);\n }\n catch (_err) { }\n }\n const input = payload.value;\n const isDate = input instanceof Date;\n const isValidDate = isDate && !Number.isNaN(input.getTime());\n if (isValidDate)\n return payload;\n payload.issues.push({\n expected: \"date\",\n code: \"invalid_type\",\n input,\n ...(isDate ? { received: \"Invalid Date\" } : {}),\n inst,\n });\n return payload;\n };\n});\nfunction handleArrayResult(result, final, index) {\n if (result.issues.length) {\n final.issues.push(...util.prefixIssues(index, result.issues));\n }\n final.value[index] = result.value;\n}\nexport const $ZodArray = /@__PURE__/ core.$constructor(\"$ZodArray\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!Array.isArray(input)) {\n payload.issues.push({\n expected: \"array\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n payload.value = Array(input.length);\n const proms = [];\n for (let i = 0; i < input.length; i++) {\n const item = input[i];\n const result = def.element._zod.run({\n value: item,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleArrayResult(result, payload, i)));\n }\n else {\n handleArrayResult(result, payload, i);\n }\n }\n if (proms.length) {\n return Promise.all(proms).then(() => payload);\n }\n return payload; //handleArrayResultsAsync(parseResults, final);\n };\n});\nfunction handlePropertyResult(result, final, key, input, isOptionalOut) {\n if (result.issues.length) {\n // For optional-out schemas, ignore errors on absent keys\n if (isOptionalOut && !(key in input)) {\n return;\n }\n final.issues.push(...util.prefixIssues(key, result.issues));\n }\n if (result.value === undefined) {\n if (key in input) {\n final.value[key] = undefined;\n }\n }\n else {\n final.value[key] = result.value;\n }\n}\nfunction normalizeDef(def) {\n const keys = Object.keys(def.shape);\n for (const k of keys) {\n if (!def.shape?.[k]?._zod?.traits?.has(\"$ZodType\")) {\n throw new Error(`Invalid element at key \"${k}\": expected a Zod schema`);\n }\n }\n const okeys = util.optionalKeys(def.shape);\n return {\n ...def,\n keys,\n keySet: new Set(keys),\n numKeys: keys.length,\n optionalKeys: new Set(okeys),\n };\n}\nfunction handleCatchall(proms, input, payload, ctx, def, inst) {\n const unrecognized = [];\n // iterate over input keys\n const keySet = def.keySet;\n const _catchall = def.catchall._zod;\n const t = _catchall.def.type;\n const isOptionalOut = _catchall.optout === \"optional\";\n for (const key in input) {\n if (keySet.has(key))\n continue;\n if (t === \"never\") {\n unrecognized.push(key);\n continue;\n }\n const r = _catchall.run({ value: input[key], issues: [] }, ctx);\n if (r instanceof Promise) {\n proms.push(r.then((r) => handlePropertyResult(r, payload, key, input, isOptionalOut)));\n }\n else {\n handlePropertyResult(r, payload, key, input, isOptionalOut);\n }\n }\n if (unrecognized.length) {\n payload.issues.push({\n code: \"unrecognized_keys\",\n keys: unrecognized,\n input,\n inst,\n });\n }\n if (!proms.length)\n return payload;\n return Promise.all(proms).then(() => {\n return payload;\n });\n}\nexport const $ZodObject = /@__PURE__/ core.$constructor(\"$ZodObject\", (inst, def) => {\n // requires cast because technically $ZodObject doesn't extend\n $ZodType.init(inst, def);\n // const sh = def.shape;\n const desc = Object.getOwnPropertyDescriptor(def, \"shape\");\n if (!desc?.get) {\n const sh = def.shape;\n Object.defineProperty(def, \"shape\", {\n get: () => {\n const newSh = { ...sh };\n Object.defineProperty(def, \"shape\", {\n value: newSh,\n });\n return newSh;\n },\n });\n }\n const _normalized = util.cached(() => normalizeDef(def));\n util.defineLazy(inst._zod, \"propValues\", () => {\n const shape = def.shape;\n const propValues = {};\n for (const key in shape) {\n const field = shape[key]._zod;\n if (field.values) {\n propValues[key] ?? (propValues[key] = new Set());\n for (const v of field.values)\n propValues[key].add(v);\n }\n }\n return propValues;\n });\n const isObject = util.isObject;\n const catchall = def.catchall;\n let value;\n inst._zod.parse = (payload, ctx) => {\n value ?? (value = _normalized.value);\n const input = payload.value;\n if (!isObject(input)) {\n payload.issues.push({\n expected: \"object\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n payload.value = {};\n const proms = [];\n const shape = value.shape;\n for (const key of value.keys) {\n const el = shape[key];\n const isOptionalOut = el._zod.optout === \"optional\";\n const r = el._zod.run({ value: input[key], issues: [] }, ctx);\n if (r instanceof Promise) {\n proms.push(r.then((r) => handlePropertyResult(r, payload, key, input, isOptionalOut)));\n }\n else {\n handlePropertyResult(r, payload, key, input, isOptionalOut);\n }\n }\n if (!catchall) {\n return proms.length ? Promise.all(proms).then(() => payload) : payload;\n }\n return handleCatchall(proms, input, payload, ctx, _normalized.value, inst);\n };\n});\nexport const $ZodObjectJIT = /@__PURE__/ core.$constructor(\"$ZodObjectJIT\", (inst, def) => {\n // requires cast because technically $ZodObject doesn't extend\n $ZodObject.init(inst, def);\n const superParse = inst._zod.parse;\n const _normalized = util.cached(() => normalizeDef(def));\n const generateFastpass = (shape) => {\n const doc = new Doc([\"shape\", \"payload\", \"ctx\"]);\n const normalized = _normalized.value;\n const parseStr = (key) => {\n const k = util.esc(key);\n return `shape[${k}]._zod.run({ value: input[${k}], issues: [] }, ctx)`;\n };\n doc.write(`const input = payload.value;`);\n const ids = Object.create(null);\n let counter = 0;\n for (const key of normalized.keys) {\n ids[key] = `key_${counter++}`;\n }\n // A: preserve key order {\n doc.write(`const newResult = {};`);\n for (const key of normalized.keys) {\n const id = ids[key];\n const k = util.esc(key);\n const schema = shape[key];\n const isOptionalOut = schema?._zod?.optout === \"optional\";\n doc.write(`const ${id} = ${parseStr(key)};`);\n if (isOptionalOut) {\n // For optional-out schemas, ignore errors on absent keys\n doc.write(`\n if (${id}.issues.length) {\n if (${k} in input) {\n payload.issues = payload.issues.concat(${id}.issues.map(iss => ({\n ...iss,\n path: iss.path ? [${k}, ...iss.path] : [${k}]\n })));\n }\n }\n \n if (${id}.value === undefined) {\n if (${k} in input) {\n newResult[${k}] = undefined;\n }\n } else {\n newResult[${k}] = ${id}.value;\n }\n \n `);\n }\n else {\n doc.write(`\n if (${id}.issues.length) {\n payload.issues = payload.issues.concat(${id}.issues.map(iss => ({\n ...iss,\n path: iss.path ? [${k}, ...iss.path] : [${k}]\n })));\n }\n \n if (${id}.value === undefined) {\n if (${k} in input) {\n newResult[${k}] = undefined;\n }\n } else {\n newResult[${k}] = ${id}.value;\n }\n \n `);\n }\n }\n doc.write(`payload.value = newResult;`);\n doc.write(`return payload;`);\n const fn = doc.compile();\n return (payload, ctx) => fn(shape, payload, ctx);\n };\n let fastpass;\n const isObject = util.isObject;\n const jit = !core.globalConfig.jitless;\n const allowsEval = util.allowsEval;\n const fastEnabled = jit && allowsEval.value; // && !def.catchall;\n const catchall = def.catchall;\n let value;\n inst._zod.parse = (payload, ctx) => {\n value ?? (value = _normalized.value);\n const input = payload.value;\n if (!isObject(input)) {\n payload.issues.push({\n expected: \"object\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n if (jit && fastEnabled && ctx?.async === false && ctx.jitless !== true) {\n // always synchronous\n if (!fastpass)\n fastpass = generateFastpass(def.shape);\n payload = fastpass(payload, ctx);\n if (!catchall)\n return payload;\n return handleCatchall([], input, payload, ctx, value, inst);\n }\n return superParse(payload, ctx);\n };\n});\nfunction handleUnionResults(results, final, inst, ctx) {\n for (const result of results) {\n if (result.issues.length === 0) {\n final.value = result.value;\n return final;\n }\n }\n const nonaborted = results.filter((r) => !util.aborted(r));\n if (nonaborted.length === 1) {\n final.value = nonaborted[0].value;\n return nonaborted[0];\n }\n final.issues.push({\n code: \"invalid_union\",\n input: final.value,\n inst,\n errors: results.map((result) => result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n });\n return final;\n}\nexport const $ZodUnion = /@__PURE__/ core.$constructor(\"$ZodUnion\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"optin\", () => def.options.some((o) => o._zod.optin === \"optional\") ? \"optional\" : undefined);\n util.defineLazy(inst._zod, \"optout\", () => def.options.some((o) => o._zod.optout === \"optional\") ? \"optional\" : undefined);\n util.defineLazy(inst._zod, \"values\", () => {\n if (def.options.every((o) => o._zod.values)) {\n return new Set(def.options.flatMap((option) => Array.from(option._zod.values)));\n }\n return undefined;\n });\n util.defineLazy(inst._zod, \"pattern\", () => {\n if (def.options.every((o) => o._zod.pattern)) {\n const patterns = def.options.map((o) => o._zod.pattern);\n return new RegExp(`^(${patterns.map((p) => util.cleanRegex(p.source)).join(\"\|\")})$`);\n }\n return undefined;\n });\n const single = def.options.length === 1;\n const first = def.options[0]._zod.run;\n inst._zod.parse = (payload, ctx) => {\n if (single) {\n return first(payload, ctx);\n }\n let async = false;\n const results = [];\n for (const option of def.options) {\n const result = option._zod.run({\n value: payload.value,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n results.push(result);\n async = true;\n }\n else {\n if (result.issues.length === 0)\n return result;\n results.push(result);\n }\n }\n if (!async)\n return handleUnionResults(results, payload, inst, ctx);\n return Promise.all(results).then((results) => {\n return handleUnionResults(results, payload, inst, ctx);\n });\n };\n});\nfunction handleExclusiveUnionResults(results, final, inst, ctx) {\n const successes = results.filter((r) => r.issues.length === 0);\n if (successes.length === 1) {\n final.value = successes[0].value;\n return final;\n }\n if (successes.length === 0) {\n // No matches - same as regular union\n final.issues.push({\n code: \"invalid_union\",\n input: final.value,\n inst,\n errors: results.map((result) => result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n });\n }\n else {\n // Multiple matches - exclusive union failure\n final.issues.push({\n code: \"invalid_union\",\n input: final.value,\n inst,\n errors: [],\n inclusive: false,\n });\n }\n return final;\n}\nexport const $ZodXor = /@__PURE__/ core.$constructor(\"$ZodXor\", (inst, def) => {\n $ZodUnion.init(inst, def);\n def.inclusive = false;\n const single = def.options.length === 1;\n const first = def.options[0]._zod.run;\n inst._zod.parse = (payload, ctx) => {\n if (single) {\n return first(payload, ctx);\n }\n let async = false;\n const results = [];\n for (const option of def.options) {\n const result = option._zod.run({\n value: payload.value,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n results.push(result);\n async = true;\n }\n else {\n results.push(result);\n }\n }\n if (!async)\n return handleExclusiveUnionResults(results, payload, inst, ctx);\n return Promise.all(results).then((results) => {\n return handleExclusiveUnionResults(results, payload, inst, ctx);\n });\n };\n});\nexport const $ZodDiscriminatedUnion = \n/@__PURE__/\ncore.$constructor(\"$ZodDiscriminatedUnion\", (inst, def) => {\n def.inclusive = false;\n $ZodUnion.init(inst, def);\n const _super = inst._zod.parse;\n util.defineLazy(inst._zod, \"propValues\", () => {\n const propValues = {};\n for (const option of def.options) {\n const pv = option._zod.propValues;\n if (!pv \|\| Object.keys(pv).length === 0)\n throw new Error(`Invalid discriminated union option at index \"${def.options.indexOf(option)}\"`);\n for (const [k, v] of Object.entries(pv)) {\n if (!propValues[k])\n propValues[k] = new Set();\n for (const val of v) {\n propValues[k].add(val);\n }\n }\n }\n return propValues;\n });\n const disc = util.cached(() => {\n const opts = def.options;\n const map = new Map();\n for (const o of opts) {\n const values = o._zod.propValues?.[def.discriminator];\n if (!values \|\| values.size === 0)\n throw new Error(`Invalid discriminated union option at index \"${def.options.indexOf(o)}\"`);\n for (const v of values) {\n if (map.has(v)) {\n throw new Error(`Duplicate discriminator value \"${String(v)}\"`);\n }\n map.set(v, o);\n }\n }\n return map;\n });\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!util.isObject(input)) {\n payload.issues.push({\n code: \"invalid_type\",\n expected: \"object\",\n input,\n inst,\n });\n return payload;\n }\n const opt = disc.value.get(input?.[def.discriminator]);\n if (opt) {\n return opt._zod.run(payload, ctx);\n }\n if (def.unionFallback) {\n return _super(payload, ctx);\n }\n // no matching discriminator\n payload.issues.push({\n code: \"invalid_union\",\n errors: [],\n note: \"No matching discriminator\",\n discriminator: def.discriminator,\n input,\n path: [def.discriminator],\n inst,\n });\n return payload;\n };\n});\nexport const $ZodIntersection = /@__PURE__/ core.$constructor(\"$ZodIntersection\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n const left = def.left._zod.run({ value: input, issues: [] }, ctx);\n const right = def.right._zod.run({ value: input, issues: [] }, ctx);\n const async = left instanceof Promise \|\| right instanceof Promise;\n if (async) {\n return Promise.all([left, right]).then(([left, right]) => {\n return handleIntersectionResults(payload, left, right);\n });\n }\n return handleIntersectionResults(payload, left, right);\n };\n});\nfunction mergeValues(a, b) {\n // const aType = parse.t(a);\n // const bType = parse.t(b);\n if (a === b) {\n return { valid: true, data: a };\n }\n if (a instanceof Date && b instanceof Date && +a === +b) {\n return { valid: true, data: a };\n }\n if (util.isPlainObject(a) && util.isPlainObject(b)) {\n const bKeys = Object.keys(b);\n const sharedKeys = Object.keys(a).filter((key) => bKeys.indexOf(key) !== -1);\n const newObj = { ...a, ...b };\n for (const key of sharedKeys) {\n const sharedValue = mergeValues(a[key], b[key]);\n if (!sharedValue.valid) {\n return {\n valid: false,\n mergeErrorPath: [key, ...sharedValue.mergeErrorPath],\n };\n }\n newObj[key] = sharedValue.data;\n }\n return { valid: true, data: newObj };\n }\n if (Array.isArray(a) && Array.isArray(b)) {\n if (a.length !== b.length) {\n return { valid: false, mergeErrorPath: [] };\n }\n const newArray = [];\n for (let index = 0; index < a.length; index++) {\n const itemA = a[index];\n const itemB = b[index];\n const sharedValue = mergeValues(itemA, itemB);\n if (!sharedValue.valid) {\n return {\n valid: false,\n mergeErrorPath: [index, ...sharedValue.mergeErrorPath],\n };\n }\n newArray.push(sharedValue.data);\n }\n return { valid: true, data: newArray };\n }\n return { valid: false, mergeErrorPath: [] };\n}\nfunction handleIntersectionResults(result, left, right) {\n // Track which side(s) report each key as unrecognized\n const unrecKeys = new Map();\n let unrecIssue;\n for (const iss of left.issues) {\n if (iss.code === \"unrecognized_keys\") {\n unrecIssue ?? (unrecIssue = iss);\n for (const k of iss.keys) {\n if (!unrecKeys.has(k))\n unrecKeys.set(k, {});\n unrecKeys.get(k).l = true;\n }\n }\n else {\n result.issues.push(iss);\n }\n }\n for (const iss of right.issues) {\n if (iss.code === \"unrecognized_keys\") {\n for (const k of iss.keys) {\n if (!unrecKeys.has(k))\n unrecKeys.set(k, {});\n unrecKeys.get(k).r = true;\n }\n }\n else {\n result.issues.push(iss);\n }\n }\n // Report only keys unrecognized by BOTH sides\n const bothKeys = [...unrecKeys].filter(([, f]) => f.l && f.r).map(([k]) => k);\n if (bothKeys.length && unrecIssue) {\n result.issues.push({ ...unrecIssue, keys: bothKeys });\n }\n if (util.aborted(result))\n return result;\n const merged = mergeValues(left.value, right.value);\n if (!merged.valid) {\n throw new Error(`Unmergable intersection. Error path: ` + `${JSON.stringify(merged.mergeErrorPath)}`);\n }\n result.value = merged.data;\n return result;\n}\nexport const $ZodTuple = /@__PURE__/ core.$constructor(\"$ZodTuple\", (inst, def) => {\n $ZodType.init(inst, def);\n const items = def.items;\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!Array.isArray(input)) {\n payload.issues.push({\n input,\n inst,\n expected: \"tuple\",\n code: \"invalid_type\",\n });\n return payload;\n }\n payload.value = [];\n const proms = [];\n const reversedIndex = [...items].reverse().findIndex((item) => item._zod.optin !== \"optional\");\n const optStart = reversedIndex === -1 ? 0 : items.length - reversedIndex;\n if (!def.rest) {\n const tooBig = input.length > items.length;\n const tooSmall = input.length < optStart - 1;\n if (tooBig \|\| tooSmall) {\n payload.issues.push({\n ...(tooBig\n ? { code: \"too_big\", maximum: items.length, inclusive: true }\n : { code: \"too_small\", minimum: items.length }),\n input,\n inst,\n origin: \"array\",\n });\n return payload;\n }\n }\n let i = -1;\n for (const item of items) {\n i++;\n if (i >= input.length)\n if (i >= optStart)\n continue;\n const result = item._zod.run({\n value: input[i],\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleTupleResult(result, payload, i)));\n }\n else {\n handleTupleResult(result, payload, i);\n }\n }\n if (def.rest) {\n const rest = input.slice(items.length);\n for (const el of rest) {\n i++;\n const result = def.rest._zod.run({\n value: el,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleTupleResult(result, payload, i)));\n }\n else {\n handleTupleResult(result, payload, i);\n }\n }\n }\n if (proms.length)\n return Promise.all(proms).then(() => payload);\n return payload;\n };\n});\nfunction handleTupleResult(result, final, index) {\n if (result.issues.length) {\n final.issues.push(...util.prefixIssues(index, result.issues));\n }\n final.value[index] = result.value;\n}\nexport const $ZodRecord = /@__PURE__/ core.$constructor(\"$ZodRecord\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!util.isPlainObject(input)) {\n payload.issues.push({\n expected: \"record\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n const proms = [];\n const values = def.keyType._zod.values;\n if (values) {\n payload.value = {};\n const recordKeys = new Set();\n for (const key of values) {\n if (typeof key === \"string\" \|\| typeof key === \"number\" \|\| typeof key === \"symbol\") {\n recordKeys.add(typeof key === \"number\" ? key.toString() : key);\n const result = def.valueType._zod.run({ value: input[key], issues: [] }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[key] = result.value;\n }));\n }\n else {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[key] = result.value;\n }\n }\n }\n let unrecognized;\n for (const key in input) {\n if (!recordKeys.has(key)) {\n unrecognized = unrecognized ?? [];\n unrecognized.push(key);\n }\n }\n if (unrecognized && unrecognized.length > 0) {\n payload.issues.push({\n code: \"unrecognized_keys\",\n input,\n inst,\n keys: unrecognized,\n });\n }\n }\n else {\n payload.value = {};\n for (const key of Reflect.ownKeys(input)) {\n if (key === \"__proto__\")\n continue;\n let keyResult = def.keyType._zod.run({ value: key, issues: [] }, ctx);\n if (keyResult instanceof Promise) {\n throw new Error(\"Async schemas not supported in object keys currently\");\n }\n // Numeric string fallback: if key is a numeric string and failed, retry with Number(key)\n // This handles z.number(), z.literal([1, 2, 3]), and unions containing numeric literals\n const checkNumericKey = typeof key === \"string\" && regexes.number.test(key) && keyResult.issues.length;\n if (checkNumericKey) {\n const retryResult = def.keyType._zod.run({ value: Number(key), issues: [] }, ctx);\n if (retryResult instanceof Promise) {\n throw new Error(\"Async schemas not supported in object keys currently\");\n }\n if (retryResult.issues.length === 0) {\n keyResult = retryResult;\n }\n }\n if (keyResult.issues.length) {\n if (def.mode === \"loose\") {\n // Pass through unchanged\n payload.value[key] = input[key];\n }\n else {\n // Default \"strict\" behavior: error on invalid key\n payload.issues.push({\n code: \"invalid_key\",\n origin: \"record\",\n issues: keyResult.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n input: key,\n path: [key],\n inst,\n });\n }\n continue;\n }\n const result = def.valueType._zod.run({ value: input[key], issues: [] }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[keyResult.value] = result.value;\n }));\n }\n else {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[keyResult.value] = result.value;\n }\n }\n }\n if (proms.length) {\n return Promise.all(proms).then(() => payload);\n }\n return payload;\n };\n});\nexport const $ZodMap = /@__PURE__/ core.$constructor(\"$ZodMap\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!(input instanceof Map)) {\n payload.issues.push({\n expected: \"map\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n const proms = [];\n payload.value = new Map();\n for (const [key, value] of input) {\n const keyResult = def.keyType._zod.run({ value: key, issues: [] }, ctx);\n const valueResult = def.valueType._zod.run({ value: value, issues: [] }, ctx);\n if (keyResult instanceof Promise \|\| valueResult instanceof Promise) {\n proms.push(Promise.all([keyResult, valueResult]).then(([keyResult, valueResult]) => {\n handleMapResult(keyResult, valueResult, payload, key, input, inst, ctx);\n }));\n }\n else {\n handleMapResult(keyResult, valueResult, payload, key, input, inst, ctx);\n }\n }\n if (proms.length)\n return Promise.all(proms).then(() => payload);\n return payload;\n };\n});\nfunction handleMapResult(keyResult, valueResult, final, key, input, inst, ctx) {\n if (keyResult.issues.length) {\n if (util.propertyKeyTypes.has(typeof key)) {\n final.issues.push(...util.prefixIssues(key, keyResult.issues));\n }\n else {\n final.issues.push({\n code: \"invalid_key\",\n origin: \"map\",\n input,\n inst,\n issues: keyResult.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n });\n }\n }\n if (valueResult.issues.length) {\n if (util.propertyKeyTypes.has(typeof key)) {\n final.issues.push(...util.prefixIssues(key, valueResult.issues));\n }\n else {\n final.issues.push({\n origin: \"map\",\n code: \"invalid_element\",\n input,\n inst,\n key: key,\n issues: valueResult.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n });\n }\n }\n final.value.set(keyResult.value, valueResult.value);\n}\nexport const $ZodSet = /@__PURE__/ core.$constructor(\"$ZodSet\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!(input instanceof Set)) {\n payload.issues.push({\n input,\n inst,\n expected: \"set\",\n code: \"invalid_type\",\n });\n return payload;\n }\n const proms = [];\n payload.value = new Set();\n for (const item of input) {\n const result = def.valueType._zod.run({ value: item, issues: [] }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleSetResult(result, payload)));\n }\n else\n handleSetResult(result, payload);\n }\n if (proms.length)\n return Promise.all(proms).then(() => payload);\n return payload;\n };\n});\nfunction handleSetResult(result, final) {\n if (result.issues.length) {\n final.issues.push(...result.issues);\n }\n final.value.add(result.value);\n}\nexport const $ZodEnum = /@__PURE__/ core.$constructor(\"$ZodEnum\", (inst, def) => {\n $ZodType.init(inst, def);\n const values = util.getEnumValues(def.entries);\n const valuesSet = new Set(values);\n inst._zod.values = valuesSet;\n inst._zod.pattern = new RegExp(`^(${values\n .filter((k) => util.propertyKeyTypes.has(typeof k))\n .map((o) => (typeof o === \"string\" ? util.escapeRegex(o) : o.toString()))\n .join(\"\|\")})$`);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (valuesSet.has(input)) {\n return payload;\n }\n payload.issues.push({\n code: \"invalid_value\",\n values,\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodLiteral = /@__PURE__/ core.$constructor(\"$ZodLiteral\", (inst, def) => {\n $ZodType.init(inst, def);\n if (def.values.length === 0) {\n throw new Error(\"Cannot create literal schema with no valid values\");\n }\n const values = new Set(def.values);\n inst._zod.values = values;\n inst._zod.pattern = new RegExp(`^(${def.values\n .map((o) => (typeof o === \"string\" ? util.escapeRegex(o) : o ? util.escapeRegex(o.toString()) : String(o)))\n .join(\"\|\")})$`);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (values.has(input)) {\n return payload;\n }\n payload.issues.push({\n code: \"invalid_value\",\n values: def.values,\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodFile = /@__PURE__/ core.$constructor(\"$ZodFile\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n // @ts-ignore\n if (input instanceof File)\n return payload;\n payload.issues.push({\n expected: \"file\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodTransform = /@__PURE__/ core.$constructor(\"$ZodTransform\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n throw new core.$ZodEncodeError(inst.constructor.name);\n }\n const _out = def.transform(payload.value, payload);\n if (ctx.async) {\n const output = _out instanceof Promise ? _out : Promise.resolve(_out);\n return output.then((output) => {\n payload.value = output;\n return payload;\n });\n }\n if (_out instanceof Promise) {\n throw new core.$ZodAsyncError();\n }\n payload.value = _out;\n return payload;\n };\n});\nfunction handleOptionalResult(result, input) {\n if (result.issues.length && input === undefined) {\n return { issues: [], value: undefined };\n }\n return result;\n}\nexport const $ZodOptional = /@__PURE__/ core.$constructor(\"$ZodOptional\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.optin = \"optional\";\n inst._zod.optout = \"optional\";\n util.defineLazy(inst._zod, \"values\", () => {\n return def.innerType._zod.values ? new Set([...def.innerType._zod.values, undefined]) : undefined;\n });\n util.defineLazy(inst._zod, \"pattern\", () => {\n const pattern = def.innerType._zod.pattern;\n return pattern ? new RegExp(`^(${util.cleanRegex(pattern.source)})?$`) : undefined;\n });\n inst._zod.parse = (payload, ctx) => {\n if (def.innerType._zod.optin === \"optional\") {\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise)\n return result.then((r) => handleOptionalResult(r, payload.value));\n return handleOptionalResult(result, payload.value);\n }\n if (payload.value === undefined) {\n return payload;\n }\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodExactOptional = /@__PURE__/ core.$constructor(\"$ZodExactOptional\", (inst, def) => {\n // Call parent init - inherits optin/optout = \"optional\"\n $ZodOptional.init(inst, def);\n // Override values/pattern to NOT add undefined\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n util.defineLazy(inst._zod, \"pattern\", () => def.innerType._zod.pattern);\n // Override parse to just delegate (no undefined handling)\n inst._zod.parse = (payload, ctx) => {\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodNullable = /@__PURE__/ core.$constructor(\"$ZodNullable\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"optin\", () => def.innerType._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.innerType._zod.optout);\n util.defineLazy(inst._zod, \"pattern\", () => {\n const pattern = def.innerType._zod.pattern;\n return pattern ? new RegExp(`^(${util.cleanRegex(pattern.source)}\|null)$`) : undefined;\n });\n util.defineLazy(inst._zod, \"values\", () => {\n return def.innerType._zod.values ? new Set([...def.innerType._zod.values, null]) : undefined;\n });\n inst._zod.parse = (payload, ctx) => {\n // Forward direction (decode): allow null to pass through\n if (payload.value === null)\n return payload;\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodDefault = /@__PURE__/ core.$constructor(\"$ZodDefault\", (inst, def) => {\n $ZodType.init(inst, def);\n // inst._zod.qin = \"true\";\n inst._zod.optin = \"optional\";\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n // Forward direction (decode): apply defaults for undefined input\n if (payload.value === undefined) {\n payload.value = def.defaultValue;\n /*\n $ZodDefault returns the default value immediately in forward direction.\n * It doesn't pass the default value into the validator (\"prefault\"). There's no reason to pass the default value through validation. The validity of the default is enforced by TypeScript statically. Otherwise, it's the responsibility of the user to ensure the default is valid. In the case of pipes with divergent in/out types, you can specify the default on the `in` schema of your ZodPipe to set a \"prefault\" for the pipe. /\n return payload;\n }\n // Forward direction: continue with default handling\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => handleDefaultResult(result, def));\n }\n return handleDefaultResult(result, def);\n };\n});\nfunction handleDefaultResult(payload, def) {\n if (payload.value === undefined) {\n payload.value = def.defaultValue;\n }\n return payload;\n}\nexport const $ZodPrefault = /@__PURE__/ core.$constructor(\"$ZodPrefault\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.optin = \"optional\";\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n // Forward direction (decode): apply prefault for undefined input\n if (payload.value === undefined) {\n payload.value = def.defaultValue;\n }\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodNonOptional = /@__PURE__/ core.$constructor(\"$ZodNonOptional\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"values\", () => {\n const v = def.innerType._zod.values;\n return v ? new Set([...v].filter((x) => x !== undefined)) : undefined;\n });\n inst._zod.parse = (payload, ctx) => {\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => handleNonOptionalResult(result, inst));\n }\n return handleNonOptionalResult(result, inst);\n };\n});\nfunction handleNonOptionalResult(payload, inst) {\n if (!payload.issues.length && payload.value === undefined) {\n payload.issues.push({\n code: \"invalid_type\",\n expected: \"nonoptional\",\n input: payload.value,\n inst,\n });\n }\n return payload;\n}\nexport const $ZodSuccess = /@__PURE__/ core.$constructor(\"$ZodSuccess\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n throw new core.$ZodEncodeError(\"ZodSuccess\");\n }\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => {\n payload.value = result.issues.length === 0;\n return payload;\n });\n }\n payload.value = result.issues.length === 0;\n return payload;\n };\n});\nexport const $ZodCatch = /@__PURE__/ core.$constructor(\"$ZodCatch\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"optin\", () => def.innerType._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.innerType._zod.optout);\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n // Forward direction (decode): apply catch logic\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => {\n payload.value = result.value;\n if (result.issues.length) {\n payload.value = def.catchValue({\n ...payload,\n error: {\n issues: result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n },\n input: payload.value,\n });\n payload.issues = [];\n }\n return payload;\n });\n }\n payload.value = result.value;\n if (result.issues.length) {\n payload.value = def.catchValue({\n ...payload,\n error: {\n issues: result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n },\n input: payload.value,\n });\n payload.issues = [];\n }\n return payload;\n };\n});\nexport const $ZodNaN = /@__PURE__/ core.$constructor(\"$ZodNaN\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n if (typeof payload.value !== \"number\" \|\| !Number.isNaN(payload.value)) {\n payload.issues.push({\n input: payload.value,\n inst,\n expected: \"nan\",\n code: \"invalid_type\",\n });\n return payload;\n }\n return payload;\n };\n});\nexport const $ZodPipe = /@__PURE__/ core.$constructor(\"$ZodPipe\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"values\", () => def.in._zod.values);\n util.defineLazy(inst._zod, \"optin\", () => def.in._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.out._zod.optout);\n util.defineLazy(inst._zod, \"propValues\", () => def.in._zod.propValues);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n const right = def.out._zod.run(payload, ctx);\n if (right instanceof Promise) {\n return right.then((right) => handlePipeResult(right, def.in, ctx));\n }\n return handlePipeResult(right, def.in, ctx);\n }\n const left = def.in._zod.run(payload, ctx);\n if (left instanceof Promise) {\n return left.then((left) => handlePipeResult(left, def.out, ctx));\n }\n return handlePipeResult(left, def.out, ctx);\n };\n});\nfunction handlePipeResult(left, next, ctx) {\n if (left.issues.length) {\n // prevent further checks\n left.aborted = true;\n return left;\n }\n return next._zod.run({ value: left.value, issues: left.issues }, ctx);\n}\nexport const $ZodCodec = /@__PURE__/ core.$constructor(\"$ZodCodec\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"values\", () => def.in._zod.values);\n util.defineLazy(inst._zod, \"optin\", () => def.in._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.out._zod.optout);\n util.defineLazy(inst._zod, \"propValues\", () => def.in._zod.propValues);\n inst._zod.parse = (payload, ctx) => {\n const direction = ctx.direction \|\| \"forward\";\n if (direction === \"forward\") {\n const left = def.in._zod.run(payload, ctx);\n if (left instanceof Promise) {\n return left.then((left) => handleCodecAResult(left, def, ctx));\n }\n return handleCodecAResult(left, def, ctx);\n }\n else {\n const right = def.out._zod.run(payload, ctx);\n if (right instanceof Promise) {\n return right.then((right) => handleCodecAResult(right, def, ctx));\n }\n return handleCodecAResult(right, def, ctx);\n }\n };\n});\nfunction handleCodecAResult(result, def, ctx) {\n if (result.issues.length) {\n // prevent further checks\n result.aborted = true;\n return result;\n }\n const direction = ctx.direction \|\| \"forward\";\n if (direction === \"forward\") {\n const transformed = def.transform(result.value, result);\n if (transformed instanceof Promise) {\n return transformed.then((value) => handleCodecTxResult(result, value, def.out, ctx));\n }\n return handleCodecTxResult(result, transformed, def.out, ctx);\n }\n else {\n const transformed = def.reverseTransform(result.value, result);\n if (transformed instanceof Promise) {\n return transformed.then((value) => handleCodecTxResult(result, value, def.in, ctx));\n }\n return handleCodecTxResult(result, transformed, def.in, ctx);\n }\n}\nfunction handleCodecTxResult(left, value, nextSchema, ctx) {\n // Check if transform added any issues\n if (left.issues.length) {\n left.aborted = true;\n return left;\n }\n return nextSchema._zod.run({ value, issues: left.issues }, ctx);\n}\nexport const $ZodReadonly = /@__PURE__/ core.$constructor(\"$ZodReadonly\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"propValues\", () => def.innerType._zod.propValues);\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n util.defineLazy(inst._zod, \"optin\", () => def.innerType?._zod?.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.innerType?._zod?.optout);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then(handleReadonlyResult);\n }\n return handleReadonlyResult(result);\n };\n});\nfunction handleReadonlyResult(payload) {\n payload.value = Object.freeze(payload.value);\n return payload;\n}\nexport const $ZodTemplateLiteral = /@__PURE__/ core.$constructor(\"$ZodTemplateLiteral\", (inst, def) => {\n $ZodType.init(inst, def);\n const regexParts = [];\n for (const part of def.parts) {\n if (typeof part === \"object\" && part !== null) {\n // is Zod schema\n if (!part._zod.pattern) {\n // if (!source)\n throw new Error(`Invalid template literal part, no pattern found: ${[...part._zod.traits].shift()}`);\n }\n const source = part._zod.pattern instanceof RegExp ? part._zod.pattern.source : part._zod.pattern;\n if (!source)\n throw new Error(`Invalid template literal part: ${part._zod.traits}`);\n const start = source.startsWith(\"^\") ? 1 : 0;\n const end = source.endsWith(\"$\") ? source.length - 1 : source.length;\n regexParts.push(source.slice(start, end));\n }\n else if (part === null \|\| util.primitiveTypes.has(typeof part)) {\n regexParts.push(util.escapeRegex(`${part}`));\n }\n else {\n throw new Error(`Invalid template literal part: ${part}`);\n }\n }\n inst._zod.pattern = new RegExp(`^${regexParts.join(\"\")}$`);\n inst._zod.parse = (payload, _ctx) => {\n if (typeof payload.value !== \"string\") {\n payload.issues.push({\n input: payload.value,\n inst,\n expected: \"string\",\n code: \"invalid_type\",\n });\n return payload;\n }\n inst._zod.pattern.lastIndex = 0;\n if (!inst._zod.pattern.test(payload.value)) {\n payload.issues.push({\n input: payload.value,\n inst,\n code: \"invalid_format\",\n format: def.format ?? \"template_literal\",\n pattern: inst._zod.pattern.source,\n });\n return payload;\n }\n return payload;\n };\n});\nexport const $ZodFunction = /@__PURE__/ core.$constructor(\"$ZodFunction\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._def = def;\n inst._zod.def = def;\n inst.implement = (func) => {\n if (typeof func !== \"function\") {\n throw new Error(\"implement() must be called with a function\");\n }\n return function (...args) {\n const parsedArgs = inst._def.input ? parse(inst._def.input, args) : args;\n const result = Reflect.apply(func, this, parsedArgs);\n if (inst._def.output) {\n return parse(inst._def.output, result);\n }\n return result;\n };\n };\n inst.implementAsync = (func) => {\n if (typeof func !== \"function\") {\n throw new Error(\"implementAsync() must be called with a function\");\n }\n return async function (...args) {\n const parsedArgs = inst._def.input ? await parseAsync(inst._def.input, args) : args;\n const result = await Reflect.apply(func, this, parsedArgs);\n if (inst._def.output) {\n return await parseAsync(inst._def.output, result);\n }\n return result;\n };\n };\n inst._zod.parse = (payload, _ctx) => {\n if (typeof payload.value !== \"function\") {\n payload.issues.push({\n code: \"invalid_type\",\n expected: \"function\",\n input: payload.value,\n inst,\n });\n return payload;\n }\n // Check if output is a promise type to determine if we should use async implementation\n const hasPromiseOutput = inst._def.output && inst._def.output._zod.def.type === \"promise\";\n if (hasPromiseOutput) {\n payload.value = inst.implementAsync(payload.value);\n }\n else {\n payload.value = inst.implement(payload.value);\n }\n return payload;\n };\n inst.input = (...args) => {\n const F = inst.constructor;\n if (Array.isArray(args[0])) {\n return new F({\n type: \"function\",\n input: new $ZodTuple({\n type: \"tuple\",\n items: args[0],\n rest: args[1],\n }),\n output: inst._def.output,\n });\n }\n return new F({\n type: \"function\",\n input: args[0],\n output: inst._def.output,\n });\n };\n inst.output = (output) => {\n const F = inst.constructor;\n return new F({\n type: \"function\",\n input: inst._def.input,\n output,\n });\n };\n return inst;\n});\nexport const $ZodPromise = /@__PURE__/ core.$constructor(\"$ZodPromise\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n return Promise.resolve(payload.value).then((inner) => def.innerType._zod.run({ value: inner, issues: [] }, ctx));\n };\n});\nexport const $ZodLazy = /@__PURE__/ core.$constructor(\"$ZodLazy\", (inst, def) => {\n $ZodType.init(inst, def);\n // let _innerType!: any;\n // util.defineLazy(def, \"getter\", () => {\n // if (!_innerType) {\n // _innerType = def.getter();\n // }\n // return () => _innerType;\n // });\n util.defineLazy(inst._zod, \"innerType\", () => def.getter());\n util.defineLazy(inst._zod, \"pattern\", () => inst._zod.innerType?._zod?.pattern);\n util.defineLazy(inst._zod, \"propValues\", () => inst._zod.innerType?._zod?.propValues);\n util.defineLazy(inst._zod, \"optin\", () => inst._zod.innerType?._zod?.optin ?? undefined);\n util.defineLazy(inst._zod, \"optout\", () => inst._zod.innerType?._zod?.optout ?? undefined);\n inst._zod.parse = (payload, ctx) => {\n const inner = inst._zod.innerType;\n return inner._zod.run(payload, ctx);\n };\n});\nexport const $ZodCustom = /@__PURE__/ core.$constructor(\"$ZodCustom\", (inst, def) => {\n checks.$ZodCheck.init(inst, def);\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _) => {\n return payload;\n };\n inst._zod.check = (payload) => {\n const input = payload.value;\n const r = def.fn(input);\n if (r instanceof Promise) {\n return r.then((r) => handleRefineResult(r, payload, input, inst));\n }\n handleRefineResult(r, payload, input, inst);\n return;\n };\n});\nfunction handleRefineResult(result, payload, input, inst) {\n if (!result) {\n const _iss = {\n code: \"custom\",\n input,\n inst, // incorporates params.error into issue reporting\n path: [...(inst._zod.def.path ?? [])], // incorporates params.error into issue reporting\n continue: !inst._zod.def.abort,\n // params: inst._zod.def.params,\n };\n if (inst._zod.def.params)\n _iss.params = inst._zod.def.params;\n payload.issues.push(util.issue(_iss));\n }\n}\n","var _a;\nexport const $output = Symbol(\"ZodOutput\");\nexport const $input = Symbol(\"ZodInput\");\nexport class $ZodRegistry {\n constructor() {\n this._map = new WeakMap();\n this._idmap = new Map();\n }\n add(schema, ..._meta) {\n const meta = _meta[0];\n this._map.set(schema, meta);\n if (meta && typeof meta === \"object\" && \"id\" in meta) {\n this._idmap.set(meta.id, schema);\n }\n return this;\n }\n clear() {\n this._map = new WeakMap();\n this._idmap = new Map();\n return this;\n }\n remove(schema) {\n const meta = this._map.get(schema);\n if (meta && typeof meta === \"object\" && \"id\" in meta) {\n this._idmap.delete(meta.id);\n }\n this._map.delete(schema);\n return this;\n }\n get(schema) {\n // return this._map.get(schema) as any;\n // inherit metadata\n const p = schema._zod.parent;\n if (p) {\n const pm = { ...(this.get(p) ?? {}) };\n delete pm.id; // do not inherit id\n const f = { ...pm, ...this._map.get(schema) };\n return Object.keys(f).length ? f : undefined;\n }\n return this._map.get(schema);\n }\n has(schema) {\n return this._map.has(schema);\n }\n}\n// registries\nexport function registry() {\n return new $ZodRegistry();\n}\n(_a = globalThis).__zod_globalRegistry ?? (_a.__zod_globalRegistry = registry());\nexport const globalRegistry = globalThis.__zod_globalRegistry;\n","import as checks from \"./checks.js\";\nimport * as registries from \"./registries.js\";\nimport * as schemas from \"./schemas.js\";\nimport * as util from \"./util.js\";\n// @__NO_SIDE_EFFECTS__\nexport function _string(Class, params) {\n return new Class({\n type: \"string\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedString(Class, params) {\n return new Class({\n type: \"string\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _email(Class, params) {\n return new Class({\n type: \"string\",\n format: \"email\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _guid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"guid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuidv4(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n version: \"v4\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuidv6(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n version: \"v6\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuidv7(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n version: \"v7\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _url(Class, params) {\n return new Class({\n type: \"string\",\n format: \"url\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _emoji(Class, params) {\n return new Class({\n type: \"string\",\n format: \"emoji\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nanoid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"nanoid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cuid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cuid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cuid2(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cuid2\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ulid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ulid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _xid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"xid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ksuid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ksuid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ipv4(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ipv4\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ipv6(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ipv6\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _mac(Class, params) {\n return new Class({\n type: \"string\",\n format: \"mac\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cidrv4(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cidrv4\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cidrv6(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cidrv6\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _base64(Class, params) {\n return new Class({\n type: \"string\",\n format: \"base64\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _base64url(Class, params) {\n return new Class({\n type: \"string\",\n format: \"base64url\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _e164(Class, params) {\n return new Class({\n type: \"string\",\n format: \"e164\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _jwt(Class, params) {\n return new Class({\n type: \"string\",\n format: \"jwt\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\nexport const TimePrecision = {\n Any: null,\n Minute: -1,\n Second: 0,\n Millisecond: 3,\n Microsecond: 6,\n};\n// @__NO_SIDE_EFFECTS__\nexport function _isoDateTime(Class, params) {\n return new Class({\n type: \"string\",\n format: \"datetime\",\n check: \"string_format\",\n offset: false,\n local: false,\n precision: null,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _isoDate(Class, params) {\n return new Class({\n type: \"string\",\n format: \"date\",\n check: \"string_format\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _isoTime(Class, params) {\n return new Class({\n type: \"string\",\n format: \"time\",\n check: \"string_format\",\n precision: null,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _isoDuration(Class, params) {\n return new Class({\n type: \"string\",\n format: \"duration\",\n check: \"string_format\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _number(Class, params) {\n return new Class({\n type: \"number\",\n checks: [],\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedNumber(Class, params) {\n return new Class({\n type: \"number\",\n coerce: true,\n checks: [],\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _int(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"safeint\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _float32(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"float32\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _float64(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"float64\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _int32(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"int32\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uint32(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"uint32\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _boolean(Class, params) {\n return new Class({\n type: \"boolean\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedBoolean(Class, params) {\n return new Class({\n type: \"boolean\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _bigint(Class, params) {\n return new Class({\n type: \"bigint\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedBigint(Class, params) {\n return new Class({\n type: \"bigint\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _int64(Class, params) {\n return new Class({\n type: \"bigint\",\n check: \"bigint_format\",\n abort: false,\n format: \"int64\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uint64(Class, params) {\n return new Class({\n type: \"bigint\",\n check: \"bigint_format\",\n abort: false,\n format: \"uint64\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _symbol(Class, params) {\n return new Class({\n type: \"symbol\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _undefined(Class, params) {\n return new Class({\n type: \"undefined\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _null(Class, params) {\n return new Class({\n type: \"null\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _any(Class) {\n return new Class({\n type: \"any\",\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _unknown(Class) {\n return new Class({\n type: \"unknown\",\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _never(Class, params) {\n return new Class({\n type: \"never\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _void(Class, params) {\n return new Class({\n type: \"void\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _date(Class, params) {\n return new Class({\n type: \"date\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedDate(Class, params) {\n return new Class({\n type: \"date\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nan(Class, params) {\n return new Class({\n type: \"nan\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lt(value, params) {\n return new checks.$ZodCheckLessThan({\n check: \"less_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: false,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lte(value, params) {\n return new checks.$ZodCheckLessThan({\n check: \"less_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: true,\n });\n}\nexport { \n/** @deprecated Use `z.lte()` instead. /\n_lte as _max, };\n// @__NO_SIDE_EFFECTS__\nexport function _gt(value, params) {\n return new checks.$ZodCheckGreaterThan({\n check: \"greater_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: false,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _gte(value, params) {\n return new checks.$ZodCheckGreaterThan({\n check: \"greater_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: true,\n });\n}\nexport { \n/* @deprecated Use `z.gte()` instead. /\n_gte as _min, };\n// @__NO_SIDE_EFFECTS__\nexport function _positive(params) {\n return _gt(0, params);\n}\n// negative\n// @__NO_SIDE_EFFECTS__\nexport function _negative(params) {\n return _lt(0, params);\n}\n// nonpositive\n// @__NO_SIDE_EFFECTS__\nexport function _nonpositive(params) {\n return _lte(0, params);\n}\n// nonnegative\n// @__NO_SIDE_EFFECTS__\nexport function _nonnegative(params) {\n return _gte(0, params);\n}\n// @__NO_SIDE_EFFECTS__\nexport function _multipleOf(value, params) {\n return new checks.$ZodCheckMultipleOf({\n check: \"multiple_of\",\n ...util.normalizeParams(params),\n value,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _maxSize(maximum, params) {\n return new checks.$ZodCheckMaxSize({\n check: \"max_size\",\n ...util.normalizeParams(params),\n maximum,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _minSize(minimum, params) {\n return new checks.$ZodCheckMinSize({\n check: \"min_size\",\n ...util.normalizeParams(params),\n minimum,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _size(size, params) {\n return new checks.$ZodCheckSizeEquals({\n check: \"size_equals\",\n ...util.normalizeParams(params),\n size,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _maxLength(maximum, params) {\n const ch = new checks.$ZodCheckMaxLength({\n check: \"max_length\",\n ...util.normalizeParams(params),\n maximum,\n });\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _minLength(minimum, params) {\n return new checks.$ZodCheckMinLength({\n check: \"min_length\",\n ...util.normalizeParams(params),\n minimum,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _length(length, params) {\n return new checks.$ZodCheckLengthEquals({\n check: \"length_equals\",\n ...util.normalizeParams(params),\n length,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _regex(pattern, params) {\n return new checks.$ZodCheckRegex({\n check: \"string_format\",\n format: \"regex\",\n ...util.normalizeParams(params),\n pattern,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lowercase(params) {\n return new checks.$ZodCheckLowerCase({\n check: \"string_format\",\n format: \"lowercase\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uppercase(params) {\n return new checks.$ZodCheckUpperCase({\n check: \"string_format\",\n format: \"uppercase\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _includes(includes, params) {\n return new checks.$ZodCheckIncludes({\n check: \"string_format\",\n format: \"includes\",\n ...util.normalizeParams(params),\n includes,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _startsWith(prefix, params) {\n return new checks.$ZodCheckStartsWith({\n check: \"string_format\",\n format: \"starts_with\",\n ...util.normalizeParams(params),\n prefix,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _endsWith(suffix, params) {\n return new checks.$ZodCheckEndsWith({\n check: \"string_format\",\n format: \"ends_with\",\n ...util.normalizeParams(params),\n suffix,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _property(property, schema, params) {\n return new checks.$ZodCheckProperty({\n check: \"property\",\n property,\n schema,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _mime(types, params) {\n return new checks.$ZodCheckMimeType({\n check: \"mime_type\",\n mime: types,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _overwrite(tx) {\n return new checks.$ZodCheckOverwrite({\n check: \"overwrite\",\n tx,\n });\n}\n// normalize\n// @__NO_SIDE_EFFECTS__\nexport function _normalize(form) {\n return _overwrite((input) => input.normalize(form));\n}\n// trim\n// @__NO_SIDE_EFFECTS__\nexport function _trim() {\n return _overwrite((input) => input.trim());\n}\n// toLowerCase\n// @__NO_SIDE_EFFECTS__\nexport function _toLowerCase() {\n return _overwrite((input) => input.toLowerCase());\n}\n// toUpperCase\n// @__NO_SIDE_EFFECTS__\nexport function _toUpperCase() {\n return _overwrite((input) => input.toUpperCase());\n}\n// slugify\n// @__NO_SIDE_EFFECTS__\nexport function _slugify() {\n return _overwrite((input) => util.slugify(input));\n}\n// @__NO_SIDE_EFFECTS__\nexport function _array(Class, element, params) {\n return new Class({\n type: \"array\",\n element,\n // get element() {\n // return element;\n // },\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _union(Class, options, params) {\n return new Class({\n type: \"union\",\n options,\n ...util.normalizeParams(params),\n });\n}\nexport function _xor(Class, options, params) {\n return new Class({\n type: \"union\",\n options,\n inclusive: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _discriminatedUnion(Class, discriminator, options, params) {\n return new Class({\n type: \"union\",\n options,\n discriminator,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _intersection(Class, left, right) {\n return new Class({\n type: \"intersection\",\n left,\n right,\n });\n}\n// export function _tuple(\n// Class: util.SchemaClass<schemas.$ZodTuple>,\n// items: [],\n// params?: string \| $ZodTupleParams\n// ): schemas.$ZodTuple<[], null>;\n// @__NO_SIDE_EFFECTS__\nexport function _tuple(Class, items, _paramsOrRest, _params) {\n const hasRest = _paramsOrRest instanceof schemas.$ZodType;\n const params = hasRest ? _params : _paramsOrRest;\n const rest = hasRest ? _paramsOrRest : null;\n return new Class({\n type: \"tuple\",\n items,\n rest,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _record(Class, keyType, valueType, params) {\n return new Class({\n type: \"record\",\n keyType,\n valueType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _map(Class, keyType, valueType, params) {\n return new Class({\n type: \"map\",\n keyType,\n valueType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _set(Class, valueType, params) {\n return new Class({\n type: \"set\",\n valueType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _enum(Class, values, params) {\n const entries = Array.isArray(values) ? Object.fromEntries(values.map((v) => [v, v])) : values;\n // if (Array.isArray(values)) {\n // for (const value of values) {\n // entries[value] = value;\n // }\n // } else {\n // Object.assign(entries, values);\n // }\n // const entries: util.EnumLike = {};\n // for (const val of values) {\n // entries[val] = val;\n // }\n return new Class({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\n/* @deprecated This API has been merged into `z.enum()`. Use `z.enum()` instead.\n \n ```ts\n * enum Colors { red, green, blue }\n * z.enum(Colors);\n * ```\n /\nexport function _nativeEnum(Class, entries, params) {\n return new Class({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _literal(Class, value, params) {\n return new Class({\n type: \"literal\",\n values: Array.isArray(value) ? value : [value],\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _file(Class, params) {\n return new Class({\n type: \"file\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _transform(Class, fn) {\n return new Class({\n type: \"transform\",\n transform: fn,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _optional(Class, innerType) {\n return new Class({\n type: \"optional\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nullable(Class, innerType) {\n return new Class({\n type: \"nullable\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _default(Class, innerType, defaultValue) {\n return new Class({\n type: \"default\",\n innerType,\n get defaultValue() {\n return typeof defaultValue === \"function\" ? defaultValue() : util.shallowClone(defaultValue);\n },\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nonoptional(Class, innerType, params) {\n return new Class({\n type: \"nonoptional\",\n innerType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _success(Class, innerType) {\n return new Class({\n type: \"success\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _catch(Class, innerType, catchValue) {\n return new Class({\n type: \"catch\",\n innerType,\n catchValue: (typeof catchValue === \"function\" ? catchValue : () => catchValue),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _pipe(Class, in_, out) {\n return new Class({\n type: \"pipe\",\n in: in_,\n out,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _readonly(Class, innerType) {\n return new Class({\n type: \"readonly\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _templateLiteral(Class, parts, params) {\n return new Class({\n type: \"template_literal\",\n parts,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lazy(Class, getter) {\n return new Class({\n type: \"lazy\",\n getter,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _promise(Class, innerType) {\n return new Class({\n type: \"promise\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _custom(Class, fn, _params) {\n const norm = util.normalizeParams(_params);\n norm.abort ?? (norm.abort = true); // default to abort:false\n const schema = new Class({\n type: \"custom\",\n check: \"custom\",\n fn: fn,\n ...norm,\n });\n return schema;\n}\n// same as _custom but defaults to abort:false\n// @__NO_SIDE_EFFECTS__\nexport function _refine(Class, fn, _params) {\n const schema = new Class({\n type: \"custom\",\n check: \"custom\",\n fn: fn,\n ...util.normalizeParams(_params),\n });\n return schema;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _superRefine(fn) {\n const ch = _check((payload) => {\n payload.addIssue = (issue) => {\n if (typeof issue === \"string\") {\n payload.issues.push(util.issue(issue, payload.value, ch._zod.def));\n }\n else {\n // for Zod 3 backwards compatibility\n const _issue = issue;\n if (_issue.fatal)\n _issue.continue = false;\n _issue.code ?? (_issue.code = \"custom\");\n _issue.input ?? (_issue.input = payload.value);\n _issue.inst ?? (_issue.inst = ch);\n _issue.continue ?? (_issue.continue = !ch._zod.def.abort); // abort is always undefined, so this is always true...\n payload.issues.push(util.issue(_issue));\n }\n };\n return fn(payload.value, payload);\n });\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _check(fn, params) {\n const ch = new checks.$ZodCheck({\n check: \"custom\",\n ...util.normalizeParams(params),\n });\n ch._zod.check = fn;\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function describe(description) {\n const ch = new checks.$ZodCheck({ check: \"describe\" });\n ch._zod.onattach = [\n (inst) => {\n const existing = registries.globalRegistry.get(inst) ?? {};\n registries.globalRegistry.add(inst, { ...existing, description });\n },\n ];\n ch._zod.check = () => { }; // no-op check\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function meta(metadata) {\n const ch = new checks.$ZodCheck({ check: \"meta\" });\n ch._zod.onattach = [\n (inst) => {\n const existing = registries.globalRegistry.get(inst) ?? {};\n registries.globalRegistry.add(inst, { ...existing, ...metadata });\n },\n ];\n ch._zod.check = () => { }; // no-op check\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _stringbool(Classes, _params) {\n const params = util.normalizeParams(_params);\n let truthyArray = params.truthy ?? [\"true\", \"1\", \"yes\", \"on\", \"y\", \"enabled\"];\n let falsyArray = params.falsy ?? [\"false\", \"0\", \"no\", \"off\", \"n\", \"disabled\"];\n if (params.case !== \"sensitive\") {\n truthyArray = truthyArray.map((v) => (typeof v === \"string\" ? v.toLowerCase() : v));\n falsyArray = falsyArray.map((v) => (typeof v === \"string\" ? v.toLowerCase() : v));\n }\n const truthySet = new Set(truthyArray);\n const falsySet = new Set(falsyArray);\n const _Codec = Classes.Codec ?? schemas.$ZodCodec;\n const _Boolean = Classes.Boolean ?? schemas.$ZodBoolean;\n const _String = Classes.String ?? schemas.$ZodString;\n const stringSchema = new _String({ type: \"string\", error: params.error });\n const booleanSchema = new _Boolean({ type: \"boolean\", error: params.error });\n const codec = new _Codec({\n type: \"pipe\",\n in: stringSchema,\n out: booleanSchema,\n transform: ((input, payload) => {\n let data = input;\n if (params.case !== \"sensitive\")\n data = data.toLowerCase();\n if (truthySet.has(data)) {\n return true;\n }\n else if (falsySet.has(data)) {\n return false;\n }\n else {\n payload.issues.push({\n code: \"invalid_value\",\n expected: \"stringbool\",\n values: [...truthySet, ...falsySet],\n input: payload.value,\n inst: codec,\n continue: false,\n });\n return {};\n }\n }),\n reverseTransform: ((input, _payload) => {\n if (input === true) {\n return truthyArray[0] \|\| \"true\";\n }\n else {\n return falsyArray[0] \|\| \"false\";\n }\n }),\n error: params.error,\n });\n return codec;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _stringFormat(Class, format, fnOrRegex, _params = {}) {\n const params = util.normalizeParams(_params);\n const def = {\n ...util.normalizeParams(_params),\n check: \"string_format\",\n type: \"string\",\n format,\n fn: typeof fnOrRegex === \"function\" ? fnOrRegex : (val) => fnOrRegex.test(val),\n ...params,\n };\n if (fnOrRegex instanceof RegExp) {\n def.pattern = fnOrRegex;\n }\n const inst = new Class(def);\n return inst;\n}\n","import { globalRegistry } from \"./registries.js\";\n// function initializeContext<T extends schemas.$ZodType>(inputs: JSONSchemaGeneratorParams<T>): ToJSONSchemaContext<T> {\n// return {\n// processor: inputs.processor,\n// metadataRegistry: inputs.metadata ?? globalRegistry,\n// target: inputs.target ?? \"draft-2020-12\",\n// unrepresentable: inputs.unrepresentable ?? \"throw\",\n// };\n// }\nexport function initializeContext(params) {\n // Normalize target: convert old non-hyphenated versions to hyphenated versions\n let target = params?.target ?? \"draft-2020-12\";\n if (target === \"draft-4\")\n target = \"draft-04\";\n if (target === \"draft-7\")\n target = \"draft-07\";\n return {\n processors: params.processors ?? {},\n metadataRegistry: params?.metadata ?? globalRegistry,\n target,\n unrepresentable: params?.unrepresentable ?? \"throw\",\n override: params?.override ?? (() => { }),\n io: params?.io ?? \"output\",\n counter: 0,\n seen: new Map(),\n cycles: params?.cycles ?? \"ref\",\n reused: params?.reused ?? \"inline\",\n external: params?.external ?? undefined,\n };\n}\nexport function process(schema, ctx, _params = { path: [], schemaPath: [] }) {\n var _a;\n const def = schema._zod.def;\n // check for schema in seens\n const seen = ctx.seen.get(schema);\n if (seen) {\n seen.count++;\n // check if cycle\n const isCycle = _params.schemaPath.includes(schema);\n if (isCycle) {\n seen.cycle = _params.path;\n }\n return seen.schema;\n }\n // initialize\n const result = { schema: {}, count: 1, cycle: undefined, path: _params.path };\n ctx.seen.set(schema, result);\n // custom method overrides default behavior\n const overrideSchema = schema._zod.toJSONSchema?.();\n if (overrideSchema) {\n result.schema = overrideSchema;\n }\n else {\n const params = {\n ..._params,\n schemaPath: [..._params.schemaPath, schema],\n path: _params.path,\n };\n if (schema._zod.processJSONSchema) {\n schema._zod.processJSONSchema(ctx, result.schema, params);\n }\n else {\n const _json = result.schema;\n const processor = ctx.processors[def.type];\n if (!processor) {\n throw new Error(`[toJSONSchema]: Non-representable type encountered: ${def.type}`);\n }\n processor(schema, ctx, _json, params);\n }\n const parent = schema._zod.parent;\n if (parent) {\n // Also set ref if processor didn't (for inheritance)\n if (!result.ref)\n result.ref = parent;\n process(parent, ctx, params);\n ctx.seen.get(parent).isParent = true;\n }\n }\n // metadata\n const meta = ctx.metadataRegistry.get(schema);\n if (meta)\n Object.assign(result.schema, meta);\n if (ctx.io === \"input\" && isTransforming(schema)) {\n // examples/defaults only apply to output type of pipe\n delete result.schema.examples;\n delete result.schema.default;\n }\n // set prefault as default\n if (ctx.io === \"input\" && result.schema._prefault)\n (_a = result.schema).default ?? (_a.default = result.schema._prefault);\n delete result.schema._prefault;\n // pulling fresh from ctx.seen in case it was overwritten\n const _result = ctx.seen.get(schema);\n return _result.schema;\n}\nexport function extractDefs(ctx, schema\n// params: EmitParams\n) {\n // iterate over seen map;\n const root = ctx.seen.get(schema);\n if (!root)\n throw new Error(\"Unprocessed schema. This is a bug in Zod.\");\n // Track ids to detect duplicates across different schemas\n const idToSchema = new Map();\n for (const entry of ctx.seen.entries()) {\n const id = ctx.metadataRegistry.get(entry[0])?.id;\n if (id) {\n const existing = idToSchema.get(id);\n if (existing && existing !== entry[0]) {\n throw new Error(`Duplicate schema id \"${id}\" detected during JSON Schema conversion. Two different schemas cannot share the same id when converted together.`);\n }\n idToSchema.set(id, entry[0]);\n }\n }\n // returns a ref to the schema\n // defId will be empty if the ref points to an external schema (or #)\n const makeURI = (entry) => {\n // comparing the seen objects because sometimes\n // multiple schemas map to the same seen object.\n // e.g. lazy\n // external is configured\n const defsSegment = ctx.target === \"draft-2020-12\" ? \"$defs\" : \"definitions\";\n if (ctx.external) {\n const externalId = ctx.external.registry.get(entry[0])?.id; // ?? \"__shared\";// `__schema${ctx.counter++}`;\n // check if schema is in the external registry\n const uriGenerator = ctx.external.uri ?? ((id) => id);\n if (externalId) {\n return { ref: uriGenerator(externalId) };\n }\n // otherwise, add to __shared\n const id = entry[1].defId ?? entry[1].schema.id ?? `schema${ctx.counter++}`;\n entry[1].defId = id; // set defId so it will be reused if needed\n return { defId: id, ref: `${uriGenerator(\"__shared\")}#/${defsSegment}/${id}` };\n }\n if (entry[1] === root) {\n return { ref: \"#\" };\n }\n // self-contained schema\n const uriPrefix = `#`;\n const defUriPrefix = `${uriPrefix}/${defsSegment}/`;\n const defId = entry[1].schema.id ?? `__schema${ctx.counter++}`;\n return { defId, ref: defUriPrefix + defId };\n };\n // stored cached version in `def` property\n // remove all properties, set $ref\n const extractToDef = (entry) => {\n // if the schema is already a reference, do not extract it\n if (entry[1].schema.$ref) {\n return;\n }\n const seen = entry[1];\n const { ref, defId } = makeURI(entry);\n seen.def = { ...seen.schema };\n // defId won't be set if the schema is a reference to an external schema\n // or if the schema is the root schema\n if (defId)\n seen.defId = defId;\n // wipe away all properties except $ref\n const schema = seen.schema;\n for (const key in schema) {\n delete schema[key];\n }\n schema.$ref = ref;\n };\n // throw on cycles\n // break cycles\n if (ctx.cycles === \"throw\") {\n for (const entry of ctx.seen.entries()) {\n const seen = entry[1];\n if (seen.cycle) {\n throw new Error(\"Cycle detected: \" +\n `#/${seen.cycle?.join(\"/\")}/<root>` +\n '\\n\\nSet the `cycles` parameter to `\"ref\"` to resolve cyclical schemas with defs.');\n }\n }\n }\n // extract schemas into $defs\n for (const entry of ctx.seen.entries()) {\n const seen = entry[1];\n // convert root schema to # $ref\n if (schema === entry[0]) {\n extractToDef(entry); // this has special handling for the root schema\n continue;\n }\n // extract schemas that are in the external registry\n if (ctx.external) {\n const ext = ctx.external.registry.get(entry[0])?.id;\n if (schema !== entry[0] && ext) {\n extractToDef(entry);\n continue;\n }\n }\n // extract schemas with `id` meta\n const id = ctx.metadataRegistry.get(entry[0])?.id;\n if (id) {\n extractToDef(entry);\n continue;\n }\n // break cycles\n if (seen.cycle) {\n // any\n extractToDef(entry);\n continue;\n }\n // extract reused schemas\n if (seen.count > 1) {\n if (ctx.reused === \"ref\") {\n extractToDef(entry);\n // biome-ignore lint:\n continue;\n }\n }\n }\n}\nexport function finalize(ctx, schema) {\n const root = ctx.seen.get(schema);\n if (!root)\n throw new Error(\"Unprocessed schema. This is a bug in Zod.\");\n // flatten refs - inherit properties from parent schemas\n const flattenRef = (zodSchema) => {\n const seen = ctx.seen.get(zodSchema);\n // already processed\n if (seen.ref === null)\n return;\n const schema = seen.def ?? seen.schema;\n const _cached = { ...schema };\n const ref = seen.ref;\n seen.ref = null; // prevent infinite recursion\n if (ref) {\n flattenRef(ref);\n const refSeen = ctx.seen.get(ref);\n const refSchema = refSeen.schema;\n // merge referenced schema into current\n if (refSchema.$ref && (ctx.target === \"draft-07\" \|\| ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\")) {\n // older drafts can't combine $ref with other properties\n schema.allOf = schema.allOf ?? [];\n schema.allOf.push(refSchema);\n }\n else {\n Object.assign(schema, refSchema);\n }\n // restore child's own properties (child wins)\n Object.assign(schema, _cached);\n const isParentRef = zodSchema._zod.parent === ref;\n // For parent chain, child is a refinement - remove parent-only properties\n if (isParentRef) {\n for (const key in schema) {\n if (key === \"$ref\" \|\| key === \"allOf\")\n continue;\n if (!(key in _cached)) {\n delete schema[key];\n }\n }\n }\n // When ref was extracted to $defs, remove properties that match the definition\n if (refSchema.$ref && refSeen.def) {\n for (const key in schema) {\n if (key === \"$ref\" \|\| key === \"allOf\")\n continue;\n if (key in refSeen.def && JSON.stringify(schema[key]) === JSON.stringify(refSeen.def[key])) {\n delete schema[key];\n }\n }\n }\n }\n // If parent was extracted (has $ref), propagate $ref to this schema\n // This handles cases like: readonly().meta({id}).describe()\n // where processor sets ref to innerType but parent should be referenced\n const parent = zodSchema._zod.parent;\n if (parent && parent !== ref) {\n // Ensure parent is processed first so its def has inherited properties\n flattenRef(parent);\n const parentSeen = ctx.seen.get(parent);\n if (parentSeen?.schema.$ref) {\n schema.$ref = parentSeen.schema.$ref;\n // De-duplicate with parent's definition\n if (parentSeen.def) {\n for (const key in schema) {\n if (key === \"$ref\" \|\| key === \"allOf\")\n continue;\n if (key in parentSeen.def && JSON.stringify(schema[key]) === JSON.stringify(parentSeen.def[key])) {\n delete schema[key];\n }\n }\n }\n }\n }\n // execute overrides\n ctx.override({\n zodSchema: zodSchema,\n jsonSchema: schema,\n path: seen.path ?? [],\n });\n };\n for (const entry of [...ctx.seen.entries()].reverse()) {\n flattenRef(entry[0]);\n }\n const result = {};\n if (ctx.target === \"draft-2020-12\") {\n result.$schema = \"https://json-schema.org/draft/2020-12/schema\";\n }\n else if (ctx.target === \"draft-07\") {\n result.$schema = \"http://json-schema.org/draft-07/schema#\";\n }\n else if (ctx.target === \"draft-04\") {\n result.$schema = \"http://json-schema.org/draft-04/schema#\";\n }\n else if (ctx.target === \"openapi-3.0\") {\n // OpenAPI 3.0 schema objects should not include a $schema property\n }\n else {\n // Arbitrary string values are allowed but won't have a $schema property set\n }\n if (ctx.external?.uri) {\n const id = ctx.external.registry.get(schema)?.id;\n if (!id)\n throw new Error(\"Schema is missing an `id` property\");\n result.$id = ctx.external.uri(id);\n }\n Object.assign(result, root.def ?? root.schema);\n // build defs object\n const defs = ctx.external?.defs ?? {};\n for (const entry of ctx.seen.entries()) {\n const seen = entry[1];\n if (seen.def && seen.defId) {\n defs[seen.defId] = seen.def;\n }\n }\n // set definitions in result\n if (ctx.external) {\n }\n else {\n if (Object.keys(defs).length > 0) {\n if (ctx.target === \"draft-2020-12\") {\n result.$defs = defs;\n }\n else {\n result.definitions = defs;\n }\n }\n }\n try {\n // this \"finalizes\" this schema and ensures all cycles are removed\n // each call to finalize() is functionally independent\n // though the seen map is shared\n const finalized = JSON.parse(JSON.stringify(result));\n Object.defineProperty(finalized, \"~standard\", {\n value: {\n ...schema[\"~standard\"],\n jsonSchema: {\n input: createStandardJSONSchemaMethod(schema, \"input\", ctx.processors),\n output: createStandardJSONSchemaMethod(schema, \"output\", ctx.processors),\n },\n },\n enumerable: false,\n writable: false,\n });\n return finalized;\n }\n catch (_err) {\n throw new Error(\"Error converting schema to JSON.\");\n }\n}\nfunction isTransforming(_schema, _ctx) {\n const ctx = _ctx ?? { seen: new Set() };\n if (ctx.seen.has(_schema))\n return false;\n ctx.seen.add(_schema);\n const def = _schema._zod.def;\n if (def.type === \"transform\")\n return true;\n if (def.type === \"array\")\n return isTransforming(def.element, ctx);\n if (def.type === \"set\")\n return isTransforming(def.valueType, ctx);\n if (def.type === \"lazy\")\n return isTransforming(def.getter(), ctx);\n if (def.type === \"promise\" \|\|\n def.type === \"optional\" \|\|\n def.type === \"nonoptional\" \|\|\n def.type === \"nullable\" \|\|\n def.type === \"readonly\" \|\|\n def.type === \"default\" \|\|\n def.type === \"prefault\") {\n return isTransforming(def.innerType, ctx);\n }\n if (def.type === \"intersection\") {\n return isTransforming(def.left, ctx) \|\| isTransforming(def.right, ctx);\n }\n if (def.type === \"record\" \|\| def.type === \"map\") {\n return isTransforming(def.keyType, ctx) \|\| isTransforming(def.valueType, ctx);\n }\n if (def.type === \"pipe\") {\n return isTransforming(def.in, ctx) \|\| isTransforming(def.out, ctx);\n }\n if (def.type === \"object\") {\n for (const key in def.shape) {\n if (isTransforming(def.shape[key], ctx))\n return true;\n }\n return false;\n }\n if (def.type === \"union\") {\n for (const option of def.options) {\n if (isTransforming(option, ctx))\n return true;\n }\n return false;\n }\n if (def.type === \"tuple\") {\n for (const item of def.items) {\n if (isTransforming(item, ctx))\n return true;\n }\n if (def.rest && isTransforming(def.rest, ctx))\n return true;\n return false;\n }\n return false;\n}\n/\n Creates a toJSONSchema method for a schema instance.\n * This encapsulates the logic of initializing context, processing, extracting defs, and finalizing.\n /\nexport const createToJSONSchemaMethod = (schema, processors = {}) => (params) => {\n const ctx = initializeContext({ ...params, processors });\n process(schema, ctx);\n extractDefs(ctx, schema);\n return finalize(ctx, schema);\n};\nexport const createStandardJSONSchemaMethod = (schema, io, processors = {}) => (params) => {\n const { libraryOptions, target } = params ?? {};\n const ctx = initializeContext({ ...(libraryOptions ?? {}), target, io, processors });\n process(schema, ctx);\n extractDefs(ctx, schema);\n return finalize(ctx, schema);\n};\n","import { extractDefs, finalize, initializeContext, process, } from \"./to-json-schema.js\";\nimport { getEnumValues } from \"./util.js\";\nconst formatMap = {\n guid: \"uuid\",\n url: \"uri\",\n datetime: \"date-time\",\n json_string: \"json-string\",\n regex: \"\", // do not set\n};\n// ==================== SIMPLE TYPE PROCESSORS ====================\nexport const stringProcessor = (schema, ctx, _json, _params) => {\n const json = _json;\n json.type = \"string\";\n const { minimum, maximum, format, patterns, contentEncoding } = schema._zod\n .bag;\n if (typeof minimum === \"number\")\n json.minLength = minimum;\n if (typeof maximum === \"number\")\n json.maxLength = maximum;\n // custom pattern overrides format\n if (format) {\n json.format = formatMap[format] ?? format;\n if (json.format === \"\")\n delete json.format; // empty format is not valid\n // JSON Schema format: \"time\" requires a full time with offset or Z\n // z.iso.time() does not include timezone information, so format: \"time\" should never be used\n if (format === \"time\") {\n delete json.format;\n }\n }\n if (contentEncoding)\n json.contentEncoding = contentEncoding;\n if (patterns && patterns.size > 0) {\n const regexes = [...patterns];\n if (regexes.length === 1)\n json.pattern = regexes[0].source;\n else if (regexes.length > 1) {\n json.allOf = [\n ...regexes.map((regex) => ({\n ...(ctx.target === \"draft-07\" \|\| ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\"\n ? { type: \"string\" }\n : {}),\n pattern: regex.source,\n })),\n ];\n }\n }\n};\nexport const numberProcessor = (schema, ctx, _json, _params) => {\n const json = _json;\n const { minimum, maximum, format, multipleOf, exclusiveMaximum, exclusiveMinimum } = schema._zod.bag;\n if (typeof format === \"string\" && format.includes(\"int\"))\n json.type = \"integer\";\n else\n json.type = \"number\";\n if (typeof exclusiveMinimum === \"number\") {\n if (ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\") {\n json.minimum = exclusiveMinimum;\n json.exclusiveMinimum = true;\n }\n else {\n json.exclusiveMinimum = exclusiveMinimum;\n }\n }\n if (typeof minimum === \"number\") {\n json.minimum = minimum;\n if (typeof exclusiveMinimum === \"number\" && ctx.target !== \"draft-04\") {\n if (exclusiveMinimum >= minimum)\n delete json.minimum;\n else\n delete json.exclusiveMinimum;\n }\n }\n if (typeof exclusiveMaximum === \"number\") {\n if (ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\") {\n json.maximum = exclusiveMaximum;\n json.exclusiveMaximum = true;\n }\n else {\n json.exclusiveMaximum = exclusiveMaximum;\n }\n }\n if (typeof maximum === \"number\") {\n json.maximum = maximum;\n if (typeof exclusiveMaximum === \"number\" && ctx.target !== \"draft-04\") {\n if (exclusiveMaximum <= maximum)\n delete json.maximum;\n else\n delete json.exclusiveMaximum;\n }\n }\n if (typeof multipleOf === \"number\")\n json.multipleOf = multipleOf;\n};\nexport const booleanProcessor = (_schema, _ctx, json, _params) => {\n json.type = \"boolean\";\n};\nexport const bigintProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"BigInt cannot be represented in JSON Schema\");\n }\n};\nexport const symbolProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Symbols cannot be represented in JSON Schema\");\n }\n};\nexport const nullProcessor = (_schema, ctx, json, _params) => {\n if (ctx.target === \"openapi-3.0\") {\n json.type = \"string\";\n json.nullable = true;\n json.enum = [null];\n }\n else {\n json.type = \"null\";\n }\n};\nexport const undefinedProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Undefined cannot be represented in JSON Schema\");\n }\n};\nexport const voidProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Void cannot be represented in JSON Schema\");\n }\n};\nexport const neverProcessor = (_schema, _ctx, json, _params) => {\n json.not = {};\n};\nexport const anyProcessor = (_schema, _ctx, _json, _params) => {\n // empty schema accepts anything\n};\nexport const unknownProcessor = (_schema, _ctx, _json, _params) => {\n // empty schema accepts anything\n};\nexport const dateProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Date cannot be represented in JSON Schema\");\n }\n};\nexport const enumProcessor = (schema, _ctx, json, _params) => {\n const def = schema._zod.def;\n const values = getEnumValues(def.entries);\n // Number enums can have both string and number values\n if (values.every((v) => typeof v === \"number\"))\n json.type = \"number\";\n if (values.every((v) => typeof v === \"string\"))\n json.type = \"string\";\n json.enum = values;\n};\nexport const literalProcessor = (schema, ctx, json, _params) => {\n const def = schema._zod.def;\n const vals = [];\n for (const val of def.values) {\n if (val === undefined) {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Literal `undefined` cannot be represented in JSON Schema\");\n }\n else {\n // do not add to vals\n }\n }\n else if (typeof val === \"bigint\") {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"BigInt literals cannot be represented in JSON Schema\");\n }\n else {\n vals.push(Number(val));\n }\n }\n else {\n vals.push(val);\n }\n }\n if (vals.length === 0) {\n // do nothing (an undefined literal was stripped)\n }\n else if (vals.length === 1) {\n const val = vals[0];\n json.type = val === null ? \"null\" : typeof val;\n if (ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\") {\n json.enum = [val];\n }\n else {\n json.const = val;\n }\n }\n else {\n if (vals.every((v) => typeof v === \"number\"))\n json.type = \"number\";\n if (vals.every((v) => typeof v === \"string\"))\n json.type = \"string\";\n if (vals.every((v) => typeof v === \"boolean\"))\n json.type = \"boolean\";\n if (vals.every((v) => v === null))\n json.type = \"null\";\n json.enum = vals;\n }\n};\nexport const nanProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"NaN cannot be represented in JSON Schema\");\n }\n};\nexport const templateLiteralProcessor = (schema, _ctx, json, _params) => {\n const _json = json;\n const pattern = schema._zod.pattern;\n if (!pattern)\n throw new Error(\"Pattern not found in template literal\");\n _json.type = \"string\";\n _json.pattern = pattern.source;\n};\nexport const fileProcessor = (schema, _ctx, json, _params) => {\n const _json = json;\n const file = {\n type: \"string\",\n format: \"binary\",\n contentEncoding: \"binary\",\n };\n const { minimum, maximum, mime } = schema._zod.bag;\n if (minimum !== undefined)\n file.minLength = minimum;\n if (maximum !== undefined)\n file.maxLength = maximum;\n if (mime) {\n if (mime.length === 1) {\n file.contentMediaType = mime[0];\n Object.assign(_json, file);\n }\n else {\n Object.assign(_json, file); // shared props at root\n _json.anyOf = mime.map((m) => ({ contentMediaType: m })); // only contentMediaType differs\n }\n }\n else {\n Object.assign(_json, file);\n }\n};\nexport const successProcessor = (_schema, _ctx, json, _params) => {\n json.type = \"boolean\";\n};\nexport const customProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Custom types cannot be represented in JSON Schema\");\n }\n};\nexport const functionProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Function types cannot be represented in JSON Schema\");\n }\n};\nexport const transformProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Transforms cannot be represented in JSON Schema\");\n }\n};\nexport const mapProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Map cannot be represented in JSON Schema\");\n }\n};\nexport const setProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Set cannot be represented in JSON Schema\");\n }\n};\n// ==================== COMPOSITE TYPE PROCESSORS ====================\nexport const arrayProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n const { minimum, maximum } = schema._zod.bag;\n if (typeof minimum === \"number\")\n json.minItems = minimum;\n if (typeof maximum === \"number\")\n json.maxItems = maximum;\n json.type = \"array\";\n json.items = process(def.element, ctx, { ...params, path: [...params.path, \"items\"] });\n};\nexport const objectProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n json.type = \"object\";\n json.properties = {};\n const shape = def.shape;\n for (const key in shape) {\n json.properties[key] = process(shape[key], ctx, {\n ...params,\n path: [...params.path, \"properties\", key],\n });\n }\n // required keys\n const allKeys = new Set(Object.keys(shape));\n const requiredKeys = new Set([...allKeys].filter((key) => {\n const v = def.shape[key]._zod;\n if (ctx.io === \"input\") {\n return v.optin === undefined;\n }\n else {\n return v.optout === undefined;\n }\n }));\n if (requiredKeys.size > 0) {\n json.required = Array.from(requiredKeys);\n }\n // catchall\n if (def.catchall?._zod.def.type === \"never\") {\n // strict\n json.additionalProperties = false;\n }\n else if (!def.catchall) {\n // regular\n if (ctx.io === \"output\")\n json.additionalProperties = false;\n }\n else if (def.catchall) {\n json.additionalProperties = process(def.catchall, ctx, {\n ...params,\n path: [...params.path, \"additionalProperties\"],\n });\n }\n};\nexport const unionProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n // Exclusive unions (inclusive === false) use oneOf (exactly one match) instead of anyOf (one or more matches)\n // This includes both z.xor() and discriminated unions\n const isExclusive = def.inclusive === false;\n const options = def.options.map((x, i) => process(x, ctx, {\n ...params,\n path: [...params.path, isExclusive ? \"oneOf\" : \"anyOf\", i],\n }));\n if (isExclusive) {\n json.oneOf = options;\n }\n else {\n json.anyOf = options;\n }\n};\nexport const intersectionProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n const a = process(def.left, ctx, {\n ...params,\n path: [...params.path, \"allOf\", 0],\n });\n const b = process(def.right, ctx, {\n ...params,\n path: [...params.path, \"allOf\", 1],\n });\n const isSimpleIntersection = (val) => \"allOf\" in val && Object.keys(val).length === 1;\n const allOf = [\n ...(isSimpleIntersection(a) ? a.allOf : [a]),\n ...(isSimpleIntersection(b) ? b.allOf : [b]),\n ];\n json.allOf = allOf;\n};\nexport const tupleProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n json.type = \"array\";\n const prefixPath = ctx.target === \"draft-2020-12\" ? \"prefixItems\" : \"items\";\n const restPath = ctx.target === \"draft-2020-12\" ? \"items\" : ctx.target === \"openapi-3.0\" ? \"items\" : \"additionalItems\";\n const prefixItems = def.items.map((x, i) => process(x, ctx, {\n ...params,\n path: [...params.path, prefixPath, i],\n }));\n const rest = def.rest\n ? process(def.rest, ctx, {\n ...params,\n path: [...params.path, restPath, ...(ctx.target === \"openapi-3.0\" ? [def.items.length] : [])],\n })\n : null;\n if (ctx.target === \"draft-2020-12\") {\n json.prefixItems = prefixItems;\n if (rest) {\n json.items = rest;\n }\n }\n else if (ctx.target === \"openapi-3.0\") {\n json.items = {\n anyOf: prefixItems,\n };\n if (rest) {\n json.items.anyOf.push(rest);\n }\n json.minItems = prefixItems.length;\n if (!rest) {\n json.maxItems = prefixItems.length;\n }\n }\n else {\n json.items = prefixItems;\n if (rest) {\n json.additionalItems = rest;\n }\n }\n // length\n const { minimum, maximum } = schema._zod.bag;\n if (typeof minimum === \"number\")\n json.minItems = minimum;\n if (typeof maximum === \"number\")\n json.maxItems = maximum;\n};\nexport const recordProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n json.type = \"object\";\n // For looseRecord with regex patterns, use patternProperties\n // This correctly represents \"only validate keys matching the pattern\" semantics\n // and composes well with allOf (intersections)\n const keyType = def.keyType;\n const keyBag = keyType._zod.bag;\n const patterns = keyBag?.patterns;\n if (def.mode === \"loose\" && patterns && patterns.size > 0) {\n // Use patternProperties for looseRecord with regex patterns\n const valueSchema = process(def.valueType, ctx, {\n ...params,\n path: [...params.path, \"patternProperties\", \"\"],\n });\n json.patternProperties = {};\n for (const pattern of patterns) {\n json.patternProperties[pattern.source] = valueSchema;\n }\n }\n else {\n // Default behavior: use propertyNames + additionalProperties\n if (ctx.target === \"draft-07\" \|\| ctx.target === \"draft-2020-12\") {\n json.propertyNames = process(def.keyType, ctx, {\n ...params,\n path: [...params.path, \"propertyNames\"],\n });\n }\n json.additionalProperties = process(def.valueType, ctx, {\n ...params,\n path: [...params.path, \"additionalProperties\"],\n });\n }\n // Add required for keys with discrete values (enum, literal, etc.)\n const keyValues = keyType._zod.values;\n if (keyValues) {\n const validKeyValues = [...keyValues].filter((v) => typeof v === \"string\" \|\| typeof v === \"number\");\n if (validKeyValues.length > 0) {\n json.required = validKeyValues;\n }\n }\n};\nexport const nullableProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n const inner = process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n if (ctx.target === \"openapi-3.0\") {\n seen.ref = def.innerType;\n json.nullable = true;\n }\n else {\n json.anyOf = [inner, { type: \"null\" }];\n }\n};\nexport const nonoptionalProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n};\nexport const defaultProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n json.default = JSON.parse(JSON.stringify(def.defaultValue));\n};\nexport const prefaultProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n if (ctx.io === \"input\")\n json._prefault = JSON.parse(JSON.stringify(def.defaultValue));\n};\nexport const catchProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n let catchValue;\n try {\n catchValue = def.catchValue(undefined);\n }\n catch {\n throw new Error(\"Dynamic catch values are not supported in JSON Schema\");\n }\n json.default = catchValue;\n};\nexport const pipeProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n const innerType = ctx.io === \"input\" ? (def.in._zod.def.type === \"transform\" ? def.out : def.in) : def.out;\n process(innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = innerType;\n};\nexport const readonlyProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n json.readOnly = true;\n};\nexport const promiseProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n};\nexport const optionalProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n};\nexport const lazyProcessor = (schema, ctx, _json, params) => {\n const innerType = schema._zod.innerType;\n process(innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = innerType;\n};\n// ==================== ALL PROCESSORS ====================\nexport const allProcessors = {\n string: stringProcessor,\n number: numberProcessor,\n boolean: booleanProcessor,\n bigint: bigintProcessor,\n symbol: symbolProcessor,\n null: nullProcessor,\n undefined: undefinedProcessor,\n void: voidProcessor,\n never: neverProcessor,\n any: anyProcessor,\n unknown: unknownProcessor,\n date: dateProcessor,\n enum: enumProcessor,\n literal: literalProcessor,\n nan: nanProcessor,\n template_literal: templateLiteralProcessor,\n file: fileProcessor,\n success: successProcessor,\n custom: customProcessor,\n function: functionProcessor,\n transform: transformProcessor,\n map: mapProcessor,\n set: setProcessor,\n array: arrayProcessor,\n object: objectProcessor,\n union: unionProcessor,\n intersection: intersectionProcessor,\n tuple: tupleProcessor,\n record: recordProcessor,\n nullable: nullableProcessor,\n nonoptional: nonoptionalProcessor,\n default: defaultProcessor,\n prefault: prefaultProcessor,\n catch: catchProcessor,\n pipe: pipeProcessor,\n readonly: readonlyProcessor,\n promise: promiseProcessor,\n optional: optionalProcessor,\n lazy: lazyProcessor,\n};\nexport function toJSONSchema(input, params) {\n if (\"_idmap\" in input) {\n // Registry case\n const registry = input;\n const ctx = initializeContext({ ...params, processors: allProcessors });\n const defs = {};\n // First pass: process all schemas to build the seen map\n for (const entry of registry._idmap.entries()) {\n const [_, schema] = entry;\n process(schema, ctx);\n }\n const schemas = {};\n const external = {\n registry,\n uri: params?.uri,\n defs,\n };\n // Update the context with external configuration\n ctx.external = external;\n // Second pass: emit each schema\n for (const entry of registry._idmap.entries()) {\n const [key, schema] = entry;\n extractDefs(ctx, schema);\n schemas[key] = finalize(ctx, schema);\n }\n if (Object.keys(defs).length > 0) {\n const defsSegment = ctx.target === \"draft-2020-12\" ? \"$defs\" : \"definitions\";\n schemas.__shared = {\n [defsSegment]: defs,\n };\n }\n return { schemas };\n }\n // Single schema case\n const ctx = initializeContext({ ...params, processors: allProcessors });\n process(input, ctx);\n extractDefs(ctx, input);\n return finalize(ctx, input);\n}\n","import * as core from \"../core/index.js\";\nimport * as schemas from \"./schemas.js\";\nexport const ZodISODateTime = /@__PURE__/ core.$constructor(\"ZodISODateTime\", (inst, def) => {\n core.$ZodISODateTime.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function datetime(params) {\n return core._isoDateTime(ZodISODateTime, params);\n}\nexport const ZodISODate = /@__PURE__/ core.$constructor(\"ZodISODate\", (inst, def) => {\n core.$ZodISODate.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function date(params) {\n return core._isoDate(ZodISODate, params);\n}\nexport const ZodISOTime = /@__PURE__/ core.$constructor(\"ZodISOTime\", (inst, def) => {\n core.$ZodISOTime.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function time(params) {\n return core._isoTime(ZodISOTime, params);\n}\nexport const ZodISODuration = /@__PURE__/ core.$constructor(\"ZodISODuration\", (inst, def) => {\n core.$ZodISODuration.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function duration(params) {\n return core._isoDuration(ZodISODuration, params);\n}\n","import * as core from \"../core/index.js\";\nimport { $ZodError } from \"../core/index.js\";\nimport * as util from \"../core/util.js\";\nconst initializer = (inst, issues) => {\n $ZodError.init(inst, issues);\n inst.name = \"ZodError\";\n Object.defineProperties(inst, {\n format: {\n value: (mapper) => core.formatError(inst, mapper),\n // enumerable: false,\n },\n flatten: {\n value: (mapper) => core.flattenError(inst, mapper),\n // enumerable: false,\n },\n addIssue: {\n value: (issue) => {\n inst.issues.push(issue);\n inst.message = JSON.stringify(inst.issues, util.jsonStringifyReplacer, 2);\n },\n // enumerable: false,\n },\n addIssues: {\n value: (issues) => {\n inst.issues.push(...issues);\n inst.message = JSON.stringify(inst.issues, util.jsonStringifyReplacer, 2);\n },\n // enumerable: false,\n },\n isEmpty: {\n get() {\n return inst.issues.length === 0;\n },\n // enumerable: false,\n },\n });\n // Object.defineProperty(inst, \"isEmpty\", {\n // get() {\n // return inst.issues.length === 0;\n // },\n // });\n};\nexport const ZodError = core.$constructor(\"ZodError\", initializer);\nexport const ZodRealError = core.$constructor(\"ZodError\", initializer, {\n Parent: Error,\n});\n// /** @deprecated Use `z.core.$ZodErrorMapCtx` instead. /\n// export type ErrorMapCtx = core.$ZodErrorMapCtx;\n","import as core from \"../core/index.js\";\nimport { ZodRealError } from \"./errors.js\";\nexport const parse = /* @__PURE__ / core._parse(ZodRealError);\nexport const parseAsync = / @__PURE__ / core._parseAsync(ZodRealError);\nexport const safeParse = / @__PURE__ / core._safeParse(ZodRealError);\nexport const safeParseAsync = / @__PURE__ / core._safeParseAsync(ZodRealError);\n// Codec functions\nexport const encode = / @__PURE__ / core._encode(ZodRealError);\nexport const decode = / @__PURE__ / core._decode(ZodRealError);\nexport const encodeAsync = / @__PURE__ / core._encodeAsync(ZodRealError);\nexport const decodeAsync = / @__PURE__ / core._decodeAsync(ZodRealError);\nexport const safeEncode = / @__PURE__ / core._safeEncode(ZodRealError);\nexport const safeDecode = / @__PURE__ / core._safeDecode(ZodRealError);\nexport const safeEncodeAsync = / @__PURE__ / core._safeEncodeAsync(ZodRealError);\nexport const safeDecodeAsync = / @__PURE__ / core._safeDecodeAsync(ZodRealError);\n","import as core from \"../core/index.js\";\nimport { util } from \"../core/index.js\";\nimport * as processors from \"../core/json-schema-processors.js\";\nimport { createStandardJSONSchemaMethod, createToJSONSchemaMethod } from \"../core/to-json-schema.js\";\nimport * as checks from \"./checks.js\";\nimport * as iso from \"./iso.js\";\nimport * as parse from \"./parse.js\";\nexport const ZodType = /@__PURE__/ core.$constructor(\"ZodType\", (inst, def) => {\n core.$ZodType.init(inst, def);\n Object.assign(inst[\"~standard\"], {\n jsonSchema: {\n input: createStandardJSONSchemaMethod(inst, \"input\"),\n output: createStandardJSONSchemaMethod(inst, \"output\"),\n },\n });\n inst.toJSONSchema = createToJSONSchemaMethod(inst, {});\n inst.def = def;\n inst.type = def.type;\n Object.defineProperty(inst, \"_def\", { value: def });\n // base methods\n inst.check = (...checks) => {\n return inst.clone(util.mergeDefs(def, {\n checks: [\n ...(def.checks ?? []),\n ...checks.map((ch) => typeof ch === \"function\" ? { _zod: { check: ch, def: { check: \"custom\" }, onattach: [] } } : ch),\n ],\n }), {\n parent: true,\n });\n };\n inst.with = inst.check;\n inst.clone = (def, params) => core.clone(inst, def, params);\n inst.brand = () => inst;\n inst.register = ((reg, meta) => {\n reg.add(inst, meta);\n return inst;\n });\n // parsing\n inst.parse = (data, params) => parse.parse(inst, data, params, { callee: inst.parse });\n inst.safeParse = (data, params) => parse.safeParse(inst, data, params);\n inst.parseAsync = async (data, params) => parse.parseAsync(inst, data, params, { callee: inst.parseAsync });\n inst.safeParseAsync = async (data, params) => parse.safeParseAsync(inst, data, params);\n inst.spa = inst.safeParseAsync;\n // encoding/decoding\n inst.encode = (data, params) => parse.encode(inst, data, params);\n inst.decode = (data, params) => parse.decode(inst, data, params);\n inst.encodeAsync = async (data, params) => parse.encodeAsync(inst, data, params);\n inst.decodeAsync = async (data, params) => parse.decodeAsync(inst, data, params);\n inst.safeEncode = (data, params) => parse.safeEncode(inst, data, params);\n inst.safeDecode = (data, params) => parse.safeDecode(inst, data, params);\n inst.safeEncodeAsync = async (data, params) => parse.safeEncodeAsync(inst, data, params);\n inst.safeDecodeAsync = async (data, params) => parse.safeDecodeAsync(inst, data, params);\n // refinements\n inst.refine = (check, params) => inst.check(refine(check, params));\n inst.superRefine = (refinement) => inst.check(superRefine(refinement));\n inst.overwrite = (fn) => inst.check(checks.overwrite(fn));\n // wrappers\n inst.optional = () => optional(inst);\n inst.exactOptional = () => exactOptional(inst);\n inst.nullable = () => nullable(inst);\n inst.nullish = () => optional(nullable(inst));\n inst.nonoptional = (params) => nonoptional(inst, params);\n inst.array = () => array(inst);\n inst.or = (arg) => union([inst, arg]);\n inst.and = (arg) => intersection(inst, arg);\n inst.transform = (tx) => pipe(inst, transform(tx));\n inst.default = (def) => _default(inst, def);\n inst.prefault = (def) => prefault(inst, def);\n // inst.coalesce = (def, params) => coalesce(inst, def, params);\n inst.catch = (params) => _catch(inst, params);\n inst.pipe = (target) => pipe(inst, target);\n inst.readonly = () => readonly(inst);\n // meta\n inst.describe = (description) => {\n const cl = inst.clone();\n core.globalRegistry.add(cl, { description });\n return cl;\n };\n Object.defineProperty(inst, \"description\", {\n get() {\n return core.globalRegistry.get(inst)?.description;\n },\n configurable: true,\n });\n inst.meta = (...args) => {\n if (args.length === 0) {\n return core.globalRegistry.get(inst);\n }\n const cl = inst.clone();\n core.globalRegistry.add(cl, args[0]);\n return cl;\n };\n // helpers\n inst.isOptional = () => inst.safeParse(undefined).success;\n inst.isNullable = () => inst.safeParse(null).success;\n inst.apply = (fn) => fn(inst);\n return inst;\n});\n/** @internal /\nexport const _ZodString = /@__PURE__/ core.$constructor(\"_ZodString\", (inst, def) => {\n core.$ZodString.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.stringProcessor(inst, ctx, json, params);\n const bag = inst._zod.bag;\n inst.format = bag.format ?? null;\n inst.minLength = bag.minimum ?? null;\n inst.maxLength = bag.maximum ?? null;\n // validations\n inst.regex = (...args) => inst.check(checks.regex(...args));\n inst.includes = (...args) => inst.check(checks.includes(...args));\n inst.startsWith = (...args) => inst.check(checks.startsWith(...args));\n inst.endsWith = (...args) => inst.check(checks.endsWith(...args));\n inst.min = (...args) => inst.check(checks.minLength(...args));\n inst.max = (...args) => inst.check(checks.maxLength(...args));\n inst.length = (...args) => inst.check(checks.length(...args));\n inst.nonempty = (...args) => inst.check(checks.minLength(1, ...args));\n inst.lowercase = (params) => inst.check(checks.lowercase(params));\n inst.uppercase = (params) => inst.check(checks.uppercase(params));\n // transforms\n inst.trim = () => inst.check(checks.trim());\n inst.normalize = (...args) => inst.check(checks.normalize(...args));\n inst.toLowerCase = () => inst.check(checks.toLowerCase());\n inst.toUpperCase = () => inst.check(checks.toUpperCase());\n inst.slugify = () => inst.check(checks.slugify());\n});\nexport const ZodString = /@__PURE__/ core.$constructor(\"ZodString\", (inst, def) => {\n core.$ZodString.init(inst, def);\n _ZodString.init(inst, def);\n inst.email = (params) => inst.check(core._email(ZodEmail, params));\n inst.url = (params) => inst.check(core._url(ZodURL, params));\n inst.jwt = (params) => inst.check(core._jwt(ZodJWT, params));\n inst.emoji = (params) => inst.check(core._emoji(ZodEmoji, params));\n inst.guid = (params) => inst.check(core._guid(ZodGUID, params));\n inst.uuid = (params) => inst.check(core._uuid(ZodUUID, params));\n inst.uuidv4 = (params) => inst.check(core._uuidv4(ZodUUID, params));\n inst.uuidv6 = (params) => inst.check(core._uuidv6(ZodUUID, params));\n inst.uuidv7 = (params) => inst.check(core._uuidv7(ZodUUID, params));\n inst.nanoid = (params) => inst.check(core._nanoid(ZodNanoID, params));\n inst.guid = (params) => inst.check(core._guid(ZodGUID, params));\n inst.cuid = (params) => inst.check(core._cuid(ZodCUID, params));\n inst.cuid2 = (params) => inst.check(core._cuid2(ZodCUID2, params));\n inst.ulid = (params) => inst.check(core._ulid(ZodULID, params));\n inst.base64 = (params) => inst.check(core._base64(ZodBase64, params));\n inst.base64url = (params) => inst.check(core._base64url(ZodBase64URL, params));\n inst.xid = (params) => inst.check(core._xid(ZodXID, params));\n inst.ksuid = (params) => inst.check(core._ksuid(ZodKSUID, params));\n inst.ipv4 = (params) => inst.check(core._ipv4(ZodIPv4, params));\n inst.ipv6 = (params) => inst.check(core._ipv6(ZodIPv6, params));\n inst.cidrv4 = (params) => inst.check(core._cidrv4(ZodCIDRv4, params));\n inst.cidrv6 = (params) => inst.check(core._cidrv6(ZodCIDRv6, params));\n inst.e164 = (params) => inst.check(core._e164(ZodE164, params));\n // iso\n inst.datetime = (params) => inst.check(iso.datetime(params));\n inst.date = (params) => inst.check(iso.date(params));\n inst.time = (params) => inst.check(iso.time(params));\n inst.duration = (params) => inst.check(iso.duration(params));\n});\nexport function string(params) {\n return core._string(ZodString, params);\n}\nexport const ZodStringFormat = /@__PURE__/ core.$constructor(\"ZodStringFormat\", (inst, def) => {\n core.$ZodStringFormat.init(inst, def);\n _ZodString.init(inst, def);\n});\nexport const ZodEmail = /@__PURE__/ core.$constructor(\"ZodEmail\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodEmail.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function email(params) {\n return core._email(ZodEmail, params);\n}\nexport const ZodGUID = /@__PURE__/ core.$constructor(\"ZodGUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodGUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function guid(params) {\n return core._guid(ZodGUID, params);\n}\nexport const ZodUUID = /@__PURE__/ core.$constructor(\"ZodUUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodUUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function uuid(params) {\n return core._uuid(ZodUUID, params);\n}\nexport function uuidv4(params) {\n return core._uuidv4(ZodUUID, params);\n}\n// ZodUUIDv6\nexport function uuidv6(params) {\n return core._uuidv6(ZodUUID, params);\n}\n// ZodUUIDv7\nexport function uuidv7(params) {\n return core._uuidv7(ZodUUID, params);\n}\nexport const ZodURL = /@__PURE__/ core.$constructor(\"ZodURL\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodURL.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function url(params) {\n return core._url(ZodURL, params);\n}\nexport function httpUrl(params) {\n return core._url(ZodURL, {\n protocol: /^https?$/,\n hostname: core.regexes.domain,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodEmoji = /@__PURE__/ core.$constructor(\"ZodEmoji\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodEmoji.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function emoji(params) {\n return core._emoji(ZodEmoji, params);\n}\nexport const ZodNanoID = /@__PURE__/ core.$constructor(\"ZodNanoID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodNanoID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function nanoid(params) {\n return core._nanoid(ZodNanoID, params);\n}\nexport const ZodCUID = /@__PURE__/ core.$constructor(\"ZodCUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodCUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cuid(params) {\n return core._cuid(ZodCUID, params);\n}\nexport const ZodCUID2 = /@__PURE__/ core.$constructor(\"ZodCUID2\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodCUID2.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cuid2(params) {\n return core._cuid2(ZodCUID2, params);\n}\nexport const ZodULID = /@__PURE__/ core.$constructor(\"ZodULID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodULID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ulid(params) {\n return core._ulid(ZodULID, params);\n}\nexport const ZodXID = /@__PURE__/ core.$constructor(\"ZodXID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodXID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function xid(params) {\n return core._xid(ZodXID, params);\n}\nexport const ZodKSUID = /@__PURE__/ core.$constructor(\"ZodKSUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodKSUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ksuid(params) {\n return core._ksuid(ZodKSUID, params);\n}\nexport const ZodIPv4 = /@__PURE__/ core.$constructor(\"ZodIPv4\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodIPv4.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ipv4(params) {\n return core._ipv4(ZodIPv4, params);\n}\nexport const ZodMAC = /@__PURE__/ core.$constructor(\"ZodMAC\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodMAC.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function mac(params) {\n return core._mac(ZodMAC, params);\n}\nexport const ZodIPv6 = /@__PURE__/ core.$constructor(\"ZodIPv6\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodIPv6.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ipv6(params) {\n return core._ipv6(ZodIPv6, params);\n}\nexport const ZodCIDRv4 = /@__PURE__/ core.$constructor(\"ZodCIDRv4\", (inst, def) => {\n core.$ZodCIDRv4.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cidrv4(params) {\n return core._cidrv4(ZodCIDRv4, params);\n}\nexport const ZodCIDRv6 = /@__PURE__/ core.$constructor(\"ZodCIDRv6\", (inst, def) => {\n core.$ZodCIDRv6.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cidrv6(params) {\n return core._cidrv6(ZodCIDRv6, params);\n}\nexport const ZodBase64 = /@__PURE__/ core.$constructor(\"ZodBase64\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodBase64.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function base64(params) {\n return core._base64(ZodBase64, params);\n}\nexport const ZodBase64URL = /@__PURE__/ core.$constructor(\"ZodBase64URL\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodBase64URL.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function base64url(params) {\n return core._base64url(ZodBase64URL, params);\n}\nexport const ZodE164 = /@__PURE__/ core.$constructor(\"ZodE164\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodE164.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function e164(params) {\n return core._e164(ZodE164, params);\n}\nexport const ZodJWT = /@__PURE__/ core.$constructor(\"ZodJWT\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodJWT.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function jwt(params) {\n return core._jwt(ZodJWT, params);\n}\nexport const ZodCustomStringFormat = /@__PURE__/ core.$constructor(\"ZodCustomStringFormat\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodCustomStringFormat.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function stringFormat(format, fnOrRegex, _params = {}) {\n return core._stringFormat(ZodCustomStringFormat, format, fnOrRegex, _params);\n}\nexport function hostname(_params) {\n return core._stringFormat(ZodCustomStringFormat, \"hostname\", core.regexes.hostname, _params);\n}\nexport function hex(_params) {\n return core._stringFormat(ZodCustomStringFormat, \"hex\", core.regexes.hex, _params);\n}\nexport function hash(alg, params) {\n const enc = params?.enc ?? \"hex\";\n const format = `${alg}_${enc}`;\n const regex = core.regexes[format];\n if (!regex)\n throw new Error(`Unrecognized hash format: ${format}`);\n return core._stringFormat(ZodCustomStringFormat, format, regex, params);\n}\nexport const ZodNumber = /@__PURE__/ core.$constructor(\"ZodNumber\", (inst, def) => {\n core.$ZodNumber.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.numberProcessor(inst, ctx, json, params);\n inst.gt = (value, params) => inst.check(checks.gt(value, params));\n inst.gte = (value, params) => inst.check(checks.gte(value, params));\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.lt = (value, params) => inst.check(checks.lt(value, params));\n inst.lte = (value, params) => inst.check(checks.lte(value, params));\n inst.max = (value, params) => inst.check(checks.lte(value, params));\n inst.int = (params) => inst.check(int(params));\n inst.safe = (params) => inst.check(int(params));\n inst.positive = (params) => inst.check(checks.gt(0, params));\n inst.nonnegative = (params) => inst.check(checks.gte(0, params));\n inst.negative = (params) => inst.check(checks.lt(0, params));\n inst.nonpositive = (params) => inst.check(checks.lte(0, params));\n inst.multipleOf = (value, params) => inst.check(checks.multipleOf(value, params));\n inst.step = (value, params) => inst.check(checks.multipleOf(value, params));\n // inst.finite = (params) => inst.check(core.finite(params));\n inst.finite = () => inst;\n const bag = inst._zod.bag;\n inst.minValue =\n Math.max(bag.minimum ?? Number.NEGATIVE_INFINITY, bag.exclusiveMinimum ?? Number.NEGATIVE_INFINITY) ?? null;\n inst.maxValue =\n Math.min(bag.maximum ?? Number.POSITIVE_INFINITY, bag.exclusiveMaximum ?? Number.POSITIVE_INFINITY) ?? null;\n inst.isInt = (bag.format ?? \"\").includes(\"int\") \|\| Number.isSafeInteger(bag.multipleOf ?? 0.5);\n inst.isFinite = true;\n inst.format = bag.format ?? null;\n});\nexport function number(params) {\n return core._number(ZodNumber, params);\n}\nexport const ZodNumberFormat = /@__PURE__/ core.$constructor(\"ZodNumberFormat\", (inst, def) => {\n core.$ZodNumberFormat.init(inst, def);\n ZodNumber.init(inst, def);\n});\nexport function int(params) {\n return core._int(ZodNumberFormat, params);\n}\nexport function float32(params) {\n return core._float32(ZodNumberFormat, params);\n}\nexport function float64(params) {\n return core._float64(ZodNumberFormat, params);\n}\nexport function int32(params) {\n return core._int32(ZodNumberFormat, params);\n}\nexport function uint32(params) {\n return core._uint32(ZodNumberFormat, params);\n}\nexport const ZodBoolean = /@__PURE__/ core.$constructor(\"ZodBoolean\", (inst, def) => {\n core.$ZodBoolean.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.booleanProcessor(inst, ctx, json, params);\n});\nexport function boolean(params) {\n return core._boolean(ZodBoolean, params);\n}\nexport const ZodBigInt = /@__PURE__/ core.$constructor(\"ZodBigInt\", (inst, def) => {\n core.$ZodBigInt.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.bigintProcessor(inst, ctx, json, params);\n inst.gte = (value, params) => inst.check(checks.gte(value, params));\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.gt = (value, params) => inst.check(checks.gt(value, params));\n inst.gte = (value, params) => inst.check(checks.gte(value, params));\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.lt = (value, params) => inst.check(checks.lt(value, params));\n inst.lte = (value, params) => inst.check(checks.lte(value, params));\n inst.max = (value, params) => inst.check(checks.lte(value, params));\n inst.positive = (params) => inst.check(checks.gt(BigInt(0), params));\n inst.negative = (params) => inst.check(checks.lt(BigInt(0), params));\n inst.nonpositive = (params) => inst.check(checks.lte(BigInt(0), params));\n inst.nonnegative = (params) => inst.check(checks.gte(BigInt(0), params));\n inst.multipleOf = (value, params) => inst.check(checks.multipleOf(value, params));\n const bag = inst._zod.bag;\n inst.minValue = bag.minimum ?? null;\n inst.maxValue = bag.maximum ?? null;\n inst.format = bag.format ?? null;\n});\nexport function bigint(params) {\n return core._bigint(ZodBigInt, params);\n}\nexport const ZodBigIntFormat = /@__PURE__/ core.$constructor(\"ZodBigIntFormat\", (inst, def) => {\n core.$ZodBigIntFormat.init(inst, def);\n ZodBigInt.init(inst, def);\n});\n// int64\nexport function int64(params) {\n return core._int64(ZodBigIntFormat, params);\n}\n// uint64\nexport function uint64(params) {\n return core._uint64(ZodBigIntFormat, params);\n}\nexport const ZodSymbol = /@__PURE__/ core.$constructor(\"ZodSymbol\", (inst, def) => {\n core.$ZodSymbol.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.symbolProcessor(inst, ctx, json, params);\n});\nexport function symbol(params) {\n return core._symbol(ZodSymbol, params);\n}\nexport const ZodUndefined = /@__PURE__/ core.$constructor(\"ZodUndefined\", (inst, def) => {\n core.$ZodUndefined.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.undefinedProcessor(inst, ctx, json, params);\n});\nfunction _undefined(params) {\n return core._undefined(ZodUndefined, params);\n}\nexport { _undefined as undefined };\nexport const ZodNull = /@__PURE__/ core.$constructor(\"ZodNull\", (inst, def) => {\n core.$ZodNull.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nullProcessor(inst, ctx, json, params);\n});\nfunction _null(params) {\n return core._null(ZodNull, params);\n}\nexport { _null as null };\nexport const ZodAny = /@__PURE__/ core.$constructor(\"ZodAny\", (inst, def) => {\n core.$ZodAny.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.anyProcessor(inst, ctx, json, params);\n});\nexport function any() {\n return core._any(ZodAny);\n}\nexport const ZodUnknown = /@__PURE__/ core.$constructor(\"ZodUnknown\", (inst, def) => {\n core.$ZodUnknown.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.unknownProcessor(inst, ctx, json, params);\n});\nexport function unknown() {\n return core._unknown(ZodUnknown);\n}\nexport const ZodNever = /@__PURE__/ core.$constructor(\"ZodNever\", (inst, def) => {\n core.$ZodNever.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.neverProcessor(inst, ctx, json, params);\n});\nexport function never(params) {\n return core._never(ZodNever, params);\n}\nexport const ZodVoid = /@__PURE__/ core.$constructor(\"ZodVoid\", (inst, def) => {\n core.$ZodVoid.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.voidProcessor(inst, ctx, json, params);\n});\nfunction _void(params) {\n return core._void(ZodVoid, params);\n}\nexport { _void as void };\nexport const ZodDate = /@__PURE__/ core.$constructor(\"ZodDate\", (inst, def) => {\n core.$ZodDate.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.dateProcessor(inst, ctx, json, params);\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.max = (value, params) => inst.check(checks.lte(value, params));\n const c = inst._zod.bag;\n inst.minDate = c.minimum ? new Date(c.minimum) : null;\n inst.maxDate = c.maximum ? new Date(c.maximum) : null;\n});\nexport function date(params) {\n return core._date(ZodDate, params);\n}\nexport const ZodArray = /@__PURE__/ core.$constructor(\"ZodArray\", (inst, def) => {\n core.$ZodArray.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.arrayProcessor(inst, ctx, json, params);\n inst.element = def.element;\n inst.min = (minLength, params) => inst.check(checks.minLength(minLength, params));\n inst.nonempty = (params) => inst.check(checks.minLength(1, params));\n inst.max = (maxLength, params) => inst.check(checks.maxLength(maxLength, params));\n inst.length = (len, params) => inst.check(checks.length(len, params));\n inst.unwrap = () => inst.element;\n});\nexport function array(element, params) {\n return core._array(ZodArray, element, params);\n}\n// .keyof\nexport function keyof(schema) {\n const shape = schema._zod.def.shape;\n return _enum(Object.keys(shape));\n}\nexport const ZodObject = /@__PURE__/ core.$constructor(\"ZodObject\", (inst, def) => {\n core.$ZodObjectJIT.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.objectProcessor(inst, ctx, json, params);\n util.defineLazy(inst, \"shape\", () => {\n return def.shape;\n });\n inst.keyof = () => _enum(Object.keys(inst._zod.def.shape));\n inst.catchall = (catchall) => inst.clone({ ...inst._zod.def, catchall: catchall });\n inst.passthrough = () => inst.clone({ ...inst._zod.def, catchall: unknown() });\n inst.loose = () => inst.clone({ ...inst._zod.def, catchall: unknown() });\n inst.strict = () => inst.clone({ ...inst._zod.def, catchall: never() });\n inst.strip = () => inst.clone({ ...inst._zod.def, catchall: undefined });\n inst.extend = (incoming) => {\n return util.extend(inst, incoming);\n };\n inst.safeExtend = (incoming) => {\n return util.safeExtend(inst, incoming);\n };\n inst.merge = (other) => util.merge(inst, other);\n inst.pick = (mask) => util.pick(inst, mask);\n inst.omit = (mask) => util.omit(inst, mask);\n inst.partial = (...args) => util.partial(ZodOptional, inst, args[0]);\n inst.required = (...args) => util.required(ZodNonOptional, inst, args[0]);\n});\nexport function object(shape, params) {\n const def = {\n type: \"object\",\n shape: shape ?? {},\n ...util.normalizeParams(params),\n };\n return new ZodObject(def);\n}\n// strictObject\nexport function strictObject(shape, params) {\n return new ZodObject({\n type: \"object\",\n shape,\n catchall: never(),\n ...util.normalizeParams(params),\n });\n}\n// looseObject\nexport function looseObject(shape, params) {\n return new ZodObject({\n type: \"object\",\n shape,\n catchall: unknown(),\n ...util.normalizeParams(params),\n });\n}\nexport const ZodUnion = /@__PURE__/ core.$constructor(\"ZodUnion\", (inst, def) => {\n core.$ZodUnion.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.unionProcessor(inst, ctx, json, params);\n inst.options = def.options;\n});\nexport function union(options, params) {\n return new ZodUnion({\n type: \"union\",\n options: options,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodXor = /@__PURE__/ core.$constructor(\"ZodXor\", (inst, def) => {\n ZodUnion.init(inst, def);\n core.$ZodXor.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.unionProcessor(inst, ctx, json, params);\n inst.options = def.options;\n});\n/* Creates an exclusive union (XOR) where exactly one option must match.\n * Unlike regular unions that succeed when any option matches, xor fails if\n * zero or more than one option matches the input. /\nexport function xor(options, params) {\n return new ZodXor({\n type: \"union\",\n options: options,\n inclusive: false,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodDiscriminatedUnion = /@__PURE__/ core.$constructor(\"ZodDiscriminatedUnion\", (inst, def) => {\n ZodUnion.init(inst, def);\n core.$ZodDiscriminatedUnion.init(inst, def);\n});\nexport function discriminatedUnion(discriminator, options, params) {\n // const [options, params] = args;\n return new ZodDiscriminatedUnion({\n type: \"union\",\n options,\n discriminator,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodIntersection = /@__PURE__/ core.$constructor(\"ZodIntersection\", (inst, def) => {\n core.$ZodIntersection.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.intersectionProcessor(inst, ctx, json, params);\n});\nexport function intersection(left, right) {\n return new ZodIntersection({\n type: \"intersection\",\n left: left,\n right: right,\n });\n}\nexport const ZodTuple = /@__PURE__/ core.$constructor(\"ZodTuple\", (inst, def) => {\n core.$ZodTuple.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.tupleProcessor(inst, ctx, json, params);\n inst.rest = (rest) => inst.clone({\n ...inst._zod.def,\n rest: rest,\n });\n});\nexport function tuple(items, _paramsOrRest, _params) {\n const hasRest = _paramsOrRest instanceof core.$ZodType;\n const params = hasRest ? _params : _paramsOrRest;\n const rest = hasRest ? _paramsOrRest : null;\n return new ZodTuple({\n type: \"tuple\",\n items: items,\n rest,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodRecord = /@__PURE__/ core.$constructor(\"ZodRecord\", (inst, def) => {\n core.$ZodRecord.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.recordProcessor(inst, ctx, json, params);\n inst.keyType = def.keyType;\n inst.valueType = def.valueType;\n});\nexport function record(keyType, valueType, params) {\n return new ZodRecord({\n type: \"record\",\n keyType,\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\n// type alksjf = core.output<core.$ZodRecordKey>;\nexport function partialRecord(keyType, valueType, params) {\n const k = core.clone(keyType);\n k._zod.values = undefined;\n return new ZodRecord({\n type: \"record\",\n keyType: k,\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\nexport function looseRecord(keyType, valueType, params) {\n return new ZodRecord({\n type: \"record\",\n keyType,\n valueType: valueType,\n mode: \"loose\",\n ...util.normalizeParams(params),\n });\n}\nexport const ZodMap = /@__PURE__/ core.$constructor(\"ZodMap\", (inst, def) => {\n core.$ZodMap.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.mapProcessor(inst, ctx, json, params);\n inst.keyType = def.keyType;\n inst.valueType = def.valueType;\n inst.min = (...args) => inst.check(core._minSize(...args));\n inst.nonempty = (params) => inst.check(core._minSize(1, params));\n inst.max = (...args) => inst.check(core._maxSize(...args));\n inst.size = (...args) => inst.check(core._size(...args));\n});\nexport function map(keyType, valueType, params) {\n return new ZodMap({\n type: \"map\",\n keyType: keyType,\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodSet = /@__PURE__/ core.$constructor(\"ZodSet\", (inst, def) => {\n core.$ZodSet.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.setProcessor(inst, ctx, json, params);\n inst.min = (...args) => inst.check(core._minSize(...args));\n inst.nonempty = (params) => inst.check(core._minSize(1, params));\n inst.max = (...args) => inst.check(core._maxSize(...args));\n inst.size = (...args) => inst.check(core._size(...args));\n});\nexport function set(valueType, params) {\n return new ZodSet({\n type: \"set\",\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodEnum = /@__PURE__/ core.$constructor(\"ZodEnum\", (inst, def) => {\n core.$ZodEnum.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.enumProcessor(inst, ctx, json, params);\n inst.enum = def.entries;\n inst.options = Object.values(def.entries);\n const keys = new Set(Object.keys(def.entries));\n inst.extract = (values, params) => {\n const newEntries = {};\n for (const value of values) {\n if (keys.has(value)) {\n newEntries[value] = def.entries[value];\n }\n else\n throw new Error(`Key ${value} not found in enum`);\n }\n return new ZodEnum({\n ...def,\n checks: [],\n ...util.normalizeParams(params),\n entries: newEntries,\n });\n };\n inst.exclude = (values, params) => {\n const newEntries = { ...def.entries };\n for (const value of values) {\n if (keys.has(value)) {\n delete newEntries[value];\n }\n else\n throw new Error(`Key ${value} not found in enum`);\n }\n return new ZodEnum({\n ...def,\n checks: [],\n ...util.normalizeParams(params),\n entries: newEntries,\n });\n };\n});\nfunction _enum(values, params) {\n const entries = Array.isArray(values) ? Object.fromEntries(values.map((v) => [v, v])) : values;\n return new ZodEnum({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\nexport { _enum as enum };\n/* @deprecated This API has been merged into `z.enum()`. Use `z.enum()` instead.\n \n ```ts\n * enum Colors { red, green, blue }\n * z.enum(Colors);\n * ```\n /\nexport function nativeEnum(entries, params) {\n return new ZodEnum({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodLiteral = /@__PURE__/ core.$constructor(\"ZodLiteral\", (inst, def) => {\n core.$ZodLiteral.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.literalProcessor(inst, ctx, json, params);\n inst.values = new Set(def.values);\n Object.defineProperty(inst, \"value\", {\n get() {\n if (def.values.length > 1) {\n throw new Error(\"This schema contains multiple valid literal values. Use `.values` instead.\");\n }\n return def.values[0];\n },\n });\n});\nexport function literal(value, params) {\n return new ZodLiteral({\n type: \"literal\",\n values: Array.isArray(value) ? value : [value],\n ...util.normalizeParams(params),\n });\n}\nexport const ZodFile = /@__PURE__/ core.$constructor(\"ZodFile\", (inst, def) => {\n core.$ZodFile.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.fileProcessor(inst, ctx, json, params);\n inst.min = (size, params) => inst.check(core._minSize(size, params));\n inst.max = (size, params) => inst.check(core._maxSize(size, params));\n inst.mime = (types, params) => inst.check(core._mime(Array.isArray(types) ? types : [types], params));\n});\nexport function file(params) {\n return core._file(ZodFile, params);\n}\nexport const ZodTransform = /@__PURE__/ core.$constructor(\"ZodTransform\", (inst, def) => {\n core.$ZodTransform.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.transformProcessor(inst, ctx, json, params);\n inst._zod.parse = (payload, _ctx) => {\n if (_ctx.direction === \"backward\") {\n throw new core.$ZodEncodeError(inst.constructor.name);\n }\n payload.addIssue = (issue) => {\n if (typeof issue === \"string\") {\n payload.issues.push(util.issue(issue, payload.value, def));\n }\n else {\n // for Zod 3 backwards compatibility\n const _issue = issue;\n if (_issue.fatal)\n _issue.continue = false;\n _issue.code ?? (_issue.code = \"custom\");\n _issue.input ?? (_issue.input = payload.value);\n _issue.inst ?? (_issue.inst = inst);\n // _issue.continue ??= true;\n payload.issues.push(util.issue(_issue));\n }\n };\n const output = def.transform(payload.value, payload);\n if (output instanceof Promise) {\n return output.then((output) => {\n payload.value = output;\n return payload;\n });\n }\n payload.value = output;\n return payload;\n };\n});\nexport function transform(fn) {\n return new ZodTransform({\n type: \"transform\",\n transform: fn,\n });\n}\nexport const ZodOptional = /@__PURE__/ core.$constructor(\"ZodOptional\", (inst, def) => {\n core.$ZodOptional.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.optionalProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function optional(innerType) {\n return new ZodOptional({\n type: \"optional\",\n innerType: innerType,\n });\n}\nexport const ZodExactOptional = /@__PURE__/ core.$constructor(\"ZodExactOptional\", (inst, def) => {\n core.$ZodExactOptional.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.optionalProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function exactOptional(innerType) {\n return new ZodExactOptional({\n type: \"optional\",\n innerType: innerType,\n });\n}\nexport const ZodNullable = /@__PURE__/ core.$constructor(\"ZodNullable\", (inst, def) => {\n core.$ZodNullable.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nullableProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function nullable(innerType) {\n return new ZodNullable({\n type: \"nullable\",\n innerType: innerType,\n });\n}\n// nullish\nexport function nullish(innerType) {\n return optional(nullable(innerType));\n}\nexport const ZodDefault = /@__PURE__/ core.$constructor(\"ZodDefault\", (inst, def) => {\n core.$ZodDefault.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.defaultProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n inst.removeDefault = inst.unwrap;\n});\nexport function _default(innerType, defaultValue) {\n return new ZodDefault({\n type: \"default\",\n innerType: innerType,\n get defaultValue() {\n return typeof defaultValue === \"function\" ? defaultValue() : util.shallowClone(defaultValue);\n },\n });\n}\nexport const ZodPrefault = /@__PURE__/ core.$constructor(\"ZodPrefault\", (inst, def) => {\n core.$ZodPrefault.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.prefaultProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function prefault(innerType, defaultValue) {\n return new ZodPrefault({\n type: \"prefault\",\n innerType: innerType,\n get defaultValue() {\n return typeof defaultValue === \"function\" ? defaultValue() : util.shallowClone(defaultValue);\n },\n });\n}\nexport const ZodNonOptional = /@__PURE__/ core.$constructor(\"ZodNonOptional\", (inst, def) => {\n core.$ZodNonOptional.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nonoptionalProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function nonoptional(innerType, params) {\n return new ZodNonOptional({\n type: \"nonoptional\",\n innerType: innerType,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodSuccess = /@__PURE__/ core.$constructor(\"ZodSuccess\", (inst, def) => {\n core.$ZodSuccess.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.successProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function success(innerType) {\n return new ZodSuccess({\n type: \"success\",\n innerType: innerType,\n });\n}\nexport const ZodCatch = /@__PURE__/ core.$constructor(\"ZodCatch\", (inst, def) => {\n core.$ZodCatch.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.catchProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n inst.removeCatch = inst.unwrap;\n});\nfunction _catch(innerType, catchValue) {\n return new ZodCatch({\n type: \"catch\",\n innerType: innerType,\n catchValue: (typeof catchValue === \"function\" ? catchValue : () => catchValue),\n });\n}\nexport { _catch as catch };\nexport const ZodNaN = /@__PURE__/ core.$constructor(\"ZodNaN\", (inst, def) => {\n core.$ZodNaN.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nanProcessor(inst, ctx, json, params);\n});\nexport function nan(params) {\n return core._nan(ZodNaN, params);\n}\nexport const ZodPipe = /@__PURE__/ core.$constructor(\"ZodPipe\", (inst, def) => {\n core.$ZodPipe.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.pipeProcessor(inst, ctx, json, params);\n inst.in = def.in;\n inst.out = def.out;\n});\nexport function pipe(in_, out) {\n return new ZodPipe({\n type: \"pipe\",\n in: in_,\n out: out,\n // ...util.normalizeParams(params),\n });\n}\nexport const ZodCodec = /@__PURE__/ core.$constructor(\"ZodCodec\", (inst, def) => {\n ZodPipe.init(inst, def);\n core.$ZodCodec.init(inst, def);\n});\nexport function codec(in_, out, params) {\n return new ZodCodec({\n type: \"pipe\",\n in: in_,\n out: out,\n transform: params.decode,\n reverseTransform: params.encode,\n });\n}\nexport const ZodReadonly = /@__PURE__/ core.$constructor(\"ZodReadonly\", (inst, def) => {\n core.$ZodReadonly.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.readonlyProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function readonly(innerType) {\n return new ZodReadonly({\n type: \"readonly\",\n innerType: innerType,\n });\n}\nexport const ZodTemplateLiteral = /@__PURE__/ core.$constructor(\"ZodTemplateLiteral\", (inst, def) => {\n core.$ZodTemplateLiteral.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.templateLiteralProcessor(inst, ctx, json, params);\n});\nexport function templateLiteral(parts, params) {\n return new ZodTemplateLiteral({\n type: \"template_literal\",\n parts,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodLazy = /@__PURE__/ core.$constructor(\"ZodLazy\", (inst, def) => {\n core.$ZodLazy.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.lazyProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.getter();\n});\nexport function lazy(getter) {\n return new ZodLazy({\n type: \"lazy\",\n getter: getter,\n });\n}\nexport const ZodPromise = /@__PURE__/ core.$constructor(\"ZodPromise\", (inst, def) => {\n core.$ZodPromise.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.promiseProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function promise(innerType) {\n return new ZodPromise({\n type: \"promise\",\n innerType: innerType,\n });\n}\nexport const ZodFunction = /@__PURE__/ core.$constructor(\"ZodFunction\", (inst, def) => {\n core.$ZodFunction.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.functionProcessor(inst, ctx, json, params);\n});\nexport function _function(params) {\n return new ZodFunction({\n type: \"function\",\n input: Array.isArray(params?.input) ? tuple(params?.input) : (params?.input ?? array(unknown())),\n output: params?.output ?? unknown(),\n });\n}\nexport { _function as function };\nexport const ZodCustom = /@__PURE__/ core.$constructor(\"ZodCustom\", (inst, def) => {\n core.$ZodCustom.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.customProcessor(inst, ctx, json, params);\n});\n// custom checks\nexport function check(fn) {\n const ch = new core.$ZodCheck({\n check: \"custom\",\n // ...util.normalizeParams(params),\n });\n ch._zod.check = fn;\n return ch;\n}\nexport function custom(fn, _params) {\n return core._custom(ZodCustom, fn ?? (() => true), _params);\n}\nexport function refine(fn, _params = {}) {\n return core._refine(ZodCustom, fn, _params);\n}\n// superRefine\nexport function superRefine(fn) {\n return core._superRefine(fn);\n}\n// Re-export describe and meta from core\nexport const describe = core.describe;\nexport const meta = core.meta;\nfunction _instanceof(cls, params = {}) {\n const inst = new ZodCustom({\n type: \"custom\",\n check: \"custom\",\n fn: (data) => data instanceof cls,\n abort: true,\n ...util.normalizeParams(params),\n });\n inst._zod.bag.Class = cls;\n // Override check to emit invalid_type instead of custom\n inst._zod.check = (payload) => {\n if (!(payload.value instanceof cls)) {\n payload.issues.push({\n code: \"invalid_type\",\n expected: cls.name,\n input: payload.value,\n inst,\n path: [...(inst._zod.def.path ?? [])],\n });\n }\n };\n return inst;\n}\nexport { _instanceof as instanceof };\n// stringbool\nexport const stringbool = (...args) => core._stringbool({\n Codec: ZodCodec,\n Boolean: ZodBoolean,\n String: ZodString,\n}, ...args);\nexport function json(params) {\n const jsonSchema = lazy(() => {\n return union([string(params), number(), boolean(), _null(), array(jsonSchema), record(string(), jsonSchema)]);\n });\n return jsonSchema;\n}\n// preprocess\n// /* @deprecated Use `z.pipe()` and `z.transform()` instead. /\nexport function preprocess(fn, schema) {\n return pipe(transform(fn), schema);\n}\n","import { z } from \"zod\";\n\nconst CodegenSettingsSchema = z\n .object({\n language: z.enum([\"typescript\", \"javascript\"]).optional(),\n disableMarkedForExport: z.boolean().optional(),\n allowAutoSelectFirstNode: z.boolean().optional().default(true),\n enableDisplayDataId: z.boolean().optional(),\n enableDisplayDataName: z.boolean().optional(),\n })\n .and(\n z.union([\n z.object({\n framework: z.literal(\"react\"),\n model: z.string().optional(),\n styling: z.enum([\"plain_css\", \"tailwind\", \"inline_styles\"]),\n uiLibrary: z\n .enum([\"mui\", \"antd\", \"radix\", \"shadcn\", \"clean_react\", \"custom_design_system\"])\n .optional(),\n responsivePages: z\n .array(\n z.object({\n name: z.string(),\n framesId: z.array(z.string()),\n })\n )\n .optional(),\n enableUILibraryTheming: z.boolean().optional(),\n enableCompactStructure: z.boolean().optional(),\n enableDisplayScreenModelId: z.boolean().optional(),\n enableGeneratePackageLock: z.boolean().optional(),\n enableAnimationsPreset: z.boolean().optional(),\n\n enableAutoSplit: z.boolean().optional(),\n autoSplitThreshold: z.number().optional(),\n url: z.string().url().optional(),\n codegenSettings: z.record(z.string(), z.unknown()).optional(),\n designSystemId: z.string().optional(),\n }),\n z.object({\n framework: z.literal(\"html\"),\n styling: z.enum([\"plain_css\", \"inline_styles\", \"tailwind\"]),\n enableTranslation: z.boolean().optional(),\n }),\n ])\n );\n\nexport type BaseSettings = {\n codegenSettings?: Record<string, unknown>;\n};\n\n// We don't use the z.infer method here because the types returned by zod aren't ergonic\nexport type CodegenSettings = BaseSettings & {\n language?: \"typescript\" \| \"javascript\";\n model?: string;\n framework: \"react\" \| \"html\";\n styling: \"plain_css\" \| \"tailwind\" \| \"inline_styles\";\n uiLibrary?: \"mui\" \| \"antd\" \| \"radix\" \| \"shadcn\" \| \"clean_react\" \| \"custom_design_system\";\n responsivePages?: Array<{\n name: string;\n framesId: string[];\n }>;\n enableTranslation?: boolean;\n enableUILibraryTheming?: boolean;\n enableCompactStructure?: boolean;\n enableAutoSplit?: boolean;\n autoSplitThreshold?: number;\n disableMarkedForExport?: boolean;\n allowAutoSelectFirstNode?: boolean;\n enableDisplayScreenModelId?: boolean;\n enableGeneratePackageLock?: boolean;\n enableAnimationsPreset?: boolean;\n enableDisplayDataId?: boolean;\n enableDisplayDataName?: boolean;\n url?: string;\n prompt?: string;\n images?: Array<{ url: string }>;\n designSystemId?: string;\n};\n\nexport const validateSettings = (obj: unknown): CodegenSettings => {\n const parsedObj = CodegenSettingsSchema.safeParse(obj);\n\n if (parsedObj.success === false) {\n const error = new Error(\"Invalid codegen settings\");\n error.cause = parsedObj.error;\n throw error;\n }\n\n return parsedObj.data;\n};\n","import type { Node } from \"@figma/rest-api-spec\";\n\nexport type FigmaNode = Node;\n\nexport const findChildrenNode = (\n node: FigmaNode,\n targetNodeId: string\n): FigmaNode \| null => {\n if (node.id === targetNodeId) {\n return node;\n }\n\n if (\"children\" in node) {\n for (const child of node.children) {\n const found = findChildrenNode(child, targetNodeId);\n if (found) {\n return found;\n }\n }\n }\n\n return null;\n};\n","import type { GetFileResponse } from \"@figma/rest-api-spec\";\nimport { findChildrenNode, type FigmaNode } from \"../figma\";\n\nconst validNodeTypes: Set<FigmaNode[\"type\"]> = new Set([\n \"FRAME\",\n \"INSTANCE\",\n \"COMPONENT\",\n \"COMPONENT_SET\",\n \"GROUP\",\n]);\n\ntype ValidateNodeForCodegenResult =\n \| {\n isValid: true;\n node: FigmaNode;\n note?: \"Selected node is a page with a single valid children - returning it instead\";\n }\n \| {\n isValid: true;\n node: FigmaNode;\n note?: \"Selected node is a page with multiple valid children - returning the first one instead\";\n }\n \| {\n isValid: false;\n reason: InvalidNodeForCodegenReason;\n };\n\ntype InvalidNodeForCodegenReason =\n \| \"Selected node is a page with multiple children\"\n \| \"Selected node is a page with no valid children\"\n \| \"There is no node with the given id\"\n \| \"Selected node type is not supported\";\n\n/\n Check if the pair \"design\" + \"node id\" is valid for code generation.\n * May recommend a node that is not the one passed as argument.\n /\nexport const isNodeCodegenCompatible = (\n design: GetFileResponse,\n nodeId: string,\n options: {\n allowAutoSelectFirstNode: boolean;\n } = { allowAutoSelectFirstNode: true }\n): ValidateNodeForCodegenResult => {\n const found = findChildrenNode(design.document, nodeId);\n\n // If no node found with the given id\n if (!found) {\n return {\n isValid: false,\n reason: \"There is no node with the given id\",\n };\n }\n\n // If the selected node is a page and has only one valid child node to generate code from, return that child node\n if (found.type === \"CANVAS\") {\n const validChildrenNodes = found.children.filter((child) =>\n validNodeTypes.has(child.type)\n );\n\n if (validChildrenNodes.length === 0) {\n return {\n isValid: false,\n reason: \"Selected node is a page with no valid children\",\n };\n }\n\n if (validChildrenNodes.length === 1) {\n return {\n isValid: true,\n node: validChildrenNodes[0],\n note: \"Selected node is a page with a single valid children - returning it instead\",\n };\n }\n\n if (options.allowAutoSelectFirstNode) {\n return {\n isValid: true,\n node: validChildrenNodes[0],\n note: \"Selected node is a page with multiple valid children - returning the first one instead\",\n };\n }\n\n return {\n isValid: false,\n reason: \"Selected node is a page with multiple children\",\n };\n }\n\n // If the selected node is not a valid node type, return an error\n if (!validNodeTypes.has(found.type)) {\n return {\n isValid: false,\n reason: \"Selected node type is not supported\",\n };\n }\n\n // All good\n return { isValid: true, node: found };\n};\n","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global = typeof globalThis !== 'undefined' ? globalThis : global \|\| self, global.typeDetect = factory());\n})(this, (function () { 'use strict';\n\n var promiseExists = typeof Promise === 'function';\n var globalObject = (function (Obj) {\n if (typeof globalThis === 'object') {\n return globalThis;\n }\n Object.defineProperty(Obj, 'typeDetectGlobalObject', {\n get: function get() {\n return this;\n },\n configurable: true,\n });\n var global = typeDetectGlobalObject;\n delete Obj.typeDetectGlobalObject;\n return global;\n })(Object.prototype);\n var symbolExists = typeof Symbol !== 'undefined';\n var mapExists = typeof Map !== 'undefined';\n var setExists = typeof Set !== 'undefined';\n var weakMapExists = typeof WeakMap !== 'undefined';\n var weakSetExists = typeof WeakSet !== 'undefined';\n var dataViewExists = typeof DataView !== 'undefined';\n var symbolIteratorExists = symbolExists && typeof Symbol.iterator !== 'undefined';\n var symbolToStringTagExists = symbolExists && typeof Symbol.toStringTag !== 'undefined';\n var setEntriesExists = setExists && typeof Set.prototype.entries === 'function';\n var mapEntriesExists = mapExists && typeof Map.prototype.entries === 'function';\n var setIteratorPrototype = setEntriesExists && Object.getPrototypeOf(new Set().entries());\n var mapIteratorPrototype = mapEntriesExists && Object.getPrototypeOf(new Map().entries());\n var arrayIteratorExists = symbolIteratorExists && typeof Array.prototype[Symbol.iterator] === 'function';\n var arrayIteratorPrototype = arrayIteratorExists && Object.getPrototypeOf([][Symbol.iterator]());\n var stringIteratorExists = symbolIteratorExists && typeof String.prototype[Symbol.iterator] === 'function';\n var stringIteratorPrototype = stringIteratorExists && Object.getPrototypeOf(''[Symbol.iterator]());\n var toStringLeftSliceLength = 8;\n var toStringRightSliceLength = -1;\n function typeDetect(obj) {\n var typeofObj = typeof obj;\n if (typeofObj !== 'object') {\n return typeofObj;\n }\n if (obj === null) {\n return 'null';\n }\n if (obj === globalObject) {\n return 'global';\n }\n if (Array.isArray(obj) &&\n (symbolToStringTagExists === false \|\| !(Symbol.toStringTag in obj))) {\n return 'Array';\n }\n if (typeof window === 'object' && window !== null) {\n if (typeof window.location === 'object' && obj === window.location) {\n return 'Location';\n }\n if (typeof window.document === 'object' && obj === window.document) {\n return 'Document';\n }\n if (typeof window.navigator === 'object') {\n if (typeof window.navigator.mimeTypes === 'object' &&\n obj === window.navigator.mimeTypes) {\n return 'MimeTypeArray';\n }\n if (typeof window.navigator.plugins === 'object' &&\n obj === window.navigator.plugins) {\n return 'PluginArray';\n }\n }\n if ((typeof window.HTMLElement === 'function' \|\|\n typeof window.HTMLElement === 'object') &&\n obj instanceof window.HTMLElement) {\n if (obj.tagName === 'BLOCKQUOTE') {\n return 'HTMLQuoteElement';\n }\n if (obj.tagName === 'TD') {\n return 'HTMLTableDataCellElement';\n }\n if (obj.tagName === 'TH') {\n return 'HTMLTableHeaderCellElement';\n }\n }\n }\n var stringTag = (symbolToStringTagExists && obj[Symbol.toStringTag]);\n if (typeof stringTag === 'string') {\n return stringTag;\n }\n var objPrototype = Object.getPrototypeOf(obj);\n if (objPrototype === RegExp.prototype) {\n return 'RegExp';\n }\n if (objPrototype === Date.prototype) {\n return 'Date';\n }\n if (promiseExists && objPrototype === Promise.prototype) {\n return 'Promise';\n }\n if (setExists && objPrototype === Set.prototype) {\n return 'Set';\n }\n if (mapExists && objPrototype === Map.prototype) {\n return 'Map';\n }\n if (weakSetExists && objPrototype === WeakSet.prototype) {\n return 'WeakSet';\n }\n if (weakMapExists && objPrototype === WeakMap.prototype) {\n return 'WeakMap';\n }\n if (dataViewExists && objPrototype === DataView.prototype) {\n return 'DataView';\n }\n if (mapExists && objPrototype === mapIteratorPrototype) {\n return 'Map Iterator';\n }\n if (setExists && objPrototype === setIteratorPrototype) {\n return 'Set Iterator';\n }\n if (arrayIteratorExists && objPrototype === arrayIteratorPrototype) {\n return 'Array Iterator';\n }\n if (stringIteratorExists && objPrototype === stringIteratorPrototype) {\n return 'String Iterator';\n }\n if (objPrototype === null) {\n return 'Object';\n }\n return Object\n .prototype\n .toString\n .call(obj)\n .slice(toStringLeftSliceLength, toStringRightSliceLength);\n }\n\n return typeDetect;\n\n}));\n","const isBufferExists = typeof Buffer !== 'undefined';\nconst isBufferFromExists = isBufferExists && typeof Buffer.from !== 'undefined';\n\nexport const isBuffer = isBufferExists\n ? /\n is value is Buffer?\n \n @param {} value\n @return {boolean}\n /\n function isBuffer(value) {\n return Buffer.isBuffer(value);\n }\n : /\n return false\n \n NOTE: for Buffer unsupported\n \n @return {boolean}\n /\n function isBuffer() {\n return false;\n };\n\nexport const copy = isBufferFromExists\n ? /\n copy Buffer\n \n @param {Buffer} value\n * @return {Buffer}\n /\n function copy(value) {\n return Buffer.from(value);\n }\n : isBufferExists\n ? /\n copy Buffer\n \n NOTE: for old node.js\n \n @param {Buffer} value\n * @return {Buffer}\n /\n function copy(value) {\n return new Buffer(value);\n }\n : /\n shallow copy\n \n NOTE: for Buffer unsupported\n \n @param {}\n @return {}\n /\n function copy(value) {\n return value;\n };\n","import typeDetect from 'type-detect';\n\nimport { isBuffer } from './buffer.mjs';\n\n/*\n detect type of value\n \n @param {} value\n @return {string}\n /\nexport function detectType(value) {\n // NOTE: isBuffer must execute before type-detect,\n // because type-detect returns 'Uint8Array'.\n if (isBuffer(value)) {\n return 'Buffer';\n }\n\n return typeDetect(value);\n}\n","import { detectType } from './detector.mjs';\n\n/\n collection types\n /\nconst collectionTypeSet = new Set([\n 'Arguments',\n 'Array',\n 'Map',\n 'Object',\n 'Set'\n]);\n\n/\n get value from collection\n \n @param {Array\|Object\|Map\|Set} collection\n * @param {string\|number\|symbol} key\n * @param {string} [type=null]\n * @return {}\n /\nexport function get(collection, key, type = null) {\n const valueType = type \|\| detectType(collection);\n\n switch (valueType) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n return collection[key];\n case 'Map':\n return collection.get(key);\n case 'Set':\n // NOTE: Set.prototype.keys is alias of Set.prototype.values\n // it means key is equals value\n return key;\n default:\n }\n}\n\n/*\n check to type string is collection\n \n @param {string} type\n /\nexport function isCollection(type) {\n return collectionTypeSet.has(type);\n}\n\n/\n set value to collection\n \n @param {Array\|Object\|Map\|Set} collection\n * @param {string\|number\|symbol} key\n * @param {} value\n @param {string} [type=null]\n * @return {Array\|Object\|Map\|Set}\n /\nexport function set(collection, key, value, type = null) {\n const valueType = type \|\| detectType(collection);\n\n switch (valueType) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n collection[key] = value;\n break;\n case 'Map':\n collection.set(key, value);\n break;\n case 'Set':\n collection.add(value);\n break;\n default:\n }\n\n return collection;\n}\n","const freeGlobalThis =\n typeof globalThis !== 'undefined' &&\n globalThis !== null &&\n globalThis.Object === Object &&\n globalThis;\n\nconst freeGlobal =\n typeof global !== 'undefined' &&\n global !== null &&\n global.Object === Object &&\n global;\n\nconst freeSelf =\n typeof self !== 'undefined' &&\n self !== null &&\n self.Object === Object &&\n self;\n\nexport const globalObject =\n freeGlobalThis \|\| freeGlobal \|\| freeSelf \|\| Function('return this')();\n","import { copy as cloneBuffer } from './buffer.mjs';\nimport { globalObject } from './global.mjs';\n\n/\n copy ArrayBuffer\n \n @param {ArrayBuffer} value\n * @return {ArrayBuffer}\n /\nfunction copyArrayBuffer(value) {\n return value.slice(0);\n}\n\n/\n copy Boolean\n \n @param {Boolean} value\n * @return {Boolean}\n /\nfunction copyBoolean(value) {\n return new Boolean(value.valueOf());\n}\n\n/\n copy DataView\n \n @param {DataView} value\n * @return {DataView}\n /\nfunction copyDataView(value) {\n // TODO: copy ArrayBuffer?\n return new DataView(value.buffer);\n}\n\n/\n copy Buffer\n \n @param {Buffer} value\n * @return {Buffer}\n /\nfunction copyBuffer(value) {\n return cloneBuffer(value);\n}\n\n/\n copy Date\n \n @param {Date} value\n * @return {Date}\n /\nfunction copyDate(value) {\n return new Date(value.getTime());\n}\n\n/\n copy Number\n \n @param {Number} value\n * @return {Number}\n /\nfunction copyNumber(value) {\n return new Number(value);\n}\n\n/\n copy RegExp\n \n @param {RegExp} value\n * @return {RegExp}\n /\nfunction copyRegExp(value) {\n return new RegExp(value.source, value.flags);\n}\n\n/\n copy String\n \n @param {String} value\n * @return {String}\n /\nfunction copyString(value) {\n return new String(value);\n}\n\n/\n copy TypedArray\n \n @param {} value\n @return {}\n /\nfunction copyTypedArray(value, type) {\n const typedArray = globalObject[type];\n\n if (typedArray.from) {\n return globalObject[type].from(value);\n }\n\n return new globalObject[type](value);\n}\n\n/*\n shallow copy\n \n @param {} value\n @return {}\n /\nfunction shallowCopy(value) {\n return value;\n}\n\n/*\n get empty Array\n \n @return {Array}\n /\nfunction getEmptyArray() {\n return [];\n}\n\n/\n get empty Map\n \n @return {Map}\n /\nfunction getEmptyMap() {\n return new Map();\n}\n\n/\n get empty Object\n \n @return {Object}\n /\nfunction getEmptyObject() {\n return {};\n}\n\n/\n get empty Set\n \n @return {Set}\n /\nfunction getEmptySet() {\n return new Set();\n}\n\nexport default new Map([\n // deep copy\n ['ArrayBuffer', copyArrayBuffer],\n ['Boolean', copyBoolean],\n ['Buffer', copyBuffer],\n ['DataView', copyDataView],\n ['Date', copyDate],\n ['Number', copyNumber],\n ['RegExp', copyRegExp],\n ['String', copyString],\n\n // typed arrays\n // TODO: pass bound function\n ['Float32Array', copyTypedArray],\n ['Float64Array', copyTypedArray],\n ['Int16Array', copyTypedArray],\n ['Int32Array', copyTypedArray],\n ['Int8Array', copyTypedArray],\n ['Uint16Array', copyTypedArray],\n ['Uint32Array', copyTypedArray],\n ['Uint8Array', copyTypedArray],\n ['Uint8ClampedArray', copyTypedArray],\n\n // shallow copy\n ['Array Iterator', shallowCopy],\n ['Map Iterator', shallowCopy],\n ['Promise', shallowCopy],\n ['Set Iterator', shallowCopy],\n ['String Iterator', shallowCopy],\n ['function', shallowCopy],\n ['global', shallowCopy],\n // NOTE: WeakMap and WeakSet cannot get entries\n ['WeakMap', shallowCopy],\n ['WeakSet', shallowCopy],\n\n // primitives\n ['boolean', shallowCopy],\n ['null', shallowCopy],\n ['number', shallowCopy],\n ['string', shallowCopy],\n ['symbol', shallowCopy],\n ['undefined', shallowCopy],\n\n // collections\n // NOTE: return empty value, because recursively copy later.\n ['Arguments', getEmptyArray],\n ['Array', getEmptyArray],\n ['Map', getEmptyMap],\n ['Object', getEmptyObject],\n ['Set', getEmptySet]\n\n // NOTE: type-detect returns following types\n // 'Location'\n // 'Document'\n // 'MimeTypeArray'\n // 'PluginArray'\n // 'HTMLQuoteElement'\n // 'HTMLTableDataCellElement'\n // 'HTMLTableHeaderCellElement'\n\n // TODO: is type-detect never return 'object'?\n // 'object'\n]);\n","import copyMap from './copy_map.mjs';\nimport { detectType } from './detector.mjs';\n\n/\n no operation\n /\nfunction noop() {}\n\n/\n copy value\n \n @param {} value\n @param {string} [type=null]\n * @param {Function} [customizer=noop]\n * @return {}\n /\nexport function copy(value, type = null, customizer = noop) {\n if (arguments.length === 2 && typeof type === 'function') {\n customizer = type;\n type = null;\n }\n\n const valueType = type \|\| detectType(value);\n const copyFunction = copyMap.get(valueType);\n\n if (valueType === 'Object') {\n const result = customizer(value, valueType);\n\n if (result !== undefined) {\n return result;\n }\n }\n\n // NOTE: TypedArray needs pass type to argument\n return copyFunction ? copyFunction(value, valueType) : value;\n}\n","import { detectType } from './detector.mjs';\nimport { get, isCollection, set } from './collection.mjs';\nimport { copy } from './copier.mjs';\n\n/*\n deepcopy function\n \n @param {} value\n @param {Object\|Function} [options]\n * @return {}\n /\nexport default function deepcopy(value, options = {}) {\n if (typeof options === 'function') {\n options = {\n customizer: options\n };\n }\n\n const {\n // TODO: before/after customizer\n customizer\n // TODO: max depth\n // depth = Infinity,\n } = options;\n\n const valueType = detectType(value);\n\n if (!isCollection(valueType)) {\n return recursiveCopy(value, null, null, null, customizer);\n }\n\n const copiedValue = copy(value, valueType, customizer);\n\n const references = new WeakMap([[value, copiedValue]]);\n const visited = new WeakSet([value]);\n\n return recursiveCopy(value, copiedValue, references, visited, customizer);\n}\n\n/*\n recursively copy\n \n @param {} value target value\n @param {} clone clone of value\n @param {WeakMap} references visited references of clone\n * @param {WeakSet} visited visited references of value\n * @param {Function} customizer user customize function\n * @return {}\n /\nfunction recursiveCopy(value, clone, references, visited, customizer) {\n const type = detectType(value);\n const copiedValue = copy(value, type);\n\n // return if not a collection value\n if (!isCollection(type)) {\n return copiedValue;\n }\n\n let keys;\n\n switch (type) {\n case 'Arguments':\n case 'Array':\n keys = Object.keys(value);\n break;\n case 'Object':\n keys = Object.keys(value);\n keys.push(...Object.getOwnPropertySymbols(value));\n break;\n case 'Map':\n case 'Set':\n keys = value.keys();\n break;\n default:\n }\n\n // walk within collection with iterator\n for (let collectionKey of keys) {\n const collectionValue = get(value, collectionKey, type);\n\n if (visited.has(collectionValue)) {\n // for [Circular]\n set(clone, collectionKey, references.get(collectionValue), type);\n } else {\n const collectionValueType = detectType(collectionValue);\n const copiedCollectionValue = copy(collectionValue, collectionValueType);\n\n // save reference if value is collection\n if (isCollection(collectionValueType)) {\n references.set(collectionValue, copiedCollectionValue);\n visited.add(collectionValue);\n }\n\n set(\n clone,\n collectionKey,\n recursiveCopy(\n collectionValue,\n copiedCollectionValue,\n references,\n visited,\n customizer\n ),\n type\n );\n }\n }\n\n // TODO: isSealed/isFrozen/isExtensible\n\n return clone;\n}\n","import type {\n GetFileResponse,\n GetImageFillsResponse,\n GetImagesResponse,\n GetMeResponse,\n} from \"@figma/rest-api-spec\";\nimport deepcopy from \"deepcopy\";\nimport {\n MalformattedFigmaToken,\n MissingFigmaToken,\n NeedsReauthFigmaToken,\n ExpiredFigmaToken,\n UnknownForbiddenFigmaError,\n NotFound,\n RateLimitExceeded,\n RequestTooLarge,\n UnknownFigmaApiException,\n FileNotExportable,\n} from \"./errors\";\n\ntype FigmaRestApiConstructor = {\n fetch?: typeof window.fetch;\n baseAddress?: string;\n defaultOptions?: Omit<Options, \"abortSignal\">;\n};\n\nexport type FigmaPlanTier =\n \| \"enterprise\"\n \| \"org\"\n \| \"pro\"\n \| \"starter\"\n \| \"student\";\nexport type FigmaRateLimitType = \"low\" \| \"high\";\n\nexport type Options = {\n token?: string;\n abortSignal?: AbortSignal;\n onForbidden?: (\n error:\n \| NeedsReauthFigmaToken\n \| ExpiredFigmaToken\n \| FileNotExportable\n \| UnknownForbiddenFigmaError\n ) => Promise<{ retry: { newToken: string } } \| void>;\n onRateLimited?: (headers: {\n retryAfter: number;\n figmaPlanTier: FigmaPlanTier;\n figmaRateLimitType: FigmaRateLimitType;\n }) => Promise<boolean>;\n};\n\nclass FigmaRestApi {\n #baseAddress: string;\n #fetch: typeof window.fetch;\n #nextOptions: Options;\n #defaultOptions: Options;\n\n constructor({\n fetch = globalThis.fetch.bind(globalThis),\n baseAddress = \"https://api.figma.com/\",\n defaultOptions = {},\n }: FigmaRestApiConstructor = {}) {\n this.#baseAddress = baseAddress;\n this.#fetch = fetch;\n this.#defaultOptions = defaultOptions;\n this.#nextOptions = this.#defaultOptions;\n\n if (defaultOptions.token) {\n this.#ensureValidToken(defaultOptions.token);\n }\n }\n\n hasDefaultToken() {\n return Boolean(this.#defaultOptions.token);\n }\n\n updateDefaultOptions(options: Options) {\n if (options.token) {\n this.#ensureValidToken(options.token);\n }\n\n this.#defaultOptions = {\n ...this.#defaultOptions,\n ...options,\n };\n this.#nextOptions = this.#defaultOptions;\n }\n\n withOptions(options: Options) {\n this.#nextOptions = {\n ...this.#defaultOptions,\n ...this.#nextOptions,\n ...options,\n };\n\n return this;\n }\n\n #ensureValidToken(token: string) {\n if (!token.startsWith(\"figd_\") && !token.startsWith(\"figu_\")) {\n throw new MalformattedFigmaToken();\n }\n }\n\n getHeaders(token?: string) {\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n };\n\n const tokenInUse = token ?? this.#defaultOptions.token;\n if (tokenInUse?.startsWith(\"figd_\")) {\n headers[\"X-FIGMA-TOKEN\"] = tokenInUse;\n } else if (tokenInUse?.startsWith(\"figu_\")) {\n headers[\"Authorization\"] = `Bearer ${tokenInUse}`;\n } else {\n throw new MissingFigmaToken();\n }\n\n return headers;\n }\n\n async #doRequest(\n options: Options,\n request: () => Promise<Response>\n ): Promise<Response> {\n const response = await request();\n\n if (!response.ok) {\n const status = response.status;\n let responseText: string \| null = null;\n try {\n responseText = await response.text();\n } catch {\n // ignore\n }\n\n if (status === 403) {\n if (responseText?.includes(\"Invalid token\")) {\n throw new NeedsReauthFigmaToken();\n } else if (responseText?.includes(\"Token expired\")) {\n throw new ExpiredFigmaToken();\n } else if (responseText?.includes(\"File not exportable\")) {\n throw new FileNotExportable();\n }\n\n throw new UnknownForbiddenFigmaError({ reason: responseText });\n } else if (status === 404) {\n throw new NotFound({ cause: response });\n } else if (status === 429) {\n const rawRetryAfter = response.headers.get(\"Retry-After\");\n const retryAfter = rawRetryAfter ? Number(rawRetryAfter) : null;\n\n if (!retryAfter) {\n throw new RateLimitExceeded({\n cause: response,\n });\n }\n\n const shouldRetry = await options.onRateLimited?.({\n retryAfter,\n figmaPlanTier: response.headers.get(\n \"X-Figma-Plan-Tier\"\n ) as FigmaPlanTier,\n figmaRateLimitType: response.headers.get(\n \"X-Figma-Rate-Limit-Type\"\n ) as FigmaRateLimitType,\n });\n\n if (shouldRetry) {\n return new Promise((resolve, reject) => {\n const timeout = setTimeout(\n () => {\n if (options.abortSignal?.aborted) {\n return;\n }\n\n this.#doRequest(options, request).then(resolve).catch(reject);\n },\n retryAfter * 1000 + 1000\n );\n\n options.abortSignal?.addEventListener(\"abort\", () => {\n clearTimeout(timeout);\n reject(new Error(\"The operation was aborted.\"));\n });\n });\n }\n\n throw new RateLimitExceeded({ cause: response });\n } else if (\n status === 500 &&\n responseText?.includes(\"Request too large\")\n ) {\n throw new RequestTooLarge({ cause: response });\n } else {\n throw new UnknownFigmaApiException({\n cause: response,\n });\n }\n }\n\n return response;\n }\n\n async #get<T>(url: string): Promise<T> {\n const nextOptions = deepcopy(this.#nextOptions);\n this.#nextOptions = deepcopy(this.#defaultOptions);\n\n const request = async () => {\n const response = await this.#fetch(`${this.#baseAddress}${url}`, {\n method: \"GET\",\n headers: this.getHeaders(nextOptions.token),\n signal: nextOptions.abortSignal,\n });\n\n return response;\n };\n\n try {\n const response = await this.#doRequest(nextOptions, request);\n\n const responseData = (await response.json()) as T;\n return responseData;\n } catch (error) {\n if (\n nextOptions.onForbidden &&\n (error instanceof NeedsReauthFigmaToken \|\|\n error instanceof ExpiredFigmaToken \|\|\n error instanceof FileNotExportable \|\|\n error instanceof UnknownForbiddenFigmaError)\n ) {\n const shouldRetry = await nextOptions.onForbidden(error);\n\n if (shouldRetry) {\n nextOptions.token = shouldRetry.retry.newToken;\n\n const response = await this.#doRequest(nextOptions, request);\n const responseData = (await response.json()) as T;\n\n return responseData;\n }\n }\n\n throw error;\n }\n }\n\n async getFile({\n fileKey,\n nodeIds = [],\n depth,\n }: {\n fileKey: string;\n nodeIds?: string[];\n depth?: number;\n }) {\n const urlSearchParams = new URLSearchParams({\n plugin_data: \"857346721138427857\",\n geometry: \"paths\",\n });\n\n if (nodeIds.length > 0) {\n urlSearchParams.append(\"ids\", nodeIds.join(\",\"));\n }\n\n if (depth) {\n urlSearchParams.append(\"depth\", `${depth}`);\n }\n\n const searchQuery = urlSearchParams.toString();\n\n const url = `v1/files/${fileKey}?${searchQuery}`;\n const response = await this.#get<GetFileResponse>(url);\n\n return response;\n }\n\n async getNodeImages<As extends \"links\" \| \"arrayBuffer\" = \"arrayBuffer\">({\n fileKey,\n nodeIds,\n scale = 1,\n as = \"arrayBuffer\" as As,\n format = \"jpg\",\n }: {\n fileKey: string;\n nodeIds: string[];\n scale?: number;\n as?: As;\n format?: \"jpg\" \| \"png\" \| \"svg\" \| \"pdf\";\n }): Promise<\n As extends \"arrayBuffer\"\n ? Record<string, ArrayBuffer \| null>\n : Record<string, string \| null>\n > {\n const rawResponse = await this.#get<GetImagesResponse>(\n `v1/images/${fileKey}?ids=${nodeIds}&format=${format}&scale=${scale}`\n );\n\n const images = rawResponse.images;\n\n if (as === \"links\") {\n return images as As extends \"arrayBuffer\"\n ? Record<string, ArrayBuffer \| null>\n : Record<string, string \| null>;\n }\n\n const downloadImagePromises = nodeIds.map(async (nodeId) => {\n const imageUrl = images[nodeId];\n if (!imageUrl) {\n return null;\n }\n\n const fetchResponse = await this.#fetch(imageUrl);\n\n if (!fetchResponse.ok) {\n return null;\n }\n\n const imageBlob = await fetchResponse.arrayBuffer();\n return imageBlob;\n });\n\n const downloadedImages = await Promise.allSettled(downloadImagePromises);\n\n const result = nodeIds.reduce(\n (acc, nodeId, index) => {\n const settledResult = downloadedImages[index];\n if (settledResult.status === \"fulfilled\") {\n acc[nodeId] = settledResult.value;\n } else {\n acc[nodeId] = null;\n }\n return acc;\n },\n {} as Record<string, ArrayBuffer \| null>\n );\n\n return result as As extends \"arrayBuffer\"\n ? Record<string, ArrayBuffer \| null>\n : Record<string, string \| null>;\n }\n\n async getImageFills({\n fileKey,\n }: {\n fileKey: string;\n }): Promise<Record<string, string>> {\n const url = `v1/files/${fileKey}/images`;\n const response = await this.#get<GetImageFillsResponse>(url);\n return response.meta?.images ?? {};\n }\n\n async getMe() {\n const url = `v1/me`;\n const response = await this.#get<GetMeResponse>(url);\n return response;\n }\n}\n\nexport { FigmaRestApi };\n","/* eslint-disable @typescript-eslint/no-explicit-any /\nimport { GetFileResponse } from \"@figma/rest-api-spec\";\nimport { gzip } from \"pako\";\nimport { CodegenError, CodegenRouteErrorReason } from \"./errors\";\nimport { validateSettings } from \"./settings\";\nimport {\n AnimaSDKResult,\n AttachToGenerationJobParams,\n GetCodeFromWebsiteHandler,\n GetCodeFromWebsiteParams,\n GetCodeFromPromptHandler,\n GetCodeFromPromptParams,\n GetCodeHandler,\n GetCodeParams,\n GetLink2CodeParams,\n SSEGetCodeFromWebsiteMessage,\n SSEGetCodeFromPromptMessage,\n SSEGetCodeFromFigmaMessage,\n JobType,\n} from \"./types\";\nimport { isNodeCodegenCompatible } from \"./utils/isNodeCodegenCompatible\";\nimport { FigmaRestApi } from \"./FigmaRestApi\";\n\nconst JOB_TYPE_CONVERSION_MAP: Record<string, JobType> = {\n codegen: \"f2c\",\n l2c: \"l2c\",\n p2c: \"p2c\",\n};\n\nexport type Auth =\n \| { token: string; teamId: string } // for Anima user, it's mandatory to have an associated team\n \| { token: string; userId?: string }; // for users from a 3rd-party integrations, they may have optionally a user id\n\nexport class Anima {\n #auth?: Auth;\n #apiBaseAddress: string;\n #figmaRestApi: FigmaRestApi;\n\n constructor({\n auth,\n apiBaseAddress = \"https://public-api.animaapp.com\",\n figmaRestApi = new FigmaRestApi(),\n }: {\n auth?: Auth;\n apiBaseAddress?: string;\n path?: string;\n figmaRestApi?: FigmaRestApi;\n } = {}) {\n this.#apiBaseAddress = apiBaseAddress;\n this.#figmaRestApi = figmaRestApi;\n\n if (auth) {\n this.auth = auth;\n }\n }\n\n protected hasAuth() {\n return !!this.#auth;\n }\n\n set auth(auth: Auth) {\n this.#auth = auth;\n }\n\n protected get headers() {\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n };\n\n if (this.#auth) {\n headers[\"Authorization\"] = `Bearer ${this.#auth.token}`;\n\n if (\"teamId\" in this.#auth) {\n headers[\"X-Team-Id\"] = this.#auth.teamId;\n }\n }\n\n return headers;\n }\n\n async #checkGivenNodeIsValid(\n design: GetFileResponse,\n nodesId: string[],\n options: {\n allowAutoSelectFirstNode: boolean;\n }\n ) {\n const isCompatibleResults = nodesId.map((nodeId) =>\n isNodeCodegenCompatible(design, nodeId, options)\n );\n\n const error = isCompatibleResults.find(\n (isCompatible) => !isCompatible.isValid\n );\n\n if (error) {\n throw new CodegenError({\n name: \"Task Crashed\",\n reason: error.reason,\n });\n }\n }\n\n /\n Generic method to handle API requests and stream processing for code generation flows.\n \n @param endpoint - The API endpoint to call\n * @param requestJson - The JSON to send\n * @param handler - The handler for processing messages\n * @param messageType - The type of messages being processed (for TypeScript type safety)\n * @returns The result of the generation process\n /\n async #processGenerationRequest<\n T extends\n \| SSEGetCodeFromFigmaMessage\n \| SSEGetCodeFromWebsiteMessage\n \| SSEGetCodeFromPromptMessage,\n >(\n method: \"GET\" \| \"POST\",\n endpoint: string,\n requestJson: object,\n handler: ((message: T) => void) \| Record<string, any>,\n messageType?: \"codegen\" \| \"l2c\" \| \"p2c\",\n signal?: AbortSignal\n ): Promise<AnimaSDKResult> {\n if (this.hasAuth() === false) {\n throw new Error('It needs to set \"auth\" before calling this method.');\n }\n\n const result: Partial<AnimaSDKResult> = {};\n const init: RequestInit = {\n method,\n headers: {\n ...this.headers,\n Accept: \"text/event-stream\",\n },\n signal,\n };\n if (method === \"POST\") {\n const requestBody = gzip(JSON.stringify(requestJson));\n init.body = requestBody;\n init.headers = {\n ...(init.headers as HeadersInit),\n \"Content-Encoding\": \"gzip\",\n \"Content-Type\": \"application/json\",\n };\n }\n\n const response = await fetch(`${this.#apiBaseAddress}${endpoint}`, init);\n\n if (!response.ok) {\n const errorText = await response.text();\n\n let errorObj = undefined;\n try {\n errorObj = JSON.parse(errorText);\n } catch {}\n\n if (errorObj?.error?.name === \"ZodError\") {\n console.log(\n \"Zod validation error:\",\n JSON.stringify(errorObj.error.issues, null, 2)\n );\n throw new CodegenError({\n name: \"HTTP error from Anima API\",\n reason: \"Invalid body payload\",\n detail: errorObj.error.issues,\n status: response.status,\n });\n }\n\n if (typeof errorObj === \"object\") {\n throw new CodegenError({\n name: `Error \"${errorObj}\"`,\n reason: \"Unknown\",\n status: response.status,\n });\n }\n\n throw new CodegenError({\n name: \"HTTP error from Anima API\",\n reason: errorText as CodegenRouteErrorReason,\n status: response.status,\n });\n }\n\n if (!response.body) {\n throw new CodegenError({\n name: \"Stream Error\",\n reason: \"Response body is null\",\n status: response.status,\n });\n }\n\n const rawJobType = response.headers.get(\"x-anima-job-type\");\n const jobType = rawJobType && JOB_TYPE_CONVERSION_MAP[rawJobType];\n if (jobType && typeof handler === \"function\") {\n handler({ type: \"set_job_type\", payload: { jobType } } as T);\n }\n\n const reader = response.body.getReader();\n const decoder = new TextDecoder();\n let buffer = \"\";\n\n try {\n while (true) {\n const { done, value } = await reader.read();\n if (done) {\n break;\n }\n\n buffer += decoder.decode(value, { stream: true });\n\n const lines = buffer.split(\"\\n\");\n\n // Process all complete lines\n buffer = lines.pop() \|\| \"\"; // Keep the last incomplete line in the buffer\n\n for (const line of lines) {\n if (!line.trim() \|\| line.startsWith(\":\")) continue;\n\n if (line.startsWith(\"data: \")) {\n let data: T;\n try {\n data = JSON.parse(line.slice(6));\n } catch {\n // ignore malformed JSON\n continue;\n }\n\n switch (data.type) {\n case \"queueing\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onQueueing?.({\n sessionId: (data as any).sessionId,\n });\n break;\n }\n case \"start\": {\n result.sessionId = (data as any).sessionId;\n typeof handler === \"function\"\n ? handler(data)\n : handler.onStart?.({ sessionId: (data as any).sessionId });\n break;\n }\n\n case \"pre_codegen\": {\n if (messageType === \"codegen\") {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onPreCodegen?.({\n message: (data as any).message,\n });\n }\n break;\n }\n\n case \"assets_uploaded\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onAssetsUploaded?.();\n break;\n }\n\n case \"assets_list\": {\n result.assets = (data as any).payload.assets;\n\n typeof handler === \"function\"\n ? handler(data)\n : handler.onAssetsList?.((data as any).payload);\n break;\n }\n\n case \"figma_metadata\": {\n if (messageType === \"codegen\") {\n result.figmaFileName = (data as any).figmaFileName;\n result.figmaSelectedFrameName = (\n data as any\n ).figmaSelectedFrameName;\n\n typeof handler === \"function\"\n ? handler(data)\n : handler.onFigmaMetadata?.({\n figmaFileName: (data as any).figmaFileName,\n figmaSelectedFrameName: (data as any)\n .figmaSelectedFrameName,\n });\n }\n break;\n }\n\n case \"generating_code\": {\n if ((data as any).payload.status === \"success\") {\n result.files = (data as any).payload.files;\n }\n\n typeof handler === \"function\"\n ? handler(data)\n : handler.onGeneratingCode?.({\n status: (data as any).payload.status,\n progress: (data as any).payload.progress,\n files: (data as any).payload.files,\n });\n break;\n }\n\n case \"progress_messages_updated\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onProgressMessagesUpdated?.(\n data.payload.progressMessages\n );\n break;\n }\n\n case \"job_status_updated\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onJobStatusUpdated?.(data.payload.jobStatus);\n break;\n }\n\n case \"codegen_completed\":\n case \"generation_completed\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onCodegenCompleted?.();\n break;\n }\n\n case \"error\": {\n throw new CodegenError({\n name: (data as any).payload.errorName,\n reason: (data as any).payload.reason,\n });\n }\n\n case \"done\": {\n result.tokenUsage = (data as any).payload.tokenUsage;\n result.sessionId = (data as any).payload.sessionId;\n return result as AnimaSDKResult;\n }\n }\n }\n }\n }\n } finally {\n reader.cancel();\n }\n\n throw new CodegenError({\n name: \"Connection\",\n reason: \"Connection closed before the 'done' message\",\n status: 500,\n });\n }\n\n async generateCode(\n params: GetCodeParams,\n handler: GetCodeHandler = {},\n signal?: AbortSignal\n ) {\n let design: GetFileResponse \| undefined;\n try {\n design = await this.#figmaRestApi\n .withOptions({ token: params.figmaToken, abortSignal: signal })\n .getFile({\n fileKey: params.fileKey,\n });\n } catch (error) {\n if (error instanceof Error && error.name === \"AbortError\") {\n // The caller aborted the request, no need to fall through\n throw error;\n }\n\n // ignore any errors when trying to get the figma file to retry later in the backend\n }\n\n const settings = validateSettings(params.settings);\n\n if (design) {\n await this.#checkGivenNodeIsValid(design, params.nodesId, {\n allowAutoSelectFirstNode: settings.allowAutoSelectFirstNode ?? true,\n });\n }\n\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n const requestJson = {\n tracking,\n fileKey: params.fileKey,\n figmaToken: params.figmaToken,\n nodesId: params.nodesId,\n figmaRateLimitMaxWait: params.figmaRateLimitMaxWait,\n assetsStorage: params.assetsStorage,\n language: settings.language,\n model: settings.model,\n framework: settings.framework,\n styling: settings.styling,\n uiLibrary: settings.uiLibrary,\n enableTranslation: settings.enableTranslation,\n enableUILibraryTheming: settings.enableUILibraryTheming,\n enableCompactStructure: settings.enableCompactStructure,\n enableAutoSplit: settings.enableAutoSplit,\n autoSplitThreshold: settings.autoSplitThreshold,\n disableMarkedForExport: settings.disableMarkedForExport,\n allowAutoSelectFirstNode: settings.allowAutoSelectFirstNode,\n enableDisplayScreenModelId: settings.enableDisplayScreenModelId,\n enableGeneratePackageLock: settings.enableGeneratePackageLock,\n enableAnimationsPreset: settings.enableAnimationsPreset,\n enableDisplayDataId: settings.enableDisplayDataId,\n enableDisplayDataName: settings.enableDisplayDataName,\n codegenSettings: settings.codegenSettings,\n dsId: settings.designSystemId,\n webhookUrl: params.webhookUrl,\n prompt: params.prompt,\n images: params.images,\n // @ts-expect-error: We don't need to expose this parameter to GetCodeParams\n createSession: params.createSession,\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromFigmaMessage>(\n \"POST\",\n \"/v1/codegen\",\n requestJson,\n handler,\n \"codegen\",\n signal\n );\n }\n\n async generateCodeFromWebsite(\n params: GetCodeFromWebsiteParams,\n handler: GetCodeFromWebsiteHandler = {},\n signal?: AbortSignal\n ) {\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n let input;\n if (params.mhtmlUrl) {\n input = {\n type: \"hosted-mhtml\",\n mhtmlUrl: params.mhtmlUrl,\n url: params.url,\n };\n } else if (params.mhtml) {\n input = {\n type: \"mhtml\",\n mhtml: params.mhtml,\n url: params.url,\n };\n } else if (params.url) {\n input = {\n type: \"url\",\n url: params.url,\n };\n } else {\n throw new Error(\"Either 'url', 'mhtml' or 'mhtmlUrl' must be provided\");\n }\n\n let engine: \"react-v2\" \| undefined = undefined;\n if (params.experimental_useNewReactEngine) {\n engine = \"react-v2\";\n }\n\n const requestJson = {\n tracking,\n assetsStorage: params.assetsStorage,\n prompt: params.prompt,\n images: params.images,\n dsId: params.dsId,\n params: {\n input,\n conventions: {\n framework: params.settings.framework,\n language: params.settings.language,\n styling: params.settings.styling,\n },\n assetsStorage: {\n type: \"bundled\",\n },\n engine,\n },\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromWebsiteMessage>(\n \"POST\",\n \"/v1/l2c\",\n requestJson,\n handler,\n \"l2c\",\n signal\n );\n }\n\n /\n Generates code from a text prompt using AI.\n \n This method sends a prompt to the Anima API and generates code based on the description provided.\n * It supports real-time streaming of the generation process through Server-Sent Events (SSE).\n \n @param params - The parameters for code generation\n * @param params.prompt - The text prompt describing what code to generate\n * @param params.settings - Code generation settings (framework, language, styling, etc.)\n * @param params.assetsStorage - Optional asset storage configuration\n * @param params.tracking - Optional tracking information\n * @param params.webhookUrl - Optional webhook URL for completion notification\n * @param handler - Event handler for processing SSE messages during generation\n * @param signal - Optional AbortSignal to cancel the request\n * @returns Promise resolving to AnimaSDKResult with generated files and metadata\n \n @example\n * ```typescript\n * const result = await anima.generateCodeFromPrompt({\n * prompt: \"Create a login form with email and password fields\",\n * settings: {\n * framework: \"react\",\n * language: \"typescript\",\n * styling: \"tailwind\"\n * }\n * }, {\n * onStart: ({ sessionId }) => console.log(\"Started:\", sessionId),\n * onGeneratingCode: ({ progress }) => console.log(\"Progress:\", progress),\n * onCodegenCompleted: () => console.log(\"Generation completed!\")\n * });\n * ```\n /\n async generateCodeFromPrompt(\n params: GetCodeFromPromptParams,\n handler: GetCodeFromPromptHandler = {},\n signal?: AbortSignal\n ) {\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n const requestJson = {\n tracking,\n assetsStorage: params.assetsStorage,\n params: {\n prompt: params.prompt,\n guidelines: params.guidelines,\n images: params.images,\n conventions: {\n language: params.settings.language,\n framework: params.settings.framework,\n styling: params.settings.styling,\n uiLibrary: params.settings.uiLibrary,\n },\n dsId: params.settings.dsId,\n ...(params.settings.codegenSettings ?? {}),\n },\n webhookUrl: params.webhookUrl,\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromPromptMessage>(\n \"POST\",\n \"/v1/p2c\",\n requestJson,\n handler,\n \"p2c\",\n signal\n );\n }\n\n /\n @deprecated This method will be removed soon, please use `generateCodeFromWebsite` instead.\n /\n async generateLink2Code(\n params: GetLink2CodeParams,\n handler: GetCodeFromWebsiteHandler = {},\n signal?: AbortSignal\n ) {\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n const requestJson = {\n tracking,\n assetsStorage: params.assetsStorage,\n params: params.params,\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromWebsiteMessage>(\n \"POST\",\n \"/v1/l2c\",\n requestJson,\n handler,\n \"l2c\",\n signal\n );\n }\n\n async attachToGenerationJob<\n T extends\n \| SSEGetCodeFromFigmaMessage\n \| SSEGetCodeFromWebsiteMessage\n \| SSEGetCodeFromPromptMessage,\n >(\n params: AttachToGenerationJobParams,\n handler: ((message: T) => void) \| Record<string, any> = {},\n signal?: AbortSignal\n ) {\n const requestJson = {};\n const messageType = undefined;\n return this.#processGenerationRequest<T>(\n \"GET\",\n `/v1/jobs/${params.sessionId}`,\n requestJson,\n handler,\n messageType,\n signal\n );\n }\n}\n","export const isValidFigmaUrl = (\n figmaLink: string\n): [hasCorrectPrefix: boolean, fileKey: string, nodeId: string] => {\n if (!figmaLink) {\n return [false, \"\", \"\"];\n }\n\n try {\n const url = new URL(figmaLink);\n const path = url.pathname;\n\n if (\n url.origin !== \"https://www.figma.com\" &&\n url.origin !== \"https://embed.figma.com\"\n ) {\n return [false, \"\", \"\"];\n }\n\n const reconstructedUrl = url.toString();\n if (figmaLink !== reconstructedUrl) {\n return [false, \"\", \"\"];\n }\n\n const nodeId = (url.searchParams.get(\"node-id\") ?? \"\").replace(/-/g, \":\");\n const fileKey = path.split(\"/\")[2];\n const hasCorrectPrefix =\n (path.startsWith(\"/file/\") &&\n url.searchParams.get(\"type\") !== \"whiteboard\") \|\|\n path.startsWith(\"/design/\") \|\|\n path.startsWith(\"/proto/\");\n\n return [hasCorrectPrefix && fileKey.length === 22, fileKey, nodeId];\n } catch {\n return [false, \"\", \"\"];\n }\n};\n\nexport const formatToFigmaLink = ({\n fileKey,\n nodeId,\n duplicate,\n}: {\n fileKey: string;\n nodeId?: string;\n duplicate?: boolean;\n}) => {\n const url = new URL(\"https://www.figma.com\");\n url.pathname = `design/${fileKey}`;\n\n if (duplicate) {\n // The path to duplicate a file is `/design/{fileKey}/{fileName}/duplicate`.\n // The `fileName` is not used, so we can use a dummy value.\n url.pathname = `${url.pathname}/dummy/duplicate`;\n }\n\n if (nodeId) {\n url.searchParams.set(\"node-id\", nodeId.replace(\":\", \"-\"));\n }\n\n return url;\n};\n\nexport class ResponseError extends Error {\n response: Response;\n\n constructor(message: string, res: Response) {\n super(message);\n this.response = res;\n }\n}\n","import { AnimaFiles } from \"../types\";\n\nexport const getRelatedScreenFiles = ({\n files,\n screenPath = \"src/screens\",\n}: {\n files: AnimaFiles;\n screenPath?: string;\n}) => {\n const result: AnimaFiles = {};\n const processed = new Set<string>();\n\n function processFile(filePath: string) {\n if (processed.has(filePath) \|\| !files[filePath]) {\n return;\n }\n\n processed.add(filePath);\n result[filePath] = files[filePath];\n\n const imports = parseImports(files[filePath].content);\n\n imports.forEach((importPath) => {\n try {\n const resolvedPath = resolveImportPath(filePath, importPath);\n\n if (resolvedPath.startsWith(\"src/\")) {\n const importDir = resolvedPath.split(\"/\").slice(0, -1).join(\"/\");\n const dirFiles = getAllFilesInDirectory(files, importDir);\n dirFiles.forEach((file) => {\n if (!processed.has(file)) {\n processFile(file);\n }\n });\n }\n } catch (error) {\n console.warn(\n `Failed to resolve import ${importPath} in ${filePath}:`,\n error\n );\n }\n });\n }\n\n Object.entries(files).forEach(([key, value]) => {\n if (key.startsWith(screenPath)) {\n processFile(key);\n } else if (!key.startsWith(\"src/\")) {\n result[key] = value;\n }\n });\n\n return result;\n};\n\nfunction parseImports(content: string): string[] {\n const importRegex = /import.?[\"']([^\"']+)[\"']/g;\n const exports = /export.from\\s+[\"']([^\"']+)[\"']/g;\n const imports: string[] = [];\n let match;\n\n while ((match = importRegex.exec(content)) !== null) {\n imports.push(match[1]);\n }\n\n while ((match = exports.exec(content)) !== null) {\n imports.push(match[1]);\n }\n\n return [...new Set(imports)];\n}\n\nfunction resolveImportPath(basePath: string, importPath: string): string {\n if (!importPath.startsWith(\".\")) {\n return importPath;\n }\n\n const baseDir = basePath.split(\"/\").slice(0, -1);\n const importParts = importPath.split(\"/\");\n const resolvedParts: string[] = [...baseDir];\n\n for (const part of importParts) {\n if (part === \"..\") {\n resolvedParts.pop();\n } else if (part !== \".\") {\n resolvedParts.push(part);\n }\n }\n\n return resolvedParts.join(\"/\");\n}\n\nfunction getAllFilesInDirectory(files: AnimaFiles, dirPath: string): string[] {\n return Object.keys(files).filter((file) => file.startsWith(dirPath));\n}\n","/ eslint-disable @typescript-eslint/no-explicit-any /\nimport type { Anima } from \"./anima\";\nimport type { GetCodeFromFigmaErrorReason } from \"./errors\";\nimport type {\n AttachToGenerationJobParams,\n GetCodeParams,\n GetCodeFromWebsiteParams,\n GetCodeFromPromptParams,\n GetLink2CodeParams,\n SSEGetCodeFromWebsiteMessage,\n SSEGetCodeFromPromptMessage,\n SSEGetCodeFromFigmaMessageErrorPayload,\n SSEGetCodeFromFigmaMessage,\n} from \"./types\";\n\ntype StreamErrorPayload = {\n name: string;\n message: GetCodeFromFigmaErrorReason;\n status?: number;\n detail?: unknown;\n errorPayload?: SSEGetCodeFromFigmaMessageErrorPayload;\n};\n\nexport type StreamMessage<T> =\n \| Exclude<T, { type: \"error\" }>\n \| {\n type: \"error\";\n payload: StreamErrorPayload;\n };\n\nexport type StreamCodgenMessage = StreamMessage<SSEGetCodeFromFigmaMessage>;\nexport type StreamCodeFromWebsiteMessage =\n StreamMessage<SSEGetCodeFromWebsiteMessage>;\nexport type StreamCodeFromPromptMessage =\n StreamMessage<SSEGetCodeFromPromptMessage>;\nexport type StreamL2CMessage = StreamMessage<SSEGetCodeFromWebsiteMessage>;\n\n/\n Generic function to create a stream for both codegen and link2code.\n \n @param anima - An Anima service instance\n * @param params - Parameters for the generation process\n * @param generateMethod - The method to call on the Anima instance\n * @returns A ReadableStream that emits messages related to the generation process\n /\nfunction createGenerationStream<\n TParams,\n TMessage,\n TStreamMessage extends StreamMessage<TMessage>,\n>(\n anima: Anima,\n params: TParams,\n generateMethod: (\n params: TParams,\n handler: (message: TMessage) => void\n ) => Promise<any>\n): ReadableStream<TStreamMessage> {\n return new ReadableStream({\n start(controller) {\n generateMethod\n .call(anima, params, (message: any) => {\n if (message.type === \"error\") {\n // TODO: It's a dead code. It's never reached, since all errors are thrown.\n // controller.enqueue({\n // type: \"error\",\n // payload: { message: message.payload.reason },\n // });\n } else {\n controller.enqueue(message);\n }\n\n if (message.type === \"aborted\" \|\| message.type === \"error\") {\n controller.close();\n }\n })\n .then((_result) => {\n controller.enqueue({\n type: \"done\",\n payload: {\n tokenUsage: _result.tokenUsage,\n sessionId: _result.sessionId,\n },\n } as any);\n controller.close();\n })\n .catch((error) => {\n controller.enqueue({\n type: \"error\",\n payload: {\n name: \"name\" in error ? error.name : \"Unknown error\",\n message: \"message\" in error ? error.message : \"Unknown\",\n status: \"status\" in error ? error.status : undefined,\n detail: \"detail\" in error ? error.detail : undefined,\n errorPayload: \"payload\" in error ? error.payload : undefined,\n },\n } as any);\n controller.close();\n });\n },\n });\n}\n\n/\n Start the code generation and creates a ReadableStream to output its result.\n \n The stream is closed when the codegen ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodgenMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const createCodegenStream = (\n anima: Anima,\n params: GetCodeParams\n): ReadableStream<StreamCodgenMessage> => {\n return createGenerationStream<\n GetCodeParams,\n SSEGetCodeFromFigmaMessage,\n StreamCodgenMessage\n >(anima, params, anima.generateCode);\n};\n\n/\n Generic function to create a Server-Sent Events (SSE) Response from a stream.\n \n @param stream - The stream to convert to an SSE response\n * @returns A promise that resolves to an HTTP response\n /\nasync function createResponseEventStream<\n T extends { type: string; payload?: any },\n>(stream: ReadableStream<T>): Promise<Response> {\n const [verifyStream, consumerStream] = stream.tee();\n const firstMessage = await verifyStream.getReader().read();\n\n if (\n firstMessage.done \|\|\n !firstMessage.value \|\|\n (firstMessage.value.type === \"error\" && firstMessage.value.payload?.status)\n ) {\n return new Response(JSON.stringify(firstMessage.value), {\n status:\n firstMessage.value?.type === \"error\"\n ? (firstMessage.value.payload?.status ?? 500)\n : 500,\n headers: {\n \"Content-Type\": \"application/json\",\n },\n });\n }\n\n const encoder = new TextEncoder();\n const seeStream = consumerStream.pipeThrough(\n new TransformStream({\n transform(chunk, controller) {\n const sseString = `event: ${chunk.type}\\ndata: ${JSON.stringify(\n chunk\n )}\\n\\n`;\n controller.enqueue(encoder.encode(sseString));\n },\n })\n );\n\n return new Response(seeStream, {\n status: 200,\n headers: {\n \"Content-Type\": \"text/event-stream; charset=utf-8\",\n Connection: \"keep-alive\",\n \"Cache-Control\": \"no-cache\",\n },\n });\n}\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const createCodegenResponseEventStream = async (\n anima: Anima,\n params: GetCodeParams\n): Promise<Response> => {\n const stream = createCodegenStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n Start the code generation from website and creates a ReadableStream to output its result.\n \n The stream is closed when the code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeFromWebsiteParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodeFromWebsiteMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const createCodeFromWebsiteStream = (\n anima: Anima,\n params: GetCodeFromWebsiteParams\n): ReadableStream<StreamCodeFromWebsiteMessage> => {\n return createGenerationStream<\n GetCodeFromWebsiteParams,\n SSEGetCodeFromWebsiteMessage,\n StreamCodeFromWebsiteMessage\n >(anima, params, anima.generateCodeFromWebsite);\n};\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation from website stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeFromWebsiteParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const createCodeFromWebsiteResponseEventStream = async (\n anima: Anima,\n params: GetCodeFromWebsiteParams\n): Promise<Response> => {\n const stream = createCodeFromWebsiteStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n Prompt to Code (p2c) stream flow.\n \n Start the prompt to code generation and creates a ReadableStream to output its result.\n \n The stream is closed when the code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeFromPromptParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodeFromPromptMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const createCodeFromPromptStream = (\n anima: Anima,\n params: GetCodeFromPromptParams\n): ReadableStream<StreamCodeFromPromptMessage> => {\n return createGenerationStream<\n GetCodeFromPromptParams,\n SSEGetCodeFromPromptMessage,\n StreamCodeFromPromptMessage\n >(anima, params, anima.generateCodeFromPrompt);\n};\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation from prompt stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeFromPromptParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const createCodeFromPromptResponseEventStream = async (\n anima: Anima,\n params: GetCodeFromPromptParams\n): Promise<Response> => {\n const stream = createCodeFromPromptStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n Creates a ReadableStream to output code generation result.\n \n The stream is closed when the code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeFromPromptParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodeFromPromptMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const attachToGenerationJobStream = (\n anima: Anima,\n params: AttachToGenerationJobParams\n): ReadableStream<\n \| StreamCodgenMessage\n \| StreamCodeFromWebsiteMessage\n \| StreamCodeFromPromptMessage\n> => {\n return createGenerationStream<\n AttachToGenerationJobParams,\n \| SSEGetCodeFromFigmaMessage\n \| SSEGetCodeFromWebsiteMessage\n \| SSEGetCodeFromPromptMessage,\n \| StreamCodgenMessage\n \| StreamCodeFromWebsiteMessage\n \| StreamCodeFromPromptMessage\n >(anima, params, anima.attachToGenerationJob);\n};\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeFromPromptParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const attachToGenerationJobResponseEventStream = async (\n anima: Anima,\n params: AttachToGenerationJobParams\n): Promise<Response> => {\n const stream = attachToGenerationJobStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n @deprecated This function will be removed soon, please use `createCodeFromWebsiteStream` instead.\n * @experimental\n * This API is experimental and may change or be removed in future releases.\n * Link2Code (l2c) stream flow.\n \n Start the URL to code generation and creates a ReadableStream to output its result.\n \n The stream is closed when the URL to code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetLink2CodeParams} params - Parameters required for the URL to code generation process.\n * @returns {ReadableStream<StreamL2CMessage>} - A ReadableStream that emits messages related to the URL to code generation process.\n /\nexport const createLink2CodeStream = (\n anima: Anima,\n params: GetLink2CodeParams\n): ReadableStream<StreamL2CMessage> => {\n return createGenerationStream<\n GetLink2CodeParams,\n SSEGetCodeFromWebsiteMessage,\n StreamL2CMessage\n >(anima, params, anima.generateLink2Code);\n};\n\n/\n @deprecated This function will be removed soon, please use `createCodeFromWebsiteResponseEventStream` instead.\n * Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the URL to code generation stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetLink2CodeParams} params - The parameters for the URL to code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n */\nexport const createLink2CodeResponseEventStream = async (\n anima: Anima,\n params: GetLink2CodeParams\n): Promise<Response> => {\n const stream = createLink2CodeStream(anima, params);\n return createResponseEventStream(stream);\n};\n"],"names":["Z_FIXED$1","Z_BINARY","Z_TEXT","Z_UNKNOWN$1","zero$1","buf","len","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH$1","MAX_MATCH$1","LENGTH_CODES$1","LITERALS$1","L_CODES$1","D_CODES$1","BL_CODES$1","HEAP_SIZE$1","MAX_BITS$1","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","d_code","dist","put_short","s","w","send_bits","value","length","send_code","c","tree","bi_reverse","code","res","bi_flush","gen_bitlen","desc","max_code","stree","has_stree","extra","base","h","n","m","bits","xbits","f","overflow","gen_codes","bl_count","next_code","tr_static_init","init_block","bi_windup","smaller","depth","_n2","_m2","pqdownheap","k","v","j","compress_block","ltree","dtree","lc","sx","build_tree","node","scan_tree","prevlen","curlen","nextlen","count","max_count","min_count","send_tree","build_bl_tree","max_blindex","send_all_trees","lcodes","dcodes","blcodes","rank","detect_data_type","block_mask","static_init_done","_tr_init$1","_tr_stored_block$1","stored_len","last","_tr_align$1","_tr_flush_block$1","opt_lenb","static_lenb","_tr_tally$1","_tr_init_1","_tr_stored_block_1","_tr_flush_block_1","_tr_tally_1","_tr_align_1","trees","adler32","adler","pos","s1","s2","adler32_1","makeTable","table","crcTable","crc32","crc","t","end","i","crc32_1","messages","constants$2","_tr_init","_tr_stored_block","_tr_flush_block","_tr_tally","_tr_align","Z_NO_FLUSH$2","Z_PARTIAL_FLUSH","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY$1","Z_UNKNOWN","Z_DEFLATED$2","MAX_MEM_LEVEL","MAX_WBITS$1","DEF_MEM_LEVEL","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","MIN_MATCH","MAX_MATCH","MIN_LOOKAHEAD","PRESET_DICT","INIT_STATE","GZIP_STATE","EXTRA_STATE","NAME_STATE","COMMENT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","OS_CODE","err","strm","errorCode","zero","slide_hash","p","wsize","HASH_ZLIB","prev","data","HASH","flush_pending","flush_block_only","put_byte","b","putShortMSB","read_buf","start","size","longest_match","cur_match","chain_length","scan","match","best_len","nice_match","limit","_win","wmask","strend","scan_end1","scan_end","fill_window","_w_size","more","str","deflate_stored","flush","min_block","left","have","used","deflate_fast","hash_head","bflush","deflate_slow","max_insert","deflate_rle","deflate_huff","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","lm_init","DeflateState","deflateStateCheck","deflateResetKeep","deflateReset","ret","deflateSetHeader","head","deflateInit2","level","method","windowBits","memLevel","strategy","wrap","deflateInit","deflate$2","old_flush","header","level_flags","beg","copy","gzhead_extra","val","bstate","deflateEnd","status","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","next","input","deflateInit_1","deflateInit2_1","deflateReset_1","deflateResetKeep_1","deflateSetHeader_1","deflate_2$1","deflateEnd_1","deflateSetDictionary_1","deflateInfo","deflate_1$2","_has","obj","key","assign","sources","source","flattenChunks","chunks","l","result","chunk","common","STR_APPLY_UIA_OK","__","_utf8len","q","string2buf","c2","m_pos","str_len","buf_len","buf2binstring","buf2string","max","out","utf16buf","c_len","utf8border","strings","ZStream","zstream","toString$1","Z_NO_FLUSH$1","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFAULT_COMPRESSION","Z_DEFAULT_STRATEGY","Z_DEFLATED$1","Deflate$1","options","opt","dict","flush_mode","chunkSize","_flush_mode","deflate$1","deflator","gzip$1","gzip_1$1","deflate_1$1","gzip","gzip_1","CodegenError","name","reason","detail","MalformattedFigmaToken","MissingFigmaToken","NeedsReauthFigmaToken","ExpiredFigmaToken","FileNotExportable","UnknownForbiddenFigmaError","notFoundErrorMessage","NotFound","cause","isNotFound","error","unknownFigmaApiExceptionMessage","UnknownFigmaApiException","isUnknownFigmaApiException","rateLimitExceededErrorMessage","RateLimitExceeded","isRateLimitExceeded","requestTooLargeMessage","RequestTooLarge","isRequestTooLarge","$constructor","initializer","params","init","inst","def","_","proto","keys","Parent","_a","Definition","fn","_b","$ZodAsyncError","$ZodEncodeError","globalConfig","config","newConfig","getEnumValues","entries","numericValues","jsonStringifyReplacer","cached","getter","nullish","cleanRegex","floatSafeRemainder","step","valDecCount","stepString","stepDecCount","decCount","valInt","stepInt","__pow","EVALUATING","defineLazy","object","assignProp","target","prop","mergeDefs","defs","mergedDescriptors","descriptors","esc","slugify","captureStackTrace","_args","isObject","allowsEval","F","isPlainObject","o","ctor","prot","shallowClone","__spreadValues","propertyKeyTypes","escapeRegex","clone","cl","normalizeParams","_params","__spreadProps","optionalKeys","shape","NUMBER_FORMAT_RANGES","pick","schema","mask","currDef","checks","newShape","omit","extend","existingShape","_shape","safeExtend","merge","a","partial","Class","oldShape","required","aborted","x","startIndex","prefixIssues","path","issues","iss","unwrapMessage","message","finalizeIssue","ctx","full","_k","_j","_h","_f","_d","_c","_e","_g","_i","getLengthableOrigin","issue","args","util.jsonStringifyReplacer","$ZodError","$ZodRealError","flattenError","mapper","fieldErrors","formErrors","sub","formatError","processError","curr","el","_parse","_Err","_ctx","core.$ZodAsyncError","e","util.finalizeIssue","core.config","util.captureStackTrace","_parseAsync","__async","_safeParse","errors.$ZodError","safeParse","errors.$ZodRealError","_safeParseAsync","safeParseAsync","_encode","_decode","_encodeAsync","_decodeAsync","_safeEncode","_safeDecode","_safeEncodeAsync","_safeDecodeAsync","cuid","cuid2","ulid","xid","ksuid","nanoid","duration","guid","uuid","version","email","_emoji","emoji","ipv4","ipv6","cidrv4","cidrv6","base64","base64url","e164","dateSource","date","timeSource","hhmm","time","datetime","opts","timeRegex","string","regex","integer","number","boolean","lowercase","uppercase","$ZodCheck","core.$constructor","numericOriginMap","$ZodCheckLessThan","origin","bag","payload","$ZodCheckGreaterThan","$ZodCheckMultipleOf","util.floatSafeRemainder","$ZodCheckNumberFormat","isInt","minimum","maximum","util.NUMBER_FORMAT_RANGES","regexes.integer","$ZodCheckMaxLength","util.nullish","util.getLengthableOrigin","$ZodCheckMinLength","$ZodCheckLengthEquals","tooBig","$ZodCheckStringFormat","$ZodCheckRegex","$ZodCheckLowerCase","regexes.lowercase","$ZodCheckUpperCase","regexes.uppercase","$ZodCheckIncludes","escapedRegex","util.escapeRegex","pattern","$ZodCheckStartsWith","$ZodCheckEndsWith","$ZodCheckOverwrite","Doc","arg","lines","minIndent","dedented","line","$ZodType","ch","runChecks","isAborted","util.aborted","asyncResult","currLen","handleCanaryResult","canary","checkResult","util.defineLazy","r","$ZodString","regexes.string","$ZodStringFormat","checks.$ZodCheckStringFormat","$ZodGUID","regexes.guid","$ZodUUID","regexes.uuid","$ZodEmail","regexes.email","$ZodURL","trimmed","url","$ZodEmoji","regexes.emoji","$ZodNanoID","regexes.nanoid","$ZodCUID","regexes.cuid","$ZodCUID2","regexes.cuid2","$ZodULID","regexes.ulid","$ZodXID","regexes.xid","$ZodKSUID","regexes.ksuid","$ZodISODateTime","regexes.datetime","$ZodISODate","regexes.date","$ZodISOTime","regexes.time","$ZodISODuration","regexes.duration","$ZodIPv4","regexes.ipv4","$ZodIPv6","regexes.ipv6","$ZodCIDRv4","regexes.cidrv4","$ZodCIDRv6","regexes.cidrv6","parts","address","prefix","prefixNum","isValidBase64","$ZodBase64","regexes.base64","isValidBase64URL","regexes.base64url","padded","$ZodBase64URL","$ZodE164","regexes.e164","isValidJWT","token","algorithm","tokensParts","parsedHeader","$ZodJWT","$ZodNumber","regexes.number","received","$ZodNumberFormat","checks.$ZodCheckNumberFormat","$ZodBoolean","regexes.boolean","$ZodUnknown","$ZodNever","handleArrayResult","final","index","util.prefixIssues","$ZodArray","proms","item","handlePropertyResult","isOptionalOut","normalizeDef","okeys","util.optionalKeys","handleCatchall","unrecognized","keySet","_catchall","$ZodObject","sh","newSh","_normalized","util.cached","propValues","field","util.isObject","catchall","$ZodObjectJIT","superParse","generateFastpass","doc","normalized","parseStr","util.esc","ids","counter","id","fastpass","jit","core.globalConfig","fastEnabled","util.allowsEval","handleUnionResults","results","nonaborted","$ZodUnion","option","patterns","util.cleanRegex","single","first","async","$ZodIntersection","right","handleIntersectionResults","mergeValues","util.isPlainObject","bKeys","sharedKeys","newObj","sharedValue","newArray","itemA","itemB","unrecKeys","unrecIssue","bothKeys","merged","$ZodRecord","values","recordKeys","keyResult","retryResult","$ZodEnum","util.getEnumValues","valuesSet","util.propertyKeyTypes","$ZodLiteral","$ZodTransform","core.$ZodEncodeError","_out","output","handleOptionalResult","$ZodOptional","$ZodExactOptional","$ZodNullable","$ZodDefault","handleDefaultResult","$ZodPrefault","$ZodNonOptional","handleNonOptionalResult","$ZodCatch","$ZodPipe","handlePipeResult","$ZodReadonly","handleReadonlyResult","$ZodCustom","checks.$ZodCheck","handleRefineResult","_iss","util.issue","$ZodRegistry","_meta","meta","pm","registry","globalRegistry","_string","util.normalizeParams","_email","_guid","_uuid","_uuidv4","_uuidv6","_uuidv7","_url","_nanoid","_cuid","_cuid2","_ulid","_xid","_ksuid","_ipv4","_ipv6","_cidrv4","_cidrv6","_base64","_base64url","_e164","_jwt","_isoDateTime","_isoDate","_isoTime","_isoDuration","_number","_int","_boolean","_unknown","_never","_lt","checks.$ZodCheckLessThan","_lte","_gt","checks.$ZodCheckGreaterThan","_gte","_multipleOf","checks.$ZodCheckMultipleOf","_maxLength","checks.$ZodCheckMaxLength","_minLength","checks.$ZodCheckMinLength","_length","checks.$ZodCheckLengthEquals","_regex","checks.$ZodCheckRegex","_lowercase","checks.$ZodCheckLowerCase","_uppercase","checks.$ZodCheckUpperCase","_includes","includes","checks.$ZodCheckIncludes","_startsWith","checks.$ZodCheckStartsWith","_endsWith","suffix","checks.$ZodCheckEndsWith","_overwrite","tx","checks.$ZodCheckOverwrite","_normalize","form","_trim","_toLowerCase","_toUpperCase","_slugify","util.slugify","_array","element","_refine","_superRefine","_check","_issue","initializeContext","process","seen","overrideSchema","_json","processor","parent","isTransforming","extractDefs","root","idToSchema","entry","existing","makeURI","defsSegment","externalId","uriGenerator","defUriPrefix","defId","extractToDef","ref","ext","finalize","flattenRef","zodSchema","_cached","refSeen","refSchema","parentSeen","finalized","createStandardJSONSchemaMethod","_err","_schema","createToJSONSchemaMethod","processors","io","libraryOptions","formatMap","stringProcessor","json","format","contentEncoding","regexes","numberProcessor","multipleOf","exclusiveMaximum","exclusiveMinimum","booleanProcessor","neverProcessor","unknownProcessor","enumProcessor","literalProcessor","vals","customProcessor","transformProcessor","arrayProcessor","objectProcessor","allKeys","requiredKeys","unionProcessor","isExclusive","intersectionProcessor","isSimpleIntersection","allOf","recordProcessor","keyType","keyBag","valueSchema","keyValues","validKeyValues","nullableProcessor","inner","nonoptionalProcessor","defaultProcessor","prefaultProcessor","catchProcessor","catchValue","pipeProcessor","innerType","readonlyProcessor","optionalProcessor","ZodISODateTime","core.$ZodISODateTime","schemas.ZodStringFormat","core._isoDateTime","ZodISODate","core.$ZodISODate","core._isoDate","ZodISOTime","core.$ZodISOTime","core._isoTime","ZodISODuration","core.$ZodISODuration","core._isoDuration","core.formatError","core.flattenError","ZodRealError","parse","core._parse","parseAsync","core._parseAsync","core._safeParse","core._safeParseAsync","encode","core._encode","decode","core._decode","encodeAsync","core._encodeAsync","decodeAsync","core._decodeAsync","safeEncode","core._safeEncode","safeDecode","core._safeDecode","safeEncodeAsync","core._safeEncodeAsync","safeDecodeAsync","core._safeDecodeAsync","ZodType","core.$ZodType","util.mergeDefs","core.clone","reg","parse.parse","parse.safeParse","parse.parseAsync","parse.safeParseAsync","parse.encode","parse.decode","parse.encodeAsync","parse.decodeAsync","parse.safeEncode","parse.safeDecode","parse.safeEncodeAsync","parse.safeDecodeAsync","check","refine","refinement","superRefine","checks.overwrite","optional","exactOptional","nullable","nonoptional","array","union","intersection","pipe","transform","_default","prefault","_catch","readonly","description","core.globalRegistry","_ZodString","core.$ZodString","processors.stringProcessor","checks.regex","checks.includes","checks.startsWith","checks.endsWith","checks.minLength","checks.maxLength","checks.length","checks.lowercase","checks.uppercase","checks.trim","checks.normalize","checks.toLowerCase","checks.toUpperCase","checks.slugify","ZodString","core._email","ZodEmail","core._url","ZodURL","core._jwt","ZodJWT","core._emoji","ZodEmoji","core._guid","ZodGUID","core._uuid","ZodUUID","core._uuidv4","core._uuidv6","core._uuidv7","core._nanoid","ZodNanoID","core._cuid","ZodCUID","core._cuid2","ZodCUID2","core._ulid","ZodULID","core._base64","ZodBase64","core._base64url","ZodBase64URL","core._xid","ZodXID","core._ksuid","ZodKSUID","core._ipv4","ZodIPv4","core._ipv6","ZodIPv6","core._cidrv4","ZodCIDRv4","core._cidrv6","ZodCIDRv6","core._e164","ZodE164","iso.datetime","iso.date","iso.time","iso.duration","core._string","ZodStringFormat","core.$ZodStringFormat","core.$ZodEmail","core.$ZodGUID","core.$ZodUUID","core.$ZodURL","core.$ZodEmoji","core.$ZodNanoID","core.$ZodCUID","core.$ZodCUID2","core.$ZodULID","core.$ZodXID","core.$ZodKSUID","core.$ZodIPv4","core.$ZodIPv6","core.$ZodCIDRv4","core.$ZodCIDRv6","core.$ZodBase64","core.$ZodBase64URL","core.$ZodE164","core.$ZodJWT","ZodNumber","core.$ZodNumber","processors.numberProcessor","checks.gt","checks.gte","checks.lt","checks.lte","int","checks.multipleOf","core._number","ZodNumberFormat","core.$ZodNumberFormat","core._int","ZodBoolean","core.$ZodBoolean","processors.booleanProcessor","core._boolean","ZodUnknown","core.$ZodUnknown","processors.unknownProcessor","unknown","core._unknown","ZodNever","core.$ZodNever","processors.neverProcessor","never","core._never","ZodArray","core.$ZodArray","processors.arrayProcessor","minLength","maxLength","core._array","ZodObject","core.$ZodObjectJIT","processors.objectProcessor","_enum","incoming","util.extend","util.safeExtend","other","util.merge","util.pick","util.omit","util.partial","ZodOptional","util.required","ZodNonOptional","ZodUnion","core.$ZodUnion","processors.unionProcessor","ZodIntersection","core.$ZodIntersection","processors.intersectionProcessor","ZodRecord","core.$ZodRecord","processors.recordProcessor","record","valueType","ZodEnum","core.$ZodEnum","processors.enumProcessor","newEntries","ZodLiteral","core.$ZodLiteral","processors.literalProcessor","literal","ZodTransform","core.$ZodTransform","processors.transformProcessor","core.$ZodOptional","processors.optionalProcessor","ZodExactOptional","core.$ZodExactOptional","ZodNullable","core.$ZodNullable","processors.nullableProcessor","ZodDefault","core.$ZodDefault","processors.defaultProcessor","defaultValue","util.shallowClone","ZodPrefault","core.$ZodPrefault","processors.prefaultProcessor","core.$ZodNonOptional","processors.nonoptionalProcessor","ZodCatch","core.$ZodCatch","processors.catchProcessor","ZodPipe","core.$ZodPipe","processors.pipeProcessor","in_","ZodReadonly","core.$ZodReadonly","processors.readonlyProcessor","ZodCustom","core.$ZodCustom","processors.customProcessor","core._refine","core._superRefine","CodegenSettingsSchema","z.object","z.enum","z.boolean","z.union","z.literal","z.string","z.array","z.number","z.record","z.unknown","validateSettings","parsedObj","findChildrenNode","targetNodeId","child","found","validNodeTypes","isNodeCodegenCompatible","design","nodeId","validChildrenNodes","global","factory","module","this","promiseExists","globalObject","Obj","symbolExists","mapExists","setExists","weakMapExists","weakSetExists","dataViewExists","symbolIteratorExists","symbolToStringTagExists","setEntriesExists","mapEntriesExists","setIteratorPrototype","mapIteratorPrototype","arrayIteratorExists","arrayIteratorPrototype","stringIteratorExists","stringIteratorPrototype","toStringLeftSliceLength","toStringRightSliceLength","typeDetect","typeofObj","stringTag","objPrototype","isBufferExists","isBufferFromExists","isBuffer","detectType","collectionTypeSet","get","collection","type","isCollection","set","freeGlobalThis","freeGlobal","freeSelf","copyArrayBuffer","copyBoolean","copyDataView","copyBuffer","cloneBuffer","copyDate","copyNumber","copyRegExp","copyString","copyTypedArray","shallowCopy","getEmptyArray","getEmptyMap","getEmptyObject","getEmptySet","copyMap","noop","customizer","copyFunction","deepcopy","recursiveCopy","copiedValue","references","visited","collectionKey","collectionValue","collectionValueType","copiedCollectionValue","FigmaRestApi","fetch","baseAddress","defaultOptions","__privateAdd","_FigmaRestApi_instances","_baseAddress","_fetch","_nextOptions","_defaultOptions","__privateSet","__privateGet","__privateMethod","ensureValidToken_fn","headers","tokenInUse","_0","fileKey","nodeIds","urlSearchParams","searchQuery","get_fn","scale","as","images","downloadImagePromises","imageUrl","fetchResponse","downloadedImages","acc","settledResult","doRequest_fn","request","response","responseText","rawRetryAfter","retryAfter","resolve","reject","timeout","nextOptions","shouldRetry","JOB_TYPE_CONVERSION_MAP","Anima","auth","apiBaseAddress","figmaRestApi","_Anima_instances","_auth","_apiBaseAddress","_figmaRestApi","handler","signal","settings","checkGivenNodeIsValid_fn","tracking","requestJson","processGenerationRequest_fn","engine","nodesId","isCompatible","endpoint","messageType","requestBody","errorText","errorObj","rawJobType","jobType","reader","decoder","buffer","done","isValidFigmaUrl","figmaLink","reconstructedUrl","formatToFigmaLink","duplicate","ResponseError","getRelatedScreenFiles","files","screenPath","processed","processFile","filePath","parseImports","importPath","resolvedPath","resolveImportPath","importDir","getAllFilesInDirectory","file","content","importRegex","exports","imports","basePath","baseDir","importParts","resolvedParts","part","dirPath","createGenerationStream","anima","generateMethod","controller","_result","createCodegenStream","createResponseEventStream","stream","verifyStream","consumerStream","firstMessage","encoder","seeStream","sseString","createCodegenResponseEventStream","createCodeFromWebsiteStream","createCodeFromWebsiteResponseEventStream","createCodeFromPromptStream","createCodeFromPromptResponseEventStream","attachToGenerationJobStream","attachToGenerationJobResponseEventStream","createLink2CodeStream","createLink2CodeResponseEventStream"],"mappings":"mmCACA,wEA6BA,MAAMA,GAA0B,EAI1BC,GAAwB,EACxBC,GAAwB,EAExBC,GAA0B,EAKhC,SAASC,GAAOC,EAAK,CAAE,IAAIC,EAAMD,EAAI,OAAQ,KAAO,EAAEC,GAAO,GAAKD,EAAIC,CAAG,EAAI,CAAK,CAIlF,MAAMC,GAAe,EACfC,GAAe,EACfC,GAAe,EAGfC,GAAiB,EACjBC,GAAiB,IAQjBC,GAAkB,GAGlBC,GAAkB,IAGlBC,GAAkBD,GAAa,EAAID,GAGnCG,GAAkB,GAGlBC,GAAkB,GAGlBC,GAAkB,EAAIH,GAAY,EAGlCI,GAAkB,GAGlBC,GAAgB,GAQhBC,GAAc,EAGdC,GAAc,IAGdC,GAAc,GAGdC,GAAc,GAGdC,GAAc,GAIdC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAEtEC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,EAEhFC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAElDC,GACJ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAa3DC,GAAgB,IAGhBC,GAAgB,IAAI,OAAOhB,GAAY,GAAK,CAAC,EACnDV,GAAO0B,EAAY,EAOnB,MAAMC,GAAgB,IAAI,MAAMhB,GAAY,CAAC,EAC7CX,GAAO2B,EAAY,EAKnB,MAAMC,GAAgB,IAAI,MAAMH,EAAa,EAC7CzB,GAAO4B,EAAU,EAMjB,MAAMC,GAAgB,IAAI,MAAMtB,GAAcD,GAAc,CAAC,EAC7DN,GAAO6B,EAAY,EAGnB,MAAMC,GAAgB,IAAI,MAAMtB,EAAc,EAC9CR,GAAO8B,EAAW,EAGlB,MAAMC,GAAgB,IAAI,MAAMpB,EAAS,EACzCX,GAAO+B,EAAS,EAIhB,SAASC,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,EAAY,CAE9E,KAAK,YAAeJ,EACpB,KAAK,WAAeC,EACpB,KAAK,WAAeC,EACpB,KAAK,MAAeC,EACpB,KAAK,WAAeC,EAGpB,KAAK,UAAeJ,GAAeA,EAAY,MACjD,CAGA,IAAIK,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,EAAW,CACrC,KAAK,SAAWD,EAChB,KAAK,SAAW,EAChB,KAAK,UAAYC,CACnB,CAIA,MAAMC,GAAUC,GAEPA,EAAO,IAAMjB,GAAWiB,CAAI,EAAIjB,GAAW,KAAOiB,IAAS,EAAE,EAQhEC,GAAY,CAACC,EAAGC,IAAM,CAG1BD,EAAE,YAAYA,EAAE,SAAS,EAAKC,EAAK,IACnCD,EAAE,YAAYA,EAAE,SAAS,EAAKC,IAAM,EAAK,GAC3C,EAOMC,EAAY,CAACF,EAAGG,EAAOC,IAAW,CAElCJ,EAAE,SAAYhC,GAAWoC,GAC3BJ,EAAE,QAAWG,GAASH,EAAE,SAAY,MACpCD,GAAUC,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAASG,GAAUnC,GAAWgC,EAAE,SAClCA,EAAE,UAAYI,EAASpC,KAEvBgC,EAAE,QAAWG,GAASH,EAAE,SAAY,MACpCA,EAAE,UAAYI,EAElB,EAGMC,GAAY,CAACL,EAAGM,EAAGC,IAAS,CAEhCL,EAAUF,EAAGO,EAAKD,EAAI,CAAC,EAAYC,EAAKD,EAAI,EAAI,CAAC,CAAC,CACpD,EAQME,GAAa,CAACC,EAAMtD,IAAQ,CAEhC,IAAIuD,EAAM,EACV,GACEA,GAAOD,EAAO,EACdA,KAAU,EACVC,IAAQ,QACD,EAAEvD,EAAM,GACjB,OAAOuD,IAAQ,CACjB,EAMMC,GAAYX,GAAM,CAElBA,EAAE,WAAa,IACjBD,GAAUC,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAS,EACXA,EAAE,SAAW,GAEJA,EAAE,UAAY,IACvBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,OAAS,IACxCA,EAAE,SAAW,EACbA,EAAE,UAAY,EAElB,EAaMY,GAAa,CAACZ,EAAGa,IAAS,CAI9B,MAAMN,EAAkBM,EAAK,SACvBC,EAAkBD,EAAK,SACvBE,EAAkBF,EAAK,UAAU,YACjCG,EAAkBH,EAAK,UAAU,UACjCI,EAAkBJ,EAAK,UAAU,WACjCK,EAAkBL,EAAK,UAAU,WACjCvB,EAAkBuB,EAAK,UAAU,WACvC,IAAIM,EACAC,EAAGC,EACHC,EACAC,EACAC,EACAC,EAAW,EAEf,IAAKH,EAAO,EAAGA,GAAQvD,GAAYuD,IACjCtB,EAAE,SAASsB,CAAI,EAAI,EAQrB,IAFAf,EAAKP,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAY,EAEtCmB,EAAInB,EAAE,SAAW,EAAGmB,EAAIrD,GAAaqD,IACxCC,EAAIpB,EAAE,KAAKmB,CAAC,EACZG,EAAOf,EAAKA,EAAKa,EAAI,EAAI,CAAC,EAAY,EAAI,CAAC,EAAY,EACnDE,EAAOhC,IACTgC,EAAOhC,EACPmC,KAEFlB,EAAKa,EAAI,EAAI,CAAC,EAAYE,EAGtB,EAAAF,EAAIN,KAERd,EAAE,SAASsB,CAAI,IACfC,EAAQ,EACJH,GAAKF,IACPK,EAAQN,EAAMG,EAAIF,CAAI,GAExBM,EAAIjB,EAAKa,EAAI,CAAC,EACdpB,EAAE,SAAWwB,GAAKF,EAAOC,GACrBP,IACFhB,EAAE,YAAcwB,GAAKT,EAAMK,EAAI,EAAI,CAAC,EAAYG,KAGpD,GAAIE,IAAa,EAMjB,GAAG,CAED,IADAH,EAAOhC,EAAa,EACbU,EAAE,SAASsB,CAAI,IAAM,GAAKA,IACjCtB,EAAE,SAASsB,CAAI,IACftB,EAAE,SAASsB,EAAO,CAAC,GAAK,EACxBtB,EAAE,SAASV,CAAU,IAIrBmC,GAAY,CACd,OAASA,EAAW,GAOpB,IAAKH,EAAOhC,EAAYgC,IAAS,EAAGA,IAElC,IADAF,EAAIpB,EAAE,SAASsB,CAAI,EACZF,IAAM,GACXC,EAAIrB,EAAE,KAAK,EAAEmB,CAAC,EACV,EAAAE,EAAIP,KACJP,EAAKc,EAAI,EAAI,CAAC,IAAcC,IAE9BtB,EAAE,UAAYsB,EAAOf,EAAKc,EAAI,EAAI,CAAC,GAAad,EAAKc,EAAI,CAAC,EAC1Dd,EAAKc,EAAI,EAAI,CAAC,EAAYC,GAE5BF,KAGN,EAWMM,GAAY,CAACnB,EAAMO,EAAUa,IAAa,CAK9C,MAAMC,EAAY,IAAI,MAAM7D,GAAa,CAAC,EAC1C,IAAI0C,EAAO,EACPa,EACAF,EAKJ,IAAKE,EAAO,EAAGA,GAAQvD,GAAYuD,IACjCb,EAAQA,EAAOkB,EAASL,EAAO,CAAC,GAAM,EACtCM,EAAUN,CAAI,EAAIb,EASpB,IAAKW,EAAI,EAAIA,GAAKN,EAAUM,IAAK,CAC/B,IAAIjE,EAAMoD,EAAKa,EAAI,EAAI,CAAC,EACpBjE,IAAQ,IAEZoD,EAAKa,EAAI,CAAC,EAAaZ,GAAWoB,EAAUzE,CAAG,IAAKA,CAAG,EAIzD,CACF,EAMM0E,GAAiB,IAAM,CAE3B,IAAIT,EACAE,EACAlB,EACAK,EACAX,EACJ,MAAM6B,EAAW,IAAI,MAAM5D,GAAa,CAAC,EAiBzC,IADAqC,EAAS,EACJK,EAAO,EAAGA,EAAOhD,GAAiB,EAAGgD,IAExC,IADA1B,GAAY0B,CAAI,EAAIL,EACfgB,EAAI,EAAGA,EAAK,GAAK9C,GAAYmC,CAAI,EAAIW,IACxCtC,GAAasB,GAAQ,EAAIK,EAY7B,IAJA3B,GAAasB,EAAS,CAAC,EAAIK,EAG3BX,EAAO,EACFW,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAzB,GAAUyB,CAAI,EAAIX,EACbsB,EAAI,EAAGA,EAAK,GAAK7C,GAAYkC,CAAI,EAAIW,IACxCvC,GAAWiB,GAAM,EAAIW,EAKzB,IADAX,IAAS,EACFW,EAAO7C,GAAW6C,IAEvB,IADAzB,GAAUyB,CAAI,EAAIX,GAAQ,EACrBsB,EAAI,EAAGA,EAAK,GAAM7C,GAAYkC,CAAI,EAAI,EAAKW,IAC9CvC,GAAW,IAAMiB,GAAM,EAAIW,EAM/B,IAAKa,EAAO,EAAGA,GAAQvD,GAAYuD,IACjCK,EAASL,CAAI,EAAI,EAInB,IADAF,EAAI,EACGA,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IAEZ,KAAOP,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IAEZ,KAAOP,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IAEZ,KAAOP,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IASZ,IAHAD,GAAU/C,GAAchB,GAAY,EAAGgE,CAAQ,EAG1CP,EAAI,EAAGA,EAAIxD,GAAWwD,IACzBxC,GAAawC,EAAI,EAAI,CAAC,EAAY,EAClCxC,GAAawC,EAAI,CAAC,EAAaZ,GAAWY,EAAG,CAAC,EAIhD7B,GAAgB,IAAIN,GAAeN,GAAcL,GAAaZ,GAAa,EAAGC,GAAWI,EAAU,EACnGyB,GAAgB,IAAIP,GAAeL,GAAcL,GAAa,EAAYX,GAAWG,EAAU,EAC/F0B,GAAiB,IAAIR,GAAe,IAAI,MAAM,CAAC,EAAGT,GAAc,EAAWX,GAAYI,EAAW,CAGpG,EAMM6D,GAAc9B,GAAM,CAExB,IAAIoB,EAGJ,IAAKA,EAAI,EAAGA,EAAIzD,GAAYyD,IAAOpB,EAAE,UAAUoB,EAAI,CAAC,EAAa,EACjE,IAAKA,EAAI,EAAGA,EAAIxD,GAAYwD,IAAOpB,EAAE,UAAUoB,EAAI,CAAC,EAAa,EACjE,IAAKA,EAAI,EAAGA,EAAIvD,GAAYuD,IAAOpB,EAAE,QAAQoB,EAAI,CAAC,EAAa,EAE/DpB,EAAE,UAAU9B,GAAY,CAAC,EAAa,EACtC8B,EAAE,QAAUA,EAAE,WAAa,EAC3BA,EAAE,SAAWA,EAAE,QAAU,CAC3B,EAMM+B,GAAa/B,GACnB,CACMA,EAAE,SAAW,EACfD,GAAUC,EAAGA,EAAE,MAAM,EACZA,EAAE,SAAW,IAEtBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,QAEjCA,EAAE,OAAS,EACXA,EAAE,SAAW,CACf,EAMMgC,GAAU,CAACzB,EAAMa,EAAGC,EAAGY,IAAU,CAErC,MAAMC,EAAMd,EAAI,EACVe,EAAMd,EAAI,EAChB,OAAQd,EAAK2B,CAAG,EAAa3B,EAAK4B,CAAG,GAC7B5B,EAAK2B,CAAG,IAAe3B,EAAK4B,CAAG,GAAcF,EAAMb,CAAC,GAAKa,EAAMZ,CAAC,CAC1E,EAQMe,GAAa,CAACpC,EAAGO,EAAM8B,IAAM,CAKjC,MAAMC,EAAItC,EAAE,KAAKqC,CAAC,EAClB,IAAIE,EAAIF,GAAK,EACb,KAAOE,GAAKvC,EAAE,WAERuC,EAAIvC,EAAE,UACRgC,GAAQzB,EAAMP,EAAE,KAAKuC,EAAI,CAAC,EAAGvC,EAAE,KAAKuC,CAAC,EAAGvC,EAAE,KAAK,GAC/CuC,IAGE,CAAAP,GAAQzB,EAAM+B,EAAGtC,EAAE,KAAKuC,CAAC,EAAGvC,EAAE,KAAK,IAGvCA,EAAE,KAAKqC,CAAC,EAAIrC,EAAE,KAAKuC,CAAC,EACpBF,EAAIE,EAGJA,IAAM,EAERvC,EAAE,KAAKqC,CAAC,EAAIC,CACd,EASME,GAAiB,CAACxC,EAAGyC,EAAOC,IAAU,CAK1C,IAAI5C,EACA6C,EACAC,EAAK,EACLnC,EACAQ,EAEJ,GAAIjB,EAAE,WAAa,EACjB,GACEF,EAAOE,EAAE,YAAYA,EAAE,QAAU4C,GAAI,EAAI,IACzC9C,IAASE,EAAE,YAAYA,EAAE,QAAU4C,GAAI,EAAI,MAAS,EACpDD,EAAK3C,EAAE,YAAYA,EAAE,QAAU4C,GAAI,EAC/B9C,IAAS,EACXO,GAAUL,EAAG2C,EAAIF,CAAK,GAItBhC,EAAO3B,GAAa6D,CAAE,EACtBtC,GAAUL,EAAGS,EAAO/C,GAAa,EAAG+E,CAAK,EACzCxB,EAAQ3C,GAAYmC,CAAI,EACpBQ,IAAU,IACZ0B,GAAM5D,GAAY0B,CAAI,EACtBP,EAAUF,EAAG2C,EAAI1B,CAAK,GAExBnB,IACAW,EAAOZ,GAAOC,CAAI,EAGlBO,GAAUL,EAAGS,EAAMiC,CAAK,EACxBzB,EAAQ1C,GAAYkC,CAAI,EACpBQ,IAAU,IACZnB,GAAQd,GAAUyB,CAAI,EACtBP,EAAUF,EAAGF,EAAMmB,CAAK,UAOrB2B,EAAK5C,EAAE,UAGlBK,GAAUL,EAAG9B,GAAWuE,CAAK,CAC/B,EAWMI,GAAa,CAAC7C,EAAGa,IAAS,CAI9B,MAAMN,EAAWM,EAAK,SAChBE,EAAWF,EAAK,UAAU,YAC1BG,EAAYH,EAAK,UAAU,UAC3BxB,EAAWwB,EAAK,UAAU,MAChC,IAAIO,EAAGC,EACHP,EAAW,GACXgC,EASJ,IAHA9C,EAAE,SAAW,EACbA,EAAE,SAAWlC,GAERsD,EAAI,EAAGA,EAAI/B,EAAO+B,IACjBb,EAAKa,EAAI,CAAC,IAAe,GAC3BpB,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIc,EAAWM,EAClCpB,EAAE,MAAMoB,CAAC,EAAI,GAGbb,EAAKa,EAAI,EAAI,CAAC,EAAY,EAS9B,KAAOpB,EAAE,SAAW,GAClB8C,EAAO9C,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAKc,EAAW,EAAI,EAAEA,EAAW,EAC3DP,EAAKuC,EAAO,CAAC,EAAa,EAC1B9C,EAAE,MAAM8C,CAAI,EAAI,EAChB9C,EAAE,UAEEgB,IACFhB,EAAE,YAAce,EAAM+B,EAAO,EAAI,CAAC,GAStC,IALAjC,EAAK,SAAWC,EAKXM,EAAKpB,EAAE,UAAY,EAAcoB,GAAK,EAAGA,IAAOgB,GAAWpC,EAAGO,EAAMa,CAAC,EAK1E0B,EAAOzD,EACP,GAGE+B,EAAIpB,EAAE,KAAK,CAAC,EACZA,EAAE,KAAK,CAAC,EAAgBA,EAAE,KAAKA,EAAE,UAAU,EAC3CoC,GAAWpC,EAAGO,EAAM,CAAC,EAGrBc,EAAIrB,EAAE,KAAK,GAEXA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIoB,EACvBpB,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIqB,EAGvBd,EAAKuC,EAAO,CAAC,EAAavC,EAAKa,EAAI,CAAC,EAAab,EAAKc,EAAI,CAAC,EAC3DrB,EAAE,MAAM8C,CAAI,GAAK9C,EAAE,MAAMoB,CAAC,GAAKpB,EAAE,MAAMqB,CAAC,EAAIrB,EAAE,MAAMoB,CAAC,EAAIpB,EAAE,MAAMqB,CAAC,GAAK,EACvEd,EAAKa,EAAI,EAAI,CAAC,EAAYb,EAAKc,EAAI,EAAI,CAAC,EAAYyB,EAGpD9C,EAAE,KAAK,CAAC,EAAgB8C,IACxBV,GAAWpC,EAAGO,EAAM,CAAC,QAEdP,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,CAAC,EAK/BY,GAAWZ,EAAGa,CAAI,EAGlBa,GAAUnB,EAAMO,EAAUd,EAAE,QAAQ,CACtC,EAOM+C,GAAY,CAAC/C,EAAGO,EAAMO,IAAa,CAKvC,IAAIM,EACA4B,EAAU,GACVC,EAEAC,EAAU3C,EAAK,CAAS,EAExB4C,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAEd9C,GAAMO,EAAW,GAAK,EAAI,CAAC,EAAY,MAElCM,EAAI,EAAGA,GAAKN,EAAUM,IACzB6B,EAASC,EACTA,EAAU3C,GAAMa,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAE+B,EAAQC,GAAaH,IAAWC,KAG3BC,EAAQE,EACjBrD,EAAE,QAAQiD,EAAS,CAAC,GAAcE,EAEzBF,IAAW,GAEhBA,IAAWD,GAAWhD,EAAE,QAAQiD,EAAS,CAAC,IAC9CjD,EAAE,QAAQ7B,GAAU,CAAC,KAEZgF,GAAS,GAClBnD,EAAE,QAAQ5B,GAAY,CAAC,IAGvB4B,EAAE,QAAQ3B,GAAc,CAAC,IAG3B8E,EAAQ,EACRH,EAAUC,EAENC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOMC,GAAY,CAACtD,EAAGO,EAAMO,IAAa,CAKvC,IAAIM,EACA4B,EAAU,GACVC,EAEAC,EAAU3C,EAAK,CAAS,EAExB4C,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAGTjC,EAAI,EAAGA,GAAKN,EAAUM,IAIzB,GAHA6B,EAASC,EACTA,EAAU3C,GAAMa,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAE+B,EAAQC,GAAaH,IAAWC,GAG/B,IAAIC,EAAQE,EACjB,GAAKhD,GAAUL,EAAGiD,EAAQjD,EAAE,OAAO,QAAY,EAAEmD,IAAU,QAElDF,IAAW,GAChBA,IAAWD,IACb3C,GAAUL,EAAGiD,EAAQjD,EAAE,OAAO,EAC9BmD,KAGF9C,GAAUL,EAAG7B,GAAS6B,EAAE,OAAO,EAC/BE,EAAUF,EAAGmD,EAAQ,EAAG,CAAC,GAEhBA,GAAS,IAClB9C,GAAUL,EAAG5B,GAAW4B,EAAE,OAAO,EACjCE,EAAUF,EAAGmD,EAAQ,EAAG,CAAC,IAGzB9C,GAAUL,EAAG3B,GAAa2B,EAAE,OAAO,EACnCE,EAAUF,EAAGmD,EAAQ,GAAI,CAAC,GAG5BA,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOME,GAAiBvD,GAAM,CAE3B,IAAIwD,EAgBJ,IAbAT,GAAU/C,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAC3C+C,GAAU/C,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAG3C6C,GAAW7C,EAAGA,EAAE,OAAO,EASlBwD,EAAc3F,GAAa,EAAG2F,GAAe,GAC5CxD,EAAE,QAAQvB,GAAS+E,CAAW,EAAI,EAAI,CAAC,IAAc,EADNA,IACnD,CAKF,OAAAxD,EAAE,SAAW,GAAKwD,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,EAQMC,GAAiB,CAACzD,EAAG0D,EAAQC,EAAQC,IAAY,CAIrD,IAAIC,EASJ,IAHA3D,EAAUF,EAAG0D,EAAS,IAAK,CAAC,EAC5BxD,EAAUF,EAAG2D,EAAS,EAAK,CAAC,EAC5BzD,EAAUF,EAAG4D,EAAU,EAAI,CAAC,EACvBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B3D,EAAUF,EAAGA,EAAE,QAAQvB,GAASoF,CAAI,EAAI,EAAI,CAAC,EAAW,CAAC,EAI3DP,GAAUtD,EAAGA,EAAE,UAAW0D,EAAS,CAAC,EAGpCJ,GAAUtD,EAAGA,EAAE,UAAW2D,EAAS,CAAC,CAEtC,EAgBMG,GAAoB9D,GAAM,CAK9B,IAAI+D,EAAa,WACb,EAGJ,IAAK,EAAI,EAAG,GAAK,GAAI,IAAKA,KAAgB,EACxC,GAAKA,EAAa,GAAO/D,EAAE,UAAU,EAAI,CAAC,IAAe,EACvD,OAAOlD,GAKX,GAAIkD,EAAE,UAAU,EAAK,IAAe,GAAKA,EAAE,UAAU,EAAM,IAAe,GACtEA,EAAE,UAAU,EAAM,IAAe,EACnC,OAAOjD,GAET,IAAK,EAAI,GAAI,EAAIW,GAAY,IAC3B,GAAIsC,EAAE,UAAU,EAAI,CAAC,IAAe,EAClC,OAAOjD,GAOX,OAAOD,EACT,EAGA,IAAIkH,GAAmB,GAKvB,MAAMC,GAAcjE,GACpB,CAEOgE,KACHnC,GAAc,EACdmC,GAAmB,IAGrBhE,EAAE,OAAU,IAAIN,GAASM,EAAE,UAAWT,EAAa,EACnDS,EAAE,OAAU,IAAIN,GAASM,EAAE,UAAWR,EAAa,EACnDQ,EAAE,QAAU,IAAIN,GAASM,EAAE,QAASP,EAAc,EAElDO,EAAE,OAAS,EACXA,EAAE,SAAW,EAGb8B,GAAW9B,CAAC,CACd,EAMMkE,GAAqB,CAAClE,EAAG9C,EAAKiH,EAAYC,IAAS,CAMvDlE,EAAUF,GAAI5C,IAAgB,IAAMgH,EAAO,EAAI,GAAI,CAAC,EACpDrC,GAAU/B,CAAC,EACXD,GAAUC,EAAGmE,CAAU,EACvBpE,GAAUC,EAAG,CAACmE,CAAU,EACpBA,GACFnE,EAAE,YAAY,IAAIA,EAAE,OAAO,SAAS9C,EAAKA,EAAMiH,CAAU,EAAGnE,EAAE,OAAO,EAEvEA,EAAE,SAAWmE,CACf,EAOME,GAAerE,GAAM,CACzBE,EAAUF,EAAG3C,IAAgB,EAAG,CAAC,EACjCgD,GAAUL,EAAG9B,GAAWS,EAAY,EACpCgC,GAASX,CAAC,CACZ,EAOMsE,GAAoB,CAACtE,EAAG9C,EAAKiH,EAAYC,IAAS,CAMtD,IAAIG,EAAUC,EACVhB,EAAc,EAGdxD,EAAE,MAAQ,GAGRA,EAAE,KAAK,YAAchD,KACvBgD,EAAE,KAAK,UAAY8D,GAAiB9D,CAAC,GAIvC6C,GAAW7C,EAAGA,EAAE,MAAM,EAItB6C,GAAW7C,EAAGA,EAAE,MAAM,EAUtBwD,EAAcD,GAAcvD,CAAC,EAG7BuE,EAAYvE,EAAE,QAAU,EAAI,IAAO,EACnCwE,EAAexE,EAAE,WAAa,EAAI,IAAO,EAMrCwE,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcL,EAAa,EAGnCA,EAAa,GAAKI,GAAcrH,IAAQ,GAS3CgH,GAAmBlE,EAAG9C,EAAKiH,EAAYC,CAAI,EAElCpE,EAAE,WAAanD,IAAa2H,IAAgBD,GAErDrE,EAAUF,GAAI3C,IAAgB,IAAM+G,EAAO,EAAI,GAAI,CAAC,EACpD5B,GAAexC,EAAGrB,GAAcC,EAAY,IAG5CsB,EAAUF,GAAI1C,IAAa,IAAM8G,EAAO,EAAI,GAAI,CAAC,EACjDX,GAAezD,EAAGA,EAAE,OAAO,SAAW,EAAGA,EAAE,OAAO,SAAW,EAAGwD,EAAc,CAAC,EAC/EhB,GAAexC,EAAGA,EAAE,UAAWA,EAAE,SAAS,GAM5C8B,GAAW9B,CAAC,EAERoE,GACFrC,GAAU/B,CAAC,CAIf,EAMMyE,GAAc,CAACzE,EAAGF,EAAM6C,KAK5B3C,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAIF,EAC1CE,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAIF,GAAQ,EAClDE,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI2C,EACtC7C,IAAS,EAEXE,EAAE,UAAU2C,EAAK,CAAC,KAElB3C,EAAE,UAEFF,IAKAE,EAAE,WAAWlB,GAAa6D,CAAE,EAAIjF,GAAa,GAAK,CAAC,IACnDsC,EAAE,UAAUH,GAAOC,CAAI,EAAI,CAAC,KAGtBE,EAAE,WAAaA,EAAE,SAG3B,IAAI0E,GAAcT,GACdU,GAAqBT,GACrBU,GAAqBN,GACrBO,GAAcJ,GACdK,GAAcT,GAEdU,GAAQ,CACX,SAAUL,GACV,iBAAkBC,GAClB,gBAAiBC,GACjB,UAAWC,GACX,UAAWC,EACZ,EAyBA,MAAME,GAAU,CAACC,EAAO/H,EAAKC,EAAK+H,IAAQ,CACxC,IAAIC,EAAMF,EAAQ,MAAS,EACvBG,EAAOH,IAAU,GAAM,MAAS,EAChC7D,EAAI,EAER,KAAOjE,IAAQ,GAAG,CAIhBiE,EAAIjE,EAAM,IAAO,IAAOA,EACxBA,GAAOiE,EAEP,GACE+D,EAAMA,EAAKjI,EAAIgI,GAAK,EAAI,EACxBE,EAAMA,EAAKD,EAAK,QACT,EAAE/D,GAEX+D,GAAM,MACNC,GAAM,KACR,CAEA,OAAQD,EAAMC,GAAM,GAAM,CAC5B,EAGA,IAAIC,GAAYL,GA0BhB,MAAMM,GAAY,IAAM,CACtB,IAAIhF,EAAGiF,EAAQ,CAAA,EAEf,QAAS,EAAI,EAAG,EAAI,IAAK,IAAK,CAC5BjF,EAAI,EACJ,QAAS+B,EAAI,EAAGA,EAAI,EAAGA,IACrB/B,EAAMA,EAAI,EAAM,WAAcA,IAAM,EAAOA,IAAM,EAEnDiF,EAAM,CAAC,EAAIjF,CACb,CAEA,OAAOiF,CACT,EAGMC,GAAW,IAAI,YAAYF,IAAW,EAGtCG,GAAQ,CAACC,EAAKxI,EAAKC,EAAK+H,IAAQ,CACpC,MAAMS,EAAIH,GACJI,EAAMV,EAAM/H,EAElBuI,GAAO,GAEP,QAASG,EAAIX,EAAKW,EAAID,EAAKC,IACzBH,EAAOA,IAAQ,EAAKC,GAAGD,EAAMxI,EAAI2I,CAAC,GAAK,GAAI,EAG7C,OAAQH,EAAO,EACjB,EAGA,IAAII,GAAUL,GAqBVM,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sBACV,EAqBIC,GAAc,CAGhB,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EAMpB,KAAoB,EACpB,aAAoB,EAGpB,eAAmB,GACnB,aAAmB,GAEnB,YAAmB,GAOnB,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAM1B,UAA0B,EAG1B,WAA0B,CAE5B,EAqBA,KAAM,CAAE,SAAAC,GAAU,iBAAAC,GAAkB,gBAAAC,GAAiB,UAAAC,GAAW,UAAAC,EAAS,EAAKtB,GAQxE,CACJ,WAAYuB,GAAc,gBAAAC,GAAiB,aAAcC,GAAgB,SAAUC,EAAY,QAASC,GACxG,KAAMC,EAAQ,aAAcC,GAAgB,eAAgBC,GAAkB,aAAcC,GAAgB,YAAaC,GACzH,sBAAuBC,GACvB,WAAAC,GAAY,eAAAC,GAAgB,MAAAC,GAAO,QAAAC,GAAS,mBAAoBC,GAChE,UAAAC,GACA,WAAYC,EACd,EAAIvB,GAKEwB,GAAgB,EAEhBC,GAAc,GAEdC,GAAgB,EAGhBC,GAAgB,GAEhBC,GAAgB,IAEhBC,GAAgBD,GAAW,EAAID,GAE/BG,GAAgB,GAEhBC,GAAgB,GAEhBC,GAAgB,EAAIH,GAAU,EAE9BI,GAAY,GAGZC,EAAY,EACZC,GAAY,IACZC,GAAiBD,GAAYD,EAAY,EAEzCG,GAAc,GAEdC,GAAiB,GAEjBC,GAAiB,GAEjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAgB,IAChBC,GAAgB,IAChBC,GAAgB,IAEhBC,EAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EAEpBC,GAAU,EAEVC,GAAM,CAACC,EAAMC,KACjBD,EAAK,IAAMrD,GAASsD,CAAS,EACtBA,GAGHxF,GAAQrC,GACHA,EAAK,GAAOA,EAAK,EAAI,EAAI,GAG9B8H,GAAQpM,GAAQ,CACpB,IAAIC,EAAMD,EAAI,OAAQ,KAAO,EAAEC,GAAO,GAAKD,EAAIC,CAAG,EAAI,CACxD,EAOMoM,GAAcvJ,GAAM,CACxB,IAAIoB,EAAGC,EACHmI,EACAC,EAAQzJ,EAAE,OAEdoB,EAAIpB,EAAE,UACNwJ,EAAIpI,EACJ,GACEC,EAAIrB,EAAE,KAAK,EAAEwJ,CAAC,EACdxJ,EAAE,KAAKwJ,CAAC,EAAKnI,GAAKoI,EAAQpI,EAAIoI,EAAQ,QAC/B,EAAErI,GACXA,EAAIqI,EAEJD,EAAIpI,EACJ,GACEC,EAAIrB,EAAE,KAAK,EAAEwJ,CAAC,EACdxJ,EAAE,KAAKwJ,CAAC,EAAKnI,GAAKoI,EAAQpI,EAAIoI,EAAQ,QAI/B,EAAErI,EAEb,EAGA,IAAIsI,GAAY,CAAC1J,EAAG2J,EAAMC,KAAWD,GAAQ3J,EAAE,WAAc4J,GAAQ5J,EAAE,UAInE6J,GAAOH,GASX,MAAMI,EAAiBV,GAAS,CAC9B,MAAMpJ,EAAIoJ,EAAK,MAGf,IAAIjM,EAAM6C,EAAE,QACR7C,EAAMiM,EAAK,YACbjM,EAAMiM,EAAK,WAETjM,IAAQ,IAEZiM,EAAK,OAAO,IAAIpJ,EAAE,YAAY,SAASA,EAAE,YAAaA,EAAE,YAAc7C,CAAG,EAAGiM,EAAK,QAAQ,EACzFA,EAAK,UAAajM,EAClB6C,EAAE,aAAgB7C,EAClBiM,EAAK,WAAajM,EAClBiM,EAAK,WAAajM,EAClB6C,EAAE,SAAgB7C,EACd6C,EAAE,UAAY,IAChBA,EAAE,YAAc,GAEpB,EAGM+J,EAAmB,CAAC/J,EAAGoE,IAAS,CACpC+B,GAAgBnG,EAAIA,EAAE,aAAe,EAAIA,EAAE,YAAc,GAAKA,EAAE,SAAWA,EAAE,YAAaoE,CAAI,EAC9FpE,EAAE,YAAcA,EAAE,SAClB8J,EAAc9J,EAAE,IAAI,CACtB,EAGMgK,EAAW,CAAChK,EAAGiK,IAAM,CACzBjK,EAAE,YAAYA,EAAE,SAAS,EAAIiK,CAC/B,EAQMC,GAAc,CAAClK,EAAGiK,IAAM,CAI5BjK,EAAE,YAAYA,EAAE,SAAS,EAAKiK,IAAM,EAAK,IACzCjK,EAAE,YAAYA,EAAE,SAAS,EAAIiK,EAAI,GACnC,EAUME,GAAW,CAACf,EAAMlM,EAAKkN,EAAOC,IAAS,CAE3C,IAAIlN,EAAMiM,EAAK,SAGf,OADIjM,EAAMkN,IAAQlN,EAAMkN,GACpBlN,IAAQ,EAAY,GAExBiM,EAAK,UAAYjM,EAGjBD,EAAI,IAAIkM,EAAK,MAAM,SAASA,EAAK,QAASA,EAAK,QAAUjM,CAAG,EAAGiN,CAAK,EAChEhB,EAAK,MAAM,OAAS,EACtBA,EAAK,MAAQ/D,GAAU+D,EAAK,MAAOlM,EAAKC,EAAKiN,CAAK,EAG3ChB,EAAK,MAAM,OAAS,IAC3BA,EAAK,MAAQtD,GAAQsD,EAAK,MAAOlM,EAAKC,EAAKiN,CAAK,GAGlDhB,EAAK,SAAWjM,EAChBiM,EAAK,UAAYjM,EAEVA,EACT,EAYMmN,GAAgB,CAACtK,EAAGuK,IAAc,CAEtC,IAAIC,EAAexK,EAAE,iBACjByK,EAAOzK,EAAE,SACT0K,EACAvN,EACAwN,EAAW3K,EAAE,YACb4K,EAAa5K,EAAE,WACnB,MAAM6K,EAAS7K,EAAE,SAAYA,EAAE,OAASoI,GACpCpI,EAAE,UAAYA,EAAE,OAASoI,IAAiB,EAExC0C,EAAO9K,EAAE,OAET+K,EAAQ/K,EAAE,OACV2J,EAAQ3J,EAAE,KAMVgL,EAAShL,EAAE,SAAWmI,GAC5B,IAAI8C,EAAaH,EAAKL,EAAOE,EAAW,CAAC,EACrCO,EAAaJ,EAAKL,EAAOE,CAAQ,EAQjC3K,EAAE,aAAeA,EAAE,aACrBwK,IAAiB,GAKfI,EAAa5K,EAAE,YAAa4K,EAAa5K,EAAE,WAI/C,EAaE,IAXA0K,EAAQH,EAWJ,EAAAO,EAAKJ,EAAQC,CAAQ,IAAUO,GAC/BJ,EAAKJ,EAAQC,EAAW,CAAC,IAAMM,GAC/BH,EAAKJ,CAAK,IAAqBI,EAAKL,CAAI,GACxCK,EAAK,EAAEJ,CAAK,IAAmBI,EAAKL,EAAO,CAAC,GAUhD,CAAAA,GAAQ,EACRC,IAMA,EAAG,OAEMI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DD,EAAOO,GAOhB,GAHA7N,EAAMgL,IAAa6C,EAASP,GAC5BA,EAAOO,EAAS7C,GAEZhL,EAAMwN,EAAU,CAGlB,GAFA3K,EAAE,YAAcuK,EAChBI,EAAWxN,EACPA,GAAOyN,EACT,MAEFK,EAAaH,EAAKL,EAAOE,EAAW,CAAC,EACrCO,EAAaJ,EAAKL,EAAOE,CAAQ,CACnC,SACQJ,EAAYZ,EAAKY,EAAYQ,CAAK,GAAKF,GAAS,EAAEL,IAAiB,GAE7E,OAAIG,GAAY3K,EAAE,UACT2K,EAEF3K,EAAE,SACX,EAaMmL,GAAenL,GAAM,CAEzB,MAAMoL,EAAUpL,EAAE,OAClB,IAAI,EAAGqL,EAAMC,EAIb,EAAG,CAkCD,GAjCAD,EAAOrL,EAAE,YAAcA,EAAE,UAAYA,EAAE,SAoBnCA,EAAE,UAAYoL,GAAWA,EAAUhD,MAErCpI,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASoL,EAASA,EAAUA,EAAUC,CAAI,EAAG,CAAC,EACpErL,EAAE,aAAeoL,EACjBpL,EAAE,UAAYoL,EAEdpL,EAAE,aAAeoL,EACbpL,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,UAEfuJ,GAAWvJ,CAAC,EACZqL,GAAQD,GAENpL,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJA,EAAImK,GAASnK,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAWA,EAAE,UAAWqL,CAAI,EAC7DrL,EAAE,WAAa,EAGXA,EAAE,UAAYA,EAAE,QAAUkI,EAS5B,IARAoD,EAAMtL,EAAE,SAAWA,EAAE,OACrBA,EAAE,MAAQA,EAAE,OAAOsL,CAAG,EAGtBtL,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOsL,EAAM,CAAC,CAAC,EAIrCtL,EAAE,SAEPA,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOsL,EAAMpD,EAAY,CAAC,CAAC,EAExDlI,EAAE,KAAKsL,EAAMtL,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EACvCA,EAAE,KAAKA,EAAE,KAAK,EAAIsL,EAClBA,IACAtL,EAAE,SACE,EAAAA,EAAE,UAAYA,EAAE,OAASkI,KAA7B,CASN,OAASlI,EAAE,UAAYoI,IAAiBpI,EAAE,KAAK,WAAa,EAsC9D,EAiBMuL,GAAiB,CAACvL,EAAGwL,IAAU,CAMnC,IAAIC,EAAYzL,EAAE,iBAAmB,EAAIA,EAAE,OAASA,EAAE,OAASA,EAAE,iBAAmB,EAMhF7C,EAAKuO,EAAMC,EAAMvH,EAAO,EACxBwH,EAAO5L,EAAE,KAAK,SAClB,EAAG,CAyBD,GApBA7C,EAAM,MACNwO,EAAQ3L,EAAE,SAAW,IAAO,EACxBA,EAAE,KAAK,UAAY2L,IAIvBA,EAAO3L,EAAE,KAAK,UAAY2L,EAC1BD,EAAO1L,EAAE,SAAWA,EAAE,YAClB7C,EAAMuO,EAAO1L,EAAE,KAAK,WACtB7C,EAAMuO,EAAO1L,EAAE,KAAK,UAElB7C,EAAMwO,IACRxO,EAAMwO,GAQJxO,EAAMsO,IAAetO,IAAQ,GAAKqO,IAAU/E,GAC5B+E,IAAUlF,IACVnJ,IAAQuO,EAAO1L,EAAE,KAAK,WACxC,MAMFoE,EAAOoH,IAAU/E,GAActJ,IAAQuO,EAAO1L,EAAE,KAAK,SAAW,EAAI,EACpEkG,GAAiBlG,EAAG,EAAG,EAAGoE,CAAI,EAG9BpE,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI7C,EAC/B6C,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI7C,GAAO,EACtC6C,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAAC7C,EAChC6C,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAAC7C,GAAO,EAGvC2M,EAAc9J,EAAE,IAAI,EAShB0L,IACEA,EAAOvO,IACTuO,EAAOvO,GAGT6C,EAAE,KAAK,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,YAAaA,EAAE,YAAc0L,CAAI,EAAG1L,EAAE,KAAK,QAAQ,EACzFA,EAAE,KAAK,UAAY0L,EACnB1L,EAAE,KAAK,WAAa0L,EACpB1L,EAAE,KAAK,WAAa0L,EACpB1L,EAAE,aAAe0L,EACjBvO,GAAOuO,GAMLvO,IACFgN,GAASnK,EAAE,KAAMA,EAAE,KAAK,OAAQA,EAAE,KAAK,SAAU7C,CAAG,EACpD6C,EAAE,KAAK,UAAY7C,EACnB6C,EAAE,KAAK,WAAa7C,EACpB6C,EAAE,KAAK,WAAa7C,EAExB,OAASiH,IAAS,GA6ClB,OArCAwH,GAAQ5L,EAAE,KAAK,SACX4L,IAIEA,GAAQ5L,EAAE,QACZA,EAAE,QAAU,EAEZA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAUA,EAAE,OAAQA,EAAE,KAAK,OAAO,EAAG,CAAC,EAChFA,EAAE,SAAWA,EAAE,OACfA,EAAE,OAASA,EAAE,WAGTA,EAAE,YAAcA,EAAE,UAAY4L,IAEhC5L,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEAA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAIjBA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAU4L,EAAM5L,EAAE,KAAK,OAAO,EAAGA,EAAE,QAAQ,EACrFA,EAAE,UAAY4L,EACd5L,EAAE,QAAU4L,EAAO5L,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAAS4L,GAEjE5L,EAAE,YAAcA,EAAE,UAEhBA,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAIfoE,EACK6E,GAILuC,IAAUlF,IAAgBkF,IAAU/E,GACtCzG,EAAE,KAAK,WAAa,GAAKA,EAAE,WAAaA,EAAE,YACnC+I,IAIT4C,EAAO3L,EAAE,YAAcA,EAAE,SACrBA,EAAE,KAAK,SAAW2L,GAAQ3L,EAAE,aAAeA,EAAE,SAE/CA,EAAE,aAAeA,EAAE,OACnBA,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEJ2L,GAAQ3L,EAAE,OACNA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAGb2L,EAAO3L,EAAE,KAAK,WAChB2L,EAAO3L,EAAE,KAAK,UAEZ2L,IACFxB,GAASnK,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAU2L,CAAI,EAC3C3L,EAAE,UAAY2L,EACd3L,EAAE,QAAU2L,EAAO3L,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAAS2L,GAE7D3L,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAQnB2L,EAAQ3L,EAAE,SAAW,IAAO,EAE5B2L,EAAO3L,EAAE,iBAAmB2L,EAAO,MAAwB,MAAwB3L,EAAE,iBAAmB2L,EACxGF,EAAYE,EAAO3L,EAAE,OAASA,EAAE,OAAS2L,EACzCD,EAAO1L,EAAE,SAAWA,EAAE,aAClB0L,GAAQD,IACPC,GAAQF,IAAU/E,IAAe+E,IAAUlF,IAC7CtG,EAAE,KAAK,WAAa,GAAK0L,GAAQC,KAClCxO,EAAMuO,EAAOC,EAAOA,EAAOD,EAC3BtH,EAAOoH,IAAU/E,GAAczG,EAAE,KAAK,WAAa,GAC9C7C,IAAQuO,EAAO,EAAI,EACxBxF,GAAiBlG,EAAGA,EAAE,YAAa7C,EAAKiH,CAAI,EAC5CpE,EAAE,aAAe7C,EACjB2M,EAAc9J,EAAE,IAAI,GAIfoE,EAAO4E,GAAoBF,EACpC,EAUM+C,GAAe,CAAC7L,EAAGwL,IAAU,CAEjC,IAAIM,EACAC,EAEJ,OAAS,CAMP,GAAI/L,EAAE,UAAYoI,GAAe,CAE/B,GADA+C,GAAYnL,CAAC,EACTA,EAAE,UAAYoI,IAAiBoD,IAAUlF,GAC3C,OAAOwC,EAET,GAAI9I,EAAE,YAAc,EAClB,KAEJ,CAyBA,GApBA8L,EAAY,EACR9L,EAAE,WAAakI,IAEjBlI,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAOlB8L,IAAc,GAAc9L,EAAE,SAAW8L,GAAe9L,EAAE,OAASoI,KAKrEpI,EAAE,aAAesK,GAActK,EAAG8L,CAAS,GAGzC9L,EAAE,cAAgBkI,EAYpB,GAPA6D,EAAS3F,GAAUpG,EAAGA,EAAE,SAAWA,EAAE,YAAaA,EAAE,aAAekI,CAAS,EAE5ElI,EAAE,WAAaA,EAAE,aAKbA,EAAE,cAAgBA,EAAE,gBAAuCA,EAAE,WAAakI,EAAW,CACvFlI,EAAE,eACF,GACEA,EAAE,WAEFA,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,eAKb,EAAEA,EAAE,eAAiB,GAC9BA,EAAE,UACJ,MAEEA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,EACjBA,EAAE,MAAQA,EAAE,OAAOA,EAAE,QAAQ,EAE7BA,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,OAarD+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,WAEJ,GAAI+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAIb,CAEA,OADA9I,EAAE,OAAWA,EAAE,SAAYkI,EAAY,EAAMlI,EAAE,SAAWkI,EAAY,EAClEsD,IAAU/E,GAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAIJC,EACT,EAOMiD,GAAe,CAAChM,EAAGwL,IAAU,CAEjC,IAAIM,EACAC,EAEAE,EAGJ,OAAS,CAMP,GAAIjM,EAAE,UAAYoI,GAAe,CAE/B,GADA+C,GAAYnL,CAAC,EACTA,EAAE,UAAYoI,IAAiBoD,IAAUlF,GAC3C,OAAOwC,EAET,GAAI9I,EAAE,YAAc,EAAK,KAC3B,CAyCA,GApCA8L,EAAY,EACR9L,EAAE,WAAakI,IAEjBlI,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAMtBA,EAAE,YAAcA,EAAE,aAClBA,EAAE,WAAaA,EAAE,YACjBA,EAAE,aAAekI,EAAY,EAEzB4D,IAAc,GAAY9L,EAAE,YAAcA,EAAE,gBAC5CA,EAAE,SAAW8L,GAAc9L,EAAE,OAASoI,KAKxCpI,EAAE,aAAesK,GAActK,EAAG8L,CAAS,EAGvC9L,EAAE,cAAgB,IAClBA,EAAE,WAAaiH,IAAejH,EAAE,eAAiBkI,GAAalI,EAAE,SAAWA,EAAE,YAAc,QAK7FA,EAAE,aAAekI,EAAY,IAM7BlI,EAAE,aAAekI,GAAalI,EAAE,cAAgBA,EAAE,YAAa,CACjEiM,EAAajM,EAAE,SAAWA,EAAE,UAAYkI,EAOxC6D,EAAS3F,GAAUpG,EAAGA,EAAE,SAAW,EAAIA,EAAE,WAAYA,EAAE,YAAckI,CAAS,EAM9ElI,EAAE,WAAaA,EAAE,YAAc,EAC/BA,EAAE,aAAe,EACjB,EACM,EAAEA,EAAE,UAAYiM,IAElBjM,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,gBAGf,EAAEA,EAAE,cAAgB,GAK7B,GAJAA,EAAE,gBAAkB,EACpBA,EAAE,aAAekI,EAAY,EAC7BlI,EAAE,WAEE+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAKb,SAAW9I,EAAE,iBAgBX,GATA+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAE7C+L,GAEFhC,EAAiB/J,EAAG,EAAK,EAG3BA,EAAE,WACFA,EAAE,YACEA,EAAE,KAAK,YAAc,EACvB,OAAO8I,OAMT9I,EAAE,gBAAkB,EACpBA,EAAE,WACFA,EAAE,WAEN,CAUA,OARIA,EAAE,kBAGJ+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEjDA,EAAE,gBAAkB,GAEtBA,EAAE,OAASA,EAAE,SAAWkI,EAAY,EAAIlI,EAAE,SAAWkI,EAAY,EAC7DsD,IAAU/E,GAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAKJC,EACT,EAQMmD,GAAc,CAAClM,EAAGwL,IAAU,CAEhC,IAAIO,EACApC,EACAc,EAAMO,EAEV,MAAMF,EAAO9K,EAAE,OAEf,OAAS,CAKP,GAAIA,EAAE,WAAamI,GAAW,CAE5B,GADAgD,GAAYnL,CAAC,EACTA,EAAE,WAAamI,IAAaqD,IAAUlF,GACxC,OAAOwC,EAET,GAAI9I,EAAE,YAAc,EAAK,KAC3B,CAIA,GADAA,EAAE,aAAe,EACbA,EAAE,WAAakI,GAAalI,EAAE,SAAW,IAC3CyK,EAAOzK,EAAE,SAAW,EACpB2J,EAAOmB,EAAKL,CAAI,EACZd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAAG,CAC3EO,EAAShL,EAAE,SAAWmI,GACtB,EAAG,OAEMwB,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7Cd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7Cd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7Cd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7CA,EAAOO,GAChBhL,EAAE,aAAemI,IAAa6C,EAASP,GACnCzK,EAAE,aAAeA,EAAE,YACrBA,EAAE,aAAeA,EAAE,UAEvB,CAuBF,GAlBIA,EAAE,cAAgBkI,GAIpB6D,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,aAAekI,CAAS,EAEnDlI,EAAE,WAAaA,EAAE,aACjBA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,IAKjB+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,YAEA+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAIb,CAEA,OADA9I,EAAE,OAAS,EACPwL,IAAU/E,GAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAIJC,EACT,EAMMoD,GAAe,CAACnM,EAAGwL,IAAU,CAEjC,IAAIO,EAEJ,OAAS,CAEP,GAAI/L,EAAE,YAAc,IAClBmL,GAAYnL,CAAC,EACTA,EAAE,YAAc,GAAG,CACrB,GAAIwL,IAAUlF,GACZ,OAAOwC,EAET,KACF,CAUF,GANA9I,EAAE,aAAe,EAGjB+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAC7CA,EAAE,YACFA,EAAE,WACE+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAIb,CAEA,OADA9I,EAAE,OAAS,EACPwL,IAAU/E,GAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAIJC,EACT,EAOA,SAASqD,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CAEnE,KAAK,YAAcJ,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAcC,EACnB,KAAK,UAAYC,EACjB,KAAK,KAAOC,CACd,CAEA,MAAMC,GAAsB,CAE1B,IAAIN,GAAO,EAAG,EAAG,EAAG,EAAGb,EAAc,EACrC,IAAIa,GAAO,EAAG,EAAG,EAAG,EAAGP,EAAY,EACnC,IAAIO,GAAO,EAAG,EAAG,GAAI,EAAGP,EAAY,EACpC,IAAIO,GAAO,EAAG,EAAG,GAAI,GAAIP,EAAY,EAErC,IAAIO,GAAO,EAAG,EAAG,GAAI,GAAIJ,EAAY,EACrC,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,EAAY,EACtC,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,EAC3C,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,CAC7C,EAMMW,GAAW3M,GAAM,CAErBA,EAAE,YAAc,EAAIA,EAAE,OAGtBsJ,GAAKtJ,EAAE,IAAI,EAIXA,EAAE,eAAiB0M,GAAoB1M,EAAE,KAAK,EAAE,SAChDA,EAAE,WAAa0M,GAAoB1M,EAAE,KAAK,EAAE,YAC5CA,EAAE,WAAa0M,GAAoB1M,EAAE,KAAK,EAAE,YAC5CA,EAAE,iBAAmB0M,GAAoB1M,EAAE,KAAK,EAAE,UAElDA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,UAAY,EACdA,EAAE,OAAS,EACXA,EAAE,aAAeA,EAAE,YAAckI,EAAY,EAC7ClI,EAAE,gBAAkB,EACpBA,EAAE,MAAQ,CACZ,EAGA,SAAS4M,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAASrF,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,IAAI,YAAYS,GAAY,CAAC,EAC/C,KAAK,UAAa,IAAI,aAAa,EAAIF,GAAU,GAAK,CAAC,EACvD,KAAK,QAAa,IAAI,aAAa,EAAIC,GAAW,GAAK,CAAC,EACxDuB,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,IAAI,YAAYrB,GAAW,CAAC,EAI5C,KAAK,KAAO,IAAI,YAAY,EAAIJ,GAAU,CAAC,EAC3CyB,GAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,IAAI,YAAY,EAAIzB,GAAU,CAAC,EAC5CyB,GAAK,KAAK,KAAK,EAIf,KAAK,QAAU,EAEf,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAChB,KAAK,QAAU,EAEf,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,CAalB,CAMA,MAAMuD,GAAqBzD,GAAS,CAElC,GAAI,CAACA,EACH,MAAO,GAET,MAAMpJ,EAAIoJ,EAAK,MACf,MAAI,CAACpJ,GAAKA,EAAE,OAASoJ,GAASpJ,EAAE,SAAWsI,IAEbtI,EAAE,SAAWuI,IAEbvI,EAAE,SAAWwI,IACbxI,EAAE,SAAWyI,IACbzI,EAAE,SAAW0I,IACb1I,EAAE,SAAW2I,IACb3I,EAAE,SAAW4I,IACb5I,EAAE,SAAW6I,GAClC,EAEF,CACT,EAGMiE,GAAoB1D,GAAS,CAEjC,GAAIyD,GAAkBzD,CAAI,EACxB,OAAOD,GAAIC,EAAMvC,EAAgB,EAGnCuC,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,UAAY9B,GAEjB,MAAMtH,EAAIoJ,EAAK,MACf,OAAApJ,EAAE,QAAU,EACZA,EAAE,YAAc,EAEZA,EAAE,KAAO,IACXA,EAAE,KAAO,CAACA,EAAE,MAGdA,EAAE,OAEAA,EAAE,OAAS,EAAIuI,GAEfvI,EAAE,KAAOsI,GAAaM,GACxBQ,EAAK,MAASpJ,EAAE,OAAS,EACvB,EAEA,EACFA,EAAE,WAAa,GACfiG,GAASjG,CAAC,EACH2G,CACT,EAGMoG,GAAgB3D,GAAS,CAE7B,MAAM4D,EAAMF,GAAiB1D,CAAI,EACjC,OAAI4D,IAAQrG,GACVgG,GAAQvD,EAAK,KAAK,EAEb4D,CACT,EAGMC,GAAmB,CAAC7D,EAAM8D,IAE1BL,GAAkBzD,CAAI,GAAKA,EAAK,MAAM,OAAS,EAC1CvC,IAETuC,EAAK,MAAM,OAAS8D,EACbvG,GAIHwG,GAAe,CAAC/D,EAAMgE,EAAOC,EAAQC,EAAYC,EAAUC,IAAa,CAE5E,GAAI,CAACpE,EACH,OAAOvC,GAET,IAAI4G,EAAO,EAiBX,GAfIL,IAAUpG,KACZoG,EAAQ,GAGNE,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,GAGPA,EAAa,KACpBG,EAAO,EACPH,GAAc,IAIZC,EAAW,GAAKA,EAAW/F,IAAiB6F,IAAW9F,IACzD+F,EAAa,GAAKA,EAAa,IAAMF,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EAAWpG,IAAYkG,IAAe,GAAKG,IAAS,EACpE,OAAOtE,GAAIC,EAAMvC,EAAgB,EAI/ByG,IAAe,IACjBA,EAAa,GAIf,MAAM,EAAI,IAAIV,GAEd,OAAAxD,EAAK,MAAQ,EACb,EAAE,KAAOA,EACT,EAAE,OAASd,GAEX,EAAE,KAAOmF,EACT,EAAE,OAAS,KACX,EAAE,OAASH,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAYC,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,GAAG,EAAE,UAAYrF,EAAY,GAAKA,GAElD,EAAE,OAAS,IAAI,WAAW,EAAE,OAAS,CAAC,EACtC,EAAE,KAAO,IAAI,YAAY,EAAE,SAAS,EACpC,EAAE,KAAO,IAAI,YAAY,EAAE,MAAM,EAKjC,EAAE,YAAc,GAAMqF,EAAW,EAyCjC,EAAE,iBAAmB,EAAE,YAAc,EACrC,EAAE,YAAc,IAAI,WAAW,EAAE,gBAAgB,EAIjD,EAAE,QAAU,EAAE,YAGd,EAAE,SAAW,EAAE,YAAc,GAAK,EAMlC,EAAE,MAAQH,EACV,EAAE,SAAWI,EACb,EAAE,OAASH,EAEJN,GAAa3D,CAAI,CAC1B,EAEMsE,GAAc,CAACtE,EAAMgE,IAElBD,GAAa/D,EAAMgE,EAAO7F,GAAcE,GAAaC,GAAeL,EAAoB,EAK3FsG,GAAY,CAACvE,EAAMoC,IAAU,CAEjC,GAAIqB,GAAkBzD,CAAI,GAAKoC,EAAQ9E,IAAa8E,EAAQ,EAC1D,OAAOpC,EAAOD,GAAIC,EAAMvC,EAAgB,EAAIA,GAG9C,MAAM7G,EAAIoJ,EAAK,MAEf,GAAI,CAACA,EAAK,QACLA,EAAK,WAAa,GAAK,CAACA,EAAK,OAC7BpJ,EAAE,SAAW6I,IAAgB2C,IAAU/E,EAC1C,OAAO0C,GAAIC,EAAOA,EAAK,YAAc,EAAKrC,GAAgBF,EAAgB,EAG5E,MAAM+G,EAAY5N,EAAE,WAIpB,GAHAA,EAAE,WAAawL,EAGXxL,EAAE,UAAY,GAEhB,GADA8J,EAAcV,CAAI,EACdA,EAAK,YAAc,EAOrB,OAAApJ,EAAE,WAAa,GACR2G,UAOAyC,EAAK,WAAa,GAAKvF,GAAK2H,CAAK,GAAK3H,GAAK+J,CAAS,GAC7DpC,IAAU/E,EACV,OAAO0C,GAAIC,EAAMrC,EAAa,EAIhC,GAAI/G,EAAE,SAAW6I,IAAgBO,EAAK,WAAa,EACjD,OAAOD,GAAIC,EAAMrC,EAAa,EAOhC,GAHI/G,EAAE,SAAWsI,IAActI,EAAE,OAAS,IACxCA,EAAE,OAAS4I,IAET5I,EAAE,SAAWsI,GAAY,CAE3B,IAAIuF,EAAUtG,IAAiBvH,EAAE,OAAS,GAAM,IAAO,EACnD8N,EAAc,GA2BlB,GAzBI9N,EAAE,UAAYkH,IAAkBlH,EAAE,MAAQ,EAC5C8N,EAAc,EACL9N,EAAE,MAAQ,EACnB8N,EAAc,EACL9N,EAAE,QAAU,EACrB8N,EAAc,EAEdA,EAAc,EAEhBD,GAAWC,GAAe,EACtB9N,EAAE,WAAa,IAAK6N,GAAUxF,IAClCwF,GAAU,GAAMA,EAAS,GAEzB3D,GAAYlK,EAAG6N,CAAM,EAGjB7N,EAAE,WAAa,IACjBkK,GAAYlK,EAAGoJ,EAAK,QAAU,EAAE,EAChCc,GAAYlK,EAAGoJ,EAAK,MAAQ,KAAM,GAEpCA,EAAK,MAAQ,EACbpJ,EAAE,OAAS4I,GAGXkB,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,CAEX,CAEA,GAAI3G,EAAE,SAAWuI,IAMf,GAJAa,EAAK,MAAQ,EACbY,EAAShK,EAAG,EAAE,EACdgK,EAAShK,EAAG,GAAG,EACfgK,EAAShK,EAAG,CAAC,EACRA,EAAE,OAoBLgK,EAAShK,GAAIA,EAAE,OAAO,KAAO,EAAI,IACpBA,EAAE,OAAO,KAAO,EAAI,IACnBA,EAAE,OAAO,MAAY,EAAJ,IACjBA,EAAE,OAAO,KAAW,EAAJ,IAChBA,EAAE,OAAO,QAAc,GAAJ,EACvC,EACMgK,EAAShK,EAAGA,EAAE,OAAO,KAAO,GAAI,EAChCgK,EAAShK,EAAIA,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvCgK,EAAShK,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCgK,EAAShK,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCgK,EAAShK,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYkH,IAAkBlH,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBgK,EAAShK,EAAGA,EAAE,OAAO,GAAK,GAAI,EAC1BA,EAAE,OAAO,OAASA,EAAE,OAAO,MAAM,SACnCgK,EAAShK,EAAGA,EAAE,OAAO,MAAM,OAAS,GAAI,EACxCgK,EAAShK,EAAIA,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7CA,EAAE,OAAO,OACXoJ,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAS,CAAC,GAE9DA,EAAE,QAAU,EACZA,EAAE,OAASwI,WAzCXwB,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYkH,IAAkBlH,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBgK,EAAShK,EAAGkJ,EAAO,EACnBlJ,EAAE,OAAS4I,GAGXkB,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EA6Bb,GAAI3G,EAAE,SAAWwI,GAAa,CAC5B,GAAIxI,EAAE,OAAO,MAAqB,CAChC,IAAI+N,EAAM/N,EAAE,QACR0L,GAAQ1L,EAAE,OAAO,MAAM,OAAS,OAAUA,EAAE,QAChD,KAAOA,EAAE,QAAU0L,EAAO1L,EAAE,kBAAkB,CAC5C,IAAIgO,EAAOhO,EAAE,iBAAmBA,EAAE,QAYlC,GATAA,EAAE,YAAY,IAAIA,EAAE,OAAO,MAAM,SAASA,EAAE,QAASA,EAAE,QAAUgO,CAAI,EAAGhO,EAAE,OAAO,EACjFA,EAAE,QAAUA,EAAE,iBAEVA,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtE/N,EAAE,SAAWgO,EACblE,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EAEToH,EAAM,EACNrC,GAAQsC,CACV,CAGA,IAAIC,EAAe,IAAI,WAAWjO,EAAE,OAAO,KAAK,EAGhDA,EAAE,YAAY,IAAIiO,EAAa,SAASjO,EAAE,QAASA,EAAE,QAAU0L,CAAI,EAAG1L,EAAE,OAAO,EAC/EA,EAAE,SAAW0L,EAET1L,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtE/N,EAAE,QAAU,CACd,CACAA,EAAE,OAASyI,EACb,CACA,GAAIzI,EAAE,SAAWyI,GAAY,CAC3B,GAAIzI,EAAE,OAAO,KAAoB,CAC/B,IAAI+N,EAAM/N,EAAE,QACRkO,EACJ,EAAG,CACD,GAAIlO,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtEjE,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EAEToH,EAAM,CACR,CAEI/N,EAAE,QAAUA,EAAE,OAAO,KAAK,OAC5BkO,EAAMlO,EAAE,OAAO,KAAK,WAAWA,EAAE,SAAS,EAAI,IAE9CkO,EAAM,EAERlE,EAAShK,EAAGkO,CAAG,CACjB,OAASA,IAAQ,GAEblO,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtE/N,EAAE,QAAU,CACd,CACAA,EAAE,OAAS0I,EACb,CACA,GAAI1I,EAAE,SAAW0I,GAAe,CAC9B,GAAI1I,EAAE,OAAO,QAAuB,CAClC,IAAI+N,EAAM/N,EAAE,QACRkO,EACJ,EAAG,CACD,GAAIlO,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtEjE,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EAEToH,EAAM,CACR,CAEI/N,EAAE,QAAUA,EAAE,OAAO,QAAQ,OAC/BkO,EAAMlO,EAAE,OAAO,QAAQ,WAAWA,EAAE,SAAS,EAAI,IAEjDkO,EAAM,EAERlE,EAAShK,EAAGkO,CAAG,CACjB,OAASA,IAAQ,GAEblO,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,EAGxE,CACA/N,EAAE,OAAS2I,EACb,CACA,GAAI3I,EAAE,SAAW2I,GAAY,CAC3B,GAAI3I,EAAE,OAAO,KAAM,CACjB,GAAIA,EAAE,QAAU,EAAIA,EAAE,mBACpB8J,EAAcV,CAAI,EACdpJ,EAAE,UAAY,GAChB,OAAAA,EAAE,WAAa,GACR2G,EAGXqD,EAAShK,EAAGoJ,EAAK,MAAQ,GAAI,EAC7BY,EAAShK,EAAIoJ,EAAK,OAAS,EAAK,GAAI,EACpCA,EAAK,MAAQ,CACf,CAKA,GAJApJ,EAAE,OAAS4I,GAGXkB,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,CAEX,CAKA,GAAIyC,EAAK,WAAa,GAAKpJ,EAAE,YAAc,GACxCwL,IAAUlF,IAAgBtG,EAAE,SAAW6I,GAAe,CACvD,IAAIsF,EAASnO,EAAE,QAAU,EAAIuL,GAAevL,EAAGwL,CAAK,EACvCxL,EAAE,WAAakH,GAAiBiF,GAAanM,EAAGwL,CAAK,EACrDxL,EAAE,WAAamH,GAAQ+E,GAAYlM,EAAGwL,CAAK,EAC3CkB,GAAoB1M,EAAE,KAAK,EAAE,KAAKA,EAAGwL,CAAK,EAKvD,IAHI2C,IAAWnF,IAAqBmF,IAAWlF,MAC7CjJ,EAAE,OAAS6I,IAETsF,IAAWrF,GAAgBqF,IAAWnF,GACxC,OAAII,EAAK,YAAc,IACrBpJ,EAAE,WAAa,IAGV2G,EAST,GAAIwH,IAAWpF,KACTyC,IAAUjF,GACZF,GAAUrG,CAAC,EAEJwL,IAAU9E,KAEjBR,GAAiBlG,EAAG,EAAG,EAAG,EAAK,EAI3BwL,IAAUhF,KAEZ8C,GAAKtJ,EAAE,IAAI,EAEPA,EAAE,YAAc,IAClBA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,KAIjB8J,EAAcV,CAAI,EACdA,EAAK,YAAc,GACrB,OAAApJ,EAAE,WAAa,GACR2G,CAGb,CAEA,OAAI6E,IAAU/E,EAAqBE,EAC/B3G,EAAE,MAAQ,EAAY4G,IAGtB5G,EAAE,OAAS,GACbgK,EAAShK,EAAGoJ,EAAK,MAAQ,GAAI,EAC7BY,EAAShK,EAAIoJ,EAAK,OAAS,EAAK,GAAI,EACpCY,EAAShK,EAAIoJ,EAAK,OAAS,GAAM,GAAI,EACrCY,EAAShK,EAAIoJ,EAAK,OAAS,GAAM,GAAI,EACrCY,EAAShK,EAAGoJ,EAAK,SAAW,GAAI,EAChCY,EAAShK,EAAIoJ,EAAK,UAAY,EAAK,GAAI,EACvCY,EAAShK,EAAIoJ,EAAK,UAAY,GAAM,GAAI,EACxCY,EAAShK,EAAIoJ,EAAK,UAAY,GAAM,GAAI,IAIxCc,GAAYlK,EAAGoJ,EAAK,QAAU,EAAE,EAChCc,GAAYlK,EAAGoJ,EAAK,MAAQ,KAAM,GAGpCU,EAAcV,CAAI,EAIdpJ,EAAE,KAAO,IAAKA,EAAE,KAAO,CAACA,EAAE,MAEvBA,EAAE,UAAY,EAAI2G,EAASC,GACpC,EAGMwH,GAAchF,GAAS,CAE3B,GAAIyD,GAAkBzD,CAAI,EACxB,OAAOvC,GAGT,MAAMwH,EAASjF,EAAK,MAAM,OAE1B,OAAAA,EAAK,MAAQ,KAENiF,IAAWzF,GAAaO,GAAIC,EAAMtC,EAAc,EAAIH,CAC7D,EAOM2H,GAAuB,CAAClF,EAAMmF,IAAe,CAEjD,IAAIC,EAAaD,EAAW,OAE5B,GAAI1B,GAAkBzD,CAAI,EACxB,OAAOvC,GAGT,MAAM7G,EAAIoJ,EAAK,MACTqE,EAAOzN,EAAE,KAEf,GAAIyN,IAAS,GAAMA,IAAS,GAAKzN,EAAE,SAAWsI,IAAetI,EAAE,UAC7D,OAAO6G,GAYT,GARI4G,IAAS,IAEXrE,EAAK,MAAQ/D,GAAU+D,EAAK,MAAOmF,EAAYC,EAAY,CAAC,GAG9DxO,EAAE,KAAO,EAGLwO,GAAcxO,EAAE,OAAQ,CACtByN,IAAS,IAEXnE,GAAKtJ,EAAE,IAAI,EACXA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,GAIb,IAAIyO,EAAU,IAAI,WAAWzO,EAAE,MAAM,EACrCyO,EAAQ,IAAIF,EAAW,SAASC,EAAaxO,EAAE,OAAQwO,CAAU,EAAG,CAAC,EACrED,EAAaE,EACbD,EAAaxO,EAAE,MACjB,CAEA,MAAM0O,EAAQtF,EAAK,SACbuF,EAAOvF,EAAK,QACZwF,EAAQxF,EAAK,MAKnB,IAJAA,EAAK,SAAWoF,EAChBpF,EAAK,QAAU,EACfA,EAAK,MAAQmF,EACbpD,GAAYnL,CAAC,EACNA,EAAE,WAAakI,GAAW,CAC/B,IAAIoD,EAAMtL,EAAE,SACRoB,EAAIpB,EAAE,WAAakI,EAAY,GACnC,GAEElI,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOsL,EAAMpD,EAAY,CAAC,CAAC,EAExDlI,EAAE,KAAKsL,EAAMtL,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAEvCA,EAAE,KAAKA,EAAE,KAAK,EAAIsL,EAClBA,UACO,EAAElK,GACXpB,EAAE,SAAWsL,EACbtL,EAAE,UAAYkI,EAAY,EAC1BiD,GAAYnL,CAAC,CACf,CACA,OAAAA,EAAE,UAAYA,EAAE,UAChBA,EAAE,YAAcA,EAAE,SAClBA,EAAE,OAASA,EAAE,UACbA,EAAE,UAAY,EACdA,EAAE,aAAeA,EAAE,YAAckI,EAAY,EAC7ClI,EAAE,gBAAkB,EACpBoJ,EAAK,QAAUuF,EACfvF,EAAK,MAAQwF,EACbxF,EAAK,SAAWsF,EAChB1O,EAAE,KAAOyN,EACF9G,CACT,EAGA,IAAIkI,GAAgBnB,GAChBoB,GAAiB3B,GACjB4B,GAAiBhC,GACjBiC,GAAqBlC,GACrBmC,GAAqBhC,GACrBiC,GAAcvB,GACdwB,GAAef,GACfgB,GAAyBd,GACzBe,GAAc,qCAYdC,GAAc,CACjB,YAAaT,GACb,aAAcC,GACd,aAAcC,GACd,iBAAkBC,GAClB,iBAAkBC,GAClB,QAASC,GACT,WAAYC,GACZ,qBAAsBC,GACtB,YAAaC,EACd,EAEA,MAAME,GAAO,CAACC,EAAKC,IACV,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAG,EAGtD,IAAIC,GAAS,SAAUF,EAAkC,CACvD,MAAMG,EAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EACvD,KAAOA,EAAQ,QAAQ,CACrB,MAAMC,EAASD,EAAQ,MAAK,EAC5B,GAAKC,EAEL,IAAI,OAAOA,GAAW,SACpB,MAAM,IAAI,UAAUA,EAAS,oBAAoB,EAGnD,UAAWpG,KAAKoG,EACVL,GAAKK,EAAQpG,CAAC,IAChBgG,EAAIhG,CAAC,EAAIoG,EAAOpG,CAAC,GAGvB,CAEA,OAAOgG,CACT,EAIIK,GAAiBC,GAAW,CAE9B,IAAI3S,EAAM,EAEV,QAAS0I,EAAI,EAAGkK,EAAID,EAAO,OAAQjK,EAAIkK,EAAGlK,IACxC1I,GAAO2S,EAAOjK,CAAC,EAAE,OAInB,MAAMmK,EAAS,IAAI,WAAW7S,CAAG,EAEjC,QAAS0I,EAAI,EAAGX,EAAM,EAAG6K,EAAID,EAAO,OAAQjK,EAAIkK,EAAGlK,IAAK,CACtD,IAAIoK,EAAQH,EAAOjK,CAAC,EACpBmK,EAAO,IAAIC,EAAO/K,CAAG,EACrBA,GAAO+K,EAAM,MACf,CAEA,OAAOD,CACT,EAEIE,GAAS,CACZ,OAAQR,GACR,cAAeG,EAChB,EAUA,IAAIM,GAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,IAAI,WAAW,CAAC,CAAC,CAAG,OAASC,EAAI,CAAED,GAAmB,EAAO,CAMnG,MAAME,GAAW,IAAI,WAAW,GAAG,EACnC,QAASC,EAAI,EAAGA,EAAI,IAAKA,IACvBD,GAASC,CAAC,EAAKA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EAE5FD,GAAS,GAAG,EAAIA,GAAS,GAAG,EAAI,EAIhC,IAAIE,GAAcjF,GAAQ,CACxB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAW,EAAG,OAAOA,CAAG,EAGrC,IAAIpO,EAAKoD,EAAGkQ,EAAIC,EAAO,EAAGC,EAAUpF,EAAI,OAAQqF,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/BnQ,EAAIgL,EAAI,WAAWmF,CAAK,GACnBnQ,EAAI,SAAY,OAAWmQ,EAAQ,EAAIC,IAC1CF,EAAKlF,EAAI,WAAWmF,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBlQ,EAAI,OAAYA,EAAI,OAAW,KAAOkQ,EAAK,OAC3CC,MAGJE,GAAWrQ,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHApD,EAAM,IAAI,WAAWyT,CAAO,EAGvB,EAAI,EAAGF,EAAQ,EAAG,EAAIE,EAASF,IAClCnQ,EAAIgL,EAAI,WAAWmF,CAAK,GACnBnQ,EAAI,SAAY,OAAWmQ,EAAQ,EAAIC,IAC1CF,EAAKlF,EAAI,WAAWmF,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBlQ,EAAI,OAAYA,EAAI,OAAW,KAAOkQ,EAAK,OAC3CC,MAGAnQ,EAAI,IAENpD,EAAI,GAAG,EAAIoD,EACFA,EAAI,MAEbpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,EACzBpD,EAAI,GAAG,EAAI,IAAQoD,EAAI,IACdA,EAAI,OAEbpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,GACzBpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,EAAI,GAC7BpD,EAAI,GAAG,EAAI,IAAQoD,EAAI,KAGvBpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,GACzBpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,GAAK,GAC9BpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,EAAI,GAC7BpD,EAAI,GAAG,EAAI,IAAQoD,EAAI,IAI3B,OAAOpD,CACT,EAGA,MAAM0T,GAAgB,CAAC1T,EAAKC,IAAQ,CAIlC,GAAIA,EAAM,OACJD,EAAI,UAAYiT,GAClB,OAAO,OAAO,aAAa,MAAM,KAAMjT,EAAI,SAAWC,EAAMD,EAAMA,EAAI,SAAS,EAAGC,CAAG,CAAC,EAI1F,IAAI6S,EAAS,GACb,QAASnK,EAAI,EAAGA,EAAI1I,EAAK0I,IACvBmK,GAAU,OAAO,aAAa9S,EAAI2I,CAAC,CAAC,EAEtC,OAAOmK,CACT,EAIA,IAAIa,GAAa,CAAC3T,EAAK4T,IAAQ,CAC7B,MAAM3T,EAAM2T,GAAO5T,EAAI,OAEvB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAW,EAAG,OAAOA,EAAI,SAAS,EAAG4T,CAAG,CAAC,EAGtD,IAAIjL,EAAGkL,EAKP,MAAMC,EAAW,IAAI,MAAM7T,EAAM,CAAC,EAElC,IAAK4T,EAAM,EAAGlL,EAAI,EAAGA,EAAI1I,GAAM,CAC7B,IAAImD,EAAIpD,EAAI2I,GAAG,EAEf,GAAIvF,EAAI,IAAM,CAAE0Q,EAASD,GAAK,EAAIzQ,EAAG,QAAU,CAE/C,IAAI2Q,EAAQZ,GAAS/P,CAAC,EAEtB,GAAI2Q,EAAQ,EAAG,CAAED,EAASD,GAAK,EAAI,MAAQlL,GAAKoL,EAAQ,EAAG,QAAU,CAKrE,IAFA3Q,GAAK2Q,IAAU,EAAI,GAAOA,IAAU,EAAI,GAAO,EAExCA,EAAQ,GAAKpL,EAAI1I,GACtBmD,EAAKA,GAAK,EAAMpD,EAAI2I,GAAG,EAAI,GAC3BoL,IAIF,GAAIA,EAAQ,EAAG,CAAED,EAASD,GAAK,EAAI,MAAQ,QAAU,CAEjDzQ,EAAI,MACN0Q,EAASD,GAAK,EAAIzQ,GAElBA,GAAK,MACL0Q,EAASD,GAAK,EAAI,MAAWzQ,GAAK,GAAM,KACxC0Q,EAASD,GAAK,EAAI,MAAUzQ,EAAI,KAEpC,CAEA,OAAOsQ,GAAcI,EAAUD,CAAG,CACpC,EASIG,GAAa,CAAChU,EAAK4T,IAAQ,CAE7BA,EAAMA,GAAO5T,EAAI,OACb4T,EAAM5T,EAAI,SAAU4T,EAAM5T,EAAI,QAGlC,IAAIgI,EAAM4L,EAAM,EAChB,KAAO5L,GAAO,IAAMhI,EAAIgI,CAAG,EAAI,OAAU,KAAQA,IAQjD,OAJIA,EAAM,GAINA,IAAQ,EAAY4L,EAEhB5L,EAAMmL,GAASnT,EAAIgI,CAAG,CAAC,EAAI4L,EAAO5L,EAAM4L,CAClD,EAEIK,GAAU,CACb,WAAYZ,GACZ,WAAYM,GACZ,WAAYK,EACb,EAqBA,SAASE,IAAU,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,CACf,CAEA,IAAIC,GAAUD,GAEd,MAAME,GAAa,OAAO,UAAU,SAK9B,CACJ,WAAYC,GAAc,aAAAC,GAAc,aAAAC,GAAc,SAAUC,GAChE,KAAMC,GAAQ,aAAcC,GAC5B,sBAAAC,GACA,mBAAAC,GACA,WAAYC,EACd,EAAI/L,GA0FJ,SAASgM,GAAUC,EAAS,CAC1B,KAAK,QAAU/B,GAAO,OAAO,CAC3B,MAAO2B,GACP,OAAQE,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAUD,EACd,EAAKG,GAAW,CAAA,CAAE,EAEhB,IAAIC,EAAM,KAAK,QAEXA,EAAI,KAAQA,EAAI,WAAa,EAC/BA,EAAI,WAAa,CAACA,EAAI,WAGfA,EAAI,MAASA,EAAI,WAAa,GAAOA,EAAI,WAAa,KAC7DA,EAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,IAAIb,GAChB,KAAK,KAAK,UAAY,EAEtB,IAAIhD,EAASiB,GAAY,aACvB,KAAK,KACL4C,EAAI,MACJA,EAAI,OACJA,EAAI,WACJA,EAAI,SACJA,EAAI,QACR,EAEE,GAAI7D,IAAWsD,GACb,MAAM,IAAI,MAAM5L,GAASsI,CAAM,CAAC,EAOlC,GAJI6D,EAAI,QACN5C,GAAY,iBAAiB,KAAK,KAAM4C,EAAI,MAAM,EAGhDA,EAAI,WAAY,CAClB,IAAIC,EAaJ,GAXI,OAAOD,EAAI,YAAe,SAE5BC,EAAOhB,GAAQ,WAAWe,EAAI,UAAU,EAC/BZ,GAAW,KAAKY,EAAI,UAAU,IAAM,uBAC7CC,EAAO,IAAI,WAAWD,EAAI,UAAU,EAEpCC,EAAOD,EAAI,WAGb7D,EAASiB,GAAY,qBAAqB,KAAK,KAAM6C,CAAI,EAErD9D,IAAWsD,GACb,MAAM,IAAI,MAAM5L,GAASsI,CAAM,CAAC,EAGlC,KAAK,UAAY,EACnB,CACF,CAwBA2D,GAAU,UAAU,KAAO,SAAUpI,EAAMwI,EAAY,CACrD,MAAMhJ,EAAO,KAAK,KACZiJ,EAAY,KAAK,QAAQ,UAC/B,IAAIhE,EAAQiE,EAEZ,GAAI,KAAK,MAAS,MAAO,GAkBzB,IAhBIF,IAAe,CAAC,CAACA,EAAYE,EAAcF,EAC1CE,EAAcF,IAAe,GAAOV,GAAaH,GAGlD,OAAO3H,GAAS,SAElBR,EAAK,MAAQ+H,GAAQ,WAAWvH,CAAI,EAC3B0H,GAAW,KAAK1H,CAAI,IAAM,uBACnCR,EAAK,MAAQ,IAAI,WAAWQ,CAAI,EAEhCR,EAAK,MAAQQ,EAGfR,EAAK,QAAU,EACfA,EAAK,SAAWA,EAAK,MAAM,SAElB,CAQP,GAPIA,EAAK,YAAc,IACrBA,EAAK,OAAS,IAAI,WAAWiJ,CAAS,EACtCjJ,EAAK,SAAW,EAChBA,EAAK,UAAYiJ,IAIdC,IAAgBd,IAAgBc,IAAgBb,KAAiBrI,EAAK,WAAa,EAAG,CACzF,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACF,CAKA,GAHAiF,EAASiB,GAAY,QAAQlG,EAAMkJ,CAAW,EAG1CjE,IAAWuD,GACb,OAAIxI,EAAK,SAAW,GAClB,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAEpDiF,EAASiB,GAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAMjB,CAAM,EACjB,KAAK,MAAQ,GACNA,IAAWsD,GAIpB,GAAIvI,EAAK,YAAc,EAAG,CACxB,KAAK,OAAOA,EAAK,MAAM,EACvB,QACF,CAGA,GAAIkJ,EAAc,GAAKlJ,EAAK,SAAW,EAAG,CACxC,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACF,CAEA,GAAIA,EAAK,WAAa,EAAG,KAC3B,CAEA,MAAO,EACT,EAUA4I,GAAU,UAAU,OAAS,SAAU/B,EAAO,CAC5C,KAAK,OAAO,KAAKA,CAAK,CACxB,EAYA+B,GAAU,UAAU,MAAQ,SAAU3D,EAAQ,CAExCA,IAAWsD,KACb,KAAK,OAASzB,GAAO,cAAc,KAAK,MAAM,GAEhD,KAAK,OAAS,CAAA,EACd,KAAK,IAAM7B,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EAmCA,SAASkE,GAAU3D,EAAOqD,EAAS,CACjC,MAAMO,EAAW,IAAIR,GAAUC,CAAO,EAKtC,GAHAO,EAAS,KAAK5D,EAAO,EAAI,EAGrB4D,EAAS,IAAO,MAAMA,EAAS,KAAOzM,GAASyM,EAAS,GAAG,EAE/D,OAAOA,EAAS,MAClB,CA0BA,SAASC,GAAO7D,EAAOqD,EAAS,CAC9B,OAAAA,EAAUA,GAAW,CAAA,EACrBA,EAAQ,KAAO,GACRM,GAAU3D,EAAOqD,CAAO,CACjC,CAMA,IAAIS,GAAWD,GAGXE,GAAc,CAIjB,KAAMD,EAEP,EAorFA,KAAM,CAAgC,KAAAE,EAAI,EAAKD,GAS/C,IAAIE,GAASD,GC5oNN,MAAME,WAAqB,KAAM,CAItC,YAAY,CACV,KAAAC,EACA,OAAAC,EACA,OAAA3E,EACA,OAAA4E,CAAA,EAYC,CACD,MAAA,EACA,KAAK,KAAOF,EACZ,KAAK,QAAUC,EACf,KAAK,OAASC,EACd,KAAK,OAAS5E,CAChB,CACF,CAMO,MAAM6E,WAA+B,KAAM,CAChD,aAAc,CACZ,MAAM,0BAA0B,CAClC,CACF,CAEO,MAAMC,WAA0B,KAAM,CAC3C,aAAc,CACZ,MAAM,qBAAqB,CAC7B,CACF,CAEO,MAAMC,WAA8B,KAAM,CAC/C,aAAc,CACZ,MAAM,0BAA0B,CAClC,CACF,CAEO,MAAMC,WAA0B,KAAM,CAC3C,aAAc,CACZ,MAAM,qBAAqB,CAC7B,CACF,CAEO,MAAMC,WAA0B,KAAM,CAC3C,aAAc,CACZ,MAAM,qBAAqB,CAC7B,CACF,CAEO,MAAMC,WAAmC,KAAM,CAGpD,YAAY,CAAE,OAAAP,GAAqC,CACjD,MAAM,+BAA+B,EAErC,KAAK,OAASA,CAChB,CACF,CAEA,MAAMQ,GAAuB,YACtB,MAAMC,WAAiB,KAAM,CAClC,YAAY,CAAE,MAAAC,GAA8B,CAC1C,MAAMF,EAAoB,EAE1B,KAAK,MAAQE,CACf,CACF,CACO,MAAMC,GAAcC,GAClBA,EAAM,UAAYJ,GAGrBK,GAAkC,8BACjC,MAAMC,WAAiC,KAAM,CAClD,YAAY,CAAE,MAAAJ,GAA6B,CACzC,MAAMG,EAA+B,EAErC,KAAK,MAAQH,CACf,CACF,CACO,MAAMK,GAA8BH,GAClCA,EAAM,UAAYC,GAGrBG,GAAgC,sBAC/B,MAAMC,WAA0B,KAAM,CAC3C,YAAY,CAAE,MAAAP,GAA8B,CAC1C,MAAMM,EAA6B,EAEnC,KAAK,MAAQN,CACf,CACF,CACO,MAAMQ,GAAuBN,GAC3BA,EAAM,UAAYI,GAGrBG,GAAyB,oBACxB,MAAMC,WAAwB,KAAM,CACzC,YAAY,CAAE,MAAAV,GAA8B,CAC1C,MAAMS,EAAsB,EAE5B,KAAK,MAAQT,CACf,CACF,CACO,MAAMW,GAAqBT,GACzBA,EAAM,UAAYO,GC/KK,SAASG,EAAavB,EAAMwB,EAAaC,EAAQ,OAC7E,SAASC,EAAKC,EAAMC,EAAK,CAWrB,GAVKD,EAAK,MACN,OAAO,eAAeA,EAAM,OAAQ,CAChC,MAAO,CACH,IAAAC,EACA,OAAQC,EACR,OAAQ,IAAI,GAChC,EACgB,WAAY,EAC5B,CAAa,EAEDF,EAAK,KAAK,OAAO,IAAI3B,CAAI,EACzB,OAEJ2B,EAAK,KAAK,OAAO,IAAI3B,CAAI,EACzBwB,EAAYG,EAAMC,CAAG,EAErB,MAAME,EAAQD,EAAE,UACVE,EAAO,OAAO,KAAKD,CAAK,EAC9B,QAAShP,EAAI,EAAGA,EAAIiP,EAAK,OAAQjP,IAAK,CAClC,MAAMxD,EAAIyS,EAAKjP,CAAC,EACVxD,KAAKqS,IACPA,EAAKrS,CAAC,EAAIwS,EAAMxS,CAAC,EAAE,KAAKqS,CAAI,EAEpC,CACJ,CAEA,MAAMK,GAASC,EAAAR,GAAA,YAAAA,EAAQ,SAAR,KAAAQ,EAAkB,OACjC,MAAMC,UAAmBF,CAAO,CACpC,CACI,OAAO,eAAeE,EAAY,OAAQ,CAAE,MAAOlC,EAAM,EACzD,SAAS6B,EAAED,EAAK,OACZ,IAAIK,EACJ,MAAMN,EAAOF,GAAA,MAAAA,EAAQ,OAAS,IAAIS,EAAe,KACjDR,EAAKC,EAAMC,CAAG,GACbK,KAAKN,EAAK,MAAM,WAAhB,OAA6BM,EAAG,SAAW,IAC5C,UAAWE,KAAMR,EAAK,KAAK,SACvBQ,EAAE,EAEN,OAAOR,CACX,CACA,cAAO,eAAeE,EAAG,OAAQ,CAAE,MAAOH,EAAM,EAChD,OAAO,eAAeG,EAAG,OAAO,YAAa,CACzC,MAAQF,GAAS,SACb,OAAIF,GAAA,MAAAA,EAAQ,QAAUE,aAAgBF,EAAO,OAClC,IACJW,GAAAH,EAAAN,GAAA,YAAAA,EAAM,OAAN,YAAAM,EAAY,SAAZ,YAAAG,EAAoB,IAAIpC,EACnC,CACR,CAAK,EACD,OAAO,eAAe6B,EAAG,OAAQ,CAAE,MAAO7B,EAAM,EACzC6B,CACX,CAGO,MAAMQ,WAAuB,KAAM,CACtC,aAAc,CACV,MAAM,0EAA0E,CACpF,CACJ,CACO,MAAMC,WAAwB,KAAM,CACvC,YAAYtC,EAAM,CACd,MAAM,uDAAuDA,CAAI,EAAE,EACnE,KAAK,KAAO,gBAChB,CACJ,CACO,MAAMuC,GAAe,CAAA,EACrB,SAASC,GAAOC,EAAW,CAG9B,OAAOF,EACX,CC/DO,SAASG,GAAcC,EAAS,CACnC,MAAMC,EAAgB,OAAO,OAAOD,CAAO,EAAE,OAAQpT,GAAM,OAAOA,GAAM,QAAQ,EAIhF,OAHe,OAAO,QAAQoT,CAAO,EAChC,OAAO,CAAC,CAACrT,EAAGuS,CAAC,IAAMe,EAAc,QAAQ,CAACtT,CAAC,IAAM,EAAE,EACnD,IAAI,CAAC,CAACuS,EAAGtS,CAAC,IAAMA,CAAC,CAE1B,CAIO,SAASsT,GAAsBhB,EAAGzU,EAAO,CAC5C,OAAI,OAAOA,GAAU,SACVA,EAAM,SAAQ,EAClBA,CACX,CACO,SAAS0V,GAAOC,EAAQ,CAE3B,MAAO,CACH,IAAI,OAAQ,CACE,CACN,MAAM3V,EAAQ2V,EAAM,EACpB,cAAO,eAAe,KAAM,QAAS,CAAE,MAAA3V,CAAK,CAAE,EACvCA,CACX,CAEJ,CACR,CACA,CACO,SAAS4V,GAAQnH,EAAO,CAC3B,OAAOA,GAAU,IACrB,CACO,SAASoH,GAAWpG,EAAQ,CAC/B,MAAMxF,EAAQwF,EAAO,WAAW,GAAG,EAAI,EAAI,EACrChK,EAAMgK,EAAO,SAAS,GAAG,EAAIA,EAAO,OAAS,EAAIA,EAAO,OAC9D,OAAOA,EAAO,MAAMxF,EAAOxE,CAAG,CAClC,CACO,SAASqQ,GAAmB/H,EAAKgI,EAAM,CAC1C,MAAMC,GAAejI,EAAI,SAAQ,EAAG,MAAM,GAAG,EAAE,CAAC,GAAK,IAAI,OACnDkI,EAAaF,EAAK,SAAQ,EAChC,IAAIG,GAAgBD,EAAW,MAAM,GAAG,EAAE,CAAC,GAAK,IAAI,OACpD,GAAIC,IAAiB,GAAK,WAAW,KAAKD,CAAU,EAAG,CACnD,MAAM1L,EAAQ0L,EAAW,MAAM,YAAY,EACvC1L,GAAA,MAAAA,EAAQ,KACR2L,EAAe,OAAO,SAAS3L,EAAM,CAAC,CAAC,EAE/C,CACA,MAAM4L,EAAWH,EAAcE,EAAeF,EAAcE,EACtDE,EAAS,OAAO,SAASrI,EAAI,QAAQoI,CAAQ,EAAE,QAAQ,IAAK,EAAE,CAAC,EAC/DE,EAAU,OAAO,SAASN,EAAK,QAAQI,CAAQ,EAAE,QAAQ,IAAK,EAAE,CAAC,EACvE,OAAQC,EAASC,EAAWC,GAAA,GAAMH,EACtC,CACA,MAAMI,GAAa,OAAO,YAAY,EAC/B,SAASC,EAAWC,EAAQnH,EAAKqG,EAAQ,CAC5C,IAAI3V,EACJ,OAAO,eAAeyW,EAAQnH,EAAK,CAC/B,KAAM,CACF,GAAItP,IAAUuW,GAId,OAAIvW,IAAU,SACVA,EAAQuW,GACRvW,EAAQ2V,EAAM,GAEX3V,CACX,EACA,IAAImC,EAAG,CACH,OAAO,eAAesU,EAAQnH,EAAK,CAC/B,MAAOnN,CAEvB,CAAa,CAEL,EACA,aAAc,EACtB,CAAK,CACL,CAIO,SAASuU,GAAWC,EAAQC,EAAM5W,EAAO,CAC5C,OAAO,eAAe2W,EAAQC,EAAM,CAChC,MAAA5W,EACA,SAAU,GACV,WAAY,GACZ,aAAc,EACtB,CAAK,CACL,CACO,SAAS6W,MAAaC,EAAM,CAC/B,MAAMC,EAAoB,CAAA,EAC1B,UAAWvC,KAAOsC,EAAM,CACpB,MAAME,EAAc,OAAO,0BAA0BxC,CAAG,EACxD,OAAO,OAAOuC,EAAmBC,CAAW,CAChD,CACA,OAAO,OAAO,iBAAiB,CAAA,EAAID,CAAiB,CACxD,CA4BO,SAASE,GAAI9L,EAAK,CACrB,OAAO,KAAK,UAAUA,CAAG,CAC7B,CACO,SAAS+L,GAAQzI,EAAO,CAC3B,OAAOA,EACF,YAAW,EACX,KAAI,EACJ,QAAQ,YAAa,EAAE,EACvB,QAAQ,WAAY,GAAG,EACvB,QAAQ,WAAY,EAAE,CAC/B,CACO,MAAM0I,GAAqB,sBAAuB,MAAQ,MAAM,kBAAoB,IAAIC,IAAU,CAAE,EACpG,SAASC,GAAS5N,EAAM,CAC3B,OAAO,OAAOA,GAAS,UAAYA,IAAS,MAAQ,CAAC,MAAM,QAAQA,CAAI,CAC3E,CACO,MAAM6N,GAAa5B,GAAO,IAAM,OAEnC,GAAI,OAAO,WAAc,eAAeb,EAAA,iCAAW,YAAX,MAAAA,EAAsB,SAAS,eACnE,MAAO,GAEX,GAAI,CACA,MAAM0C,EAAI,SACV,WAAIA,EAAE,EAAE,EACD,EACX,OACO9C,EAAG,CACN,MAAO,EACX,CACJ,CAAC,EACM,SAAS+C,GAAcC,EAAG,CAC7B,GAAIJ,GAASI,CAAC,IAAM,GAChB,MAAO,GAEX,MAAMC,EAAOD,EAAE,YAGf,GAFIC,IAAS,QAET,OAAOA,GAAS,WAChB,MAAO,GAEX,MAAMC,EAAOD,EAAK,UAIlB,MAHI,EAAAL,GAASM,CAAI,IAAM,IAGnB,OAAO,UAAU,eAAe,KAAKA,EAAM,eAAe,IAAM,GAIxE,CACO,SAASC,GAAaH,EAAG,CAC5B,OAAID,GAAcC,CAAC,EACRI,EAAA,GAAKJ,GACZ,MAAM,QAAQA,CAAC,EACR,CAAC,GAAGA,CAAC,EACTA,CACX,CAuDO,MAAMK,GAAmB,IAAI,IAAI,CAAC,SAAU,SAAU,QAAQ,CAAC,EAE/D,SAASC,GAAY5M,EAAK,CAC7B,OAAOA,EAAI,QAAQ,sBAAuB,MAAM,CACpD,CAEO,SAAS6M,GAAMzD,EAAMC,EAAKH,EAAQ,CACrC,MAAM4D,EAAK,IAAI1D,EAAK,KAAK,OAAOC,GAAA,KAAAA,EAAOD,EAAK,KAAK,GAAG,EACpD,OAAI,CAACC,GAAOH,GAAA,MAAAA,EAAQ,UAChB4D,EAAG,KAAK,OAAS1D,GACd0D,CACX,CACO,SAASC,EAAgBC,EAAS,CACrC,MAAM9D,EAAS8D,EACf,GAAI,CAAC9D,EACD,MAAO,CAAA,EACX,GAAI,OAAOA,GAAW,SAClB,MAAO,CAAE,MAAO,IAAMA,CAAM,EAChC,IAAIA,GAAA,YAAAA,EAAQ,WAAY,OAAW,CAC/B,IAAIA,GAAA,YAAAA,EAAQ,SAAU,OAClB,MAAM,IAAI,MAAM,kDAAkD,EACtEA,EAAO,MAAQA,EAAO,OAC1B,CAEA,OADA,OAAOA,EAAO,QACV,OAAOA,EAAO,OAAU,SACjB+D,EAAAP,EAAA,GAAKxD,GAAL,CAAa,MAAO,IAAMA,EAAO,KAAK,GAC1CA,CACX,CAyCO,SAASgE,GAAaC,EAAO,CAChC,OAAO,OAAO,KAAKA,CAAK,EAAE,OAAQpW,GACvBoW,EAAMpW,CAAC,EAAE,KAAK,QAAU,YAAcoW,EAAMpW,CAAC,EAAE,KAAK,SAAW,UACzE,CACL,CACO,MAAMqW,GAAuB,CAChC,QAAS,CAAC,OAAO,iBAAkB,OAAO,gBAAgB,EAC1D,MAAO,CAAC,YAAa,UAAU,EAC/B,OAAQ,CAAC,EAAG,UAAU,EACtB,QAAS,CAAC,sBAAwB,oBAAqB,EACvD,QAAS,CAAC,CAAC,OAAO,UAAW,OAAO,SAAS,CACjD,EAKO,SAASC,GAAKC,EAAQC,EAAM,CAC/B,MAAMC,EAAUF,EAAO,KAAK,IACtBG,EAASD,EAAQ,OAEvB,GADkBC,GAAUA,EAAO,OAAS,EAExC,MAAM,IAAI,MAAM,iEAAiE,EAErF,MAAMpE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMI,EAAW,CAAA,EACjB,UAAWvJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOqJ,EAAQ,OACjB,MAAM,IAAI,MAAM,sBAAsBrJ,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,IAEbuJ,EAASvJ,CAAG,EAAIqJ,EAAQ,MAAMrJ,CAAG,EACrC,CACA,OAAAoH,GAAW,KAAM,QAASmC,CAAQ,EAC3BA,CACX,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAOb,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAASsE,GAAKL,EAAQC,EAAM,CAC/B,MAAMC,EAAUF,EAAO,KAAK,IACtBG,EAASD,EAAQ,OAEvB,GADkBC,GAAUA,EAAO,OAAS,EAExC,MAAM,IAAI,MAAM,iEAAiE,EAErF,MAAMpE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMI,EAAWhB,EAAA,GAAKY,EAAO,KAAK,IAAI,OACtC,UAAWnJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOqJ,EAAQ,OACjB,MAAM,IAAI,MAAM,sBAAsBrJ,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,GAEb,OAAOuJ,EAASvJ,CAAG,CACvB,CACA,OAAAoH,GAAW,KAAM,QAASmC,CAAQ,EAC3BA,CACX,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAOb,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAASuE,GAAON,EAAQH,EAAO,CAClC,GAAI,CAACd,GAAcc,CAAK,EACpB,MAAM,IAAI,MAAM,kDAAkD,EAEtE,MAAMM,EAASH,EAAO,KAAK,IAAI,OAE/B,GADkBG,GAAUA,EAAO,OAAS,EAC7B,CAGX,MAAMI,EAAgBP,EAAO,KAAK,IAAI,MACtC,UAAWnJ,KAAOgJ,EACd,GAAI,OAAO,yBAAyBU,EAAe1J,CAAG,IAAM,OACxD,MAAM,IAAI,MAAM,8FAA8F,CAG1H,CACA,MAAMkF,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMQ,EAASpB,IAAA,GAAKY,EAAO,KAAK,IAAI,OAAUH,GAC9C,OAAA5B,GAAW,KAAM,QAASuC,CAAM,EACzBA,CACX,CACR,CAAK,EACD,OAAOjB,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAAS0E,GAAWT,EAAQH,EAAO,CACtC,GAAI,CAACd,GAAcc,CAAK,EACpB,MAAM,IAAI,MAAM,sDAAsD,EAE1E,MAAM9D,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMQ,EAASpB,IAAA,GAAKY,EAAO,KAAK,IAAI,OAAUH,GAC9C,OAAA5B,GAAW,KAAM,QAASuC,CAAM,EACzBA,CACX,CACR,CAAK,EACD,OAAOjB,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAAS2E,GAAMC,EAAGtP,EAAG,CACxB,MAAM0K,EAAMqC,GAAUuC,EAAE,KAAK,IAAK,CAC9B,IAAI,OAAQ,CACR,MAAMH,EAASpB,IAAA,GAAKuB,EAAE,KAAK,IAAI,OAAUtP,EAAE,KAAK,IAAI,OACpD,OAAA4M,GAAW,KAAM,QAASuC,CAAM,EACzBA,CACX,EACA,IAAI,UAAW,CACX,OAAOnP,EAAE,KAAK,IAAI,QACtB,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAOkO,GAAMoB,EAAG5E,CAAG,CACvB,CACO,SAAS6E,GAAQC,EAAOb,EAAQC,EAAM,CAEzC,MAAME,EADUH,EAAO,KAAK,IACL,OAEvB,GADkBG,GAAUA,EAAO,OAAS,EAExC,MAAM,IAAI,MAAM,oEAAoE,EAExF,MAAMpE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMc,EAAWd,EAAO,KAAK,IAAI,MAC3BH,EAAQT,EAAA,GAAK0B,GACnB,GAAIb,EACA,UAAWpJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOiK,GACT,MAAM,IAAI,MAAM,sBAAsBjK,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,IAGbgJ,EAAMhJ,CAAG,EAAIgK,EACP,IAAIA,EAAM,CACR,KAAM,WACN,UAAWC,EAASjK,CAAG,CACnD,CAAyB,EACCiK,EAASjK,CAAG,EACtB,KAGA,WAAWA,KAAOiK,EAEdjB,EAAMhJ,CAAG,EAAIgK,EACP,IAAIA,EAAM,CACR,KAAM,WACN,UAAWC,EAASjK,CAAG,CACnD,CAAyB,EACCiK,EAASjK,CAAG,EAG1B,OAAAoH,GAAW,KAAM,QAAS4B,CAAK,EACxBA,CACX,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAON,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAASgF,GAASF,EAAOb,EAAQC,EAAM,CAC1C,MAAMlE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMc,EAAWd,EAAO,KAAK,IAAI,MAC3BH,EAAQT,EAAA,GAAK0B,GACnB,GAAIb,EACA,UAAWpJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOgJ,GACT,MAAM,IAAI,MAAM,sBAAsBhJ,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,IAGbgJ,EAAMhJ,CAAG,EAAI,IAAIgK,EAAM,CACnB,KAAM,cACN,UAAWC,EAASjK,CAAG,CAC/C,CAAqB,EACL,KAGA,WAAWA,KAAOiK,EAEdjB,EAAMhJ,CAAG,EAAI,IAAIgK,EAAM,CACnB,KAAM,cACN,UAAWC,EAASjK,CAAG,CAC/C,CAAqB,EAGT,OAAAoH,GAAW,KAAM,QAAS4B,CAAK,EACxBA,CACX,CACR,CAAK,EACD,OAAON,GAAMS,EAAQjE,CAAG,CAC5B,CAEO,SAASiF,GAAQC,EAAGC,EAAa,EAAG,OACvC,GAAID,EAAE,UAAY,GACd,MAAO,GACX,QAAShU,EAAIiU,EAAYjU,EAAIgU,EAAE,OAAO,OAAQhU,IAC1C,KAAImP,EAAA6E,EAAE,OAAOhU,CAAC,IAAV,YAAAmP,EAAa,YAAa,GAC1B,MAAO,GAGf,MAAO,EACX,CACO,SAAS+E,GAAaC,EAAMC,EAAQ,CACvC,OAAOA,EAAO,IAAKC,GAAQ,OACvB,IAAIlF,EACJ,OAACA,KAAKkF,GAAK,OAAV,OAAmBlF,EAAG,KAAO,CAAA,GAC9BkF,EAAI,KAAK,QAAQF,CAAI,EACdE,CACX,CAAC,CACL,CACO,SAASC,GAAcC,EAAS,CACnC,OAAO,OAAOA,GAAY,SAAWA,EAAUA,GAAA,YAAAA,EAAS,OAC5D,CACO,SAASC,GAAcH,EAAKI,EAAK/E,EAAQ,2BAC5C,MAAMgF,EAAOhC,EAAAP,EAAA,GAAKkC,GAAL,CAAU,MAAMlF,EAAAkF,EAAI,OAAJ,KAAAlF,EAAY,EAAE,GAE3C,GAAI,CAACkF,EAAI,QAAS,CACd,MAAME,GAAUI,GAAAC,GAAAC,GAAAC,EAAAR,IAAcS,GAAAC,GAAA1F,EAAA+E,EAAI,OAAJ,YAAA/E,EAAU,KAAK,MAAf,YAAA0F,EAAoB,QAApB,YAAAD,EAAA,KAAAC,EAA4BX,EAAI,IAA9C,KAAAS,EACZR,IAAcW,EAAAR,GAAA,YAAAA,EAAK,QAAL,YAAAQ,EAAA,KAAAR,EAAaJ,EAAI,IADnB,KAAAQ,EAEZP,IAAcY,EAAAxF,EAAO,cAAP,YAAAwF,EAAA,KAAAxF,EAAqB2E,EAAI,IAF3B,KAAAO,EAGZN,IAAca,EAAAzF,EAAO,cAAP,YAAAyF,EAAA,KAAAzF,EAAqB2E,EAAI,IAH3B,KAAAM,EAIZ,gBACJD,EAAK,QAAUH,CACnB,CAEA,cAAOG,EAAK,KACZ,OAAOA,EAAK,SACPD,GAAA,MAAAA,EAAK,aACN,OAAOC,EAAK,MAETA,CACX,CAWO,SAASU,GAAoBrM,EAAO,CACvC,OAAI,MAAM,QAAQA,CAAK,EACZ,QACP,OAAOA,GAAU,SACV,SACJ,SACX,CAsBO,SAASsM,MAASC,EAAM,CAC3B,KAAM,CAACjB,EAAKtL,EAAO8F,CAAI,EAAIyG,EAC3B,OAAI,OAAOjB,GAAQ,SACR,CACH,QAASA,EACT,KAAM,SACN,MAAAtL,EACA,KAAA8F,CACZ,EAEWsD,EAAA,GAAKkC,EAChB,CCplBA,MAAM3F,GAAc,CAACG,EAAMC,IAAQ,CAC/BD,EAAK,KAAO,YACZ,OAAO,eAAeA,EAAM,OAAQ,CAChC,MAAOA,EAAK,KACZ,WAAY,EACpB,CAAK,EACD,OAAO,eAAeA,EAAM,SAAU,CAClC,MAAOC,EACP,WAAY,EACpB,CAAK,EACDD,EAAK,QAAU,KAAK,UAAUC,EAAKyG,GAA4B,CAAC,EAChE,OAAO,eAAe1G,EAAM,WAAY,CACpC,MAAO,IAAMA,EAAK,QAClB,WAAY,EACpB,CAAK,CACL,EACa2G,GAAY/G,EAAa,YAAaC,EAAW,EACjD+G,GAAgBhH,EAAa,YAAaC,GAAa,CAAE,OAAQ,MAAO,EAC9E,SAASgH,GAAa3H,EAAO4H,EAAUN,GAAUA,EAAM,QAAS,CACnE,MAAMO,EAAc,CAAA,EACdC,EAAa,CAAA,EACnB,UAAWC,KAAO/H,EAAM,OAChB+H,EAAI,KAAK,OAAS,GAClBF,EAAYE,EAAI,KAAK,CAAC,CAAC,EAAIF,EAAYE,EAAI,KAAK,CAAC,CAAC,GAAK,CAAA,EACvDF,EAAYE,EAAI,KAAK,CAAC,CAAC,EAAE,KAAKH,EAAOG,CAAG,CAAC,GAGzCD,EAAW,KAAKF,EAAOG,CAAG,CAAC,EAGnC,MAAO,CAAE,WAAAD,EAAY,YAAAD,CAAW,CACpC,CACO,SAASG,GAAYhI,EAAO4H,EAAUN,GAAUA,EAAM,QAAS,CAClE,MAAMO,EAAc,CAAE,QAAS,EAAE,EAC3BI,EAAgBjI,GAAU,CAC5B,UAAWsH,KAAStH,EAAM,OACtB,GAAIsH,EAAM,OAAS,iBAAmBA,EAAM,OAAO,OAC/CA,EAAM,OAAO,IAAKjB,GAAW4B,EAAa,CAAE,OAAA5B,CAAM,CAAE,CAAC,UAEhDiB,EAAM,OAAS,cACpBW,EAAa,CAAE,OAAQX,EAAM,MAAM,CAAE,UAEhCA,EAAM,OAAS,kBACpBW,EAAa,CAAE,OAAQX,EAAM,MAAM,CAAE,UAEhCA,EAAM,KAAK,SAAW,EAC3BO,EAAY,QAAQ,KAAKD,EAAON,CAAK,CAAC,MAErC,CACD,IAAIY,EAAOL,EACP5V,EAAI,EACR,KAAOA,EAAIqV,EAAM,KAAK,QAAQ,CAC1B,MAAMa,EAAKb,EAAM,KAAKrV,CAAC,EACNA,IAAMqV,EAAM,KAAK,OAAS,GAKvCY,EAAKC,CAAE,EAAID,EAAKC,CAAE,GAAK,CAAE,QAAS,EAAE,EACpCD,EAAKC,CAAE,EAAE,QAAQ,KAAKP,EAAON,CAAK,CAAC,GAJnCY,EAAKC,CAAE,EAAID,EAAKC,CAAE,GAAK,CAAE,QAAS,EAAE,EAMxCD,EAAOA,EAAKC,CAAE,EACdlW,GACJ,CACJ,CAER,EACA,OAAAgW,EAAajI,CAAK,EACX6H,CACX,CCpEO,MAAMO,GAAUC,GAAS,CAACrD,EAAQzY,EAAO+b,EAAM5D,IAAY,OAC9D,MAAMgC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,MAAO,EAAK,CAAE,EAAI,CAAE,MAAO,EAAK,EACnElM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EACzD,GAAItK,aAAkB,QAClB,MAAM,IAAImM,GAEd,GAAInM,EAAO,OAAO,OAAQ,CACtB,MAAMoM,EAAI,KAAKpH,EAAAsD,GAAA,YAAAA,EAAS,MAAT,KAAAtD,EAAgBiH,GAAMjM,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,EAC5GC,MAAAA,GAAuBH,EAAG9D,GAAA,YAAAA,EAAS,MAAM,EACnC8D,CACV,CACA,OAAOpM,EAAO,KAClB,EAEawM,GAAeP,GAAS,CAAOrD,EAAQzY,EAAO+b,EAAM1H,IAAWiI,EAAA,4BACxE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,MAAO,EAAI,CAAE,EAAI,CAAE,MAAO,EAAI,EACvE,IAAIlM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EAGvD,GAFItK,aAAkB,UAClBA,EAAS,MAAMA,GACfA,EAAO,OAAO,OAAQ,CACtB,MAAMoM,EAAI,KAAKpH,EAAAR,GAAA,YAAAA,EAAQ,MAAR,KAAAQ,EAAeiH,GAAMjM,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,EAC3GC,MAAAA,GAAuBH,EAAG5H,GAAA,YAAAA,EAAQ,MAAM,EAClC4H,CACV,CACA,OAAOpM,EAAO,KAClB,GAEa0M,GAAcT,GAAS,CAACrD,EAAQzY,EAAO+b,IAAS,CACzD,MAAM5B,EAAM4B,EAAO3D,EAAAP,EAAA,GAAKkE,GAAL,CAAW,MAAO,EAAK,GAAK,CAAE,MAAO,EAAK,EACvDlM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EACzD,GAAItK,aAAkB,QAClB,MAAM,IAAImM,GAEd,OAAOnM,EAAO,OAAO,OACf,CACE,QAAS,GACT,MAAO,IAAKiM,GAAA,KAAAA,EAAQU,IAAkB3M,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,CACzH,EACU,CAAE,QAAS,GAAM,KAAMtM,EAAO,KAAK,CAC7C,EACa4M,GAA2BF,GAAWG,EAAoB,EAC1DC,GAAmBb,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACpE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,MAAO,EAAI,CAAE,EAAI,CAAE,MAAO,EAAI,EACvE,IAAIlM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EACvD,OAAItK,aAAkB,UAClBA,EAAS,MAAMA,GACZA,EAAO,OAAO,OACf,CACE,QAAS,GACT,MAAO,IAAIiM,EAAKjM,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,CACnG,EACU,CAAE,QAAS,GAAM,KAAMtM,EAAO,KAAK,CAC7C,GACa+M,GAAgCD,GAAgBD,EAAoB,EACpEG,GAAWf,GAAS,CAACrD,EAAQzY,EAAO+b,IAAS,CACtD,MAAM5B,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOF,GAAOC,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CAC1C,EAEa2C,GAAWhB,GAAS,CAACrD,EAAQzY,EAAO+b,IACtCF,GAAOC,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,EAG9BgB,GAAgBjB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACjE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOM,GAAYP,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CAC/C,GAEa6C,GAAgBlB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACjE,OAAOD,GAAYP,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,CAChD,GAEakB,GAAenB,GAAS,CAACrD,EAAQzY,EAAO+b,IAAS,CAC1D,MAAM5B,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOQ,GAAWT,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CAC9C,EAEa+C,GAAepB,GAAS,CAACrD,EAAQzY,EAAO+b,IAC1CQ,GAAWT,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,EAGlCoB,GAAoBrB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACrE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOY,GAAgBb,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CACnD,GAEaiD,GAAoBtB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACrE,OAAOK,GAAgBb,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,CACpD,GC1FasB,GAAO,mBACPC,GAAQ,cACRC,GAAO,wCACPC,GAAM,oBACNC,GAAQ,oBACRC,GAAS,sBAETC,GAAW,gGAIXC,GAAO,kFAIPC,GAAQC,GACZA,EAEE,IAAI,OAAO,mCAAmCA,CAAO,yDAAyD,EAD1G,yKAOFC,GAAQ,mGAUfC,GAAS,uDACR,SAASC,IAAQ,CACpB,OAAO,IAAI,OAAOD,GAAQ,GAAG,CACjC,CACO,MAAME,GAAO,sHACPC,GAAO,+XAKPC,GAAS,2IACTC,GAAS,iIAETC,GAAS,8EACTC,GAAY,mBAOZC,GAAO,oBAEdC,GAAa,sNACNC,GAAqB,IAAI,OAAO,IAAID,EAAU,GAAG,EAC9D,SAASE,GAAW3D,EAAM,CACtB,MAAM4D,EAAO,8BAQb,OAPc,OAAO5D,EAAK,WAAc,SAClCA,EAAK,YAAc,GACf,GAAG4D,CAAI,GACP5D,EAAK,YAAc,EACf,GAAG4D,CAAI,YACP,GAAGA,CAAI,mBAAmB5D,EAAK,SAAS,IAChD,GAAG4D,CAAI,4BAEjB,CACO,SAASC,GAAK7D,EAAM,CACvB,OAAO,IAAI,OAAO,IAAI2D,GAAW3D,CAAI,CAAC,GAAG,CAC7C,CAEO,SAAS8D,GAAS9D,EAAM,CAC3B,MAAM6D,EAAOF,GAAW,CAAE,UAAW3D,EAAK,SAAS,CAAE,EAC/C+D,EAAO,CAAC,GAAG,EACb/D,EAAK,OACL+D,EAAK,KAAK,EAAE,EAEZ/D,EAAK,QACL+D,EAAK,KAAK,mCAAmC,EACjD,MAAMC,EAAY,GAAGH,CAAI,MAAME,EAAK,KAAK,GAAG,CAAC,IAC7C,OAAO,IAAI,OAAO,IAAIN,EAAU,OAAOO,CAAS,IAAI,CACxD,CACO,MAAMC,GAAU5K,GAAW,SAC9B,MAAM6K,EAAQ7K,EAAS,aAAYQ,EAAAR,GAAA,YAAAA,EAAQ,UAAR,KAAAQ,EAAmB,CAAC,KAAIG,EAAAX,GAAA,YAAAA,EAAQ,UAAR,KAAAW,EAAmB,EAAE,IAAM,YACtF,OAAO,IAAI,OAAO,IAAIkK,CAAK,GAAG,CAClC,EAEaC,GAAU,UACVC,GAAS,oBACTC,GAAU,oBAMVC,GAAY,YAEZC,GAAY,YCjGZC,EAA0BC,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,SACjF,IAAIK,GACJA,EAAAN,EAAK,OAAL,OAAcA,EAAK,KAAO,CAAA,GAC1BA,EAAK,KAAK,IAAMC,GACfQ,GAAAH,EAAKN,EAAK,MAAM,WAAhB,OAA6BM,EAAG,SAAW,GAChD,CAAC,EACK6K,GAAmB,CACrB,OAAQ,SACR,OAAQ,SACR,OAAQ,MACZ,EACaC,GAAkCF,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,CACjGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAMoL,EAASF,GAAiB,OAAOlL,EAAI,KAAK,EAChDD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IAChBoH,GAAQ9G,EAAAL,EAAI,UAAYqL,EAAI,QAAUA,EAAI,mBAAlC,KAAAhL,EAAuD,OAAO,kBACxEL,EAAI,MAAQmH,IACRnH,EAAI,UACJqL,EAAI,QAAUrL,EAAI,MAElBqL,EAAI,iBAAmBrL,EAAI,MAEvC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,EACvBtL,EAAI,UAAYsL,EAAQ,OAAStL,EAAI,MAAQsL,EAAQ,MAAQtL,EAAI,QAGrEsL,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,UACN,QAAS,OAAOpL,EAAI,OAAU,SAAWA,EAAI,MAAM,UAAYA,EAAI,MACnE,MAAOsL,EAAQ,MACf,UAAWtL,EAAI,UACf,KAAAD,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYuL,GAAqCN,EAAkB,uBAAwB,CAAClL,EAAMC,IAAQ,CACvGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAMoL,EAASF,GAAiB,OAAOlL,EAAI,KAAK,EAChDD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IAChBoH,GAAQ9G,EAAAL,EAAI,UAAYqL,EAAI,QAAUA,EAAI,mBAAlC,KAAAhL,EAAuD,OAAO,kBACxEL,EAAI,MAAQmH,IACRnH,EAAI,UACJqL,EAAI,QAAUrL,EAAI,MAElBqL,EAAI,iBAAmBrL,EAAI,MAEvC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,EACvBtL,EAAI,UAAYsL,EAAQ,OAAStL,EAAI,MAAQsL,EAAQ,MAAQtL,EAAI,QAGrEsL,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,YACN,QAAS,OAAOpL,EAAI,OAAU,SAAWA,EAAI,MAAM,UAAYA,EAAI,MACnE,MAAOsL,EAAQ,MACf,UAAWtL,EAAI,UACf,KAAAD,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYwL,GACCP,EAAkB,sBAAuB,CAAClL,EAAMC,IAAQ,CAClEgL,EAAU,KAAKjL,EAAMC,CAAG,EACxBD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,IAAIM,GACHA,KAAKN,EAAK,KAAK,KAAK,aAApB,OAAmCM,EAAG,WAAaL,EAAI,MAC5D,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,GAAI,OAAOA,EAAQ,OAAU,OAAOtL,EAAI,MACpC,MAAM,IAAI,MAAM,oDAAoD,GACrD,OAAOsL,EAAQ,OAAU,SACtCA,EAAQ,MAAQtL,EAAI,QAAU,OAAO,CAAC,EACtCyL,GAAwBH,EAAQ,MAAOtL,EAAI,KAAK,IAAM,IAG5DsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,OAAOA,EAAQ,MACvB,KAAM,kBACN,QAAStL,EAAI,MACb,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACY0L,GAAsCT,EAAkB,wBAAyB,CAAClL,EAAMC,IAAQ,OACzGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxBA,EAAI,OAASA,EAAI,QAAU,UAC3B,MAAM2L,GAAQtL,EAAAL,EAAI,SAAJ,YAAAK,EAAY,SAAS,OAC7B+K,EAASO,EAAQ,MAAQ,SACzB,CAACC,EAASC,CAAO,EAAIC,GAA0B9L,EAAI,MAAM,EAC/DD,EAAK,KAAK,SAAS,KAAMA,GAAS,CAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IACtBsL,EAAI,OAASrL,EAAI,OACjBqL,EAAI,QAAUO,EACdP,EAAI,QAAUQ,EACVF,IACAN,EAAI,QAAUU,GACtB,CAAC,EACDhM,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MACtB,GAAIK,EAAO,CACP,GAAI,CAAC,OAAO,UAAU1R,CAAK,EAAG,CAU1BqR,EAAQ,OAAO,KAAK,CAChB,SAAUF,EACV,OAAQpL,EAAI,OACZ,KAAM,eACN,SAAU,GACV,MAAA/F,EACA,KAAA8F,CACpB,CAAiB,EACD,MASJ,CACA,GAAI,CAAC,OAAO,cAAc9F,CAAK,EAAG,CAC1BA,EAAQ,EAERqR,EAAQ,OAAO,KAAK,CAChB,MAAArR,EACA,KAAM,UACN,QAAS,OAAO,iBAChB,KAAM,kDACN,KAAA8F,EACA,OAAAqL,EACA,UAAW,GACX,SAAU,CAACpL,EAAI,KACvC,CAAqB,EAIDsL,EAAQ,OAAO,KAAK,CAChB,MAAArR,EACA,KAAM,YACN,QAAS,OAAO,iBAChB,KAAM,kDACN,KAAA8F,EACA,OAAAqL,EACA,UAAW,GACX,SAAU,CAACpL,EAAI,KACvC,CAAqB,EAEL,MACJ,CACJ,CACI/F,EAAQ2R,GACRN,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,MAAArR,EACA,KAAM,YACN,QAAA2R,EACA,UAAW,GACX,KAAA7L,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,EAED/F,EAAQ4R,GACRP,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,MAAArR,EACA,KAAM,UACN,QAAA4R,EACA,UAAW,GACX,KAAA9L,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CAET,CACJ,CAAC,EA0HYgM,GAAmCf,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,OACnG,IAAIK,EACJ2K,EAAU,KAAKjL,EAAMC,CAAG,GACvBK,KAAKN,EAAK,KAAK,KAAK,OAApB,OAA6BM,EAAG,KAAQiL,GAAY,CACjD,MAAM/R,EAAM+R,EAAQ,MACpB,MAAO,CAACW,GAAa1S,CAAG,GAAKA,EAAI,SAAW,MAChD,GACAwG,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMoH,GAAQ9G,EAAAN,EAAK,KAAK,IAAI,UAAd,KAAAM,EAAyB,OAAO,kBAC1CL,EAAI,QAAUmH,IACdpH,EAAK,KAAK,IAAI,QAAUC,EAAI,QACpC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAEtB,GADerR,EAAM,QACP+F,EAAI,QACd,OACJ,MAAMoL,EAASc,GAAyBjS,CAAK,EAC7CqR,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,UACN,QAASpL,EAAI,QACb,UAAW,GACX,MAAA/F,EACA,KAAA8F,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYmM,GAAmClB,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,OACnG,IAAIK,EACJ2K,EAAU,KAAKjL,EAAMC,CAAG,GACvBK,KAAKN,EAAK,KAAK,KAAK,OAApB,OAA6BM,EAAG,KAAQiL,GAAY,CACjD,MAAM/R,EAAM+R,EAAQ,MACpB,MAAO,CAACW,GAAa1S,CAAG,GAAKA,EAAI,SAAW,MAChD,GACAwG,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMoH,GAAQ9G,EAAAN,EAAK,KAAK,IAAI,UAAd,KAAAM,EAAyB,OAAO,kBAC1CL,EAAI,QAAUmH,IACdpH,EAAK,KAAK,IAAI,QAAUC,EAAI,QACpC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAEtB,GADerR,EAAM,QACP+F,EAAI,QACd,OACJ,MAAMoL,EAASc,GAAyBjS,CAAK,EAC7CqR,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,YACN,QAASpL,EAAI,QACb,UAAW,GACX,MAAA/F,EACA,KAAA8F,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYoM,GAAsCnB,EAAkB,wBAAyB,CAAClL,EAAMC,IAAQ,OACzG,IAAIK,EACJ2K,EAAU,KAAKjL,EAAMC,CAAG,GACvBK,KAAKN,EAAK,KAAK,KAAK,OAApB,OAA6BM,EAAG,KAAQiL,GAAY,CACjD,MAAM/R,EAAM+R,EAAQ,MACpB,MAAO,CAACW,GAAa1S,CAAG,GAAKA,EAAI,SAAW,MAChD,GACAwG,EAAK,KAAK,SAAS,KAAMA,GAAS,CAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IACtBsL,EAAI,QAAUrL,EAAI,OAClBqL,EAAI,QAAUrL,EAAI,OAClBqL,EAAI,OAASrL,EAAI,MACrB,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAChB7f,EAASwO,EAAM,OACrB,GAAIxO,IAAWuU,EAAI,OACf,OACJ,MAAMoL,EAASc,GAAyBjS,CAAK,EACvCoS,EAAS5gB,EAASuU,EAAI,OAC5BsL,EAAQ,OAAO,KAAK1H,EAAAP,EAAA,CAChB,OAAA+H,GACIiB,EAAS,CAAE,KAAM,UAAW,QAASrM,EAAI,QAAW,CAAE,KAAM,YAAa,QAASA,EAAI,MAAM,GAFhF,CAGhB,UAAW,GACX,MAAO,GACP,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,EAAS,CACL,CACJ,CAAC,EACYsM,GAAsCrB,EAAkB,wBAAyB,CAAClL,EAAMC,IAAQ,SACzG,IAAIK,EAAIG,EACRwK,EAAU,KAAKjL,EAAMC,CAAG,EACxBD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IACtBsL,EAAI,OAASrL,EAAI,OACbA,EAAI,WACJK,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAIrL,EAAI,OAAO,EAEpC,CAAC,EACGA,EAAI,SACHK,KAAKN,EAAK,MAAM,QAAhB,OAA0BM,EAAG,MAASiL,GAAY,CAC/CtL,EAAI,QAAQ,UAAY,EACpB,CAAAA,EAAI,QAAQ,KAAKsL,EAAQ,KAAK,GAElCA,EAAQ,OAAO,KAAK1H,EAAAP,EAAA,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQrD,EAAI,OACZ,MAAOsL,EAAQ,OACXtL,EAAI,QAAU,CAAE,QAASA,EAAI,QAAQ,UAAU,EAAK,IALxC,CAMhB,KAAAD,EACA,SAAU,CAACC,EAAI,KAC/B,EAAa,CACL,IAECQ,KAAKT,EAAK,MAAM,QAAhB,OAA0BS,EAAG,MAAQ,IAAM,CAAE,EACtD,CAAC,EACY+L,GAA+BtB,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3FsM,GAAsB,KAAKvM,EAAMC,CAAG,EACpCD,EAAK,KAAK,MAASuL,GAAY,CAC3BtL,EAAI,QAAQ,UAAY,EACpB,CAAAA,EAAI,QAAQ,KAAKsL,EAAQ,KAAK,GAElCA,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,QACR,MAAOA,EAAQ,MACf,QAAStL,EAAI,QAAQ,SAAQ,EAC7B,KAAAD,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYwM,GAAmCvB,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,QACnGK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUyM,IAC9BH,GAAsB,KAAKvM,EAAMC,CAAG,CACxC,CAAC,EACY0M,GAAmCzB,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,QACnGK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU2M,IAC9BL,GAAsB,KAAKvM,EAAMC,CAAG,CACxC,CAAC,EACY4M,GAAkC3B,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,CACjGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAM6M,EAAeC,GAAiB9M,EAAI,QAAQ,EAC5C+M,EAAU,IAAI,OAAO,OAAO/M,EAAI,UAAa,SAAW,MAAMA,EAAI,QAAQ,IAAI6M,CAAY,GAAKA,CAAY,EACjH7M,EAAI,QAAU+M,EACdhN,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,KACtBM,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAI0B,CAAO,CAC5B,CAAC,EACDhN,EAAK,KAAK,MAASuL,GAAY,CACvBA,EAAQ,MAAM,SAAStL,EAAI,SAAUA,EAAI,QAAQ,GAErDsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,WACR,SAAUtL,EAAI,SACd,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYgN,GAAoC/B,EAAkB,sBAAuB,CAAClL,EAAMC,IAAQ,OACrGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAM+M,EAAU,IAAI,OAAO,IAAID,GAAiB9M,EAAI,MAAM,CAAC,IAAI,GAC/DK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+M,GAC9BhN,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,KACtBM,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAI0B,CAAO,CAC5B,CAAC,EACDhN,EAAK,KAAK,MAASuL,GAAY,CACvBA,EAAQ,MAAM,WAAWtL,EAAI,MAAM,GAEvCsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,cACR,OAAQtL,EAAI,OACZ,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYiN,GAAkChC,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,OACjGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAM+M,EAAU,IAAI,OAAO,KAAKD,GAAiB9M,EAAI,MAAM,CAAC,GAAG,GAC/DK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+M,GAC9BhN,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,KACtBM,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAI0B,CAAO,CAC5B,CAAC,EACDhN,EAAK,KAAK,MAASuL,GAAY,CACvBA,EAAQ,MAAM,SAAStL,EAAI,MAAM,GAErCsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,YACR,OAAQtL,EAAI,OACZ,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EAyCYkN,GAAmCjC,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,CACnGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxBD,EAAK,KAAK,MAASuL,GAAY,CAC3BA,EAAQ,MAAQtL,EAAI,GAAGsL,EAAQ,KAAK,CACxC,CACJ,CAAC,EC9jBM,MAAM6B,EAAI,CACb,YAAY3G,EAAO,GAAI,CACnB,KAAK,QAAU,CAAA,EACf,KAAK,OAAS,EACV,OACA,KAAK,KAAOA,EACpB,CACA,SAASjG,EAAI,CACT,KAAK,QAAU,EACfA,EAAG,IAAI,EACP,KAAK,QAAU,CACnB,CACA,MAAM6M,EAAK,CACP,GAAI,OAAOA,GAAQ,WAAY,CAC3BA,EAAI,KAAM,CAAE,UAAW,MAAM,CAAE,EAC/BA,EAAI,KAAM,CAAE,UAAW,OAAO,CAAE,EAChC,MACJ,CAEA,MAAMC,EADUD,EACM,MAAM;AAAA,CAAI,EAAE,OAAQlI,GAAMA,CAAC,EAC3CoI,EAAY,KAAK,IAAI,GAAGD,EAAM,IAAKnI,GAAMA,EAAE,OAASA,EAAE,UAAS,EAAG,MAAM,CAAC,EACzEqI,EAAWF,EAAM,IAAKnI,GAAMA,EAAE,MAAMoI,CAAS,CAAC,EAAE,IAAKpI,GAAM,IAAI,OAAO,KAAK,OAAS,CAAC,EAAIA,CAAC,EAChG,UAAWsI,KAAQD,EACf,KAAK,QAAQ,KAAKC,CAAI,CAE9B,CACA,SAAU,OACN,MAAMzK,EAAI,SACJyD,EAAO,uBAAM,KAEb6G,EAAQ,CAAC,KADChN,EAAA,uBAAM,UAAN,KAAAA,EAAiB,CAAC,EAAE,GACV,IAAK6E,GAAM,KAAKA,CAAC,EAAE,CAAC,EAE9C,OAAO,IAAInC,EAAE,GAAGyD,EAAM6G,EAAM,KAAK;AAAA,CAAI,CAAC,CAC1C,CACJ,CClCO,MAAM/D,GAAU,CACnB,MAAO,EACP,MAAO,EACP,MAAO,CACX,ECGamE,EAAyBxC,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,WAC/E,IAAIK,EACJN,GAAA,OAASA,EAAO,IAChBA,EAAK,KAAK,IAAMC,EAChBD,EAAK,KAAK,IAAMA,EAAK,KAAK,KAAO,GACjCA,EAAK,KAAK,QAAUuJ,GACpB,MAAMlF,EAAS,CAAC,IAAI/D,EAAAN,EAAK,KAAK,IAAI,SAAd,KAAAM,EAAwB,CAAA,CAAG,EAE3CN,EAAK,KAAK,OAAO,IAAI,WAAW,GAChCqE,EAAO,QAAQrE,CAAI,EAEvB,UAAW2N,KAAMtJ,EACb,UAAW7D,KAAMmN,EAAG,KAAK,SACrBnN,EAAGR,CAAI,EAGf,GAAIqE,EAAO,SAAW,GAGjB5D,GAAAH,EAAKN,EAAK,MAAM,WAAhB,OAA6BM,EAAG,SAAW,KAC5C6F,EAAAnG,EAAK,KAAK,WAAV,MAAAmG,EAAoB,KAAK,IAAM,CAC3BnG,EAAK,KAAK,IAAMA,EAAK,KAAK,KAC9B,OAEC,CACD,MAAM4N,EAAY,CAACrC,EAASlH,EAAQuB,IAAQ,CACxC,IAAIiI,EAAYC,GAAavC,CAAO,EAChCwC,EACJ,UAAWJ,KAAMtJ,EAAQ,CACrB,GAAIsJ,EAAG,KAAK,IAAI,MAEZ,GAAI,CADcA,EAAG,KAAK,IAAI,KAAKpC,CAAO,EAEtC,iBAECsC,EACL,SAEJ,MAAMG,EAAUzC,EAAQ,OAAO,OACzBrL,EAAIyN,EAAG,KAAK,MAAMpC,CAAO,EAC/B,GAAIrL,aAAa,UAAW0F,GAAA,YAAAA,EAAK,SAAU,GACvC,MAAM,IAAI6B,GAEd,GAAIsG,GAAe7N,aAAa,QAC5B6N,GAAeA,GAAA,KAAAA,EAAe,QAAQ,QAAO,GAAI,KAAK,IAAYhG,EAAA,sBAC9D,MAAM7H,EACUqL,EAAQ,OAAO,SACfyC,IAEXH,IACDA,EAAYC,GAAavC,EAASyC,CAAO,GACjD,EAAC,MAEA,CAED,GADgBzC,EAAQ,OAAO,SACfyC,EACZ,SACCH,IACDA,EAAYC,GAAavC,EAASyC,CAAO,EACjD,CACJ,CACA,OAAID,EACOA,EAAY,KAAK,IACbxC,CACV,EAEEA,CACX,EACM0C,EAAqB,CAACC,EAAQ3C,EAAS3F,IAAQ,CAEjD,GAAIkI,GAAaI,CAAM,EACnB,OAAAA,EAAO,QAAU,GACVA,EAGX,MAAMC,EAAcP,EAAUrC,EAASlH,EAAQuB,CAAG,EAClD,GAAIuI,aAAuB,QAAS,CAChC,GAAIvI,EAAI,QAAU,GACd,MAAM,IAAI6B,GACd,OAAO0G,EAAY,KAAMA,GAAgBnO,EAAK,KAAK,MAAMmO,EAAavI,CAAG,CAAC,CAC9E,CACA,OAAO5F,EAAK,KAAK,MAAMmO,EAAavI,CAAG,CAC3C,EACA5F,EAAK,KAAK,IAAM,CAACuL,EAAS3F,IAAQ,CAC9B,GAAIA,EAAI,WACJ,OAAO5F,EAAK,KAAK,MAAMuL,EAAS3F,CAAG,EAEvC,GAAIA,EAAI,YAAc,WAAY,CAG9B,MAAMsI,EAASlO,EAAK,KAAK,MAAM,CAAE,MAAOuL,EAAQ,MAAO,OAAQ,CAAA,CAAE,EAAI1H,EAAAP,EAAA,GAAKsC,GAAL,CAAU,WAAY,IAAM,EACjG,OAAIsI,aAAkB,QACXA,EAAO,KAAMA,GACTD,EAAmBC,EAAQ3C,EAAS3F,CAAG,CACjD,EAEEqI,EAAmBC,EAAQ3C,EAAS3F,CAAG,CAClD,CAEA,MAAMtK,EAAS0E,EAAK,KAAK,MAAMuL,EAAS3F,CAAG,EAC3C,GAAItK,aAAkB,QAAS,CAC3B,GAAIsK,EAAI,QAAU,GACd,MAAM,IAAI6B,GACd,OAAOnM,EAAO,KAAMA,GAAWsS,EAAUtS,EAAQ+I,EAAQuB,CAAG,CAAC,CACjE,CACA,OAAOgI,EAAUtS,EAAQ+I,EAAQuB,CAAG,CACxC,CACJ,CAEAwI,EAAgBpO,EAAM,YAAa,KAAO,CACtC,SAAWvU,GAAU,OACjB,GAAI,CACA,MAAM4iB,EAAInG,GAAUlI,EAAMvU,CAAK,EAC/B,OAAO4iB,EAAE,QAAU,CAAE,MAAOA,EAAE,IAAI,EAAK,CAAE,QAAQ/N,EAAA+N,EAAE,QAAF,YAAA/N,EAAS,MAAM,CACpE,OACOJ,EAAG,CACN,OAAOmI,GAAerI,EAAMvU,CAAK,EAAE,KAAM4iB,GAAC,OAAM,OAAAA,EAAE,QAAU,CAAE,MAAOA,EAAE,IAAI,EAAK,CAAE,QAAQ/N,EAAA+N,EAAE,QAAF,YAAA/N,EAAS,MAAM,EAAG,CAChH,CACJ,EACA,OAAQ,MACR,QAAS,CACjB,EAAM,CACN,CAAC,EAEYgO,GAA2BpD,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,WACnFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,SAAUmG,EAAA,CAAC,IAAI1F,GAAAH,EAAAN,GAAA,YAAAA,EAAM,KAAK,MAAX,YAAAM,EAAgB,WAAhB,KAAAG,EAA4B,CAAA,CAAG,EAAE,IAAG,IAAzC,KAAA0F,EAA+CoI,GAAevO,EAAK,KAAK,GAAG,EAC/FA,EAAK,KAAK,MAAQ,CAACuL,EAASrL,IAAM,CAC9B,GAAID,EAAI,OACJ,GAAI,CACAsL,EAAQ,MAAQ,OAAOA,EAAQ,KAAK,CACxC,OACOrL,EAAG,CAAE,CAChB,OAAI,OAAOqL,EAAQ,OAAU,UAE7BA,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAOA,EAAQ,MACf,KAAAvL,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EACYiD,EAAiCtD,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAE/FwO,GAA6B,KAAKzO,EAAMC,CAAG,EAC3CqO,GAAW,KAAKtO,EAAMC,CAAG,CAC7B,CAAC,EACYyO,GAAyBxD,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU0O,IAC9BH,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY2O,GAAyB1D,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,SAC/E,GAAIA,EAAI,QAAS,CAWb,MAAMrS,EAVa,CACf,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,CAChB,EAC6BqS,EAAI,OAAO,EAChC,GAAIrS,IAAM,OACN,MAAM,IAAI,MAAM,0BAA0BqS,EAAI,OAAO,GAAG,GAC5DK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU4O,GAAajhB,CAAC,EAChD,MAEI6S,EAAAR,EAAI,UAAJ,OAAgBA,EAAI,QAAU4O,GAAY,GAC9CL,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY6O,GAA0B5D,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU8O,IAC9BP,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY+O,GAAwB9D,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7EuO,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,MAASuL,GAAY,CAC3B,GAAI,CAEA,MAAM0D,EAAU1D,EAAQ,MAAM,KAAI,EAE5B2D,EAAM,IAAI,IAAID,CAAO,EACvBhP,EAAI,WACJA,EAAI,SAAS,UAAY,EACpBA,EAAI,SAAS,KAAKiP,EAAI,QAAQ,GAC/B3D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,KAAM,mBACN,QAAStL,EAAI,SAAS,OACtB,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KACvC,CAAqB,GAGLA,EAAI,WACJA,EAAI,SAAS,UAAY,EACpBA,EAAI,SAAS,KAAKiP,EAAI,SAAS,SAAS,GAAG,EAAIA,EAAI,SAAS,MAAM,EAAG,EAAE,EAAIA,EAAI,QAAQ,GACxF3D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,KAAM,mBACN,QAAStL,EAAI,SAAS,OACtB,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KACvC,CAAqB,GAILA,EAAI,UAEJsL,EAAQ,MAAQ2D,EAAI,KAIpB3D,EAAQ,MAAQ0D,EAEpB,MACJ,OACO/O,EAAG,CACNqL,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CACL,CACJ,CACJ,CAAC,EACYkP,GAA0BjE,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUmP,GAAa,GAC3CZ,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYoP,GAA2BnE,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUqP,IAC9Bd,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYsP,GAAyBrE,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUuP,IAC9BhB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYwP,GAA0BvE,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUyP,IAC9BlB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY0P,GAAyBzE,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU2P,IAC9BpB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY4P,GAAwB3E,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,QAC7EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU6P,IAC9BtB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY8P,GAA0B7E,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+P,IAC9BxB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYgQ,GAAgC/E,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,QAC7FK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUiQ,GAAiBjQ,CAAG,GAClDuO,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYkQ,GAA4BjF,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,QACrFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUmQ,IAC9B5B,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYoQ,GAA4BnF,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,QACrFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUqQ,GAAarQ,CAAG,GAC9CuO,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYsQ,GAAgCrF,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,QAC7FK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUuQ,IAC9BhC,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYwQ,GAAyBvF,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUyQ,IAC9BlC,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,OAAS,MAC3B,CAAC,EACY2Q,GAAyBzF,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU2Q,IAC9BpC,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,OAAS,OACvBA,EAAK,KAAK,MAASuL,GAAY,CAC3B,GAAI,CAEA,IAAI,IAAI,WAAWA,EAAQ,KAAK,GAAG,CAEvC,OACM7D,EAAA,CACF6D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,OACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CACL,CACJ,CACJ,CAAC,EAMY4Q,GAA2B3F,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU6Q,IAC9BtC,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY8Q,GAA2B7F,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+Q,IAC9BxC,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAM0F,EAAQ1F,EAAQ,MAAM,MAAM,GAAG,EACrC,GAAI,CACA,GAAI0F,EAAM,SAAW,EACjB,MAAM,IAAI,MACd,KAAM,CAACC,EAASC,CAAM,EAAIF,EAC1B,GAAI,CAACE,EACD,MAAM,IAAI,MACd,MAAMC,EAAY,OAAOD,CAAM,EAC/B,GAAI,GAAGC,CAAS,KAAOD,EACnB,MAAM,IAAI,MACd,GAAIC,EAAY,GAAKA,EAAY,IAC7B,MAAM,IAAI,MAEd,IAAI,IAAI,WAAWF,CAAO,GAAG,CACjC,OACMxJ,EAAA,CACF6D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,SACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CACL,CACJ,CACJ,CAAC,EAEM,SAASoR,GAAcnc,EAAM,CAChC,GAAIA,IAAS,GACT,MAAO,GACX,GAAIA,EAAK,OAAS,IAAM,EACpB,MAAO,GACX,GAAI,CAEA,YAAKA,CAAI,EACF,EACX,OACMwS,EAAA,CACF,MAAO,EACX,CACJ,CACO,MAAM4J,GAA2BpG,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUsR,IAC9B/C,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,gBAAkB,SAChCA,EAAK,KAAK,MAASuL,GAAY,CACvB8F,GAAc9F,EAAQ,KAAK,GAE/BA,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,SACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EAEM,SAASuR,GAAiBtc,EAAM,CACnC,GAAI,CAACuc,GAAkB,KAAKvc,CAAI,EAC5B,MAAO,GACX,MAAM6U,EAAS7U,EAAK,QAAQ,QAAUtJ,GAAOA,IAAM,IAAM,IAAM,GAAI,EAC7D8lB,EAAS3H,EAAO,OAAO,KAAK,KAAKA,EAAO,OAAS,CAAC,EAAI,EAAG,GAAG,EAClE,OAAOsH,GAAcK,CAAM,CAC/B,CACO,MAAMC,GAA8BzG,EAAkB,gBAAiB,CAAClL,EAAMC,IAAQ,QACzFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUwR,IAC9BjD,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,gBAAkB,YAChCA,EAAK,KAAK,MAASuL,GAAY,CACvBiG,GAAiBjG,EAAQ,KAAK,GAElCA,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,YACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACY2R,GAAyB1G,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU4R,IAC9BrD,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EAEM,SAAS6R,GAAWC,EAAOC,EAAY,KAAM,CAChD,GAAI,CACA,MAAMC,EAAcF,EAAM,MAAM,GAAG,EACnC,GAAIE,EAAY,SAAW,EACvB,MAAO,GACX,KAAM,CAAC9Y,CAAM,EAAI8Y,EACjB,GAAI,CAAC9Y,EACD,MAAO,GAEX,MAAM+Y,EAAe,KAAK,MAAM,KAAK/Y,CAAM,CAAC,EAK5C,MAJI,UAAS+Y,IAAgBA,GAAA,YAAAA,EAAc,OAAQ,OAE/C,CAACA,EAAa,KAEdF,IAAc,EAAE,QAASE,IAAiBA,EAAa,MAAQF,GAGvE,OACMtK,EAAA,CACF,MAAO,EACX,CACJ,CACO,MAAMyK,GAAwBjH,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7EuO,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,MAASuL,GAAY,CACvBuG,GAAWvG,EAAQ,MAAOtL,EAAI,GAAG,GAErCsL,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EAeYmS,GAA2BlH,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,OACnFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,SAAUM,EAAAN,EAAK,KAAK,IAAI,UAAd,KAAAM,EAAyB+R,GAC7CrS,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,GAAIvH,EAAI,OACJ,GAAI,CACAsL,EAAQ,MAAQ,OAAOA,EAAQ,KAAK,CACxC,OACOrL,EAAG,CAAE,CAChB,MAAMhG,EAAQqR,EAAQ,MACtB,GAAI,OAAOrR,GAAU,UAAY,CAAC,OAAO,MAAMA,CAAK,GAAK,OAAO,SAASA,CAAK,EAC1E,OAAOqR,EAEX,MAAM+G,EAAW,OAAOpY,GAAU,SAC5B,OAAO,MAAMA,CAAK,EACd,MACC,OAAO,SAASA,CAAK,EAElB,OADA,WAER,OACN,OAAAqR,EAAQ,OAAO,KAAKjI,EAAA,CAChB,SAAU,SACV,KAAM,eACN,MAAApJ,EACA,KAAA8F,GACIsS,EAAW,CAAE,SAAAA,CAAQ,EAAK,GACjC,EACM/G,CACX,CACJ,CAAC,EACYgH,GAAiCrH,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAC/FuS,GAA6B,KAAKxS,EAAMC,CAAG,EAC3CmS,GAAW,KAAKpS,EAAMC,CAAG,CAC7B,CAAC,EACYwS,GAA4BvH,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,QAAU0S,GACpB1S,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,GAAIvH,EAAI,OACJ,GAAI,CACAsL,EAAQ,MAAQ,EAAQA,EAAQ,KACpC,OACOrL,EAAG,CAAE,CAChB,MAAMhG,EAAQqR,EAAQ,MACtB,OAAI,OAAOrR,GAAU,WAErBqR,EAAQ,OAAO,KAAK,CAChB,SAAU,UACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EAgFYoH,GAA4BzH,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAASuL,GAAYA,CACnC,CAAC,EACYqH,GAA0B1H,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,KACxB+D,EAAQ,OAAO,KAAK,CAChB,SAAU,QACV,KAAM,eACN,MAAOA,EAAQ,MACf,KAAAvL,CACZ,CAAS,EACMuL,EAEf,CAAC,EAwCD,SAASsH,GAAkBvX,EAAQwX,EAAOC,EAAO,CACzCzX,EAAO,OAAO,QACdwX,EAAM,OAAO,KAAK,GAAGE,GAAkBD,EAAOzX,EAAO,MAAM,CAAC,EAEhEwX,EAAM,MAAMC,CAAK,EAAIzX,EAAO,KAChC,CACO,MAAM2X,GAA0B/H,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAM1L,EAAQqR,EAAQ,MACtB,GAAI,CAAC,MAAM,QAAQrR,CAAK,EACpB,OAAAqR,EAAQ,OAAO,KAAK,CAChB,SAAU,QACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAEXA,EAAQ,MAAQ,MAAMrR,EAAM,MAAM,EAClC,MAAMgZ,EAAQ,CAAA,EACd,QAAS/hB,EAAI,EAAGA,EAAI+I,EAAM,OAAQ/I,IAAK,CACnC,MAAMgiB,EAAOjZ,EAAM/I,CAAC,EACdmK,EAAS2E,EAAI,QAAQ,KAAK,IAAI,CAChC,MAAOkT,EACP,OAAQ,CAAA,CACxB,EAAevN,CAAG,EACFtK,aAAkB,QAClB4X,EAAM,KAAK5X,EAAO,KAAMA,GAAWuX,GAAkBvX,EAAQiQ,EAASpa,CAAC,CAAC,CAAC,EAGzE0hB,GAAkBvX,EAAQiQ,EAASpa,CAAC,CAE5C,CACA,OAAI+hB,EAAM,OACC,QAAQ,IAAIA,CAAK,EAAE,KAAK,IAAM3H,CAAO,EAEzCA,CACX,CACJ,CAAC,EACD,SAAS6H,GAAqB9X,EAAQwX,EAAO/X,EAAKb,EAAOmZ,EAAe,CACpE,GAAI/X,EAAO,OAAO,OAAQ,CAEtB,GAAI+X,GAAiB,EAAEtY,KAAOb,GAC1B,OAEJ4Y,EAAM,OAAO,KAAK,GAAGE,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,CAC9D,CACIA,EAAO,QAAU,OACbP,KAAOb,IACP4Y,EAAM,MAAM/X,CAAG,EAAI,QAIvB+X,EAAM,MAAM/X,CAAG,EAAIO,EAAO,KAElC,CACA,SAASgY,GAAarT,EAAK,aACvB,MAAMG,EAAO,OAAO,KAAKH,EAAI,KAAK,EAClC,UAAWtS,KAAKyS,EACZ,GAAI,GAAC8F,GAAAC,GAAA1F,GAAAH,EAAAL,EAAI,QAAJ,YAAAK,EAAY3S,KAAZ,YAAA8S,EAAgB,OAAhB,YAAA0F,EAAsB,SAAtB,MAAAD,EAA8B,IAAI,aACnC,MAAM,IAAI,MAAM,2BAA2BvY,CAAC,0BAA0B,EAG9E,MAAM4lB,EAAQC,GAAkBvT,EAAI,KAAK,EACzC,OAAO4D,EAAAP,EAAA,GACArD,GADA,CAEH,KAAAG,EACA,OAAQ,IAAI,IAAIA,CAAI,EACpB,QAASA,EAAK,OACd,aAAc,IAAI,IAAImT,CAAK,CACnC,EACA,CACA,SAASE,GAAeP,EAAOhZ,EAAOqR,EAAS3F,EAAK3F,EAAKD,EAAM,CAC3D,MAAM0T,EAAe,CAAA,EAEfC,EAAS1T,EAAI,OACb2T,EAAY3T,EAAI,SAAS,KACzBhP,EAAI2iB,EAAU,IAAI,KAClBP,EAAgBO,EAAU,SAAW,WAC3C,UAAW7Y,KAAOb,EAAO,CACrB,GAAIyZ,EAAO,IAAI5Y,CAAG,EACd,SACJ,GAAI9J,IAAM,QAAS,CACfyiB,EAAa,KAAK3Y,CAAG,EACrB,QACJ,CACA,MAAMsT,EAAIuF,EAAU,IAAI,CAAE,MAAO1Z,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EAC1DyI,aAAa,QACb6E,EAAM,KAAK7E,EAAE,KAAMA,GAAM+E,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAAC,CAAC,EAGrFD,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAElE,CASA,OARIK,EAAa,QACbnI,EAAQ,OAAO,KAAK,CAChB,KAAM,oBACN,KAAMmI,EACN,MAAAxZ,EACA,KAAA8F,CACZ,CAAS,EAEAkT,EAAM,OAEJ,QAAQ,IAAIA,CAAK,EAAE,KAAK,IACpB3H,CACV,EAHUA,CAIf,CACO,MAAMsI,GAA2B3I,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CAEnFyN,EAAS,KAAK1N,EAAMC,CAAG,EAEvB,MAAM9T,EAAO,OAAO,yBAAyB8T,EAAK,OAAO,EACzD,GAAI,EAAC9T,GAAA,MAAAA,EAAM,KAAK,CACZ,MAAM2nB,EAAK7T,EAAI,MACf,OAAO,eAAeA,EAAK,QAAS,CAChC,IAAK,IAAM,CACP,MAAM8T,EAAQzQ,EAAA,GAAKwQ,GACnB,cAAO,eAAe7T,EAAK,QAAS,CAChC,MAAO8T,CAC3B,CAAiB,EACMA,CACX,CACZ,CAAS,CACL,CACA,MAAMC,EAAcC,GAAY,IAAMX,GAAarT,CAAG,CAAC,EACvDmO,EAAgBpO,EAAK,KAAM,aAAc,IAAM,OAC3C,MAAM+D,EAAQ9D,EAAI,MACZiU,EAAa,CAAA,EACnB,UAAWnZ,KAAOgJ,EAAO,CACrB,MAAMoQ,EAAQpQ,EAAMhJ,CAAG,EAAE,KACzB,GAAIoZ,EAAM,OAAQ,EACd7T,EAAA4T,EAAWnZ,CAAG,IAAd,OAAoBmZ,EAAWnZ,CAAG,EAAI,IAAI,KAC1C,UAAWnN,KAAKumB,EAAM,OAClBD,EAAWnZ,CAAG,EAAE,IAAInN,CAAC,CAC7B,CACJ,CACA,OAAOsmB,CACX,CAAC,EACD,MAAMpR,EAAWsR,GACXC,EAAWpU,EAAI,SACrB,IAAIxU,EACJuU,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChCna,GAAA,OAAUA,EAAQuoB,EAAY,OAC9B,MAAM9Z,EAAQqR,EAAQ,MACtB,GAAI,CAACzI,EAAS5I,CAAK,EACf,OAAAqR,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAEXA,EAAQ,MAAQ,CAAA,EAChB,MAAM2H,EAAQ,CAAA,EACRnP,EAAQtY,EAAM,MACpB,UAAWsP,KAAOtP,EAAM,KAAM,CAC1B,MAAM4b,EAAKtD,EAAMhJ,CAAG,EACdsY,EAAgBhM,EAAG,KAAK,SAAW,WACnCgH,EAAIhH,EAAG,KAAK,IAAI,CAAE,MAAOnN,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACxDyI,aAAa,QACb6E,EAAM,KAAK7E,EAAE,KAAMA,GAAM+E,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAAC,CAAC,EAGrFD,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAElE,CACA,OAAKgB,EAGEZ,GAAeP,EAAOhZ,EAAOqR,EAAS3F,EAAKoO,EAAY,MAAOhU,CAAI,EAF9DkT,EAAM,OAAS,QAAQ,IAAIA,CAAK,EAAE,KAAK,IAAM3H,CAAO,EAAIA,CAGvE,CACJ,CAAC,EACY+I,GAA8BpJ,EAAkB,gBAAiB,CAAClL,EAAMC,IAAQ,CAEzF4T,GAAW,KAAK7T,EAAMC,CAAG,EACzB,MAAMsU,EAAavU,EAAK,KAAK,MACvBgU,EAAcC,GAAY,IAAMX,GAAarT,CAAG,CAAC,EACjDuU,EAAoBzQ,GAAU,OAChC,MAAM0Q,EAAM,IAAIrH,GAAI,CAAC,QAAS,UAAW,KAAK,CAAC,EACzCsH,EAAaV,EAAY,MACzBW,EAAY5Z,GAAQ,CACtB,MAAMpN,EAAIinB,GAAS7Z,CAAG,EACtB,MAAO,SAASpN,CAAC,6BAA6BA,CAAC,uBACnD,EACA8mB,EAAI,MAAM,8BAA8B,EACxC,MAAMI,EAAM,OAAO,OAAO,IAAI,EAC9B,IAAIC,EAAU,EACd,UAAW/Z,KAAO2Z,EAAW,KACzBG,EAAI9Z,CAAG,EAAI,OAAO+Z,GAAS,GAG/BL,EAAI,MAAM,uBAAuB,EACjC,UAAW1Z,KAAO2Z,EAAW,KAAM,CAC/B,MAAMK,EAAKF,EAAI9Z,CAAG,EACZpN,EAAIinB,GAAS7Z,CAAG,EAChBmJ,EAASH,EAAMhJ,CAAG,EAClBsY,KAAgB/S,EAAA4D,GAAA,YAAAA,EAAQ,OAAR,YAAA5D,EAAc,UAAW,WAC/CmU,EAAI,MAAM,SAASM,CAAE,MAAMJ,EAAS5Z,CAAG,CAAC,GAAG,EACvCsY,GAEAoB,EAAI,MAAM;AAAA,cACZM,CAAE;AAAA,gBACApnB,CAAC;AAAA,qDACoConB,CAAE;AAAA;AAAA,kCAErBpnB,CAAC,qBAAqBA,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,cAK3ConB,CAAE;AAAA,gBACApnB,CAAC;AAAA,wBACOA,CAAC;AAAA;AAAA;AAAA,sBAGHA,CAAC,OAAOonB,CAAE;AAAA;AAAA;AAAA,OAGzB,EAGSN,EAAI,MAAM;AAAA,cACZM,CAAE;AAAA,mDACmCA,CAAE;AAAA;AAAA,gCAErBpnB,CAAC,qBAAqBA,CAAC;AAAA;AAAA;AAAA;AAAA,cAIzConB,CAAE;AAAA,gBACApnB,CAAC;AAAA,wBACOA,CAAC;AAAA;AAAA;AAAA,sBAGHA,CAAC,OAAOonB,CAAE;AAAA;AAAA;AAAA,OAGzB,CAEC,CACAN,EAAI,MAAM,4BAA4B,EACtCA,EAAI,MAAM,iBAAiB,EAC3B,MAAMjU,EAAKiU,EAAI,QAAO,EACtB,MAAO,CAAClJ,EAAS3F,IAAQpF,EAAGuD,EAAOwH,EAAS3F,CAAG,CACnD,EACA,IAAIoP,EACJ,MAAMlS,EAAWsR,GACXa,EAAM,CAACC,GAAkB,QAEzBC,EAAcF,GADDG,GACmB,MAChCf,EAAWpU,EAAI,SACrB,IAAIxU,EACJuU,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChCna,GAAA,OAAUA,EAAQuoB,EAAY,OAC9B,MAAM9Z,EAAQqR,EAAQ,MACtB,OAAKzI,EAAS5I,CAAK,EASf+a,GAAOE,IAAevP,GAAA,YAAAA,EAAK,SAAU,IAASA,EAAI,UAAY,IAEzDoP,IACDA,EAAWR,EAAiBvU,EAAI,KAAK,GACzCsL,EAAUyJ,EAASzJ,EAAS3F,CAAG,EAC1ByO,EAEEZ,GAAe,CAAA,EAAIvZ,EAAOqR,EAAS3F,EAAKna,EAAOuU,CAAI,EAD/CuL,GAGRgJ,EAAWhJ,EAAS3F,CAAG,GAjB1B2F,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAYf,CACJ,CAAC,EACD,SAAS8J,GAAmBC,EAASxC,EAAO9S,EAAM4F,EAAK,CACnD,UAAWtK,KAAUga,EACjB,GAAIha,EAAO,OAAO,SAAW,EACzB,OAAAwX,EAAM,MAAQxX,EAAO,MACdwX,EAGf,MAAMyC,EAAaD,EAAQ,OAAQjH,GAAM,CAACP,GAAaO,CAAC,CAAC,EACzD,OAAIkH,EAAW,SAAW,GACtBzC,EAAM,MAAQyC,EAAW,CAAC,EAAE,MACrBA,EAAW,CAAC,IAEvBzC,EAAM,OAAO,KAAK,CACd,KAAM,gBACN,MAAOA,EAAM,MACb,KAAA9S,EACA,OAAQsV,EAAQ,IAAKha,GAAWA,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,CAC/G,CAAK,EACMkL,EACX,CACO,MAAM0C,GAA0BtK,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,QAAQ,KAAM,GAAM,EAAE,KAAK,QAAU,UAAU,EAAI,WAAa,MAAS,EACvHmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,QAAQ,KAAM,GAAM,EAAE,KAAK,SAAW,UAAU,EAAI,WAAa,MAAS,EACzHmO,EAAgBpO,EAAK,KAAM,SAAU,IAAM,CACvC,GAAIC,EAAI,QAAQ,MAAO,GAAM,EAAE,KAAK,MAAM,EACtC,OAAO,IAAI,IAAIA,EAAI,QAAQ,QAASwV,GAAW,MAAM,KAAKA,EAAO,KAAK,MAAM,CAAC,CAAC,CAGtF,CAAC,EACDrH,EAAgBpO,EAAK,KAAM,UAAW,IAAM,CACxC,GAAIC,EAAI,QAAQ,MAAO,GAAM,EAAE,KAAK,OAAO,EAAG,CAC1C,MAAMyV,EAAWzV,EAAI,QAAQ,IAAKiD,GAAMA,EAAE,KAAK,OAAO,EACtD,OAAO,IAAI,OAAO,KAAKwS,EAAS,IAAK5gB,GAAM6gB,GAAgB7gB,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,CACvF,CAEJ,CAAC,EACD,MAAM8gB,EAAS3V,EAAI,QAAQ,SAAW,EAChC4V,EAAQ5V,EAAI,QAAQ,CAAC,EAAE,KAAK,IAClCD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIgQ,EACA,OAAOC,EAAMtK,EAAS3F,CAAG,EAE7B,IAAIkQ,EAAQ,GACZ,MAAMR,EAAU,CAAA,EAChB,UAAWG,KAAUxV,EAAI,QAAS,CAC9B,MAAM3E,EAASma,EAAO,KAAK,IAAI,CAC3B,MAAOlK,EAAQ,MACf,OAAQ,CAAA,CACxB,EAAe3F,CAAG,EACN,GAAItK,aAAkB,QAClBga,EAAQ,KAAKha,CAAM,EACnBwa,EAAQ,OAEP,CACD,GAAIxa,EAAO,OAAO,SAAW,EACzB,OAAOA,EACXga,EAAQ,KAAKha,CAAM,CACvB,CACJ,CACA,OAAKwa,EAEE,QAAQ,IAAIR,CAAO,EAAE,KAAMA,GACvBD,GAAmBC,EAAS/J,EAASvL,EAAM4F,CAAG,CACxD,EAHUyP,GAAmBC,EAAS/J,EAASvL,EAAM4F,CAAG,CAI7D,CACJ,CAAC,EAgIYmQ,GAAiC7K,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAC/FyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAM1L,EAAQqR,EAAQ,MAChBvU,EAAOiJ,EAAI,KAAK,KAAK,IAAI,CAAE,MAAO/F,EAAO,OAAQ,CAAA,CAAE,EAAI0L,CAAG,EAC1DoQ,EAAQ/V,EAAI,MAAM,KAAK,IAAI,CAAE,MAAO/F,EAAO,OAAQ,CAAA,CAAE,EAAI0L,CAAG,EAElE,OADc5O,aAAgB,SAAWgf,aAAiB,QAE/C,QAAQ,IAAI,CAAChf,EAAMgf,CAAK,CAAC,EAAE,KAAK,CAAC,CAAChf,EAAMgf,CAAK,IACzCC,GAA0B1K,EAASvU,EAAMgf,CAAK,CACxD,EAEEC,GAA0B1K,EAASvU,EAAMgf,CAAK,CACzD,CACJ,CAAC,EACD,SAASE,GAAYrR,EAAGtP,EAAG,CAGvB,GAAIsP,IAAMtP,EACN,MAAO,CAAE,MAAO,GAAM,KAAMsP,CAAC,EAEjC,GAAIA,aAAa,MAAQtP,aAAa,MAAQ,CAACsP,GAAM,CAACtP,EAClD,MAAO,CAAE,MAAO,GAAM,KAAMsP,CAAC,EAEjC,GAAIsR,GAAmBtR,CAAC,GAAKsR,GAAmB5gB,CAAC,EAAG,CAChD,MAAM6gB,EAAQ,OAAO,KAAK7gB,CAAC,EACrB8gB,EAAa,OAAO,KAAKxR,CAAC,EAAE,OAAQ9J,GAAQqb,EAAM,QAAQrb,CAAG,IAAM,EAAE,EACrEub,EAAShT,IAAA,GAAKuB,GAAMtP,GAC1B,UAAWwF,KAAOsb,EAAY,CAC1B,MAAME,EAAcL,GAAYrR,EAAE9J,CAAG,EAAGxF,EAAEwF,CAAG,CAAC,EAC9C,GAAI,CAACwb,EAAY,MACb,MAAO,CACH,MAAO,GACP,eAAgB,CAACxb,EAAK,GAAGwb,EAAY,cAAc,CACvE,EAEYD,EAAOvb,CAAG,EAAIwb,EAAY,IAC9B,CACA,MAAO,CAAE,MAAO,GAAM,KAAMD,CAAM,CACtC,CACA,GAAI,MAAM,QAAQzR,CAAC,GAAK,MAAM,QAAQtP,CAAC,EAAG,CACtC,GAAIsP,EAAE,SAAWtP,EAAE,OACf,MAAO,CAAE,MAAO,GAAO,eAAgB,CAAA,CAAE,EAE7C,MAAMihB,EAAW,CAAA,EACjB,QAASzD,EAAQ,EAAGA,EAAQlO,EAAE,OAAQkO,IAAS,CAC3C,MAAM0D,EAAQ5R,EAAEkO,CAAK,EACf2D,EAAQnhB,EAAEwd,CAAK,EACfwD,EAAcL,GAAYO,EAAOC,CAAK,EAC5C,GAAI,CAACH,EAAY,MACb,MAAO,CACH,MAAO,GACP,eAAgB,CAACxD,EAAO,GAAGwD,EAAY,cAAc,CACzE,EAEYC,EAAS,KAAKD,EAAY,IAAI,CAClC,CACA,MAAO,CAAE,MAAO,GAAM,KAAMC,CAAQ,CACxC,CACA,MAAO,CAAE,MAAO,GAAO,eAAgB,CAAA,CAAE,CAC7C,CACA,SAASP,GAA0B3a,EAAQtE,EAAMgf,EAAO,CAEpD,MAAMW,EAAY,IAAI,IACtB,IAAIC,EACJ,UAAWpR,KAAOxO,EAAK,OACnB,GAAIwO,EAAI,OAAS,oBAAqB,CAClCoR,GAAA,OAAeA,EAAapR,GAC5B,UAAW7X,KAAK6X,EAAI,KACXmR,EAAU,IAAIhpB,CAAC,GAChBgpB,EAAU,IAAIhpB,EAAG,EAAE,EACvBgpB,EAAU,IAAIhpB,CAAC,EAAE,EAAI,EAE7B,MAEI2N,EAAO,OAAO,KAAKkK,CAAG,EAG9B,UAAWA,KAAOwQ,EAAM,OACpB,GAAIxQ,EAAI,OAAS,oBACb,UAAW7X,KAAK6X,EAAI,KACXmR,EAAU,IAAIhpB,CAAC,GAChBgpB,EAAU,IAAIhpB,EAAG,EAAE,EACvBgpB,EAAU,IAAIhpB,CAAC,EAAE,EAAI,QAIzB2N,EAAO,OAAO,KAAKkK,CAAG,EAI9B,MAAMqR,EAAW,CAAC,GAAGF,CAAS,EAAE,OAAO,CAAC,CAAA,CAAG7pB,CAAC,IAAMA,EAAE,GAAKA,EAAE,CAAC,EAAE,IAAI,CAAC,CAACa,CAAC,IAAMA,CAAC,EAI5E,GAHIkpB,EAAS,QAAUD,GACnBtb,EAAO,OAAO,KAAKuI,EAAAP,EAAA,GAAKsT,GAAL,CAAiB,KAAMC,GAAU,EAEpD/I,GAAaxS,CAAM,EACnB,OAAOA,EACX,MAAMwb,EAASZ,GAAYlf,EAAK,MAAOgf,EAAM,KAAK,EAClD,GAAI,CAACc,EAAO,MACR,MAAM,IAAI,MAAM,wCAA6C,KAAK,UAAUA,EAAO,cAAc,CAAC,EAAE,EAExG,OAAAxb,EAAO,MAAQwb,EAAO,KACfxb,CACX,CA8EO,MAAMyb,GAA2B7L,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAM1L,EAAQqR,EAAQ,MACtB,GAAI,CAAC4K,GAAmBjc,CAAK,EACzB,OAAAqR,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAEX,MAAM2H,EAAQ,CAAA,EACR8D,EAAS/W,EAAI,QAAQ,KAAK,OAChC,GAAI+W,EAAQ,CACRzL,EAAQ,MAAQ,CAAA,EAChB,MAAM0L,EAAa,IAAI,IACvB,UAAWlc,KAAOic,EACd,GAAI,OAAOjc,GAAQ,UAAY,OAAOA,GAAQ,UAAY,OAAOA,GAAQ,SAAU,CAC/Ekc,EAAW,IAAI,OAAOlc,GAAQ,SAAWA,EAAI,SAAQ,EAAKA,CAAG,EAC7D,MAAMO,EAAS2E,EAAI,UAAU,KAAK,IAAI,CAAE,MAAO/F,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACxEtK,aAAkB,QAClB4X,EAAM,KAAK5X,EAAO,KAAMA,GAAW,CAC3BA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAMxQ,CAAG,EAAIO,EAAO,KAChC,CAAC,CAAC,GAGEA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAMxQ,CAAG,EAAIO,EAAO,MAEpC,CAEJ,IAAIoY,EACJ,UAAW3Y,KAAOb,EACT+c,EAAW,IAAIlc,CAAG,IACnB2Y,EAAeA,GAAA,KAAAA,EAAgB,CAAA,EAC/BA,EAAa,KAAK3Y,CAAG,GAGzB2Y,GAAgBA,EAAa,OAAS,GACtCnI,EAAQ,OAAO,KAAK,CAChB,KAAM,oBACN,MAAArR,EACA,KAAA8F,EACA,KAAM0T,CAC1B,CAAiB,CAET,KACK,CACDnI,EAAQ,MAAQ,CAAA,EAChB,UAAWxQ,KAAO,QAAQ,QAAQb,CAAK,EAAG,CACtC,GAAIa,IAAQ,YACR,SACJ,IAAImc,EAAYjX,EAAI,QAAQ,KAAK,IAAI,CAAE,MAAOlF,EAAK,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACpE,GAAIsR,aAAqB,QACrB,MAAM,IAAI,MAAM,sDAAsD,EAK1E,GADwB,OAAOnc,GAAQ,UAAYsX,GAAe,KAAKtX,CAAG,GAAKmc,EAAU,OAAO,OAC3E,CACjB,MAAMC,EAAclX,EAAI,QAAQ,KAAK,IAAI,CAAE,MAAO,OAAOlF,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EAChF,GAAIuR,aAAuB,QACvB,MAAM,IAAI,MAAM,sDAAsD,EAEtEA,EAAY,OAAO,SAAW,IAC9BD,EAAYC,EAEpB,CACA,GAAID,EAAU,OAAO,OAAQ,CACrBjX,EAAI,OAAS,QAEbsL,EAAQ,MAAMxQ,CAAG,EAAIb,EAAMa,CAAG,EAI9BwQ,EAAQ,OAAO,KAAK,CAChB,KAAM,cACN,OAAQ,SACR,OAAQ2L,EAAU,OAAO,IAAK1R,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,EACjF,MAAO7M,EACP,KAAM,CAACA,CAAG,EACV,KAAAiF,CAC5B,CAAyB,EAEL,QACJ,CACA,MAAM1E,EAAS2E,EAAI,UAAU,KAAK,IAAI,CAAE,MAAO/F,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACxEtK,aAAkB,QAClB4X,EAAM,KAAK5X,EAAO,KAAMA,GAAW,CAC3BA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAM2L,EAAU,KAAK,EAAI5b,EAAO,KAC5C,CAAC,CAAC,GAGEA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAM2L,EAAU,KAAK,EAAI5b,EAAO,MAEhD,CACJ,CACA,OAAI4X,EAAM,OACC,QAAQ,IAAIA,CAAK,EAAE,KAAK,IAAM3H,CAAO,EAEzCA,CACX,CACJ,CAAC,EAmGY6L,GAAyBlM,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EyN,EAAS,KAAK1N,EAAMC,CAAG,EACvB,MAAM+W,EAASK,GAAmBpX,EAAI,OAAO,EACvCqX,EAAY,IAAI,IAAIN,CAAM,EAChChX,EAAK,KAAK,OAASsX,EACnBtX,EAAK,KAAK,QAAU,IAAI,OAAO,KAAKgX,EAC/B,OAAQrpB,GAAM4pB,GAAsB,IAAI,OAAO5pB,CAAC,CAAC,EACjD,IAAK,GAAO,OAAO,GAAM,SAAWof,GAAiB,CAAC,EAAI,EAAE,UAAW,EACvE,KAAK,GAAG,CAAC,IAAI,EAClB/M,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,MAAMtN,EAAQqR,EAAQ,MACtB,OAAI+L,EAAU,IAAIpd,CAAK,GAGvBqR,EAAQ,OAAO,KAAK,CAChB,KAAM,gBACN,OAAAyL,EACA,MAAA9c,EACA,KAAA8F,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EACYiM,GAA4BtM,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CAErF,GADAyN,EAAS,KAAK1N,EAAMC,CAAG,EACnBA,EAAI,OAAO,SAAW,EACtB,MAAM,IAAI,MAAM,mDAAmD,EAEvE,MAAM+W,EAAS,IAAI,IAAI/W,EAAI,MAAM,EACjCD,EAAK,KAAK,OAASgX,EACnBhX,EAAK,KAAK,QAAU,IAAI,OAAO,KAAKC,EAAI,OACnC,IAAKiD,GAAO,OAAOA,GAAM,SAAW6J,GAAiB7J,CAAC,EAAIA,EAAI6J,GAAiB7J,EAAE,SAAQ,CAAE,EAAI,OAAOA,CAAC,CAAE,EACzG,KAAK,GAAG,CAAC,IAAI,EAClBlD,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,MAAMtN,EAAQqR,EAAQ,MACtB,OAAIyL,EAAO,IAAI9c,CAAK,GAGpBqR,EAAQ,OAAO,KAAK,CAChB,KAAM,gBACN,OAAQtL,EAAI,OACZ,MAAA/F,EACA,KAAA8F,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EAiBYkM,GAA8BvM,EAAkB,gBAAiB,CAAClL,EAAMC,IAAQ,CACzFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,MAAM,IAAI8R,GAAqB1X,EAAK,YAAY,IAAI,EAExD,MAAM2X,EAAO1X,EAAI,UAAUsL,EAAQ,MAAOA,CAAO,EACjD,GAAI3F,EAAI,MAEJ,OADe+R,aAAgB,QAAUA,EAAO,QAAQ,QAAQA,CAAI,GACtD,KAAMC,IAChBrM,EAAQ,MAAQqM,EACTrM,EACV,EAEL,GAAIoM,aAAgB,QAChB,MAAM,IAAIlQ,GAEd,OAAA8D,EAAQ,MAAQoM,EACTpM,CACX,CACJ,CAAC,EACD,SAASsM,GAAqBvc,EAAQpB,EAAO,CACzC,OAAIoB,EAAO,OAAO,QAAUpB,IAAU,OAC3B,CAAE,OAAQ,GAAI,MAAO,MAAS,EAElCoB,CACX,CACO,MAAMwc,GAA6B5M,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,WAClBA,EAAK,KAAK,OAAS,WACnBoO,EAAgBpO,EAAK,KAAM,SAAU,IAC1BC,EAAI,UAAU,KAAK,OAAS,IAAI,IAAI,CAAC,GAAGA,EAAI,UAAU,KAAK,OAAQ,MAAS,CAAC,EAAI,MAC3F,EACDmO,EAAgBpO,EAAK,KAAM,UAAW,IAAM,CACxC,MAAMgN,EAAU/M,EAAI,UAAU,KAAK,QACnC,OAAO+M,EAAU,IAAI,OAAO,KAAK2I,GAAgB3I,EAAQ,MAAM,CAAC,KAAK,EAAI,MAC7E,CAAC,EACDhN,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAI3F,EAAI,UAAU,KAAK,QAAU,WAAY,CACzC,MAAM3E,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAM+S,GAAMwJ,GAAqBxJ,EAAG9C,EAAQ,KAAK,CAAC,EAC7DsM,GAAqBvc,EAAQiQ,EAAQ,KAAK,CACrD,CACA,OAAIA,EAAQ,QAAU,OACXA,EAEJtL,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,CAC9C,CACJ,CAAC,EACYmS,GAAkC7M,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,CAEjG6X,GAAa,KAAK9X,EAAMC,CAAG,EAE3BmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,UAAW,IAAMC,EAAI,UAAU,KAAK,OAAO,EAEtED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IACjB3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,CAElD,CAAC,EACYoS,GAA6B9M,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,UAAU,KAAK,KAAK,EAClEmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,UAAW,IAAM,CACxC,MAAMgN,EAAU/M,EAAI,UAAU,KAAK,QACnC,OAAO+M,EAAU,IAAI,OAAO,KAAK2I,GAAgB3I,EAAQ,MAAM,CAAC,SAAS,EAAI,MACjF,CAAC,EACDoB,EAAgBpO,EAAK,KAAM,SAAU,IAC1BC,EAAI,UAAU,KAAK,OAAS,IAAI,IAAI,CAAC,GAAGA,EAAI,UAAU,KAAK,OAAQ,IAAI,CAAC,EAAI,MACtF,EACDD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAEpB2F,EAAQ,QAAU,KACXA,EACJtL,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,CAElD,CAAC,EACYqS,GAA4B/M,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFyN,EAAS,KAAK1N,EAAMC,CAAG,EAEvBD,EAAK,KAAK,MAAQ,WAClBoO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,OAAO3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAG9C,GAAI2F,EAAQ,QAAU,OAClB,OAAAA,EAAQ,MAAQtL,EAAI,aAIbsL,EAGX,MAAMjQ,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAMA,GAAW4c,GAAoB5c,EAAQ2E,CAAG,CAAC,EAE5DiY,GAAoB5c,EAAQ2E,CAAG,CAC1C,CACJ,CAAC,EACD,SAASiY,GAAoB3M,EAAStL,EAAK,CACvC,OAAIsL,EAAQ,QAAU,SAClBA,EAAQ,MAAQtL,EAAI,cAEjBsL,CACX,CACO,MAAM4M,GAA6BjN,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,WAClBoO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,KACpBA,EAAI,YAAc,YAIlB2F,EAAQ,QAAU,SAClBA,EAAQ,MAAQtL,EAAI,cAEjBA,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAElD,CAAC,EACYwS,GAAgClN,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7FyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,SAAU,IAAM,CACvC,MAAMpS,EAAIqS,EAAI,UAAU,KAAK,OAC7B,OAAOrS,EAAI,IAAI,IAAI,CAAC,GAAGA,CAAC,EAAE,OAAQuX,GAAMA,IAAM,MAAS,CAAC,EAAI,MAChE,CAAC,EACDnF,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAMtK,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAMA,GAAW+c,GAAwB/c,EAAQ0E,CAAI,CAAC,EAEjEqY,GAAwB/c,EAAQ0E,CAAI,CAC/C,CACJ,CAAC,EACD,SAASqY,GAAwB9M,EAASvL,EAAM,CAC5C,MAAI,CAACuL,EAAQ,OAAO,QAAUA,EAAQ,QAAU,QAC5CA,EAAQ,OAAO,KAAK,CAChB,KAAM,eACN,SAAU,cACV,MAAOA,EAAQ,MACf,KAAAvL,CACZ,CAAS,EAEEuL,CACX,CAkBO,MAAM+M,GAA0BpN,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,UAAU,KAAK,KAAK,EAClEmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,OAAO3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAG9C,MAAMtK,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAMA,IAChBiQ,EAAQ,MAAQjQ,EAAO,MACnBA,EAAO,OAAO,SACdiQ,EAAQ,MAAQtL,EAAI,WAAW4D,EAAAP,EAAA,GACxBiI,GADwB,CAE3B,MAAO,CACH,OAAQjQ,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAC1G,EACwB,MAAO2D,EAAQ,KACvC,EAAqB,EACDA,EAAQ,OAAS,CAAA,GAEdA,EACV,GAELA,EAAQ,MAAQjQ,EAAO,MACnBA,EAAO,OAAO,SACdiQ,EAAQ,MAAQtL,EAAI,WAAW4D,EAAAP,EAAA,GACxBiI,GADwB,CAE3B,MAAO,CACH,OAAQjQ,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAClG,EACgB,MAAO2D,EAAQ,KAC/B,EAAa,EACDA,EAAQ,OAAS,CAAA,GAEdA,EACX,CACJ,CAAC,EAgBYgN,GAAyBrN,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,GAAG,KAAK,MAAM,EAC7DmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,GAAG,KAAK,KAAK,EAC3DmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,IAAI,KAAK,MAAM,EAC9DmO,EAAgBpO,EAAK,KAAM,aAAc,IAAMC,EAAI,GAAG,KAAK,UAAU,EACrED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAAY,CAC9B,MAAMoQ,EAAQ/V,EAAI,IAAI,KAAK,IAAIsL,EAAS3F,CAAG,EAC3C,OAAIoQ,aAAiB,QACVA,EAAM,KAAMA,GAAUwC,GAAiBxC,EAAO/V,EAAI,GAAI2F,CAAG,CAAC,EAE9D4S,GAAiBxC,EAAO/V,EAAI,GAAI2F,CAAG,CAC9C,CACA,MAAM5O,EAAOiJ,EAAI,GAAG,KAAK,IAAIsL,EAAS3F,CAAG,EACzC,OAAI5O,aAAgB,QACTA,EAAK,KAAMA,GAASwhB,GAAiBxhB,EAAMiJ,EAAI,IAAK2F,CAAG,CAAC,EAE5D4S,GAAiBxhB,EAAMiJ,EAAI,IAAK2F,CAAG,CAC9C,CACJ,CAAC,EACD,SAAS4S,GAAiBxhB,EAAMiD,EAAM2L,EAAK,CACvC,OAAI5O,EAAK,OAAO,QAEZA,EAAK,QAAU,GACRA,GAEJiD,EAAK,KAAK,IAAI,CAAE,MAAOjD,EAAK,MAAO,OAAQA,EAAK,MAAM,EAAI4O,CAAG,CACxE,CAuDO,MAAM6S,GAA6BvN,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,aAAc,IAAMC,EAAI,UAAU,KAAK,UAAU,EAC5EmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,QAAS,IAAA,SAAM,OAAAS,GAAAH,EAAAL,EAAI,YAAJ,YAAAK,EAAe,OAAf,YAAAG,EAAqB,MAAK,EACpE2N,EAAgBpO,EAAK,KAAM,SAAU,IAAA,SAAM,OAAAS,GAAAH,EAAAL,EAAI,YAAJ,YAAAK,EAAe,OAAf,YAAAG,EAAqB,OAAM,EACtET,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,OAAO3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAE9C,MAAMtK,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAKod,EAAoB,EAEpCA,GAAqBpd,CAAM,CACtC,CACJ,CAAC,EACD,SAASod,GAAqBnN,EAAS,CACnC,OAAAA,EAAQ,MAAQ,OAAO,OAAOA,EAAQ,KAAK,EACpCA,CACX,CA0JO,MAAMoN,GAA2BzN,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnF2Y,EAAiB,KAAK5Y,EAAMC,CAAG,EAC/ByN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAASrL,IACjBqL,EAEXvL,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAChB8C,EAAIpO,EAAI,GAAG/F,CAAK,EACtB,GAAImU,aAAa,QACb,OAAOA,EAAE,KAAMA,GAAMwK,GAAmBxK,EAAG9C,EAASrR,EAAO8F,CAAI,CAAC,EAEpE6Y,GAAmBxK,EAAG9C,EAASrR,EAAO8F,CAAI,CAE9C,CACJ,CAAC,EACD,SAAS6Y,GAAmBvd,EAAQiQ,EAASrR,EAAO8F,EAAM,OACtD,GAAI,CAAC1E,EAAQ,CACT,MAAMwd,EAAO,CACT,KAAM,SACN,MAAA5e,EACA,KAAA8F,EACA,KAAM,CAAC,IAAIM,EAAAN,EAAK,KAAK,IAAI,OAAd,KAAAM,EAAsB,CAAA,CAAG,EACpC,SAAU,CAACN,EAAK,KAAK,IAAI,KAErC,EACYA,EAAK,KAAK,IAAI,SACd8Y,EAAK,OAAS9Y,EAAK,KAAK,IAAI,QAChCuL,EAAQ,OAAO,KAAKwN,GAAWD,CAAI,CAAC,CACxC,CACJ,CC5iEA,IAAIxY,GAGG,MAAM0Y,EAAa,CACtB,aAAc,CACV,KAAK,KAAO,IAAI,QAChB,KAAK,OAAS,IAAI,GACtB,CACA,IAAI9U,KAAW+U,EAAO,CAClB,MAAMC,EAAOD,EAAM,CAAC,EACpB,YAAK,KAAK,IAAI/U,EAAQgV,CAAI,EACtBA,GAAQ,OAAOA,GAAS,UAAY,OAAQA,GAC5C,KAAK,OAAO,IAAIA,EAAK,GAAIhV,CAAM,EAE5B,IACX,CACA,OAAQ,CACJ,YAAK,KAAO,IAAI,QAChB,KAAK,OAAS,IAAI,IACX,IACX,CACA,OAAOA,EAAQ,CACX,MAAMgV,EAAO,KAAK,KAAK,IAAIhV,CAAM,EACjC,OAAIgV,GAAQ,OAAOA,GAAS,UAAY,OAAQA,GAC5C,KAAK,OAAO,OAAOA,EAAK,EAAE,EAE9B,KAAK,KAAK,OAAOhV,CAAM,EAChB,IACX,CACA,IAAIA,EAAQ,OAGR,MAAMpP,EAAIoP,EAAO,KAAK,OACtB,GAAIpP,EAAG,CACH,MAAMqkB,EAAK7V,EAAA,IAAMhD,EAAA,KAAK,IAAIxL,CAAC,IAAV,KAAAwL,EAAe,CAAA,GAChC,OAAO6Y,EAAG,GACV,MAAMrsB,EAAIwW,IAAA,GAAK6V,GAAO,KAAK,KAAK,IAAIjV,CAAM,GAC1C,OAAO,OAAO,KAAKpX,CAAC,EAAE,OAASA,EAAI,MACvC,CACA,OAAO,KAAK,KAAK,IAAIoX,CAAM,CAC/B,CACA,IAAIA,EAAQ,CACR,OAAO,KAAK,KAAK,IAAIA,CAAM,CAC/B,CACJ,CAEO,SAASkV,IAAW,CACvB,OAAO,IAAIJ,EACf,SACC1Y,OAAK,YAAY,uBAAjB,OAA0CA,GAAG,qBAAuB8Y,GAAQ,GACtE,MAAMC,GAAiB,WAAW,qBC7ClC,SAASC,GAAQvU,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,UACHiW,EAAqBzZ,CAAM,EACjC,CACL,CAUO,SAAS0Z,GAAOzU,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS2Z,GAAM1U,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS4Z,GAAM3U,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS6Z,GAAQ5U,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,GACP,QAAS,MACNiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS8Z,GAAQ7U,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,GACP,QAAS,MACNiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS+Z,GAAQ9U,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,GACP,QAAS,MACNiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASga,GAAK/U,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,MACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS2J,GAAO1E,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASia,GAAQhV,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASka,GAAMjV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASma,GAAOlV,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASoa,GAAMnV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASqa,GAAKpV,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,MACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASsa,GAAOrV,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASua,GAAMtV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASwa,GAAMvV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAYO,SAASya,GAAQxV,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS0a,GAAQzV,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS2a,GAAQ1V,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS4a,GAAW3V,EAAOjF,EAAQ,CACtC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,YACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS6a,GAAM5V,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS8a,GAAK7V,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,MACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CASO,SAAS+a,GAAa9V,EAAOjF,EAAQ,CACxC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,WACR,MAAO,gBACP,OAAQ,GACR,MAAO,GACP,UAAW,MACRiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASgb,GAAS/V,EAAOjF,EAAQ,CACpC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,iBACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASib,GAAShW,EAAOjF,EAAQ,CACpC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,UAAW,MACRiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASkb,GAAajW,EAAOjF,EAAQ,CACxC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,WACR,MAAO,iBACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASmb,GAAQlW,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,CAAA,GACLiW,EAAqBzZ,CAAM,EACjC,CACL,CAWO,SAASob,GAAKnW,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,MAAO,gBACP,MAAO,GACP,OAAQ,WACLiW,EAAqBzZ,CAAM,EACjC,CACL,CA0CO,SAASqb,GAASpW,EAAOjF,EAAQ,CACpC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,WACHiW,EAAqBzZ,CAAM,EACjC,CACL,CAwEO,SAASsb,GAASrW,EAAO,CAC5B,OAAO,IAAIA,EAAM,CACb,KAAM,SACd,CAAK,CACL,CAEO,SAASsW,GAAOtW,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACHiW,EAAqBzZ,CAAM,EACjC,CACL,CA+BO,SAASwb,GAAI7vB,EAAOqU,EAAQ,CAC/B,OAAO,IAAIyb,GAAyB1X,EAAAP,EAAA,CAChC,MAAO,aACJiW,EAAqBzZ,CAAM,GAFE,CAGhC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAEO,SAAS+vB,GAAK/vB,EAAOqU,EAAQ,CAChC,OAAO,IAAIyb,GAAyB1X,EAAAP,EAAA,CAChC,MAAO,aACJiW,EAAqBzZ,CAAM,GAFE,CAGhC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAKO,SAASgwB,GAAIhwB,EAAOqU,EAAQ,CAC/B,OAAO,IAAI4b,GAA4B7X,EAAAP,EAAA,CACnC,MAAO,gBACJiW,EAAqBzZ,CAAM,GAFK,CAGnC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAEO,SAASkwB,GAAKlwB,EAAOqU,EAAQ,CAChC,OAAO,IAAI4b,GAA4B7X,EAAAP,EAAA,CACnC,MAAO,gBACJiW,EAAqBzZ,CAAM,GAFK,CAGnC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAwBO,SAASmwB,GAAYnwB,EAAOqU,EAAQ,CACvC,OAAO,IAAI+b,GAA2BhY,EAAAP,EAAA,CAClC,MAAO,eACJiW,EAAqBzZ,CAAM,GAFI,CAGlC,MAAArU,CACR,EAAK,CACL,CA0BO,SAASqwB,GAAWhQ,EAAShM,EAAQ,CAMxC,OALW,IAAIic,GAA0BlY,EAAAP,EAAA,CACrC,MAAO,cACJiW,EAAqBzZ,CAAM,GAFO,CAGrC,QAAAgM,CACR,EAAK,CAEL,CAEO,SAASkQ,GAAWnQ,EAAS/L,EAAQ,CACxC,OAAO,IAAImc,GAA0BpY,EAAAP,EAAA,CACjC,MAAO,cACJiW,EAAqBzZ,CAAM,GAFG,CAGjC,QAAA+L,CACR,EAAK,CACL,CAEO,SAASqQ,GAAQxwB,EAAQoU,EAAQ,CACpC,OAAO,IAAIqc,GAA6BtY,EAAAP,EAAA,CACpC,MAAO,iBACJiW,EAAqBzZ,CAAM,GAFM,CAGpC,OAAApU,CACR,EAAK,CACL,CAEO,SAAS0wB,GAAOpP,EAASlN,EAAQ,CACpC,OAAO,IAAIuc,GAAsBxY,EAAAP,EAAA,CAC7B,MAAO,gBACP,OAAQ,SACLiW,EAAqBzZ,CAAM,GAHD,CAI7B,QAAAkN,CACR,EAAK,CACL,CAEO,SAASsP,GAAWxc,EAAQ,CAC/B,OAAO,IAAIyc,GAA0BjZ,EAAA,CACjC,MAAO,gBACP,OAAQ,aACLiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS0c,GAAW1c,EAAQ,CAC/B,OAAO,IAAI2c,GAA0BnZ,EAAA,CACjC,MAAO,gBACP,OAAQ,aACLiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS4c,GAAUC,EAAU7c,EAAQ,CACxC,OAAO,IAAI8c,GAAyB/Y,EAAAP,EAAA,CAChC,MAAO,gBACP,OAAQ,YACLiW,EAAqBzZ,CAAM,GAHE,CAIhC,SAAA6c,CACR,EAAK,CACL,CAEO,SAASE,GAAY1L,EAAQrR,EAAQ,CACxC,OAAO,IAAIgd,GAA2BjZ,EAAAP,EAAA,CAClC,MAAO,gBACP,OAAQ,eACLiW,EAAqBzZ,CAAM,GAHI,CAIlC,OAAAqR,CACR,EAAK,CACL,CAEO,SAAS4L,GAAUC,EAAQld,EAAQ,CACtC,OAAO,IAAImd,GAAyBpZ,EAAAP,EAAA,CAChC,MAAO,gBACP,OAAQ,aACLiW,EAAqBzZ,CAAM,GAHE,CAIhC,OAAAkd,CACR,EAAK,CACL,CAmBO,SAASE,GAAWC,EAAI,CAC3B,OAAO,IAAIC,GAA0B,CACjC,MAAO,YACP,GAAAD,CACR,CAAK,CACL,CAGO,SAASE,GAAWC,EAAM,CAC7B,OAAOJ,GAAYhjB,GAAUA,EAAM,UAAUojB,CAAI,CAAC,CACtD,CAGO,SAASC,IAAQ,CACpB,OAAOL,GAAYhjB,GAAUA,EAAM,KAAI,CAAE,CAC7C,CAGO,SAASsjB,IAAe,CAC3B,OAAON,GAAYhjB,GAAUA,EAAM,YAAW,CAAE,CACpD,CAGO,SAASujB,IAAe,CAC3B,OAAOP,GAAYhjB,GAAUA,EAAM,YAAW,CAAE,CACpD,CAGO,SAASwjB,IAAW,CACvB,OAAOR,GAAYhjB,GAAUyjB,GAAazjB,CAAK,CAAC,CACpD,CAEO,SAAS0jB,GAAO7Y,EAAO8Y,EAAS/d,EAAQ,CAC3C,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,QACN,QAAAua,GAIGtE,EAAqBzZ,CAAM,EACjC,CACL,CAwOO,SAASge,GAAQ/Y,EAAOvE,EAAIoD,EAAS,CAOxC,OANe,IAAImB,EAAMzB,EAAA,CACrB,KAAM,SACN,MAAO,SACP,GAAI9C,GACD+Y,EAAqB3V,CAAO,EAClC,CAEL,CAEO,SAASma,GAAavd,EAAI,CAC7B,MAAMmN,EAAKqQ,GAAQzS,IACfA,EAAQ,SAAY/E,GAAU,aAC1B,GAAI,OAAOA,GAAU,SACjB+E,EAAQ,OAAO,KAAKwN,GAAWvS,EAAO+E,EAAQ,MAAOoC,EAAG,KAAK,GAAG,CAAC,MAEhE,CAED,MAAMsQ,EAASzX,EACXyX,EAAO,QACPA,EAAO,SAAW,KACtB3d,EAAA2d,EAAO,OAAP,OAAgBA,EAAO,KAAO,WAC9Bxd,EAAAwd,EAAO,QAAP,OAAiBA,EAAO,MAAQ1S,EAAQ,QACxCpF,EAAA8X,EAAO,OAAP,OAAgBA,EAAO,KAAOtQ,IAC9BzH,EAAA+X,EAAO,WAAP,OAAoBA,EAAO,SAAW,CAACtQ,EAAG,KAAK,IAAI,OACnDpC,EAAQ,OAAO,KAAKwN,GAAWkF,CAAM,CAAC,CAC1C,CACJ,EACOzd,EAAG+K,EAAQ,MAAOA,CAAO,EACnC,EACD,OAAOoC,CACX,CAEO,SAASqQ,GAAOxd,EAAIV,EAAQ,CAC/B,MAAM6N,EAAK,IAAIiL,EAAiBtV,EAAA,CAC5B,MAAO,UACJiW,EAAqBzZ,CAAM,EACjC,EACD,OAAA6N,EAAG,KAAK,MAAQnN,EACTmN,CACX,CCj9BO,SAASuQ,GAAkBpe,EAAQ,uBAEtC,IAAIsC,GAAS9B,EAAAR,GAAA,YAAAA,EAAQ,SAAR,KAAAQ,EAAkB,gBAC/B,OAAI8B,IAAW,YACXA,EAAS,YACTA,IAAW,YACXA,EAAS,YACN,CACH,YAAY3B,EAAAX,EAAO,aAAP,KAAAW,EAAqB,CAAA,EACjC,kBAAkB0F,EAAArG,GAAA,YAAAA,EAAQ,WAAR,KAAAqG,EAAoBkT,GACtC,OAAAjX,EACA,iBAAiB8D,EAAApG,GAAA,YAAAA,EAAQ,kBAAR,KAAAoG,EAA2B,QAC5C,UAAUE,EAAAtG,GAAA,YAAAA,EAAQ,WAAR,KAAAsG,GAAqB,IAAM,CAAE,GACvC,IAAIH,EAAAnG,GAAA,YAAAA,EAAQ,KAAR,KAAAmG,EAAc,SAClB,QAAS,EACT,KAAM,IAAI,IACV,QAAQI,EAAAvG,GAAA,YAAAA,EAAQ,SAAR,KAAAuG,EAAkB,MAC1B,QAAQL,EAAAlG,GAAA,YAAAA,EAAQ,SAAR,KAAAkG,EAAkB,SAC1B,UAAUM,EAAAxG,GAAA,YAAAA,EAAQ,WAAR,KAAAwG,EAAoB,MACtC,CACA,CACO,SAAS6X,EAAQja,EAAQ0B,EAAKhC,EAAU,CAAE,KAAM,CAAA,EAAI,WAAY,CAAA,GAAM,WACzE,IAAItD,EACJ,MAAML,EAAMiE,EAAO,KAAK,IAElBka,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChC,GAAIka,EACA,OAAAA,EAAK,QAEWxa,EAAQ,WAAW,SAASM,CAAM,IAE9Cka,EAAK,MAAQxa,EAAQ,MAElBwa,EAAK,OAGhB,MAAM9iB,EAAS,CAAE,OAAQ,CAAA,EAAI,MAAO,EAAG,MAAO,OAAW,KAAMsI,EAAQ,IAAI,EAC3EgC,EAAI,KAAK,IAAI1B,EAAQ5I,CAAM,EAE3B,MAAM+iB,GAAiB5d,GAAAH,EAAA4D,EAAO,MAAK,eAAZ,YAAAzD,EAAA,KAAAH,GACvB,GAAI+d,EACA/iB,EAAO,OAAS+iB,MAEf,CACD,MAAMve,EAAS+D,EAAAP,EAAA,GACRM,GADQ,CAEX,WAAY,CAAC,GAAGA,EAAQ,WAAYM,CAAM,EAC1C,KAAMN,EAAQ,IAC1B,GACQ,GAAIM,EAAO,KAAK,kBACZA,EAAO,KAAK,kBAAkB0B,EAAKtK,EAAO,OAAQwE,CAAM,MAEvD,CACD,MAAMwe,EAAQhjB,EAAO,OACfijB,EAAY3Y,EAAI,WAAW3F,EAAI,IAAI,EACzC,GAAI,CAACse,EACD,MAAM,IAAI,MAAM,uDAAuDte,EAAI,IAAI,EAAE,EAErFse,EAAUra,EAAQ0B,EAAK0Y,EAAOxe,CAAM,CACxC,CACA,MAAM0e,EAASta,EAAO,KAAK,OACvBsa,IAEKljB,EAAO,MACRA,EAAO,IAAMkjB,GACjBL,EAAQK,EAAQ5Y,EAAK9F,CAAM,EAC3B8F,EAAI,KAAK,IAAI4Y,CAAM,EAAE,SAAW,GAExC,CAEA,MAAMtF,EAAOtT,EAAI,iBAAiB,IAAI1B,CAAM,EAC5C,OAAIgV,GACA,OAAO,OAAO5d,EAAO,OAAQ4d,CAAI,EACjCtT,EAAI,KAAO,SAAW6Y,EAAeva,CAAM,IAE3C,OAAO5I,EAAO,OAAO,SACrB,OAAOA,EAAO,OAAO,SAGrBsK,EAAI,KAAO,SAAWtK,EAAO,OAAO,aACnC6K,GAAA7F,EAAKhF,EAAO,QAAQ,UAApB,OAAgCgF,EAAG,QAAUhF,EAAO,OAAO,YAChE,OAAOA,EAAO,OAAO,UAELsK,EAAI,KAAK,IAAI1B,CAAM,EACpB,MACnB,CACO,SAASwa,GAAY9Y,EAAK1B,EAE/B,aAEE,MAAMya,EAAO/Y,EAAI,KAAK,IAAI1B,CAAM,EAChC,GAAI,CAACya,EACD,MAAM,IAAI,MAAM,2CAA2C,EAE/D,MAAMC,EAAa,IAAI,IACvB,UAAWC,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMmP,GAAKzU,EAAAsF,EAAI,iBAAiB,IAAIiZ,EAAM,CAAC,CAAC,IAAjC,YAAAve,EAAoC,GAC/C,GAAIyU,EAAI,CACJ,MAAM+J,EAAWF,EAAW,IAAI7J,CAAE,EAClC,GAAI+J,GAAYA,IAAaD,EAAM,CAAC,EAChC,MAAM,IAAI,MAAM,wBAAwB9J,CAAE,mHAAmH,EAEjK6J,EAAW,IAAI7J,EAAI8J,EAAM,CAAC,CAAC,CAC/B,CACJ,CAGA,MAAME,EAAWF,GAAU,eAKvB,MAAMG,EAAcpZ,EAAI,SAAW,gBAAkB,QAAU,cAC/D,GAAIA,EAAI,SAAU,CACd,MAAMqZ,GAAa3e,EAAAsF,EAAI,SAAS,SAAS,IAAIiZ,EAAM,CAAC,CAAC,IAAlC,YAAAve,EAAqC,GAElD4e,GAAeze,EAAAmF,EAAI,SAAS,MAAb,KAAAnF,GAAsBsU,GAAOA,GAClD,GAAIkK,EACA,MAAO,CAAE,IAAKC,EAAaD,CAAU,CAAC,EAG1C,MAAMlK,GAAK7O,GAAAC,EAAA0Y,EAAM,CAAC,EAAE,QAAT,KAAA1Y,EAAkB0Y,EAAM,CAAC,EAAE,OAAO,KAAlC,KAAA3Y,EAAwC,SAASN,EAAI,SAAS,GACzE,OAAAiZ,EAAM,CAAC,EAAE,MAAQ9J,EACV,CAAE,MAAOA,EAAI,IAAK,GAAGmK,EAAa,UAAU,CAAC,KAAKF,CAAW,IAAIjK,CAAE,EAAE,CAChF,CACA,GAAI8J,EAAM,CAAC,IAAMF,EACb,MAAO,CAAE,IAAK,GAAG,EAIrB,MAAMQ,EAAe,KAAgBH,CAAW,IAC1CI,GAAQhZ,EAAAyY,EAAM,CAAC,EAAE,OAAO,KAAhB,KAAAzY,EAAsB,WAAWR,EAAI,SAAS,GAC5D,MAAO,CAAE,MAAAwZ,EAAO,IAAKD,EAAeC,CAAK,CAC7C,EAGMC,EAAgBR,GAAU,CAE5B,GAAIA,EAAM,CAAC,EAAE,OAAO,KAChB,OAEJ,MAAMT,EAAOS,EAAM,CAAC,EACd,CAAE,IAAAS,EAAK,MAAAF,GAAUL,EAAQF,CAAK,EACpCT,EAAK,IAAM9a,EAAA,GAAK8a,EAAK,QAGjBgB,IACAhB,EAAK,MAAQgB,GAEjB,MAAMlb,EAASka,EAAK,OACpB,UAAWrjB,KAAOmJ,EACd,OAAOA,EAAOnJ,CAAG,EAErBmJ,EAAO,KAAOob,CAClB,EAGA,GAAI1Z,EAAI,SAAW,QACf,UAAWiZ,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMwY,EAAOS,EAAM,CAAC,EACpB,GAAIT,EAAK,MACL,MAAM,IAAI,MAAM,sBACP3d,EAAA2d,EAAK,QAAL,YAAA3d,EAAY,KAAK,IAAI;AAAA;AAAA,iFACwD,CAE9F,CAGJ,UAAWoe,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMwY,EAAOS,EAAM,CAAC,EAEpB,GAAI3a,IAAW2a,EAAM,CAAC,EAAG,CACrBQ,EAAaR,CAAK,EAClB,QACJ,CAEA,GAAIjZ,EAAI,SAAU,CACd,MAAM2Z,GAAMpZ,EAAAP,EAAI,SAAS,SAAS,IAAIiZ,EAAM,CAAC,CAAC,IAAlC,YAAA1Y,EAAqC,GACjD,GAAIjC,IAAW2a,EAAM,CAAC,GAAKU,EAAK,CAC5BF,EAAaR,CAAK,EAClB,QACJ,CACJ,CAGA,IADW3Y,EAAAN,EAAI,iBAAiB,IAAIiZ,EAAM,CAAC,CAAC,IAAjC,YAAA3Y,EAAoC,GACvC,CACJmZ,EAAaR,CAAK,EAClB,QACJ,CAEA,GAAIT,EAAK,MAAO,CAEZiB,EAAaR,CAAK,EAClB,QACJ,CAEA,GAAIT,EAAK,MAAQ,GACTxY,EAAI,SAAW,MAAO,CACtByZ,EAAaR,CAAK,EAElB,QACJ,CAER,CACJ,CACO,SAASW,GAAS5Z,EAAK1B,EAAQ,eAClC,MAAMya,EAAO/Y,EAAI,KAAK,IAAI1B,CAAM,EAChC,GAAI,CAACya,EACD,MAAM,IAAI,MAAM,2CAA2C,EAE/D,MAAMc,EAAcC,GAAc,WAC9B,MAAMtB,EAAOxY,EAAI,KAAK,IAAI8Z,CAAS,EAEnC,GAAItB,EAAK,MAAQ,KACb,OACJ,MAAMla,GAAS5D,EAAA8d,EAAK,MAAL,KAAA9d,EAAY8d,EAAK,OAC1BuB,EAAUrc,EAAA,GAAKY,GACfob,EAAMlB,EAAK,IAEjB,GADAA,EAAK,IAAM,KACPkB,EAAK,CACLG,EAAWH,CAAG,EACd,MAAMM,EAAUha,EAAI,KAAK,IAAI0Z,CAAG,EAC1BO,EAAYD,EAAQ,OAc1B,GAZIC,EAAU,OAASja,EAAI,SAAW,YAAcA,EAAI,SAAW,YAAcA,EAAI,SAAW,gBAE5F1B,EAAO,OAAQzD,EAAAyD,EAAO,QAAP,KAAAzD,EAAgB,CAAA,EAC/ByD,EAAO,MAAM,KAAK2b,CAAS,GAG3B,OAAO,OAAO3b,EAAQ2b,CAAS,EAGnC,OAAO,OAAO3b,EAAQyb,CAAO,EACTD,EAAU,KAAK,SAAWJ,EAG1C,UAAWvkB,KAAOmJ,EACVnJ,IAAQ,QAAUA,IAAQ,SAExBA,KAAO4kB,GACT,OAAOzb,EAAOnJ,CAAG,EAK7B,GAAI8kB,EAAU,MAAQD,EAAQ,IAC1B,UAAW7kB,KAAOmJ,EACVnJ,IAAQ,QAAUA,IAAQ,SAE1BA,KAAO6kB,EAAQ,KAAO,KAAK,UAAU1b,EAAOnJ,CAAG,CAAC,IAAM,KAAK,UAAU6kB,EAAQ,IAAI7kB,CAAG,CAAC,GACrF,OAAOmJ,EAAOnJ,CAAG,CAIjC,CAIA,MAAMyjB,EAASkB,EAAU,KAAK,OAC9B,GAAIlB,GAAUA,IAAWc,EAAK,CAE1BG,EAAWjB,CAAM,EACjB,MAAMsB,EAAala,EAAI,KAAK,IAAI4Y,CAAM,EACtC,GAAIsB,GAAA,MAAAA,EAAY,OAAO,OACnB5b,EAAO,KAAO4b,EAAW,OAAO,KAE5BA,EAAW,KACX,UAAW/kB,KAAOmJ,EACVnJ,IAAQ,QAAUA,IAAQ,SAE1BA,KAAO+kB,EAAW,KAAO,KAAK,UAAU5b,EAAOnJ,CAAG,CAAC,IAAM,KAAK,UAAU+kB,EAAW,IAAI/kB,CAAG,CAAC,GAC3F,OAAOmJ,EAAOnJ,CAAG,CAKrC,CAEA6K,EAAI,SAAS,CACT,UAAW8Z,EACX,WAAYxb,EACZ,MAAMiC,EAAAiY,EAAK,OAAL,KAAAjY,EAAa,CAAA,CAC/B,CAAS,CACL,EACA,UAAW0Y,IAAS,CAAC,GAAGjZ,EAAI,KAAK,QAAO,CAAE,EAAE,UACxC6Z,EAAWZ,EAAM,CAAC,CAAC,EAEvB,MAAMvjB,EAAS,CAAA,EAgBf,GAfIsK,EAAI,SAAW,gBACftK,EAAO,QAAU,+CAEZsK,EAAI,SAAW,WACpBtK,EAAO,QAAU,0CAEZsK,EAAI,SAAW,WACpBtK,EAAO,QAAU,0CAEZsK,EAAI,QAMTtF,EAAAsF,EAAI,WAAJ,MAAAtF,EAAc,IAAK,CACnB,MAAMyU,GAAKtU,EAAAmF,EAAI,SAAS,SAAS,IAAI1B,CAAM,IAAhC,YAAAzD,EAAmC,GAC9C,GAAI,CAACsU,EACD,MAAM,IAAI,MAAM,oCAAoC,EACxDzZ,EAAO,IAAMsK,EAAI,SAAS,IAAImP,CAAE,CACpC,CACA,OAAO,OAAOzZ,GAAQ6K,EAAAwY,EAAK,MAAL,KAAAxY,EAAYwY,EAAK,MAAM,EAE7C,MAAMpc,GAAO6D,GAAAF,EAAAN,EAAI,WAAJ,YAAAM,EAAc,OAAd,KAAAE,EAAsB,CAAA,EACnC,UAAWyY,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMwY,EAAOS,EAAM,CAAC,EAChBT,EAAK,KAAOA,EAAK,QACjB7b,EAAK6b,EAAK,KAAK,EAAIA,EAAK,IAEhC,CAEIxY,EAAI,UAGA,OAAO,KAAKrD,CAAI,EAAE,OAAS,IACvBqD,EAAI,SAAW,gBACftK,EAAO,MAAQiH,EAGfjH,EAAO,YAAciH,GAIjC,GAAI,CAIA,MAAMwd,EAAY,KAAK,MAAM,KAAK,UAAUzkB,CAAM,CAAC,EACnD,cAAO,eAAeykB,EAAW,YAAa,CAC1C,MAAOlc,EAAAP,EAAA,GACAY,EAAO,WAAW,GADlB,CAEH,WAAY,CACR,MAAO8b,GAA+B9b,EAAQ,QAAS0B,EAAI,UAAU,EACrE,OAAQoa,GAA+B9b,EAAQ,SAAU0B,EAAI,UAAU,CAC3F,CACA,GACY,WAAY,GACZ,SAAU,EACtB,CAAS,EACMma,CACX,OACOE,EAAM,CACT,MAAM,IAAI,MAAM,kCAAkC,CACtD,CACJ,CACA,SAASxB,EAAeyB,EAAS1Y,EAAM,CACnC,MAAM5B,EAAM4B,GAAA,KAAAA,EAAQ,CAAE,KAAM,IAAI,GAAK,EACrC,GAAI5B,EAAI,KAAK,IAAIsa,CAAO,EACpB,MAAO,GACXta,EAAI,KAAK,IAAIsa,CAAO,EACpB,MAAMjgB,EAAMigB,EAAQ,KAAK,IACzB,GAAIjgB,EAAI,OAAS,YACb,MAAO,GACX,GAAIA,EAAI,OAAS,QACb,OAAOwe,EAAexe,EAAI,QAAS2F,CAAG,EAC1C,GAAI3F,EAAI,OAAS,MACb,OAAOwe,EAAexe,EAAI,UAAW2F,CAAG,EAC5C,GAAI3F,EAAI,OAAS,OACb,OAAOwe,EAAexe,EAAI,OAAM,EAAI2F,CAAG,EAC3C,GAAI3F,EAAI,OAAS,WACbA,EAAI,OAAS,YACbA,EAAI,OAAS,eACbA,EAAI,OAAS,YACbA,EAAI,OAAS,YACbA,EAAI,OAAS,WACbA,EAAI,OAAS,WACb,OAAOwe,EAAexe,EAAI,UAAW2F,CAAG,EAE5C,GAAI3F,EAAI,OAAS,eACb,OAAOwe,EAAexe,EAAI,KAAM2F,CAAG,GAAK6Y,EAAexe,EAAI,MAAO2F,CAAG,EAEzE,GAAI3F,EAAI,OAAS,UAAYA,EAAI,OAAS,MACtC,OAAOwe,EAAexe,EAAI,QAAS2F,CAAG,GAAK6Y,EAAexe,EAAI,UAAW2F,CAAG,EAEhF,GAAI3F,EAAI,OAAS,OACb,OAAOwe,EAAexe,EAAI,GAAI2F,CAAG,GAAK6Y,EAAexe,EAAI,IAAK2F,CAAG,EAErE,GAAI3F,EAAI,OAAS,SAAU,CACvB,UAAWlF,KAAOkF,EAAI,MAClB,GAAIwe,EAAexe,EAAI,MAAMlF,CAAG,EAAG6K,CAAG,EAClC,MAAO,GAEf,MAAO,EACX,CACA,GAAI3F,EAAI,OAAS,QAAS,CACtB,UAAWwV,KAAUxV,EAAI,QACrB,GAAIwe,EAAehJ,EAAQ7P,CAAG,EAC1B,MAAO,GAEf,MAAO,EACX,CACA,GAAI3F,EAAI,OAAS,QAAS,CACtB,UAAWkT,KAAQlT,EAAI,MACnB,GAAIwe,EAAetL,EAAMvN,CAAG,EACxB,MAAO,GAEf,MAAI,GAAA3F,EAAI,MAAQwe,EAAexe,EAAI,KAAM2F,CAAG,EAGhD,CACA,MAAO,EACX,CAKO,MAAMua,GAA2B,CAACjc,EAAQkc,EAAa,CAAA,IAAQtgB,GAAW,CAC7E,MAAM8F,EAAMsY,GAAkBra,EAAAP,EAAA,GAAKxD,GAAL,CAAa,WAAAsgB,CAAU,EAAE,EACvD,OAAAjC,EAAQja,EAAQ0B,CAAG,EACnB8Y,GAAY9Y,EAAK1B,CAAM,EAChBsb,GAAS5Z,EAAK1B,CAAM,CAC/B,EACa8b,GAAiC,CAAC9b,EAAQmc,EAAID,EAAa,CAAA,IAAQtgB,GAAW,CACvF,KAAM,CAAE,eAAAwgB,EAAgB,OAAAle,CAAM,EAAKtC,GAAA,KAAAA,EAAU,CAAA,EACvC8F,EAAMsY,GAAkBra,EAAAP,EAAA,GAAMgd,GAAA,KAAAA,EAAkB,CAAA,GAAxB,CAA6B,OAAAle,EAAQ,GAAAie,EAAI,WAAAD,GAAY,EACnF,OAAAjC,EAAQja,EAAQ0B,CAAG,EACnB8Y,GAAY9Y,EAAK1B,CAAM,EAChBsb,GAAS5Z,EAAK1B,CAAM,CAC/B,EClbMqc,GAAY,CACd,KAAM,OACN,IAAK,MACL,SAAU,YACV,YAAa,cACb,MAAO,EACX,EAEaC,GAAkB,CAACtc,EAAQ0B,EAAK0Y,EAAO1a,IAAY,OAC5D,MAAM6c,EAAOnC,EACbmC,EAAK,KAAO,SACZ,KAAM,CAAE,QAAA5U,EAAS,QAAAC,EAAS,OAAA4U,EAAQ,SAAAhL,EAAU,gBAAAiL,CAAe,EAAKzc,EAAO,KAClE,IAkBL,GAjBI,OAAO2H,GAAY,WACnB4U,EAAK,UAAY5U,GACjB,OAAOC,GAAY,WACnB2U,EAAK,UAAY3U,GAEjB4U,IACAD,EAAK,QAASngB,EAAAigB,GAAUG,CAAM,IAAhB,KAAApgB,EAAqBogB,EAC/BD,EAAK,SAAW,IAChB,OAAOA,EAAK,OAGZC,IAAW,QACX,OAAOD,EAAK,QAGhBE,IACAF,EAAK,gBAAkBE,GACvBjL,GAAYA,EAAS,KAAO,EAAG,CAC/B,MAAMkL,EAAU,CAAC,GAAGlL,CAAQ,EACxBkL,EAAQ,SAAW,EACnBH,EAAK,QAAUG,EAAQ,CAAC,EAAE,OACrBA,EAAQ,OAAS,IACtBH,EAAK,MAAQ,CACT,GAAGG,EAAQ,IAAKjW,GAAW9G,EAAAP,EAAA,GACnBsC,EAAI,SAAW,YAAcA,EAAI,SAAW,YAAcA,EAAI,SAAW,cACvE,CAAE,KAAM,QAAQ,EAChB,IAHiB,CAIvB,QAAS+E,EAAM,MACnC,EAAkB,CAClB,EAEI,CACJ,EACakW,GAAkB,CAAC3c,EAAQ0B,EAAK0Y,EAAO1a,IAAY,CAC5D,MAAM6c,EAAOnC,EACP,CAAE,QAAAzS,EAAS,QAAAC,EAAS,OAAA4U,EAAQ,WAAAI,EAAY,iBAAAC,EAAkB,iBAAAC,CAAgB,EAAK9c,EAAO,KAAK,IAC7F,OAAOwc,GAAW,UAAYA,EAAO,SAAS,KAAK,EACnDD,EAAK,KAAO,UAEZA,EAAK,KAAO,SACZ,OAAOO,GAAqB,WACxBpb,EAAI,SAAW,YAAcA,EAAI,SAAW,eAC5C6a,EAAK,QAAUO,EACfP,EAAK,iBAAmB,IAGxBA,EAAK,iBAAmBO,GAG5B,OAAOnV,GAAY,WACnB4U,EAAK,QAAU5U,EACX,OAAOmV,GAAqB,UAAYpb,EAAI,SAAW,aACnDob,GAAoBnV,EACpB,OAAO4U,EAAK,QAEZ,OAAOA,EAAK,mBAGpB,OAAOM,GAAqB,WACxBnb,EAAI,SAAW,YAAcA,EAAI,SAAW,eAC5C6a,EAAK,QAAUM,EACfN,EAAK,iBAAmB,IAGxBA,EAAK,iBAAmBM,GAG5B,OAAOjV,GAAY,WACnB2U,EAAK,QAAU3U,EACX,OAAOiV,GAAqB,UAAYnb,EAAI,SAAW,aACnDmb,GAAoBjV,EACpB,OAAO2U,EAAK,QAEZ,OAAOA,EAAK,mBAGpB,OAAOK,GAAe,WACtBL,EAAK,WAAaK,EAC1B,EACaG,GAAmB,CAACf,EAAS1Y,EAAMiZ,EAAM7c,IAAY,CAC9D6c,EAAK,KAAO,SAChB,EA+BaS,GAAiB,CAAChB,EAAS1Y,EAAMiZ,EAAM7c,IAAY,CAC5D6c,EAAK,IAAM,CAAA,CACf,EAIaU,GAAmB,CAACjB,EAAS1Y,EAAM8W,EAAO1a,IAAY,CAEnE,EAMawd,GAAgB,CAACld,EAAQsD,EAAMiZ,EAAM7c,IAAY,CAC1D,MAAM3D,EAAMiE,EAAO,KAAK,IAClB8S,EAASjW,GAAcd,EAAI,OAAO,EAEpC+W,EAAO,MAAOppB,GAAM,OAAOA,GAAM,QAAQ,IACzC6yB,EAAK,KAAO,UACZzJ,EAAO,MAAOppB,GAAM,OAAOA,GAAM,QAAQ,IACzC6yB,EAAK,KAAO,UAChBA,EAAK,KAAOzJ,CAChB,EACaqK,GAAmB,CAACnd,EAAQ0B,EAAK6a,EAAM7c,IAAY,CAC5D,MAAM3D,EAAMiE,EAAO,KAAK,IAClBod,EAAO,CAAA,EACb,UAAW9nB,KAAOyG,EAAI,OAClB,GAAIzG,IAAQ,QACR,GAAIoM,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,0DAA0D,UAMzE,OAAOpM,GAAQ,SAAU,CAC9B,GAAIoM,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,sDAAsD,EAGtE0b,EAAK,KAAK,OAAO9nB,CAAG,CAAC,CAE7B,MAEI8nB,EAAK,KAAK9nB,CAAG,EAGrB,GAAI8nB,EAAK,SAAW,EAGf,GAAIA,EAAK,SAAW,EAAG,CACxB,MAAM9nB,EAAM8nB,EAAK,CAAC,EAClBb,EAAK,KAAOjnB,IAAQ,KAAO,OAAS,OAAOA,EACvCoM,EAAI,SAAW,YAAcA,EAAI,SAAW,cAC5C6a,EAAK,KAAO,CAACjnB,CAAG,EAGhBinB,EAAK,MAAQjnB,CAErB,MAEQ8nB,EAAK,MAAO1zB,GAAM,OAAOA,GAAM,QAAQ,IACvC6yB,EAAK,KAAO,UACZa,EAAK,MAAO1zB,GAAM,OAAOA,GAAM,QAAQ,IACvC6yB,EAAK,KAAO,UACZa,EAAK,MAAO1zB,GAAM,OAAOA,GAAM,SAAS,IACxC6yB,EAAK,KAAO,WACZa,EAAK,MAAO1zB,GAAMA,IAAM,IAAI,IAC5B6yB,EAAK,KAAO,QAChBA,EAAK,KAAOa,CAEpB,EA2CaC,GAAkB,CAACrB,EAASta,EAAK0Y,EAAO1a,IAAY,CAC7D,GAAIgC,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,mDAAmD,CAE3E,EAMa4b,GAAqB,CAACtB,EAASta,EAAK0Y,EAAO1a,IAAY,CAChE,GAAIgC,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,iDAAiD,CAEzE,EAYa6b,GAAiB,CAACvd,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAC1D,MAAM2gB,EAAOnC,EACPre,EAAMiE,EAAO,KAAK,IAClB,CAAE,QAAA2H,EAAS,QAAAC,CAAO,EAAK5H,EAAO,KAAK,IACrC,OAAO2H,GAAY,WACnB4U,EAAK,SAAW5U,GAChB,OAAOC,GAAY,WACnB2U,EAAK,SAAW3U,GACpB2U,EAAK,KAAO,QACZA,EAAK,MAAQtC,EAAQle,EAAI,QAAS2F,EAAK/B,EAAAP,EAAA,GAAKxD,GAAL,CAAa,KAAM,CAAC,GAAGA,EAAO,KAAM,OAAO,CAAC,EAAE,CACzF,EACa4hB,GAAkB,CAACxd,EAAQ0B,EAAK0Y,EAAOxe,IAAW,OAC3D,MAAM2gB,EAAOnC,EACPre,EAAMiE,EAAO,KAAK,IACxBuc,EAAK,KAAO,SACZA,EAAK,WAAa,CAAA,EAClB,MAAM1c,EAAQ9D,EAAI,MAClB,UAAWlF,KAAOgJ,EACd0c,EAAK,WAAW1lB,CAAG,EAAIojB,EAAQpa,EAAMhJ,CAAG,EAAG6K,EAAK/B,EAAAP,EAAA,GACzCxD,GADyC,CAE5C,KAAM,CAAC,GAAGA,EAAO,KAAM,aAAc/E,CAAG,CACpD,EAAS,EAGL,MAAM4mB,EAAU,IAAI,IAAI,OAAO,KAAK5d,CAAK,CAAC,EACpC6d,EAAe,IAAI,IAAI,CAAC,GAAGD,CAAO,EAAE,OAAQ5mB,GAAQ,CACtD,MAAMnN,EAAIqS,EAAI,MAAMlF,CAAG,EAAE,KACzB,OAAI6K,EAAI,KAAO,QACJhY,EAAE,QAAU,OAGZA,EAAE,SAAW,MAE5B,CAAC,CAAC,EACEg0B,EAAa,KAAO,IACpBnB,EAAK,SAAW,MAAM,KAAKmB,CAAY,KAGvCthB,EAAAL,EAAI,WAAJ,YAAAK,EAAc,KAAK,IAAI,QAAS,QAEhCmgB,EAAK,qBAAuB,GAEtBxgB,EAAI,SAKLA,EAAI,WACTwgB,EAAK,qBAAuBtC,EAAQle,EAAI,SAAU2F,EAAK/B,EAAAP,EAAA,GAChDxD,GADgD,CAEnD,KAAM,CAAC,GAAGA,EAAO,KAAM,sBAAsB,CACzD,EAAS,GAPG8F,EAAI,KAAO,WACX6a,EAAK,qBAAuB,GAQxC,EACaoB,GAAiB,CAAC3d,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CACzD,MAAMG,EAAMiE,EAAO,KAAK,IAGlB4d,EAAc7hB,EAAI,YAAc,GAChC1C,EAAU0C,EAAI,QAAQ,IAAI,CAACkF,EAAGhU,IAAMgtB,EAAQhZ,EAAGS,EAAK/B,EAAAP,EAAA,GACnDxD,GADmD,CAEtD,KAAM,CAAC,GAAGA,EAAO,KAAMgiB,EAAc,QAAU,QAAS3wB,CAAC,CACjE,EAAK,CAAC,EACE2wB,EACArB,EAAK,MAAQljB,EAGbkjB,EAAK,MAAQljB,CAErB,EACawkB,GAAwB,CAAC7d,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAChE,MAAMG,EAAMiE,EAAO,KAAK,IAClBW,EAAIsZ,EAAQle,EAAI,KAAM2F,EAAK/B,EAAAP,EAAA,GAC1BxD,GAD0B,CAE7B,KAAM,CAAC,GAAGA,EAAO,KAAM,QAAS,CAAC,CACzC,EAAK,EACKvK,EAAI4oB,EAAQle,EAAI,MAAO2F,EAAK/B,EAAAP,EAAA,GAC3BxD,GAD2B,CAE9B,KAAM,CAAC,GAAGA,EAAO,KAAM,QAAS,CAAC,CACzC,EAAK,EACKkiB,EAAwBxoB,GAAQ,UAAWA,GAAO,OAAO,KAAKA,CAAG,EAAE,SAAW,EAC9EyoB,EAAQ,CACV,GAAID,EAAqBnd,CAAC,EAAIA,EAAE,MAAQ,CAACA,CAAC,EAC1C,GAAImd,EAAqBzsB,CAAC,EAAIA,EAAE,MAAQ,CAACA,CAAC,CAClD,EACIkrB,EAAK,MAAQwB,CACjB,EAgDaC,GAAkB,CAAChe,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAC3D,MAAM2gB,EAAOnC,EACPre,EAAMiE,EAAO,KAAK,IACxBuc,EAAK,KAAO,SAIZ,MAAM0B,EAAUliB,EAAI,QACdmiB,EAASD,EAAQ,KAAK,IACtBzM,EAAW0M,GAAA,YAAAA,EAAQ,SACzB,GAAIniB,EAAI,OAAS,SAAWyV,GAAYA,EAAS,KAAO,EAAG,CAEvD,MAAM2M,EAAclE,EAAQle,EAAI,UAAW2F,EAAK/B,EAAAP,EAAA,GACzCxD,GADyC,CAE5C,KAAM,CAAC,GAAGA,EAAO,KAAM,oBAAqB,GAAG,CAC3D,EAAS,EACD2gB,EAAK,kBAAoB,CAAA,EACzB,UAAWzT,KAAW0I,EAClB+K,EAAK,kBAAkBzT,EAAQ,MAAM,EAAIqV,CAEjD,MAGQzc,EAAI,SAAW,YAAcA,EAAI,SAAW,mBAC5C6a,EAAK,cAAgBtC,EAAQle,EAAI,QAAS2F,EAAK/B,EAAAP,EAAA,GACxCxD,GADwC,CAE3C,KAAM,CAAC,GAAGA,EAAO,KAAM,eAAe,CACtD,EAAa,GAEL2gB,EAAK,qBAAuBtC,EAAQle,EAAI,UAAW2F,EAAK/B,EAAAP,EAAA,GACjDxD,GADiD,CAEpD,KAAM,CAAC,GAAGA,EAAO,KAAM,sBAAsB,CACzD,EAAS,EAGL,MAAMwiB,EAAYH,EAAQ,KAAK,OAC/B,GAAIG,EAAW,CACX,MAAMC,EAAiB,CAAC,GAAGD,CAAS,EAAE,OAAQ10B,GAAM,OAAOA,GAAM,UAAY,OAAOA,GAAM,QAAQ,EAC9F20B,EAAe,OAAS,IACxB9B,EAAK,SAAW8B,EAExB,CACJ,EACaC,GAAoB,CAACte,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC5D,MAAMG,EAAMiE,EAAO,KAAK,IAClBue,EAAQtE,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAC1Cse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAC5B0B,EAAI,SAAW,eACfwY,EAAK,IAAMne,EAAI,UACfwgB,EAAK,SAAW,IAGhBA,EAAK,MAAQ,CAACgC,EAAO,CAAE,KAAM,MAAM,CAAE,CAE7C,EACaC,GAAuB,CAACxe,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAChE,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,SACnB,EACa0iB,GAAmB,CAACze,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC3D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACfwgB,EAAK,QAAU,KAAK,MAAM,KAAK,UAAUxgB,EAAI,YAAY,CAAC,CAC9D,EACa2iB,GAAoB,CAAC1e,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC5D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACX2F,EAAI,KAAO,UACX6a,EAAK,UAAY,KAAK,MAAM,KAAK,UAAUxgB,EAAI,YAAY,CAAC,EACpE,EACa4iB,GAAiB,CAAC3e,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CACzD,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACf,IAAI6iB,EACJ,GAAI,CACAA,EAAa7iB,EAAI,WAAW,MAAS,CACzC,OACMyH,EAAA,CACF,MAAM,IAAI,MAAM,uDAAuD,CAC3E,CACA+Y,EAAK,QAAUqC,CACnB,EACaC,GAAgB,CAAC7e,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CACzD,MAAMG,EAAMiE,EAAO,KAAK,IAClB8e,EAAYpd,EAAI,KAAO,QAAW3F,EAAI,GAAG,KAAK,IAAI,OAAS,YAAcA,EAAI,IAAMA,EAAI,GAAMA,EAAI,IACvGke,EAAQ6E,EAAWpd,EAAK9F,CAAM,EAC9B,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAM4E,CACf,EACaC,GAAoB,CAAC/e,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC5D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACfwgB,EAAK,SAAW,EACpB,EAOayC,GAAoB,CAAChf,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAC7D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,SACnB,ECngBakjB,GAA+BjY,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3FmjB,GAAqB,KAAKpjB,EAAMC,CAAG,EACnCojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASsK,GAASzK,EAAQ,CAC7B,OAAOwjB,GAAkBH,GAAgBrjB,CAAM,CACnD,CACO,MAAMyjB,GAA2BrY,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFujB,GAAiB,KAAKxjB,EAAMC,CAAG,EAC/BojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASkK,GAAKrK,EAAQ,CACzB,OAAO2jB,GAAcF,GAAYzjB,CAAM,CAC3C,CACO,MAAM4jB,GAA2BxY,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnF0jB,GAAiB,KAAK3jB,EAAMC,CAAG,EAC/BojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASqK,GAAKxK,EAAQ,CACzB,OAAO8jB,GAAcF,GAAY5jB,CAAM,CAC3C,CACO,MAAM+jB,GAA+B3Y,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3F6jB,GAAqB,KAAK9jB,EAAMC,CAAG,EACnCojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASmJ,GAAStJ,EAAQ,CAC7B,OAAOikB,GAAkBF,GAAgB/jB,CAAM,CACnD,CC1BA,MAAMD,GAAc,CAACG,EAAMuF,IAAW,CAClCoB,GAAU,KAAK3G,EAAMuF,CAAM,EAC3BvF,EAAK,KAAO,WACZ,OAAO,iBAAiBA,EAAM,CAC1B,OAAQ,CACJ,MAAQ8G,GAAWkd,GAAiBhkB,EAAM8G,CAAM,CAE5D,EACQ,QAAS,CACL,MAAQA,GAAWmd,GAAkBjkB,EAAM8G,CAAM,CAE7D,EACQ,SAAU,CACN,MAAQN,GAAU,CACdxG,EAAK,OAAO,KAAKwG,CAAK,EACtBxG,EAAK,QAAU,KAAK,UAAUA,EAAK,OAAQ0G,GAA4B,CAAC,CAC5E,CAEZ,EACQ,UAAW,CACP,MAAQnB,GAAW,CACfvF,EAAK,OAAO,KAAK,GAAGuF,CAAM,EAC1BvF,EAAK,QAAU,KAAK,UAAUA,EAAK,OAAQ0G,GAA4B,CAAC,CAC5E,CAEZ,EACQ,QAAS,CACL,KAAM,CACF,OAAO1G,EAAK,OAAO,SAAW,CAClC,CAEZ,CACA,CAAK,CAML,EAEakkB,GAAehZ,EAAkB,WAAYrL,GAAa,CACnE,OAAQ,KACZ,CAAC,EC3CYskB,GAAwBC,GAAYF,EAAY,EAChDG,GAA6BC,GAAiBJ,EAAY,EAC1Dhc,GAA4Bqc,GAAgBL,EAAY,EACxD7b,GAAiCmc,GAAqBN,EAAY,EAElEO,GAAyBC,GAAaR,EAAY,EAClDS,GAAyBC,GAAaV,EAAY,EAClDW,GAA8BC,GAAkBZ,EAAY,EAC5Da,GAA8BC,GAAkBd,EAAY,EAC5De,GAA6BC,GAAiBhB,EAAY,EAC1DiB,GAA6BC,GAAiBlB,EAAY,EAC1DmB,GAAkCC,GAAsBpB,EAAY,EACpEqB,GAAkCC,GAAsBtB,EAAY,ECPpEuB,EAAwBva,EAAkB,UAAW,CAAClL,EAAMC,KACrEylB,EAAc,KAAK1lB,EAAMC,CAAG,EAC5B,OAAO,OAAOD,EAAK,WAAW,EAAG,CAC7B,WAAY,CACR,MAAOggB,GAA+BhgB,EAAM,OAAO,EACnD,OAAQggB,GAA+BhgB,EAAM,QAAQ,CACjE,CACA,CAAK,EACDA,EAAK,aAAemgB,GAAyBngB,EAAM,CAAA,CAAE,EACrDA,EAAK,IAAMC,EACXD,EAAK,KAAOC,EAAI,KAChB,OAAO,eAAeD,EAAM,OAAQ,CAAE,MAAOC,EAAK,EAElDD,EAAK,MAAQ,IAAIqE,IAAW,OACxB,OAAOrE,EAAK,MAAM2lB,GAAe1lB,EAAK,CAClC,OAAQ,CACJ,IAAIK,EAAAL,EAAI,SAAJ,KAAAK,EAAc,GAClB,GAAG+D,EAAO,IAAKsJ,GAAO,OAAOA,GAAO,WAAa,CAAE,KAAM,CAAE,MAAOA,EAAI,IAAK,CAAE,MAAO,QAAQ,EAAI,SAAU,CAAA,CAAE,CAAE,EAAKA,CAAE,CACrI,CACA,CAAS,EAAG,CACA,OAAQ,EACpB,CAAS,CACL,EACA3N,EAAK,KAAOA,EAAK,MACjBA,EAAK,MAAQ,CAACC,EAAKH,IAAW8lB,GAAW5lB,EAAMC,EAAKH,CAAM,EAC1DE,EAAK,MAAQ,IAAMA,EACnBA,EAAK,UAAY,CAAC6lB,EAAK3M,KACnB2M,EAAI,IAAI7lB,EAAMkZ,CAAI,EACXlZ,IAGXA,EAAK,MAAQ,CAAC9K,EAAM4K,IAAWgmB,GAAY9lB,EAAM9K,EAAM4K,EAAQ,CAAE,OAAQE,EAAK,KAAK,CAAE,EACrFA,EAAK,UAAY,CAAC9K,EAAM4K,IAAWimB,GAAgB/lB,EAAM9K,EAAM4K,CAAM,EACrEE,EAAK,WAAa,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKie,OAAAA,GAAiBhmB,EAAM9K,EAAM4K,EAAQ,CAAE,OAAQE,EAAK,UAAU,CAAE,IAC1GA,EAAK,eAAiB,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKke,OAAAA,GAAqBjmB,EAAM9K,EAAM4K,CAAM,IACrFE,EAAK,IAAMA,EAAK,eAEhBA,EAAK,OAAS,CAAC9K,EAAM4K,IAAWomB,GAAalmB,EAAM9K,EAAM4K,CAAM,EAC/DE,EAAK,OAAS,CAAC9K,EAAM4K,IAAWqmB,GAAanmB,EAAM9K,EAAM4K,CAAM,EAC/DE,EAAK,YAAc,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKqe,OAAAA,GAAkBpmB,EAAM9K,EAAM4K,CAAM,IAC/EE,EAAK,YAAc,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKse,OAAAA,GAAkBrmB,EAAM9K,EAAM4K,CAAM,IAC/EE,EAAK,WAAa,CAAC9K,EAAM4K,IAAWwmB,GAAiBtmB,EAAM9K,EAAM4K,CAAM,EACvEE,EAAK,WAAa,CAAC9K,EAAM4K,IAAWymB,GAAiBvmB,EAAM9K,EAAM4K,CAAM,EACvEE,EAAK,gBAAkB,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKye,OAAAA,GAAsBxmB,EAAM9K,EAAM4K,CAAM,IACvFE,EAAK,gBAAkB,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAK0e,OAAAA,GAAsBzmB,EAAM9K,EAAM4K,CAAM,IAEvFE,EAAK,OAAS,CAAC0mB,EAAO5mB,IAAWE,EAAK,MAAM2mB,GAAOD,EAAO5mB,CAAM,CAAC,EACjEE,EAAK,YAAe4mB,GAAe5mB,EAAK,MAAM6mB,GAAYD,CAAU,CAAC,EACrE5mB,EAAK,UAAaQ,GAAOR,EAAK,MAAM8mB,GAAiBtmB,CAAE,CAAC,EAExDR,EAAK,SAAW,IAAM+mB,GAAS/mB,CAAI,EACnCA,EAAK,cAAgB,IAAMgnB,GAAchnB,CAAI,EAC7CA,EAAK,SAAW,IAAMinB,GAASjnB,CAAI,EACnCA,EAAK,QAAU,IAAM+mB,GAASE,GAASjnB,CAAI,CAAC,EAC5CA,EAAK,YAAeF,GAAWonB,GAAYlnB,EAAMF,CAAM,EACvDE,EAAK,MAAQ,IAAMmnB,GAAMnnB,CAAI,EAC7BA,EAAK,GAAMqN,GAAQ+Z,GAAM,CAACpnB,EAAMqN,CAAG,CAAC,EACpCrN,EAAK,IAAOqN,GAAQga,GAAarnB,EAAMqN,CAAG,EAC1CrN,EAAK,UAAamd,GAAOmK,GAAKtnB,EAAMunB,GAAUpK,CAAE,CAAC,EACjDnd,EAAK,QAAWC,GAAQunB,GAASxnB,EAAMC,CAAG,EAC1CD,EAAK,SAAYC,GAAQwnB,GAASznB,EAAMC,CAAG,EAE3CD,EAAK,MAASF,GAAW4nB,GAAO1nB,EAAMF,CAAM,EAC5CE,EAAK,KAAQoC,GAAWklB,GAAKtnB,EAAMoC,CAAM,EACzCpC,EAAK,SAAW,IAAM2nB,GAAS3nB,CAAI,EAEnCA,EAAK,SAAY4nB,GAAgB,CAC7B,MAAMlkB,EAAK1D,EAAK,MAAK,EACrB6nB,OAAAA,GAAoB,IAAInkB,EAAI,CAAE,YAAAkkB,CAAW,CAAE,EACpClkB,CACX,EACA,OAAO,eAAe1D,EAAM,cAAe,CACvC,KAAM,OACF,OAAO6nB,EAAAA,GAAoB,IAAI7nB,CAAI,IAA5B6nB,YAAAA,EAA+B,WAC1C,EACA,aAAc,EACtB,CAAK,EACD7nB,EAAK,KAAO,IAAIyG,IAAS,CACrB,GAAIA,EAAK,SAAW,EAChB,OAAOohB,GAAoB,IAAI7nB,CAAI,EAEvC,MAAM0D,EAAK1D,EAAK,MAAK,EACrB6nB,OAAAA,GAAoB,IAAInkB,EAAI+C,EAAK,CAAC,CAAC,EAC5B/C,CACX,EAEA1D,EAAK,WAAa,IAAMA,EAAK,UAAU,MAAS,EAAE,QAClDA,EAAK,WAAa,IAAMA,EAAK,UAAU,IAAI,EAAE,QAC7CA,EAAK,MAASQ,GAAOA,EAAGR,CAAI,EACrBA,EACV,EAEY8nB,GAA2B5c,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,WACnF8nB,GAAgB,KAAK/nB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWkoB,GAA2BhoB,EAAM4F,EAAK6a,CAAY,EACvG,MAAMnV,EAAMtL,EAAK,KAAK,IACtBA,EAAK,QAASM,EAAAgL,EAAI,SAAJ,KAAAhL,EAAc,KAC5BN,EAAK,WAAYS,EAAA6K,EAAI,UAAJ,KAAA7K,EAAe,KAChCT,EAAK,WAAYmG,EAAAmF,EAAI,UAAJ,KAAAnF,EAAe,KAEhCnG,EAAK,MAAQ,IAAIyG,IAASzG,EAAK,MAAMioB,GAAa,GAAGxhB,CAAI,CAAC,EAC1DzG,EAAK,SAAW,IAAIyG,IAASzG,EAAK,MAAMkoB,GAAgB,GAAGzhB,CAAI,CAAC,EAChEzG,EAAK,WAAa,IAAIyG,IAASzG,EAAK,MAAMmoB,GAAkB,GAAG1hB,CAAI,CAAC,EACpEzG,EAAK,SAAW,IAAIyG,IAASzG,EAAK,MAAMooB,GAAgB,GAAG3hB,CAAI,CAAC,EAChEzG,EAAK,IAAM,IAAIyG,IAASzG,EAAK,MAAMqoB,GAAiB,GAAG5hB,CAAI,CAAC,EAC5DzG,EAAK,IAAM,IAAIyG,IAASzG,EAAK,MAAMsoB,GAAiB,GAAG7hB,CAAI,CAAC,EAC5DzG,EAAK,OAAS,IAAIyG,IAASzG,EAAK,MAAMuoB,GAAc,GAAG9hB,CAAI,CAAC,EAC5DzG,EAAK,SAAW,IAAIyG,IAASzG,EAAK,MAAMqoB,GAAiB,EAAG,GAAG5hB,CAAI,CAAC,EACpEzG,EAAK,UAAaF,GAAWE,EAAK,MAAMwoB,GAAiB1oB,CAAM,CAAC,EAChEE,EAAK,UAAaF,GAAWE,EAAK,MAAMyoB,GAAiB3oB,CAAM,CAAC,EAEhEE,EAAK,KAAO,IAAMA,EAAK,MAAM0oB,GAAW,CAAE,EAC1C1oB,EAAK,UAAY,IAAIyG,IAASzG,EAAK,MAAM2oB,GAAiB,GAAGliB,CAAI,CAAC,EAClEzG,EAAK,YAAc,IAAMA,EAAK,MAAM4oB,GAAkB,CAAE,EACxD5oB,EAAK,YAAc,IAAMA,EAAK,MAAM6oB,GAAkB,CAAE,EACxD7oB,EAAK,QAAU,IAAMA,EAAK,MAAM8oB,GAAc,CAAE,CACpD,CAAC,EACYC,GAA0B7d,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjF8nB,GAAgB,KAAK/nB,EAAMC,CAAG,EAC9B6nB,GAAW,KAAK9nB,EAAMC,CAAG,EACzBD,EAAK,MAASF,GAAWE,EAAK,MAAMgpB,GAAYC,GAAUnpB,CAAM,CAAC,EACjEE,EAAK,IAAOF,GAAWE,EAAK,MAAMkpB,GAAUC,GAAQrpB,CAAM,CAAC,EAC3DE,EAAK,IAAOF,GAAWE,EAAK,MAAMopB,GAAUC,GAAQvpB,CAAM,CAAC,EAC3DE,EAAK,MAASF,GAAWE,EAAK,MAAMspB,GAAYC,GAAUzpB,CAAM,CAAC,EACjEE,EAAK,KAAQF,GAAWE,EAAK,MAAMwpB,GAAWC,GAAS3pB,CAAM,CAAC,EAC9DE,EAAK,KAAQF,GAAWE,EAAK,MAAM0pB,GAAWC,GAAS7pB,CAAM,CAAC,EAC9DE,EAAK,OAAUF,GAAWE,EAAK,MAAM4pB,GAAaD,GAAS7pB,CAAM,CAAC,EAClEE,EAAK,OAAUF,GAAWE,EAAK,MAAM6pB,GAAaF,GAAS7pB,CAAM,CAAC,EAClEE,EAAK,OAAUF,GAAWE,EAAK,MAAM8pB,GAAaH,GAAS7pB,CAAM,CAAC,EAClEE,EAAK,OAAUF,GAAWE,EAAK,MAAM+pB,GAAaC,GAAWlqB,CAAM,CAAC,EACpEE,EAAK,KAAQF,GAAWE,EAAK,MAAMwpB,GAAWC,GAAS3pB,CAAM,CAAC,EAC9DE,EAAK,KAAQF,GAAWE,EAAK,MAAMiqB,GAAWC,GAASpqB,CAAM,CAAC,EAC9DE,EAAK,MAASF,GAAWE,EAAK,MAAMmqB,GAAYC,GAAUtqB,CAAM,CAAC,EACjEE,EAAK,KAAQF,GAAWE,EAAK,MAAMqqB,GAAWC,GAASxqB,CAAM,CAAC,EAC9DE,EAAK,OAAUF,GAAWE,EAAK,MAAMuqB,GAAaC,GAAW1qB,CAAM,CAAC,EACpEE,EAAK,UAAaF,GAAWE,EAAK,MAAMyqB,GAAgBC,GAAc5qB,CAAM,CAAC,EAC7EE,EAAK,IAAOF,GAAWE,EAAK,MAAM2qB,GAAUC,GAAQ9qB,CAAM,CAAC,EAC3DE,EAAK,MAASF,GAAWE,EAAK,MAAM6qB,GAAYC,GAAUhrB,CAAM,CAAC,EACjEE,EAAK,KAAQF,GAAWE,EAAK,MAAM+qB,GAAWC,GAASlrB,CAAM,CAAC,EAC9DE,EAAK,KAAQF,GAAWE,EAAK,MAAMirB,GAAWC,GAASprB,CAAM,CAAC,EAC9DE,EAAK,OAAUF,GAAWE,EAAK,MAAMmrB,GAAaC,GAAWtrB,CAAM,CAAC,EACpEE,EAAK,OAAUF,GAAWE,EAAK,MAAMqrB,GAAaC,GAAWxrB,CAAM,CAAC,EACpEE,EAAK,KAAQF,GAAWE,EAAK,MAAMurB,GAAWC,GAAS1rB,CAAM,CAAC,EAE9DE,EAAK,SAAYF,GAAWE,EAAK,MAAMyrB,GAAa3rB,CAAM,CAAC,EAC3DE,EAAK,KAAQF,GAAWE,EAAK,MAAM0rB,GAAS5rB,CAAM,CAAC,EACnDE,EAAK,KAAQF,GAAWE,EAAK,MAAM2rB,GAAS7rB,CAAM,CAAC,EACnDE,EAAK,SAAYF,GAAWE,EAAK,MAAM4rB,GAAa9rB,CAAM,CAAC,CAC/D,CAAC,EACM,SAAS4K,GAAO5K,EAAQ,CAC3B,OAAO+rB,GAAa9C,GAAWjpB,CAAM,CACzC,CACO,MAAMgsB,EAAgC5gB,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7F8rB,EAAsB,KAAK/rB,EAAMC,CAAG,EACpC6nB,GAAW,KAAK9nB,EAAMC,CAAG,CAC7B,CAAC,EACYgpB,GAAyB/d,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/E+rB,GAAe,KAAKhsB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYwpB,GAAwBve,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EgsB,GAAc,KAAKjsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY0pB,GAAwBze,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EisB,GAAc,KAAKlsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAeYkpB,GAAuBje,EAAkB,SAAU,CAAClL,EAAMC,IAAQ,CAE3EksB,GAAa,KAAKnsB,EAAMC,CAAG,EAC3B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAWYspB,GAAyBre,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/EmsB,GAAe,KAAKpsB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY+pB,GAA0B9e,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CAEjFosB,GAAgB,KAAKrsB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYiqB,GAAwBhf,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EqsB,GAAc,KAAKtsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYmqB,GAAyBlf,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/EssB,GAAe,KAAKvsB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYqqB,GAAwBpf,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EusB,GAAc,KAAKxsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY2qB,GAAuB1f,EAAkB,SAAU,CAAClL,EAAMC,IAAQ,CAE3EwsB,GAAa,KAAKzsB,EAAMC,CAAG,EAC3B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY6qB,GAAyB5f,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/EysB,GAAe,KAAK1sB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY+qB,GAAwB9f,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7E0sB,GAAc,KAAK3sB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAYYirB,GAAwBhgB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7E2sB,GAAc,KAAK5sB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYmrB,GAA0BlgB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjF4sB,GAAgB,KAAK7sB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYqrB,GAA0BpgB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjF6sB,GAAgB,KAAK9sB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYuqB,GAA0Btf,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CAEjF8sB,GAAgB,KAAK/sB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYyqB,GAA6Bxf,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CAEvF+sB,GAAmB,KAAKhtB,EAAMC,CAAG,EACjC6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYurB,GAAwBtgB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EgtB,GAAc,KAAKjtB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYopB,GAAuBne,EAAkB,SAAU,CAAClL,EAAMC,IAAQ,CAE3EitB,GAAa,KAAKltB,EAAMC,CAAG,EAC3B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EA0BYktB,GAA0BjiB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,uBACjFmtB,GAAgB,KAAKptB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWutB,GAA2BrtB,EAAM4F,EAAK6a,CAAY,EACvGzgB,EAAK,GAAK,CAACvU,EAAOqU,IAAWE,EAAK,MAAMstB,GAAU7hC,EAAOqU,CAAM,CAAC,EAChEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMutB,GAAW9hC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMutB,GAAW9hC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,GAAK,CAACvU,EAAOqU,IAAWE,EAAK,MAAMwtB,GAAU/hC,EAAOqU,CAAM,CAAC,EAChEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMytB,GAAWhiC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMytB,GAAWhiC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,IAAOF,GAAWE,EAAK,MAAM0tB,GAAI5tB,CAAM,CAAC,EAC7CE,EAAK,KAAQF,GAAWE,EAAK,MAAM0tB,GAAI5tB,CAAM,CAAC,EAC9CE,EAAK,SAAYF,GAAWE,EAAK,MAAMstB,GAAU,EAAGxtB,CAAM,CAAC,EAC3DE,EAAK,YAAeF,GAAWE,EAAK,MAAMutB,GAAW,EAAGztB,CAAM,CAAC,EAC/DE,EAAK,SAAYF,GAAWE,EAAK,MAAMwtB,GAAU,EAAG1tB,CAAM,CAAC,EAC3DE,EAAK,YAAeF,GAAWE,EAAK,MAAMytB,GAAW,EAAG3tB,CAAM,CAAC,EAC/DE,EAAK,WAAa,CAACvU,EAAOqU,IAAWE,EAAK,MAAM2tB,GAAkBliC,EAAOqU,CAAM,CAAC,EAChFE,EAAK,KAAO,CAACvU,EAAOqU,IAAWE,EAAK,MAAM2tB,GAAkBliC,EAAOqU,CAAM,CAAC,EAE1EE,EAAK,OAAS,IAAMA,EACpB,MAAMsL,EAAMtL,EAAK,KAAK,IACtBA,EAAK,UACDmG,EAAA,KAAK,KAAI7F,EAAAgL,EAAI,UAAJ,KAAAhL,EAAe,OAAO,mBAAmBG,EAAA6K,EAAI,mBAAJ,KAAA7K,EAAwB,OAAO,iBAAiB,IAAlG,KAAA0F,EAAuG,KAC3GnG,EAAK,UACDiG,EAAA,KAAK,KAAIC,EAAAoF,EAAI,UAAJ,KAAApF,EAAe,OAAO,mBAAmBE,EAAAkF,EAAI,mBAAJ,KAAAlF,EAAwB,OAAO,iBAAiB,IAAlG,KAAAH,EAAuG,KAC3GjG,EAAK,QAASqG,EAAAiF,EAAI,SAAJ,KAAAjF,EAAc,IAAI,SAAS,KAAK,GAAK,OAAO,eAAcL,EAAAsF,EAAI,aAAJ,KAAAtF,EAAkB,EAAG,EAC7FhG,EAAK,SAAW,GAChBA,EAAK,QAASsG,EAAAgF,EAAI,SAAJ,KAAAhF,EAAc,IAChC,CAAC,EACM,SAASuE,GAAO/K,EAAQ,CAC3B,OAAO8tB,GAAaT,GAAWrtB,CAAM,CACzC,CACO,MAAM+tB,GAAgC3iB,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7F6tB,GAAsB,KAAK9tB,EAAMC,CAAG,EACpCktB,GAAU,KAAKntB,EAAMC,CAAG,CAC5B,CAAC,EACM,SAASytB,GAAI5tB,EAAQ,CACxB,OAAOiuB,GAAUF,GAAiB/tB,CAAM,CAC5C,CAaO,MAAMkuB,GAA2B9iB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFguB,GAAiB,KAAKjuB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWouB,GAA4BluB,EAAM4F,EAAK6a,CAAY,CAC5G,CAAC,EACM,SAAS3V,GAAQhL,EAAQ,CAC5B,OAAOquB,GAAcH,GAAYluB,CAAM,CAC3C,CAwEO,MAAMsuB,GAA2BljB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFouB,GAAiB,KAAKruB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWwuB,GAAmD,CAC5G,CAAC,EACM,SAASC,IAAU,CACtB,OAAOC,GAAcJ,EAAU,CACnC,CACO,MAAMK,GAAyBvjB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EyuB,GAAe,KAAK1uB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW6uB,GAA0B3uB,EAAM4F,EAAK6a,CAAY,CAC1G,CAAC,EACM,SAASmO,GAAM9uB,EAAQ,CAC1B,OAAO+uB,GAAYJ,GAAU3uB,CAAM,CACvC,CAuBO,MAAMgvB,GAAyB5jB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/E8uB,GAAe,KAAK/uB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWkvB,GAA0BhvB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACtGE,EAAK,QAAUC,EAAI,QACnBD,EAAK,IAAM,CAACivB,EAAWnvB,IAAWE,EAAK,MAAMqoB,GAAiB4G,EAAWnvB,CAAM,CAAC,EAChFE,EAAK,SAAYF,GAAWE,EAAK,MAAMqoB,GAAiB,EAAGvoB,CAAM,CAAC,EAClEE,EAAK,IAAM,CAACkvB,EAAWpvB,IAAWE,EAAK,MAAMsoB,GAAiB4G,EAAWpvB,CAAM,CAAC,EAChFE,EAAK,OAAS,CAACvX,EAAKqX,IAAWE,EAAK,MAAMuoB,GAAc9/B,EAAKqX,CAAM,CAAC,EACpEE,EAAK,OAAS,IAAMA,EAAK,OAC7B,CAAC,EACM,SAASmnB,GAAMtJ,EAAS/d,EAAQ,CACnC,OAAOqvB,GAAYL,GAAUjR,EAAS/d,CAAM,CAChD,CAMO,MAAMsvB,GAA0BlkB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFovB,GAAmB,KAAKrvB,EAAMC,CAAG,EACjCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWwvB,GAA2BtvB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACvGsO,EAAgBpO,EAAM,QAAS,IACpBC,EAAI,KACd,EACDD,EAAK,MAAQ,IAAMuvB,GAAM,OAAO,KAAKvvB,EAAK,KAAK,IAAI,KAAK,CAAC,EACzDA,EAAK,SAAYqU,GAAarU,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAUqU,CAAQ,EAAE,EACjFrU,EAAK,YAAc,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAUuuB,GAAO,CAAE,EAAE,EAC7EvuB,EAAK,MAAQ,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAUuuB,GAAO,CAAE,EAAE,EACvEvuB,EAAK,OAAS,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAU4uB,GAAK,CAAE,EAAE,EACtE5uB,EAAK,MAAQ,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAU,MAAS,EAAE,EACvEA,EAAK,OAAUwvB,GACJC,GAAYzvB,EAAMwvB,CAAQ,EAErCxvB,EAAK,WAAcwvB,GACRE,GAAgB1vB,EAAMwvB,CAAQ,EAEzCxvB,EAAK,MAAS2vB,GAAUC,GAAW5vB,EAAM2vB,CAAK,EAC9C3vB,EAAK,KAAQmE,GAAS0rB,GAAU7vB,EAAMmE,CAAI,EAC1CnE,EAAK,KAAQmE,GAAS2rB,GAAU9vB,EAAMmE,CAAI,EAC1CnE,EAAK,QAAU,IAAIyG,IAASspB,GAAaC,GAAahwB,EAAMyG,EAAK,CAAC,CAAC,EACnEzG,EAAK,SAAW,IAAIyG,IAASwpB,GAAcC,GAAgBlwB,EAAMyG,EAAK,CAAC,CAAC,CAC5E,CAAC,EACM,SAASvE,GAAO6B,EAAOjE,EAAQ,CAClC,MAAMG,EAAMqD,EAAA,CACR,KAAM,SACN,MAAOS,GAAA,KAAAA,EAAS,CAAA,GACbwV,EAAqBzZ,CAAM,GAElC,OAAO,IAAIsvB,GAAUnvB,CAAG,CAC5B,CAmBO,MAAMkwB,GAAyBjlB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EmwB,GAAe,KAAKpwB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWuwB,GAA0BrwB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACtGE,EAAK,QAAUC,EAAI,OACvB,CAAC,EACM,SAASmnB,GAAM7pB,EAASuC,EAAQ,CACnC,OAAO,IAAIqwB,GAAS7sB,EAAA,CAChB,KAAM,QACN,QAAS/F,GACNgc,EAAqBzZ,CAAM,EACjC,CACL,CA+BO,MAAMwwB,GAAgCplB,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7FswB,GAAsB,KAAKvwB,EAAMC,CAAG,EACpCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW0wB,GAAiCxwB,EAAM4F,EAAK6a,EAAM3gB,CAAM,CACjH,CAAC,EACM,SAASunB,GAAarwB,EAAMgf,EAAO,CACtC,OAAO,IAAIsa,GAAgB,CACvB,KAAM,eACN,KAAMt5B,EACN,MAAOgf,CACf,CAAK,CACL,CAqBO,MAAMya,GAA0BvlB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFywB,GAAgB,KAAK1wB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW6wB,GAA2B3wB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACvGE,EAAK,QAAUC,EAAI,QACnBD,EAAK,UAAYC,EAAI,SACzB,CAAC,EACM,SAAS2wB,GAAOzO,EAAS0O,EAAW/wB,EAAQ,CAC/C,OAAO,IAAI2wB,GAAUntB,EAAA,CACjB,KAAM,SACN,QAAA6e,EACA,UAAW0O,GACRtX,EAAqBzZ,CAAM,EACjC,CACL,CAwDO,MAAMgxB,GAAwB5lB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7E8wB,GAAc,KAAK/wB,EAAMC,CAAG,EAC5BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWkxB,GAAyBhxB,EAAM4F,EAAK6a,CAAY,EACrGzgB,EAAK,KAAOC,EAAI,QAChBD,EAAK,QAAU,OAAO,OAAOC,EAAI,OAAO,EACxC,MAAMG,EAAO,IAAI,IAAI,OAAO,KAAKH,EAAI,OAAO,CAAC,EAC7CD,EAAK,QAAU,CAACgX,EAAQlX,IAAW,CAC/B,MAAMmxB,EAAa,CAAA,EACnB,UAAWxlC,KAASurB,EAChB,GAAI5W,EAAK,IAAI3U,CAAK,EACdwlC,EAAWxlC,CAAK,EAAIwU,EAAI,QAAQxU,CAAK,MAGrC,OAAM,IAAI,MAAM,OAAOA,CAAK,oBAAoB,EAExD,OAAO,IAAIqlC,GAAQjtB,EAAAP,EAAAO,EAAAP,EAAA,GACZrD,GADY,CAEf,OAAQ,CAAA,IACLsZ,EAAqBzZ,CAAM,GAHf,CAIf,QAASmxB,CACrB,EAAS,CACL,EACAjxB,EAAK,QAAU,CAACgX,EAAQlX,IAAW,CAC/B,MAAMmxB,EAAa3tB,EAAA,GAAKrD,EAAI,SAC5B,UAAWxU,KAASurB,EAChB,GAAI5W,EAAK,IAAI3U,CAAK,EACd,OAAOwlC,EAAWxlC,CAAK,MAGvB,OAAM,IAAI,MAAM,OAAOA,CAAK,oBAAoB,EAExD,OAAO,IAAIqlC,GAAQjtB,EAAAP,EAAAO,EAAAP,EAAA,GACZrD,GADY,CAEf,OAAQ,CAAA,IACLsZ,EAAqBzZ,CAAM,GAHf,CAIf,QAASmxB,CACrB,EAAS,CACL,CACJ,CAAC,EACD,SAAS1B,GAAMvY,EAAQlX,EAAQ,CAC3B,MAAMkB,EAAU,MAAM,QAAQgW,CAAM,EAAI,OAAO,YAAYA,EAAO,IAAKppB,GAAM,CAACA,EAAGA,CAAC,CAAC,CAAC,EAAIopB,EACxF,OAAO,IAAI8Z,GAAQxtB,EAAA,CACf,KAAM,OACN,QAAAtC,GACGuY,EAAqBzZ,CAAM,EACjC,CACL,CAgBO,MAAMoxB,GAA2BhmB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFkxB,GAAiB,KAAKnxB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWsxB,GAA4BpxB,EAAM4F,EAAK6a,CAAY,EACxGzgB,EAAK,OAAS,IAAI,IAAIC,EAAI,MAAM,EAChC,OAAO,eAAeD,EAAM,QAAS,CACjC,KAAM,CACF,GAAIC,EAAI,OAAO,OAAS,EACpB,MAAM,IAAI,MAAM,4EAA4E,EAEhG,OAAOA,EAAI,OAAO,CAAC,CACvB,CACR,CAAK,CACL,CAAC,EACM,SAASoxB,GAAQ5lC,EAAOqU,EAAQ,CACnC,OAAO,IAAIoxB,GAAW5tB,EAAA,CAClB,KAAM,UACN,OAAQ,MAAM,QAAQ7X,CAAK,EAAIA,EAAQ,CAACA,CAAK,GAC1C8tB,EAAqBzZ,CAAM,EACjC,CACL,CAYO,MAAMwxB,GAA6BpmB,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFsxB,GAAmB,KAAKvxB,EAAMC,CAAG,EACjCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW0xB,GAA8BxxB,EAAM4F,CAAiB,EAC1G5F,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,GAAIA,EAAK,YAAc,WACnB,MAAM,IAAIkQ,GAAqB1X,EAAK,YAAY,IAAI,EAExDuL,EAAQ,SAAY/E,GAAU,WAC1B,GAAI,OAAOA,GAAU,SACjB+E,EAAQ,OAAO,KAAKwN,GAAWvS,EAAO+E,EAAQ,MAAOtL,CAAG,CAAC,MAExD,CAED,MAAMge,EAASzX,EACXyX,EAAO,QACPA,EAAO,SAAW,KACtB3d,EAAA2d,EAAO,OAAP,OAAgBA,EAAO,KAAO,WAC9Bxd,EAAAwd,EAAO,QAAP,OAAiBA,EAAO,MAAQ1S,EAAQ,QACxCpF,EAAA8X,EAAO,OAAP,OAAgBA,EAAO,KAAOje,GAE9BuL,EAAQ,OAAO,KAAKwN,GAAWkF,CAAM,CAAC,CAC1C,CACJ,EACA,MAAMrG,EAAS3X,EAAI,UAAUsL,EAAQ,MAAOA,CAAO,EACnD,OAAIqM,aAAkB,QACXA,EAAO,KAAMA,IAChBrM,EAAQ,MAAQqM,EACTrM,EACV,GAELA,EAAQ,MAAQqM,EACTrM,EACX,CACJ,CAAC,EACM,SAASgc,GAAU/mB,EAAI,CAC1B,OAAO,IAAI8wB,GAAa,CACpB,KAAM,YACN,UAAW9wB,CACnB,CAAK,CACL,CACO,MAAMwvB,GAA4B9kB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFwxB,GAAkB,KAAKzxB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW4xB,GAA6B1xB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAAS+mB,GAAS/D,EAAW,CAChC,OAAO,IAAIgN,GAAY,CACnB,KAAM,WACN,UAAWhN,CACnB,CAAK,CACL,CACO,MAAM2O,GAAiCzmB,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAC/F2xB,GAAuB,KAAK5xB,EAAMC,CAAG,EACrCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW4xB,GAA6B1xB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASgnB,GAAchE,EAAW,CACrC,OAAO,IAAI2O,GAAiB,CACxB,KAAM,WACN,UAAW3O,CACnB,CAAK,CACL,CACO,MAAM6O,GAA4B3mB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrF6xB,GAAkB,KAAK9xB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWiyB,GAA6B/xB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASinB,GAASjE,EAAW,CAChC,OAAO,IAAI6O,GAAY,CACnB,KAAM,WACN,UAAW7O,CACnB,CAAK,CACL,CAKO,MAAMgP,GAA2B9mB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFgyB,GAAiB,KAAKjyB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWoyB,GAA4BlyB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACxGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,UAClCA,EAAK,cAAgBA,EAAK,MAC9B,CAAC,EACM,SAASwnB,GAASxE,EAAWmP,EAAc,CAC9C,OAAO,IAAIH,GAAW,CAClB,KAAM,UACN,UAAWhP,EACX,IAAI,cAAe,CACf,OAAO,OAAOmP,GAAiB,WAAaA,EAAY,EAAKC,GAAkBD,CAAY,CAC/F,CACR,CAAK,CACL,CACO,MAAME,GAA4BnnB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFqyB,GAAkB,KAAKtyB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWyyB,GAA6BvyB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASynB,GAASzE,EAAWmP,EAAc,CAC9C,OAAO,IAAIE,GAAY,CACnB,KAAM,WACN,UAAWrP,EACX,IAAI,cAAe,CACf,OAAO,OAAOmP,GAAiB,WAAaA,EAAY,EAAKC,GAAkBD,CAAY,CAC/F,CACR,CAAK,CACL,CACO,MAAMjC,GAA+BhlB,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3FuyB,GAAqB,KAAKxyB,EAAMC,CAAG,EACnCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW2yB,GAAgCzyB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EAC5GE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASknB,GAAYlE,EAAWljB,EAAQ,CAC3C,OAAO,IAAIowB,GAAe5sB,EAAA,CACtB,KAAM,cACN,UAAW0f,GACRzJ,EAAqBzZ,CAAM,EACjC,CACL,CAaO,MAAM4yB,GAAyBxnB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/E0yB,GAAe,KAAK3yB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW8yB,GAA0B5yB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACtGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,UAClCA,EAAK,YAAcA,EAAK,MAC5B,CAAC,EACD,SAAS0nB,GAAO1E,EAAWF,EAAY,CACnC,OAAO,IAAI4P,GAAS,CAChB,KAAM,QACN,UAAW1P,EACX,WAAa,OAAOF,GAAe,WAAaA,EAAa,IAAMA,CAC3E,CAAK,CACL,CAUO,MAAM+P,GAAwB3nB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7E6yB,GAAc,KAAK9yB,EAAMC,CAAG,EAC5BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWizB,GAAyB/yB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACrGE,EAAK,GAAKC,EAAI,GACdD,EAAK,IAAMC,EAAI,GACnB,CAAC,EACM,SAASqnB,GAAK0L,EAAK32B,EAAK,CAC3B,OAAO,IAAIw2B,GAAQ,CACf,KAAM,OACN,GAAIG,EACJ,IAAK32B,CAEb,CAAK,CACL,CAcO,MAAM42B,GAA4B/nB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFizB,GAAkB,KAAKlzB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWqzB,GAA6BnzB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAAS2nB,GAAS3E,EAAW,CAChC,OAAO,IAAIiQ,GAAY,CACnB,KAAM,WACN,UAAWjQ,CACnB,CAAK,CACL,CAkDO,MAAMoQ,GAA0BloB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFozB,GAAgB,KAAKrzB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWwzB,GAA2BtzB,EAAM4F,CAAiB,CAC3G,CAAC,EAaM,SAAS+gB,GAAOnmB,EAAIoD,EAAU,GAAI,CACrC,OAAO2vB,GAAaH,GAAW5yB,EAAIoD,CAAO,CAC9C,CAEO,SAASijB,GAAYrmB,EAAI,CAC5B,OAAOgzB,GAAkBhzB,CAAE,CAC/B,CCtlCA,MAAMizB,GAAwBC,GACpB,CACN,SAAUC,GAAO,CAAC,aAAc,YAAY,CAAC,EAAE,SAAA,EAC/C,uBAAwBC,GAAE,EAAU,SAAA,EACpC,yBAA0BA,GAAE,EAAU,SAAA,EAAW,QAAQ,EAAI,EAC7D,oBAAqBA,GAAE,EAAU,SAAA,EACjC,sBAAuBA,GAAE,EAAU,SAAA,CACrC,CAAC,EACA,IACCC,GAAQ,CACNH,GAAS,CACP,UAAWI,GAAU,OAAO,EAC5B,MAAOC,GAAE,EAAS,SAAA,EAClB,QAASJ,GAAO,CAAC,YAAa,WAAY,eAAe,CAAC,EAC1D,UAAWA,GACH,CAAC,MAAO,OAAQ,QAAS,SAAU,cAAe,sBAAsB,CAAC,EAC9E,SAAA,EACH,gBAAiBK,GAEbN,GAAS,CACP,KAAMK,GAAE,EACR,SAAUC,GAAQD,IAAU,CAAA,CAC7B,CAAA,EAEF,SAAA,EACH,uBAAwBH,GAAE,EAAU,SAAA,EACpC,uBAAwBA,GAAE,EAAU,SAAA,EACpC,2BAA4BA,GAAE,EAAU,SAAA,EACxC,0BAA2BA,GAAE,EAAU,SAAA,EACvC,uBAAwBA,GAAE,EAAU,SAAA,EAEpC,gBAAiBA,GAAE,EAAU,SAAA,EAC7B,mBAAoBK,GAAE,EAAS,SAAA,EAC/B,IAAKF,GAAE,EAAS,IAAA,EAAM,SAAA,EACtB,gBAAiBG,GAASH,GAAE,EAAUI,GAAE,CAAS,EAAE,SAAA,EACnD,eAAgBJ,GAAE,EAAS,SAAA,CAAS,CACrC,EACDL,GAAS,CACP,UAAWI,GAAU,MAAM,EAC3B,QAASH,GAAO,CAAC,YAAa,gBAAiB,UAAU,CAAC,EAC1D,kBAAmBC,GAAE,EAAU,SAAA,CAAS,CACzC,CAAA,CACF,CACH,EAmCWQ,GAAoBt5B,GAAkC,CACjE,MAAMu5B,EAAYZ,GAAsB,UAAU34B,CAAG,EAErD,GAAIu5B,EAAU,UAAY,GAAO,CAC/B,MAAMn1B,EAAQ,IAAI,MAAM,0BAA0B,EAClD,MAAAA,EAAM,MAAQm1B,EAAU,MAClBn1B,CACR,CAEA,OAAOm1B,EAAU,IACnB,ECtFaC,GAAmB,CAC9BlmC,EACAmmC,IACqB,CACrB,GAAInmC,EAAK,KAAOmmC,EACd,OAAOnmC,EAGT,GAAI,aAAcA,EAChB,UAAWomC,KAASpmC,EAAK,SAAU,CACjC,MAAMqmC,EAAQH,GAAiBE,EAAOD,CAAY,EAClD,GAAIE,EACF,OAAOA,CAEX,CAGF,OAAO,IACT,ECnBMC,OAA6C,IAAI,CACrD,QACA,WACA,YACA,gBACA,OACF,CAAC,EA4BYC,GAA0B,CACrCC,EACAC,EACAt3B,EAEI,CAAE,yBAA0B,MACC,CACjC,MAAMk3B,EAAQH,GAAiBM,EAAO,SAAUC,CAAM,EAGtD,GAAI,CAACJ,EACH,MAAO,CACL,QAAS,GACT,OAAQ,oCAAA,EAKZ,GAAIA,EAAM,OAAS,SAAU,CAC3B,MAAMK,EAAqBL,EAAM,SAAS,OAAQD,GAChDE,GAAe,IAAIF,EAAM,IAAI,CAAA,EAG/B,OAAIM,EAAmB,SAAW,EACzB,CACL,QAAS,GACT,OAAQ,gDAAA,EAIRA,EAAmB,SAAW,EACzB,CACL,QAAS,GACT,KAAMA,EAAmB,CAAC,EAC1B,KAAM,6EAAA,EAINv3B,EAAQ,yBACH,CACL,QAAS,GACT,KAAMu3B,EAAmB,CAAC,EAC1B,KAAM,wFAAA,EAIH,CACL,QAAS,GACT,OAAQ,gDAAA,CAEZ,CAGA,OAAKJ,GAAe,IAAID,EAAM,IAAI,EAQ3B,CAAE,QAAS,GAAM,KAAMA,CAAA,EAPrB,CACL,QAAS,GACT,OAAQ,qCAAA,CAMd,2LCnGC,SAAUM,EAAQC,EAAS,CACuCC,EAAA,QAAiBD,GAGpF,GAAGE,IAAO,UAAY,CAElB,IAAIC,EAAgB,OAAO,SAAY,WACnCC,GAAgB,SAAUC,EAAK,CAC/B,GAAI,OAAO,YAAe,SACtB,OAAO,WAEX,OAAO,eAAeA,EAAK,yBAA0B,CACjD,IAAK,UAAe,CAChB,OAAO,IACvB,EACY,aAAc,EAC1B,CAAS,EACD,IAAIN,GAAS,uBACb,cAAOM,EAAI,uBACJN,EACf,GAAO,OAAO,SAAS,EACfO,EAAe,OAAO,QAAW,YACjCC,EAAY,OAAO,KAAQ,YAC3BC,EAAY,OAAO,KAAQ,YAC3BC,EAAgB,OAAO,SAAY,YACnCC,EAAgB,OAAO,SAAY,YACnCC,EAAiB,OAAO,UAAa,YACrCC,EAAuBN,GAAgB,OAAO,OAAO,UAAa,YAClEO,EAA0BP,GAAgB,OAAO,OAAO,aAAgB,YACxEQ,EAAmBN,GAAa,OAAO,IAAI,UAAU,SAAY,WACjEO,EAAmBR,GAAa,OAAO,IAAI,UAAU,SAAY,WACjES,EAAuBF,GAAoB,OAAO,eAAe,IAAI,IAAG,EAAG,SAAS,EACpFG,EAAuBF,GAAoB,OAAO,eAAe,IAAI,IAAG,EAAG,SAAS,EACpFG,EAAsBN,GAAwB,OAAO,MAAM,UAAU,OAAO,QAAQ,GAAM,WAC1FO,EAAyBD,GAAuB,OAAO,eAAe,CAAA,EAAG,OAAO,QAAQ,GAAG,EAC3FE,EAAuBR,GAAwB,OAAO,OAAO,UAAU,OAAO,QAAQ,GAAM,WAC5FS,EAA0BD,GAAwB,OAAO,eAAe,GAAG,OAAO,QAAQ,GAAG,EAC7FE,EAA0B,EAC1BC,EAA2B,GAC/B,SAASC,EAAW17B,EAAK,CACrB,IAAI27B,GAAY,OAAO37B,EACvB,GAAI27B,KAAc,SACd,OAAOA,GAEX,GAAI37B,IAAQ,KACR,MAAO,OAEX,GAAIA,IAAQs6B,EACR,MAAO,SAEX,GAAI,MAAM,QAAQt6B,CAAG,IAChB+6B,IAA4B,IAAS,EAAE,OAAO,eAAe/6B,IAC9D,MAAO,QAEX,GAAI,OAAO,QAAW,UAAY,SAAW,KAAM,CAC/C,GAAI,OAAO,OAAO,UAAa,UAAYA,IAAQ,OAAO,SACtD,MAAO,WAEX,GAAI,OAAO,OAAO,UAAa,UAAYA,IAAQ,OAAO,SACtD,MAAO,WAEX,GAAI,OAAO,OAAO,WAAc,SAAU,CACtC,GAAI,OAAO,OAAO,UAAU,WAAc,UACtCA,IAAQ,OAAO,UAAU,UACzB,MAAO,gBAEX,GAAI,OAAO,OAAO,UAAU,SAAY,UACpCA,IAAQ,OAAO,UAAU,QACzB,MAAO,aAE3B,CACY,IAAK,OAAO,OAAO,aAAgB,YAC/B,OAAO,OAAO,aAAgB,WAC9BA,aAAe,OAAO,YAAa,CACnC,GAAIA,EAAI,UAAY,aAChB,MAAO,mBAEX,GAAIA,EAAI,UAAY,KAChB,MAAO,2BAEX,GAAIA,EAAI,UAAY,KAChB,MAAO,4BAE3B,CACA,CACQ,IAAI47B,GAAab,GAA2B/6B,EAAI,OAAO,WAAW,EAClE,GAAI,OAAO47B,IAAc,SACrB,OAAOA,GAEX,IAAIC,EAAe,OAAO,eAAe77B,CAAG,EAC5C,OAAI67B,IAAiB,OAAO,UACjB,SAEPA,IAAiB,KAAK,UACf,OAEPxB,GAAiBwB,IAAiB,QAAQ,UACnC,UAEPnB,GAAamB,IAAiB,IAAI,UAC3B,MAEPpB,GAAaoB,IAAiB,IAAI,UAC3B,MAEPjB,GAAiBiB,IAAiB,QAAQ,UACnC,UAEPlB,GAAiBkB,IAAiB,QAAQ,UACnC,UAEPhB,GAAkBgB,IAAiB,SAAS,UACrC,WAEPpB,GAAaoB,IAAiBV,EACvB,eAEPT,GAAamB,IAAiBX,EACvB,eAEPE,GAAuBS,IAAiBR,EACjC,iBAEPC,GAAwBO,IAAiBN,EAClC,kBAEPM,IAAiB,KACV,SAEJ,OACF,UACA,SACA,KAAK77B,CAAG,EACR,MAAMw7B,EAAyBC,CAAwB,CACpE,CAEI,OAAOC,CAEX,kDC1IMI,GAAiB,OAAO,QAAW,YACnCC,GAAqBD,IAAkB,OAAO,OAAO,MAAS,YAEvDE,GAAWF,GAOpB,SAAkBnrC,EAAO,CACvB,OAAO,OAAO,SAASA,CAAK,CAC9B,EAQA,UAAoB,CAClB,MAAO,EACT,EAES6N,GAAOu9B,GAOhB,SAAcprC,EAAO,CACnB,OAAO,OAAO,KAAKA,CAAK,CAC1B,EACAmrC,GASA,SAAcnrC,EAAO,CACnB,OAAO,IAAI,OAAOA,CAAK,CACzB,EASA,SAAcA,EAAO,CACnB,OAAOA,CACT,EC9CG,SAASsrC,GAAWtrC,EAAO,CAGhC,OAAIqrC,GAASrrC,CAAK,EACT,SAGF+qC,GAAW/qC,CAAK,CACzB,CCbA,MAAMurC,GAAoB,IAAI,IAAI,CAChC,YACA,QACA,MACA,SACA,KACF,CAAC,EAUM,SAASC,GAAIC,EAAYn8B,EAAKo8B,EAAO,KAAM,CAGhD,OAFkBA,GAAQJ,GAAWG,CAAU,EAE9B,CACf,IAAK,YACL,IAAK,QACL,IAAK,SACH,OAAOA,EAAWn8B,CAAG,EACvB,IAAK,MACH,OAAOm8B,EAAW,IAAIn8B,CAAG,EAC3B,IAAK,MAGH,OAAOA,CAEb,CACA,CAOO,SAASq8B,GAAaD,EAAM,CACjC,OAAOH,GAAkB,IAAIG,CAAI,CACnC,CAWO,SAASE,GAAIH,EAAYn8B,EAAKtP,EAAO0rC,EAAO,KAAM,CAGvD,OAFkBA,GAAQJ,GAAWG,CAAU,EAE9B,CACf,IAAK,YACL,IAAK,QACL,IAAK,SACHA,EAAWn8B,CAAG,EAAItP,EAClB,MACF,IAAK,MACHyrC,EAAW,IAAIn8B,EAAKtP,CAAK,EACzB,MACF,IAAK,MACHyrC,EAAW,IAAIzrC,CAAK,EACpB,KAEN,CAEE,OAAOyrC,CACT,CC5EA,MAAMI,GACJ,OAAO,YAAe,aACtB,aAAe,MACf,WAAW,SAAW,QACtB,WAEIC,GACJ,OAAO,QAAW,aAClB,SAAW,MACX,OAAO,SAAW,QAClB,OAEIC,GACJ,OAAO,MAAS,aAChB,OAAS,MACT,KAAK,SAAW,QAChB,KAEWpC,GACXkC,IAAkBC,IAAcC,IAAY,SAAS,aAAa,EAAC,ECVrE,SAASC,GAAgBhsC,EAAO,CAC9B,OAAOA,EAAM,MAAM,CAAC,CACtB,CAQA,SAASisC,GAAYjsC,EAAO,CAC1B,OAAO,IAAI,QAAQA,EAAM,SAAS,CACpC,CAQA,SAASksC,GAAalsC,EAAO,CAE3B,OAAO,IAAI,SAASA,EAAM,MAAM,CAClC,CAQA,SAASmsC,GAAWnsC,EAAO,CACzB,OAAOosC,GAAYpsC,CAAK,CAC1B,CAQA,SAASqsC,GAASrsC,EAAO,CACvB,OAAO,IAAI,KAAKA,EAAM,SAAS,CACjC,CAQA,SAASssC,GAAWtsC,EAAO,CACzB,OAAO,IAAI,OAAOA,CAAK,CACzB,CAQA,SAASusC,GAAWvsC,EAAO,CACzB,OAAO,IAAI,OAAOA,EAAM,OAAQA,EAAM,KAAK,CAC7C,CAQA,SAASwsC,GAAWxsC,EAAO,CACzB,OAAO,IAAI,OAAOA,CAAK,CACzB,CAQA,SAASysC,GAAezsC,EAAO0rC,EAAM,CAGnC,OAFmB/B,GAAa+B,CAAI,EAErB,KACN/B,GAAa+B,CAAI,EAAE,KAAK1rC,CAAK,EAG/B,IAAI2pC,GAAa+B,CAAI,EAAE1rC,CAAK,CACrC,CAQA,SAAS0sC,EAAY1sC,EAAO,CAC1B,OAAOA,CACT,CAOA,SAAS2sC,IAAgB,CACvB,MAAO,CAAA,CACT,CAOA,SAASC,IAAc,CACrB,OAAO,IAAI,GACb,CAOA,SAASC,IAAiB,CACxB,MAAO,CAAA,CACT,CAOA,SAASC,IAAc,CACrB,OAAO,IAAI,GACb,CAEA,MAAAC,GAAe,IAAI,IAAI,CAErB,CAAC,cAAef,EAAe,EAC/B,CAAC,UAAWC,EAAW,EACvB,CAAC,SAAUE,EAAU,EACrB,CAAC,WAAYD,EAAY,EACzB,CAAC,OAAQG,EAAQ,EACjB,CAAC,SAAUC,EAAU,EACrB,CAAC,SAAUC,EAAU,EACrB,CAAC,SAAUC,EAAU,EAIrB,CAAC,eAAgBC,EAAc,EAC/B,CAAC,eAAgBA,EAAc,EAC/B,CAAC,aAAcA,EAAc,EAC7B,CAAC,aAAcA,EAAc,EAC7B,CAAC,YAAaA,EAAc,EAC5B,CAAC,cAAeA,EAAc,EAC9B,CAAC,cAAeA,EAAc,EAC9B,CAAC,aAAcA,EAAc,EAC7B,CAAC,oBAAqBA,EAAc,EAGpC,CAAC,iBAAkBC,CAAW,EAC9B,CAAC,eAAgBA,CAAW,EAC5B,CAAC,UAAWA,CAAW,EACvB,CAAC,eAAgBA,CAAW,EAC5B,CAAC,kBAAmBA,CAAW,EAC/B,CAAC,WAAYA,CAAW,EACxB,CAAC,SAAUA,CAAW,EAEtB,CAAC,UAAWA,CAAW,EACvB,CAAC,UAAWA,CAAW,EAGvB,CAAC,UAAWA,CAAW,EACvB,CAAC,OAAQA,CAAW,EACpB,CAAC,SAAUA,CAAW,EACtB,CAAC,SAAUA,CAAW,EACtB,CAAC,SAAUA,CAAW,EACtB,CAAC,YAAaA,CAAW,EAIzB,CAAC,YAAaC,EAAa,EAC3B,CAAC,QAASA,EAAa,EACvB,CAAC,MAAOC,EAAW,EACnB,CAAC,SAAUC,EAAc,EACzB,CAAC,MAAOC,EAAW,CAarB,CAAC,EC1MD,SAASE,IAAO,CAAC,CAUV,SAASn/B,GAAK7N,EAAO0rC,EAAO,KAAMuB,EAAaD,GAAM,CACtD,UAAU,SAAW,GAAK,OAAOtB,GAAS,aAC5CuB,EAAavB,EACbA,EAAO,MAGT,MAAMtG,EAAYsG,GAAQJ,GAAWtrC,CAAK,EACpCktC,EAAeH,GAAQ,IAAI3H,CAAS,EAE1C,GAAIA,IAAc,SAAU,CAC1B,MAAMv1B,EAASo9B,EAAWjtC,EAAOolC,CAAS,EAE1C,GAAIv1B,IAAW,OACb,OAAOA,CAEX,CAGA,OAAOq9B,EAAeA,EAAaltC,EAAOolC,CAAS,EAAIplC,CACzD,CCxBe,SAASmtC,GAASntC,EAAO8R,EAAU,GAAI,CAChD,OAAOA,GAAY,aACrBA,EAAU,CACR,WAAYA,CAClB,GAGE,KAAM,CAEJ,WAAAm7B,CAGJ,EAAMn7B,EAEEszB,EAAYkG,GAAWtrC,CAAK,EAElC,GAAI,CAAC2rC,GAAavG,CAAS,EACzB,OAAOgI,GAAcptC,EAAO,KAAM,KAAM,IAAgB,EAG1D,MAAMqtC,EAAcx/B,GAAK7N,EAAOolC,EAAW6H,CAAU,EAE/CK,EAAa,IAAI,QAAQ,CAAC,CAACttC,EAAOqtC,CAAW,CAAC,CAAC,EAC/CE,EAAU,IAAI,QAAQ,CAACvtC,CAAK,CAAC,EAEnC,OAAOotC,GAAcptC,EAAOqtC,EAAaC,EAAYC,CAAmB,CAC1E,CAYA,SAASH,GAAcptC,EAAOgY,EAAOs1B,EAAYC,EAASN,EAAY,CACpE,MAAMvB,EAAOJ,GAAWtrC,CAAK,EACvBqtC,EAAcx/B,GAAK7N,EAAO0rC,CAAI,EAGpC,GAAI,CAACC,GAAaD,CAAI,EACpB,OAAO2B,EAGT,IAAI14B,EAEJ,OAAQ+2B,EAAI,CACV,IAAK,YACL,IAAK,QACH/2B,EAAO,OAAO,KAAK3U,CAAK,EACxB,MACF,IAAK,SACH2U,EAAO,OAAO,KAAK3U,CAAK,EACxB2U,EAAK,KAAK,GAAG,OAAO,sBAAsB3U,CAAK,CAAC,EAChD,MACF,IAAK,MACL,IAAK,MACH2U,EAAO3U,EAAM,KAAI,EACjB,KAEN,CAGE,QAASwtC,KAAiB74B,EAAM,CAC9B,MAAM84B,EAAkBjC,GAAIxrC,EAAOwtC,EAAe9B,CAAI,EAEtD,GAAI6B,EAAQ,IAAIE,CAAe,EAE7B7B,GAAI5zB,EAAOw1B,EAAeF,EAAW,IAAIG,CAAe,EAAG/B,CAAI,MAC1D,CACL,MAAMgC,EAAsBpC,GAAWmC,CAAe,EAChDE,EAAwB9/B,GAAK4/B,EAAiBC,CAAmB,EAGnE/B,GAAa+B,CAAmB,IAClCJ,EAAW,IAAIG,EAAiBE,CAAqB,EACrDJ,EAAQ,IAAIE,CAAe,GAG7B7B,GACE5zB,EACAw1B,EACAJ,GACEK,EACAE,EACAL,EACAC,CAEF,EACA7B,CACR,CACI,CACF,CAIA,OAAO1zB,CACT,2BC5DA,MAAM41B,EAAa,CAMjB,YAAY,CACV,MAAAC,EAAQ,WAAW,MAAM,KAAK,UAAU,EACxC,YAAAC,EAAc,yBACd,eAAAC,EAAiB,CAAA,CAAC,EACS,GAAI,CAVnCC,GAAA,KAAAC,GACED,GAAA,KAAAE,IACAF,GAAA,KAAAG,IACAH,GAAA,KAAAI,IACAJ,GAAA,KAAAK,GAOEC,EAAA,KAAKJ,GAAeJ,GACpBQ,EAAA,KAAKH,GAASN,GACdS,EAAA,KAAKD,EAAkBN,GACvBO,EAAA,KAAKF,GAAeG,EAAA,KAAKF,IAErBN,EAAe,OACjBS,EAAA,KAAKP,EAAAQ,IAAL,UAAuBV,EAAe,MAE1C,CAEA,iBAAkB,CAChB,MAAO,EAAQQ,EAAA,KAAKF,GAAgB,KACtC,CAEA,qBAAqBv8B,EAAkB,CACjCA,EAAQ,OACV08B,EAAA,KAAKP,EAAAQ,IAAL,UAAuB38B,EAAQ,OAGjCw8B,EAAA,KAAKD,EAAkBx2B,IAAA,GAClB02B,EAAA,KAAKF,IACLv8B,IAELw8B,EAAA,KAAKF,GAAeG,EAAA,KAAKF,GAC3B,CAEA,YAAYv8B,EAAkB,CAC5B,OAAAw8B,EAAA,KAAKF,GAAev2B,MAAA,GACf02B,EAAA,KAAKF,IACLE,EAAA,KAAKH,KACLt8B,IAGE,IACT,CAQA,WAAWwU,EAAgB,CACzB,MAAMooB,EAAkC,CACtC,eAAgB,kBAAA,EAGZC,EAAaroB,GAAA,KAAAA,EAASioB,EAAA,KAAKF,GAAgB,MACjD,GAAIM,GAAA,MAAAA,EAAY,WAAW,SACzBD,EAAQ,eAAe,EAAIC,UAClBA,GAAA,MAAAA,EAAY,WAAW,SAChCD,EAAQ,cAAmB,UAAUC,CAAU,OAE/C,OAAM,IAAI37B,GAGZ,OAAO07B,CACT,CAgIM,QAAQE,EAQX,QAAAtyB,EAAA,yBARW,CACZ,QAAAuyB,EACA,QAAAC,EAAU,CAAA,EACV,MAAAhtC,CAAA,EAKC,CACD,MAAMitC,EAAkB,IAAI,gBAAgB,CAC1C,YAAa,qBACb,SAAU,OAAA,CACX,EAEGD,EAAQ,OAAS,GACnBC,EAAgB,OAAO,MAAOD,EAAQ,KAAK,GAAG,CAAC,EAG7ChtC,GACFitC,EAAgB,OAAO,QAAS,GAAGjtC,CAAK,EAAE,EAG5C,MAAMktC,EAAcD,EAAgB,SAAA,EAE9BtrB,EAAM,YAAYorB,CAAO,IAAIG,CAAW,GAG9C,OAFiB,MAAMR,EAAA,KAAKP,EAAAgB,IAAL,UAA2BxrB,EAGpD,GAEM,cAAkEmrB,EAgBtE,QAAAtyB,EAAA,yBAhBsE,CACtE,QAAAuyB,EACA,QAAAC,EACA,MAAAI,EAAQ,EACR,GAAAC,EAAK,cACL,OAAAla,EAAS,KAAA,EAWT,CAKA,MAAMma,GAJc,MAAMZ,EAAA,KAAKP,EAAAgB,IAAL,UACxB,aAAaJ,CAAO,QAAQC,CAAO,WAAW7Z,CAAM,UAAUia,CAAK,KAG1C,OAE3B,GAAIC,IAAO,QACT,OAAOC,EAKT,MAAMC,EAAwBP,EAAQ,IAAW1F,GAAW9sB,EAAA,sBAC1D,MAAMgzB,EAAWF,EAAOhG,CAAM,EAC9B,GAAI,CAACkG,EACH,OAAO,KAGT,MAAMC,EAAgB,MAAMhB,EAAA,KAAKJ,IAAL,UAAYmB,GAExC,OAAKC,EAAc,GAID,MAAMA,EAAc,YAAA,EAH7B,IAKX,EAAC,EAEKC,EAAmB,MAAM,QAAQ,WAAWH,CAAqB,EAevE,OAbeP,EAAQ,OACrB,CAACW,EAAKrG,EAAQ9hB,IAAU,CACtB,MAAMooB,EAAgBF,EAAiBloB,CAAK,EAC5C,OAAIooB,EAAc,SAAW,YAC3BD,EAAIrG,CAAM,EAAIsG,EAAc,MAE5BD,EAAIrG,CAAM,EAAI,KAETqG,CACT,EACA,CAAA,CAAC,CAML,GAEM,cAAcb,EAIgB,QAAAtyB,EAAA,yBAJhB,CAClB,QAAAuyB,CAAA,EAGkC,SAClC,MAAMprB,EAAM,YAAYorB,CAAO,UAE/B,OAAO75B,GAAAH,GADU,MAAM25B,EAAA,KAAKP,EAAAgB,IAAL,UAAiCxrB,IACxC,OAAT,YAAA5O,EAAe,SAAf,KAAAG,EAAyB,CAAA,CAClC,GAEM,OAAQ,QAAAsH,EAAA,sBAGZ,OADiB,MAAMkyB,EAAA,KAAKP,EAAAgB,IAAL,UADX,QAGd,GACF,CAjTEf,GAAA,YACAC,GAAA,YACAC,GAAA,YACAC,EAAA,YAJFJ,EAAA,YA+CEQ,YAAkBnoB,EAAe,CAC/B,GAAI,CAACA,EAAM,WAAW,OAAO,GAAK,CAACA,EAAM,WAAW,OAAO,EACzD,MAAM,IAAIvT,EAEd,EAmBM48B,GAAA,SACJ79B,EACA89B,EACmB,QAAAtzB,EAAA,4BACnB,MAAMuzB,EAAW,MAAMD,EAAA,EAEvB,GAAI,CAACC,EAAS,GAAI,CAChB,MAAM3hC,EAAS2hC,EAAS,OACxB,IAAIC,EAA8B,KAClC,GAAI,CACFA,EAAe,MAAMD,EAAS,KAAA,CAChC,OAAQ5zB,EAAA,CAER,CAEA,GAAI/N,IAAW,IACb,MAAI4hC,GAAA,MAAAA,EAAc,SAAS,iBACnB,IAAI78B,GACD68B,GAAA,MAAAA,EAAc,SAAS,iBAC1B,IAAI58B,GACD48B,GAAA,MAAAA,EAAc,SAAS,uBAC1B,IAAI38B,GAGN,IAAIC,GAA2B,CAAE,OAAQ08B,EAAc,EAC/D,GAAW5hC,IAAW,IACpB,MAAM,IAAIoF,GAAS,CAAE,MAAOu8B,EAAU,EACxC,GAAW3hC,IAAW,IAAK,CACzB,MAAM6hC,EAAgBF,EAAS,QAAQ,IAAI,aAAa,EAClDG,EAAaD,EAAgB,OAAOA,CAAa,EAAI,KAE3D,GAAI,CAACC,EACH,MAAM,IAAIl8B,GAAkB,CAC1B,MAAO+7B,CAAA,CACR,EAaH,GAVoB,MAAMh7B,EAAA/C,EAAQ,gBAAR,YAAA+C,EAAA,KAAA/C,EAAwB,CAChD,WAAAk+B,EACA,cAAeH,EAAS,QAAQ,IAC9B,mBAAA,EAEF,mBAAoBA,EAAS,QAAQ,IACnC,yBAAA,CACF,GAIA,OAAO,IAAI,QAAQ,CAACI,EAASC,IAAW,OACtC,MAAMC,EAAU,WACd,IAAM,QACAt7B,EAAA/C,EAAQ,cAAR,MAAA+C,EAAqB,SAIzB25B,EAAA,KAAKP,EAAA0B,IAAL,UAAgB79B,EAAS89B,GAAS,KAAKK,CAAO,EAAE,MAAMC,CAAM,CAC9D,EACAF,EAAa,IAAO,GAAA,GAGtBn7B,EAAA/C,EAAQ,cAAR,MAAA+C,EAAqB,iBAAiB,QAAS,IAAM,CACnD,aAAas7B,CAAO,EACpBD,EAAO,IAAI,MAAM,4BAA4B,CAAC,CAChD,EACF,CAAC,EAGH,MAAM,IAAIp8B,GAAkB,CAAE,MAAO+7B,EAAU,CACjD,YACE3hC,IAAW,MACX4hC,GAAA,MAAAA,EAAc,SAAS,sBAEjB,IAAI77B,GAAgB,CAAE,MAAO47B,EAAU,EAEvC,IAAIl8B,GAAyB,CACjC,MAAOk8B,CAAA,CACR,CAEL,CAEA,OAAOA,CACT,IAEMZ,YAAQxrB,EAAyB,QAAAnH,EAAA,sBACrC,MAAM8zB,EAAcjD,GAASoB,EAAA,KAAKH,GAAY,EAC9CE,EAAA,KAAKF,GAAejB,GAASoB,EAAA,KAAKF,EAAe,GAEjD,MAAMuB,EAAU,IAAYtzB,EAAA,sBAO1B,OANiB,MAAMiyB,EAAA,KAAKJ,IAAL,UAAY,GAAGI,EAAA,KAAKL,GAAY,GAAGzqB,CAAG,GAAI,CAC/D,OAAQ,MACR,QAAS,KAAK,WAAW2sB,EAAY,KAAK,EAC1C,OAAQA,EAAY,WAAA,EAIxB,GAEA,GAAI,CAIF,OADsB,MAFL,MAAM5B,EAAA,KAAKP,EAAA0B,IAAL,UAAgBS,EAAaR,IAEf,KAAA,CAEvC,OAASn8B,EAAO,CACd,GACE28B,EAAY,cACX38B,aAAiBR,IAChBQ,aAAiBP,IACjBO,aAAiBN,IACjBM,aAAiBL,IACnB,CACA,MAAMi9B,EAAc,MAAMD,EAAY,YAAY38B,CAAK,EAEvD,GAAI48B,EACF,OAAAD,EAAY,MAAQC,EAAY,MAAM,SAGhB,MADL,MAAM7B,EAAA,KAAKP,EAAA0B,IAAL,UAAgBS,EAAaR,IACf,KAAA,CAIzC,CAEA,MAAMn8B,CACR,CACF,IC9NF,MAAM68B,GAAmD,CACvD,QAAS,MACT,IAAK,MACL,IAAK,KACP,uBAMO,MAAMC,EAAM,CAKjB,YAAY,CACV,KAAAC,EACA,eAAAC,EAAiB,kCACjB,aAAAC,EAAe,IAAI9C,EAAa,EAM9B,GAAI,CAdHI,GAAA,KAAA2C,IACL3C,GAAA,KAAA4C,GACA5C,GAAA,KAAA6C,IACA7C,GAAA,KAAA8C,IAYExC,EAAA,KAAKuC,GAAkBJ,GACvBnC,EAAA,KAAKwC,GAAgBJ,GAEjBF,IACF,KAAK,KAAOA,EAEhB,CAEU,SAAU,CAClB,MAAO,CAAC,CAACjC,EAAA,KAAKqC,EAChB,CAEA,IAAI,KAAKJ,EAAY,CACnBlC,EAAA,KAAKsC,EAAQJ,EACf,CAEA,IAAc,SAAU,CACtB,MAAM9B,EAAkC,CACtC,eAAgB,kBAAA,EAGlB,OAAIH,EAAA,KAAKqC,KACPlC,EAAQ,cAAmB,UAAUH,EAAA,KAAKqC,GAAM,KAAK,GAEjD,WAAYrC,EAAA,KAAKqC,KACnBlC,EAAQ,WAAW,EAAIH,EAAA,KAAKqC,GAAM,SAI/BlC,CACT,CAwRM,aACJE,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAA0B,CAAA,EAC1BC,EACA,OACA,IAAI7H,EACJ,GAAI,CACFA,EAAS,MAAMoF,EAAA,KAAKuC,IACjB,YAAY,CAAE,MAAOz8B,EAAO,WAAY,YAAa28B,CAAA,CAAQ,EAC7D,QAAQ,CACP,QAAS38B,EAAO,OAAA,CACjB,CACL,OAASZ,EAAO,CACd,GAAIA,aAAiB,OAASA,EAAM,OAAS,aAE3C,MAAMA,CAIV,CAEA,MAAMw9B,EAAWtI,GAAiBt0B,EAAO,QAAQ,EAE7C80B,IACF,MAAMqF,EAAA,KAAKmC,GAAAO,IAAL,UAA4B/H,EAAQ90B,EAAO,QAAS,CACxD,0BAA0BQ,EAAAo8B,EAAS,2BAAT,KAAAp8B,EAAqC,EAAA,IAInE,IAAIs8B,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,MAAMQ,EAAc,CAClB,SAAAD,EACA,QAAS98B,EAAO,QAChB,WAAYA,EAAO,WACnB,QAASA,EAAO,QAChB,sBAAuBA,EAAO,sBAC9B,cAAeA,EAAO,cACtB,SAAU48B,EAAS,SACnB,MAAOA,EAAS,MAChB,UAAWA,EAAS,UACpB,QAASA,EAAS,QAClB,UAAWA,EAAS,UACpB,kBAAmBA,EAAS,kBAC5B,uBAAwBA,EAAS,uBACjC,uBAAwBA,EAAS,uBACjC,gBAAiBA,EAAS,gBAC1B,mBAAoBA,EAAS,mBAC7B,uBAAwBA,EAAS,uBACjC,yBAA0BA,EAAS,yBACnC,2BAA4BA,EAAS,2BACrC,0BAA2BA,EAAS,0BACpC,uBAAwBA,EAAS,uBACjC,oBAAqBA,EAAS,oBAC9B,sBAAuBA,EAAS,sBAChC,gBAAiBA,EAAS,gBAC1B,KAAMA,EAAS,eACf,WAAY58B,EAAO,WACnB,OAAQA,EAAO,OACf,OAAQA,EAAO,OAEf,cAAeA,EAAO,aAAA,EAGxB,OAAOm6B,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,cACAD,EACAL,EACA,UACAC,EAEJ,GAEM,wBACJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAqC,CAAA,EACrCC,EACA,CACA,IAAIG,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,IAAIniC,EACJ,GAAI4F,EAAO,SACT5F,EAAQ,CACN,KAAM,eACN,SAAU4F,EAAO,SACjB,IAAKA,EAAO,GAAA,UAELA,EAAO,MAChB5F,EAAQ,CACN,KAAM,QACN,MAAO4F,EAAO,MACd,IAAKA,EAAO,GAAA,UAELA,EAAO,IAChB5F,EAAQ,CACN,KAAM,MACN,IAAK4F,EAAO,GAAA,MAGd,OAAM,IAAI,MAAM,sDAAsD,EAGxE,IAAIi9B,EACAj9B,EAAO,iCACTi9B,EAAS,YAGX,MAAMF,EAAc,CAClB,SAAAD,EACA,cAAe98B,EAAO,cACtB,OAAQA,EAAO,OACf,OAAQA,EAAO,OACf,KAAMA,EAAO,KACb,OAAQ,CACN,MAAA5F,EACA,YAAa,CACX,UAAW4F,EAAO,SAAS,UAC3B,SAAUA,EAAO,SAAS,SAC1B,QAASA,EAAO,SAAS,OAAA,EAE3B,cAAe,CACb,KAAM,SAAA,EAER,OAAAi9B,CAAA,CACF,EAGF,OAAO9C,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,UACAD,EACAL,EACA,MACAC,EAEJ,GAkCM,uBACJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAoC,CAAA,EACpCC,EACA,OACA,IAAIG,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,MAAMQ,EAAc,CAClB,SAAAD,EACA,cAAe98B,EAAO,cACtB,OAAQwD,EAAA,CACN,OAAQxD,EAAO,OACf,WAAYA,EAAO,WACnB,OAAQA,EAAO,OACf,YAAa,CACX,SAAUA,EAAO,SAAS,SAC1B,UAAWA,EAAO,SAAS,UAC3B,QAASA,EAAO,SAAS,QACzB,UAAWA,EAAO,SAAS,SAAA,EAE7B,KAAMA,EAAO,SAAS,OAClBQ,EAAAR,EAAO,SAAS,kBAAhB,KAAAQ,EAAmC,CAAA,GAEzC,WAAYR,EAAO,UAAA,EAGrB,OAAOm6B,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,UACAD,EACAL,EACA,MACAC,EAEJ,GAKM,kBACJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAqC,CAAA,EACrCC,EACA,CACA,IAAIG,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,MAAMQ,EAAc,CAClB,SAAAD,EACA,cAAe98B,EAAO,cACtB,OAAQA,EAAO,MAAA,EAGjB,OAAOm6B,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,UACAD,EACAL,EACA,MACAC,EAEJ,GAEM,sBAMJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAwD,CAAA,EACxDC,EACA,CACA,MAAMI,EAAc,CAAA,EAEpB,OAAO5C,EAAA,KAAKmC,GAAAU,IAAL,UACL,MACA,YAAYh9B,EAAO,SAAS,GAC5B+8B,EACAL,EACA,OACAC,EAEJ,GACF,CArlBEJ,EAAA,YACAC,GAAA,YACAC,GAAA,YAHKH,GAAA,YA+CCO,GAAA,SACJ/H,EACAoI,EACAz/B,EAGA,QAAAwK,EAAA,sBAKA,MAAM7I,EAJsB89B,EAAQ,IAAKnI,GACvCF,GAAwBC,EAAQC,EAAQt3B,CAAO,CAAA,EAGf,KAC/B0/B,GAAiB,CAACA,EAAa,OAAA,EAGlC,GAAI/9B,EACF,MAAM,IAAId,GAAa,CACrB,KAAM,eACN,OAAQc,EAAM,MAAA,CACf,CAEL,IAWM49B,GAAA,SAMJnkC,EACAukC,EACAL,EACAL,EACAW,EACAV,EACyB,QAAA10B,EAAA,kDACzB,GAAI,KAAK,QAAA,IAAc,GACrB,MAAM,IAAI,MAAM,oDAAoD,EAGtE,MAAMzM,EAAkC,CAAA,EAClCyE,EAAoB,CACxB,OAAApH,EACA,QAASkL,EAAAP,EAAA,GACJ,KAAK,SADD,CAEP,OAAQ,mBAAA,GAEV,OAAAm5B,CAAA,EAEF,GAAI9jC,IAAW,OAAQ,CACrB,MAAMykC,EAAcl/B,GAAK,KAAK,UAAU2+B,CAAW,CAAC,EACpD98B,EAAK,KAAOq9B,EACZr9B,EAAK,QAAU8D,EAAAP,EAAA,GACTvD,EAAK,SADI,CAEb,mBAAoB,OACpB,eAAgB,kBAAA,EAEpB,CAEA,MAAMu7B,EAAW,MAAM,MAAM,GAAGtB,EAAA,KAAKsC,GAAe,GAAGY,CAAQ,GAAIn9B,CAAI,EAEvE,GAAI,CAACu7B,EAAS,GAAI,CAChB,MAAM+B,EAAY,MAAM/B,EAAS,KAAA,EAEjC,IAAIgC,GACJ,GAAI,CACFA,GAAW,KAAK,MAAMD,CAAS,CACjC,OAAQ31B,GAAA,CAAC,CAET,OAAIpH,EAAAg9B,IAAA,YAAAA,GAAU,QAAV,YAAAh9B,EAAiB,QAAS,YAC5B,QAAQ,IACN,wBACA,KAAK,UAAUg9B,GAAS,MAAM,OAAQ,KAAM,CAAC,CAAA,EAEzC,IAAIl/B,GAAa,CACrB,KAAM,4BACN,OAAQ,uBACR,OAAQk/B,GAAS,MAAM,OACvB,OAAQhC,EAAS,MAAA,CAClB,GAGC,OAAOgC,IAAa,SAChB,IAAIl/B,GAAa,CACrB,KAAM,UAAUk/B,EAAQ,IACxB,OAAQ,UACR,OAAQhC,EAAS,MAAA,CAClB,EAGG,IAAIl9B,GAAa,CACrB,KAAM,4BACN,OAAQi/B,EACR,OAAQ/B,EAAS,MAAA,CAClB,CACH,CAEA,GAAI,CAACA,EAAS,KACZ,MAAM,IAAIl9B,GAAa,CACrB,KAAM,eACN,OAAQ,wBACR,OAAQk9B,EAAS,MAAA,CAClB,EAGH,MAAMiC,EAAajC,EAAS,QAAQ,IAAI,kBAAkB,EACpDkC,EAAUD,GAAcxB,GAAwBwB,CAAU,EAC5DC,GAAW,OAAOhB,GAAY,YAChCA,EAAQ,CAAE,KAAM,eAAgB,QAAS,CAAE,QAAAgB,CAAA,EAAgB,EAG7D,MAAMC,EAASnC,EAAS,KAAK,UAAA,EACvBoC,EAAU,IAAI,YACpB,IAAIC,EAAS,GAEb,GAAI,CACF,OAAa,CACX,KAAM,CAAE,KAAAC,EAAM,MAAAnyC,EAAA,EAAU,MAAMgyC,EAAO,KAAA,EACrC,GAAIG,EACF,MAGFD,GAAUD,EAAQ,OAAOjyC,GAAO,CAAE,OAAQ,GAAM,EAEhD,MAAM6hB,GAAQqwB,EAAO,MAAM;AAAA,CAAI,EAG/BA,EAASrwB,GAAM,OAAS,GAExB,UAAWG,MAAQH,GACjB,GAAI,GAACG,GAAK,KAAA,GAAUA,GAAK,WAAW,GAAG,IAEnCA,GAAK,WAAW,QAAQ,EAAG,CAC7B,IAAIvY,EACJ,GAAI,CACFA,EAAO,KAAK,MAAMuY,GAAK,MAAM,CAAC,CAAC,CACjC,OAAQ/F,GAAA,CAEN,QACF,CAEA,OAAQxS,EAAK,KAAA,CACX,IAAK,WAAY,CACf,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZuL,EAAA+7B,EAAQ,aAAR,MAAA/7B,EAAA,KAAA+7B,EAAqB,CACnB,UAAYtnC,EAAa,SAAA,GAE/B,KACF,CACA,IAAK,QAAS,CACZoG,EAAO,UAAapG,EAAa,UACjC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZiR,EAAAq2B,EAAQ,UAAR,MAAAr2B,EAAA,KAAAq2B,EAAkB,CAAE,UAAYtnC,EAAa,SAAA,GACjD,KACF,CAEA,IAAK,cAAe,CACdioC,IAAgB,YAClB,OAAOX,GAAY,WACfA,EAAQtnC,CAAI,GACZgR,EAAAs2B,EAAQ,eAAR,MAAAt2B,EAAA,KAAAs2B,EAAuB,CACrB,QAAUtnC,EAAa,OAAA,IAG/B,KACF,CAEA,IAAK,kBAAmB,CACtB,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZkR,EAAAo2B,EAAQ,mBAAR,MAAAp2B,EAAA,KAAAo2B,GACJ,KACF,CAEA,IAAK,cAAe,CAClBlhC,EAAO,OAAUpG,EAAa,QAAQ,OAEtC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ+Q,EAAAu2B,EAAQ,eAAR,MAAAv2B,EAAA,KAAAu2B,EAAwBtnC,EAAa,SACzC,KACF,CAEA,IAAK,iBAAkB,CACjBioC,IAAgB,YAClB7hC,EAAO,cAAiBpG,EAAa,cACrCoG,EAAO,uBACLpG,EACA,uBAEF,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZmR,EAAAm2B,EAAQ,kBAAR,MAAAn2B,EAAA,KAAAm2B,EAA0B,CACxB,cAAgBtnC,EAAa,cAC7B,uBAAyBA,EACtB,sBAAA,IAGX,KACF,CAEA,IAAK,kBAAmB,CACjBA,EAAa,QAAQ,SAAW,YACnCoG,EAAO,MAASpG,EAAa,QAAQ,OAGvC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ8Q,EAAAw2B,EAAQ,mBAAR,MAAAx2B,EAAA,KAAAw2B,EAA2B,CACzB,OAAStnC,EAAa,QAAQ,OAC9B,SAAWA,EAAa,QAAQ,SAChC,MAAQA,EAAa,QAAQ,KAAA,GAEnC,KACF,CAEA,IAAK,4BAA6B,CAChC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZoR,EAAAk2B,EAAQ,4BAAR,MAAAl2B,EAAA,KAAAk2B,EACEtnC,EAAK,QAAQ,kBAEnB,KACF,CAEA,IAAK,qBAAsB,CACzB,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ6Q,GAAAy2B,EAAQ,qBAAR,MAAAz2B,GAAA,KAAAy2B,EAA6BtnC,EAAK,QAAQ,WAC9C,KACF,CAEA,IAAK,oBACL,IAAK,uBAAwB,CAC3B,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ4Q,GAAA02B,EAAQ,qBAAR,MAAA12B,GAAA,KAAA02B,GACJ,KACF,CAEA,IAAK,QACH,MAAM,IAAIp+B,GAAa,CACrB,KAAOlJ,EAAa,QAAQ,UAC5B,OAASA,EAAa,QAAQ,MAAA,CAC/B,EAGH,IAAK,OACH,OAAAoG,EAAO,WAAcpG,EAAa,QAAQ,WAC1CoG,EAAO,UAAapG,EAAa,QAAQ,UAClCoG,CACT,CAEJ,CAEJ,CACF,QAAA,CACEmiC,EAAO,OAAA,CACT,CAEA,MAAM,IAAIr/B,GAAa,CACrB,KAAM,aACN,OAAQ,8CACR,OAAQ,GAAA,CACT,CACH,ICpWK,MAAMy/B,GACXC,GACiE,OACjE,GAAI,CAACA,EACH,MAAO,CAAC,GAAO,GAAI,EAAE,EAGvB,GAAI,CACF,MAAM5uB,EAAM,IAAI,IAAI4uB,CAAS,EACvBx4B,EAAO4J,EAAI,SAEjB,GACEA,EAAI,SAAW,yBACfA,EAAI,SAAW,0BAEf,MAAO,CAAC,GAAO,GAAI,EAAE,EAGvB,MAAM6uB,EAAmB7uB,EAAI,SAAA,EAC7B,GAAI4uB,IAAcC,EAChB,MAAO,CAAC,GAAO,GAAI,EAAE,EAGvB,MAAMlJ,IAAUv0B,EAAA4O,EAAI,aAAa,IAAI,SAAS,IAA9B,KAAA5O,EAAmC,IAAI,QAAQ,KAAM,GAAG,EAClEg6B,EAAUh1B,EAAK,MAAM,GAAG,EAAE,CAAC,EAOjC,MAAO,EALJA,EAAK,WAAW,QAAQ,GACvB4J,EAAI,aAAa,IAAI,MAAM,IAAM,cACnC5J,EAAK,WAAW,UAAU,GAC1BA,EAAK,WAAW,SAAS,IAECg1B,EAAQ,SAAW,GAAIA,EAASzF,CAAM,CACpE,OAAQntB,EAAA,CACN,MAAO,CAAC,GAAO,GAAI,EAAE,CACvB,CACF,EAEas2B,GAAoB,CAAC,CAChC,QAAA1D,EACA,OAAAzF,EACA,UAAAoJ,CACF,IAIM,CACJ,MAAM/uB,EAAM,IAAI,IAAI,uBAAuB,EAC3C,OAAAA,EAAI,SAAW,UAAUorB,CAAO,GAE5B2D,IAGF/uB,EAAI,SAAW,GAAGA,EAAI,QAAQ,oBAG5B2lB,GACF3lB,EAAI,aAAa,IAAI,UAAW2lB,EAAO,QAAQ,IAAK,GAAG,CAAC,EAGnD3lB,CACT,EAEO,MAAMgvB,WAAsB,KAAM,CAGvC,YAAYx4B,EAAiB1Z,EAAe,CAC1C,MAAM0Z,CAAO,EACb,KAAK,SAAW1Z,CAClB,CACF,CCnEO,MAAMmyC,GAAwB,CAAC,CACpC,MAAAC,EACA,WAAAC,EAAa,aACf,IAGM,CACJ,MAAM/iC,EAAqB,CAAA,EACrBgjC,MAAgB,IAEtB,SAASC,EAAYC,EAAkB,CACrC,GAAIF,EAAU,IAAIE,CAAQ,GAAK,CAACJ,EAAMI,CAAQ,EAC5C,OAGFF,EAAU,IAAIE,CAAQ,EACtBljC,EAAOkjC,CAAQ,EAAIJ,EAAMI,CAAQ,EAEjBC,GAAaL,EAAMI,CAAQ,EAAE,OAAO,EAE5C,QAASE,GAAe,CAC9B,GAAI,CACF,MAAMC,EAAeC,GAAkBJ,EAAUE,CAAU,EAE3D,GAAIC,EAAa,WAAW,MAAM,EAAG,CACnC,MAAME,EAAYF,EAAa,MAAM,GAAG,EAAE,MAAM,EAAG,EAAE,EAAE,KAAK,GAAG,EAC9CG,GAAuBV,EAAOS,CAAS,EAC/C,QAASE,GAAS,CACpBT,EAAU,IAAIS,CAAI,GACrBR,EAAYQ,CAAI,CAEpB,CAAC,CACH,CACF,OAAS7/B,EAAO,CACd,QAAQ,KACN,4BAA4Bw/B,CAAU,OAAOF,CAAQ,IACrDt/B,CAAA,CAEJ,CACF,CAAC,CACH,CAEA,cAAO,QAAQk/B,CAAK,EAAE,QAAQ,CAAC,CAACrjC,EAAKtP,CAAK,IAAM,CAC1CsP,EAAI,WAAWsjC,CAAU,EAC3BE,EAAYxjC,CAAG,EACLA,EAAI,WAAW,MAAM,IAC/BO,EAAOP,CAAG,EAAItP,EAElB,CAAC,EAEM6P,CACT,EAEA,SAASmjC,GAAaO,EAA2B,CAC/C,MAAMC,EAAc,6BACdC,EAAU,mCACVC,EAAoB,CAAA,EAC1B,IAAInpC,EAEJ,MAAQA,EAAQipC,EAAY,KAAKD,CAAO,KAAO,MAC7CG,EAAQ,KAAKnpC,EAAM,CAAC,CAAC,EAGvB,MAAQA,EAAQkpC,EAAQ,KAAKF,CAAO,KAAO,MACzCG,EAAQ,KAAKnpC,EAAM,CAAC,CAAC,EAGvB,MAAO,CAAC,GAAG,IAAI,IAAImpC,CAAO,CAAC,CAC7B,CAEA,SAASP,GAAkBQ,EAAkBV,EAA4B,CACvE,GAAI,CAACA,EAAW,WAAW,GAAG,EAC5B,OAAOA,EAGT,MAAMW,EAAUD,EAAS,MAAM,GAAG,EAAE,MAAM,EAAG,EAAE,EACzCE,EAAcZ,EAAW,MAAM,GAAG,EAClCa,EAA0B,CAAC,GAAGF,CAAO,EAE3C,UAAWG,KAAQF,EACbE,IAAS,KACXD,EAAc,IAAA,EACLC,IAAS,KAClBD,EAAc,KAAKC,CAAI,EAI3B,OAAOD,EAAc,KAAK,GAAG,CAC/B,CAEA,SAAST,GAAuBV,EAAmBqB,EAA2B,CAC5E,OAAO,OAAO,KAAKrB,CAAK,EAAE,OAAQW,GAASA,EAAK,WAAWU,CAAO,CAAC,CACrE,CCjDA,SAASC,GAKPC,EACA7/B,EACA8/B,EAIgC,CAChC,OAAO,IAAI,eAAe,CACxB,MAAMC,EAAY,CAChBD,EACG,KAAKD,EAAO7/B,EAAS4F,GAAiB,CACjCA,EAAQ,OAAS,SAOnBm6B,EAAW,QAAQn6B,CAAO,GAGxBA,EAAQ,OAAS,WAAaA,EAAQ,OAAS,UACjDm6B,EAAW,MAAA,CAEf,CAAC,EACA,KAAMC,GAAY,CACjBD,EAAW,QAAQ,CACjB,KAAM,OACN,QAAS,CACP,WAAYC,EAAQ,WACpB,UAAWA,EAAQ,SAAA,CACrB,CACM,EACRD,EAAW,MAAA,CACb,CAAC,EACA,MAAO3gC,GAAU,CAChB2gC,EAAW,QAAQ,CACjB,KAAM,QACN,QAAS,CACP,KAAM,SAAU3gC,EAAQA,EAAM,KAAO,gBACrC,QAAS,YAAaA,EAAQA,EAAM,QAAU,UAC9C,OAAQ,WAAYA,EAAQA,EAAM,OAAS,OAC3C,OAAQ,WAAYA,EAAQA,EAAM,OAAS,OAC3C,aAAc,YAAaA,EAAQA,EAAM,QAAU,MAAA,CACrD,CACM,EACR2gC,EAAW,MAAA,CACb,CAAC,CACL,CAAA,CACD,CACH,CAWO,MAAME,GAAsB,CACjCJ,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,YAAY,EASrC,SAAeK,GAEbC,EAA8C,QAAAl4B,EAAA,kCAC9C,KAAM,CAACm4B,EAAcC,CAAc,EAAIF,EAAO,IAAA,EACxCG,EAAe,MAAMF,EAAa,UAAA,EAAY,KAAA,EAEpD,GACEE,EAAa,MACb,CAACA,EAAa,OACbA,EAAa,MAAM,OAAS,WAAW9/B,EAAA8/B,EAAa,MAAM,UAAnB,MAAA9/B,EAA4B,QAEpE,OAAO,IAAI,SAAS,KAAK,UAAU8/B,EAAa,KAAK,EAAG,CACtD,SACE3/B,EAAA2/B,EAAa,QAAb,YAAA3/B,EAAoB,QAAS,UACxByF,GAAAC,EAAAi6B,EAAa,MAAM,UAAnB,YAAAj6B,EAA4B,SAA5B,KAAAD,EACD,IACN,QAAS,CACP,eAAgB,kBAAA,CAClB,CACD,EAGH,MAAMm6B,EAAU,IAAI,YACdC,EAAYH,EAAe,YAC/B,IAAI,gBAAgB,CAClB,UAAU5kC,EAAOskC,EAAY,CAC3B,MAAMU,EAAY,UAAUhlC,EAAM,IAAI;AAAA,QAAW,KAAK,UACpDA,CAAA,CACD;AAAA;AAAA,EACDskC,EAAW,QAAQQ,EAAQ,OAAOE,CAAS,CAAC,CAC9C,CAAA,CACD,CAAA,EAGH,OAAO,IAAI,SAASD,EAAW,CAC7B,OAAQ,IACR,QAAS,CACP,eAAgB,mCAChB,WAAY,aACZ,gBAAiB,UAAA,CACnB,CACD,CACH,GAWO,MAAME,GAAmC,CAC9Cb,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASF,GAAoBJ,EAAO7/B,CAAM,EAChD,OAAOkgC,GAA0BC,CAAM,CACzC,GAWaQ,GAA8B,CACzCd,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,uBAAuB,EAYnCe,GAA2C,CACtDf,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASQ,GAA4Bd,EAAO7/B,CAAM,EACxD,OAAOkgC,GAA0BC,CAAM,CACzC,GAaaU,GAA6B,CACxChB,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,sBAAsB,EAYlCiB,GAA0C,CACrDjB,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASU,GAA2BhB,EAAO7/B,CAAM,EACvD,OAAOkgC,GAA0BC,CAAM,CACzC,GAWaY,GAA8B,CACzClB,EACA7/B,IAMO4/B,GAQLC,EAAO7/B,EAAQ6/B,EAAM,qBAAqB,EAYjCmB,GAA2C,CACtDnB,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASY,GAA4BlB,EAAO7/B,CAAM,EACxD,OAAOkgC,GAA0BC,CAAM,CACzC,GAgBac,GAAwB,CACnCpB,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,iBAAiB,EAa7BqB,GAAqC,CAChDrB,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASc,GAAsBpB,EAAO7/B,CAAM,EAClD,OAAOkgC,GAA0BC,CAAM,CACzC","x_google_ignoreList":[0,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,22,23,24,25,26,27,28,29]}
1	+ {"version":3,"file":"index.cjs","sources":["../../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../src/errors.ts","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/core.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/util.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/errors.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/parse.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/regexes.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/checks.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/doc.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/versions.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/schemas.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/registries.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/api.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/to-json-schema.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/core/json-schema-processors.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/iso.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/errors.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/parse.js","../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/classic/schemas.js","../src/settings.ts","../src/figma/utils.ts","../src/utils/isNodeCodegenCompatible.ts","../../node_modules/.pnpm/type-detect@4.1.0/node_modules/type-detect/type-detect.js","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/buffer.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/detector.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/collection.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/global.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/copy_map.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/copier.mjs","../../node_modules/.pnpm/deepcopy@2.1.0/node_modules/deepcopy/src/index.mjs","../src/FigmaRestApi.ts","../src/anima.ts","../src/utils/figma.ts","../src/utils/files.ts","../src/dataStream.ts"],"sourcesContent":["\n/! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) /\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops /\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\n\n//const Z_FILTERED = 1;\n//const Z_HUFFMAN_ONLY = 2;\n//const Z_RLE = 3;\nconst Z_FIXED$1 = 4;\n//const Z_DEFAULT_STRATEGY = 0;\n\n/ Possible values of the data_type field (though see inflate()) /\nconst Z_BINARY = 0;\nconst Z_TEXT = 1;\n//const Z_ASCII = 1; // = Z_TEXT\nconst Z_UNKNOWN$1 = 2;\n\n/============================================================================/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n/ The three kinds of block type /\n\nconst MIN_MATCH$1 = 3;\nconst MAX_MATCH$1 = 258;\n/ The minimum and maximum match lengths /\n\n// From deflate.h\n/ ===========================================================================\n * Internal compression state.\n /\n\nconst LENGTH_CODES$1 = 29;\n/ number of length codes, not counting the special END_BLOCK code /\n\nconst LITERALS$1 = 256;\n/ number of literal bytes 0..255 /\n\nconst L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1;\n/ number of Literal or Length codes, including the END_BLOCK code /\n\nconst D_CODES$1 = 30;\n/ number of distance codes /\n\nconst BL_CODES$1 = 19;\n/ number of codes used to transfer the bit lengths /\n\nconst HEAP_SIZE$1 = 2 L_CODES$1 + 1;\n/* maximum heap size /\n\nconst MAX_BITS$1 = 15;\n/ All codes must not exceed MAX_BITS bits /\n\nconst Buf_size = 16;\n/ size of bit buffer in bi_buf /\n\n\n/ ===========================================================================\n * Constants\n /\n\nconst MAX_BL_BITS = 7;\n/ Bit length codes must not exceed MAX_BL_BITS bits /\n\nconst END_BLOCK = 256;\n/ end of block literal code /\n\nconst REP_3_6 = 16;\n/ repeat previous bit length 3-6 times (2 bits of repeat count) /\n\nconst REPZ_3_10 = 17;\n/ repeat a zero length 3-10 times (3 bits of repeat count) /\n\nconst REPZ_11_138 = 18;\n/ repeat a zero length 11-138 times (7 bits of repeat count) /\n\n/ eslint-disable comma-spacing,array-bracket-spacing /\nconst extra_lbits = / extra bits for each length code /\n new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits = / extra bits for each distance code /\n new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits = / extra bits for each bit length code /\n new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/ eslint-enable comma-spacing,array-bracket-spacing /\n\n/ The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n /\n\n/ ===========================================================================\n * Local data. These are initialized only once.\n /\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; / see definition of array dist_code below /\n\n// !!!! Use flat array instead of structure, Freq = i2, Len = i2+1\nconst static_ltree = new Array((L_CODES$1 + 2) 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n /\n\nconst static_dtree = new Array(D_CODES$1 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n /\n\nconst _dist_code = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/ Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n /\n\nconst _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/ length code for each normalized match length (0 == MIN_MATCH) /\n\nconst base_length = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/ First normalized length for each code (0 = MIN_MATCH) /\n\nconst base_dist = new Array(D_CODES$1);\nzero$1(base_dist);\n/ First normalized distance for each code (0 = distance of 1) /\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; / static tree or NULL /\n this.extra_bits = extra_bits; / extra bits for each code or NULL /\n this.extra_base = extra_base; / base index for extra_bits /\n this.elems = elems; / max number of elements in the tree /\n this.max_length = max_length; / max bit length for the codes /\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; / the dynamic tree /\n this.max_code = 0; / largest code with non zero frequency /\n this.stat_desc = stat_desc; / the corresponding static tree /\n}\n\n\n\nconst d_code = (dist) => {\n\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/ ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n /\nconst put_short = (s, w) => {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/ ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n /\nconst send_bits = (s, value, length) => {\n\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf \|= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf \|= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n send_bits(s, tree[c 2]/.Code/, tree[c * 2 + 1]/.Len/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n /\nconst bi_reverse = (code, len) => {\n\n let res = 0;\n do {\n res \|= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n};\n\n\n/ ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n /\nconst bi_flush = (s) => {\n\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n};\n\n\n/ ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n /\nconst gen_bitlen = (s, desc) => {\n// deflate_state s;\n// tree_desc desc; / the tree descriptor /\n\n const tree = desc.dyn_tree;\n const max_code = desc.max_code;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const extra = desc.stat_desc.extra_bits;\n const base = desc.stat_desc.extra_base;\n const max_length = desc.stat_desc.max_length;\n let h; / heap index /\n let n, m; / iterate over the tree elements /\n let bits; / bit length /\n let xbits; / extra bits /\n let f; / frequency /\n let overflow = 0; / number of elements with bit length too large /\n\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n s.bl_count[bits] = 0;\n }\n\n / In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n /\n tree[s.heap[s.heap_max] 2 + 1]/.Len/ = 0; /* root of the heap /\n\n for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n n = s.heap[h];\n bits = tree[tree[n 2 + 1]/.Dad/ * 2 + 1]/.Len/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/.Len/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed /\n\n if (n > max_code) { continue; } / not a leaf node /\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n 2]/.Freq/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/.Len/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Tracev((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus /\n\n / Find the first bit length which could increase: /\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; / move one leaf down the tree /\n s.bl_count[bits + 1] += 2; / move one overflow item as its brother /\n s.bl_count[max_length]--;\n / The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n /\n overflow -= 2;\n } while (overflow > 0);\n\n / Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n /\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m 2 + 1]/.Len/ !== bits) {\n // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/.Len/) * tree[m * 2]/.Freq/;\n tree[m * 2 + 1]/.Len/ = bits;\n }\n n--;\n }\n }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n /\nconst gen_codes = (tree, max_code, bl_count) => {\n// ct_data tree; /* the tree to decorate /\n// int max_code; / largest code with non zero frequency /\n// ushf bl_count; /* number of codes at each bit length /\n\n const next_code = new Array(MAX_BITS$1 + 1); / next code value for each bit length /\n let code = 0; / running code value /\n let bits; / bit index /\n let n; / code index /\n\n / The distribution counts are first used to generate the code values\n * without bit reversal.\n /\n for (bits = 1; bits <= MAX_BITS$1; bits++) {\n code = (code + bl_count[bits - 1]) << 1;\n next_code[bits] = code;\n }\n / Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n /\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n let len = tree[n 2 + 1]/.Len/;\n if (len === 0) { continue; }\n /* Now reverse the bits /\n tree[n 2]/.Code/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n /\nconst tr_static_init = () => {\n\n let n; / iterates over tree elements /\n let bits; / bit counter /\n let length; / length value /\n let code; / code value /\n let dist; / distance index /\n const bl_count = new Array(MAX_BITS$1 + 1);\n / number of codes at each bit length for an optimal tree /\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n / For some embedded targets, global variables are not initialized: /\n/#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif/\n\n / Initialize the mapping length (0..255) -> length code (0..28) /\n length = 0;\n for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n / Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n /\n _length_code[length - 1] = code;\n\n / Initialize the mapping dist (0..32K) -> dist code (0..29) /\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; / from now on, all distances are divided by 128 /\n for (; code < D_CODES$1; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n / Construct the codes of the static literal tree /\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n 2 + 1]/.Len/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/.Len/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/.Len/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/.Len/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n /\n gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n / The static distance tree is trivial: /\n for (n = 0; n < D_CODES$1; n++) {\n static_dtree[n 2 + 1]/.Len/ = 5;\n static_dtree[n * 2]/.Code/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS);\n\n //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n /\nconst init_block = (s) => {\n\n let n; / iterates over tree elements /\n\n / Initialize the trees. /\n for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n 2]/.Freq/ = 0; }\n for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/.Freq/ = 0; }\n for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/.Freq/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/.Freq/ = 1;\n s.opt_len = s.static_len = 0;\n s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n /\nconst bi_windup = (s) =>\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n};\n\n/ ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n /\nconst smaller = (tree, n, m, depth) => {\n\n const _n2 = n 2;\n const _m2 = m * 2;\n return (tree[_n2]/.Freq/ < tree[_m2]/.Freq/ \|\|\n (tree[_n2]/.Freq/ === tree[_m2]/.Freq/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n /\nconst pqdownheap = (s, tree, k) => {\n// deflate_state s;\n// ct_data tree; / the tree to restore /\n// int k; / node to move down /\n\n const v = s.heap[k];\n let j = k << 1; / left son of k /\n while (j <= s.heap_len) {\n / Set j to the smallest of the two sons: /\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n / Exit if v is smaller than both sons /\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n / Exchange v with the smallest son /\n s.heap[k] = s.heap[j];\n k = j;\n\n / And continue down the tree, setting j to the left son of k /\n j <<= 1;\n }\n s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/ ===========================================================================\n * Send the block data compressed using the given Huffman trees\n /\nconst compress_block = (s, ltree, dtree) => {\n// deflate_state s;\n// const ct_data ltree; / literal tree /\n// const ct_data dtree; /* distance tree /\n\n let dist; / distance of matched string /\n let lc; / match length or unmatched char (if dist == 0) /\n let sx = 0; / running index in sym_buf /\n let code; / the code to send /\n let extra; / number of extra bits to send /\n\n if (s.sym_next !== 0) {\n do {\n dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n lc = s.pending_buf[s.sym_buf + sx++];\n if (dist === 0) {\n send_code(s, lc, ltree); / send a literal byte /\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n / Here, lc is the match length - MIN_MATCH /\n code = _length_code[lc];\n send_code(s, code + LITERALS$1 + 1, ltree); / send the length code /\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); / send the extra length bits /\n }\n dist--; / dist is now the match distance - 1 /\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); / send the distance code /\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); / send the extra distance bits /\n }\n } / literal or match pair ? /\n\n / Check that the overlay between pending_buf and sym_buf is ok: /\n //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n } while (sx < s.sym_next);\n }\n\n send_code(s, END_BLOCK, ltree);\n};\n\n\n/ ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n /\nconst build_tree = (s, desc) => {\n// deflate_state s;\n// tree_desc desc; / the tree descriptor /\n\n const tree = desc.dyn_tree;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const elems = desc.stat_desc.elems;\n let n, m; / iterate over heap elements /\n let max_code = -1; / largest code with non zero frequency /\n let node; / new node being created /\n\n / Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2n] and heap[2n+1].\n * heap[0] is not used.\n /\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE$1;\n\n for (n = 0; n < elems; n++) {\n if (tree[n 2]/.Freq/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/.Len/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n /\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node 2]/.Freq/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/.Len/;\n }\n /* node is 0 or 1 so it does not have extra bits /\n }\n desc.max_code = max_code;\n\n / The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n /\n for (n = (s.heap_len >> 1/int /2/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n / Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n /\n node = elems; / next internal node of the tree /\n do {\n //pqremove(s, tree, n); / n = node of least frequency /\n / pqremove /\n n = s.heap[1/SMALLEST/];\n s.heap[1/SMALLEST/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/SMALLEST/);\n /*/\n\n m = s.heap[1/SMALLEST/]; / m = node of next least frequency /\n\n s.heap[--s.heap_max] = n; / keep the nodes sorted by frequency /\n s.heap[--s.heap_max] = m;\n\n / Create a new node father of n and m /\n tree[node 2]/.Freq/ = tree[n * 2]/.Freq/ + tree[m * 2]/.Freq/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/.Dad/ = tree[m * 2 + 1]/.Dad/ = node;\n\n /* and insert the new node in the heap /\n s.heap[1/SMALLEST/] = node++;\n pqdownheap(s, tree, 1/SMALLEST/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/SMALLEST/];\n\n / At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n /\n gen_bitlen(s, desc);\n\n / The field len is now set, we can generate the bit codes /\n gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/ ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n /\nconst scan_tree = (s, tree, max_code) => {\n// deflate_state s;\n// ct_data tree; / the tree to be scanned /\n// int max_code; / and its largest code of non zero frequency /\n\n let n; / iterates over all tree elements /\n let prevlen = -1; / last emitted length /\n let curlen; / length of current code /\n\n let nextlen = tree[0 2 + 1]/.Len/; /* length of next code /\n\n let count = 0; / repeat count of the current code /\n let max_count = 7; / max repeat count /\n let min_count = 4; / min repeat count /\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) 2 + 1]/.Len/ = 0xffff; /* guard /\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) 2 + 1]/.Len/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/.Freq/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/.Freq/++; }\n s.bl_tree[REP_3_6 * 2]/.Freq/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/.Freq/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/.Freq/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n /\nconst send_tree = (s, tree, max_code) => {\n// deflate_state s;\n// ct_data tree; / the tree to be scanned /\n// int max_code; / and its largest code of non zero frequency /\n\n let n; / iterates over all tree elements /\n let prevlen = -1; / last emitted length /\n let curlen; / length of current code /\n\n let nextlen = tree[0 2 + 1]/.Len/; /* length of next code /\n\n let count = 0; / repeat count of the current code /\n let max_count = 7; / max repeat count /\n let min_count = 4; / min repeat count /\n\n / tree[max_code+1].Len = -1; / / guard already set /\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) 2 + 1]/.Len/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n /\nconst build_bl_tree = (s) => {\n\n let max_blindex; / index of last bit length code of non zero freq /\n\n / Determine the bit length frequencies for literal and distance trees /\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n / Build the bit length tree: /\n build_tree(s, s.bl_desc);\n / opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n /\n\n / Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n /\n for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] 2 + 1]/.Len/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts /\n s.opt_len += 3 (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n /\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n// deflate_state s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree /\n\n let rank; / index in bl_order /\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); / not +255 as stated in appnote.txt /\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); / not -3 as stated in appnote.txt /\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] 2 + 1]/.Len/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree /\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); / distance tree /\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/ ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"block list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n /\nconst detect_data_type = (s) => {\n / block_mask is the bit mask of block-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n /\n let block_mask = 0xf3ffc07f;\n let n;\n\n / Check for non-textual (\"block-listed\") bytes. /\n for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n if ((block_mask & 1) && (s.dyn_ltree[n 2]/.Freq/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"allow-listed\") bytes. /\n if (s.dyn_ltree[9 2]/.Freq/ !== 0 \|\| s.dyn_ltree[10 * 2]/.Freq/ !== 0 \|\|\n s.dyn_ltree[13 * 2]/.Freq/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS$1; n++) {\n if (s.dyn_ltree[n * 2]/.Freq/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"block-listed\" or \"allow-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n /\n return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/ ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n /\nconst _tr_init$1 = (s) =>\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n / Initialize the first block of the first file: /\n init_block(s);\n};\n\n\n/ ===========================================================================\n * Send a stored block\n /\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState s;\n//charf buf; / input block /\n//ulg stored_len; / length of input block /\n//int last; / one if this is the last block for a file /\n\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); / send block type /\n bi_windup(s); / align on byte boundary /\n put_short(s, stored_len);\n put_short(s, ~stored_len);\n if (stored_len) {\n s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n }\n s.pending += stored_len;\n};\n\n\n/ ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n /\nconst _tr_align$1 = (s) => {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n};\n\n\n/ ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n /\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState s;\n//charf buf; / input block, or NULL if too old /\n//ulg stored_len; / length of input block /\n//int last; / one if this is the last block for a file /\n\n let opt_lenb, static_lenb; / opt_len and static_len in bytes /\n let max_blindex = 0; / index of last bit length code of non zero freq /\n\n / Build the Huffman trees unless a stored block is forced /\n if (s.level > 0) {\n\n / Check if the file is binary or text /\n if (s.strm.data_type === Z_UNKNOWN$1) {\n s.strm.data_type = detect_data_type(s);\n }\n\n / Construct the literal and distance trees /\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n / At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n /\n\n / Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n /\n max_blindex = build_bl_tree(s);\n\n / Determine the best encoding. Compute the block lengths in bytes. /\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->sym_next / 3));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block /\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n / 4: two words for the lengths /\n\n / The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n /\n _tr_stored_block$1(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 \|\| static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n / The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n /\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n /\nconst _tr_tally$1 = (s, dist, lc) => {\n// deflate_state s;\n// unsigned dist; /* distance of matched string /\n// unsigned lc; / match length-MIN_MATCH or unmatched char (if dist==0) /\n\n s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n if (dist === 0) {\n / lc is the unmatched char /\n s.dyn_ltree[lc 2]/.Freq/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH /\n dist--; / dist = match distance - 1 /\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) 2]/.Freq/++;\n s.dyn_dtree[d_code(dist) * 2]/.Freq/++;\n }\n\n return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1 = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1 = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n let s1 = (adler & 0xffff) \|0,\n s2 = ((adler >>> 16) & 0xffff) \|0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) \|0;\n s2 = (s2 + s1) \|0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 \| (s2 << 16)) \|0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n let c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n const t = crcTable;\n const end = pos + len;\n\n crc ^= -1;\n\n for (let i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 /\n 1: 'stream end', / Z_STREAM_END 1 /\n 0: '', / Z_OK 0 /\n '-1': 'file error', / Z_ERRNO (-1) /\n '-2': 'stream error', / Z_STREAM_ERROR (-2) /\n '-3': 'data error', / Z_DATA_ERROR (-3) /\n '-4': 'insufficient memory', / Z_MEM_ERROR (-4) /\n '-5': 'buffer error', / Z_BUF_ERROR (-5) /\n '-6': 'incompatible version' / Z_VERSION_ERROR (-6) /\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n / Allowed flush values; see deflate() and inflate() below for details /\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n / Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n /\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n / compression levels /\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n / Possible values of the data_type field (though see inflate()) /\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n / The deflate compression method /\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n Z_UNKNOWN,\n Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/============================================================================/\n\n\nconst MAX_MEM_LEVEL = 9;\n/ Maximum value for memLevel in deflateInit2 /\nconst MAX_WBITS$1 = 15;\n/ 32K LZ77 window /\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES = 29;\n/ number of length codes, not counting the special END_BLOCK code /\nconst LITERALS = 256;\n/ number of literal bytes 0..255 /\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/ number of Literal or Length codes, including the END_BLOCK code /\nconst D_CODES = 30;\n/ number of distance codes /\nconst BL_CODES = 19;\n/ number of codes used to transfer the bit lengths /\nconst HEAP_SIZE = 2 L_CODES + 1;\n/* maximum heap size /\nconst MAX_BITS = 15;\n/ All codes must not exceed MAX_BITS bits /\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42; / zlib header -> BUSY_STATE /\n//#ifdef GZIP\nconst GZIP_STATE = 57; / gzip header -> BUSY_STATE \| EXTRA_STATE /\n//#endif\nconst EXTRA_STATE = 69; / gzip extra block -> NAME_STATE /\nconst NAME_STATE = 73; / gzip file name -> COMMENT_STATE /\nconst COMMENT_STATE = 91; / gzip comment -> HCRC_STATE /\nconst HCRC_STATE = 103; / gzip header CRC -> BUSY_STATE /\nconst BUSY_STATE = 113; / deflate -> FINISH_STATE /\nconst FINISH_STATE = 666; / stream complete /\n\nconst BS_NEED_MORE = 1; / block not completed, need more input or more output /\nconst BS_BLOCK_DONE = 2; / block flush performed /\nconst BS_FINISH_STARTED = 3; / finish started, need only more output at next deflate /\nconst BS_FINISH_DONE = 4; / finish done, accept no more input or output /\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n strm.msg = messages[errorCode];\n return errorCode;\n};\n\nconst rank = (f) => {\n return ((f) 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n /\nconst slide_hash = (s) => {\n let n, m;\n let p;\n let wsize = s.w_size;\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= wsize ? m - wsize : 0);\n } while (--n);\n n = wsize;\n//#ifndef FASTEST\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= wsize ? m - wsize : 0);\n / If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n /\n } while (--n);\n//#endif\n};\n\n/ eslint-disable new-cap /\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/ =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n /\nconst flush_pending = (strm) => {\n const s = strm.state;\n\n //_tr_flush_bits(s);\n let len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n};\n\n\nconst flush_block_only = (s, last) => {\n _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n s.pending_buf[s.pending++] = b;\n};\n\n\n/ =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n /\nconst putShortMSB = (s, b) => {\n\n // put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/ ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n /\nconst read_buf = (strm, buf, start, size) => {\n\n let len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32_1(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32_1(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n};\n\n\n/ ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n /\nconst longest_match = (s, cur_match) => {\n\n let chain_length = s.max_chain_length; / max hash chain length /\n let scan = s.strstart; / current string /\n let match; / matched string /\n let len; / length of current match /\n let best_len = s.prev_length; / best match length so far /\n let nice_match = s.nice_match; / stop if match long enough /\n const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/NIL/;\n\n const _win = s.window; // shortcut\n\n const wmask = s.w_mask;\n const prev = s.prev;\n\n / Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n /\n\n const strend = s.strstart + MAX_MATCH;\n let scan_end1 = _win[scan + best_len - 1];\n let scan_end = _win[scan + best_len];\n\n / The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n /\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n / Do not waste too much time if we already have a good match: /\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n / Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n /\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n / Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n /\n\n if (_win[match + best_len] !== scan_end \|\|\n _win[match + best_len - 1] !== scan_end1 \|\|\n _win[match] !== _win[scan] \|\|\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n / The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n /\n scan += 2;\n match++;\n // Assert(scan == match, \"match[2]?\");\n\n / We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n /\n do {\n /jshint noempty:false/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n};\n\n\n/ ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n \n IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n /\nconst fill_window = (s) => {\n\n const _w_size = s.w_size;\n let n, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n / Deal with !@#$% 64K limit: /\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // / Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // /\n // more--;\n // }\n //}\n\n\n / If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n /\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n / we now have strstart >= MAX_DIST /\n s.block_start -= _w_size;\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n slide_hash(s);\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n / If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2WSIZE + 2\n In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2WSIZE so more >= 2.\n If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n /\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n / Initialize the hash value now that we have some input: /\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n / UPDATE_HASH(s, s->ins_h, s->window[str + 1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n / UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n / If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n /\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n / If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n /\n// if (s.high_water < s.window_size) {\n// const curr = s.strstart + s.lookahead;\n// let init = 0;\n//\n// if (s.high_water < curr) {\n// / Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// /\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// / High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// /\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n};\n\n/ ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n \n In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n \n deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n /\nconst deflate_stored = (s, flush) => {\n\n / Smallest worthy block size when not flushing or finishing. By default\n * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n * large input and output buffers, the stored block size will be larger.\n /\n let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n / Copy as many min_block or larger stored blocks directly to next_out as\n * possible. If flushing, copy the remaining available input to next_out as\n * stored blocks, if there is enough space.\n /\n let len, left, have, last = 0;\n let used = s.strm.avail_in;\n do {\n / Set len to the maximum size block that we can copy directly with the\n * available input data and output space. Set left to how much of that\n * would be copied from what's left in the window.\n /\n len = 65535/ MAX_STORED /; / maximum deflate stored block length /\n have = (s.bi_valid + 42) >> 3; / number of header bytes /\n if (s.strm.avail_out < have) { / need room for header /\n break;\n }\n / maximum stored block length that will fit in avail_out: /\n have = s.strm.avail_out - have;\n left = s.strstart - s.block_start; / bytes left in window /\n if (len > left + s.strm.avail_in) {\n len = left + s.strm.avail_in; / limit len to the input /\n }\n if (len > have) {\n len = have; / limit len to the output /\n }\n\n / If the stored block would be less than min_block in length, or if\n * unable to copy all of the available input when flushing, then try\n * copying to the window and the pending buffer instead. Also don't\n * write an empty block when flushing -- deflate() does that.\n /\n if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) \|\|\n flush === Z_NO_FLUSH$2 \|\|\n len !== left + s.strm.avail_in)) {\n break;\n }\n\n / Make a dummy stored block in pending to get the header bytes,\n * including any pending bits. This also updates the debugging counts.\n /\n last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n _tr_stored_block(s, 0, 0, last);\n\n / Replace the lengths in the dummy stored block with len. /\n s.pending_buf[s.pending - 4] = len;\n s.pending_buf[s.pending - 3] = len >> 8;\n s.pending_buf[s.pending - 2] = ~len;\n s.pending_buf[s.pending - 1] = ~len >> 8;\n\n / Write the stored block header bytes. /\n flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n// / Update debugging counts for the data about to be copied. /\n// s->compressed_len += len << 3;\n// s->bits_sent += len << 3;\n//#endif\n\n / Copy uncompressed bytes from the window to next_out. /\n if (left) {\n if (left > len) {\n left = len;\n }\n //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n s.strm.next_out += left;\n s.strm.avail_out -= left;\n s.strm.total_out += left;\n s.block_start += left;\n len -= left;\n }\n\n / Copy uncompressed bytes directly from next_in to next_out, updating\n * the check value.\n /\n if (len) {\n read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n s.strm.next_out += len;\n s.strm.avail_out -= len;\n s.strm.total_out += len;\n }\n } while (last === 0);\n\n / Update the sliding window with the last s->w_size bytes of the copied\n * data, or append all of the copied data to the existing window if less\n * than s->w_size bytes were copied. Also update the number of bytes to\n * insert in the hash tables, in the event that deflateParams() switches to\n * a non-zero compression level.\n /\n used -= s.strm.avail_in; / number of input bytes directly copied /\n if (used) {\n / If any input was used, then no unused input remains in the window,\n * therefore s->block_start == s->strstart.\n /\n if (used >= s.w_size) { / supplant the previous history /\n s.matches = 2; / clear hash /\n //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n s.strstart = s.w_size;\n s.insert = s.strstart;\n }\n else {\n if (s.window_size - s.strstart <= used) {\n / Slide the window down. /\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; / add a pending slide_hash() /\n }\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n s.strstart += used;\n s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n }\n s.block_start = s.strstart;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n / If the last block was written to next_out, then done. /\n if (last) {\n return BS_FINISH_DONE;\n }\n\n / If flushing and all input has been consumed, then done. /\n if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n s.strm.avail_in === 0 && s.strstart === s.block_start) {\n return BS_BLOCK_DONE;\n }\n\n / Fill the window with any remaining input. /\n have = s.window_size - s.strstart;\n if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n / Slide the window down. /\n s.block_start -= s.w_size;\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; / add a pending slide_hash() /\n }\n have += s.w_size; / more space now /\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n if (have > s.strm.avail_in) {\n have = s.strm.avail_in;\n }\n if (have) {\n read_buf(s.strm, s.window, s.strstart, have);\n s.strstart += have;\n s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n / There was not enough avail_out to write a complete worthy or flushed\n * stored block to next_out. Write a stored block to pending instead, if we\n * have enough input for a worthy block, or if flushing and there is enough\n * room for the remaining input as a stored block in the pending buffer.\n /\n have = (s.bi_valid + 42) >> 3; / number of header bytes /\n / maximum stored block length that will fit in pending: /\n have = s.pending_buf_size - have > 65535/ MAX_STORED / ? 65535/ MAX_STORED / : s.pending_buf_size - have;\n min_block = have > s.w_size ? s.w_size : have;\n left = s.strstart - s.block_start;\n if (left >= min_block \|\|\n ((left \|\| flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n s.strm.avail_in === 0 && left <= have)) {\n len = left > have ? have : left;\n last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n len === left ? 1 : 0;\n _tr_stored_block(s, s.block_start, len, last);\n s.block_start += len;\n flush_pending(s.strm);\n }\n\n / We've done all we can with the available input and output. /\n return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/ ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n /\nconst deflate_fast = (s, flush) => {\n\n let hash_head; / head of the hash chain /\n let bflush; / set if current block must be flushed /\n\n for (;;) {\n / Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n /\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; / flush the current block /\n }\n }\n\n / Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n /\n hash_head = 0/NIL/;\n if (s.lookahead >= MIN_MATCH) {\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /*/\n }\n\n / Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n /\n if (hash_head !== 0/NIL/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n / To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n /\n s.match_length = longest_match(s, hash_head);\n / longest_match() sets match_start /\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n / _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); /\n bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n / Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n /\n if (s.match_length <= s.max_lazy_match/max_insert_length/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; / string at strstart already in table /\n do {\n s.strstart++;\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /*/\n / strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n /\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n / UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n / If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n /\n }\n } else {\n / No match, output a literal byte /\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n / _tr_tally_lit(s, s.window[s.strstart], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH$3) {\n /* FLUSH_BLOCK(s, 1); */\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /*/\n }\n return BS_BLOCK_DONE;\n};\n\n/ ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n /\nconst deflate_slow = (s, flush) => {\n\n let hash_head; / head of hash chain /\n let bflush; / set if current block must be flushed /\n\n let max_insert;\n\n / Process the input block. /\n for (;;) {\n / Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n /\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } / flush the current block /\n }\n\n / Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n /\n hash_head = 0/NIL/;\n if (s.lookahead >= MIN_MATCH) {\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /*/\n }\n\n / Find the longest match, discarding those <= prev_length.\n /\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/NIL/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/MAX_DIST(s)/) {\n / To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n /\n s.match_length = longest_match(s, hash_head);\n / longest_match() sets match_start /\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED \|\| (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/TOO_FAR/))) {\n\n / If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n /\n s.match_length = MIN_MATCH - 1;\n }\n }\n / If there was a match at the previous step and the current\n * match is not better, output the previous match:\n /\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n / Do not insert strings in hash table beyond this. /\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);/\n bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n / Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n /\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n / INSERT_STRING(s, s.strstart, hash_head); /\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n //\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /* FLUSH_BLOCK(s, 0); */\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n\n } else if (s.match_available) {\n / If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n /\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n / _tr_tally_lit(s, s.window[s.strstart-1], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n / FLUSH_BLOCK_ONLY(s, 0) /\n flush_block_only(s, false);\n /*/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n / There is no previous match to compare with, wait for\n * the next step to decide.\n /\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n / _tr_tally_lit(s, s.window[s.strstart-1], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH$3) {\n / FLUSH_BLOCK(s, 1); /\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /* FLUSH_BLOCK(s, 0); */\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n\n return BS_BLOCK_DONE;\n};\n\n\n/ ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n /\nconst deflate_rle = (s, flush) => {\n\n let bflush; / set if current block must be flushed /\n let prev; / byte at distance one to match /\n let scan, strend; / scan goes up to strend for length of run /\n\n const _win = s.window;\n\n for (;;) {\n / Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n /\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } / flush the current block /\n }\n\n / See how many times the previous byte repeats /\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /jshint noempty:false/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n / Emit match if have run of MIN_MATCH or longer, else emit literal /\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n / _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); /\n bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n / No match, output a literal byte /\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n / _tr_tally_lit(s, s.window[s.strstart], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /* FLUSH_BLOCK(s, 1); */\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /*/\n }\n return BS_BLOCK_DONE;\n};\n\n/ ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n /\nconst deflate_huff = (s, flush) => {\n\n let bflush; / set if current block must be flushed /\n\n for (;;) {\n / Make sure that we have a literal to write. /\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n break; / flush the current block /\n }\n }\n\n / Output a literal byte /\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n / _tr_tally_lit(s, s.window[s.strstart], bflush); /\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n //\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /* FLUSH_BLOCK(s, 1); */\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n //\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n / FLUSH_BLOCK(s, 0); /\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /*/\n }\n return BS_BLOCK_DONE;\n};\n\n/ Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n /\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nconst configuration_table = [\n / good lazy nice chain /\n new Config(0, 0, 0, 0, deflate_stored), / 0 store only /\n new Config(4, 4, 8, 4, deflate_fast), / 1 max speed, no lazy matches /\n new Config(4, 5, 16, 8, deflate_fast), / 2 /\n new Config(4, 6, 32, 32, deflate_fast), / 3 /\n\n new Config(4, 4, 16, 16, deflate_slow), / 4 lazy matches /\n new Config(8, 16, 32, 32, deflate_slow), / 5 /\n new Config(8, 16, 128, 128, deflate_slow), / 6 /\n new Config(8, 32, 128, 256, deflate_slow), / 7 /\n new Config(32, 128, 258, 1024, deflate_slow), / 8 /\n new Config(32, 258, 258, 4096, deflate_slow) / 9 max compression /\n];\n\n\n/ ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n /\nconst lm_init = (s) => {\n\n s.window_size = 2 s.w_size;\n\n /* CLEAR_HASH(s); /\n zero(s.head); // Fill with NIL (= 0);\n\n / Set the default configuration parameters:\n /\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n this.strm = null; / pointer back to this zlib stream /\n this.status = 0; / as the name implies /\n this.pending_buf = null; / output still pending /\n this.pending_buf_size = 0; / size of pending_buf /\n this.pending_out = 0; / next pending byte to output to the stream /\n this.pending = 0; / nb of bytes in the pending buffer /\n this.wrap = 0; / bit 0 true for zlib, bit 1 true for gzip /\n this.gzhead = null; / gzip header information to write /\n this.gzindex = 0; / where in extra, name, or comment /\n this.method = Z_DEFLATED$2; / can only be DEFLATED /\n this.last_flush = -1; / value of flush param for previous deflate call /\n\n this.w_size = 0; / LZ77 window size (32K by default) /\n this.w_bits = 0; / log2(w_size) (8..16) /\n this.w_mask = 0; / w_size - 1 /\n\n this.window = null;\n / Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n /\n\n this.window_size = 0;\n / Actual size of window: 2wSize, except when the user input buffer\n is directly used as sliding window.\n /\n\n this.prev = null;\n / Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n /\n\n this.head = null; / Heads of the hash chains or NIL. /\n\n this.ins_h = 0; / hash index of string to be inserted /\n this.hash_size = 0; / number of elements in hash table /\n this.hash_bits = 0; / log2(hash_size) /\n this.hash_mask = 0; / hash_size-1 /\n\n this.hash_shift = 0;\n / Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n /\n\n this.block_start = 0;\n / Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n /\n\n this.match_length = 0; / length of best match /\n this.prev_match = 0; / previous match /\n this.match_available = 0; / set if previous match exists /\n this.strstart = 0; / start of string to insert /\n this.match_start = 0; / start of matching string /\n this.lookahead = 0; / number of valid bytes ahead in window /\n\n this.prev_length = 0;\n / Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n /\n\n this.max_chain_length = 0;\n / To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n /\n\n this.max_lazy_match = 0;\n / Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n /\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n / Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n /\n\n this.level = 0; / compression level (1..9) /\n this.strategy = 0; / favor or force Huffman coding/\n\n this.good_match = 0;\n / Use a faster search when the previous match is longer than this /\n\n this.nice_match = 0; / Stop searching when current match exceeds this /\n\n / used by trees.c: /\n\n / Didn't use ct_data typedef below to suppress compiler warning /\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; / literal and length tree /\n // struct ct_data_s dyn_dtree[2D_CODES+1]; /* distance tree /\n // struct ct_data_s bl_tree[2BL_CODES+1]; /* Huffman tree for bit lengths /\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new Uint16Array(HEAP_SIZE 2);\n this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2);\n this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree /\n this.d_desc = null; / desc. for distance tree /\n this.bl_desc = null; / desc. for bit length tree /\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new Uint16Array(MAX_BITS + 1);\n / number of codes at each bit length for an optimal tree /\n\n //int heap[2L_CODES+1]; /* heap used to build the Huffman trees /\n this.heap = new Uint16Array(2 L_CODES + 1); /* heap used to build the Huffman trees /\n zero(this.heap);\n\n this.heap_len = 0; / number of elements in the heap /\n this.heap_max = 0; / element of largest frequency /\n / The sons of heap[n] are heap[2n] and heap[2n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n /\n\n this.depth = new Uint16Array(2 L_CODES + 1); //uch depth[2L_CODES+1];\n zero(this.depth);\n / Depth of each subtree used as tie breaker for trees of equal frequency\n /\n\n this.sym_buf = 0; / buffer for distances and literals/lengths /\n\n this.lit_bufsize = 0;\n / Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n /\n\n this.sym_next = 0; / running index in sym_buf /\n this.sym_end = 0; / symbol table full when sym_next reaches this /\n\n this.opt_len = 0; / bit length of current block with optimal trees /\n this.static_len = 0; / bit length of current block with static trees /\n this.matches = 0; / number of string matches in current block /\n this.insert = 0; / bytes at end of window left to insert /\n\n\n this.bi_buf = 0;\n / Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n /\n this.bi_valid = 0;\n / Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n /\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n / High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n /\n}\n\n\n/ =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n /\nconst deflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const s = strm.state;\n if (!s \|\| s.strm !== strm \|\| (s.status !== INIT_STATE &&\n//#ifdef GZIP\n s.status !== GZIP_STATE &&\n//#endif\n s.status !== EXTRA_STATE &&\n s.status !== NAME_STATE &&\n s.status !== COMMENT_STATE &&\n s.status !== HCRC_STATE &&\n s.status !== BUSY_STATE &&\n s.status !== FINISH_STATE)) {\n return 1;\n }\n return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n const s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n / was made negative by deflate(..., Z_FINISH); /\n }\n s.status =\n//#ifdef GZIP\n s.wrap === 2 ? GZIP_STATE :\n//#endif\n s.wrap ? INIT_STATE : BUSY_STATE;\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = -2;\n _tr_init(s);\n return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n const ret = deflateResetKeep(strm);\n if (ret === Z_OK$3) {\n lm_init(strm.state);\n }\n return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n if (deflateStateCheck(strm) \|\| strm.state.wrap !== 2) {\n return Z_STREAM_ERROR$2;\n }\n strm.state.gzhead = head;\n return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR$2;\n }\n let wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION$1) {\n level = 6;\n }\n\n if (windowBits < 0) { / suppress zlib wrapper /\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; / write gzip wrapper instead /\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 \|\| memLevel > MAX_MEM_LEVEL \|\| method !== Z_DEFLATED$2 \|\|\n windowBits < 8 \|\| windowBits > 15 \|\| level < 0 \|\| level > 9 \|\|\n strategy < 0 \|\| strategy > Z_FIXED \|\| (windowBits === 8 && wrap !== 1)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n / until 256-byte window bug fixed /\n\n const s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n s.status = INIT_STATE; / to pass state test in deflateReset() /\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new Uint8Array(s.w_size 2);\n s.head = new Uint16Array(s.hash_size);\n s.prev = new Uint16Array(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet /\n\n s.lit_bufsize = 1 << (memLevel + 6); / 16K elements by default /\n\n / We overlay pending_buf and sym_buf. This works since the average size\n * for length/distance pairs over any compressed block is assured to be 31\n * bits or less.\n \n Analysis: The longest fixed codes are a length code of 8 bits plus 5\n * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n * possible fixed-codes length/distance pair is then 31 bits total.\n \n sym_buf starts one-fourth of the way into pending_buf. So there are\n * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n * in sym_buf is three bytes -- two for the distance and one for the\n * literal/length. As each symbol is consumed, the pointer to the next\n * sym_buf value to read moves forward three bytes. From that symbol, up to\n * 31 bits are written to pending_buf. The closest the written pending_buf\n * bits gets to the next sym_buf symbol to read is just before the last\n * code is written. At that time, 31(n-2) bits have been written, just\n after 24(n-2) bits have been consumed from sym_buf. sym_buf starts at\n 8n bits into pending_buf. (Note that the symbol buffer fills when n-1\n symbols are written.) The closest the writing gets to what is unread is\n * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n * can range from 128 to 32768.\n \n Therefore, at a minimum, there are 142 bits of space between what is\n * written and what is read in the overlain buffers, so the symbols cannot\n * be overwritten by the compressed data. That space is actually 139 bits,\n * due to the three-bit fixed-code block header.\n \n That covers the case where either Z_FIXED is specified, forcing fixed\n * codes, or when the use of fixed codes is chosen, because that choice\n * results in a smaller compressed block than dynamic codes. That latter\n * condition then assures that the above analysis also covers all dynamic\n * blocks. A dynamic-code block will only be chosen to be emitted if it has\n * fewer bits than a fixed-code block would for the same set of symbols.\n * Therefore its average symbol length is assured to be less than 31. So\n * the compressed data for a dynamic block also cannot overwrite the\n * symbols from which it is being constructed.\n /\n\n s.pending_buf_size = s.lit_bufsize 4;\n s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->sym_buf = s->pending_buf + s->lit_bufsize;\n s.sym_buf = s.lit_bufsize;\n\n //s->sym_end = (s->lit_bufsize - 1) * 3;\n s.sym_end = (s.lit_bufsize - 1) * 3;\n /* We avoid equality with lit_bufsize3 because of wraparound at 64K\n on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n /\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/ ========================================================================= /\nconst deflate$2 = (strm, flush) => {\n\n if (deflateStateCheck(strm) \|\| flush > Z_BLOCK$1 \|\| flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n\n if (!strm.output \|\|\n (strm.avail_in !== 0 && !strm.input) \|\|\n (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n }\n\n const old_flush = s.last_flush;\n s.last_flush = flush;\n\n / Flush as much pending output as possible /\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n / Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n /\n s.last_flush = -1;\n return Z_OK$3;\n }\n\n / Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n /\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH$3) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n / User must not provide more input after the first FINISH: /\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n / Write the header /\n if (s.status === INIT_STATE && s.wrap === 0) {\n s.status = BUSY_STATE;\n }\n if (s.status === INIT_STATE) {\n / zlib header /\n let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n let level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY \|\| s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header \|= (level_flags << 6);\n if (s.strstart !== 0) { header \|= PRESET_DICT; }\n header += 31 - (header % 31);\n\n putShortMSB(s, header);\n\n / Save the adler32 of the preset dictionary: /\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n\n / Compression must start with an empty pending buffer /\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#ifdef GZIP\n if (s.status === GZIP_STATE) {\n / gzip header /\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY \|\| s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n\n / Compression must start with an empty pending buffer /\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY \|\| s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/ != Z_NULL/) {\n let beg = s.pending; / start of bytes to update crc /\n let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n while (s.pending + left > s.pending_buf_size) {\n let copy = s.pending_buf_size - s.pending;\n // zmemcpy(s.pending_buf + s.pending,\n // s.gzhead.extra + s.gzindex, copy);\n s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n s.pending = s.pending_buf_size;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex += copy;\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n left -= copy;\n }\n // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n // TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n let gzhead_extra = new Uint8Array(s.gzhead.extra);\n // zmemcpy(s->pending_buf + s->pending,\n // s->gzhead->extra + s->gzindex, left);\n s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n s.pending += left;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = NAME_STATE;\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/ != Z_NULL/) {\n let beg = s.pending; / start of bytes to update crc /\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = COMMENT_STATE;\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/ != Z_NULL/) {\n let beg = s.pending; / start of bytes to update crc /\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n }\n s.status = HCRC_STATE;\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n }\n s.status = BUSY_STATE;\n\n / Compression must start with an empty pending buffer /\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#endif\n\n / Start a new block or continue the current one.\n /\n if (strm.avail_in !== 0 \|\| s.lookahead !== 0 \|\|\n (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n let bstate = s.level === 0 ? deflate_stored(s, flush) :\n s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush);\n\n if (bstate === BS_FINISH_STARTED \|\| bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE \|\| bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n / avoid BUF_ERROR next call, see above /\n }\n return Z_OK$3;\n / If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n /\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n _tr_align(s);\n }\n else if (flush !== Z_BLOCK$1) { / FULL_FLUSH or SYNC_FLUSH /\n\n _tr_stored_block(s, 0, 0, false);\n / For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n /\n if (flush === Z_FULL_FLUSH$1) {\n / CLEAR_HASH(s); / / forget history /\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; / avoid BUF_ERROR at next call, see above /\n return Z_OK$3;\n }\n }\n }\n\n if (flush !== Z_FINISH$3) { return Z_OK$3; }\n if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n / Write the trailer /\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n / If avail_out is zero, the application will call deflate again\n * to flush the rest.\n /\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n / write the trailer only once! /\n return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const status = strm.state.status;\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/ =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n /\nconst deflateSetDictionary = (strm, dictionary) => {\n\n let dictLength = dictionary.length;\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n const wrap = s.wrap;\n\n if (wrap === 2 \|\| (wrap === 1 && s.status !== INIT_STATE) \|\| s.lookahead) {\n return Z_STREAM_ERROR$2;\n }\n\n / when using zlib wrappers, compute Adler-32 for provided dictionary /\n if (wrap === 1) {\n / adler32(strm->adler, dictionary, dictLength); /\n strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; / avoid computing Adler-32 in read_buf /\n\n / if dictionary would fill window, just replace the history /\n if (dictLength >= s.w_size) {\n if (wrap === 0) { / already empty otherwise /\n / CLEAR_HASH(s); /\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n / use the tail /\n // dictionary = dictionary.slice(dictLength - s.w_size);\n let tmpDict = new Uint8Array(s.w_size);\n tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n / insert dictionary into window and hash /\n const avail = strm.avail_in;\n const next = strm.next_in;\n const input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n let str = s.strstart;\n let n = s.lookahead - (MIN_MATCH - 1);\n do {\n / UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); /\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/ Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /from1, from2, from3, .../) {\n const sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n const source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (const p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n // calculate data length\n let len = 0;\n\n for (let i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n const result = new Uint8Array(len);\n\n for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n let chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n return new TextEncoder().encode(str);\n }\n\n let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new Uint8Array(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n / one byte /\n buf[i++] = c;\n } else if (c < 0x800) {\n / two bytes /\n buf[i++] = 0xC0 \| (c >>> 6);\n buf[i++] = 0x80 \| (c & 0x3f);\n } else if (c < 0x10000) {\n / three bytes /\n buf[i++] = 0xE0 \| (c >>> 12);\n buf[i++] = 0x80 \| (c >>> 6 & 0x3f);\n buf[i++] = 0x80 \| (c & 0x3f);\n } else {\n / four bytes /\n buf[i++] = 0xf0 \| (c >>> 18);\n buf[i++] = 0x80 \| (c >>> 12 & 0x3f);\n buf[i++] = 0x80 \| (c >>> 6 & 0x3f);\n buf[i++] = 0x80 \| (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if (buf.subarray && STR_APPLY_UIA_OK) {\n return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n }\n }\n\n let result = '';\n for (let i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n const len = max \|\| buf.length;\n\n if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n return new TextDecoder().decode(buf.subarray(0, max));\n }\n\n let i, out;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n const utf16buf = new Array(len 2);\n\n for (out = 0, i = 0; i < len;) {\n let c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n let c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) \| (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 \| ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 \| (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n max = max \|\| buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n let pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte /\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n / number of bytes available at input /\n this.avail_in = 0;\n / total number of input bytes read so far /\n this.total_in = 0;\n / next output byte should be put there /\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n / remaining free space at output /\n this.avail_out = 0;\n / total number of bytes output so far /\n this.total_out = 0;\n / last error message, NULL if no error /\n this.msg = ''/Z_NULL/;\n / not visible by applications /\n this.state = null;\n / best guess about the data type: binary or text /\n this.data_type = 2/Z_UNKNOWN/;\n / adler32 value of the uncompressed data /\n this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n Z_DEFAULT_COMPRESSION,\n Z_DEFAULT_STRATEGY,\n Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/ ===========================================================================/\n\n\n/\n class Deflate\n \n Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n */\n\n/ internal\n * Deflate.chunks -> Array\n \n Chunks of output data, if [[Deflate#onData]] not overridden.\n /\n\n/\n * Deflate.result -> Uint8Array\n \n Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n /\n\n/\n * Deflate.err -> Number\n \n Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n /\n\n/\n * Deflate.msg -> String\n \n Error message, if [[Deflate.err]] != 0\n /\n\n\n/\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n \n Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n \n - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n \n Additional options, for internal needs:\n \n - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n \n ##### Example:\n \n ```javascript\n * const pako = require('pako')\n * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n \n const deflate = new pako.Deflate({ level: 3});\n \n deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n \n if (deflate.err) { throw new Error(deflate.err); }\n \n console.log(deflate.result);\n * ```\n /\nfunction Deflate$1(options) {\n this.options = common.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED$1,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY\n }, options \|\| {});\n\n let opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = deflate_1$2.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n if (opt.header) {\n deflate_1$2.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n let dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array\|ArrayBuffer\|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - flush_mode (Number\|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n \n Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n \n On fail call [[Deflate#onEnd]] with error code and return false.\n \n ##### Example\n \n ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n /\nDeflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n let status, _flush_mode;\n\n if (this.ended) { return false; }\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n // Make sure avail_out > 6 to avoid repeating markers\n if ((_flush_mode === Z_SYNC_FLUSH \|\| _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n status = deflate_1$2.deflate(strm, _flush_mode);\n\n // Ended => flush and finish\n if (status === Z_STREAM_END$2) {\n if (strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n }\n status = deflate_1$2.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK$2;\n }\n\n // Flush if out buffer full\n if (strm.avail_out === 0) {\n this.onData(strm.output);\n continue;\n }\n\n // Flush if requested and has data\n if (_flush_mode > 0 && strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n \n By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n /\nDeflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n \n Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n /\nDeflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK$2) {\n this.result = common.flattenChunks(this.chunks);\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array\|ArrayBuffer\|String): input data to compress.\n * - options (Object): zlib deflate options.\n \n Compress `data` with deflate algorithm and `options`.\n \n Supported options are:\n \n - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n \n Sugar (options):\n \n - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n \n ##### Example:\n \n ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n \n console.log(pako.deflate(data));\n * ```\n /\nfunction deflate$1(input, options) {\n const deflator = new Deflate$1(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg \|\| messages[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array\|ArrayBuffer\|String): input data to compress.\n * - options (Object): zlib deflate options.\n \n The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n /\nfunction deflateRaw$1(input, options) {\n options = options \|\| {};\n options.raw = true;\n return deflate$1(input, options);\n}\n\n\n/\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array\|ArrayBuffer\|String): input data to compress.\n * - options (Object): zlib deflate options.\n \n The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n */\nfunction gzip$1(input, options) {\n options = options \|\| {};\n options.gzip = true;\n return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209; / got a data error -- remain here until reset /\nconst TYPE$1 = 16191; / i: waiting for type bits, including last-flag bit /\n\n/\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n /\nvar inffast = function inflate_fast(strm, start) {\n let _in; / local strm.input /\n let last; / have enough input while in < last /\n let _out; / local strm.output /\n let beg; / inflate()'s initial strm.output /\n let end; / while out < end, enough space available /\n//#ifdef INFLATE_STRICT\n let dmax; / maximum distance from zlib header /\n//#endif\n let wsize; / window size or zero if not using window /\n let whave; / valid bytes in the window /\n let wnext; / window write index /\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n let s_window; / allocated sliding window, if wsize != 0 /\n let hold; / local strm.hold /\n let bits; / local strm.bits /\n let lcode; / local strm.lencode /\n let dcode; / local strm.distcode /\n let lmask; / mask for first level of length codes /\n let dmask; / mask for first level of distance codes /\n let here; / retrieved table entry /\n let op; / code bits, operation, extra bits, or /\n / window position, window bytes to copy /\n let len; / match length, unused bytes /\n let dist; / match distance /\n let from; / where to copy match from /\n let from_source;\n\n\n let input, output; // JS specific, because we have no pointers\n\n / copy state to local variables /\n const state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n / decode literals and length/distances until end-of-block or not enough\n input data or output space /\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/here.bits/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/here.op/;\n if (op === 0) { / literal /\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/here.val/;\n }\n else if (op & 16) { / length base /\n len = here & 0xffff/here.val/;\n op &= 15; / number of extra bits /\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/here.bits/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/here.op/;\n\n if (op & 16) { / distance base /\n dist = here & 0xffff/here.val/;\n op &= 15; / number of extra bits /\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; / max distance in output /\n if (dist > op) { / see if copy from window /\n op = dist - op; / distance back in window /\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { / very common case /\n from += wsize - op;\n if (op < len) { / some from window /\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; / rest from output /\n from_source = output;\n }\n }\n else if (wnext < op) { / wrap around window /\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { / some from end of window /\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { / some from start of window /\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; / rest from output /\n from_source = output;\n }\n }\n }\n else { / contiguous in window /\n from += wnext - op;\n if (op < len) { / some from window /\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; / rest from output /\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; / copy direct from output /\n do { / minimum length is three /\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { / 2nd level distance code /\n here = dcode[(here & 0xffff)/here.val/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { / 2nd level length code /\n here = lcode[(here & 0xffff)/here.val/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { / end-of-block /\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE$1;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n / return unused bytes (on entry, bits < 8, so in won't go too far back) /\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n / update state and return /\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ / Length codes 257..285 base /\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ / Length codes 257..285 extra /\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ / Distance codes 0..29 base /\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ / Distance codes 0..29 extra /\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n const bits = opts.bits;\n //here = opts.here; / table entry for duplication /\n\n let len = 0; / a code's length in bits /\n let sym = 0; / index of code symbols /\n let min = 0, max = 0; / minimum and maximum code lengths /\n let root = 0; / number of index bits for root table /\n let curr = 0; / number of index bits for current table /\n let drop = 0; / code bits to drop for sub-table /\n let left = 0; / number of prefix codes available /\n let used = 0; / code entries in table used /\n let huff = 0; / Huffman code /\n let incr; / for incrementing code, index /\n let fill; / index for replicating entries /\n let low; / low bits for current root entry /\n let mask; / mask for low root bits /\n let next; / next available space in table /\n let base = null; / base value table to use /\n// let shoextra; / extra bits table to use /\n let match; / use base and extra for symbol >= match /\n const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; / number of codes of each length /\n const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; / offsets in table for each length /\n let extra = null;\n\n let here_bits, here_op, here_val;\n\n /\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n /\n\n / accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) /\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n / bound code lengths, force root to be within code lengths /\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { / no symbols to code at all /\n //table.op[opts.table_index] = 64; //here.op = (var char)64; / invalid code marker /\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) \| (64 << 16) \| 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) \| (64 << 16) \| 0;\n\n opts.bits = 1;\n return 0; / no symbols, but wait for decoding to report error /\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n / check for an over-subscribed or incomplete set of lengths /\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } / over-subscribed /\n }\n if (left > 0 && (type === CODES$1 \|\| max !== 1)) {\n return -1; / incomplete set /\n }\n\n / generate offsets into symbol table for each length for sorting /\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n / sort symbols by length, by symbol order within each length /\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n /\n\n /* set up for code type /\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES$1) {\n base = extra = work; / dummy value--not used /\n match = 20;\n\n } else if (type === LENS$1) {\n base = lbase;\n extra = lext;\n match = 257;\n\n } else { / DISTS /\n base = dbase;\n extra = dext;\n match = 0;\n }\n\n / initialize opts for loop /\n huff = 0; / starting code /\n sym = 0; / starting code symbol /\n len = min; / starting code length /\n next = table_index; / current table to fill in /\n curr = root; / current table index bits /\n drop = 0; / current bits to drop from code for index /\n low = -1; / trigger new sub-table when len > root /\n used = 1 << root; / use root table entries /\n mask = used - 1; / mask for comparing low /\n\n / check available table space /\n if ((type === LENS$1 && used > ENOUGH_LENS$1) \|\|\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n / process all codes and make table entries /\n for (;;) {\n / create table entry /\n here_bits = len - drop;\n if (work[sym] + 1 < match) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] >= match) {\n here_op = extra[work[sym] - match];\n here_val = base[work[sym] - match];\n }\n else {\n here_op = 32 + 64; / end of block /\n here_val = 0;\n }\n\n / replicate for those indices with low len bits equal to huff /\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; / save offset to next table /\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) \| (here_op << 16) \| here_val \|0;\n } while (fill !== 0);\n\n / backwards increment the len-bit code huff /\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n / go to next symbol, update count, len /\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n / create new sub-table if needed /\n if (len > root && (huff & mask) !== low) {\n / if first time, transition to sub-tables /\n if (drop === 0) {\n drop = root;\n }\n\n / increment past last table /\n next += min; / here min is 1 << curr /\n\n / determine length of next table /\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n / check for enough space /\n used += 1 << curr;\n if ((type === LENS$1 && used > ENOUGH_LENS$1) \|\|\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n / point entry in root table to sub-table /\n low = huff & mask;\n /table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;/\n table[low] = (root << 24) \| (curr << 16) \| (next - table_index) \|0;\n }\n }\n\n / fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) /\n if (huff !== 0) {\n //table.op[next + huff] = 64; / invalid code marker /\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) \| (64 << 16) \|0;\n }\n\n / set return parameters /\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n Z_DEFLATED\n} = constants$2;\n\n\n/ STATES ====================================================================/\n/ ===========================================================================/\n\n\nconst HEAD = 16180; / i: waiting for magic header /\nconst FLAGS = 16181; / i: waiting for method and flags (gzip) /\nconst TIME = 16182; / i: waiting for modification time (gzip) /\nconst OS = 16183; / i: waiting for extra flags and operating system (gzip) /\nconst EXLEN = 16184; / i: waiting for extra length (gzip) /\nconst EXTRA = 16185; / i: waiting for extra bytes (gzip) /\nconst NAME = 16186; / i: waiting for end of file name (gzip) /\nconst COMMENT = 16187; / i: waiting for end of comment (gzip) /\nconst HCRC = 16188; / i: waiting for header crc (gzip) /\nconst DICTID = 16189; / i: waiting for dictionary check value /\nconst DICT = 16190; / waiting for inflateSetDictionary() call /\nconst TYPE = 16191; / i: waiting for type bits, including last-flag bit /\nconst TYPEDO = 16192; / i: same, but skip check to exit inflate on new block /\nconst STORED = 16193; / i: waiting for stored size (length and complement) /\nconst COPY_ = 16194; / i/o: same as COPY below, but only first time in /\nconst COPY = 16195; / i/o: waiting for input or output to copy stored block /\nconst TABLE = 16196; / i: waiting for dynamic block table lengths /\nconst LENLENS = 16197; / i: waiting for code length code lengths /\nconst CODELENS = 16198; / i: waiting for length/lit and distance code lengths /\nconst LEN_ = 16199; / i: same as LEN below, but only first time in /\nconst LEN = 16200; / i: waiting for length/lit/eob code /\nconst LENEXT = 16201; / i: waiting for length extra bits /\nconst DIST = 16202; / i: waiting for distance code /\nconst DISTEXT = 16203; / i: waiting for distance extra bits /\nconst MATCH = 16204; / o: waiting for output space to copy string /\nconst LIT = 16205; / o: waiting for output space to write literal /\nconst CHECK = 16206; / i: waiting for 32-bit check value /\nconst LENGTH = 16207; / i: waiting for 32-bit length (gzip) /\nconst DONE = 16208; / finished check, done -- remain here until reset /\nconst BAD = 16209; / got a data error -- remain here until reset /\nconst MEM = 16210; / got an inflate() memory error -- remain here until reset /\nconst SYNC = 16211; / looking for synchronization bytes to restart inflate() /\n\n/ ===========================================================================/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/ 32K LZ77 window /\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n this.strm = null; / pointer back to this zlib stream /\n this.mode = 0; / current inflate mode /\n this.last = false; / true if processing last block /\n this.wrap = 0; / bit 0 true for zlib, bit 1 true for gzip,\n bit 2 true to validate check value /\n this.havedict = false; / true if dictionary provided /\n this.flags = 0; / gzip header method and flags (0 if zlib), or\n -1 if raw or no header yet /\n this.dmax = 0; / zlib header max distance (INFLATE_STRICT) /\n this.check = 0; / protected copy of check value /\n this.total = 0; / protected copy of output count /\n // TODO: may be {}\n this.head = null; / where to save gzip header information /\n\n / sliding window /\n this.wbits = 0; / log base 2 of requested window size /\n this.wsize = 0; / window size or zero if not using window /\n this.whave = 0; / valid bytes in the window /\n this.wnext = 0; / window write index /\n this.window = null; / allocated sliding window, if needed /\n\n / bit accumulator /\n this.hold = 0; / input bit accumulator /\n this.bits = 0; / number of bits in \"in\" /\n\n / for string and stored block copying /\n this.length = 0; / literal or length of data to copy /\n this.offset = 0; / distance back to copy string from /\n\n / for table and code decoding /\n this.extra = 0; / extra bits needed /\n\n / fixed and dynamic code tables /\n this.lencode = null; / starting table for length/literal codes /\n this.distcode = null; / starting table for distance codes /\n this.lenbits = 0; / index bits for lencode /\n this.distbits = 0; / index bits for distcode /\n\n / dynamic table building /\n this.ncode = 0; / number of code length code lengths /\n this.nlen = 0; / number of length code lengths /\n this.ndist = 0; / number of distance code lengths /\n this.have = 0; / number of code lengths in lens[] /\n this.next = null; / next available space in codes[] /\n\n this.lens = new Uint16Array(320); / temporary storage for code lengths /\n this.work = new Uint16Array(288); / work area for code table building /\n\n /\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n /\n //this.codes = new Int32Array(ENOUGH); / space for code tables /\n this.lendyn = null; / dynamic table for length/literal codes (JS specific) /\n this.distdyn = null; / dynamic table for distance codes (JS specific) /\n this.sane = 0; / if false, allow invalid distance too far /\n this.back = 0; / bits back of last unprocessed length/lit /\n this.was = 0; / initial length of match /\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const state = strm.state;\n if (!state \|\| state.strm !== strm \|\|\n state.mode < HEAD \|\| state.mode > SYNC) {\n return 1;\n }\n return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /Z_NULL/\n if (state.wrap) { / to support ill-conceived Java test suite /\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.flags = -1;\n state.dmax = 32768;\n state.head = null/Z_NULL/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n let wrap;\n\n / get the state /\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n\n / extract wrap request from windowBits parameter /\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 5;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n / set number of window bits, free window if different /\n if (windowBits && (windowBits < 8 \|\| windowBits > 15)) {\n return Z_STREAM_ERROR$1;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n / update state and reset the rest of it /\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n if (!strm) { return Z_STREAM_ERROR$1; }\n //strm.msg = Z_NULL; / in case we return an error /\n\n const state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.strm = strm;\n state.window = null/Z_NULL/;\n state.mode = HEAD; / to pass state test in inflateReset2() /\n const ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK$1) {\n strm.state = null/Z_NULL/;\n }\n return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n /\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n / build fixed huffman tables if first call (may not be thread safe) /\n if (virgin) {\n lenfix = new Int32Array(512);\n distfix = new Int32Array(32);\n\n / literal/length table /\n let sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n / distance table /\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n / do this just once /\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n};\n\n\n/\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n /\nconst updatewindow = (strm, src, end, copy) => {\n\n let dist;\n const state = strm.state;\n\n / if it hasn't been done already, allocate space for the window /\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new Uint8Array(state.wsize);\n }\n\n / copy state->wsize or less output bytes into the circular window /\n if (copy >= state.wsize) {\n state.window.set(src.subarray(end - state.wsize, end), 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n state.window.set(src.subarray(end - copy, end), 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n let state;\n let input, output; // input/output buffers\n let next; / next input INDEX /\n let put; / next output INDEX /\n let have, left; / available input and output /\n let hold; / bit buffer /\n let bits; / bits in bit buffer /\n let _in, _out; / save starting available input and output /\n let copy; / number of stored or match bytes to copy /\n let from; / where to copy match bytes from /\n let from_source;\n let here = 0; / current decoding table entry /\n let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //let last; / parent table entry /\n let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n let len; / length to copy for repeats, bits to drop /\n let ret; / return code /\n const hbuf = new Uint8Array(4); / buffer for gzip header crc calculation /\n let opts;\n\n let n; // temporary variable for NEED_BITS\n\n const order = / permutation of code lengths /\n new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n if (inflateStateCheck(strm) \|\| !strm.output \|\|\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR$1;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } / skip check /\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK$1;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { / gzip header /\n if (state.wbits === 0) {\n state.wbits = 15;\n }\n state.check = 0/crc32(0L, Z_NULL, 0)/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) \|\| / check if zlib header allowed /\n (((hold & 0xff)/BITS(8)/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/BITS(4)/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/BITS(4)/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n if (len > 15 \|\| len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n // !!! pako patch. Force use `options.windowBits` if passed.\n // Required to always use max window size by default.\n state.dmax = 1 << state.wbits;\n //state.dmax = 1 << len;\n\n state.flags = 0; / indicate zlib header /\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/adler32(0L, Z_NULL, 0)/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through /\n case TIME:\n //=== NEEDBITS(32); /\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32_1(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through /\n case OS:\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through /\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/Z_NULL/;\n }\n state.mode = EXTRA;\n /* falls through /\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Uint8Array(state.head.extra_len);\n }\n state.head.extra.set(\n input.subarray(\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n next + copy\n ),\n /len + copy > state.head.extra_max - len ? state.head.extra_max : copy,/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n / falls through /\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n / use constant limit because in js we should not preallocate memory /\n if (state.head && len &&\n (state.length < 65536 /state.head.name_max/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n / falls through /\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n / use constant limit because in js we should not preallocate memory /\n if (state.head && len &&\n (state.length < 65536 /state.head.comm_max/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n / falls through /\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); /\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); /\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n / falls through /\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT$1;\n }\n strm.adler = state.check = 1/adler32(0L, Z_NULL, 0)/;\n state.mode = TYPE;\n / falls through /\n case TYPE:\n if (flush === Z_BLOCK \|\| flush === Z_TREES) { break inf_leave; }\n / falls through /\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); /\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/BITS(1)/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/BITS(2)/) {\n case 0: /* stored block /\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: / fixed block /\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; / decode codes /\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: / dynamic block /\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// / go to byte boundary /\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); /\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through /\n case COPY_:\n state.mode = COPY;\n / falls through /\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n output.set(input.subarray(next, next + copy), put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); /\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/BITS(5)/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/BITS(5)/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/BITS(4)/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 \|\| state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through /\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n / falls through /\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/BITS(state.lenbits)/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n / handle error breaks in while /\n if (state.mode === BAD) { break; }\n\n / check for end-of-block code (better have one) /\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n / build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values /\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n / falls through /\n case LEN_:\n state.mode = LEN;\n / falls through /\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inffast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /BITS(state.lenbits)/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/BITS(last.bits + last.op)/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n / falls through /\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/BITS(state.extra)/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n / falls through /\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/BITS(state.distbits)/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/BITS(last.bits + last.op)/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n / falls through /\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/BITS(state.extra)/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n / falls through /\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { / copy from window /\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { / copy from output /\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '\|' instead of '+' to make sure that result is signed\n hold \|= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check =\n /UPDATE_CHECK(state.check, put - _out, _out);/\n (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n / falls through /\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n / falls through /\n case DONE:\n ret = Z_STREAM_END$1;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR$1;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR$1;\n case SYNC:\n / falls through /\n default:\n return Z_STREAM_ERROR$1;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n /\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize \|\| (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK \|\| flush !== Z_FINISH$1))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check = /UPDATE_CHECK(state.check, strm.next_out - _out, _out);/\n (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ \|\| state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) \|\| flush === Z_FINISH$1) && ret === Z_OK$1) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n if (inflateStateCheck(strm)) {\n return Z_STREAM_ERROR$1;\n }\n\n let state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n / check state /\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n / save header structure /\n state.head = head;\n head.done = false;\n return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n const dictLength = dictionary.length;\n\n let state;\n let dictid;\n let ret;\n\n / check state /\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR$1;\n }\n\n / check for correct dictionary identifier /\n if (state.mode === DICT) {\n dictid = 1; / adler32(0, null, 0)/\n / dictid = adler32(dictid, dictionary, dictLength); /\n dictid = adler32_1(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR$1;\n }\n }\n / copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate /\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR$1;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/ Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n / true if compressed data believed to be text /\n this.text = 0;\n / modification time /\n this.time = 0;\n / extra flags (not used when writing a gzip file) /\n this.xflags = 0;\n / operating system /\n this.os = 0;\n / pointer to extra field or Z_NULL if none /\n this.extra = null;\n / extra field length (valid if extra != Z_NULL) /\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n / space at extra (only when reading header) /\n // this.extra_max = 0;\n / pointer to zero-terminated file name or Z_NULL /\n this.name = '';\n / space at name (only when reading header) /\n // this.name_max = 0;\n / pointer to zero-terminated comment or Z_NULL /\n this.comment = '';\n / space at comment (only when reading header) /\n // this.comm_max = 0;\n / true if there was or will be a header crc /\n this.hcrc = 0;\n / true when done reading gzip header (not used when writing a gzip file) /\n this.done = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/ Public constants ==========================================================/\n/ ===========================================================================/\n\nconst {\n Z_NO_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/ ===========================================================================/\n\n\n/\n class Inflate\n \n Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n */\n\n/ internal\n * inflate.chunks -> Array\n \n Chunks of output data, if [[Inflate#onData]] not overridden.\n /\n\n/\n * Inflate.result -> Uint8Array\|String\n \n Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n /\n\n/\n * Inflate.err -> Number\n \n Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n /\n\n/\n * Inflate.msg -> String\n \n Error message, if [[Inflate.err]] != 0\n /\n\n\n/\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n \n Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n \n - `windowBits`\n * - `dictionary`\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n \n Additional options, for internal needs:\n \n - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n \n By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n \n ##### Example:\n \n ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n \n const inflate = new pako.Inflate({ level: 3});\n \n inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n \n if (inflate.err) { throw new Error(inflate.err); }\n \n console.log(inflate.result);\n * ```\n */\nfunction Inflate$1(options) {\n this.options = common.assign({\n chunkSize: 1024 64,\n windowBits: 15,\n to: ''\n }, options \|\| {});\n\n const opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits \|= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = inflate_1$2.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n\n this.header = new gzheader();\n\n inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n }\n }\n}\n\n/*\n Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array\|ArrayBuffer): input data\n * - flush_mode (Number\|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n * `true` means Z_FINISH.\n \n Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n \n `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n \n On fail call [[Inflate#onEnd]] with error code and return false.\n \n ##### Example\n \n ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n /\nInflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n const dictionary = this.options.dictionary;\n let status, _flush_mode, last_avail_out;\n\n if (this.ended) return false;\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = inflate_1$2.inflate(strm, _flush_mode);\n\n if (status === Z_NEED_DICT && dictionary) {\n status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n if (status === Z_OK) {\n status = inflate_1$2.inflate(strm, _flush_mode);\n } else if (status === Z_DATA_ERROR) {\n // Replace code with more verbose\n status = Z_NEED_DICT;\n }\n }\n\n // Skip snyc markers if more data follows and not raw mode\n while (strm.avail_in > 0 &&\n status === Z_STREAM_END &&\n strm.state.wrap > 0 &&\n data[strm.next_in] !== 0)\n {\n inflate_1$2.inflateReset(strm);\n status = inflate_1$2.inflate(strm, _flush_mode);\n }\n\n switch (status) {\n case Z_STREAM_ERROR:\n case Z_DATA_ERROR:\n case Z_NEED_DICT:\n case Z_MEM_ERROR:\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n // Remember real `avail_out` value, because we may patch out buffer content\n // to align utf8 strings boundaries.\n last_avail_out = strm.avail_out;\n\n if (strm.next_out) {\n if (strm.avail_out === 0 \|\| status === Z_STREAM_END) {\n\n if (this.options.to === 'string') {\n\n let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n let tail = strm.next_out - next_out_utf8;\n let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail & realign counters\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n this.onData(utf8str);\n\n } else {\n this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n }\n }\n }\n\n // Must repeat iteration if out buffer is full\n if (status === Z_OK && last_avail_out === 0) continue;\n\n // Finalize if end of stream reached.\n if (status === Z_STREAM_END) {\n status = inflate_1$2.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return true;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array\|String): output data. When string output requested,\n * each chunk will be string.\n \n By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n /\nInflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n \n Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n /\nInflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = common.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/\n * inflate(data[, options]) -> Uint8Array\|String\n * - data (Uint8Array\|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n \n Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n \n Supported options are:\n \n - windowBits\n \n [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n \n Sugar (options):\n \n - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n \n \n * ##### Example:\n \n ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n \n try {\n * output = pako.inflate(input);\n * } catch (err) {\n * console.log(err);\n * }\n * ```\n /\nfunction inflate$1(input, options) {\n const inflator = new Inflate$1(options);\n\n inflator.push(input);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) throw inflator.msg \|\| messages[inflator.err];\n\n return inflator.result;\n}\n\n\n/\n * inflateRaw(data[, options]) -> Uint8Array\|String\n * - data (Uint8Array\|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n \n The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n /\nfunction inflateRaw$1(input, options) {\n options = options \|\| {};\n options.raw = true;\n return inflate$1(input, options);\n}\n\n\n/\n * ungzip(data[, options]) -> Uint8Array\|String\n * - data (Uint8Array\|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n \n Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n /\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","/\n * Errors from Anima API, common across multiple routes.\n /\nexport type CommonApiError =\n \| \"Missing Authorization header\"\n \| \"Invalid Authorization header\"\n \| \"Missing teamId\"\n \| \"Internal server error\"\n \| \"Forbidden, no team access\"\n \| \"Requested Usage Exceeds Limit\"\n \| \"Too many concurrent jobs\"\n \| \"Invalid Anima token\"\n \| \"Job not found\"\n \| \"Code generation failed\";\n\n/\n Codegen errors from the worker\n /\nexport type GetCodeFromFigmaErrorReason =\n \| \"Selected node type is not supported\"\n \| \"Invisible group nodes are unsupported\"\n \| \"Selected node is a page with multiple children\"\n \| \"Selected node is a page with no valid children\"\n \| \"There is no node with the given id\"\n \| \"Invalid Figma token\"\n \| \"Anima API connection error\"\n \| \"Figma token expired\"\n \| \"Invalid user token\"\n \| \"Figma file not found\"\n \| \"Figma rate limit exceeded\"\n \| \"Figma selection too large\"\n \| \"Invalid responsive page node type\"\n \| \"Unknown\";\n\n/\n Codegen errors from the \"/codegen\" route\n /\nexport type CodegenRouteErrorReason =\n \| \"Not all frames id from responsive pages are mentioned on the nodes id list\"\n \| \"Too many screens to import\";\n\n/\n Errors from the SDK\n /\nexport type SDKErrorReason =\n \| \"Invalid body payload\"\n \| \"Connection closed before the 'done' message\"\n \| \"Response body is null\";\n\n/\n Errors from the Website To Code Flow\n /\nexport type GetCodeFromWebsiteErrorReason = \"Scraping is blocked\" \| \"Unknown\";\n\n/\n Errors from the Prompt To Code Flow\n /\nexport type GetCodeFromPromptErrorReason =\n \| \"Invalid prompt\"\n \| \"Generation failed\"\n \| \"Unknown\";\n\nexport class CodegenError extends Error {\n status?: number;\n detail?: unknown;\n\n constructor({\n name,\n reason,\n status,\n detail,\n }: {\n name: string;\n reason:\n \| CommonApiError\n \| GetCodeFromFigmaErrorReason\n \| CodegenRouteErrorReason\n \| SDKErrorReason\n \| GetCodeFromWebsiteErrorReason\n \| GetCodeFromPromptErrorReason;\n status?: number;\n detail?: unknown;\n }) {\n super();\n this.name = name;\n this.message = reason;\n this.detail = detail;\n this.status = status;\n }\n}\n\n/\n Figma REST API Errors\n /\n\nexport class MalformattedFigmaToken extends Error {\n constructor() {\n super(\"Malformatted Figma Token\");\n }\n}\n\nexport class MissingFigmaToken extends Error {\n constructor() {\n super(\"Missing Figma Token\");\n }\n}\n\nexport class NeedsReauthFigmaToken extends Error {\n constructor() {\n super(\"Needs Reauth Figma Token\");\n }\n}\n\nexport class ExpiredFigmaToken extends Error {\n constructor() {\n super(\"Expired Figma Token\");\n }\n}\n\nexport class FileNotExportable extends Error {\n constructor() {\n super(\"File Not Exportable\");\n }\n}\n\nexport class UnknownForbiddenFigmaError extends Error {\n reason: string \| null;\n\n constructor({ reason }: { reason: string \| null }) {\n super(\"Unknown Forbidden Figma Error\");\n\n this.reason = reason;\n }\n}\n\nconst notFoundErrorMessage = \"Not Found\";\nexport class NotFound extends Error {\n constructor({ cause }: { cause?: unknown }) {\n super(notFoundErrorMessage);\n\n this.cause = cause;\n }\n}\nexport const isNotFound = (error: Error) => {\n return error.message === notFoundErrorMessage;\n};\n\nconst unknownFigmaApiExceptionMessage = \"Unknown Figma API Exception\";\nexport class UnknownFigmaApiException extends Error {\n constructor({ cause }: { cause: unknown }) {\n super(unknownFigmaApiExceptionMessage);\n\n this.cause = cause;\n }\n}\nexport const isUnknownFigmaApiException = (error: Error) => {\n return error.message === unknownFigmaApiExceptionMessage;\n};\n\nconst rateLimitExceededErrorMessage = \"Rate Limit Exceeded\";\nexport class RateLimitExceeded extends Error {\n constructor({ cause }: { cause?: unknown }) {\n super(rateLimitExceededErrorMessage);\n\n this.cause = cause;\n }\n}\nexport const isRateLimitExceeded = (error: Error) => {\n return error.message === rateLimitExceededErrorMessage;\n};\n\nconst requestTooLargeMessage = \"Request Too Large\";\nexport class RequestTooLarge extends Error {\n constructor({ cause }: { cause?: unknown }) {\n super(requestTooLargeMessage);\n\n this.cause = cause;\n }\n}\nexport const isRequestTooLarge = (error: Error) => {\n return error.message === requestTooLargeMessage;\n};\n","/* A special constant with type `never` /\nexport const NEVER = Object.freeze({\n status: \"aborted\",\n});\nexport /@__NO_SIDE_EFFECTS__/ function $constructor(name, initializer, params) {\n function init(inst, def) {\n if (!inst._zod) {\n Object.defineProperty(inst, \"_zod\", {\n value: {\n def,\n constr: _,\n traits: new Set(),\n },\n enumerable: false,\n });\n }\n if (inst._zod.traits.has(name)) {\n return;\n }\n inst._zod.traits.add(name);\n initializer(inst, def);\n // support prototype modifications\n const proto = _.prototype;\n const keys = Object.keys(proto);\n for (let i = 0; i < keys.length; i++) {\n const k = keys[i];\n if (!(k in inst)) {\n inst[k] = proto[k].bind(inst);\n }\n }\n }\n // doesn't work if Parent has a constructor with arguments\n const Parent = params?.Parent ?? Object;\n class Definition extends Parent {\n }\n Object.defineProperty(Definition, \"name\", { value: name });\n function _(def) {\n var _a;\n const inst = params?.Parent ? new Definition() : this;\n init(inst, def);\n (_a = inst._zod).deferred ?? (_a.deferred = []);\n for (const fn of inst._zod.deferred) {\n fn();\n }\n return inst;\n }\n Object.defineProperty(_, \"init\", { value: init });\n Object.defineProperty(_, Symbol.hasInstance, {\n value: (inst) => {\n if (params?.Parent && inst instanceof params.Parent)\n return true;\n return inst?._zod?.traits?.has(name);\n },\n });\n Object.defineProperty(_, \"name\", { value: name });\n return _;\n}\n////////////////////////////// UTILITIES ///////////////////////////////////////\nexport const $brand = Symbol(\"zod_brand\");\nexport class $ZodAsyncError extends Error {\n constructor() {\n super(`Encountered Promise during synchronous parse. Use .parseAsync() instead.`);\n }\n}\nexport class $ZodEncodeError extends Error {\n constructor(name) {\n super(`Encountered unidirectional transform during encode: ${name}`);\n this.name = \"ZodEncodeError\";\n }\n}\nexport const globalConfig = {};\nexport function config(newConfig) {\n if (newConfig)\n Object.assign(globalConfig, newConfig);\n return globalConfig;\n}\n","// functions\nexport function assertEqual(val) {\n return val;\n}\nexport function assertNotEqual(val) {\n return val;\n}\nexport function assertIs(_arg) { }\nexport function assertNever(_x) {\n throw new Error(\"Unexpected value in exhaustive check\");\n}\nexport function assert(_) { }\nexport function getEnumValues(entries) {\n const numericValues = Object.values(entries).filter((v) => typeof v === \"number\");\n const values = Object.entries(entries)\n .filter(([k, _]) => numericValues.indexOf(+k) === -1)\n .map(([_, v]) => v);\n return values;\n}\nexport function joinValues(array, separator = \"\|\") {\n return array.map((val) => stringifyPrimitive(val)).join(separator);\n}\nexport function jsonStringifyReplacer(_, value) {\n if (typeof value === \"bigint\")\n return value.toString();\n return value;\n}\nexport function cached(getter) {\n const set = false;\n return {\n get value() {\n if (!set) {\n const value = getter();\n Object.defineProperty(this, \"value\", { value });\n return value;\n }\n throw new Error(\"cached value already set\");\n },\n };\n}\nexport function nullish(input) {\n return input === null \|\| input === undefined;\n}\nexport function cleanRegex(source) {\n const start = source.startsWith(\"^\") ? 1 : 0;\n const end = source.endsWith(\"$\") ? source.length - 1 : source.length;\n return source.slice(start, end);\n}\nexport function floatSafeRemainder(val, step) {\n const valDecCount = (val.toString().split(\".\")[1] \|\| \"\").length;\n const stepString = step.toString();\n let stepDecCount = (stepString.split(\".\")[1] \|\| \"\").length;\n if (stepDecCount === 0 && /\\d?e-\\d?/.test(stepString)) {\n const match = stepString.match(/\\d?e-(\\d?)/);\n if (match?.[1]) {\n stepDecCount = Number.parseInt(match[1]);\n }\n }\n const decCount = valDecCount > stepDecCount ? valDecCount : stepDecCount;\n const valInt = Number.parseInt(val.toFixed(decCount).replace(\".\", \"\"));\n const stepInt = Number.parseInt(step.toFixed(decCount).replace(\".\", \"\"));\n return (valInt % stepInt) / 10 * decCount;\n}\nconst EVALUATING = Symbol(\"evaluating\");\nexport function defineLazy(object, key, getter) {\n let value = undefined;\n Object.defineProperty(object, key, {\n get() {\n if (value === EVALUATING) {\n // Circular reference detected, return undefined to break the cycle\n return undefined;\n }\n if (value === undefined) {\n value = EVALUATING;\n value = getter();\n }\n return value;\n },\n set(v) {\n Object.defineProperty(object, key, {\n value: v,\n // configurable: true,\n });\n // object[key] = v;\n },\n configurable: true,\n });\n}\nexport function objectClone(obj) {\n return Object.create(Object.getPrototypeOf(obj), Object.getOwnPropertyDescriptors(obj));\n}\nexport function assignProp(target, prop, value) {\n Object.defineProperty(target, prop, {\n value,\n writable: true,\n enumerable: true,\n configurable: true,\n });\n}\nexport function mergeDefs(...defs) {\n const mergedDescriptors = {};\n for (const def of defs) {\n const descriptors = Object.getOwnPropertyDescriptors(def);\n Object.assign(mergedDescriptors, descriptors);\n }\n return Object.defineProperties({}, mergedDescriptors);\n}\nexport function cloneDef(schema) {\n return mergeDefs(schema._zod.def);\n}\nexport function getElementAtPath(obj, path) {\n if (!path)\n return obj;\n return path.reduce((acc, key) => acc?.[key], obj);\n}\nexport function promiseAllObject(promisesObj) {\n const keys = Object.keys(promisesObj);\n const promises = keys.map((key) => promisesObj[key]);\n return Promise.all(promises).then((results) => {\n const resolvedObj = {};\n for (let i = 0; i < keys.length; i++) {\n resolvedObj[keys[i]] = results[i];\n }\n return resolvedObj;\n });\n}\nexport function randomString(length = 10) {\n const chars = \"abcdefghijklmnopqrstuvwxyz\";\n let str = \"\";\n for (let i = 0; i < length; i++) {\n str += chars[Math.floor(Math.random() * chars.length)];\n }\n return str;\n}\nexport function esc(str) {\n return JSON.stringify(str);\n}\nexport function slugify(input) {\n return input\n .toLowerCase()\n .trim()\n .replace(/[^\\w\\s-]/g, \"\")\n .replace(/[\\s_-]+/g, \"-\")\n .replace(/^-+\|-+$/g, \"\");\n}\nexport const captureStackTrace = (\"captureStackTrace\" in Error ? Error.captureStackTrace : (..._args) => { });\nexport function isObject(data) {\n return typeof data === \"object\" && data !== null && !Array.isArray(data);\n}\nexport const allowsEval = cached(() => {\n // @ts-ignore\n if (typeof navigator !== \"undefined\" && navigator?.userAgent?.includes(\"Cloudflare\")) {\n return false;\n }\n try {\n const F = Function;\n new F(\"\");\n return true;\n }\n catch (_) {\n return false;\n }\n});\nexport function isPlainObject(o) {\n if (isObject(o) === false)\n return false;\n // modified constructor\n const ctor = o.constructor;\n if (ctor === undefined)\n return true;\n if (typeof ctor !== \"function\")\n return true;\n // modified prototype\n const prot = ctor.prototype;\n if (isObject(prot) === false)\n return false;\n // ctor doesn't have static `isPrototypeOf`\n if (Object.prototype.hasOwnProperty.call(prot, \"isPrototypeOf\") === false) {\n return false;\n }\n return true;\n}\nexport function shallowClone(o) {\n if (isPlainObject(o))\n return { ...o };\n if (Array.isArray(o))\n return [...o];\n return o;\n}\nexport function numKeys(data) {\n let keyCount = 0;\n for (const key in data) {\n if (Object.prototype.hasOwnProperty.call(data, key)) {\n keyCount++;\n }\n }\n return keyCount;\n}\nexport const getParsedType = (data) => {\n const t = typeof data;\n switch (t) {\n case \"undefined\":\n return \"undefined\";\n case \"string\":\n return \"string\";\n case \"number\":\n return Number.isNaN(data) ? \"nan\" : \"number\";\n case \"boolean\":\n return \"boolean\";\n case \"function\":\n return \"function\";\n case \"bigint\":\n return \"bigint\";\n case \"symbol\":\n return \"symbol\";\n case \"object\":\n if (Array.isArray(data)) {\n return \"array\";\n }\n if (data === null) {\n return \"null\";\n }\n if (data.then && typeof data.then === \"function\" && data.catch && typeof data.catch === \"function\") {\n return \"promise\";\n }\n if (typeof Map !== \"undefined\" && data instanceof Map) {\n return \"map\";\n }\n if (typeof Set !== \"undefined\" && data instanceof Set) {\n return \"set\";\n }\n if (typeof Date !== \"undefined\" && data instanceof Date) {\n return \"date\";\n }\n // @ts-ignore\n if (typeof File !== \"undefined\" && data instanceof File) {\n return \"file\";\n }\n return \"object\";\n default:\n throw new Error(`Unknown data type: ${t}`);\n }\n};\nexport const propertyKeyTypes = new Set([\"string\", \"number\", \"symbol\"]);\nexport const primitiveTypes = new Set([\"string\", \"number\", \"bigint\", \"boolean\", \"symbol\", \"undefined\"]);\nexport function escapeRegex(str) {\n return str.replace(/[.+?^${}()\|[\\]\\\\]/g, \"\\\\$&\");\n}\n// zod-specific utils\nexport function clone(inst, def, params) {\n const cl = new inst._zod.constr(def ?? inst._zod.def);\n if (!def \|\| params?.parent)\n cl._zod.parent = inst;\n return cl;\n}\nexport function normalizeParams(_params) {\n const params = _params;\n if (!params)\n return {};\n if (typeof params === \"string\")\n return { error: () => params };\n if (params?.message !== undefined) {\n if (params?.error !== undefined)\n throw new Error(\"Cannot specify both `message` and `error` params\");\n params.error = params.message;\n }\n delete params.message;\n if (typeof params.error === \"string\")\n return { ...params, error: () => params.error };\n return params;\n}\nexport function createTransparentProxy(getter) {\n let target;\n return new Proxy({}, {\n get(_, prop, receiver) {\n target ?? (target = getter());\n return Reflect.get(target, prop, receiver);\n },\n set(_, prop, value, receiver) {\n target ?? (target = getter());\n return Reflect.set(target, prop, value, receiver);\n },\n has(_, prop) {\n target ?? (target = getter());\n return Reflect.has(target, prop);\n },\n deleteProperty(_, prop) {\n target ?? (target = getter());\n return Reflect.deleteProperty(target, prop);\n },\n ownKeys(_) {\n target ?? (target = getter());\n return Reflect.ownKeys(target);\n },\n getOwnPropertyDescriptor(_, prop) {\n target ?? (target = getter());\n return Reflect.getOwnPropertyDescriptor(target, prop);\n },\n defineProperty(_, prop, descriptor) {\n target ?? (target = getter());\n return Reflect.defineProperty(target, prop, descriptor);\n },\n });\n}\nexport function stringifyPrimitive(value) {\n if (typeof value === \"bigint\")\n return value.toString() + \"n\";\n if (typeof value === \"string\")\n return `\"${value}\"`;\n return `${value}`;\n}\nexport function optionalKeys(shape) {\n return Object.keys(shape).filter((k) => {\n return shape[k]._zod.optin === \"optional\" && shape[k]._zod.optout === \"optional\";\n });\n}\nexport const NUMBER_FORMAT_RANGES = {\n safeint: [Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER],\n int32: [-2147483648, 2147483647],\n uint32: [0, 4294967295],\n float32: [-3.4028234663852886e38, 3.4028234663852886e38],\n float64: [-Number.MAX_VALUE, Number.MAX_VALUE],\n};\nexport const BIGINT_FORMAT_RANGES = {\n int64: [/ @__PURE__/ BigInt(\"-9223372036854775808\"), / @__PURE__/ BigInt(\"9223372036854775807\")],\n uint64: [/ @__PURE__/ BigInt(0), / @__PURE__/ BigInt(\"18446744073709551615\")],\n};\nexport function pick(schema, mask) {\n const currDef = schema._zod.def;\n const checks = currDef.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n throw new Error(\".pick() cannot be used on object schemas containing refinements\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const newShape = {};\n for (const key in mask) {\n if (!(key in currDef.shape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n newShape[key] = currDef.shape[key];\n }\n assignProp(this, \"shape\", newShape); // self-caching\n return newShape;\n },\n checks: [],\n });\n return clone(schema, def);\n}\nexport function omit(schema, mask) {\n const currDef = schema._zod.def;\n const checks = currDef.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n throw new Error(\".omit() cannot be used on object schemas containing refinements\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const newShape = { ...schema._zod.def.shape };\n for (const key in mask) {\n if (!(key in currDef.shape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n delete newShape[key];\n }\n assignProp(this, \"shape\", newShape); // self-caching\n return newShape;\n },\n checks: [],\n });\n return clone(schema, def);\n}\nexport function extend(schema, shape) {\n if (!isPlainObject(shape)) {\n throw new Error(\"Invalid input to extend: expected a plain object\");\n }\n const checks = schema._zod.def.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n // Only throw if new shape overlaps with existing shape\n // Use getOwnPropertyDescriptor to check key existence without accessing values\n const existingShape = schema._zod.def.shape;\n for (const key in shape) {\n if (Object.getOwnPropertyDescriptor(existingShape, key) !== undefined) {\n throw new Error(\"Cannot overwrite keys on object schemas containing refinements. Use `.safeExtend()` instead.\");\n }\n }\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const _shape = { ...schema._zod.def.shape, ...shape };\n assignProp(this, \"shape\", _shape); // self-caching\n return _shape;\n },\n });\n return clone(schema, def);\n}\nexport function safeExtend(schema, shape) {\n if (!isPlainObject(shape)) {\n throw new Error(\"Invalid input to safeExtend: expected a plain object\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const _shape = { ...schema._zod.def.shape, ...shape };\n assignProp(this, \"shape\", _shape); // self-caching\n return _shape;\n },\n });\n return clone(schema, def);\n}\nexport function merge(a, b) {\n const def = mergeDefs(a._zod.def, {\n get shape() {\n const _shape = { ...a._zod.def.shape, ...b._zod.def.shape };\n assignProp(this, \"shape\", _shape); // self-caching\n return _shape;\n },\n get catchall() {\n return b._zod.def.catchall;\n },\n checks: [], // delete existing checks\n });\n return clone(a, def);\n}\nexport function partial(Class, schema, mask) {\n const currDef = schema._zod.def;\n const checks = currDef.checks;\n const hasChecks = checks && checks.length > 0;\n if (hasChecks) {\n throw new Error(\".partial() cannot be used on object schemas containing refinements\");\n }\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const oldShape = schema._zod.def.shape;\n const shape = { ...oldShape };\n if (mask) {\n for (const key in mask) {\n if (!(key in oldShape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n // if (oldShape[key]!._zod.optin === \"optional\") continue;\n shape[key] = Class\n ? new Class({\n type: \"optional\",\n innerType: oldShape[key],\n })\n : oldShape[key];\n }\n }\n else {\n for (const key in oldShape) {\n // if (oldShape[key]!._zod.optin === \"optional\") continue;\n shape[key] = Class\n ? new Class({\n type: \"optional\",\n innerType: oldShape[key],\n })\n : oldShape[key];\n }\n }\n assignProp(this, \"shape\", shape); // self-caching\n return shape;\n },\n checks: [],\n });\n return clone(schema, def);\n}\nexport function required(Class, schema, mask) {\n const def = mergeDefs(schema._zod.def, {\n get shape() {\n const oldShape = schema._zod.def.shape;\n const shape = { ...oldShape };\n if (mask) {\n for (const key in mask) {\n if (!(key in shape)) {\n throw new Error(`Unrecognized key: \"${key}\"`);\n }\n if (!mask[key])\n continue;\n // overwrite with non-optional\n shape[key] = new Class({\n type: \"nonoptional\",\n innerType: oldShape[key],\n });\n }\n }\n else {\n for (const key in oldShape) {\n // overwrite with non-optional\n shape[key] = new Class({\n type: \"nonoptional\",\n innerType: oldShape[key],\n });\n }\n }\n assignProp(this, \"shape\", shape); // self-caching\n return shape;\n },\n });\n return clone(schema, def);\n}\n// invalid_type \| too_big \| too_small \| invalid_format \| not_multiple_of \| unrecognized_keys \| invalid_union \| invalid_key \| invalid_element \| invalid_value \| custom\nexport function aborted(x, startIndex = 0) {\n if (x.aborted === true)\n return true;\n for (let i = startIndex; i < x.issues.length; i++) {\n if (x.issues[i]?.continue !== true) {\n return true;\n }\n }\n return false;\n}\nexport function prefixIssues(path, issues) {\n return issues.map((iss) => {\n var _a;\n (_a = iss).path ?? (_a.path = []);\n iss.path.unshift(path);\n return iss;\n });\n}\nexport function unwrapMessage(message) {\n return typeof message === \"string\" ? message : message?.message;\n}\nexport function finalizeIssue(iss, ctx, config) {\n const full = { ...iss, path: iss.path ?? [] };\n // for backwards compatibility\n if (!iss.message) {\n const message = unwrapMessage(iss.inst?._zod.def?.error?.(iss)) ??\n unwrapMessage(ctx?.error?.(iss)) ??\n unwrapMessage(config.customError?.(iss)) ??\n unwrapMessage(config.localeError?.(iss)) ??\n \"Invalid input\";\n full.message = message;\n }\n // delete (full as any).def;\n delete full.inst;\n delete full.continue;\n if (!ctx?.reportInput) {\n delete full.input;\n }\n return full;\n}\nexport function getSizableOrigin(input) {\n if (input instanceof Set)\n return \"set\";\n if (input instanceof Map)\n return \"map\";\n // @ts-ignore\n if (input instanceof File)\n return \"file\";\n return \"unknown\";\n}\nexport function getLengthableOrigin(input) {\n if (Array.isArray(input))\n return \"array\";\n if (typeof input === \"string\")\n return \"string\";\n return \"unknown\";\n}\nexport function parsedType(data) {\n const t = typeof data;\n switch (t) {\n case \"number\": {\n return Number.isNaN(data) ? \"nan\" : \"number\";\n }\n case \"object\": {\n if (data === null) {\n return \"null\";\n }\n if (Array.isArray(data)) {\n return \"array\";\n }\n const obj = data;\n if (obj && Object.getPrototypeOf(obj) !== Object.prototype && \"constructor\" in obj && obj.constructor) {\n return obj.constructor.name;\n }\n }\n }\n return t;\n}\nexport function issue(...args) {\n const [iss, input, inst] = args;\n if (typeof iss === \"string\") {\n return {\n message: iss,\n code: \"custom\",\n input,\n inst,\n };\n }\n return { ...iss };\n}\nexport function cleanEnum(obj) {\n return Object.entries(obj)\n .filter(([k, _]) => {\n // return true if NaN, meaning it's not a number, thus a string key\n return Number.isNaN(Number.parseInt(k, 10));\n })\n .map((el) => el[1]);\n}\n// Codec utility functions\nexport function base64ToUint8Array(base64) {\n const binaryString = atob(base64);\n const bytes = new Uint8Array(binaryString.length);\n for (let i = 0; i < binaryString.length; i++) {\n bytes[i] = binaryString.charCodeAt(i);\n }\n return bytes;\n}\nexport function uint8ArrayToBase64(bytes) {\n let binaryString = \"\";\n for (let i = 0; i < bytes.length; i++) {\n binaryString += String.fromCharCode(bytes[i]);\n }\n return btoa(binaryString);\n}\nexport function base64urlToUint8Array(base64url) {\n const base64 = base64url.replace(/-/g, \"+\").replace(/_/g, \"/\");\n const padding = \"=\".repeat((4 - (base64.length % 4)) % 4);\n return base64ToUint8Array(base64 + padding);\n}\nexport function uint8ArrayToBase64url(bytes) {\n return uint8ArrayToBase64(bytes).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/=/g, \"\");\n}\nexport function hexToUint8Array(hex) {\n const cleanHex = hex.replace(/^0x/, \"\");\n if (cleanHex.length % 2 !== 0) {\n throw new Error(\"Invalid hex string length\");\n }\n const bytes = new Uint8Array(cleanHex.length / 2);\n for (let i = 0; i < cleanHex.length; i += 2) {\n bytes[i / 2] = Number.parseInt(cleanHex.slice(i, i + 2), 16);\n }\n return bytes;\n}\nexport function uint8ArrayToHex(bytes) {\n return Array.from(bytes)\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\");\n}\n// instanceof\nexport class Class {\n constructor(..._args) { }\n}\n","import { $constructor } from \"./core.js\";\nimport as util from \"./util.js\";\nconst initializer = (inst, def) => {\n inst.name = \"$ZodError\";\n Object.defineProperty(inst, \"_zod\", {\n value: inst._zod,\n enumerable: false,\n });\n Object.defineProperty(inst, \"issues\", {\n value: def,\n enumerable: false,\n });\n inst.message = JSON.stringify(def, util.jsonStringifyReplacer, 2);\n Object.defineProperty(inst, \"toString\", {\n value: () => inst.message,\n enumerable: false,\n });\n};\nexport const $ZodError = $constructor(\"$ZodError\", initializer);\nexport const $ZodRealError = $constructor(\"$ZodError\", initializer, { Parent: Error });\nexport function flattenError(error, mapper = (issue) => issue.message) {\n const fieldErrors = {};\n const formErrors = [];\n for (const sub of error.issues) {\n if (sub.path.length > 0) {\n fieldErrors[sub.path[0]] = fieldErrors[sub.path[0]] \|\| [];\n fieldErrors[sub.path[0]].push(mapper(sub));\n }\n else {\n formErrors.push(mapper(sub));\n }\n }\n return { formErrors, fieldErrors };\n}\nexport function formatError(error, mapper = (issue) => issue.message) {\n const fieldErrors = { _errors: [] };\n const processError = (error) => {\n for (const issue of error.issues) {\n if (issue.code === \"invalid_union\" && issue.errors.length) {\n issue.errors.map((issues) => processError({ issues }));\n }\n else if (issue.code === \"invalid_key\") {\n processError({ issues: issue.issues });\n }\n else if (issue.code === \"invalid_element\") {\n processError({ issues: issue.issues });\n }\n else if (issue.path.length === 0) {\n fieldErrors._errors.push(mapper(issue));\n }\n else {\n let curr = fieldErrors;\n let i = 0;\n while (i < issue.path.length) {\n const el = issue.path[i];\n const terminal = i === issue.path.length - 1;\n if (!terminal) {\n curr[el] = curr[el] \|\| { _errors: [] };\n }\n else {\n curr[el] = curr[el] \|\| { _errors: [] };\n curr[el]._errors.push(mapper(issue));\n }\n curr = curr[el];\n i++;\n }\n }\n }\n };\n processError(error);\n return fieldErrors;\n}\nexport function treeifyError(error, mapper = (issue) => issue.message) {\n const result = { errors: [] };\n const processError = (error, path = []) => {\n var _a, _b;\n for (const issue of error.issues) {\n if (issue.code === \"invalid_union\" && issue.errors.length) {\n // regular union error\n issue.errors.map((issues) => processError({ issues }, issue.path));\n }\n else if (issue.code === \"invalid_key\") {\n processError({ issues: issue.issues }, issue.path);\n }\n else if (issue.code === \"invalid_element\") {\n processError({ issues: issue.issues }, issue.path);\n }\n else {\n const fullpath = [...path, ...issue.path];\n if (fullpath.length === 0) {\n result.errors.push(mapper(issue));\n continue;\n }\n let curr = result;\n let i = 0;\n while (i < fullpath.length) {\n const el = fullpath[i];\n const terminal = i === fullpath.length - 1;\n if (typeof el === \"string\") {\n curr.properties ?? (curr.properties = {});\n (_a = curr.properties)[el] ?? (_a[el] = { errors: [] });\n curr = curr.properties[el];\n }\n else {\n curr.items ?? (curr.items = []);\n (_b = curr.items)[el] ?? (_b[el] = { errors: [] });\n curr = curr.items[el];\n }\n if (terminal) {\n curr.errors.push(mapper(issue));\n }\n i++;\n }\n }\n }\n };\n processError(error);\n return result;\n}\n/** Format a ZodError as a human-readable string in the following form.\n \n From\n \n ```ts\n * ZodError {\n * issues: [\n * {\n * expected: 'string',\n * code: 'invalid_type',\n * path: [ 'username' ],\n * message: 'Invalid input: expected string'\n * },\n * {\n * expected: 'number',\n * code: 'invalid_type',\n * path: [ 'favoriteNumbers', 1 ],\n * message: 'Invalid input: expected number'\n * }\n * ];\n * }\n * ```\n \n to\n \n ```\n * username\n * ✖ Expected number, received string at \"username\n * favoriteNumbers[0]\n * ✖ Invalid input: expected number\n * ```\n /\nexport function toDotPath(_path) {\n const segs = [];\n const path = _path.map((seg) => (typeof seg === \"object\" ? seg.key : seg));\n for (const seg of path) {\n if (typeof seg === \"number\")\n segs.push(`[${seg}]`);\n else if (typeof seg === \"symbol\")\n segs.push(`[${JSON.stringify(String(seg))}]`);\n else if (/[^\\w$]/.test(seg))\n segs.push(`[${JSON.stringify(seg)}]`);\n else {\n if (segs.length)\n segs.push(\".\");\n segs.push(seg);\n }\n }\n return segs.join(\"\");\n}\nexport function prettifyError(error) {\n const lines = [];\n // sort by path length\n const issues = [...error.issues].sort((a, b) => (a.path ?? []).length - (b.path ?? []).length);\n // Process each issue\n for (const issue of issues) {\n lines.push(`✖ ${issue.message}`);\n if (issue.path?.length)\n lines.push(` → at ${toDotPath(issue.path)}`);\n }\n // Convert Map to formatted string\n return lines.join(\"\\n\");\n}\n","import as core from \"./core.js\";\nimport * as errors from \"./errors.js\";\nimport * as util from \"./util.js\";\nexport const _parse = (_Err) => (schema, value, _ctx, _params) => {\n const ctx = _ctx ? Object.assign(_ctx, { async: false }) : { async: false };\n const result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise) {\n throw new core.$ZodAsyncError();\n }\n if (result.issues.length) {\n const e = new (_params?.Err ?? _Err)(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())));\n util.captureStackTrace(e, _params?.callee);\n throw e;\n }\n return result.value;\n};\nexport const parse = /* @__PURE__/ _parse(errors.$ZodRealError);\nexport const _parseAsync = (_Err) => async (schema, value, _ctx, params) => {\n const ctx = _ctx ? Object.assign(_ctx, { async: true }) : { async: true };\n let result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise)\n result = await result;\n if (result.issues.length) {\n const e = new (params?.Err ?? _Err)(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())));\n util.captureStackTrace(e, params?.callee);\n throw e;\n }\n return result.value;\n};\nexport const parseAsync = / @__PURE__/ _parseAsync(errors.$ZodRealError);\nexport const _safeParse = (_Err) => (schema, value, _ctx) => {\n const ctx = _ctx ? { ..._ctx, async: false } : { async: false };\n const result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise) {\n throw new core.$ZodAsyncError();\n }\n return result.issues.length\n ? {\n success: false,\n error: new (_Err ?? errors.$ZodError)(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n }\n : { success: true, data: result.value };\n};\nexport const safeParse = / @__PURE__/ _safeParse(errors.$ZodRealError);\nexport const _safeParseAsync = (_Err) => async (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { async: true }) : { async: true };\n let result = schema._zod.run({ value, issues: [] }, ctx);\n if (result instanceof Promise)\n result = await result;\n return result.issues.length\n ? {\n success: false,\n error: new _Err(result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n }\n : { success: true, data: result.value };\n};\nexport const safeParseAsync = / @__PURE__/ _safeParseAsync(errors.$ZodRealError);\nexport const _encode = (_Err) => (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _parse(_Err)(schema, value, ctx);\n};\nexport const encode = / @__PURE__/ _encode(errors.$ZodRealError);\nexport const _decode = (_Err) => (schema, value, _ctx) => {\n return _parse(_Err)(schema, value, _ctx);\n};\nexport const decode = / @__PURE__/ _decode(errors.$ZodRealError);\nexport const _encodeAsync = (_Err) => async (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _parseAsync(_Err)(schema, value, ctx);\n};\nexport const encodeAsync = / @__PURE__/ _encodeAsync(errors.$ZodRealError);\nexport const _decodeAsync = (_Err) => async (schema, value, _ctx) => {\n return _parseAsync(_Err)(schema, value, _ctx);\n};\nexport const decodeAsync = / @__PURE__/ _decodeAsync(errors.$ZodRealError);\nexport const _safeEncode = (_Err) => (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _safeParse(_Err)(schema, value, ctx);\n};\nexport const safeEncode = / @__PURE__/ _safeEncode(errors.$ZodRealError);\nexport const _safeDecode = (_Err) => (schema, value, _ctx) => {\n return _safeParse(_Err)(schema, value, _ctx);\n};\nexport const safeDecode = / @__PURE__/ _safeDecode(errors.$ZodRealError);\nexport const _safeEncodeAsync = (_Err) => async (schema, value, _ctx) => {\n const ctx = _ctx ? Object.assign(_ctx, { direction: \"backward\" }) : { direction: \"backward\" };\n return _safeParseAsync(_Err)(schema, value, ctx);\n};\nexport const safeEncodeAsync = / @__PURE__/ _safeEncodeAsync(errors.$ZodRealError);\nexport const _safeDecodeAsync = (_Err) => async (schema, value, _ctx) => {\n return _safeParseAsync(_Err)(schema, value, _ctx);\n};\nexport const safeDecodeAsync = / @__PURE__/ _safeDecodeAsync(errors.$ZodRealError);\n","import as util from \"./util.js\";\nexport const cuid = /^[cC][^\\s-]{8,}$/;\nexport const cuid2 = /^[0-9a-z]+$/;\nexport const ulid = /^[0-9A-HJKMNP-TV-Za-hjkmnp-tv-z]{26}$/;\nexport const xid = /^[0-9a-vA-V]{20}$/;\nexport const ksuid = /^[A-Za-z0-9]{27}$/;\nexport const nanoid = /^[a-zA-Z0-9_-]{21}$/;\n/** ISO 8601-1 duration regex. Does not support the 8601-2 extensions like negative durations or fractional/negative components. /\nexport const duration = /^P(?:(\\d+W)\|(?!.W)(?=\\d\|T\\d)(\\d+Y)?(\\d+M)?(\\d+D)?(T(?=\\d)(\\d+H)?(\\d+M)?(\\d+([.,]\\d+)?S)?)?)$/;\n/** Implements ISO 8601-2 extensions like explicit +- prefixes, mixing weeks with other units, and fractional/negative components. /\nexport const extendedDuration = /^[-+]?P(?!$)(?:(?:[-+]?\\d+Y)\|(?:[-+]?\\d+[.,]\\d+Y$))?(?:(?:[-+]?\\d+M)\|(?:[-+]?\\d+[.,]\\d+M$))?(?:(?:[-+]?\\d+W)\|(?:[-+]?\\d+[.,]\\d+W$))?(?:(?:[-+]?\\d+D)\|(?:[-+]?\\d+[.,]\\d+D$))?(?:T(?=[\\d+-])(?:(?:[-+]?\\d+H)\|(?:[-+]?\\d+[.,]\\d+H$))?(?:(?:[-+]?\\d+M)\|(?:[-+]?\\d+[.,]\\d+M$))?(?:[-+]?\\d+(?:[.,]\\d+)?S)?)??$/;\n/* A regex for any UUID-like identifier: 8-4-4-4-12 hex pattern /\nexport const guid = /^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12})$/;\n/* Returns a regex for validating an RFC 9562/4122 UUID.\n \n @param version Optionally specify a version 1-8. If no version is specified, all versions are supported. /\nexport const uuid = (version) => {\n if (!version)\n return /^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-8][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}\|00000000-0000-0000-0000-000000000000\|ffffffff-ffff-ffff-ffff-ffffffffffff)$/;\n return new RegExp(`^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-${version}[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12})$`);\n};\nexport const uuid4 = /@__PURE__/ uuid(4);\nexport const uuid6 = /@__PURE__/ uuid(6);\nexport const uuid7 = /@__PURE__/ uuid(7);\n/* Practical email validation /\nexport const email = /^(?!\\.)(?!.\\.\\.)([A-Za-z0-9_'+\\-\\.])[A-Za-z0-9_+-]@([A-Za-z0-9][A-Za-z0-9\\-]\\.)+[A-Za-z]{2,}$/;\n/** Equivalent to the HTML5 input[type=email] validation implemented by browsers. Source: https://developer.mozilla.org/en-US/docs/Web/HTML/Element/input/email /\nexport const html5Email = /^[a-zA-Z0-9.!#$%&'+/=?^_`{\|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)$/;\n/* The classic emailregex.com regex for RFC 5322-compliant emails /\nexport const rfc5322Email = /^(([^<>()\\[\\]\\\\.,;:\\s@\"]+(\\.[^<>()\\[\\]\\\\.,;:\\s@\"]+))\|(\".+\"))@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}])\|(([a-zA-Z\\-0-9]+\\.)+[a-zA-Z]{2,}))$/;\n/** A loose regex that allows Unicode characters, enforces length limits, and that's about it. /\nexport const unicodeEmail = /^[^\\s@\"]{1,64}@[^\\s@]{1,255}$/u;\nexport const idnEmail = unicodeEmail;\nexport const browserEmail = /^[a-zA-Z0-9.!#$%&'+/=?^_`{\|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)$/;\n// from https://thekevinscott.com/emojis-in-javascript/#writing-a-regular-expression\nconst _emoji = `^(\\\\p{Extended_Pictographic}\|\\\\p{Emoji_Component})+$`;\nexport function emoji() {\n return new RegExp(_emoji, \"u\");\n}\nexport const ipv4 = /^(?:(?:25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])\\.){3}(?:25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])$/;\nexport const ipv6 = /^(([0-9a-fA-F]{1,4}:){7}[0-9a-fA-F]{1,4}\|([0-9a-fA-F]{1,4}:){1,7}:\|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}\|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}\|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}\|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}\|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}\|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})\|:((:[0-9a-fA-F]{1,4}){1,7}\|:))$/;\nexport const mac = (delimiter) => {\n const escapedDelim = util.escapeRegex(delimiter ?? \":\");\n return new RegExp(`^(?:[0-9A-F]{2}${escapedDelim}){5}[0-9A-F]{2}$\|^(?:[0-9a-f]{2}${escapedDelim}){5}[0-9a-f]{2}$`);\n};\nexport const cidrv4 = /^((25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])\\.){3}(25[0-5]\|2[0-4][0-9]\|1[0-9][0-9]\|[1-9][0-9]\|[0-9])\\/([0-9]\|[1-2][0-9]\|3[0-2])$/;\nexport const cidrv6 = /^(([0-9a-fA-F]{1,4}:){7}[0-9a-fA-F]{1,4}\|::\|([0-9a-fA-F]{1,4})?::([0-9a-fA-F]{1,4}:?){0,6})\\/(12[0-8]\|1[01][0-9]\|[1-9]?[0-9])$/;\n// https://stackoverflow.com/questions/7860392/determine-if-string-is-in-base64-using-javascript\nexport const base64 = /^$\|^(?:[0-9a-zA-Z+/]{4})(?:(?:[0-9a-zA-Z+/]{2}==)\|(?:[0-9a-zA-Z+/]{3}=))?$/;\nexport const base64url = /^[A-Za-z0-9_-]$/;\n// based on https://stackoverflow.com/questions/106179/regular-expression-to-match-dns-hostname-or-ip-address\n// export const hostname: RegExp = /^([a-zA-Z0-9-]+\\.)[a-zA-Z0-9-]+$/;\nexport const hostname = /^(?=.{1,253}\\.?$)[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[-0-9a-zA-Z]{0,61}[0-9a-zA-Z])?)\\.?$/;\nexport const domain = /^([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?\\.)+[a-zA-Z]{2,}$/;\n// https://blog.stevenlevithan.com/archives/validate-phone-number#r4-3 (regex sans spaces)\n// E.164: leading digit must be 1-9; total digits (excluding '+') between 7-15\nexport const e164 = /^\\+[1-9]\\d{6,14}$/;\n// const dateSource = `((\\\\d\\\\d[2468][048]\|\\\\d\\\\d[13579][26]\|\\\\d\\\\d0[48]\|[02468][048]00\|[13579][26]00)-02-29\|\\\\d{4}-((0[13578]\|1[02])-(0[1-9]\|[12]\\\\d\|3[01])\|(0[469]\|11)-(0[1-9]\|[12]\\\\d\|30)\|(02)-(0[1-9]\|1\\\\d\|2[0-8])))`;\nconst dateSource = `(?:(?:\\\\d\\\\d[2468][048]\|\\\\d\\\\d[13579][26]\|\\\\d\\\\d0[48]\|[02468][048]00\|[13579][26]00)-02-29\|\\\\d{4}-(?:(?:0[13578]\|1[02])-(?:0[1-9]\|[12]\\\\d\|3[01])\|(?:0[469]\|11)-(?:0[1-9]\|[12]\\\\d\|30)\|(?:02)-(?:0[1-9]\|1\\\\d\|2[0-8])))`;\nexport const date = /@__PURE__/ new RegExp(`^${dateSource}$`);\nfunction timeSource(args) {\n const hhmm = `(?:[01]\\\\d\|2[0-3]):[0-5]\\\\d`;\n const regex = typeof args.precision === \"number\"\n ? args.precision === -1\n ? `${hhmm}`\n : args.precision === 0\n ? `${hhmm}:[0-5]\\\\d`\n : `${hhmm}:[0-5]\\\\d\\\\.\\\\d{${args.precision}}`\n : `${hhmm}(?::[0-5]\\\\d(?:\\\\.\\\\d+)?)?`;\n return regex;\n}\nexport function time(args) {\n return new RegExp(`^${timeSource(args)}$`);\n}\n// Adapted from https://stackoverflow.com/a/3143231\nexport function datetime(args) {\n const time = timeSource({ precision: args.precision });\n const opts = [\"Z\"];\n if (args.local)\n opts.push(\"\");\n // if (args.offset) opts.push(`([+-]\\\\d{2}:\\\\d{2})`);\n if (args.offset)\n opts.push(`([+-](?:[01]\\\\d\|2[0-3]):[0-5]\\\\d)`);\n const timeRegex = `${time}(?:${opts.join(\"\|\")})`;\n return new RegExp(`^${dateSource}T(?:${timeRegex})$`);\n}\nexport const string = (params) => {\n const regex = params ? `[\\\\s\\\\S]{${params?.minimum ?? 0},${params?.maximum ?? \"\"}}` : `[\\\\s\\\\S]`;\n return new RegExp(`^${regex}$`);\n};\nexport const bigint = /^-?\\d+n?$/;\nexport const integer = /^-?\\d+$/;\nexport const number = /^-?\\d+(?:\\.\\d+)?$/;\nexport const boolean = /^(?:true\|false)$/i;\nconst _null = /^null$/i;\nexport { _null as null };\nconst _undefined = /^undefined$/i;\nexport { _undefined as undefined };\n// regex for string with no uppercase letters\nexport const lowercase = /^[^A-Z]$/;\n// regex for string with no lowercase letters\nexport const uppercase = /^[^a-z]$/;\n// regex for hexadecimal strings (any length)\nexport const hex = /^[0-9a-fA-F]$/;\n// Hash regexes for different algorithms and encodings\n// Helper function to create base64 regex with exact length and padding\nfunction fixedBase64(bodyLength, padding) {\n return new RegExp(`^[A-Za-z0-9+/]{${bodyLength}}${padding}$`);\n}\n// Helper function to create base64url regex with exact length (no padding)\nfunction fixedBase64url(length) {\n return new RegExp(`^[A-Za-z0-9_-]{${length}}$`);\n}\n// MD5 (16 bytes): base64 = 24 chars total (22 + \"==\")\nexport const md5_hex = /^[0-9a-fA-F]{32}$/;\nexport const md5_base64 = /@__PURE__/ fixedBase64(22, \"==\");\nexport const md5_base64url = /@__PURE__/ fixedBase64url(22);\n// SHA1 (20 bytes): base64 = 28 chars total (27 + \"=\")\nexport const sha1_hex = /^[0-9a-fA-F]{40}$/;\nexport const sha1_base64 = /@__PURE__/ fixedBase64(27, \"=\");\nexport const sha1_base64url = /@__PURE__/ fixedBase64url(27);\n// SHA256 (32 bytes): base64 = 44 chars total (43 + \"=\")\nexport const sha256_hex = /^[0-9a-fA-F]{64}$/;\nexport const sha256_base64 = /@__PURE__/ fixedBase64(43, \"=\");\nexport const sha256_base64url = /@__PURE__/ fixedBase64url(43);\n// SHA384 (48 bytes): base64 = 64 chars total (no padding)\nexport const sha384_hex = /^[0-9a-fA-F]{96}$/;\nexport const sha384_base64 = /@__PURE__/ fixedBase64(64, \"\");\nexport const sha384_base64url = /@__PURE__/ fixedBase64url(64);\n// SHA512 (64 bytes): base64 = 88 chars total (86 + \"==\")\nexport const sha512_hex = /^[0-9a-fA-F]{128}$/;\nexport const sha512_base64 = /@__PURE__/ fixedBase64(86, \"==\");\nexport const sha512_base64url = /@__PURE__/ fixedBase64url(86);\n","// import { $ZodType } from \"./schemas.js\";\nimport as core from \"./core.js\";\nimport * as regexes from \"./regexes.js\";\nimport * as util from \"./util.js\";\nexport const $ZodCheck = /@__PURE__/ core.$constructor(\"$ZodCheck\", (inst, def) => {\n var _a;\n inst._zod ?? (inst._zod = {});\n inst._zod.def = def;\n (_a = inst._zod).onattach ?? (_a.onattach = []);\n});\nconst numericOriginMap = {\n number: \"number\",\n bigint: \"bigint\",\n object: \"date\",\n};\nexport const $ZodCheckLessThan = /@__PURE__/ core.$constructor(\"$ZodCheckLessThan\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const origin = numericOriginMap[typeof def.value];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n const curr = (def.inclusive ? bag.maximum : bag.exclusiveMaximum) ?? Number.POSITIVE_INFINITY;\n if (def.value < curr) {\n if (def.inclusive)\n bag.maximum = def.value;\n else\n bag.exclusiveMaximum = def.value;\n }\n });\n inst._zod.check = (payload) => {\n if (def.inclusive ? payload.value <= def.value : payload.value < def.value) {\n return;\n }\n payload.issues.push({\n origin,\n code: \"too_big\",\n maximum: typeof def.value === \"object\" ? def.value.getTime() : def.value,\n input: payload.value,\n inclusive: def.inclusive,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckGreaterThan = /@__PURE__/ core.$constructor(\"$ZodCheckGreaterThan\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const origin = numericOriginMap[typeof def.value];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n const curr = (def.inclusive ? bag.minimum : bag.exclusiveMinimum) ?? Number.NEGATIVE_INFINITY;\n if (def.value > curr) {\n if (def.inclusive)\n bag.minimum = def.value;\n else\n bag.exclusiveMinimum = def.value;\n }\n });\n inst._zod.check = (payload) => {\n if (def.inclusive ? payload.value >= def.value : payload.value > def.value) {\n return;\n }\n payload.issues.push({\n origin,\n code: \"too_small\",\n minimum: typeof def.value === \"object\" ? def.value.getTime() : def.value,\n input: payload.value,\n inclusive: def.inclusive,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMultipleOf = \n/@__PURE__/ core.$constructor(\"$ZodCheckMultipleOf\", (inst, def) => {\n $ZodCheck.init(inst, def);\n inst._zod.onattach.push((inst) => {\n var _a;\n (_a = inst._zod.bag).multipleOf ?? (_a.multipleOf = def.value);\n });\n inst._zod.check = (payload) => {\n if (typeof payload.value !== typeof def.value)\n throw new Error(\"Cannot mix number and bigint in multiple_of check.\");\n const isMultiple = typeof payload.value === \"bigint\"\n ? payload.value % def.value === BigInt(0)\n : util.floatSafeRemainder(payload.value, def.value) === 0;\n if (isMultiple)\n return;\n payload.issues.push({\n origin: typeof payload.value,\n code: \"not_multiple_of\",\n divisor: def.value,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckNumberFormat = /@__PURE__/ core.$constructor(\"$ZodCheckNumberFormat\", (inst, def) => {\n $ZodCheck.init(inst, def); // no format checks\n def.format = def.format \|\| \"float64\";\n const isInt = def.format?.includes(\"int\");\n const origin = isInt ? \"int\" : \"number\";\n const [minimum, maximum] = util.NUMBER_FORMAT_RANGES[def.format];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.format = def.format;\n bag.minimum = minimum;\n bag.maximum = maximum;\n if (isInt)\n bag.pattern = regexes.integer;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n if (isInt) {\n if (!Number.isInteger(input)) {\n // invalid_format issue\n // payload.issues.push({\n // expected: def.format,\n // format: def.format,\n // code: \"invalid_format\",\n // input,\n // inst,\n // });\n // invalid_type issue\n payload.issues.push({\n expected: origin,\n format: def.format,\n code: \"invalid_type\",\n continue: false,\n input,\n inst,\n });\n return;\n // not_multiple_of issue\n // payload.issues.push({\n // code: \"not_multiple_of\",\n // origin: \"number\",\n // input,\n // inst,\n // divisor: 1,\n // });\n }\n if (!Number.isSafeInteger(input)) {\n if (input > 0) {\n // too_big\n payload.issues.push({\n input,\n code: \"too_big\",\n maximum: Number.MAX_SAFE_INTEGER,\n note: \"Integers must be within the safe integer range.\",\n inst,\n origin,\n inclusive: true,\n continue: !def.abort,\n });\n }\n else {\n // too_small\n payload.issues.push({\n input,\n code: \"too_small\",\n minimum: Number.MIN_SAFE_INTEGER,\n note: \"Integers must be within the safe integer range.\",\n inst,\n origin,\n inclusive: true,\n continue: !def.abort,\n });\n }\n return;\n }\n }\n if (input < minimum) {\n payload.issues.push({\n origin: \"number\",\n input,\n code: \"too_small\",\n minimum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n if (input > maximum) {\n payload.issues.push({\n origin: \"number\",\n input,\n code: \"too_big\",\n maximum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodCheckBigIntFormat = /@__PURE__/ core.$constructor(\"$ZodCheckBigIntFormat\", (inst, def) => {\n $ZodCheck.init(inst, def); // no format checks\n const [minimum, maximum] = util.BIGINT_FORMAT_RANGES[def.format];\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.format = def.format;\n bag.minimum = minimum;\n bag.maximum = maximum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n if (input < minimum) {\n payload.issues.push({\n origin: \"bigint\",\n input,\n code: \"too_small\",\n minimum: minimum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n if (input > maximum) {\n payload.issues.push({\n origin: \"bigint\",\n input,\n code: \"too_big\",\n maximum,\n inclusive: true,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodCheckMaxSize = /@__PURE__/ core.$constructor(\"$ZodCheckMaxSize\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.size !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.maximum ?? Number.POSITIVE_INFINITY);\n if (def.maximum < curr)\n inst._zod.bag.maximum = def.maximum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const size = input.size;\n if (size <= def.maximum)\n return;\n payload.issues.push({\n origin: util.getSizableOrigin(input),\n code: \"too_big\",\n maximum: def.maximum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMinSize = /@__PURE__/ core.$constructor(\"$ZodCheckMinSize\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.size !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.minimum ?? Number.NEGATIVE_INFINITY);\n if (def.minimum > curr)\n inst._zod.bag.minimum = def.minimum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const size = input.size;\n if (size >= def.minimum)\n return;\n payload.issues.push({\n origin: util.getSizableOrigin(input),\n code: \"too_small\",\n minimum: def.minimum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckSizeEquals = /@__PURE__/ core.$constructor(\"$ZodCheckSizeEquals\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.size !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.minimum = def.size;\n bag.maximum = def.size;\n bag.size = def.size;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const size = input.size;\n if (size === def.size)\n return;\n const tooBig = size > def.size;\n payload.issues.push({\n origin: util.getSizableOrigin(input),\n ...(tooBig ? { code: \"too_big\", maximum: def.size } : { code: \"too_small\", minimum: def.size }),\n inclusive: true,\n exact: true,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMaxLength = /@__PURE__/ core.$constructor(\"$ZodCheckMaxLength\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.length !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.maximum ?? Number.POSITIVE_INFINITY);\n if (def.maximum < curr)\n inst._zod.bag.maximum = def.maximum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const length = input.length;\n if (length <= def.maximum)\n return;\n const origin = util.getLengthableOrigin(input);\n payload.issues.push({\n origin,\n code: \"too_big\",\n maximum: def.maximum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckMinLength = /@__PURE__/ core.$constructor(\"$ZodCheckMinLength\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.length !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const curr = (inst._zod.bag.minimum ?? Number.NEGATIVE_INFINITY);\n if (def.minimum > curr)\n inst._zod.bag.minimum = def.minimum;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const length = input.length;\n if (length >= def.minimum)\n return;\n const origin = util.getLengthableOrigin(input);\n payload.issues.push({\n origin,\n code: \"too_small\",\n minimum: def.minimum,\n inclusive: true,\n input,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckLengthEquals = /@__PURE__/ core.$constructor(\"$ZodCheckLengthEquals\", (inst, def) => {\n var _a;\n $ZodCheck.init(inst, def);\n (_a = inst._zod.def).when ?? (_a.when = (payload) => {\n const val = payload.value;\n return !util.nullish(val) && val.length !== undefined;\n });\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.minimum = def.length;\n bag.maximum = def.length;\n bag.length = def.length;\n });\n inst._zod.check = (payload) => {\n const input = payload.value;\n const length = input.length;\n if (length === def.length)\n return;\n const origin = util.getLengthableOrigin(input);\n const tooBig = length > def.length;\n payload.issues.push({\n origin,\n ...(tooBig ? { code: \"too_big\", maximum: def.length } : { code: \"too_small\", minimum: def.length }),\n inclusive: true,\n exact: true,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckStringFormat = /@__PURE__/ core.$constructor(\"$ZodCheckStringFormat\", (inst, def) => {\n var _a, _b;\n $ZodCheck.init(inst, def);\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.format = def.format;\n if (def.pattern) {\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(def.pattern);\n }\n });\n if (def.pattern)\n (_a = inst._zod).check ?? (_a.check = (payload) => {\n def.pattern.lastIndex = 0;\n if (def.pattern.test(payload.value))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: def.format,\n input: payload.value,\n ...(def.pattern ? { pattern: def.pattern.toString() } : {}),\n inst,\n continue: !def.abort,\n });\n });\n else\n (_b = inst._zod).check ?? (_b.check = () => { });\n});\nexport const $ZodCheckRegex = /@__PURE__/ core.$constructor(\"$ZodCheckRegex\", (inst, def) => {\n $ZodCheckStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n def.pattern.lastIndex = 0;\n if (def.pattern.test(payload.value))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"regex\",\n input: payload.value,\n pattern: def.pattern.toString(),\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckLowerCase = /@__PURE__/ core.$constructor(\"$ZodCheckLowerCase\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.lowercase);\n $ZodCheckStringFormat.init(inst, def);\n});\nexport const $ZodCheckUpperCase = /@__PURE__/ core.$constructor(\"$ZodCheckUpperCase\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.uppercase);\n $ZodCheckStringFormat.init(inst, def);\n});\nexport const $ZodCheckIncludes = /@__PURE__/ core.$constructor(\"$ZodCheckIncludes\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const escapedRegex = util.escapeRegex(def.includes);\n const pattern = new RegExp(typeof def.position === \"number\" ? `^.{${def.position}}${escapedRegex}` : escapedRegex);\n def.pattern = pattern;\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(pattern);\n });\n inst._zod.check = (payload) => {\n if (payload.value.includes(def.includes, def.position))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"includes\",\n includes: def.includes,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckStartsWith = /@__PURE__/ core.$constructor(\"$ZodCheckStartsWith\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const pattern = new RegExp(`^${util.escapeRegex(def.prefix)}.`);\n def.pattern ?? (def.pattern = pattern);\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(pattern);\n });\n inst._zod.check = (payload) => {\n if (payload.value.startsWith(def.prefix))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"starts_with\",\n prefix: def.prefix,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckEndsWith = /@__PURE__/ core.$constructor(\"$ZodCheckEndsWith\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const pattern = new RegExp(`.${util.escapeRegex(def.suffix)}$`);\n def.pattern ?? (def.pattern = pattern);\n inst._zod.onattach.push((inst) => {\n const bag = inst._zod.bag;\n bag.patterns ?? (bag.patterns = new Set());\n bag.patterns.add(pattern);\n });\n inst._zod.check = (payload) => {\n if (payload.value.endsWith(def.suffix))\n return;\n payload.issues.push({\n origin: \"string\",\n code: \"invalid_format\",\n format: \"ends_with\",\n suffix: def.suffix,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\n///////////////////////////////////\n///// $ZodCheckProperty /////\n///////////////////////////////////\nfunction handleCheckPropertyResult(result, payload, property) {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(property, result.issues));\n }\n}\nexport const $ZodCheckProperty = /@__PURE__/ core.$constructor(\"$ZodCheckProperty\", (inst, def) => {\n $ZodCheck.init(inst, def);\n inst._zod.check = (payload) => {\n const result = def.schema._zod.run({\n value: payload.value[def.property],\n issues: [],\n }, {});\n if (result instanceof Promise) {\n return result.then((result) => handleCheckPropertyResult(result, payload, def.property));\n }\n handleCheckPropertyResult(result, payload, def.property);\n return;\n };\n});\nexport const $ZodCheckMimeType = /@__PURE__/ core.$constructor(\"$ZodCheckMimeType\", (inst, def) => {\n $ZodCheck.init(inst, def);\n const mimeSet = new Set(def.mime);\n inst._zod.onattach.push((inst) => {\n inst._zod.bag.mime = def.mime;\n });\n inst._zod.check = (payload) => {\n if (mimeSet.has(payload.value.type))\n return;\n payload.issues.push({\n code: \"invalid_value\",\n values: def.mime,\n input: payload.value.type,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCheckOverwrite = /@__PURE__/ core.$constructor(\"$ZodCheckOverwrite\", (inst, def) => {\n $ZodCheck.init(inst, def);\n inst._zod.check = (payload) => {\n payload.value = def.tx(payload.value);\n };\n});\n","export class Doc {\n constructor(args = []) {\n this.content = [];\n this.indent = 0;\n if (this)\n this.args = args;\n }\n indented(fn) {\n this.indent += 1;\n fn(this);\n this.indent -= 1;\n }\n write(arg) {\n if (typeof arg === \"function\") {\n arg(this, { execution: \"sync\" });\n arg(this, { execution: \"async\" });\n return;\n }\n const content = arg;\n const lines = content.split(\"\\n\").filter((x) => x);\n const minIndent = Math.min(...lines.map((x) => x.length - x.trimStart().length));\n const dedented = lines.map((x) => x.slice(minIndent)).map((x) => \" \".repeat(this.indent * 2) + x);\n for (const line of dedented) {\n this.content.push(line);\n }\n }\n compile() {\n const F = Function;\n const args = this?.args;\n const content = this?.content ?? [``];\n const lines = [...content.map((x) => ` ${x}`)];\n // console.log(lines.join(\"\\n\"));\n return new F(...args, lines.join(\"\\n\"));\n }\n}\n","export const version = {\n major: 4,\n minor: 3,\n patch: 6,\n};\n","import * as checks from \"./checks.js\";\nimport * as core from \"./core.js\";\nimport { Doc } from \"./doc.js\";\nimport { parse, parseAsync, safeParse, safeParseAsync } from \"./parse.js\";\nimport * as regexes from \"./regexes.js\";\nimport * as util from \"./util.js\";\nimport { version } from \"./versions.js\";\nexport const $ZodType = /@__PURE__/ core.$constructor(\"$ZodType\", (inst, def) => {\n var _a;\n inst ?? (inst = {});\n inst._zod.def = def; // set _def property\n inst._zod.bag = inst._zod.bag \|\| {}; // initialize _bag object\n inst._zod.version = version;\n const checks = [...(inst._zod.def.checks ?? [])];\n // if inst is itself a checks.$ZodCheck, run it as a check\n if (inst._zod.traits.has(\"$ZodCheck\")) {\n checks.unshift(inst);\n }\n for (const ch of checks) {\n for (const fn of ch._zod.onattach) {\n fn(inst);\n }\n }\n if (checks.length === 0) {\n // deferred initializer\n // inst._zod.parse is not yet defined\n (_a = inst._zod).deferred ?? (_a.deferred = []);\n inst._zod.deferred?.push(() => {\n inst._zod.run = inst._zod.parse;\n });\n }\n else {\n const runChecks = (payload, checks, ctx) => {\n let isAborted = util.aborted(payload);\n let asyncResult;\n for (const ch of checks) {\n if (ch._zod.def.when) {\n const shouldRun = ch._zod.def.when(payload);\n if (!shouldRun)\n continue;\n }\n else if (isAborted) {\n continue;\n }\n const currLen = payload.issues.length;\n const _ = ch._zod.check(payload);\n if (_ instanceof Promise && ctx?.async === false) {\n throw new core.$ZodAsyncError();\n }\n if (asyncResult \|\| _ instanceof Promise) {\n asyncResult = (asyncResult ?? Promise.resolve()).then(async () => {\n await _;\n const nextLen = payload.issues.length;\n if (nextLen === currLen)\n return;\n if (!isAborted)\n isAborted = util.aborted(payload, currLen);\n });\n }\n else {\n const nextLen = payload.issues.length;\n if (nextLen === currLen)\n continue;\n if (!isAborted)\n isAborted = util.aborted(payload, currLen);\n }\n }\n if (asyncResult) {\n return asyncResult.then(() => {\n return payload;\n });\n }\n return payload;\n };\n const handleCanaryResult = (canary, payload, ctx) => {\n // abort if the canary is aborted\n if (util.aborted(canary)) {\n canary.aborted = true;\n return canary;\n }\n // run checks first, then\n const checkResult = runChecks(payload, checks, ctx);\n if (checkResult instanceof Promise) {\n if (ctx.async === false)\n throw new core.$ZodAsyncError();\n return checkResult.then((checkResult) => inst._zod.parse(checkResult, ctx));\n }\n return inst._zod.parse(checkResult, ctx);\n };\n inst._zod.run = (payload, ctx) => {\n if (ctx.skipChecks) {\n return inst._zod.parse(payload, ctx);\n }\n if (ctx.direction === \"backward\") {\n // run canary\n // initial pass (no checks)\n const canary = inst._zod.parse({ value: payload.value, issues: [] }, { ...ctx, skipChecks: true });\n if (canary instanceof Promise) {\n return canary.then((canary) => {\n return handleCanaryResult(canary, payload, ctx);\n });\n }\n return handleCanaryResult(canary, payload, ctx);\n }\n // forward\n const result = inst._zod.parse(payload, ctx);\n if (result instanceof Promise) {\n if (ctx.async === false)\n throw new core.$ZodAsyncError();\n return result.then((result) => runChecks(result, checks, ctx));\n }\n return runChecks(result, checks, ctx);\n };\n }\n // Lazy initialize ~standard to avoid creating objects for every schema\n util.defineLazy(inst, \"~standard\", () => ({\n validate: (value) => {\n try {\n const r = safeParse(inst, value);\n return r.success ? { value: r.data } : { issues: r.error?.issues };\n }\n catch (_) {\n return safeParseAsync(inst, value).then((r) => (r.success ? { value: r.data } : { issues: r.error?.issues }));\n }\n },\n vendor: \"zod\",\n version: 1,\n }));\n});\nexport { clone } from \"./util.js\";\nexport const $ZodString = /@__PURE__/ core.$constructor(\"$ZodString\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = [...(inst?._zod.bag?.patterns ?? [])].pop() ?? regexes.string(inst._zod.bag);\n inst._zod.parse = (payload, _) => {\n if (def.coerce)\n try {\n payload.value = String(payload.value);\n }\n catch (_) { }\n if (typeof payload.value === \"string\")\n return payload;\n payload.issues.push({\n expected: \"string\",\n code: \"invalid_type\",\n input: payload.value,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodStringFormat = /@__PURE__/ core.$constructor(\"$ZodStringFormat\", (inst, def) => {\n // check initialization must come first\n checks.$ZodCheckStringFormat.init(inst, def);\n $ZodString.init(inst, def);\n});\nexport const $ZodGUID = /@__PURE__/ core.$constructor(\"$ZodGUID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.guid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodUUID = /@__PURE__/ core.$constructor(\"$ZodUUID\", (inst, def) => {\n if (def.version) {\n const versionMap = {\n v1: 1,\n v2: 2,\n v3: 3,\n v4: 4,\n v5: 5,\n v6: 6,\n v7: 7,\n v8: 8,\n };\n const v = versionMap[def.version];\n if (v === undefined)\n throw new Error(`Invalid UUID version: \"${def.version}\"`);\n def.pattern ?? (def.pattern = regexes.uuid(v));\n }\n else\n def.pattern ?? (def.pattern = regexes.uuid());\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodEmail = /@__PURE__/ core.$constructor(\"$ZodEmail\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.email);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodURL = /@__PURE__/ core.$constructor(\"$ZodURL\", (inst, def) => {\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n try {\n // Trim whitespace from input\n const trimmed = payload.value.trim();\n // @ts-ignore\n const url = new URL(trimmed);\n if (def.hostname) {\n def.hostname.lastIndex = 0;\n if (!def.hostname.test(url.hostname)) {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"url\",\n note: \"Invalid hostname\",\n pattern: def.hostname.source,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n }\n if (def.protocol) {\n def.protocol.lastIndex = 0;\n if (!def.protocol.test(url.protocol.endsWith(\":\") ? url.protocol.slice(0, -1) : url.protocol)) {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"url\",\n note: \"Invalid protocol\",\n pattern: def.protocol.source,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n }\n // Set the output value based on normalize flag\n if (def.normalize) {\n // Use normalized URL\n payload.value = url.href;\n }\n else {\n // Preserve the original input (trimmed)\n payload.value = trimmed;\n }\n return;\n }\n catch (_) {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"url\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodEmoji = /@__PURE__/ core.$constructor(\"$ZodEmoji\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.emoji());\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodNanoID = /@__PURE__/ core.$constructor(\"$ZodNanoID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.nanoid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodCUID = /@__PURE__/ core.$constructor(\"$ZodCUID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cuid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodCUID2 = /@__PURE__/ core.$constructor(\"$ZodCUID2\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cuid2);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodULID = /@__PURE__/ core.$constructor(\"$ZodULID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ulid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodXID = /@__PURE__/ core.$constructor(\"$ZodXID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.xid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodKSUID = /@__PURE__/ core.$constructor(\"$ZodKSUID\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ksuid);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISODateTime = /@__PURE__/ core.$constructor(\"$ZodISODateTime\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.datetime(def));\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISODate = /@__PURE__/ core.$constructor(\"$ZodISODate\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.date);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISOTime = /@__PURE__/ core.$constructor(\"$ZodISOTime\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.time(def));\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodISODuration = /@__PURE__/ core.$constructor(\"$ZodISODuration\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.duration);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodIPv4 = /@__PURE__/ core.$constructor(\"$ZodIPv4\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ipv4);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.format = `ipv4`;\n});\nexport const $ZodIPv6 = /@__PURE__/ core.$constructor(\"$ZodIPv6\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.ipv6);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.format = `ipv6`;\n inst._zod.check = (payload) => {\n try {\n // @ts-ignore\n new URL(`http://[${payload.value}]`);\n // return;\n }\n catch {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"ipv6\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\nexport const $ZodMAC = /@__PURE__/ core.$constructor(\"$ZodMAC\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.mac(def.delimiter));\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.format = `mac`;\n});\nexport const $ZodCIDRv4 = /@__PURE__/ core.$constructor(\"$ZodCIDRv4\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cidrv4);\n $ZodStringFormat.init(inst, def);\n});\nexport const $ZodCIDRv6 = /@__PURE__/ core.$constructor(\"$ZodCIDRv6\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.cidrv6); // not used for validation\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n const parts = payload.value.split(\"/\");\n try {\n if (parts.length !== 2)\n throw new Error();\n const [address, prefix] = parts;\n if (!prefix)\n throw new Error();\n const prefixNum = Number(prefix);\n if (`${prefixNum}` !== prefix)\n throw new Error();\n if (prefixNum < 0 \|\| prefixNum > 128)\n throw new Error();\n // @ts-ignore\n new URL(`http://[${address}]`);\n }\n catch {\n payload.issues.push({\n code: \"invalid_format\",\n format: \"cidrv6\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n }\n };\n});\n////////////////////////////// ZodBase64 //////////////////////////////\nexport function isValidBase64(data) {\n if (data === \"\")\n return true;\n if (data.length % 4 !== 0)\n return false;\n try {\n // @ts-ignore\n atob(data);\n return true;\n }\n catch {\n return false;\n }\n}\nexport const $ZodBase64 = /@__PURE__/ core.$constructor(\"$ZodBase64\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.base64);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.contentEncoding = \"base64\";\n inst._zod.check = (payload) => {\n if (isValidBase64(payload.value))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: \"base64\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\n////////////////////////////// ZodBase64 //////////////////////////////\nexport function isValidBase64URL(data) {\n if (!regexes.base64url.test(data))\n return false;\n const base64 = data.replace(/[-_]/g, (c) => (c === \"-\" ? \"+\" : \"/\"));\n const padded = base64.padEnd(Math.ceil(base64.length / 4) * 4, \"=\");\n return isValidBase64(padded);\n}\nexport const $ZodBase64URL = /@__PURE__/ core.$constructor(\"$ZodBase64URL\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.base64url);\n $ZodStringFormat.init(inst, def);\n inst._zod.bag.contentEncoding = \"base64url\";\n inst._zod.check = (payload) => {\n if (isValidBase64URL(payload.value))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: \"base64url\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodE164 = /@__PURE__/ core.$constructor(\"$ZodE164\", (inst, def) => {\n def.pattern ?? (def.pattern = regexes.e164);\n $ZodStringFormat.init(inst, def);\n});\n////////////////////////////// ZodJWT //////////////////////////////\nexport function isValidJWT(token, algorithm = null) {\n try {\n const tokensParts = token.split(\".\");\n if (tokensParts.length !== 3)\n return false;\n const [header] = tokensParts;\n if (!header)\n return false;\n // @ts-ignore\n const parsedHeader = JSON.parse(atob(header));\n if (\"typ\" in parsedHeader && parsedHeader?.typ !== \"JWT\")\n return false;\n if (!parsedHeader.alg)\n return false;\n if (algorithm && (!(\"alg\" in parsedHeader) \|\| parsedHeader.alg !== algorithm))\n return false;\n return true;\n }\n catch {\n return false;\n }\n}\nexport const $ZodJWT = /@__PURE__/ core.$constructor(\"$ZodJWT\", (inst, def) => {\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n if (isValidJWT(payload.value, def.alg))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: \"jwt\",\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodCustomStringFormat = /@__PURE__/ core.$constructor(\"$ZodCustomStringFormat\", (inst, def) => {\n $ZodStringFormat.init(inst, def);\n inst._zod.check = (payload) => {\n if (def.fn(payload.value))\n return;\n payload.issues.push({\n code: \"invalid_format\",\n format: def.format,\n input: payload.value,\n inst,\n continue: !def.abort,\n });\n };\n});\nexport const $ZodNumber = /@__PURE__/ core.$constructor(\"$ZodNumber\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = inst._zod.bag.pattern ?? regexes.number;\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce)\n try {\n payload.value = Number(payload.value);\n }\n catch (_) { }\n const input = payload.value;\n if (typeof input === \"number\" && !Number.isNaN(input) && Number.isFinite(input)) {\n return payload;\n }\n const received = typeof input === \"number\"\n ? Number.isNaN(input)\n ? \"NaN\"\n : !Number.isFinite(input)\n ? \"Infinity\"\n : undefined\n : undefined;\n payload.issues.push({\n expected: \"number\",\n code: \"invalid_type\",\n input,\n inst,\n ...(received ? { received } : {}),\n });\n return payload;\n };\n});\nexport const $ZodNumberFormat = /@__PURE__/ core.$constructor(\"$ZodNumberFormat\", (inst, def) => {\n checks.$ZodCheckNumberFormat.init(inst, def);\n $ZodNumber.init(inst, def); // no format checks\n});\nexport const $ZodBoolean = /@__PURE__/ core.$constructor(\"$ZodBoolean\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.boolean;\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce)\n try {\n payload.value = Boolean(payload.value);\n }\n catch (_) { }\n const input = payload.value;\n if (typeof input === \"boolean\")\n return payload;\n payload.issues.push({\n expected: \"boolean\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodBigInt = /@__PURE__/ core.$constructor(\"$ZodBigInt\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.bigint;\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce)\n try {\n payload.value = BigInt(payload.value);\n }\n catch (_) { }\n if (typeof payload.value === \"bigint\")\n return payload;\n payload.issues.push({\n expected: \"bigint\",\n code: \"invalid_type\",\n input: payload.value,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodBigIntFormat = /@__PURE__/ core.$constructor(\"$ZodBigIntFormat\", (inst, def) => {\n checks.$ZodCheckBigIntFormat.init(inst, def);\n $ZodBigInt.init(inst, def); // no format checks\n});\nexport const $ZodSymbol = /@__PURE__/ core.$constructor(\"$ZodSymbol\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (typeof input === \"symbol\")\n return payload;\n payload.issues.push({\n expected: \"symbol\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodUndefined = /@__PURE__/ core.$constructor(\"$ZodUndefined\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.undefined;\n inst._zod.values = new Set([undefined]);\n inst._zod.optin = \"optional\";\n inst._zod.optout = \"optional\";\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (typeof input === \"undefined\")\n return payload;\n payload.issues.push({\n expected: \"undefined\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodNull = /@__PURE__/ core.$constructor(\"$ZodNull\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.pattern = regexes.null;\n inst._zod.values = new Set([null]);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (input === null)\n return payload;\n payload.issues.push({\n expected: \"null\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodAny = /@__PURE__/ core.$constructor(\"$ZodAny\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload) => payload;\n});\nexport const $ZodUnknown = /@__PURE__/ core.$constructor(\"$ZodUnknown\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload) => payload;\n});\nexport const $ZodNever = /@__PURE__/ core.$constructor(\"$ZodNever\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n payload.issues.push({\n expected: \"never\",\n code: \"invalid_type\",\n input: payload.value,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodVoid = /@__PURE__/ core.$constructor(\"$ZodVoid\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (typeof input === \"undefined\")\n return payload;\n payload.issues.push({\n expected: \"void\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodDate = /@__PURE__/ core.$constructor(\"$ZodDate\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n if (def.coerce) {\n try {\n payload.value = new Date(payload.value);\n }\n catch (_err) { }\n }\n const input = payload.value;\n const isDate = input instanceof Date;\n const isValidDate = isDate && !Number.isNaN(input.getTime());\n if (isValidDate)\n return payload;\n payload.issues.push({\n expected: \"date\",\n code: \"invalid_type\",\n input,\n ...(isDate ? { received: \"Invalid Date\" } : {}),\n inst,\n });\n return payload;\n };\n});\nfunction handleArrayResult(result, final, index) {\n if (result.issues.length) {\n final.issues.push(...util.prefixIssues(index, result.issues));\n }\n final.value[index] = result.value;\n}\nexport const $ZodArray = /@__PURE__/ core.$constructor(\"$ZodArray\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!Array.isArray(input)) {\n payload.issues.push({\n expected: \"array\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n payload.value = Array(input.length);\n const proms = [];\n for (let i = 0; i < input.length; i++) {\n const item = input[i];\n const result = def.element._zod.run({\n value: item,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleArrayResult(result, payload, i)));\n }\n else {\n handleArrayResult(result, payload, i);\n }\n }\n if (proms.length) {\n return Promise.all(proms).then(() => payload);\n }\n return payload; //handleArrayResultsAsync(parseResults, final);\n };\n});\nfunction handlePropertyResult(result, final, key, input, isOptionalOut) {\n if (result.issues.length) {\n // For optional-out schemas, ignore errors on absent keys\n if (isOptionalOut && !(key in input)) {\n return;\n }\n final.issues.push(...util.prefixIssues(key, result.issues));\n }\n if (result.value === undefined) {\n if (key in input) {\n final.value[key] = undefined;\n }\n }\n else {\n final.value[key] = result.value;\n }\n}\nfunction normalizeDef(def) {\n const keys = Object.keys(def.shape);\n for (const k of keys) {\n if (!def.shape?.[k]?._zod?.traits?.has(\"$ZodType\")) {\n throw new Error(`Invalid element at key \"${k}\": expected a Zod schema`);\n }\n }\n const okeys = util.optionalKeys(def.shape);\n return {\n ...def,\n keys,\n keySet: new Set(keys),\n numKeys: keys.length,\n optionalKeys: new Set(okeys),\n };\n}\nfunction handleCatchall(proms, input, payload, ctx, def, inst) {\n const unrecognized = [];\n // iterate over input keys\n const keySet = def.keySet;\n const _catchall = def.catchall._zod;\n const t = _catchall.def.type;\n const isOptionalOut = _catchall.optout === \"optional\";\n for (const key in input) {\n if (keySet.has(key))\n continue;\n if (t === \"never\") {\n unrecognized.push(key);\n continue;\n }\n const r = _catchall.run({ value: input[key], issues: [] }, ctx);\n if (r instanceof Promise) {\n proms.push(r.then((r) => handlePropertyResult(r, payload, key, input, isOptionalOut)));\n }\n else {\n handlePropertyResult(r, payload, key, input, isOptionalOut);\n }\n }\n if (unrecognized.length) {\n payload.issues.push({\n code: \"unrecognized_keys\",\n keys: unrecognized,\n input,\n inst,\n });\n }\n if (!proms.length)\n return payload;\n return Promise.all(proms).then(() => {\n return payload;\n });\n}\nexport const $ZodObject = /@__PURE__/ core.$constructor(\"$ZodObject\", (inst, def) => {\n // requires cast because technically $ZodObject doesn't extend\n $ZodType.init(inst, def);\n // const sh = def.shape;\n const desc = Object.getOwnPropertyDescriptor(def, \"shape\");\n if (!desc?.get) {\n const sh = def.shape;\n Object.defineProperty(def, \"shape\", {\n get: () => {\n const newSh = { ...sh };\n Object.defineProperty(def, \"shape\", {\n value: newSh,\n });\n return newSh;\n },\n });\n }\n const _normalized = util.cached(() => normalizeDef(def));\n util.defineLazy(inst._zod, \"propValues\", () => {\n const shape = def.shape;\n const propValues = {};\n for (const key in shape) {\n const field = shape[key]._zod;\n if (field.values) {\n propValues[key] ?? (propValues[key] = new Set());\n for (const v of field.values)\n propValues[key].add(v);\n }\n }\n return propValues;\n });\n const isObject = util.isObject;\n const catchall = def.catchall;\n let value;\n inst._zod.parse = (payload, ctx) => {\n value ?? (value = _normalized.value);\n const input = payload.value;\n if (!isObject(input)) {\n payload.issues.push({\n expected: \"object\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n payload.value = {};\n const proms = [];\n const shape = value.shape;\n for (const key of value.keys) {\n const el = shape[key];\n const isOptionalOut = el._zod.optout === \"optional\";\n const r = el._zod.run({ value: input[key], issues: [] }, ctx);\n if (r instanceof Promise) {\n proms.push(r.then((r) => handlePropertyResult(r, payload, key, input, isOptionalOut)));\n }\n else {\n handlePropertyResult(r, payload, key, input, isOptionalOut);\n }\n }\n if (!catchall) {\n return proms.length ? Promise.all(proms).then(() => payload) : payload;\n }\n return handleCatchall(proms, input, payload, ctx, _normalized.value, inst);\n };\n});\nexport const $ZodObjectJIT = /@__PURE__/ core.$constructor(\"$ZodObjectJIT\", (inst, def) => {\n // requires cast because technically $ZodObject doesn't extend\n $ZodObject.init(inst, def);\n const superParse = inst._zod.parse;\n const _normalized = util.cached(() => normalizeDef(def));\n const generateFastpass = (shape) => {\n const doc = new Doc([\"shape\", \"payload\", \"ctx\"]);\n const normalized = _normalized.value;\n const parseStr = (key) => {\n const k = util.esc(key);\n return `shape[${k}]._zod.run({ value: input[${k}], issues: [] }, ctx)`;\n };\n doc.write(`const input = payload.value;`);\n const ids = Object.create(null);\n let counter = 0;\n for (const key of normalized.keys) {\n ids[key] = `key_${counter++}`;\n }\n // A: preserve key order {\n doc.write(`const newResult = {};`);\n for (const key of normalized.keys) {\n const id = ids[key];\n const k = util.esc(key);\n const schema = shape[key];\n const isOptionalOut = schema?._zod?.optout === \"optional\";\n doc.write(`const ${id} = ${parseStr(key)};`);\n if (isOptionalOut) {\n // For optional-out schemas, ignore errors on absent keys\n doc.write(`\n if (${id}.issues.length) {\n if (${k} in input) {\n payload.issues = payload.issues.concat(${id}.issues.map(iss => ({\n ...iss,\n path: iss.path ? [${k}, ...iss.path] : [${k}]\n })));\n }\n }\n \n if (${id}.value === undefined) {\n if (${k} in input) {\n newResult[${k}] = undefined;\n }\n } else {\n newResult[${k}] = ${id}.value;\n }\n \n `);\n }\n else {\n doc.write(`\n if (${id}.issues.length) {\n payload.issues = payload.issues.concat(${id}.issues.map(iss => ({\n ...iss,\n path: iss.path ? [${k}, ...iss.path] : [${k}]\n })));\n }\n \n if (${id}.value === undefined) {\n if (${k} in input) {\n newResult[${k}] = undefined;\n }\n } else {\n newResult[${k}] = ${id}.value;\n }\n \n `);\n }\n }\n doc.write(`payload.value = newResult;`);\n doc.write(`return payload;`);\n const fn = doc.compile();\n return (payload, ctx) => fn(shape, payload, ctx);\n };\n let fastpass;\n const isObject = util.isObject;\n const jit = !core.globalConfig.jitless;\n const allowsEval = util.allowsEval;\n const fastEnabled = jit && allowsEval.value; // && !def.catchall;\n const catchall = def.catchall;\n let value;\n inst._zod.parse = (payload, ctx) => {\n value ?? (value = _normalized.value);\n const input = payload.value;\n if (!isObject(input)) {\n payload.issues.push({\n expected: \"object\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n if (jit && fastEnabled && ctx?.async === false && ctx.jitless !== true) {\n // always synchronous\n if (!fastpass)\n fastpass = generateFastpass(def.shape);\n payload = fastpass(payload, ctx);\n if (!catchall)\n return payload;\n return handleCatchall([], input, payload, ctx, value, inst);\n }\n return superParse(payload, ctx);\n };\n});\nfunction handleUnionResults(results, final, inst, ctx) {\n for (const result of results) {\n if (result.issues.length === 0) {\n final.value = result.value;\n return final;\n }\n }\n const nonaborted = results.filter((r) => !util.aborted(r));\n if (nonaborted.length === 1) {\n final.value = nonaborted[0].value;\n return nonaborted[0];\n }\n final.issues.push({\n code: \"invalid_union\",\n input: final.value,\n inst,\n errors: results.map((result) => result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n });\n return final;\n}\nexport const $ZodUnion = /@__PURE__/ core.$constructor(\"$ZodUnion\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"optin\", () => def.options.some((o) => o._zod.optin === \"optional\") ? \"optional\" : undefined);\n util.defineLazy(inst._zod, \"optout\", () => def.options.some((o) => o._zod.optout === \"optional\") ? \"optional\" : undefined);\n util.defineLazy(inst._zod, \"values\", () => {\n if (def.options.every((o) => o._zod.values)) {\n return new Set(def.options.flatMap((option) => Array.from(option._zod.values)));\n }\n return undefined;\n });\n util.defineLazy(inst._zod, \"pattern\", () => {\n if (def.options.every((o) => o._zod.pattern)) {\n const patterns = def.options.map((o) => o._zod.pattern);\n return new RegExp(`^(${patterns.map((p) => util.cleanRegex(p.source)).join(\"\|\")})$`);\n }\n return undefined;\n });\n const single = def.options.length === 1;\n const first = def.options[0]._zod.run;\n inst._zod.parse = (payload, ctx) => {\n if (single) {\n return first(payload, ctx);\n }\n let async = false;\n const results = [];\n for (const option of def.options) {\n const result = option._zod.run({\n value: payload.value,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n results.push(result);\n async = true;\n }\n else {\n if (result.issues.length === 0)\n return result;\n results.push(result);\n }\n }\n if (!async)\n return handleUnionResults(results, payload, inst, ctx);\n return Promise.all(results).then((results) => {\n return handleUnionResults(results, payload, inst, ctx);\n });\n };\n});\nfunction handleExclusiveUnionResults(results, final, inst, ctx) {\n const successes = results.filter((r) => r.issues.length === 0);\n if (successes.length === 1) {\n final.value = successes[0].value;\n return final;\n }\n if (successes.length === 0) {\n // No matches - same as regular union\n final.issues.push({\n code: \"invalid_union\",\n input: final.value,\n inst,\n errors: results.map((result) => result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config()))),\n });\n }\n else {\n // Multiple matches - exclusive union failure\n final.issues.push({\n code: \"invalid_union\",\n input: final.value,\n inst,\n errors: [],\n inclusive: false,\n });\n }\n return final;\n}\nexport const $ZodXor = /@__PURE__/ core.$constructor(\"$ZodXor\", (inst, def) => {\n $ZodUnion.init(inst, def);\n def.inclusive = false;\n const single = def.options.length === 1;\n const first = def.options[0]._zod.run;\n inst._zod.parse = (payload, ctx) => {\n if (single) {\n return first(payload, ctx);\n }\n let async = false;\n const results = [];\n for (const option of def.options) {\n const result = option._zod.run({\n value: payload.value,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n results.push(result);\n async = true;\n }\n else {\n results.push(result);\n }\n }\n if (!async)\n return handleExclusiveUnionResults(results, payload, inst, ctx);\n return Promise.all(results).then((results) => {\n return handleExclusiveUnionResults(results, payload, inst, ctx);\n });\n };\n});\nexport const $ZodDiscriminatedUnion = \n/@__PURE__/\ncore.$constructor(\"$ZodDiscriminatedUnion\", (inst, def) => {\n def.inclusive = false;\n $ZodUnion.init(inst, def);\n const _super = inst._zod.parse;\n util.defineLazy(inst._zod, \"propValues\", () => {\n const propValues = {};\n for (const option of def.options) {\n const pv = option._zod.propValues;\n if (!pv \|\| Object.keys(pv).length === 0)\n throw new Error(`Invalid discriminated union option at index \"${def.options.indexOf(option)}\"`);\n for (const [k, v] of Object.entries(pv)) {\n if (!propValues[k])\n propValues[k] = new Set();\n for (const val of v) {\n propValues[k].add(val);\n }\n }\n }\n return propValues;\n });\n const disc = util.cached(() => {\n const opts = def.options;\n const map = new Map();\n for (const o of opts) {\n const values = o._zod.propValues?.[def.discriminator];\n if (!values \|\| values.size === 0)\n throw new Error(`Invalid discriminated union option at index \"${def.options.indexOf(o)}\"`);\n for (const v of values) {\n if (map.has(v)) {\n throw new Error(`Duplicate discriminator value \"${String(v)}\"`);\n }\n map.set(v, o);\n }\n }\n return map;\n });\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!util.isObject(input)) {\n payload.issues.push({\n code: \"invalid_type\",\n expected: \"object\",\n input,\n inst,\n });\n return payload;\n }\n const opt = disc.value.get(input?.[def.discriminator]);\n if (opt) {\n return opt._zod.run(payload, ctx);\n }\n if (def.unionFallback) {\n return _super(payload, ctx);\n }\n // no matching discriminator\n payload.issues.push({\n code: \"invalid_union\",\n errors: [],\n note: \"No matching discriminator\",\n discriminator: def.discriminator,\n input,\n path: [def.discriminator],\n inst,\n });\n return payload;\n };\n});\nexport const $ZodIntersection = /@__PURE__/ core.$constructor(\"$ZodIntersection\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n const left = def.left._zod.run({ value: input, issues: [] }, ctx);\n const right = def.right._zod.run({ value: input, issues: [] }, ctx);\n const async = left instanceof Promise \|\| right instanceof Promise;\n if (async) {\n return Promise.all([left, right]).then(([left, right]) => {\n return handleIntersectionResults(payload, left, right);\n });\n }\n return handleIntersectionResults(payload, left, right);\n };\n});\nfunction mergeValues(a, b) {\n // const aType = parse.t(a);\n // const bType = parse.t(b);\n if (a === b) {\n return { valid: true, data: a };\n }\n if (a instanceof Date && b instanceof Date && +a === +b) {\n return { valid: true, data: a };\n }\n if (util.isPlainObject(a) && util.isPlainObject(b)) {\n const bKeys = Object.keys(b);\n const sharedKeys = Object.keys(a).filter((key) => bKeys.indexOf(key) !== -1);\n const newObj = { ...a, ...b };\n for (const key of sharedKeys) {\n const sharedValue = mergeValues(a[key], b[key]);\n if (!sharedValue.valid) {\n return {\n valid: false,\n mergeErrorPath: [key, ...sharedValue.mergeErrorPath],\n };\n }\n newObj[key] = sharedValue.data;\n }\n return { valid: true, data: newObj };\n }\n if (Array.isArray(a) && Array.isArray(b)) {\n if (a.length !== b.length) {\n return { valid: false, mergeErrorPath: [] };\n }\n const newArray = [];\n for (let index = 0; index < a.length; index++) {\n const itemA = a[index];\n const itemB = b[index];\n const sharedValue = mergeValues(itemA, itemB);\n if (!sharedValue.valid) {\n return {\n valid: false,\n mergeErrorPath: [index, ...sharedValue.mergeErrorPath],\n };\n }\n newArray.push(sharedValue.data);\n }\n return { valid: true, data: newArray };\n }\n return { valid: false, mergeErrorPath: [] };\n}\nfunction handleIntersectionResults(result, left, right) {\n // Track which side(s) report each key as unrecognized\n const unrecKeys = new Map();\n let unrecIssue;\n for (const iss of left.issues) {\n if (iss.code === \"unrecognized_keys\") {\n unrecIssue ?? (unrecIssue = iss);\n for (const k of iss.keys) {\n if (!unrecKeys.has(k))\n unrecKeys.set(k, {});\n unrecKeys.get(k).l = true;\n }\n }\n else {\n result.issues.push(iss);\n }\n }\n for (const iss of right.issues) {\n if (iss.code === \"unrecognized_keys\") {\n for (const k of iss.keys) {\n if (!unrecKeys.has(k))\n unrecKeys.set(k, {});\n unrecKeys.get(k).r = true;\n }\n }\n else {\n result.issues.push(iss);\n }\n }\n // Report only keys unrecognized by BOTH sides\n const bothKeys = [...unrecKeys].filter(([, f]) => f.l && f.r).map(([k]) => k);\n if (bothKeys.length && unrecIssue) {\n result.issues.push({ ...unrecIssue, keys: bothKeys });\n }\n if (util.aborted(result))\n return result;\n const merged = mergeValues(left.value, right.value);\n if (!merged.valid) {\n throw new Error(`Unmergable intersection. Error path: ` + `${JSON.stringify(merged.mergeErrorPath)}`);\n }\n result.value = merged.data;\n return result;\n}\nexport const $ZodTuple = /@__PURE__/ core.$constructor(\"$ZodTuple\", (inst, def) => {\n $ZodType.init(inst, def);\n const items = def.items;\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!Array.isArray(input)) {\n payload.issues.push({\n input,\n inst,\n expected: \"tuple\",\n code: \"invalid_type\",\n });\n return payload;\n }\n payload.value = [];\n const proms = [];\n const reversedIndex = [...items].reverse().findIndex((item) => item._zod.optin !== \"optional\");\n const optStart = reversedIndex === -1 ? 0 : items.length - reversedIndex;\n if (!def.rest) {\n const tooBig = input.length > items.length;\n const tooSmall = input.length < optStart - 1;\n if (tooBig \|\| tooSmall) {\n payload.issues.push({\n ...(tooBig\n ? { code: \"too_big\", maximum: items.length, inclusive: true }\n : { code: \"too_small\", minimum: items.length }),\n input,\n inst,\n origin: \"array\",\n });\n return payload;\n }\n }\n let i = -1;\n for (const item of items) {\n i++;\n if (i >= input.length)\n if (i >= optStart)\n continue;\n const result = item._zod.run({\n value: input[i],\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleTupleResult(result, payload, i)));\n }\n else {\n handleTupleResult(result, payload, i);\n }\n }\n if (def.rest) {\n const rest = input.slice(items.length);\n for (const el of rest) {\n i++;\n const result = def.rest._zod.run({\n value: el,\n issues: [],\n }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleTupleResult(result, payload, i)));\n }\n else {\n handleTupleResult(result, payload, i);\n }\n }\n }\n if (proms.length)\n return Promise.all(proms).then(() => payload);\n return payload;\n };\n});\nfunction handleTupleResult(result, final, index) {\n if (result.issues.length) {\n final.issues.push(...util.prefixIssues(index, result.issues));\n }\n final.value[index] = result.value;\n}\nexport const $ZodRecord = /@__PURE__/ core.$constructor(\"$ZodRecord\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!util.isPlainObject(input)) {\n payload.issues.push({\n expected: \"record\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n const proms = [];\n const values = def.keyType._zod.values;\n if (values) {\n payload.value = {};\n const recordKeys = new Set();\n for (const key of values) {\n if (typeof key === \"string\" \|\| typeof key === \"number\" \|\| typeof key === \"symbol\") {\n recordKeys.add(typeof key === \"number\" ? key.toString() : key);\n const result = def.valueType._zod.run({ value: input[key], issues: [] }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[key] = result.value;\n }));\n }\n else {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[key] = result.value;\n }\n }\n }\n let unrecognized;\n for (const key in input) {\n if (!recordKeys.has(key)) {\n unrecognized = unrecognized ?? [];\n unrecognized.push(key);\n }\n }\n if (unrecognized && unrecognized.length > 0) {\n payload.issues.push({\n code: \"unrecognized_keys\",\n input,\n inst,\n keys: unrecognized,\n });\n }\n }\n else {\n payload.value = {};\n for (const key of Reflect.ownKeys(input)) {\n if (key === \"__proto__\")\n continue;\n let keyResult = def.keyType._zod.run({ value: key, issues: [] }, ctx);\n if (keyResult instanceof Promise) {\n throw new Error(\"Async schemas not supported in object keys currently\");\n }\n // Numeric string fallback: if key is a numeric string and failed, retry with Number(key)\n // This handles z.number(), z.literal([1, 2, 3]), and unions containing numeric literals\n const checkNumericKey = typeof key === \"string\" && regexes.number.test(key) && keyResult.issues.length;\n if (checkNumericKey) {\n const retryResult = def.keyType._zod.run({ value: Number(key), issues: [] }, ctx);\n if (retryResult instanceof Promise) {\n throw new Error(\"Async schemas not supported in object keys currently\");\n }\n if (retryResult.issues.length === 0) {\n keyResult = retryResult;\n }\n }\n if (keyResult.issues.length) {\n if (def.mode === \"loose\") {\n // Pass through unchanged\n payload.value[key] = input[key];\n }\n else {\n // Default \"strict\" behavior: error on invalid key\n payload.issues.push({\n code: \"invalid_key\",\n origin: \"record\",\n issues: keyResult.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n input: key,\n path: [key],\n inst,\n });\n }\n continue;\n }\n const result = def.valueType._zod.run({ value: input[key], issues: [] }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[keyResult.value] = result.value;\n }));\n }\n else {\n if (result.issues.length) {\n payload.issues.push(...util.prefixIssues(key, result.issues));\n }\n payload.value[keyResult.value] = result.value;\n }\n }\n }\n if (proms.length) {\n return Promise.all(proms).then(() => payload);\n }\n return payload;\n };\n});\nexport const $ZodMap = /@__PURE__/ core.$constructor(\"$ZodMap\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!(input instanceof Map)) {\n payload.issues.push({\n expected: \"map\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n }\n const proms = [];\n payload.value = new Map();\n for (const [key, value] of input) {\n const keyResult = def.keyType._zod.run({ value: key, issues: [] }, ctx);\n const valueResult = def.valueType._zod.run({ value: value, issues: [] }, ctx);\n if (keyResult instanceof Promise \|\| valueResult instanceof Promise) {\n proms.push(Promise.all([keyResult, valueResult]).then(([keyResult, valueResult]) => {\n handleMapResult(keyResult, valueResult, payload, key, input, inst, ctx);\n }));\n }\n else {\n handleMapResult(keyResult, valueResult, payload, key, input, inst, ctx);\n }\n }\n if (proms.length)\n return Promise.all(proms).then(() => payload);\n return payload;\n };\n});\nfunction handleMapResult(keyResult, valueResult, final, key, input, inst, ctx) {\n if (keyResult.issues.length) {\n if (util.propertyKeyTypes.has(typeof key)) {\n final.issues.push(...util.prefixIssues(key, keyResult.issues));\n }\n else {\n final.issues.push({\n code: \"invalid_key\",\n origin: \"map\",\n input,\n inst,\n issues: keyResult.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n });\n }\n }\n if (valueResult.issues.length) {\n if (util.propertyKeyTypes.has(typeof key)) {\n final.issues.push(...util.prefixIssues(key, valueResult.issues));\n }\n else {\n final.issues.push({\n origin: \"map\",\n code: \"invalid_element\",\n input,\n inst,\n key: key,\n issues: valueResult.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n });\n }\n }\n final.value.set(keyResult.value, valueResult.value);\n}\nexport const $ZodSet = /@__PURE__/ core.$constructor(\"$ZodSet\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n const input = payload.value;\n if (!(input instanceof Set)) {\n payload.issues.push({\n input,\n inst,\n expected: \"set\",\n code: \"invalid_type\",\n });\n return payload;\n }\n const proms = [];\n payload.value = new Set();\n for (const item of input) {\n const result = def.valueType._zod.run({ value: item, issues: [] }, ctx);\n if (result instanceof Promise) {\n proms.push(result.then((result) => handleSetResult(result, payload)));\n }\n else\n handleSetResult(result, payload);\n }\n if (proms.length)\n return Promise.all(proms).then(() => payload);\n return payload;\n };\n});\nfunction handleSetResult(result, final) {\n if (result.issues.length) {\n final.issues.push(...result.issues);\n }\n final.value.add(result.value);\n}\nexport const $ZodEnum = /@__PURE__/ core.$constructor(\"$ZodEnum\", (inst, def) => {\n $ZodType.init(inst, def);\n const values = util.getEnumValues(def.entries);\n const valuesSet = new Set(values);\n inst._zod.values = valuesSet;\n inst._zod.pattern = new RegExp(`^(${values\n .filter((k) => util.propertyKeyTypes.has(typeof k))\n .map((o) => (typeof o === \"string\" ? util.escapeRegex(o) : o.toString()))\n .join(\"\|\")})$`);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (valuesSet.has(input)) {\n return payload;\n }\n payload.issues.push({\n code: \"invalid_value\",\n values,\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodLiteral = /@__PURE__/ core.$constructor(\"$ZodLiteral\", (inst, def) => {\n $ZodType.init(inst, def);\n if (def.values.length === 0) {\n throw new Error(\"Cannot create literal schema with no valid values\");\n }\n const values = new Set(def.values);\n inst._zod.values = values;\n inst._zod.pattern = new RegExp(`^(${def.values\n .map((o) => (typeof o === \"string\" ? util.escapeRegex(o) : o ? util.escapeRegex(o.toString()) : String(o)))\n .join(\"\|\")})$`);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n if (values.has(input)) {\n return payload;\n }\n payload.issues.push({\n code: \"invalid_value\",\n values: def.values,\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodFile = /@__PURE__/ core.$constructor(\"$ZodFile\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n const input = payload.value;\n // @ts-ignore\n if (input instanceof File)\n return payload;\n payload.issues.push({\n expected: \"file\",\n code: \"invalid_type\",\n input,\n inst,\n });\n return payload;\n };\n});\nexport const $ZodTransform = /@__PURE__/ core.$constructor(\"$ZodTransform\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n throw new core.$ZodEncodeError(inst.constructor.name);\n }\n const _out = def.transform(payload.value, payload);\n if (ctx.async) {\n const output = _out instanceof Promise ? _out : Promise.resolve(_out);\n return output.then((output) => {\n payload.value = output;\n return payload;\n });\n }\n if (_out instanceof Promise) {\n throw new core.$ZodAsyncError();\n }\n payload.value = _out;\n return payload;\n };\n});\nfunction handleOptionalResult(result, input) {\n if (result.issues.length && input === undefined) {\n return { issues: [], value: undefined };\n }\n return result;\n}\nexport const $ZodOptional = /@__PURE__/ core.$constructor(\"$ZodOptional\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.optin = \"optional\";\n inst._zod.optout = \"optional\";\n util.defineLazy(inst._zod, \"values\", () => {\n return def.innerType._zod.values ? new Set([...def.innerType._zod.values, undefined]) : undefined;\n });\n util.defineLazy(inst._zod, \"pattern\", () => {\n const pattern = def.innerType._zod.pattern;\n return pattern ? new RegExp(`^(${util.cleanRegex(pattern.source)})?$`) : undefined;\n });\n inst._zod.parse = (payload, ctx) => {\n if (def.innerType._zod.optin === \"optional\") {\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise)\n return result.then((r) => handleOptionalResult(r, payload.value));\n return handleOptionalResult(result, payload.value);\n }\n if (payload.value === undefined) {\n return payload;\n }\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodExactOptional = /@__PURE__/ core.$constructor(\"$ZodExactOptional\", (inst, def) => {\n // Call parent init - inherits optin/optout = \"optional\"\n $ZodOptional.init(inst, def);\n // Override values/pattern to NOT add undefined\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n util.defineLazy(inst._zod, \"pattern\", () => def.innerType._zod.pattern);\n // Override parse to just delegate (no undefined handling)\n inst._zod.parse = (payload, ctx) => {\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodNullable = /@__PURE__/ core.$constructor(\"$ZodNullable\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"optin\", () => def.innerType._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.innerType._zod.optout);\n util.defineLazy(inst._zod, \"pattern\", () => {\n const pattern = def.innerType._zod.pattern;\n return pattern ? new RegExp(`^(${util.cleanRegex(pattern.source)}\|null)$`) : undefined;\n });\n util.defineLazy(inst._zod, \"values\", () => {\n return def.innerType._zod.values ? new Set([...def.innerType._zod.values, null]) : undefined;\n });\n inst._zod.parse = (payload, ctx) => {\n // Forward direction (decode): allow null to pass through\n if (payload.value === null)\n return payload;\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodDefault = /@__PURE__/ core.$constructor(\"$ZodDefault\", (inst, def) => {\n $ZodType.init(inst, def);\n // inst._zod.qin = \"true\";\n inst._zod.optin = \"optional\";\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n // Forward direction (decode): apply defaults for undefined input\n if (payload.value === undefined) {\n payload.value = def.defaultValue;\n /*\n $ZodDefault returns the default value immediately in forward direction.\n * It doesn't pass the default value into the validator (\"prefault\"). There's no reason to pass the default value through validation. The validity of the default is enforced by TypeScript statically. Otherwise, it's the responsibility of the user to ensure the default is valid. In the case of pipes with divergent in/out types, you can specify the default on the `in` schema of your ZodPipe to set a \"prefault\" for the pipe. /\n return payload;\n }\n // Forward direction: continue with default handling\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => handleDefaultResult(result, def));\n }\n return handleDefaultResult(result, def);\n };\n});\nfunction handleDefaultResult(payload, def) {\n if (payload.value === undefined) {\n payload.value = def.defaultValue;\n }\n return payload;\n}\nexport const $ZodPrefault = /@__PURE__/ core.$constructor(\"$ZodPrefault\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.optin = \"optional\";\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n // Forward direction (decode): apply prefault for undefined input\n if (payload.value === undefined) {\n payload.value = def.defaultValue;\n }\n return def.innerType._zod.run(payload, ctx);\n };\n});\nexport const $ZodNonOptional = /@__PURE__/ core.$constructor(\"$ZodNonOptional\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"values\", () => {\n const v = def.innerType._zod.values;\n return v ? new Set([...v].filter((x) => x !== undefined)) : undefined;\n });\n inst._zod.parse = (payload, ctx) => {\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => handleNonOptionalResult(result, inst));\n }\n return handleNonOptionalResult(result, inst);\n };\n});\nfunction handleNonOptionalResult(payload, inst) {\n if (!payload.issues.length && payload.value === undefined) {\n payload.issues.push({\n code: \"invalid_type\",\n expected: \"nonoptional\",\n input: payload.value,\n inst,\n });\n }\n return payload;\n}\nexport const $ZodSuccess = /@__PURE__/ core.$constructor(\"$ZodSuccess\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n throw new core.$ZodEncodeError(\"ZodSuccess\");\n }\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => {\n payload.value = result.issues.length === 0;\n return payload;\n });\n }\n payload.value = result.issues.length === 0;\n return payload;\n };\n});\nexport const $ZodCatch = /@__PURE__/ core.$constructor(\"$ZodCatch\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"optin\", () => def.innerType._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.innerType._zod.optout);\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n // Forward direction (decode): apply catch logic\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then((result) => {\n payload.value = result.value;\n if (result.issues.length) {\n payload.value = def.catchValue({\n ...payload,\n error: {\n issues: result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n },\n input: payload.value,\n });\n payload.issues = [];\n }\n return payload;\n });\n }\n payload.value = result.value;\n if (result.issues.length) {\n payload.value = def.catchValue({\n ...payload,\n error: {\n issues: result.issues.map((iss) => util.finalizeIssue(iss, ctx, core.config())),\n },\n input: payload.value,\n });\n payload.issues = [];\n }\n return payload;\n };\n});\nexport const $ZodNaN = /@__PURE__/ core.$constructor(\"$ZodNaN\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _ctx) => {\n if (typeof payload.value !== \"number\" \|\| !Number.isNaN(payload.value)) {\n payload.issues.push({\n input: payload.value,\n inst,\n expected: \"nan\",\n code: \"invalid_type\",\n });\n return payload;\n }\n return payload;\n };\n});\nexport const $ZodPipe = /@__PURE__/ core.$constructor(\"$ZodPipe\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"values\", () => def.in._zod.values);\n util.defineLazy(inst._zod, \"optin\", () => def.in._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.out._zod.optout);\n util.defineLazy(inst._zod, \"propValues\", () => def.in._zod.propValues);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n const right = def.out._zod.run(payload, ctx);\n if (right instanceof Promise) {\n return right.then((right) => handlePipeResult(right, def.in, ctx));\n }\n return handlePipeResult(right, def.in, ctx);\n }\n const left = def.in._zod.run(payload, ctx);\n if (left instanceof Promise) {\n return left.then((left) => handlePipeResult(left, def.out, ctx));\n }\n return handlePipeResult(left, def.out, ctx);\n };\n});\nfunction handlePipeResult(left, next, ctx) {\n if (left.issues.length) {\n // prevent further checks\n left.aborted = true;\n return left;\n }\n return next._zod.run({ value: left.value, issues: left.issues }, ctx);\n}\nexport const $ZodCodec = /@__PURE__/ core.$constructor(\"$ZodCodec\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"values\", () => def.in._zod.values);\n util.defineLazy(inst._zod, \"optin\", () => def.in._zod.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.out._zod.optout);\n util.defineLazy(inst._zod, \"propValues\", () => def.in._zod.propValues);\n inst._zod.parse = (payload, ctx) => {\n const direction = ctx.direction \|\| \"forward\";\n if (direction === \"forward\") {\n const left = def.in._zod.run(payload, ctx);\n if (left instanceof Promise) {\n return left.then((left) => handleCodecAResult(left, def, ctx));\n }\n return handleCodecAResult(left, def, ctx);\n }\n else {\n const right = def.out._zod.run(payload, ctx);\n if (right instanceof Promise) {\n return right.then((right) => handleCodecAResult(right, def, ctx));\n }\n return handleCodecAResult(right, def, ctx);\n }\n };\n});\nfunction handleCodecAResult(result, def, ctx) {\n if (result.issues.length) {\n // prevent further checks\n result.aborted = true;\n return result;\n }\n const direction = ctx.direction \|\| \"forward\";\n if (direction === \"forward\") {\n const transformed = def.transform(result.value, result);\n if (transformed instanceof Promise) {\n return transformed.then((value) => handleCodecTxResult(result, value, def.out, ctx));\n }\n return handleCodecTxResult(result, transformed, def.out, ctx);\n }\n else {\n const transformed = def.reverseTransform(result.value, result);\n if (transformed instanceof Promise) {\n return transformed.then((value) => handleCodecTxResult(result, value, def.in, ctx));\n }\n return handleCodecTxResult(result, transformed, def.in, ctx);\n }\n}\nfunction handleCodecTxResult(left, value, nextSchema, ctx) {\n // Check if transform added any issues\n if (left.issues.length) {\n left.aborted = true;\n return left;\n }\n return nextSchema._zod.run({ value, issues: left.issues }, ctx);\n}\nexport const $ZodReadonly = /@__PURE__/ core.$constructor(\"$ZodReadonly\", (inst, def) => {\n $ZodType.init(inst, def);\n util.defineLazy(inst._zod, \"propValues\", () => def.innerType._zod.propValues);\n util.defineLazy(inst._zod, \"values\", () => def.innerType._zod.values);\n util.defineLazy(inst._zod, \"optin\", () => def.innerType?._zod?.optin);\n util.defineLazy(inst._zod, \"optout\", () => def.innerType?._zod?.optout);\n inst._zod.parse = (payload, ctx) => {\n if (ctx.direction === \"backward\") {\n return def.innerType._zod.run(payload, ctx);\n }\n const result = def.innerType._zod.run(payload, ctx);\n if (result instanceof Promise) {\n return result.then(handleReadonlyResult);\n }\n return handleReadonlyResult(result);\n };\n});\nfunction handleReadonlyResult(payload) {\n payload.value = Object.freeze(payload.value);\n return payload;\n}\nexport const $ZodTemplateLiteral = /@__PURE__/ core.$constructor(\"$ZodTemplateLiteral\", (inst, def) => {\n $ZodType.init(inst, def);\n const regexParts = [];\n for (const part of def.parts) {\n if (typeof part === \"object\" && part !== null) {\n // is Zod schema\n if (!part._zod.pattern) {\n // if (!source)\n throw new Error(`Invalid template literal part, no pattern found: ${[...part._zod.traits].shift()}`);\n }\n const source = part._zod.pattern instanceof RegExp ? part._zod.pattern.source : part._zod.pattern;\n if (!source)\n throw new Error(`Invalid template literal part: ${part._zod.traits}`);\n const start = source.startsWith(\"^\") ? 1 : 0;\n const end = source.endsWith(\"$\") ? source.length - 1 : source.length;\n regexParts.push(source.slice(start, end));\n }\n else if (part === null \|\| util.primitiveTypes.has(typeof part)) {\n regexParts.push(util.escapeRegex(`${part}`));\n }\n else {\n throw new Error(`Invalid template literal part: ${part}`);\n }\n }\n inst._zod.pattern = new RegExp(`^${regexParts.join(\"\")}$`);\n inst._zod.parse = (payload, _ctx) => {\n if (typeof payload.value !== \"string\") {\n payload.issues.push({\n input: payload.value,\n inst,\n expected: \"string\",\n code: \"invalid_type\",\n });\n return payload;\n }\n inst._zod.pattern.lastIndex = 0;\n if (!inst._zod.pattern.test(payload.value)) {\n payload.issues.push({\n input: payload.value,\n inst,\n code: \"invalid_format\",\n format: def.format ?? \"template_literal\",\n pattern: inst._zod.pattern.source,\n });\n return payload;\n }\n return payload;\n };\n});\nexport const $ZodFunction = /@__PURE__/ core.$constructor(\"$ZodFunction\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._def = def;\n inst._zod.def = def;\n inst.implement = (func) => {\n if (typeof func !== \"function\") {\n throw new Error(\"implement() must be called with a function\");\n }\n return function (...args) {\n const parsedArgs = inst._def.input ? parse(inst._def.input, args) : args;\n const result = Reflect.apply(func, this, parsedArgs);\n if (inst._def.output) {\n return parse(inst._def.output, result);\n }\n return result;\n };\n };\n inst.implementAsync = (func) => {\n if (typeof func !== \"function\") {\n throw new Error(\"implementAsync() must be called with a function\");\n }\n return async function (...args) {\n const parsedArgs = inst._def.input ? await parseAsync(inst._def.input, args) : args;\n const result = await Reflect.apply(func, this, parsedArgs);\n if (inst._def.output) {\n return await parseAsync(inst._def.output, result);\n }\n return result;\n };\n };\n inst._zod.parse = (payload, _ctx) => {\n if (typeof payload.value !== \"function\") {\n payload.issues.push({\n code: \"invalid_type\",\n expected: \"function\",\n input: payload.value,\n inst,\n });\n return payload;\n }\n // Check if output is a promise type to determine if we should use async implementation\n const hasPromiseOutput = inst._def.output && inst._def.output._zod.def.type === \"promise\";\n if (hasPromiseOutput) {\n payload.value = inst.implementAsync(payload.value);\n }\n else {\n payload.value = inst.implement(payload.value);\n }\n return payload;\n };\n inst.input = (...args) => {\n const F = inst.constructor;\n if (Array.isArray(args[0])) {\n return new F({\n type: \"function\",\n input: new $ZodTuple({\n type: \"tuple\",\n items: args[0],\n rest: args[1],\n }),\n output: inst._def.output,\n });\n }\n return new F({\n type: \"function\",\n input: args[0],\n output: inst._def.output,\n });\n };\n inst.output = (output) => {\n const F = inst.constructor;\n return new F({\n type: \"function\",\n input: inst._def.input,\n output,\n });\n };\n return inst;\n});\nexport const $ZodPromise = /@__PURE__/ core.$constructor(\"$ZodPromise\", (inst, def) => {\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, ctx) => {\n return Promise.resolve(payload.value).then((inner) => def.innerType._zod.run({ value: inner, issues: [] }, ctx));\n };\n});\nexport const $ZodLazy = /@__PURE__/ core.$constructor(\"$ZodLazy\", (inst, def) => {\n $ZodType.init(inst, def);\n // let _innerType!: any;\n // util.defineLazy(def, \"getter\", () => {\n // if (!_innerType) {\n // _innerType = def.getter();\n // }\n // return () => _innerType;\n // });\n util.defineLazy(inst._zod, \"innerType\", () => def.getter());\n util.defineLazy(inst._zod, \"pattern\", () => inst._zod.innerType?._zod?.pattern);\n util.defineLazy(inst._zod, \"propValues\", () => inst._zod.innerType?._zod?.propValues);\n util.defineLazy(inst._zod, \"optin\", () => inst._zod.innerType?._zod?.optin ?? undefined);\n util.defineLazy(inst._zod, \"optout\", () => inst._zod.innerType?._zod?.optout ?? undefined);\n inst._zod.parse = (payload, ctx) => {\n const inner = inst._zod.innerType;\n return inner._zod.run(payload, ctx);\n };\n});\nexport const $ZodCustom = /@__PURE__/ core.$constructor(\"$ZodCustom\", (inst, def) => {\n checks.$ZodCheck.init(inst, def);\n $ZodType.init(inst, def);\n inst._zod.parse = (payload, _) => {\n return payload;\n };\n inst._zod.check = (payload) => {\n const input = payload.value;\n const r = def.fn(input);\n if (r instanceof Promise) {\n return r.then((r) => handleRefineResult(r, payload, input, inst));\n }\n handleRefineResult(r, payload, input, inst);\n return;\n };\n});\nfunction handleRefineResult(result, payload, input, inst) {\n if (!result) {\n const _iss = {\n code: \"custom\",\n input,\n inst, // incorporates params.error into issue reporting\n path: [...(inst._zod.def.path ?? [])], // incorporates params.error into issue reporting\n continue: !inst._zod.def.abort,\n // params: inst._zod.def.params,\n };\n if (inst._zod.def.params)\n _iss.params = inst._zod.def.params;\n payload.issues.push(util.issue(_iss));\n }\n}\n","var _a;\nexport const $output = Symbol(\"ZodOutput\");\nexport const $input = Symbol(\"ZodInput\");\nexport class $ZodRegistry {\n constructor() {\n this._map = new WeakMap();\n this._idmap = new Map();\n }\n add(schema, ..._meta) {\n const meta = _meta[0];\n this._map.set(schema, meta);\n if (meta && typeof meta === \"object\" && \"id\" in meta) {\n this._idmap.set(meta.id, schema);\n }\n return this;\n }\n clear() {\n this._map = new WeakMap();\n this._idmap = new Map();\n return this;\n }\n remove(schema) {\n const meta = this._map.get(schema);\n if (meta && typeof meta === \"object\" && \"id\" in meta) {\n this._idmap.delete(meta.id);\n }\n this._map.delete(schema);\n return this;\n }\n get(schema) {\n // return this._map.get(schema) as any;\n // inherit metadata\n const p = schema._zod.parent;\n if (p) {\n const pm = { ...(this.get(p) ?? {}) };\n delete pm.id; // do not inherit id\n const f = { ...pm, ...this._map.get(schema) };\n return Object.keys(f).length ? f : undefined;\n }\n return this._map.get(schema);\n }\n has(schema) {\n return this._map.has(schema);\n }\n}\n// registries\nexport function registry() {\n return new $ZodRegistry();\n}\n(_a = globalThis).__zod_globalRegistry ?? (_a.__zod_globalRegistry = registry());\nexport const globalRegistry = globalThis.__zod_globalRegistry;\n","import as checks from \"./checks.js\";\nimport * as registries from \"./registries.js\";\nimport * as schemas from \"./schemas.js\";\nimport * as util from \"./util.js\";\n// @__NO_SIDE_EFFECTS__\nexport function _string(Class, params) {\n return new Class({\n type: \"string\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedString(Class, params) {\n return new Class({\n type: \"string\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _email(Class, params) {\n return new Class({\n type: \"string\",\n format: \"email\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _guid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"guid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuidv4(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n version: \"v4\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuidv6(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n version: \"v6\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uuidv7(Class, params) {\n return new Class({\n type: \"string\",\n format: \"uuid\",\n check: \"string_format\",\n abort: false,\n version: \"v7\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _url(Class, params) {\n return new Class({\n type: \"string\",\n format: \"url\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _emoji(Class, params) {\n return new Class({\n type: \"string\",\n format: \"emoji\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nanoid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"nanoid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cuid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cuid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cuid2(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cuid2\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ulid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ulid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _xid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"xid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ksuid(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ksuid\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ipv4(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ipv4\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _ipv6(Class, params) {\n return new Class({\n type: \"string\",\n format: \"ipv6\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _mac(Class, params) {\n return new Class({\n type: \"string\",\n format: \"mac\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cidrv4(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cidrv4\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _cidrv6(Class, params) {\n return new Class({\n type: \"string\",\n format: \"cidrv6\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _base64(Class, params) {\n return new Class({\n type: \"string\",\n format: \"base64\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _base64url(Class, params) {\n return new Class({\n type: \"string\",\n format: \"base64url\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _e164(Class, params) {\n return new Class({\n type: \"string\",\n format: \"e164\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _jwt(Class, params) {\n return new Class({\n type: \"string\",\n format: \"jwt\",\n check: \"string_format\",\n abort: false,\n ...util.normalizeParams(params),\n });\n}\nexport const TimePrecision = {\n Any: null,\n Minute: -1,\n Second: 0,\n Millisecond: 3,\n Microsecond: 6,\n};\n// @__NO_SIDE_EFFECTS__\nexport function _isoDateTime(Class, params) {\n return new Class({\n type: \"string\",\n format: \"datetime\",\n check: \"string_format\",\n offset: false,\n local: false,\n precision: null,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _isoDate(Class, params) {\n return new Class({\n type: \"string\",\n format: \"date\",\n check: \"string_format\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _isoTime(Class, params) {\n return new Class({\n type: \"string\",\n format: \"time\",\n check: \"string_format\",\n precision: null,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _isoDuration(Class, params) {\n return new Class({\n type: \"string\",\n format: \"duration\",\n check: \"string_format\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _number(Class, params) {\n return new Class({\n type: \"number\",\n checks: [],\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedNumber(Class, params) {\n return new Class({\n type: \"number\",\n coerce: true,\n checks: [],\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _int(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"safeint\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _float32(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"float32\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _float64(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"float64\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _int32(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"int32\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uint32(Class, params) {\n return new Class({\n type: \"number\",\n check: \"number_format\",\n abort: false,\n format: \"uint32\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _boolean(Class, params) {\n return new Class({\n type: \"boolean\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedBoolean(Class, params) {\n return new Class({\n type: \"boolean\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _bigint(Class, params) {\n return new Class({\n type: \"bigint\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedBigint(Class, params) {\n return new Class({\n type: \"bigint\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _int64(Class, params) {\n return new Class({\n type: \"bigint\",\n check: \"bigint_format\",\n abort: false,\n format: \"int64\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uint64(Class, params) {\n return new Class({\n type: \"bigint\",\n check: \"bigint_format\",\n abort: false,\n format: \"uint64\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _symbol(Class, params) {\n return new Class({\n type: \"symbol\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _undefined(Class, params) {\n return new Class({\n type: \"undefined\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _null(Class, params) {\n return new Class({\n type: \"null\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _any(Class) {\n return new Class({\n type: \"any\",\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _unknown(Class) {\n return new Class({\n type: \"unknown\",\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _never(Class, params) {\n return new Class({\n type: \"never\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _void(Class, params) {\n return new Class({\n type: \"void\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _date(Class, params) {\n return new Class({\n type: \"date\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _coercedDate(Class, params) {\n return new Class({\n type: \"date\",\n coerce: true,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nan(Class, params) {\n return new Class({\n type: \"nan\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lt(value, params) {\n return new checks.$ZodCheckLessThan({\n check: \"less_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: false,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lte(value, params) {\n return new checks.$ZodCheckLessThan({\n check: \"less_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: true,\n });\n}\nexport { \n/** @deprecated Use `z.lte()` instead. /\n_lte as _max, };\n// @__NO_SIDE_EFFECTS__\nexport function _gt(value, params) {\n return new checks.$ZodCheckGreaterThan({\n check: \"greater_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: false,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _gte(value, params) {\n return new checks.$ZodCheckGreaterThan({\n check: \"greater_than\",\n ...util.normalizeParams(params),\n value,\n inclusive: true,\n });\n}\nexport { \n/* @deprecated Use `z.gte()` instead. /\n_gte as _min, };\n// @__NO_SIDE_EFFECTS__\nexport function _positive(params) {\n return _gt(0, params);\n}\n// negative\n// @__NO_SIDE_EFFECTS__\nexport function _negative(params) {\n return _lt(0, params);\n}\n// nonpositive\n// @__NO_SIDE_EFFECTS__\nexport function _nonpositive(params) {\n return _lte(0, params);\n}\n// nonnegative\n// @__NO_SIDE_EFFECTS__\nexport function _nonnegative(params) {\n return _gte(0, params);\n}\n// @__NO_SIDE_EFFECTS__\nexport function _multipleOf(value, params) {\n return new checks.$ZodCheckMultipleOf({\n check: \"multiple_of\",\n ...util.normalizeParams(params),\n value,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _maxSize(maximum, params) {\n return new checks.$ZodCheckMaxSize({\n check: \"max_size\",\n ...util.normalizeParams(params),\n maximum,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _minSize(minimum, params) {\n return new checks.$ZodCheckMinSize({\n check: \"min_size\",\n ...util.normalizeParams(params),\n minimum,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _size(size, params) {\n return new checks.$ZodCheckSizeEquals({\n check: \"size_equals\",\n ...util.normalizeParams(params),\n size,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _maxLength(maximum, params) {\n const ch = new checks.$ZodCheckMaxLength({\n check: \"max_length\",\n ...util.normalizeParams(params),\n maximum,\n });\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _minLength(minimum, params) {\n return new checks.$ZodCheckMinLength({\n check: \"min_length\",\n ...util.normalizeParams(params),\n minimum,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _length(length, params) {\n return new checks.$ZodCheckLengthEquals({\n check: \"length_equals\",\n ...util.normalizeParams(params),\n length,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _regex(pattern, params) {\n return new checks.$ZodCheckRegex({\n check: \"string_format\",\n format: \"regex\",\n ...util.normalizeParams(params),\n pattern,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lowercase(params) {\n return new checks.$ZodCheckLowerCase({\n check: \"string_format\",\n format: \"lowercase\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _uppercase(params) {\n return new checks.$ZodCheckUpperCase({\n check: \"string_format\",\n format: \"uppercase\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _includes(includes, params) {\n return new checks.$ZodCheckIncludes({\n check: \"string_format\",\n format: \"includes\",\n ...util.normalizeParams(params),\n includes,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _startsWith(prefix, params) {\n return new checks.$ZodCheckStartsWith({\n check: \"string_format\",\n format: \"starts_with\",\n ...util.normalizeParams(params),\n prefix,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _endsWith(suffix, params) {\n return new checks.$ZodCheckEndsWith({\n check: \"string_format\",\n format: \"ends_with\",\n ...util.normalizeParams(params),\n suffix,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _property(property, schema, params) {\n return new checks.$ZodCheckProperty({\n check: \"property\",\n property,\n schema,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _mime(types, params) {\n return new checks.$ZodCheckMimeType({\n check: \"mime_type\",\n mime: types,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _overwrite(tx) {\n return new checks.$ZodCheckOverwrite({\n check: \"overwrite\",\n tx,\n });\n}\n// normalize\n// @__NO_SIDE_EFFECTS__\nexport function _normalize(form) {\n return _overwrite((input) => input.normalize(form));\n}\n// trim\n// @__NO_SIDE_EFFECTS__\nexport function _trim() {\n return _overwrite((input) => input.trim());\n}\n// toLowerCase\n// @__NO_SIDE_EFFECTS__\nexport function _toLowerCase() {\n return _overwrite((input) => input.toLowerCase());\n}\n// toUpperCase\n// @__NO_SIDE_EFFECTS__\nexport function _toUpperCase() {\n return _overwrite((input) => input.toUpperCase());\n}\n// slugify\n// @__NO_SIDE_EFFECTS__\nexport function _slugify() {\n return _overwrite((input) => util.slugify(input));\n}\n// @__NO_SIDE_EFFECTS__\nexport function _array(Class, element, params) {\n return new Class({\n type: \"array\",\n element,\n // get element() {\n // return element;\n // },\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _union(Class, options, params) {\n return new Class({\n type: \"union\",\n options,\n ...util.normalizeParams(params),\n });\n}\nexport function _xor(Class, options, params) {\n return new Class({\n type: \"union\",\n options,\n inclusive: false,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _discriminatedUnion(Class, discriminator, options, params) {\n return new Class({\n type: \"union\",\n options,\n discriminator,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _intersection(Class, left, right) {\n return new Class({\n type: \"intersection\",\n left,\n right,\n });\n}\n// export function _tuple(\n// Class: util.SchemaClass<schemas.$ZodTuple>,\n// items: [],\n// params?: string \| $ZodTupleParams\n// ): schemas.$ZodTuple<[], null>;\n// @__NO_SIDE_EFFECTS__\nexport function _tuple(Class, items, _paramsOrRest, _params) {\n const hasRest = _paramsOrRest instanceof schemas.$ZodType;\n const params = hasRest ? _params : _paramsOrRest;\n const rest = hasRest ? _paramsOrRest : null;\n return new Class({\n type: \"tuple\",\n items,\n rest,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _record(Class, keyType, valueType, params) {\n return new Class({\n type: \"record\",\n keyType,\n valueType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _map(Class, keyType, valueType, params) {\n return new Class({\n type: \"map\",\n keyType,\n valueType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _set(Class, valueType, params) {\n return new Class({\n type: \"set\",\n valueType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _enum(Class, values, params) {\n const entries = Array.isArray(values) ? Object.fromEntries(values.map((v) => [v, v])) : values;\n // if (Array.isArray(values)) {\n // for (const value of values) {\n // entries[value] = value;\n // }\n // } else {\n // Object.assign(entries, values);\n // }\n // const entries: util.EnumLike = {};\n // for (const val of values) {\n // entries[val] = val;\n // }\n return new Class({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\n/* @deprecated This API has been merged into `z.enum()`. Use `z.enum()` instead.\n \n ```ts\n * enum Colors { red, green, blue }\n * z.enum(Colors);\n * ```\n /\nexport function _nativeEnum(Class, entries, params) {\n return new Class({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _literal(Class, value, params) {\n return new Class({\n type: \"literal\",\n values: Array.isArray(value) ? value : [value],\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _file(Class, params) {\n return new Class({\n type: \"file\",\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _transform(Class, fn) {\n return new Class({\n type: \"transform\",\n transform: fn,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _optional(Class, innerType) {\n return new Class({\n type: \"optional\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nullable(Class, innerType) {\n return new Class({\n type: \"nullable\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _default(Class, innerType, defaultValue) {\n return new Class({\n type: \"default\",\n innerType,\n get defaultValue() {\n return typeof defaultValue === \"function\" ? defaultValue() : util.shallowClone(defaultValue);\n },\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _nonoptional(Class, innerType, params) {\n return new Class({\n type: \"nonoptional\",\n innerType,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _success(Class, innerType) {\n return new Class({\n type: \"success\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _catch(Class, innerType, catchValue) {\n return new Class({\n type: \"catch\",\n innerType,\n catchValue: (typeof catchValue === \"function\" ? catchValue : () => catchValue),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _pipe(Class, in_, out) {\n return new Class({\n type: \"pipe\",\n in: in_,\n out,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _readonly(Class, innerType) {\n return new Class({\n type: \"readonly\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _templateLiteral(Class, parts, params) {\n return new Class({\n type: \"template_literal\",\n parts,\n ...util.normalizeParams(params),\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _lazy(Class, getter) {\n return new Class({\n type: \"lazy\",\n getter,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _promise(Class, innerType) {\n return new Class({\n type: \"promise\",\n innerType,\n });\n}\n// @__NO_SIDE_EFFECTS__\nexport function _custom(Class, fn, _params) {\n const norm = util.normalizeParams(_params);\n norm.abort ?? (norm.abort = true); // default to abort:false\n const schema = new Class({\n type: \"custom\",\n check: \"custom\",\n fn: fn,\n ...norm,\n });\n return schema;\n}\n// same as _custom but defaults to abort:false\n// @__NO_SIDE_EFFECTS__\nexport function _refine(Class, fn, _params) {\n const schema = new Class({\n type: \"custom\",\n check: \"custom\",\n fn: fn,\n ...util.normalizeParams(_params),\n });\n return schema;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _superRefine(fn) {\n const ch = _check((payload) => {\n payload.addIssue = (issue) => {\n if (typeof issue === \"string\") {\n payload.issues.push(util.issue(issue, payload.value, ch._zod.def));\n }\n else {\n // for Zod 3 backwards compatibility\n const _issue = issue;\n if (_issue.fatal)\n _issue.continue = false;\n _issue.code ?? (_issue.code = \"custom\");\n _issue.input ?? (_issue.input = payload.value);\n _issue.inst ?? (_issue.inst = ch);\n _issue.continue ?? (_issue.continue = !ch._zod.def.abort); // abort is always undefined, so this is always true...\n payload.issues.push(util.issue(_issue));\n }\n };\n return fn(payload.value, payload);\n });\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _check(fn, params) {\n const ch = new checks.$ZodCheck({\n check: \"custom\",\n ...util.normalizeParams(params),\n });\n ch._zod.check = fn;\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function describe(description) {\n const ch = new checks.$ZodCheck({ check: \"describe\" });\n ch._zod.onattach = [\n (inst) => {\n const existing = registries.globalRegistry.get(inst) ?? {};\n registries.globalRegistry.add(inst, { ...existing, description });\n },\n ];\n ch._zod.check = () => { }; // no-op check\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function meta(metadata) {\n const ch = new checks.$ZodCheck({ check: \"meta\" });\n ch._zod.onattach = [\n (inst) => {\n const existing = registries.globalRegistry.get(inst) ?? {};\n registries.globalRegistry.add(inst, { ...existing, ...metadata });\n },\n ];\n ch._zod.check = () => { }; // no-op check\n return ch;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _stringbool(Classes, _params) {\n const params = util.normalizeParams(_params);\n let truthyArray = params.truthy ?? [\"true\", \"1\", \"yes\", \"on\", \"y\", \"enabled\"];\n let falsyArray = params.falsy ?? [\"false\", \"0\", \"no\", \"off\", \"n\", \"disabled\"];\n if (params.case !== \"sensitive\") {\n truthyArray = truthyArray.map((v) => (typeof v === \"string\" ? v.toLowerCase() : v));\n falsyArray = falsyArray.map((v) => (typeof v === \"string\" ? v.toLowerCase() : v));\n }\n const truthySet = new Set(truthyArray);\n const falsySet = new Set(falsyArray);\n const _Codec = Classes.Codec ?? schemas.$ZodCodec;\n const _Boolean = Classes.Boolean ?? schemas.$ZodBoolean;\n const _String = Classes.String ?? schemas.$ZodString;\n const stringSchema = new _String({ type: \"string\", error: params.error });\n const booleanSchema = new _Boolean({ type: \"boolean\", error: params.error });\n const codec = new _Codec({\n type: \"pipe\",\n in: stringSchema,\n out: booleanSchema,\n transform: ((input, payload) => {\n let data = input;\n if (params.case !== \"sensitive\")\n data = data.toLowerCase();\n if (truthySet.has(data)) {\n return true;\n }\n else if (falsySet.has(data)) {\n return false;\n }\n else {\n payload.issues.push({\n code: \"invalid_value\",\n expected: \"stringbool\",\n values: [...truthySet, ...falsySet],\n input: payload.value,\n inst: codec,\n continue: false,\n });\n return {};\n }\n }),\n reverseTransform: ((input, _payload) => {\n if (input === true) {\n return truthyArray[0] \|\| \"true\";\n }\n else {\n return falsyArray[0] \|\| \"false\";\n }\n }),\n error: params.error,\n });\n return codec;\n}\n// @__NO_SIDE_EFFECTS__\nexport function _stringFormat(Class, format, fnOrRegex, _params = {}) {\n const params = util.normalizeParams(_params);\n const def = {\n ...util.normalizeParams(_params),\n check: \"string_format\",\n type: \"string\",\n format,\n fn: typeof fnOrRegex === \"function\" ? fnOrRegex : (val) => fnOrRegex.test(val),\n ...params,\n };\n if (fnOrRegex instanceof RegExp) {\n def.pattern = fnOrRegex;\n }\n const inst = new Class(def);\n return inst;\n}\n","import { globalRegistry } from \"./registries.js\";\n// function initializeContext<T extends schemas.$ZodType>(inputs: JSONSchemaGeneratorParams<T>): ToJSONSchemaContext<T> {\n// return {\n// processor: inputs.processor,\n// metadataRegistry: inputs.metadata ?? globalRegistry,\n// target: inputs.target ?? \"draft-2020-12\",\n// unrepresentable: inputs.unrepresentable ?? \"throw\",\n// };\n// }\nexport function initializeContext(params) {\n // Normalize target: convert old non-hyphenated versions to hyphenated versions\n let target = params?.target ?? \"draft-2020-12\";\n if (target === \"draft-4\")\n target = \"draft-04\";\n if (target === \"draft-7\")\n target = \"draft-07\";\n return {\n processors: params.processors ?? {},\n metadataRegistry: params?.metadata ?? globalRegistry,\n target,\n unrepresentable: params?.unrepresentable ?? \"throw\",\n override: params?.override ?? (() => { }),\n io: params?.io ?? \"output\",\n counter: 0,\n seen: new Map(),\n cycles: params?.cycles ?? \"ref\",\n reused: params?.reused ?? \"inline\",\n external: params?.external ?? undefined,\n };\n}\nexport function process(schema, ctx, _params = { path: [], schemaPath: [] }) {\n var _a;\n const def = schema._zod.def;\n // check for schema in seens\n const seen = ctx.seen.get(schema);\n if (seen) {\n seen.count++;\n // check if cycle\n const isCycle = _params.schemaPath.includes(schema);\n if (isCycle) {\n seen.cycle = _params.path;\n }\n return seen.schema;\n }\n // initialize\n const result = { schema: {}, count: 1, cycle: undefined, path: _params.path };\n ctx.seen.set(schema, result);\n // custom method overrides default behavior\n const overrideSchema = schema._zod.toJSONSchema?.();\n if (overrideSchema) {\n result.schema = overrideSchema;\n }\n else {\n const params = {\n ..._params,\n schemaPath: [..._params.schemaPath, schema],\n path: _params.path,\n };\n if (schema._zod.processJSONSchema) {\n schema._zod.processJSONSchema(ctx, result.schema, params);\n }\n else {\n const _json = result.schema;\n const processor = ctx.processors[def.type];\n if (!processor) {\n throw new Error(`[toJSONSchema]: Non-representable type encountered: ${def.type}`);\n }\n processor(schema, ctx, _json, params);\n }\n const parent = schema._zod.parent;\n if (parent) {\n // Also set ref if processor didn't (for inheritance)\n if (!result.ref)\n result.ref = parent;\n process(parent, ctx, params);\n ctx.seen.get(parent).isParent = true;\n }\n }\n // metadata\n const meta = ctx.metadataRegistry.get(schema);\n if (meta)\n Object.assign(result.schema, meta);\n if (ctx.io === \"input\" && isTransforming(schema)) {\n // examples/defaults only apply to output type of pipe\n delete result.schema.examples;\n delete result.schema.default;\n }\n // set prefault as default\n if (ctx.io === \"input\" && result.schema._prefault)\n (_a = result.schema).default ?? (_a.default = result.schema._prefault);\n delete result.schema._prefault;\n // pulling fresh from ctx.seen in case it was overwritten\n const _result = ctx.seen.get(schema);\n return _result.schema;\n}\nexport function extractDefs(ctx, schema\n// params: EmitParams\n) {\n // iterate over seen map;\n const root = ctx.seen.get(schema);\n if (!root)\n throw new Error(\"Unprocessed schema. This is a bug in Zod.\");\n // Track ids to detect duplicates across different schemas\n const idToSchema = new Map();\n for (const entry of ctx.seen.entries()) {\n const id = ctx.metadataRegistry.get(entry[0])?.id;\n if (id) {\n const existing = idToSchema.get(id);\n if (existing && existing !== entry[0]) {\n throw new Error(`Duplicate schema id \"${id}\" detected during JSON Schema conversion. Two different schemas cannot share the same id when converted together.`);\n }\n idToSchema.set(id, entry[0]);\n }\n }\n // returns a ref to the schema\n // defId will be empty if the ref points to an external schema (or #)\n const makeURI = (entry) => {\n // comparing the seen objects because sometimes\n // multiple schemas map to the same seen object.\n // e.g. lazy\n // external is configured\n const defsSegment = ctx.target === \"draft-2020-12\" ? \"$defs\" : \"definitions\";\n if (ctx.external) {\n const externalId = ctx.external.registry.get(entry[0])?.id; // ?? \"__shared\";// `__schema${ctx.counter++}`;\n // check if schema is in the external registry\n const uriGenerator = ctx.external.uri ?? ((id) => id);\n if (externalId) {\n return { ref: uriGenerator(externalId) };\n }\n // otherwise, add to __shared\n const id = entry[1].defId ?? entry[1].schema.id ?? `schema${ctx.counter++}`;\n entry[1].defId = id; // set defId so it will be reused if needed\n return { defId: id, ref: `${uriGenerator(\"__shared\")}#/${defsSegment}/${id}` };\n }\n if (entry[1] === root) {\n return { ref: \"#\" };\n }\n // self-contained schema\n const uriPrefix = `#`;\n const defUriPrefix = `${uriPrefix}/${defsSegment}/`;\n const defId = entry[1].schema.id ?? `__schema${ctx.counter++}`;\n return { defId, ref: defUriPrefix + defId };\n };\n // stored cached version in `def` property\n // remove all properties, set $ref\n const extractToDef = (entry) => {\n // if the schema is already a reference, do not extract it\n if (entry[1].schema.$ref) {\n return;\n }\n const seen = entry[1];\n const { ref, defId } = makeURI(entry);\n seen.def = { ...seen.schema };\n // defId won't be set if the schema is a reference to an external schema\n // or if the schema is the root schema\n if (defId)\n seen.defId = defId;\n // wipe away all properties except $ref\n const schema = seen.schema;\n for (const key in schema) {\n delete schema[key];\n }\n schema.$ref = ref;\n };\n // throw on cycles\n // break cycles\n if (ctx.cycles === \"throw\") {\n for (const entry of ctx.seen.entries()) {\n const seen = entry[1];\n if (seen.cycle) {\n throw new Error(\"Cycle detected: \" +\n `#/${seen.cycle?.join(\"/\")}/<root>` +\n '\\n\\nSet the `cycles` parameter to `\"ref\"` to resolve cyclical schemas with defs.');\n }\n }\n }\n // extract schemas into $defs\n for (const entry of ctx.seen.entries()) {\n const seen = entry[1];\n // convert root schema to # $ref\n if (schema === entry[0]) {\n extractToDef(entry); // this has special handling for the root schema\n continue;\n }\n // extract schemas that are in the external registry\n if (ctx.external) {\n const ext = ctx.external.registry.get(entry[0])?.id;\n if (schema !== entry[0] && ext) {\n extractToDef(entry);\n continue;\n }\n }\n // extract schemas with `id` meta\n const id = ctx.metadataRegistry.get(entry[0])?.id;\n if (id) {\n extractToDef(entry);\n continue;\n }\n // break cycles\n if (seen.cycle) {\n // any\n extractToDef(entry);\n continue;\n }\n // extract reused schemas\n if (seen.count > 1) {\n if (ctx.reused === \"ref\") {\n extractToDef(entry);\n // biome-ignore lint:\n continue;\n }\n }\n }\n}\nexport function finalize(ctx, schema) {\n const root = ctx.seen.get(schema);\n if (!root)\n throw new Error(\"Unprocessed schema. This is a bug in Zod.\");\n // flatten refs - inherit properties from parent schemas\n const flattenRef = (zodSchema) => {\n const seen = ctx.seen.get(zodSchema);\n // already processed\n if (seen.ref === null)\n return;\n const schema = seen.def ?? seen.schema;\n const _cached = { ...schema };\n const ref = seen.ref;\n seen.ref = null; // prevent infinite recursion\n if (ref) {\n flattenRef(ref);\n const refSeen = ctx.seen.get(ref);\n const refSchema = refSeen.schema;\n // merge referenced schema into current\n if (refSchema.$ref && (ctx.target === \"draft-07\" \|\| ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\")) {\n // older drafts can't combine $ref with other properties\n schema.allOf = schema.allOf ?? [];\n schema.allOf.push(refSchema);\n }\n else {\n Object.assign(schema, refSchema);\n }\n // restore child's own properties (child wins)\n Object.assign(schema, _cached);\n const isParentRef = zodSchema._zod.parent === ref;\n // For parent chain, child is a refinement - remove parent-only properties\n if (isParentRef) {\n for (const key in schema) {\n if (key === \"$ref\" \|\| key === \"allOf\")\n continue;\n if (!(key in _cached)) {\n delete schema[key];\n }\n }\n }\n // When ref was extracted to $defs, remove properties that match the definition\n if (refSchema.$ref && refSeen.def) {\n for (const key in schema) {\n if (key === \"$ref\" \|\| key === \"allOf\")\n continue;\n if (key in refSeen.def && JSON.stringify(schema[key]) === JSON.stringify(refSeen.def[key])) {\n delete schema[key];\n }\n }\n }\n }\n // If parent was extracted (has $ref), propagate $ref to this schema\n // This handles cases like: readonly().meta({id}).describe()\n // where processor sets ref to innerType but parent should be referenced\n const parent = zodSchema._zod.parent;\n if (parent && parent !== ref) {\n // Ensure parent is processed first so its def has inherited properties\n flattenRef(parent);\n const parentSeen = ctx.seen.get(parent);\n if (parentSeen?.schema.$ref) {\n schema.$ref = parentSeen.schema.$ref;\n // De-duplicate with parent's definition\n if (parentSeen.def) {\n for (const key in schema) {\n if (key === \"$ref\" \|\| key === \"allOf\")\n continue;\n if (key in parentSeen.def && JSON.stringify(schema[key]) === JSON.stringify(parentSeen.def[key])) {\n delete schema[key];\n }\n }\n }\n }\n }\n // execute overrides\n ctx.override({\n zodSchema: zodSchema,\n jsonSchema: schema,\n path: seen.path ?? [],\n });\n };\n for (const entry of [...ctx.seen.entries()].reverse()) {\n flattenRef(entry[0]);\n }\n const result = {};\n if (ctx.target === \"draft-2020-12\") {\n result.$schema = \"https://json-schema.org/draft/2020-12/schema\";\n }\n else if (ctx.target === \"draft-07\") {\n result.$schema = \"http://json-schema.org/draft-07/schema#\";\n }\n else if (ctx.target === \"draft-04\") {\n result.$schema = \"http://json-schema.org/draft-04/schema#\";\n }\n else if (ctx.target === \"openapi-3.0\") {\n // OpenAPI 3.0 schema objects should not include a $schema property\n }\n else {\n // Arbitrary string values are allowed but won't have a $schema property set\n }\n if (ctx.external?.uri) {\n const id = ctx.external.registry.get(schema)?.id;\n if (!id)\n throw new Error(\"Schema is missing an `id` property\");\n result.$id = ctx.external.uri(id);\n }\n Object.assign(result, root.def ?? root.schema);\n // build defs object\n const defs = ctx.external?.defs ?? {};\n for (const entry of ctx.seen.entries()) {\n const seen = entry[1];\n if (seen.def && seen.defId) {\n defs[seen.defId] = seen.def;\n }\n }\n // set definitions in result\n if (ctx.external) {\n }\n else {\n if (Object.keys(defs).length > 0) {\n if (ctx.target === \"draft-2020-12\") {\n result.$defs = defs;\n }\n else {\n result.definitions = defs;\n }\n }\n }\n try {\n // this \"finalizes\" this schema and ensures all cycles are removed\n // each call to finalize() is functionally independent\n // though the seen map is shared\n const finalized = JSON.parse(JSON.stringify(result));\n Object.defineProperty(finalized, \"~standard\", {\n value: {\n ...schema[\"~standard\"],\n jsonSchema: {\n input: createStandardJSONSchemaMethod(schema, \"input\", ctx.processors),\n output: createStandardJSONSchemaMethod(schema, \"output\", ctx.processors),\n },\n },\n enumerable: false,\n writable: false,\n });\n return finalized;\n }\n catch (_err) {\n throw new Error(\"Error converting schema to JSON.\");\n }\n}\nfunction isTransforming(_schema, _ctx) {\n const ctx = _ctx ?? { seen: new Set() };\n if (ctx.seen.has(_schema))\n return false;\n ctx.seen.add(_schema);\n const def = _schema._zod.def;\n if (def.type === \"transform\")\n return true;\n if (def.type === \"array\")\n return isTransforming(def.element, ctx);\n if (def.type === \"set\")\n return isTransforming(def.valueType, ctx);\n if (def.type === \"lazy\")\n return isTransforming(def.getter(), ctx);\n if (def.type === \"promise\" \|\|\n def.type === \"optional\" \|\|\n def.type === \"nonoptional\" \|\|\n def.type === \"nullable\" \|\|\n def.type === \"readonly\" \|\|\n def.type === \"default\" \|\|\n def.type === \"prefault\") {\n return isTransforming(def.innerType, ctx);\n }\n if (def.type === \"intersection\") {\n return isTransforming(def.left, ctx) \|\| isTransforming(def.right, ctx);\n }\n if (def.type === \"record\" \|\| def.type === \"map\") {\n return isTransforming(def.keyType, ctx) \|\| isTransforming(def.valueType, ctx);\n }\n if (def.type === \"pipe\") {\n return isTransforming(def.in, ctx) \|\| isTransforming(def.out, ctx);\n }\n if (def.type === \"object\") {\n for (const key in def.shape) {\n if (isTransforming(def.shape[key], ctx))\n return true;\n }\n return false;\n }\n if (def.type === \"union\") {\n for (const option of def.options) {\n if (isTransforming(option, ctx))\n return true;\n }\n return false;\n }\n if (def.type === \"tuple\") {\n for (const item of def.items) {\n if (isTransforming(item, ctx))\n return true;\n }\n if (def.rest && isTransforming(def.rest, ctx))\n return true;\n return false;\n }\n return false;\n}\n/\n Creates a toJSONSchema method for a schema instance.\n * This encapsulates the logic of initializing context, processing, extracting defs, and finalizing.\n /\nexport const createToJSONSchemaMethod = (schema, processors = {}) => (params) => {\n const ctx = initializeContext({ ...params, processors });\n process(schema, ctx);\n extractDefs(ctx, schema);\n return finalize(ctx, schema);\n};\nexport const createStandardJSONSchemaMethod = (schema, io, processors = {}) => (params) => {\n const { libraryOptions, target } = params ?? {};\n const ctx = initializeContext({ ...(libraryOptions ?? {}), target, io, processors });\n process(schema, ctx);\n extractDefs(ctx, schema);\n return finalize(ctx, schema);\n};\n","import { extractDefs, finalize, initializeContext, process, } from \"./to-json-schema.js\";\nimport { getEnumValues } from \"./util.js\";\nconst formatMap = {\n guid: \"uuid\",\n url: \"uri\",\n datetime: \"date-time\",\n json_string: \"json-string\",\n regex: \"\", // do not set\n};\n// ==================== SIMPLE TYPE PROCESSORS ====================\nexport const stringProcessor = (schema, ctx, _json, _params) => {\n const json = _json;\n json.type = \"string\";\n const { minimum, maximum, format, patterns, contentEncoding } = schema._zod\n .bag;\n if (typeof minimum === \"number\")\n json.minLength = minimum;\n if (typeof maximum === \"number\")\n json.maxLength = maximum;\n // custom pattern overrides format\n if (format) {\n json.format = formatMap[format] ?? format;\n if (json.format === \"\")\n delete json.format; // empty format is not valid\n // JSON Schema format: \"time\" requires a full time with offset or Z\n // z.iso.time() does not include timezone information, so format: \"time\" should never be used\n if (format === \"time\") {\n delete json.format;\n }\n }\n if (contentEncoding)\n json.contentEncoding = contentEncoding;\n if (patterns && patterns.size > 0) {\n const regexes = [...patterns];\n if (regexes.length === 1)\n json.pattern = regexes[0].source;\n else if (regexes.length > 1) {\n json.allOf = [\n ...regexes.map((regex) => ({\n ...(ctx.target === \"draft-07\" \|\| ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\"\n ? { type: \"string\" }\n : {}),\n pattern: regex.source,\n })),\n ];\n }\n }\n};\nexport const numberProcessor = (schema, ctx, _json, _params) => {\n const json = _json;\n const { minimum, maximum, format, multipleOf, exclusiveMaximum, exclusiveMinimum } = schema._zod.bag;\n if (typeof format === \"string\" && format.includes(\"int\"))\n json.type = \"integer\";\n else\n json.type = \"number\";\n if (typeof exclusiveMinimum === \"number\") {\n if (ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\") {\n json.minimum = exclusiveMinimum;\n json.exclusiveMinimum = true;\n }\n else {\n json.exclusiveMinimum = exclusiveMinimum;\n }\n }\n if (typeof minimum === \"number\") {\n json.minimum = minimum;\n if (typeof exclusiveMinimum === \"number\" && ctx.target !== \"draft-04\") {\n if (exclusiveMinimum >= minimum)\n delete json.minimum;\n else\n delete json.exclusiveMinimum;\n }\n }\n if (typeof exclusiveMaximum === \"number\") {\n if (ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\") {\n json.maximum = exclusiveMaximum;\n json.exclusiveMaximum = true;\n }\n else {\n json.exclusiveMaximum = exclusiveMaximum;\n }\n }\n if (typeof maximum === \"number\") {\n json.maximum = maximum;\n if (typeof exclusiveMaximum === \"number\" && ctx.target !== \"draft-04\") {\n if (exclusiveMaximum <= maximum)\n delete json.maximum;\n else\n delete json.exclusiveMaximum;\n }\n }\n if (typeof multipleOf === \"number\")\n json.multipleOf = multipleOf;\n};\nexport const booleanProcessor = (_schema, _ctx, json, _params) => {\n json.type = \"boolean\";\n};\nexport const bigintProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"BigInt cannot be represented in JSON Schema\");\n }\n};\nexport const symbolProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Symbols cannot be represented in JSON Schema\");\n }\n};\nexport const nullProcessor = (_schema, ctx, json, _params) => {\n if (ctx.target === \"openapi-3.0\") {\n json.type = \"string\";\n json.nullable = true;\n json.enum = [null];\n }\n else {\n json.type = \"null\";\n }\n};\nexport const undefinedProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Undefined cannot be represented in JSON Schema\");\n }\n};\nexport const voidProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Void cannot be represented in JSON Schema\");\n }\n};\nexport const neverProcessor = (_schema, _ctx, json, _params) => {\n json.not = {};\n};\nexport const anyProcessor = (_schema, _ctx, _json, _params) => {\n // empty schema accepts anything\n};\nexport const unknownProcessor = (_schema, _ctx, _json, _params) => {\n // empty schema accepts anything\n};\nexport const dateProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Date cannot be represented in JSON Schema\");\n }\n};\nexport const enumProcessor = (schema, _ctx, json, _params) => {\n const def = schema._zod.def;\n const values = getEnumValues(def.entries);\n // Number enums can have both string and number values\n if (values.every((v) => typeof v === \"number\"))\n json.type = \"number\";\n if (values.every((v) => typeof v === \"string\"))\n json.type = \"string\";\n json.enum = values;\n};\nexport const literalProcessor = (schema, ctx, json, _params) => {\n const def = schema._zod.def;\n const vals = [];\n for (const val of def.values) {\n if (val === undefined) {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Literal `undefined` cannot be represented in JSON Schema\");\n }\n else {\n // do not add to vals\n }\n }\n else if (typeof val === \"bigint\") {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"BigInt literals cannot be represented in JSON Schema\");\n }\n else {\n vals.push(Number(val));\n }\n }\n else {\n vals.push(val);\n }\n }\n if (vals.length === 0) {\n // do nothing (an undefined literal was stripped)\n }\n else if (vals.length === 1) {\n const val = vals[0];\n json.type = val === null ? \"null\" : typeof val;\n if (ctx.target === \"draft-04\" \|\| ctx.target === \"openapi-3.0\") {\n json.enum = [val];\n }\n else {\n json.const = val;\n }\n }\n else {\n if (vals.every((v) => typeof v === \"number\"))\n json.type = \"number\";\n if (vals.every((v) => typeof v === \"string\"))\n json.type = \"string\";\n if (vals.every((v) => typeof v === \"boolean\"))\n json.type = \"boolean\";\n if (vals.every((v) => v === null))\n json.type = \"null\";\n json.enum = vals;\n }\n};\nexport const nanProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"NaN cannot be represented in JSON Schema\");\n }\n};\nexport const templateLiteralProcessor = (schema, _ctx, json, _params) => {\n const _json = json;\n const pattern = schema._zod.pattern;\n if (!pattern)\n throw new Error(\"Pattern not found in template literal\");\n _json.type = \"string\";\n _json.pattern = pattern.source;\n};\nexport const fileProcessor = (schema, _ctx, json, _params) => {\n const _json = json;\n const file = {\n type: \"string\",\n format: \"binary\",\n contentEncoding: \"binary\",\n };\n const { minimum, maximum, mime } = schema._zod.bag;\n if (minimum !== undefined)\n file.minLength = minimum;\n if (maximum !== undefined)\n file.maxLength = maximum;\n if (mime) {\n if (mime.length === 1) {\n file.contentMediaType = mime[0];\n Object.assign(_json, file);\n }\n else {\n Object.assign(_json, file); // shared props at root\n _json.anyOf = mime.map((m) => ({ contentMediaType: m })); // only contentMediaType differs\n }\n }\n else {\n Object.assign(_json, file);\n }\n};\nexport const successProcessor = (_schema, _ctx, json, _params) => {\n json.type = \"boolean\";\n};\nexport const customProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Custom types cannot be represented in JSON Schema\");\n }\n};\nexport const functionProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Function types cannot be represented in JSON Schema\");\n }\n};\nexport const transformProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Transforms cannot be represented in JSON Schema\");\n }\n};\nexport const mapProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Map cannot be represented in JSON Schema\");\n }\n};\nexport const setProcessor = (_schema, ctx, _json, _params) => {\n if (ctx.unrepresentable === \"throw\") {\n throw new Error(\"Set cannot be represented in JSON Schema\");\n }\n};\n// ==================== COMPOSITE TYPE PROCESSORS ====================\nexport const arrayProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n const { minimum, maximum } = schema._zod.bag;\n if (typeof minimum === \"number\")\n json.minItems = minimum;\n if (typeof maximum === \"number\")\n json.maxItems = maximum;\n json.type = \"array\";\n json.items = process(def.element, ctx, { ...params, path: [...params.path, \"items\"] });\n};\nexport const objectProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n json.type = \"object\";\n json.properties = {};\n const shape = def.shape;\n for (const key in shape) {\n json.properties[key] = process(shape[key], ctx, {\n ...params,\n path: [...params.path, \"properties\", key],\n });\n }\n // required keys\n const allKeys = new Set(Object.keys(shape));\n const requiredKeys = new Set([...allKeys].filter((key) => {\n const v = def.shape[key]._zod;\n if (ctx.io === \"input\") {\n return v.optin === undefined;\n }\n else {\n return v.optout === undefined;\n }\n }));\n if (requiredKeys.size > 0) {\n json.required = Array.from(requiredKeys);\n }\n // catchall\n if (def.catchall?._zod.def.type === \"never\") {\n // strict\n json.additionalProperties = false;\n }\n else if (!def.catchall) {\n // regular\n if (ctx.io === \"output\")\n json.additionalProperties = false;\n }\n else if (def.catchall) {\n json.additionalProperties = process(def.catchall, ctx, {\n ...params,\n path: [...params.path, \"additionalProperties\"],\n });\n }\n};\nexport const unionProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n // Exclusive unions (inclusive === false) use oneOf (exactly one match) instead of anyOf (one or more matches)\n // This includes both z.xor() and discriminated unions\n const isExclusive = def.inclusive === false;\n const options = def.options.map((x, i) => process(x, ctx, {\n ...params,\n path: [...params.path, isExclusive ? \"oneOf\" : \"anyOf\", i],\n }));\n if (isExclusive) {\n json.oneOf = options;\n }\n else {\n json.anyOf = options;\n }\n};\nexport const intersectionProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n const a = process(def.left, ctx, {\n ...params,\n path: [...params.path, \"allOf\", 0],\n });\n const b = process(def.right, ctx, {\n ...params,\n path: [...params.path, \"allOf\", 1],\n });\n const isSimpleIntersection = (val) => \"allOf\" in val && Object.keys(val).length === 1;\n const allOf = [\n ...(isSimpleIntersection(a) ? a.allOf : [a]),\n ...(isSimpleIntersection(b) ? b.allOf : [b]),\n ];\n json.allOf = allOf;\n};\nexport const tupleProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n json.type = \"array\";\n const prefixPath = ctx.target === \"draft-2020-12\" ? \"prefixItems\" : \"items\";\n const restPath = ctx.target === \"draft-2020-12\" ? \"items\" : ctx.target === \"openapi-3.0\" ? \"items\" : \"additionalItems\";\n const prefixItems = def.items.map((x, i) => process(x, ctx, {\n ...params,\n path: [...params.path, prefixPath, i],\n }));\n const rest = def.rest\n ? process(def.rest, ctx, {\n ...params,\n path: [...params.path, restPath, ...(ctx.target === \"openapi-3.0\" ? [def.items.length] : [])],\n })\n : null;\n if (ctx.target === \"draft-2020-12\") {\n json.prefixItems = prefixItems;\n if (rest) {\n json.items = rest;\n }\n }\n else if (ctx.target === \"openapi-3.0\") {\n json.items = {\n anyOf: prefixItems,\n };\n if (rest) {\n json.items.anyOf.push(rest);\n }\n json.minItems = prefixItems.length;\n if (!rest) {\n json.maxItems = prefixItems.length;\n }\n }\n else {\n json.items = prefixItems;\n if (rest) {\n json.additionalItems = rest;\n }\n }\n // length\n const { minimum, maximum } = schema._zod.bag;\n if (typeof minimum === \"number\")\n json.minItems = minimum;\n if (typeof maximum === \"number\")\n json.maxItems = maximum;\n};\nexport const recordProcessor = (schema, ctx, _json, params) => {\n const json = _json;\n const def = schema._zod.def;\n json.type = \"object\";\n // For looseRecord with regex patterns, use patternProperties\n // This correctly represents \"only validate keys matching the pattern\" semantics\n // and composes well with allOf (intersections)\n const keyType = def.keyType;\n const keyBag = keyType._zod.bag;\n const patterns = keyBag?.patterns;\n if (def.mode === \"loose\" && patterns && patterns.size > 0) {\n // Use patternProperties for looseRecord with regex patterns\n const valueSchema = process(def.valueType, ctx, {\n ...params,\n path: [...params.path, \"patternProperties\", \"\"],\n });\n json.patternProperties = {};\n for (const pattern of patterns) {\n json.patternProperties[pattern.source] = valueSchema;\n }\n }\n else {\n // Default behavior: use propertyNames + additionalProperties\n if (ctx.target === \"draft-07\" \|\| ctx.target === \"draft-2020-12\") {\n json.propertyNames = process(def.keyType, ctx, {\n ...params,\n path: [...params.path, \"propertyNames\"],\n });\n }\n json.additionalProperties = process(def.valueType, ctx, {\n ...params,\n path: [...params.path, \"additionalProperties\"],\n });\n }\n // Add required for keys with discrete values (enum, literal, etc.)\n const keyValues = keyType._zod.values;\n if (keyValues) {\n const validKeyValues = [...keyValues].filter((v) => typeof v === \"string\" \|\| typeof v === \"number\");\n if (validKeyValues.length > 0) {\n json.required = validKeyValues;\n }\n }\n};\nexport const nullableProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n const inner = process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n if (ctx.target === \"openapi-3.0\") {\n seen.ref = def.innerType;\n json.nullable = true;\n }\n else {\n json.anyOf = [inner, { type: \"null\" }];\n }\n};\nexport const nonoptionalProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n};\nexport const defaultProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n json.default = JSON.parse(JSON.stringify(def.defaultValue));\n};\nexport const prefaultProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n if (ctx.io === \"input\")\n json._prefault = JSON.parse(JSON.stringify(def.defaultValue));\n};\nexport const catchProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n let catchValue;\n try {\n catchValue = def.catchValue(undefined);\n }\n catch {\n throw new Error(\"Dynamic catch values are not supported in JSON Schema\");\n }\n json.default = catchValue;\n};\nexport const pipeProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n const innerType = ctx.io === \"input\" ? (def.in._zod.def.type === \"transform\" ? def.out : def.in) : def.out;\n process(innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = innerType;\n};\nexport const readonlyProcessor = (schema, ctx, json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n json.readOnly = true;\n};\nexport const promiseProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n};\nexport const optionalProcessor = (schema, ctx, _json, params) => {\n const def = schema._zod.def;\n process(def.innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = def.innerType;\n};\nexport const lazyProcessor = (schema, ctx, _json, params) => {\n const innerType = schema._zod.innerType;\n process(innerType, ctx, params);\n const seen = ctx.seen.get(schema);\n seen.ref = innerType;\n};\n// ==================== ALL PROCESSORS ====================\nexport const allProcessors = {\n string: stringProcessor,\n number: numberProcessor,\n boolean: booleanProcessor,\n bigint: bigintProcessor,\n symbol: symbolProcessor,\n null: nullProcessor,\n undefined: undefinedProcessor,\n void: voidProcessor,\n never: neverProcessor,\n any: anyProcessor,\n unknown: unknownProcessor,\n date: dateProcessor,\n enum: enumProcessor,\n literal: literalProcessor,\n nan: nanProcessor,\n template_literal: templateLiteralProcessor,\n file: fileProcessor,\n success: successProcessor,\n custom: customProcessor,\n function: functionProcessor,\n transform: transformProcessor,\n map: mapProcessor,\n set: setProcessor,\n array: arrayProcessor,\n object: objectProcessor,\n union: unionProcessor,\n intersection: intersectionProcessor,\n tuple: tupleProcessor,\n record: recordProcessor,\n nullable: nullableProcessor,\n nonoptional: nonoptionalProcessor,\n default: defaultProcessor,\n prefault: prefaultProcessor,\n catch: catchProcessor,\n pipe: pipeProcessor,\n readonly: readonlyProcessor,\n promise: promiseProcessor,\n optional: optionalProcessor,\n lazy: lazyProcessor,\n};\nexport function toJSONSchema(input, params) {\n if (\"_idmap\" in input) {\n // Registry case\n const registry = input;\n const ctx = initializeContext({ ...params, processors: allProcessors });\n const defs = {};\n // First pass: process all schemas to build the seen map\n for (const entry of registry._idmap.entries()) {\n const [_, schema] = entry;\n process(schema, ctx);\n }\n const schemas = {};\n const external = {\n registry,\n uri: params?.uri,\n defs,\n };\n // Update the context with external configuration\n ctx.external = external;\n // Second pass: emit each schema\n for (const entry of registry._idmap.entries()) {\n const [key, schema] = entry;\n extractDefs(ctx, schema);\n schemas[key] = finalize(ctx, schema);\n }\n if (Object.keys(defs).length > 0) {\n const defsSegment = ctx.target === \"draft-2020-12\" ? \"$defs\" : \"definitions\";\n schemas.__shared = {\n [defsSegment]: defs,\n };\n }\n return { schemas };\n }\n // Single schema case\n const ctx = initializeContext({ ...params, processors: allProcessors });\n process(input, ctx);\n extractDefs(ctx, input);\n return finalize(ctx, input);\n}\n","import * as core from \"../core/index.js\";\nimport * as schemas from \"./schemas.js\";\nexport const ZodISODateTime = /@__PURE__/ core.$constructor(\"ZodISODateTime\", (inst, def) => {\n core.$ZodISODateTime.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function datetime(params) {\n return core._isoDateTime(ZodISODateTime, params);\n}\nexport const ZodISODate = /@__PURE__/ core.$constructor(\"ZodISODate\", (inst, def) => {\n core.$ZodISODate.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function date(params) {\n return core._isoDate(ZodISODate, params);\n}\nexport const ZodISOTime = /@__PURE__/ core.$constructor(\"ZodISOTime\", (inst, def) => {\n core.$ZodISOTime.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function time(params) {\n return core._isoTime(ZodISOTime, params);\n}\nexport const ZodISODuration = /@__PURE__/ core.$constructor(\"ZodISODuration\", (inst, def) => {\n core.$ZodISODuration.init(inst, def);\n schemas.ZodStringFormat.init(inst, def);\n});\nexport function duration(params) {\n return core._isoDuration(ZodISODuration, params);\n}\n","import * as core from \"../core/index.js\";\nimport { $ZodError } from \"../core/index.js\";\nimport * as util from \"../core/util.js\";\nconst initializer = (inst, issues) => {\n $ZodError.init(inst, issues);\n inst.name = \"ZodError\";\n Object.defineProperties(inst, {\n format: {\n value: (mapper) => core.formatError(inst, mapper),\n // enumerable: false,\n },\n flatten: {\n value: (mapper) => core.flattenError(inst, mapper),\n // enumerable: false,\n },\n addIssue: {\n value: (issue) => {\n inst.issues.push(issue);\n inst.message = JSON.stringify(inst.issues, util.jsonStringifyReplacer, 2);\n },\n // enumerable: false,\n },\n addIssues: {\n value: (issues) => {\n inst.issues.push(...issues);\n inst.message = JSON.stringify(inst.issues, util.jsonStringifyReplacer, 2);\n },\n // enumerable: false,\n },\n isEmpty: {\n get() {\n return inst.issues.length === 0;\n },\n // enumerable: false,\n },\n });\n // Object.defineProperty(inst, \"isEmpty\", {\n // get() {\n // return inst.issues.length === 0;\n // },\n // });\n};\nexport const ZodError = core.$constructor(\"ZodError\", initializer);\nexport const ZodRealError = core.$constructor(\"ZodError\", initializer, {\n Parent: Error,\n});\n// /** @deprecated Use `z.core.$ZodErrorMapCtx` instead. /\n// export type ErrorMapCtx = core.$ZodErrorMapCtx;\n","import as core from \"../core/index.js\";\nimport { ZodRealError } from \"./errors.js\";\nexport const parse = /* @__PURE__ / core._parse(ZodRealError);\nexport const parseAsync = / @__PURE__ / core._parseAsync(ZodRealError);\nexport const safeParse = / @__PURE__ / core._safeParse(ZodRealError);\nexport const safeParseAsync = / @__PURE__ / core._safeParseAsync(ZodRealError);\n// Codec functions\nexport const encode = / @__PURE__ / core._encode(ZodRealError);\nexport const decode = / @__PURE__ / core._decode(ZodRealError);\nexport const encodeAsync = / @__PURE__ / core._encodeAsync(ZodRealError);\nexport const decodeAsync = / @__PURE__ / core._decodeAsync(ZodRealError);\nexport const safeEncode = / @__PURE__ / core._safeEncode(ZodRealError);\nexport const safeDecode = / @__PURE__ / core._safeDecode(ZodRealError);\nexport const safeEncodeAsync = / @__PURE__ / core._safeEncodeAsync(ZodRealError);\nexport const safeDecodeAsync = / @__PURE__ / core._safeDecodeAsync(ZodRealError);\n","import as core from \"../core/index.js\";\nimport { util } from \"../core/index.js\";\nimport * as processors from \"../core/json-schema-processors.js\";\nimport { createStandardJSONSchemaMethod, createToJSONSchemaMethod } from \"../core/to-json-schema.js\";\nimport * as checks from \"./checks.js\";\nimport * as iso from \"./iso.js\";\nimport * as parse from \"./parse.js\";\nexport const ZodType = /@__PURE__/ core.$constructor(\"ZodType\", (inst, def) => {\n core.$ZodType.init(inst, def);\n Object.assign(inst[\"~standard\"], {\n jsonSchema: {\n input: createStandardJSONSchemaMethod(inst, \"input\"),\n output: createStandardJSONSchemaMethod(inst, \"output\"),\n },\n });\n inst.toJSONSchema = createToJSONSchemaMethod(inst, {});\n inst.def = def;\n inst.type = def.type;\n Object.defineProperty(inst, \"_def\", { value: def });\n // base methods\n inst.check = (...checks) => {\n return inst.clone(util.mergeDefs(def, {\n checks: [\n ...(def.checks ?? []),\n ...checks.map((ch) => typeof ch === \"function\" ? { _zod: { check: ch, def: { check: \"custom\" }, onattach: [] } } : ch),\n ],\n }), {\n parent: true,\n });\n };\n inst.with = inst.check;\n inst.clone = (def, params) => core.clone(inst, def, params);\n inst.brand = () => inst;\n inst.register = ((reg, meta) => {\n reg.add(inst, meta);\n return inst;\n });\n // parsing\n inst.parse = (data, params) => parse.parse(inst, data, params, { callee: inst.parse });\n inst.safeParse = (data, params) => parse.safeParse(inst, data, params);\n inst.parseAsync = async (data, params) => parse.parseAsync(inst, data, params, { callee: inst.parseAsync });\n inst.safeParseAsync = async (data, params) => parse.safeParseAsync(inst, data, params);\n inst.spa = inst.safeParseAsync;\n // encoding/decoding\n inst.encode = (data, params) => parse.encode(inst, data, params);\n inst.decode = (data, params) => parse.decode(inst, data, params);\n inst.encodeAsync = async (data, params) => parse.encodeAsync(inst, data, params);\n inst.decodeAsync = async (data, params) => parse.decodeAsync(inst, data, params);\n inst.safeEncode = (data, params) => parse.safeEncode(inst, data, params);\n inst.safeDecode = (data, params) => parse.safeDecode(inst, data, params);\n inst.safeEncodeAsync = async (data, params) => parse.safeEncodeAsync(inst, data, params);\n inst.safeDecodeAsync = async (data, params) => parse.safeDecodeAsync(inst, data, params);\n // refinements\n inst.refine = (check, params) => inst.check(refine(check, params));\n inst.superRefine = (refinement) => inst.check(superRefine(refinement));\n inst.overwrite = (fn) => inst.check(checks.overwrite(fn));\n // wrappers\n inst.optional = () => optional(inst);\n inst.exactOptional = () => exactOptional(inst);\n inst.nullable = () => nullable(inst);\n inst.nullish = () => optional(nullable(inst));\n inst.nonoptional = (params) => nonoptional(inst, params);\n inst.array = () => array(inst);\n inst.or = (arg) => union([inst, arg]);\n inst.and = (arg) => intersection(inst, arg);\n inst.transform = (tx) => pipe(inst, transform(tx));\n inst.default = (def) => _default(inst, def);\n inst.prefault = (def) => prefault(inst, def);\n // inst.coalesce = (def, params) => coalesce(inst, def, params);\n inst.catch = (params) => _catch(inst, params);\n inst.pipe = (target) => pipe(inst, target);\n inst.readonly = () => readonly(inst);\n // meta\n inst.describe = (description) => {\n const cl = inst.clone();\n core.globalRegistry.add(cl, { description });\n return cl;\n };\n Object.defineProperty(inst, \"description\", {\n get() {\n return core.globalRegistry.get(inst)?.description;\n },\n configurable: true,\n });\n inst.meta = (...args) => {\n if (args.length === 0) {\n return core.globalRegistry.get(inst);\n }\n const cl = inst.clone();\n core.globalRegistry.add(cl, args[0]);\n return cl;\n };\n // helpers\n inst.isOptional = () => inst.safeParse(undefined).success;\n inst.isNullable = () => inst.safeParse(null).success;\n inst.apply = (fn) => fn(inst);\n return inst;\n});\n/** @internal /\nexport const _ZodString = /@__PURE__/ core.$constructor(\"_ZodString\", (inst, def) => {\n core.$ZodString.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.stringProcessor(inst, ctx, json, params);\n const bag = inst._zod.bag;\n inst.format = bag.format ?? null;\n inst.minLength = bag.minimum ?? null;\n inst.maxLength = bag.maximum ?? null;\n // validations\n inst.regex = (...args) => inst.check(checks.regex(...args));\n inst.includes = (...args) => inst.check(checks.includes(...args));\n inst.startsWith = (...args) => inst.check(checks.startsWith(...args));\n inst.endsWith = (...args) => inst.check(checks.endsWith(...args));\n inst.min = (...args) => inst.check(checks.minLength(...args));\n inst.max = (...args) => inst.check(checks.maxLength(...args));\n inst.length = (...args) => inst.check(checks.length(...args));\n inst.nonempty = (...args) => inst.check(checks.minLength(1, ...args));\n inst.lowercase = (params) => inst.check(checks.lowercase(params));\n inst.uppercase = (params) => inst.check(checks.uppercase(params));\n // transforms\n inst.trim = () => inst.check(checks.trim());\n inst.normalize = (...args) => inst.check(checks.normalize(...args));\n inst.toLowerCase = () => inst.check(checks.toLowerCase());\n inst.toUpperCase = () => inst.check(checks.toUpperCase());\n inst.slugify = () => inst.check(checks.slugify());\n});\nexport const ZodString = /@__PURE__/ core.$constructor(\"ZodString\", (inst, def) => {\n core.$ZodString.init(inst, def);\n _ZodString.init(inst, def);\n inst.email = (params) => inst.check(core._email(ZodEmail, params));\n inst.url = (params) => inst.check(core._url(ZodURL, params));\n inst.jwt = (params) => inst.check(core._jwt(ZodJWT, params));\n inst.emoji = (params) => inst.check(core._emoji(ZodEmoji, params));\n inst.guid = (params) => inst.check(core._guid(ZodGUID, params));\n inst.uuid = (params) => inst.check(core._uuid(ZodUUID, params));\n inst.uuidv4 = (params) => inst.check(core._uuidv4(ZodUUID, params));\n inst.uuidv6 = (params) => inst.check(core._uuidv6(ZodUUID, params));\n inst.uuidv7 = (params) => inst.check(core._uuidv7(ZodUUID, params));\n inst.nanoid = (params) => inst.check(core._nanoid(ZodNanoID, params));\n inst.guid = (params) => inst.check(core._guid(ZodGUID, params));\n inst.cuid = (params) => inst.check(core._cuid(ZodCUID, params));\n inst.cuid2 = (params) => inst.check(core._cuid2(ZodCUID2, params));\n inst.ulid = (params) => inst.check(core._ulid(ZodULID, params));\n inst.base64 = (params) => inst.check(core._base64(ZodBase64, params));\n inst.base64url = (params) => inst.check(core._base64url(ZodBase64URL, params));\n inst.xid = (params) => inst.check(core._xid(ZodXID, params));\n inst.ksuid = (params) => inst.check(core._ksuid(ZodKSUID, params));\n inst.ipv4 = (params) => inst.check(core._ipv4(ZodIPv4, params));\n inst.ipv6 = (params) => inst.check(core._ipv6(ZodIPv6, params));\n inst.cidrv4 = (params) => inst.check(core._cidrv4(ZodCIDRv4, params));\n inst.cidrv6 = (params) => inst.check(core._cidrv6(ZodCIDRv6, params));\n inst.e164 = (params) => inst.check(core._e164(ZodE164, params));\n // iso\n inst.datetime = (params) => inst.check(iso.datetime(params));\n inst.date = (params) => inst.check(iso.date(params));\n inst.time = (params) => inst.check(iso.time(params));\n inst.duration = (params) => inst.check(iso.duration(params));\n});\nexport function string(params) {\n return core._string(ZodString, params);\n}\nexport const ZodStringFormat = /@__PURE__/ core.$constructor(\"ZodStringFormat\", (inst, def) => {\n core.$ZodStringFormat.init(inst, def);\n _ZodString.init(inst, def);\n});\nexport const ZodEmail = /@__PURE__/ core.$constructor(\"ZodEmail\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodEmail.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function email(params) {\n return core._email(ZodEmail, params);\n}\nexport const ZodGUID = /@__PURE__/ core.$constructor(\"ZodGUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodGUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function guid(params) {\n return core._guid(ZodGUID, params);\n}\nexport const ZodUUID = /@__PURE__/ core.$constructor(\"ZodUUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodUUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function uuid(params) {\n return core._uuid(ZodUUID, params);\n}\nexport function uuidv4(params) {\n return core._uuidv4(ZodUUID, params);\n}\n// ZodUUIDv6\nexport function uuidv6(params) {\n return core._uuidv6(ZodUUID, params);\n}\n// ZodUUIDv7\nexport function uuidv7(params) {\n return core._uuidv7(ZodUUID, params);\n}\nexport const ZodURL = /@__PURE__/ core.$constructor(\"ZodURL\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodURL.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function url(params) {\n return core._url(ZodURL, params);\n}\nexport function httpUrl(params) {\n return core._url(ZodURL, {\n protocol: /^https?$/,\n hostname: core.regexes.domain,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodEmoji = /@__PURE__/ core.$constructor(\"ZodEmoji\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodEmoji.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function emoji(params) {\n return core._emoji(ZodEmoji, params);\n}\nexport const ZodNanoID = /@__PURE__/ core.$constructor(\"ZodNanoID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodNanoID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function nanoid(params) {\n return core._nanoid(ZodNanoID, params);\n}\nexport const ZodCUID = /@__PURE__/ core.$constructor(\"ZodCUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodCUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cuid(params) {\n return core._cuid(ZodCUID, params);\n}\nexport const ZodCUID2 = /@__PURE__/ core.$constructor(\"ZodCUID2\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodCUID2.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cuid2(params) {\n return core._cuid2(ZodCUID2, params);\n}\nexport const ZodULID = /@__PURE__/ core.$constructor(\"ZodULID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodULID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ulid(params) {\n return core._ulid(ZodULID, params);\n}\nexport const ZodXID = /@__PURE__/ core.$constructor(\"ZodXID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodXID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function xid(params) {\n return core._xid(ZodXID, params);\n}\nexport const ZodKSUID = /@__PURE__/ core.$constructor(\"ZodKSUID\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodKSUID.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ksuid(params) {\n return core._ksuid(ZodKSUID, params);\n}\nexport const ZodIPv4 = /@__PURE__/ core.$constructor(\"ZodIPv4\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodIPv4.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ipv4(params) {\n return core._ipv4(ZodIPv4, params);\n}\nexport const ZodMAC = /@__PURE__/ core.$constructor(\"ZodMAC\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodMAC.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function mac(params) {\n return core._mac(ZodMAC, params);\n}\nexport const ZodIPv6 = /@__PURE__/ core.$constructor(\"ZodIPv6\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodIPv6.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function ipv6(params) {\n return core._ipv6(ZodIPv6, params);\n}\nexport const ZodCIDRv4 = /@__PURE__/ core.$constructor(\"ZodCIDRv4\", (inst, def) => {\n core.$ZodCIDRv4.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cidrv4(params) {\n return core._cidrv4(ZodCIDRv4, params);\n}\nexport const ZodCIDRv6 = /@__PURE__/ core.$constructor(\"ZodCIDRv6\", (inst, def) => {\n core.$ZodCIDRv6.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function cidrv6(params) {\n return core._cidrv6(ZodCIDRv6, params);\n}\nexport const ZodBase64 = /@__PURE__/ core.$constructor(\"ZodBase64\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodBase64.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function base64(params) {\n return core._base64(ZodBase64, params);\n}\nexport const ZodBase64URL = /@__PURE__/ core.$constructor(\"ZodBase64URL\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodBase64URL.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function base64url(params) {\n return core._base64url(ZodBase64URL, params);\n}\nexport const ZodE164 = /@__PURE__/ core.$constructor(\"ZodE164\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodE164.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function e164(params) {\n return core._e164(ZodE164, params);\n}\nexport const ZodJWT = /@__PURE__/ core.$constructor(\"ZodJWT\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodJWT.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function jwt(params) {\n return core._jwt(ZodJWT, params);\n}\nexport const ZodCustomStringFormat = /@__PURE__/ core.$constructor(\"ZodCustomStringFormat\", (inst, def) => {\n // ZodStringFormat.init(inst, def);\n core.$ZodCustomStringFormat.init(inst, def);\n ZodStringFormat.init(inst, def);\n});\nexport function stringFormat(format, fnOrRegex, _params = {}) {\n return core._stringFormat(ZodCustomStringFormat, format, fnOrRegex, _params);\n}\nexport function hostname(_params) {\n return core._stringFormat(ZodCustomStringFormat, \"hostname\", core.regexes.hostname, _params);\n}\nexport function hex(_params) {\n return core._stringFormat(ZodCustomStringFormat, \"hex\", core.regexes.hex, _params);\n}\nexport function hash(alg, params) {\n const enc = params?.enc ?? \"hex\";\n const format = `${alg}_${enc}`;\n const regex = core.regexes[format];\n if (!regex)\n throw new Error(`Unrecognized hash format: ${format}`);\n return core._stringFormat(ZodCustomStringFormat, format, regex, params);\n}\nexport const ZodNumber = /@__PURE__/ core.$constructor(\"ZodNumber\", (inst, def) => {\n core.$ZodNumber.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.numberProcessor(inst, ctx, json, params);\n inst.gt = (value, params) => inst.check(checks.gt(value, params));\n inst.gte = (value, params) => inst.check(checks.gte(value, params));\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.lt = (value, params) => inst.check(checks.lt(value, params));\n inst.lte = (value, params) => inst.check(checks.lte(value, params));\n inst.max = (value, params) => inst.check(checks.lte(value, params));\n inst.int = (params) => inst.check(int(params));\n inst.safe = (params) => inst.check(int(params));\n inst.positive = (params) => inst.check(checks.gt(0, params));\n inst.nonnegative = (params) => inst.check(checks.gte(0, params));\n inst.negative = (params) => inst.check(checks.lt(0, params));\n inst.nonpositive = (params) => inst.check(checks.lte(0, params));\n inst.multipleOf = (value, params) => inst.check(checks.multipleOf(value, params));\n inst.step = (value, params) => inst.check(checks.multipleOf(value, params));\n // inst.finite = (params) => inst.check(core.finite(params));\n inst.finite = () => inst;\n const bag = inst._zod.bag;\n inst.minValue =\n Math.max(bag.minimum ?? Number.NEGATIVE_INFINITY, bag.exclusiveMinimum ?? Number.NEGATIVE_INFINITY) ?? null;\n inst.maxValue =\n Math.min(bag.maximum ?? Number.POSITIVE_INFINITY, bag.exclusiveMaximum ?? Number.POSITIVE_INFINITY) ?? null;\n inst.isInt = (bag.format ?? \"\").includes(\"int\") \|\| Number.isSafeInteger(bag.multipleOf ?? 0.5);\n inst.isFinite = true;\n inst.format = bag.format ?? null;\n});\nexport function number(params) {\n return core._number(ZodNumber, params);\n}\nexport const ZodNumberFormat = /@__PURE__/ core.$constructor(\"ZodNumberFormat\", (inst, def) => {\n core.$ZodNumberFormat.init(inst, def);\n ZodNumber.init(inst, def);\n});\nexport function int(params) {\n return core._int(ZodNumberFormat, params);\n}\nexport function float32(params) {\n return core._float32(ZodNumberFormat, params);\n}\nexport function float64(params) {\n return core._float64(ZodNumberFormat, params);\n}\nexport function int32(params) {\n return core._int32(ZodNumberFormat, params);\n}\nexport function uint32(params) {\n return core._uint32(ZodNumberFormat, params);\n}\nexport const ZodBoolean = /@__PURE__/ core.$constructor(\"ZodBoolean\", (inst, def) => {\n core.$ZodBoolean.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.booleanProcessor(inst, ctx, json, params);\n});\nexport function boolean(params) {\n return core._boolean(ZodBoolean, params);\n}\nexport const ZodBigInt = /@__PURE__/ core.$constructor(\"ZodBigInt\", (inst, def) => {\n core.$ZodBigInt.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.bigintProcessor(inst, ctx, json, params);\n inst.gte = (value, params) => inst.check(checks.gte(value, params));\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.gt = (value, params) => inst.check(checks.gt(value, params));\n inst.gte = (value, params) => inst.check(checks.gte(value, params));\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.lt = (value, params) => inst.check(checks.lt(value, params));\n inst.lte = (value, params) => inst.check(checks.lte(value, params));\n inst.max = (value, params) => inst.check(checks.lte(value, params));\n inst.positive = (params) => inst.check(checks.gt(BigInt(0), params));\n inst.negative = (params) => inst.check(checks.lt(BigInt(0), params));\n inst.nonpositive = (params) => inst.check(checks.lte(BigInt(0), params));\n inst.nonnegative = (params) => inst.check(checks.gte(BigInt(0), params));\n inst.multipleOf = (value, params) => inst.check(checks.multipleOf(value, params));\n const bag = inst._zod.bag;\n inst.minValue = bag.minimum ?? null;\n inst.maxValue = bag.maximum ?? null;\n inst.format = bag.format ?? null;\n});\nexport function bigint(params) {\n return core._bigint(ZodBigInt, params);\n}\nexport const ZodBigIntFormat = /@__PURE__/ core.$constructor(\"ZodBigIntFormat\", (inst, def) => {\n core.$ZodBigIntFormat.init(inst, def);\n ZodBigInt.init(inst, def);\n});\n// int64\nexport function int64(params) {\n return core._int64(ZodBigIntFormat, params);\n}\n// uint64\nexport function uint64(params) {\n return core._uint64(ZodBigIntFormat, params);\n}\nexport const ZodSymbol = /@__PURE__/ core.$constructor(\"ZodSymbol\", (inst, def) => {\n core.$ZodSymbol.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.symbolProcessor(inst, ctx, json, params);\n});\nexport function symbol(params) {\n return core._symbol(ZodSymbol, params);\n}\nexport const ZodUndefined = /@__PURE__/ core.$constructor(\"ZodUndefined\", (inst, def) => {\n core.$ZodUndefined.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.undefinedProcessor(inst, ctx, json, params);\n});\nfunction _undefined(params) {\n return core._undefined(ZodUndefined, params);\n}\nexport { _undefined as undefined };\nexport const ZodNull = /@__PURE__/ core.$constructor(\"ZodNull\", (inst, def) => {\n core.$ZodNull.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nullProcessor(inst, ctx, json, params);\n});\nfunction _null(params) {\n return core._null(ZodNull, params);\n}\nexport { _null as null };\nexport const ZodAny = /@__PURE__/ core.$constructor(\"ZodAny\", (inst, def) => {\n core.$ZodAny.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.anyProcessor(inst, ctx, json, params);\n});\nexport function any() {\n return core._any(ZodAny);\n}\nexport const ZodUnknown = /@__PURE__/ core.$constructor(\"ZodUnknown\", (inst, def) => {\n core.$ZodUnknown.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.unknownProcessor(inst, ctx, json, params);\n});\nexport function unknown() {\n return core._unknown(ZodUnknown);\n}\nexport const ZodNever = /@__PURE__/ core.$constructor(\"ZodNever\", (inst, def) => {\n core.$ZodNever.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.neverProcessor(inst, ctx, json, params);\n});\nexport function never(params) {\n return core._never(ZodNever, params);\n}\nexport const ZodVoid = /@__PURE__/ core.$constructor(\"ZodVoid\", (inst, def) => {\n core.$ZodVoid.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.voidProcessor(inst, ctx, json, params);\n});\nfunction _void(params) {\n return core._void(ZodVoid, params);\n}\nexport { _void as void };\nexport const ZodDate = /@__PURE__/ core.$constructor(\"ZodDate\", (inst, def) => {\n core.$ZodDate.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.dateProcessor(inst, ctx, json, params);\n inst.min = (value, params) => inst.check(checks.gte(value, params));\n inst.max = (value, params) => inst.check(checks.lte(value, params));\n const c = inst._zod.bag;\n inst.minDate = c.minimum ? new Date(c.minimum) : null;\n inst.maxDate = c.maximum ? new Date(c.maximum) : null;\n});\nexport function date(params) {\n return core._date(ZodDate, params);\n}\nexport const ZodArray = /@__PURE__/ core.$constructor(\"ZodArray\", (inst, def) => {\n core.$ZodArray.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.arrayProcessor(inst, ctx, json, params);\n inst.element = def.element;\n inst.min = (minLength, params) => inst.check(checks.minLength(minLength, params));\n inst.nonempty = (params) => inst.check(checks.minLength(1, params));\n inst.max = (maxLength, params) => inst.check(checks.maxLength(maxLength, params));\n inst.length = (len, params) => inst.check(checks.length(len, params));\n inst.unwrap = () => inst.element;\n});\nexport function array(element, params) {\n return core._array(ZodArray, element, params);\n}\n// .keyof\nexport function keyof(schema) {\n const shape = schema._zod.def.shape;\n return _enum(Object.keys(shape));\n}\nexport const ZodObject = /@__PURE__/ core.$constructor(\"ZodObject\", (inst, def) => {\n core.$ZodObjectJIT.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.objectProcessor(inst, ctx, json, params);\n util.defineLazy(inst, \"shape\", () => {\n return def.shape;\n });\n inst.keyof = () => _enum(Object.keys(inst._zod.def.shape));\n inst.catchall = (catchall) => inst.clone({ ...inst._zod.def, catchall: catchall });\n inst.passthrough = () => inst.clone({ ...inst._zod.def, catchall: unknown() });\n inst.loose = () => inst.clone({ ...inst._zod.def, catchall: unknown() });\n inst.strict = () => inst.clone({ ...inst._zod.def, catchall: never() });\n inst.strip = () => inst.clone({ ...inst._zod.def, catchall: undefined });\n inst.extend = (incoming) => {\n return util.extend(inst, incoming);\n };\n inst.safeExtend = (incoming) => {\n return util.safeExtend(inst, incoming);\n };\n inst.merge = (other) => util.merge(inst, other);\n inst.pick = (mask) => util.pick(inst, mask);\n inst.omit = (mask) => util.omit(inst, mask);\n inst.partial = (...args) => util.partial(ZodOptional, inst, args[0]);\n inst.required = (...args) => util.required(ZodNonOptional, inst, args[0]);\n});\nexport function object(shape, params) {\n const def = {\n type: \"object\",\n shape: shape ?? {},\n ...util.normalizeParams(params),\n };\n return new ZodObject(def);\n}\n// strictObject\nexport function strictObject(shape, params) {\n return new ZodObject({\n type: \"object\",\n shape,\n catchall: never(),\n ...util.normalizeParams(params),\n });\n}\n// looseObject\nexport function looseObject(shape, params) {\n return new ZodObject({\n type: \"object\",\n shape,\n catchall: unknown(),\n ...util.normalizeParams(params),\n });\n}\nexport const ZodUnion = /@__PURE__/ core.$constructor(\"ZodUnion\", (inst, def) => {\n core.$ZodUnion.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.unionProcessor(inst, ctx, json, params);\n inst.options = def.options;\n});\nexport function union(options, params) {\n return new ZodUnion({\n type: \"union\",\n options: options,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodXor = /@__PURE__/ core.$constructor(\"ZodXor\", (inst, def) => {\n ZodUnion.init(inst, def);\n core.$ZodXor.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.unionProcessor(inst, ctx, json, params);\n inst.options = def.options;\n});\n/* Creates an exclusive union (XOR) where exactly one option must match.\n * Unlike regular unions that succeed when any option matches, xor fails if\n * zero or more than one option matches the input. /\nexport function xor(options, params) {\n return new ZodXor({\n type: \"union\",\n options: options,\n inclusive: false,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodDiscriminatedUnion = /@__PURE__/ core.$constructor(\"ZodDiscriminatedUnion\", (inst, def) => {\n ZodUnion.init(inst, def);\n core.$ZodDiscriminatedUnion.init(inst, def);\n});\nexport function discriminatedUnion(discriminator, options, params) {\n // const [options, params] = args;\n return new ZodDiscriminatedUnion({\n type: \"union\",\n options,\n discriminator,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodIntersection = /@__PURE__/ core.$constructor(\"ZodIntersection\", (inst, def) => {\n core.$ZodIntersection.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.intersectionProcessor(inst, ctx, json, params);\n});\nexport function intersection(left, right) {\n return new ZodIntersection({\n type: \"intersection\",\n left: left,\n right: right,\n });\n}\nexport const ZodTuple = /@__PURE__/ core.$constructor(\"ZodTuple\", (inst, def) => {\n core.$ZodTuple.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.tupleProcessor(inst, ctx, json, params);\n inst.rest = (rest) => inst.clone({\n ...inst._zod.def,\n rest: rest,\n });\n});\nexport function tuple(items, _paramsOrRest, _params) {\n const hasRest = _paramsOrRest instanceof core.$ZodType;\n const params = hasRest ? _params : _paramsOrRest;\n const rest = hasRest ? _paramsOrRest : null;\n return new ZodTuple({\n type: \"tuple\",\n items: items,\n rest,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodRecord = /@__PURE__/ core.$constructor(\"ZodRecord\", (inst, def) => {\n core.$ZodRecord.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.recordProcessor(inst, ctx, json, params);\n inst.keyType = def.keyType;\n inst.valueType = def.valueType;\n});\nexport function record(keyType, valueType, params) {\n return new ZodRecord({\n type: \"record\",\n keyType,\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\n// type alksjf = core.output<core.$ZodRecordKey>;\nexport function partialRecord(keyType, valueType, params) {\n const k = core.clone(keyType);\n k._zod.values = undefined;\n return new ZodRecord({\n type: \"record\",\n keyType: k,\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\nexport function looseRecord(keyType, valueType, params) {\n return new ZodRecord({\n type: \"record\",\n keyType,\n valueType: valueType,\n mode: \"loose\",\n ...util.normalizeParams(params),\n });\n}\nexport const ZodMap = /@__PURE__/ core.$constructor(\"ZodMap\", (inst, def) => {\n core.$ZodMap.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.mapProcessor(inst, ctx, json, params);\n inst.keyType = def.keyType;\n inst.valueType = def.valueType;\n inst.min = (...args) => inst.check(core._minSize(...args));\n inst.nonempty = (params) => inst.check(core._minSize(1, params));\n inst.max = (...args) => inst.check(core._maxSize(...args));\n inst.size = (...args) => inst.check(core._size(...args));\n});\nexport function map(keyType, valueType, params) {\n return new ZodMap({\n type: \"map\",\n keyType: keyType,\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodSet = /@__PURE__/ core.$constructor(\"ZodSet\", (inst, def) => {\n core.$ZodSet.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.setProcessor(inst, ctx, json, params);\n inst.min = (...args) => inst.check(core._minSize(...args));\n inst.nonempty = (params) => inst.check(core._minSize(1, params));\n inst.max = (...args) => inst.check(core._maxSize(...args));\n inst.size = (...args) => inst.check(core._size(...args));\n});\nexport function set(valueType, params) {\n return new ZodSet({\n type: \"set\",\n valueType: valueType,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodEnum = /@__PURE__/ core.$constructor(\"ZodEnum\", (inst, def) => {\n core.$ZodEnum.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.enumProcessor(inst, ctx, json, params);\n inst.enum = def.entries;\n inst.options = Object.values(def.entries);\n const keys = new Set(Object.keys(def.entries));\n inst.extract = (values, params) => {\n const newEntries = {};\n for (const value of values) {\n if (keys.has(value)) {\n newEntries[value] = def.entries[value];\n }\n else\n throw new Error(`Key ${value} not found in enum`);\n }\n return new ZodEnum({\n ...def,\n checks: [],\n ...util.normalizeParams(params),\n entries: newEntries,\n });\n };\n inst.exclude = (values, params) => {\n const newEntries = { ...def.entries };\n for (const value of values) {\n if (keys.has(value)) {\n delete newEntries[value];\n }\n else\n throw new Error(`Key ${value} not found in enum`);\n }\n return new ZodEnum({\n ...def,\n checks: [],\n ...util.normalizeParams(params),\n entries: newEntries,\n });\n };\n});\nfunction _enum(values, params) {\n const entries = Array.isArray(values) ? Object.fromEntries(values.map((v) => [v, v])) : values;\n return new ZodEnum({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\nexport { _enum as enum };\n/* @deprecated This API has been merged into `z.enum()`. Use `z.enum()` instead.\n \n ```ts\n * enum Colors { red, green, blue }\n * z.enum(Colors);\n * ```\n /\nexport function nativeEnum(entries, params) {\n return new ZodEnum({\n type: \"enum\",\n entries,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodLiteral = /@__PURE__/ core.$constructor(\"ZodLiteral\", (inst, def) => {\n core.$ZodLiteral.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.literalProcessor(inst, ctx, json, params);\n inst.values = new Set(def.values);\n Object.defineProperty(inst, \"value\", {\n get() {\n if (def.values.length > 1) {\n throw new Error(\"This schema contains multiple valid literal values. Use `.values` instead.\");\n }\n return def.values[0];\n },\n });\n});\nexport function literal(value, params) {\n return new ZodLiteral({\n type: \"literal\",\n values: Array.isArray(value) ? value : [value],\n ...util.normalizeParams(params),\n });\n}\nexport const ZodFile = /@__PURE__/ core.$constructor(\"ZodFile\", (inst, def) => {\n core.$ZodFile.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.fileProcessor(inst, ctx, json, params);\n inst.min = (size, params) => inst.check(core._minSize(size, params));\n inst.max = (size, params) => inst.check(core._maxSize(size, params));\n inst.mime = (types, params) => inst.check(core._mime(Array.isArray(types) ? types : [types], params));\n});\nexport function file(params) {\n return core._file(ZodFile, params);\n}\nexport const ZodTransform = /@__PURE__/ core.$constructor(\"ZodTransform\", (inst, def) => {\n core.$ZodTransform.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.transformProcessor(inst, ctx, json, params);\n inst._zod.parse = (payload, _ctx) => {\n if (_ctx.direction === \"backward\") {\n throw new core.$ZodEncodeError(inst.constructor.name);\n }\n payload.addIssue = (issue) => {\n if (typeof issue === \"string\") {\n payload.issues.push(util.issue(issue, payload.value, def));\n }\n else {\n // for Zod 3 backwards compatibility\n const _issue = issue;\n if (_issue.fatal)\n _issue.continue = false;\n _issue.code ?? (_issue.code = \"custom\");\n _issue.input ?? (_issue.input = payload.value);\n _issue.inst ?? (_issue.inst = inst);\n // _issue.continue ??= true;\n payload.issues.push(util.issue(_issue));\n }\n };\n const output = def.transform(payload.value, payload);\n if (output instanceof Promise) {\n return output.then((output) => {\n payload.value = output;\n return payload;\n });\n }\n payload.value = output;\n return payload;\n };\n});\nexport function transform(fn) {\n return new ZodTransform({\n type: \"transform\",\n transform: fn,\n });\n}\nexport const ZodOptional = /@__PURE__/ core.$constructor(\"ZodOptional\", (inst, def) => {\n core.$ZodOptional.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.optionalProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function optional(innerType) {\n return new ZodOptional({\n type: \"optional\",\n innerType: innerType,\n });\n}\nexport const ZodExactOptional = /@__PURE__/ core.$constructor(\"ZodExactOptional\", (inst, def) => {\n core.$ZodExactOptional.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.optionalProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function exactOptional(innerType) {\n return new ZodExactOptional({\n type: \"optional\",\n innerType: innerType,\n });\n}\nexport const ZodNullable = /@__PURE__/ core.$constructor(\"ZodNullable\", (inst, def) => {\n core.$ZodNullable.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nullableProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function nullable(innerType) {\n return new ZodNullable({\n type: \"nullable\",\n innerType: innerType,\n });\n}\n// nullish\nexport function nullish(innerType) {\n return optional(nullable(innerType));\n}\nexport const ZodDefault = /@__PURE__/ core.$constructor(\"ZodDefault\", (inst, def) => {\n core.$ZodDefault.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.defaultProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n inst.removeDefault = inst.unwrap;\n});\nexport function _default(innerType, defaultValue) {\n return new ZodDefault({\n type: \"default\",\n innerType: innerType,\n get defaultValue() {\n return typeof defaultValue === \"function\" ? defaultValue() : util.shallowClone(defaultValue);\n },\n });\n}\nexport const ZodPrefault = /@__PURE__/ core.$constructor(\"ZodPrefault\", (inst, def) => {\n core.$ZodPrefault.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.prefaultProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function prefault(innerType, defaultValue) {\n return new ZodPrefault({\n type: \"prefault\",\n innerType: innerType,\n get defaultValue() {\n return typeof defaultValue === \"function\" ? defaultValue() : util.shallowClone(defaultValue);\n },\n });\n}\nexport const ZodNonOptional = /@__PURE__/ core.$constructor(\"ZodNonOptional\", (inst, def) => {\n core.$ZodNonOptional.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nonoptionalProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function nonoptional(innerType, params) {\n return new ZodNonOptional({\n type: \"nonoptional\",\n innerType: innerType,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodSuccess = /@__PURE__/ core.$constructor(\"ZodSuccess\", (inst, def) => {\n core.$ZodSuccess.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.successProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function success(innerType) {\n return new ZodSuccess({\n type: \"success\",\n innerType: innerType,\n });\n}\nexport const ZodCatch = /@__PURE__/ core.$constructor(\"ZodCatch\", (inst, def) => {\n core.$ZodCatch.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.catchProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n inst.removeCatch = inst.unwrap;\n});\nfunction _catch(innerType, catchValue) {\n return new ZodCatch({\n type: \"catch\",\n innerType: innerType,\n catchValue: (typeof catchValue === \"function\" ? catchValue : () => catchValue),\n });\n}\nexport { _catch as catch };\nexport const ZodNaN = /@__PURE__/ core.$constructor(\"ZodNaN\", (inst, def) => {\n core.$ZodNaN.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.nanProcessor(inst, ctx, json, params);\n});\nexport function nan(params) {\n return core._nan(ZodNaN, params);\n}\nexport const ZodPipe = /@__PURE__/ core.$constructor(\"ZodPipe\", (inst, def) => {\n core.$ZodPipe.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.pipeProcessor(inst, ctx, json, params);\n inst.in = def.in;\n inst.out = def.out;\n});\nexport function pipe(in_, out) {\n return new ZodPipe({\n type: \"pipe\",\n in: in_,\n out: out,\n // ...util.normalizeParams(params),\n });\n}\nexport const ZodCodec = /@__PURE__/ core.$constructor(\"ZodCodec\", (inst, def) => {\n ZodPipe.init(inst, def);\n core.$ZodCodec.init(inst, def);\n});\nexport function codec(in_, out, params) {\n return new ZodCodec({\n type: \"pipe\",\n in: in_,\n out: out,\n transform: params.decode,\n reverseTransform: params.encode,\n });\n}\nexport const ZodReadonly = /@__PURE__/ core.$constructor(\"ZodReadonly\", (inst, def) => {\n core.$ZodReadonly.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.readonlyProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function readonly(innerType) {\n return new ZodReadonly({\n type: \"readonly\",\n innerType: innerType,\n });\n}\nexport const ZodTemplateLiteral = /@__PURE__/ core.$constructor(\"ZodTemplateLiteral\", (inst, def) => {\n core.$ZodTemplateLiteral.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.templateLiteralProcessor(inst, ctx, json, params);\n});\nexport function templateLiteral(parts, params) {\n return new ZodTemplateLiteral({\n type: \"template_literal\",\n parts,\n ...util.normalizeParams(params),\n });\n}\nexport const ZodLazy = /@__PURE__/ core.$constructor(\"ZodLazy\", (inst, def) => {\n core.$ZodLazy.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.lazyProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.getter();\n});\nexport function lazy(getter) {\n return new ZodLazy({\n type: \"lazy\",\n getter: getter,\n });\n}\nexport const ZodPromise = /@__PURE__/ core.$constructor(\"ZodPromise\", (inst, def) => {\n core.$ZodPromise.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.promiseProcessor(inst, ctx, json, params);\n inst.unwrap = () => inst._zod.def.innerType;\n});\nexport function promise(innerType) {\n return new ZodPromise({\n type: \"promise\",\n innerType: innerType,\n });\n}\nexport const ZodFunction = /@__PURE__/ core.$constructor(\"ZodFunction\", (inst, def) => {\n core.$ZodFunction.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.functionProcessor(inst, ctx, json, params);\n});\nexport function _function(params) {\n return new ZodFunction({\n type: \"function\",\n input: Array.isArray(params?.input) ? tuple(params?.input) : (params?.input ?? array(unknown())),\n output: params?.output ?? unknown(),\n });\n}\nexport { _function as function };\nexport const ZodCustom = /@__PURE__/ core.$constructor(\"ZodCustom\", (inst, def) => {\n core.$ZodCustom.init(inst, def);\n ZodType.init(inst, def);\n inst._zod.processJSONSchema = (ctx, json, params) => processors.customProcessor(inst, ctx, json, params);\n});\n// custom checks\nexport function check(fn) {\n const ch = new core.$ZodCheck({\n check: \"custom\",\n // ...util.normalizeParams(params),\n });\n ch._zod.check = fn;\n return ch;\n}\nexport function custom(fn, _params) {\n return core._custom(ZodCustom, fn ?? (() => true), _params);\n}\nexport function refine(fn, _params = {}) {\n return core._refine(ZodCustom, fn, _params);\n}\n// superRefine\nexport function superRefine(fn) {\n return core._superRefine(fn);\n}\n// Re-export describe and meta from core\nexport const describe = core.describe;\nexport const meta = core.meta;\nfunction _instanceof(cls, params = {}) {\n const inst = new ZodCustom({\n type: \"custom\",\n check: \"custom\",\n fn: (data) => data instanceof cls,\n abort: true,\n ...util.normalizeParams(params),\n });\n inst._zod.bag.Class = cls;\n // Override check to emit invalid_type instead of custom\n inst._zod.check = (payload) => {\n if (!(payload.value instanceof cls)) {\n payload.issues.push({\n code: \"invalid_type\",\n expected: cls.name,\n input: payload.value,\n inst,\n path: [...(inst._zod.def.path ?? [])],\n });\n }\n };\n return inst;\n}\nexport { _instanceof as instanceof };\n// stringbool\nexport const stringbool = (...args) => core._stringbool({\n Codec: ZodCodec,\n Boolean: ZodBoolean,\n String: ZodString,\n}, ...args);\nexport function json(params) {\n const jsonSchema = lazy(() => {\n return union([string(params), number(), boolean(), _null(), array(jsonSchema), record(string(), jsonSchema)]);\n });\n return jsonSchema;\n}\n// preprocess\n// /* @deprecated Use `z.pipe()` and `z.transform()` instead. /\nexport function preprocess(fn, schema) {\n return pipe(transform(fn), schema);\n}\n","import { z } from \"zod\";\n\nconst CodegenSettingsSchema = z\n .object({\n language: z.enum([\"typescript\", \"javascript\"]).optional(),\n disableMarkedForExport: z.boolean().optional(),\n allowAutoSelectFirstNode: z.boolean().optional().default(true),\n enableDisplayDataId: z.boolean().optional(),\n enableDisplayDataName: z.boolean().optional(),\n enableDisplayDataVariant: z.boolean().optional(),\n })\n .and(\n z.union([\n z.object({\n framework: z.literal(\"react\"),\n model: z.string().optional(),\n styling: z.enum([\"plain_css\", \"tailwind\", \"inline_styles\"]),\n uiLibrary: z\n .enum([\"mui\", \"antd\", \"radix\", \"shadcn\", \"clean_react\", \"custom_design_system\"])\n .optional(),\n responsivePages: z\n .array(\n z.object({\n name: z.string(),\n framesId: z.array(z.string()),\n })\n )\n .optional(),\n enableUILibraryTheming: z.boolean().optional(),\n enableCompactStructure: z.boolean().optional(),\n enableDisplayScreenModelId: z.boolean().optional(),\n enableGeneratePackageLock: z.boolean().optional(),\n enableAnimationsPreset: z.boolean().optional(),\n\n enableAutoSplit: z.boolean().optional(),\n autoSplitThreshold: z.number().optional(),\n url: z.string().url().optional(),\n codegenSettings: z.record(z.string(), z.unknown()).optional(),\n designSystemId: z.string().optional(),\n }),\n z.object({\n framework: z.literal(\"html\"),\n styling: z.enum([\"plain_css\", \"inline_styles\", \"tailwind\"]),\n enableTranslation: z.boolean().optional(),\n }),\n ])\n );\n\nexport type BaseSettings = {\n codegenSettings?: Record<string, unknown>;\n};\n\n// We don't use the z.infer method here because the types returned by zod aren't ergonic\nexport type CodegenSettings = BaseSettings & {\n language?: \"typescript\" \| \"javascript\";\n model?: string;\n framework: \"react\" \| \"html\";\n styling: \"plain_css\" \| \"tailwind\" \| \"inline_styles\";\n uiLibrary?: \"mui\" \| \"antd\" \| \"radix\" \| \"shadcn\" \| \"clean_react\" \| \"custom_design_system\";\n responsivePages?: Array<{\n name: string;\n framesId: string[];\n }>;\n enableTranslation?: boolean;\n enableUILibraryTheming?: boolean;\n enableCompactStructure?: boolean;\n enableAutoSplit?: boolean;\n autoSplitThreshold?: number;\n disableMarkedForExport?: boolean;\n allowAutoSelectFirstNode?: boolean;\n enableDisplayScreenModelId?: boolean;\n enableGeneratePackageLock?: boolean;\n enableAnimationsPreset?: boolean;\n enableDisplayDataId?: boolean;\n enableDisplayDataName?: boolean;\n enableDisplayDataVariant?: boolean;\n url?: string;\n prompt?: string;\n images?: Array<{ url: string }>;\n designSystemId?: string;\n};\n\nexport const validateSettings = (obj: unknown): CodegenSettings => {\n const parsedObj = CodegenSettingsSchema.safeParse(obj);\n\n if (parsedObj.success === false) {\n const error = new Error(\"Invalid codegen settings\");\n error.cause = parsedObj.error;\n throw error;\n }\n\n return parsedObj.data;\n};\n","import type { Node } from \"@figma/rest-api-spec\";\n\nexport type FigmaNode = Node;\n\nexport const findChildrenNode = (\n node: FigmaNode,\n targetNodeId: string\n): FigmaNode \| null => {\n if (node.id === targetNodeId) {\n return node;\n }\n\n if (\"children\" in node) {\n for (const child of node.children) {\n const found = findChildrenNode(child, targetNodeId);\n if (found) {\n return found;\n }\n }\n }\n\n return null;\n};\n","import type { GetFileResponse } from \"@figma/rest-api-spec\";\nimport { findChildrenNode, type FigmaNode } from \"../figma\";\n\nconst validNodeTypes: Set<FigmaNode[\"type\"]> = new Set([\n \"FRAME\",\n \"INSTANCE\",\n \"COMPONENT\",\n \"COMPONENT_SET\",\n \"GROUP\",\n]);\n\ntype ValidateNodeForCodegenResult =\n \| {\n isValid: true;\n node: FigmaNode;\n note?: \"Selected node is a page with a single valid children - returning it instead\";\n }\n \| {\n isValid: true;\n node: FigmaNode;\n note?: \"Selected node is a page with multiple valid children - returning the first one instead\";\n }\n \| {\n isValid: false;\n reason: InvalidNodeForCodegenReason;\n };\n\ntype InvalidNodeForCodegenReason =\n \| \"Selected node is a page with multiple children\"\n \| \"Selected node is a page with no valid children\"\n \| \"There is no node with the given id\"\n \| \"Selected node type is not supported\";\n\n/\n Check if the pair \"design\" + \"node id\" is valid for code generation.\n * May recommend a node that is not the one passed as argument.\n /\nexport const isNodeCodegenCompatible = (\n design: GetFileResponse,\n nodeId: string,\n options: {\n allowAutoSelectFirstNode: boolean;\n } = { allowAutoSelectFirstNode: true }\n): ValidateNodeForCodegenResult => {\n const found = findChildrenNode(design.document, nodeId);\n\n // If no node found with the given id\n if (!found) {\n return {\n isValid: false,\n reason: \"There is no node with the given id\",\n };\n }\n\n // If the selected node is a page and has only one valid child node to generate code from, return that child node\n if (found.type === \"CANVAS\") {\n const validChildrenNodes = found.children.filter((child) =>\n validNodeTypes.has(child.type)\n );\n\n if (validChildrenNodes.length === 0) {\n return {\n isValid: false,\n reason: \"Selected node is a page with no valid children\",\n };\n }\n\n if (validChildrenNodes.length === 1) {\n return {\n isValid: true,\n node: validChildrenNodes[0],\n note: \"Selected node is a page with a single valid children - returning it instead\",\n };\n }\n\n if (options.allowAutoSelectFirstNode) {\n return {\n isValid: true,\n node: validChildrenNodes[0],\n note: \"Selected node is a page with multiple valid children - returning the first one instead\",\n };\n }\n\n return {\n isValid: false,\n reason: \"Selected node is a page with multiple children\",\n };\n }\n\n // If the selected node is not a valid node type, return an error\n if (!validNodeTypes.has(found.type)) {\n return {\n isValid: false,\n reason: \"Selected node type is not supported\",\n };\n }\n\n // All good\n return { isValid: true, node: found };\n};\n","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global = typeof globalThis !== 'undefined' ? globalThis : global \|\| self, global.typeDetect = factory());\n})(this, (function () { 'use strict';\n\n var promiseExists = typeof Promise === 'function';\n var globalObject = (function (Obj) {\n if (typeof globalThis === 'object') {\n return globalThis;\n }\n Object.defineProperty(Obj, 'typeDetectGlobalObject', {\n get: function get() {\n return this;\n },\n configurable: true,\n });\n var global = typeDetectGlobalObject;\n delete Obj.typeDetectGlobalObject;\n return global;\n })(Object.prototype);\n var symbolExists = typeof Symbol !== 'undefined';\n var mapExists = typeof Map !== 'undefined';\n var setExists = typeof Set !== 'undefined';\n var weakMapExists = typeof WeakMap !== 'undefined';\n var weakSetExists = typeof WeakSet !== 'undefined';\n var dataViewExists = typeof DataView !== 'undefined';\n var symbolIteratorExists = symbolExists && typeof Symbol.iterator !== 'undefined';\n var symbolToStringTagExists = symbolExists && typeof Symbol.toStringTag !== 'undefined';\n var setEntriesExists = setExists && typeof Set.prototype.entries === 'function';\n var mapEntriesExists = mapExists && typeof Map.prototype.entries === 'function';\n var setIteratorPrototype = setEntriesExists && Object.getPrototypeOf(new Set().entries());\n var mapIteratorPrototype = mapEntriesExists && Object.getPrototypeOf(new Map().entries());\n var arrayIteratorExists = symbolIteratorExists && typeof Array.prototype[Symbol.iterator] === 'function';\n var arrayIteratorPrototype = arrayIteratorExists && Object.getPrototypeOf([][Symbol.iterator]());\n var stringIteratorExists = symbolIteratorExists && typeof String.prototype[Symbol.iterator] === 'function';\n var stringIteratorPrototype = stringIteratorExists && Object.getPrototypeOf(''[Symbol.iterator]());\n var toStringLeftSliceLength = 8;\n var toStringRightSliceLength = -1;\n function typeDetect(obj) {\n var typeofObj = typeof obj;\n if (typeofObj !== 'object') {\n return typeofObj;\n }\n if (obj === null) {\n return 'null';\n }\n if (obj === globalObject) {\n return 'global';\n }\n if (Array.isArray(obj) &&\n (symbolToStringTagExists === false \|\| !(Symbol.toStringTag in obj))) {\n return 'Array';\n }\n if (typeof window === 'object' && window !== null) {\n if (typeof window.location === 'object' && obj === window.location) {\n return 'Location';\n }\n if (typeof window.document === 'object' && obj === window.document) {\n return 'Document';\n }\n if (typeof window.navigator === 'object') {\n if (typeof window.navigator.mimeTypes === 'object' &&\n obj === window.navigator.mimeTypes) {\n return 'MimeTypeArray';\n }\n if (typeof window.navigator.plugins === 'object' &&\n obj === window.navigator.plugins) {\n return 'PluginArray';\n }\n }\n if ((typeof window.HTMLElement === 'function' \|\|\n typeof window.HTMLElement === 'object') &&\n obj instanceof window.HTMLElement) {\n if (obj.tagName === 'BLOCKQUOTE') {\n return 'HTMLQuoteElement';\n }\n if (obj.tagName === 'TD') {\n return 'HTMLTableDataCellElement';\n }\n if (obj.tagName === 'TH') {\n return 'HTMLTableHeaderCellElement';\n }\n }\n }\n var stringTag = (symbolToStringTagExists && obj[Symbol.toStringTag]);\n if (typeof stringTag === 'string') {\n return stringTag;\n }\n var objPrototype = Object.getPrototypeOf(obj);\n if (objPrototype === RegExp.prototype) {\n return 'RegExp';\n }\n if (objPrototype === Date.prototype) {\n return 'Date';\n }\n if (promiseExists && objPrototype === Promise.prototype) {\n return 'Promise';\n }\n if (setExists && objPrototype === Set.prototype) {\n return 'Set';\n }\n if (mapExists && objPrototype === Map.prototype) {\n return 'Map';\n }\n if (weakSetExists && objPrototype === WeakSet.prototype) {\n return 'WeakSet';\n }\n if (weakMapExists && objPrototype === WeakMap.prototype) {\n return 'WeakMap';\n }\n if (dataViewExists && objPrototype === DataView.prototype) {\n return 'DataView';\n }\n if (mapExists && objPrototype === mapIteratorPrototype) {\n return 'Map Iterator';\n }\n if (setExists && objPrototype === setIteratorPrototype) {\n return 'Set Iterator';\n }\n if (arrayIteratorExists && objPrototype === arrayIteratorPrototype) {\n return 'Array Iterator';\n }\n if (stringIteratorExists && objPrototype === stringIteratorPrototype) {\n return 'String Iterator';\n }\n if (objPrototype === null) {\n return 'Object';\n }\n return Object\n .prototype\n .toString\n .call(obj)\n .slice(toStringLeftSliceLength, toStringRightSliceLength);\n }\n\n return typeDetect;\n\n}));\n","const isBufferExists = typeof Buffer !== 'undefined';\nconst isBufferFromExists = isBufferExists && typeof Buffer.from !== 'undefined';\n\nexport const isBuffer = isBufferExists\n ? /\n is value is Buffer?\n \n @param {} value\n @return {boolean}\n /\n function isBuffer(value) {\n return Buffer.isBuffer(value);\n }\n : /\n return false\n \n NOTE: for Buffer unsupported\n \n @return {boolean}\n /\n function isBuffer() {\n return false;\n };\n\nexport const copy = isBufferFromExists\n ? /\n copy Buffer\n \n @param {Buffer} value\n * @return {Buffer}\n /\n function copy(value) {\n return Buffer.from(value);\n }\n : isBufferExists\n ? /\n copy Buffer\n \n NOTE: for old node.js\n \n @param {Buffer} value\n * @return {Buffer}\n /\n function copy(value) {\n return new Buffer(value);\n }\n : /\n shallow copy\n \n NOTE: for Buffer unsupported\n \n @param {}\n @return {}\n /\n function copy(value) {\n return value;\n };\n","import typeDetect from 'type-detect';\n\nimport { isBuffer } from './buffer.mjs';\n\n/*\n detect type of value\n \n @param {} value\n @return {string}\n /\nexport function detectType(value) {\n // NOTE: isBuffer must execute before type-detect,\n // because type-detect returns 'Uint8Array'.\n if (isBuffer(value)) {\n return 'Buffer';\n }\n\n return typeDetect(value);\n}\n","import { detectType } from './detector.mjs';\n\n/\n collection types\n /\nconst collectionTypeSet = new Set([\n 'Arguments',\n 'Array',\n 'Map',\n 'Object',\n 'Set'\n]);\n\n/\n get value from collection\n \n @param {Array\|Object\|Map\|Set} collection\n * @param {string\|number\|symbol} key\n * @param {string} [type=null]\n * @return {}\n /\nexport function get(collection, key, type = null) {\n const valueType = type \|\| detectType(collection);\n\n switch (valueType) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n return collection[key];\n case 'Map':\n return collection.get(key);\n case 'Set':\n // NOTE: Set.prototype.keys is alias of Set.prototype.values\n // it means key is equals value\n return key;\n default:\n }\n}\n\n/*\n check to type string is collection\n \n @param {string} type\n /\nexport function isCollection(type) {\n return collectionTypeSet.has(type);\n}\n\n/\n set value to collection\n \n @param {Array\|Object\|Map\|Set} collection\n * @param {string\|number\|symbol} key\n * @param {} value\n @param {string} [type=null]\n * @return {Array\|Object\|Map\|Set}\n /\nexport function set(collection, key, value, type = null) {\n const valueType = type \|\| detectType(collection);\n\n switch (valueType) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n collection[key] = value;\n break;\n case 'Map':\n collection.set(key, value);\n break;\n case 'Set':\n collection.add(value);\n break;\n default:\n }\n\n return collection;\n}\n","const freeGlobalThis =\n typeof globalThis !== 'undefined' &&\n globalThis !== null &&\n globalThis.Object === Object &&\n globalThis;\n\nconst freeGlobal =\n typeof global !== 'undefined' &&\n global !== null &&\n global.Object === Object &&\n global;\n\nconst freeSelf =\n typeof self !== 'undefined' &&\n self !== null &&\n self.Object === Object &&\n self;\n\nexport const globalObject =\n freeGlobalThis \|\| freeGlobal \|\| freeSelf \|\| Function('return this')();\n","import { copy as cloneBuffer } from './buffer.mjs';\nimport { globalObject } from './global.mjs';\n\n/\n copy ArrayBuffer\n \n @param {ArrayBuffer} value\n * @return {ArrayBuffer}\n /\nfunction copyArrayBuffer(value) {\n return value.slice(0);\n}\n\n/\n copy Boolean\n \n @param {Boolean} value\n * @return {Boolean}\n /\nfunction copyBoolean(value) {\n return new Boolean(value.valueOf());\n}\n\n/\n copy DataView\n \n @param {DataView} value\n * @return {DataView}\n /\nfunction copyDataView(value) {\n // TODO: copy ArrayBuffer?\n return new DataView(value.buffer);\n}\n\n/\n copy Buffer\n \n @param {Buffer} value\n * @return {Buffer}\n /\nfunction copyBuffer(value) {\n return cloneBuffer(value);\n}\n\n/\n copy Date\n \n @param {Date} value\n * @return {Date}\n /\nfunction copyDate(value) {\n return new Date(value.getTime());\n}\n\n/\n copy Number\n \n @param {Number} value\n * @return {Number}\n /\nfunction copyNumber(value) {\n return new Number(value);\n}\n\n/\n copy RegExp\n \n @param {RegExp} value\n * @return {RegExp}\n /\nfunction copyRegExp(value) {\n return new RegExp(value.source, value.flags);\n}\n\n/\n copy String\n \n @param {String} value\n * @return {String}\n /\nfunction copyString(value) {\n return new String(value);\n}\n\n/\n copy TypedArray\n \n @param {} value\n @return {}\n /\nfunction copyTypedArray(value, type) {\n const typedArray = globalObject[type];\n\n if (typedArray.from) {\n return globalObject[type].from(value);\n }\n\n return new globalObject[type](value);\n}\n\n/*\n shallow copy\n \n @param {} value\n @return {}\n /\nfunction shallowCopy(value) {\n return value;\n}\n\n/*\n get empty Array\n \n @return {Array}\n /\nfunction getEmptyArray() {\n return [];\n}\n\n/\n get empty Map\n \n @return {Map}\n /\nfunction getEmptyMap() {\n return new Map();\n}\n\n/\n get empty Object\n \n @return {Object}\n /\nfunction getEmptyObject() {\n return {};\n}\n\n/\n get empty Set\n \n @return {Set}\n /\nfunction getEmptySet() {\n return new Set();\n}\n\nexport default new Map([\n // deep copy\n ['ArrayBuffer', copyArrayBuffer],\n ['Boolean', copyBoolean],\n ['Buffer', copyBuffer],\n ['DataView', copyDataView],\n ['Date', copyDate],\n ['Number', copyNumber],\n ['RegExp', copyRegExp],\n ['String', copyString],\n\n // typed arrays\n // TODO: pass bound function\n ['Float32Array', copyTypedArray],\n ['Float64Array', copyTypedArray],\n ['Int16Array', copyTypedArray],\n ['Int32Array', copyTypedArray],\n ['Int8Array', copyTypedArray],\n ['Uint16Array', copyTypedArray],\n ['Uint32Array', copyTypedArray],\n ['Uint8Array', copyTypedArray],\n ['Uint8ClampedArray', copyTypedArray],\n\n // shallow copy\n ['Array Iterator', shallowCopy],\n ['Map Iterator', shallowCopy],\n ['Promise', shallowCopy],\n ['Set Iterator', shallowCopy],\n ['String Iterator', shallowCopy],\n ['function', shallowCopy],\n ['global', shallowCopy],\n // NOTE: WeakMap and WeakSet cannot get entries\n ['WeakMap', shallowCopy],\n ['WeakSet', shallowCopy],\n\n // primitives\n ['boolean', shallowCopy],\n ['null', shallowCopy],\n ['number', shallowCopy],\n ['string', shallowCopy],\n ['symbol', shallowCopy],\n ['undefined', shallowCopy],\n\n // collections\n // NOTE: return empty value, because recursively copy later.\n ['Arguments', getEmptyArray],\n ['Array', getEmptyArray],\n ['Map', getEmptyMap],\n ['Object', getEmptyObject],\n ['Set', getEmptySet]\n\n // NOTE: type-detect returns following types\n // 'Location'\n // 'Document'\n // 'MimeTypeArray'\n // 'PluginArray'\n // 'HTMLQuoteElement'\n // 'HTMLTableDataCellElement'\n // 'HTMLTableHeaderCellElement'\n\n // TODO: is type-detect never return 'object'?\n // 'object'\n]);\n","import copyMap from './copy_map.mjs';\nimport { detectType } from './detector.mjs';\n\n/\n no operation\n /\nfunction noop() {}\n\n/\n copy value\n \n @param {} value\n @param {string} [type=null]\n * @param {Function} [customizer=noop]\n * @return {}\n /\nexport function copy(value, type = null, customizer = noop) {\n if (arguments.length === 2 && typeof type === 'function') {\n customizer = type;\n type = null;\n }\n\n const valueType = type \|\| detectType(value);\n const copyFunction = copyMap.get(valueType);\n\n if (valueType === 'Object') {\n const result = customizer(value, valueType);\n\n if (result !== undefined) {\n return result;\n }\n }\n\n // NOTE: TypedArray needs pass type to argument\n return copyFunction ? copyFunction(value, valueType) : value;\n}\n","import { detectType } from './detector.mjs';\nimport { get, isCollection, set } from './collection.mjs';\nimport { copy } from './copier.mjs';\n\n/*\n deepcopy function\n \n @param {} value\n @param {Object\|Function} [options]\n * @return {}\n /\nexport default function deepcopy(value, options = {}) {\n if (typeof options === 'function') {\n options = {\n customizer: options\n };\n }\n\n const {\n // TODO: before/after customizer\n customizer\n // TODO: max depth\n // depth = Infinity,\n } = options;\n\n const valueType = detectType(value);\n\n if (!isCollection(valueType)) {\n return recursiveCopy(value, null, null, null, customizer);\n }\n\n const copiedValue = copy(value, valueType, customizer);\n\n const references = new WeakMap([[value, copiedValue]]);\n const visited = new WeakSet([value]);\n\n return recursiveCopy(value, copiedValue, references, visited, customizer);\n}\n\n/*\n recursively copy\n \n @param {} value target value\n @param {} clone clone of value\n @param {WeakMap} references visited references of clone\n * @param {WeakSet} visited visited references of value\n * @param {Function} customizer user customize function\n * @return {}\n /\nfunction recursiveCopy(value, clone, references, visited, customizer) {\n const type = detectType(value);\n const copiedValue = copy(value, type);\n\n // return if not a collection value\n if (!isCollection(type)) {\n return copiedValue;\n }\n\n let keys;\n\n switch (type) {\n case 'Arguments':\n case 'Array':\n keys = Object.keys(value);\n break;\n case 'Object':\n keys = Object.keys(value);\n keys.push(...Object.getOwnPropertySymbols(value));\n break;\n case 'Map':\n case 'Set':\n keys = value.keys();\n break;\n default:\n }\n\n // walk within collection with iterator\n for (let collectionKey of keys) {\n const collectionValue = get(value, collectionKey, type);\n\n if (visited.has(collectionValue)) {\n // for [Circular]\n set(clone, collectionKey, references.get(collectionValue), type);\n } else {\n const collectionValueType = detectType(collectionValue);\n const copiedCollectionValue = copy(collectionValue, collectionValueType);\n\n // save reference if value is collection\n if (isCollection(collectionValueType)) {\n references.set(collectionValue, copiedCollectionValue);\n visited.add(collectionValue);\n }\n\n set(\n clone,\n collectionKey,\n recursiveCopy(\n collectionValue,\n copiedCollectionValue,\n references,\n visited,\n customizer\n ),\n type\n );\n }\n }\n\n // TODO: isSealed/isFrozen/isExtensible\n\n return clone;\n}\n","import type {\n GetFileResponse,\n GetImageFillsResponse,\n GetImagesResponse,\n GetMeResponse,\n} from \"@figma/rest-api-spec\";\nimport deepcopy from \"deepcopy\";\nimport {\n MalformattedFigmaToken,\n MissingFigmaToken,\n NeedsReauthFigmaToken,\n ExpiredFigmaToken,\n UnknownForbiddenFigmaError,\n NotFound,\n RateLimitExceeded,\n RequestTooLarge,\n UnknownFigmaApiException,\n FileNotExportable,\n} from \"./errors\";\n\ntype FigmaRestApiConstructor = {\n fetch?: typeof window.fetch;\n baseAddress?: string;\n defaultOptions?: Omit<Options, \"abortSignal\">;\n};\n\nexport type FigmaPlanTier =\n \| \"enterprise\"\n \| \"org\"\n \| \"pro\"\n \| \"starter\"\n \| \"student\";\nexport type FigmaRateLimitType = \"low\" \| \"high\";\n\nexport type Options = {\n token?: string;\n abortSignal?: AbortSignal;\n onForbidden?: (\n error:\n \| NeedsReauthFigmaToken\n \| ExpiredFigmaToken\n \| FileNotExportable\n \| UnknownForbiddenFigmaError\n ) => Promise<{ retry: { newToken: string } } \| void>;\n onRateLimited?: (headers: {\n retryAfter: number;\n figmaPlanTier: FigmaPlanTier;\n figmaRateLimitType: FigmaRateLimitType;\n }) => Promise<boolean>;\n};\n\nclass FigmaRestApi {\n #baseAddress: string;\n #fetch: typeof window.fetch;\n #nextOptions: Options;\n #defaultOptions: Options;\n\n constructor({\n fetch = globalThis.fetch.bind(globalThis),\n baseAddress = \"https://api.figma.com/\",\n defaultOptions = {},\n }: FigmaRestApiConstructor = {}) {\n this.#baseAddress = baseAddress;\n this.#fetch = fetch;\n this.#defaultOptions = defaultOptions;\n this.#nextOptions = this.#defaultOptions;\n\n if (defaultOptions.token) {\n this.#ensureValidToken(defaultOptions.token);\n }\n }\n\n hasDefaultToken() {\n return Boolean(this.#defaultOptions.token);\n }\n\n updateDefaultOptions(options: Options) {\n if (options.token) {\n this.#ensureValidToken(options.token);\n }\n\n this.#defaultOptions = {\n ...this.#defaultOptions,\n ...options,\n };\n this.#nextOptions = this.#defaultOptions;\n }\n\n withOptions(options: Options) {\n this.#nextOptions = {\n ...this.#defaultOptions,\n ...this.#nextOptions,\n ...options,\n };\n\n return this;\n }\n\n #ensureValidToken(token: string) {\n if (!token.startsWith(\"figd_\") && !token.startsWith(\"figu_\")) {\n throw new MalformattedFigmaToken();\n }\n }\n\n getHeaders(token?: string) {\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n };\n\n const tokenInUse = token ?? this.#defaultOptions.token;\n if (tokenInUse?.startsWith(\"figd_\")) {\n headers[\"X-FIGMA-TOKEN\"] = tokenInUse;\n } else if (tokenInUse?.startsWith(\"figu_\")) {\n headers[\"Authorization\"] = `Bearer ${tokenInUse}`;\n } else {\n throw new MissingFigmaToken();\n }\n\n return headers;\n }\n\n async #doRequest(\n options: Options,\n request: () => Promise<Response>\n ): Promise<Response> {\n const response = await request();\n\n if (!response.ok) {\n const status = response.status;\n let responseText: string \| null = null;\n try {\n responseText = await response.text();\n } catch {\n // ignore\n }\n\n if (status === 403) {\n if (responseText?.includes(\"Invalid token\")) {\n throw new NeedsReauthFigmaToken();\n } else if (responseText?.includes(\"Token expired\")) {\n throw new ExpiredFigmaToken();\n } else if (responseText?.includes(\"File not exportable\")) {\n throw new FileNotExportable();\n }\n\n throw new UnknownForbiddenFigmaError({ reason: responseText });\n } else if (status === 404) {\n throw new NotFound({ cause: response });\n } else if (status === 429) {\n const rawRetryAfter = response.headers.get(\"Retry-After\");\n const retryAfter = rawRetryAfter ? Number(rawRetryAfter) : null;\n\n if (!retryAfter) {\n throw new RateLimitExceeded({\n cause: response,\n });\n }\n\n const shouldRetry = await options.onRateLimited?.({\n retryAfter,\n figmaPlanTier: response.headers.get(\n \"X-Figma-Plan-Tier\"\n ) as FigmaPlanTier,\n figmaRateLimitType: response.headers.get(\n \"X-Figma-Rate-Limit-Type\"\n ) as FigmaRateLimitType,\n });\n\n if (shouldRetry) {\n return new Promise((resolve, reject) => {\n const timeout = setTimeout(\n () => {\n if (options.abortSignal?.aborted) {\n return;\n }\n\n this.#doRequest(options, request).then(resolve).catch(reject);\n },\n retryAfter * 1000 + 1000\n );\n\n options.abortSignal?.addEventListener(\"abort\", () => {\n clearTimeout(timeout);\n reject(new Error(\"The operation was aborted.\"));\n });\n });\n }\n\n throw new RateLimitExceeded({ cause: response });\n } else if (\n status === 500 &&\n responseText?.includes(\"Request too large\")\n ) {\n throw new RequestTooLarge({ cause: response });\n } else {\n throw new UnknownFigmaApiException({\n cause: response,\n });\n }\n }\n\n return response;\n }\n\n async #get<T>(url: string): Promise<T> {\n const nextOptions = deepcopy(this.#nextOptions);\n this.#nextOptions = deepcopy(this.#defaultOptions);\n\n const request = async () => {\n const response = await this.#fetch(`${this.#baseAddress}${url}`, {\n method: \"GET\",\n headers: this.getHeaders(nextOptions.token),\n signal: nextOptions.abortSignal,\n });\n\n return response;\n };\n\n try {\n const response = await this.#doRequest(nextOptions, request);\n\n const responseData = (await response.json()) as T;\n return responseData;\n } catch (error) {\n if (\n nextOptions.onForbidden &&\n (error instanceof NeedsReauthFigmaToken \|\|\n error instanceof ExpiredFigmaToken \|\|\n error instanceof FileNotExportable \|\|\n error instanceof UnknownForbiddenFigmaError)\n ) {\n const shouldRetry = await nextOptions.onForbidden(error);\n\n if (shouldRetry) {\n nextOptions.token = shouldRetry.retry.newToken;\n\n const response = await this.#doRequest(nextOptions, request);\n const responseData = (await response.json()) as T;\n\n return responseData;\n }\n }\n\n throw error;\n }\n }\n\n async getFile({\n fileKey,\n nodeIds = [],\n depth,\n }: {\n fileKey: string;\n nodeIds?: string[];\n depth?: number;\n }) {\n const urlSearchParams = new URLSearchParams({\n plugin_data: \"857346721138427857\",\n geometry: \"paths\",\n });\n\n if (nodeIds.length > 0) {\n urlSearchParams.append(\"ids\", nodeIds.join(\",\"));\n }\n\n if (depth) {\n urlSearchParams.append(\"depth\", `${depth}`);\n }\n\n const searchQuery = urlSearchParams.toString();\n\n const url = `v1/files/${fileKey}?${searchQuery}`;\n const response = await this.#get<GetFileResponse>(url);\n\n return response;\n }\n\n async getNodeImages<As extends \"links\" \| \"arrayBuffer\" = \"arrayBuffer\">({\n fileKey,\n nodeIds,\n scale = 1,\n as = \"arrayBuffer\" as As,\n format = \"jpg\",\n }: {\n fileKey: string;\n nodeIds: string[];\n scale?: number;\n as?: As;\n format?: \"jpg\" \| \"png\" \| \"svg\" \| \"pdf\";\n }): Promise<\n As extends \"arrayBuffer\"\n ? Record<string, ArrayBuffer \| null>\n : Record<string, string \| null>\n > {\n const rawResponse = await this.#get<GetImagesResponse>(\n `v1/images/${fileKey}?ids=${nodeIds}&format=${format}&scale=${scale}`\n );\n\n const images = rawResponse.images;\n\n if (as === \"links\") {\n return images as As extends \"arrayBuffer\"\n ? Record<string, ArrayBuffer \| null>\n : Record<string, string \| null>;\n }\n\n const downloadImagePromises = nodeIds.map(async (nodeId) => {\n const imageUrl = images[nodeId];\n if (!imageUrl) {\n return null;\n }\n\n const fetchResponse = await this.#fetch(imageUrl);\n\n if (!fetchResponse.ok) {\n return null;\n }\n\n const imageBlob = await fetchResponse.arrayBuffer();\n return imageBlob;\n });\n\n const downloadedImages = await Promise.allSettled(downloadImagePromises);\n\n const result = nodeIds.reduce(\n (acc, nodeId, index) => {\n const settledResult = downloadedImages[index];\n if (settledResult.status === \"fulfilled\") {\n acc[nodeId] = settledResult.value;\n } else {\n acc[nodeId] = null;\n }\n return acc;\n },\n {} as Record<string, ArrayBuffer \| null>\n );\n\n return result as As extends \"arrayBuffer\"\n ? Record<string, ArrayBuffer \| null>\n : Record<string, string \| null>;\n }\n\n async getImageFills({\n fileKey,\n }: {\n fileKey: string;\n }): Promise<Record<string, string>> {\n const url = `v1/files/${fileKey}/images`;\n const response = await this.#get<GetImageFillsResponse>(url);\n return response.meta?.images ?? {};\n }\n\n async getMe() {\n const url = `v1/me`;\n const response = await this.#get<GetMeResponse>(url);\n return response;\n }\n}\n\nexport { FigmaRestApi };\n","/* eslint-disable @typescript-eslint/no-explicit-any /\nimport { GetFileResponse } from \"@figma/rest-api-spec\";\nimport { gzip } from \"pako\";\nimport { CodegenError, CodegenRouteErrorReason } from \"./errors\";\nimport { validateSettings } from \"./settings\";\nimport {\n AnimaSDKResult,\n AttachToGenerationJobParams,\n GetCodeFromWebsiteHandler,\n GetCodeFromWebsiteParams,\n GetCodeFromPromptHandler,\n GetCodeFromPromptParams,\n GetCodeHandler,\n GetCodeParams,\n GetLink2CodeParams,\n SSEGetCodeFromWebsiteMessage,\n SSEGetCodeFromPromptMessage,\n SSEGetCodeFromFigmaMessage,\n JobType,\n} from \"./types\";\nimport { isNodeCodegenCompatible } from \"./utils/isNodeCodegenCompatible\";\nimport { FigmaRestApi } from \"./FigmaRestApi\";\n\nconst JOB_TYPE_CONVERSION_MAP: Record<string, JobType> = {\n codegen: \"f2c\",\n l2c: \"l2c\",\n p2c: \"p2c\",\n};\n\nexport type Auth =\n \| { token: string; teamId: string } // for Anima user, it's mandatory to have an associated team\n \| { token: string; userId?: string }; // for users from a 3rd-party integrations, they may have optionally a user id\n\nexport class Anima {\n #auth?: Auth;\n #apiBaseAddress: string;\n #figmaRestApi: FigmaRestApi;\n\n constructor({\n auth,\n apiBaseAddress = \"https://public-api.animaapp.com\",\n figmaRestApi = new FigmaRestApi(),\n }: {\n auth?: Auth;\n apiBaseAddress?: string;\n path?: string;\n figmaRestApi?: FigmaRestApi;\n } = {}) {\n this.#apiBaseAddress = apiBaseAddress;\n this.#figmaRestApi = figmaRestApi;\n\n if (auth) {\n this.auth = auth;\n }\n }\n\n protected hasAuth() {\n return !!this.#auth;\n }\n\n set auth(auth: Auth) {\n this.#auth = auth;\n }\n\n protected get headers() {\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n };\n\n if (this.#auth) {\n headers[\"Authorization\"] = `Bearer ${this.#auth.token}`;\n\n if (\"teamId\" in this.#auth) {\n headers[\"X-Team-Id\"] = this.#auth.teamId;\n }\n }\n\n return headers;\n }\n\n async #checkGivenNodeIsValid(\n design: GetFileResponse,\n nodesId: string[],\n options: {\n allowAutoSelectFirstNode: boolean;\n }\n ) {\n const isCompatibleResults = nodesId.map((nodeId) =>\n isNodeCodegenCompatible(design, nodeId, options)\n );\n\n const error = isCompatibleResults.find(\n (isCompatible) => !isCompatible.isValid\n );\n\n if (error) {\n throw new CodegenError({\n name: \"Task Crashed\",\n reason: error.reason,\n });\n }\n }\n\n /\n Generic method to handle API requests and stream processing for code generation flows.\n \n @param endpoint - The API endpoint to call\n * @param requestJson - The JSON to send\n * @param handler - The handler for processing messages\n * @param messageType - The type of messages being processed (for TypeScript type safety)\n * @returns The result of the generation process\n /\n async #processGenerationRequest<\n T extends\n \| SSEGetCodeFromFigmaMessage\n \| SSEGetCodeFromWebsiteMessage\n \| SSEGetCodeFromPromptMessage,\n >(\n method: \"GET\" \| \"POST\",\n endpoint: string,\n requestJson: object,\n handler: ((message: T) => void) \| Record<string, any>,\n messageType?: \"codegen\" \| \"l2c\" \| \"p2c\",\n signal?: AbortSignal\n ): Promise<AnimaSDKResult> {\n if (this.hasAuth() === false) {\n throw new Error('It needs to set \"auth\" before calling this method.');\n }\n\n const result: Partial<AnimaSDKResult> = {};\n const init: RequestInit = {\n method,\n headers: {\n ...this.headers,\n Accept: \"text/event-stream\",\n },\n signal,\n };\n if (method === \"POST\") {\n const requestBody = gzip(JSON.stringify(requestJson));\n init.body = requestBody;\n init.headers = {\n ...(init.headers as HeadersInit),\n \"Content-Encoding\": \"gzip\",\n \"Content-Type\": \"application/json\",\n };\n }\n\n const response = await fetch(`${this.#apiBaseAddress}${endpoint}`, init);\n\n if (!response.ok) {\n const errorText = await response.text();\n\n let errorObj = undefined;\n try {\n errorObj = JSON.parse(errorText);\n } catch {}\n\n if (errorObj?.error?.name === \"ZodError\") {\n console.log(\n \"Zod validation error:\",\n JSON.stringify(errorObj.error.issues, null, 2)\n );\n throw new CodegenError({\n name: \"HTTP error from Anima API\",\n reason: \"Invalid body payload\",\n detail: errorObj.error.issues,\n status: response.status,\n });\n }\n\n if (typeof errorObj === \"object\") {\n throw new CodegenError({\n name: `Error \"${errorObj}\"`,\n reason: \"Unknown\",\n status: response.status,\n });\n }\n\n throw new CodegenError({\n name: \"HTTP error from Anima API\",\n reason: errorText as CodegenRouteErrorReason,\n status: response.status,\n });\n }\n\n if (!response.body) {\n throw new CodegenError({\n name: \"Stream Error\",\n reason: \"Response body is null\",\n status: response.status,\n });\n }\n\n const rawJobType = response.headers.get(\"x-anima-job-type\");\n const jobType = rawJobType && JOB_TYPE_CONVERSION_MAP[rawJobType];\n if (jobType && typeof handler === \"function\") {\n handler({ type: \"set_job_type\", payload: { jobType } } as T);\n }\n\n const reader = response.body.getReader();\n const decoder = new TextDecoder();\n let buffer = \"\";\n\n try {\n while (true) {\n const { done, value } = await reader.read();\n if (done) {\n break;\n }\n\n buffer += decoder.decode(value, { stream: true });\n\n const lines = buffer.split(\"\\n\");\n\n // Process all complete lines\n buffer = lines.pop() \|\| \"\"; // Keep the last incomplete line in the buffer\n\n for (const line of lines) {\n if (!line.trim() \|\| line.startsWith(\":\")) continue;\n\n if (line.startsWith(\"data: \")) {\n let data: T;\n try {\n data = JSON.parse(line.slice(6));\n } catch {\n // ignore malformed JSON\n continue;\n }\n\n switch (data.type) {\n case \"queueing\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onQueueing?.({\n sessionId: (data as any).sessionId,\n });\n break;\n }\n case \"start\": {\n result.sessionId = (data as any).sessionId;\n typeof handler === \"function\"\n ? handler(data)\n : handler.onStart?.({ sessionId: (data as any).sessionId });\n break;\n }\n\n case \"pre_codegen\": {\n if (messageType === \"codegen\") {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onPreCodegen?.({\n message: (data as any).message,\n });\n }\n break;\n }\n\n case \"assets_uploaded\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onAssetsUploaded?.();\n break;\n }\n\n case \"assets_list\": {\n result.assets = (data as any).payload.assets;\n\n typeof handler === \"function\"\n ? handler(data)\n : handler.onAssetsList?.((data as any).payload);\n break;\n }\n\n case \"figma_metadata\": {\n if (messageType === \"codegen\") {\n result.figmaFileName = (data as any).figmaFileName;\n result.figmaSelectedFrameName = (\n data as any\n ).figmaSelectedFrameName;\n\n typeof handler === \"function\"\n ? handler(data)\n : handler.onFigmaMetadata?.({\n figmaFileName: (data as any).figmaFileName,\n figmaSelectedFrameName: (data as any)\n .figmaSelectedFrameName,\n });\n }\n break;\n }\n\n case \"generating_code\": {\n if ((data as any).payload.status === \"success\") {\n result.files = (data as any).payload.files;\n }\n\n typeof handler === \"function\"\n ? handler(data)\n : handler.onGeneratingCode?.({\n status: (data as any).payload.status,\n progress: (data as any).payload.progress,\n files: (data as any).payload.files,\n });\n break;\n }\n\n case \"progress_messages_updated\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onProgressMessagesUpdated?.(\n data.payload.progressMessages\n );\n break;\n }\n\n case \"job_status_updated\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onJobStatusUpdated?.(data.payload.jobStatus);\n break;\n }\n\n case \"codegen_completed\":\n case \"generation_completed\": {\n typeof handler === \"function\"\n ? handler(data)\n : handler.onCodegenCompleted?.();\n break;\n }\n\n case \"error\": {\n throw new CodegenError({\n name: (data as any).payload.errorName,\n reason: (data as any).payload.reason,\n });\n }\n\n case \"done\": {\n result.tokenUsage = (data as any).payload.tokenUsage;\n result.sessionId = (data as any).payload.sessionId;\n return result as AnimaSDKResult;\n }\n }\n }\n }\n }\n } finally {\n reader.cancel();\n }\n\n throw new CodegenError({\n name: \"Connection\",\n reason: \"Connection closed before the 'done' message\",\n status: 500,\n });\n }\n\n async generateCode(\n params: GetCodeParams,\n handler: GetCodeHandler = {},\n signal?: AbortSignal\n ) {\n let design: GetFileResponse \| undefined;\n try {\n design = await this.#figmaRestApi\n .withOptions({ token: params.figmaToken, abortSignal: signal })\n .getFile({\n fileKey: params.fileKey,\n });\n } catch (error) {\n if (error instanceof Error && error.name === \"AbortError\") {\n // The caller aborted the request, no need to fall through\n throw error;\n }\n\n // ignore any errors when trying to get the figma file to retry later in the backend\n }\n\n const settings = validateSettings(params.settings);\n\n if (design) {\n await this.#checkGivenNodeIsValid(design, params.nodesId, {\n allowAutoSelectFirstNode: settings.allowAutoSelectFirstNode ?? true,\n });\n }\n\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n const requestJson = {\n tracking,\n fileKey: params.fileKey,\n figmaToken: params.figmaToken,\n nodesId: params.nodesId,\n figmaRateLimitMaxWait: params.figmaRateLimitMaxWait,\n assetsStorage: params.assetsStorage,\n language: settings.language,\n model: settings.model,\n framework: settings.framework,\n styling: settings.styling,\n uiLibrary: settings.uiLibrary,\n enableTranslation: settings.enableTranslation,\n enableUILibraryTheming: settings.enableUILibraryTheming,\n enableCompactStructure: settings.enableCompactStructure,\n enableAutoSplit: settings.enableAutoSplit,\n autoSplitThreshold: settings.autoSplitThreshold,\n disableMarkedForExport: settings.disableMarkedForExport,\n allowAutoSelectFirstNode: settings.allowAutoSelectFirstNode,\n enableDisplayScreenModelId: settings.enableDisplayScreenModelId,\n enableGeneratePackageLock: settings.enableGeneratePackageLock,\n enableAnimationsPreset: settings.enableAnimationsPreset,\n enableDisplayDataId: settings.enableDisplayDataId,\n enableDisplayDataName: settings.enableDisplayDataName,\n enableDisplayDataVariant: settings.enableDisplayDataVariant,\n codegenSettings: settings.codegenSettings,\n dsId: settings.designSystemId,\n webhookUrl: params.webhookUrl,\n prompt: params.prompt,\n images: params.images,\n // @ts-expect-error: We don't need to expose this parameter to GetCodeParams\n createSession: params.createSession,\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromFigmaMessage>(\n \"POST\",\n \"/v1/codegen\",\n requestJson,\n handler,\n \"codegen\",\n signal\n );\n }\n\n async generateCodeFromWebsite(\n params: GetCodeFromWebsiteParams,\n handler: GetCodeFromWebsiteHandler = {},\n signal?: AbortSignal\n ) {\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n let input;\n if (params.mhtmlUrl) {\n input = {\n type: \"hosted-mhtml\",\n mhtmlUrl: params.mhtmlUrl,\n url: params.url,\n };\n } else if (params.mhtml) {\n input = {\n type: \"mhtml\",\n mhtml: params.mhtml,\n url: params.url,\n };\n } else if (params.url) {\n input = {\n type: \"url\",\n url: params.url,\n };\n } else {\n throw new Error(\"Either 'url', 'mhtml' or 'mhtmlUrl' must be provided\");\n }\n\n let engine: \"react-v2\" \| undefined = undefined;\n if (params.experimental_useNewReactEngine) {\n engine = \"react-v2\";\n }\n\n const requestJson = {\n tracking,\n assetsStorage: params.assetsStorage,\n prompt: params.prompt,\n images: params.images,\n dsId: params.dsId,\n params: {\n input,\n conventions: {\n framework: params.settings.framework,\n language: params.settings.language,\n styling: params.settings.styling,\n },\n assetsStorage: {\n type: \"bundled\",\n },\n engine,\n },\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromWebsiteMessage>(\n \"POST\",\n \"/v1/l2c\",\n requestJson,\n handler,\n \"l2c\",\n signal\n );\n }\n\n /\n Generates code from a text prompt using AI.\n \n This method sends a prompt to the Anima API and generates code based on the description provided.\n * It supports real-time streaming of the generation process through Server-Sent Events (SSE).\n \n @param params - The parameters for code generation\n * @param params.prompt - The text prompt describing what code to generate\n * @param params.settings - Code generation settings (framework, language, styling, etc.)\n * @param params.assetsStorage - Optional asset storage configuration\n * @param params.tracking - Optional tracking information\n * @param params.webhookUrl - Optional webhook URL for completion notification\n * @param handler - Event handler for processing SSE messages during generation\n * @param signal - Optional AbortSignal to cancel the request\n * @returns Promise resolving to AnimaSDKResult with generated files and metadata\n \n @example\n * ```typescript\n * const result = await anima.generateCodeFromPrompt({\n * prompt: \"Create a login form with email and password fields\",\n * settings: {\n * framework: \"react\",\n * language: \"typescript\",\n * styling: \"tailwind\"\n * }\n * }, {\n * onStart: ({ sessionId }) => console.log(\"Started:\", sessionId),\n * onGeneratingCode: ({ progress }) => console.log(\"Progress:\", progress),\n * onCodegenCompleted: () => console.log(\"Generation completed!\")\n * });\n * ```\n /\n async generateCodeFromPrompt(\n params: GetCodeFromPromptParams,\n handler: GetCodeFromPromptHandler = {},\n signal?: AbortSignal\n ) {\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n const requestJson = {\n tracking,\n assetsStorage: params.assetsStorage,\n params: {\n prompt: params.prompt,\n guidelines: params.guidelines,\n images: params.images,\n conventions: {\n language: params.settings.language,\n framework: params.settings.framework,\n styling: params.settings.styling,\n uiLibrary: params.settings.uiLibrary,\n },\n dsId: params.settings.dsId,\n ...(params.settings.codegenSettings ?? {}),\n },\n webhookUrl: params.webhookUrl,\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromPromptMessage>(\n \"POST\",\n \"/v1/p2c\",\n requestJson,\n handler,\n \"p2c\",\n signal\n );\n }\n\n /\n @deprecated This method will be removed soon, please use `generateCodeFromWebsite` instead.\n /\n async generateLink2Code(\n params: GetLink2CodeParams,\n handler: GetCodeFromWebsiteHandler = {},\n signal?: AbortSignal\n ) {\n let tracking = params.tracking;\n if (this.#auth && \"userId\" in this.#auth && this.#auth.userId) {\n if (!tracking?.externalId) {\n tracking = { externalId: this.#auth.userId };\n }\n }\n\n const requestJson = {\n tracking,\n assetsStorage: params.assetsStorage,\n params: params.params,\n };\n\n return this.#processGenerationRequest<SSEGetCodeFromWebsiteMessage>(\n \"POST\",\n \"/v1/l2c\",\n requestJson,\n handler,\n \"l2c\",\n signal\n );\n }\n\n async attachToGenerationJob<\n T extends\n \| SSEGetCodeFromFigmaMessage\n \| SSEGetCodeFromWebsiteMessage\n \| SSEGetCodeFromPromptMessage,\n >(\n params: AttachToGenerationJobParams,\n handler: ((message: T) => void) \| Record<string, any> = {},\n signal?: AbortSignal\n ) {\n const requestJson = {};\n const messageType = undefined;\n return this.#processGenerationRequest<T>(\n \"GET\",\n `/v1/jobs/${params.sessionId}`,\n requestJson,\n handler,\n messageType,\n signal\n );\n }\n}\n","export const isValidFigmaUrl = (\n figmaLink: string\n): [hasCorrectPrefix: boolean, fileKey: string, nodeId: string] => {\n if (!figmaLink) {\n return [false, \"\", \"\"];\n }\n\n try {\n const url = new URL(figmaLink);\n const path = url.pathname;\n\n if (\n url.origin !== \"https://www.figma.com\" &&\n url.origin !== \"https://embed.figma.com\"\n ) {\n return [false, \"\", \"\"];\n }\n\n const reconstructedUrl = url.toString();\n if (figmaLink !== reconstructedUrl) {\n return [false, \"\", \"\"];\n }\n\n const nodeId = (url.searchParams.get(\"node-id\") ?? \"\").replace(/-/g, \":\");\n const fileKey = path.split(\"/\")[2];\n const hasCorrectPrefix =\n (path.startsWith(\"/file/\") &&\n url.searchParams.get(\"type\") !== \"whiteboard\") \|\|\n path.startsWith(\"/design/\") \|\|\n path.startsWith(\"/proto/\");\n\n return [hasCorrectPrefix && fileKey.length === 22, fileKey, nodeId];\n } catch {\n return [false, \"\", \"\"];\n }\n};\n\nexport const formatToFigmaLink = ({\n fileKey,\n nodeId,\n duplicate,\n}: {\n fileKey: string;\n nodeId?: string;\n duplicate?: boolean;\n}) => {\n const url = new URL(\"https://www.figma.com\");\n url.pathname = `design/${fileKey}`;\n\n if (duplicate) {\n // The path to duplicate a file is `/design/{fileKey}/{fileName}/duplicate`.\n // The `fileName` is not used, so we can use a dummy value.\n url.pathname = `${url.pathname}/dummy/duplicate`;\n }\n\n if (nodeId) {\n url.searchParams.set(\"node-id\", nodeId.replace(\":\", \"-\"));\n }\n\n return url;\n};\n\nexport class ResponseError extends Error {\n response: Response;\n\n constructor(message: string, res: Response) {\n super(message);\n this.response = res;\n }\n}\n","import { AnimaFiles } from \"../types\";\n\nexport const getRelatedScreenFiles = ({\n files,\n screenPath = \"src/screens\",\n}: {\n files: AnimaFiles;\n screenPath?: string;\n}) => {\n const result: AnimaFiles = {};\n const processed = new Set<string>();\n\n function processFile(filePath: string) {\n if (processed.has(filePath) \|\| !files[filePath]) {\n return;\n }\n\n processed.add(filePath);\n result[filePath] = files[filePath];\n\n const imports = parseImports(files[filePath].content);\n\n imports.forEach((importPath) => {\n try {\n const resolvedPath = resolveImportPath(filePath, importPath);\n\n if (resolvedPath.startsWith(\"src/\")) {\n const importDir = resolvedPath.split(\"/\").slice(0, -1).join(\"/\");\n const dirFiles = getAllFilesInDirectory(files, importDir);\n dirFiles.forEach((file) => {\n if (!processed.has(file)) {\n processFile(file);\n }\n });\n }\n } catch (error) {\n console.warn(\n `Failed to resolve import ${importPath} in ${filePath}:`,\n error\n );\n }\n });\n }\n\n Object.entries(files).forEach(([key, value]) => {\n if (key.startsWith(screenPath)) {\n processFile(key);\n } else if (!key.startsWith(\"src/\")) {\n result[key] = value;\n }\n });\n\n return result;\n};\n\nfunction parseImports(content: string): string[] {\n const importRegex = /import.?[\"']([^\"']+)[\"']/g;\n const exports = /export.from\\s+[\"']([^\"']+)[\"']/g;\n const imports: string[] = [];\n let match;\n\n while ((match = importRegex.exec(content)) !== null) {\n imports.push(match[1]);\n }\n\n while ((match = exports.exec(content)) !== null) {\n imports.push(match[1]);\n }\n\n return [...new Set(imports)];\n}\n\nfunction resolveImportPath(basePath: string, importPath: string): string {\n if (!importPath.startsWith(\".\")) {\n return importPath;\n }\n\n const baseDir = basePath.split(\"/\").slice(0, -1);\n const importParts = importPath.split(\"/\");\n const resolvedParts: string[] = [...baseDir];\n\n for (const part of importParts) {\n if (part === \"..\") {\n resolvedParts.pop();\n } else if (part !== \".\") {\n resolvedParts.push(part);\n }\n }\n\n return resolvedParts.join(\"/\");\n}\n\nfunction getAllFilesInDirectory(files: AnimaFiles, dirPath: string): string[] {\n return Object.keys(files).filter((file) => file.startsWith(dirPath));\n}\n","/ eslint-disable @typescript-eslint/no-explicit-any /\nimport type { Anima } from \"./anima\";\nimport type { GetCodeFromFigmaErrorReason } from \"./errors\";\nimport type {\n AttachToGenerationJobParams,\n GetCodeParams,\n GetCodeFromWebsiteParams,\n GetCodeFromPromptParams,\n GetLink2CodeParams,\n SSEGetCodeFromWebsiteMessage,\n SSEGetCodeFromPromptMessage,\n SSEGetCodeFromFigmaMessageErrorPayload,\n SSEGetCodeFromFigmaMessage,\n} from \"./types\";\n\ntype StreamErrorPayload = {\n name: string;\n message: GetCodeFromFigmaErrorReason;\n status?: number;\n detail?: unknown;\n errorPayload?: SSEGetCodeFromFigmaMessageErrorPayload;\n};\n\nexport type StreamMessage<T> =\n \| Exclude<T, { type: \"error\" }>\n \| {\n type: \"error\";\n payload: StreamErrorPayload;\n };\n\nexport type StreamCodgenMessage = StreamMessage<SSEGetCodeFromFigmaMessage>;\nexport type StreamCodeFromWebsiteMessage =\n StreamMessage<SSEGetCodeFromWebsiteMessage>;\nexport type StreamCodeFromPromptMessage =\n StreamMessage<SSEGetCodeFromPromptMessage>;\nexport type StreamL2CMessage = StreamMessage<SSEGetCodeFromWebsiteMessage>;\n\n/\n Generic function to create a stream for both codegen and link2code.\n \n @param anima - An Anima service instance\n * @param params - Parameters for the generation process\n * @param generateMethod - The method to call on the Anima instance\n * @returns A ReadableStream that emits messages related to the generation process\n /\nfunction createGenerationStream<\n TParams,\n TMessage,\n TStreamMessage extends StreamMessage<TMessage>,\n>(\n anima: Anima,\n params: TParams,\n generateMethod: (\n params: TParams,\n handler: (message: TMessage) => void\n ) => Promise<any>\n): ReadableStream<TStreamMessage> {\n return new ReadableStream({\n start(controller) {\n generateMethod\n .call(anima, params, (message: any) => {\n if (message.type === \"error\") {\n // TODO: It's a dead code. It's never reached, since all errors are thrown.\n // controller.enqueue({\n // type: \"error\",\n // payload: { message: message.payload.reason },\n // });\n } else {\n controller.enqueue(message);\n }\n\n if (message.type === \"aborted\" \|\| message.type === \"error\") {\n controller.close();\n }\n })\n .then((_result) => {\n controller.enqueue({\n type: \"done\",\n payload: {\n tokenUsage: _result.tokenUsage,\n sessionId: _result.sessionId,\n },\n } as any);\n controller.close();\n })\n .catch((error) => {\n controller.enqueue({\n type: \"error\",\n payload: {\n name: \"name\" in error ? error.name : \"Unknown error\",\n message: \"message\" in error ? error.message : \"Unknown\",\n status: \"status\" in error ? error.status : undefined,\n detail: \"detail\" in error ? error.detail : undefined,\n errorPayload: \"payload\" in error ? error.payload : undefined,\n },\n } as any);\n controller.close();\n });\n },\n });\n}\n\n/\n Start the code generation and creates a ReadableStream to output its result.\n \n The stream is closed when the codegen ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodgenMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const createCodegenStream = (\n anima: Anima,\n params: GetCodeParams\n): ReadableStream<StreamCodgenMessage> => {\n return createGenerationStream<\n GetCodeParams,\n SSEGetCodeFromFigmaMessage,\n StreamCodgenMessage\n >(anima, params, anima.generateCode);\n};\n\n/\n Generic function to create a Server-Sent Events (SSE) Response from a stream.\n \n @param stream - The stream to convert to an SSE response\n * @returns A promise that resolves to an HTTP response\n /\nasync function createResponseEventStream<\n T extends { type: string; payload?: any },\n>(stream: ReadableStream<T>): Promise<Response> {\n const [verifyStream, consumerStream] = stream.tee();\n const firstMessage = await verifyStream.getReader().read();\n\n if (\n firstMessage.done \|\|\n !firstMessage.value \|\|\n (firstMessage.value.type === \"error\" && firstMessage.value.payload?.status)\n ) {\n return new Response(JSON.stringify(firstMessage.value), {\n status:\n firstMessage.value?.type === \"error\"\n ? (firstMessage.value.payload?.status ?? 500)\n : 500,\n headers: {\n \"Content-Type\": \"application/json\",\n },\n });\n }\n\n const encoder = new TextEncoder();\n const seeStream = consumerStream.pipeThrough(\n new TransformStream({\n transform(chunk, controller) {\n const sseString = `event: ${chunk.type}\\ndata: ${JSON.stringify(\n chunk\n )}\\n\\n`;\n controller.enqueue(encoder.encode(sseString));\n },\n })\n );\n\n return new Response(seeStream, {\n status: 200,\n headers: {\n \"Content-Type\": \"text/event-stream; charset=utf-8\",\n Connection: \"keep-alive\",\n \"Cache-Control\": \"no-cache\",\n },\n });\n}\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const createCodegenResponseEventStream = async (\n anima: Anima,\n params: GetCodeParams\n): Promise<Response> => {\n const stream = createCodegenStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n Start the code generation from website and creates a ReadableStream to output its result.\n \n The stream is closed when the code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeFromWebsiteParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodeFromWebsiteMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const createCodeFromWebsiteStream = (\n anima: Anima,\n params: GetCodeFromWebsiteParams\n): ReadableStream<StreamCodeFromWebsiteMessage> => {\n return createGenerationStream<\n GetCodeFromWebsiteParams,\n SSEGetCodeFromWebsiteMessage,\n StreamCodeFromWebsiteMessage\n >(anima, params, anima.generateCodeFromWebsite);\n};\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation from website stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeFromWebsiteParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const createCodeFromWebsiteResponseEventStream = async (\n anima: Anima,\n params: GetCodeFromWebsiteParams\n): Promise<Response> => {\n const stream = createCodeFromWebsiteStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n Prompt to Code (p2c) stream flow.\n \n Start the prompt to code generation and creates a ReadableStream to output its result.\n \n The stream is closed when the code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeFromPromptParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodeFromPromptMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const createCodeFromPromptStream = (\n anima: Anima,\n params: GetCodeFromPromptParams\n): ReadableStream<StreamCodeFromPromptMessage> => {\n return createGenerationStream<\n GetCodeFromPromptParams,\n SSEGetCodeFromPromptMessage,\n StreamCodeFromPromptMessage\n >(anima, params, anima.generateCodeFromPrompt);\n};\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation from prompt stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeFromPromptParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const createCodeFromPromptResponseEventStream = async (\n anima: Anima,\n params: GetCodeFromPromptParams\n): Promise<Response> => {\n const stream = createCodeFromPromptStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n Creates a ReadableStream to output code generation result.\n \n The stream is closed when the code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetCodeFromPromptParams} params - Parameters required for the code generation process.\n * @returns {ReadableStream<StreamCodeFromPromptMessage>} - A ReadableStream that emits messages related to the code generation process.\n /\nexport const attachToGenerationJobStream = (\n anima: Anima,\n params: AttachToGenerationJobParams\n): ReadableStream<\n \| StreamCodgenMessage\n \| StreamCodeFromWebsiteMessage\n \| StreamCodeFromPromptMessage\n> => {\n return createGenerationStream<\n AttachToGenerationJobParams,\n \| SSEGetCodeFromFigmaMessage\n \| SSEGetCodeFromWebsiteMessage\n \| SSEGetCodeFromPromptMessage,\n \| StreamCodgenMessage\n \| StreamCodeFromWebsiteMessage\n \| StreamCodeFromPromptMessage\n >(anima, params, anima.attachToGenerationJob);\n};\n\n/\n Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the code generation stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetCodeFromPromptParams} params - The parameters for the code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n /\nexport const attachToGenerationJobResponseEventStream = async (\n anima: Anima,\n params: AttachToGenerationJobParams\n): Promise<Response> => {\n const stream = attachToGenerationJobStream(anima, params);\n return createResponseEventStream(stream);\n};\n\n/\n @deprecated This function will be removed soon, please use `createCodeFromWebsiteStream` instead.\n * @experimental\n * This API is experimental and may change or be removed in future releases.\n * Link2Code (l2c) stream flow.\n \n Start the URL to code generation and creates a ReadableStream to output its result.\n \n The stream is closed when the URL to code generation ends.\n \n @param {Anima} anima - An Anima service instance to generate the code from.\n * @param {GetLink2CodeParams} params - Parameters required for the URL to code generation process.\n * @returns {ReadableStream<StreamL2CMessage>} - A ReadableStream that emits messages related to the URL to code generation process.\n /\nexport const createLink2CodeStream = (\n anima: Anima,\n params: GetLink2CodeParams\n): ReadableStream<StreamL2CMessage> => {\n return createGenerationStream<\n GetLink2CodeParams,\n SSEGetCodeFromWebsiteMessage,\n StreamL2CMessage\n >(anima, params, anima.generateLink2Code);\n};\n\n/\n @deprecated This function will be removed soon, please use `createCodeFromWebsiteResponseEventStream` instead.\n * Creates a Server-Sent Events (SSE) `Response` that forwards all messages from the URL to code generation stream.\n \n But, if the first message indicates an error (e.g., connection failed), the function returns a 500 response with the error message.\n \n @param {Anima} anima - The Anima instance to use for creating the data stream.\n * @param {GetLink2CodeParams} params - The parameters for the URL to code generation request.\n * @returns {Promise<Response>} - A promise that resolves to an HTTP response.\n */\nexport const createLink2CodeResponseEventStream = async (\n anima: Anima,\n params: GetLink2CodeParams\n): Promise<Response> => {\n const stream = createLink2CodeStream(anima, params);\n return createResponseEventStream(stream);\n};\n"],"names":["Z_FIXED$1","Z_BINARY","Z_TEXT","Z_UNKNOWN$1","zero$1","buf","len","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH$1","MAX_MATCH$1","LENGTH_CODES$1","LITERALS$1","L_CODES$1","D_CODES$1","BL_CODES$1","HEAP_SIZE$1","MAX_BITS$1","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","d_code","dist","put_short","s","w","send_bits","value","length","send_code","c","tree","bi_reverse","code","res","bi_flush","gen_bitlen","desc","max_code","stree","has_stree","extra","base","h","n","m","bits","xbits","f","overflow","gen_codes","bl_count","next_code","tr_static_init","init_block","bi_windup","smaller","depth","_n2","_m2","pqdownheap","k","v","j","compress_block","ltree","dtree","lc","sx","build_tree","node","scan_tree","prevlen","curlen","nextlen","count","max_count","min_count","send_tree","build_bl_tree","max_blindex","send_all_trees","lcodes","dcodes","blcodes","rank","detect_data_type","block_mask","static_init_done","_tr_init$1","_tr_stored_block$1","stored_len","last","_tr_align$1","_tr_flush_block$1","opt_lenb","static_lenb","_tr_tally$1","_tr_init_1","_tr_stored_block_1","_tr_flush_block_1","_tr_tally_1","_tr_align_1","trees","adler32","adler","pos","s1","s2","adler32_1","makeTable","table","crcTable","crc32","crc","t","end","i","crc32_1","messages","constants$2","_tr_init","_tr_stored_block","_tr_flush_block","_tr_tally","_tr_align","Z_NO_FLUSH$2","Z_PARTIAL_FLUSH","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY$1","Z_UNKNOWN","Z_DEFLATED$2","MAX_MEM_LEVEL","MAX_WBITS$1","DEF_MEM_LEVEL","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","MIN_MATCH","MAX_MATCH","MIN_LOOKAHEAD","PRESET_DICT","INIT_STATE","GZIP_STATE","EXTRA_STATE","NAME_STATE","COMMENT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","OS_CODE","err","strm","errorCode","zero","slide_hash","p","wsize","HASH_ZLIB","prev","data","HASH","flush_pending","flush_block_only","put_byte","b","putShortMSB","read_buf","start","size","longest_match","cur_match","chain_length","scan","match","best_len","nice_match","limit","_win","wmask","strend","scan_end1","scan_end","fill_window","_w_size","more","str","deflate_stored","flush","min_block","left","have","used","deflate_fast","hash_head","bflush","deflate_slow","max_insert","deflate_rle","deflate_huff","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","lm_init","DeflateState","deflateStateCheck","deflateResetKeep","deflateReset","ret","deflateSetHeader","head","deflateInit2","level","method","windowBits","memLevel","strategy","wrap","deflateInit","deflate$2","old_flush","header","level_flags","beg","copy","gzhead_extra","val","bstate","deflateEnd","status","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","next","input","deflateInit_1","deflateInit2_1","deflateReset_1","deflateResetKeep_1","deflateSetHeader_1","deflate_2$1","deflateEnd_1","deflateSetDictionary_1","deflateInfo","deflate_1$2","_has","obj","key","assign","sources","source","flattenChunks","chunks","l","result","chunk","common","STR_APPLY_UIA_OK","__","_utf8len","q","string2buf","c2","m_pos","str_len","buf_len","buf2binstring","buf2string","max","out","utf16buf","c_len","utf8border","strings","ZStream","zstream","toString$1","Z_NO_FLUSH$1","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFAULT_COMPRESSION","Z_DEFAULT_STRATEGY","Z_DEFLATED$1","Deflate$1","options","opt","dict","flush_mode","chunkSize","_flush_mode","deflate$1","deflator","gzip$1","gzip_1$1","deflate_1$1","gzip","gzip_1","CodegenError","name","reason","detail","MalformattedFigmaToken","MissingFigmaToken","NeedsReauthFigmaToken","ExpiredFigmaToken","FileNotExportable","UnknownForbiddenFigmaError","notFoundErrorMessage","NotFound","cause","isNotFound","error","unknownFigmaApiExceptionMessage","UnknownFigmaApiException","isUnknownFigmaApiException","rateLimitExceededErrorMessage","RateLimitExceeded","isRateLimitExceeded","requestTooLargeMessage","RequestTooLarge","isRequestTooLarge","$constructor","initializer","params","init","inst","def","_","proto","keys","Parent","_a","Definition","fn","_b","$ZodAsyncError","$ZodEncodeError","globalConfig","config","newConfig","getEnumValues","entries","numericValues","jsonStringifyReplacer","cached","getter","nullish","cleanRegex","floatSafeRemainder","step","valDecCount","stepString","stepDecCount","decCount","valInt","stepInt","__pow","EVALUATING","defineLazy","object","assignProp","target","prop","mergeDefs","defs","mergedDescriptors","descriptors","esc","slugify","captureStackTrace","_args","isObject","allowsEval","F","isPlainObject","o","ctor","prot","shallowClone","__spreadValues","propertyKeyTypes","escapeRegex","clone","cl","normalizeParams","_params","__spreadProps","optionalKeys","shape","NUMBER_FORMAT_RANGES","pick","schema","mask","currDef","checks","newShape","omit","extend","existingShape","_shape","safeExtend","merge","a","partial","Class","oldShape","required","aborted","x","startIndex","prefixIssues","path","issues","iss","unwrapMessage","message","finalizeIssue","ctx","full","_k","_j","_h","_f","_d","_c","_e","_g","_i","getLengthableOrigin","issue","args","util.jsonStringifyReplacer","$ZodError","$ZodRealError","flattenError","mapper","fieldErrors","formErrors","sub","formatError","processError","curr","el","_parse","_Err","_ctx","core.$ZodAsyncError","e","util.finalizeIssue","core.config","util.captureStackTrace","_parseAsync","__async","_safeParse","errors.$ZodError","safeParse","errors.$ZodRealError","_safeParseAsync","safeParseAsync","_encode","_decode","_encodeAsync","_decodeAsync","_safeEncode","_safeDecode","_safeEncodeAsync","_safeDecodeAsync","cuid","cuid2","ulid","xid","ksuid","nanoid","duration","guid","uuid","version","email","_emoji","emoji","ipv4","ipv6","cidrv4","cidrv6","base64","base64url","e164","dateSource","date","timeSource","hhmm","time","datetime","opts","timeRegex","string","regex","integer","number","boolean","lowercase","uppercase","$ZodCheck","core.$constructor","numericOriginMap","$ZodCheckLessThan","origin","bag","payload","$ZodCheckGreaterThan","$ZodCheckMultipleOf","util.floatSafeRemainder","$ZodCheckNumberFormat","isInt","minimum","maximum","util.NUMBER_FORMAT_RANGES","regexes.integer","$ZodCheckMaxLength","util.nullish","util.getLengthableOrigin","$ZodCheckMinLength","$ZodCheckLengthEquals","tooBig","$ZodCheckStringFormat","$ZodCheckRegex","$ZodCheckLowerCase","regexes.lowercase","$ZodCheckUpperCase","regexes.uppercase","$ZodCheckIncludes","escapedRegex","util.escapeRegex","pattern","$ZodCheckStartsWith","$ZodCheckEndsWith","$ZodCheckOverwrite","Doc","arg","lines","minIndent","dedented","line","$ZodType","ch","runChecks","isAborted","util.aborted","asyncResult","currLen","handleCanaryResult","canary","checkResult","util.defineLazy","r","$ZodString","regexes.string","$ZodStringFormat","checks.$ZodCheckStringFormat","$ZodGUID","regexes.guid","$ZodUUID","regexes.uuid","$ZodEmail","regexes.email","$ZodURL","trimmed","url","$ZodEmoji","regexes.emoji","$ZodNanoID","regexes.nanoid","$ZodCUID","regexes.cuid","$ZodCUID2","regexes.cuid2","$ZodULID","regexes.ulid","$ZodXID","regexes.xid","$ZodKSUID","regexes.ksuid","$ZodISODateTime","regexes.datetime","$ZodISODate","regexes.date","$ZodISOTime","regexes.time","$ZodISODuration","regexes.duration","$ZodIPv4","regexes.ipv4","$ZodIPv6","regexes.ipv6","$ZodCIDRv4","regexes.cidrv4","$ZodCIDRv6","regexes.cidrv6","parts","address","prefix","prefixNum","isValidBase64","$ZodBase64","regexes.base64","isValidBase64URL","regexes.base64url","padded","$ZodBase64URL","$ZodE164","regexes.e164","isValidJWT","token","algorithm","tokensParts","parsedHeader","$ZodJWT","$ZodNumber","regexes.number","received","$ZodNumberFormat","checks.$ZodCheckNumberFormat","$ZodBoolean","regexes.boolean","$ZodUnknown","$ZodNever","handleArrayResult","final","index","util.prefixIssues","$ZodArray","proms","item","handlePropertyResult","isOptionalOut","normalizeDef","okeys","util.optionalKeys","handleCatchall","unrecognized","keySet","_catchall","$ZodObject","sh","newSh","_normalized","util.cached","propValues","field","util.isObject","catchall","$ZodObjectJIT","superParse","generateFastpass","doc","normalized","parseStr","util.esc","ids","counter","id","fastpass","jit","core.globalConfig","fastEnabled","util.allowsEval","handleUnionResults","results","nonaborted","$ZodUnion","option","patterns","util.cleanRegex","single","first","async","$ZodIntersection","right","handleIntersectionResults","mergeValues","util.isPlainObject","bKeys","sharedKeys","newObj","sharedValue","newArray","itemA","itemB","unrecKeys","unrecIssue","bothKeys","merged","$ZodRecord","values","recordKeys","keyResult","retryResult","$ZodEnum","util.getEnumValues","valuesSet","util.propertyKeyTypes","$ZodLiteral","$ZodTransform","core.$ZodEncodeError","_out","output","handleOptionalResult","$ZodOptional","$ZodExactOptional","$ZodNullable","$ZodDefault","handleDefaultResult","$ZodPrefault","$ZodNonOptional","handleNonOptionalResult","$ZodCatch","$ZodPipe","handlePipeResult","$ZodReadonly","handleReadonlyResult","$ZodCustom","checks.$ZodCheck","handleRefineResult","_iss","util.issue","$ZodRegistry","_meta","meta","pm","registry","globalRegistry","_string","util.normalizeParams","_email","_guid","_uuid","_uuidv4","_uuidv6","_uuidv7","_url","_nanoid","_cuid","_cuid2","_ulid","_xid","_ksuid","_ipv4","_ipv6","_cidrv4","_cidrv6","_base64","_base64url","_e164","_jwt","_isoDateTime","_isoDate","_isoTime","_isoDuration","_number","_int","_boolean","_unknown","_never","_lt","checks.$ZodCheckLessThan","_lte","_gt","checks.$ZodCheckGreaterThan","_gte","_multipleOf","checks.$ZodCheckMultipleOf","_maxLength","checks.$ZodCheckMaxLength","_minLength","checks.$ZodCheckMinLength","_length","checks.$ZodCheckLengthEquals","_regex","checks.$ZodCheckRegex","_lowercase","checks.$ZodCheckLowerCase","_uppercase","checks.$ZodCheckUpperCase","_includes","includes","checks.$ZodCheckIncludes","_startsWith","checks.$ZodCheckStartsWith","_endsWith","suffix","checks.$ZodCheckEndsWith","_overwrite","tx","checks.$ZodCheckOverwrite","_normalize","form","_trim","_toLowerCase","_toUpperCase","_slugify","util.slugify","_array","element","_refine","_superRefine","_check","_issue","initializeContext","process","seen","overrideSchema","_json","processor","parent","isTransforming","extractDefs","root","idToSchema","entry","existing","makeURI","defsSegment","externalId","uriGenerator","defUriPrefix","defId","extractToDef","ref","ext","finalize","flattenRef","zodSchema","_cached","refSeen","refSchema","parentSeen","finalized","createStandardJSONSchemaMethod","_err","_schema","createToJSONSchemaMethod","processors","io","libraryOptions","formatMap","stringProcessor","json","format","contentEncoding","regexes","numberProcessor","multipleOf","exclusiveMaximum","exclusiveMinimum","booleanProcessor","neverProcessor","unknownProcessor","enumProcessor","literalProcessor","vals","customProcessor","transformProcessor","arrayProcessor","objectProcessor","allKeys","requiredKeys","unionProcessor","isExclusive","intersectionProcessor","isSimpleIntersection","allOf","recordProcessor","keyType","keyBag","valueSchema","keyValues","validKeyValues","nullableProcessor","inner","nonoptionalProcessor","defaultProcessor","prefaultProcessor","catchProcessor","catchValue","pipeProcessor","innerType","readonlyProcessor","optionalProcessor","ZodISODateTime","core.$ZodISODateTime","schemas.ZodStringFormat","core._isoDateTime","ZodISODate","core.$ZodISODate","core._isoDate","ZodISOTime","core.$ZodISOTime","core._isoTime","ZodISODuration","core.$ZodISODuration","core._isoDuration","core.formatError","core.flattenError","ZodRealError","parse","core._parse","parseAsync","core._parseAsync","core._safeParse","core._safeParseAsync","encode","core._encode","decode","core._decode","encodeAsync","core._encodeAsync","decodeAsync","core._decodeAsync","safeEncode","core._safeEncode","safeDecode","core._safeDecode","safeEncodeAsync","core._safeEncodeAsync","safeDecodeAsync","core._safeDecodeAsync","ZodType","core.$ZodType","util.mergeDefs","core.clone","reg","parse.parse","parse.safeParse","parse.parseAsync","parse.safeParseAsync","parse.encode","parse.decode","parse.encodeAsync","parse.decodeAsync","parse.safeEncode","parse.safeDecode","parse.safeEncodeAsync","parse.safeDecodeAsync","check","refine","refinement","superRefine","checks.overwrite","optional","exactOptional","nullable","nonoptional","array","union","intersection","pipe","transform","_default","prefault","_catch","readonly","description","core.globalRegistry","_ZodString","core.$ZodString","processors.stringProcessor","checks.regex","checks.includes","checks.startsWith","checks.endsWith","checks.minLength","checks.maxLength","checks.length","checks.lowercase","checks.uppercase","checks.trim","checks.normalize","checks.toLowerCase","checks.toUpperCase","checks.slugify","ZodString","core._email","ZodEmail","core._url","ZodURL","core._jwt","ZodJWT","core._emoji","ZodEmoji","core._guid","ZodGUID","core._uuid","ZodUUID","core._uuidv4","core._uuidv6","core._uuidv7","core._nanoid","ZodNanoID","core._cuid","ZodCUID","core._cuid2","ZodCUID2","core._ulid","ZodULID","core._base64","ZodBase64","core._base64url","ZodBase64URL","core._xid","ZodXID","core._ksuid","ZodKSUID","core._ipv4","ZodIPv4","core._ipv6","ZodIPv6","core._cidrv4","ZodCIDRv4","core._cidrv6","ZodCIDRv6","core._e164","ZodE164","iso.datetime","iso.date","iso.time","iso.duration","core._string","ZodStringFormat","core.$ZodStringFormat","core.$ZodEmail","core.$ZodGUID","core.$ZodUUID","core.$ZodURL","core.$ZodEmoji","core.$ZodNanoID","core.$ZodCUID","core.$ZodCUID2","core.$ZodULID","core.$ZodXID","core.$ZodKSUID","core.$ZodIPv4","core.$ZodIPv6","core.$ZodCIDRv4","core.$ZodCIDRv6","core.$ZodBase64","core.$ZodBase64URL","core.$ZodE164","core.$ZodJWT","ZodNumber","core.$ZodNumber","processors.numberProcessor","checks.gt","checks.gte","checks.lt","checks.lte","int","checks.multipleOf","core._number","ZodNumberFormat","core.$ZodNumberFormat","core._int","ZodBoolean","core.$ZodBoolean","processors.booleanProcessor","core._boolean","ZodUnknown","core.$ZodUnknown","processors.unknownProcessor","unknown","core._unknown","ZodNever","core.$ZodNever","processors.neverProcessor","never","core._never","ZodArray","core.$ZodArray","processors.arrayProcessor","minLength","maxLength","core._array","ZodObject","core.$ZodObjectJIT","processors.objectProcessor","_enum","incoming","util.extend","util.safeExtend","other","util.merge","util.pick","util.omit","util.partial","ZodOptional","util.required","ZodNonOptional","ZodUnion","core.$ZodUnion","processors.unionProcessor","ZodIntersection","core.$ZodIntersection","processors.intersectionProcessor","ZodRecord","core.$ZodRecord","processors.recordProcessor","record","valueType","ZodEnum","core.$ZodEnum","processors.enumProcessor","newEntries","ZodLiteral","core.$ZodLiteral","processors.literalProcessor","literal","ZodTransform","core.$ZodTransform","processors.transformProcessor","core.$ZodOptional","processors.optionalProcessor","ZodExactOptional","core.$ZodExactOptional","ZodNullable","core.$ZodNullable","processors.nullableProcessor","ZodDefault","core.$ZodDefault","processors.defaultProcessor","defaultValue","util.shallowClone","ZodPrefault","core.$ZodPrefault","processors.prefaultProcessor","core.$ZodNonOptional","processors.nonoptionalProcessor","ZodCatch","core.$ZodCatch","processors.catchProcessor","ZodPipe","core.$ZodPipe","processors.pipeProcessor","in_","ZodReadonly","core.$ZodReadonly","processors.readonlyProcessor","ZodCustom","core.$ZodCustom","processors.customProcessor","core._refine","core._superRefine","CodegenSettingsSchema","z.object","z.enum","z.boolean","z.union","z.literal","z.string","z.array","z.number","z.record","z.unknown","validateSettings","parsedObj","findChildrenNode","targetNodeId","child","found","validNodeTypes","isNodeCodegenCompatible","design","nodeId","validChildrenNodes","global","factory","module","this","promiseExists","globalObject","Obj","symbolExists","mapExists","setExists","weakMapExists","weakSetExists","dataViewExists","symbolIteratorExists","symbolToStringTagExists","setEntriesExists","mapEntriesExists","setIteratorPrototype","mapIteratorPrototype","arrayIteratorExists","arrayIteratorPrototype","stringIteratorExists","stringIteratorPrototype","toStringLeftSliceLength","toStringRightSliceLength","typeDetect","typeofObj","stringTag","objPrototype","isBufferExists","isBufferFromExists","isBuffer","detectType","collectionTypeSet","get","collection","type","isCollection","set","freeGlobalThis","freeGlobal","freeSelf","copyArrayBuffer","copyBoolean","copyDataView","copyBuffer","cloneBuffer","copyDate","copyNumber","copyRegExp","copyString","copyTypedArray","shallowCopy","getEmptyArray","getEmptyMap","getEmptyObject","getEmptySet","copyMap","noop","customizer","copyFunction","deepcopy","recursiveCopy","copiedValue","references","visited","collectionKey","collectionValue","collectionValueType","copiedCollectionValue","FigmaRestApi","fetch","baseAddress","defaultOptions","__privateAdd","_FigmaRestApi_instances","_baseAddress","_fetch","_nextOptions","_defaultOptions","__privateSet","__privateGet","__privateMethod","ensureValidToken_fn","headers","tokenInUse","_0","fileKey","nodeIds","urlSearchParams","searchQuery","get_fn","scale","as","images","downloadImagePromises","imageUrl","fetchResponse","downloadedImages","acc","settledResult","doRequest_fn","request","response","responseText","rawRetryAfter","retryAfter","resolve","reject","timeout","nextOptions","shouldRetry","JOB_TYPE_CONVERSION_MAP","Anima","auth","apiBaseAddress","figmaRestApi","_Anima_instances","_auth","_apiBaseAddress","_figmaRestApi","handler","signal","settings","checkGivenNodeIsValid_fn","tracking","requestJson","processGenerationRequest_fn","engine","nodesId","isCompatible","endpoint","messageType","requestBody","errorText","errorObj","rawJobType","jobType","reader","decoder","buffer","done","isValidFigmaUrl","figmaLink","reconstructedUrl","formatToFigmaLink","duplicate","ResponseError","getRelatedScreenFiles","files","screenPath","processed","processFile","filePath","parseImports","importPath","resolvedPath","resolveImportPath","importDir","getAllFilesInDirectory","file","content","importRegex","exports","imports","basePath","baseDir","importParts","resolvedParts","part","dirPath","createGenerationStream","anima","generateMethod","controller","_result","createCodegenStream","createResponseEventStream","stream","verifyStream","consumerStream","firstMessage","encoder","seeStream","sseString","createCodegenResponseEventStream","createCodeFromWebsiteStream","createCodeFromWebsiteResponseEventStream","createCodeFromPromptStream","createCodeFromPromptResponseEventStream","attachToGenerationJobStream","attachToGenerationJobResponseEventStream","createLink2CodeStream","createLink2CodeResponseEventStream"],"mappings":"mmCACA,wEA6BA,MAAMA,GAA0B,EAI1BC,GAAwB,EACxBC,GAAwB,EAExBC,GAA0B,EAKhC,SAASC,GAAOC,EAAK,CAAE,IAAIC,EAAMD,EAAI,OAAQ,KAAO,EAAEC,GAAO,GAAKD,EAAIC,CAAG,EAAI,CAAK,CAIlF,MAAMC,GAAe,EACfC,GAAe,EACfC,GAAe,EAGfC,GAAiB,EACjBC,GAAiB,IAQjBC,GAAkB,GAGlBC,GAAkB,IAGlBC,GAAkBD,GAAa,EAAID,GAGnCG,GAAkB,GAGlBC,GAAkB,GAGlBC,GAAkB,EAAIH,GAAY,EAGlCI,GAAkB,GAGlBC,GAAgB,GAQhBC,GAAc,EAGdC,GAAc,IAGdC,GAAc,GAGdC,GAAc,GAGdC,GAAc,GAIdC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAEtEC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,EAEhFC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAElDC,GACJ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAa3DC,GAAgB,IAGhBC,GAAgB,IAAI,OAAOhB,GAAY,GAAK,CAAC,EACnDV,GAAO0B,EAAY,EAOnB,MAAMC,GAAgB,IAAI,MAAMhB,GAAY,CAAC,EAC7CX,GAAO2B,EAAY,EAKnB,MAAMC,GAAgB,IAAI,MAAMH,EAAa,EAC7CzB,GAAO4B,EAAU,EAMjB,MAAMC,GAAgB,IAAI,MAAMtB,GAAcD,GAAc,CAAC,EAC7DN,GAAO6B,EAAY,EAGnB,MAAMC,GAAgB,IAAI,MAAMtB,EAAc,EAC9CR,GAAO8B,EAAW,EAGlB,MAAMC,GAAgB,IAAI,MAAMpB,EAAS,EACzCX,GAAO+B,EAAS,EAIhB,SAASC,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,EAAY,CAE9E,KAAK,YAAeJ,EACpB,KAAK,WAAeC,EACpB,KAAK,WAAeC,EACpB,KAAK,MAAeC,EACpB,KAAK,WAAeC,EAGpB,KAAK,UAAeJ,GAAeA,EAAY,MACjD,CAGA,IAAIK,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,EAAW,CACrC,KAAK,SAAWD,EAChB,KAAK,SAAW,EAChB,KAAK,UAAYC,CACnB,CAIA,MAAMC,GAAUC,GAEPA,EAAO,IAAMjB,GAAWiB,CAAI,EAAIjB,GAAW,KAAOiB,IAAS,EAAE,EAQhEC,GAAY,CAACC,EAAGC,IAAM,CAG1BD,EAAE,YAAYA,EAAE,SAAS,EAAKC,EAAK,IACnCD,EAAE,YAAYA,EAAE,SAAS,EAAKC,IAAM,EAAK,GAC3C,EAOMC,EAAY,CAACF,EAAGG,EAAOC,IAAW,CAElCJ,EAAE,SAAYhC,GAAWoC,GAC3BJ,EAAE,QAAWG,GAASH,EAAE,SAAY,MACpCD,GAAUC,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAASG,GAAUnC,GAAWgC,EAAE,SAClCA,EAAE,UAAYI,EAASpC,KAEvBgC,EAAE,QAAWG,GAASH,EAAE,SAAY,MACpCA,EAAE,UAAYI,EAElB,EAGMC,GAAY,CAACL,EAAGM,EAAGC,IAAS,CAEhCL,EAAUF,EAAGO,EAAKD,EAAI,CAAC,EAAYC,EAAKD,EAAI,EAAI,CAAC,CAAC,CACpD,EAQME,GAAa,CAACC,EAAMtD,IAAQ,CAEhC,IAAIuD,EAAM,EACV,GACEA,GAAOD,EAAO,EACdA,KAAU,EACVC,IAAQ,QACD,EAAEvD,EAAM,GACjB,OAAOuD,IAAQ,CACjB,EAMMC,GAAYX,GAAM,CAElBA,EAAE,WAAa,IACjBD,GAAUC,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAS,EACXA,EAAE,SAAW,GAEJA,EAAE,UAAY,IACvBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,OAAS,IACxCA,EAAE,SAAW,EACbA,EAAE,UAAY,EAElB,EAaMY,GAAa,CAACZ,EAAGa,IAAS,CAI9B,MAAMN,EAAkBM,EAAK,SACvBC,EAAkBD,EAAK,SACvBE,EAAkBF,EAAK,UAAU,YACjCG,EAAkBH,EAAK,UAAU,UACjCI,EAAkBJ,EAAK,UAAU,WACjCK,EAAkBL,EAAK,UAAU,WACjCvB,EAAkBuB,EAAK,UAAU,WACvC,IAAIM,EACAC,EAAGC,EACHC,EACAC,EACAC,EACAC,EAAW,EAEf,IAAKH,EAAO,EAAGA,GAAQvD,GAAYuD,IACjCtB,EAAE,SAASsB,CAAI,EAAI,EAQrB,IAFAf,EAAKP,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAY,EAEtCmB,EAAInB,EAAE,SAAW,EAAGmB,EAAIrD,GAAaqD,IACxCC,EAAIpB,EAAE,KAAKmB,CAAC,EACZG,EAAOf,EAAKA,EAAKa,EAAI,EAAI,CAAC,EAAY,EAAI,CAAC,EAAY,EACnDE,EAAOhC,IACTgC,EAAOhC,EACPmC,KAEFlB,EAAKa,EAAI,EAAI,CAAC,EAAYE,EAGtB,EAAAF,EAAIN,KAERd,EAAE,SAASsB,CAAI,IACfC,EAAQ,EACJH,GAAKF,IACPK,EAAQN,EAAMG,EAAIF,CAAI,GAExBM,EAAIjB,EAAKa,EAAI,CAAC,EACdpB,EAAE,SAAWwB,GAAKF,EAAOC,GACrBP,IACFhB,EAAE,YAAcwB,GAAKT,EAAMK,EAAI,EAAI,CAAC,EAAYG,KAGpD,GAAIE,IAAa,EAMjB,GAAG,CAED,IADAH,EAAOhC,EAAa,EACbU,EAAE,SAASsB,CAAI,IAAM,GAAKA,IACjCtB,EAAE,SAASsB,CAAI,IACftB,EAAE,SAASsB,EAAO,CAAC,GAAK,EACxBtB,EAAE,SAASV,CAAU,IAIrBmC,GAAY,CACd,OAASA,EAAW,GAOpB,IAAKH,EAAOhC,EAAYgC,IAAS,EAAGA,IAElC,IADAF,EAAIpB,EAAE,SAASsB,CAAI,EACZF,IAAM,GACXC,EAAIrB,EAAE,KAAK,EAAEmB,CAAC,EACV,EAAAE,EAAIP,KACJP,EAAKc,EAAI,EAAI,CAAC,IAAcC,IAE9BtB,EAAE,UAAYsB,EAAOf,EAAKc,EAAI,EAAI,CAAC,GAAad,EAAKc,EAAI,CAAC,EAC1Dd,EAAKc,EAAI,EAAI,CAAC,EAAYC,GAE5BF,KAGN,EAWMM,GAAY,CAACnB,EAAMO,EAAUa,IAAa,CAK9C,MAAMC,EAAY,IAAI,MAAM7D,GAAa,CAAC,EAC1C,IAAI0C,EAAO,EACPa,EACAF,EAKJ,IAAKE,EAAO,EAAGA,GAAQvD,GAAYuD,IACjCb,EAAQA,EAAOkB,EAASL,EAAO,CAAC,GAAM,EACtCM,EAAUN,CAAI,EAAIb,EASpB,IAAKW,EAAI,EAAIA,GAAKN,EAAUM,IAAK,CAC/B,IAAIjE,EAAMoD,EAAKa,EAAI,EAAI,CAAC,EACpBjE,IAAQ,IAEZoD,EAAKa,EAAI,CAAC,EAAaZ,GAAWoB,EAAUzE,CAAG,IAAKA,CAAG,EAIzD,CACF,EAMM0E,GAAiB,IAAM,CAE3B,IAAIT,EACAE,EACAlB,EACAK,EACAX,EACJ,MAAM6B,EAAW,IAAI,MAAM5D,GAAa,CAAC,EAiBzC,IADAqC,EAAS,EACJK,EAAO,EAAGA,EAAOhD,GAAiB,EAAGgD,IAExC,IADA1B,GAAY0B,CAAI,EAAIL,EACfgB,EAAI,EAAGA,EAAK,GAAK9C,GAAYmC,CAAI,EAAIW,IACxCtC,GAAasB,GAAQ,EAAIK,EAY7B,IAJA3B,GAAasB,EAAS,CAAC,EAAIK,EAG3BX,EAAO,EACFW,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAzB,GAAUyB,CAAI,EAAIX,EACbsB,EAAI,EAAGA,EAAK,GAAK7C,GAAYkC,CAAI,EAAIW,IACxCvC,GAAWiB,GAAM,EAAIW,EAKzB,IADAX,IAAS,EACFW,EAAO7C,GAAW6C,IAEvB,IADAzB,GAAUyB,CAAI,EAAIX,GAAQ,EACrBsB,EAAI,EAAGA,EAAK,GAAM7C,GAAYkC,CAAI,EAAI,EAAKW,IAC9CvC,GAAW,IAAMiB,GAAM,EAAIW,EAM/B,IAAKa,EAAO,EAAGA,GAAQvD,GAAYuD,IACjCK,EAASL,CAAI,EAAI,EAInB,IADAF,EAAI,EACGA,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IAEZ,KAAOP,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IAEZ,KAAOP,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IAEZ,KAAOP,GAAK,KACVzC,GAAayC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAO,EAAS,CAAC,IASZ,IAHAD,GAAU/C,GAAchB,GAAY,EAAGgE,CAAQ,EAG1CP,EAAI,EAAGA,EAAIxD,GAAWwD,IACzBxC,GAAawC,EAAI,EAAI,CAAC,EAAY,EAClCxC,GAAawC,EAAI,CAAC,EAAaZ,GAAWY,EAAG,CAAC,EAIhD7B,GAAgB,IAAIN,GAAeN,GAAcL,GAAaZ,GAAa,EAAGC,GAAWI,EAAU,EACnGyB,GAAgB,IAAIP,GAAeL,GAAcL,GAAa,EAAYX,GAAWG,EAAU,EAC/F0B,GAAiB,IAAIR,GAAe,IAAI,MAAM,CAAC,EAAGT,GAAc,EAAWX,GAAYI,EAAW,CAGpG,EAMM6D,GAAc9B,GAAM,CAExB,IAAIoB,EAGJ,IAAKA,EAAI,EAAGA,EAAIzD,GAAYyD,IAAOpB,EAAE,UAAUoB,EAAI,CAAC,EAAa,EACjE,IAAKA,EAAI,EAAGA,EAAIxD,GAAYwD,IAAOpB,EAAE,UAAUoB,EAAI,CAAC,EAAa,EACjE,IAAKA,EAAI,EAAGA,EAAIvD,GAAYuD,IAAOpB,EAAE,QAAQoB,EAAI,CAAC,EAAa,EAE/DpB,EAAE,UAAU9B,GAAY,CAAC,EAAa,EACtC8B,EAAE,QAAUA,EAAE,WAAa,EAC3BA,EAAE,SAAWA,EAAE,QAAU,CAC3B,EAMM+B,GAAa/B,GACnB,CACMA,EAAE,SAAW,EACfD,GAAUC,EAAGA,EAAE,MAAM,EACZA,EAAE,SAAW,IAEtBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,QAEjCA,EAAE,OAAS,EACXA,EAAE,SAAW,CACf,EAMMgC,GAAU,CAACzB,EAAMa,EAAGC,EAAGY,IAAU,CAErC,MAAMC,EAAMd,EAAI,EACVe,EAAMd,EAAI,EAChB,OAAQd,EAAK2B,CAAG,EAAa3B,EAAK4B,CAAG,GAC7B5B,EAAK2B,CAAG,IAAe3B,EAAK4B,CAAG,GAAcF,EAAMb,CAAC,GAAKa,EAAMZ,CAAC,CAC1E,EAQMe,GAAa,CAACpC,EAAGO,EAAM8B,IAAM,CAKjC,MAAMC,EAAItC,EAAE,KAAKqC,CAAC,EAClB,IAAIE,EAAIF,GAAK,EACb,KAAOE,GAAKvC,EAAE,WAERuC,EAAIvC,EAAE,UACRgC,GAAQzB,EAAMP,EAAE,KAAKuC,EAAI,CAAC,EAAGvC,EAAE,KAAKuC,CAAC,EAAGvC,EAAE,KAAK,GAC/CuC,IAGE,CAAAP,GAAQzB,EAAM+B,EAAGtC,EAAE,KAAKuC,CAAC,EAAGvC,EAAE,KAAK,IAGvCA,EAAE,KAAKqC,CAAC,EAAIrC,EAAE,KAAKuC,CAAC,EACpBF,EAAIE,EAGJA,IAAM,EAERvC,EAAE,KAAKqC,CAAC,EAAIC,CACd,EASME,GAAiB,CAACxC,EAAGyC,EAAOC,IAAU,CAK1C,IAAI5C,EACA6C,EACAC,EAAK,EACLnC,EACAQ,EAEJ,GAAIjB,EAAE,WAAa,EACjB,GACEF,EAAOE,EAAE,YAAYA,EAAE,QAAU4C,GAAI,EAAI,IACzC9C,IAASE,EAAE,YAAYA,EAAE,QAAU4C,GAAI,EAAI,MAAS,EACpDD,EAAK3C,EAAE,YAAYA,EAAE,QAAU4C,GAAI,EAC/B9C,IAAS,EACXO,GAAUL,EAAG2C,EAAIF,CAAK,GAItBhC,EAAO3B,GAAa6D,CAAE,EACtBtC,GAAUL,EAAGS,EAAO/C,GAAa,EAAG+E,CAAK,EACzCxB,EAAQ3C,GAAYmC,CAAI,EACpBQ,IAAU,IACZ0B,GAAM5D,GAAY0B,CAAI,EACtBP,EAAUF,EAAG2C,EAAI1B,CAAK,GAExBnB,IACAW,EAAOZ,GAAOC,CAAI,EAGlBO,GAAUL,EAAGS,EAAMiC,CAAK,EACxBzB,EAAQ1C,GAAYkC,CAAI,EACpBQ,IAAU,IACZnB,GAAQd,GAAUyB,CAAI,EACtBP,EAAUF,EAAGF,EAAMmB,CAAK,UAOrB2B,EAAK5C,EAAE,UAGlBK,GAAUL,EAAG9B,GAAWuE,CAAK,CAC/B,EAWMI,GAAa,CAAC7C,EAAGa,IAAS,CAI9B,MAAMN,EAAWM,EAAK,SAChBE,EAAWF,EAAK,UAAU,YAC1BG,EAAYH,EAAK,UAAU,UAC3BxB,EAAWwB,EAAK,UAAU,MAChC,IAAIO,EAAGC,EACHP,EAAW,GACXgC,EASJ,IAHA9C,EAAE,SAAW,EACbA,EAAE,SAAWlC,GAERsD,EAAI,EAAGA,EAAI/B,EAAO+B,IACjBb,EAAKa,EAAI,CAAC,IAAe,GAC3BpB,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIc,EAAWM,EAClCpB,EAAE,MAAMoB,CAAC,EAAI,GAGbb,EAAKa,EAAI,EAAI,CAAC,EAAY,EAS9B,KAAOpB,EAAE,SAAW,GAClB8C,EAAO9C,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAKc,EAAW,EAAI,EAAEA,EAAW,EAC3DP,EAAKuC,EAAO,CAAC,EAAa,EAC1B9C,EAAE,MAAM8C,CAAI,EAAI,EAChB9C,EAAE,UAEEgB,IACFhB,EAAE,YAAce,EAAM+B,EAAO,EAAI,CAAC,GAStC,IALAjC,EAAK,SAAWC,EAKXM,EAAKpB,EAAE,UAAY,EAAcoB,GAAK,EAAGA,IAAOgB,GAAWpC,EAAGO,EAAMa,CAAC,EAK1E0B,EAAOzD,EACP,GAGE+B,EAAIpB,EAAE,KAAK,CAAC,EACZA,EAAE,KAAK,CAAC,EAAgBA,EAAE,KAAKA,EAAE,UAAU,EAC3CoC,GAAWpC,EAAGO,EAAM,CAAC,EAGrBc,EAAIrB,EAAE,KAAK,GAEXA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIoB,EACvBpB,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIqB,EAGvBd,EAAKuC,EAAO,CAAC,EAAavC,EAAKa,EAAI,CAAC,EAAab,EAAKc,EAAI,CAAC,EAC3DrB,EAAE,MAAM8C,CAAI,GAAK9C,EAAE,MAAMoB,CAAC,GAAKpB,EAAE,MAAMqB,CAAC,EAAIrB,EAAE,MAAMoB,CAAC,EAAIpB,EAAE,MAAMqB,CAAC,GAAK,EACvEd,EAAKa,EAAI,EAAI,CAAC,EAAYb,EAAKc,EAAI,EAAI,CAAC,EAAYyB,EAGpD9C,EAAE,KAAK,CAAC,EAAgB8C,IACxBV,GAAWpC,EAAGO,EAAM,CAAC,QAEdP,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,CAAC,EAK/BY,GAAWZ,EAAGa,CAAI,EAGlBa,GAAUnB,EAAMO,EAAUd,EAAE,QAAQ,CACtC,EAOM+C,GAAY,CAAC/C,EAAGO,EAAMO,IAAa,CAKvC,IAAIM,EACA4B,EAAU,GACVC,EAEAC,EAAU3C,EAAK,CAAS,EAExB4C,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAEd9C,GAAMO,EAAW,GAAK,EAAI,CAAC,EAAY,MAElCM,EAAI,EAAGA,GAAKN,EAAUM,IACzB6B,EAASC,EACTA,EAAU3C,GAAMa,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAE+B,EAAQC,GAAaH,IAAWC,KAG3BC,EAAQE,EACjBrD,EAAE,QAAQiD,EAAS,CAAC,GAAcE,EAEzBF,IAAW,GAEhBA,IAAWD,GAAWhD,EAAE,QAAQiD,EAAS,CAAC,IAC9CjD,EAAE,QAAQ7B,GAAU,CAAC,KAEZgF,GAAS,GAClBnD,EAAE,QAAQ5B,GAAY,CAAC,IAGvB4B,EAAE,QAAQ3B,GAAc,CAAC,IAG3B8E,EAAQ,EACRH,EAAUC,EAENC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOMC,GAAY,CAACtD,EAAGO,EAAMO,IAAa,CAKvC,IAAIM,EACA4B,EAAU,GACVC,EAEAC,EAAU3C,EAAK,CAAS,EAExB4C,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAGTjC,EAAI,EAAGA,GAAKN,EAAUM,IAIzB,GAHA6B,EAASC,EACTA,EAAU3C,GAAMa,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAE+B,EAAQC,GAAaH,IAAWC,GAG/B,IAAIC,EAAQE,EACjB,GAAKhD,GAAUL,EAAGiD,EAAQjD,EAAE,OAAO,QAAY,EAAEmD,IAAU,QAElDF,IAAW,GAChBA,IAAWD,IACb3C,GAAUL,EAAGiD,EAAQjD,EAAE,OAAO,EAC9BmD,KAGF9C,GAAUL,EAAG7B,GAAS6B,EAAE,OAAO,EAC/BE,EAAUF,EAAGmD,EAAQ,EAAG,CAAC,GAEhBA,GAAS,IAClB9C,GAAUL,EAAG5B,GAAW4B,EAAE,OAAO,EACjCE,EAAUF,EAAGmD,EAAQ,EAAG,CAAC,IAGzB9C,GAAUL,EAAG3B,GAAa2B,EAAE,OAAO,EACnCE,EAAUF,EAAGmD,EAAQ,GAAI,CAAC,GAG5BA,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOME,GAAiBvD,GAAM,CAE3B,IAAIwD,EAgBJ,IAbAT,GAAU/C,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAC3C+C,GAAU/C,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAG3C6C,GAAW7C,EAAGA,EAAE,OAAO,EASlBwD,EAAc3F,GAAa,EAAG2F,GAAe,GAC5CxD,EAAE,QAAQvB,GAAS+E,CAAW,EAAI,EAAI,CAAC,IAAc,EADNA,IACnD,CAKF,OAAAxD,EAAE,SAAW,GAAKwD,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,EAQMC,GAAiB,CAACzD,EAAG0D,EAAQC,EAAQC,IAAY,CAIrD,IAAIC,EASJ,IAHA3D,EAAUF,EAAG0D,EAAS,IAAK,CAAC,EAC5BxD,EAAUF,EAAG2D,EAAS,EAAK,CAAC,EAC5BzD,EAAUF,EAAG4D,EAAU,EAAI,CAAC,EACvBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B3D,EAAUF,EAAGA,EAAE,QAAQvB,GAASoF,CAAI,EAAI,EAAI,CAAC,EAAW,CAAC,EAI3DP,GAAUtD,EAAGA,EAAE,UAAW0D,EAAS,CAAC,EAGpCJ,GAAUtD,EAAGA,EAAE,UAAW2D,EAAS,CAAC,CAEtC,EAgBMG,GAAoB9D,GAAM,CAK9B,IAAI+D,EAAa,WACb,EAGJ,IAAK,EAAI,EAAG,GAAK,GAAI,IAAKA,KAAgB,EACxC,GAAKA,EAAa,GAAO/D,EAAE,UAAU,EAAI,CAAC,IAAe,EACvD,OAAOlD,GAKX,GAAIkD,EAAE,UAAU,EAAK,IAAe,GAAKA,EAAE,UAAU,EAAM,IAAe,GACtEA,EAAE,UAAU,EAAM,IAAe,EACnC,OAAOjD,GAET,IAAK,EAAI,GAAI,EAAIW,GAAY,IAC3B,GAAIsC,EAAE,UAAU,EAAI,CAAC,IAAe,EAClC,OAAOjD,GAOX,OAAOD,EACT,EAGA,IAAIkH,GAAmB,GAKvB,MAAMC,GAAcjE,GACpB,CAEOgE,KACHnC,GAAc,EACdmC,GAAmB,IAGrBhE,EAAE,OAAU,IAAIN,GAASM,EAAE,UAAWT,EAAa,EACnDS,EAAE,OAAU,IAAIN,GAASM,EAAE,UAAWR,EAAa,EACnDQ,EAAE,QAAU,IAAIN,GAASM,EAAE,QAASP,EAAc,EAElDO,EAAE,OAAS,EACXA,EAAE,SAAW,EAGb8B,GAAW9B,CAAC,CACd,EAMMkE,GAAqB,CAAClE,EAAG9C,EAAKiH,EAAYC,IAAS,CAMvDlE,EAAUF,GAAI5C,IAAgB,IAAMgH,EAAO,EAAI,GAAI,CAAC,EACpDrC,GAAU/B,CAAC,EACXD,GAAUC,EAAGmE,CAAU,EACvBpE,GAAUC,EAAG,CAACmE,CAAU,EACpBA,GACFnE,EAAE,YAAY,IAAIA,EAAE,OAAO,SAAS9C,EAAKA,EAAMiH,CAAU,EAAGnE,EAAE,OAAO,EAEvEA,EAAE,SAAWmE,CACf,EAOME,GAAerE,GAAM,CACzBE,EAAUF,EAAG3C,IAAgB,EAAG,CAAC,EACjCgD,GAAUL,EAAG9B,GAAWS,EAAY,EACpCgC,GAASX,CAAC,CACZ,EAOMsE,GAAoB,CAACtE,EAAG9C,EAAKiH,EAAYC,IAAS,CAMtD,IAAIG,EAAUC,EACVhB,EAAc,EAGdxD,EAAE,MAAQ,GAGRA,EAAE,KAAK,YAAchD,KACvBgD,EAAE,KAAK,UAAY8D,GAAiB9D,CAAC,GAIvC6C,GAAW7C,EAAGA,EAAE,MAAM,EAItB6C,GAAW7C,EAAGA,EAAE,MAAM,EAUtBwD,EAAcD,GAAcvD,CAAC,EAG7BuE,EAAYvE,EAAE,QAAU,EAAI,IAAO,EACnCwE,EAAexE,EAAE,WAAa,EAAI,IAAO,EAMrCwE,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcL,EAAa,EAGnCA,EAAa,GAAKI,GAAcrH,IAAQ,GAS3CgH,GAAmBlE,EAAG9C,EAAKiH,EAAYC,CAAI,EAElCpE,EAAE,WAAanD,IAAa2H,IAAgBD,GAErDrE,EAAUF,GAAI3C,IAAgB,IAAM+G,EAAO,EAAI,GAAI,CAAC,EACpD5B,GAAexC,EAAGrB,GAAcC,EAAY,IAG5CsB,EAAUF,GAAI1C,IAAa,IAAM8G,EAAO,EAAI,GAAI,CAAC,EACjDX,GAAezD,EAAGA,EAAE,OAAO,SAAW,EAAGA,EAAE,OAAO,SAAW,EAAGwD,EAAc,CAAC,EAC/EhB,GAAexC,EAAGA,EAAE,UAAWA,EAAE,SAAS,GAM5C8B,GAAW9B,CAAC,EAERoE,GACFrC,GAAU/B,CAAC,CAIf,EAMMyE,GAAc,CAACzE,EAAGF,EAAM6C,KAK5B3C,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAIF,EAC1CE,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAIF,GAAQ,EAClDE,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI2C,EACtC7C,IAAS,EAEXE,EAAE,UAAU2C,EAAK,CAAC,KAElB3C,EAAE,UAEFF,IAKAE,EAAE,WAAWlB,GAAa6D,CAAE,EAAIjF,GAAa,GAAK,CAAC,IACnDsC,EAAE,UAAUH,GAAOC,CAAI,EAAI,CAAC,KAGtBE,EAAE,WAAaA,EAAE,SAG3B,IAAI0E,GAAcT,GACdU,GAAqBT,GACrBU,GAAqBN,GACrBO,GAAcJ,GACdK,GAAcT,GAEdU,GAAQ,CACX,SAAUL,GACV,iBAAkBC,GAClB,gBAAiBC,GACjB,UAAWC,GACX,UAAWC,EACZ,EAyBA,MAAME,GAAU,CAACC,EAAO/H,EAAKC,EAAK+H,IAAQ,CACxC,IAAIC,EAAMF,EAAQ,MAAS,EACvBG,EAAOH,IAAU,GAAM,MAAS,EAChC7D,EAAI,EAER,KAAOjE,IAAQ,GAAG,CAIhBiE,EAAIjE,EAAM,IAAO,IAAOA,EACxBA,GAAOiE,EAEP,GACE+D,EAAMA,EAAKjI,EAAIgI,GAAK,EAAI,EACxBE,EAAMA,EAAKD,EAAK,QACT,EAAE/D,GAEX+D,GAAM,MACNC,GAAM,KACR,CAEA,OAAQD,EAAMC,GAAM,GAAM,CAC5B,EAGA,IAAIC,GAAYL,GA0BhB,MAAMM,GAAY,IAAM,CACtB,IAAIhF,EAAGiF,EAAQ,CAAA,EAEf,QAAS,EAAI,EAAG,EAAI,IAAK,IAAK,CAC5BjF,EAAI,EACJ,QAAS+B,EAAI,EAAGA,EAAI,EAAGA,IACrB/B,EAAMA,EAAI,EAAM,WAAcA,IAAM,EAAOA,IAAM,EAEnDiF,EAAM,CAAC,EAAIjF,CACb,CAEA,OAAOiF,CACT,EAGMC,GAAW,IAAI,YAAYF,IAAW,EAGtCG,GAAQ,CAACC,EAAKxI,EAAKC,EAAK+H,IAAQ,CACpC,MAAMS,EAAIH,GACJI,EAAMV,EAAM/H,EAElBuI,GAAO,GAEP,QAASG,EAAIX,EAAKW,EAAID,EAAKC,IACzBH,EAAOA,IAAQ,EAAKC,GAAGD,EAAMxI,EAAI2I,CAAC,GAAK,GAAI,EAG7C,OAAQH,EAAO,EACjB,EAGA,IAAII,GAAUL,GAqBVM,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sBACV,EAqBIC,GAAc,CAGhB,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EAMpB,KAAoB,EACpB,aAAoB,EAGpB,eAAmB,GACnB,aAAmB,GAEnB,YAAmB,GAOnB,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAM1B,UAA0B,EAG1B,WAA0B,CAE5B,EAqBA,KAAM,CAAE,SAAAC,GAAU,iBAAAC,GAAkB,gBAAAC,GAAiB,UAAAC,GAAW,UAAAC,EAAS,EAAKtB,GAQxE,CACJ,WAAYuB,GAAc,gBAAAC,GAAiB,aAAcC,GAAgB,SAAUC,GAAY,QAASC,GACxG,KAAMC,EAAQ,aAAcC,GAAgB,eAAgBC,GAAkB,aAAcC,GAAgB,YAAaC,GACzH,sBAAuBC,GACvB,WAAAC,GAAY,eAAAC,GAAgB,MAAAC,GAAO,QAAAC,GAAS,mBAAoBC,GAChE,UAAAC,GACA,WAAYC,EACd,EAAIvB,GAKEwB,GAAgB,EAEhBC,GAAc,GAEdC,GAAgB,EAGhBC,GAAgB,GAEhBC,GAAgB,IAEhBC,GAAgBD,GAAW,EAAID,GAE/BG,GAAgB,GAEhBC,GAAgB,GAEhBC,GAAgB,EAAIH,GAAU,EAE9BI,GAAY,GAGZC,EAAY,EACZC,GAAY,IACZC,GAAiBD,GAAYD,EAAY,EAEzCG,GAAc,GAEdC,GAAiB,GAEjBC,GAAiB,GAEjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAgB,IAChBC,GAAgB,IAChBC,GAAgB,IAEhBC,EAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EAEpBC,GAAU,EAEVC,GAAM,CAACC,EAAMC,KACjBD,EAAK,IAAMrD,GAASsD,CAAS,EACtBA,GAGHxF,GAAQrC,GACHA,EAAK,GAAOA,EAAK,EAAI,EAAI,GAG9B8H,GAAQpM,GAAQ,CACpB,IAAIC,EAAMD,EAAI,OAAQ,KAAO,EAAEC,GAAO,GAAKD,EAAIC,CAAG,EAAI,CACxD,EAOMoM,GAAcvJ,GAAM,CACxB,IAAIoB,EAAGC,EACHmI,EACAC,EAAQzJ,EAAE,OAEdoB,EAAIpB,EAAE,UACNwJ,EAAIpI,EACJ,GACEC,EAAIrB,EAAE,KAAK,EAAEwJ,CAAC,EACdxJ,EAAE,KAAKwJ,CAAC,EAAKnI,GAAKoI,EAAQpI,EAAIoI,EAAQ,QAC/B,EAAErI,GACXA,EAAIqI,EAEJD,EAAIpI,EACJ,GACEC,EAAIrB,EAAE,KAAK,EAAEwJ,CAAC,EACdxJ,EAAE,KAAKwJ,CAAC,EAAKnI,GAAKoI,EAAQpI,EAAIoI,EAAQ,QAI/B,EAAErI,EAEb,EAGA,IAAIsI,GAAY,CAAC1J,EAAG2J,EAAMC,KAAWD,GAAQ3J,EAAE,WAAc4J,GAAQ5J,EAAE,UAInE6J,GAAOH,GASX,MAAMI,EAAiBV,GAAS,CAC9B,MAAMpJ,EAAIoJ,EAAK,MAGf,IAAIjM,EAAM6C,EAAE,QACR7C,EAAMiM,EAAK,YACbjM,EAAMiM,EAAK,WAETjM,IAAQ,IAEZiM,EAAK,OAAO,IAAIpJ,EAAE,YAAY,SAASA,EAAE,YAAaA,EAAE,YAAc7C,CAAG,EAAGiM,EAAK,QAAQ,EACzFA,EAAK,UAAajM,EAClB6C,EAAE,aAAgB7C,EAClBiM,EAAK,WAAajM,EAClBiM,EAAK,WAAajM,EAClB6C,EAAE,SAAgB7C,EACd6C,EAAE,UAAY,IAChBA,EAAE,YAAc,GAEpB,EAGM+J,EAAmB,CAAC/J,EAAGoE,IAAS,CACpC+B,GAAgBnG,EAAIA,EAAE,aAAe,EAAIA,EAAE,YAAc,GAAKA,EAAE,SAAWA,EAAE,YAAaoE,CAAI,EAC9FpE,EAAE,YAAcA,EAAE,SAClB8J,EAAc9J,EAAE,IAAI,CACtB,EAGMgK,EAAW,CAAChK,EAAGiK,IAAM,CACzBjK,EAAE,YAAYA,EAAE,SAAS,EAAIiK,CAC/B,EAQMC,GAAc,CAAClK,EAAGiK,IAAM,CAI5BjK,EAAE,YAAYA,EAAE,SAAS,EAAKiK,IAAM,EAAK,IACzCjK,EAAE,YAAYA,EAAE,SAAS,EAAIiK,EAAI,GACnC,EAUME,GAAW,CAACf,EAAMlM,EAAKkN,EAAOC,IAAS,CAE3C,IAAIlN,EAAMiM,EAAK,SAGf,OADIjM,EAAMkN,IAAQlN,EAAMkN,GACpBlN,IAAQ,EAAY,GAExBiM,EAAK,UAAYjM,EAGjBD,EAAI,IAAIkM,EAAK,MAAM,SAASA,EAAK,QAASA,EAAK,QAAUjM,CAAG,EAAGiN,CAAK,EAChEhB,EAAK,MAAM,OAAS,EACtBA,EAAK,MAAQ/D,GAAU+D,EAAK,MAAOlM,EAAKC,EAAKiN,CAAK,EAG3ChB,EAAK,MAAM,OAAS,IAC3BA,EAAK,MAAQtD,GAAQsD,EAAK,MAAOlM,EAAKC,EAAKiN,CAAK,GAGlDhB,EAAK,SAAWjM,EAChBiM,EAAK,UAAYjM,EAEVA,EACT,EAYMmN,GAAgB,CAACtK,EAAGuK,IAAc,CAEtC,IAAIC,EAAexK,EAAE,iBACjByK,EAAOzK,EAAE,SACT0K,EACAvN,EACAwN,EAAW3K,EAAE,YACb4K,EAAa5K,EAAE,WACnB,MAAM6K,EAAS7K,EAAE,SAAYA,EAAE,OAASoI,GACpCpI,EAAE,UAAYA,EAAE,OAASoI,IAAiB,EAExC0C,EAAO9K,EAAE,OAET+K,EAAQ/K,EAAE,OACV2J,EAAQ3J,EAAE,KAMVgL,EAAShL,EAAE,SAAWmI,GAC5B,IAAI8C,EAAaH,EAAKL,EAAOE,EAAW,CAAC,EACrCO,EAAaJ,EAAKL,EAAOE,CAAQ,EAQjC3K,EAAE,aAAeA,EAAE,aACrBwK,IAAiB,GAKfI,EAAa5K,EAAE,YAAa4K,EAAa5K,EAAE,WAI/C,EAaE,IAXA0K,EAAQH,EAWJ,EAAAO,EAAKJ,EAAQC,CAAQ,IAAUO,GAC/BJ,EAAKJ,EAAQC,EAAW,CAAC,IAAMM,GAC/BH,EAAKJ,CAAK,IAAqBI,EAAKL,CAAI,GACxCK,EAAK,EAAEJ,CAAK,IAAmBI,EAAKL,EAAO,CAAC,GAUhD,CAAAA,GAAQ,EACRC,IAMA,EAAG,OAEMI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DD,EAAOO,GAOhB,GAHA7N,EAAMgL,IAAa6C,EAASP,GAC5BA,EAAOO,EAAS7C,GAEZhL,EAAMwN,EAAU,CAGlB,GAFA3K,EAAE,YAAcuK,EAChBI,EAAWxN,EACPA,GAAOyN,EACT,MAEFK,EAAaH,EAAKL,EAAOE,EAAW,CAAC,EACrCO,EAAaJ,EAAKL,EAAOE,CAAQ,CACnC,SACQJ,EAAYZ,EAAKY,EAAYQ,CAAK,GAAKF,GAAS,EAAEL,IAAiB,GAE7E,OAAIG,GAAY3K,EAAE,UACT2K,EAEF3K,EAAE,SACX,EAaMmL,GAAenL,GAAM,CAEzB,MAAMoL,EAAUpL,EAAE,OAClB,IAAI,EAAGqL,EAAMC,EAIb,EAAG,CAkCD,GAjCAD,EAAOrL,EAAE,YAAcA,EAAE,UAAYA,EAAE,SAoBnCA,EAAE,UAAYoL,GAAWA,EAAUhD,MAErCpI,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASoL,EAASA,EAAUA,EAAUC,CAAI,EAAG,CAAC,EACpErL,EAAE,aAAeoL,EACjBpL,EAAE,UAAYoL,EAEdpL,EAAE,aAAeoL,EACbpL,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,UAEfuJ,GAAWvJ,CAAC,EACZqL,GAAQD,GAENpL,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJA,EAAImK,GAASnK,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAWA,EAAE,UAAWqL,CAAI,EAC7DrL,EAAE,WAAa,EAGXA,EAAE,UAAYA,EAAE,QAAUkI,EAS5B,IARAoD,EAAMtL,EAAE,SAAWA,EAAE,OACrBA,EAAE,MAAQA,EAAE,OAAOsL,CAAG,EAGtBtL,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOsL,EAAM,CAAC,CAAC,EAIrCtL,EAAE,SAEPA,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOsL,EAAMpD,EAAY,CAAC,CAAC,EAExDlI,EAAE,KAAKsL,EAAMtL,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EACvCA,EAAE,KAAKA,EAAE,KAAK,EAAIsL,EAClBA,IACAtL,EAAE,SACE,EAAAA,EAAE,UAAYA,EAAE,OAASkI,KAA7B,CASN,OAASlI,EAAE,UAAYoI,IAAiBpI,EAAE,KAAK,WAAa,EAsC9D,EAiBMuL,GAAiB,CAACvL,EAAGwL,IAAU,CAMnC,IAAIC,EAAYzL,EAAE,iBAAmB,EAAIA,EAAE,OAASA,EAAE,OAASA,EAAE,iBAAmB,EAMhF7C,EAAKuO,EAAMC,EAAMvH,EAAO,EACxBwH,EAAO5L,EAAE,KAAK,SAClB,EAAG,CAyBD,GApBA7C,EAAM,MACNwO,EAAQ3L,EAAE,SAAW,IAAO,EACxBA,EAAE,KAAK,UAAY2L,IAIvBA,EAAO3L,EAAE,KAAK,UAAY2L,EAC1BD,EAAO1L,EAAE,SAAWA,EAAE,YAClB7C,EAAMuO,EAAO1L,EAAE,KAAK,WACtB7C,EAAMuO,EAAO1L,EAAE,KAAK,UAElB7C,EAAMwO,IACRxO,EAAMwO,GAQJxO,EAAMsO,IAAetO,IAAQ,GAAKqO,IAAU/E,IAC5B+E,IAAUlF,IACVnJ,IAAQuO,EAAO1L,EAAE,KAAK,WACxC,MAMFoE,EAAOoH,IAAU/E,IAActJ,IAAQuO,EAAO1L,EAAE,KAAK,SAAW,EAAI,EACpEkG,GAAiBlG,EAAG,EAAG,EAAGoE,CAAI,EAG9BpE,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI7C,EAC/B6C,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI7C,GAAO,EACtC6C,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAAC7C,EAChC6C,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAAC7C,GAAO,EAGvC2M,EAAc9J,EAAE,IAAI,EAShB0L,IACEA,EAAOvO,IACTuO,EAAOvO,GAGT6C,EAAE,KAAK,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,YAAaA,EAAE,YAAc0L,CAAI,EAAG1L,EAAE,KAAK,QAAQ,EACzFA,EAAE,KAAK,UAAY0L,EACnB1L,EAAE,KAAK,WAAa0L,EACpB1L,EAAE,KAAK,WAAa0L,EACpB1L,EAAE,aAAe0L,EACjBvO,GAAOuO,GAMLvO,IACFgN,GAASnK,EAAE,KAAMA,EAAE,KAAK,OAAQA,EAAE,KAAK,SAAU7C,CAAG,EACpD6C,EAAE,KAAK,UAAY7C,EACnB6C,EAAE,KAAK,WAAa7C,EACpB6C,EAAE,KAAK,WAAa7C,EAExB,OAASiH,IAAS,GA6ClB,OArCAwH,GAAQ5L,EAAE,KAAK,SACX4L,IAIEA,GAAQ5L,EAAE,QACZA,EAAE,QAAU,EAEZA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAUA,EAAE,OAAQA,EAAE,KAAK,OAAO,EAAG,CAAC,EAChFA,EAAE,SAAWA,EAAE,OACfA,EAAE,OAASA,EAAE,WAGTA,EAAE,YAAcA,EAAE,UAAY4L,IAEhC5L,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEAA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAIjBA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAU4L,EAAM5L,EAAE,KAAK,OAAO,EAAGA,EAAE,QAAQ,EACrFA,EAAE,UAAY4L,EACd5L,EAAE,QAAU4L,EAAO5L,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAAS4L,GAEjE5L,EAAE,YAAcA,EAAE,UAEhBA,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAIfoE,EACK6E,GAILuC,IAAUlF,IAAgBkF,IAAU/E,IACtCzG,EAAE,KAAK,WAAa,GAAKA,EAAE,WAAaA,EAAE,YACnC+I,IAIT4C,EAAO3L,EAAE,YAAcA,EAAE,SACrBA,EAAE,KAAK,SAAW2L,GAAQ3L,EAAE,aAAeA,EAAE,SAE/CA,EAAE,aAAeA,EAAE,OACnBA,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEJ2L,GAAQ3L,EAAE,OACNA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAGb2L,EAAO3L,EAAE,KAAK,WAChB2L,EAAO3L,EAAE,KAAK,UAEZ2L,IACFxB,GAASnK,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAU2L,CAAI,EAC3C3L,EAAE,UAAY2L,EACd3L,EAAE,QAAU2L,EAAO3L,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAAS2L,GAE7D3L,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAQnB2L,EAAQ3L,EAAE,SAAW,IAAO,EAE5B2L,EAAO3L,EAAE,iBAAmB2L,EAAO,MAAwB,MAAwB3L,EAAE,iBAAmB2L,EACxGF,EAAYE,EAAO3L,EAAE,OAASA,EAAE,OAAS2L,EACzCD,EAAO1L,EAAE,SAAWA,EAAE,aAClB0L,GAAQD,IACPC,GAAQF,IAAU/E,KAAe+E,IAAUlF,IAC7CtG,EAAE,KAAK,WAAa,GAAK0L,GAAQC,KAClCxO,EAAMuO,EAAOC,EAAOA,EAAOD,EAC3BtH,EAAOoH,IAAU/E,IAAczG,EAAE,KAAK,WAAa,GAC9C7C,IAAQuO,EAAO,EAAI,EACxBxF,GAAiBlG,EAAGA,EAAE,YAAa7C,EAAKiH,CAAI,EAC5CpE,EAAE,aAAe7C,EACjB2M,EAAc9J,EAAE,IAAI,GAIfoE,EAAO4E,GAAoBF,EACpC,EAUM+C,GAAe,CAAC7L,EAAGwL,IAAU,CAEjC,IAAIM,EACAC,EAEJ,OAAS,CAMP,GAAI/L,EAAE,UAAYoI,GAAe,CAE/B,GADA+C,GAAYnL,CAAC,EACTA,EAAE,UAAYoI,IAAiBoD,IAAUlF,GAC3C,OAAOwC,EAET,GAAI9I,EAAE,YAAc,EAClB,KAEJ,CAyBA,GApBA8L,EAAY,EACR9L,EAAE,WAAakI,IAEjBlI,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAOlB8L,IAAc,GAAc9L,EAAE,SAAW8L,GAAe9L,EAAE,OAASoI,KAKrEpI,EAAE,aAAesK,GAActK,EAAG8L,CAAS,GAGzC9L,EAAE,cAAgBkI,EAYpB,GAPA6D,EAAS3F,GAAUpG,EAAGA,EAAE,SAAWA,EAAE,YAAaA,EAAE,aAAekI,CAAS,EAE5ElI,EAAE,WAAaA,EAAE,aAKbA,EAAE,cAAgBA,EAAE,gBAAuCA,EAAE,WAAakI,EAAW,CACvFlI,EAAE,eACF,GACEA,EAAE,WAEFA,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,eAKb,EAAEA,EAAE,eAAiB,GAC9BA,EAAE,UACJ,MAEEA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,EACjBA,EAAE,MAAQA,EAAE,OAAOA,EAAE,QAAQ,EAE7BA,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,OAarD+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,WAEJ,GAAI+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAIb,CAEA,OADA9I,EAAE,OAAWA,EAAE,SAAYkI,EAAY,EAAMlI,EAAE,SAAWkI,EAAY,EAClEsD,IAAU/E,IAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAIJC,EACT,EAOMiD,GAAe,CAAChM,EAAGwL,IAAU,CAEjC,IAAIM,EACAC,EAEAE,EAGJ,OAAS,CAMP,GAAIjM,EAAE,UAAYoI,GAAe,CAE/B,GADA+C,GAAYnL,CAAC,EACTA,EAAE,UAAYoI,IAAiBoD,IAAUlF,GAC3C,OAAOwC,EAET,GAAI9I,EAAE,YAAc,EAAK,KAC3B,CAyCA,GApCA8L,EAAY,EACR9L,EAAE,WAAakI,IAEjBlI,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAMtBA,EAAE,YAAcA,EAAE,aAClBA,EAAE,WAAaA,EAAE,YACjBA,EAAE,aAAekI,EAAY,EAEzB4D,IAAc,GAAY9L,EAAE,YAAcA,EAAE,gBAC5CA,EAAE,SAAW8L,GAAc9L,EAAE,OAASoI,KAKxCpI,EAAE,aAAesK,GAActK,EAAG8L,CAAS,EAGvC9L,EAAE,cAAgB,IAClBA,EAAE,WAAaiH,IAAejH,EAAE,eAAiBkI,GAAalI,EAAE,SAAWA,EAAE,YAAc,QAK7FA,EAAE,aAAekI,EAAY,IAM7BlI,EAAE,aAAekI,GAAalI,EAAE,cAAgBA,EAAE,YAAa,CACjEiM,EAAajM,EAAE,SAAWA,EAAE,UAAYkI,EAOxC6D,EAAS3F,GAAUpG,EAAGA,EAAE,SAAW,EAAIA,EAAE,WAAYA,EAAE,YAAckI,CAAS,EAM9ElI,EAAE,WAAaA,EAAE,YAAc,EAC/BA,EAAE,aAAe,EACjB,EACM,EAAEA,EAAE,UAAYiM,IAElBjM,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWkI,EAAY,CAAC,CAAC,EAC/D4D,EAAY9L,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,gBAGf,EAAEA,EAAE,cAAgB,GAK7B,GAJAA,EAAE,gBAAkB,EACpBA,EAAE,aAAekI,EAAY,EAC7BlI,EAAE,WAEE+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAKb,SAAW9I,EAAE,iBAgBX,GATA+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAE7C+L,GAEFhC,EAAiB/J,EAAG,EAAK,EAG3BA,EAAE,WACFA,EAAE,YACEA,EAAE,KAAK,YAAc,EACvB,OAAO8I,OAMT9I,EAAE,gBAAkB,EACpBA,EAAE,WACFA,EAAE,WAEN,CAUA,OARIA,EAAE,kBAGJ+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEjDA,EAAE,gBAAkB,GAEtBA,EAAE,OAASA,EAAE,SAAWkI,EAAY,EAAIlI,EAAE,SAAWkI,EAAY,EAC7DsD,IAAU/E,IAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAKJC,EACT,EAQMmD,GAAc,CAAClM,EAAGwL,IAAU,CAEhC,IAAIO,EACApC,EACAc,EAAMO,EAEV,MAAMF,EAAO9K,EAAE,OAEf,OAAS,CAKP,GAAIA,EAAE,WAAamI,GAAW,CAE5B,GADAgD,GAAYnL,CAAC,EACTA,EAAE,WAAamI,IAAaqD,IAAUlF,GACxC,OAAOwC,EAET,GAAI9I,EAAE,YAAc,EAAK,KAC3B,CAIA,GADAA,EAAE,aAAe,EACbA,EAAE,WAAakI,GAAalI,EAAE,SAAW,IAC3CyK,EAAOzK,EAAE,SAAW,EACpB2J,EAAOmB,EAAKL,CAAI,EACZd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAAG,CAC3EO,EAAShL,EAAE,SAAWmI,GACtB,EAAG,OAEMwB,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7Cd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7Cd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7Cd,IAASmB,EAAK,EAAEL,CAAI,GAAKd,IAASmB,EAAK,EAAEL,CAAI,GAC7CA,EAAOO,GAChBhL,EAAE,aAAemI,IAAa6C,EAASP,GACnCzK,EAAE,aAAeA,EAAE,YACrBA,EAAE,aAAeA,EAAE,UAEvB,CAuBF,GAlBIA,EAAE,cAAgBkI,GAIpB6D,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,aAAekI,CAAS,EAEnDlI,EAAE,WAAaA,EAAE,aACjBA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,IAKjB+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,YAEA+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAIb,CAEA,OADA9I,EAAE,OAAS,EACPwL,IAAU/E,IAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAIJC,EACT,EAMMoD,GAAe,CAACnM,EAAGwL,IAAU,CAEjC,IAAIO,EAEJ,OAAS,CAEP,GAAI/L,EAAE,YAAc,IAClBmL,GAAYnL,CAAC,EACTA,EAAE,YAAc,GAAG,CACrB,GAAIwL,IAAUlF,GACZ,OAAOwC,EAET,KACF,CAUF,GANA9I,EAAE,aAAe,EAGjB+L,EAAS3F,GAAUpG,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAC7CA,EAAE,YACFA,EAAE,WACE+L,IAEFhC,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAO8I,CAIb,CAEA,OADA9I,EAAE,OAAS,EACPwL,IAAU/E,IAEZsD,EAAiB/J,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBgJ,GAGFC,IAELjJ,EAAE,WAEJ+J,EAAiB/J,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChB8I,EAIJC,EACT,EAOA,SAASqD,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CAEnE,KAAK,YAAcJ,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAcC,EACnB,KAAK,UAAYC,EACjB,KAAK,KAAOC,CACd,CAEA,MAAMC,GAAsB,CAE1B,IAAIN,GAAO,EAAG,EAAG,EAAG,EAAGb,EAAc,EACrC,IAAIa,GAAO,EAAG,EAAG,EAAG,EAAGP,EAAY,EACnC,IAAIO,GAAO,EAAG,EAAG,GAAI,EAAGP,EAAY,EACpC,IAAIO,GAAO,EAAG,EAAG,GAAI,GAAIP,EAAY,EAErC,IAAIO,GAAO,EAAG,EAAG,GAAI,GAAIJ,EAAY,EACrC,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,EAAY,EACtC,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,EAC3C,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,CAC7C,EAMMW,GAAW3M,GAAM,CAErBA,EAAE,YAAc,EAAIA,EAAE,OAGtBsJ,GAAKtJ,EAAE,IAAI,EAIXA,EAAE,eAAiB0M,GAAoB1M,EAAE,KAAK,EAAE,SAChDA,EAAE,WAAa0M,GAAoB1M,EAAE,KAAK,EAAE,YAC5CA,EAAE,WAAa0M,GAAoB1M,EAAE,KAAK,EAAE,YAC5CA,EAAE,iBAAmB0M,GAAoB1M,EAAE,KAAK,EAAE,UAElDA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,UAAY,EACdA,EAAE,OAAS,EACXA,EAAE,aAAeA,EAAE,YAAckI,EAAY,EAC7ClI,EAAE,gBAAkB,EACpBA,EAAE,MAAQ,CACZ,EAGA,SAAS4M,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAASrF,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,IAAI,YAAYS,GAAY,CAAC,EAC/C,KAAK,UAAa,IAAI,aAAa,EAAIF,GAAU,GAAK,CAAC,EACvD,KAAK,QAAa,IAAI,aAAa,EAAIC,GAAW,GAAK,CAAC,EACxDuB,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,IAAI,YAAYrB,GAAW,CAAC,EAI5C,KAAK,KAAO,IAAI,YAAY,EAAIJ,GAAU,CAAC,EAC3CyB,GAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,IAAI,YAAY,EAAIzB,GAAU,CAAC,EAC5CyB,GAAK,KAAK,KAAK,EAIf,KAAK,QAAU,EAEf,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAChB,KAAK,QAAU,EAEf,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,CAalB,CAMA,MAAMuD,GAAqBzD,GAAS,CAElC,GAAI,CAACA,EACH,MAAO,GAET,MAAMpJ,EAAIoJ,EAAK,MACf,MAAI,CAACpJ,GAAKA,EAAE,OAASoJ,GAASpJ,EAAE,SAAWsI,IAEbtI,EAAE,SAAWuI,IAEbvI,EAAE,SAAWwI,IACbxI,EAAE,SAAWyI,IACbzI,EAAE,SAAW0I,IACb1I,EAAE,SAAW2I,IACb3I,EAAE,SAAW4I,IACb5I,EAAE,SAAW6I,GAClC,EAEF,CACT,EAGMiE,GAAoB1D,GAAS,CAEjC,GAAIyD,GAAkBzD,CAAI,EACxB,OAAOD,GAAIC,EAAMvC,EAAgB,EAGnCuC,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,UAAY9B,GAEjB,MAAMtH,EAAIoJ,EAAK,MACf,OAAApJ,EAAE,QAAU,EACZA,EAAE,YAAc,EAEZA,EAAE,KAAO,IACXA,EAAE,KAAO,CAACA,EAAE,MAGdA,EAAE,OAEAA,EAAE,OAAS,EAAIuI,GAEfvI,EAAE,KAAOsI,GAAaM,GACxBQ,EAAK,MAASpJ,EAAE,OAAS,EACvB,EAEA,EACFA,EAAE,WAAa,GACfiG,GAASjG,CAAC,EACH2G,CACT,EAGMoG,GAAgB3D,GAAS,CAE7B,MAAM4D,EAAMF,GAAiB1D,CAAI,EACjC,OAAI4D,IAAQrG,GACVgG,GAAQvD,EAAK,KAAK,EAEb4D,CACT,EAGMC,GAAmB,CAAC7D,EAAM8D,IAE1BL,GAAkBzD,CAAI,GAAKA,EAAK,MAAM,OAAS,EAC1CvC,IAETuC,EAAK,MAAM,OAAS8D,EACbvG,GAIHwG,GAAe,CAAC/D,EAAMgE,EAAOC,EAAQC,EAAYC,EAAUC,IAAa,CAE5E,GAAI,CAACpE,EACH,OAAOvC,GAET,IAAI4G,EAAO,EAiBX,GAfIL,IAAUpG,KACZoG,EAAQ,GAGNE,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,GAGPA,EAAa,KACpBG,EAAO,EACPH,GAAc,IAIZC,EAAW,GAAKA,EAAW/F,IAAiB6F,IAAW9F,IACzD+F,EAAa,GAAKA,EAAa,IAAMF,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EAAWpG,IAAYkG,IAAe,GAAKG,IAAS,EACpE,OAAOtE,GAAIC,EAAMvC,EAAgB,EAI/ByG,IAAe,IACjBA,EAAa,GAIf,MAAM,EAAI,IAAIV,GAEd,OAAAxD,EAAK,MAAQ,EACb,EAAE,KAAOA,EACT,EAAE,OAASd,GAEX,EAAE,KAAOmF,EACT,EAAE,OAAS,KACX,EAAE,OAASH,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAYC,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,GAAG,EAAE,UAAYrF,EAAY,GAAKA,GAElD,EAAE,OAAS,IAAI,WAAW,EAAE,OAAS,CAAC,EACtC,EAAE,KAAO,IAAI,YAAY,EAAE,SAAS,EACpC,EAAE,KAAO,IAAI,YAAY,EAAE,MAAM,EAKjC,EAAE,YAAc,GAAMqF,EAAW,EAyCjC,EAAE,iBAAmB,EAAE,YAAc,EACrC,EAAE,YAAc,IAAI,WAAW,EAAE,gBAAgB,EAIjD,EAAE,QAAU,EAAE,YAGd,EAAE,SAAW,EAAE,YAAc,GAAK,EAMlC,EAAE,MAAQH,EACV,EAAE,SAAWI,EACb,EAAE,OAASH,EAEJN,GAAa3D,CAAI,CAC1B,EAEMsE,GAAc,CAACtE,EAAMgE,IAElBD,GAAa/D,EAAMgE,EAAO7F,GAAcE,GAAaC,GAAeL,EAAoB,EAK3FsG,GAAY,CAACvE,EAAMoC,IAAU,CAEjC,GAAIqB,GAAkBzD,CAAI,GAAKoC,EAAQ9E,IAAa8E,EAAQ,EAC1D,OAAOpC,EAAOD,GAAIC,EAAMvC,EAAgB,EAAIA,GAG9C,MAAM7G,EAAIoJ,EAAK,MAEf,GAAI,CAACA,EAAK,QACLA,EAAK,WAAa,GAAK,CAACA,EAAK,OAC7BpJ,EAAE,SAAW6I,IAAgB2C,IAAU/E,GAC1C,OAAO0C,GAAIC,EAAOA,EAAK,YAAc,EAAKrC,GAAgBF,EAAgB,EAG5E,MAAM+G,EAAY5N,EAAE,WAIpB,GAHAA,EAAE,WAAawL,EAGXxL,EAAE,UAAY,GAEhB,GADA8J,EAAcV,CAAI,EACdA,EAAK,YAAc,EAOrB,OAAApJ,EAAE,WAAa,GACR2G,UAOAyC,EAAK,WAAa,GAAKvF,GAAK2H,CAAK,GAAK3H,GAAK+J,CAAS,GAC7DpC,IAAU/E,GACV,OAAO0C,GAAIC,EAAMrC,EAAa,EAIhC,GAAI/G,EAAE,SAAW6I,IAAgBO,EAAK,WAAa,EACjD,OAAOD,GAAIC,EAAMrC,EAAa,EAOhC,GAHI/G,EAAE,SAAWsI,IAActI,EAAE,OAAS,IACxCA,EAAE,OAAS4I,IAET5I,EAAE,SAAWsI,GAAY,CAE3B,IAAIuF,EAAUtG,IAAiBvH,EAAE,OAAS,GAAM,IAAO,EACnD8N,EAAc,GA2BlB,GAzBI9N,EAAE,UAAYkH,IAAkBlH,EAAE,MAAQ,EAC5C8N,EAAc,EACL9N,EAAE,MAAQ,EACnB8N,EAAc,EACL9N,EAAE,QAAU,EACrB8N,EAAc,EAEdA,EAAc,EAEhBD,GAAWC,GAAe,EACtB9N,EAAE,WAAa,IAAK6N,GAAUxF,IAClCwF,GAAU,GAAMA,EAAS,GAEzB3D,GAAYlK,EAAG6N,CAAM,EAGjB7N,EAAE,WAAa,IACjBkK,GAAYlK,EAAGoJ,EAAK,QAAU,EAAE,EAChCc,GAAYlK,EAAGoJ,EAAK,MAAQ,KAAM,GAEpCA,EAAK,MAAQ,EACbpJ,EAAE,OAAS4I,GAGXkB,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,CAEX,CAEA,GAAI3G,EAAE,SAAWuI,IAMf,GAJAa,EAAK,MAAQ,EACbY,EAAShK,EAAG,EAAE,EACdgK,EAAShK,EAAG,GAAG,EACfgK,EAAShK,EAAG,CAAC,EACRA,EAAE,OAoBLgK,EAAShK,GAAIA,EAAE,OAAO,KAAO,EAAI,IACpBA,EAAE,OAAO,KAAO,EAAI,IACnBA,EAAE,OAAO,MAAY,EAAJ,IACjBA,EAAE,OAAO,KAAW,EAAJ,IAChBA,EAAE,OAAO,QAAc,GAAJ,EACvC,EACMgK,EAAShK,EAAGA,EAAE,OAAO,KAAO,GAAI,EAChCgK,EAAShK,EAAIA,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvCgK,EAAShK,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCgK,EAAShK,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCgK,EAAShK,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYkH,IAAkBlH,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBgK,EAAShK,EAAGA,EAAE,OAAO,GAAK,GAAI,EAC1BA,EAAE,OAAO,OAASA,EAAE,OAAO,MAAM,SACnCgK,EAAShK,EAAGA,EAAE,OAAO,MAAM,OAAS,GAAI,EACxCgK,EAAShK,EAAIA,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7CA,EAAE,OAAO,OACXoJ,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAS,CAAC,GAE9DA,EAAE,QAAU,EACZA,EAAE,OAASwI,WAzCXwB,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAG,CAAC,EACbgK,EAAShK,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYkH,IAAkBlH,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBgK,EAAShK,EAAGkJ,EAAO,EACnBlJ,EAAE,OAAS4I,GAGXkB,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EA6Bb,GAAI3G,EAAE,SAAWwI,GAAa,CAC5B,GAAIxI,EAAE,OAAO,MAAqB,CAChC,IAAI+N,EAAM/N,EAAE,QACR0L,GAAQ1L,EAAE,OAAO,MAAM,OAAS,OAAUA,EAAE,QAChD,KAAOA,EAAE,QAAU0L,EAAO1L,EAAE,kBAAkB,CAC5C,IAAIgO,EAAOhO,EAAE,iBAAmBA,EAAE,QAYlC,GATAA,EAAE,YAAY,IAAIA,EAAE,OAAO,MAAM,SAASA,EAAE,QAASA,EAAE,QAAUgO,CAAI,EAAGhO,EAAE,OAAO,EACjFA,EAAE,QAAUA,EAAE,iBAEVA,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtE/N,EAAE,SAAWgO,EACblE,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EAEToH,EAAM,EACNrC,GAAQsC,CACV,CAGA,IAAIC,EAAe,IAAI,WAAWjO,EAAE,OAAO,KAAK,EAGhDA,EAAE,YAAY,IAAIiO,EAAa,SAASjO,EAAE,QAASA,EAAE,QAAU0L,CAAI,EAAG1L,EAAE,OAAO,EAC/EA,EAAE,SAAW0L,EAET1L,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtE/N,EAAE,QAAU,CACd,CACAA,EAAE,OAASyI,EACb,CACA,GAAIzI,EAAE,SAAWyI,GAAY,CAC3B,GAAIzI,EAAE,OAAO,KAAoB,CAC/B,IAAI+N,EAAM/N,EAAE,QACRkO,EACJ,EAAG,CACD,GAAIlO,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtEjE,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EAEToH,EAAM,CACR,CAEI/N,EAAE,QAAUA,EAAE,OAAO,KAAK,OAC5BkO,EAAMlO,EAAE,OAAO,KAAK,WAAWA,EAAE,SAAS,EAAI,IAE9CkO,EAAM,EAERlE,EAAShK,EAAGkO,CAAG,CACjB,OAASA,IAAQ,GAEblO,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtE/N,EAAE,QAAU,CACd,CACAA,EAAE,OAAS0I,EACb,CACA,GAAI1I,EAAE,SAAW0I,GAAe,CAC9B,GAAI1I,EAAE,OAAO,QAAuB,CAClC,IAAI+N,EAAM/N,EAAE,QACRkO,EACJ,EAAG,CACD,GAAIlO,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,GAGtEjE,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,EAEToH,EAAM,CACR,CAEI/N,EAAE,QAAUA,EAAE,OAAO,QAAQ,OAC/BkO,EAAMlO,EAAE,OAAO,QAAQ,WAAWA,EAAE,SAAS,EAAI,IAEjDkO,EAAM,EAERlE,EAAShK,EAAGkO,CAAG,CACjB,OAASA,IAAQ,GAEblO,EAAE,OAAO,MAAQA,EAAE,QAAU+N,IAC/B3E,EAAK,MAAQtD,GAAQsD,EAAK,MAAOpJ,EAAE,YAAaA,EAAE,QAAU+N,EAAKA,CAAG,EAGxE,CACA/N,EAAE,OAAS2I,EACb,CACA,GAAI3I,EAAE,SAAW2I,GAAY,CAC3B,GAAI3I,EAAE,OAAO,KAAM,CACjB,GAAIA,EAAE,QAAU,EAAIA,EAAE,mBACpB8J,EAAcV,CAAI,EACdpJ,EAAE,UAAY,GAChB,OAAAA,EAAE,WAAa,GACR2G,EAGXqD,EAAShK,EAAGoJ,EAAK,MAAQ,GAAI,EAC7BY,EAAShK,EAAIoJ,EAAK,OAAS,EAAK,GAAI,EACpCA,EAAK,MAAQ,CACf,CAKA,GAJApJ,EAAE,OAAS4I,GAGXkB,EAAcV,CAAI,EACdpJ,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACR2G,CAEX,CAKA,GAAIyC,EAAK,WAAa,GAAKpJ,EAAE,YAAc,GACxCwL,IAAUlF,IAAgBtG,EAAE,SAAW6I,GAAe,CACvD,IAAIsF,EAASnO,EAAE,QAAU,EAAIuL,GAAevL,EAAGwL,CAAK,EACvCxL,EAAE,WAAakH,GAAiBiF,GAAanM,EAAGwL,CAAK,EACrDxL,EAAE,WAAamH,GAAQ+E,GAAYlM,EAAGwL,CAAK,EAC3CkB,GAAoB1M,EAAE,KAAK,EAAE,KAAKA,EAAGwL,CAAK,EAKvD,IAHI2C,IAAWnF,IAAqBmF,IAAWlF,MAC7CjJ,EAAE,OAAS6I,IAETsF,IAAWrF,GAAgBqF,IAAWnF,GACxC,OAAII,EAAK,YAAc,IACrBpJ,EAAE,WAAa,IAGV2G,EAST,GAAIwH,IAAWpF,KACTyC,IAAUjF,GACZF,GAAUrG,CAAC,EAEJwL,IAAU9E,KAEjBR,GAAiBlG,EAAG,EAAG,EAAG,EAAK,EAI3BwL,IAAUhF,KAEZ8C,GAAKtJ,EAAE,IAAI,EAEPA,EAAE,YAAc,IAClBA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,KAIjB8J,EAAcV,CAAI,EACdA,EAAK,YAAc,GACrB,OAAApJ,EAAE,WAAa,GACR2G,CAGb,CAEA,OAAI6E,IAAU/E,GAAqBE,EAC/B3G,EAAE,MAAQ,EAAY4G,IAGtB5G,EAAE,OAAS,GACbgK,EAAShK,EAAGoJ,EAAK,MAAQ,GAAI,EAC7BY,EAAShK,EAAIoJ,EAAK,OAAS,EAAK,GAAI,EACpCY,EAAShK,EAAIoJ,EAAK,OAAS,GAAM,GAAI,EACrCY,EAAShK,EAAIoJ,EAAK,OAAS,GAAM,GAAI,EACrCY,EAAShK,EAAGoJ,EAAK,SAAW,GAAI,EAChCY,EAAShK,EAAIoJ,EAAK,UAAY,EAAK,GAAI,EACvCY,EAAShK,EAAIoJ,EAAK,UAAY,GAAM,GAAI,EACxCY,EAAShK,EAAIoJ,EAAK,UAAY,GAAM,GAAI,IAIxCc,GAAYlK,EAAGoJ,EAAK,QAAU,EAAE,EAChCc,GAAYlK,EAAGoJ,EAAK,MAAQ,KAAM,GAGpCU,EAAcV,CAAI,EAIdpJ,EAAE,KAAO,IAAKA,EAAE,KAAO,CAACA,EAAE,MAEvBA,EAAE,UAAY,EAAI2G,EAASC,GACpC,EAGMwH,GAAchF,GAAS,CAE3B,GAAIyD,GAAkBzD,CAAI,EACxB,OAAOvC,GAGT,MAAMwH,EAASjF,EAAK,MAAM,OAE1B,OAAAA,EAAK,MAAQ,KAENiF,IAAWzF,GAAaO,GAAIC,EAAMtC,EAAc,EAAIH,CAC7D,EAOM2H,GAAuB,CAAClF,EAAMmF,IAAe,CAEjD,IAAIC,EAAaD,EAAW,OAE5B,GAAI1B,GAAkBzD,CAAI,EACxB,OAAOvC,GAGT,MAAM7G,EAAIoJ,EAAK,MACTqE,EAAOzN,EAAE,KAEf,GAAIyN,IAAS,GAAMA,IAAS,GAAKzN,EAAE,SAAWsI,IAAetI,EAAE,UAC7D,OAAO6G,GAYT,GARI4G,IAAS,IAEXrE,EAAK,MAAQ/D,GAAU+D,EAAK,MAAOmF,EAAYC,EAAY,CAAC,GAG9DxO,EAAE,KAAO,EAGLwO,GAAcxO,EAAE,OAAQ,CACtByN,IAAS,IAEXnE,GAAKtJ,EAAE,IAAI,EACXA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,GAIb,IAAIyO,EAAU,IAAI,WAAWzO,EAAE,MAAM,EACrCyO,EAAQ,IAAIF,EAAW,SAASC,EAAaxO,EAAE,OAAQwO,CAAU,EAAG,CAAC,EACrED,EAAaE,EACbD,EAAaxO,EAAE,MACjB,CAEA,MAAM0O,EAAQtF,EAAK,SACbuF,EAAOvF,EAAK,QACZwF,EAAQxF,EAAK,MAKnB,IAJAA,EAAK,SAAWoF,EAChBpF,EAAK,QAAU,EACfA,EAAK,MAAQmF,EACbpD,GAAYnL,CAAC,EACNA,EAAE,WAAakI,GAAW,CAC/B,IAAIoD,EAAMtL,EAAE,SACRoB,EAAIpB,EAAE,WAAakI,EAAY,GACnC,GAEElI,EAAE,MAAQ6J,GAAK7J,EAAGA,EAAE,MAAOA,EAAE,OAAOsL,EAAMpD,EAAY,CAAC,CAAC,EAExDlI,EAAE,KAAKsL,EAAMtL,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAEvCA,EAAE,KAAKA,EAAE,KAAK,EAAIsL,EAClBA,UACO,EAAElK,GACXpB,EAAE,SAAWsL,EACbtL,EAAE,UAAYkI,EAAY,EAC1BiD,GAAYnL,CAAC,CACf,CACA,OAAAA,EAAE,UAAYA,EAAE,UAChBA,EAAE,YAAcA,EAAE,SAClBA,EAAE,OAASA,EAAE,UACbA,EAAE,UAAY,EACdA,EAAE,aAAeA,EAAE,YAAckI,EAAY,EAC7ClI,EAAE,gBAAkB,EACpBoJ,EAAK,QAAUuF,EACfvF,EAAK,MAAQwF,EACbxF,EAAK,SAAWsF,EAChB1O,EAAE,KAAOyN,EACF9G,CACT,EAGA,IAAIkI,GAAgBnB,GAChBoB,GAAiB3B,GACjB4B,GAAiBhC,GACjBiC,GAAqBlC,GACrBmC,GAAqBhC,GACrBiC,GAAcvB,GACdwB,GAAef,GACfgB,GAAyBd,GACzBe,GAAc,qCAYdC,GAAc,CACjB,YAAaT,GACb,aAAcC,GACd,aAAcC,GACd,iBAAkBC,GAClB,iBAAkBC,GAClB,QAASC,GACT,WAAYC,GACZ,qBAAsBC,GACtB,YAAaC,EACd,EAEA,MAAME,GAAO,CAACC,EAAKC,IACV,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAG,EAGtD,IAAIC,GAAS,SAAUF,EAAkC,CACvD,MAAMG,EAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EACvD,KAAOA,EAAQ,QAAQ,CACrB,MAAMC,EAASD,EAAQ,MAAK,EAC5B,GAAKC,EAEL,IAAI,OAAOA,GAAW,SACpB,MAAM,IAAI,UAAUA,EAAS,oBAAoB,EAGnD,UAAWpG,KAAKoG,EACVL,GAAKK,EAAQpG,CAAC,IAChBgG,EAAIhG,CAAC,EAAIoG,EAAOpG,CAAC,GAGvB,CAEA,OAAOgG,CACT,EAIIK,GAAiBC,GAAW,CAE9B,IAAI3S,EAAM,EAEV,QAAS0I,EAAI,EAAGkK,EAAID,EAAO,OAAQjK,EAAIkK,EAAGlK,IACxC1I,GAAO2S,EAAOjK,CAAC,EAAE,OAInB,MAAMmK,EAAS,IAAI,WAAW7S,CAAG,EAEjC,QAAS0I,EAAI,EAAGX,EAAM,EAAG6K,EAAID,EAAO,OAAQjK,EAAIkK,EAAGlK,IAAK,CACtD,IAAIoK,EAAQH,EAAOjK,CAAC,EACpBmK,EAAO,IAAIC,EAAO/K,CAAG,EACrBA,GAAO+K,EAAM,MACf,CAEA,OAAOD,CACT,EAEIE,GAAS,CACZ,OAAQR,GACR,cAAeG,EAChB,EAUA,IAAIM,GAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,IAAI,WAAW,CAAC,CAAC,CAAG,OAASC,EAAI,CAAED,GAAmB,EAAO,CAMnG,MAAME,GAAW,IAAI,WAAW,GAAG,EACnC,QAASC,EAAI,EAAGA,EAAI,IAAKA,IACvBD,GAASC,CAAC,EAAKA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EAE5FD,GAAS,GAAG,EAAIA,GAAS,GAAG,EAAI,EAIhC,IAAIE,GAAcjF,GAAQ,CACxB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAW,EAAG,OAAOA,CAAG,EAGrC,IAAIpO,EAAKoD,EAAGkQ,EAAIC,EAAO,EAAGC,EAAUpF,EAAI,OAAQqF,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/BnQ,EAAIgL,EAAI,WAAWmF,CAAK,GACnBnQ,EAAI,SAAY,OAAWmQ,EAAQ,EAAIC,IAC1CF,EAAKlF,EAAI,WAAWmF,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBlQ,EAAI,OAAYA,EAAI,OAAW,KAAOkQ,EAAK,OAC3CC,MAGJE,GAAWrQ,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHApD,EAAM,IAAI,WAAWyT,CAAO,EAGvB,EAAI,EAAGF,EAAQ,EAAG,EAAIE,EAASF,IAClCnQ,EAAIgL,EAAI,WAAWmF,CAAK,GACnBnQ,EAAI,SAAY,OAAWmQ,EAAQ,EAAIC,IAC1CF,EAAKlF,EAAI,WAAWmF,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBlQ,EAAI,OAAYA,EAAI,OAAW,KAAOkQ,EAAK,OAC3CC,MAGAnQ,EAAI,IAENpD,EAAI,GAAG,EAAIoD,EACFA,EAAI,MAEbpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,EACzBpD,EAAI,GAAG,EAAI,IAAQoD,EAAI,IACdA,EAAI,OAEbpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,GACzBpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,EAAI,GAC7BpD,EAAI,GAAG,EAAI,IAAQoD,EAAI,KAGvBpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,GACzBpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,GAAK,GAC9BpD,EAAI,GAAG,EAAI,IAAQoD,IAAM,EAAI,GAC7BpD,EAAI,GAAG,EAAI,IAAQoD,EAAI,IAI3B,OAAOpD,CACT,EAGA,MAAM0T,GAAgB,CAAC1T,EAAKC,IAAQ,CAIlC,GAAIA,EAAM,OACJD,EAAI,UAAYiT,GAClB,OAAO,OAAO,aAAa,MAAM,KAAMjT,EAAI,SAAWC,EAAMD,EAAMA,EAAI,SAAS,EAAGC,CAAG,CAAC,EAI1F,IAAI6S,EAAS,GACb,QAASnK,EAAI,EAAGA,EAAI1I,EAAK0I,IACvBmK,GAAU,OAAO,aAAa9S,EAAI2I,CAAC,CAAC,EAEtC,OAAOmK,CACT,EAIA,IAAIa,GAAa,CAAC3T,EAAK4T,IAAQ,CAC7B,MAAM3T,EAAM2T,GAAO5T,EAAI,OAEvB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAW,EAAG,OAAOA,EAAI,SAAS,EAAG4T,CAAG,CAAC,EAGtD,IAAIjL,EAAGkL,EAKP,MAAMC,EAAW,IAAI,MAAM7T,EAAM,CAAC,EAElC,IAAK4T,EAAM,EAAGlL,EAAI,EAAGA,EAAI1I,GAAM,CAC7B,IAAImD,EAAIpD,EAAI2I,GAAG,EAEf,GAAIvF,EAAI,IAAM,CAAE0Q,EAASD,GAAK,EAAIzQ,EAAG,QAAU,CAE/C,IAAI2Q,EAAQZ,GAAS/P,CAAC,EAEtB,GAAI2Q,EAAQ,EAAG,CAAED,EAASD,GAAK,EAAI,MAAQlL,GAAKoL,EAAQ,EAAG,QAAU,CAKrE,IAFA3Q,GAAK2Q,IAAU,EAAI,GAAOA,IAAU,EAAI,GAAO,EAExCA,EAAQ,GAAKpL,EAAI1I,GACtBmD,EAAKA,GAAK,EAAMpD,EAAI2I,GAAG,EAAI,GAC3BoL,IAIF,GAAIA,EAAQ,EAAG,CAAED,EAASD,GAAK,EAAI,MAAQ,QAAU,CAEjDzQ,EAAI,MACN0Q,EAASD,GAAK,EAAIzQ,GAElBA,GAAK,MACL0Q,EAASD,GAAK,EAAI,MAAWzQ,GAAK,GAAM,KACxC0Q,EAASD,GAAK,EAAI,MAAUzQ,EAAI,KAEpC,CAEA,OAAOsQ,GAAcI,EAAUD,CAAG,CACpC,EASIG,GAAa,CAAChU,EAAK4T,IAAQ,CAE7BA,EAAMA,GAAO5T,EAAI,OACb4T,EAAM5T,EAAI,SAAU4T,EAAM5T,EAAI,QAGlC,IAAIgI,EAAM4L,EAAM,EAChB,KAAO5L,GAAO,IAAMhI,EAAIgI,CAAG,EAAI,OAAU,KAAQA,IAQjD,OAJIA,EAAM,GAINA,IAAQ,EAAY4L,EAEhB5L,EAAMmL,GAASnT,EAAIgI,CAAG,CAAC,EAAI4L,EAAO5L,EAAM4L,CAClD,EAEIK,GAAU,CACb,WAAYZ,GACZ,WAAYM,GACZ,WAAYK,EACb,EAqBA,SAASE,IAAU,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,CACf,CAEA,IAAIC,GAAUD,GAEd,MAAME,GAAa,OAAO,UAAU,SAK9B,CACJ,WAAYC,GAAc,aAAAC,GAAc,aAAAC,GAAc,SAAUC,GAChE,KAAMC,GAAQ,aAAcC,GAC5B,sBAAAC,GACA,mBAAAC,GACA,WAAYC,EACd,EAAI/L,GA0FJ,SAASgM,GAAUC,EAAS,CAC1B,KAAK,QAAU/B,GAAO,OAAO,CAC3B,MAAO2B,GACP,OAAQE,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAUD,EACd,EAAKG,GAAW,CAAA,CAAE,EAEhB,IAAIC,EAAM,KAAK,QAEXA,EAAI,KAAQA,EAAI,WAAa,EAC/BA,EAAI,WAAa,CAACA,EAAI,WAGfA,EAAI,MAASA,EAAI,WAAa,GAAOA,EAAI,WAAa,KAC7DA,EAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,IAAIb,GAChB,KAAK,KAAK,UAAY,EAEtB,IAAIhD,EAASiB,GAAY,aACvB,KAAK,KACL4C,EAAI,MACJA,EAAI,OACJA,EAAI,WACJA,EAAI,SACJA,EAAI,QACR,EAEE,GAAI7D,IAAWsD,GACb,MAAM,IAAI,MAAM5L,GAASsI,CAAM,CAAC,EAOlC,GAJI6D,EAAI,QACN5C,GAAY,iBAAiB,KAAK,KAAM4C,EAAI,MAAM,EAGhDA,EAAI,WAAY,CAClB,IAAIC,EAaJ,GAXI,OAAOD,EAAI,YAAe,SAE5BC,EAAOhB,GAAQ,WAAWe,EAAI,UAAU,EAC/BZ,GAAW,KAAKY,EAAI,UAAU,IAAM,uBAC7CC,EAAO,IAAI,WAAWD,EAAI,UAAU,EAEpCC,EAAOD,EAAI,WAGb7D,EAASiB,GAAY,qBAAqB,KAAK,KAAM6C,CAAI,EAErD9D,IAAWsD,GACb,MAAM,IAAI,MAAM5L,GAASsI,CAAM,CAAC,EAGlC,KAAK,UAAY,EACnB,CACF,CAwBA2D,GAAU,UAAU,KAAO,SAAUpI,EAAMwI,EAAY,CACrD,MAAMhJ,EAAO,KAAK,KACZiJ,EAAY,KAAK,QAAQ,UAC/B,IAAIhE,EAAQiE,EAEZ,GAAI,KAAK,MAAS,MAAO,GAkBzB,IAhBIF,IAAe,CAAC,CAACA,EAAYE,EAAcF,EAC1CE,EAAcF,IAAe,GAAOV,GAAaH,GAGlD,OAAO3H,GAAS,SAElBR,EAAK,MAAQ+H,GAAQ,WAAWvH,CAAI,EAC3B0H,GAAW,KAAK1H,CAAI,IAAM,uBACnCR,EAAK,MAAQ,IAAI,WAAWQ,CAAI,EAEhCR,EAAK,MAAQQ,EAGfR,EAAK,QAAU,EACfA,EAAK,SAAWA,EAAK,MAAM,SAElB,CAQP,GAPIA,EAAK,YAAc,IACrBA,EAAK,OAAS,IAAI,WAAWiJ,CAAS,EACtCjJ,EAAK,SAAW,EAChBA,EAAK,UAAYiJ,IAIdC,IAAgBd,IAAgBc,IAAgBb,KAAiBrI,EAAK,WAAa,EAAG,CACzF,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACF,CAKA,GAHAiF,EAASiB,GAAY,QAAQlG,EAAMkJ,CAAW,EAG1CjE,IAAWuD,GACb,OAAIxI,EAAK,SAAW,GAClB,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAEpDiF,EAASiB,GAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAMjB,CAAM,EACjB,KAAK,MAAQ,GACNA,IAAWsD,GAIpB,GAAIvI,EAAK,YAAc,EAAG,CACxB,KAAK,OAAOA,EAAK,MAAM,EACvB,QACF,CAGA,GAAIkJ,EAAc,GAAKlJ,EAAK,SAAW,EAAG,CACxC,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACF,CAEA,GAAIA,EAAK,WAAa,EAAG,KAC3B,CAEA,MAAO,EACT,EAUA4I,GAAU,UAAU,OAAS,SAAU/B,EAAO,CAC5C,KAAK,OAAO,KAAKA,CAAK,CACxB,EAYA+B,GAAU,UAAU,MAAQ,SAAU3D,EAAQ,CAExCA,IAAWsD,KACb,KAAK,OAASzB,GAAO,cAAc,KAAK,MAAM,GAEhD,KAAK,OAAS,CAAA,EACd,KAAK,IAAM7B,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EAmCA,SAASkE,GAAU3D,EAAOqD,EAAS,CACjC,MAAMO,EAAW,IAAIR,GAAUC,CAAO,EAKtC,GAHAO,EAAS,KAAK5D,EAAO,EAAI,EAGrB4D,EAAS,IAAO,MAAMA,EAAS,KAAOzM,GAASyM,EAAS,GAAG,EAE/D,OAAOA,EAAS,MAClB,CA0BA,SAASC,GAAO7D,EAAOqD,EAAS,CAC9B,OAAAA,EAAUA,GAAW,CAAA,EACrBA,EAAQ,KAAO,GACRM,GAAU3D,EAAOqD,CAAO,CACjC,CAMA,IAAIS,GAAWD,GAGXE,GAAc,CAIjB,KAAMD,EAEP,EAorFA,KAAM,CAAgC,KAAAE,EAAI,EAAKD,GAS/C,IAAIE,GAASD,GC3oNN,MAAME,WAAqB,KAAM,CAItC,YAAY,CACV,KAAAC,EACA,OAAAC,EACA,OAAA3E,EACA,OAAA4E,CAAA,EAYC,CACD,MAAA,EACA,KAAK,KAAOF,EACZ,KAAK,QAAUC,EACf,KAAK,OAASC,EACd,KAAK,OAAS5E,CAChB,CACF,CAMO,MAAM6E,WAA+B,KAAM,CAChD,aAAc,CACZ,MAAM,0BAA0B,CAClC,CACF,CAEO,MAAMC,WAA0B,KAAM,CAC3C,aAAc,CACZ,MAAM,qBAAqB,CAC7B,CACF,CAEO,MAAMC,WAA8B,KAAM,CAC/C,aAAc,CACZ,MAAM,0BAA0B,CAClC,CACF,CAEO,MAAMC,WAA0B,KAAM,CAC3C,aAAc,CACZ,MAAM,qBAAqB,CAC7B,CACF,CAEO,MAAMC,WAA0B,KAAM,CAC3C,aAAc,CACZ,MAAM,qBAAqB,CAC7B,CACF,CAEO,MAAMC,WAAmC,KAAM,CAGpD,YAAY,CAAE,OAAAP,GAAqC,CACjD,MAAM,+BAA+B,EAErC,KAAK,OAASA,CAChB,CACF,CAEA,MAAMQ,GAAuB,YACtB,MAAMC,WAAiB,KAAM,CAClC,YAAY,CAAE,MAAAC,GAA8B,CAC1C,MAAMF,EAAoB,EAE1B,KAAK,MAAQE,CACf,CACF,CACO,MAAMC,GAAcC,GAClBA,EAAM,UAAYJ,GAGrBK,GAAkC,8BACjC,MAAMC,WAAiC,KAAM,CAClD,YAAY,CAAE,MAAAJ,GAA6B,CACzC,MAAMG,EAA+B,EAErC,KAAK,MAAQH,CACf,CACF,CACO,MAAMK,GAA8BH,GAClCA,EAAM,UAAYC,GAGrBG,GAAgC,sBAC/B,MAAMC,WAA0B,KAAM,CAC3C,YAAY,CAAE,MAAAP,GAA8B,CAC1C,MAAMM,EAA6B,EAEnC,KAAK,MAAQN,CACf,CACF,CACO,MAAMQ,GAAuBN,GAC3BA,EAAM,UAAYI,GAGrBG,GAAyB,oBACxB,MAAMC,WAAwB,KAAM,CACzC,YAAY,CAAE,MAAAV,GAA8B,CAC1C,MAAMS,EAAsB,EAE5B,KAAK,MAAQT,CACf,CACF,CACO,MAAMW,GAAqBT,GACzBA,EAAM,UAAYO,GChLK,SAASG,EAAavB,EAAMwB,EAAaC,EAAQ,OAC7E,SAASC,EAAKC,EAAMC,EAAK,CAWrB,GAVKD,EAAK,MACN,OAAO,eAAeA,EAAM,OAAQ,CAChC,MAAO,CACH,IAAAC,EACA,OAAQC,EACR,OAAQ,IAAI,GAChC,EACgB,WAAY,EAC5B,CAAa,EAEDF,EAAK,KAAK,OAAO,IAAI3B,CAAI,EACzB,OAEJ2B,EAAK,KAAK,OAAO,IAAI3B,CAAI,EACzBwB,EAAYG,EAAMC,CAAG,EAErB,MAAME,EAAQD,EAAE,UACVE,EAAO,OAAO,KAAKD,CAAK,EAC9B,QAAShP,EAAI,EAAGA,EAAIiP,EAAK,OAAQjP,IAAK,CAClC,MAAMxD,EAAIyS,EAAKjP,CAAC,EACVxD,KAAKqS,IACPA,EAAKrS,CAAC,EAAIwS,EAAMxS,CAAC,EAAE,KAAKqS,CAAI,EAEpC,CACJ,CAEA,MAAMK,GAASC,EAAAR,GAAA,YAAAA,EAAQ,SAAR,KAAAQ,EAAkB,OACjC,MAAMC,UAAmBF,CAAO,CACpC,CACI,OAAO,eAAeE,EAAY,OAAQ,CAAE,MAAOlC,EAAM,EACzD,SAAS6B,EAAED,EAAK,OACZ,IAAIK,EACJ,MAAMN,EAAOF,GAAA,MAAAA,EAAQ,OAAS,IAAIS,EAAe,KACjDR,EAAKC,EAAMC,CAAG,GACbK,KAAKN,EAAK,MAAM,WAAhB,OAA6BM,EAAG,SAAW,IAC5C,UAAWE,KAAMR,EAAK,KAAK,SACvBQ,EAAE,EAEN,OAAOR,CACX,CACA,cAAO,eAAeE,EAAG,OAAQ,CAAE,MAAOH,EAAM,EAChD,OAAO,eAAeG,EAAG,OAAO,YAAa,CACzC,MAAQF,GAAS,SACb,OAAIF,GAAA,MAAAA,EAAQ,QAAUE,aAAgBF,EAAO,OAClC,IACJW,GAAAH,EAAAN,GAAA,YAAAA,EAAM,OAAN,YAAAM,EAAY,SAAZ,YAAAG,EAAoB,IAAIpC,EACnC,CACR,CAAK,EACD,OAAO,eAAe6B,EAAG,OAAQ,CAAE,MAAO7B,EAAM,EACzC6B,CACX,CAGO,MAAMQ,WAAuB,KAAM,CACtC,aAAc,CACV,MAAM,0EAA0E,CACpF,CACJ,CACO,MAAMC,WAAwB,KAAM,CACvC,YAAYtC,EAAM,CACd,MAAM,uDAAuDA,CAAI,EAAE,EACnE,KAAK,KAAO,gBAChB,CACJ,CACO,MAAMuC,GAAe,CAAA,EACrB,SAASC,GAAOC,EAAW,CAG9B,OAAOF,EACX,CC/DO,SAASG,GAAcC,EAAS,CACnC,MAAMC,EAAgB,OAAO,OAAOD,CAAO,EAAE,OAAQpT,GAAM,OAAOA,GAAM,QAAQ,EAIhF,OAHe,OAAO,QAAQoT,CAAO,EAChC,OAAO,CAAC,CAACrT,EAAGuS,CAAC,IAAMe,EAAc,QAAQ,CAACtT,CAAC,IAAM,EAAE,EACnD,IAAI,CAAC,CAACuS,EAAGtS,CAAC,IAAMA,CAAC,CAE1B,CAIO,SAASsT,GAAsBhB,EAAGzU,EAAO,CAC5C,OAAI,OAAOA,GAAU,SACVA,EAAM,SAAQ,EAClBA,CACX,CACO,SAAS0V,GAAOC,EAAQ,CAE3B,MAAO,CACH,IAAI,OAAQ,CACE,CACN,MAAM3V,EAAQ2V,EAAM,EACpB,cAAO,eAAe,KAAM,QAAS,CAAE,MAAA3V,CAAK,CAAE,EACvCA,CACX,CAEJ,CACR,CACA,CACO,SAAS4V,GAAQnH,EAAO,CAC3B,OAAOA,GAAU,IACrB,CACO,SAASoH,GAAWpG,EAAQ,CAC/B,MAAMxF,EAAQwF,EAAO,WAAW,GAAG,EAAI,EAAI,EACrChK,EAAMgK,EAAO,SAAS,GAAG,EAAIA,EAAO,OAAS,EAAIA,EAAO,OAC9D,OAAOA,EAAO,MAAMxF,EAAOxE,CAAG,CAClC,CACO,SAASqQ,GAAmB/H,EAAKgI,EAAM,CAC1C,MAAMC,GAAejI,EAAI,SAAQ,EAAG,MAAM,GAAG,EAAE,CAAC,GAAK,IAAI,OACnDkI,EAAaF,EAAK,SAAQ,EAChC,IAAIG,GAAgBD,EAAW,MAAM,GAAG,EAAE,CAAC,GAAK,IAAI,OACpD,GAAIC,IAAiB,GAAK,WAAW,KAAKD,CAAU,EAAG,CACnD,MAAM1L,EAAQ0L,EAAW,MAAM,YAAY,EACvC1L,GAAA,MAAAA,EAAQ,KACR2L,EAAe,OAAO,SAAS3L,EAAM,CAAC,CAAC,EAE/C,CACA,MAAM4L,EAAWH,EAAcE,EAAeF,EAAcE,EACtDE,EAAS,OAAO,SAASrI,EAAI,QAAQoI,CAAQ,EAAE,QAAQ,IAAK,EAAE,CAAC,EAC/DE,EAAU,OAAO,SAASN,EAAK,QAAQI,CAAQ,EAAE,QAAQ,IAAK,EAAE,CAAC,EACvE,OAAQC,EAASC,EAAWC,GAAA,GAAMH,EACtC,CACA,MAAMI,GAAa,OAAO,YAAY,EAC/B,SAASC,EAAWC,EAAQnH,EAAKqG,EAAQ,CAC5C,IAAI3V,EACJ,OAAO,eAAeyW,EAAQnH,EAAK,CAC/B,KAAM,CACF,GAAItP,IAAUuW,GAId,OAAIvW,IAAU,SACVA,EAAQuW,GACRvW,EAAQ2V,EAAM,GAEX3V,CACX,EACA,IAAImC,EAAG,CACH,OAAO,eAAesU,EAAQnH,EAAK,CAC/B,MAAOnN,CAEvB,CAAa,CAEL,EACA,aAAc,EACtB,CAAK,CACL,CAIO,SAASuU,GAAWC,EAAQC,EAAM5W,EAAO,CAC5C,OAAO,eAAe2W,EAAQC,EAAM,CAChC,MAAA5W,EACA,SAAU,GACV,WAAY,GACZ,aAAc,EACtB,CAAK,CACL,CACO,SAAS6W,MAAaC,EAAM,CAC/B,MAAMC,EAAoB,CAAA,EAC1B,UAAWvC,KAAOsC,EAAM,CACpB,MAAME,EAAc,OAAO,0BAA0BxC,CAAG,EACxD,OAAO,OAAOuC,EAAmBC,CAAW,CAChD,CACA,OAAO,OAAO,iBAAiB,CAAA,EAAID,CAAiB,CACxD,CA4BO,SAASE,GAAI9L,EAAK,CACrB,OAAO,KAAK,UAAUA,CAAG,CAC7B,CACO,SAAS+L,GAAQzI,EAAO,CAC3B,OAAOA,EACF,YAAW,EACX,KAAI,EACJ,QAAQ,YAAa,EAAE,EACvB,QAAQ,WAAY,GAAG,EACvB,QAAQ,WAAY,EAAE,CAC/B,CACO,MAAM0I,GAAqB,sBAAuB,MAAQ,MAAM,kBAAoB,IAAIC,IAAU,CAAE,EACpG,SAASC,GAAS5N,EAAM,CAC3B,OAAO,OAAOA,GAAS,UAAYA,IAAS,MAAQ,CAAC,MAAM,QAAQA,CAAI,CAC3E,CACO,MAAM6N,GAAa5B,GAAO,IAAM,OAEnC,GAAI,OAAO,WAAc,eAAeb,EAAA,iCAAW,YAAX,MAAAA,EAAsB,SAAS,eACnE,MAAO,GAEX,GAAI,CACA,MAAM0C,EAAI,SACV,WAAIA,EAAE,EAAE,EACD,EACX,OACO9C,EAAG,CACN,MAAO,EACX,CACJ,CAAC,EACM,SAAS+C,GAAcC,EAAG,CAC7B,GAAIJ,GAASI,CAAC,IAAM,GAChB,MAAO,GAEX,MAAMC,EAAOD,EAAE,YAGf,GAFIC,IAAS,QAET,OAAOA,GAAS,WAChB,MAAO,GAEX,MAAMC,EAAOD,EAAK,UAIlB,MAHI,EAAAL,GAASM,CAAI,IAAM,IAGnB,OAAO,UAAU,eAAe,KAAKA,EAAM,eAAe,IAAM,GAIxE,CACO,SAASC,GAAaH,EAAG,CAC5B,OAAID,GAAcC,CAAC,EACRI,EAAA,GAAKJ,GACZ,MAAM,QAAQA,CAAC,EACR,CAAC,GAAGA,CAAC,EACTA,CACX,CAuDO,MAAMK,GAAmB,IAAI,IAAI,CAAC,SAAU,SAAU,QAAQ,CAAC,EAE/D,SAASC,GAAY5M,EAAK,CAC7B,OAAOA,EAAI,QAAQ,sBAAuB,MAAM,CACpD,CAEO,SAAS6M,GAAMzD,EAAMC,EAAKH,EAAQ,CACrC,MAAM4D,EAAK,IAAI1D,EAAK,KAAK,OAAOC,GAAA,KAAAA,EAAOD,EAAK,KAAK,GAAG,EACpD,OAAI,CAACC,GAAOH,GAAA,MAAAA,EAAQ,UAChB4D,EAAG,KAAK,OAAS1D,GACd0D,CACX,CACO,SAASC,EAAgBC,EAAS,CACrC,MAAM9D,EAAS8D,EACf,GAAI,CAAC9D,EACD,MAAO,CAAA,EACX,GAAI,OAAOA,GAAW,SAClB,MAAO,CAAE,MAAO,IAAMA,CAAM,EAChC,IAAIA,GAAA,YAAAA,EAAQ,WAAY,OAAW,CAC/B,IAAIA,GAAA,YAAAA,EAAQ,SAAU,OAClB,MAAM,IAAI,MAAM,kDAAkD,EACtEA,EAAO,MAAQA,EAAO,OAC1B,CAEA,OADA,OAAOA,EAAO,QACV,OAAOA,EAAO,OAAU,SACjB+D,EAAAP,EAAA,GAAKxD,GAAL,CAAa,MAAO,IAAMA,EAAO,KAAK,GAC1CA,CACX,CAyCO,SAASgE,GAAaC,EAAO,CAChC,OAAO,OAAO,KAAKA,CAAK,EAAE,OAAQpW,GACvBoW,EAAMpW,CAAC,EAAE,KAAK,QAAU,YAAcoW,EAAMpW,CAAC,EAAE,KAAK,SAAW,UACzE,CACL,CACO,MAAMqW,GAAuB,CAChC,QAAS,CAAC,OAAO,iBAAkB,OAAO,gBAAgB,EAC1D,MAAO,CAAC,YAAa,UAAU,EAC/B,OAAQ,CAAC,EAAG,UAAU,EACtB,QAAS,CAAC,sBAAwB,oBAAqB,EACvD,QAAS,CAAC,CAAC,OAAO,UAAW,OAAO,SAAS,CACjD,EAKO,SAASC,GAAKC,EAAQC,EAAM,CAC/B,MAAMC,EAAUF,EAAO,KAAK,IACtBG,EAASD,EAAQ,OAEvB,GADkBC,GAAUA,EAAO,OAAS,EAExC,MAAM,IAAI,MAAM,iEAAiE,EAErF,MAAMpE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMI,EAAW,CAAA,EACjB,UAAWvJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOqJ,EAAQ,OACjB,MAAM,IAAI,MAAM,sBAAsBrJ,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,IAEbuJ,EAASvJ,CAAG,EAAIqJ,EAAQ,MAAMrJ,CAAG,EACrC,CACA,OAAAoH,GAAW,KAAM,QAASmC,CAAQ,EAC3BA,CACX,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAOb,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAASsE,GAAKL,EAAQC,EAAM,CAC/B,MAAMC,EAAUF,EAAO,KAAK,IACtBG,EAASD,EAAQ,OAEvB,GADkBC,GAAUA,EAAO,OAAS,EAExC,MAAM,IAAI,MAAM,iEAAiE,EAErF,MAAMpE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMI,EAAWhB,EAAA,GAAKY,EAAO,KAAK,IAAI,OACtC,UAAWnJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOqJ,EAAQ,OACjB,MAAM,IAAI,MAAM,sBAAsBrJ,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,GAEb,OAAOuJ,EAASvJ,CAAG,CACvB,CACA,OAAAoH,GAAW,KAAM,QAASmC,CAAQ,EAC3BA,CACX,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAOb,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAASuE,GAAON,EAAQH,EAAO,CAClC,GAAI,CAACd,GAAcc,CAAK,EACpB,MAAM,IAAI,MAAM,kDAAkD,EAEtE,MAAMM,EAASH,EAAO,KAAK,IAAI,OAE/B,GADkBG,GAAUA,EAAO,OAAS,EAC7B,CAGX,MAAMI,EAAgBP,EAAO,KAAK,IAAI,MACtC,UAAWnJ,KAAOgJ,EACd,GAAI,OAAO,yBAAyBU,EAAe1J,CAAG,IAAM,OACxD,MAAM,IAAI,MAAM,8FAA8F,CAG1H,CACA,MAAMkF,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMQ,EAASpB,IAAA,GAAKY,EAAO,KAAK,IAAI,OAAUH,GAC9C,OAAA5B,GAAW,KAAM,QAASuC,CAAM,EACzBA,CACX,CACR,CAAK,EACD,OAAOjB,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAAS0E,GAAWT,EAAQH,EAAO,CACtC,GAAI,CAACd,GAAcc,CAAK,EACpB,MAAM,IAAI,MAAM,sDAAsD,EAE1E,MAAM9D,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMQ,EAASpB,IAAA,GAAKY,EAAO,KAAK,IAAI,OAAUH,GAC9C,OAAA5B,GAAW,KAAM,QAASuC,CAAM,EACzBA,CACX,CACR,CAAK,EACD,OAAOjB,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAAS2E,GAAMC,EAAGtP,EAAG,CACxB,MAAM0K,EAAMqC,GAAUuC,EAAE,KAAK,IAAK,CAC9B,IAAI,OAAQ,CACR,MAAMH,EAASpB,IAAA,GAAKuB,EAAE,KAAK,IAAI,OAAUtP,EAAE,KAAK,IAAI,OACpD,OAAA4M,GAAW,KAAM,QAASuC,CAAM,EACzBA,CACX,EACA,IAAI,UAAW,CACX,OAAOnP,EAAE,KAAK,IAAI,QACtB,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAOkO,GAAMoB,EAAG5E,CAAG,CACvB,CACO,SAAS6E,GAAQC,EAAOb,EAAQC,EAAM,CAEzC,MAAME,EADUH,EAAO,KAAK,IACL,OAEvB,GADkBG,GAAUA,EAAO,OAAS,EAExC,MAAM,IAAI,MAAM,oEAAoE,EAExF,MAAMpE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMc,EAAWd,EAAO,KAAK,IAAI,MAC3BH,EAAQT,EAAA,GAAK0B,GACnB,GAAIb,EACA,UAAWpJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOiK,GACT,MAAM,IAAI,MAAM,sBAAsBjK,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,IAGbgJ,EAAMhJ,CAAG,EAAIgK,EACP,IAAIA,EAAM,CACR,KAAM,WACN,UAAWC,EAASjK,CAAG,CACnD,CAAyB,EACCiK,EAASjK,CAAG,EACtB,KAGA,WAAWA,KAAOiK,EAEdjB,EAAMhJ,CAAG,EAAIgK,EACP,IAAIA,EAAM,CACR,KAAM,WACN,UAAWC,EAASjK,CAAG,CACnD,CAAyB,EACCiK,EAASjK,CAAG,EAG1B,OAAAoH,GAAW,KAAM,QAAS4B,CAAK,EACxBA,CACX,EACA,OAAQ,CAAA,CAChB,CAAK,EACD,OAAON,GAAMS,EAAQjE,CAAG,CAC5B,CACO,SAASgF,GAASF,EAAOb,EAAQC,EAAM,CAC1C,MAAMlE,EAAMqC,GAAU4B,EAAO,KAAK,IAAK,CACnC,IAAI,OAAQ,CACR,MAAMc,EAAWd,EAAO,KAAK,IAAI,MAC3BH,EAAQT,EAAA,GAAK0B,GACnB,GAAIb,EACA,UAAWpJ,KAAOoJ,EAAM,CACpB,GAAI,EAAEpJ,KAAOgJ,GACT,MAAM,IAAI,MAAM,sBAAsBhJ,CAAG,GAAG,EAE3CoJ,EAAKpJ,CAAG,IAGbgJ,EAAMhJ,CAAG,EAAI,IAAIgK,EAAM,CACnB,KAAM,cACN,UAAWC,EAASjK,CAAG,CAC/C,CAAqB,EACL,KAGA,WAAWA,KAAOiK,EAEdjB,EAAMhJ,CAAG,EAAI,IAAIgK,EAAM,CACnB,KAAM,cACN,UAAWC,EAASjK,CAAG,CAC/C,CAAqB,EAGT,OAAAoH,GAAW,KAAM,QAAS4B,CAAK,EACxBA,CACX,CACR,CAAK,EACD,OAAON,GAAMS,EAAQjE,CAAG,CAC5B,CAEO,SAASiF,GAAQC,EAAGC,EAAa,EAAG,OACvC,GAAID,EAAE,UAAY,GACd,MAAO,GACX,QAAShU,EAAIiU,EAAYjU,EAAIgU,EAAE,OAAO,OAAQhU,IAC1C,KAAImP,EAAA6E,EAAE,OAAOhU,CAAC,IAAV,YAAAmP,EAAa,YAAa,GAC1B,MAAO,GAGf,MAAO,EACX,CACO,SAAS+E,GAAaC,EAAMC,EAAQ,CACvC,OAAOA,EAAO,IAAKC,GAAQ,OACvB,IAAIlF,EACJ,OAACA,KAAKkF,GAAK,OAAV,OAAmBlF,EAAG,KAAO,CAAA,GAC9BkF,EAAI,KAAK,QAAQF,CAAI,EACdE,CACX,CAAC,CACL,CACO,SAASC,GAAcC,EAAS,CACnC,OAAO,OAAOA,GAAY,SAAWA,EAAUA,GAAA,YAAAA,EAAS,OAC5D,CACO,SAASC,GAAcH,EAAKI,EAAK/E,EAAQ,2BAC5C,MAAMgF,EAAOhC,EAAAP,EAAA,GAAKkC,GAAL,CAAU,MAAMlF,EAAAkF,EAAI,OAAJ,KAAAlF,EAAY,EAAE,GAE3C,GAAI,CAACkF,EAAI,QAAS,CACd,MAAME,GAAUI,GAAAC,GAAAC,GAAAC,EAAAR,IAAcS,GAAAC,GAAA1F,EAAA+E,EAAI,OAAJ,YAAA/E,EAAU,KAAK,MAAf,YAAA0F,EAAoB,QAApB,YAAAD,EAAA,KAAAC,EAA4BX,EAAI,IAA9C,KAAAS,EACZR,IAAcW,EAAAR,GAAA,YAAAA,EAAK,QAAL,YAAAQ,EAAA,KAAAR,EAAaJ,EAAI,IADnB,KAAAQ,EAEZP,IAAcY,EAAAxF,EAAO,cAAP,YAAAwF,EAAA,KAAAxF,EAAqB2E,EAAI,IAF3B,KAAAO,EAGZN,IAAca,EAAAzF,EAAO,cAAP,YAAAyF,EAAA,KAAAzF,EAAqB2E,EAAI,IAH3B,KAAAM,EAIZ,gBACJD,EAAK,QAAUH,CACnB,CAEA,cAAOG,EAAK,KACZ,OAAOA,EAAK,SACPD,GAAA,MAAAA,EAAK,aACN,OAAOC,EAAK,MAETA,CACX,CAWO,SAASU,GAAoBrM,EAAO,CACvC,OAAI,MAAM,QAAQA,CAAK,EACZ,QACP,OAAOA,GAAU,SACV,SACJ,SACX,CAsBO,SAASsM,MAASC,EAAM,CAC3B,KAAM,CAACjB,EAAKtL,EAAO8F,CAAI,EAAIyG,EAC3B,OAAI,OAAOjB,GAAQ,SACR,CACH,QAASA,EACT,KAAM,SACN,MAAAtL,EACA,KAAA8F,CACZ,EAEWsD,EAAA,GAAKkC,EAChB,CCplBA,MAAM3F,GAAc,CAACG,EAAMC,IAAQ,CAC/BD,EAAK,KAAO,YACZ,OAAO,eAAeA,EAAM,OAAQ,CAChC,MAAOA,EAAK,KACZ,WAAY,EACpB,CAAK,EACD,OAAO,eAAeA,EAAM,SAAU,CAClC,MAAOC,EACP,WAAY,EACpB,CAAK,EACDD,EAAK,QAAU,KAAK,UAAUC,EAAKyG,GAA4B,CAAC,EAChE,OAAO,eAAe1G,EAAM,WAAY,CACpC,MAAO,IAAMA,EAAK,QAClB,WAAY,EACpB,CAAK,CACL,EACa2G,GAAY/G,EAAa,YAAaC,EAAW,EACjD+G,GAAgBhH,EAAa,YAAaC,GAAa,CAAE,OAAQ,MAAO,EAC9E,SAASgH,GAAa3H,EAAO4H,EAAUN,GAAUA,EAAM,QAAS,CACnE,MAAMO,EAAc,CAAA,EACdC,EAAa,CAAA,EACnB,UAAWC,KAAO/H,EAAM,OAChB+H,EAAI,KAAK,OAAS,GAClBF,EAAYE,EAAI,KAAK,CAAC,CAAC,EAAIF,EAAYE,EAAI,KAAK,CAAC,CAAC,GAAK,CAAA,EACvDF,EAAYE,EAAI,KAAK,CAAC,CAAC,EAAE,KAAKH,EAAOG,CAAG,CAAC,GAGzCD,EAAW,KAAKF,EAAOG,CAAG,CAAC,EAGnC,MAAO,CAAE,WAAAD,EAAY,YAAAD,CAAW,CACpC,CACO,SAASG,GAAYhI,EAAO4H,EAAUN,GAAUA,EAAM,QAAS,CAClE,MAAMO,EAAc,CAAE,QAAS,EAAE,EAC3BI,EAAgBjI,GAAU,CAC5B,UAAWsH,KAAStH,EAAM,OACtB,GAAIsH,EAAM,OAAS,iBAAmBA,EAAM,OAAO,OAC/CA,EAAM,OAAO,IAAKjB,GAAW4B,EAAa,CAAE,OAAA5B,CAAM,CAAE,CAAC,UAEhDiB,EAAM,OAAS,cACpBW,EAAa,CAAE,OAAQX,EAAM,MAAM,CAAE,UAEhCA,EAAM,OAAS,kBACpBW,EAAa,CAAE,OAAQX,EAAM,MAAM,CAAE,UAEhCA,EAAM,KAAK,SAAW,EAC3BO,EAAY,QAAQ,KAAKD,EAAON,CAAK,CAAC,MAErC,CACD,IAAIY,EAAOL,EACP5V,EAAI,EACR,KAAOA,EAAIqV,EAAM,KAAK,QAAQ,CAC1B,MAAMa,EAAKb,EAAM,KAAKrV,CAAC,EACNA,IAAMqV,EAAM,KAAK,OAAS,GAKvCY,EAAKC,CAAE,EAAID,EAAKC,CAAE,GAAK,CAAE,QAAS,EAAE,EACpCD,EAAKC,CAAE,EAAE,QAAQ,KAAKP,EAAON,CAAK,CAAC,GAJnCY,EAAKC,CAAE,EAAID,EAAKC,CAAE,GAAK,CAAE,QAAS,EAAE,EAMxCD,EAAOA,EAAKC,CAAE,EACdlW,GACJ,CACJ,CAER,EACA,OAAAgW,EAAajI,CAAK,EACX6H,CACX,CCpEO,MAAMO,GAAUC,GAAS,CAACrD,EAAQzY,EAAO+b,EAAM5D,IAAY,OAC9D,MAAMgC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,MAAO,EAAK,CAAE,EAAI,CAAE,MAAO,EAAK,EACnElM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EACzD,GAAItK,aAAkB,QAClB,MAAM,IAAImM,GAEd,GAAInM,EAAO,OAAO,OAAQ,CACtB,MAAMoM,EAAI,KAAKpH,EAAAsD,GAAA,YAAAA,EAAS,MAAT,KAAAtD,EAAgBiH,GAAMjM,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,EAC5GC,MAAAA,GAAuBH,EAAG9D,GAAA,YAAAA,EAAS,MAAM,EACnC8D,CACV,CACA,OAAOpM,EAAO,KAClB,EAEawM,GAAeP,GAAS,CAAOrD,EAAQzY,EAAO+b,EAAM1H,IAAWiI,EAAA,4BACxE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,MAAO,EAAI,CAAE,EAAI,CAAE,MAAO,EAAI,EACvE,IAAIlM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EAGvD,GAFItK,aAAkB,UAClBA,EAAS,MAAMA,GACfA,EAAO,OAAO,OAAQ,CACtB,MAAMoM,EAAI,KAAKpH,EAAAR,GAAA,YAAAA,EAAQ,MAAR,KAAAQ,EAAeiH,GAAMjM,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,EAC3GC,MAAAA,GAAuBH,EAAG5H,GAAA,YAAAA,EAAQ,MAAM,EAClC4H,CACV,CACA,OAAOpM,EAAO,KAClB,GAEa0M,GAAcT,GAAS,CAACrD,EAAQzY,EAAO+b,IAAS,CACzD,MAAM5B,EAAM4B,EAAO3D,EAAAP,EAAA,GAAKkE,GAAL,CAAW,MAAO,EAAK,GAAK,CAAE,MAAO,EAAK,EACvDlM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EACzD,GAAItK,aAAkB,QAClB,MAAM,IAAImM,GAEd,OAAOnM,EAAO,OAAO,OACf,CACE,QAAS,GACT,MAAO,IAAKiM,GAAA,KAAAA,EAAQU,IAAkB3M,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,CACzH,EACU,CAAE,QAAS,GAAM,KAAMtM,EAAO,KAAK,CAC7C,EACa4M,GAA2BF,GAAWG,EAAoB,EAC1DC,GAAmBb,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACpE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,MAAO,EAAI,CAAE,EAAI,CAAE,MAAO,EAAI,EACvE,IAAIlM,EAAS4I,EAAO,KAAK,IAAI,CAAE,MAAAzY,EAAO,OAAQ,EAAE,EAAIma,CAAG,EACvD,OAAItK,aAAkB,UAClBA,EAAS,MAAMA,GACZA,EAAO,OAAO,OACf,CACE,QAAS,GACT,MAAO,IAAIiM,EAAKjM,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,CACnG,EACU,CAAE,QAAS,GAAM,KAAMtM,EAAO,KAAK,CAC7C,GACa+M,GAAgCD,GAAgBD,EAAoB,EACpEG,GAAWf,GAAS,CAACrD,EAAQzY,EAAO+b,IAAS,CACtD,MAAM5B,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOF,GAAOC,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CAC1C,EAEa2C,GAAWhB,GAAS,CAACrD,EAAQzY,EAAO+b,IACtCF,GAAOC,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,EAG9BgB,GAAgBjB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACjE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOM,GAAYP,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CAC/C,GAEa6C,GAAgBlB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACjE,OAAOD,GAAYP,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,CAChD,GAEakB,GAAenB,GAAS,CAACrD,EAAQzY,EAAO+b,IAAS,CAC1D,MAAM5B,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOQ,GAAWT,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CAC9C,EAEa+C,GAAepB,GAAS,CAACrD,EAAQzY,EAAO+b,IAC1CQ,GAAWT,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,EAGlCoB,GAAoBrB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACrE,MAAMnC,EAAM4B,EAAO,OAAO,OAAOA,EAAM,CAAE,UAAW,UAAU,CAAE,EAAI,CAAE,UAAW,UAAU,EAC3F,OAAOY,GAAgBb,CAAI,EAAErD,EAAQzY,EAAOma,CAAG,CACnD,GAEaiD,GAAoBtB,GAAS,CAAOrD,EAAQzY,EAAO+b,IAASO,EAAA,sBACrE,OAAOK,GAAgBb,CAAI,EAAErD,EAAQzY,EAAO+b,CAAI,CACpD,GC1FasB,GAAO,mBACPC,GAAQ,cACRC,GAAO,wCACPC,GAAM,oBACNC,GAAQ,oBACRC,GAAS,sBAETC,GAAW,gGAIXC,GAAO,kFAIPC,GAAQC,GACZA,EAEE,IAAI,OAAO,mCAAmCA,CAAO,yDAAyD,EAD1G,yKAOFC,GAAQ,mGAUfC,GAAS,uDACR,SAASC,IAAQ,CACpB,OAAO,IAAI,OAAOD,GAAQ,GAAG,CACjC,CACO,MAAME,GAAO,sHACPC,GAAO,+XAKPC,GAAS,2IACTC,GAAS,iIAETC,GAAS,8EACTC,GAAY,mBAOZC,GAAO,oBAEdC,GAAa,sNACNC,GAAqB,IAAI,OAAO,IAAID,EAAU,GAAG,EAC9D,SAASE,GAAW3D,EAAM,CACtB,MAAM4D,EAAO,8BAQb,OAPc,OAAO5D,EAAK,WAAc,SAClCA,EAAK,YAAc,GACf,GAAG4D,CAAI,GACP5D,EAAK,YAAc,EACf,GAAG4D,CAAI,YACP,GAAGA,CAAI,mBAAmB5D,EAAK,SAAS,IAChD,GAAG4D,CAAI,4BAEjB,CACO,SAASC,GAAK7D,EAAM,CACvB,OAAO,IAAI,OAAO,IAAI2D,GAAW3D,CAAI,CAAC,GAAG,CAC7C,CAEO,SAAS8D,GAAS9D,EAAM,CAC3B,MAAM6D,EAAOF,GAAW,CAAE,UAAW3D,EAAK,SAAS,CAAE,EAC/C+D,EAAO,CAAC,GAAG,EACb/D,EAAK,OACL+D,EAAK,KAAK,EAAE,EAEZ/D,EAAK,QACL+D,EAAK,KAAK,mCAAmC,EACjD,MAAMC,EAAY,GAAGH,CAAI,MAAME,EAAK,KAAK,GAAG,CAAC,IAC7C,OAAO,IAAI,OAAO,IAAIN,EAAU,OAAOO,CAAS,IAAI,CACxD,CACO,MAAMC,GAAU5K,GAAW,SAC9B,MAAM6K,EAAQ7K,EAAS,aAAYQ,EAAAR,GAAA,YAAAA,EAAQ,UAAR,KAAAQ,EAAmB,CAAC,KAAIG,EAAAX,GAAA,YAAAA,EAAQ,UAAR,KAAAW,EAAmB,EAAE,IAAM,YACtF,OAAO,IAAI,OAAO,IAAIkK,CAAK,GAAG,CAClC,EAEaC,GAAU,UACVC,GAAS,oBACTC,GAAU,oBAMVC,GAAY,YAEZC,GAAY,YCjGZC,EAA0BC,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,SACjF,IAAIK,GACJA,EAAAN,EAAK,OAAL,OAAcA,EAAK,KAAO,CAAA,GAC1BA,EAAK,KAAK,IAAMC,GACfQ,GAAAH,EAAKN,EAAK,MAAM,WAAhB,OAA6BM,EAAG,SAAW,GAChD,CAAC,EACK6K,GAAmB,CACrB,OAAQ,SACR,OAAQ,SACR,OAAQ,MACZ,EACaC,GAAkCF,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,CACjGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAMoL,EAASF,GAAiB,OAAOlL,EAAI,KAAK,EAChDD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IAChBoH,GAAQ9G,EAAAL,EAAI,UAAYqL,EAAI,QAAUA,EAAI,mBAAlC,KAAAhL,EAAuD,OAAO,kBACxEL,EAAI,MAAQmH,IACRnH,EAAI,UACJqL,EAAI,QAAUrL,EAAI,MAElBqL,EAAI,iBAAmBrL,EAAI,MAEvC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,EACvBtL,EAAI,UAAYsL,EAAQ,OAAStL,EAAI,MAAQsL,EAAQ,MAAQtL,EAAI,QAGrEsL,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,UACN,QAAS,OAAOpL,EAAI,OAAU,SAAWA,EAAI,MAAM,UAAYA,EAAI,MACnE,MAAOsL,EAAQ,MACf,UAAWtL,EAAI,UACf,KAAAD,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYuL,GAAqCN,EAAkB,uBAAwB,CAAClL,EAAMC,IAAQ,CACvGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAMoL,EAASF,GAAiB,OAAOlL,EAAI,KAAK,EAChDD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IAChBoH,GAAQ9G,EAAAL,EAAI,UAAYqL,EAAI,QAAUA,EAAI,mBAAlC,KAAAhL,EAAuD,OAAO,kBACxEL,EAAI,MAAQmH,IACRnH,EAAI,UACJqL,EAAI,QAAUrL,EAAI,MAElBqL,EAAI,iBAAmBrL,EAAI,MAEvC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,EACvBtL,EAAI,UAAYsL,EAAQ,OAAStL,EAAI,MAAQsL,EAAQ,MAAQtL,EAAI,QAGrEsL,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,YACN,QAAS,OAAOpL,EAAI,OAAU,SAAWA,EAAI,MAAM,UAAYA,EAAI,MACnE,MAAOsL,EAAQ,MACf,UAAWtL,EAAI,UACf,KAAAD,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYwL,GACCP,EAAkB,sBAAuB,CAAClL,EAAMC,IAAQ,CAClEgL,EAAU,KAAKjL,EAAMC,CAAG,EACxBD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,IAAIM,GACHA,KAAKN,EAAK,KAAK,KAAK,aAApB,OAAmCM,EAAG,WAAaL,EAAI,MAC5D,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,GAAI,OAAOA,EAAQ,OAAU,OAAOtL,EAAI,MACpC,MAAM,IAAI,MAAM,oDAAoD,GACrD,OAAOsL,EAAQ,OAAU,SACtCA,EAAQ,MAAQtL,EAAI,QAAU,OAAO,CAAC,EACtCyL,GAAwBH,EAAQ,MAAOtL,EAAI,KAAK,IAAM,IAG5DsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,OAAOA,EAAQ,MACvB,KAAM,kBACN,QAAStL,EAAI,MACb,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACY0L,GAAsCT,EAAkB,wBAAyB,CAAClL,EAAMC,IAAQ,OACzGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxBA,EAAI,OAASA,EAAI,QAAU,UAC3B,MAAM2L,GAAQtL,EAAAL,EAAI,SAAJ,YAAAK,EAAY,SAAS,OAC7B+K,EAASO,EAAQ,MAAQ,SACzB,CAACC,EAASC,CAAO,EAAIC,GAA0B9L,EAAI,MAAM,EAC/DD,EAAK,KAAK,SAAS,KAAMA,GAAS,CAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IACtBsL,EAAI,OAASrL,EAAI,OACjBqL,EAAI,QAAUO,EACdP,EAAI,QAAUQ,EACVF,IACAN,EAAI,QAAUU,GACtB,CAAC,EACDhM,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MACtB,GAAIK,EAAO,CACP,GAAI,CAAC,OAAO,UAAU1R,CAAK,EAAG,CAU1BqR,EAAQ,OAAO,KAAK,CAChB,SAAUF,EACV,OAAQpL,EAAI,OACZ,KAAM,eACN,SAAU,GACV,MAAA/F,EACA,KAAA8F,CACpB,CAAiB,EACD,MASJ,CACA,GAAI,CAAC,OAAO,cAAc9F,CAAK,EAAG,CAC1BA,EAAQ,EAERqR,EAAQ,OAAO,KAAK,CAChB,MAAArR,EACA,KAAM,UACN,QAAS,OAAO,iBAChB,KAAM,kDACN,KAAA8F,EACA,OAAAqL,EACA,UAAW,GACX,SAAU,CAACpL,EAAI,KACvC,CAAqB,EAIDsL,EAAQ,OAAO,KAAK,CAChB,MAAArR,EACA,KAAM,YACN,QAAS,OAAO,iBAChB,KAAM,kDACN,KAAA8F,EACA,OAAAqL,EACA,UAAW,GACX,SAAU,CAACpL,EAAI,KACvC,CAAqB,EAEL,MACJ,CACJ,CACI/F,EAAQ2R,GACRN,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,MAAArR,EACA,KAAM,YACN,QAAA2R,EACA,UAAW,GACX,KAAA7L,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,EAED/F,EAAQ4R,GACRP,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,MAAArR,EACA,KAAM,UACN,QAAA4R,EACA,UAAW,GACX,KAAA9L,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CAET,CACJ,CAAC,EA0HYgM,GAAmCf,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,OACnG,IAAIK,EACJ2K,EAAU,KAAKjL,EAAMC,CAAG,GACvBK,KAAKN,EAAK,KAAK,KAAK,OAApB,OAA6BM,EAAG,KAAQiL,GAAY,CACjD,MAAM/R,EAAM+R,EAAQ,MACpB,MAAO,CAACW,GAAa1S,CAAG,GAAKA,EAAI,SAAW,MAChD,GACAwG,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMoH,GAAQ9G,EAAAN,EAAK,KAAK,IAAI,UAAd,KAAAM,EAAyB,OAAO,kBAC1CL,EAAI,QAAUmH,IACdpH,EAAK,KAAK,IAAI,QAAUC,EAAI,QACpC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAEtB,GADerR,EAAM,QACP+F,EAAI,QACd,OACJ,MAAMoL,EAASc,GAAyBjS,CAAK,EAC7CqR,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,UACN,QAASpL,EAAI,QACb,UAAW,GACX,MAAA/F,EACA,KAAA8F,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYmM,GAAmClB,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,OACnG,IAAIK,EACJ2K,EAAU,KAAKjL,EAAMC,CAAG,GACvBK,KAAKN,EAAK,KAAK,KAAK,OAApB,OAA6BM,EAAG,KAAQiL,GAAY,CACjD,MAAM/R,EAAM+R,EAAQ,MACpB,MAAO,CAACW,GAAa1S,CAAG,GAAKA,EAAI,SAAW,MAChD,GACAwG,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMoH,GAAQ9G,EAAAN,EAAK,KAAK,IAAI,UAAd,KAAAM,EAAyB,OAAO,kBAC1CL,EAAI,QAAUmH,IACdpH,EAAK,KAAK,IAAI,QAAUC,EAAI,QACpC,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAEtB,GADerR,EAAM,QACP+F,EAAI,QACd,OACJ,MAAMoL,EAASc,GAAyBjS,CAAK,EAC7CqR,EAAQ,OAAO,KAAK,CAChB,OAAAF,EACA,KAAM,YACN,QAASpL,EAAI,QACb,UAAW,GACX,MAAA/F,EACA,KAAA8F,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYoM,GAAsCnB,EAAkB,wBAAyB,CAAClL,EAAMC,IAAQ,OACzG,IAAIK,EACJ2K,EAAU,KAAKjL,EAAMC,CAAG,GACvBK,KAAKN,EAAK,KAAK,KAAK,OAApB,OAA6BM,EAAG,KAAQiL,GAAY,CACjD,MAAM/R,EAAM+R,EAAQ,MACpB,MAAO,CAACW,GAAa1S,CAAG,GAAKA,EAAI,SAAW,MAChD,GACAwG,EAAK,KAAK,SAAS,KAAMA,GAAS,CAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IACtBsL,EAAI,QAAUrL,EAAI,OAClBqL,EAAI,QAAUrL,EAAI,OAClBqL,EAAI,OAASrL,EAAI,MACrB,CAAC,EACDD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAChB7f,EAASwO,EAAM,OACrB,GAAIxO,IAAWuU,EAAI,OACf,OACJ,MAAMoL,EAASc,GAAyBjS,CAAK,EACvCoS,EAAS5gB,EAASuU,EAAI,OAC5BsL,EAAQ,OAAO,KAAK1H,EAAAP,EAAA,CAChB,OAAA+H,GACIiB,EAAS,CAAE,KAAM,UAAW,QAASrM,EAAI,QAAW,CAAE,KAAM,YAAa,QAASA,EAAI,MAAM,GAFhF,CAGhB,UAAW,GACX,MAAO,GACP,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,EAAS,CACL,CACJ,CAAC,EACYsM,GAAsCrB,EAAkB,wBAAyB,CAAClL,EAAMC,IAAQ,SACzG,IAAIK,EAAIG,EACRwK,EAAU,KAAKjL,EAAMC,CAAG,EACxBD,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,IACtBsL,EAAI,OAASrL,EAAI,OACbA,EAAI,WACJK,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAIrL,EAAI,OAAO,EAEpC,CAAC,EACGA,EAAI,SACHK,KAAKN,EAAK,MAAM,QAAhB,OAA0BM,EAAG,MAASiL,GAAY,CAC/CtL,EAAI,QAAQ,UAAY,EACpB,CAAAA,EAAI,QAAQ,KAAKsL,EAAQ,KAAK,GAElCA,EAAQ,OAAO,KAAK1H,EAAAP,EAAA,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQrD,EAAI,OACZ,MAAOsL,EAAQ,OACXtL,EAAI,QAAU,CAAE,QAASA,EAAI,QAAQ,UAAU,EAAK,IALxC,CAMhB,KAAAD,EACA,SAAU,CAACC,EAAI,KAC/B,EAAa,CACL,IAECQ,KAAKT,EAAK,MAAM,QAAhB,OAA0BS,EAAG,MAAQ,IAAM,CAAE,EACtD,CAAC,EACY+L,GAA+BtB,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3FsM,GAAsB,KAAKvM,EAAMC,CAAG,EACpCD,EAAK,KAAK,MAASuL,GAAY,CAC3BtL,EAAI,QAAQ,UAAY,EACpB,CAAAA,EAAI,QAAQ,KAAKsL,EAAQ,KAAK,GAElCA,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,QACR,MAAOA,EAAQ,MACf,QAAStL,EAAI,QAAQ,SAAQ,EAC7B,KAAAD,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYwM,GAAmCvB,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,QACnGK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUyM,IAC9BH,GAAsB,KAAKvM,EAAMC,CAAG,CACxC,CAAC,EACY0M,GAAmCzB,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,QACnGK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU2M,IAC9BL,GAAsB,KAAKvM,EAAMC,CAAG,CACxC,CAAC,EACY4M,GAAkC3B,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,CACjGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAM6M,EAAeC,GAAiB9M,EAAI,QAAQ,EAC5C+M,EAAU,IAAI,OAAO,OAAO/M,EAAI,UAAa,SAAW,MAAMA,EAAI,QAAQ,IAAI6M,CAAY,GAAKA,CAAY,EACjH7M,EAAI,QAAU+M,EACdhN,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,KACtBM,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAI0B,CAAO,CAC5B,CAAC,EACDhN,EAAK,KAAK,MAASuL,GAAY,CACvBA,EAAQ,MAAM,SAAStL,EAAI,SAAUA,EAAI,QAAQ,GAErDsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,WACR,SAAUtL,EAAI,SACd,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYgN,GAAoC/B,EAAkB,sBAAuB,CAAClL,EAAMC,IAAQ,OACrGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAM+M,EAAU,IAAI,OAAO,IAAID,GAAiB9M,EAAI,MAAM,CAAC,IAAI,GAC/DK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+M,GAC9BhN,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,KACtBM,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAI0B,CAAO,CAC5B,CAAC,EACDhN,EAAK,KAAK,MAASuL,GAAY,CACvBA,EAAQ,MAAM,WAAWtL,EAAI,MAAM,GAEvCsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,cACR,OAAQtL,EAAI,OACZ,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACYiN,GAAkChC,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,OACjGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxB,MAAM+M,EAAU,IAAI,OAAO,KAAKD,GAAiB9M,EAAI,MAAM,CAAC,GAAG,GAC/DK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+M,GAC9BhN,EAAK,KAAK,SAAS,KAAMA,GAAS,OAC9B,MAAMsL,EAAMtL,EAAK,KAAK,KACtBM,EAAAgL,EAAI,WAAJ,OAAiBA,EAAI,SAAW,IAAI,KACpCA,EAAI,SAAS,IAAI0B,CAAO,CAC5B,CAAC,EACDhN,EAAK,KAAK,MAASuL,GAAY,CACvBA,EAAQ,MAAM,SAAStL,EAAI,MAAM,GAErCsL,EAAQ,OAAO,KAAK,CAChB,OAAQ,SACR,KAAM,iBACN,OAAQ,YACR,OAAQtL,EAAI,OACZ,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EAyCYkN,GAAmCjC,EAAkB,qBAAsB,CAAClL,EAAMC,IAAQ,CACnGgL,EAAU,KAAKjL,EAAMC,CAAG,EACxBD,EAAK,KAAK,MAASuL,GAAY,CAC3BA,EAAQ,MAAQtL,EAAI,GAAGsL,EAAQ,KAAK,CACxC,CACJ,CAAC,EC9jBM,MAAM6B,EAAI,CACb,YAAY3G,EAAO,GAAI,CACnB,KAAK,QAAU,CAAA,EACf,KAAK,OAAS,EACV,OACA,KAAK,KAAOA,EACpB,CACA,SAASjG,EAAI,CACT,KAAK,QAAU,EACfA,EAAG,IAAI,EACP,KAAK,QAAU,CACnB,CACA,MAAM6M,EAAK,CACP,GAAI,OAAOA,GAAQ,WAAY,CAC3BA,EAAI,KAAM,CAAE,UAAW,MAAM,CAAE,EAC/BA,EAAI,KAAM,CAAE,UAAW,OAAO,CAAE,EAChC,MACJ,CAEA,MAAMC,EADUD,EACM,MAAM;AAAA,CAAI,EAAE,OAAQlI,GAAMA,CAAC,EAC3CoI,EAAY,KAAK,IAAI,GAAGD,EAAM,IAAKnI,GAAMA,EAAE,OAASA,EAAE,UAAS,EAAG,MAAM,CAAC,EACzEqI,EAAWF,EAAM,IAAKnI,GAAMA,EAAE,MAAMoI,CAAS,CAAC,EAAE,IAAKpI,GAAM,IAAI,OAAO,KAAK,OAAS,CAAC,EAAIA,CAAC,EAChG,UAAWsI,KAAQD,EACf,KAAK,QAAQ,KAAKC,CAAI,CAE9B,CACA,SAAU,OACN,MAAMzK,EAAI,SACJyD,EAAO,uBAAM,KAEb6G,EAAQ,CAAC,KADChN,EAAA,uBAAM,UAAN,KAAAA,EAAiB,CAAC,EAAE,GACV,IAAK6E,GAAM,KAAKA,CAAC,EAAE,CAAC,EAE9C,OAAO,IAAInC,EAAE,GAAGyD,EAAM6G,EAAM,KAAK;AAAA,CAAI,CAAC,CAC1C,CACJ,CClCO,MAAM/D,GAAU,CACnB,MAAO,EACP,MAAO,EACP,MAAO,CACX,ECGamE,EAAyBxC,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,WAC/E,IAAIK,EACJN,GAAA,OAASA,EAAO,IAChBA,EAAK,KAAK,IAAMC,EAChBD,EAAK,KAAK,IAAMA,EAAK,KAAK,KAAO,GACjCA,EAAK,KAAK,QAAUuJ,GACpB,MAAMlF,EAAS,CAAC,IAAI/D,EAAAN,EAAK,KAAK,IAAI,SAAd,KAAAM,EAAwB,CAAA,CAAG,EAE3CN,EAAK,KAAK,OAAO,IAAI,WAAW,GAChCqE,EAAO,QAAQrE,CAAI,EAEvB,UAAW2N,KAAMtJ,EACb,UAAW7D,KAAMmN,EAAG,KAAK,SACrBnN,EAAGR,CAAI,EAGf,GAAIqE,EAAO,SAAW,GAGjB5D,GAAAH,EAAKN,EAAK,MAAM,WAAhB,OAA6BM,EAAG,SAAW,KAC5C6F,EAAAnG,EAAK,KAAK,WAAV,MAAAmG,EAAoB,KAAK,IAAM,CAC3BnG,EAAK,KAAK,IAAMA,EAAK,KAAK,KAC9B,OAEC,CACD,MAAM4N,EAAY,CAACrC,EAASlH,EAAQuB,IAAQ,CACxC,IAAIiI,EAAYC,GAAavC,CAAO,EAChCwC,EACJ,UAAWJ,KAAMtJ,EAAQ,CACrB,GAAIsJ,EAAG,KAAK,IAAI,MAEZ,GAAI,CADcA,EAAG,KAAK,IAAI,KAAKpC,CAAO,EAEtC,iBAECsC,EACL,SAEJ,MAAMG,EAAUzC,EAAQ,OAAO,OACzBrL,EAAIyN,EAAG,KAAK,MAAMpC,CAAO,EAC/B,GAAIrL,aAAa,UAAW0F,GAAA,YAAAA,EAAK,SAAU,GACvC,MAAM,IAAI6B,GAEd,GAAIsG,GAAe7N,aAAa,QAC5B6N,GAAeA,GAAA,KAAAA,EAAe,QAAQ,QAAO,GAAI,KAAK,IAAYhG,EAAA,sBAC9D,MAAM7H,EACUqL,EAAQ,OAAO,SACfyC,IAEXH,IACDA,EAAYC,GAAavC,EAASyC,CAAO,GACjD,EAAC,MAEA,CAED,GADgBzC,EAAQ,OAAO,SACfyC,EACZ,SACCH,IACDA,EAAYC,GAAavC,EAASyC,CAAO,EACjD,CACJ,CACA,OAAID,EACOA,EAAY,KAAK,IACbxC,CACV,EAEEA,CACX,EACM0C,EAAqB,CAACC,EAAQ3C,EAAS3F,IAAQ,CAEjD,GAAIkI,GAAaI,CAAM,EACnB,OAAAA,EAAO,QAAU,GACVA,EAGX,MAAMC,EAAcP,EAAUrC,EAASlH,EAAQuB,CAAG,EAClD,GAAIuI,aAAuB,QAAS,CAChC,GAAIvI,EAAI,QAAU,GACd,MAAM,IAAI6B,GACd,OAAO0G,EAAY,KAAMA,GAAgBnO,EAAK,KAAK,MAAMmO,EAAavI,CAAG,CAAC,CAC9E,CACA,OAAO5F,EAAK,KAAK,MAAMmO,EAAavI,CAAG,CAC3C,EACA5F,EAAK,KAAK,IAAM,CAACuL,EAAS3F,IAAQ,CAC9B,GAAIA,EAAI,WACJ,OAAO5F,EAAK,KAAK,MAAMuL,EAAS3F,CAAG,EAEvC,GAAIA,EAAI,YAAc,WAAY,CAG9B,MAAMsI,EAASlO,EAAK,KAAK,MAAM,CAAE,MAAOuL,EAAQ,MAAO,OAAQ,CAAA,CAAE,EAAI1H,EAAAP,EAAA,GAAKsC,GAAL,CAAU,WAAY,IAAM,EACjG,OAAIsI,aAAkB,QACXA,EAAO,KAAMA,GACTD,EAAmBC,EAAQ3C,EAAS3F,CAAG,CACjD,EAEEqI,EAAmBC,EAAQ3C,EAAS3F,CAAG,CAClD,CAEA,MAAMtK,EAAS0E,EAAK,KAAK,MAAMuL,EAAS3F,CAAG,EAC3C,GAAItK,aAAkB,QAAS,CAC3B,GAAIsK,EAAI,QAAU,GACd,MAAM,IAAI6B,GACd,OAAOnM,EAAO,KAAMA,GAAWsS,EAAUtS,EAAQ+I,EAAQuB,CAAG,CAAC,CACjE,CACA,OAAOgI,EAAUtS,EAAQ+I,EAAQuB,CAAG,CACxC,CACJ,CAEAwI,EAAgBpO,EAAM,YAAa,KAAO,CACtC,SAAWvU,GAAU,OACjB,GAAI,CACA,MAAM4iB,EAAInG,GAAUlI,EAAMvU,CAAK,EAC/B,OAAO4iB,EAAE,QAAU,CAAE,MAAOA,EAAE,IAAI,EAAK,CAAE,QAAQ/N,EAAA+N,EAAE,QAAF,YAAA/N,EAAS,MAAM,CACpE,OACOJ,EAAG,CACN,OAAOmI,GAAerI,EAAMvU,CAAK,EAAE,KAAM4iB,GAAC,OAAM,OAAAA,EAAE,QAAU,CAAE,MAAOA,EAAE,IAAI,EAAK,CAAE,QAAQ/N,EAAA+N,EAAE,QAAF,YAAA/N,EAAS,MAAM,EAAG,CAChH,CACJ,EACA,OAAQ,MACR,QAAS,CACjB,EAAM,CACN,CAAC,EAEYgO,GAA2BpD,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,WACnFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,SAAUmG,EAAA,CAAC,IAAI1F,GAAAH,EAAAN,GAAA,YAAAA,EAAM,KAAK,MAAX,YAAAM,EAAgB,WAAhB,KAAAG,EAA4B,CAAA,CAAG,EAAE,IAAG,IAAzC,KAAA0F,EAA+CoI,GAAevO,EAAK,KAAK,GAAG,EAC/FA,EAAK,KAAK,MAAQ,CAACuL,EAASrL,IAAM,CAC9B,GAAID,EAAI,OACJ,GAAI,CACAsL,EAAQ,MAAQ,OAAOA,EAAQ,KAAK,CACxC,OACOrL,EAAG,CAAE,CAChB,OAAI,OAAOqL,EAAQ,OAAU,UAE7BA,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAOA,EAAQ,MACf,KAAAvL,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EACYiD,EAAiCtD,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAE/FwO,GAA6B,KAAKzO,EAAMC,CAAG,EAC3CqO,GAAW,KAAKtO,EAAMC,CAAG,CAC7B,CAAC,EACYyO,GAAyBxD,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU0O,IAC9BH,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY2O,GAAyB1D,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,SAC/E,GAAIA,EAAI,QAAS,CAWb,MAAMrS,EAVa,CACf,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,CAChB,EAC6BqS,EAAI,OAAO,EAChC,GAAIrS,IAAM,OACN,MAAM,IAAI,MAAM,0BAA0BqS,EAAI,OAAO,GAAG,GAC5DK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU4O,GAAajhB,CAAC,EAChD,MAEI6S,EAAAR,EAAI,UAAJ,OAAgBA,EAAI,QAAU4O,GAAY,GAC9CL,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY6O,GAA0B5D,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU8O,IAC9BP,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY+O,GAAwB9D,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7EuO,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,MAASuL,GAAY,CAC3B,GAAI,CAEA,MAAM0D,EAAU1D,EAAQ,MAAM,KAAI,EAE5B2D,EAAM,IAAI,IAAID,CAAO,EACvBhP,EAAI,WACJA,EAAI,SAAS,UAAY,EACpBA,EAAI,SAAS,KAAKiP,EAAI,QAAQ,GAC/B3D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,KAAM,mBACN,QAAStL,EAAI,SAAS,OACtB,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KACvC,CAAqB,GAGLA,EAAI,WACJA,EAAI,SAAS,UAAY,EACpBA,EAAI,SAAS,KAAKiP,EAAI,SAAS,SAAS,GAAG,EAAIA,EAAI,SAAS,MAAM,EAAG,EAAE,EAAIA,EAAI,QAAQ,GACxF3D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,KAAM,mBACN,QAAStL,EAAI,SAAS,OACtB,MAAOsL,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KACvC,CAAqB,GAILA,EAAI,UAEJsL,EAAQ,MAAQ2D,EAAI,KAIpB3D,EAAQ,MAAQ0D,EAEpB,MACJ,OACO/O,EAAG,CACNqL,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CACL,CACJ,CACJ,CAAC,EACYkP,GAA0BjE,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUmP,GAAa,GAC3CZ,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYoP,GAA2BnE,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUqP,IAC9Bd,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYsP,GAAyBrE,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUuP,IAC9BhB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYwP,GAA0BvE,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUyP,IAC9BlB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY0P,GAAyBzE,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU2P,IAC9BpB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY4P,GAAwB3E,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,QAC7EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU6P,IAC9BtB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY8P,GAA0B7E,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,QACjFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+P,IAC9BxB,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYgQ,GAAgC/E,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,QAC7FK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUiQ,GAAiBjQ,CAAG,GAClDuO,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYkQ,GAA4BjF,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,QACrFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUmQ,IAC9B5B,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYoQ,GAA4BnF,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,QACrFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUqQ,GAAarQ,CAAG,GAC9CuO,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYsQ,GAAgCrF,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,QAC7FK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUuQ,IAC9BhC,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACYwQ,GAAyBvF,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUyQ,IAC9BlC,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,OAAS,MAC3B,CAAC,EACY2Q,GAAyBzF,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU2Q,IAC9BpC,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,OAAS,OACvBA,EAAK,KAAK,MAASuL,GAAY,CAC3B,GAAI,CAEA,IAAI,IAAI,WAAWA,EAAQ,KAAK,GAAG,CAEvC,OACM7D,EAAA,CACF6D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,OACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CACL,CACJ,CACJ,CAAC,EAMY4Q,GAA2B3F,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU6Q,IAC9BtC,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EACY8Q,GAA2B7F,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU+Q,IAC9BxC,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAM0F,EAAQ1F,EAAQ,MAAM,MAAM,GAAG,EACrC,GAAI,CACA,GAAI0F,EAAM,SAAW,EACjB,MAAM,IAAI,MACd,KAAM,CAACC,EAASC,CAAM,EAAIF,EAC1B,GAAI,CAACE,EACD,MAAM,IAAI,MACd,MAAMC,EAAY,OAAOD,CAAM,EAC/B,GAAI,GAAGC,CAAS,KAAOD,EACnB,MAAM,IAAI,MACd,GAAIC,EAAY,GAAKA,EAAY,IAC7B,MAAM,IAAI,MAEd,IAAI,IAAI,WAAWF,CAAO,GAAG,CACjC,OACMxJ,EAAA,CACF6D,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,SACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC/B,CAAa,CACL,CACJ,CACJ,CAAC,EAEM,SAASoR,GAAcnc,EAAM,CAChC,GAAIA,IAAS,GACT,MAAO,GACX,GAAIA,EAAK,OAAS,IAAM,EACpB,MAAO,GACX,GAAI,CAEA,YAAKA,CAAI,EACF,EACX,OACMwS,EAAA,CACF,MAAO,EACX,CACJ,CACO,MAAM4J,GAA2BpG,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,QACnFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUsR,IAC9B/C,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,gBAAkB,SAChCA,EAAK,KAAK,MAASuL,GAAY,CACvB8F,GAAc9F,EAAQ,KAAK,GAE/BA,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,SACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EAEM,SAASuR,GAAiBtc,EAAM,CACnC,GAAI,CAACuc,GAAkB,KAAKvc,CAAI,EAC5B,MAAO,GACX,MAAM6U,EAAS7U,EAAK,QAAQ,QAAUtJ,GAAOA,IAAM,IAAM,IAAM,GAAI,EAC7D8lB,EAAS3H,EAAO,OAAO,KAAK,KAAKA,EAAO,OAAS,CAAC,EAAI,EAAG,GAAG,EAClE,OAAOsH,GAAcK,CAAM,CAC/B,CACO,MAAMC,GAA8BzG,EAAkB,gBAAiB,CAAClL,EAAMC,IAAQ,QACzFK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAUwR,IAC9BjD,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,IAAI,gBAAkB,YAChCA,EAAK,KAAK,MAASuL,GAAY,CACvBiG,GAAiBjG,EAAQ,KAAK,GAElCA,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,YACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EACY2R,GAAyB1G,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,QAC/EK,EAAAL,EAAI,UAAJ,OAAgBA,EAAI,QAAU4R,IAC9BrD,EAAiB,KAAKxO,EAAMC,CAAG,CACnC,CAAC,EAEM,SAAS6R,GAAWC,EAAOC,EAAY,KAAM,CAChD,GAAI,CACA,MAAMC,EAAcF,EAAM,MAAM,GAAG,EACnC,GAAIE,EAAY,SAAW,EACvB,MAAO,GACX,KAAM,CAAC9Y,CAAM,EAAI8Y,EACjB,GAAI,CAAC9Y,EACD,MAAO,GAEX,MAAM+Y,EAAe,KAAK,MAAM,KAAK/Y,CAAM,CAAC,EAK5C,MAJI,UAAS+Y,IAAgBA,GAAA,YAAAA,EAAc,OAAQ,OAE/C,CAACA,EAAa,KAEdF,IAAc,EAAE,QAASE,IAAiBA,EAAa,MAAQF,GAGvE,OACMtK,EAAA,CACF,MAAO,EACX,CACJ,CACO,MAAMyK,GAAwBjH,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7EuO,EAAiB,KAAKxO,EAAMC,CAAG,EAC/BD,EAAK,KAAK,MAASuL,GAAY,CACvBuG,GAAWvG,EAAQ,MAAOtL,EAAI,GAAG,GAErCsL,EAAQ,OAAO,KAAK,CAChB,KAAM,iBACN,OAAQ,MACR,MAAOA,EAAQ,MACf,KAAAvL,EACA,SAAU,CAACC,EAAI,KAC3B,CAAS,CACL,CACJ,CAAC,EAeYmS,GAA2BlH,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,OACnFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,SAAUM,EAAAN,EAAK,KAAK,IAAI,UAAd,KAAAM,EAAyB+R,GAC7CrS,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,GAAIvH,EAAI,OACJ,GAAI,CACAsL,EAAQ,MAAQ,OAAOA,EAAQ,KAAK,CACxC,OACOrL,EAAG,CAAE,CAChB,MAAMhG,EAAQqR,EAAQ,MACtB,GAAI,OAAOrR,GAAU,UAAY,CAAC,OAAO,MAAMA,CAAK,GAAK,OAAO,SAASA,CAAK,EAC1E,OAAOqR,EAEX,MAAM+G,EAAW,OAAOpY,GAAU,SAC5B,OAAO,MAAMA,CAAK,EACd,MACC,OAAO,SAASA,CAAK,EAElB,OADA,WAER,OACN,OAAAqR,EAAQ,OAAO,KAAKjI,EAAA,CAChB,SAAU,SACV,KAAM,eACN,MAAApJ,EACA,KAAA8F,GACIsS,EAAW,CAAE,SAAAA,CAAQ,EAAK,GACjC,EACM/G,CACX,CACJ,CAAC,EACYgH,GAAiCrH,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAC/FuS,GAA6B,KAAKxS,EAAMC,CAAG,EAC3CmS,GAAW,KAAKpS,EAAMC,CAAG,CAC7B,CAAC,EACYwS,GAA4BvH,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,QAAU0S,GACpB1S,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,GAAIvH,EAAI,OACJ,GAAI,CACAsL,EAAQ,MAAQ,EAAQA,EAAQ,KACpC,OACOrL,EAAG,CAAE,CAChB,MAAMhG,EAAQqR,EAAQ,MACtB,OAAI,OAAOrR,GAAU,WAErBqR,EAAQ,OAAO,KAAK,CAChB,SAAU,UACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EAgFYoH,GAA4BzH,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAASuL,GAAYA,CACnC,CAAC,EACYqH,GAA0B1H,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,KACxB+D,EAAQ,OAAO,KAAK,CAChB,SAAU,QACV,KAAM,eACN,MAAOA,EAAQ,MACf,KAAAvL,CACZ,CAAS,EACMuL,EAEf,CAAC,EAwCD,SAASsH,GAAkBvX,EAAQwX,EAAOC,EAAO,CACzCzX,EAAO,OAAO,QACdwX,EAAM,OAAO,KAAK,GAAGE,GAAkBD,EAAOzX,EAAO,MAAM,CAAC,EAEhEwX,EAAM,MAAMC,CAAK,EAAIzX,EAAO,KAChC,CACO,MAAM2X,GAA0B/H,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAM1L,EAAQqR,EAAQ,MACtB,GAAI,CAAC,MAAM,QAAQrR,CAAK,EACpB,OAAAqR,EAAQ,OAAO,KAAK,CAChB,SAAU,QACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAEXA,EAAQ,MAAQ,MAAMrR,EAAM,MAAM,EAClC,MAAMgZ,EAAQ,CAAA,EACd,QAAS/hB,EAAI,EAAGA,EAAI+I,EAAM,OAAQ/I,IAAK,CACnC,MAAMgiB,EAAOjZ,EAAM/I,CAAC,EACdmK,EAAS2E,EAAI,QAAQ,KAAK,IAAI,CAChC,MAAOkT,EACP,OAAQ,CAAA,CACxB,EAAevN,CAAG,EACFtK,aAAkB,QAClB4X,EAAM,KAAK5X,EAAO,KAAMA,GAAWuX,GAAkBvX,EAAQiQ,EAASpa,CAAC,CAAC,CAAC,EAGzE0hB,GAAkBvX,EAAQiQ,EAASpa,CAAC,CAE5C,CACA,OAAI+hB,EAAM,OACC,QAAQ,IAAIA,CAAK,EAAE,KAAK,IAAM3H,CAAO,EAEzCA,CACX,CACJ,CAAC,EACD,SAAS6H,GAAqB9X,EAAQwX,EAAO/X,EAAKb,EAAOmZ,EAAe,CACpE,GAAI/X,EAAO,OAAO,OAAQ,CAEtB,GAAI+X,GAAiB,EAAEtY,KAAOb,GAC1B,OAEJ4Y,EAAM,OAAO,KAAK,GAAGE,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,CAC9D,CACIA,EAAO,QAAU,OACbP,KAAOb,IACP4Y,EAAM,MAAM/X,CAAG,EAAI,QAIvB+X,EAAM,MAAM/X,CAAG,EAAIO,EAAO,KAElC,CACA,SAASgY,GAAarT,EAAK,aACvB,MAAMG,EAAO,OAAO,KAAKH,EAAI,KAAK,EAClC,UAAWtS,KAAKyS,EACZ,GAAI,GAAC8F,GAAAC,GAAA1F,GAAAH,EAAAL,EAAI,QAAJ,YAAAK,EAAY3S,KAAZ,YAAA8S,EAAgB,OAAhB,YAAA0F,EAAsB,SAAtB,MAAAD,EAA8B,IAAI,aACnC,MAAM,IAAI,MAAM,2BAA2BvY,CAAC,0BAA0B,EAG9E,MAAM4lB,EAAQC,GAAkBvT,EAAI,KAAK,EACzC,OAAO4D,EAAAP,EAAA,GACArD,GADA,CAEH,KAAAG,EACA,OAAQ,IAAI,IAAIA,CAAI,EACpB,QAASA,EAAK,OACd,aAAc,IAAI,IAAImT,CAAK,CACnC,EACA,CACA,SAASE,GAAeP,EAAOhZ,EAAOqR,EAAS3F,EAAK3F,EAAKD,EAAM,CAC3D,MAAM0T,EAAe,CAAA,EAEfC,EAAS1T,EAAI,OACb2T,EAAY3T,EAAI,SAAS,KACzBhP,EAAI2iB,EAAU,IAAI,KAClBP,EAAgBO,EAAU,SAAW,WAC3C,UAAW7Y,KAAOb,EAAO,CACrB,GAAIyZ,EAAO,IAAI5Y,CAAG,EACd,SACJ,GAAI9J,IAAM,QAAS,CACfyiB,EAAa,KAAK3Y,CAAG,EACrB,QACJ,CACA,MAAMsT,EAAIuF,EAAU,IAAI,CAAE,MAAO1Z,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EAC1DyI,aAAa,QACb6E,EAAM,KAAK7E,EAAE,KAAMA,GAAM+E,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAAC,CAAC,EAGrFD,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAElE,CASA,OARIK,EAAa,QACbnI,EAAQ,OAAO,KAAK,CAChB,KAAM,oBACN,KAAMmI,EACN,MAAAxZ,EACA,KAAA8F,CACZ,CAAS,EAEAkT,EAAM,OAEJ,QAAQ,IAAIA,CAAK,EAAE,KAAK,IACpB3H,CACV,EAHUA,CAIf,CACO,MAAMsI,GAA2B3I,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CAEnFyN,EAAS,KAAK1N,EAAMC,CAAG,EAEvB,MAAM9T,EAAO,OAAO,yBAAyB8T,EAAK,OAAO,EACzD,GAAI,EAAC9T,GAAA,MAAAA,EAAM,KAAK,CACZ,MAAM2nB,EAAK7T,EAAI,MACf,OAAO,eAAeA,EAAK,QAAS,CAChC,IAAK,IAAM,CACP,MAAM8T,EAAQzQ,EAAA,GAAKwQ,GACnB,cAAO,eAAe7T,EAAK,QAAS,CAChC,MAAO8T,CAC3B,CAAiB,EACMA,CACX,CACZ,CAAS,CACL,CACA,MAAMC,EAAcC,GAAY,IAAMX,GAAarT,CAAG,CAAC,EACvDmO,EAAgBpO,EAAK,KAAM,aAAc,IAAM,OAC3C,MAAM+D,EAAQ9D,EAAI,MACZiU,EAAa,CAAA,EACnB,UAAWnZ,KAAOgJ,EAAO,CACrB,MAAMoQ,EAAQpQ,EAAMhJ,CAAG,EAAE,KACzB,GAAIoZ,EAAM,OAAQ,EACd7T,EAAA4T,EAAWnZ,CAAG,IAAd,OAAoBmZ,EAAWnZ,CAAG,EAAI,IAAI,KAC1C,UAAWnN,KAAKumB,EAAM,OAClBD,EAAWnZ,CAAG,EAAE,IAAInN,CAAC,CAC7B,CACJ,CACA,OAAOsmB,CACX,CAAC,EACD,MAAMpR,EAAWsR,GACXC,EAAWpU,EAAI,SACrB,IAAIxU,EACJuU,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChCna,GAAA,OAAUA,EAAQuoB,EAAY,OAC9B,MAAM9Z,EAAQqR,EAAQ,MACtB,GAAI,CAACzI,EAAS5I,CAAK,EACf,OAAAqR,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAEXA,EAAQ,MAAQ,CAAA,EAChB,MAAM2H,EAAQ,CAAA,EACRnP,EAAQtY,EAAM,MACpB,UAAWsP,KAAOtP,EAAM,KAAM,CAC1B,MAAM4b,EAAKtD,EAAMhJ,CAAG,EACdsY,EAAgBhM,EAAG,KAAK,SAAW,WACnCgH,EAAIhH,EAAG,KAAK,IAAI,CAAE,MAAOnN,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACxDyI,aAAa,QACb6E,EAAM,KAAK7E,EAAE,KAAMA,GAAM+E,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAAC,CAAC,EAGrFD,GAAqB/E,EAAG9C,EAASxQ,EAAKb,EAAOmZ,CAAa,CAElE,CACA,OAAKgB,EAGEZ,GAAeP,EAAOhZ,EAAOqR,EAAS3F,EAAKoO,EAAY,MAAOhU,CAAI,EAF9DkT,EAAM,OAAS,QAAQ,IAAIA,CAAK,EAAE,KAAK,IAAM3H,CAAO,EAAIA,CAGvE,CACJ,CAAC,EACY+I,GAA8BpJ,EAAkB,gBAAiB,CAAClL,EAAMC,IAAQ,CAEzF4T,GAAW,KAAK7T,EAAMC,CAAG,EACzB,MAAMsU,EAAavU,EAAK,KAAK,MACvBgU,EAAcC,GAAY,IAAMX,GAAarT,CAAG,CAAC,EACjDuU,EAAoBzQ,GAAU,OAChC,MAAM0Q,EAAM,IAAIrH,GAAI,CAAC,QAAS,UAAW,KAAK,CAAC,EACzCsH,EAAaV,EAAY,MACzBW,EAAY5Z,GAAQ,CACtB,MAAMpN,EAAIinB,GAAS7Z,CAAG,EACtB,MAAO,SAASpN,CAAC,6BAA6BA,CAAC,uBACnD,EACA8mB,EAAI,MAAM,8BAA8B,EACxC,MAAMI,EAAM,OAAO,OAAO,IAAI,EAC9B,IAAIC,EAAU,EACd,UAAW/Z,KAAO2Z,EAAW,KACzBG,EAAI9Z,CAAG,EAAI,OAAO+Z,GAAS,GAG/BL,EAAI,MAAM,uBAAuB,EACjC,UAAW1Z,KAAO2Z,EAAW,KAAM,CAC/B,MAAMK,EAAKF,EAAI9Z,CAAG,EACZpN,EAAIinB,GAAS7Z,CAAG,EAChBmJ,EAASH,EAAMhJ,CAAG,EAClBsY,KAAgB/S,EAAA4D,GAAA,YAAAA,EAAQ,OAAR,YAAA5D,EAAc,UAAW,WAC/CmU,EAAI,MAAM,SAASM,CAAE,MAAMJ,EAAS5Z,CAAG,CAAC,GAAG,EACvCsY,GAEAoB,EAAI,MAAM;AAAA,cACZM,CAAE;AAAA,gBACApnB,CAAC;AAAA,qDACoConB,CAAE;AAAA;AAAA,kCAErBpnB,CAAC,qBAAqBA,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,cAK3ConB,CAAE;AAAA,gBACApnB,CAAC;AAAA,wBACOA,CAAC;AAAA;AAAA;AAAA,sBAGHA,CAAC,OAAOonB,CAAE;AAAA;AAAA;AAAA,OAGzB,EAGSN,EAAI,MAAM;AAAA,cACZM,CAAE;AAAA,mDACmCA,CAAE;AAAA;AAAA,gCAErBpnB,CAAC,qBAAqBA,CAAC;AAAA;AAAA;AAAA;AAAA,cAIzConB,CAAE;AAAA,gBACApnB,CAAC;AAAA,wBACOA,CAAC;AAAA;AAAA;AAAA,sBAGHA,CAAC,OAAOonB,CAAE;AAAA;AAAA;AAAA,OAGzB,CAEC,CACAN,EAAI,MAAM,4BAA4B,EACtCA,EAAI,MAAM,iBAAiB,EAC3B,MAAMjU,EAAKiU,EAAI,QAAO,EACtB,MAAO,CAAClJ,EAAS3F,IAAQpF,EAAGuD,EAAOwH,EAAS3F,CAAG,CACnD,EACA,IAAIoP,EACJ,MAAMlS,EAAWsR,GACXa,EAAM,CAACC,GAAkB,QAEzBC,EAAcF,GADDG,GACmB,MAChCf,EAAWpU,EAAI,SACrB,IAAIxU,EACJuU,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChCna,GAAA,OAAUA,EAAQuoB,EAAY,OAC9B,MAAM9Z,EAAQqR,EAAQ,MACtB,OAAKzI,EAAS5I,CAAK,EASf+a,GAAOE,IAAevP,GAAA,YAAAA,EAAK,SAAU,IAASA,EAAI,UAAY,IAEzDoP,IACDA,EAAWR,EAAiBvU,EAAI,KAAK,GACzCsL,EAAUyJ,EAASzJ,EAAS3F,CAAG,EAC1ByO,EAEEZ,GAAe,CAAA,EAAIvZ,EAAOqR,EAAS3F,EAAKna,EAAOuU,CAAI,EAD/CuL,GAGRgJ,EAAWhJ,EAAS3F,CAAG,GAjB1B2F,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAYf,CACJ,CAAC,EACD,SAAS8J,GAAmBC,EAASxC,EAAO9S,EAAM4F,EAAK,CACnD,UAAWtK,KAAUga,EACjB,GAAIha,EAAO,OAAO,SAAW,EACzB,OAAAwX,EAAM,MAAQxX,EAAO,MACdwX,EAGf,MAAMyC,EAAaD,EAAQ,OAAQjH,GAAM,CAACP,GAAaO,CAAC,CAAC,EACzD,OAAIkH,EAAW,SAAW,GACtBzC,EAAM,MAAQyC,EAAW,CAAC,EAAE,MACrBA,EAAW,CAAC,IAEvBzC,EAAM,OAAO,KAAK,CACd,KAAM,gBACN,MAAOA,EAAM,MACb,KAAA9S,EACA,OAAQsV,EAAQ,IAAKha,GAAWA,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAAC,CAC/G,CAAK,EACMkL,EACX,CACO,MAAM0C,GAA0BtK,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,QAAQ,KAAM,GAAM,EAAE,KAAK,QAAU,UAAU,EAAI,WAAa,MAAS,EACvHmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,QAAQ,KAAM,GAAM,EAAE,KAAK,SAAW,UAAU,EAAI,WAAa,MAAS,EACzHmO,EAAgBpO,EAAK,KAAM,SAAU,IAAM,CACvC,GAAIC,EAAI,QAAQ,MAAO,GAAM,EAAE,KAAK,MAAM,EACtC,OAAO,IAAI,IAAIA,EAAI,QAAQ,QAASwV,GAAW,MAAM,KAAKA,EAAO,KAAK,MAAM,CAAC,CAAC,CAGtF,CAAC,EACDrH,EAAgBpO,EAAK,KAAM,UAAW,IAAM,CACxC,GAAIC,EAAI,QAAQ,MAAO,GAAM,EAAE,KAAK,OAAO,EAAG,CAC1C,MAAMyV,EAAWzV,EAAI,QAAQ,IAAKiD,GAAMA,EAAE,KAAK,OAAO,EACtD,OAAO,IAAI,OAAO,KAAKwS,EAAS,IAAK5gB,GAAM6gB,GAAgB7gB,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,CACvF,CAEJ,CAAC,EACD,MAAM8gB,EAAS3V,EAAI,QAAQ,SAAW,EAChC4V,EAAQ5V,EAAI,QAAQ,CAAC,EAAE,KAAK,IAClCD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIgQ,EACA,OAAOC,EAAMtK,EAAS3F,CAAG,EAE7B,IAAIkQ,EAAQ,GACZ,MAAMR,EAAU,CAAA,EAChB,UAAWG,KAAUxV,EAAI,QAAS,CAC9B,MAAM3E,EAASma,EAAO,KAAK,IAAI,CAC3B,MAAOlK,EAAQ,MACf,OAAQ,CAAA,CACxB,EAAe3F,CAAG,EACN,GAAItK,aAAkB,QAClBga,EAAQ,KAAKha,CAAM,EACnBwa,EAAQ,OAEP,CACD,GAAIxa,EAAO,OAAO,SAAW,EACzB,OAAOA,EACXga,EAAQ,KAAKha,CAAM,CACvB,CACJ,CACA,OAAKwa,EAEE,QAAQ,IAAIR,CAAO,EAAE,KAAMA,GACvBD,GAAmBC,EAAS/J,EAASvL,EAAM4F,CAAG,CACxD,EAHUyP,GAAmBC,EAAS/J,EAASvL,EAAM4F,CAAG,CAI7D,CACJ,CAAC,EAgIYmQ,GAAiC7K,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAC/FyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAM1L,EAAQqR,EAAQ,MAChBvU,EAAOiJ,EAAI,KAAK,KAAK,IAAI,CAAE,MAAO/F,EAAO,OAAQ,CAAA,CAAE,EAAI0L,CAAG,EAC1DoQ,EAAQ/V,EAAI,MAAM,KAAK,IAAI,CAAE,MAAO/F,EAAO,OAAQ,CAAA,CAAE,EAAI0L,CAAG,EAElE,OADc5O,aAAgB,SAAWgf,aAAiB,QAE/C,QAAQ,IAAI,CAAChf,EAAMgf,CAAK,CAAC,EAAE,KAAK,CAAC,CAAChf,EAAMgf,CAAK,IACzCC,GAA0B1K,EAASvU,EAAMgf,CAAK,CACxD,EAEEC,GAA0B1K,EAASvU,EAAMgf,CAAK,CACzD,CACJ,CAAC,EACD,SAASE,GAAYrR,EAAGtP,EAAG,CAGvB,GAAIsP,IAAMtP,EACN,MAAO,CAAE,MAAO,GAAM,KAAMsP,CAAC,EAEjC,GAAIA,aAAa,MAAQtP,aAAa,MAAQ,CAACsP,GAAM,CAACtP,EAClD,MAAO,CAAE,MAAO,GAAM,KAAMsP,CAAC,EAEjC,GAAIsR,GAAmBtR,CAAC,GAAKsR,GAAmB5gB,CAAC,EAAG,CAChD,MAAM6gB,EAAQ,OAAO,KAAK7gB,CAAC,EACrB8gB,EAAa,OAAO,KAAKxR,CAAC,EAAE,OAAQ9J,GAAQqb,EAAM,QAAQrb,CAAG,IAAM,EAAE,EACrEub,EAAShT,IAAA,GAAKuB,GAAMtP,GAC1B,UAAWwF,KAAOsb,EAAY,CAC1B,MAAME,EAAcL,GAAYrR,EAAE9J,CAAG,EAAGxF,EAAEwF,CAAG,CAAC,EAC9C,GAAI,CAACwb,EAAY,MACb,MAAO,CACH,MAAO,GACP,eAAgB,CAACxb,EAAK,GAAGwb,EAAY,cAAc,CACvE,EAEYD,EAAOvb,CAAG,EAAIwb,EAAY,IAC9B,CACA,MAAO,CAAE,MAAO,GAAM,KAAMD,CAAM,CACtC,CACA,GAAI,MAAM,QAAQzR,CAAC,GAAK,MAAM,QAAQtP,CAAC,EAAG,CACtC,GAAIsP,EAAE,SAAWtP,EAAE,OACf,MAAO,CAAE,MAAO,GAAO,eAAgB,CAAA,CAAE,EAE7C,MAAMihB,EAAW,CAAA,EACjB,QAASzD,EAAQ,EAAGA,EAAQlO,EAAE,OAAQkO,IAAS,CAC3C,MAAM0D,EAAQ5R,EAAEkO,CAAK,EACf2D,EAAQnhB,EAAEwd,CAAK,EACfwD,EAAcL,GAAYO,EAAOC,CAAK,EAC5C,GAAI,CAACH,EAAY,MACb,MAAO,CACH,MAAO,GACP,eAAgB,CAACxD,EAAO,GAAGwD,EAAY,cAAc,CACzE,EAEYC,EAAS,KAAKD,EAAY,IAAI,CAClC,CACA,MAAO,CAAE,MAAO,GAAM,KAAMC,CAAQ,CACxC,CACA,MAAO,CAAE,MAAO,GAAO,eAAgB,CAAA,CAAE,CAC7C,CACA,SAASP,GAA0B3a,EAAQtE,EAAMgf,EAAO,CAEpD,MAAMW,EAAY,IAAI,IACtB,IAAIC,EACJ,UAAWpR,KAAOxO,EAAK,OACnB,GAAIwO,EAAI,OAAS,oBAAqB,CAClCoR,GAAA,OAAeA,EAAapR,GAC5B,UAAW7X,KAAK6X,EAAI,KACXmR,EAAU,IAAIhpB,CAAC,GAChBgpB,EAAU,IAAIhpB,EAAG,EAAE,EACvBgpB,EAAU,IAAIhpB,CAAC,EAAE,EAAI,EAE7B,MAEI2N,EAAO,OAAO,KAAKkK,CAAG,EAG9B,UAAWA,KAAOwQ,EAAM,OACpB,GAAIxQ,EAAI,OAAS,oBACb,UAAW7X,KAAK6X,EAAI,KACXmR,EAAU,IAAIhpB,CAAC,GAChBgpB,EAAU,IAAIhpB,EAAG,EAAE,EACvBgpB,EAAU,IAAIhpB,CAAC,EAAE,EAAI,QAIzB2N,EAAO,OAAO,KAAKkK,CAAG,EAI9B,MAAMqR,EAAW,CAAC,GAAGF,CAAS,EAAE,OAAO,CAAC,CAAA,CAAG7pB,CAAC,IAAMA,EAAE,GAAKA,EAAE,CAAC,EAAE,IAAI,CAAC,CAACa,CAAC,IAAMA,CAAC,EAI5E,GAHIkpB,EAAS,QAAUD,GACnBtb,EAAO,OAAO,KAAKuI,EAAAP,EAAA,GAAKsT,GAAL,CAAiB,KAAMC,GAAU,EAEpD/I,GAAaxS,CAAM,EACnB,OAAOA,EACX,MAAMwb,EAASZ,GAAYlf,EAAK,MAAOgf,EAAM,KAAK,EAClD,GAAI,CAACc,EAAO,MACR,MAAM,IAAI,MAAM,wCAA6C,KAAK,UAAUA,EAAO,cAAc,CAAC,EAAE,EAExG,OAAAxb,EAAO,MAAQwb,EAAO,KACfxb,CACX,CA8EO,MAAMyb,GAA2B7L,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAM1L,EAAQqR,EAAQ,MACtB,GAAI,CAAC4K,GAAmBjc,CAAK,EACzB,OAAAqR,EAAQ,OAAO,KAAK,CAChB,SAAU,SACV,KAAM,eACN,MAAArR,EACA,KAAA8F,CAChB,CAAa,EACMuL,EAEX,MAAM2H,EAAQ,CAAA,EACR8D,EAAS/W,EAAI,QAAQ,KAAK,OAChC,GAAI+W,EAAQ,CACRzL,EAAQ,MAAQ,CAAA,EAChB,MAAM0L,EAAa,IAAI,IACvB,UAAWlc,KAAOic,EACd,GAAI,OAAOjc,GAAQ,UAAY,OAAOA,GAAQ,UAAY,OAAOA,GAAQ,SAAU,CAC/Ekc,EAAW,IAAI,OAAOlc,GAAQ,SAAWA,EAAI,SAAQ,EAAKA,CAAG,EAC7D,MAAMO,EAAS2E,EAAI,UAAU,KAAK,IAAI,CAAE,MAAO/F,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACxEtK,aAAkB,QAClB4X,EAAM,KAAK5X,EAAO,KAAMA,GAAW,CAC3BA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAMxQ,CAAG,EAAIO,EAAO,KAChC,CAAC,CAAC,GAGEA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAMxQ,CAAG,EAAIO,EAAO,MAEpC,CAEJ,IAAIoY,EACJ,UAAW3Y,KAAOb,EACT+c,EAAW,IAAIlc,CAAG,IACnB2Y,EAAeA,GAAA,KAAAA,EAAgB,CAAA,EAC/BA,EAAa,KAAK3Y,CAAG,GAGzB2Y,GAAgBA,EAAa,OAAS,GACtCnI,EAAQ,OAAO,KAAK,CAChB,KAAM,oBACN,MAAArR,EACA,KAAA8F,EACA,KAAM0T,CAC1B,CAAiB,CAET,KACK,CACDnI,EAAQ,MAAQ,CAAA,EAChB,UAAWxQ,KAAO,QAAQ,QAAQb,CAAK,EAAG,CACtC,GAAIa,IAAQ,YACR,SACJ,IAAImc,EAAYjX,EAAI,QAAQ,KAAK,IAAI,CAAE,MAAOlF,EAAK,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACpE,GAAIsR,aAAqB,QACrB,MAAM,IAAI,MAAM,sDAAsD,EAK1E,GADwB,OAAOnc,GAAQ,UAAYsX,GAAe,KAAKtX,CAAG,GAAKmc,EAAU,OAAO,OAC3E,CACjB,MAAMC,EAAclX,EAAI,QAAQ,KAAK,IAAI,CAAE,MAAO,OAAOlF,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EAChF,GAAIuR,aAAuB,QACvB,MAAM,IAAI,MAAM,sDAAsD,EAEtEA,EAAY,OAAO,SAAW,IAC9BD,EAAYC,EAEpB,CACA,GAAID,EAAU,OAAO,OAAQ,CACrBjX,EAAI,OAAS,QAEbsL,EAAQ,MAAMxQ,CAAG,EAAIb,EAAMa,CAAG,EAI9BwQ,EAAQ,OAAO,KAAK,CAChB,KAAM,cACN,OAAQ,SACR,OAAQ2L,EAAU,OAAO,IAAK1R,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,EACjF,MAAO7M,EACP,KAAM,CAACA,CAAG,EACV,KAAAiF,CAC5B,CAAyB,EAEL,QACJ,CACA,MAAM1E,EAAS2E,EAAI,UAAU,KAAK,IAAI,CAAE,MAAO/F,EAAMa,CAAG,EAAG,OAAQ,CAAA,CAAE,EAAI6K,CAAG,EACxEtK,aAAkB,QAClB4X,EAAM,KAAK5X,EAAO,KAAMA,GAAW,CAC3BA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAM2L,EAAU,KAAK,EAAI5b,EAAO,KAC5C,CAAC,CAAC,GAGEA,EAAO,OAAO,QACdiQ,EAAQ,OAAO,KAAK,GAAGyH,GAAkBjY,EAAKO,EAAO,MAAM,CAAC,EAEhEiQ,EAAQ,MAAM2L,EAAU,KAAK,EAAI5b,EAAO,MAEhD,CACJ,CACA,OAAI4X,EAAM,OACC,QAAQ,IAAIA,CAAK,EAAE,KAAK,IAAM3H,CAAO,EAEzCA,CACX,CACJ,CAAC,EAmGY6L,GAAyBlM,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EyN,EAAS,KAAK1N,EAAMC,CAAG,EACvB,MAAM+W,EAASK,GAAmBpX,EAAI,OAAO,EACvCqX,EAAY,IAAI,IAAIN,CAAM,EAChChX,EAAK,KAAK,OAASsX,EACnBtX,EAAK,KAAK,QAAU,IAAI,OAAO,KAAKgX,EAC/B,OAAQrpB,GAAM4pB,GAAsB,IAAI,OAAO5pB,CAAC,CAAC,EACjD,IAAK,GAAO,OAAO,GAAM,SAAWof,GAAiB,CAAC,EAAI,EAAE,UAAW,EACvE,KAAK,GAAG,CAAC,IAAI,EAClB/M,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,MAAMtN,EAAQqR,EAAQ,MACtB,OAAI+L,EAAU,IAAIpd,CAAK,GAGvBqR,EAAQ,OAAO,KAAK,CAChB,KAAM,gBACN,OAAAyL,EACA,MAAA9c,EACA,KAAA8F,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EACYiM,GAA4BtM,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CAErF,GADAyN,EAAS,KAAK1N,EAAMC,CAAG,EACnBA,EAAI,OAAO,SAAW,EACtB,MAAM,IAAI,MAAM,mDAAmD,EAEvE,MAAM+W,EAAS,IAAI,IAAI/W,EAAI,MAAM,EACjCD,EAAK,KAAK,OAASgX,EACnBhX,EAAK,KAAK,QAAU,IAAI,OAAO,KAAKC,EAAI,OACnC,IAAKiD,GAAO,OAAOA,GAAM,SAAW6J,GAAiB7J,CAAC,EAAIA,EAAI6J,GAAiB7J,EAAE,SAAQ,CAAE,EAAI,OAAOA,CAAC,CAAE,EACzG,KAAK,GAAG,CAAC,IAAI,EAClBlD,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,MAAMtN,EAAQqR,EAAQ,MACtB,OAAIyL,EAAO,IAAI9c,CAAK,GAGpBqR,EAAQ,OAAO,KAAK,CAChB,KAAM,gBACN,OAAQtL,EAAI,OACZ,MAAA/F,EACA,KAAA8F,CACZ,CAAS,EACMuL,CACX,CACJ,CAAC,EAiBYkM,GAA8BvM,EAAkB,gBAAiB,CAAClL,EAAMC,IAAQ,CACzFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,MAAM,IAAI8R,GAAqB1X,EAAK,YAAY,IAAI,EAExD,MAAM2X,EAAO1X,EAAI,UAAUsL,EAAQ,MAAOA,CAAO,EACjD,GAAI3F,EAAI,MAEJ,OADe+R,aAAgB,QAAUA,EAAO,QAAQ,QAAQA,CAAI,GACtD,KAAMC,IAChBrM,EAAQ,MAAQqM,EACTrM,EACV,EAEL,GAAIoM,aAAgB,QAChB,MAAM,IAAIlQ,GAEd,OAAA8D,EAAQ,MAAQoM,EACTpM,CACX,CACJ,CAAC,EACD,SAASsM,GAAqBvc,EAAQpB,EAAO,CACzC,OAAIoB,EAAO,OAAO,QAAUpB,IAAU,OAC3B,CAAE,OAAQ,GAAI,MAAO,MAAS,EAElCoB,CACX,CACO,MAAMwc,GAA6B5M,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,WAClBA,EAAK,KAAK,OAAS,WACnBoO,EAAgBpO,EAAK,KAAM,SAAU,IAC1BC,EAAI,UAAU,KAAK,OAAS,IAAI,IAAI,CAAC,GAAGA,EAAI,UAAU,KAAK,OAAQ,MAAS,CAAC,EAAI,MAC3F,EACDmO,EAAgBpO,EAAK,KAAM,UAAW,IAAM,CACxC,MAAMgN,EAAU/M,EAAI,UAAU,KAAK,QACnC,OAAO+M,EAAU,IAAI,OAAO,KAAK2I,GAAgB3I,EAAQ,MAAM,CAAC,KAAK,EAAI,MAC7E,CAAC,EACDhN,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAI3F,EAAI,UAAU,KAAK,QAAU,WAAY,CACzC,MAAM3E,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAM+S,GAAMwJ,GAAqBxJ,EAAG9C,EAAQ,KAAK,CAAC,EAC7DsM,GAAqBvc,EAAQiQ,EAAQ,KAAK,CACrD,CACA,OAAIA,EAAQ,QAAU,OACXA,EAEJtL,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,CAC9C,CACJ,CAAC,EACYmS,GAAkC7M,EAAkB,oBAAqB,CAAClL,EAAMC,IAAQ,CAEjG6X,GAAa,KAAK9X,EAAMC,CAAG,EAE3BmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,UAAW,IAAMC,EAAI,UAAU,KAAK,OAAO,EAEtED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IACjB3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,CAElD,CAAC,EACYoS,GAA6B9M,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,UAAU,KAAK,KAAK,EAClEmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,UAAW,IAAM,CACxC,MAAMgN,EAAU/M,EAAI,UAAU,KAAK,QACnC,OAAO+M,EAAU,IAAI,OAAO,KAAK2I,GAAgB3I,EAAQ,MAAM,CAAC,SAAS,EAAI,MACjF,CAAC,EACDoB,EAAgBpO,EAAK,KAAM,SAAU,IAC1BC,EAAI,UAAU,KAAK,OAAS,IAAI,IAAI,CAAC,GAAGA,EAAI,UAAU,KAAK,OAAQ,IAAI,CAAC,EAAI,MACtF,EACDD,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAEpB2F,EAAQ,QAAU,KACXA,EACJtL,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,CAElD,CAAC,EACYqS,GAA4B/M,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFyN,EAAS,KAAK1N,EAAMC,CAAG,EAEvBD,EAAK,KAAK,MAAQ,WAClBoO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,OAAO3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAG9C,GAAI2F,EAAQ,QAAU,OAClB,OAAAA,EAAQ,MAAQtL,EAAI,aAIbsL,EAGX,MAAMjQ,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAMA,GAAW4c,GAAoB5c,EAAQ2E,CAAG,CAAC,EAE5DiY,GAAoB5c,EAAQ2E,CAAG,CAC1C,CACJ,CAAC,EACD,SAASiY,GAAoB3M,EAAStL,EAAK,CACvC,OAAIsL,EAAQ,QAAU,SAClBA,EAAQ,MAAQtL,EAAI,cAEjBsL,CACX,CACO,MAAM4M,GAA6BjN,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,WAClBoO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,KACpBA,EAAI,YAAc,YAIlB2F,EAAQ,QAAU,SAClBA,EAAQ,MAAQtL,EAAI,cAEjBA,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAElD,CAAC,EACYwS,GAAgClN,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7FyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,SAAU,IAAM,CACvC,MAAMpS,EAAIqS,EAAI,UAAU,KAAK,OAC7B,OAAOrS,EAAI,IAAI,IAAI,CAAC,GAAGA,CAAC,EAAE,OAAQuX,GAAMA,IAAM,MAAS,CAAC,EAAI,MAChE,CAAC,EACDnF,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,MAAMtK,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAMA,GAAW+c,GAAwB/c,EAAQ0E,CAAI,CAAC,EAEjEqY,GAAwB/c,EAAQ0E,CAAI,CAC/C,CACJ,CAAC,EACD,SAASqY,GAAwB9M,EAASvL,EAAM,CAC5C,MAAI,CAACuL,EAAQ,OAAO,QAAUA,EAAQ,QAAU,QAC5CA,EAAQ,OAAO,KAAK,CAChB,KAAM,eACN,SAAU,cACV,MAAOA,EAAQ,MACf,KAAAvL,CACZ,CAAS,EAEEuL,CACX,CAkBO,MAAM+M,GAA0BpN,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,UAAU,KAAK,KAAK,EAClEmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,OAAO3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAG9C,MAAMtK,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAMA,IAChBiQ,EAAQ,MAAQjQ,EAAO,MACnBA,EAAO,OAAO,SACdiQ,EAAQ,MAAQtL,EAAI,WAAW4D,EAAAP,EAAA,GACxBiI,GADwB,CAE3B,MAAO,CACH,OAAQjQ,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAC1G,EACwB,MAAO2D,EAAQ,KACvC,EAAqB,EACDA,EAAQ,OAAS,CAAA,GAEdA,EACV,GAELA,EAAQ,MAAQjQ,EAAO,MACnBA,EAAO,OAAO,SACdiQ,EAAQ,MAAQtL,EAAI,WAAW4D,EAAAP,EAAA,GACxBiI,GADwB,CAE3B,MAAO,CACH,OAAQjQ,EAAO,OAAO,IAAKkK,GAAQmC,GAAmBnC,EAAKI,EAAKgC,GAAW,CAAE,CAAC,CAClG,EACgB,MAAO2D,EAAQ,KAC/B,EAAa,EACDA,EAAQ,OAAS,CAAA,GAEdA,EACX,CACJ,CAAC,EAgBYgN,GAAyBrN,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,GAAG,KAAK,MAAM,EAC7DmO,EAAgBpO,EAAK,KAAM,QAAS,IAAMC,EAAI,GAAG,KAAK,KAAK,EAC3DmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,IAAI,KAAK,MAAM,EAC9DmO,EAAgBpO,EAAK,KAAM,aAAc,IAAMC,EAAI,GAAG,KAAK,UAAU,EACrED,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAAY,CAC9B,MAAMoQ,EAAQ/V,EAAI,IAAI,KAAK,IAAIsL,EAAS3F,CAAG,EAC3C,OAAIoQ,aAAiB,QACVA,EAAM,KAAMA,GAAUwC,GAAiBxC,EAAO/V,EAAI,GAAI2F,CAAG,CAAC,EAE9D4S,GAAiBxC,EAAO/V,EAAI,GAAI2F,CAAG,CAC9C,CACA,MAAM5O,EAAOiJ,EAAI,GAAG,KAAK,IAAIsL,EAAS3F,CAAG,EACzC,OAAI5O,aAAgB,QACTA,EAAK,KAAMA,GAASwhB,GAAiBxhB,EAAMiJ,EAAI,IAAK2F,CAAG,CAAC,EAE5D4S,GAAiBxhB,EAAMiJ,EAAI,IAAK2F,CAAG,CAC9C,CACJ,CAAC,EACD,SAAS4S,GAAiBxhB,EAAMiD,EAAM2L,EAAK,CACvC,OAAI5O,EAAK,OAAO,QAEZA,EAAK,QAAU,GACRA,GAEJiD,EAAK,KAAK,IAAI,CAAE,MAAOjD,EAAK,MAAO,OAAQA,EAAK,MAAM,EAAI4O,CAAG,CACxE,CAuDO,MAAM6S,GAA6BvN,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFyN,EAAS,KAAK1N,EAAMC,CAAG,EACvBmO,EAAgBpO,EAAK,KAAM,aAAc,IAAMC,EAAI,UAAU,KAAK,UAAU,EAC5EmO,EAAgBpO,EAAK,KAAM,SAAU,IAAMC,EAAI,UAAU,KAAK,MAAM,EACpEmO,EAAgBpO,EAAK,KAAM,QAAS,IAAA,SAAM,OAAAS,GAAAH,EAAAL,EAAI,YAAJ,YAAAK,EAAe,OAAf,YAAAG,EAAqB,MAAK,EACpE2N,EAAgBpO,EAAK,KAAM,SAAU,IAAA,SAAM,OAAAS,GAAAH,EAAAL,EAAI,YAAJ,YAAAK,EAAe,OAAf,YAAAG,EAAqB,OAAM,EACtET,EAAK,KAAK,MAAQ,CAACuL,EAAS3F,IAAQ,CAChC,GAAIA,EAAI,YAAc,WAClB,OAAO3F,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAE9C,MAAMtK,EAAS2E,EAAI,UAAU,KAAK,IAAIsL,EAAS3F,CAAG,EAClD,OAAItK,aAAkB,QACXA,EAAO,KAAKod,EAAoB,EAEpCA,GAAqBpd,CAAM,CACtC,CACJ,CAAC,EACD,SAASod,GAAqBnN,EAAS,CACnC,OAAAA,EAAQ,MAAQ,OAAO,OAAOA,EAAQ,KAAK,EACpCA,CACX,CA0JO,MAAMoN,GAA2BzN,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnF2Y,EAAiB,KAAK5Y,EAAMC,CAAG,EAC/ByN,EAAS,KAAK1N,EAAMC,CAAG,EACvBD,EAAK,KAAK,MAAQ,CAACuL,EAASrL,IACjBqL,EAEXvL,EAAK,KAAK,MAASuL,GAAY,CAC3B,MAAMrR,EAAQqR,EAAQ,MAChB8C,EAAIpO,EAAI,GAAG/F,CAAK,EACtB,GAAImU,aAAa,QACb,OAAOA,EAAE,KAAMA,GAAMwK,GAAmBxK,EAAG9C,EAASrR,EAAO8F,CAAI,CAAC,EAEpE6Y,GAAmBxK,EAAG9C,EAASrR,EAAO8F,CAAI,CAE9C,CACJ,CAAC,EACD,SAAS6Y,GAAmBvd,EAAQiQ,EAASrR,EAAO8F,EAAM,OACtD,GAAI,CAAC1E,EAAQ,CACT,MAAMwd,EAAO,CACT,KAAM,SACN,MAAA5e,EACA,KAAA8F,EACA,KAAM,CAAC,IAAIM,EAAAN,EAAK,KAAK,IAAI,OAAd,KAAAM,EAAsB,CAAA,CAAG,EACpC,SAAU,CAACN,EAAK,KAAK,IAAI,KAErC,EACYA,EAAK,KAAK,IAAI,SACd8Y,EAAK,OAAS9Y,EAAK,KAAK,IAAI,QAChCuL,EAAQ,OAAO,KAAKwN,GAAWD,CAAI,CAAC,CACxC,CACJ,CC5iEA,IAAIxY,GAGG,MAAM0Y,EAAa,CACtB,aAAc,CACV,KAAK,KAAO,IAAI,QAChB,KAAK,OAAS,IAAI,GACtB,CACA,IAAI9U,KAAW+U,EAAO,CAClB,MAAMC,EAAOD,EAAM,CAAC,EACpB,YAAK,KAAK,IAAI/U,EAAQgV,CAAI,EACtBA,GAAQ,OAAOA,GAAS,UAAY,OAAQA,GAC5C,KAAK,OAAO,IAAIA,EAAK,GAAIhV,CAAM,EAE5B,IACX,CACA,OAAQ,CACJ,YAAK,KAAO,IAAI,QAChB,KAAK,OAAS,IAAI,IACX,IACX,CACA,OAAOA,EAAQ,CACX,MAAMgV,EAAO,KAAK,KAAK,IAAIhV,CAAM,EACjC,OAAIgV,GAAQ,OAAOA,GAAS,UAAY,OAAQA,GAC5C,KAAK,OAAO,OAAOA,EAAK,EAAE,EAE9B,KAAK,KAAK,OAAOhV,CAAM,EAChB,IACX,CACA,IAAIA,EAAQ,OAGR,MAAMpP,EAAIoP,EAAO,KAAK,OACtB,GAAIpP,EAAG,CACH,MAAMqkB,EAAK7V,EAAA,IAAMhD,EAAA,KAAK,IAAIxL,CAAC,IAAV,KAAAwL,EAAe,CAAA,GAChC,OAAO6Y,EAAG,GACV,MAAMrsB,EAAIwW,IAAA,GAAK6V,GAAO,KAAK,KAAK,IAAIjV,CAAM,GAC1C,OAAO,OAAO,KAAKpX,CAAC,EAAE,OAASA,EAAI,MACvC,CACA,OAAO,KAAK,KAAK,IAAIoX,CAAM,CAC/B,CACA,IAAIA,EAAQ,CACR,OAAO,KAAK,KAAK,IAAIA,CAAM,CAC/B,CACJ,CAEO,SAASkV,IAAW,CACvB,OAAO,IAAIJ,EACf,SACC1Y,OAAK,YAAY,uBAAjB,OAA0CA,GAAG,qBAAuB8Y,GAAQ,GACtE,MAAMC,GAAiB,WAAW,qBC7ClC,SAASC,GAAQvU,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,UACHiW,EAAqBzZ,CAAM,EACjC,CACL,CAUO,SAAS0Z,GAAOzU,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS2Z,GAAM1U,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS4Z,GAAM3U,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS6Z,GAAQ5U,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,GACP,QAAS,MACNiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS8Z,GAAQ7U,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,GACP,QAAS,MACNiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS+Z,GAAQ9U,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,GACP,QAAS,MACNiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASga,GAAK/U,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,MACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS2J,GAAO1E,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASia,GAAQhV,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASka,GAAMjV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASma,GAAOlV,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASoa,GAAMnV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASqa,GAAKpV,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,MACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASsa,GAAOrV,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,QACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASua,GAAMtV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASwa,GAAMvV,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAYO,SAASya,GAAQxV,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS0a,GAAQzV,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS2a,GAAQ1V,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,SACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS4a,GAAW3V,EAAOjF,EAAQ,CACtC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,YACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS6a,GAAM5V,EAAOjF,EAAQ,CACjC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS8a,GAAK7V,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,MACR,MAAO,gBACP,MAAO,IACJiW,EAAqBzZ,CAAM,EACjC,CACL,CASO,SAAS+a,GAAa9V,EAAOjF,EAAQ,CACxC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,WACR,MAAO,gBACP,OAAQ,GACR,MAAO,GACP,UAAW,MACRiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASgb,GAAS/V,EAAOjF,EAAQ,CACpC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,iBACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASib,GAAShW,EAAOjF,EAAQ,CACpC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,OACR,MAAO,gBACP,UAAW,MACRiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASkb,GAAajW,EAAOjF,EAAQ,CACxC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,WACR,MAAO,iBACJiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAASmb,GAAQlW,EAAOjF,EAAQ,CACnC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,OAAQ,CAAA,GACLiW,EAAqBzZ,CAAM,EACjC,CACL,CAWO,SAASob,GAAKnW,EAAOjF,EAAQ,CAChC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACN,MAAO,gBACP,MAAO,GACP,OAAQ,WACLiW,EAAqBzZ,CAAM,EACjC,CACL,CA0CO,SAASqb,GAASpW,EAAOjF,EAAQ,CACpC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,WACHiW,EAAqBzZ,CAAM,EACjC,CACL,CAwEO,SAASsb,GAASrW,EAAO,CAC5B,OAAO,IAAIA,EAAM,CACb,KAAM,SACd,CAAK,CACL,CAEO,SAASsW,GAAOtW,EAAOjF,EAAQ,CAClC,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,SACHiW,EAAqBzZ,CAAM,EACjC,CACL,CA+BO,SAASwb,GAAI7vB,EAAOqU,EAAQ,CAC/B,OAAO,IAAIyb,GAAyB1X,EAAAP,EAAA,CAChC,MAAO,aACJiW,EAAqBzZ,CAAM,GAFE,CAGhC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAEO,SAAS+vB,GAAK/vB,EAAOqU,EAAQ,CAChC,OAAO,IAAIyb,GAAyB1X,EAAAP,EAAA,CAChC,MAAO,aACJiW,EAAqBzZ,CAAM,GAFE,CAGhC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAKO,SAASgwB,GAAIhwB,EAAOqU,EAAQ,CAC/B,OAAO,IAAI4b,GAA4B7X,EAAAP,EAAA,CACnC,MAAO,gBACJiW,EAAqBzZ,CAAM,GAFK,CAGnC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAEO,SAASkwB,GAAKlwB,EAAOqU,EAAQ,CAChC,OAAO,IAAI4b,GAA4B7X,EAAAP,EAAA,CACnC,MAAO,gBACJiW,EAAqBzZ,CAAM,GAFK,CAGnC,MAAArU,EACA,UAAW,EACnB,EAAK,CACL,CAwBO,SAASmwB,GAAYnwB,EAAOqU,EAAQ,CACvC,OAAO,IAAI+b,GAA2BhY,EAAAP,EAAA,CAClC,MAAO,eACJiW,EAAqBzZ,CAAM,GAFI,CAGlC,MAAArU,CACR,EAAK,CACL,CA0BO,SAASqwB,GAAWhQ,EAAShM,EAAQ,CAMxC,OALW,IAAIic,GAA0BlY,EAAAP,EAAA,CACrC,MAAO,cACJiW,EAAqBzZ,CAAM,GAFO,CAGrC,QAAAgM,CACR,EAAK,CAEL,CAEO,SAASkQ,GAAWnQ,EAAS/L,EAAQ,CACxC,OAAO,IAAImc,GAA0BpY,EAAAP,EAAA,CACjC,MAAO,cACJiW,EAAqBzZ,CAAM,GAFG,CAGjC,QAAA+L,CACR,EAAK,CACL,CAEO,SAASqQ,GAAQxwB,EAAQoU,EAAQ,CACpC,OAAO,IAAIqc,GAA6BtY,EAAAP,EAAA,CACpC,MAAO,iBACJiW,EAAqBzZ,CAAM,GAFM,CAGpC,OAAApU,CACR,EAAK,CACL,CAEO,SAAS0wB,GAAOpP,EAASlN,EAAQ,CACpC,OAAO,IAAIuc,GAAsBxY,EAAAP,EAAA,CAC7B,MAAO,gBACP,OAAQ,SACLiW,EAAqBzZ,CAAM,GAHD,CAI7B,QAAAkN,CACR,EAAK,CACL,CAEO,SAASsP,GAAWxc,EAAQ,CAC/B,OAAO,IAAIyc,GAA0BjZ,EAAA,CACjC,MAAO,gBACP,OAAQ,aACLiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS0c,GAAW1c,EAAQ,CAC/B,OAAO,IAAI2c,GAA0BnZ,EAAA,CACjC,MAAO,gBACP,OAAQ,aACLiW,EAAqBzZ,CAAM,EACjC,CACL,CAEO,SAAS4c,GAAUC,EAAU7c,EAAQ,CACxC,OAAO,IAAI8c,GAAyB/Y,EAAAP,EAAA,CAChC,MAAO,gBACP,OAAQ,YACLiW,EAAqBzZ,CAAM,GAHE,CAIhC,SAAA6c,CACR,EAAK,CACL,CAEO,SAASE,GAAY1L,EAAQrR,EAAQ,CACxC,OAAO,IAAIgd,GAA2BjZ,EAAAP,EAAA,CAClC,MAAO,gBACP,OAAQ,eACLiW,EAAqBzZ,CAAM,GAHI,CAIlC,OAAAqR,CACR,EAAK,CACL,CAEO,SAAS4L,GAAUC,EAAQld,EAAQ,CACtC,OAAO,IAAImd,GAAyBpZ,EAAAP,EAAA,CAChC,MAAO,gBACP,OAAQ,aACLiW,EAAqBzZ,CAAM,GAHE,CAIhC,OAAAkd,CACR,EAAK,CACL,CAmBO,SAASE,GAAWC,EAAI,CAC3B,OAAO,IAAIC,GAA0B,CACjC,MAAO,YACP,GAAAD,CACR,CAAK,CACL,CAGO,SAASE,GAAWC,EAAM,CAC7B,OAAOJ,GAAYhjB,GAAUA,EAAM,UAAUojB,CAAI,CAAC,CACtD,CAGO,SAASC,IAAQ,CACpB,OAAOL,GAAYhjB,GAAUA,EAAM,KAAI,CAAE,CAC7C,CAGO,SAASsjB,IAAe,CAC3B,OAAON,GAAYhjB,GAAUA,EAAM,YAAW,CAAE,CACpD,CAGO,SAASujB,IAAe,CAC3B,OAAOP,GAAYhjB,GAAUA,EAAM,YAAW,CAAE,CACpD,CAGO,SAASwjB,IAAW,CACvB,OAAOR,GAAYhjB,GAAUyjB,GAAazjB,CAAK,CAAC,CACpD,CAEO,SAAS0jB,GAAO7Y,EAAO8Y,EAAS/d,EAAQ,CAC3C,OAAO,IAAIiF,EAAMzB,EAAA,CACb,KAAM,QACN,QAAAua,GAIGtE,EAAqBzZ,CAAM,EACjC,CACL,CAwOO,SAASge,GAAQ/Y,EAAOvE,EAAIoD,EAAS,CAOxC,OANe,IAAImB,EAAMzB,EAAA,CACrB,KAAM,SACN,MAAO,SACP,GAAI9C,GACD+Y,EAAqB3V,CAAO,EAClC,CAEL,CAEO,SAASma,GAAavd,EAAI,CAC7B,MAAMmN,EAAKqQ,GAAQzS,IACfA,EAAQ,SAAY/E,GAAU,aAC1B,GAAI,OAAOA,GAAU,SACjB+E,EAAQ,OAAO,KAAKwN,GAAWvS,EAAO+E,EAAQ,MAAOoC,EAAG,KAAK,GAAG,CAAC,MAEhE,CAED,MAAMsQ,EAASzX,EACXyX,EAAO,QACPA,EAAO,SAAW,KACtB3d,EAAA2d,EAAO,OAAP,OAAgBA,EAAO,KAAO,WAC9Bxd,EAAAwd,EAAO,QAAP,OAAiBA,EAAO,MAAQ1S,EAAQ,QACxCpF,EAAA8X,EAAO,OAAP,OAAgBA,EAAO,KAAOtQ,IAC9BzH,EAAA+X,EAAO,WAAP,OAAoBA,EAAO,SAAW,CAACtQ,EAAG,KAAK,IAAI,OACnDpC,EAAQ,OAAO,KAAKwN,GAAWkF,CAAM,CAAC,CAC1C,CACJ,EACOzd,EAAG+K,EAAQ,MAAOA,CAAO,EACnC,EACD,OAAOoC,CACX,CAEO,SAASqQ,GAAOxd,EAAIV,EAAQ,CAC/B,MAAM6N,EAAK,IAAIiL,EAAiBtV,EAAA,CAC5B,MAAO,UACJiW,EAAqBzZ,CAAM,EACjC,EACD,OAAA6N,EAAG,KAAK,MAAQnN,EACTmN,CACX,CCj9BO,SAASuQ,GAAkBpe,EAAQ,uBAEtC,IAAIsC,GAAS9B,EAAAR,GAAA,YAAAA,EAAQ,SAAR,KAAAQ,EAAkB,gBAC/B,OAAI8B,IAAW,YACXA,EAAS,YACTA,IAAW,YACXA,EAAS,YACN,CACH,YAAY3B,EAAAX,EAAO,aAAP,KAAAW,EAAqB,CAAA,EACjC,kBAAkB0F,EAAArG,GAAA,YAAAA,EAAQ,WAAR,KAAAqG,EAAoBkT,GACtC,OAAAjX,EACA,iBAAiB8D,EAAApG,GAAA,YAAAA,EAAQ,kBAAR,KAAAoG,EAA2B,QAC5C,UAAUE,EAAAtG,GAAA,YAAAA,EAAQ,WAAR,KAAAsG,GAAqB,IAAM,CAAE,GACvC,IAAIH,EAAAnG,GAAA,YAAAA,EAAQ,KAAR,KAAAmG,EAAc,SAClB,QAAS,EACT,KAAM,IAAI,IACV,QAAQI,EAAAvG,GAAA,YAAAA,EAAQ,SAAR,KAAAuG,EAAkB,MAC1B,QAAQL,EAAAlG,GAAA,YAAAA,EAAQ,SAAR,KAAAkG,EAAkB,SAC1B,UAAUM,EAAAxG,GAAA,YAAAA,EAAQ,WAAR,KAAAwG,EAAoB,MACtC,CACA,CACO,SAAS6X,EAAQja,EAAQ0B,EAAKhC,EAAU,CAAE,KAAM,CAAA,EAAI,WAAY,CAAA,GAAM,WACzE,IAAItD,EACJ,MAAML,EAAMiE,EAAO,KAAK,IAElBka,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChC,GAAIka,EACA,OAAAA,EAAK,QAEWxa,EAAQ,WAAW,SAASM,CAAM,IAE9Cka,EAAK,MAAQxa,EAAQ,MAElBwa,EAAK,OAGhB,MAAM9iB,EAAS,CAAE,OAAQ,CAAA,EAAI,MAAO,EAAG,MAAO,OAAW,KAAMsI,EAAQ,IAAI,EAC3EgC,EAAI,KAAK,IAAI1B,EAAQ5I,CAAM,EAE3B,MAAM+iB,GAAiB5d,GAAAH,EAAA4D,EAAO,MAAK,eAAZ,YAAAzD,EAAA,KAAAH,GACvB,GAAI+d,EACA/iB,EAAO,OAAS+iB,MAEf,CACD,MAAMve,EAAS+D,EAAAP,EAAA,GACRM,GADQ,CAEX,WAAY,CAAC,GAAGA,EAAQ,WAAYM,CAAM,EAC1C,KAAMN,EAAQ,IAC1B,GACQ,GAAIM,EAAO,KAAK,kBACZA,EAAO,KAAK,kBAAkB0B,EAAKtK,EAAO,OAAQwE,CAAM,MAEvD,CACD,MAAMwe,EAAQhjB,EAAO,OACfijB,EAAY3Y,EAAI,WAAW3F,EAAI,IAAI,EACzC,GAAI,CAACse,EACD,MAAM,IAAI,MAAM,uDAAuDte,EAAI,IAAI,EAAE,EAErFse,EAAUra,EAAQ0B,EAAK0Y,EAAOxe,CAAM,CACxC,CACA,MAAM0e,EAASta,EAAO,KAAK,OACvBsa,IAEKljB,EAAO,MACRA,EAAO,IAAMkjB,GACjBL,EAAQK,EAAQ5Y,EAAK9F,CAAM,EAC3B8F,EAAI,KAAK,IAAI4Y,CAAM,EAAE,SAAW,GAExC,CAEA,MAAMtF,EAAOtT,EAAI,iBAAiB,IAAI1B,CAAM,EAC5C,OAAIgV,GACA,OAAO,OAAO5d,EAAO,OAAQ4d,CAAI,EACjCtT,EAAI,KAAO,SAAW6Y,EAAeva,CAAM,IAE3C,OAAO5I,EAAO,OAAO,SACrB,OAAOA,EAAO,OAAO,SAGrBsK,EAAI,KAAO,SAAWtK,EAAO,OAAO,aACnC6K,GAAA7F,EAAKhF,EAAO,QAAQ,UAApB,OAAgCgF,EAAG,QAAUhF,EAAO,OAAO,YAChE,OAAOA,EAAO,OAAO,UAELsK,EAAI,KAAK,IAAI1B,CAAM,EACpB,MACnB,CACO,SAASwa,GAAY9Y,EAAK1B,EAE/B,aAEE,MAAMya,EAAO/Y,EAAI,KAAK,IAAI1B,CAAM,EAChC,GAAI,CAACya,EACD,MAAM,IAAI,MAAM,2CAA2C,EAE/D,MAAMC,EAAa,IAAI,IACvB,UAAWC,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMmP,GAAKzU,EAAAsF,EAAI,iBAAiB,IAAIiZ,EAAM,CAAC,CAAC,IAAjC,YAAAve,EAAoC,GAC/C,GAAIyU,EAAI,CACJ,MAAM+J,EAAWF,EAAW,IAAI7J,CAAE,EAClC,GAAI+J,GAAYA,IAAaD,EAAM,CAAC,EAChC,MAAM,IAAI,MAAM,wBAAwB9J,CAAE,mHAAmH,EAEjK6J,EAAW,IAAI7J,EAAI8J,EAAM,CAAC,CAAC,CAC/B,CACJ,CAGA,MAAME,EAAWF,GAAU,eAKvB,MAAMG,EAAcpZ,EAAI,SAAW,gBAAkB,QAAU,cAC/D,GAAIA,EAAI,SAAU,CACd,MAAMqZ,GAAa3e,EAAAsF,EAAI,SAAS,SAAS,IAAIiZ,EAAM,CAAC,CAAC,IAAlC,YAAAve,EAAqC,GAElD4e,GAAeze,EAAAmF,EAAI,SAAS,MAAb,KAAAnF,GAAsBsU,GAAOA,GAClD,GAAIkK,EACA,MAAO,CAAE,IAAKC,EAAaD,CAAU,CAAC,EAG1C,MAAMlK,GAAK7O,GAAAC,EAAA0Y,EAAM,CAAC,EAAE,QAAT,KAAA1Y,EAAkB0Y,EAAM,CAAC,EAAE,OAAO,KAAlC,KAAA3Y,EAAwC,SAASN,EAAI,SAAS,GACzE,OAAAiZ,EAAM,CAAC,EAAE,MAAQ9J,EACV,CAAE,MAAOA,EAAI,IAAK,GAAGmK,EAAa,UAAU,CAAC,KAAKF,CAAW,IAAIjK,CAAE,EAAE,CAChF,CACA,GAAI8J,EAAM,CAAC,IAAMF,EACb,MAAO,CAAE,IAAK,GAAG,EAIrB,MAAMQ,EAAe,KAAgBH,CAAW,IAC1CI,GAAQhZ,EAAAyY,EAAM,CAAC,EAAE,OAAO,KAAhB,KAAAzY,EAAsB,WAAWR,EAAI,SAAS,GAC5D,MAAO,CAAE,MAAAwZ,EAAO,IAAKD,EAAeC,CAAK,CAC7C,EAGMC,EAAgBR,GAAU,CAE5B,GAAIA,EAAM,CAAC,EAAE,OAAO,KAChB,OAEJ,MAAMT,EAAOS,EAAM,CAAC,EACd,CAAE,IAAAS,EAAK,MAAAF,GAAUL,EAAQF,CAAK,EACpCT,EAAK,IAAM9a,EAAA,GAAK8a,EAAK,QAGjBgB,IACAhB,EAAK,MAAQgB,GAEjB,MAAMlb,EAASka,EAAK,OACpB,UAAWrjB,KAAOmJ,EACd,OAAOA,EAAOnJ,CAAG,EAErBmJ,EAAO,KAAOob,CAClB,EAGA,GAAI1Z,EAAI,SAAW,QACf,UAAWiZ,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMwY,EAAOS,EAAM,CAAC,EACpB,GAAIT,EAAK,MACL,MAAM,IAAI,MAAM,sBACP3d,EAAA2d,EAAK,QAAL,YAAA3d,EAAY,KAAK,IAAI;AAAA;AAAA,iFACwD,CAE9F,CAGJ,UAAWoe,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMwY,EAAOS,EAAM,CAAC,EAEpB,GAAI3a,IAAW2a,EAAM,CAAC,EAAG,CACrBQ,EAAaR,CAAK,EAClB,QACJ,CAEA,GAAIjZ,EAAI,SAAU,CACd,MAAM2Z,GAAMpZ,EAAAP,EAAI,SAAS,SAAS,IAAIiZ,EAAM,CAAC,CAAC,IAAlC,YAAA1Y,EAAqC,GACjD,GAAIjC,IAAW2a,EAAM,CAAC,GAAKU,EAAK,CAC5BF,EAAaR,CAAK,EAClB,QACJ,CACJ,CAGA,IADW3Y,EAAAN,EAAI,iBAAiB,IAAIiZ,EAAM,CAAC,CAAC,IAAjC,YAAA3Y,EAAoC,GACvC,CACJmZ,EAAaR,CAAK,EAClB,QACJ,CAEA,GAAIT,EAAK,MAAO,CAEZiB,EAAaR,CAAK,EAClB,QACJ,CAEA,GAAIT,EAAK,MAAQ,GACTxY,EAAI,SAAW,MAAO,CACtByZ,EAAaR,CAAK,EAElB,QACJ,CAER,CACJ,CACO,SAASW,GAAS5Z,EAAK1B,EAAQ,eAClC,MAAMya,EAAO/Y,EAAI,KAAK,IAAI1B,CAAM,EAChC,GAAI,CAACya,EACD,MAAM,IAAI,MAAM,2CAA2C,EAE/D,MAAMc,EAAcC,GAAc,WAC9B,MAAMtB,EAAOxY,EAAI,KAAK,IAAI8Z,CAAS,EAEnC,GAAItB,EAAK,MAAQ,KACb,OACJ,MAAMla,GAAS5D,EAAA8d,EAAK,MAAL,KAAA9d,EAAY8d,EAAK,OAC1BuB,EAAUrc,EAAA,GAAKY,GACfob,EAAMlB,EAAK,IAEjB,GADAA,EAAK,IAAM,KACPkB,EAAK,CACLG,EAAWH,CAAG,EACd,MAAMM,EAAUha,EAAI,KAAK,IAAI0Z,CAAG,EAC1BO,EAAYD,EAAQ,OAc1B,GAZIC,EAAU,OAASja,EAAI,SAAW,YAAcA,EAAI,SAAW,YAAcA,EAAI,SAAW,gBAE5F1B,EAAO,OAAQzD,EAAAyD,EAAO,QAAP,KAAAzD,EAAgB,CAAA,EAC/ByD,EAAO,MAAM,KAAK2b,CAAS,GAG3B,OAAO,OAAO3b,EAAQ2b,CAAS,EAGnC,OAAO,OAAO3b,EAAQyb,CAAO,EACTD,EAAU,KAAK,SAAWJ,EAG1C,UAAWvkB,KAAOmJ,EACVnJ,IAAQ,QAAUA,IAAQ,SAExBA,KAAO4kB,GACT,OAAOzb,EAAOnJ,CAAG,EAK7B,GAAI8kB,EAAU,MAAQD,EAAQ,IAC1B,UAAW7kB,KAAOmJ,EACVnJ,IAAQ,QAAUA,IAAQ,SAE1BA,KAAO6kB,EAAQ,KAAO,KAAK,UAAU1b,EAAOnJ,CAAG,CAAC,IAAM,KAAK,UAAU6kB,EAAQ,IAAI7kB,CAAG,CAAC,GACrF,OAAOmJ,EAAOnJ,CAAG,CAIjC,CAIA,MAAMyjB,EAASkB,EAAU,KAAK,OAC9B,GAAIlB,GAAUA,IAAWc,EAAK,CAE1BG,EAAWjB,CAAM,EACjB,MAAMsB,EAAala,EAAI,KAAK,IAAI4Y,CAAM,EACtC,GAAIsB,GAAA,MAAAA,EAAY,OAAO,OACnB5b,EAAO,KAAO4b,EAAW,OAAO,KAE5BA,EAAW,KACX,UAAW/kB,KAAOmJ,EACVnJ,IAAQ,QAAUA,IAAQ,SAE1BA,KAAO+kB,EAAW,KAAO,KAAK,UAAU5b,EAAOnJ,CAAG,CAAC,IAAM,KAAK,UAAU+kB,EAAW,IAAI/kB,CAAG,CAAC,GAC3F,OAAOmJ,EAAOnJ,CAAG,CAKrC,CAEA6K,EAAI,SAAS,CACT,UAAW8Z,EACX,WAAYxb,EACZ,MAAMiC,EAAAiY,EAAK,OAAL,KAAAjY,EAAa,CAAA,CAC/B,CAAS,CACL,EACA,UAAW0Y,IAAS,CAAC,GAAGjZ,EAAI,KAAK,QAAO,CAAE,EAAE,UACxC6Z,EAAWZ,EAAM,CAAC,CAAC,EAEvB,MAAMvjB,EAAS,CAAA,EAgBf,GAfIsK,EAAI,SAAW,gBACftK,EAAO,QAAU,+CAEZsK,EAAI,SAAW,WACpBtK,EAAO,QAAU,0CAEZsK,EAAI,SAAW,WACpBtK,EAAO,QAAU,0CAEZsK,EAAI,QAMTtF,EAAAsF,EAAI,WAAJ,MAAAtF,EAAc,IAAK,CACnB,MAAMyU,GAAKtU,EAAAmF,EAAI,SAAS,SAAS,IAAI1B,CAAM,IAAhC,YAAAzD,EAAmC,GAC9C,GAAI,CAACsU,EACD,MAAM,IAAI,MAAM,oCAAoC,EACxDzZ,EAAO,IAAMsK,EAAI,SAAS,IAAImP,CAAE,CACpC,CACA,OAAO,OAAOzZ,GAAQ6K,EAAAwY,EAAK,MAAL,KAAAxY,EAAYwY,EAAK,MAAM,EAE7C,MAAMpc,GAAO6D,GAAAF,EAAAN,EAAI,WAAJ,YAAAM,EAAc,OAAd,KAAAE,EAAsB,CAAA,EACnC,UAAWyY,KAASjZ,EAAI,KAAK,QAAO,EAAI,CACpC,MAAMwY,EAAOS,EAAM,CAAC,EAChBT,EAAK,KAAOA,EAAK,QACjB7b,EAAK6b,EAAK,KAAK,EAAIA,EAAK,IAEhC,CAEIxY,EAAI,UAGA,OAAO,KAAKrD,CAAI,EAAE,OAAS,IACvBqD,EAAI,SAAW,gBACftK,EAAO,MAAQiH,EAGfjH,EAAO,YAAciH,GAIjC,GAAI,CAIA,MAAMwd,EAAY,KAAK,MAAM,KAAK,UAAUzkB,CAAM,CAAC,EACnD,cAAO,eAAeykB,EAAW,YAAa,CAC1C,MAAOlc,EAAAP,EAAA,GACAY,EAAO,WAAW,GADlB,CAEH,WAAY,CACR,MAAO8b,GAA+B9b,EAAQ,QAAS0B,EAAI,UAAU,EACrE,OAAQoa,GAA+B9b,EAAQ,SAAU0B,EAAI,UAAU,CAC3F,CACA,GACY,WAAY,GACZ,SAAU,EACtB,CAAS,EACMma,CACX,OACOE,EAAM,CACT,MAAM,IAAI,MAAM,kCAAkC,CACtD,CACJ,CACA,SAASxB,EAAeyB,EAAS1Y,EAAM,CACnC,MAAM5B,EAAM4B,GAAA,KAAAA,EAAQ,CAAE,KAAM,IAAI,GAAK,EACrC,GAAI5B,EAAI,KAAK,IAAIsa,CAAO,EACpB,MAAO,GACXta,EAAI,KAAK,IAAIsa,CAAO,EACpB,MAAMjgB,EAAMigB,EAAQ,KAAK,IACzB,GAAIjgB,EAAI,OAAS,YACb,MAAO,GACX,GAAIA,EAAI,OAAS,QACb,OAAOwe,EAAexe,EAAI,QAAS2F,CAAG,EAC1C,GAAI3F,EAAI,OAAS,MACb,OAAOwe,EAAexe,EAAI,UAAW2F,CAAG,EAC5C,GAAI3F,EAAI,OAAS,OACb,OAAOwe,EAAexe,EAAI,OAAM,EAAI2F,CAAG,EAC3C,GAAI3F,EAAI,OAAS,WACbA,EAAI,OAAS,YACbA,EAAI,OAAS,eACbA,EAAI,OAAS,YACbA,EAAI,OAAS,YACbA,EAAI,OAAS,WACbA,EAAI,OAAS,WACb,OAAOwe,EAAexe,EAAI,UAAW2F,CAAG,EAE5C,GAAI3F,EAAI,OAAS,eACb,OAAOwe,EAAexe,EAAI,KAAM2F,CAAG,GAAK6Y,EAAexe,EAAI,MAAO2F,CAAG,EAEzE,GAAI3F,EAAI,OAAS,UAAYA,EAAI,OAAS,MACtC,OAAOwe,EAAexe,EAAI,QAAS2F,CAAG,GAAK6Y,EAAexe,EAAI,UAAW2F,CAAG,EAEhF,GAAI3F,EAAI,OAAS,OACb,OAAOwe,EAAexe,EAAI,GAAI2F,CAAG,GAAK6Y,EAAexe,EAAI,IAAK2F,CAAG,EAErE,GAAI3F,EAAI,OAAS,SAAU,CACvB,UAAWlF,KAAOkF,EAAI,MAClB,GAAIwe,EAAexe,EAAI,MAAMlF,CAAG,EAAG6K,CAAG,EAClC,MAAO,GAEf,MAAO,EACX,CACA,GAAI3F,EAAI,OAAS,QAAS,CACtB,UAAWwV,KAAUxV,EAAI,QACrB,GAAIwe,EAAehJ,EAAQ7P,CAAG,EAC1B,MAAO,GAEf,MAAO,EACX,CACA,GAAI3F,EAAI,OAAS,QAAS,CACtB,UAAWkT,KAAQlT,EAAI,MACnB,GAAIwe,EAAetL,EAAMvN,CAAG,EACxB,MAAO,GAEf,MAAI,GAAA3F,EAAI,MAAQwe,EAAexe,EAAI,KAAM2F,CAAG,EAGhD,CACA,MAAO,EACX,CAKO,MAAMua,GAA2B,CAACjc,EAAQkc,EAAa,CAAA,IAAQtgB,GAAW,CAC7E,MAAM8F,EAAMsY,GAAkBra,EAAAP,EAAA,GAAKxD,GAAL,CAAa,WAAAsgB,CAAU,EAAE,EACvD,OAAAjC,EAAQja,EAAQ0B,CAAG,EACnB8Y,GAAY9Y,EAAK1B,CAAM,EAChBsb,GAAS5Z,EAAK1B,CAAM,CAC/B,EACa8b,GAAiC,CAAC9b,EAAQmc,EAAID,EAAa,CAAA,IAAQtgB,GAAW,CACvF,KAAM,CAAE,eAAAwgB,EAAgB,OAAAle,CAAM,EAAKtC,GAAA,KAAAA,EAAU,CAAA,EACvC8F,EAAMsY,GAAkBra,EAAAP,EAAA,GAAMgd,GAAA,KAAAA,EAAkB,CAAA,GAAxB,CAA6B,OAAAle,EAAQ,GAAAie,EAAI,WAAAD,GAAY,EACnF,OAAAjC,EAAQja,EAAQ0B,CAAG,EACnB8Y,GAAY9Y,EAAK1B,CAAM,EAChBsb,GAAS5Z,EAAK1B,CAAM,CAC/B,EClbMqc,GAAY,CACd,KAAM,OACN,IAAK,MACL,SAAU,YACV,YAAa,cACb,MAAO,EACX,EAEaC,GAAkB,CAACtc,EAAQ0B,EAAK0Y,EAAO1a,IAAY,OAC5D,MAAM6c,EAAOnC,EACbmC,EAAK,KAAO,SACZ,KAAM,CAAE,QAAA5U,EAAS,QAAAC,EAAS,OAAA4U,EAAQ,SAAAhL,EAAU,gBAAAiL,CAAe,EAAKzc,EAAO,KAClE,IAkBL,GAjBI,OAAO2H,GAAY,WACnB4U,EAAK,UAAY5U,GACjB,OAAOC,GAAY,WACnB2U,EAAK,UAAY3U,GAEjB4U,IACAD,EAAK,QAASngB,EAAAigB,GAAUG,CAAM,IAAhB,KAAApgB,EAAqBogB,EAC/BD,EAAK,SAAW,IAChB,OAAOA,EAAK,OAGZC,IAAW,QACX,OAAOD,EAAK,QAGhBE,IACAF,EAAK,gBAAkBE,GACvBjL,GAAYA,EAAS,KAAO,EAAG,CAC/B,MAAMkL,EAAU,CAAC,GAAGlL,CAAQ,EACxBkL,EAAQ,SAAW,EACnBH,EAAK,QAAUG,EAAQ,CAAC,EAAE,OACrBA,EAAQ,OAAS,IACtBH,EAAK,MAAQ,CACT,GAAGG,EAAQ,IAAKjW,GAAW9G,EAAAP,EAAA,GACnBsC,EAAI,SAAW,YAAcA,EAAI,SAAW,YAAcA,EAAI,SAAW,cACvE,CAAE,KAAM,QAAQ,EAChB,IAHiB,CAIvB,QAAS+E,EAAM,MACnC,EAAkB,CAClB,EAEI,CACJ,EACakW,GAAkB,CAAC3c,EAAQ0B,EAAK0Y,EAAO1a,IAAY,CAC5D,MAAM6c,EAAOnC,EACP,CAAE,QAAAzS,EAAS,QAAAC,EAAS,OAAA4U,EAAQ,WAAAI,EAAY,iBAAAC,EAAkB,iBAAAC,CAAgB,EAAK9c,EAAO,KAAK,IAC7F,OAAOwc,GAAW,UAAYA,EAAO,SAAS,KAAK,EACnDD,EAAK,KAAO,UAEZA,EAAK,KAAO,SACZ,OAAOO,GAAqB,WACxBpb,EAAI,SAAW,YAAcA,EAAI,SAAW,eAC5C6a,EAAK,QAAUO,EACfP,EAAK,iBAAmB,IAGxBA,EAAK,iBAAmBO,GAG5B,OAAOnV,GAAY,WACnB4U,EAAK,QAAU5U,EACX,OAAOmV,GAAqB,UAAYpb,EAAI,SAAW,aACnDob,GAAoBnV,EACpB,OAAO4U,EAAK,QAEZ,OAAOA,EAAK,mBAGpB,OAAOM,GAAqB,WACxBnb,EAAI,SAAW,YAAcA,EAAI,SAAW,eAC5C6a,EAAK,QAAUM,EACfN,EAAK,iBAAmB,IAGxBA,EAAK,iBAAmBM,GAG5B,OAAOjV,GAAY,WACnB2U,EAAK,QAAU3U,EACX,OAAOiV,GAAqB,UAAYnb,EAAI,SAAW,aACnDmb,GAAoBjV,EACpB,OAAO2U,EAAK,QAEZ,OAAOA,EAAK,mBAGpB,OAAOK,GAAe,WACtBL,EAAK,WAAaK,EAC1B,EACaG,GAAmB,CAACf,EAAS1Y,EAAMiZ,EAAM7c,IAAY,CAC9D6c,EAAK,KAAO,SAChB,EA+BaS,GAAiB,CAAChB,EAAS1Y,EAAMiZ,EAAM7c,IAAY,CAC5D6c,EAAK,IAAM,CAAA,CACf,EAIaU,GAAmB,CAACjB,EAAS1Y,EAAM8W,EAAO1a,IAAY,CAEnE,EAMawd,GAAgB,CAACld,EAAQsD,EAAMiZ,EAAM7c,IAAY,CAC1D,MAAM3D,EAAMiE,EAAO,KAAK,IAClB8S,EAASjW,GAAcd,EAAI,OAAO,EAEpC+W,EAAO,MAAOppB,GAAM,OAAOA,GAAM,QAAQ,IACzC6yB,EAAK,KAAO,UACZzJ,EAAO,MAAOppB,GAAM,OAAOA,GAAM,QAAQ,IACzC6yB,EAAK,KAAO,UAChBA,EAAK,KAAOzJ,CAChB,EACaqK,GAAmB,CAACnd,EAAQ0B,EAAK6a,EAAM7c,IAAY,CAC5D,MAAM3D,EAAMiE,EAAO,KAAK,IAClBod,EAAO,CAAA,EACb,UAAW9nB,KAAOyG,EAAI,OAClB,GAAIzG,IAAQ,QACR,GAAIoM,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,0DAA0D,UAMzE,OAAOpM,GAAQ,SAAU,CAC9B,GAAIoM,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,sDAAsD,EAGtE0b,EAAK,KAAK,OAAO9nB,CAAG,CAAC,CAE7B,MAEI8nB,EAAK,KAAK9nB,CAAG,EAGrB,GAAI8nB,EAAK,SAAW,EAGf,GAAIA,EAAK,SAAW,EAAG,CACxB,MAAM9nB,EAAM8nB,EAAK,CAAC,EAClBb,EAAK,KAAOjnB,IAAQ,KAAO,OAAS,OAAOA,EACvCoM,EAAI,SAAW,YAAcA,EAAI,SAAW,cAC5C6a,EAAK,KAAO,CAACjnB,CAAG,EAGhBinB,EAAK,MAAQjnB,CAErB,MAEQ8nB,EAAK,MAAO1zB,GAAM,OAAOA,GAAM,QAAQ,IACvC6yB,EAAK,KAAO,UACZa,EAAK,MAAO1zB,GAAM,OAAOA,GAAM,QAAQ,IACvC6yB,EAAK,KAAO,UACZa,EAAK,MAAO1zB,GAAM,OAAOA,GAAM,SAAS,IACxC6yB,EAAK,KAAO,WACZa,EAAK,MAAO1zB,GAAMA,IAAM,IAAI,IAC5B6yB,EAAK,KAAO,QAChBA,EAAK,KAAOa,CAEpB,EA2CaC,GAAkB,CAACrB,EAASta,EAAK0Y,EAAO1a,IAAY,CAC7D,GAAIgC,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,mDAAmD,CAE3E,EAMa4b,GAAqB,CAACtB,EAASta,EAAK0Y,EAAO1a,IAAY,CAChE,GAAIgC,EAAI,kBAAoB,QACxB,MAAM,IAAI,MAAM,iDAAiD,CAEzE,EAYa6b,GAAiB,CAACvd,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAC1D,MAAM2gB,EAAOnC,EACPre,EAAMiE,EAAO,KAAK,IAClB,CAAE,QAAA2H,EAAS,QAAAC,CAAO,EAAK5H,EAAO,KAAK,IACrC,OAAO2H,GAAY,WACnB4U,EAAK,SAAW5U,GAChB,OAAOC,GAAY,WACnB2U,EAAK,SAAW3U,GACpB2U,EAAK,KAAO,QACZA,EAAK,MAAQtC,EAAQle,EAAI,QAAS2F,EAAK/B,EAAAP,EAAA,GAAKxD,GAAL,CAAa,KAAM,CAAC,GAAGA,EAAO,KAAM,OAAO,CAAC,EAAE,CACzF,EACa4hB,GAAkB,CAACxd,EAAQ0B,EAAK0Y,EAAOxe,IAAW,OAC3D,MAAM2gB,EAAOnC,EACPre,EAAMiE,EAAO,KAAK,IACxBuc,EAAK,KAAO,SACZA,EAAK,WAAa,CAAA,EAClB,MAAM1c,EAAQ9D,EAAI,MAClB,UAAWlF,KAAOgJ,EACd0c,EAAK,WAAW1lB,CAAG,EAAIojB,EAAQpa,EAAMhJ,CAAG,EAAG6K,EAAK/B,EAAAP,EAAA,GACzCxD,GADyC,CAE5C,KAAM,CAAC,GAAGA,EAAO,KAAM,aAAc/E,CAAG,CACpD,EAAS,EAGL,MAAM4mB,EAAU,IAAI,IAAI,OAAO,KAAK5d,CAAK,CAAC,EACpC6d,EAAe,IAAI,IAAI,CAAC,GAAGD,CAAO,EAAE,OAAQ5mB,GAAQ,CACtD,MAAMnN,EAAIqS,EAAI,MAAMlF,CAAG,EAAE,KACzB,OAAI6K,EAAI,KAAO,QACJhY,EAAE,QAAU,OAGZA,EAAE,SAAW,MAE5B,CAAC,CAAC,EACEg0B,EAAa,KAAO,IACpBnB,EAAK,SAAW,MAAM,KAAKmB,CAAY,KAGvCthB,EAAAL,EAAI,WAAJ,YAAAK,EAAc,KAAK,IAAI,QAAS,QAEhCmgB,EAAK,qBAAuB,GAEtBxgB,EAAI,SAKLA,EAAI,WACTwgB,EAAK,qBAAuBtC,EAAQle,EAAI,SAAU2F,EAAK/B,EAAAP,EAAA,GAChDxD,GADgD,CAEnD,KAAM,CAAC,GAAGA,EAAO,KAAM,sBAAsB,CACzD,EAAS,GAPG8F,EAAI,KAAO,WACX6a,EAAK,qBAAuB,GAQxC,EACaoB,GAAiB,CAAC3d,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CACzD,MAAMG,EAAMiE,EAAO,KAAK,IAGlB4d,EAAc7hB,EAAI,YAAc,GAChC1C,EAAU0C,EAAI,QAAQ,IAAI,CAACkF,EAAGhU,IAAMgtB,EAAQhZ,EAAGS,EAAK/B,EAAAP,EAAA,GACnDxD,GADmD,CAEtD,KAAM,CAAC,GAAGA,EAAO,KAAMgiB,EAAc,QAAU,QAAS3wB,CAAC,CACjE,EAAK,CAAC,EACE2wB,EACArB,EAAK,MAAQljB,EAGbkjB,EAAK,MAAQljB,CAErB,EACawkB,GAAwB,CAAC7d,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAChE,MAAMG,EAAMiE,EAAO,KAAK,IAClBW,EAAIsZ,EAAQle,EAAI,KAAM2F,EAAK/B,EAAAP,EAAA,GAC1BxD,GAD0B,CAE7B,KAAM,CAAC,GAAGA,EAAO,KAAM,QAAS,CAAC,CACzC,EAAK,EACKvK,EAAI4oB,EAAQle,EAAI,MAAO2F,EAAK/B,EAAAP,EAAA,GAC3BxD,GAD2B,CAE9B,KAAM,CAAC,GAAGA,EAAO,KAAM,QAAS,CAAC,CACzC,EAAK,EACKkiB,EAAwBxoB,GAAQ,UAAWA,GAAO,OAAO,KAAKA,CAAG,EAAE,SAAW,EAC9EyoB,EAAQ,CACV,GAAID,EAAqBnd,CAAC,EAAIA,EAAE,MAAQ,CAACA,CAAC,EAC1C,GAAImd,EAAqBzsB,CAAC,EAAIA,EAAE,MAAQ,CAACA,CAAC,CAClD,EACIkrB,EAAK,MAAQwB,CACjB,EAgDaC,GAAkB,CAAChe,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAC3D,MAAM2gB,EAAOnC,EACPre,EAAMiE,EAAO,KAAK,IACxBuc,EAAK,KAAO,SAIZ,MAAM0B,EAAUliB,EAAI,QACdmiB,EAASD,EAAQ,KAAK,IACtBzM,EAAW0M,GAAA,YAAAA,EAAQ,SACzB,GAAIniB,EAAI,OAAS,SAAWyV,GAAYA,EAAS,KAAO,EAAG,CAEvD,MAAM2M,EAAclE,EAAQle,EAAI,UAAW2F,EAAK/B,EAAAP,EAAA,GACzCxD,GADyC,CAE5C,KAAM,CAAC,GAAGA,EAAO,KAAM,oBAAqB,GAAG,CAC3D,EAAS,EACD2gB,EAAK,kBAAoB,CAAA,EACzB,UAAWzT,KAAW0I,EAClB+K,EAAK,kBAAkBzT,EAAQ,MAAM,EAAIqV,CAEjD,MAGQzc,EAAI,SAAW,YAAcA,EAAI,SAAW,mBAC5C6a,EAAK,cAAgBtC,EAAQle,EAAI,QAAS2F,EAAK/B,EAAAP,EAAA,GACxCxD,GADwC,CAE3C,KAAM,CAAC,GAAGA,EAAO,KAAM,eAAe,CACtD,EAAa,GAEL2gB,EAAK,qBAAuBtC,EAAQle,EAAI,UAAW2F,EAAK/B,EAAAP,EAAA,GACjDxD,GADiD,CAEpD,KAAM,CAAC,GAAGA,EAAO,KAAM,sBAAsB,CACzD,EAAS,EAGL,MAAMwiB,EAAYH,EAAQ,KAAK,OAC/B,GAAIG,EAAW,CACX,MAAMC,EAAiB,CAAC,GAAGD,CAAS,EAAE,OAAQ10B,GAAM,OAAOA,GAAM,UAAY,OAAOA,GAAM,QAAQ,EAC9F20B,EAAe,OAAS,IACxB9B,EAAK,SAAW8B,EAExB,CACJ,EACaC,GAAoB,CAACte,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC5D,MAAMG,EAAMiE,EAAO,KAAK,IAClBue,EAAQtE,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAC1Cse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAC5B0B,EAAI,SAAW,eACfwY,EAAK,IAAMne,EAAI,UACfwgB,EAAK,SAAW,IAGhBA,EAAK,MAAQ,CAACgC,EAAO,CAAE,KAAM,MAAM,CAAE,CAE7C,EACaC,GAAuB,CAACxe,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAChE,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,SACnB,EACa0iB,GAAmB,CAACze,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC3D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACfwgB,EAAK,QAAU,KAAK,MAAM,KAAK,UAAUxgB,EAAI,YAAY,CAAC,CAC9D,EACa2iB,GAAoB,CAAC1e,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC5D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACX2F,EAAI,KAAO,UACX6a,EAAK,UAAY,KAAK,MAAM,KAAK,UAAUxgB,EAAI,YAAY,CAAC,EACpE,EACa4iB,GAAiB,CAAC3e,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CACzD,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACf,IAAI6iB,EACJ,GAAI,CACAA,EAAa7iB,EAAI,WAAW,MAAS,CACzC,OACMyH,EAAA,CACF,MAAM,IAAI,MAAM,uDAAuD,CAC3E,CACA+Y,EAAK,QAAUqC,CACnB,EACaC,GAAgB,CAAC7e,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CACzD,MAAMG,EAAMiE,EAAO,KAAK,IAClB8e,EAAYpd,EAAI,KAAO,QAAW3F,EAAI,GAAG,KAAK,IAAI,OAAS,YAAcA,EAAI,IAAMA,EAAI,GAAMA,EAAI,IACvGke,EAAQ6E,EAAWpd,EAAK9F,CAAM,EAC9B,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAM4E,CACf,EACaC,GAAoB,CAAC/e,EAAQ0B,EAAK6a,EAAM3gB,IAAW,CAC5D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,UACfwgB,EAAK,SAAW,EACpB,EAOayC,GAAoB,CAAChf,EAAQ0B,EAAK0Y,EAAOxe,IAAW,CAC7D,MAAMG,EAAMiE,EAAO,KAAK,IACxBia,EAAQle,EAAI,UAAW2F,EAAK9F,CAAM,EAClC,MAAMse,EAAOxY,EAAI,KAAK,IAAI1B,CAAM,EAChCka,EAAK,IAAMne,EAAI,SACnB,ECngBakjB,GAA+BjY,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3FmjB,GAAqB,KAAKpjB,EAAMC,CAAG,EACnCojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASsK,GAASzK,EAAQ,CAC7B,OAAOwjB,GAAkBH,GAAgBrjB,CAAM,CACnD,CACO,MAAMyjB,GAA2BrY,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFujB,GAAiB,KAAKxjB,EAAMC,CAAG,EAC/BojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASkK,GAAKrK,EAAQ,CACzB,OAAO2jB,GAAcF,GAAYzjB,CAAM,CAC3C,CACO,MAAM4jB,GAA2BxY,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnF0jB,GAAiB,KAAK3jB,EAAMC,CAAG,EAC/BojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASqK,GAAKxK,EAAQ,CACzB,OAAO8jB,GAAcF,GAAY5jB,CAAM,CAC3C,CACO,MAAM+jB,GAA+B3Y,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3F6jB,GAAqB,KAAK9jB,EAAMC,CAAG,EACnCojB,EAAwB,KAAKrjB,EAAMC,CAAG,CAC1C,CAAC,EACM,SAASmJ,GAAStJ,EAAQ,CAC7B,OAAOikB,GAAkBF,GAAgB/jB,CAAM,CACnD,CC1BA,MAAMD,GAAc,CAACG,EAAMuF,IAAW,CAClCoB,GAAU,KAAK3G,EAAMuF,CAAM,EAC3BvF,EAAK,KAAO,WACZ,OAAO,iBAAiBA,EAAM,CAC1B,OAAQ,CACJ,MAAQ8G,GAAWkd,GAAiBhkB,EAAM8G,CAAM,CAE5D,EACQ,QAAS,CACL,MAAQA,GAAWmd,GAAkBjkB,EAAM8G,CAAM,CAE7D,EACQ,SAAU,CACN,MAAQN,GAAU,CACdxG,EAAK,OAAO,KAAKwG,CAAK,EACtBxG,EAAK,QAAU,KAAK,UAAUA,EAAK,OAAQ0G,GAA4B,CAAC,CAC5E,CAEZ,EACQ,UAAW,CACP,MAAQnB,GAAW,CACfvF,EAAK,OAAO,KAAK,GAAGuF,CAAM,EAC1BvF,EAAK,QAAU,KAAK,UAAUA,EAAK,OAAQ0G,GAA4B,CAAC,CAC5E,CAEZ,EACQ,QAAS,CACL,KAAM,CACF,OAAO1G,EAAK,OAAO,SAAW,CAClC,CAEZ,CACA,CAAK,CAML,EAEakkB,GAAehZ,EAAkB,WAAYrL,GAAa,CACnE,OAAQ,KACZ,CAAC,EC3CYskB,GAAwBC,GAAYF,EAAY,EAChDG,GAA6BC,GAAiBJ,EAAY,EAC1Dhc,GAA4Bqc,GAAgBL,EAAY,EACxD7b,GAAiCmc,GAAqBN,EAAY,EAElEO,GAAyBC,GAAaR,EAAY,EAClDS,GAAyBC,GAAaV,EAAY,EAClDW,GAA8BC,GAAkBZ,EAAY,EAC5Da,GAA8BC,GAAkBd,EAAY,EAC5De,GAA6BC,GAAiBhB,EAAY,EAC1DiB,GAA6BC,GAAiBlB,EAAY,EAC1DmB,GAAkCC,GAAsBpB,EAAY,EACpEqB,GAAkCC,GAAsBtB,EAAY,ECPpEuB,EAAwBva,EAAkB,UAAW,CAAClL,EAAMC,KACrEylB,EAAc,KAAK1lB,EAAMC,CAAG,EAC5B,OAAO,OAAOD,EAAK,WAAW,EAAG,CAC7B,WAAY,CACR,MAAOggB,GAA+BhgB,EAAM,OAAO,EACnD,OAAQggB,GAA+BhgB,EAAM,QAAQ,CACjE,CACA,CAAK,EACDA,EAAK,aAAemgB,GAAyBngB,EAAM,CAAA,CAAE,EACrDA,EAAK,IAAMC,EACXD,EAAK,KAAOC,EAAI,KAChB,OAAO,eAAeD,EAAM,OAAQ,CAAE,MAAOC,EAAK,EAElDD,EAAK,MAAQ,IAAIqE,IAAW,OACxB,OAAOrE,EAAK,MAAM2lB,GAAe1lB,EAAK,CAClC,OAAQ,CACJ,IAAIK,EAAAL,EAAI,SAAJ,KAAAK,EAAc,GAClB,GAAG+D,EAAO,IAAKsJ,GAAO,OAAOA,GAAO,WAAa,CAAE,KAAM,CAAE,MAAOA,EAAI,IAAK,CAAE,MAAO,QAAQ,EAAI,SAAU,CAAA,CAAE,CAAE,EAAKA,CAAE,CACrI,CACA,CAAS,EAAG,CACA,OAAQ,EACpB,CAAS,CACL,EACA3N,EAAK,KAAOA,EAAK,MACjBA,EAAK,MAAQ,CAACC,EAAKH,IAAW8lB,GAAW5lB,EAAMC,EAAKH,CAAM,EAC1DE,EAAK,MAAQ,IAAMA,EACnBA,EAAK,UAAY,CAAC6lB,EAAK3M,KACnB2M,EAAI,IAAI7lB,EAAMkZ,CAAI,EACXlZ,IAGXA,EAAK,MAAQ,CAAC9K,EAAM4K,IAAWgmB,GAAY9lB,EAAM9K,EAAM4K,EAAQ,CAAE,OAAQE,EAAK,KAAK,CAAE,EACrFA,EAAK,UAAY,CAAC9K,EAAM4K,IAAWimB,GAAgB/lB,EAAM9K,EAAM4K,CAAM,EACrEE,EAAK,WAAa,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKie,OAAAA,GAAiBhmB,EAAM9K,EAAM4K,EAAQ,CAAE,OAAQE,EAAK,UAAU,CAAE,IAC1GA,EAAK,eAAiB,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKke,OAAAA,GAAqBjmB,EAAM9K,EAAM4K,CAAM,IACrFE,EAAK,IAAMA,EAAK,eAEhBA,EAAK,OAAS,CAAC9K,EAAM4K,IAAWomB,GAAalmB,EAAM9K,EAAM4K,CAAM,EAC/DE,EAAK,OAAS,CAAC9K,EAAM4K,IAAWqmB,GAAanmB,EAAM9K,EAAM4K,CAAM,EAC/DE,EAAK,YAAc,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKqe,OAAAA,GAAkBpmB,EAAM9K,EAAM4K,CAAM,IAC/EE,EAAK,YAAc,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKse,OAAAA,GAAkBrmB,EAAM9K,EAAM4K,CAAM,IAC/EE,EAAK,WAAa,CAAC9K,EAAM4K,IAAWwmB,GAAiBtmB,EAAM9K,EAAM4K,CAAM,EACvEE,EAAK,WAAa,CAAC9K,EAAM4K,IAAWymB,GAAiBvmB,EAAM9K,EAAM4K,CAAM,EACvEE,EAAK,gBAAkB,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAKye,OAAAA,GAAsBxmB,EAAM9K,EAAM4K,CAAM,IACvFE,EAAK,gBAAkB,CAAO9K,EAAM4K,IAAMiI,EAAA,sBAAK0e,OAAAA,GAAsBzmB,EAAM9K,EAAM4K,CAAM,IAEvFE,EAAK,OAAS,CAAC0mB,EAAO5mB,IAAWE,EAAK,MAAM2mB,GAAOD,EAAO5mB,CAAM,CAAC,EACjEE,EAAK,YAAe4mB,GAAe5mB,EAAK,MAAM6mB,GAAYD,CAAU,CAAC,EACrE5mB,EAAK,UAAaQ,GAAOR,EAAK,MAAM8mB,GAAiBtmB,CAAE,CAAC,EAExDR,EAAK,SAAW,IAAM+mB,GAAS/mB,CAAI,EACnCA,EAAK,cAAgB,IAAMgnB,GAAchnB,CAAI,EAC7CA,EAAK,SAAW,IAAMinB,GAASjnB,CAAI,EACnCA,EAAK,QAAU,IAAM+mB,GAASE,GAASjnB,CAAI,CAAC,EAC5CA,EAAK,YAAeF,GAAWonB,GAAYlnB,EAAMF,CAAM,EACvDE,EAAK,MAAQ,IAAMmnB,GAAMnnB,CAAI,EAC7BA,EAAK,GAAMqN,GAAQ+Z,GAAM,CAACpnB,EAAMqN,CAAG,CAAC,EACpCrN,EAAK,IAAOqN,GAAQga,GAAarnB,EAAMqN,CAAG,EAC1CrN,EAAK,UAAamd,GAAOmK,GAAKtnB,EAAMunB,GAAUpK,CAAE,CAAC,EACjDnd,EAAK,QAAWC,GAAQunB,GAASxnB,EAAMC,CAAG,EAC1CD,EAAK,SAAYC,GAAQwnB,GAASznB,EAAMC,CAAG,EAE3CD,EAAK,MAASF,GAAW4nB,GAAO1nB,EAAMF,CAAM,EAC5CE,EAAK,KAAQoC,GAAWklB,GAAKtnB,EAAMoC,CAAM,EACzCpC,EAAK,SAAW,IAAM2nB,GAAS3nB,CAAI,EAEnCA,EAAK,SAAY4nB,GAAgB,CAC7B,MAAMlkB,EAAK1D,EAAK,MAAK,EACrB6nB,OAAAA,GAAoB,IAAInkB,EAAI,CAAE,YAAAkkB,CAAW,CAAE,EACpClkB,CACX,EACA,OAAO,eAAe1D,EAAM,cAAe,CACvC,KAAM,OACF,OAAO6nB,EAAAA,GAAoB,IAAI7nB,CAAI,IAA5B6nB,YAAAA,EAA+B,WAC1C,EACA,aAAc,EACtB,CAAK,EACD7nB,EAAK,KAAO,IAAIyG,IAAS,CACrB,GAAIA,EAAK,SAAW,EAChB,OAAOohB,GAAoB,IAAI7nB,CAAI,EAEvC,MAAM0D,EAAK1D,EAAK,MAAK,EACrB6nB,OAAAA,GAAoB,IAAInkB,EAAI+C,EAAK,CAAC,CAAC,EAC5B/C,CACX,EAEA1D,EAAK,WAAa,IAAMA,EAAK,UAAU,MAAS,EAAE,QAClDA,EAAK,WAAa,IAAMA,EAAK,UAAU,IAAI,EAAE,QAC7CA,EAAK,MAASQ,GAAOA,EAAGR,CAAI,EACrBA,EACV,EAEY8nB,GAA2B5c,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,WACnF8nB,GAAgB,KAAK/nB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWkoB,GAA2BhoB,EAAM4F,EAAK6a,CAAY,EACvG,MAAMnV,EAAMtL,EAAK,KAAK,IACtBA,EAAK,QAASM,EAAAgL,EAAI,SAAJ,KAAAhL,EAAc,KAC5BN,EAAK,WAAYS,EAAA6K,EAAI,UAAJ,KAAA7K,EAAe,KAChCT,EAAK,WAAYmG,EAAAmF,EAAI,UAAJ,KAAAnF,EAAe,KAEhCnG,EAAK,MAAQ,IAAIyG,IAASzG,EAAK,MAAMioB,GAAa,GAAGxhB,CAAI,CAAC,EAC1DzG,EAAK,SAAW,IAAIyG,IAASzG,EAAK,MAAMkoB,GAAgB,GAAGzhB,CAAI,CAAC,EAChEzG,EAAK,WAAa,IAAIyG,IAASzG,EAAK,MAAMmoB,GAAkB,GAAG1hB,CAAI,CAAC,EACpEzG,EAAK,SAAW,IAAIyG,IAASzG,EAAK,MAAMooB,GAAgB,GAAG3hB,CAAI,CAAC,EAChEzG,EAAK,IAAM,IAAIyG,IAASzG,EAAK,MAAMqoB,GAAiB,GAAG5hB,CAAI,CAAC,EAC5DzG,EAAK,IAAM,IAAIyG,IAASzG,EAAK,MAAMsoB,GAAiB,GAAG7hB,CAAI,CAAC,EAC5DzG,EAAK,OAAS,IAAIyG,IAASzG,EAAK,MAAMuoB,GAAc,GAAG9hB,CAAI,CAAC,EAC5DzG,EAAK,SAAW,IAAIyG,IAASzG,EAAK,MAAMqoB,GAAiB,EAAG,GAAG5hB,CAAI,CAAC,EACpEzG,EAAK,UAAaF,GAAWE,EAAK,MAAMwoB,GAAiB1oB,CAAM,CAAC,EAChEE,EAAK,UAAaF,GAAWE,EAAK,MAAMyoB,GAAiB3oB,CAAM,CAAC,EAEhEE,EAAK,KAAO,IAAMA,EAAK,MAAM0oB,GAAW,CAAE,EAC1C1oB,EAAK,UAAY,IAAIyG,IAASzG,EAAK,MAAM2oB,GAAiB,GAAGliB,CAAI,CAAC,EAClEzG,EAAK,YAAc,IAAMA,EAAK,MAAM4oB,GAAkB,CAAE,EACxD5oB,EAAK,YAAc,IAAMA,EAAK,MAAM6oB,GAAkB,CAAE,EACxD7oB,EAAK,QAAU,IAAMA,EAAK,MAAM8oB,GAAc,CAAE,CACpD,CAAC,EACYC,GAA0B7d,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjF8nB,GAAgB,KAAK/nB,EAAMC,CAAG,EAC9B6nB,GAAW,KAAK9nB,EAAMC,CAAG,EACzBD,EAAK,MAASF,GAAWE,EAAK,MAAMgpB,GAAYC,GAAUnpB,CAAM,CAAC,EACjEE,EAAK,IAAOF,GAAWE,EAAK,MAAMkpB,GAAUC,GAAQrpB,CAAM,CAAC,EAC3DE,EAAK,IAAOF,GAAWE,EAAK,MAAMopB,GAAUC,GAAQvpB,CAAM,CAAC,EAC3DE,EAAK,MAASF,GAAWE,EAAK,MAAMspB,GAAYC,GAAUzpB,CAAM,CAAC,EACjEE,EAAK,KAAQF,GAAWE,EAAK,MAAMwpB,GAAWC,GAAS3pB,CAAM,CAAC,EAC9DE,EAAK,KAAQF,GAAWE,EAAK,MAAM0pB,GAAWC,GAAS7pB,CAAM,CAAC,EAC9DE,EAAK,OAAUF,GAAWE,EAAK,MAAM4pB,GAAaD,GAAS7pB,CAAM,CAAC,EAClEE,EAAK,OAAUF,GAAWE,EAAK,MAAM6pB,GAAaF,GAAS7pB,CAAM,CAAC,EAClEE,EAAK,OAAUF,GAAWE,EAAK,MAAM8pB,GAAaH,GAAS7pB,CAAM,CAAC,EAClEE,EAAK,OAAUF,GAAWE,EAAK,MAAM+pB,GAAaC,GAAWlqB,CAAM,CAAC,EACpEE,EAAK,KAAQF,GAAWE,EAAK,MAAMwpB,GAAWC,GAAS3pB,CAAM,CAAC,EAC9DE,EAAK,KAAQF,GAAWE,EAAK,MAAMiqB,GAAWC,GAASpqB,CAAM,CAAC,EAC9DE,EAAK,MAASF,GAAWE,EAAK,MAAMmqB,GAAYC,GAAUtqB,CAAM,CAAC,EACjEE,EAAK,KAAQF,GAAWE,EAAK,MAAMqqB,GAAWC,GAASxqB,CAAM,CAAC,EAC9DE,EAAK,OAAUF,GAAWE,EAAK,MAAMuqB,GAAaC,GAAW1qB,CAAM,CAAC,EACpEE,EAAK,UAAaF,GAAWE,EAAK,MAAMyqB,GAAgBC,GAAc5qB,CAAM,CAAC,EAC7EE,EAAK,IAAOF,GAAWE,EAAK,MAAM2qB,GAAUC,GAAQ9qB,CAAM,CAAC,EAC3DE,EAAK,MAASF,GAAWE,EAAK,MAAM6qB,GAAYC,GAAUhrB,CAAM,CAAC,EACjEE,EAAK,KAAQF,GAAWE,EAAK,MAAM+qB,GAAWC,GAASlrB,CAAM,CAAC,EAC9DE,EAAK,KAAQF,GAAWE,EAAK,MAAMirB,GAAWC,GAASprB,CAAM,CAAC,EAC9DE,EAAK,OAAUF,GAAWE,EAAK,MAAMmrB,GAAaC,GAAWtrB,CAAM,CAAC,EACpEE,EAAK,OAAUF,GAAWE,EAAK,MAAMqrB,GAAaC,GAAWxrB,CAAM,CAAC,EACpEE,EAAK,KAAQF,GAAWE,EAAK,MAAMurB,GAAWC,GAAS1rB,CAAM,CAAC,EAE9DE,EAAK,SAAYF,GAAWE,EAAK,MAAMyrB,GAAa3rB,CAAM,CAAC,EAC3DE,EAAK,KAAQF,GAAWE,EAAK,MAAM0rB,GAAS5rB,CAAM,CAAC,EACnDE,EAAK,KAAQF,GAAWE,EAAK,MAAM2rB,GAAS7rB,CAAM,CAAC,EACnDE,EAAK,SAAYF,GAAWE,EAAK,MAAM4rB,GAAa9rB,CAAM,CAAC,CAC/D,CAAC,EACM,SAAS4K,GAAO5K,EAAQ,CAC3B,OAAO+rB,GAAa9C,GAAWjpB,CAAM,CACzC,CACO,MAAMgsB,EAAgC5gB,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7F8rB,EAAsB,KAAK/rB,EAAMC,CAAG,EACpC6nB,GAAW,KAAK9nB,EAAMC,CAAG,CAC7B,CAAC,EACYgpB,GAAyB/d,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/E+rB,GAAe,KAAKhsB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYwpB,GAAwBve,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EgsB,GAAc,KAAKjsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY0pB,GAAwBze,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EisB,GAAc,KAAKlsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAeYkpB,GAAuBje,EAAkB,SAAU,CAAClL,EAAMC,IAAQ,CAE3EksB,GAAa,KAAKnsB,EAAMC,CAAG,EAC3B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAWYspB,GAAyBre,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/EmsB,GAAe,KAAKpsB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY+pB,GAA0B9e,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CAEjFosB,GAAgB,KAAKrsB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYiqB,GAAwBhf,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EqsB,GAAc,KAAKtsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYmqB,GAAyBlf,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/EssB,GAAe,KAAKvsB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYqqB,GAAwBpf,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EusB,GAAc,KAAKxsB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY2qB,GAAuB1f,EAAkB,SAAU,CAAClL,EAAMC,IAAQ,CAE3EwsB,GAAa,KAAKzsB,EAAMC,CAAG,EAC3B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY6qB,GAAyB5f,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAE/EysB,GAAe,KAAK1sB,EAAMC,CAAG,EAC7B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIY+qB,GAAwB9f,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7E0sB,GAAc,KAAK3sB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAYYirB,GAAwBhgB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7E2sB,GAAc,KAAK5sB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYmrB,GAA0BlgB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjF4sB,GAAgB,KAAK7sB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYqrB,GAA0BpgB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjF6sB,GAAgB,KAAK9sB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYuqB,GAA0Btf,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CAEjF8sB,GAAgB,KAAK/sB,EAAMC,CAAG,EAC9B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYyqB,GAA6Bxf,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CAEvF+sB,GAAmB,KAAKhtB,EAAMC,CAAG,EACjC6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYurB,GAAwBtgB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAE7EgtB,GAAc,KAAKjtB,EAAMC,CAAG,EAC5B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EAIYopB,GAAuBne,EAAkB,SAAU,CAAClL,EAAMC,IAAQ,CAE3EitB,GAAa,KAAKltB,EAAMC,CAAG,EAC3B6rB,EAAgB,KAAK9rB,EAAMC,CAAG,CAClC,CAAC,EA0BYktB,GAA0BjiB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,uBACjFmtB,GAAgB,KAAKptB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWutB,GAA2BrtB,EAAM4F,EAAK6a,CAAY,EACvGzgB,EAAK,GAAK,CAACvU,EAAOqU,IAAWE,EAAK,MAAMstB,GAAU7hC,EAAOqU,CAAM,CAAC,EAChEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMutB,GAAW9hC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMutB,GAAW9hC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,GAAK,CAACvU,EAAOqU,IAAWE,EAAK,MAAMwtB,GAAU/hC,EAAOqU,CAAM,CAAC,EAChEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMytB,GAAWhiC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,IAAM,CAACvU,EAAOqU,IAAWE,EAAK,MAAMytB,GAAWhiC,EAAOqU,CAAM,CAAC,EAClEE,EAAK,IAAOF,GAAWE,EAAK,MAAM0tB,GAAI5tB,CAAM,CAAC,EAC7CE,EAAK,KAAQF,GAAWE,EAAK,MAAM0tB,GAAI5tB,CAAM,CAAC,EAC9CE,EAAK,SAAYF,GAAWE,EAAK,MAAMstB,GAAU,EAAGxtB,CAAM,CAAC,EAC3DE,EAAK,YAAeF,GAAWE,EAAK,MAAMutB,GAAW,EAAGztB,CAAM,CAAC,EAC/DE,EAAK,SAAYF,GAAWE,EAAK,MAAMwtB,GAAU,EAAG1tB,CAAM,CAAC,EAC3DE,EAAK,YAAeF,GAAWE,EAAK,MAAMytB,GAAW,EAAG3tB,CAAM,CAAC,EAC/DE,EAAK,WAAa,CAACvU,EAAOqU,IAAWE,EAAK,MAAM2tB,GAAkBliC,EAAOqU,CAAM,CAAC,EAChFE,EAAK,KAAO,CAACvU,EAAOqU,IAAWE,EAAK,MAAM2tB,GAAkBliC,EAAOqU,CAAM,CAAC,EAE1EE,EAAK,OAAS,IAAMA,EACpB,MAAMsL,EAAMtL,EAAK,KAAK,IACtBA,EAAK,UACDmG,EAAA,KAAK,KAAI7F,EAAAgL,EAAI,UAAJ,KAAAhL,EAAe,OAAO,mBAAmBG,EAAA6K,EAAI,mBAAJ,KAAA7K,EAAwB,OAAO,iBAAiB,IAAlG,KAAA0F,EAAuG,KAC3GnG,EAAK,UACDiG,EAAA,KAAK,KAAIC,EAAAoF,EAAI,UAAJ,KAAApF,EAAe,OAAO,mBAAmBE,EAAAkF,EAAI,mBAAJ,KAAAlF,EAAwB,OAAO,iBAAiB,IAAlG,KAAAH,EAAuG,KAC3GjG,EAAK,QAASqG,EAAAiF,EAAI,SAAJ,KAAAjF,EAAc,IAAI,SAAS,KAAK,GAAK,OAAO,eAAcL,EAAAsF,EAAI,aAAJ,KAAAtF,EAAkB,EAAG,EAC7FhG,EAAK,SAAW,GAChBA,EAAK,QAASsG,EAAAgF,EAAI,SAAJ,KAAAhF,EAAc,IAChC,CAAC,EACM,SAASuE,GAAO/K,EAAQ,CAC3B,OAAO8tB,GAAaT,GAAWrtB,CAAM,CACzC,CACO,MAAM+tB,GAAgC3iB,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7F6tB,GAAsB,KAAK9tB,EAAMC,CAAG,EACpCktB,GAAU,KAAKntB,EAAMC,CAAG,CAC5B,CAAC,EACM,SAASytB,GAAI5tB,EAAQ,CACxB,OAAOiuB,GAAUF,GAAiB/tB,CAAM,CAC5C,CAaO,MAAMkuB,GAA2B9iB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFguB,GAAiB,KAAKjuB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWouB,GAA4BluB,EAAM4F,EAAK6a,CAAY,CAC5G,CAAC,EACM,SAAS3V,EAAQhL,EAAQ,CAC5B,OAAOquB,GAAcH,GAAYluB,CAAM,CAC3C,CAwEO,MAAMsuB,GAA2BljB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFouB,GAAiB,KAAKruB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWwuB,GAAmD,CAC5G,CAAC,EACM,SAASC,IAAU,CACtB,OAAOC,GAAcJ,EAAU,CACnC,CACO,MAAMK,GAAyBvjB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EyuB,GAAe,KAAK1uB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW6uB,GAA0B3uB,EAAM4F,EAAK6a,CAAY,CAC1G,CAAC,EACM,SAASmO,GAAM9uB,EAAQ,CAC1B,OAAO+uB,GAAYJ,GAAU3uB,CAAM,CACvC,CAuBO,MAAMgvB,GAAyB5jB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/E8uB,GAAe,KAAK/uB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWkvB,GAA0BhvB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACtGE,EAAK,QAAUC,EAAI,QACnBD,EAAK,IAAM,CAACivB,EAAWnvB,IAAWE,EAAK,MAAMqoB,GAAiB4G,EAAWnvB,CAAM,CAAC,EAChFE,EAAK,SAAYF,GAAWE,EAAK,MAAMqoB,GAAiB,EAAGvoB,CAAM,CAAC,EAClEE,EAAK,IAAM,CAACkvB,EAAWpvB,IAAWE,EAAK,MAAMsoB,GAAiB4G,EAAWpvB,CAAM,CAAC,EAChFE,EAAK,OAAS,CAACvX,EAAKqX,IAAWE,EAAK,MAAMuoB,GAAc9/B,EAAKqX,CAAM,CAAC,EACpEE,EAAK,OAAS,IAAMA,EAAK,OAC7B,CAAC,EACM,SAASmnB,GAAMtJ,EAAS/d,EAAQ,CACnC,OAAOqvB,GAAYL,GAAUjR,EAAS/d,CAAM,CAChD,CAMO,MAAMsvB,GAA0BlkB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFovB,GAAmB,KAAKrvB,EAAMC,CAAG,EACjCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWwvB,GAA2BtvB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACvGsO,EAAgBpO,EAAM,QAAS,IACpBC,EAAI,KACd,EACDD,EAAK,MAAQ,IAAMuvB,GAAM,OAAO,KAAKvvB,EAAK,KAAK,IAAI,KAAK,CAAC,EACzDA,EAAK,SAAYqU,GAAarU,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAUqU,CAAQ,EAAE,EACjFrU,EAAK,YAAc,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAUuuB,GAAO,CAAE,EAAE,EAC7EvuB,EAAK,MAAQ,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAUuuB,GAAO,CAAE,EAAE,EACvEvuB,EAAK,OAAS,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAU4uB,GAAK,CAAE,EAAE,EACtE5uB,EAAK,MAAQ,IAAMA,EAAK,MAAM6D,EAAAP,EAAA,GAAKtD,EAAK,KAAK,KAAf,CAAoB,SAAU,MAAS,EAAE,EACvEA,EAAK,OAAUwvB,GACJC,GAAYzvB,EAAMwvB,CAAQ,EAErCxvB,EAAK,WAAcwvB,GACRE,GAAgB1vB,EAAMwvB,CAAQ,EAEzCxvB,EAAK,MAAS2vB,GAAUC,GAAW5vB,EAAM2vB,CAAK,EAC9C3vB,EAAK,KAAQmE,GAAS0rB,GAAU7vB,EAAMmE,CAAI,EAC1CnE,EAAK,KAAQmE,GAAS2rB,GAAU9vB,EAAMmE,CAAI,EAC1CnE,EAAK,QAAU,IAAIyG,IAASspB,GAAaC,GAAahwB,EAAMyG,EAAK,CAAC,CAAC,EACnEzG,EAAK,SAAW,IAAIyG,IAASwpB,GAAcC,GAAgBlwB,EAAMyG,EAAK,CAAC,CAAC,CAC5E,CAAC,EACM,SAASvE,GAAO6B,EAAOjE,EAAQ,CAClC,MAAMG,EAAMqD,EAAA,CACR,KAAM,SACN,MAAOS,GAAA,KAAAA,EAAS,CAAA,GACbwV,EAAqBzZ,CAAM,GAElC,OAAO,IAAIsvB,GAAUnvB,CAAG,CAC5B,CAmBO,MAAMkwB,GAAyBjlB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/EmwB,GAAe,KAAKpwB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWuwB,GAA0BrwB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACtGE,EAAK,QAAUC,EAAI,OACvB,CAAC,EACM,SAASmnB,GAAM7pB,EAASuC,EAAQ,CACnC,OAAO,IAAIqwB,GAAS7sB,EAAA,CAChB,KAAM,QACN,QAAS/F,GACNgc,EAAqBzZ,CAAM,EACjC,CACL,CA+BO,MAAMwwB,GAAgCplB,EAAkB,kBAAmB,CAAClL,EAAMC,IAAQ,CAC7FswB,GAAsB,KAAKvwB,EAAMC,CAAG,EACpCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW0wB,GAAiCxwB,EAAM4F,EAAK6a,EAAM3gB,CAAM,CACjH,CAAC,EACM,SAASunB,GAAarwB,EAAMgf,EAAO,CACtC,OAAO,IAAIsa,GAAgB,CACvB,KAAM,eACN,KAAMt5B,EACN,MAAOgf,CACf,CAAK,CACL,CAqBO,MAAMya,GAA0BvlB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFywB,GAAgB,KAAK1wB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW6wB,GAA2B3wB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACvGE,EAAK,QAAUC,EAAI,QACnBD,EAAK,UAAYC,EAAI,SACzB,CAAC,EACM,SAAS2wB,GAAOzO,EAAS0O,EAAW/wB,EAAQ,CAC/C,OAAO,IAAI2wB,GAAUntB,EAAA,CACjB,KAAM,SACN,QAAA6e,EACA,UAAW0O,GACRtX,EAAqBzZ,CAAM,EACjC,CACL,CAwDO,MAAMgxB,GAAwB5lB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7E8wB,GAAc,KAAK/wB,EAAMC,CAAG,EAC5BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWkxB,GAAyBhxB,EAAM4F,EAAK6a,CAAY,EACrGzgB,EAAK,KAAOC,EAAI,QAChBD,EAAK,QAAU,OAAO,OAAOC,EAAI,OAAO,EACxC,MAAMG,EAAO,IAAI,IAAI,OAAO,KAAKH,EAAI,OAAO,CAAC,EAC7CD,EAAK,QAAU,CAACgX,EAAQlX,IAAW,CAC/B,MAAMmxB,EAAa,CAAA,EACnB,UAAWxlC,KAASurB,EAChB,GAAI5W,EAAK,IAAI3U,CAAK,EACdwlC,EAAWxlC,CAAK,EAAIwU,EAAI,QAAQxU,CAAK,MAGrC,OAAM,IAAI,MAAM,OAAOA,CAAK,oBAAoB,EAExD,OAAO,IAAIqlC,GAAQjtB,EAAAP,EAAAO,EAAAP,EAAA,GACZrD,GADY,CAEf,OAAQ,CAAA,IACLsZ,EAAqBzZ,CAAM,GAHf,CAIf,QAASmxB,CACrB,EAAS,CACL,EACAjxB,EAAK,QAAU,CAACgX,EAAQlX,IAAW,CAC/B,MAAMmxB,EAAa3tB,EAAA,GAAKrD,EAAI,SAC5B,UAAWxU,KAASurB,EAChB,GAAI5W,EAAK,IAAI3U,CAAK,EACd,OAAOwlC,EAAWxlC,CAAK,MAGvB,OAAM,IAAI,MAAM,OAAOA,CAAK,oBAAoB,EAExD,OAAO,IAAIqlC,GAAQjtB,EAAAP,EAAAO,EAAAP,EAAA,GACZrD,GADY,CAEf,OAAQ,CAAA,IACLsZ,EAAqBzZ,CAAM,GAHf,CAIf,QAASmxB,CACrB,EAAS,CACL,CACJ,CAAC,EACD,SAAS1B,GAAMvY,EAAQlX,EAAQ,CAC3B,MAAMkB,EAAU,MAAM,QAAQgW,CAAM,EAAI,OAAO,YAAYA,EAAO,IAAKppB,GAAM,CAACA,EAAGA,CAAC,CAAC,CAAC,EAAIopB,EACxF,OAAO,IAAI8Z,GAAQxtB,EAAA,CACf,KAAM,OACN,QAAAtC,GACGuY,EAAqBzZ,CAAM,EACjC,CACL,CAgBO,MAAMoxB,GAA2BhmB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFkxB,GAAiB,KAAKnxB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWsxB,GAA4BpxB,EAAM4F,EAAK6a,CAAY,EACxGzgB,EAAK,OAAS,IAAI,IAAIC,EAAI,MAAM,EAChC,OAAO,eAAeD,EAAM,QAAS,CACjC,KAAM,CACF,GAAIC,EAAI,OAAO,OAAS,EACpB,MAAM,IAAI,MAAM,4EAA4E,EAEhG,OAAOA,EAAI,OAAO,CAAC,CACvB,CACR,CAAK,CACL,CAAC,EACM,SAASoxB,GAAQ5lC,EAAOqU,EAAQ,CACnC,OAAO,IAAIoxB,GAAW5tB,EAAA,CAClB,KAAM,UACN,OAAQ,MAAM,QAAQ7X,CAAK,EAAIA,EAAQ,CAACA,CAAK,GAC1C8tB,EAAqBzZ,CAAM,EACjC,CACL,CAYO,MAAMwxB,GAA6BpmB,EAAkB,eAAgB,CAAClL,EAAMC,IAAQ,CACvFsxB,GAAmB,KAAKvxB,EAAMC,CAAG,EACjCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW0xB,GAA8BxxB,EAAM4F,CAAiB,EAC1G5F,EAAK,KAAK,MAAQ,CAACuL,EAAS/D,IAAS,CACjC,GAAIA,EAAK,YAAc,WACnB,MAAM,IAAIkQ,GAAqB1X,EAAK,YAAY,IAAI,EAExDuL,EAAQ,SAAY/E,GAAU,WAC1B,GAAI,OAAOA,GAAU,SACjB+E,EAAQ,OAAO,KAAKwN,GAAWvS,EAAO+E,EAAQ,MAAOtL,CAAG,CAAC,MAExD,CAED,MAAMge,EAASzX,EACXyX,EAAO,QACPA,EAAO,SAAW,KACtB3d,EAAA2d,EAAO,OAAP,OAAgBA,EAAO,KAAO,WAC9Bxd,EAAAwd,EAAO,QAAP,OAAiBA,EAAO,MAAQ1S,EAAQ,QACxCpF,EAAA8X,EAAO,OAAP,OAAgBA,EAAO,KAAOje,GAE9BuL,EAAQ,OAAO,KAAKwN,GAAWkF,CAAM,CAAC,CAC1C,CACJ,EACA,MAAMrG,EAAS3X,EAAI,UAAUsL,EAAQ,MAAOA,CAAO,EACnD,OAAIqM,aAAkB,QACXA,EAAO,KAAMA,IAChBrM,EAAQ,MAAQqM,EACTrM,EACV,GAELA,EAAQ,MAAQqM,EACTrM,EACX,CACJ,CAAC,EACM,SAASgc,GAAU/mB,EAAI,CAC1B,OAAO,IAAI8wB,GAAa,CACpB,KAAM,YACN,UAAW9wB,CACnB,CAAK,CACL,CACO,MAAMwvB,GAA4B9kB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFwxB,GAAkB,KAAKzxB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW4xB,GAA6B1xB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAAS+mB,GAAS/D,EAAW,CAChC,OAAO,IAAIgN,GAAY,CACnB,KAAM,WACN,UAAWhN,CACnB,CAAK,CACL,CACO,MAAM2O,GAAiCzmB,EAAkB,mBAAoB,CAAClL,EAAMC,IAAQ,CAC/F2xB,GAAuB,KAAK5xB,EAAMC,CAAG,EACrCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW4xB,GAA6B1xB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASgnB,GAAchE,EAAW,CACrC,OAAO,IAAI2O,GAAiB,CACxB,KAAM,WACN,UAAW3O,CACnB,CAAK,CACL,CACO,MAAM6O,GAA4B3mB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrF6xB,GAAkB,KAAK9xB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWiyB,GAA6B/xB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASinB,GAASjE,EAAW,CAChC,OAAO,IAAI6O,GAAY,CACnB,KAAM,WACN,UAAW7O,CACnB,CAAK,CACL,CAKO,MAAMgP,GAA2B9mB,EAAkB,aAAc,CAAClL,EAAMC,IAAQ,CACnFgyB,GAAiB,KAAKjyB,EAAMC,CAAG,EAC/BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWoyB,GAA4BlyB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACxGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,UAClCA,EAAK,cAAgBA,EAAK,MAC9B,CAAC,EACM,SAASwnB,GAASxE,EAAWmP,EAAc,CAC9C,OAAO,IAAIH,GAAW,CAClB,KAAM,UACN,UAAWhP,EACX,IAAI,cAAe,CACf,OAAO,OAAOmP,GAAiB,WAAaA,EAAY,EAAKC,GAAkBD,CAAY,CAC/F,CACR,CAAK,CACL,CACO,MAAME,GAA4BnnB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFqyB,GAAkB,KAAKtyB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWyyB,GAA6BvyB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASynB,GAASzE,EAAWmP,EAAc,CAC9C,OAAO,IAAIE,GAAY,CACnB,KAAM,WACN,UAAWrP,EACX,IAAI,cAAe,CACf,OAAO,OAAOmP,GAAiB,WAAaA,EAAY,EAAKC,GAAkBD,CAAY,CAC/F,CACR,CAAK,CACL,CACO,MAAMjC,GAA+BhlB,EAAkB,iBAAkB,CAAClL,EAAMC,IAAQ,CAC3FuyB,GAAqB,KAAKxyB,EAAMC,CAAG,EACnCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW2yB,GAAgCzyB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EAC5GE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAASknB,GAAYlE,EAAWljB,EAAQ,CAC3C,OAAO,IAAIowB,GAAe5sB,EAAA,CACtB,KAAM,cACN,UAAW0f,GACRzJ,EAAqBzZ,CAAM,EACjC,CACL,CAaO,MAAM4yB,GAAyBxnB,EAAkB,WAAY,CAAClL,EAAMC,IAAQ,CAC/E0yB,GAAe,KAAK3yB,EAAMC,CAAG,EAC7BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAW8yB,GAA0B5yB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACtGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,UAClCA,EAAK,YAAcA,EAAK,MAC5B,CAAC,EACD,SAAS0nB,GAAO1E,EAAWF,EAAY,CACnC,OAAO,IAAI4P,GAAS,CAChB,KAAM,QACN,UAAW1P,EACX,WAAa,OAAOF,GAAe,WAAaA,EAAa,IAAMA,CAC3E,CAAK,CACL,CAUO,MAAM+P,GAAwB3nB,EAAkB,UAAW,CAAClL,EAAMC,IAAQ,CAC7E6yB,GAAc,KAAK9yB,EAAMC,CAAG,EAC5BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWizB,GAAyB/yB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACrGE,EAAK,GAAKC,EAAI,GACdD,EAAK,IAAMC,EAAI,GACnB,CAAC,EACM,SAASqnB,GAAK0L,EAAK32B,EAAK,CAC3B,OAAO,IAAIw2B,GAAQ,CACf,KAAM,OACN,GAAIG,EACJ,IAAK32B,CAEb,CAAK,CACL,CAcO,MAAM42B,GAA4B/nB,EAAkB,cAAe,CAAClL,EAAMC,IAAQ,CACrFizB,GAAkB,KAAKlzB,EAAMC,CAAG,EAChCwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWqzB,GAA6BnzB,EAAM4F,EAAK6a,EAAM3gB,CAAM,EACzGE,EAAK,OAAS,IAAMA,EAAK,KAAK,IAAI,SACtC,CAAC,EACM,SAAS2nB,GAAS3E,EAAW,CAChC,OAAO,IAAIiQ,GAAY,CACnB,KAAM,WACN,UAAWjQ,CACnB,CAAK,CACL,CAkDO,MAAMoQ,GAA0BloB,EAAkB,YAAa,CAAClL,EAAMC,IAAQ,CACjFozB,GAAgB,KAAKrzB,EAAMC,CAAG,EAC9BwlB,EAAQ,KAAKzlB,EAAMC,CAAG,EACtBD,EAAK,KAAK,kBAAoB,CAAC4F,EAAK6a,EAAM3gB,IAAWwzB,GAA2BtzB,EAAM4F,CAAiB,CAC3G,CAAC,EAaM,SAAS+gB,GAAOnmB,EAAIoD,EAAU,GAAI,CACrC,OAAO2vB,GAAaH,GAAW5yB,EAAIoD,CAAO,CAC9C,CAEO,SAASijB,GAAYrmB,EAAI,CAC5B,OAAOgzB,GAAkBhzB,CAAE,CAC/B,CCtlCA,MAAMizB,GAAwBC,GACpB,CACN,SAAUC,GAAO,CAAC,aAAc,YAAY,CAAC,EAAE,SAAA,EAC/C,uBAAwBC,EAAE,EAAU,SAAA,EACpC,yBAA0BA,EAAE,EAAU,SAAA,EAAW,QAAQ,EAAI,EAC7D,oBAAqBA,EAAE,EAAU,SAAA,EACjC,sBAAuBA,EAAE,EAAU,SAAA,EACnC,yBAA0BA,EAAE,EAAU,SAAA,CACxC,CAAC,EACA,IACCC,GAAQ,CACNH,GAAS,CACP,UAAWI,GAAU,OAAO,EAC5B,MAAOC,GAAE,EAAS,SAAA,EAClB,QAASJ,GAAO,CAAC,YAAa,WAAY,eAAe,CAAC,EAC1D,UAAWA,GACH,CAAC,MAAO,OAAQ,QAAS,SAAU,cAAe,sBAAsB,CAAC,EAC9E,SAAA,EACH,gBAAiBK,GAEbN,GAAS,CACP,KAAMK,GAAE,EACR,SAAUC,GAAQD,IAAU,CAAA,CAC7B,CAAA,EAEF,SAAA,EACH,uBAAwBH,EAAE,EAAU,SAAA,EACpC,uBAAwBA,EAAE,EAAU,SAAA,EACpC,2BAA4BA,EAAE,EAAU,SAAA,EACxC,0BAA2BA,EAAE,EAAU,SAAA,EACvC,uBAAwBA,EAAE,EAAU,SAAA,EAEpC,gBAAiBA,EAAE,EAAU,SAAA,EAC7B,mBAAoBK,GAAE,EAAS,SAAA,EAC/B,IAAKF,GAAE,EAAS,IAAA,EAAM,SAAA,EACtB,gBAAiBG,GAASH,GAAE,EAAUI,GAAE,CAAS,EAAE,SAAA,EACnD,eAAgBJ,GAAE,EAAS,SAAA,CAAS,CACrC,EACDL,GAAS,CACP,UAAWI,GAAU,MAAM,EAC3B,QAASH,GAAO,CAAC,YAAa,gBAAiB,UAAU,CAAC,EAC1D,kBAAmBC,EAAE,EAAU,SAAA,CAAS,CACzC,CAAA,CACF,CACH,EAoCWQ,GAAoBt5B,GAAkC,CACjE,MAAMu5B,EAAYZ,GAAsB,UAAU34B,CAAG,EAErD,GAAIu5B,EAAU,UAAY,GAAO,CAC/B,MAAMn1B,EAAQ,IAAI,MAAM,0BAA0B,EAClD,MAAAA,EAAM,MAAQm1B,EAAU,MAClBn1B,CACR,CAEA,OAAOm1B,EAAU,IACnB,ECxFaC,GAAmB,CAC9BlmC,EACAmmC,IACqB,CACrB,GAAInmC,EAAK,KAAOmmC,EACd,OAAOnmC,EAGT,GAAI,aAAcA,EAChB,UAAWomC,KAASpmC,EAAK,SAAU,CACjC,MAAMqmC,EAAQH,GAAiBE,EAAOD,CAAY,EAClD,GAAIE,EACF,OAAOA,CAEX,CAGF,OAAO,IACT,ECnBMC,OAA6C,IAAI,CACrD,QACA,WACA,YACA,gBACA,OACF,CAAC,EA4BYC,GAA0B,CACrCC,EACAC,EACAt3B,EAEI,CAAE,yBAA0B,MACC,CACjC,MAAMk3B,EAAQH,GAAiBM,EAAO,SAAUC,CAAM,EAGtD,GAAI,CAACJ,EACH,MAAO,CACL,QAAS,GACT,OAAQ,oCAAA,EAKZ,GAAIA,EAAM,OAAS,SAAU,CAC3B,MAAMK,EAAqBL,EAAM,SAAS,OAAQD,GAChDE,GAAe,IAAIF,EAAM,IAAI,CAAA,EAG/B,OAAIM,EAAmB,SAAW,EACzB,CACL,QAAS,GACT,OAAQ,gDAAA,EAIRA,EAAmB,SAAW,EACzB,CACL,QAAS,GACT,KAAMA,EAAmB,CAAC,EAC1B,KAAM,6EAAA,EAINv3B,EAAQ,yBACH,CACL,QAAS,GACT,KAAMu3B,EAAmB,CAAC,EAC1B,KAAM,wFAAA,EAIH,CACL,QAAS,GACT,OAAQ,gDAAA,CAEZ,CAGA,OAAKJ,GAAe,IAAID,EAAM,IAAI,EAQ3B,CAAE,QAAS,GAAM,KAAMA,CAAA,EAPrB,CACL,QAAS,GACT,OAAQ,qCAAA,CAMd,2LCnGC,SAAUM,EAAQC,EAAS,CACuCC,EAAA,QAAiBD,GAGpF,GAAGE,IAAO,UAAY,CAElB,IAAIC,EAAgB,OAAO,SAAY,WACnCC,GAAgB,SAAUC,EAAK,CAC/B,GAAI,OAAO,YAAe,SACtB,OAAO,WAEX,OAAO,eAAeA,EAAK,yBAA0B,CACjD,IAAK,UAAe,CAChB,OAAO,IACvB,EACY,aAAc,EAC1B,CAAS,EACD,IAAIN,GAAS,uBACb,cAAOM,EAAI,uBACJN,EACf,GAAO,OAAO,SAAS,EACfO,EAAe,OAAO,QAAW,YACjCC,EAAY,OAAO,KAAQ,YAC3BC,EAAY,OAAO,KAAQ,YAC3BC,EAAgB,OAAO,SAAY,YACnCC,EAAgB,OAAO,SAAY,YACnCC,EAAiB,OAAO,UAAa,YACrCC,EAAuBN,GAAgB,OAAO,OAAO,UAAa,YAClEO,EAA0BP,GAAgB,OAAO,OAAO,aAAgB,YACxEQ,EAAmBN,GAAa,OAAO,IAAI,UAAU,SAAY,WACjEO,EAAmBR,GAAa,OAAO,IAAI,UAAU,SAAY,WACjES,EAAuBF,GAAoB,OAAO,eAAe,IAAI,IAAG,EAAG,SAAS,EACpFG,EAAuBF,GAAoB,OAAO,eAAe,IAAI,IAAG,EAAG,SAAS,EACpFG,EAAsBN,GAAwB,OAAO,MAAM,UAAU,OAAO,QAAQ,GAAM,WAC1FO,EAAyBD,GAAuB,OAAO,eAAe,CAAA,EAAG,OAAO,QAAQ,GAAG,EAC3FE,EAAuBR,GAAwB,OAAO,OAAO,UAAU,OAAO,QAAQ,GAAM,WAC5FS,EAA0BD,GAAwB,OAAO,eAAe,GAAG,OAAO,QAAQ,GAAG,EAC7FE,EAA0B,EAC1BC,EAA2B,GAC/B,SAASC,EAAW17B,EAAK,CACrB,IAAI27B,GAAY,OAAO37B,EACvB,GAAI27B,KAAc,SACd,OAAOA,GAEX,GAAI37B,IAAQ,KACR,MAAO,OAEX,GAAIA,IAAQs6B,EACR,MAAO,SAEX,GAAI,MAAM,QAAQt6B,CAAG,IAChB+6B,IAA4B,IAAS,EAAE,OAAO,eAAe/6B,IAC9D,MAAO,QAEX,GAAI,OAAO,QAAW,UAAY,SAAW,KAAM,CAC/C,GAAI,OAAO,OAAO,UAAa,UAAYA,IAAQ,OAAO,SACtD,MAAO,WAEX,GAAI,OAAO,OAAO,UAAa,UAAYA,IAAQ,OAAO,SACtD,MAAO,WAEX,GAAI,OAAO,OAAO,WAAc,SAAU,CACtC,GAAI,OAAO,OAAO,UAAU,WAAc,UACtCA,IAAQ,OAAO,UAAU,UACzB,MAAO,gBAEX,GAAI,OAAO,OAAO,UAAU,SAAY,UACpCA,IAAQ,OAAO,UAAU,QACzB,MAAO,aAE3B,CACY,IAAK,OAAO,OAAO,aAAgB,YAC/B,OAAO,OAAO,aAAgB,WAC9BA,aAAe,OAAO,YAAa,CACnC,GAAIA,EAAI,UAAY,aAChB,MAAO,mBAEX,GAAIA,EAAI,UAAY,KAChB,MAAO,2BAEX,GAAIA,EAAI,UAAY,KAChB,MAAO,4BAE3B,CACA,CACQ,IAAI47B,GAAab,GAA2B/6B,EAAI,OAAO,WAAW,EAClE,GAAI,OAAO47B,IAAc,SACrB,OAAOA,GAEX,IAAIC,EAAe,OAAO,eAAe77B,CAAG,EAC5C,OAAI67B,IAAiB,OAAO,UACjB,SAEPA,IAAiB,KAAK,UACf,OAEPxB,GAAiBwB,IAAiB,QAAQ,UACnC,UAEPnB,GAAamB,IAAiB,IAAI,UAC3B,MAEPpB,GAAaoB,IAAiB,IAAI,UAC3B,MAEPjB,GAAiBiB,IAAiB,QAAQ,UACnC,UAEPlB,GAAiBkB,IAAiB,QAAQ,UACnC,UAEPhB,GAAkBgB,IAAiB,SAAS,UACrC,WAEPpB,GAAaoB,IAAiBV,EACvB,eAEPT,GAAamB,IAAiBX,EACvB,eAEPE,GAAuBS,IAAiBR,EACjC,iBAEPC,GAAwBO,IAAiBN,EAClC,kBAEPM,IAAiB,KACV,SAEJ,OACF,UACA,SACA,KAAK77B,CAAG,EACR,MAAMw7B,EAAyBC,CAAwB,CACpE,CAEI,OAAOC,CAEX,kDC1IMI,GAAiB,OAAO,QAAW,YACnCC,GAAqBD,IAAkB,OAAO,OAAO,MAAS,YAEvDE,GAAWF,GAOpB,SAAkBnrC,EAAO,CACvB,OAAO,OAAO,SAASA,CAAK,CAC9B,EAQA,UAAoB,CAClB,MAAO,EACT,EAES6N,GAAOu9B,GAOhB,SAAcprC,EAAO,CACnB,OAAO,OAAO,KAAKA,CAAK,CAC1B,EACAmrC,GASA,SAAcnrC,EAAO,CACnB,OAAO,IAAI,OAAOA,CAAK,CACzB,EASA,SAAcA,EAAO,CACnB,OAAOA,CACT,EC9CG,SAASsrC,GAAWtrC,EAAO,CAGhC,OAAIqrC,GAASrrC,CAAK,EACT,SAGF+qC,GAAW/qC,CAAK,CACzB,CCbA,MAAMurC,GAAoB,IAAI,IAAI,CAChC,YACA,QACA,MACA,SACA,KACF,CAAC,EAUM,SAASC,GAAIC,EAAYn8B,EAAKo8B,EAAO,KAAM,CAGhD,OAFkBA,GAAQJ,GAAWG,CAAU,EAE9B,CACf,IAAK,YACL,IAAK,QACL,IAAK,SACH,OAAOA,EAAWn8B,CAAG,EACvB,IAAK,MACH,OAAOm8B,EAAW,IAAIn8B,CAAG,EAC3B,IAAK,MAGH,OAAOA,CAEb,CACA,CAOO,SAASq8B,GAAaD,EAAM,CACjC,OAAOH,GAAkB,IAAIG,CAAI,CACnC,CAWO,SAASE,GAAIH,EAAYn8B,EAAKtP,EAAO0rC,EAAO,KAAM,CAGvD,OAFkBA,GAAQJ,GAAWG,CAAU,EAE9B,CACf,IAAK,YACL,IAAK,QACL,IAAK,SACHA,EAAWn8B,CAAG,EAAItP,EAClB,MACF,IAAK,MACHyrC,EAAW,IAAIn8B,EAAKtP,CAAK,EACzB,MACF,IAAK,MACHyrC,EAAW,IAAIzrC,CAAK,EACpB,KAEN,CAEE,OAAOyrC,CACT,CC5EA,MAAMI,GACJ,OAAO,YAAe,aACtB,aAAe,MACf,WAAW,SAAW,QACtB,WAEIC,GACJ,OAAO,QAAW,aAClB,SAAW,MACX,OAAO,SAAW,QAClB,OAEIC,GACJ,OAAO,MAAS,aAChB,OAAS,MACT,KAAK,SAAW,QAChB,KAEWpC,GACXkC,IAAkBC,IAAcC,IAAY,SAAS,aAAa,EAAC,ECVrE,SAASC,GAAgBhsC,EAAO,CAC9B,OAAOA,EAAM,MAAM,CAAC,CACtB,CAQA,SAASisC,GAAYjsC,EAAO,CAC1B,OAAO,IAAI,QAAQA,EAAM,SAAS,CACpC,CAQA,SAASksC,GAAalsC,EAAO,CAE3B,OAAO,IAAI,SAASA,EAAM,MAAM,CAClC,CAQA,SAASmsC,GAAWnsC,EAAO,CACzB,OAAOosC,GAAYpsC,CAAK,CAC1B,CAQA,SAASqsC,GAASrsC,EAAO,CACvB,OAAO,IAAI,KAAKA,EAAM,SAAS,CACjC,CAQA,SAASssC,GAAWtsC,EAAO,CACzB,OAAO,IAAI,OAAOA,CAAK,CACzB,CAQA,SAASusC,GAAWvsC,EAAO,CACzB,OAAO,IAAI,OAAOA,EAAM,OAAQA,EAAM,KAAK,CAC7C,CAQA,SAASwsC,GAAWxsC,EAAO,CACzB,OAAO,IAAI,OAAOA,CAAK,CACzB,CAQA,SAASysC,GAAezsC,EAAO0rC,EAAM,CAGnC,OAFmB/B,GAAa+B,CAAI,EAErB,KACN/B,GAAa+B,CAAI,EAAE,KAAK1rC,CAAK,EAG/B,IAAI2pC,GAAa+B,CAAI,EAAE1rC,CAAK,CACrC,CAQA,SAAS0sC,EAAY1sC,EAAO,CAC1B,OAAOA,CACT,CAOA,SAAS2sC,IAAgB,CACvB,MAAO,CAAA,CACT,CAOA,SAASC,IAAc,CACrB,OAAO,IAAI,GACb,CAOA,SAASC,IAAiB,CACxB,MAAO,CAAA,CACT,CAOA,SAASC,IAAc,CACrB,OAAO,IAAI,GACb,CAEA,MAAAC,GAAe,IAAI,IAAI,CAErB,CAAC,cAAef,EAAe,EAC/B,CAAC,UAAWC,EAAW,EACvB,CAAC,SAAUE,EAAU,EACrB,CAAC,WAAYD,EAAY,EACzB,CAAC,OAAQG,EAAQ,EACjB,CAAC,SAAUC,EAAU,EACrB,CAAC,SAAUC,EAAU,EACrB,CAAC,SAAUC,EAAU,EAIrB,CAAC,eAAgBC,EAAc,EAC/B,CAAC,eAAgBA,EAAc,EAC/B,CAAC,aAAcA,EAAc,EAC7B,CAAC,aAAcA,EAAc,EAC7B,CAAC,YAAaA,EAAc,EAC5B,CAAC,cAAeA,EAAc,EAC9B,CAAC,cAAeA,EAAc,EAC9B,CAAC,aAAcA,EAAc,EAC7B,CAAC,oBAAqBA,EAAc,EAGpC,CAAC,iBAAkBC,CAAW,EAC9B,CAAC,eAAgBA,CAAW,EAC5B,CAAC,UAAWA,CAAW,EACvB,CAAC,eAAgBA,CAAW,EAC5B,CAAC,kBAAmBA,CAAW,EAC/B,CAAC,WAAYA,CAAW,EACxB,CAAC,SAAUA,CAAW,EAEtB,CAAC,UAAWA,CAAW,EACvB,CAAC,UAAWA,CAAW,EAGvB,CAAC,UAAWA,CAAW,EACvB,CAAC,OAAQA,CAAW,EACpB,CAAC,SAAUA,CAAW,EACtB,CAAC,SAAUA,CAAW,EACtB,CAAC,SAAUA,CAAW,EACtB,CAAC,YAAaA,CAAW,EAIzB,CAAC,YAAaC,EAAa,EAC3B,CAAC,QAASA,EAAa,EACvB,CAAC,MAAOC,EAAW,EACnB,CAAC,SAAUC,EAAc,EACzB,CAAC,MAAOC,EAAW,CAarB,CAAC,EC1MD,SAASE,IAAO,CAAC,CAUV,SAASn/B,GAAK7N,EAAO0rC,EAAO,KAAMuB,EAAaD,GAAM,CACtD,UAAU,SAAW,GAAK,OAAOtB,GAAS,aAC5CuB,EAAavB,EACbA,EAAO,MAGT,MAAMtG,EAAYsG,GAAQJ,GAAWtrC,CAAK,EACpCktC,EAAeH,GAAQ,IAAI3H,CAAS,EAE1C,GAAIA,IAAc,SAAU,CAC1B,MAAMv1B,EAASo9B,EAAWjtC,EAAOolC,CAAS,EAE1C,GAAIv1B,IAAW,OACb,OAAOA,CAEX,CAGA,OAAOq9B,EAAeA,EAAaltC,EAAOolC,CAAS,EAAIplC,CACzD,CCxBe,SAASmtC,GAASntC,EAAO8R,EAAU,GAAI,CAChD,OAAOA,GAAY,aACrBA,EAAU,CACR,WAAYA,CAClB,GAGE,KAAM,CAEJ,WAAAm7B,CAGJ,EAAMn7B,EAEEszB,EAAYkG,GAAWtrC,CAAK,EAElC,GAAI,CAAC2rC,GAAavG,CAAS,EACzB,OAAOgI,GAAcptC,EAAO,KAAM,KAAM,IAAgB,EAG1D,MAAMqtC,EAAcx/B,GAAK7N,EAAOolC,EAAW6H,CAAU,EAE/CK,EAAa,IAAI,QAAQ,CAAC,CAACttC,EAAOqtC,CAAW,CAAC,CAAC,EAC/CE,EAAU,IAAI,QAAQ,CAACvtC,CAAK,CAAC,EAEnC,OAAOotC,GAAcptC,EAAOqtC,EAAaC,EAAYC,CAAmB,CAC1E,CAYA,SAASH,GAAcptC,EAAOgY,EAAOs1B,EAAYC,EAASN,EAAY,CACpE,MAAMvB,EAAOJ,GAAWtrC,CAAK,EACvBqtC,EAAcx/B,GAAK7N,EAAO0rC,CAAI,EAGpC,GAAI,CAACC,GAAaD,CAAI,EACpB,OAAO2B,EAGT,IAAI14B,EAEJ,OAAQ+2B,EAAI,CACV,IAAK,YACL,IAAK,QACH/2B,EAAO,OAAO,KAAK3U,CAAK,EACxB,MACF,IAAK,SACH2U,EAAO,OAAO,KAAK3U,CAAK,EACxB2U,EAAK,KAAK,GAAG,OAAO,sBAAsB3U,CAAK,CAAC,EAChD,MACF,IAAK,MACL,IAAK,MACH2U,EAAO3U,EAAM,KAAI,EACjB,KAEN,CAGE,QAASwtC,KAAiB74B,EAAM,CAC9B,MAAM84B,EAAkBjC,GAAIxrC,EAAOwtC,EAAe9B,CAAI,EAEtD,GAAI6B,EAAQ,IAAIE,CAAe,EAE7B7B,GAAI5zB,EAAOw1B,EAAeF,EAAW,IAAIG,CAAe,EAAG/B,CAAI,MAC1D,CACL,MAAMgC,EAAsBpC,GAAWmC,CAAe,EAChDE,EAAwB9/B,GAAK4/B,EAAiBC,CAAmB,EAGnE/B,GAAa+B,CAAmB,IAClCJ,EAAW,IAAIG,EAAiBE,CAAqB,EACrDJ,EAAQ,IAAIE,CAAe,GAG7B7B,GACE5zB,EACAw1B,EACAJ,GACEK,EACAE,EACAL,EACAC,CAEF,EACA7B,CACR,CACI,CACF,CAIA,OAAO1zB,CACT,2BC5DA,MAAM41B,EAAa,CAMjB,YAAY,CACV,MAAAC,EAAQ,WAAW,MAAM,KAAK,UAAU,EACxC,YAAAC,EAAc,yBACd,eAAAC,EAAiB,CAAA,CAAC,EACS,GAAI,CAVnCC,GAAA,KAAAC,GACED,GAAA,KAAAE,IACAF,GAAA,KAAAG,IACAH,GAAA,KAAAI,IACAJ,GAAA,KAAAK,GAOEC,EAAA,KAAKJ,GAAeJ,GACpBQ,EAAA,KAAKH,GAASN,GACdS,EAAA,KAAKD,EAAkBN,GACvBO,EAAA,KAAKF,GAAeG,EAAA,KAAKF,IAErBN,EAAe,OACjBS,EAAA,KAAKP,EAAAQ,IAAL,UAAuBV,EAAe,MAE1C,CAEA,iBAAkB,CAChB,MAAO,EAAQQ,EAAA,KAAKF,GAAgB,KACtC,CAEA,qBAAqBv8B,EAAkB,CACjCA,EAAQ,OACV08B,EAAA,KAAKP,EAAAQ,IAAL,UAAuB38B,EAAQ,OAGjCw8B,EAAA,KAAKD,EAAkBx2B,IAAA,GAClB02B,EAAA,KAAKF,IACLv8B,IAELw8B,EAAA,KAAKF,GAAeG,EAAA,KAAKF,GAC3B,CAEA,YAAYv8B,EAAkB,CAC5B,OAAAw8B,EAAA,KAAKF,GAAev2B,MAAA,GACf02B,EAAA,KAAKF,IACLE,EAAA,KAAKH,KACLt8B,IAGE,IACT,CAQA,WAAWwU,EAAgB,CACzB,MAAMooB,EAAkC,CACtC,eAAgB,kBAAA,EAGZC,EAAaroB,GAAA,KAAAA,EAASioB,EAAA,KAAKF,GAAgB,MACjD,GAAIM,GAAA,MAAAA,EAAY,WAAW,SACzBD,EAAQ,eAAe,EAAIC,UAClBA,GAAA,MAAAA,EAAY,WAAW,SAChCD,EAAQ,cAAmB,UAAUC,CAAU,OAE/C,OAAM,IAAI37B,GAGZ,OAAO07B,CACT,CAgIM,QAAQE,EAQX,QAAAtyB,EAAA,yBARW,CACZ,QAAAuyB,EACA,QAAAC,EAAU,CAAA,EACV,MAAAhtC,CAAA,EAKC,CACD,MAAMitC,EAAkB,IAAI,gBAAgB,CAC1C,YAAa,qBACb,SAAU,OAAA,CACX,EAEGD,EAAQ,OAAS,GACnBC,EAAgB,OAAO,MAAOD,EAAQ,KAAK,GAAG,CAAC,EAG7ChtC,GACFitC,EAAgB,OAAO,QAAS,GAAGjtC,CAAK,EAAE,EAG5C,MAAMktC,EAAcD,EAAgB,SAAA,EAE9BtrB,EAAM,YAAYorB,CAAO,IAAIG,CAAW,GAG9C,OAFiB,MAAMR,EAAA,KAAKP,EAAAgB,IAAL,UAA2BxrB,EAGpD,GAEM,cAAkEmrB,EAgBtE,QAAAtyB,EAAA,yBAhBsE,CACtE,QAAAuyB,EACA,QAAAC,EACA,MAAAI,EAAQ,EACR,GAAAC,EAAK,cACL,OAAAla,EAAS,KAAA,EAWT,CAKA,MAAMma,GAJc,MAAMZ,EAAA,KAAKP,EAAAgB,IAAL,UACxB,aAAaJ,CAAO,QAAQC,CAAO,WAAW7Z,CAAM,UAAUia,CAAK,KAG1C,OAE3B,GAAIC,IAAO,QACT,OAAOC,EAKT,MAAMC,EAAwBP,EAAQ,IAAW1F,GAAW9sB,EAAA,sBAC1D,MAAMgzB,EAAWF,EAAOhG,CAAM,EAC9B,GAAI,CAACkG,EACH,OAAO,KAGT,MAAMC,EAAgB,MAAMhB,EAAA,KAAKJ,IAAL,UAAYmB,GAExC,OAAKC,EAAc,GAID,MAAMA,EAAc,YAAA,EAH7B,IAKX,EAAC,EAEKC,EAAmB,MAAM,QAAQ,WAAWH,CAAqB,EAevE,OAbeP,EAAQ,OACrB,CAACW,EAAKrG,EAAQ9hB,IAAU,CACtB,MAAMooB,EAAgBF,EAAiBloB,CAAK,EAC5C,OAAIooB,EAAc,SAAW,YAC3BD,EAAIrG,CAAM,EAAIsG,EAAc,MAE5BD,EAAIrG,CAAM,EAAI,KAETqG,CACT,EACA,CAAA,CAAC,CAML,GAEM,cAAcb,EAIgB,QAAAtyB,EAAA,yBAJhB,CAClB,QAAAuyB,CAAA,EAGkC,SAClC,MAAMprB,EAAM,YAAYorB,CAAO,UAE/B,OAAO75B,GAAAH,GADU,MAAM25B,EAAA,KAAKP,EAAAgB,IAAL,UAAiCxrB,IACxC,OAAT,YAAA5O,EAAe,SAAf,KAAAG,EAAyB,CAAA,CAClC,GAEM,OAAQ,QAAAsH,EAAA,sBAGZ,OADiB,MAAMkyB,EAAA,KAAKP,EAAAgB,IAAL,UADX,QAGd,GACF,CAjTEf,GAAA,YACAC,GAAA,YACAC,GAAA,YACAC,EAAA,YAJFJ,EAAA,YA+CEQ,YAAkBnoB,EAAe,CAC/B,GAAI,CAACA,EAAM,WAAW,OAAO,GAAK,CAACA,EAAM,WAAW,OAAO,EACzD,MAAM,IAAIvT,EAEd,EAmBM48B,GAAA,SACJ79B,EACA89B,EACmB,QAAAtzB,EAAA,4BACnB,MAAMuzB,EAAW,MAAMD,EAAA,EAEvB,GAAI,CAACC,EAAS,GAAI,CAChB,MAAM3hC,EAAS2hC,EAAS,OACxB,IAAIC,EAA8B,KAClC,GAAI,CACFA,EAAe,MAAMD,EAAS,KAAA,CAChC,OAAQ5zB,EAAA,CAER,CAEA,GAAI/N,IAAW,IACb,MAAI4hC,GAAA,MAAAA,EAAc,SAAS,iBACnB,IAAI78B,GACD68B,GAAA,MAAAA,EAAc,SAAS,iBAC1B,IAAI58B,GACD48B,GAAA,MAAAA,EAAc,SAAS,uBAC1B,IAAI38B,GAGN,IAAIC,GAA2B,CAAE,OAAQ08B,EAAc,EAC/D,GAAW5hC,IAAW,IACpB,MAAM,IAAIoF,GAAS,CAAE,MAAOu8B,EAAU,EACxC,GAAW3hC,IAAW,IAAK,CACzB,MAAM6hC,EAAgBF,EAAS,QAAQ,IAAI,aAAa,EAClDG,EAAaD,EAAgB,OAAOA,CAAa,EAAI,KAE3D,GAAI,CAACC,EACH,MAAM,IAAIl8B,GAAkB,CAC1B,MAAO+7B,CAAA,CACR,EAaH,GAVoB,MAAMh7B,EAAA/C,EAAQ,gBAAR,YAAA+C,EAAA,KAAA/C,EAAwB,CAChD,WAAAk+B,EACA,cAAeH,EAAS,QAAQ,IAC9B,mBAAA,EAEF,mBAAoBA,EAAS,QAAQ,IACnC,yBAAA,CACF,GAIA,OAAO,IAAI,QAAQ,CAACI,EAASC,IAAW,OACtC,MAAMC,EAAU,WACd,IAAM,QACAt7B,EAAA/C,EAAQ,cAAR,MAAA+C,EAAqB,SAIzB25B,EAAA,KAAKP,EAAA0B,IAAL,UAAgB79B,EAAS89B,GAAS,KAAKK,CAAO,EAAE,MAAMC,CAAM,CAC9D,EACAF,EAAa,IAAO,GAAA,GAGtBn7B,EAAA/C,EAAQ,cAAR,MAAA+C,EAAqB,iBAAiB,QAAS,IAAM,CACnD,aAAas7B,CAAO,EACpBD,EAAO,IAAI,MAAM,4BAA4B,CAAC,CAChD,EACF,CAAC,EAGH,MAAM,IAAIp8B,GAAkB,CAAE,MAAO+7B,EAAU,CACjD,YACE3hC,IAAW,MACX4hC,GAAA,MAAAA,EAAc,SAAS,sBAEjB,IAAI77B,GAAgB,CAAE,MAAO47B,EAAU,EAEvC,IAAIl8B,GAAyB,CACjC,MAAOk8B,CAAA,CACR,CAEL,CAEA,OAAOA,CACT,IAEMZ,YAAQxrB,EAAyB,QAAAnH,EAAA,sBACrC,MAAM8zB,EAAcjD,GAASoB,EAAA,KAAKH,GAAY,EAC9CE,EAAA,KAAKF,GAAejB,GAASoB,EAAA,KAAKF,EAAe,GAEjD,MAAMuB,EAAU,IAAYtzB,EAAA,sBAO1B,OANiB,MAAMiyB,EAAA,KAAKJ,IAAL,UAAY,GAAGI,EAAA,KAAKL,GAAY,GAAGzqB,CAAG,GAAI,CAC/D,OAAQ,MACR,QAAS,KAAK,WAAW2sB,EAAY,KAAK,EAC1C,OAAQA,EAAY,WAAA,EAIxB,GAEA,GAAI,CAIF,OADsB,MAFL,MAAM5B,EAAA,KAAKP,EAAA0B,IAAL,UAAgBS,EAAaR,IAEf,KAAA,CAEvC,OAASn8B,EAAO,CACd,GACE28B,EAAY,cACX38B,aAAiBR,IAChBQ,aAAiBP,IACjBO,aAAiBN,IACjBM,aAAiBL,IACnB,CACA,MAAMi9B,EAAc,MAAMD,EAAY,YAAY38B,CAAK,EAEvD,GAAI48B,EACF,OAAAD,EAAY,MAAQC,EAAY,MAAM,SAGhB,MADL,MAAM7B,EAAA,KAAKP,EAAA0B,IAAL,UAAgBS,EAAaR,IACf,KAAA,CAIzC,CAEA,MAAMn8B,CACR,CACF,IC9NF,MAAM68B,GAAmD,CACvD,QAAS,MACT,IAAK,MACL,IAAK,KACP,uBAMO,MAAMC,EAAM,CAKjB,YAAY,CACV,KAAAC,EACA,eAAAC,EAAiB,kCACjB,aAAAC,EAAe,IAAI9C,EAAa,EAM9B,GAAI,CAdHI,GAAA,KAAA2C,IACL3C,GAAA,KAAA4C,GACA5C,GAAA,KAAA6C,IACA7C,GAAA,KAAA8C,IAYExC,EAAA,KAAKuC,GAAkBJ,GACvBnC,EAAA,KAAKwC,GAAgBJ,GAEjBF,IACF,KAAK,KAAOA,EAEhB,CAEU,SAAU,CAClB,MAAO,CAAC,CAACjC,EAAA,KAAKqC,EAChB,CAEA,IAAI,KAAKJ,EAAY,CACnBlC,EAAA,KAAKsC,EAAQJ,EACf,CAEA,IAAc,SAAU,CACtB,MAAM9B,EAAkC,CACtC,eAAgB,kBAAA,EAGlB,OAAIH,EAAA,KAAKqC,KACPlC,EAAQ,cAAmB,UAAUH,EAAA,KAAKqC,GAAM,KAAK,GAEjD,WAAYrC,EAAA,KAAKqC,KACnBlC,EAAQ,WAAW,EAAIH,EAAA,KAAKqC,GAAM,SAI/BlC,CACT,CAwRM,aACJE,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAA0B,CAAA,EAC1BC,EACA,OACA,IAAI7H,EACJ,GAAI,CACFA,EAAS,MAAMoF,EAAA,KAAKuC,IACjB,YAAY,CAAE,MAAOz8B,EAAO,WAAY,YAAa28B,CAAA,CAAQ,EAC7D,QAAQ,CACP,QAAS38B,EAAO,OAAA,CACjB,CACL,OAASZ,EAAO,CACd,GAAIA,aAAiB,OAASA,EAAM,OAAS,aAE3C,MAAMA,CAIV,CAEA,MAAMw9B,EAAWtI,GAAiBt0B,EAAO,QAAQ,EAE7C80B,IACF,MAAMqF,EAAA,KAAKmC,GAAAO,IAAL,UAA4B/H,EAAQ90B,EAAO,QAAS,CACxD,0BAA0BQ,EAAAo8B,EAAS,2BAAT,KAAAp8B,EAAqC,EAAA,IAInE,IAAIs8B,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,MAAMQ,EAAc,CAClB,SAAAD,EACA,QAAS98B,EAAO,QAChB,WAAYA,EAAO,WACnB,QAASA,EAAO,QAChB,sBAAuBA,EAAO,sBAC9B,cAAeA,EAAO,cACtB,SAAU48B,EAAS,SACnB,MAAOA,EAAS,MAChB,UAAWA,EAAS,UACpB,QAASA,EAAS,QAClB,UAAWA,EAAS,UACpB,kBAAmBA,EAAS,kBAC5B,uBAAwBA,EAAS,uBACjC,uBAAwBA,EAAS,uBACjC,gBAAiBA,EAAS,gBAC1B,mBAAoBA,EAAS,mBAC7B,uBAAwBA,EAAS,uBACjC,yBAA0BA,EAAS,yBACnC,2BAA4BA,EAAS,2BACrC,0BAA2BA,EAAS,0BACpC,uBAAwBA,EAAS,uBACjC,oBAAqBA,EAAS,oBAC9B,sBAAuBA,EAAS,sBAChC,yBAA0BA,EAAS,yBACnC,gBAAiBA,EAAS,gBAC1B,KAAMA,EAAS,eACf,WAAY58B,EAAO,WACnB,OAAQA,EAAO,OACf,OAAQA,EAAO,OAEf,cAAeA,EAAO,aAAA,EAGxB,OAAOm6B,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,cACAD,EACAL,EACA,UACAC,EAEJ,GAEM,wBACJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAqC,CAAA,EACrCC,EACA,CACA,IAAIG,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,IAAIniC,EACJ,GAAI4F,EAAO,SACT5F,EAAQ,CACN,KAAM,eACN,SAAU4F,EAAO,SACjB,IAAKA,EAAO,GAAA,UAELA,EAAO,MAChB5F,EAAQ,CACN,KAAM,QACN,MAAO4F,EAAO,MACd,IAAKA,EAAO,GAAA,UAELA,EAAO,IAChB5F,EAAQ,CACN,KAAM,MACN,IAAK4F,EAAO,GAAA,MAGd,OAAM,IAAI,MAAM,sDAAsD,EAGxE,IAAIi9B,EACAj9B,EAAO,iCACTi9B,EAAS,YAGX,MAAMF,EAAc,CAClB,SAAAD,EACA,cAAe98B,EAAO,cACtB,OAAQA,EAAO,OACf,OAAQA,EAAO,OACf,KAAMA,EAAO,KACb,OAAQ,CACN,MAAA5F,EACA,YAAa,CACX,UAAW4F,EAAO,SAAS,UAC3B,SAAUA,EAAO,SAAS,SAC1B,QAASA,EAAO,SAAS,OAAA,EAE3B,cAAe,CACb,KAAM,SAAA,EAER,OAAAi9B,CAAA,CACF,EAGF,OAAO9C,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,UACAD,EACAL,EACA,MACAC,EAEJ,GAkCM,uBACJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAoC,CAAA,EACpCC,EACA,OACA,IAAIG,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,MAAMQ,EAAc,CAClB,SAAAD,EACA,cAAe98B,EAAO,cACtB,OAAQwD,EAAA,CACN,OAAQxD,EAAO,OACf,WAAYA,EAAO,WACnB,OAAQA,EAAO,OACf,YAAa,CACX,SAAUA,EAAO,SAAS,SAC1B,UAAWA,EAAO,SAAS,UAC3B,QAASA,EAAO,SAAS,QACzB,UAAWA,EAAO,SAAS,SAAA,EAE7B,KAAMA,EAAO,SAAS,OAClBQ,EAAAR,EAAO,SAAS,kBAAhB,KAAAQ,EAAmC,CAAA,GAEzC,WAAYR,EAAO,UAAA,EAGrB,OAAOm6B,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,UACAD,EACAL,EACA,MACAC,EAEJ,GAKM,kBACJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAqC,CAAA,EACrCC,EACA,CACA,IAAIG,EAAW98B,EAAO,SAClBk6B,EAAA,KAAKqC,IAAS,WAAYrC,EAAA,KAAKqC,IAASrC,EAAA,KAAKqC,GAAM,SAChDO,GAAA,MAAAA,EAAU,aACbA,EAAW,CAAE,WAAY5C,EAAA,KAAKqC,GAAM,MAAA,IAIxC,MAAMQ,EAAc,CAClB,SAAAD,EACA,cAAe98B,EAAO,cACtB,OAAQA,EAAO,MAAA,EAGjB,OAAOm6B,EAAA,KAAKmC,GAAAU,IAAL,UACL,OACA,UACAD,EACAL,EACA,MACAC,EAEJ,GAEM,sBAMJpC,EAGA,QAAAtyB,EAAA,yBAHAjI,EACA08B,EAAwD,CAAA,EACxDC,EACA,CACA,MAAMI,EAAc,CAAA,EAEpB,OAAO5C,EAAA,KAAKmC,GAAAU,IAAL,UACL,MACA,YAAYh9B,EAAO,SAAS,GAC5B+8B,EACAL,EACA,OACAC,EAEJ,GACF,CAtlBEJ,EAAA,YACAC,GAAA,YACAC,GAAA,YAHKH,GAAA,YA+CCO,GAAA,SACJ/H,EACAoI,EACAz/B,EAGA,QAAAwK,EAAA,sBAKA,MAAM7I,EAJsB89B,EAAQ,IAAKnI,GACvCF,GAAwBC,EAAQC,EAAQt3B,CAAO,CAAA,EAGf,KAC/B0/B,GAAiB,CAACA,EAAa,OAAA,EAGlC,GAAI/9B,EACF,MAAM,IAAId,GAAa,CACrB,KAAM,eACN,OAAQc,EAAM,MAAA,CACf,CAEL,IAWM49B,GAAA,SAMJnkC,EACAukC,EACAL,EACAL,EACAW,EACAV,EACyB,QAAA10B,EAAA,kDACzB,GAAI,KAAK,QAAA,IAAc,GACrB,MAAM,IAAI,MAAM,oDAAoD,EAGtE,MAAMzM,EAAkC,CAAA,EAClCyE,EAAoB,CACxB,OAAApH,EACA,QAASkL,EAAAP,EAAA,GACJ,KAAK,SADD,CAEP,OAAQ,mBAAA,GAEV,OAAAm5B,CAAA,EAEF,GAAI9jC,IAAW,OAAQ,CACrB,MAAMykC,EAAcl/B,GAAK,KAAK,UAAU2+B,CAAW,CAAC,EACpD98B,EAAK,KAAOq9B,EACZr9B,EAAK,QAAU8D,EAAAP,EAAA,GACTvD,EAAK,SADI,CAEb,mBAAoB,OACpB,eAAgB,kBAAA,EAEpB,CAEA,MAAMu7B,EAAW,MAAM,MAAM,GAAGtB,EAAA,KAAKsC,GAAe,GAAGY,CAAQ,GAAIn9B,CAAI,EAEvE,GAAI,CAACu7B,EAAS,GAAI,CAChB,MAAM+B,EAAY,MAAM/B,EAAS,KAAA,EAEjC,IAAIgC,GACJ,GAAI,CACFA,GAAW,KAAK,MAAMD,CAAS,CACjC,OAAQ31B,GAAA,CAAC,CAET,OAAIpH,EAAAg9B,IAAA,YAAAA,GAAU,QAAV,YAAAh9B,EAAiB,QAAS,YAC5B,QAAQ,IACN,wBACA,KAAK,UAAUg9B,GAAS,MAAM,OAAQ,KAAM,CAAC,CAAA,EAEzC,IAAIl/B,GAAa,CACrB,KAAM,4BACN,OAAQ,uBACR,OAAQk/B,GAAS,MAAM,OACvB,OAAQhC,EAAS,MAAA,CAClB,GAGC,OAAOgC,IAAa,SAChB,IAAIl/B,GAAa,CACrB,KAAM,UAAUk/B,EAAQ,IACxB,OAAQ,UACR,OAAQhC,EAAS,MAAA,CAClB,EAGG,IAAIl9B,GAAa,CACrB,KAAM,4BACN,OAAQi/B,EACR,OAAQ/B,EAAS,MAAA,CAClB,CACH,CAEA,GAAI,CAACA,EAAS,KACZ,MAAM,IAAIl9B,GAAa,CACrB,KAAM,eACN,OAAQ,wBACR,OAAQk9B,EAAS,MAAA,CAClB,EAGH,MAAMiC,EAAajC,EAAS,QAAQ,IAAI,kBAAkB,EACpDkC,EAAUD,GAAcxB,GAAwBwB,CAAU,EAC5DC,GAAW,OAAOhB,GAAY,YAChCA,EAAQ,CAAE,KAAM,eAAgB,QAAS,CAAE,QAAAgB,CAAA,EAAgB,EAG7D,MAAMC,EAASnC,EAAS,KAAK,UAAA,EACvBoC,EAAU,IAAI,YACpB,IAAIC,EAAS,GAEb,GAAI,CACF,OAAa,CACX,KAAM,CAAE,KAAAC,EAAM,MAAAnyC,EAAA,EAAU,MAAMgyC,EAAO,KAAA,EACrC,GAAIG,EACF,MAGFD,GAAUD,EAAQ,OAAOjyC,GAAO,CAAE,OAAQ,GAAM,EAEhD,MAAM6hB,GAAQqwB,EAAO,MAAM;AAAA,CAAI,EAG/BA,EAASrwB,GAAM,OAAS,GAExB,UAAWG,MAAQH,GACjB,GAAI,GAACG,GAAK,KAAA,GAAUA,GAAK,WAAW,GAAG,IAEnCA,GAAK,WAAW,QAAQ,EAAG,CAC7B,IAAIvY,EACJ,GAAI,CACFA,EAAO,KAAK,MAAMuY,GAAK,MAAM,CAAC,CAAC,CACjC,OAAQ/F,GAAA,CAEN,QACF,CAEA,OAAQxS,EAAK,KAAA,CACX,IAAK,WAAY,CACf,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZuL,EAAA+7B,EAAQ,aAAR,MAAA/7B,EAAA,KAAA+7B,EAAqB,CACnB,UAAYtnC,EAAa,SAAA,GAE/B,KACF,CACA,IAAK,QAAS,CACZoG,EAAO,UAAapG,EAAa,UACjC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZiR,EAAAq2B,EAAQ,UAAR,MAAAr2B,EAAA,KAAAq2B,EAAkB,CAAE,UAAYtnC,EAAa,SAAA,GACjD,KACF,CAEA,IAAK,cAAe,CACdioC,IAAgB,YAClB,OAAOX,GAAY,WACfA,EAAQtnC,CAAI,GACZgR,EAAAs2B,EAAQ,eAAR,MAAAt2B,EAAA,KAAAs2B,EAAuB,CACrB,QAAUtnC,EAAa,OAAA,IAG/B,KACF,CAEA,IAAK,kBAAmB,CACtB,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZkR,EAAAo2B,EAAQ,mBAAR,MAAAp2B,EAAA,KAAAo2B,GACJ,KACF,CAEA,IAAK,cAAe,CAClBlhC,EAAO,OAAUpG,EAAa,QAAQ,OAEtC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ+Q,EAAAu2B,EAAQ,eAAR,MAAAv2B,EAAA,KAAAu2B,EAAwBtnC,EAAa,SACzC,KACF,CAEA,IAAK,iBAAkB,CACjBioC,IAAgB,YAClB7hC,EAAO,cAAiBpG,EAAa,cACrCoG,EAAO,uBACLpG,EACA,uBAEF,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZmR,EAAAm2B,EAAQ,kBAAR,MAAAn2B,EAAA,KAAAm2B,EAA0B,CACxB,cAAgBtnC,EAAa,cAC7B,uBAAyBA,EACtB,sBAAA,IAGX,KACF,CAEA,IAAK,kBAAmB,CACjBA,EAAa,QAAQ,SAAW,YACnCoG,EAAO,MAASpG,EAAa,QAAQ,OAGvC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ8Q,EAAAw2B,EAAQ,mBAAR,MAAAx2B,EAAA,KAAAw2B,EAA2B,CACzB,OAAStnC,EAAa,QAAQ,OAC9B,SAAWA,EAAa,QAAQ,SAChC,MAAQA,EAAa,QAAQ,KAAA,GAEnC,KACF,CAEA,IAAK,4BAA6B,CAChC,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZoR,EAAAk2B,EAAQ,4BAAR,MAAAl2B,EAAA,KAAAk2B,EACEtnC,EAAK,QAAQ,kBAEnB,KACF,CAEA,IAAK,qBAAsB,CACzB,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ6Q,GAAAy2B,EAAQ,qBAAR,MAAAz2B,GAAA,KAAAy2B,EAA6BtnC,EAAK,QAAQ,WAC9C,KACF,CAEA,IAAK,oBACL,IAAK,uBAAwB,CAC3B,OAAOsnC,GAAY,WACfA,EAAQtnC,CAAI,GACZ4Q,GAAA02B,EAAQ,qBAAR,MAAA12B,GAAA,KAAA02B,GACJ,KACF,CAEA,IAAK,QACH,MAAM,IAAIp+B,GAAa,CACrB,KAAOlJ,EAAa,QAAQ,UAC5B,OAASA,EAAa,QAAQ,MAAA,CAC/B,EAGH,IAAK,OACH,OAAAoG,EAAO,WAAcpG,EAAa,QAAQ,WAC1CoG,EAAO,UAAapG,EAAa,QAAQ,UAClCoG,CACT,CAEJ,CAEJ,CACF,QAAA,CACEmiC,EAAO,OAAA,CACT,CAEA,MAAM,IAAIr/B,GAAa,CACrB,KAAM,aACN,OAAQ,8CACR,OAAQ,GAAA,CACT,CACH,ICpWK,MAAMy/B,GACXC,GACiE,OACjE,GAAI,CAACA,EACH,MAAO,CAAC,GAAO,GAAI,EAAE,EAGvB,GAAI,CACF,MAAM5uB,EAAM,IAAI,IAAI4uB,CAAS,EACvBx4B,EAAO4J,EAAI,SAEjB,GACEA,EAAI,SAAW,yBACfA,EAAI,SAAW,0BAEf,MAAO,CAAC,GAAO,GAAI,EAAE,EAGvB,MAAM6uB,EAAmB7uB,EAAI,SAAA,EAC7B,GAAI4uB,IAAcC,EAChB,MAAO,CAAC,GAAO,GAAI,EAAE,EAGvB,MAAMlJ,IAAUv0B,EAAA4O,EAAI,aAAa,IAAI,SAAS,IAA9B,KAAA5O,EAAmC,IAAI,QAAQ,KAAM,GAAG,EAClEg6B,EAAUh1B,EAAK,MAAM,GAAG,EAAE,CAAC,EAOjC,MAAO,EALJA,EAAK,WAAW,QAAQ,GACvB4J,EAAI,aAAa,IAAI,MAAM,IAAM,cACnC5J,EAAK,WAAW,UAAU,GAC1BA,EAAK,WAAW,SAAS,IAECg1B,EAAQ,SAAW,GAAIA,EAASzF,CAAM,CACpE,OAAQntB,EAAA,CACN,MAAO,CAAC,GAAO,GAAI,EAAE,CACvB,CACF,EAEas2B,GAAoB,CAAC,CAChC,QAAA1D,EACA,OAAAzF,EACA,UAAAoJ,CACF,IAIM,CACJ,MAAM/uB,EAAM,IAAI,IAAI,uBAAuB,EAC3C,OAAAA,EAAI,SAAW,UAAUorB,CAAO,GAE5B2D,IAGF/uB,EAAI,SAAW,GAAGA,EAAI,QAAQ,oBAG5B2lB,GACF3lB,EAAI,aAAa,IAAI,UAAW2lB,EAAO,QAAQ,IAAK,GAAG,CAAC,EAGnD3lB,CACT,EAEO,MAAMgvB,WAAsB,KAAM,CAGvC,YAAYx4B,EAAiB1Z,EAAe,CAC1C,MAAM0Z,CAAO,EACb,KAAK,SAAW1Z,CAClB,CACF,CCnEO,MAAMmyC,GAAwB,CAAC,CACpC,MAAAC,EACA,WAAAC,EAAa,aACf,IAGM,CACJ,MAAM/iC,EAAqB,CAAA,EACrBgjC,MAAgB,IAEtB,SAASC,EAAYC,EAAkB,CACrC,GAAIF,EAAU,IAAIE,CAAQ,GAAK,CAACJ,EAAMI,CAAQ,EAC5C,OAGFF,EAAU,IAAIE,CAAQ,EACtBljC,EAAOkjC,CAAQ,EAAIJ,EAAMI,CAAQ,EAEjBC,GAAaL,EAAMI,CAAQ,EAAE,OAAO,EAE5C,QAASE,GAAe,CAC9B,GAAI,CACF,MAAMC,EAAeC,GAAkBJ,EAAUE,CAAU,EAE3D,GAAIC,EAAa,WAAW,MAAM,EAAG,CACnC,MAAME,EAAYF,EAAa,MAAM,GAAG,EAAE,MAAM,EAAG,EAAE,EAAE,KAAK,GAAG,EAC9CG,GAAuBV,EAAOS,CAAS,EAC/C,QAASE,GAAS,CACpBT,EAAU,IAAIS,CAAI,GACrBR,EAAYQ,CAAI,CAEpB,CAAC,CACH,CACF,OAAS7/B,EAAO,CACd,QAAQ,KACN,4BAA4Bw/B,CAAU,OAAOF,CAAQ,IACrDt/B,CAAA,CAEJ,CACF,CAAC,CACH,CAEA,cAAO,QAAQk/B,CAAK,EAAE,QAAQ,CAAC,CAACrjC,EAAKtP,CAAK,IAAM,CAC1CsP,EAAI,WAAWsjC,CAAU,EAC3BE,EAAYxjC,CAAG,EACLA,EAAI,WAAW,MAAM,IAC/BO,EAAOP,CAAG,EAAItP,EAElB,CAAC,EAEM6P,CACT,EAEA,SAASmjC,GAAaO,EAA2B,CAC/C,MAAMC,EAAc,6BACdC,EAAU,mCACVC,EAAoB,CAAA,EAC1B,IAAInpC,EAEJ,MAAQA,EAAQipC,EAAY,KAAKD,CAAO,KAAO,MAC7CG,EAAQ,KAAKnpC,EAAM,CAAC,CAAC,EAGvB,MAAQA,EAAQkpC,EAAQ,KAAKF,CAAO,KAAO,MACzCG,EAAQ,KAAKnpC,EAAM,CAAC,CAAC,EAGvB,MAAO,CAAC,GAAG,IAAI,IAAImpC,CAAO,CAAC,CAC7B,CAEA,SAASP,GAAkBQ,EAAkBV,EAA4B,CACvE,GAAI,CAACA,EAAW,WAAW,GAAG,EAC5B,OAAOA,EAGT,MAAMW,EAAUD,EAAS,MAAM,GAAG,EAAE,MAAM,EAAG,EAAE,EACzCE,EAAcZ,EAAW,MAAM,GAAG,EAClCa,EAA0B,CAAC,GAAGF,CAAO,EAE3C,UAAWG,KAAQF,EACbE,IAAS,KACXD,EAAc,IAAA,EACLC,IAAS,KAClBD,EAAc,KAAKC,CAAI,EAI3B,OAAOD,EAAc,KAAK,GAAG,CAC/B,CAEA,SAAST,GAAuBV,EAAmBqB,EAA2B,CAC5E,OAAO,OAAO,KAAKrB,CAAK,EAAE,OAAQW,GAASA,EAAK,WAAWU,CAAO,CAAC,CACrE,CCjDA,SAASC,GAKPC,EACA7/B,EACA8/B,EAIgC,CAChC,OAAO,IAAI,eAAe,CACxB,MAAMC,EAAY,CAChBD,EACG,KAAKD,EAAO7/B,EAAS4F,GAAiB,CACjCA,EAAQ,OAAS,SAOnBm6B,EAAW,QAAQn6B,CAAO,GAGxBA,EAAQ,OAAS,WAAaA,EAAQ,OAAS,UACjDm6B,EAAW,MAAA,CAEf,CAAC,EACA,KAAMC,GAAY,CACjBD,EAAW,QAAQ,CACjB,KAAM,OACN,QAAS,CACP,WAAYC,EAAQ,WACpB,UAAWA,EAAQ,SAAA,CACrB,CACM,EACRD,EAAW,MAAA,CACb,CAAC,EACA,MAAO3gC,GAAU,CAChB2gC,EAAW,QAAQ,CACjB,KAAM,QACN,QAAS,CACP,KAAM,SAAU3gC,EAAQA,EAAM,KAAO,gBACrC,QAAS,YAAaA,EAAQA,EAAM,QAAU,UAC9C,OAAQ,WAAYA,EAAQA,EAAM,OAAS,OAC3C,OAAQ,WAAYA,EAAQA,EAAM,OAAS,OAC3C,aAAc,YAAaA,EAAQA,EAAM,QAAU,MAAA,CACrD,CACM,EACR2gC,EAAW,MAAA,CACb,CAAC,CACL,CAAA,CACD,CACH,CAWO,MAAME,GAAsB,CACjCJ,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,YAAY,EASrC,SAAeK,GAEbC,EAA8C,QAAAl4B,EAAA,kCAC9C,KAAM,CAACm4B,EAAcC,CAAc,EAAIF,EAAO,IAAA,EACxCG,EAAe,MAAMF,EAAa,UAAA,EAAY,KAAA,EAEpD,GACEE,EAAa,MACb,CAACA,EAAa,OACbA,EAAa,MAAM,OAAS,WAAW9/B,EAAA8/B,EAAa,MAAM,UAAnB,MAAA9/B,EAA4B,QAEpE,OAAO,IAAI,SAAS,KAAK,UAAU8/B,EAAa,KAAK,EAAG,CACtD,SACE3/B,EAAA2/B,EAAa,QAAb,YAAA3/B,EAAoB,QAAS,UACxByF,GAAAC,EAAAi6B,EAAa,MAAM,UAAnB,YAAAj6B,EAA4B,SAA5B,KAAAD,EACD,IACN,QAAS,CACP,eAAgB,kBAAA,CAClB,CACD,EAGH,MAAMm6B,EAAU,IAAI,YACdC,EAAYH,EAAe,YAC/B,IAAI,gBAAgB,CAClB,UAAU5kC,EAAOskC,EAAY,CAC3B,MAAMU,EAAY,UAAUhlC,EAAM,IAAI;AAAA,QAAW,KAAK,UACpDA,CAAA,CACD;AAAA;AAAA,EACDskC,EAAW,QAAQQ,EAAQ,OAAOE,CAAS,CAAC,CAC9C,CAAA,CACD,CAAA,EAGH,OAAO,IAAI,SAASD,EAAW,CAC7B,OAAQ,IACR,QAAS,CACP,eAAgB,mCAChB,WAAY,aACZ,gBAAiB,UAAA,CACnB,CACD,CACH,GAWO,MAAME,GAAmC,CAC9Cb,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASF,GAAoBJ,EAAO7/B,CAAM,EAChD,OAAOkgC,GAA0BC,CAAM,CACzC,GAWaQ,GAA8B,CACzCd,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,uBAAuB,EAYnCe,GAA2C,CACtDf,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASQ,GAA4Bd,EAAO7/B,CAAM,EACxD,OAAOkgC,GAA0BC,CAAM,CACzC,GAaaU,GAA6B,CACxChB,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,sBAAsB,EAYlCiB,GAA0C,CACrDjB,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASU,GAA2BhB,EAAO7/B,CAAM,EACvD,OAAOkgC,GAA0BC,CAAM,CACzC,GAWaY,GAA8B,CACzClB,EACA7/B,IAMO4/B,GAQLC,EAAO7/B,EAAQ6/B,EAAM,qBAAqB,EAYjCmB,GAA2C,CACtDnB,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASY,GAA4BlB,EAAO7/B,CAAM,EACxD,OAAOkgC,GAA0BC,CAAM,CACzC,GAgBac,GAAwB,CACnCpB,EACA7/B,IAEO4/B,GAILC,EAAO7/B,EAAQ6/B,EAAM,iBAAiB,EAa7BqB,GAAqC,CAChDrB,EACA7/B,IACsBiI,EAAA,sBACtB,MAAMk4B,EAASc,GAAsBpB,EAAO7/B,CAAM,EAClD,OAAOkgC,GAA0BC,CAAM,CACzC","x_google_ignoreList":[0,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,22,23,24,25,26,27,28,29]}